Programming Fundamentals

Programming fundamentals are the core building blocks used to write any computer program, in any language: variables that hold data, control flow that decides what runs and when, and functions that break logic into reusable pieces. This topic covers that shared vocabulary and mental model so you can read and write code before specializing in one language or paradigm.

itSoftware engineering

Don't Panic — Programming Fundamentals

Programming is the business of writing instructions precise enough for a computer to carry out. That is less mystical than it sounds and more literal than it first appears. The computer is not being difficult when it follows the words rather than the intention; it has only been given words. The useful response is to make the steps visible.

The central creature here is a variable, a name bound to a value. Assignment changes that binding. It is not a tiny declaration of eternal mathematical truth, which is fortunate, because a running total would otherwise have a very awkward afternoon. A value also has a type, so numbers, strings, and booleans can support different operations without everyone pretending that text can be divided by seven.

Then comes control flow, the arrangement that decides what runs and when. A conditional selects the first true branch. A loop repeats a block, either while a condition remains true or once for each item in a collection. If a result is puzzling, trace the state through one loop iteration. A program is a machine for producing changes over time; staring at the final output alone is like reading a mystery from the last page and blaming the book for being brief.

A function gives a sequence of steps a name, input through parameters, and sometimes a result through a return value. Its local scope keeps the names made for one call from wandering into another call's business. That boundary matters. Heavy reliance on global names makes a program harder to follow because any function might change them. Keep a small piece of logic together, then call it with a different argument when the job repeats.

Values also travel in groups. A list keeps an ordered sequence. A tuple keeps a fixed grouping. A dictionary stores values under keys. The catch is mutability: assigning a list to another name does not copy it. Both names can reach the same underlying data, so an update through one is visible through the other. The surprise is not that the list changed; it is that the second name was never a separate list in the first place.

For a working map, open the Intro when a term needs its full explanation, the Slides when relationships need a compact picture, and the Cheatsheet when you need the comparison at hand. Then use the practice reference to trace state before writing code, and build the score-summary exercise to make the pieces cooperate. After that, paradigms explain larger organization, algorithms explain better procedures, and testing explains how to establish that a program works rather than merely runs.

Don't Panic — Programming Fundamentals

Relevant careers