NCEA Level 3 Digital Technologies: computer science and the exam
NCEA Level 3 Digital Technologies
Start today's paperPaper resets in
NCEA Level 3 Digital Technologies standards
| Standard | Title | Credits | Assessed |
|---|---|---|---|
| 91900 | Conduct a critical inquiry to propose a digital technologies outcome | 6 | Internal |
| 91901 | Apply user experience methodologies to develop a design for a digital technologies outcome | 3 | Internal |
| 91902 | Use complex techniques to develop a database | 4 | Internal |
| 91903 | Use complex techniques to develop a digital media outcome | 4 | Internal |
| 91904 | Use complex techniques to develop an electronics outcome | 6 | Internal |
| 91905 | Use complex techniques to develop a network | 4 | Internal |
| 91906 | Use complex programming techniques to develop a computer program | 6 | Internal |
| 91907 | Use complex processes to develop a digital technologies outcome | 6 | Internal |
| 91908 | Analyse an area of computer science | 3 | External |
| 91909 | Present a reflective analysis of developing a digital outcome | 3 | External |
The externals give 6 credits. Schools choose which internals to offer, so most of your Level 3 Digital Technologies credits usually come from internals. NZQA's past exams and assessment schedules are on its Digital Technologies past exams page.
The NCEA Level 3 Digital Technologies exam
| Year | Exam | Date |
|---|---|---|
| 2026 | Level 3 Digital Technologies (91908, 91909), digital | Tuesday 10 November, afternoon |
| 2027 | All NCEA and Scholarship exams | 9 November to 3 December; subject dates due December 2026 |
NZQA's assessment specifications say both standards are an online digital exam on a laptop or desktop computer, answered in short or extended answers with a guide of 800 to 1,500 words in total for each standard. Both depend on preparation: an area of computer science you have studied for 91908, and a digital outcome you have developed for 91909.
What each external covers
Analyse an area of computer science (91908)
You answer questions on one area chosen from a list that NZQA sets each year:
| Year | Areas to choose from |
|---|---|
| 2026 | Complexity and tractability, big data, formal languages |
| 2027 | Complexity and tractability, computer graphics, network communication protocols |
For 2027, complexity and tractability covers polynomial and non-polynomial time, best, worst and average cases, P, NP and NP-complete, problems such as the travelling salesperson and knapsack, brute force, approximate and heuristic solutions, and algorithm optimisation. Computer graphics covers raster and vector images, resolution, colour depth and compression, 2D and 3D representation, transformations with matrices, rasterisation and ray tracing, lighting and shading, and GPUs and shaders. Network protocols covers the internet protocol suite and its layers, HTTP and HTTPS, TCP and UDP, IP addressing and routing, DNS and DHCP, TLS and network security, and performance. NZQA encourages applying these ideas to unfamiliar contexts.
Reflective analysis of a digital outcome (91909)
You answer questions about a digital outcome you developed yourself within the past 12 months, at Level 8 of the New Zealand Curriculum. NZQA's examples include a website with custom HTML, CSS and JavaScript, a game with coded mechanics, a parametric CAD model, a film or animation, and an electronic device with programmed microcontroller code. The questions ask you to discuss your decisions and evaluate both the outcome and how you developed it.
Worked examples
Complexity: why brute force fails
A brute-force solution to the travelling salesperson problem checks every route. With n cities there are (n − 1)! ÷ 2 different round trips:
At a billion routes a second, 20 cities would take about 6.1 × 10⁷ seconds, nearly two years. Checking whether one given route is shorter than a target takes only n steps, which is the idea behind NP: solutions are quick to check but hard to find. That is why real delivery and timetabling systems use heuristics that find good routes quickly instead of the best route slowly.
Computer graphics: the size of a bitmap
An uncompressed 1920 × 1080 image with 24-bit colour needs 1920 × 1080 × 24 = 49,766,400 bits, or about 6.2 MB. A vector image of a logo stores shapes instead of pixels, so it stays small and scales without going blocky. Compression and lower colour depth reduce the bitmap's size, with trade-offs in quality.
Protocols: TCP or UDP?
A web page uses TCP, because every byte must arrive in order, and lost packets are resent. A video call usually uses UDP, because a late packet is useless; it is better to skip it than wait. An Excellence answer weighs reliability against latency for the context in the question.
Try hidden surface removal, one of the 2027 graphics topics, in our Graphics Processing course, then press Mark to check your answer in the course:
Given what a pixel holds and a new fragment's depth, pick what the pixel shows after the depth test.
Press Mark to have your answer marked in the Graphics Processing course.
Grades, credits and endorsements
Every NCEA standard is graded Not Achieved, Achieved, Merit or Excellence, and earns its credits at whatever grade you reach. Achieved shows you meet the standard, Merit shows deeper understanding, and Excellence shows it applied to harder, unfamiliar problems.
- The certificate: NCEA Level 3 needs 60 credits at Level 3 or above, plus the 20-credit literacy and numeracy co-requisite, which you can gain any time before you leave school. Since 2024 you can no longer carry 20 credits over from the level below.
- Certificate endorsement: 50 credits at Merit or better gives a Merit endorsement; 50 at Excellence gives an Excellence endorsement.
- Course endorsement: 14 or more credits at Merit or Excellence in one subject in one year, with at least 3 from internal and 3 from external standards in most subjects.
Use the daily paper as a practice exam
Uni-Sine publishes a free daily paper on the NCEA Level 3 Digital Technologies track. It is a short timed paper: 8 questions worth 25 to 35 marks, marked instantly, with worked answers. It is not a full NCEA exam and it is not written by NZQA, so treat it as a quick daily practice test alongside NZQA's past papers.
- What it covers well: searching, sorting and complexity, graph traversal and shortest paths, networking, and regular expressions and finite state machines, which support complexity and tractability, network protocols and the 2026 formal languages area of 91908.
- What it does not cover: big data and computer graphics, the reflective analysis 91909, and the internals. It also includes processor architecture, floating point, object-oriented programming and SQL, which are not Level 3 externals, although databases are the internal 91902.
A good routine is one daily paper under timed conditions, then a careful look at every mark you dropped, then one NZQA past paper a week in the weeks before the exam.
NCEA changes for 2026, 2027 and beyond
NCEA still applies in 2026 and 2027, so the standards on this page are the ones you will sit. New Level 3 standards are due to be fully in place by 2029, and in 2030 a new New Zealand Advanced Certificate of Education (NZACE) replaces NCEA Level 3 for Year 13. The Government agreed the structure of the new qualification system on 26 March 2026, and the Ministry of Education confirmed further details and the timeline on 16 May 2026.
Common mistakes in NCEA Level 3 Digital Technologies
- Preparing the wrong area. Check the areas for your exam year; they changed between 2026 and 2027.
- Defining terms without analysing. Apply the idea to the context and discuss trade-offs.
- Writing far past the word guide. NZQA asks for clear, concise answers within about 1,500 words.
- Describing what you built in 91909. The marks are for discussing decisions and evaluating the outcome and process.
Common questions
What areas of computer science are in 91908?
How many credits is NCEA Level 3 Digital Technologies?
When is the NCEA Level 3 Digital Technologies exam?
Is NCEA Level 3 Digital Technologies a digital exam?
Is there a Scholarship Digital Technologies exam?
Revision cards
Say the answer first, then flip the card to check it.
Where to go next
- Solve it
Algorithm Visualiser
Watch sorting and pathfinding algorithms run step by step
Open the tool - Learn it
Search Algorithms
Linear, binary, depth-first and beyond: find data fast with the right algorithm
Start the course - Test it
NCEA Level 3 Digital Technologies
A new exam-style paper every day, with instant marking and a mark scheme
Start today's paper