CS 473/573 - Algorithms I


Semester:     Fall, 2018-2019
Text Book:   T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, Mit Press and McGraw-Hill, 2009.
Instructor:Cevdet Aykanat
Assistants:   M. Ozan Karsavuran (EA505), Nabil Abubaker (EA505), Gunduz Vehbi Demirci (EA505)
Syllabus:     2018Fall-Syllabus

Classroom:       EE-05
Lecture Hours:
Section 1: Tuesday 09:40-10:30,  Thursday 10:40-12:30
Section 2: Tuesday 13:40-15:30,  Thursday 15:40-16:30


Check this page regularly for announcements.

Exams:
Midweek exams are open books, closed notes/slides.
Midterm and final exams are closed books/slides.

Final: January 8, 15:30 - 18:30

Midweek exam #6: December 26, 17:40 - 19:30
Coverage:
    Graph algorithms
Exam rooms according to last name:
EE-03 Adacal-Bor
EE-04 Bozdag-Giritlioglu
EE-05 Gjuzi-Ozdogan
EE-214 Ozer-Yurdakul

Midweek exam #5: December 5, 17:40 - 19:30
Coverage:
    Dynamic Programming (Lecture 10)
    Greedy Algorithms (Lecture 11)
Midweek exam #4: November 28, 17:40 - 19:30
Coverage:
    Dynamic Programming (Lecture 10 and Lecture 11)

Midterm: November 15, 17:40 - 19:40
Coverage: Lectures 1-9

Midweek exam #3: November 8, 17:40 - 19:20
Coverage:
    Medians and Order Statistics (Lecture 07)
    Heapsort (Lecture 08)
    Sorting in Linear Time (Lecture 09)

Midweek exam #2: October 24, 17:40 - 19:20
Coverage:
    Divide and Conquer Design Paradigm (Lecture 04)
    Quicksort (Lecture 05)
    Analysis of Quicksort (Lecture 06a)
    Randomized Quicksort (Lecture 06b)

Midweek Exam #1: October 10, 17:40 - 19:20
Coverage:
    Introduction to Analysis of Algorithms (Lecture 01)
    Asymptotic Notation (Lecture 02)
    Solving Recurrences (Lecture 03)


TOPICS & SLIDES

Last updated: December 7 2018