UMBC CMSC201, Computer Science I, Fall 1994 Sections 0101, 0102 and Honors

Lecture Synopses

Stern Warning

These notes are intended to supplement your own lecture notes. They are not a substitute for attending class. Heck, they are not even a substitute for borrowing your friends' notes. They do, however, contain all the C programs that were displayed on the overhead transparencies, so you don't have to jot them down like mad.

Also, since you must know: Yes, we do make fun of you behind your back when you miss lecture.

Click on the dates below to get a description of that day's lecture.

Th 9/8 Introduction

Tu 9/13 Some simple C programs
Th 9/15 Variables & assignments

Tu 9/20 Data types & expressions
Th 9/22 Programming idioms for loops

Tu 9/27 Building bigger programs
Th 9/29 Boolean data; Quiz 1

Tu 10/4 More while & for loops
Th 10/6 Functions

Tu 10/11 Writing your own functions
Th 10/13 Tracing function calls

Tu 10/18 Stepwise Refinement
Th 10/20 Midterm Exam

Tu 10/25 Libraries & interfaces
Th 10/27 The graphics library

Tu 11/1 The random number library
Th 11/3 Characters & strings

Tu 11/8 Using the string library
Th 11/10 More strings; Quiz 2

Tu 11/15 Modular Development
Th 11/17 Arrays

Tu 11/22 More on arrays
Th 11/24 Thanksgiving break

Tu 11/29 Pointers
Th 12/1 Pointers as parameters

Tu 12/6 Memory allocation; Quiz 3
Th 12/8 Records

Tu 12/13 Recursion

Tu 12/20 Final exam 10:30am - 12:30pm

Last Modified: September 6, 1994

Richard Chang,