Recursion, Stack, Polish Notations, infix to postfix, FIFO Queue, Circular Queue, Double Ended Queue, Linked List - Linear, double and Circular - all operations, Stack and Queue using Linked List.
Using Stack - checking parenthesis in an expression.
What is a FIFO Queue, understanding Queue operations - Insert and delete, implementing FIFO Queue.
Concept of Double ended queue, logic development and implementation of double ended queue.
Singly Linked List - developing algorithms for various methods and then implementing them.
Circular Linked List - developing algorithm of various methods and then implementing them.
Recursion, concept of Tail recursion, Recursion Vs Iteration..
Using Stack - Understanding Polish notations, algorithm and implementation of infix to postfix conversion and evaluation of postfix expression.
Limitations of FIFO queue, concept of Circular Queue - Implementation of Circular queue.
Concept of Linked List - definition, why we need linked list.
Doubly Linked List - developing algorithm of various methods and then implementing them
How to estimate time complexity of any algorithm. Big Oh, Big Omega and Big Theta notations.
