Foundation University Rawalpindi Campus

Department of Software Engineering Due Date = 7-4-21

Subject: Design and Analysis of Algorithm Class: BSCS 4th
Assignment No.1
Q.No.1 Solve the following recurrence using tree method.
T(n) = 2T(n/2) + C if n>1

T(1) = C if n=1

Q.No.2 Solve the following recurrence using substitutions and tree method?

T(n)= T(n/3)+T(2n/3) + cn if n>1

T(1)=1 if n=1

Q.No.3 Solve the following recurrence using substitutions and tree method?

T(n) = 2 T(n/2) + nc if n>1

T(n) = 1 if n=1