100+ Free Singapore GCE A-Level H2 Computing Practice Questions

Prepare for the Singapore GCE A-Level H2 Computing Examination (SEAB Syllabus 9569) 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.

Singapore A-Level H2 Chemistry

Practice Questions100 questions

2026 Statistics

Key Facts: Singapore GCE A-Level H2 Computing Exam

SEAB / MOE Singapore

Exam Board

Singapore Examinations and Assessment Board

9569

Syllabus Code

SEAB GCE A-Level H2 Computing Syllabus 2026

100 Questions

Question Count

English-Language MCQ Practice Adaptation

A to U (A-E Pass)

Grade Scale

SEAB GCE A-Level Grading System

Prepare for Singapore GCE A-Level H2 Computing (SEAB Syllabus 9569) with 100 realistic practice questions covering algorithms, Python OOP, Flask web development, SQLite, database normalization, logic gates, and networking.

Sample Singapore GCE A-Level H2 Computing Practice Questions

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

1What is the worst-case time complexity of inserting an element at the end of a dynamically resized array (e.g. Python list) when amortized analysis is considered?

A.O(1)

B.O(n)

C.O(log n)

D.O(n^2)

Explanation: Amortized time complexity averages the time taken over a sequence of operations. Although doubling array capacity takes O(n) time occasionally, doing so occurs so infrequently that each insert takes O(1) amortized time.

2In a singly linked list, what is the time complexity of deleting a node at the head of the list, assuming a reference to the head is maintained?

A.O(1)

B.O(n)

C.O(log n)

D.O(n^2)

Explanation: Deleting the head node requires updating the head pointer to point to head.next, taking O(1) constant time regardless of list size.

3Which data structure operates on a Last-In, First-Out (LIFO) principle?

A.Stack

B.Queue

C.Binary Tree

D.Priority Queue

Explanation: A stack is a linear data structure following the Last-In, First-Out (LIFO) principle, where the last element inserted is the first removed.

4Which queue operation returns the item at the front of the queue without removing it?

A.Peek / Front

B.Enqueue

C.Dequeue

D.IsEmpty

Explanation: The Peek operation inspects and returns the element at the front of the queue without modifying or removing it.

5What is the maximum number of children a node can have in a Binary Search Tree (BST)?

A.2

B.1

C.3

D.Unlimited

Explanation: By definition, a binary tree node can have at most two child nodes (left and right).

6If a sorted array of 1,024 elements is searched using Binary Search, what is the maximum number of comparisons required in the worst case?

A.10

B.512

C.1024

D.1

Explanation: Binary Search has a worst-case time complexity of O(log2 n). For n = 1,024, log2(1024) = 10 comparisons.

7Which tree traversal method visits nodes in ascending order when performed on a valid Binary Search Tree (BST)?

A.In-order traversal

B.Pre-order traversal

C.Post-order traversal

D.Level-order traversal

Explanation: In-order traversal visits left subtree, root, then right subtree. On a BST, this produces node keys in ascending order.

8In a circular queue implemented using an array of fixed size N with head and tail pointers, what is the correct formula to increment the tail pointer after enqueuing an item?

A.tail = (tail + 1) % N

B.tail = tail + 1

C.tail = (tail - 1) % N

D.tail = (head + tail) % N

Explanation: Using modular arithmetic (tail + 1) % N wraps the tail index back to 0 when it reaches the array boundary N-1.

9What is the worst-case time complexity of Quick Sort, and when does it occur?

A.O(n^2), when the pivot chosen is consistently the smallest or largest element

B.O(n log n), when the array is already sorted

C.O(n), when all elements in the array are identical

D.O(log n), when balanced partitions are formed

Explanation: Selecting the smallest or largest element as pivot repeatedly produces unbalanced partitions of sizes 0 and n-1, yielding O(n^2) complexity.

10Which sorting algorithm is guaranteed to be stable and have an O(n log n) worst-case time complexity?

A.Merge Sort

B.Quick Sort

C.Selection Sort

D.Heap Sort

Explanation: Merge Sort guarantees O(n log n) worst-case performance and preserves relative order of equal keys (stability).

About the Singapore GCE A-Level H2 Computing Exam

The Singapore GCE A-Level H2 Computing syllabus (SEAB 9569) develops computational thinking, algorithmic design, object-oriented programming, dynamic data structures, web application development, database management, and computer network security. This 100-question practice bank provides a comprehensive study set tailored to SEAB GCE H2 Computing candidates.

Assessment

Paper 1, a 3-hour written paper on algorithms, data structures, databases, networks and computing ethics, plus Paper 2, a 3-hour on-computer practical programming paper

Time Limit

Paper 1: 3 hours (Written) / Paper 2: 3 hours (Practical)

Passing Score

Grades A to E represent a pass

Exam Fee

Waived for Singapore Citizen school candidates under the MOE fee waiver; Permanent Resident, international and private candidates pay per-subject fees set annually by SEAB (Singapore Examinations and Assessment Board (SEAB))

Singapore GCE A-Level H2 Computing Exam Content Outline

30%

Module 1

Arrays, linked lists, stacks, queues, binary search trees, searching (linear, binary), sorting (bubble, insertion, quick, merge), and Big-O complexity analysis.

25%

Module 2

Object-Oriented Programming (encapsulation, inheritance, polymorphism), recursion, file I/O, error handling, Flask web application development, and SQLite database integration.

15%

Module 3

Binary, hexadecimal, two's complement, floating point concepts, logic gates (AND, OR, NOT, NAND, NOR, XOR), Boolean algebra, Karnaugh maps, and Von Neumann architecture.

15%

Module 4

Relational database design, Entity-Relationship Diagrams (ERD), normalization (1NF, 2NF, 3NF), and SQL queries (DDL, DML, JOINs, GROUP BY, HAVING).

15%

Module 5

OSI and TCP/IP protocol stacks, IP addressing, DNS, HTTP/HTTPS, symmetric/asymmetric encryption, hashing, authentication, and web security vulnerabilities.

How to Pass the Singapore GCE A-Level H2 Computing Exam

What You Need to Know

Passing score: Grades A to E represent a pass
Assessment: Paper 1, a 3-hour written paper on algorithms, data structures, databases, networks and computing ethics, plus Paper 2, a 3-hour on-computer practical programming paper
Time limit: Paper 1: 3 hours (Written) / Paper 2: 3 hours (Practical)
Exam fee: Waived for Singapore Citizen school candidates under the MOE fee waiver; Permanent Resident, international and private candidates pay per-subject fees set annually by SEAB

Keys to Passing

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

Singapore GCE A-Level H2 Computing Study Tips from Top Performers

1Practice tracing data structure operations step-by-step for Linked Lists, Stacks, Circular Queues, and BSTs on paper.

2Master Big-O time and space complexity derivations for best, average, and worst cases of all standard sorting and searching algorithms.

3Review Python OOP principles, ensuring clear understanding of private attributes (`__attr`), property getters/setters, class methods, and inheritance method overriding.

4Understand Flask routing, HTTP request methods (GET vs POST), template rendering with Jinja2, and parameter binding in SQLite queries (`?` placeholders).

5Practice normalization steps (UNF -> 1NF -> 2NF -> 3NF) systematically by identifying functional dependencies and primary/foreign key relationships.

Frequently Asked Questions

What is the assessment structure for SEAB GCE A-Level H2 Computing (Syllabus 9569)?

The examination consists of Paper 1 (Written Paper, 3 hours, 40% weightage) testing theoretical principles, database design, and algorithmic analysis, and Paper 2 (Practical Paper, 3 hours, 60% weightage) testing Python programming, data structures implementation, SQL queries, and Flask web applications.

Which programming language and frameworks are required for H2 Computing?

Python 3 is the mandatory programming language. Candidates are expected to master standard Python libraries, object-oriented design, SQLite3 database handling, and the Flask micro-framework for web application development.

What topics are covered in this 100-question practice question bank?

The question bank covers all five core modules of SEAB 9569: Algorithms & Data Structures, Python OOP & Web (Flask/SQLite), Data Representation & Logic Gates, SQL & Relational Databases, and Networks & Cybersecurity.

Is this question bank officially affiliated with SEAB or MOE Singapore?

No. This question bank is an independent English-language multiple-choice study adaptation created by OpenExamPrep to help GCE A-Level H2 Computing students revise and master examination syllabus concepts.

100+ Free Singapore GCE A-Level H2 Computing Practice Questions

Singapore GCE A-Level H2 Computing