CS 1320 (Principles of Algorithm Design I):
Lecture Summaries

• January 12: About the course; syllabus.
• January 14: Using your CS account and the CS lab machines; overview of solving problems on computers.
• January 17: Overview of solving problems on computer, continued; overview of hardware / software.
• January 19: Implementation tools; a first program.
• January 21: Integer variables and expressions.
• January 24: Integer variables and expressions, continued.
• January 26: Number systems (binary, decimal, etc.); representing integers in memory.
• January 28: Number systems and representing integers in memory, continued.
• January 31: Number systems and representing integers in memory, continued.
• February 4: Introduction to functions.
• February 7: If/else and boolean expressions.
• February 9: Practice writing functions.
• February 11: Practice writing functions, continued.
• February 14: Practice writing functions, continued. Introduction to non-integer data types.
• February 16: Floating-point data types (double, float).
• February 18: No class; instructor ill.
• February 21: Boolean data type; more practice writing functions.
• February 23: No lecture; exam #1.
• February 25: Review of concepts discussed so far.
• February 28: Introduction to loop constructs ("while" loops).
• March 1: Loop constructs, continued.
• March 3: Loop constructs, continued.
• March 13: Loop constructs, continued.
• March 15: Loop constructs, continued.
• March 17: Redirecting input/output under Unix; introduction to character variables.
• March 20: Character variables, continued.
• March 22: Character variables, continued; introduction to file I/O.
• March 24: No class; exam #2.
• March 27: File I/O, continued; pass-by-reference parameters.
• March 29: File I/O and pass-by-reference parameters, continued.
• March 31: File I/O and pass-by-reference parameters, continued.
• April 3: Introduction to arrays.
• April 5: Review of file I/O; review of introduction to arrays.
• April 7: Arrays, continued.
• April 10: Arrays, continued; random numbers.
• April 12: Arrays, review.
• April 14: Character arrays, an introduction; a quick look at the source-level debugger (gdb).
• April 17 (J. Oldham): Character arrays, continued.
• April 19: Character arrays, continued.
• April 24: Introduction to recursion.
• April 26: Review of character arrays and processing; review of using functions to decompose a problem.
• April 28: Recursion, continued.
• May 1: Discussion of final exam.