Course Identification

Algorithms
20184141

Lecturers and Teaching Assistants

Prof. Uriel Feige
Dr. Shimon Kogan

Course Schedule and Location

2018
First Semester
Thursday, 14:00 - 15:45, Ziskind, Rm 1
02/11/2017

Field of Study, Course Type and Credit Points

Mathematics and Computer Science: Lecture; Elective; 2.00 points
Mathematics and Computer Science (Systems Biology / Bioinformatics): 2.00 points

Comments

N/A

Prerequisites

basic undergraduate knowledge in algorithms and computational complexity.

Restrictions

No

Language of Instruction

English

Attendance and participation

Expected and Recommended

Grade Type

Numerical (out of 100)

Grade Breakdown (in %)

50%
50%

Evaluation Type

Examination

Scheduled date 1

15/02/2018
Ziskind, Rm 1
1400-1600
N/A

Scheduled date 2

N/A
N/A
-
N/A

Estimated Weekly Independent Workload (in hours)

3

Syllabus

Ranges from basic algorithmic techniques such dynamic programming and greedy algorithms to more advanced topics such as treewidth and graph minors, algorithmic version of the local lemma, linear algebra techniques.

Learning Outcomes

Upon successful completion of this course students should be able to:

[1] Gain familiarity with a host of algorithmic techniques and with methods for analyzing them,.

[2] Develop an understanding of which problems can be computed efficiently (and how) and which problems are beyond the scope of current techniques.

Reading List

There will be lecture notes for the course on my home page

Website

N/A