Assignment questions -- 1
1)Explain the different Asymptotic notation in detail.
2)Explain the implementation of insertion and deletion of circular singly linked list and doubly linked list.
3)Give the algorithm to convert from infix to postfix expression and consider the following infix expression which is to be converted to postfix expression using stack.
(((P+Q)*(R+S))/T)+(A*(B+C))
4)Give the algorithm for postfix expression evaluation and solve the below expression
2536+**5/2-
5) Define three ADTs namely List ADT, Stack ADT, Queue ADT.
- Teacher: Sreedivya K