CS502 QUIZ NO 2 SOLVED || 100% VERIFIED BY ADMIN || VURANK

CS502 QUIZ NO 2 SOLVED 100% VERIFIED BY ADMIN (FINAL TERM SYLLABUS)

Q1: According to parenthesis lemma, vertex u is a descendent of v vertex if and only if;

A) [d[u], f[u]] [d[v], f[v]] (100% Sure)

B) [d[u], f[u]] [d[v], f[v]]

C) Unrelated

D) Disjoint

Q2: Breadth-first search begins at a root node and inspects all the nodes except neighboring ones.

A) True

B) False (100% Sure)

Q3: The __________ given by DFS allow us to determine whether the graph contains any cycles.

A) Order

B) Time stamps (100% Sure)

C) BFS traversing

D) Topological sort

Q4: Forward edge is:

A) (u, v) where u is a proper descendent of v in the tree

B) (u, v) where v is a proper descendent of u in the tree (100% Sure)

C) (u, v) where v is a proper ancesstor of u in the tree

D) (u, v) where u is a proper ancesstor of v in the tree

Q5: For traversing graphs, Breadth-first search can be visualized as a wave front propagating inward toward root (or source) node.

A) True

B) False (100% Sure)

Q6: If u and v are mutually reachable in G, then in the graph formed by reversing all the edges, these vertices are not reachable.

A) True

B) False (100% Sure)

Q7: The time stamps given by DFS do not allow us to determine whether the graph contains any cycles.

A) True

B) False (100% Sure)

Q8: Equivalance relation partitions the vertices into __________ classes of mutually reachable vertices and these are the strong components.

A) Variance

B) Equivalence (100% Sure)

C) None equivalence

D) Non classes

Q9: For graph traversal, Breadth-first search strategy __________.

A) is always recursive

B) Cannot be recursive

C) Cannot be non-recursive

D) Can be both recursive and non-recursive (100% Sure)

Q10: Networks are complete in the sense that it is possible from any location in the network to reach any other location in the diagraph.

A) True

B) False (100% Sure)