CMSC 251, Spring 2002
FINAL EXAM: SATURDAY, MAY 18
4-6pm
<"ROOM CHANGE">
***** PHYSICS 1412 *****
(NOT CHM 0128)
^^^
News
People
Textbook
Syllabus
Lecture Notes
Homework
Exams
Grades
Final exam date
Prerequisites: CMSC 214 and CMSC 250 with grades of C or better.
A systematic study of the complexity of some elementary algorithms
related to sorting, graphs and trees, and combinatorics. Algorithms
are analyzed using mathematical techniques to solve recurrences
and summations.
Section 0101 TuTh......11:00am-12:15pm (CSS 2324)
Section 0201 TuTh......12:30pm- 1:45pm (CSS 2324)
Top
Instructor: D. Perlis
Email:perlis@cs.umd.edu
Office hours: TuTh 2:00-3:00
Office: AVW 3259
TA: Xue Wu
Email:wu@cs.umd.edu
Office hours: Wed 12:00-2:00
Office: AVW 1151
TA: Rajiv Gandhi
Email:gandhi@cs.umd.edu
Office hours: Wed 3:00-5:00
Office: AVW 1151
TA: Grecia Lapizco-Encinas
Email:glapizco@cs.umd.edu
Office hours: Mon 5:00-7:00
Office: AVW 1151
TA: Alejandro Rodriguez
Email:alejandr@cs.umd.edu
Office hours: Fri 1:00-3:00
Office: AVW 1151
Top
Author: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest.
Title: Introduction to algorithms, 2nd edition
Imprint: Cambridge, Mass. : MIT Press ; New York : McGraw-Hill,
Year: 2001.
Top
Homework will normally be assigned on Thursday and due the following
Thursday. There will be 11 homework assignments in all. The lowest
homework grade will be dropped. Homework is a significant aspect of
the course, worth 20% of your course grade.
Top
There will be two midterm exams and one final exam. The lower of the
two midterm grades will be dropped. If you miss one of the midterms,
that will be the dropped grade. There will be no makeup exams.
Top
Saturday, MAY 18, 4:00-6:00pm
Top
Some calculus tables.
Some number stuff
Top
More information will be forthcoming.
Top
