Module 5: Problem-Solving Strategies

This page aggregates the generated reference routes used by the learner-facing module.

• Semester: semester-01-math-foundations
• App: foundations

Read only if stuck

• Dromey: 1.1 Introduction
• Dromey: 1.2.2 Getting started on a problem
• Dromey: 1.2.6 General problem-solving strategies
• Dromey: 1.5 Program verification
• Dromey: 1.3.2 Choice of a suitable data structure
• Dromey: 1.7.4 Probabilistic average case analysis (Part 1)
• Dromey: 1.7.4 Probabilistic average case analysis (Part 2)
• Dromey: 1.3.6 Termination of loops
• Dromey: 1.5.5 Verification of program segments with branches
• Dromey: 1.5.8 Proof of termination
• Dromey: 1.6.2 Inefficiency due to late termination
• Dromey: 1.7.1 Computational complexity
• Dromey: 1.4.4 Debugging programs

Optional deep dive

• Dromey: Algorithm 2.1 Exchanging values of two variables
• Dromey: Algorithm 3.3 Greatest common divisor (Part 1)
• Dromey: Algorithm 3.4 Generating prime numbers (Part 1)
• Dromey: Algorithm 3.7 Raising a number to a large power (Part 1)
• Dromey: Algorithm 4.6 Finding the k-th smallest element (Part 1)
• Dromey: Algorithm 8.6 Permutation generation (Part 1)