Menu

Question Discussion & Solution

MCQ

Q.

A graph with n vertices will definitely have a parallel edge or self loop if the total number of edges are

A

more than n

B

more than n

C

more than (n+1)/2

D

more than n(n-1)/2

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.

Complete the given snippet of code for the adjacency list representation of a weighted directed graph.

A

vertex, vertex

B

neighbor, vertex

C

neighbor, neighbor

D

vertex, neighbor

Discussion

MCQ

2.

In a graph if E=(u,v) means ......

A

u is adjacent to v but v is not adjacent to u

B

e begins at u and ends at v

C

u is processor and v is successor

D

both b and c

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.

Adjacency matrix of all graphs are symmetric.

B

1

C

May be

D

Can't say

Discussion

MCQ

5.

All paths and cyclic graphs are bipartite graphs.

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