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.

Maximum degree of any vertex in a simple graph of vertices n is

A

2n - 1

B

n

C

n + 1

D

n - 1

Discussion

MCQ

2.

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

3.

Prims algorithm is based on _____________ method

A

Divide and conquer method

B

Dynamic programming

C

Greedy method

D

Branch and bound

Discussion

MCQ

4.

A graph with all vertices having equal degree is known as a __________

A

Multi Graph

B

Regular Graph

C

Simple Graph

D

Complete Graph

Discussion

MCQ

5.

The number of edges in a simple, n-vertex, complete graph is

A

n*(n-2)

B

n*(n-1)

C

n*(n-1)/2

D

n*(n-1)*(n-2)

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