F5

A
8B

3
3

A7

8F
A4
Paper / Subject Code: 32428 / Department Optional Course-I: Advanced Data Structure & Analysis

FE
92

36
3E
F5
8B
BE

A7

F
A4
FE
92

68
C5

3E
F5
8B
BE

73
E2

A4
Time: 3 Hours Max. Marks: 80

FE

A
92
5
C2

3E
C

F5
8B
BE
E2
01

A4
FE
2
C5
C2
F7

5
8B
BE
E2

F
AE

4
E
70

A
5
2

BF
E9
8F

2C
1C
F

F5
N.B.:

AE

8
36

E
0

2
5
2
7

F
9
A7

8F

C
C
(1) Question No. 1 is compulsory.

EF

B
E
E2
01

5B

8
6
3E

92
73

2
F7
(2) Attempt any three out of the remaining five questions.

2C
A4

E
A

8
36
E

2E
0
F5

FA

2
5
(3) Assumptions made should be clearly stated.

E9
A7

2C
4

1C
EF
FE

68
A

B
E

2E
0
F5

A
8B

73

5
3

7
F

2C
4

C
EF
E

EA
92

68
A

1
F

2E
70
F5

FA
8B
BE

3
43

C
EF
FE

EA
92

68
5A
C5

2
1

2E
Q1. Solve any Four questions out of Five. 5 marks each

0
FA
B
E

3
3
E2

F7
F

A7
B

A4

1C
E
2

68
C5

AE
C2

BF
9

70
F5
BE

3
3
A Sort the following numbers using Quick sort: 50, 31, 71, 38, 77, 81, 12, 33.
E2
01

8F
28

EF
FE

EA
5A
5
2
7

E9

36
C
C
EF

FA
B

43
2

F
1

A7
B

8
E

B Build a max heap H from the given set of numbers: 45, 36, 54, 27, 63, 72, 61 and 18. Also

E
0
A

68
A
5
C2
7

F
E9
8F

3E
2C
EF

F5
8B

73
01

draw the memory representation of the heap.

5B
36

A4
2E

FE
A

EA
92
7
A7

8F

C
1C
F

F5
B
E

43
2
AE

8
36
3E

2E

FE
0

C Compute prefix function for the pattern: ababaca.

92

5A
C5
7
A7

8F
A4

1C
EF

8B
BE
E2

EF
36
3E

70
F5

FA

92
5
C2

BF
D Explain 0/1 knapsack problem using dynamic programming
A7

C
A4

F
FE

E
8

2
AE

5B

28
6
E

2E
0
F5
8B

3
3

E9
7

2C
A4

1C
F
FE

EA

E What is Complexity? Explain in detail asymptotic notations.

92

68

AE

5B
2E
70
F5
8B
BE

73
3

8F

2C
4

C
EF
FE

A
92

A
C5

1
6
E

2E
0
5

A
8B
BE

3
43
E2

7
EF

A7

8F

1C
EF
2

5A
C5
C2

F
E9

36
3E

70
FA
8B
E2

F
01

7
5B

A4

EF
E

Q2. Solve the following 10 marks each

A
92

68
C2
F7

BF

3E
2C

F5

FA
BE

73
1

28

A4
2E

FE
70

EA

68
C5

A Create a B tree of order 5 by inserting the following elements:

9
1C
EF

5
8B
E

73
43
E2

EF
5B
70
FA

EA
2

3, 14, 7, 1, 8, 5, 11, 17, 13, 6, 23, 12, 20, 26, 4, 16, 18, 24, 25, and 19.
C2

F
9
2C
EF

5
8B
BE
68

43
EF
1

2E
70
FA

92
73

5A
C5

BF

B Find out the time complexity for the recurrence equation as follows:
1C
EF

E
68

E2

EF
B

28
70
FA
73

5
C2

a) T(n)=T(n/2) +1
BF
9
C
EF

E
EA

68

E2
1

5B

28
70
FA
73

b) T(n)=2T(n/2) +n
43

E9
2C
C
EF
A

68
5A

5B
3E

2E
0
FA
73

F7
EF

2C
A4

1C
EA

68

2E
70
F5

FA
73
43

Q3. Solve the following 10 marks each

1C
EF
FE

68
5A

3E

70
FA
B

73
EF
28

A4

EF

A Write short note on master theorem.

EA

68
BF
9

F5

FA
BE

73
43
8

FE

A
92

68
5A

B Explain greedy strategy of designing algorithm.

3E
B
BE

73
EF
28

A4

EA
C5

BF
E9

F5

43
E2

5B

28

FE

11895 Page 1 of 2
5A
C2

E9
2C

EF
01

5B

28
2E

BF
E9
2C
1C

F701C2E2C5BE928BFEF5A43EA7368FAE
5B

28
2E
70
 01 BE EF 73 F7
C2
E2 9 28 5A 68 01
C2
B 43 FA
70 C5 FE EA EF E2
1C BE F5 73 70 C5
2E 92
8 A4 68
FA 1 C2 BE
2C BF 3E E2 92
5B EF A 73
EF C5 8B
FE
E9 5A 68 70 BE
2E 1C

B
F5

A
A
28

B
A
43

Q6.
Q5.
2C B EA
FA 2E 92
8B A4
Q4.

11895
5B FE EF 2C 3E
E9 F5 73 70 5B FE A7
28 A4 68
FA 1 C2 E9 F5 36

job
BF 3E
A E2 2 A4 8F

profit
5B EF EF C5 8B 3E A
E9 73 70 FE A7 EF

deadline
28 5A 68 1C BE F5 7
43 01 36
B EA
FA 2E 92
C2 A4 8F
FE 2C
F
EF 3 E
8B A

3
1
F5 70 5B 73 EF E2

20
1 EF A7
28 A4 68 E 9 5 36 7 0
C5
BF 3E FA C2
28 A 4 8F 1C BE
E

Solve the following

A E2 3 2

Solve the following

1
2
92
Solve the following

EF BF

15
73 F7 C5 EA AE E2 8B
0 E F
algorithm for the same

5A 68 1 C BE F 7 3 7 C5 FE
43 FA 2 9 2 5A 6 8 01 B E

1
3
E2 F5

10
EA EF 8B 43 FA C2 92
73 70 C 5 FE E A EF E 2 8B A4
68 1C B E 73 7 C 5 F 3E
F5 0 E A7

3
7
4
FA 2E 92 A4 68 1C BE F5
EF 2C 8B 3E F 2E 9 2 A 36
F AE 8 4 8F

Explain Genetic algorithms in detail.

70 5B EF A7 F 2C B 3E AE

1
5
5
1C
2E E 9 5 3 6 70
1C 5 B FE A 73 F7
28 A4 8F F5
E9 A 6 01

3
3
6
2C BF 3E AE 2E 28 4 8F
5B EF A 7 F 2 C BF 3 E AE C2
7 E2
Explain Matrix chain multiplication in detail.

E9 5 A 36 0 1 5B E A7 F
execution, which will achieve maximum profit.
F

Page 2 of 2
28 8F E9 36 70 C5
43 A C2
2 5A 8 1 BE

Explain the Knuth-Morris-Pratt algorithm (KMP).

BF EA E2 8 B 43 F A C2

***************
EF EF C5 EA E2 92
73 70 FE EF 8B
5A 68 1C B E F5 73 7 C 5
43 FA 2E 92 A4 68 0 1C BE
EA EF 2 C 8B 3 FA 2 92

F701C2E2C5BE928BFEF5A43EA7368FAE
Describe algorithm and complexity of all pair shortest path.

73 7 0 5 F E EA E E2 8B
68
FA 1C BE F 5A 7 3 F7
01
C5 FE
2E 92 68 C BE F5
EF 2C 8 B 4 3 F A 2 92
70 5B FE E A7 EF E 2C 8B
1C E F5 3 7 0 5 FE
2E 92 A 68 1 C BE F5
2C 8B 43
EA
FA 2 E2 9 2 A4
5B FE
7
EF C 8B 3
E9 F5 3 68 7 0 5 B FE
28 A4 1C E9 F5
What is the sequence of job, for following sequence of job gives the snapshot of

BF 3E FA 2E 2 A4
EF A7 EF 2C 8B 3E
5A 36 70 5B FE A7
8F 1 C E F5 3
9
Analyze Time complexity of Binary Search using Divide and Conquer. Also write the

43 2E 2 A4
EA AE 8
10 marks each

10 marks each

10 marks each

F7 2C BF 3E
73 0 1 5 B E A7
68 C E F 5 36
Paper / Subject Code: 32428 / Department Optional Course-I: Advanced Data Structure & Analysis

FA 2E 92 A4 8F
EF 2C 8 B 3E A
70 5 B F E A
1C E9 F5 73
2E 2 8 A 4
68
F
2