This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: . Use the breadthﬁrst search algorithm to determine a shortest path (Le.r the minimum number of nodes) from A to E in the following graph. Use alphabetical order when there is a
hoice for a predecessor. which of the following is the shortest path from A to E? A {Points : 1) © ABCE © ACE ® ADE © ABCDE © None of the above '. Use the breadthﬁrst search algorithm to determine a shortest path (Le.r the minimum number of nodes) from A to E in the following graph. Use alphabetical order when there is a
hoice for a predecessor. Which of the following is the shortest path from A to E? H
A E {Points : 1) 6 None of the above 3. Use the breadthﬁrst search algorithm to determine a shortest path from A to F (i.e., the minimum number of nodes) in the following graph. Use alphabetical order when there is a
choice for a predecessor. which of the following is the shortest path from A to F? H D (Points: 1) © AHBGF ® APCF © AHDEF © APCWF ‘9 None of the above 1. Use the Dijkstra's algorithm to determine the shortest path {i.e.r the minimum path weight) from A to E in the following weighted graph. which of the following is the shortest path
from A to E? © ADE © ACE ® ABCDE © ABCE © None of the above 5. Use the Dijkstra's algorithm to determine the shortest path {i.e., the minimum path weight) from A to E in the following weighted graph. which of the following is the shortest path
from A to E? A G AHGCE © ADBCE ® ADBG CE © ADHBG CE (’3 None of the above 6. Use the Dijkstra's algorithm to determine the shortest path (i.e., the minimum path weight) from A to F in the following weighted graph. which of the foliowing is the shortest path
from A to F? P G (Points: 1) © APGEF © AHBCF © AHDCGEF ® AHDCF (’3 None of the above 7. Using the theory of Graph Coloring to color the vertices, what is the chromatic number of the following graph? ©1
©2
®3
©4
© None of the above 3. Using the theory of Graph Coloring to color the vertices, what is the chromatic number of the following graph? ©1
©2
©3
®4
© None of the above 9. Using the theory of Graph Coloring to color the regions, what is the chromatic number of the following graph? ©1
® 2
©3
©4
© None of the above 10. Using the theoryof Graph Cooring to War tm vertioes ina graph. what does it mean ﬁll a graph to have chmrnatic numbel 1? (Points : 1]
©Tmrearemverticesinthegraph. @Tmrearemedgesmthegraph. Were isexadtlyune edgeintmgraph.
© None of the above 11. Given the following directed graph, what are the indegree and the outdegree of A? '\ i.
.,.
5 © indegree = 1r outdegree = 3
® indegree = 3, outdegree = 1
© indegree = 4r outdegree = 1
© indegree = 3, outdegree = 2
© None of the above 12. It a directed graph has 3’ edges, what is the sum of the indegrees of all the vertioes in the graph? (Points : 1)
© 4
© 5
© 5
® ?
© None of the above 13. It is possible to ﬁnd a directed Hamiltonian path in the following graph. E
® True © False 14. It is pnssible to ﬁnd a directed Euler circuit in the tnlicwing graph. 1:
'8' True '3' False 15. Susan has a fondness for chocolate desserts, in particuiar, pudding, pie, and ice cream. Her preference is far pie ever pudding, ice cream ever pie, and ice cream ever pudding.
Which chccniate dessert does Susan iike the best? {Points : 1] '8' Pie '3' Ice Cream 15 Pudding 15 None of the above ...
View
Full Document
 Fall '08
 GREEN
 Math

Click to edit the document details