All Practice Exams

100+ Free HAVO Informatica Practice Questions

Prepare for the Netherlands HAVO Informatica — Schoolexamen only exam with instant access — no signup required.

✓ No registration✓ No credit card✓ No hidden fees✓ Start practicing immediately
Not published as a single fixed national percentage for HAVO Informatica on Examenblad Pass Rate
100+ Questions
100% Free

Loading practice questions...

2026 Statistics

Key Facts: HAVO Informatica Exam

SE-only

No centraal examen for Informatica havo

Examenblad.nl Informatica havo 2026

A–F

Kernprogramma domains (plus HAVO electives)

Examenprogramma informatica havo/vwo

1+1 electives

HAVO: one domain G–N and one O–R

Examenprogramma / wetten.overheid.nl

PTA

School sets SE forms, timing, and weights

Examenblad SE/PTA guidance

1–10

Dutch SE-only subject grade scale (whole number)

Uitvoeringsbesluit WVO 2020 art. 3.13 (via Examenblad FAQ)

No school subject fee

Regular HAVO candidates; publicly funded pathway

Dutch VO funding practice / Examenblad fee distinction vs DUO

CvTE

Framework via College voor Toetsen en Examens / Examenblad

cvte.nl / examenblad.nl

100

Free English MCQ study items on this page

OpenExamPrep English MCQ study adaptation

Official HAVO Informatica 2026 is SE-only per Examenblad/CvTE examenprogramma (domains A–F + electives; PTA-defined, often performance-based)—not a national MCQ CE. These 100 English MCQs are a free study adaptation for concepts in algorithms, data, programming, networks, and ethics; check your school PTA for real SE forms and Dutch-language requirements.

Sample HAVO Informatica Practice Questions

Try these sample questions to test your HAVO Informatica exam readiness. Each question includes a detailed explanation. Start the interactive quiz above for the full 100+ question experience with AI tutoring.

1In the HAVO Informatica kernprogramma, which domain covers algorithms, data structures, automata, and grammars?
A.Domein C — Informatie
B.Domein B — Grondslagen
C.Domein E — Architectuur
D.Domein F — Interactie
Explanation: Domein B (Grondslagen) is the foundations domain: algorithms, data structures, finite automata, and grammars. Domains C, E, and F address information processing, architecture layers, and interaction/privacy respectively.
2An algorithm is best described as
A.any program written in one specific language
B.a finite, unambiguous sequence of steps that solves a class of problems
C.the physical CPU that executes machine code
D.a relational database schema
Explanation: An algorithm is a precise, finite procedure that transforms inputs into outputs for a problem class. A language-specific program implements an algorithm; hardware executes instructions; schemas organise stored data.
3Which abstract data structure provides last-in, first-out (LIFO) access?
A.Queue
B.Stack
C.Hash table used only for FIFO jobs
D.Undirected graph used only as a counter
Explanation: A stack supports push/pop at one end (LIFO), which matches undo histories and depth-first exploration. Queues are FIFO; hash tables support keyed lookup; graphs model relationships.
4Binary search on a sorted array of n elements typically has time complexity on the order of
A.O(n)
B.O(log n)
C.O(n²)
D.O(2ⁿ)
Explanation: Each comparison halves the remaining search space, so cost grows logarithmically with n. Linear scan is O(n); nested loops often yield O(n²); exponential growth appears in brute-force combinatorial search.
5A finite automaton is especially useful for
A.characterising certain pattern-recognition or state-based algorithms
B.replacing all relational databases
C.encrypting TLS sessions by itself
D.drawing high-fidelity GUI wireframes
Explanation: Finite automata describe computation via states and transitions—useful for recognising patterns or modelling protocol phases (Domain B3). They do not replace databases, cryptography, or UX design tools.
6Comparing bubble sort and merge sort for large n, which statement is most accurate?
A.Both are always O(n) in the worst case
B.Merge sort’s O(n log n) typically scales better than bubble sort’s O(n²) worst case
C.Bubble sort is always asymptotically faster for large n
D.Sorting cost is independent of n
Explanation: HAVO Domain G expects comparing algorithm complexity. Merge sort’s O(n log n) grows more slowly than bubble sort’s quadratic worst case, so merge sort usually scales better as n increases.
7A formal grammar is primarily used to
A.describe the structure of a language (which strings are valid)
B.measure CPU clock frequency
C.store image pixels in RGB form
D.route packets between IP networks
Explanation: Grammars describe language structure/syntax (Domain B4). Clock speed is hardware performance; pixels are media encoding (Domain C); IP routing is networking (Domain L).
8Which structure typically offers average-case O(1) keyed lookup?
A.Scanning an unsorted linked list from the head
B.A hash table (dictionary/map)
C.Rebuilding a balanced tree from scratch on every query
D.Always scanning a plain array linearly
Explanation: Hash tables map keys to buckets for average-case constant-time lookup when hashing and load factor are reasonable. Linear scans of lists or arrays are O(n).
9The travelling salesman problem (shortest tour visiting all cities) is a classic example of a
A.trivial O(1) dictionary lookup
B.‘hard’ combinatorial problem often linked to exponential brute-force search
C.problem solved solely by using a stack
D.pure physical-layer cabling issue
Explanation: Domain G asks HAVO students to recognise classic hard problems. Naive TSP enumeration grows exponentially with the number of cities, so candidates should spot it as a difficult combinatorial example.
10If algorithm A is O(n) and algorithm B is O(n²) for the same problem, for sufficiently large n
A.B will usually use fewer steps than A
B.A will usually scale better (grow more slowly) than B
C.both always take exactly the same wall-clock time
D.asymptotic notation becomes meaningless
Explanation: Linear growth overtakes less than quadratic growth for large n, so A typically scales better. Big-O compares growth rates; it does not claim identical runtimes on every machine.

About the HAVO Informatica Exam

HAVO Informatica is a Dutch upper-secondary computer science subject under the national examenprogramma, catalogued on Examenblad.nl. Examenblad states the exam is taken only as schoolexamen (SE-only)—there is no centraal examen. Schools assess Domains A–F plus two HAVO keuzethema’s via their PTA, often with performance-based coursework. This practice bank is an English-language multiple-choice study adaptation covering core CS concepts (algorithms, data, programming, architecture, networks, security, interaction, and ethics). It does not replace Dutch SE tasks or certify practical programming skill.

Assessment

Eindexamen = schoolexamen only. Kernprogramma: Domain A (Vaardigheden) with Domains B–F (Grondslagen, Informatie, Programmeren, Architectuur, Interactie). HAVO electives: one domain from G–N and one from O–R (bevoegd gezag or candidate choice). Exact SE instruments, weighting, and resits are in the school PTA/examenreglement.

Time Limit

School PTA (no national CE duration; Examenblad lists Informatica as schoolexamen only)

Passing Score

Dutch grading scale 1–10. For SE-only subjects the SE grade is a whole number 1–10; component weighting/rounding follow the school examenreglement and PTA. Diploma zak/slaag rules still apply at package level.

Exam Fee

No separate published per-subject fee for regular secondary-school HAVO candidates (publicly funded). Do not treat DUO Staatsexamen fees as a school CE fee; Informatica has no CE. (College voor Toetsen en Examens (CvTE) for the examenprogramma framework; catalogue on Examenblad.nl; SE delivery and grading by the school under PTA)

HAVO Informatica Exam Content Outline

~15%

Algorithms & foundations (B/G)

Algorithm design, searching/sorting complexity intuition, automata/grammars basics, and efficiency trade-offs.

~15%

Data & representation (C/H)

Binary/media encodings, structured data, relational modelling, SQL querying, and information goals.

~15%

Programming (D/J)

Variables, control flow, abstraction, recursion, paradigms (OO/functional traits), and readable components.

~15%

Architecture & systems (E/K)

Layered architecture, APIs, concurrency pitfalls, caching, and relating security to components.

~15%

Networks (L)

IP/TCP/UDP, DNS, LAN switching, NAT, distribution/edge ideas, and network security threats.

~15%

Security & privacy (E2/F3/F4/N/Q)

Threats, crypto basics, least privilege, phishing/injection, privacy trade-offs, and socio-technical measures.

~10%

Interaction, ethics & skills (A/F/O)

Usability/accessibility, ethical development, collaboration/tooling, and design–test–evaluate habits for SE projects.

How to Pass the HAVO Informatica Exam

What You Need to Know

  • Passing score: Dutch grading scale 1–10. For SE-only subjects the SE grade is a whole number 1–10; component weighting/rounding follow the school examenreglement and PTA. Diploma zak/slaag rules still apply at package level.
  • Assessment: Eindexamen = schoolexamen only. Kernprogramma: Domain A (Vaardigheden) with Domains B–F (Grondslagen, Informatie, Programmeren, Architectuur, Interactie). HAVO electives: one domain from G–N and one from O–R (bevoegd gezag or candidate choice). Exact SE instruments, weighting, and resits are in the school PTA/examenreglement.
  • Time limit: School PTA (no national CE duration; Examenblad lists Informatica as schoolexamen only)
  • Exam fee: No separate published per-subject fee for regular secondary-school HAVO candidates (publicly funded). Do not treat DUO Staatsexamen fees as a school CE fee; Informatica has no CE.

Keys to Passing

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

HAVO Informatica Study Tips from Top Performers

1Read your school PTA first: electives (G–N and O–R), project rubrics, and SE dates override any generic bank.
2Practise explaining algorithms with complexity intuition (why one approach scales better) — not only coding syntax.
3For SE projects, keep evidence of requirements, design choices, tests, and ethical/privacy reflection (Domains A/D/F).
4Drill networks and security as socio-technical systems: protocols plus human factors (phishing, least privilege).
5Use these English MCQs for concept checks, then complete Dutch past assignments and timed practicals your teacher provides.
6Map each week’s homework to Domains B–F so elective depth does not crowd out kernprogramma gaps.

Frequently Asked Questions

Is Netherlands HAVO Informatica a centraal examen subject?

No. Examenblad states Informatica havo is assessed only as schoolexamen (SE-only). There is no national CE sitting or N-term CE conversion for this subject.

What does the official examenprogramma cover?

Kernprogramma domains A (Vaardigheden), B (Grondslagen), C (Informatie), D (Programmeren), E (Architectuur), and F (Interactie), plus HAVO electives: one keuzethema from G–N and one from O–R. Schools may add other components in the PTA.

Why is examQuestions set to performance-based?

National sources do not publish a fixed MCQ count. SE forms are defined in each school’s PTA and commonly include projects and practicals (design, implement, evaluate digital artefacts) alongside other SE tests. Treat official assessment as PTA-specific and often performance-based.

Are these practice questions the same as the official SE?

No. This page’s 100 questions are an English-language MCQ study adaptation of examenprogramma concepts. Official SE is typically in Dutch and may require coding, design documentation, or other performance tasks your PTA specifies.

How is Informatica graded?

On the Dutch 1–10 scale. For SE-only subjects the schoolexamen grade is a whole number 1–10; how PTA components are weighted and rounded is set by the school examenreglement/PTA.

Is there a separate exam fee for school candidates?

Regular publicly funded secondary-school HAVO candidates do not pay a separate published per-subject Informatica exam fee. DUO Staatsexamen fees apply only to independent Staatsexamen routes where relevant.