LECTURE SCHEDULE AND TEXT ASSIGNMENTS
CS 171, SPRING 2001

The general study strategy should be: (1) read ahead in the text to prepare for the next lecture and (2) complete the problems based on current lecture. Thus a standing assignment is to always read and study the text material in advance of the class in which it will be discussed.

DATE
PAGES IN TEXT
TOPICS
ASSIGNMENT
1/23 1-16 Course Syllabus; how the Turbo environment works Read 1-27
1/25 Review 1-16; read ahead 16-44 Hardware vs software; further Turbo examples; basic idea of top-down design; Var; Char; String; Const Page 11: 1-10
1/30 16-44 Read; Readln; Write; Writeln; Units; Pascal data types; arithmetic operations on integers; order of operations Page 22: 1-17 odd;
Page 31: 1-5;
Page 42: 1-23 odd
2/1 45-70
PROGRAM #1
DUE 2/2
Real numbers in Turbo Pascal; Real number functions-- TRUNC, ROUND, SQR, SQRT, ABS; Boolean operators Page 58: 1-11 odd and #12
2/6 70-91 Order of boolean operations; If-Then & If-Then-Else constructions; WHILE loops Page 74: 1-13 odd;
Page 86: 1-15 odd
2/8 Review 70-91
91-104
PROGRAM #2
DUE 2/9
EOF Boolean; File I/O and Program #3 handout; Nested If-Then-Else constructions Page 86: 2-16 even;
Page 90: #19;
Page 101: 1-17 odd;
Page 104: 22
2/13 105-127 CASE construction; Nested WHILE-DO loops (start) Page 113: 1-11 odd;
Page 116: #14;
Page 136: 1-15 odd
2/15 EXAM #1 (Chapts 1 & 2; While loops; EOF Boolean; Text File I/O)
2/20 121-140 Nested WHILE-DO loops
REPEAT-UNTIL loops
Page 140: #19
Page 149: 1-9
Page 152: #11a,b
2/22 141-153
PROGRAM #3
DUE 2/23
Program 4 Handout Page 164: 1-5
Page 165: 14
2/27 154-170 FOR-DO loops; GOTOXY
User defined Procedures (modules)
Page 164: 6-13 odd
Page 164: 16
3/1 172-199 Actual vs. formal parameters
Value vs. Variable parameters
Page 205: 1-5
Page 205: 8,9
Page 206: 6-11; 15
3/6 199-211 User-defined functions; scope rules Page 220: 1,2,3
3/8 EXAM 2 (Chapter 3, relevant sections of Chapter 4)
3/13 212-242
PROGRAM #4
DUE 3/12
Global vs. local parameters
Further examples of scope rules;
Program #5 Handout
Page 220: 4-11;14,15
Page 234: 1,2,3
3/15 227-258 Further topics in scope rules;
Data types; user-fined data types
Page 234: 4,7
Page 254: 1-23 odd
3/20 259-280 Sets; strings in Pascal;
string procedures & functions
Page 275: 1-13;19
3/22 281-296 EOLN and EOF Booleans & examples
Program #6 Handout
Control breaks
Page 293: 1-16;
21,23
SPRING BREAK
4/3 296-330
PROGRAM #5
DUE 4/2
The Control Break Problem
Arrays (single dimensional)
Page 311: 1-3;13;18
Page 339: 1-6;19
4/5 330-356 Arrays used in procedures; sorting algorithms Page 339: 7-13; 21
Page 353: 1-7;11,12
4/10 356-368
PROGRAM #6 DUE
More sorting techniques
Binary Search algorithm
Program #7 handout
Page 365: 1-4,12
4/12 368-386 Problems using parallel arrays Page 378: 1,3,8,9
4/17 387-403;
428-442
Record structures in Pascal Page 439: 1-13 odd
4/19 EXAM #3 (Pages 227 - 442; omit two dimensional arrays)
4/24 403-426
PROGRAM #7
DUE 4/23
Program #8 Handout
Parallel Arrays vs. Arrays of records
Page 399: 1-5
Page 420: 1-9 odd
4/26 443-464 Nested records; WITH statement
Two-dimensional arrays in Pascal
Page 457: 1-11 odd;
13,14
5/1   More on two-dimensional arrays in Pascal  
5/3 466-494 Questions re Program #8
Program #8 due on 5/11
Non-text files
Page 474: 1-7;10
Page 489: 1-7
5/8 More on non-text files
Review
5/10 PROGRAM #8
DUE 5/11
Last class; review
5/15 FINAL EXAM: Section 4 at 7:45 am
5/17 FINAL EXAM: Section 3 at 1:00 pm


Return to
CS-171
Home Page
    Return to
UW-W
Home Page
   
This page last updated
23 January 2001