Syllabus
|
Course Code: MCA-20-12 Course Name: Data Structures using C++ |
||
| MODULE NO / UNIT | COURSE SYLLABUS CONTENTS OF MODULE | NOTES |
|---|---|---|
| 1 | Introduction to Data Structures: Classification of Data Structures, Complexity of Algorithms, Abstract Data Types, Arrays, Representation of Arrays in Memory, Operations on Array, Strings and its Representation in Memory, Operations on Strings, Pointers, Sparse Matrices. Sorting: Bubble Sort, Selection Sort, and Insertion Sort. Searching: Linear Searching, Binary Searching. Implementation of Arrays, String, Sorting and Searching in C++. |
|
| 2 | Linked Lists: Introduction, Types and Operations (Insertion, Deletion, Traversal, Searching, Sorting), Applications, Dynamic Memory Management, Polynomial Representation and Addition, Implementation of Linked Representations in C++. Stacks & Queues: Representation of Stacks, Stack Operations, Applications, Recursion, Queues, Operations on Queues, Circular Queues, Dequeue, Priority Queues, Applications, Implementation of Stacks and Queues in C++. |
|
| 3 | Trees: Definition and Basic Terminologies, Representation of Trees, Binary Trees, Types of Tree, Representation of Binary Trees, Binary Tree Traversals, Threaded Binary Trees, Binary Search Trees and Operations, AVL Trees, Heap, Heap-Sort, M-Way Search Trees, B-Trees, B+ Trees, Applications, Implementation of trees in C++. |
|
| 4 | Graphs: Definitions and Basic Terminologies, Representation of Graphs, Graph Traversals, Operations on Graphs, Shortest Path Problem (Warshall’s Algorithm and Dijkstra’s Algorithm), Minimum Spanning Tree (Prim’s and Kruskal’s Algorithm), Applications, Implementation of Graphs using C++. Sorting and Searching: Recursive Binary Search, Types of Sorting, Implementation of Different Sorting Techniques in C++: Merge Sort, Radix Sort, Counting Sort, Bucket Sort. Hashing: Hash functions, Collision Resolution, Implementation using Linear and Quadratic Probing, Chaining using C++. |
|
