Course meeting time: TR 8:00-9:15am. place: 208 Smith Hall

Lecture: B.D. Saunders, Office hours TR 9:30-11 in 101E Smith, saunders@cis.udel.edu.

TA: George Oikonomou, Office hours W 11am-1pm in Pearson 115B, goikonom@udel.edu.

Class email: CISC621-010-03F@udel.edu.

Text: Introduction to Algorithms, by Corman, Leiserson, and Rivest.

• Chapter I, Introduction: 0.5 weeks.
• Section II, Sorting: 1 week.
• Section I, Mathematical Foundations: 0.5 weeks
• Section III, Data Structures: 2 weeks.
• Section IV, Design and Analysis Techniques: 1 week.
• Section V, Advanced Data structures: 2 weeks.
• Section VI, Graph algorithms: 2 weeks.
• Section VII, Selected topics:
  • Chapter 31, 32, 33, Methods for mathematical problems: 2 weeks.
  • chapter 34, 35: 1 week.
  • Chapter 36, 37, NP-Completeness: 1 week.

Homework There will be about 25 homework problems, approximately one per class session. They are exercises which are integral to the learning process and are to to be done by each student individually using your own brain cells. The following are considered cheating and will be dealt with accordingly: looking the solution up in outside sources. (These are not learn-the-literature exercises.) looking in any way at solutions from prior years or from other courses; posting the problem on the Internet, seeking a solution; etc. You may ask others for clarifications of the problem statement. If in doubt, ask the TA or lecturer. Homeworks may be done in longhand or online. In any case, submission must be by hardcopy rather than email.

Exams

There will be a midterm exam in class on Thursday, October 30.

There will be a final exam on Tuesday, December 16 at 10:30-12:30 in Smith 208 (the regular classroom for the course). This exam will cover the entire course, and will be 85% "facts" oriented, and 15% problem oriented.

Grading

• Homeworks - 50% more or less
• Midterm Exam - 10%
• Final Exam - 40%
• Class participation - this is the more or less