CS502 Quiz No.4 File 2

Question # 1 of 10 ( Start time: 08:54:16 PM ) Total Marks: 1
In strong components algorithm, first of all DFS is run for computing finish times of vertices.
Select correct option:
true                 (Correct)
false

Question # 2 of 10 ( Start time: 08:54:50 PM ) Total Marks: 1
For undirected graph, there is no distinction between forward and back edges.
Select correct option:
true                 (Correct)
false

Question # 3 of 10 ( Start time: 08:55:15 PM ) Total Marks: 1
Cross edge is :
Select correct option:
 (u, v) where u and v are not ancestor of one another
 (u, v) where u is ancesstor of v and v is not  descendent of u.
 (u, v) where u and v are not ancestor or descendent of one another         (Correct)
 (u, v) where u and v are either ancestor or descendent of one another.

Question # 4 of 10 ( Start time: 08:56:24 PM ) Total Marks: 1
There are no ________ edges in undirected graph.
Select correct option:
Forward
Back
Cross
Both forward and back                      (Correct)

Question # 5 of 10 ( Start time: 08:57:06 PM ) Total Marks: 1
Adding any edge to a free tree creates a unique ______ .
Select correct option:
Vertex
cycle                (Correct)
Edge
Strong component

Question # 6 of 10 ( Start time: 08:57:34 PM ) Total Marks: 1
Networks are complete in the sense that it is possible from any location in the network to reach any other location in the digraph.
Select correct option:
True                (Correct)
False


Question # 7 of 10 ( Start time: 08:57:55 PM ) Total Marks: 1
Runtime complexity of Prim's algorithm is _______.
Select correct option:
V log V
E log V                        (Correct)
log V
None of the above

In Prim's algorithm, we start with the _______ vertex r; it can be any vertex.
Select correct option:
First
 Leaf
root                 (Correct)
Mid

Question # 9 of 10 ( Start time: 08:59:38 PM ) Total Marks: 1
Adding any edge to a free tree creates a unique cycle.
Select correct option:
true                 (Correct)
false

Question # 10 of 10 ( Start time: 09:00:01 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                (Correct)