An algorithm is described as follows: 1. Input an integer value. 2. Jump to step 6 if the value is less than zero. 3. Call the function IsPrime() using the integer value as a parameter. 4. Keep a count of the number of times function IsPrime() returns TRUE. 5. Repeat from step 1. 6. Output the value of the count with a suitable message.
✓ 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