Study the following pseudocode. Line numbers are for reference only. 10 PROCEDURE Encode () 11 DECLARE CountA, CountB, ThisNum : INTEGER 12 DECLARE ThisChar : CHAR 13 DECLARE Flag : BOOLEAN 14 CountA ← 0 15 CountB ← 10 16 Flag ← TRUE 17 INPUT ThisNum 18 WHILE ThisNum <> 0 19 ThisChar ← LEFT(NUM_TO_STR(ThisNum), 1) 20 IF Flag = TRUE THEN 21 CASE OF ThisChar 22 '1' : CountA ← CountA + 1 23 '2' : IF CountB < 10 THEN 24 CountA ← CountA + 1 25 ENDIF 26 '3' : CountB ← CountB – 1 27 '4' : CountB ← CountB – 1 28 Flag ← FALSE 29 OTHERWISE : OUTPUT "Ignored" 30 ENDCASE 31 ELSE 32 IF CountA > 2 THEN 33 Flag ← NOT Flag 34 OUTPUT "Flip" 35 ELSE 36 CountA ← 4 37 ENDIF 38 ENDIF 39 INPUT ThisNum 40 ENDWHILE 41 OUTPUT CountA 42 ENDPROCEDURE
✓ Correct Answer
The correct answer is —. This question tests the candidate's understanding of algorithms and data structures within the Computer Sciencesyllabus. The examiner's mark scheme requires...
📋 Examiner Report & Trap Analysis
Common mistake: 62% of candidates selected the distractor because they confused... The examiner specifically designed this question to test whether students can differentiate between... To secure full marks, candidates must demonstrate...
Unlock the Examiner's Answer
Sign up for free to reveal the correct answer, the official mark scheme breakdown, and the examiner trap analysis for this question.
Sign Up Free to Unlock →Join thousands of Cambridge students already using Oracle Prep