University of Mumbai Syllabus For Semester 4 (SE Second Year) Analysis of Algorithm: Knowing the Syllabus is very important for the students of Semester 4 (SE Second Year). Shaalaa has also provided a list of topics that every student needs to understand.

The University of Mumbai Semester 4 (SE Second Year) Analysis of Algorithm syllabus for the academic year 2021-2022 is based on the Board's guidelines. Students should read the Semester 4 (SE Second Year) Analysis of Algorithm Syllabus to learn about the subject's subjects and subtopics.

Students will discover the unit names, chapters under each unit, and subtopics under each chapter in the University of Mumbai Semester 4 (SE Second Year) Analysis of Algorithm Syllabus pdf 2021-2022. They will also receive a complete practical syllabus for Semester 4 (SE Second Year) Analysis of Algorithm in addition to this.

## University of Mumbai Semester 4 (SE Second Year) Analysis of Algorithm Revised Syllabus

University of Mumbai Semester 4 (SE Second Year) Analysis of Algorithm and their Unit wise marks distribution

### University of Mumbai Semester 4 (SE Second Year) Analysis of Algorithm Course Structure 2021-2022 With Marking Scheme

# | Unit/Topic | Weightage |
---|---|---|

100 | Introduction to Analysis of Algorithm | |

200 | Divide and Conquer | |

300 | Greedy Method | |

400 | Dynamic Programming | |

500 | Backtracking | |

600 | String Matching Algorithms | |

700 | Branch and Bound | |

Total | - |

## Syllabus

- Decision and analysis fundamentals
- Performance analysis , space and time complexity
- Growth of function – Big –Oh ,Omega , Theta notation
- Mathematical background for algorithm analysis
- Analysis of selection sort , insertion sort
- Randomized algorithms
- Recursive algorithms
- The substitution method
- Recursion tree method
- Master method

- General method
- Binary search
- Finding minimum and maximum
- Merge sort analysis
- Quick sort analysis
- Strassen’s matrix multiplication
- The problem of multiplying long integers
- Constructing Tennis tournament

- General Method
- Knapsack problem
- Job sequencing with deadlines
- Minimum cost spanning trees-Kruskal and prim’s algorithm
- Optimal storage on tapes
- Single source shortest path

- General Method
- Multistage graphs
- All pair shortest path
- Single source shortest path
- Optimal binary search tree
- 0/1 knapsack
- Travelling salesman problem
- Flow shop scheduling

- General Method
- 8 queen problem (N-queen problem)
- Sum of subsets
- Graph coloring

- The naïve string matching Algorithms
- The Rabin Karp algorithm
- String matching with finite automata
- The knuth-Morris-Pratt algorithm
- Longest common subsequence algorithm

- General method
- 15 puzzle problem
- Travelling salesman problem