IGNOU BCS-042 QUESTION PAPER WITH SOLUTION FOR EXAM PREPARATION

1. Define Tower of Hanoi problem as a recurrence relation problem and solve it through a recurrence tree. 

2. Why do we study algorithm?

3. Write Insertion Sort algorithm. Explain best case and worst case time complexity of the algorithm.

4. What is Master Method? Write all the three cases of Master Method to solve the following recurrence relation:
T(n) = aT (n/b) + f(n) and explain. 

5. Define what is an optimization problem? Give any two examples of optimization problems with proper explanations.

6. Write summation formula for arithmetic and geometric series.