CS502 Latest Quiz

Question # 1 of 10 ( Start time: 11:09:54 AM ) Total Marks: 1 What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm? Select correct option: log (V) V.V E.E log (E)

Question # 2 of 10 ( Start time: 11:11:24 AM ) Total Marks: 1 A digraph is strongly connected under what condition? Select correct option: A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v . pair of vertices u, v e V, u can reach v and vice versa. A digraph is strongly connected if for at least one pair of vertex u, v e V,  u can reach v and vice versa. pair  of vertices u, v e V, u can reach v and vice versa.

Question # 3 of 10 ( Start time: 11:13:00 AM ) Total Marks: 1 What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm? Select correct option: O (log E) ? (V) ? (V+E) O (log V)

Question # 4 of 10 ( Start time: 11:14:35 AM ) Total Marks: 1 The relationship between number of back edges and number of cycles in DFS is, Select correct option: Both are equal Back edges are half of cycles Back edges are one quarter of cycles There is no relationship between no. of edges and cycles

Question # 5 of 10 ( Start time: 11:16:10 AM ) Total Marks: 1 You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T.? Select correct option: ? (V + E) ? (V E) ? (V) ? (V^2)

Question # 6 of 10 ( Start time: 11:17:24 AM ) Total Marks: 1 What algorithm technique is used in the implementation of Kruskal solution for the MST? Select correct option: Greedy Technique Divide-and-Conquer Technique Dynamic Programming Technique algorithm combines more than one of the above techniques

Question # 7 of 10 ( Start time: 11:18:17 AM ) Total Marks: 1 You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T ? Select correct option: ? (V) ? (V+E) V E

Question # 8 of 10 ( Start time: 11:18:44 AM ) Total Marks: 1 Which is true statement in the following. Select correct option: Kruskal algorithm is multiple source technique for finding MST. of a graph, time complexity of this algorithm is O(EV) Both of above

Question # 9 of 10 ( Start time: 11:20:18 AM ) Total Marks: 1 There is relationship between number of back edges and number of cycles in DFS Select correct option: Both are equal. Cycles are half of back edges. Cycles are one fourth of back edges. There is no relationship between back edges and number of cycles.

Question # 10 of 10 ( Start time: 11:21:10 AM ) Total Marks: 1 Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree edge) when the graph has relatively few edges. Select correct option: True False

Posted in: General