Learning Resources

Use the reading guide for topic assignments rather than adding a second mandatory syllabus.

• The Algorithm Design Manual is the primary local backbone for modeling, design, and counterexamples.
• Introduction to Algorithms supplies alternate formal proofs, recurrence methods, and potential analysis. Edition and generated chunk boundaries vary.
• MIT: Data Structures and Dynamic Arrays is an optional lecture reinforcement.
• Princeton/Kevin Wayne: Dynamic Programming I provides a primary teaching reference for weighted scheduling and reconstruction.

The offline lab package contains course-owned original implementations and exercises. No book purchase, additional package, external judge, or account is required. Use the separate practice key after an attempt and the assessment key after independent work.

Keep the source's assumptions visible when transferring an argument. In particular, equal-value interval scheduling, positive coin denominations, machine-word arithmetic, and append-only dynamic tables are not interchangeable with their more general variants.