Menu

Question Discussion & Solution

MCQ

Q.

Breadth first search __________

A

Scans each incident node along with its children.

B

Scans all incident edges before moving to other node.

C

Issame as backtracking

D

Scans all the nodes in random order.

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.

A connected graph T without any cycles is called

A

a tree graph

B

free tree

C

a tree

D

All of above

Discussion

MCQ

2.

A graph with all vertices having equal degree is known as a __________

A

Multi Graph

B

Regular Graph

C

Simple Graph

D

Complete Graph

Discussion

MCQ

3.

Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of __________

A

O(V*V)

B

O(V*V*V)

C

O(E*V)

D

O(E*E)

Discussion

MCQ

4.

The Depth First Search traversal of a graph will result into?

A

Linked List

B

Tree

C

Graph with back edges

D

None of the mentioned

Discussion

MCQ

5.

What is the maximum number of edges in a bipartite graph having 10 vertices?

A

24

B

21

C

25

D

16

Discussion

More Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

76 MCQs

Asymptotic Notation

38 MCQs

Divide and Conquer Strategy

18 MCQs

Sorting

14 MCQs

Linear Time Sorting

8 MCQs

Dynamic Programming

18 MCQs

Greedy Algorithms

10 MCQs

Backtracking Algorithms

13 MCQs

Graphs

18 MCQs

Complexity Theory

11 MCQs