To perform the following operations on a stack. (Implement the stack using array and linked list both) To convert an infix arithmetic expression (parenthesized / unparenthesized) into postfix notation. To evaluate a postfix expression.
To perform the following operations on a stack. (Implement the stack using array and linked list both) To convert an infix arithmetic expression (parenthesized / unparenthesized) into postfix notation. To evaluate a postfix expression.
To perform the following operations on a stack. (Implement the stack using array and linked list both) To convert an infix arithmetic expression (parenthesized / unparenthesized) into postfix notation. To evaluate a postfix expression.
NO. NO. ASSIGNMENT -1 : 1. To perform the following operations on a stack. (Implement the stack using array and linked list both) i) PUSH ii) POP iii) ISEMPTY iv) ISFULL v) PEEP 2. To convert an infix arithmetic expression (parenthesize/ unparenthesized) into postfix notation. 3. To convert an infix arithmetic expression (parenthesized/unparenthesized) into prefix notation. 4. To convert a prefix expression into an infix expression(parenthesized). 5. To convert a postfix expression into an infix expression(parenthesized). 6. To evaluate a postfix expression. 7. To perform the following operations on a simple queue. (Implement the queue using array) a). Insert an element b). Remove an element 8. To perform the following operations on a circular queue. (Implement the queue using array) a). Insert an element b). Remove an element 9. To perform the following operations on a double ended queue (deque). (Implement the queue using array) a). Insert an element at left b). Insert an element at right c). Remove an element from left d). Remove an element from right 10. To implement Double ended queue (Input Restricted/Output Restricted). 11. To perform the following operations on a priority queue. a). Insert an element b). Remove an element