Menu

Question Discussion & Solution

MCQ

Q.

The minimum number of edges required to create a cyclic graph of n vertices is

A

n

B

n+1

C

n-1

D

2n

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 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

MCQ

2.

The maximum degree of any vertex in a simple graph with n vertices is

A

n

B

n+1

C

2n

D

n

Discussion

MCQ

3.

The number of edges in a regular graph of degree d and n vertices is

A

nd

B

n+d

C

nd/2

D

maximum of n,d

Discussion

MCQ

4.

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

Discussion

MCQ

5.

Other name for directed graph is ..........

A

Direct graph

B

Bigraph

C

Dir-graph

D

Digraph

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