CS 473 - Algorithms I

Semester: Spring, 2015/16
Text Book: T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein Introduction to Algorithms, Mit Press and McGraw-Hill, 2009.
Instructors:
  M. Mustafa Ozdal
  Ugur Dogrusoz
Assistants: R. Oguz Selvitopi (EA505), Tugba Uzluer Torun (EA507)

Lecture Hours:
  Section 1 (Ugur Dogrusoz):
    Tuesday, 9:40 - 10:30
    Thursday, 10:40 - 12:30
  Section 2 (M. Mustafa Ozdal):
    Tuesday, 10:40 - 12:00
    Friday, 9:20 - 10:30
    Office Hour: Thursday, 14:30 - 15:30

Check this page regularly for slides and updates!

Get syllabus here


Exam dates:
Midweek exams are open books, closed notes/slides.

FINAL: May 14 (Saturday), 12:30 - 15:30 (Rooms EE-03, EE-04, EE-05)
  Coverage:
    All lectures covered, up to, including Lecture 12a

  FINAL is CLOSED books. No cheat sheets are allowed. Necessary material will be provided.


Midweek exam #7: April 21, 17:40 - 20:00 (Rooms EE-03, EE-04, EE-05)
  Coverage:
    Dynamic Programming (Lecture 10)
    Greedy Algorithms (Lecture 11)


Midweek exam #6: April 12, 17:40 - 20:00 (Mind the location: Rooms EE-214, EE-317, EE-412)
  Coverage:
    Dynamic Programming (Lecture 10)


Midweek exam #5: April 7, 17:40 - 20:00 (Rooms EE-03, EE-04, EE-05)
  Coverage:
    Sorting in Linear Time (Lecture 09)
    Dynamic Programming (Lecture 10)


Midweek exam #4: March 31, 17:40 - 20:00 (Rooms EE-03, EE-04, EE-05)
  Coverage:
    Median and order statistics (Lecture 07)
    Heaps: heapsort, priority queues (Lecture 08)


MIDTERM: March 16, 17:40 - 20:00 (Rooms EB-101, EB-102, EB-103, EB-104)
  Coverage:
    Lecture 01, 02, 03, 04, 05, 06a, 06b, 07

  Midterm is CLOSED books. No cheat sheets are allowed. Necessary material will be provided.


Midweek exam #3: March 7, 17:40 - 19:30 (Rooms EE-03, EE-04, EE-05)
  Coverage:
    Quicksort (Lecture 05)
    Analysis of Quicksort (Lecture 06a)
    Randomized Quicksort (Lecture 06b)


Midweek exam #2: February 26, 17:40 - 20:00 (Rooms EE-03, EE-04, EE-05)
  Coverage:
    Solving Recurrences (Lecture 03): Recursion Tree Method, The Master Method
    Divide and Conquer Design Paradigm (Lecture 04)

Midweek exam #1: February 11, 17:40 - 19:30 (Rooms EE-03, EE-04, EE-05)
  Coverage:
    Introduction to Analysis of Algorithms (Lecture 01)
    Asymptotic Notation (Lecture 02)
    Up until the end of Substitution Method (Lecture 03)


TOPICS
The lectures belonging to Ugur Dogrusoz are indicated by "UD".
The lectures belonging to Mustafa Ozdal are indicated by "MO".

Last updated: Sat Apr 30 19:19:38 EEST 2016