Menu

Question Discussion & Solution

MCQ

Q.

Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)

A

O(V + E)

B

O(V)

C

O(E)

D

None of the mentioned

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.

Time complexity to find if there is an edge between 2 particular vertices is _________

A

O(V)

B

O(E)

C

O(1)

D

O(V+E)

Discussion

MCQ

2.

How many edges are there in a Hamiltonian cycle if the edge cost is

A

c

B

cn

C

n

D

2c

Discussion

MCQ

3.

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

4.

If a Graph Structured Stack contains {1,2,3,4} {1,5,3,4} {1,6,7,4} and {8,9,7,4}, what would be the source and sink vertices of the DAC?

A

Source

B

Source

C

Source

D

None of the Mentioned

Discussion

MCQ

5.

Prims algorithm is based on _____________ method

A

Divide and conquer method

B

Dynamic programming

C

Greedy method

D

Branch and bound

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