Skip to content
Topics Covered
- Sorting: efficiency of sorting,
- exchange sort: bubble sort, quick sort.
- Selection sort
- heap sort,
- insertion sort,
- merge and radix sort.
Topics Covered
- Concept and Definition
- Inserting and Deleting nodes
- Linked implementation of a stack (PUSH/POP)
- Linked implementation of a queue (Insert/Remove)
- Circular List
- Stack as a circular list (PUSH/POP)
- Queue as a circular list (Insert/Remove)
- Doubly Linked List (Insert/Remove)
Topics Covered
- Concept and Definition
- Queue as an ADT
- Linear Queue
- Circular Queue
- Implementation of Insert and Delete operation of:
- Concept of Priority Queue