University of Mumbai Syllabus For Semester 7 (BE Fourth Year) Advance Algorithms: Knowing the Syllabus is very important for the students of Semester 7 (BE Fourth Year). Shaalaa has also provided a list of topics that every student needs to understand.

The University of Mumbai Semester 7 (BE Fourth Year) Advance Algorithms syllabus for the academic year 2021-2022 is based on the Board's guidelines. Students should read the Semester 7 (BE Fourth Year) Advance Algorithms 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 7 (BE Fourth Year) Advance Algorithms Syllabus pdf 2021-2022. They will also receive a complete practical syllabus for Semester 7 (BE Fourth Year) Advance Algorithms in addition to this.

## University of Mumbai Semester 7 (BE Fourth Year) Advance Algorithms Revised Syllabus

University of Mumbai Semester 7 (BE Fourth Year) Advance Algorithms and their Unit wise marks distribution

### University of Mumbai Semester 7 (BE Fourth Year) Advance Algorithms Course Structure 2021-2022 With Marking Scheme

# | Unit/Topic | Marks |
---|---|---|

100 | Introduction | |

200 | Advanced Data Structures | |

300 | Dynamic Programing | |

400 | Graph Algorithms | |

500 | Maximum Flow | |

600 | Linear Programing | |

700 | Computational Ggeometry | |

Total | - |

## Syllabus

- Asymptotic notations Big O, Big Θ,Big Ω,ο ,ω notations, Proofs of master theorem, applying theorem to solve problems.

- Red-Black Trees:- properties of red-black trees, Insertions, Deletions 2.2 B-Trees and its operations.
- Binomial Heaps:- Binomial trees and binomial heaps, Operation on Binomial heaps.

- Matrix chain multiplication, cutting rod problem and its analysis.

- Bellman ford algorithm, Dijkstra algorithm, Johnson’s All pair shortest path algorithm for sparse graphs

- Flow networks, the ford Fulkerson method, max bipartite matching, push Relabel Algorithm, The relabel to front algorithm.

- Standard and slack forms, Formulating problems as linear programs, simplex algorithm, Duality, Initial basic feasible solution.

- Line Segment properties, Determining whether any pair of segment intersects, finding the convex hull, Finding the closest pair of points.