Menu

Question Discussion & Solution

MCQ

Q.

If there are more than 1 topological sorting of a DAG is possible, which of the following is true.

A

Many Hamiltonian paths are possible

B

No Hamiltonian path is possible

C

Exactly 1 Hamiltonian path is possible

D

Given information is insufficient to comment anything

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

. Breadth first search uses __________ as an auxiliary structure to hold nodes for future processing.

A

Stack

B

Linked list

C

Graph

D

Queue

Discussion

MCQ

2.

Prims algorithm is based on _____________ method

A

Divide and conquer method

B

Dynamic programming

C

Greedy method

D

Branch and bound

Discussion

MCQ

3.

Which of the following algorithms solves the all-pair shortest path problem?

A

Floyd's algorithm

B

Prim's algorithm

C

Dijkstra's algorithm

D

Warshall's algorithm

Discussion

MCQ

4.

What would be the value of the distance matrix, after the execution of the given code?

A

a

B

b

C

c

D

d

Discussion

MCQ

5.

Every Binary Decision Diagram is also a Propositional Directed Acyclic Graph.

A

1

C

May be

D

Can't say

Discussion

More Data Structure Topics

Data Structure Basics

128 MCQs

Abstract data types

37 MCQs

Arrays

134 MCQs

Lists

166 MCQs

Stacks

165 MCQs

Queues

61 MCQs

Trees

133 MCQs

Binary Trees

120 MCQs

B Trees

8 MCQs

Heaps

36 MCQs

Hash based structures

7 MCQs

Graphs

157 MCQs

Mixed

10 MCQs