Fund. CS II (CS152 2006S)

Class 50: Discussion of Exam 2

Back to Faster Sorts. On to Graphs.

Held: Tuesday, May 2, 2006

Summary: Today we discuss important issues from exam 2.

Related Pages:

Notes:

Overview:

Problem 1: Graphing Functions

Problem 2: Random Linear Structures

Problem 3: Dynamic Arrays

Problem 4: Heapsort

Back to Faster Sorts. On to Graphs.

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 May 9 08:31:56 2006.
The source to the document was last modified on Thu Jan 12 14:58:07 2006.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS152/2006S/Outlines/outline.50.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu