|
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 1 of 10 ( Start time: 06:51:48 PM ) 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.
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 2 of 10 ( Start time: 06:53:14 PM ) 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
E
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 3 of 10 ( Start time: 06:54:27 PM ) 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)
Quiz Start Time: 06:51 PM
Time Left 86
sec(s)
Question # 4 of 10 ( Start time: 06:55:25 PM ) 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)
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 5 of 10 ( Start time: 06:56:52 PM ) Total Marks: 1
Dijkstra’s algorithm :
Select correct option:
Has greedy approach to find all shortest paths
Has both greedy and Dynamic approach to find all shortest paths
Has greedy approach to compute single source shortest paths to all
other vertices
Has both greedy and dynamic approach to compute single source shortest paths to
all other vertices.
Quiz Start Time: 06:51 PM
Time Left 87
sec(s)
Question # 6 of 10 ( Start time: 06:58:05 PM ) 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
The algorithm combines more than one of the above techniques
Quiz Start Time: 06:51 PM
Time Left 82
sec(s)
Question # 7 of 10 ( Start time: 06:59:34 PM ) 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)
Quiz Start Time: 06:51 PM
Time Left 85
sec(s)
Question # 8 of 10 ( Start time: 07:00:32 PM ) Total Marks: 1
Which is true statement in the following.
Select correct option:
Kruskal algorithm is multiple source technique for finding MST.
Kruskal’s algorithm is used to find minimum spanning tree of a graph, time
complexity of this algorithm is O(EV)
Both of above
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's
(choose best Tree edge) when the graph has relatively few edges.
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 9 of 10 ( Start time: 07:01:44 PM ) 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
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 10 of 10 ( Start time: 07:03:04 PM ) 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
Quiz Start Time: 07:07 PM
Time Left 88
sec(s)
Question # 4 of 10 ( Start time: 07:09:45 PM ) 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) http://ping.fm/IZ9Nq
Time Left 88
sec(s)
Question # 1 of 10 ( Start time: 06:51:48 PM ) 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.
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 2 of 10 ( Start time: 06:53:14 PM ) 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
E
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 3 of 10 ( Start time: 06:54:27 PM ) 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)
Quiz Start Time: 06:51 PM
Time Left 86
sec(s)
Question # 4 of 10 ( Start time: 06:55:25 PM ) 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)
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 5 of 10 ( Start time: 06:56:52 PM ) Total Marks: 1
Dijkstra’s algorithm :
Select correct option:
Has greedy approach to find all shortest paths
Has both greedy and Dynamic approach to find all shortest paths
Has greedy approach to compute single source shortest paths to all
other vertices
Has both greedy and dynamic approach to compute single source shortest paths to
all other vertices.
Quiz Start Time: 06:51 PM
Time Left 87
sec(s)
Question # 6 of 10 ( Start time: 06:58:05 PM ) 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
The algorithm combines more than one of the above techniques
Quiz Start Time: 06:51 PM
Time Left 82
sec(s)
Question # 7 of 10 ( Start time: 06:59:34 PM ) 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)
Quiz Start Time: 06:51 PM
Time Left 85
sec(s)
Question # 8 of 10 ( Start time: 07:00:32 PM ) Total Marks: 1
Which is true statement in the following.
Select correct option:
Kruskal algorithm is multiple source technique for finding MST.
Kruskal’s algorithm is used to find minimum spanning tree of a graph, time
complexity of this algorithm is O(EV)
Both of above
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's
(choose best Tree edge) when the graph has relatively few edges.
Quiz Start Time: 06:51 PM
Time Left 89
sec(s)
Question # 9 of 10 ( Start time: 07:01:44 PM ) 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
Quiz Start Time: 06:51 PM
Time Left 88
sec(s)
Question # 10 of 10 ( Start time: 07:03:04 PM ) 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
Quiz Start Time: 07:07 PM
Time Left 88
sec(s)
Question # 4 of 10 ( Start time: 07:09:45 PM ) 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) http://ping.fm/IZ9Nq