Algorithms 2 - 236359
|
|
|
|
|
| |
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 time | day | date | Season |
|---|
| | Sunday | 25.07.2021 | א |
| | Thursday | 21.10.2021 | ב |
Timetable to semester 02/2020
2020/2021 Spring Semester
| Room | Building | Hour | day | Lecturer | Exercise
Lecture | no. | Registering
Group |
|---|
| 5 | טאוב | 10:30-12:30 | Tuesday | Full Professor Naor Joseph | Lecture | 10 | 11 |
| 8 | טאוב | 13:30-14:30 | Tuesday | Mr. טלמון אוהד | Exercise | 11 |
Textbooks| Published | Publisher | Authors | Book |
|---|
| 1909 | mcgraw hill | cormen, leiserson, rivest | introduction to algorithms |
Created in 22/04/2021 Time 00:05:18
