PracticeVideosBlogFlashcardsEspañol
All Practice Exams

100+ Free NCEA Level 3 Digital Technologies Practice Questions

Prepare for the NCEA Level 3 Digital Technologies (NZQA Achievement Standards) 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 New Zealand NCEA & University Entrance

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

NCEA Level 1 ChemBio — New Zealand

Practice Questions

NCEA Level 1 Agricultural and Horticultural Science — New Zealand

Practice Questions

NCEA Level 1 Chinese — New Zealand

Practice Questions

NCEA Level 1 Commerce — New Zealand

Practice Questions

NCEA Level 1 Dance — New Zealand

Practice Questions

NCEA Level 1 Design and Visual Communication — New Zealand

Practice Questions
2026 Statistics

Key Facts: NCEA Level 3 Digital Technologies Exam

AS 91908

External achievement standard assessing Computer Science concepts (3 credits)

NZQA Subject Matrix

AS 91909

Internal achievement standard for developing a complex technological outcome (6 credits)

NZQA Subject Matrix

3NF

Third Normal Form required for relational database design at Level 3

NZQA Digital Tech Assessment Guidelines

Big-O

Standard mathematical notation used to classify algorithmic efficiency

AS 91908 Curriculum Specifications

3 Hours

Duration of the external NCEA Level 3 written examination session

NZQA Examination Timetable

A / M / E

NCEA achievement grades: Achieved, Merit, and Excellence

NZQA NCEA Framework

NCEA Level 3 Digital Technologies is the capstone senior secondary qualification in computing in New Zealand. It assesses advanced theoretical understanding (algorithms, complexity, graphics pipelines, security) and practical technological execution (normalized SQL databases, git workflows, software patterns, UI/UX accessibility). This 100-question practice bank provides targeted review with detailed explanations.

Sample NCEA Level 3 Digital Technologies Practice Questions

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

1Which regular expression strictly matches any sequence of one or more digits followed by a single lowercase letter 'a' or 'b'?
A.[0-9]*[ab]
B.[0-9]+[ab]
C.[0-9]+(a|b)*
D.\d[ab]+
Explanation: The character class `[0-9]+` matches one or more numeric digits. Following this with `[ab]` matches exactly one character that is either 'a' or 'b'.
2What defines a Deterministic Finite Automaton (DFA) compared to a Nondeterministic Finite Automaton (NFA)?
A.A DFA can transition to multiple states from a single state for the same input symbol.
B.A DFA has exactly one state transition for each state and input symbol, with no epsilon transitions.
C.A DFA requires an infinite number of states to process formal language strings.
D.A DFA can read strings backwards during parsing.
Explanation: In a DFA, for each state and input symbol, there is exactly one deterministic transition to a next state. Epsilon (empty string) transitions are strictly forbidden in DFAs.
3In Big-O time complexity analysis, what is the worst-case time complexity of Binary Search on a sorted array of size n?
A.O(1)
B.O(log n)
C.O(n)
D.O(n log n)
Explanation: Binary search repeatedly divides the search interval in half. Thus, searching through n sorted items requires at most log2(n) comparisons, yielding a worst-case complexity of O(log n).
4Which formal grammar component defines the starting symbol from which all valid strings in the language are derived?
A.Terminal symbol
B.Start symbol
C.Production rule
D.Epsilon transition
Explanation: In formal language theory, a context-free grammar is defined by a 4-tuple (V, Σ, R, S), where S is the designated start symbol from which derivations begin.
5What does it mean for an algorithm to run in polynomial time?
A.The runtime upper bound is expressed as a polynomial function of the input size, such as O(n^k).
B.The algorithm runtime grows exponentially relative to the input size, such as O(2^n).
C.The algorithm takes a constant amount of time regardless of input size.
D.The algorithm can only run on parallel processing hardware.
Explanation: Polynomial time algorithms have execution bounds like O(n), O(n^2), or O(n^k) for a constant k. These problems are considered computationally tractable.
6Which of the following problems is a classic example of an intractable problem?
A.Finding the minimum element in an unsorted array
B.Sorting an array using Merge Sort
C.The Travelling Salesperson Problem (exact optimal solution)
D.Determining if a number is even or odd
Explanation: The Travelling Salesperson Problem (TSP) requires finding the shortest route visiting all cities. Finding an exact solution is NP-hard, making it computationally intractable for large datasets.
7What is the primary role of a parser in a programming language compiler?
A.To convert high-level source code into binary machine code executable directly by the CPU.
B.To analyze tokens produced by the lexer and verify syntactic structure according to grammar rules.
C.To allocate memory addresses for runtime variables.
D.To optimize database SQL queries before execution.
Explanation: A parser takes tokens from the lexical analyzer (lexer) and builds a parse tree or Abstract Syntax Tree (AST), checking that the code conforms to formal language grammar rules.
8In regular expression syntax, what does the quantifier `?` represent?
A.Zero or more occurrences of the preceding element
B.Zero or one occurrence of the preceding element
C.One or more occurrences of the preceding element
D.Exactly five occurrences of the preceding element
Explanation: The `?` quantifier makes the preceding token optional, matching either zero or one occurrence.
9Which Big-O complexity class represents the fastest growth rate in execution time as input size n increases?
A.O(n)
B.O(n^2)
C.O(2^n)
D.O(log n)
Explanation: Exponential growth O(2^n) grows far more rapidly than linear O(n), quadratic O(n^2), or logarithmic O(log n) time, making large inputs intractable.
10What is the defining characteristic of a Context-Free Grammar (CFG)?
A.Production rules can only have a single non-terminal on the left-hand side.
B.Production rules require context symbols on both sides of the target variable.
C.Production rules cannot contain recursive definitions.
D.CFGs can only generate finite sets of strings.
Explanation: In a Context-Free Grammar, every production rule has the form A -> α, where A is a single non-terminal symbol. The replacement of A occurs regardless of surrounding context.

About the NCEA Level 3 Digital Technologies Exam

NCEA Level 3 Digital Technologies prepares students for tertiary study and industry careers in computer science, software engineering, and digital product design. Assessment encompasses analyzing computer science concepts (AS 91908) such as formal languages, algorithm complexity, computer vision, rendering, and cryptography, as well as developing complex technological outcomes (AS 91909) involving 3NF relational databases, modular software architecture, version control, web APIs, and HCI usability principles. This practice bank features 100 high-quality questions with thorough explanations for each option.

Assessment

One online digital examination assesses AS 91908 (analyse an area of computer science, 3 credits) and AS 91909 (present a reflective analysis of developing a digital outcome, 3 credits). For 2026 the AS 91908 areas of computer science are complexity and tractability, big data, and formal languages. AS 91909 questions are about a digital outcome the candidate developed themselves in the past 12 months. Standards AS 91900 to AS 91907 are internally assessed.

Time Limit

3 hours (end-of-year online digital examination)

Passing Score

Graded Not Achieved, Achieved, Merit or Excellence against the standard criteria; NZQA publishes no percentage pass mark.

Exam Fee

No NZQA entry fee for domestic New Zealand secondary school candidates. International candidates are charged NZ$383.30 per year (NZQA fees schedule effective 1 January 2026, GST inclusive). (New Zealand Qualifications Authority (NZQA))

NCEA Level 3 Digital Technologies Exam Content Outline

25%

AS 91908: Computer Science Concepts (Formal Languages & Complexity)

Formal grammars, regular expressions, finite state automata, syntax parsing, algorithmic time/space complexity (Big-O), and intractable computational problems.

25%

AS 91908: Computer Science Concepts (Graphics & Encryption)

3D computer graphics pipelines, ray tracing vs rasterization, shading models, image processing filters, symmetric/asymmetric encryption, SHA hashing, and public key infrastructure.

25%

AS 91909: Complex Technological Outcome (Database Design & SQL)

Relational database modeling, Entity-Relationship Diagrams, database normalization (1NF, 2NF, 3NF), multi-table SQL queries, aggregate operations, indexing, and transactional integrity.

25%

AS 91909: Complex Technological Outcome (Software Eng & Web/UX)

Modular software engineering, Git version control and branching, unit testing frameworks, RESTful API design, responsive UI layout, and Nielsen's 10 usability heuristics.

How to Pass the NCEA Level 3 Digital Technologies Exam

What You Need to Know

  • Passing score: Graded Not Achieved, Achieved, Merit or Excellence against the standard criteria; NZQA publishes no percentage pass mark.
  • Assessment: One online digital examination assesses AS 91908 (analyse an area of computer science, 3 credits) and AS 91909 (present a reflective analysis of developing a digital outcome, 3 credits). For 2026 the AS 91908 areas of computer science are complexity and tractability, big data, and formal languages. AS 91909 questions are about a digital outcome the candidate developed themselves in the past 12 months. Standards AS 91900 to AS 91907 are internally assessed.
  • Time limit: 3 hours (end-of-year online digital examination)
  • Exam fee: No NZQA entry fee for domestic New Zealand secondary school candidates. International candidates are charged NZ$383.30 per year (NZQA fees schedule effective 1 January 2026, GST inclusive).

Keys to Passing

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

NCEA Level 3 Digital Technologies Study Tips from Top Performers

1Master Big-O notation classification for common search and sort algorithms (e.g. Binary Search O(log n), QuickSort O(n log n), Nested Loops O(n^2)).
2Practice normalizing raw unnormalized data tables step-by-step through 1NF, 2NF, and 3NF to prevent data anomalies.
3Understand the mechanics of public key cryptography, distinguishing how public keys encrypt/verify and private keys decrypt/sign.
4Compare ray tracing (global illumination, high quality, computationally expensive) with rasterization (polygon projection, fast, real-time gaming pipeline).
5Apply Nielsen's 10 Usability Heuristics (e.g., Visibility of System Status, Error Prevention, Consistency) to evaluate user interface designs.
6Understand Git workflow principles such as feature branching, resolving merge conflicts, and maintaining clean commit histories.

Frequently Asked Questions

What standards are covered in NCEA Level 3 Digital Technologies?

The primary standards are AS 91908 (Analyze area(s) of computer science concepts, external assessment, 3 credits) and AS 91909 (Develop a complex technological outcome, internal assessment, 6 credits), supported by specialized standards in web development, database design, and software engineering.

What computer science concepts are assessed in AS 91908?

AS 91908 covers topics including formal languages and automata, algorithmic complexity and tractability, computer graphics and vision, and cryptography and network security.

What is required for database normalization in AS 91909?

Students must design relational databases normalized to Third Normal Form (3NF), eliminating repeating groups (1NF), partial dependencies (2NF), and transitive dependencies (3NF), supported by primary and foreign keys.

How are grades awarded in NCEA Level 3 Digital Technologies?

Assessments evaluate student work against criterion-based descriptors: Not Achieved, Achieved (demonstrates basic knowledge/functionality), Merit (demonstrates clear understanding/in-depth implementation), and Excellence (demonstrates critical evaluation/comprehensive efficiency).

Why use multiple-choice questions for NCEA Level 3 Digital Technologies revision?

MCQs allow rapid diagnostic testing of core theoretical definitions, algorithm analysis, SQL syntax rules, computer graphics principles, and security protocols.