Menu

Question Discussion & Solution

MCQ

Q.

If locality is a concern, you can use ................ to traverse the graph.

A

Breadth First Search

B

Depth First Search

C

Either BFS or DFS

D

None of these

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

A

A graph may contain no edges and many vertices

B

A graph may contain many edges and no vertices

C

A graph may contain no edges and no vertices

D

None of the mentioned

Discussion

MCQ

2.

How many nodes are required to create a Binary Decision Tree having 4 variables?

A

2^4

B

2^(4-1)

C

2^5

D

2^(5-1)

Discussion

MCQ

3.

Dijkstra

A

1

C

May be

D

Can't say

Discussion

MCQ

4.

All trees with n vertices consists of n-1 edges.

A

1

C

May be

D

Can't say

Discussion

MCQ

5.

Minimum number of spanning tree in a connected graph is

A

n

B

n(n - 1)

C

1

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