Monday
Wednesday
Jan. 11
Course Introduction
Jan. 13
Chapter 1: The Programming Process, Interaction, Data, Files
Jan. 18
No Class (Martin Luther King, Jr. Day)
Jan. 20
Chapter 1: Flowcharts, Pseudocode, Variables, Sentinel Values
Jan. 25
Chapter 2: The Three Basic Structures
Jan. 27
Chapter 2: Special Structures
Feb. 1
Review Chapters 1 and 2
Feb. 3
Exam 1 (Chapters 1 and 2)
Feb. 8
Chapter 3: Documentation, Modularization
Feb. 10
Chapter 3: Hierarchy Charts, Good Program Design
Feb. 15
Chapter 4: Boolean Expr., Relational Operators, AND, OR
Feb. 17
Chapter 4: Ranges, Precedence, Case, Decision Tables
Feb. 22
Chapter 5: Counters vs. Sentinel Values, Nested Loops
Feb. 24
Chapter 5: Common Loop Mistakes, for Loops, Applications
March 1
Review Chapters 3, 4, and 5
March 3
Exam 2 (Chapters 3, 4, and 5)
March 8
Chapter 6: Arrays: Used in Programs, Declared, Initialized
March 10
Chapter 6: Arrays: Searching, Parallel, Bounds, Processing
March 15
No Class (Spring Break)
March 17
No Class (Spring Break)
March 22
Chapter 6 Examples, Practice
March 24
Chapter 7: Simple Methods, Methods with Parameters
March 29
Chapter 7: Methods with Return Values, Arrays, Design
March 31
Chapter 7 Examples, Practice
April 5
Review Chapters 6 and 7
April 7
Exam 3 (Chapters 6 and 7)
April 12
Chapter 8: Single-Level Control Breaks, Printing Control Data
April 14
Chapter 8: Breaks with Totals, Multiple-Level Control Breaks
April 19
Chapter 8 Examples, Practice
April 21
Chapter 9: Swapping Values, Basic Sorting Algorithms
April 26
Chapter 9: Multidimensional Arrays, Types, Indexes, Lists
April 28
Review Chapters 8 and 9
May 3
Final Exam (Night Section)
5:00 p.m. to 7:00 p.m. - Ch. 8 & 9
May 5
Final Exam (Day Section)
11:30 a.m. to 1:30 p.m. - Ch. 8 & 9