Syllabus
|
Course Code: MS-20-21 Course Name: Data Structures and Algorithms |
||
| MODULE NO / UNIT | COURSE SYLLABUS CONTENTS OF MODULE | NOTES |
|---|---|---|
| 1 | Introduction to Data Structures: Classification of Data Structures, Arrays.
Stacks & Queues: Representation of Stacks, Stack Operations, Applications, Queues, Operations on Queues, Circular Queues, Dequeue, Priority Queues, Applications. Introduction to Algorithms: Role of algorithms in computing, Complexity of algorithms, analysing algorithms, designing algorithms, asymptotic notations. |
|
| 2 | Linked Lists: Introduction, Types, and Operations (Insertion, Deletion, Traversal, Searching), Applications, Dynamic Memory Management, and Implementation of Linked Representations. Trees: Binary Tree Traversals, Threaded Binary Trees, Binary Search Trees and Operations, AVL Trees, Heap, M-way Search Trees, B-Trees, B+ Trees, Applications. |
|
| 3 | Divide and Conquer: Solving recurrence equations: back substitution method, recursion tree method, master’s theorem. Analysis of heap sort and quick sort; Counting sort, Radix sort, Bucket sort, Lower bounds for sorting. Dynamic Programming (DP): Elements of DP, Matrix chain multiplication, Longest common subsequence, optimal binary search trees. |
|
