Introduction to data structure and Algorithms: Performance analysis of Algorithm, time complexity, Big-oh notation, Elementary data organization data structure operations, Recurrences, Arrays, Operation on arrays, representation of arrays in memory, single dimensional and multidimensional arrays, spare matrices, Character storing in C, String operations.
Stack And Queue and Link List: Stack operation, PUSH and POP, Array representation of stacks, Operation associated with stacks Application of stacks, Recursion, Polish expression, Representation Queue, operation on Queue , Priority Queue , D-Queue , Singly and circularly linked list, List operations Lists implementations
Trees : Basic terminology, Binary Trees, Binary tree representation, Algebraic/expressions, Complete Binary Trees, Extended binary tree, representing binary tress in memory, linked representation of Binary trees, Traversing binary trees & Searching in binary trees, Inserting in binary search trees, Complexity of searching algorithm, Heaps, general trees, Threaded binary tree.
Graphs: Terminology & representations, Graphs & Multigraphs, Directed Graphs, Sequential representation of graphs, adjacency Matrices, Transversal, connected component and spanning trees, Minimum Cost spanning tree, Prims and Kruskal Algorithm, BFS, DFS, Shortest path and transitive closure, Activity networks, topological sort and critical paths.
Searching and Sorting: Linear search, binary Search, Internal and External sorting, Bubble sorting, selection sort, Insertion sort, quick sort, Two way merge sort, Heap sort, sorting on different keys, practical consideration for internal sorting, External Sorting,
Storage Devices: Magnetic tapes, Disk Storage, Sorting with disks and Indexing techniques, introduction to B tree and B+ tree, File organization and storage management, Introduction to hoisting.