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.

Every Directed Acyclic Graph has at least one sink vertex.

A

1

C

May be

D

Can't say

Discussion

MCQ

2.

All paths and cyclic graphs are bipartite graphs.

A

1

C

May be

D

Can't say

Discussion

MCQ

3.

Maximum degree of any vertex in a simple graph of vertices n is

A

2n - 1

B

n

C

n + 1

D

n - 1

Discussion

MCQ

4.

What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?

A

O(E*E)

B

O(V*V)

C

O(E)

D

O(V)

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