WorksheetsGraph Theory Data Structures
Total questions: 17
Worksheet time: 9mins
Which set represents the vertices of the graph?
{1,2}, {2,3}. {2,4}, {4,5}, {4,6}
{1, 2, 3, 4, 5, 6,}
{1, 2, 3, 4, 5, 6, 7}
{1,2}, {2,3}. {2,4}, {4,5}, {4,6}, {6,7}
What is the degree of vertex 4?
3
4
5
7
Which two vertices are adjacent vertices?
5 is adjacent to 6
3 is adjacent to 6
4 is adjacent to 1
3 is adjacent to 2
The graph represents the following vocabulary term.
Cycle
Path
Complete Graph
Complete Bipartite Graph
What is the weight of the shortest path from A to F?
5
7
9
11
Which vertices are adjacent to E?
B and C
B, C, D, and A
B
A, B, C, D, F, G
Which is an example of a disconnected graph?
None are disconnected graphs
Which of the following is true?
A graph may contain no edges and many vertices
A graph may contain many edges and no vertices
A graph may contain no edges and no vertices
Which of the following is not a style of graph traversal in computing?
Breadth-First
Depth-First
Height-First
Graph traversal is used to find the ______ route to visit all nodes in a network
Shortest
Best
Longest
Most secure
Which method of graph traversal makes use of a stack?
Depth-First
Breadth-First
Which method of graph traversal makes use of a queue?
Depth-First
Breadth-First
Which order of traversal is correct using depth-first?
A B C G D E F
A B D C E C G
Which of the following beginnings to a graph traversal would not be correct for depth-first?
A B C G
A D F
A E D F
A B D C
Which order of traversal is correct using breadth-first?
A B D E C F G
A B C G D E F
A has been visited what happens next
Visit B
Visit D
Visit E
Visit C
With breadth-first traversal, which node will be visited next?
C
F
G
