Spreadsheets, Structured Programming, and Flowcharts

Spreadsheet Fundamentals

Spreadsheets organize data in a grid of cells named by column letter and row number (A1, B7). Formulas begin with = and combine cell references, operators (+ - * / ^), and built-in functions. The behavior that the FE tests most is how a reference changes when a formula is copied to another cell:

If =A1*$B$1 in cell C1 is copied down to C2, it becomes =A2*$B$1: the relative A1 advances to A2, while $B$1 stays put. This is the single most common spreadsheet question type. Common functions include SUM(range), AVERAGE(range), IF(test, value_if_true, value_if_false), COUNT, MAX, and MIN. A range like A1:A10 denotes a contiguous block; SUM(A1:A10) adds all ten cells. Order of operations follows standard algebra (parentheses, then exponentiation, then multiply/divide, then add/subtract), so =2+3*4 returns 14, not 20.

Structured Programming and Control Flow

Structured programming builds any algorithm from just three control structures, with no jumps or GOTO statements:

• Sequence — statements execute top to bottom, one after another.
• Selection (branching) — IF / ELSE IF / ELSE chooses among paths based on a Boolean test.
• Iteration (loops) — FOR (fixed count) and WHILE (condition-controlled) repeat a block.

The FE asks you to trace pseudocode and report the final value, not to write syntax. Keep a running table of each variable after every pass.

Worked Example — Loop Trace

sum = 0
FOR i = 1 TO 4
    sum = sum + i
END FOR

Pass-by-pass: i=1 → sum=1; i=2 → sum=3; i=3 → sum=6; i=4 → sum=10. Final sum = 10.

Loop-bound trap: FOR i = 1 TO 4 runs four times (inclusive), but a condition WHILE i < 4 starting at i=1 and incrementing runs only while i is 1, 2, 3 — three times. Confusing < with ≤ is the classic off-by-one error. Watch also for variables modified inside a loop and for nested loops, where the inner loop completes fully on each outer pass (an outer loop of 3 around an inner loop of 4 executes the inner body 12 times).

Flowcharts and Logic Diagrams

A flowchart depicts an algorithm with standardized symbols. Knowing the shapes lets you read or assemble one on the exam:

A diamond always has one entry and two exits (true/false), which is how loops and branches are drawn. To trace a flowchart, start at the oval and follow arrows, evaluating each diamond against the current variable values exactly as you would trace code.

Boolean Logic and Logic Diagrams

Digital and control problems use Boolean logic with operators AND (true only if all inputs true), OR (true if any input true), and NOT (inverts). NAND, NOR, and XOR are derived. A truth table lists the output for every input combination:

XOR (exclusive OR) is true only when inputs differ — a frequent distractor against OR. The NCEES outline lists logic diagrams under Instrumentation and Controls, where they describe control interlocks: evaluate the gates from inputs toward the output to find whether an alarm or shutoff activates. Expect one or two questions asking you to read a small gate network or complete a truth-table row.

Data Representation and Algorithm Basics

Computers store everything in binary (base 2). Each bit is 0 or 1; eight bits make a byte. To convert binary to decimal, sum the place values: 1011₂ = 8 + 0 + 2 + 1 = 11₁₀. To convert decimal to binary, repeatedly divide by 2 and read the remainders bottom-up.

Hexadecimal (base 16) compresses binary four bits at a time (0–F), so it appears in addresses and color codes. Programs also distinguish data types — integers (whole numbers), floating-point (reals, with finite precision that causes round-off), Boolean (true/false), and strings (text) — and using the wrong type is a real source of bugs, e.g., integer division 7/2 yielding 3 rather than 3.5.

Connecting Tools to Numerical Methods

Spreadsheets and short programs are how engineers actually execute the numerical methods from the Mathematics outline: iterating the Newton-Raphson formula in successive cells until the change falls below a tolerance, or summing a trapezoidal-rule series down a column.

Convergence means each iterate gets closer to the answer; a well-built loop stops when |xₙ₊₁ − xₙ| < ε rather than after a fixed count. Recognize that round-off (from finite floating-point precision) and truncation (from stopping a series early) both limit accuracy, and that a sensible algorithm trades iterations for precision. On the FE, this links the computational-tools questions back to roots-of-equations and approximation topics — the tool is the spreadsheet or loop, but the underlying method is the math you already know.