B.E. (Artificial Intelligence and Data Science) Analysis of Algorithm Syllabus - Mumbai University 2026
This is the SY BE AI and DS syllabus under NEP 2020, in force from the academic year 2025-26. The third and fourth years of this degree are still taught on the earlier CBCS REV-2019 'C' Scheme, because the University has published no NEP syllabus for Semesters V to VIII of any engineering branch.
Loading syllabus...
Syllabus for Analysis of Algorithm
Module I: Introduction 4 hours
- Performance analysis- Master Method, space, and time complexity Growth of function, Big-Oh, Omega Theta notation Mathematical background for algorithm analysis. Analysis of selection sort, insertion sort. Self-learning Topics: Complexity class: Definition of P, NP, NP-Hard, NP-Complete
Module II: Divide and Conquer Approach 5 hours
- General method, Merge sort, Quick sort, Analysis of Binary search. Self-learning Topics: Finding minimum and maximum algorithms and their Analysis, Strassen's Algorithm, real life applications of all algorithms
Module III: Greedy Method Approach 5 hours
- General Method, Single source shortest path: Dijkstra Algorithm Fractional Knapsack problem, Minimum cost spanning trees: Kruskal and Prim's algorithms Self-learning Topics: Job sequencing with deadlines, real life applications of all algorithms
Module IV: Dynamic Programming Approach 8 hours
- General Method, Multistage graphs, All pair shortest path: Floyd Warshall Algorithm, 0/1 knapsack Problem, Travelling Salesperson problem, Longest common subsequence. Self-learning Topics: Bellman Ford Algorithm, real life applications of all algorithms
Module V: Backtracking and Branch and bound 7 hours
- General Method, Backtracking: N-queen problem, Sum of subsets,Graph coloring. Branch and Bound: Travelling Salesperson Problem, 15 Puzzle problem Self-learning Topics: Real life applications of all algorithms
Module VI: String Matching Algorithms 3 hours
- The Naïve string-matching algorithm, The Rabin Karp algorithm, The Knuth-Morris-Pratt algorithm Self-learning Topics: Real life applications of all algorithms
Text Books
- 1.T. H. Cormen, C.E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to algorithms", 2nd Edition, PHI Publication 2005
- 2 Ellis Horowitz, Sartaj Sahni, S. Rajsekaran. "Fundamentals of computer algorithms" University Press.
Reference Books
- 1 Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani, "Algorithms", Tata McGraw- Hill Edition.
- 2 S. K. Basu, "Design Methods and Analysis of Algorithm", PHI
Online References
- Sr. No. Website Name
- 1 https://nptel.ac.in/courses/106/106/106106131/
- 2 https://swayam.gov.in/nd1_noc19_cs47/preview
- 3 https://www.coursera.org/specializations/algorithms
- 4 https://www.mooc-list.com/tags/algorithms
Reproduced from the University of Mumbai syllabus for B.E. (Artificial Intelligence and Data Science), item 6.20 (N), under NEP 2020, in force from the academic year 2025-26. Wording, module numbering and hours are as printed in that syllabus.
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.