THE PROJECTS

6 deliverables.
Every one earns its keep.

Six projects instead of fourteen, because each one carries two weeks' worth of concepts — you spend your hours building substantial programs, not restarting every seven days. Every project is graded out of 100 with its rubric printed on the brief, and every one ships in three tiers: Normal is the real target, Medium and Hard are extra credit. Weeks 4 and 8 have no project — those are the midterm and the final.

P1 WEEKLY
Week 1 · C++

Apologist's Card & Fine-Tuning Report

"Who am I, what question am I wrestling with — and is the universe designed?"

Output, input, your first variable; the five primitive types, arithmetic, and the integer-division trap. (Coding 1 chapters 1–2.)
P2 WEEKLY
Week 2 · C++

The Coffee Shop Conversation

"Why does God allow suffering — and is faith just intellectual?"

if/else, boolean operators, and switch; while, for, sentinels, accumulators, and nested loops. (Coding 1 chapters 3–4.)
P3 WEEKLY
Week 3 · C++

Reasoning Toolkit & Manuscript Database

"Can faith be reasoned about — and is the Bible reliable?"

Parameters, return values, scope, pass-by-reference, composition; fixed-size arrays, strings, linear search, and sorting. (Coding 1 chapters 5–6.)
P4 WEEKLY
Week 5 · C++

Stewardship Account & Apologetics Library

"What does Christianity say about money — and about the life of the mind?"

Class basics, public/private, methods, this; constructors, destructors, composition, and managing many objects. (Coding 1 chapters 9–10.)
P5 WEEKLY
Week 6 · C++

Chain of Witnesses & Argument Case File

"Has the faith been continuously believed — and what kinds of arguments are there?"

Pointers, new/delete, linked lists, and the destructor that cleans up; base and derived classes, virtual, override, and polymorphism. (Coding 1 chapters 11–12.)
P6 FINAL
Week 7 · Java

Java Migration & Polymorphic Fleet

"The skill was never the language."

Java syntax, references, garbage collection, the unified class model; @Override, instanceof, static members, and the enhanced-for loop. (Coding 1 chapters 13–14.)