Menu

Question Discussion & Solution

MCQ

Q.

Graph Coloring is which type of algorithm design strategy

A

Backtacking

B

Greedy

C

Branch and Bound

D

Dynamic programming

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 is not return optimal solution form the following

A

Dynamic programming

B

Backtracking

C

Branch and bound

D

Greedy method

Discussion

MCQ

2.

Find the odd one out from the following categories of algorithms.

A

TVSP

B

N-Queens

C

15-Puzzle

D

Bin-Packing.

Discussion

MCQ

3.

Name the node which has been generated but none of its children nodes have been generated in state space tree of backtracking method.

A

Dead node

B

Live node

C

E-Node

D

State Node

Discussion

MCQ

4.

Which is not return optimal solution from the following methods

A

Dynamic programming

B

Backtracking

C

Branch and bound

D

Greedy method

Discussion

MCQ

5.

Let G be a graph with

A

O(nm)

B

O(n+m)

C

O(mnm)

D

O(nmn).

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