INTRODUCTION TO DATA STRUCTURE:
Data Management concepts, Data types – primitive and non-primitive, Types of Data Structures- Linear & Non Linear Data Structures.
LINEAR DATA STRUCTURE
Array: Operations, RMO and CMO representation
Stack: Concepts and representation, Operations, Applications. Polish Expression, Reverse Polish Expression And Their Compilation, Recursion, Tower of Hanoi.
Queue: Concept and Representation, Operations, Types viz. simple, circular, priority, double ended. Applications of queue.
Linked List: Concept and Representation.
Operations: Insertion at beginning, at the end and at any point, Deletion at the beginning, at the end and at any point.
Types of Linked lists: Singly Linked List, Doubly Linked list, Circular linked list, Linked implementation of Queue. Applications and Advantages of Linked Lists.
NONLINEAR DATA STRUCTURE:
Tree: Definitions and Concepts, Representation of binary tree, Binary tree traversal (Inorder, postorder, preorder), Threaded binary tree, Binary search trees, Conversion of General Trees To Binary Trees, Applications Of Trees- Some balanced tree mechanism, e.g. AVL trees, 2-3 trees
Basic Concept of Graph Theory and its Properties, Matrix Representation Of Graphs, Elementary Graph operations, Breadth First Search, Depth First Search, Spanning Trees, Minimum spanning tree- Prims and Kruskal Algorithm
Performance Analysis and Management - Time and space analysis of algorithms – Average, best and worst case analysis. Sorting – Bubble Sort, Selection Sort, Quick Sort, Merge Sort, Insertion sort, Heap Sort. Searching – Sequential Search and Binary Search
Hashing function, Collision Resolution Techniques.