CS502 Quiz No.4 File 1

Question # 1 of 10 ( Start time: 08:34:15 PM )  Total Marks: 1
According to parenthesis lemma, vertex u is unrelated to v vertex if and only if d[u],f[u]] and [d[v],f[v]] are disjoint.
Select correct option:
 True               (Correct)
 False


Question # 2 of 10 ( Start time: 08:35:47 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)


Question # 3 of 10 ( Start time: 08:37:05 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)        (Correct)
 ? (V E)
 ? (V)
 ? (V^2)



Question # 4 of 10 ( Start time: 08:38:13 PM )  Total Marks: 1
Kruskal’s algorithm works by adding vertices in increasing order of weight (lightest edge first).
Select correct option:
 True               (Correct)
 False


Question # 5 of 10 ( Start time: 08:38:38 PM )  Total Marks: 1
In Prim's algorithm, we will make use of priority _______.
Select correct option:
 Stack
 Queue                        (Correct)
 Array
 Graph

Question # 6 of 10 ( Start time: 08:39:03 PM )  Total Marks: 1
If a vertex v is a descendent of vertex u, then v's start-finish interval is contained within u's start-finish interval.
Select correct option:
 True               (Correct)
 False

Question # 7 of 10 ( Start time: 08:39:53 PM )  Total Marks: 1
Computing the strongly connected components of a digraph is a generalization of the problem to determine whether a digraph is strongly connected or not.
Select correct option:
 True               (Correct)
 False

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

Question # 9 of 10 ( Start time: 08:41:41 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 # 10 of 10 ( Start time: 08:42:10 PM )  Total Marks: 1
By breaking any edge on a cycle created in free tree, the free _________ is restored.
Select correct option:
 Edge
 Tree               (Correct)
 Cycle