Total No. of Questions : 10] SEAT No.

8
23
P 3006 [Total No. of Pages : 3

ic-
tat
[5669]-598

4s
T.E. (Information Technology)

6:0
01 91
DESIGN & ANALYSIS OF ALGORITHMS

9:4
(2015 Pattern) (Semester - II)
0
90
Time : 2½ Hours]
0/1 13 [Max. Marks : 70
0
Instructions to the candidates:
1/2
.23 GP

1) Solve Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7, or Q.8, Q.9, or Q.10.
2) Neat diagrams must be drawn whenever necessary.
E
82

3) Figures to the right indicate full marks.

8
C

23
4) Assume suitable data if necessary.

ic-
16

tat
8.2

Q1) a) List the properties of various asymptotic notations. [5]

4s
.24

6:0
b) Describe the strategy to analyse the non-recursive algorithm with suitable
91
49

example. [5]
9:4
30

OR
90
01
01

Q2) a) Compare apriori & posteriory analysis of algorithms. [4]

1/2
GP

b) Write an algorithm for binary search and write its recurrence relation.
0/1

Give its time complexity. [6]

CE
82

8
23
.23

Q3) a) State the principle of optimality. Explain its significance in brief. [5]
ic-
16

tat
b) Compare Dijkstra's Algorithm & Bellman ford algorithm to find single
8.2

4s

source shortest path. [5]

.24

6:0

OR
91
49

9:4

Q4) Solve the following instance of Multistage graph by dynamic programming

30
90

backward approach. [10]

01
01
1/2
GP
0/1
CE
82
.23
16
8.2
.24

P.T.O.
49
Q5) a) Find Hamiltonian cycle for given graph using backtracking method. Draw

8
23
a state - space tree for the same. [8]

ic-
tat
4s
6:0
01 91
9:4
0
90
b) Write an algorithm for graph colouring problem using backtracking
method. 0/1 13 [8]
0
1/2
.23 GP

OR
Q6) a) Write an iterative and a recursive backtracking algorithm for N-Queens
E
82

8
problem. [8]
C

23
ic-
b) Let W = {5,10,12,13,15,18} & M = 30 Find all possible subsets of W
16

tat
that sum to M. [8]
8.2

4s
.24

6:0
91
49

9:4
Q7) a) Explain 8-Queens problem & explain the following with respect to
30
90

8-Queens problem. [10]

01
01

i) State space tree ii) Solution State

1/2
GP

iii) State space iv) Answer state

0/1
CE
82

8
v) Static tree vi) Dynamic tree

23
.23

vii) Live node viii) Bounding function

ic-
16

tat
8.2

b) Differentiate between Backtracking & branch and bound. Illustrate with

4s

example of knapsack problem. [8]

.24

6:0
91
49

9:4

OR
30
90

Q8) a) Solve the following instance of the knapsack problem by branch & bound
01
01

algorithm. [8]
1/2
GP

n = 4, W (1:4) = {10,7,8,4}, P (1:4) = {100,63,56,12}, knapsack capacity

0/1

M = 16
CE
82

b) Explain branch & bound technique and different strategies used in it like
.23

LCBB, FIFOBB, compare LCBB & FIFOBB. [10]

16
8.2
.24

[5669]-598 2
49
Q9) a) Write an algorithm for pointer doubling problem. What is its time

8
23
complexity? [8]

ic-
b) Show that 3-SAT problem is NP-Complete. [8]

tat
4s
OR

6:0
Q10)a) Explain NP-Hard, NP-Complete, Decision problem & Polynomial time

01 91
9:4
algorithm. [8]

0
90
b) 0/1 13
Explain in detail models for parallel computing. [8]
0
1/2
.23 GP


E
82

8
C

23
ic-
16

tat
8.2

4s
.24

6:0
91
49

9:4
30
90
01
01
1/2
GP
0/1
CE
82

8
23
.23

ic-
16

tat
8.2

4s
.24

6:0
91
49

9:4
30
90
01
01
1/2
GP
0/1
CE
82
.23
16
8.2
.24

[5669]-598 3
49