Monday
Wednesday
May 26
No Class
(Memorial Day)
May 28
p. 1 - 26
Course Introduction
Programming Concepts (Chapter 1)
June 2
p. 27 - 61
Program Design, Output, Input,
Assignment, Calculations,
Variables (2.1 - 2.4)
June 4
p. 62 - 92
Named Constants, Hand Tracing,
Documentation (2.5 - 2.8)
Defining / Calling Modules (3.1 - 3.2)
June 9
p. 92 - 119
Local Declarations, Arguments and
Parameters, Global Declarations
(3.3 - 3.5)
June 11
p. 121 - 141
Review Chapters 1, 2, 3
Decisions, Boolean Expressions,
String Comparisons (4.1 - 4.3)
June 16
p. 141 - 168
Exam 1 (Chapters 1, 2, 3)
Nesting, Case, Logical Operators,
Boolean Variables (4.4 - 4.7)
June 18
p. 169 - 224
Repetition: While, Do-While,
Do-Until, For, Running Totals,
Sentinels, Nested Loops (Chapter 5)
June 23
p. 225 - 265
Random Numbers, Writing Your
Own Functions, Various
Library Functions (Chapter 6)
June 25
p. 267 - 279
Review Chapters 4, 5, 6
Input Validation (Chapter 7)
June 30
p. 281 - 292
Exam 2 (Chapters 4, 5, 6)
Array Basics (8.1)
July 2
p. 295 - 335
Partially-Filled Arrays, Sequential
Search, Array Processing, Parallel
Arrays, 2D and 3D Arrays (8.1 - 8.6)
July 7
p. 375 - 428
File Input and Output Basics, Loops,
Arrays, Records, Control Break Logic
(Chapter 10)
July 9
p. 429 - 445
Review Chapters 7, 8, 10
Menu-Driven Programs: Decisions,
Validation, Modules (11.1 - 11.2)
July 14
p. 445 - 474
Exam 3 (Chapters 7, 8, 10)
Repeating a Menu,
Multiple-Level Menus (11.3 - 11.4)
July 16
p. 475 - 496
p. 519 - 528
Text Processing (Chapter 12)
Defining Classes (14.1 - 14.2)
July 21
p. 528 - 564
Declaring Objects, UML,
Problem Solving, Inheritance,
Polymorphism (14.2 - 14.6)
July 23
Review Chapters 11, 12, 14
July 28
Study Day
(Slip Day if needed)
July 30
Final Exam
(Chapters 11, 12, 14)