Syllabus
|
Course Code: CC- IX B Course Name: DATA STRUCTURES |
||
| MODULE NO / UNIT | COURSE SYLLABUS CONTENTS OF MODULE | NOTES |
|---|---|---|
| 1 | Data Structure Definition, Data Type vs. Data Structure, Categories of Data Structures, Data Structure Operations, Applications of Data Structures, Algorithms Complexity and Time-Space Trade-off, Big-O Notation. Strings: Introduction, Strings, String Operations, Pattern Matching Algorithms. | |
| 2 | Arrays: Introduction, Linear Arrays, Representation of Linear Array in Memory, Traversal, Insertions, Deletion in an Array, Multidimensional Arrays, Sparse Matrix. Algorithm for Insertion, Deletion Addition and Multiplication in 2- D Array. Searching and Sorting Techniques, Sorting Techniques: Bubble Sort, Merge Sort, Selection Sort’, Heap Sort, Insertion Sort. Searching Techniques: Sequential Searching, Binary Searching, Search Trees. | |
| 3 | Stacks & Queues: Representation of Stacks, Stack Operations, Applications, Queues, Operations on Queues, Circular Queues, Dequeue, Priority Queues, Applications. Linked Lists: Introduction, Types, Operations (Insertion, Deletion, Traversal, Searching, Sorting), Applications, Dynamic Memory Management, Implementation of Linked Representations. | |
| 4 | Trees: Basic Terminology, Representation, Binary Trees, Tree Representations using Linked List, Basic Operation on Binary tree, Traversal of Binary Trees: In order, Pre-order & Post-order, Applications of Binary tree. Algorithm of Tree Traversal with and without Recursion. Graphs: Definitions and Basic Terminologies, Representation of Graphs, Graph Traversals, Shortest Path Problem, Applications. | |
