Assignment 1

Subject code& Subject: CS1201 & Data Structures (Max Marks 20)

Semester & Branch : III & CSE ‘A’ & ‘B’

Part A (10 *1=10 marks)

1. Define algorithm.
2. What is time complexity?
3. What is space complexity?
4. Define data structure.
5. How input size is affecting the algorithm’s performance?
6. What is recursion?
7. State the applications of stack.
8. What is ADT?
9. What are singly and doubly linked lists?
10. What is a circular queue?

Part B (2 *5=10 marks)

11. A) Explain Best case, Worst case analysis of an algorithm with example.
B) Explain the concept of Asymptotic notation for algorithm analysis.

12) A) Evaluate the given postfix expression using stack.

4, 5, 4, ^, +,*, 2, 2, ^, 9, 3, /,*,-

B) Convert the following infix expressions to postfix expressions

1) a+b*c-d/e*f
2) (a+b*c-d)/(e*f)