1: Chapter 5

Question 1

Pseudorandom numbers

Answer 1

Numbers that, although they are derived from predictable and well-defined algorithms, mimic the properties of numbers chosen at random.

Question 2

Priming a loop

Answer 2

Initializing variables before a loop to “prime the pump” and guarantee that the loop is entered.

Question 3

Sentinel

Answer 3

A special value that signals the end of input.

Question 4

Short-circuited evaluation

Answer 4

The property of the logical operators && and || that prevents the second operand from being evaluated if the overall result is obvious from the value of the first operand.

Question 5

Robust

Answer 5

Ability of a program to execute even when presented with illegal data.

Question 6

Assertion

Answer 6

A declarative sentence that is either true or false.

Question 7

Provable assertion

Answer 7

An assertion that can be proven to be true at a particular point in program execution.

Question 8

Formal verification

Answer 8

A field of computer science that involves reasoning about the formal properties of programs to prove the correctness of a program.