Data Structure Syllabus

Introduction to Data Structure and Algorithm Analysis:

Data Structure Definition and classification, Algorithm Analysis, Storage Representation of Strings, Text Handling and KWIC Indexing.

Linear Data Structures:

Linear Data Structures:

Arrays, Storage Structure for Arrays,

Stack: List Implementation, Applications of Stacks: Function Call, Recursion, Balancing Symbols

Queue: List Implementation, Circular Queue, Priority Queue, double

ended queue.

Linked List: Cursor Implementation, Multi List

Applications of Linked List : Addition and Multiplication of

Polynomial in one and two variables

Nonlinear Data Structures:

Tree - Basic Tree Concepts, Operations on Binary Trees, Storage Representation & Manipulation of Binary Trees, Conversion of General Tree to Binary Trees, Sequential & Other Representation of Trees, Application of Trees — The Manipulation of Arithmetic Expression, Multi-linked Structures - Sparse Matrices.

Graphs and Their Representation:

Matrix Representation of Graphs, List Structures, Other Representation of Graphs, Breadth First Search and Depth First Search.

Sorting and Searching Techniques:

Sorting — Notation and Concepts, Selection Sort, Bubble Sort, Merge Sort, Heap Sort, Quick Sort, Searching - Sequential Searching, Binary Searching, Search Trees — Height Balanced, 2-3 Trees, Weight Balanced Tree, Tree Structures, Hash Table Search Methods, Introduction, Hashing Functions.