CMSC 132 Quiz 5 Worksheet
The fifth quiz of the course will be on Monday, Apr 27 during your lab (discussion) session. The following list
provides additional information about the quiz:
The quiz will be a written quiz (no computer).
Closed book, closed notes quiz.
Answers must be neat and legible. We recommend that you use pencil and eraser.
The following exercises cover the material to be included in this quiz. Solutions to these exercises will not be
provided, but you are welcome to discuss your solutions with TAs and instructors.
Graph Problem I
Use the following graph to answer the questions below.
1. Give a possible order in which the nodes of this graph could be visited in performing a Breadth
First Search (BFS) starting at vertex F. Pick nodes to visit using alphabetical order (when multiple
choices are possible).
2. Give a possible order in which the nodes of this graph could be visited in performing a Depth First
Search (DFS) starting at vertex F. Pick nodes to visit using alphabetical order (when multiple
choices are possible).
3. Apply Dijkstra’s algorithm using A as the starting (source) node. Indicate the cost and predecessor
for each node in the graph after processing 2 nodes ( A and another node). Remember to update
the appropriate table entries after processing the 2nd node (after it has been added to the set of
processed nodes). An empty table entry implies an infinite cost or no predecessor. Note: do not
simply fill in the entire table with the final costs and predecessors instead of showing the table at
the first two steps.
After processing 1 node:
Node
A
B
C
D
E
F
Cost
Predecessor
A
D
C
B
E
3
2
4
6
8
3
9
F
1
