Programming for Computer Sciences
Programming and discrete maths together form the entry point to computer science. Programming concepts mean variables, control flow, functions, recursion and basic problem decomposition in a language like Python or C. Discrete maths supplies logic, sets, relations, counting and proofs, which later support algorithm analysis and theory.
Stage: Programming and Maths · Part of the Computer Science roadmap · Last reviewed 19 November 2026
What to learn in Programming
- Write functions with loops and conditions that solve small problems correctly
- Trace a recursive function and identify its base case
- Translate a plain-English statement into propositional logic
- Use sets and the counting rules for permutations and combinations
- Prove a simple statement by induction
Programming interview questions
What is recursion and when is it better than a loop?
Recursion is when a function calls itself on a smaller version of the problem until it reaches a base case. It fits naturally for trees, divide-and-conquer and backtracking, where the structure is self-similar. A loop is usually simpler and avoids stack growth for linear repetition.
Why is mathematical induction used in computer science?
Induction proves a statement for all natural numbers by proving a base case and showing that truth for n implies truth for n plus one. It is used to prove that loops and recursive algorithms are correct and to derive formulas for running time.
Where Programming fits in the Computer Science roadmap
Programming belongs to the Programming and Maths stage (beginner level), which takes about 40 hours. Foundations.
Other units in this stage
Back to the full Computer Science roadmap