The document outlines the modules of a data structures course. Module 1 discusses problem solving techniques and implementing algorithms in C. Module 2 covers linked lists, stacks, and queues as well as their implementation in C. Module 3 introduces binary trees, binary search trees, AVL trees, and hashing. Module 4 discusses sorting algorithms like insertion sort, heap sort, and merge sort and their C implementations. Module 5 covers graph basics, representations, and algorithms like shortest paths and minimum spanning trees along with graph implementation in C. Textbooks and references are also provided.
The document outlines the modules of a data structures course. Module 1 discusses problem solving techniques and implementing algorithms in C. Module 2 covers linked lists, stacks, and queues as well as their implementation in C. Module 3 introduces binary trees, binary search trees, AVL trees, and hashing. Module 4 discusses sorting algorithms like insertion sort, heap sort, and merge sort and their C implementations. Module 5 covers graph basics, representations, and algorithms like shortest paths and minimum spanning trees along with graph implementation in C. Textbooks and references are also provided.
The document outlines the modules of a data structures course. Module 1 discusses problem solving techniques and implementing algorithms in C. Module 2 covers linked lists, stacks, and queues as well as their implementation in C. Module 3 introduces binary trees, binary search trees, AVL trees, and hashing. Module 4 discusses sorting algorithms like insertion sort, heap sort, and merge sort and their C implementations. Module 5 covers graph basics, representations, and algorithms like shortest paths and minimum spanning trees along with graph implementation in C. Textbooks and references are also provided.
Problem solving – Top‐down Design– Implementation– Verification – Efficiency– Analysis – Sample algorithms. CO-1 BTL-2 Practical component Top Down Design Algorithm Implementation in C Suggested Readings: Problem Solving Techniques, Algorithmic Efficiency Analysis. MODULE 2 – LISTS, STACKS AND QUEUES (9L+3T) Abstract Data Type (ADT) – The List ADT – Definition, Representation of linked lists in Memory, Memory allocation ‐ Linked list operations ‐Traversing, Searching, Insertion, and Deletion, Doubly Linked lists, Circular linked lists, and header linked lists ‐. CO-2 BTL-2 Applications of Linked lists –The Stack ADT –The Queue ADT Practical component: Implementation of LISTS, STACKS AND QUEUES in C. Suggested Readings: Abstract Data types, Applications of Linear Data structure MODULE 3 – TREES (9L+3T) Preliminaries – Binary Trees – The Search Tree ADT – Binary Search Trees – AVL Trees – Tree Traversals – Hashing – General Idea – Hash Function – Separate Chaining – Open CO-3 BTL-3 addressing. Practical component: Implementation of Binary Tree structure in C Suggested Readings: Applications of Tress, Heaps MODULE 4 – SORTING (9L+3T) Preliminaries– Insertion Sort – Shells sort –Heap sort– Merge sort–Quick sort– External Sorting‐ Topological Sort. CO-4 BTL-3 Practical component: Implementation of Sorting Techniques in C Programming. Suggested Readings: Applications of Tress, Heaps MODULE 5 – GRAPHS (9L+3T) Graph basics, Terminologies, Matrix and Adjacency List Representation of Graphs, Elementary Graph operations – Shortest‐Path Algorithms–Un weighted Shortest Paths– CO-5 BTL-3 Minimum Spanning Tree– Applications of Depth First Search, Breadth First Search. Practical component Graph implementation using C Programming. Suggested Readings: Applications of Graphs, Network problems TEXT BOOKS 1 E.Balagurusamy(2013), Data Structures Using C, Tata McGraw Hill Education Private Limited REFERENCE BOOKS 1 R. G. Dromey(2013) “How to Solve it by Computer” (Chaps 1‐2), Prentice‐Hall of India E BOOKS 1. https://apps2.mdp.ac.id/perpustakaan/ebook/Karya%20Umum/Dsa.pdf MOOC 1. https://www.coursera.org/learn/data-structures 2. https://www.coursera.org/specializations/data-structures-algorithms