Tuesday and Thursday, 2:00-3:15, CAST206
Yoo-Ah
Kim (Office: ITEB 239)
Phone: (860)486-1458, E-mail: ykim@engr.uconn.edu
Office hours: Tue & Thu 10 -11
(or by appointment)
|
[ Overview | Schedule & Lecture Notes | Homework ] |
Required - Introduction
to Algorithms (Second Edition) by Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, published by MIT Press and McGraw-Hill.
Recommended -
Computer Algorithms by E. Horowitz, S. Sahni, and
Network Flows: Theory,
Algorithms, and Applications, by Ravindra K. Ahuja, Thomas L. Magnanti, and
James B. Orlin, Prentice Hall, 1993
Course work will consist of homework assignments, and 2
exams (a midterm and a comprehensive final). Homeworks are to be turned in at
the start of class on the due date. No late homeworks will be accepted.
Assignments are to be written up neatly. Badly written assignments will not be
graded. Please staple your homework.
All homeworks are expected to be done independently. You may discuss general
solution strategies with classmates, but you must write up the solutions
in your own words.
It is your responsibility to make sure that you pick up all homeworks and
handouts. All course information and homeworks will be available on the web
page. Solutions to homeworks will be given out in class.
Final grades will be based on homework assignments, a
midterm exam, and a comprehensive final exam. The relative weights of these
will be roughly 10% for the homework total, 40% for the midterm, and 50% for
the final exam.
The topics and order listed below are tentative and subject to change.