PracticeVideosBlogFlashcardsEspañol
All Practice Exams

100+ Free Singapore GCE O-Level Computing Practice Questions

Prepare for the Singapore GCE O-Level Computing exam with instant access — no signup required.

✓ No registration✓ No credit card✓ No hidden fees✓ Start practicing immediately
100+ Questions
100% Free

Loading practice questions...

Same family resources

Explore More Singapore National Examinations (PSLE, N/O/A-Level)

Continue into nearby exams from the same family. Each card keeps practice questions, study guides, flashcards, videos, and articles in one place.

AEIS Primary

Practice Questions

AEIS Secondary

Practice Questions

S-AEIS Primary

Practice Questions

S-AEIS Secondary

Practice Questions

Singapore A-Level H2 Biology

Practice Questions

Singapore A-Level H2 Chemistry

Practice Questions
2026 Statistics

Key Facts: Singapore GCE O-Level Computing Exam

7155

SEAB syllabus code for this subject in the 2026 Singapore-Cambridge GCE O-Level examination

SEAB, 2026 GCE O-Level syllabuses examined for school candidates

Paper 1 written 2 hours plus Paper 2 lab-based practical 2 h 30 min

Official 2026 examination components and durations for this syllabus

2026 Singapore-Cambridge GCE O-Level examination timetable (SEAB)

A1 to F9

Singapore-Cambridge GCE O-Level grading scale, on which Grade C6 or better is a subject pass

SEAB / Ministry of Education Singapore

School and private candidates

Candidate categories that may register for this syllabus in 2026

SEAB, 2026 GCE O-Level syllabuses examined for private candidates

13 to 15 January 2027

Tentative release window announced for the 2026 GCE O-Level results

Ministry of Education Singapore, national examination dates

100 practice questions

English-language multiple-choice study questions on this page; this is our study adaptation, not the official paper length

OpenExamPrep practice bank

Practise for SEAB GCE O-Level Computing, syllabus 7155: a 2-hour written paper plus a 2 h 30 min lab-based practical. These 100 questions cover algorithms and pseudocode tracing, Python programming, computer systems, data representation, and networking and security.

Sample Singapore GCE O-Level Computing Practice Questions

Try these sample questions to test your Singapore GCE O-Level Computing exam readiness. Each question includes a detailed explanation. Start the interactive quiz above for the full 100+ question experience with AI tutoring.

1Consider the following pseudocode snippet: x ← 1 count ← 0 WHILE x < 10 DO x ← x * 2 count ← count + 1 ENDWHILE What is the final value of 'count' when the loop terminates?
A.4
B.3
C.5
D.10
Explanation: We trace the execution step-by-step: Initially, x = 1 and count = 0. Iteration 1: x becomes 2, count becomes 1 (2 < 10 holds). Iteration 2: x becomes 4, count becomes 2 (4 < 10 holds). Iteration 3: x becomes 8, count becomes 3 (8 < 10 holds). Iteration 4: x becomes 16, count becomes 4. Now x = 16, which is not < 10, so the loop terminates with count equal to 4.
2In standard flowchart representation, which symbol is used to represent a conditional branch or decision point (e.g. checking if IF x > 0)?
A.Diamond
B.Rectangle
C.Oval
D.Parallelogram
Explanation: A diamond symbol represents a decision/conditional evaluation with two or more output arrows (e.g., True/False or Yes/No). Oval represents Start/End (terminator), rectangle represents process/calculation, and parallelogram represents input/output.
3What critical prerequisite must be met by a dataset before a Binary Search algorithm can be successfully executed?
A.The dataset must be sorted in order (ascending or descending)
B.The dataset must contain an even number of elements
C.The dataset must consist strictly of unique integer values
D.The dataset must be stored inside a linked list structure
Explanation: Binary search relies on dividing the search space in half based on comparing the target value with the midpoint element. This logic requires the elements to be sorted prior to searching. If unsorted, linear search must be used.
4Consider the following pseudocode implementing a single pass of Bubble Sort on an array `arr = [5, 2, 8, 1]` of length 4: FOR i ← 0 TO 2 DO IF arr[i] > arr[i+1] THEN temp ← arr[i] arr[i] ← arr[i+1] arr[i+1] ← temp ENDIF ENDFOR What is the state of `arr` after completing this single pass (i = 0 to 2)?
A.[2, 5, 1, 8]
B.[2, 5, 8, 1]
C.[1, 2, 5, 8]
D.[5, 2, 1, 8]
Explanation: Initial: [5, 2, 8, 1]. i=0: compare arr[0]=5 and arr[1]=2 (5>2), swap → [2, 5, 8, 1]. i=1: compare arr[1]=5 and arr[2]=8 (5<8), no swap → [2, 5, 8, 1]. i=2: compare arr[2]=8 and arr[3]=1 (8>1), swap → [2, 5, 1, 8]. The largest element (8) bubbles up to the end.
5Given an array `numbers` with 5 elements, which pseudocode segment correctly initializes `max_val` to find the maximum value?
A.max_val ← numbers[0]
B.max_val ← 0
C.max_val ← 99999
D.max_val ← NULL
Explanation: Initializing `max_val` to the first element `numbers[0]` ensures that even if all elements in the array are negative numbers (e.g. [-10, -5, -20]), the comparison logic accurately determines the maximum.
6Which type of loop structure is best suited when the exact number of iterations is NOT known in advance and depends on user input?
A.Condition-controlled loop (e.g. WHILE or REPEAT...UNTIL)
B.Count-controlled loop (e.g. FOR loop)
C.Fixed sequence loop
D.Infinite hardware loop
Explanation: Condition-controlled loops (WHILE / REPEAT...UNTIL) repeat based on a boolean condition (such as `user_input != 'exit'`), making them ideal when the total number of iterations cannot be determined beforehand.
7Trace the execution of the following pseudocode block: total ← 0 FOR i ← 1 TO 3 DO FOR j ← 1 TO i DO total ← total + j ENDFOR ENDFOR What is the value of `total` after both loops complete?
A.10
B.6
C.9
D.14
Explanation: Outer loop i=1: inner j=1 → total = 0+1 = 1. Outer loop i=2: inner j=1 → total = 1+1 = 2; j=2 → total = 2+2 = 4. Outer loop i=3: inner j=1 → total = 4+1 = 5; j=2 → total = 5+2 = 7; j=3 → total = 7+3 = 10. Total = 10.
8What is the final value of variable `res` after tracing the following pseudocode? s ← "PYTHON" res ← "" FOR i ← LENGTH(s) - 1 DOWNTO 0 STEP -1 DO IF i MOD 2 = 0 THEN res ← res + s[i] ENDIF ENDFOR Note: s has 0-based indexing ('P'=0, 'Y'=1, 'T'=2, 'H'=3, 'O'=4, 'N'=5).
A.OTP
B.NHY
C.PTO
D.PYTHON
Explanation: Length of 'PYTHON' is 6 (indices 0 to 5). Counting down from 5 to 0: i=5 (odd, skip), i=4 (even, s[4]='O'), i=3 (odd, skip), i=2 (even, s[2]='T'), i=1 (odd, skip), i=0 (even, s[0]='P'). Concatenating 'O' + 'T' + 'P' yields 'OTP'.
9Perform a Binary Search trace on the sorted array `[3, 7, 11, 15, 19, 23, 27, 31]` to locate target `27`. How many comparisons are required, and what indices are checked (using integer division `mid = (low + high) // 2`)?
A.3 comparisons; checking index 3 (15), index 5 (23), and index 6 (27)
B.2 comparisons; checking index 4 (19) and index 6 (27)
C.4 comparisons; checking index 0, 2, 4, and 6
D.1 comparison; checking index 6 directly
Explanation: Initial bounds: low = 0, high = 7. Step 1: mid = (0+7)//2 = 3 (val = 15). 27 > 15, so low = 4. Step 2: mid = (4+7)//2 = 5 (val = 23). 27 > 23, so low = 6. Step 3: mid = (6+7)//2 = 6 (val = 27). Target found! Total = 3 comparisons (indices 3, 5, 6).
10An Insertion Sort is executed on array `[9, 4, 7, 2]`. What is the state of the array after the second item (`4`) and third item (`7`) have been inserted into their correct sorted positions?
A.[4, 7, 9, 2]
B.[4, 9, 7, 2]
C.[2, 4, 7, 9]
D.[7, 4, 9, 2]
Explanation: Start: [9, 4, 7, 2]. Pass 1 (insert 4): 4 is inserted before 9 -> [4, 9, 7, 2]. Pass 2 (insert 7): 7 is inserted between 4 and 9 -> [4, 7, 9, 2].

About the Singapore GCE O-Level Computing Exam

Comprehensive practice question bank for Singapore GCE O-Level Computing (SEAB Syllabus 7155). Covers Problem Solving & Algorithms, Python Programming, Computer Architecture & Systems, Data Representation, and Networks & Cyber Security.

Assessment

Paper 1 is a 2-hour written paper with an insert. Paper 2 is a 2 h 30 min lab-based practical paper in which candidates develop and test programs. SEAB does not publish a total item count.

Time Limit

Paper 1 written 2 hours; Paper 2 practical (lab-based) 2 h 30 min (2026 SEAB examination timetable).

Passing Score

Graded A1 to F9 on the Singapore-Cambridge GCE O-Level scale; Grade C6 or better is a subject pass.

Exam Fee

Set annually by SEAB and payable per subject by citizenship status: Singapore Citizens are exempt from examination fees, while Permanent Residents and International Students pay the published per-subject rates (SEAB Registration Information e-booklet). Private candidates pay per-subject fees at registration. (Singapore Examinations and Assessment Board (SEAB), jointly with the Ministry of Education Singapore and Cambridge University Press & Assessment)

Singapore GCE O-Level Computing Exam Content Outline

30%

Syllabus Domain 1

Core domain concepts and fundamental skills.

30%

Syllabus Domain 2

Advanced applications and analytical techniques.

20%

Syllabus Domain 3

Problem solving and practical applications.

20%

Syllabus Domain 4

Evaluation, synthesis, and contextual understanding.

How to Pass the Singapore GCE O-Level Computing Exam

What You Need to Know

  • Passing score: Graded A1 to F9 on the Singapore-Cambridge GCE O-Level scale; Grade C6 or better is a subject pass.
  • Assessment: Paper 1 is a 2-hour written paper with an insert. Paper 2 is a 2 h 30 min lab-based practical paper in which candidates develop and test programs. SEAB does not publish a total item count.
  • Time limit: Paper 1 written 2 hours; Paper 2 practical (lab-based) 2 h 30 min (2026 SEAB examination timetable).
  • Exam fee: Set annually by SEAB and payable per subject by citizenship status: Singapore Citizens are exempt from examination fees, while Permanent Residents and International Students pay the published per-subject rates (SEAB Registration Information e-booklet). Private candidates pay per-subject fees at registration.

Keys to Passing

  • Complete 500+ practice questions
  • Score 80%+ consistently before scheduling
  • Focus on highest-weighted sections
  • Use our AI tutor for tough concepts

Frequently Asked Questions

What is the format of the Singapore GCE O-Level Computing exam?

The SEAB GCE O-Level Singapore GCE O-Level Computing examination consists of written, practical, or language paper components testing core syllabus topics.

How is Singapore GCE O-Level Computing graded in Singapore GCE O-Level?

Results are graded from A1 to F9, where a subject pass is grade C6 or better.

Do the topic percentages shown on this page come from SEAB?

No. SEAB publishes paper structures, durations and weightings for its GCE O-Level syllabuses, but not a topic-by-topic percentage breakdown for most subjects. The percentages beside the topic areas here describe how this 100-question practice bank is distributed, so you can see what the set covers. Always check the current SEAB syllabus document for the official assessment objectives and component weightings.