Topics discussed in class
| January | February | March | April |
|
Jan 18 - lab 1; for next class read Ch 1 p 1-38, Ch 2 p 43-85 Jan 20 - for next class read Ch 3 p 95-111, p 115 - 133 Jan 25 - lab 1 due; lab 2; for next class read Ch 4 p 140 - 190, Ch 5 p 192-206 Jan 27 - programming project 1 described; for next class read Ch 5 p 206-245, Ch 9 418-422
|
Feb 1 - lab 2 due; lab 3; project analysis due for next class read Ch 6 249-299, Ch 9 423-445 Feb 3 - No Class. Ackermann not available. Feb 8 - lab 3 due; lab 4; for next class read Ch 11 p 548-564 Feb 10 - for next class read Ch 11 p 559-564 Feb 15 - lab 4 due; lab 5; for next time read Ch 11 p564-573; CH 17 p 911-917 Feb 17 - study for the test Feb 22 - test 1 For next class read Ch 11 p573-582 Feb 24 - for next class read Ch 12 588-657; ADT, OOP, & Classes
|
Mar 1 - lab 6; ADT, OOP, & Classes; Mar 3 - for next class read Ch 13 p 662 - 681; Arrays. Mar 10 - no class Spring Break Mar 15 - lab 7; lab 6 due; for next class read Ch 13 p 681-695 Mar 17 - programming assignment due; for next class read Ch 10 450 - 451, 486 - 494, Ch 14 p 723-749 Mar 22- lab 7 due; lab 8; Character arrays - C strings. new assignment; List ADT Mar 24 - List ADT Mar 29 - test 2 for next class read Ch 14 p 749-780; read Ch 15 p 825-846. Mar 31 - for next time read Ch 15 846-852 and Chapter 16 |
Apr 5 - lab 8 due; lab 10 & lab 11; re read ch 14 Apr 7 - read Ch 16 Apr 12 - lab 12 Apr 14; read Ch 16 Apr 19 - Last programming assignment given out read Ch 16 Apr 21 - linked lists, copy constructor, destructor Apr 26 - lab 13 due Apr 28 - Last class for the semester; last programming assignment due by 2AM tomorrow. Review
|
Final exams
Section 1: Friday May 5, 2006; 8:30 - 11:00.
Section 2: Friday May 5, 2006; Noon - 2:30 PM.
| Guidelines for documenting your program | Honor Code Guidelines |
| HP-UX
Tips
Unix tutorials:
|
Compiling,
executing, and preparing C++ assignments on paprika.umw.edu
C++ Tutorials:
|
This page was last modified on
| Other sites | Webliminal.com | Searching and Researching on the Internet and the World Wide Web |

This work is licensed under a Creative Commons License.
Ernest Ackermann Department of Computer Science, Mary Washington College
CPSC 104 | CPSC 220
| Send a comment | Report a problem |
FROM the fortune list ...
What information consumes is rather obvious: it consumes the attention of its recipients. Hence, a wealth of information creates a poverty of attention and a need to allocate that attention efficiently among the overabundance of information sources that might consume it. -- Herbert Simon, 1971