# Class 38: Discussion of Exam 2

Back to Sorting. On to Pointers to Functions.

This outline is also available in PDF.

Held: Monday, 8 November 2010

Summary: We consider some issues raised by the second examination.

Related Pages:

Notes:

• Exam 2 returned.
• Reading for Tuesday: K&R 5.10-5.11.
• Are there questions on Assignment 7?

Overview:

• General Issues.
• Problem 1.
• Problem 2.
• Problem 3.
• Problem 4.
• Problem 5.

## General

• Problem 3 was clearly the hardest.
• It looks like exam was a bit longer than I anticipated. Sorry.

## Problem 1: Refactoring RPN

• This problem gave you an opportunity to go beyond the basics. (E.g., you could have looked for more places to refactor.)

## Problem 2: Unit Testing

• It was nice to see that some of you took the ideas from this section and applied them elsewhere in the examination.

## Problem 3: Testing Utilities

• Few of you managed to identify and correct all of the errors.
• We'll work through the permutation one slowly.

## Problem 4: Annotating

• Most of you missed a few counts.

## Problem 5: Partitioning

• Lots of solutions. Some were off by 1.
• We'll look at some uses.

## Quicksort, revisited

• How it works.
• Analysis.

Back to Sorting. On to Pointers to Functions.

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 Wed Dec 8 10:57:11 2010.
The source to the document was last modified on Fri Aug 27 07:12:23 2010.
This document may be found at `http://www.cs.grinnell.edu/~rebelsky/Courses/CSC161/2010F/Outlines/outline.38.html`.

Samuel A. Rebelsky, rebelsky@grinnell.edu