Menu

Question Discussion & Solution

MCQ

Q.

Prims algorithm is based on _____________ method

A

Divide and conquer method

B

Dynamic programming

C

Greedy method

D

Branch and bound

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 method of traversal does not use stack to hold nodes that are waiting to be processed?

A

Dept First

B

D-search

C

Breadth first

D

Back-tracking

Discussion

MCQ

2.

And Inverter Graph is a type of __________

A

Multigraph

B

Cyclic Graph

C

Directed Acyclic Graph

D

Directed Acyclic Word Graph

Discussion

MCQ

3.

Incidence matrix and Adjacency matrix of a graph will always have same dimensions?

A

1

C

May be

D

Can't say

Discussion

MCQ

4.

If every node u in G is adjacent to every other node v in G, A graph is said to be

A

isolated

B

complete

C

finite

D

strongly connected

Discussion

MCQ

5.

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

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