CompSci 161 Reading assignments - Spring 2008 (Dillencourt)
On this page I will post reading assignments.
The required readings
are from the textbook. You are responsible for this material unless
there is a specific note to the contrary.
Occasionally I will post additional readings.
These are not required, but they may provide more background
on the material in the course.
An alternate characterization of required readings vs. additional readings
is the following:
- If the primary question driving
your selection of readings is "Do I have to know this for
the exam ?" then the required readings are adequate.
- If the primary question driving
your selection of readings is "Where can I read more
about the material covered in this course?" then you might want to
check out the additional readings as well.
In the following list, references are keyed to the
list of course books
on the course web page.
- Week 1: Introduction, mathematical review, asymptotic notation:
- Required reading: [GT] chapter 1
- Additional reading: [CLRS] chapters 1,2,3
- Weeks 2-3: Review of data structures; sorting
- Required reading: [GT] 2.1-2.4; 4.1; 4.3-4.6
- Additional reading: [CLRS] chapters 6,7,8
- Week 4-5: Greedy Algorithms; Divide and Conquer algorithms
- Required reading: [GT] 5.1-5.2
- Additional reading: [CLRS] Chapter 16; Section 4.3; Section 28.2
- Week 6: Selection Problems
- Required reading: [GT] 4.7
- Additional reading: [CLRS] Chapter 9; [Baase] Chapter 3
- Week 7: Graphs
- Required reading: [GT] 6.1-6.3; 6.4.1; 6.4.4
- Additional reading: [CLRS] 22.1
- Weeks 8: Weighted graphs
- Required reading: [GT] 7.1; 7.3
- Additional reading: [CLRS] Chapter 23; 24.3
Last updated May 16, 2008