W

Computer Science 173
Intermediate Computer Programming

Denison
CS173 Schedule

Week Day Topic Reading
Due
Exercises
HW Due
1
8/28
to
9/1
M Introduction and Course Overview Syllabus  
T Practicum on Linux and C++ development C++ docs thru constants  
W C++ Basics    
F Linux quiz and Software Engineering   Homework 1 for ExtraCredit by midnight
2
9/4
to
9/8
M C++ Basics through control statements C++ docs thru control structures Homework 1 in class
T Practicum on Debugging C++ docs through functions  
W File input; Functions and Arrays C++ docs through arrays and char seq  
F Static Arrays and memory storage 3.2 Homework 2 for EC by midnight
3
9/11
to
9/15
M Arrays, file output, and rand()   Homework 2 in class
T No Class    
W Introduction to Abstract Data Types Chapter 2  
F Pointers, Introduction to Classes 2.4, 4.1-4.3  
4
9/18
to
9/22
M Dynamic Arrays, Classes continued, Logbook start 3.4, 4.4  
T Logbook lab class   Homework 3
W Classes, logbook detail    
F Midterm 1    
5
9/25
to
9/29
M Test redux    
T Test redux completion; designing ADTs   HW4: Logbook class
W Parameter passing, typedef, enum,    
F Constructors (default) and Descructors; List ADT and wrapping Items 6.1-6.3  
6
10/2
to
10/6
M Operator overloading; member and nonmember overloading    
T No class   HW5: List class
array implementation
W Copy Constructor and Assignment Overloading    
F Linked List implementation of the List ADT 6.4  
7
10/9
to
10/13
M Linked List practicum 6.4-6.5  
T More copy constructor and assignment overloading   HW6: List class
linked implementation
W Array implementation of linked lists 6.6  
F Stack ADT 7.1-7.2  
8
10/16
to
10/20
M Stack ADT cont'd   HW7: List class, array linked implementation
T Basic class templates 9.3  
W Midterm topics/review    
F Midterm 2    
9
10/23
to
10/27
M Practicum: infix to postfix 7.3-7.5
5.2

HW8: Stack class array implementation
w/ postfix expr eval

T      
W      
F Queue ADT 8.1-8.2 HW9: Stack class template linked implementation
10
10/30
to
11/3
M Test Review and Begin Recursion 10  
T More Recursion 10.1-10.4  
W      
F Begin Inheritance 14.1 HW10: Queue class, circular (array and linked) implementations
11
11/6
to
11/10
M OSDI Conference, work on HW11    
T    
W 11.3  
F Inheritance and late binding 14.2 HW11: Recursion
12
11/13
to
11/17
M Inheritance continued 14.3 (14.5)  
T Working session    
W O(N^2) sorting algorithms 13.1  
F Merge Sort 13.4 HW12: Inheritance and the Ordered List ADT
Thanksgiving Break 11/18 to 11/26
13
11/27
to
12/1
M Quick Sort 13.3  
T      
W Midterm 3    
F     HW13: Sorting
14
12/4
to
12/8
M      
T      
W      
F     HW14: ML Functions



 All rights reserved, Thomas C. Bressoud and Denison University
For problems or questions regarding this web contact bressoud@denison.edu.
Last updated: 08/29/06.