*** In 2026 this external will be an Online Examination held on TUESDAY 10th NOVEMBER - PM ***
This exam asks students to analyse a specific area of computer science. Students need to go beyond just describing the topic, they need to explain how it works, explore real-world examples, discuss its challenges, and evaluate its impact from different perspectives.
This is a chance to show not just what they know, but how well you can think critically about a complex computer science idea.
Every year, THREE topics are named in the NZQA Assessment Specifications for Teachers and Students to focus on. In the exam students choose to answer questions for ONE topic only.
In 2026 the THREE topics are: Complexity and tractability, Big data, Formal languages.
For Complexity and tractability, questions may cover: polynomial and non-polynomial time complexity, Big O notations O(1), O(log n), O(n) , O(n^k), O(2^n), O(n!), and best-case, worst-case, and average-case time complexity, complexity classes (P, NP, NP-complete), solving complex problems (approximation algorithms / heuristics), algorithm design and optimisation, optimal solutions (Travelling salesman / knapsack, etc.).
For Big data, questions may cover: characteristics of big data (volume, variety, velocity, etc.), generation, processing and analysing data in different formats, interpretation and representation (bias and display), tools and technologies used in big data, and big data considerations (privacy, ethics, and data governance).
For formal languages, questions may cover: regular expressions and their use in pattern matching and validation; simple finite-state automata and their role in recognising regular languages; context-free grammars (CFGs) and their applications in programming languages; and the relationship between formal languages, compilers, and computational complexity.
Special notes
Teachers are encouraged to help their students to develop answering techniques to ensure that they are able to respond clearly and concisely within the total recommended word limit of 1500 words.
Teachers are strongly encouraged to prepare students to be able to apply their understanding of computer science to unfamiliar contexts.
Teachers should prepare students to identify and articulate instances where overlap with various areas of computer science occurs, e.g. with artificial intelligence.
Further information about digital external assessment can be found on the NZQA website.
Every year an assessment report is released to support teachers and students understand how the exam was marked. There can be some specific detail which is worth reading through to help support students understand the grade recieved.
We recommend reading through the whole report yourself. These are found under the different years below but here are some of the key points:
Candidates’ knowledge and understanding of content, skills, and complexities must be at Level 8 of the New Zealand Curriculum.
Candidates displayed a good grasp of computer science concepts, consistent with Level 8 of the New Zealand Curriculum.
Candidate responses that were able to showcase a thorough understanding of the topic by discussing it with both depth and breadth, going beyond what is covered in available resources, achieved at higher levels.
Overall, successful candidates differentiated themselves by the depth of their technical understanding, the relevance and application of examples, the originality of their connections, and their ability to critically analyse and predict future developments in areas of computer science.
Candidates who made minor errors in their submissions were not penalised if they demonstrated sufficient understanding throughout the submission. However, candidates who made errors and failed to show comprehensive understanding in their detailed responses often struggled to achieve.
In the drop downs below you will find the Assessment Report, the Assessment Schedule and any exemplars NZQA provided
Note: Pervious to 2025 the 91908 external was a DCAT.
Topics: Complexity and tractability, Computer vision, Computer graphics
2025 91908 Assessment Report
2025 91908 Assessment Schedule
2025 91908 Excellence Exemplar
2025 91908 Merit Exemplar
2025 91908 Achieved Exemplar
2023 91908 Assessment Schedule
* there were 2 exams based on which week you were sitting it.
DTTA will provide a derived grade exam for each of the topics, at the start of Term 3. This will be advertised on the DTTA Mobilse forum.
This is the DTTA Derived Grade Exam Resources for 91908 provided in 2024