Algorithms

Instructor:   Ivona Bezakova, email: my_initials@cs.rit.edu (please replace my_initials with ib)
Class meets:   Mo/We 10:00-12:50, room 15 (ACMT)
Make-up classes: April 1 and May 1 are holidays in Croatia (Easter Monday and Labor Day, respectively). We will make up these classes on Thursday of the same week: April 4 and May 2, at the same time as usual (rooms TBA).
Office hours (tentative):   Mondays/Wednesdays 16:00-17:00 and Tuesdays/Thursdays 13-14, office ACMT-42


0. Homework and Reading Assigments

For information about topics covered in the class, reading and homework assignments, follow this link.


1. Prerequisites

Discrete math and CS4.


2. Text

Algorithm Design by Jon Kleinberg and Eva Tardos.
This webpage: http://www.cs.rit.edu/~ib/Classes/CS515_Spring12-13/index.html


3. Course description and intended learning outcomes.

This course provides an introduction to the design and analysis of algorithms. It covers a large number of classical algorithms and their complexity and will equip students with the intellectual tools to design, analyze, implement, and evaluate their own algorithms.

Intended learning outcomes:


4. Grading Policy Grading scale: 90%-100%: A, 80%-90%: B, 70%-80%: C, 60%-70%: D, 0%-60%: F.
However, your overall grade cannot be more than one letter better than your average exam grade. Moreover, average exam grade F results in failing the class.


5. Topics
6. Technical issues