A school registrar is writing a subroutine to determine if a student is eligible for a specific academic scholarship based on their GPA.
1 SUBROUTINE CheckScholarship(studentID, minGPA)
2 ids ← ['S101', 'S102', 'S103']
3 gpas ← [3.8, 3.2, 3.9]
4 i ← 0
5 eligible ← false
6 WHILE i < 3
7 IF ids[i] = studentID THEN
8 IF gpas[i] >= minGPA THEN
9 eligible ← true
10 ENDIF
11 ENDIF
12 i ← i + 1
13 ENDWHILE
14 RETURN eligible
15 ENDSUBROUTINE
Lines 7 and 8 could be replaced with a single line.
Select the option that corresponds to the correct new line.
IF ids[i] = studentID OR gpas[i] >= minGPA THEN
IF ids[i] = studentID AND gpas[i] > minGPA THEN
IF ids[i] = studentID AND gpas[i] >= minGPA THEN
IF NOT (ids[i] = studentID) AND gpas[i] >= minGPA THEN
Practise AQA GCSE Computer Science Boolean operations in a programming language with exam-style questions for GCSE Computer Science. 19 questions, matched to the AQA GCSE Computer Science (8525) specification and written in Paper 1 and Paper 2 style. Every question includes a full worked solution and mark scheme, so you can see where marks are awarded rather than just whether you got the answer right.