Question 1:

Question 2:

Question 3:

Question 4:

Question 5:

Question 6:

Question 7:

Question 8:

Find the sequence in which the vertices of the graph below are visited when a depth-first search is performed starting from vertex 2. Assuming that the vertices are stored in increasing order in the adjacency list. 3 5 Select one: a. 2, 1, 3, 4, 5 b. none of the sequences shown are correct 2, 1, 3, 5,4 C. d. 2, 4, 5, 3, 1 In the binary search tree below, after we insert node 60, what is the order that the nodes are traversed if we traverse the resulting binary tree using Preorder traversal? 50 45 76 80 55 83 54 Select one: a. 50, 45, 76, 55, 54, 80, 60, 83 b. 50, 45, 76, 55, 54, 60, 80, 83 50, 45, 76, 55, 60, 54, 80, 83 d. 50, 45, 60, 76, 55, 54, 80, 83 C. Clear my choice What is the order that the nodes are traversed if we traverse the following binary tree using Inorder traversal? 50 65 45 55 75 Select one: a. 45, 50, 55, 65, 75 b. 50, 45, 65, 55, 75 50, 45, 65, 75, 55 d. 45, 55, 75, 65, 50 Clear my choice In the binary search tree below, after we delete node 75, what is the order that the nodes are traversed if we traverse the resulting binary tree using Preorder traversal? 50 45 75 55 80 76 83 Select one: a. 50, 45, 55, 80, 83,76 b. 50, 45, 55, 80, 76, 83 C. 50, 45, 76, 55, 80, 83 d. 50, 45, 55, 76, 80, 83 Clear my choice What is the order that the nodes are traversed if we traverse the following binary tree using Preorder traversal? 50 65 45 55 75 Select one: a. 50, 45, 65, 55, 75 b. 45, 55, 75, 65, 50 C. 45, 50, 55, 65, 75 O d. 50, 45, 65, 75, 55 In using Dijkstra's algorithm to find shortest paths in the graph below from vertex A, after we have the shortest paths, (A), (A, D), (A, D, C) and (A, D, C, F), what is the next shortest path to be added? 9 B 6 G 9 4 7 A F 0 3 2 D E 4 Select one: a. (A, D, E) b. (A, D, C, G) O c. (A, B) O d. (A, D, C, F, E) Find the sequence in which the vertices of the graph below are visited when a breadth-first search is performed starting from vertex 2. 4 3 5 Select one: a. 2, 1, 3, 4, 5 b. none of the sequences shwon are correct C. 2, 1, 3, 5, 4 d. 2, 3, 1, 4, 5 Show the sequence of edges that are chosen when Prim's algorithm is used to find a minimum spanning tree for the graph given below, starting at vertex A. 7 D E 2 6 F 4 3 3 A B 2 Select one: a. AB, AF, AC, CD, BE b. AB, CD, AF, BC, BE AB, AF, BC, BE, CD O d. AB, AF, BC, CD, BE C