Total No. of Questions : 10] SEAT No.

8
23
P3642 [5560]-598
[Total No. of Pages : 3

ic-
T.E. (Information Technology)

tat
7s
DESIGN AND ANALYSIS OF ALGORITHMS

7:0
(2015 Course) (Semester - II)

01 91
3:4
0
Time : 2½ Hours] [Max. Marks : 70

91
3/0 13
Instructions to the candidates:
0
1) Answer 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.
5/2
.23 GP

2) Neat diagrams must be drawn wherever necessary.

3) Figures to the right side indicate full marks.
E
82

4) Assume suitable data if necessary.

8
C

23
ic-
Q1) a) Compare the following complexities and Reorder from the smallest to
16

tat
the largest. Justify your answer. [5]
8.2

7s
.24

7:0
i) n2, 2n, n log2 n, log2 n, n3.
91
49

3:4
ii) nlog2 n, n8, n2/log2 n, (n2 – n + 1).
30
91

b) Solve Homogeneous Recurrence relation for Fibonacci sequence. [5]

01
01
5/2

OR
GP
3/0

Q2) a) Discuss a general plan for Analysing Time Efficiency of Recursive

CE
82

8
Algorithm. [5]

23
.23

b) Solve the following instance of job sequencing problem using greedy

ic-
16

tat
approach. Let n = 4, profit (1 : 4) = (100, 10, 15, 27) and deadlines
8.2

7s

d(1 : 4) = (2, 1, 2, 1). [5]

.24

7:0
91
49

3:4
30

Q3) a) Write an algorithm for Quick sort and analyse it with respect to worst,
91

best and average case. [5]

01
01
5/2

b) Compare the following [5]

GP
3/0

i) Divide and Conquer and Dynamic Programming.

CE
82

ii) Greedy method and Dynamic Programming.

.23

OR
16
8.2
.24

P.T.O.
49
Q4) Use Bellman ford algorithm to find shortest path for the following graph.[10]

8
23
ic-
tat
7s
7:0
01 91
3:4
0
91
3/0 13
0
5/2
.23 GP
E
82

8
Q5) a) Write an algorithm to find Hamiltonian path using backtracking method.
C

23
[8]

ic-
b) State the principal of backtracking and Write backtracking algorithm for
16

tat
N-Queen problem. [8]
8.2

7s
OR
.24

7:0
91
Q6) a) Let W = {5, 7, 10, 12, 15, 18, 20} and M = 35. Find all possible subsets
49

3:4
of W that sum to M. Construct the portion of state space tree. [8]
30
91

b) Write an algorithm for 0/1 knapsack problem using backtracking method.

01
01

[8]
5/2
GP
3/0
CE
82

8
Q7) Construct the solution of following Travelling Salesperson problem using

23
.23

Branch and Bound. [18]

ic-
16

tat
8.2

  20 30 10 11
7s

15  16 4 2 
.24

7:0

 
91
49

3:4

3 5  2 4
 
30
91

 19 6 18  3 
01

16 4 7 16  
01
5/2
GP
3/0

OR
CE
82

Q8) a) Solve the following instance of 0/1 knapsack problem by FIFO branch
and bound approach. [10]
.23

N = 4, (p1, p2, p3, p4) = (10, 10, 12, 18)

16

(w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15.

8.2

b) Write an algorithm for Least Cost (LC) branch and bound. [8]
.24

2
49

[5560]-598
Q9) a) Explain in detail models for Parallel Computing. [8]

8
23
b) Differentiate between : [8]

ic-
i) P class and NP Class.

tat
ii) NP complete and NP Hard.

7s
7:0
OR

01 91
3:4
Q10)a) Prove that Satisfiability problem in NP complete. [8]

0
91
b) Explain Nondeterministic algorithm? Write the Nondeterministic algorithm
3/0 13
for searching the element of an array. [8]
0
5/2
.23 GP


E
82

8
C

23
ic-
16

tat
8.2

7s
.24

7:0
91
49

3:4
30
91
01
01
5/2
GP
3/0
CE
82

8
23
.23

ic-
16

tat
8.2

7s
.24

7:0
91
49

3:4
30
91
01
01
5/2
GP
3/0
CE
82
.23
16
8.2
.24

3
49

[5560]-598