The Course Deals With Fundamental Concepts in Designing and Analyzing Combinatorial Algorithms. Topics# Sorting Algorithms, Basic Graph Algorithms# Searching, Shortest Paths, Minimum Spanning Tree, Network Flow.

Faculty: Data and Decision Sciences
|Undergraduate Studies
Pre-required courses

(94345 - Discrete Mathematics (for I.e) and 234221 - Introduction to Computer Science N) or (94347 - Discrete Mathematics and 234221 - Introduction to Computer Science N)

Course with no extra credit (contained)

94223 - מבני נתונים ואלגוריתמים 94224 - Data Structures and Algorithms

Course with no extra credit (contains)

44268 - Int. to Data Structur and Algorithms 104291 - Combinatorial Algorithms 234247 - Algorithms 1

Semestrial Information

Weekly Hours

2.5 Academic Credit • 2 Lecture Hours • 1 Discussion Hours

Responsible(s)

Asaf Levin


Registration Groups
11
Lecture Tuesday 10:30 - 12:30 נהול 214 | Asaf Levin
Exercise Tuesday 09:30 - 10:30 נהול 214 | Uri Menkes
Weekly Hours

2.5 Academic Credit • 2 Lecture Hours • 1 Discussion Hours


Exams
Session A: 20-07-2022 13:00 - 16:00
  • נהול 214. 215. 216.
Session B: 22-09-2022 09:00 - 12:00
  • נהול 214. 215.

Registration Groups
11
Lecture Thursday 12:30 - 14:30 נהול 214 | Asaf Levin
Exercise Thursday 14:30 - 15:30 נהול 214 | Yael Friedler
12
Lecture Thursday 12:30 - 14:30 נהול 214 | Asaf Levin
Exercise Thursday 10:30 - 11:30 בלומפילד 153
Weekly Hours

2.5 Academic Credit • 2 Lecture Hours • 1 Discussion Hours


Exams
Session A: 12-07-2021 17:00 - 20:00
  • נהול 112.
Session B: 10-10-2021 13:00 - 16:00
  • בלומפילד 151.

Registration Groups
11
Lecture Thursday 12:30 - 14:30 נהול 214 | Asaf Levin
Exercise Thursday 14:30 - 15:30 בלומפילד 153
69
Enrollment Group No information regarding course hours