Data Struct. & Algorithms
- Abstract Data Structure
- Performance Analysis of Algorithms
- Array: Polynomials, Sparse Matrices
- Sparse Matrices: Transporting, Multiplication
- Stack and Queue
- Linked List: Linear, Circular
- Generalized Linked Lists
- Trees: Representation, Binary Tree
- Binary Search Tree
- Advanced search structures
- Heap: Min Heap, Max Heap
- Sorting: Insertion sort, Quick sort
- Heap sort
- Merge sort: Iterative, Recursive
- Count sort, Radix sort
- Hashing: Hash function, Overflow handling
- Graph: Representation, DFS, BFS