Graphs Questions

MCQ bookmark_border

141.

And Inverter Graph is a type of __________

A

Multigraph

B

Cyclic Graph

C

Directed Acyclic Graph

D

Directed Acyclic Word Graph

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

142.

The And Inverter Graph representation of a Boolean function is more efficient than the Binary Decision Diagram.

A

1

C

May be

D

Can't say

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

143.

Which of the following logical operation can be implemented by polynomial time graph manipulation algorithms using Binary Decision Diagrams?

A

Conjunction

B

Disjunction

C

Negation

D

All of the mentioned

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

144.

Time Complexity of DFS is? (V

A

O(V + E)

B

O(V)

C

O(E)

D

None of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

145.

The Depth First Search traversal of a graph will result into?

A

Linked List

B

Tree

C

Graph with back edges

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

146.

A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?

A

Depth First Search

B

Breadth First Search

C

Trim

D

None of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

147.

What can be the applications of Depth First Search?

A

For generating topological sort of a graph

B

For generating Strongly Connected Components of a directed graph

C

Detecting cycles in the graph

D

All of the mentioned

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

148.

When the Depth First Search of a graph is unique?

A

When the graph is a Binary Tree

B

When the graph is a Linked List

C

When the graph is a n-ary Tree

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

149.

Regarding implementation of Depth First Search using stacks, what is the maximum distance between two nodes present in the stack? (considering each edge length 1)

A

Can be anything

C

At most 1

D

Insufficient Information

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

150.

In Depth First Search, how many times a node is visited?

A

Once

B

Twice

C

Equivalent to number of indegree of the node

D

None of the mentioned

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion