1. What is need of data structure? How linear data structure differs from non-linear data structure?

2. Explain with example of tower of Hanoi, how mathematical induction technique can be used in computer algorithms to solve problem.

3. Implement an algorithm to convert polish notations to reverse polish notations for given statement.

4. Implement round robin job scheduling algorithm using Queue concept.

5. Explain how a binary tree can be represented using double linked list. Implement same.

DOP: 6/10/2017

Note: This assignment is valid for Diploma students and those who have not yet submitted assignment #1.