Analysis of Algorithms Total Marks: 30

Quiz 02 Total Time: 30 minutes

Q. 1: Prove that the running time of an algorithm is 𝜃(𝑔(𝑛)) if and only if its worst-case running time is
Ο(𝑔(𝑛)) and its best-case running time is Ω(𝑔(𝑛)). [10M]

Q. 2: If f(n) = 4𝑛7 + 9𝑛2 + 2𝑛 + 7 and f(n) = 𝜃(𝑔(𝑛)) [10M]

7
Show that: g(n) = 𝜃(𝑛 ).

Q. 3: Use Strassen’s algorithm discussed in book to compute the matrix product [10M]

9 5 6 3
[ ]x[ ]
2 4 3 9
Show your working in complete steps.