Menu

Question Discussion & Solution

MCQ

Q.

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

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.

With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?

A

(V*(V-1))/2

B

(V*(V+1))/2

C

(V+1)C2

D

(V-1)C2

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.

Minimum number of spanning tree in a connected graph is

A

n

B

n(n - 1)

C

1

Discussion

MCQ

4.

To create an adjacency list C++

A

1

C

May be

D

Can't say

Discussion

MCQ

5.

A directed graph is

A

Weakly connected

B

Strongly Connected

C

Tightly Connected

D

Linearly Connected

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