Fri - March 23, 2007
Readings for Week 11. (Last one.)
Section 9.3.4 on
Mergesort.
Section 3.4 on Skip
Lists.
Posted at 04:03 PM
Fri - March 16, 2007
Readings for Week 10.
Section 7.1 is about multiway search
trees. This section runs 50 pages, but you don't have to read all of
it.
Read sections 7.1, 7.1.1, 7.1.2
and 7.1.7.
Posted at 11:49 AM
Fri - March 9, 2007
Readings for Week 9.
Read section 8.3 on Shortest path
algorithms.
Posted at 10:51 AM
Thu - March 1, 2007
Readings for Week 8.
Read section 8.1 on representations of
graphs, and section 8.3.1 on the WFI algorithm.
Posted at 04:36 PM
Thu - February 15, 2007
Readings for Week 7.
Read sections 9.1.2 and 9.3.2 on
selection sort and heap sort.
Read
sections 10.1 and 10.2 on hashing.
Posted at 10:25 AM
Wed - February 7, 2007
Readings for Week 6.
Read sections 11.1 and 11.2 on Huffman
coding, and section 6.9 on heaps.
Posted at 12:39 PM
Thu - February 1, 2007
Readings for Week 5.
Chapter 6. Section 6.7 We will focus
(entirely) on section 6.7.2 AVL trees.
Posted at 04:44 PM
Thu - January 25, 2007
Readings for Week 4.
Chapter 6. Sections 6.5-6.6
inclusive.
Posted at 09:33 AM
Thu - January 18, 2007
Readings for Week 3.
Chapter 6. Sections 6.1-6.4
inclusive.
Posted at 09:49 AM
Thu - January 11, 2007
Readings for Week 2.
Chapter 5. Recursion Sections 5.1 - 5.10
inclusive.
Posted at 02:15 PM
Sun - January 7, 2007
Readings for Week 1.
All readings are from our text: Adam
Drozdek Data structures and
algorithms in C++, Course Technology
2005 (3rd ed.), unless specified
otherwise.
Chapter 2. Complexiy
Analysis, Sections 2.1 - 2.7 inclusive. You may omit sections 2.8, 2.9 and
2.10.
Posted at 04:32 PM