Contact | Textbook | Grading | Objective | Background | Schedule&Materials
Note: TA office hours are held in FL A20 (Fuller basement)
unless otherwise noted.
Twenty three TA office hours per week.
|Thursday||9-12 midnight |
in FL B11
|B01||W 9-9:50||FLB11 (zoo lab)|
|B02||W 10-10:50||FLB11 (zoo lab)|
|B03||W 12:00-12:50||FLB11 (zoo lab)|
|B04||W 1:00-1:50||FLB11 (zoo lab)|
|B05||W 2:00-2:50||FLB11 (zoo lab)|
|B06||W 8-8:50||FLB11 (zoo lab)|
|B07||W 3:00-3:50||FLB11 (zoo lab)|
|B08||W 11-11:50||FLB11 (zoo lab)|
|B09||W 10-10:50||FLB17 (garden lab)|
|B10||W 9-9:50||FLB17 (garden lab)|
|B11||W 11-11:50||FLB17 (garden lab)|
What this course is about
This course covers fundamental programming concepts and techniques of
broad applicability. Specific topics include file input and output,
dynamic memory allocation, abstract data types (ADT's), specification
and implementation of selected ADT's including bags, queues, and stacks;
recursion, sorting, searching, and an introduction to the analysis of
C++ will be used as the implementation language throughout the course. Certain relevant features of C++ will be pointed out as we go along. However, this is not a course about C++. In particular, you may need to develop the necessary facility in certain features of C++ through additional self-study. The homeworks and labs are intended to facilitate this process.
You should have programming experience in a high-level procedural
language like C/C++ or Java at the level of CS 1005 or CS 100X.
Approximate Schedule of Topics
Note: some deviations from this schedule may occur.
Any updates will appear only at http://www.cs.wpi.edu/~alvarez/CS2005/B99/.
The downloadable materials provided below complement the lectures, but are by no means intended to replace them. Students are responsible for all material covered in the lectures also.
Certain links may become available only shortly before the corresponding topics are addressed in the lectures or labs.
|Week||  Reading / Assignments
|Oct. 28-29||section 1.1
|Abstract data types
|Nov. 1 - 5||sections 2.4-2.5
Solution to HW1:
The List ADT
Test 1, Nov. 11
HW2 (due by 5 pm, Nov. 12)
Running time analysis
LL vs. dynamic arrays
|Nov. 15-19||chapters 6, 7, 8, 9||Template functions
|Nov. 22-23||chapter 10||Binary trees||PowerPoint slides
|Nov. 29 - Dec. 3
Test 2, Dec. 2
|chapters 10, 12
Langsam et al, 7.2
HW4 (due by 8 pm, Dec. 3)
Binary tree toolkit
|Dec. 6-10||chapters 12, 13
HW5 (due by 5 pm, Dec. 10)
O(n log n) sorting
Test 3, Dec. 16