Menu

Question Discussion & Solution

MCQ

Q.

What is the number of edges present in a complete graph having n vertices?

A

(n*(n+1))/2

B

(n*(n-1))/2

C

n

D

Information given is insufficient

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 topological sorting of any DAG can be done in ________ time.

A

cubic

B

quadratic

C

linear

D

logarithmic

Discussion

MCQ

2.

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

A

Direct graph

B

Bigraph

C

Dir-graph

D

Digraph

Discussion

MCQ

3.

Which method of traversal does not use stack to hold nodes that are waiting to be processed?

A

Dept First

B

D-search

C

Breadth first

D

Back-tracking

Discussion

MCQ

4.

The minimum number of colors needed to color a graph having n (>3) vertices and 2 edges is

A

1

B

2

C

3

D

4

Discussion

MCQ

5.

In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.

A

1

C

May be

D

Can't say

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