Computer Science 6783 -- Applied Algorithms, Winter 2012

Announcements | Course information | Important dates | Assignments and tests | Lecture notes



Assignments and tests

For typesetting please use LaTeX. A good introduction to LaTeX is "Essential LaTeX" .


Course information

Lectures: 15:30-16:50 Tuesday/Thursday (note the change!) in the seminar room (EN-2022)
Antonina Kolokolova , email: [Your browser cannot view this email address] , office ER-6033.
Instructor office hours: -Mondays 5-6pm, Wednesday 1-2pm, or by appointment.
Textbook: There will be no official textbook for this course.

Reference book:

We will also use other materials such as research papers.

Marking scheme (tentative!): 3 assignments 10% each, a test 30%, and a project 30% with a 10% presentation.

Description: The goal of this course is to study both classical and advanced algorithm design techniques with emphasis on real-world applications. We will cover greedy algorithms, dynamic programming, backtracking as well as fast Fourier transform, Integer Linear Programming, etc. The applications would come from many fields, including Bioinformatics and Cryptogaphy. Time permitting, we will consider randomized, parallel and distributed algorithms, and/or streaming algorithms.


Lecture Notes

A brief list of topics for the test (review sheet).