Menu

Question Discussion & Solution

MCQ

Q.

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

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.

Which of the following is useful in traversing a given graph by breadth first search?

A

set

B

List

C

stacks

D

Queue

Discussion

MCQ

2.

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

A

Direct graph

B

Bigraph

C

Dir-graph

D

Digraph

Discussion

MCQ

3.

All Graphs have unique representation on paper.

A

1

C

May be

D

Can't say

Discussion

MCQ

4.

In a Binary Decision Diagram, how many types of terminal exists?

A

1

B

2

C

3

D

4

Discussion

MCQ

5.

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

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