Assignments:

Assignment 1: pg 80 #2.28 - Please do this using integer division and modulus. Due: Tuesday 9/8/09

Assignment 2: pg 130 #3.12 - Due 9/15/09

Assignment 3: The Monty Hall Problem Due 9/22/09

Assignment 4: pg 402 #7.22 - Sales slips, 2D array - Due 10/6/09

Assignment 5: pg 470 #8.16 and pg 469 #8.12 - Poker - Due 10/13/09

Assignment 6: pg 577 #10.9 - Creating a Set Class. Due Tuesday 11/3/09

Assignment 7: pg 639 #11.15 A Rational Class with Overloaded Operators - Due Tuesday 11/10/09

Assignment 8: pg 755 #13.16 - Polymorphic Banking System Due Thursday 11/19/09

• Note: Please create a makefile for this project and resubmit.

Labs:

Lab 0: Getting Started Due: At conclusion of lab 8/31/09.

Lab 1: pg 79 #2.19 Due: At conclusion of lab 8/31/09.

Lab 2: Histogram Due: At conclusion of lab 9/14/09.

Lab 3: pg 331 # 6.59 Due: At conclusion of lab, 9/21/09.

• NOTE: For templatized classes or functions, you must put the class or function header file and the class or function implementation together in one ‘.cpp’ file. The application file should be separate.

Lab 4: pg 407 # 7.32 Palindromes - Due: At conclusion of lab 9/28/09.

Lab 5: pg 471 # 8.17 Tortoise and Hare - Due: at conclusion of lab 10/4/09

Lab 6: pg 527 #9.6 The Rational Class - Due: at conclusion of lab, 10/12/09

Lab 7: pg 528 #9.14 Huge Integer Class - Due at conclusion of lab, 10/26/09

Lab 8: pg 577 #10.8 A Savings Account Class - Due: at conclusion of lab 11/2/09

Lab 9: pg 691 #12.10 Account Inheritance Hierarchy - Due at conclusion of lab 11/9/09

Lab 10: pg 691 #12.9 Package Hierarchy - Due at conclusion of lab 11/16/09

Lab 11: pg 755 #13.15 Polymorphic Package System - Due at conclusion of lab 11/23/09

Lab 12: Gnu Debugger - Using the Gnu Debugger - Enter the program in the debugger tutorial and follow the steps given. The actual line numbers of your code used in the debugging section may be a bit different because of your formatting. See if you can capture the output to hand in. Let me know if anything needs to be corrected in the tutorial.

Exams:

Exam 1:

Tuesday, October 13, 2009

* One page of handwritten notes

Topics:

1. Chapters 1 - 8
2. Write a class
3. Structured programming (control statements)
4. Recursion
5. Arrays - 1 and 2 dimensions
6. Arrays - char arrays
7. Arrays - passing to functions
8. Scoping and lifetime (local variables, etc.) - trace a program
9. Pointers and references

Exam 2:

Tuesday, November 24, 2009

* One page of handwritten notes

Topics:

1. Chapters 8 - 13
2. Skip proxy classes

Final Exam:

The final exam is a programming project that simulates a checkout counter with a queue of customers:

Final Project

Due 12/18/09