DATA STRUCTURES

Mathematical/algorithmic Notations & Functions, Complexity of Algorithms, String Processing- Storing Strings, Linear Arrays and their Representation in Memory, Traversing Linear Arrays, Inserting & Deleting Operations, Multidimensional Arrays, Record Structures and their Memory Representation, Stacks and their Array Representation, Arithmetic Expressions: Polish Notation, Recursion, Tower of Hanoi Problem.

Representation of Queue, Insert & Delete Operations on Queue, Deques, Priority Queues, Linked Lists and their Representation in Memory, Traversing a Linked List, Searching a Linked List, Memory Allocation, Insertion, Deletion Operations on Linked Lists, Header Linked Lists, Two-Way Linked Lists, Circular Linked List.

Binary Trees and their Representation in Memory, Traversing Binary Trees, Traversal Algorithms, Header Nodes, Threads, Binary Search Trees, Searching, Inserting and Deleting in Binary Trees, Path Length & Huffman’s Algorithm. General Trees.

Sequential Representation of Graphs, Linked Representation, Operations & Traversing the Graphs, Graphs and its Variants, Breadth First Search, Depth First Search, Greedy Method, Single Source Shortest Path, Minimum Spanning Trees, Prim’s Algorithm, Sparse, Matrics.

Time and Space Complexity of Sorting, Bubble Sort, Selection Sort, Divide and conquer, Binary Search with its Variants, Quick Sort, Linear Search and Binary Search Algorithms.