Teaching Scheme (in Hours)
| Theory |
Tutorial |
Practical |
Total |
| 3 |
0 |
4 |
5 |
Subject Credit : 5
Examination Scheme (in Marks)
Theory
ESE (E)
|
Theory
PA (M)
|
Practical
ESE Viva (V)
|
Practical
PA (I)
|
Total
|
| 70 |
30 |
30 |
20 |
150 |
Syllabus Content
Unit-1: Introduction to Data Structure
Data Management concepts, Data types – primitive and non-primitive, Performance Analysis and Measurement (Time and space analysis of algorithms-Average, best and worst case analysis), Types of Data Structures- Linear & Non Linear Data Structures.
Unit-2: Linear Data Structure
Array: Representation of arrays, Applications of arrays, sparse matrix and its representation
Stack: Stack-Definitions & Concepts, Operations On Stacks, Applications of Stacks, Polish Expression, Reverse Polish Expression And Their Compilation, Recursion, Tower of Hanoi
Queue: Representation Of Queue, Operations On Queue, Circular Queue, Priority Queue, Array representation of Priority Queue, Double Ended Queue, Applications of Queue
Linked List: Singly Linked List, Doubly Linked list, Circular linked list ,Linked implementation of Stack, Linked implementation of Queue, Applications of linked
list
Unit-3: 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 TreesSome balanced tree mechanism, eg. AVL trees, 2-3 trees, Height Balanced, Weight Balance, Graph-Matrix Representation Of Graphs, Elementary Graph operations,(Breadth First Search, Depth First Search, Spanning Trees, Shortest path, Minimal spanning tree )
Unit-4: Hashing And File Structures
Hashing: The symbol table, Hashing Functions, CollisionResolution Techniques
File Structure: Concepts of fields, records and files, Sequential, Indexed and Relative/Random File Organization, Indexing structure for index files, hashing for direct files, Multi-Key file organization and access methods.
Unit-5: Sorting & Searching
Sorting – Bubble Sort, Selection Sort, Quick Sort, Merge Sort Searching – Sequential Search and Binary Search
Course Outcome
- Differentiate primitive and non primitive structures
- Design and apply appropriate data structures for solving computing problems
- Apply sorting and searching algorithms to the small and large data sets
