http://www.cs.uiowa.edu/~oliveira/C31-SP07/22c31-sp07.htm
Classes: Tu-TH
|
Instructor: Suely
Oliveira, Room: 101H Office Hours: M & Tu E-mail: oliveira@cs.uiowa.edu |
T.A: ON ICON Office hours: Phone:
|
Book: Jon Kleinberg
and Eva Trados, Algorithms
Designs, Addison Wesley, 2006
(ISBN:
0-321-29535-8). Book web site:
http://www.aw.com
DESCRIPTION: The
emphasis of this course is the Design and Analysis algorithms. Topics
include algorithm design techniques divide and conquer, dynamic
programming and greed approaches, analysis techniques (big-0
notation,
recurrence); sorting (merge sort, heapsort, and quicksort), basic
graph algorithms
(depth-first and breadth-first search, minimum spanning trees, shortest
paths); Introduction to NP-completeness and approximation algorithms.
Applications will be emphasized.
PREREQUISITES:
Undergraduate standing, grade of C- or higher in 22C:021 and
22C:019 and 22M:021 or 22M:025 or 22M:031.
HOMEWORK POLICY:
Assignments will normally be due one week after they are assigned and
should be
turned in and picked up in the classroom.
Homework will be usually due on TH and there will be a
discussion in
class before the due date about the homework (more details will be
given in
class).
GENERAL POLICY: You should make every effort to attend all lectures. Missed lecture notes should be obtained from fellow students. Handouts and homework answer sheets can be obtained from the web page. It is the responsibility of the student to notify the instructor in advance if the student cannot attend a regularly scheduled exam. It is expected that students will conduct themselves in a courteous manner to the professor and fellow students. That includes no cell-phone calls, minimal talking in class, and no other actions that are disruptive to the class. Make every effort to arrive on time to class.
SCHEDULE (FIRST 8 WEEKS)
|
Week |
Lectures |
Topics |
Sections |
tentative dates |
|
#1 01/16 |
#1 |
Introduction |
Chapter 1 |
|
|
#1 01/18 |
#2 |
Basics of Analysis |
Chapter 2 |
Hw1 |
|
#2 01/23 |
#3 |
Basics of Analysis |
Chapter 2 |
|
|
#2 01/25 |
#4 |
Graphs |
Chapter 2 |
Hw2 |
|
#3 01/30 |
#5 |
Graphs |
Chapter 3 |
|
|
#3 02/01 |
#6 |
Graphs |
Chapter 3 |
Hw3 |
|
#4 02/06 |
#7 |
Gaphs |
Chapter 4 |
|
|
#4 02/08 |
#8 |
Greedy Algorithms |
Chapter 4 |
Hw4 |
|
#5 02/13 |
#9 |
Greedy Algorithms |
Chapter 4 |
|
|
#5 02/15 |
#10 |
Greedy Algorithms |
Chapter 4 |
|
|
#6 02/20 |
#11 |
Greedy Algorithms |
Chapter 4 |
|
|
#6 02/22 |
#12 |
Greedy Algorithms |
Chapter 4 |
Hw5 |
|
#7 02/27 |
#13 |
Greedy Algorithms |
Chapter 4 |
|
|
#7 03/01 |
#14 |
Divide and Conquer Programming |
Chapter 6 |
|
|
#8 03/06 |
#15 |
|
|
|
|
#8 03/08 |
#16 |
|
|
|
GRADING:
Homeworks ---60%, Midterm ---20%, Final ---20%.
A similar
table will be posted on ICON
for the last 8 weeks of class.
Grades, homeworks, answer sheets, and
due dates are on ICON
(Use your HawkID
and password to log in).
We are asked to post some University Rules.
Here they are :
Note 1:I need to
hear from
anyone who has a disability which may require some modification of
seating,
testing or other class requirements so that appropriate arrangements
may be
made. Please see me after class or during my office hours
.