B.E. (Computer Engineering) Analysis of Algorithm 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 Analysis of Algorithm
Module I: Introduction
- 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
- 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
- General Method, Single source shortest path: Dijkstra AlgorithmFractional 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
- 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
- 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
- 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
- 2 Ellis Horowitz, Sartaj Sahni, S. Rajsekaran. “Fundamentals of computer algorithms” University Press.
- 1 Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani, “Algorithms”, Tata McGraw- Hill Edition.
- 2 S. K. Basu, “Design Methods and Analysis of Algorithm”, PHI
Reproduced from the University of Mumbai syllabus for B.E. (Computer Engineering) under NEP 2020, in force from the academic year 2025-26. 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.