CPSC 225 Syllabus

Week 1: 1/15-1/19

Topics: course overview and introduction; design recipe; basic C++: program structure, conditionals, loops, functions, I/O, ...

Reading: Savitch ch 1-3 (read during first week)
Plan to do the readings before class on the day listed, so that class time can be spent on addressing questions and trickier topics.

Handouts:

• design recipe

Examples:

• windchill function (not a complete program!) (design recipe, basic C++ syntax)
• palindrome order (not a complete program!) (design recipe applied to a whole program)

Week 2: 1/22-1/26

Topics: designing programs; C++: parameter passing, function overloading, arrays

Reading: Savitch 4.1-4.2 (Mon), ch 5 (Wed)

Handouts:

• notes on lab 1

Examples:

• meters to feet and inches conversion (reference parameters for returning more than one value from a function)
• mastermind (arrays, random numbers, testmain/realmain idea)

Week 3: 1/29-2/2

Topics: files and streams; strings; commandline arguments; classes; separate compilation and makefiles

Reading: Savitch 9.1-9.3, 12.1-12.2 (Mon), 6.2, 7.1-7.2, 11.1 (Wed)

Handouts:

• notes on programming assignment 1 (natural prestidigitation)
• notes on programming assignment 2 design (sudoku)

Examples:

• copy (commandline parameters, files, streams, reading individual characters, streams as function parameters)
• copy, version #2 (more with streams as function parameters, the ( condition ? value1 : value2 ) syntax)
• dice class (class declaration, header file)

Week 4: 2/5-2/9

Topics: classes; separate compilation and makefiles

Reading: no new reading

Handouts:

• notes on lab 2 (elimination rhyme)
• notes on programming assignment 3 design (scrbl)

Examples:

• dice class (class declaration, header file, implementation file)
• 21 game (using objects, makefiles)
• yahtzee design (class design)

Week 5: 2/12-2/16

Topics: working with arbitrarily large collections of things: pointers and dynamically-allocated memory; exam

Reading: Savitch 10.1-10.2 (Mon)

Handouts:

• notes on programming assignment 2 (sudoku)

Examples:

• pointers (pointers, dereferencing, pointers as parameters to functions)

Week 6: 2/19-2/23

Topics: dynamically-allocated arrays; linked lists

Reading: Savitch 17.1 (Mon)

Handouts:

• notes on lab 3 (bug hunt)
• notes on lab 4 (lander)

Examples:

• linked lists: ListNode class
• linked lists: manipulations (print, append)

Week 7: 2/26-3/2

Topics: linked lists; designing collections classes; dynamically-allocated memory and classes

Reading: Savitch 10.3 (Fri)

Examples:

• linked lists: manipulations (nth)
• program development (scrbl)
• Vector (Vector ADT, implementing collections classes, classes with dynamically-allocated memory)

Week 8: 3/5-3/9

Topics: dynamically-allocated memory and classes; stacks and queues

Reading: Savitch 17.2 (Wed)

Handouts:

• notes on programming assignment 3 (scrbl)
• example of design for lab 5 (monopoly)

Examples:

• Vector (Vector ADT, implementing collections classes, classes with dynamically-allocated memory)

3/12-3/16

Week 9: 3/19-3/23

Topics: collections, stacks and queues

Reading: Savitch 17.2 (Wed)

Handouts:

• notes on programming assignment 4 design (darwin)
• designing collections

Week 10: 3/26-3/30

Topics: implementing stacks and queues; templates; class hierarchies and inheritance

Reading: Savitch 17.2 (Mon), 16.1-16.2 (Thu), 14.1 (Fri)

Examples:

• StackLL (Stack ADT, implementing collections classes, classes with dynamically-allocated memory, linked lists)
• BankAccount (program design with inheritance)

Handouts:

• notes on programming assignment 4 setup phase (darwin)

Week 11: 4/2-4/6

Topics: inheritance, polymorphism, abstract classes

Reading: Savitch 15.1 (Mon); 14.2*, 15.2 (Wed)
* you can skip the parts on "Protected and Private Inheritance" and "Multiple Inheritance" at the end of section 14.2

Examples:

• BankAccount (program design with inheritance)
• Employees (program design with inheritance)

Week 12: 4/9-4/13

Topics: inheritance; trees; exam

Reading: Savitch 17.4 (Wed)

Examples:

• Critters (program design with inheritance)

Week 13: 4/16-4/20

Topics: trees

Reading: Savitch 17.4 (Mon)

Handouts:

• notes on programming assignment 5 design (photoshop)

Examples:

• BinaryTreeManipulation (working with binary trees)

Week 14: 4/23-4/27

Topics: binary trees; recursion

Reading: Savitch ch 13 (Wed)

Handouts:

• notes on programming assignment 4 (darwin)

Examples:

• BinaryTree (binary tree class and implementation)
• Recursion (implementing recursive definitions, recursive solutions to problems)

Week 15: 4/30-5/4

Topics: recursion; wrapup

5/5-5/8

last updated: --Tue Jan 15 00:22:04 EST 2008--
page owned by: bridgeman@hws.edu