Subject: Subject Sylbus: Algorithms 2 - 236359

Algorithms 2 - 236359
Credit
Points
3.0
 
Given In
Semester
b
 
  Lecture Exercise Laboratory Project or
Seminar
House
Work
Weekly
Hours
2 1      

Determination of the grade according to progress during the semester and a final examination.


Prerequisites ( Probability (Advanced) 094412
and Theory of Computation 236343 )
or ( Introduction to Probability H 104034
and Theory of Computation 236343 )


Approximation Solutions of Np-Hard Problems. Goldberg'S Algorithm for Network Flow. Efficient Solutions of Certain Flow Problems. Randomized Algorithms. Matching in Graphs. Fast Fourier Transform and Its Applications. Dynamic Programming.




System of hours to the semesters
Semester Previous Semester information 02/2021 2021/2022 Spring Semester


Textbooks
PublishedPublisherAuthorsBook
1909mcgraw hillcormen, leiserson, rivestintroduction to algorithms

Created in 29/09/2022 Time 01:26:59