B.E. (Automation and Robotics) Data Structures and Algorithms Syllabus - Mumbai University 2026
The University has moved this degree onto NEP 2020 one year at a time. The first and second years are NEP 2020 syllabi; the third and fourth years are still examined on the REV-2019 'C' Scheme, which is what the University sets for them this year.
Loading syllabus...
Syllabus for Data Structures and Algorithms
Module 1: Introduction: Introduction, Mathematics Review, Exponents, Logarithms, Series, Modular Arithmetic, The P Word, A Brief Introduction to Recursion, Recursion and Induction. Algorithm Analysis: Mathematical Background, Model, What to Analyse, Running Time Calculations, General Rules, Solutions for the Maximum Subsequence Sum Problem, Logarithms in the Running
- Time, Euclid's Algorithm, Exponentiation, Checking Your Analysis, A Grain of Salt.
Module 2: Stacks, Queues and List: Stacks, Queues, Linked Lists, Double-ended Queues. Abstract Data Type (ADT), The List ADT, Simple Array Implementation of Lists, Linked Lists, Programming Details, Common Errors, Doubly Linked Lists, Circularly Linked Lists, Examples, Cursor Implementation of Linked Lists, The Stack ADT, Implementation of Stacks,
- Applications, The Queue ADT, Array Implementation of Queues, Applications of Queues.
Module 3
- Trees and Search Trees: Tree, Implementation of Trees, Tree Traversals with an Application, Binary Trees,Expression Trees, the Search Tree ADT-Binary Search Trees, AVL Trees, SingleRotation, Double Rotation, Red-Black Trees, External searching in B-Trees, Tree Traversals, B-Trees
Module 4
- Priority queues: The priority queues Abstract data Type, Implementing a Priority queues with a List, Heaps, Adaptable priority queues.
Module 5
- Sorting Sets, and Selection: Insertion Sort, Shellsort, Heapsort, Quicksort, Bucket Sort, Merge Sort and radix Sort, and A Lower Bound on comparison based Sorting and radix Sort, the complexity of some sorting algorithms, comparison of Sorting Algorithms, The Set ADT and union / file Structures
Module 6
- Graphs: The graph Abstract Data Type, Data Structures for Graphs, Graph Traversals,Directed Graphs, Weighted Graphs, Shortest Paths, and Minimum spanning Trees. Applications of DFS and BSF, Shortest-Path Algorithms, Dijkstra's Algorithm,Graphs with Negative Edge Costs, Acyclic Graphs, Network Flow Problems,Minimum Spanning Tree
Text Books
- 1 Mark Allien Weiss, “Data Structure and Algorithm Analysis in C”, Person.
- 2 Micheal Goodrict, Roberto Tamassia,” Data Structure and Algorithm in C++”, Wiley India
- 3 Data Structures A Psedocode Approach with C, Richard F. Gilberg & Behrouz A. Forouzan, second edition, CENGAGE Learning.
- 4 Data Structures Using C & C++, Rajesh K. Shukla, Wiley- India
- 5 Data Structures using C, Reema Thareja, Oxford University press.
- 6 Introduction to Data Structure and its Applications Jean-Paul Tremblay, P. G. Sorenson
- 1 . Ellis horowitz, Sarataj Sahni, S.Rajsekaran,” Fundamentals of computer algorithm”, University Press .
- 2 Mark Allen Weiss,”Data Structure & algorithm Analysis in C++”, 3 Edition, Pearson Education rd
- 3 Data Structures Using C, ISRD Group, Second Edition, Tata McGraw-Hill
- 4 Data Structure Using C, Balagurusamy
- 5 C & Data Structures, Prof. P.S. Deshpande, Prof. O.G. Kakde, Dreamtech press.
- 6 Data Structures, Adapted by: GAV PAI, Schaum’s Outlines. 19
Reproduced from the University of Mumbai syllabus for B.E. (Automation and Robotics) under REV-2019 'C' Scheme, in force from the academic year 2023-24. Wording is as printed in that syllabus. Module numbering is as printed there too.
The complete syllabus
This subject is cut from the University circular for its year. Open a document here if you want the whole thing rather than a single subject.