Design and Analysis of Algorithms MCQs | Page - 3

 since the coppersmith- winograd algorithm multiplies the matrices in o(n2.37) time. the time complexity of recursive multiplication of two square matrices by strassen’s method is found to be o(n2.80). therefore, coppersmith-winograd

 as stack is based on lifo(last in first out) principle so the deletion takes place from the topmost element. thus pop operator removes topmost element.

 the recursive program to reverse stack uses memory of the order n to store function call stack.

 if linked list is used for implementing stack then it can be reversed without using any extra space.

 first node is considered as the top element when stack is implemented using linked list.

 iterative solution to tower of hanoi puzzle also exists. its approach depends on whether the total numbers of disks are even or odd.

 number of moves = 24-1=16- 1=15

 master’s theorem is a direct method for solving recurrences. we can solve any recurrence that falls under any one of the three cases of master’s theorem.

 there are primarily 3 cases under master’s theorem. we can solve any recurrence that falls under any one of these three cases.

 in second case of master’s theorem the necessary condition is that c = logba. if this condition is true then t(n) = o(nc log n)