Unit 4. Queues Topics Covered Concept and Definition Queue as an ADT Linear Queue Circular Queue Implementation of Insert and Delete operation of: Concept of Priority Queue Queues from Ashim Lamichhane
Unit 3. The Stack Topics Covered Concept and Definition Primitive Operations Stack as an ADT Implementing PUSH and POP operation Testing for overflow and underflow conditions The Infix, Postfix and Prefix Concept and Definition Evaluating the postfix operation Converting from infix to postfix Recursion Concept and Definition Implementation of: Multiplication of Natural Numbers Factorial Fibonacci Sequences The Tower of Hanoi The Stack And Recursion from Ashim Lamichhane
Unit 2. Algorithm Topics Covered Concept and Definition Design of algorithm Characteristic of algorithm Big O notation Slides For First Three Topics Algorithm Introduction from Ashim Lamichhane Slide for Big O notation Algorithm big o from Ashim Lamichhane