W

Computer Science 173
Intermediate Computer Programming

Denison
CS173 Schedule

Week Day Topic Reading
Due
Exercises
HW Due
1
1/15
to
1/19
M Introduction and Course Overview Syllabus  
T Practicum on Linux and C++ development Gaddis Ch. 2 & 3  
W C++ Basics: expressions, conditionals, loops Gaddis Ch. 4 & 5  
F Quiz1 and Software Engineering Nyhoff 1, 2.1-2.3 Ch. 3 Progs, 3, 10, 15, 17, 25 with comments
2
1/22
to
1/26
M No Class; MLK Observence    
T C++ Basics: Functions Gaddis Ch. 6  
W Practicum on Debugging Gaddis Ch. 7  
F C++ Basics: Arrays, pointers, memory Gaddis Ch. 9, Nyhoff 3.2 Ch. 5 progs: 17, 21;
Ch. 6 progs: 8, 9, 10 with comments
3
1/29
to
2/2
M Static Arrays and memory storage Gaddis Ch. 10  
T Arrays, file output, and rand() Gaddis Ch. 11  
W Introduction to Abstract Data Types Chapter 2  
F Pointers, Introduction to Classes 2.4, 4.1-4.3 Homework 3
4
2/5
to
2/9
M Dynamic Arrays, Classes continued, Logbook start 3.4, 4.4  
T Logbook lab class    
W Classes, logbook detail    
F Midterm 1    
5
2/12
to
2/16
M Test redux   Homework 4: Logbook
T Test redux completion; designing ADTs    
W Parameter passing, typedef, enum,    
F Constructors (default) and Descructors; List ADT and wrapping Items 6.1-6.3  
6
2/19
to
2/23
M Operator overloading; member and nonmember overloading   Homework 5: Unordered List
T Copy Constructor    
W Assignment Overloading    
F Stream insertion overloading and non-member function overload 6.4  
7
2/26
to
3/2
M Linked List practicum 6.4-6.5 Homework 6: Linked List Foundation
T More copy constructor and assignment overloading    
W Array implementation of linked lists 6.6 Homework 6a: copy constructor, assignment overload, and stream insertion overload.
F Stack ADT 7.1-7.2  
8
3/5
to
3/9
M Stack ADT cont'd    
T Basic class templates 9.3  
W Midterm topics/review   Homework 7: Stack -- Array Implementation
F Midterm 2    
9
3/19
to
3/23
M Test review
 
T Infix to postfix; C++ strings and stringstreams 7.3-7.5  
W C++ strings and stringstreams   Homework 8: Stack -- Linked Implementation
F Queue ADT 8.1-8.2  
10
3/26
to
3/30
M Stack Activation Records and Begin Recursion 7.4 and 10  
T More Recursion 10.1-10.4  
W     Homework 9: Queue -- Circular Array and Linked Implementations
F      
11
4/2
to
4/6
M Begin Inheritance 14.1  
T Inheritance continued 11.3  
W Inheritance and late binding 14.2-14.5 Homework 10: Doubly Linked List and Recursion
F Class cancelled    
12
4/9
to
4/13
M O(N^2) sorting algorithms 13.1  
T Merge Sort 13.4  
W Merge Sort II and Review 13.3 Homework 11: Ordered List ADT and Inheritance
F Midterm 3    
13
4/16
to
4/20
M Quick Sort    
T Quick Sort conclusion; begin Sorting out Sorting    
W Finish Sorting out Sorting   Homework 12: Sorting Algorithm Performance
F ML Basics    
14
4/23
to
4/27
M ML Lists    
T ML Pattern Matching    
W      
F      
4/30 M     Homework 13: ML Functions



 All rights reserved, Thomas C. Bressoud and Denison University
For problems or questions regarding this web contact bressoud@denison.edu.

Last modified: Tuesday, April 24, 2007 6:00 PM