CS106A - Programming Methodologies (Stanford)

The basic, unalterable built-in actions Karel can perform: move(), turnLeft(), pickBeeper(), and putBeeper(). Complex actions like turnRight() must be built via decomposition.

The algorithmic strategy of breaking a complex problem down into smaller, manageable, and reusable subproblems (methods). Each method should perform a single well-defined task.

• Primitive types (e.g., int, double, boolean, char) store raw values directly on the stack.
• Reference types (e.g., Objects, String, arrays) store memory addresses pointing to objects on the heap.

The block of code { ... } within which a variable is declared and accessible. Local variables exist only within their enclosing method/block, whereas instance variables persist for the lifetime of the object.

Java is strictly pass-by-value. For primitives, a copy of the actual value is passed. For objects, a copy of the memory reference is passed, meaning internal object state can be mutated, but reassigning the reference variable itself won't affect the caller.

• Stack: Fast, structured memory storing active method call frames, local variables, and primitive values.
• Heap: Flexible memory space where dynamically allocated objects and instance variables reside.

Logical evaluation where operations stop as soon as the result is determined:
• A && B: If A is false, B is not evaluated.
• A || B: If A is true, B is not evaluated.

• Use a for loop when the number of iterations is known in advance (definite iteration).
• Use a while loop when iterating based on a condition that changes during execution (indefinite iteration).