Menu

Question Discussion & Solution

MCQ

Q.

Find the odd out

A

Prim's Minimal Spanning Tree Algorithm

B

Kruskal's Minimal Spanning Tree Algorithm

C

Floyd-Warshall's All pair shortest path Algorithm

D

Dijkstra's Minimal Spanning Tree Algorithm

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 Graph Structured Stack is a _____________

A

Undirected Graph

B

Directed Graph

C

Directed Acyclic Graph

D

Regular Graph

Discussion

MCQ

2.

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

Discussion

MCQ

3.

Two or more And Inverter Graphs can represent same function.

A

1

C

May be

D

Can't say

Discussion

MCQ

4.

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

Discussion

MCQ

5.

The spanning tree of connected graph with 10 vertices contains ..............

A

9 edges

B

11 edges

C

10 edges

D

9 vertices

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