Menu

Question Discussion & Solution

MCQ

Q.

For any two different vertices u and v of an Acyclic Directed Graph if v is reachable from u, u is also reachable from v?

A

1

C

May be

D

Can't say

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.

The number of elements in the adjacency matrix of a graph having 7 vertices is __________

A

7

B

14

C

36

D

49

Discussion

MCQ

2.

Minimum number of spanning tree in a connected graph is

A

n

B

n(n - 1)

C

1

Discussion

MCQ

3.

Every Directed Acyclic Graph has at least one sink vertex.

A

1

C

May be

D

Can't say

Discussion

MCQ

4.

For an undirected graph with n vertices and e edges, the sum of the degree of each vertex is equal to

A

2n

B

(2n-1)/2

C

2e

D

4n

Discussion

MCQ

5.

The data structure required for Breadth First Traversal on a graph is

A

queue

B

stack

C

array

D

tree

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