Today's Example

• stack.h
• stack.h

Questions and Answers

We spend a good chunk of most sections answering questions in preparation for Thursday's exam. there really aren't any notes -- for the most part, Q&As are "had to be there" types of things. It is hard to capture the experience within notes.

Exam Topics

• On-line Programming [75% - 80%]

  You'll be asked to implement some data structure, and maybe a trivial program to use it. The data structure should follow the standard idiom we've been using in class. I'll be looking for a problem that involves allocating, freeing, and using dynamic memory as well as function pointers. It is my goal for this part of the exam to tkae you something just less than one hour.
  
  

• Written Theory [20%-25%]

  You'll be asked to answer non-programming questions. These might include questions about linked lists or bsts, details of the C language, or stuff related to function pointers and "const".

  You might want to check out Prof. Hoffman's midterm from last semester -- it has some good "C puzzles". You can find it by googling for "Hoffman 15-123". Although these will be non-programming questions, you'll still be typing your answers.

Stack Example

Some sections spent about 25 minutes building a growable stack based on an array. The exercise as designed to be shorter and easier than an a one hour exam, but otherise a similar experience.