CS-2301 Lecture Notes
Below are the lecture notes for CS-2301 (System Programming for Non-majors) for this term. Lecture notes will normally be posted shortly before or shortly after each class. Students are responsible for knowing and understanding all of the lectures, even those that they might miss.
Chapter numbers refer to the course textbook, The C Programming Language, by Brian W. Kernighan and Dennis M. Ritchie.
Some topics in the list are not covered in the textbook. It is in the student’s interest to be sure to attend class and listen carefully to those particular topics.
Note: The PowerPoint versions of the lecture notes include dynamic displays. It is best to view them as a slide show in PowerPoint. The HTML pages are provided for those who do not have access to PowerPoint. They capture the slides but not the appearance, disappearance, and other dynamic changes within any slide.
|
Date |
Topics |
Text |
Lecture |
|
|
Oct 27 |
Introduction |
1 |
||
|
|
Numerical Computation in C |
1.1, 1.2 |
||
|
Oct 30 |
Numerical
Computation — |
1.1, 1.2 |
||
|
|
More about Numerical Computation |
ditto |
||
|
Nov 3 |
Loops,
Conditionals, and other |
3 |
||
|
|
Introduction to Functions |
4 |
||
|
Nov 6 |
Discussion of Assignment #2 |
|
||
|
|
Review and
Continuation of |
4 |
||
|
|
“Loose ends” |
3, 4 |
||
|
|
Recursion
and Function |
4 |
||
|
Nov 10 |
Recursion, Stacks, and Functions |
4 |
||
|
|
Arrays and Pointers |
5 |
||
|
Nov 13 |
Exam #1 |
|
|
|
|
Nov 17 |
Arrays and Pointers (continued) |
5 |
||
|
|
Arrays, Strings, and Pointers |
5 |
||
|
Nov 20 |
File Operations and Lab 5 |
7.5 |
||
|
|
Understanding Bubble Sort |
Not in |
||
|
|
Structures, unions, and typedefs |
6 |
||
|
Nov 24 |
Data Structures — Lists and Trees |
6 |
||
|
|
Lists and Trees (continued) |
6 |
||
|
Dec 1 |
Exam #2 |
|
|
|
|
Dec 4 |
Review of Exam #2 and other topics |
|
||
|
Dec 8 |
Hash Tables
and Constant Time |
6.6 |
||
|
|
Bit Fields & Bitwise Operations |
2.9 |
||
|
|
Introduction to Operating Systems |
Not in |
||