1. Analyse the asymptotic performance of algorithms.

2. Compare algorithms based on time & space complexity.

3. To learn how data structure concepts are useful in problem solving..

4. To implement different ways of data structures such as stacks, linked lists and trees

5. Understand different algorithm design approaches.

- Teacher: Vaishali Bhosale YCSRD