Challenge Your Exam Readiness With Our Free CSP Practice Questions

The loop iterates i = 2, 3, 4. Using 1-based indexing, L[2]=1, L[3]=4, L[4]=1. Summing these yields 1+4+1=6—hold on; re-check carefully: that’s 6, not 8. But the choices include B=6. Let’s recompute precisely to avoid an arithmetic slip:

• Start sum=0

• i=2: sum=0+1=1

• i=3: sum=1+4=5

• i=4: sum=5+1=6

Final output is 6 ⇒ Option B.

This illustrates a core CSP code-tracing skill: pay close attention to index bases and inclusive loop bounds. Many off-by-one mistakes arise when mixing 0- and 1-based mental models. Explicitly listing the visited indices and their values helps verify correctness. During debugging, adding temporary prints (or using a tracing table) can confirm that each iteration updates the accumulator as intended. Accurate tracing supports reasoning about algorithm behavior, performance, and correctness, particularly on exams where small logic slips lead to wrong conclusions.