CS702: Advanced Algorithm Analysis and Design

Solution --Assignment No.2

Khalique Zafar (ms160400272)

Solution-Question No. 1

0 if i j
M [i, j ]
min i k j {m[i, k ] m[k 1, j ] pi 1 pk p j } if i j

A1 A2 A3 A4 A5 A5
P= 30 35 35 15 15 5 5 10 10 20 20 25
p0 p1 p1 p2 p2 p3 p 3 p4 p4 p5 p5 p6

As i j
M [1,1] M [2, 2] M [3,3] M [4, 4] M [5,5] M [6, 6] 0

M [1, 2] min1 k 2{m[1,1] m[2, 2] p0 p1 p2 }

M [1, 2] min1 k 2{0 0 30 35 15} =15750

M [2, 3] min 2 k 3{m[2, 2] m[3, 3] p1 p2 p3 }

M [2, 3] min 2 k 3{0 0 35 15 5} =2625

M [3, 4] min 3 k 4 {m[3, 3] m[4, 4] p2 p3 p4 }

M [3, 4] min 3 k 4 {0 0 15 5 10} =750

M [4, 5] min 4 k 5 {m[4, 4] m[5, 5] p3 p4 p5 }

M [4, 5] min 4 k 5 {0 0 5 10 20} =1000

M [5, 6] min 5 k 6 {m[5, 5] m[6, 6] p4 p5 p6 }

M [5, 6] min 5 k 6 {0 0 10 20 25} =5000

m[1,1] m[2, 3] p0 p1 p3
M [1, 3] min1 k 3
m[1, 2] m[3, 3] p0 p2 p3
 0 2625 30 35 5 7875
M [1,3] min1 k 3
15750 0 30 15 5 18000
M [1,3] 7875

m[2, 2] m[3, 4] p1 p2 p4
M [2, 4] min 2 k 4
m[2,3] m[4, 4] p1 p3 p4
0 750 35 15 10 6000
M [2, 4] min 2 k 4
2625 0 35 5 10 4375
M [2, 4] 4375

m[3,3] m[4,5] p2 p3 p5
M [3,5] min 3 k 5
m[3, 4] m[5,5] p2 p4 p5
0 1000 15 5 20 2500
M [3,5] min 3 k 5
750 0 15 10 20 3750
M [3,5] 2500

m[4, 4] m[5, 6] p3 p4 p6
M [4, 6] min 4 k 6
m[4,5] m[6, 6] p3 p5 p6
0 5000 5 10 25 6250
M [4, 6] min 4 k 6
1000 0 5 20 25 3500
M [4, 6] 3500

m[1,1] m[2, 4] p0 p1 p4

M [1, 4] min1 k 4 m[1, 2] m[3, 4] p0 p2 p4
m[1,3] m[4, 4] p p p
0 3 4

0 4375 30 35 10 14875

M [1, 4] min1 k 4 15750 0 30 15 10 20250
7875 0 30 5 10 9375

M [1, 4] 9375
 m[2, 2] m[3,5] p1 p2 p5

M [2,5] min 2 k 5 m[2,3] m[4,5] p1 p3 p5
m[2, 4] m[5,5] p p p
1 4 5

0 2500 35 15 20 13000

M [2,5] min 2 k 5 2625 1000 35 5 20 7125
4375 0 35 10 20 11375

M [2,5] 7125

m[3, 3] m[4, 6] p2 p3 p6

M [3, 6] min 3 k 6 m[3, 4] m[5, 6] p2 p4 p6
m[3,5] m[6, 6] p p p
2 5 6

0 3500 15 5 25 5375

M [3, 6] min 3 k 6 750 5000 15 10 25 9500
2500 0 15 20 25 10000

M [3, 6] 5375

m[1,1] m[2,5] p0 p1 p5
m[1, 2] m[3,5] p p p

M [1,5] min1 k 5
0 2 5

m[1,3] m[4,5] p0 p3 p5
m[1, 4] m[5,5] p0 p4 p5
0 7125 30 35 20 28125
15750 2500 30 15 20 27250

M [1,5] min1 k 5
7875 1000 30 5 20 11875
9375 0 30 10 20 15375
M [1,5] 11875

m[2, 2] m[3, 6] p1 p2 p6
m[2,3] m[4, 6] p p p

M [2, 6] min 2 k 6
1 3 6

m[2, 4] m[5, 6] p1 p4 p6
m[2,5] m[6, 6] p1 p5 p6
0 5375 35 15 25 18500
2625 3500 35 5 25 10500

M [2, 6] min 2 k 6
4375 5000 35 10 25 18125
7125 0 35 20 25 24625
M [2, 6] 10500
 m[1,1] m[2, 6] p0 p1 p6
m[1, 2] m[3, 6] p p p
0 2 6

M [1, 6] min1 k 6 m[1,3] m[4, 6] p0 p3 p6

m[1, 4] m[5, 6] p p p
0 4 6

m[1,5] m[6, 6] p0 p5 p6
0 10500 30 35 25 36750
15750 5375 30 15 25 32375

M [1, 6] min1 k 6 7875 3500 30 5 25 15125
9375 5000 30 10 25 21875

11875 0 30 20 25 26875
M [1, 6] 15125

1 2 3 4 5 6

1 0 15750 7875 9375 11875 15125

2 0 2525 4375 7125 10500

i 3 0 750 2500 5375

4 0 1000 3500

5 0 5000

6 0

Solution-Question No. 2
a) Prove that 5n2 10n 16 (n2 )

Assume that f (n) 5n 2 10n 16

and g (n) n 2
We have to find the existence of c1 ,c 2 and n 0 such that
(g(n) = c1.g (n) f (n) c2 .g(n) for all n 0
Since c1 5, c2 10, n0 16 which is n 0 0
0 c1.g (n) f (n) c2 .g(n), n n0 , c1 5, c2 10
Hence f (n) (g(n)) 5n 2 10n 16 (n 2 )

b) Prove that 2n3 3n 10 O(n4 )

Assume that f (n) 2n3 3n 10 and g (n) n 4

We have to show that f(n) g(n)
We have to find there n 0 exist for any c as to
f (n) c.g (n)
2n 3n 10 c.n 4
3

Which is true for any arbitary c we choose n 0 the above not hold as
Hence, f(n) g(n)