Subject: Subject Sylbus: Algorithms 2 - 236359 (Current)

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.




Times and places of examinations 02/2020 2020/2021 Spring Semester
examination timedaydateSeason
 Sunday25.07.2021א
 Thursday21.10.2021ב

Timetable to semester 02/2020 2020/2021 Spring Semester
RoomBuildingHourdayLecturerExercise
Lecture
no.Registering
Group
5טאוב10:30-12:30TuesdayFull Professor Naor JosephLecture1011
8טאוב13:30-14:30TuesdayMr. טלמון אוהדExercise11


Textbooks
PublishedPublisherAuthorsBook
1909mcgraw hillcormen, leiserson, rivestintroduction to algorithms

Created in 22/04/2021 Time 00:05:18