Fund. CS II (CS152 2005F)

Class 43: Discussion of Exam 2

Back to Priority Queues. On to Heaps and Heap Sort.

Held: Tuesday, 15 November 2005

Summary: Today we discuss important issues from exam 2.

Related Pages:

Overview:

Problem 1: Dynamic Arrays

Problem 2: Making Change

Problem 3: Interfaces for Testing Change

Problem 4: Searching

Back to Priority Queues. On to Heaps and Heap Sort.

Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Tue Dec 6 09:47:42 2005.
The source to the document was last modified on Thu Aug 25 16:15:09 2005.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS152/2005F/Outlines/outline.43.html.

You may wish to validate this document's HTML ; Valid CSS! ; Check with Bobby

Samuel A. Rebelsky, rebelsky@grinnell.edu