Which term describes testing an algorithm by stepping through it manually?

Which term describes testing an algorithm by stepping through it manually?

• A. Overflow
• B. Dry-run
• C. Binary shift
• D. Two's complement

Answer: (B)

The main idea being tested here is verifying how an algorithm behaves by simulating its execution step by step with concrete inputs. This manual walkthrough is called a dry-run. By stepping through each instruction and tracking the values of variables, you can see exactly which path the logic takes, where conditions are met or not met, and how loops progress. It’s a powerful way to spot mistakes like off-by-one errors, incorrect condition logic, or how data flows through the program before you translate the idea into code. Why this is the best match: a dry-run is specifically about guiding yourself through the algorithm as if you’re the computer, writing down the state after each step to ensure the logic holds. The other terms refer to different concepts: overflow happens when a value exceeds what a storage location can hold, a binary shift is a bitwise operation that moves bits left or right, and two's complement is a method for encoding negative numbers. So the correct term for manual, step-by-step testing of an algorithm is a dry-run.

The main idea being tested here is verifying how an algorithm behaves by simulating its execution step by step with concrete inputs. This manual walkthrough is called a dry-run. By stepping through each instruction and tracking the values of variables, you can see exactly which path the logic takes, where conditions are met or not met, and how loops progress. It’s a powerful way to spot mistakes like off-by-one errors, incorrect condition logic, or how data flows through the program before you translate the idea into code.

Why this is the best match: a dry-run is specifically about guiding yourself through the algorithm as if you’re the computer, writing down the state after each step to ensure the logic holds. The other terms refer to different concepts: overflow happens when a value exceeds what a storage location can hold, a binary shift is a bitwise operation that moves bits left or right, and two's complement is a method for encoding negative numbers. So the correct term for manual, step-by-step testing of an algorithm is a dry-run.