Code No.

: 6359
FACULTY OF INFORMATICS
B.E (IIIIIVYear)

(IT) II Semester

(Main) Examination,

June 2010

DESIGN AND ANALYSIS OF ALGORITHMS

Time:

[Max. Marks:

3 Hours]

75

Answer all questions from Part A.

Answer any five questions from Part B.
Part A - (25 Marks)
3

1.

Define Randomized

What is knapsack

3.

Define ~feasible solution.

4.

Define principle

5.

What is Depth First Search?

6.

What is spanning

tree of a graph?

7.

Explain properties

of LC - search.

8.

What is graph

9.

Define Hamiltonian

10. State

algorithm.

problem?

of optimality.

coloring?

cycles.

Cook's theorem.
Part B - (Marks:

11. a)
b)
12. a)
b)

Briefly explain

how to analyse

5 xl0

Explain job sequencing

solution?

algorithm?
from heap?

Give the control abstraction.

What is heap? How to delete an element

What is greedy method?

= 50)

with deadlines

problem

with an example.

Give greedy
6

13. What is multi-stage

graph? Write dynamic programming
expressions
approach and backward approach and explain with an example.

for forward
10
[P.T.O.

2
14. a)

Explain

Branch

and Bound.

6359

Give LCBB solution

for the following

knapsack

instance n = 4, (PI' P2, Ps' P4) = (10, 10, 12, 18), (WI' W2, Ws' W4) = (2, 4, 6, 9)
and m = 15.
7
b)

Explain

about biconnected

15. a)

Explain

NP hard graph

b)
16. a)
b)

component.

problem

and scheduling

problem.

5
5

Write short notes on non-deterministic

algorithm.

Write an algorithm

to find the shortest

path from a single source in a graph. 5

Explain

sales person problem.

Travelling

17. Wri te short notes on :

a)

UNON and FIND operations

b)

Optimal

c)

Lower bound theory.

merge pattern.