BE Computer Engineering Semester 7 (BE Fourth Year)University of Mumbai

View all notifications

Advance Algorithms Semester 7 (BE Fourth Year) BE Computer Engineering University of Mumbai Topics and Syllabus

Create free account

      Forgot password?
CBCGS [2019 - current]
CBGS [2015 - 2018]
Old [2000 - 2014]

Topics with syllabus and resources

100.00 Introduction
  • Asymptotic notations Big O, Big Θ,Big Ω,ο ,ω notations, Proofs of master theorem, applying theorem to solve problems.
200.00 Advanced Data Structures
  • 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.
300.00 Dynamic Programing
  • Matrix chain multiplication, cutting rod problem and its analysis.
400.00 Graph Algorithms
  • Bellman ford algorithm, Dijkstra algorithm, Johnson’s All pair shortest path algorithm for sparse graphs
500.00 Maximum Flow
  • Flow networks, the ford Fulkerson method, max bipartite matching, push Relabel Algorithm, The relabel to front algorithm.
600.00 Linear Programing
  • Standard and slack forms, Formulating problems as linear programs, simplex algorithm, Duality, Initial basic feasible solution.
700.00 Computational Ggeometry
  • Line Segment properties, Determining whether any pair of segment intersects, finding the convex hull, Finding the closest pair of points.
View in app×