CS502 Quiz No.4 File 4

The ________ given by DFS allow us to determine whether the graph contains any cycles.

Select correct option:

 Order

 Time stamps              (Correct)

 BFS traversing

 Topological sort

In Prim's algorithm, at any time, the subset of edges A forms a single _________.

Select correct option:

 Vertex

 Forest

 Tree               (Correct)

 Graph

In Generic approach determining of Greedy MST, we maintain a subset A of __________ .

Select correct option:

 Edges             (Correct)

 Vertices

 Cycles

 Paths

In Kruskal's algorithm, the next ________ is not added to viable set A, if its adding induce a/an cycle.

Select correct option:

 Vertex

 Edge               (Correct)

 Cycle

 Tree

In ________ algorithm, at any time, the subset of edges A forms a single tree.

Select correct option:

 Kruskal's

 Prim's             (Correct)

 Both

 None

Digraphs are not used in communication and transportation networks.

Select correct option:

 True

 False              (Correct)

In Kruskal's algorithm, at any time, the subset of edges A forms a single tree.

Select correct option:

 True

 False              (Correct)