Tuesday
Thursday
June 2
Course Introduction
Ch. 1: The Programming Process
June 4
Ch. 1: Interaction, Data, Files, Flowcharts, Pseudocode
June 9
Ch. 2: The Three Basic Structures, Special Structures
June 11
Review Chapters 1 and 2
June 16
Exam 1 (Chapters 1 and 2)
June 18
Ch. 3: Documentation, Modularization, Hierarchy Charts
June 23
Ch. 3: Program Design, Practice
Ch. 4: Boolean Expr., Relational Op.
June 25
Ch. 4: AND, OR, Ranges, Precedence, case, Dec. Tables
June 30
Ch. 5: Counters vs. Sentinel Values, Nested Loops, Common Mistakes
July 2
Ch. 5: for Loops, Application
Review Chapters 3, 4, and 5
July 7
Exam 2 (Chapters 3, 4, and 5)
July 9
Ch. 6: Arrays: Used in Programs, Declared, Initialized, Searching
July 14
Ch. 6: Arrays: Parallel, Bounds, Processing, Examples, Practice
July 16
Ch. 7: Simple Methods, Parameters, Return Values, Arrays
July 21
Ch. 7: Method Design, Practice
Review Chapters 6 and 7
July 23
Exam 3 (Chapters 6 and 7)
July 28
Ch. 8: Single-Level Breaks, Output, Totals, Multiple-Level Breaks
July 30
Ch. 8: Examples, Practice
Ch. 9: Swapping, Sorting Algorithms
Aug. 4
Ch. 9: 2D Arrays, Indexes, Lists
Review Chapters 8 and 9
Aug. 6
Final Exam
(Chapters 8 and 9)