Performance and Complexity Analysis: Space Complexity, Time Complexity, Asymptotic Notation (Big-Oh), Complexity Analysis Examples.
Linear List-Array Representation: Vector Representation, Multiple Lists Single Array. Linear List-Linked Representation: Singly Linked Lists, Circular Lists, Doubly Linked Lists, Applications (Polynomial Arithmetic).
Arrays and Matrices: Row And Column Major Representations, Sparse Matrices.
Stacks: Array Representation, Linked Representation, Applications (Recursive Calls, Infix to Postfix, Postfix Evaluation).
Queues: Array Representation, Linked Representation.
Skip Lists and Hashing: Skip Lists Representation, Hash Table Representation, Application- Text Compression.
Trees: Definitions and Properties, Representation of Binary Trees, Operations, Binary Tree Traversal.
Binary Search Trees: Definitions, Operations on Binary Search Trees.
Balanced Search Trees: AVL Trees, and B-Trees.
Graphs: Definitions and Properties, Representation, Graph Search Methods (Depth First Search and Breadth First Search)
Application of Graphs: Shortest Path Algorithm (Dijkstra), Minimum Spanning Tree (Prim’s and Kruskal’s Algorithms).
Sorting and Complexity Analysis: Selection Sort, Insertion Sort, Quick Sort, Merge Sort, Closest Pair Of Points, and Heap Sort.