An algorithm has been written in pseudocode to check if a new password is in a list of previously used passwords OldList[] If the password is not found, the new password will be stored at the end of the list to replace "XXXX" already stored there. 01 OUTPUT "Enter your new password " 02 INPUT NewPassword 03 Posn ← 1 04 Found ← FALSE 05 REPEAT 06 IF Password = OldList[Posn] 07 THEN 08 Found ← TRUE 09 ELSE Posn ← Posn + 1 10 ENDIF 11 UNTIL Found AND OldList[Posn] = "XXXX" 12 IF Found 13 THEN 14 OUTPUT "Password has been used before" 15 ELSE 16 INPUT "New password accepted" 17 OldList[Posn] ← NewPassword 18 ENDIF
✓ Correct Answer
The correct answer is —. This question tests the candidate's understanding of algorithm design and problem-solving 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