Q1. Describe the following terms:
a) Space complexity.
b) Time complexity.
Q2. Describe the term linked list. describe how you perform addition and removal in the linked list.
Q3. Describe in brief about stack with appropriate application.
Q4. Describe in brief about the Queues with illustrations.
Q5. What do you mean by binary tree? Describe with program how it is employed for searching.
Q6. Describe non-linear data structures in detail.
Q7. Describe Quick sort with program and appropriate diagram.
Q8. Describe binary search algorithm with an illustration.
Q9. Describe the benefit of binary search over linear search.
Q10. prepare down the general method of back tracking with 8 Queens Problem.
Q11. What do you mean by divide and conquer? Describe with an illustration in detail.