DATA STRUCTURE ( 2130702 )

Data Management concepts,  Data types – primitive and non-primitive,  Performance Analysis and Measurement,  Types of Data Structures (1 Question), 

Representation of arrays,  Applications of arrays,  Sparse matrix and its representation,  Stack-Definitions & Concepts,  Operations On Stacks (1 Question),  Applications of Stacks (1 Question),  Polish Expression, Reverse Polish Expression and their Compilation (1 Question),  Tower of Hanoi,  Representation Of Queue,  Operations on Queue,  Circular Queue,  Priority Queue and array representation of Priority Queue (1 Question),  Double ended Queue,  Applications of Queue,  Singly Linked List (1 Question),  Doubly Linked List (1 Question),  Circular Linked List,  Linked implementation of Stack,  Linked implementation of Queue,  Applications of Linked List,  Recursion (1 Question), 

Tree-Definitions and Concepts (1 Question),  Representation of Binary Tree,  Binary Tree Traversal (Inorder, postorder, preorder) (2 Question),  Threaded Binary Tree (1 Question),  Binary Search Trees,  Conversion of General Trees to Binary Trees,  Applications Of Trees,  Some balanced tree mechanism,  AVL Trees (1 Question),  2-3 Trees,  Weight Balance Tree,  Matrix Representation of Graphs (1 Question),  Elementary Graph operations (BFS, DFS) (1 Question),  Spanning Trees,  Shortest path Algorithms (1 Question),  Minimal spanning Tree (1 Question), 

Hashing - The symbol table,  Hashing Functions,  Collision-Resolution Techniques in hashing (1 Question),  File Structure: Concepts of fields, records and files,  Indexed and Relative/Random File Organization,  Indexing structure for index files (1 Question),  Hashing for direct files,  Multi-Key file organization and access methods,  Sequencial File Organization (1 Question), 

Bubble Sort (1 Question),  Selection Sort,  Quick Sort (1 Question),  Merge Sort,  Sequential Search (1 Question),  Binary Search (1 Question),