Auckland · COMPSCI110 · Introduction to Computer Systems

COMPSCI110: pass the exams, not just read the notes

Your complete guide to University of Auckland's introduction to computer systems course. See where the marks are, work real practice questions, and study with an AI tutor that knows COMPSCI110.

15 credit points Stage I (first-year undergraduate) Offered S1 / S2 ~70% exams School of Computer Science

Sia generates COMPSCI110 practice questions, works through them step by step, and quizzes you on the material the exam weights most heavily.

Spot the bug

Find what is wrong

Multiple choice · the fix is revealed after you answer

What is the unsigned 8-bit binary number 1011 0010 in decimal?

The fix

Write the place values for 8 bits: 128 64 32 16 8 4 2 1.

Mark the 1 bits: 1011 0010 sets 128, 32, 16 and 2.
Add them: 128 + 32 + 16 + 2.
= 178.

The trap: Miscounting the bit positions or forgetting a place value. Line the bits up under 128-64-32-16-8-4-2-1 and add only the positions with a 1: here 128 + 32 + 16 + 2 = 178. classic slip!

your whole grade
Where your grade comes from Exams 70% · Assignment 28% · Participation 2%

One exam decides 50% of your grade. Must pass theory and practical separately. This whole page is built around that.

Overview

What COMPSCI110 is, and where it sits

COMPSCI110 Introduction to Computer Systems is a Stage I course at the University of Auckland that explains how a computer actually works beneath the programs that run on it. It builds a layered model from the ground up: how data is represented in binary (numbers, arithmetic, text and encoding), Boolean logic and digital circuits, computer organisation and processor architecture, assembly language, operating-system basics, and computer networks.

Assessment splits into a theory stream (a 50% invigilated final exam and a 20% mid-semester test, both AI-controlled) and a practical stream (assignments, essays and tutorials). A dual-pass hurdle means you must separately pass both the theory and the practical components. The recurring skill is reasoning across abstraction layers: connecting bits and gates up to instructions, processes and packets.

How it differs from its first-year siblings. COMPSCI110 is the how-computers-work course: where programming teaches you to write code, this teaches the machine underneath, from binary and logic gates up through the processor, operating system and network.

Official outline: courseoutline.auckland.ac.nz · COMPSCI110 outline. Always treat the official outline and the exam timetable as authoritative.

Difficulty & time commitment

Is COMPSCI110 hard, and how much time does it take?

COMPSCI110 is manageable if you keep a weekly rhythm and treat the back half as the main event. The pattern is consistent: it starts gently and steepens, and the heaviest assessment is the part that separates grades.

Difficulty
3.0 / 5
Moderate. Gentle early, demanding back half. Hard to fail with steady work; a top grade takes consistent practice.
Exam load
70%
The exams decide most of the grade. The heaviest single component is 50%.
Weekly time
~10 hrs
Around 10 hours per week including class, across lectures, study and assessment.
Modules 1-3 (binary, logic, organisation)builds the model
Modules 4-6 (assembly, OS, networks)applied

The difficulty curve and the assessment weighting point the same way: the back half is harder and worth more. Front-loading effort there is the highest-return decision in the course.

Is this course for you

Who tends to do well, and who tends to struggle

You will likely do well if

  • You are comfortable reasoning across abstraction layers, from bits and gates up to instructions and packets.
  • You practise binary and logic conversions until they are automatic.
  • You keep both streams moving, since you must separately pass theory and practical.

You may struggle if

  • You are shaky on binary representation, which everything else builds on.
  • You neglect one stream; the dual-pass hurdle means both must be passed.
  • You treat assembly and networks as memorisation rather than understanding the model.
do this ↘
What top students do differently
  • Drill binary, hex and two's-complement conversions until they are instant.
  • Build a one-page map linking each module (binary to logic to architecture to OS to networks).
  • Track theory and practical marks separately so neither falls below the pass line.

Syllabus

The 6 topics, topic by topic

The exam-weight marker on each topic shows where the marks concentrate. The amber topics carry the highest exam weight.

T1 · Data as binary (numbers, arithmetic, text)

Lower exam weight

T2 · Logic and circuits

Lower exam weight

T3 · Computer organisation

Lower exam weight

T4 · Assembly language

Lower exam weight

T5 · Operating systems

Lower exam weight

T6 · Computer networks

Lower exam weight

How it's assessed

Assessment structure

ComponentWeightFormat & timing
Final exam50%Invigilated, AI-controlled (theory). Exam period. Must pass theory and practical separately.
Mid-semester test20%Invigilated, AI-controlled (theory). Mid-semester.
Assignments20%AI-allowed (practical). Across semester.
Essays8%AI-allowed (practical). Across semester.
Tutorials2%AI-allowed (practical). Weekly.
Final exam50%
Invigilated, AI-controlled (theory).
Mid-semester test20%
Invigilated, AI-controlled (theory).
Assignments20%
AI-allowed (practical).
Essays8%
AI-allowed (practical).
Tutorials2%
AI-allowed (practical).
  • Pass on a weighted average of at least 50% unless a hurdle is noted; confirm on the official course page.
read this! If you read nothing else

This is an exam-cram course. With the exams at 70% of the grade and the final exam alone at 50%, your result is overwhelmingly decided by how well you perform under time pressure. Must pass theory and practical separately.

How to actually pass it

A weekly rhythm, two checklists, and the traps to avoid

The course rewards consistency over cramming, and practice over re-reading. Here is the loop that works, then what to have nailed before each exam.

The weekly loop

Each week
Practise the module's conversions or logic by hand, not just by reading.
Per assignment
Complete the practical work on time to stay above the practical pass line.
Per module
Connect the new layer to the one below it in a running systems map.

Before the mid-semester checklist

Before the final heaviest topics

  • Drill binary/hex/two's-complement arithmetic and Boolean logic.
  • Revise processor organisation, assembly and the memory hierarchy.
  • Review operating-system basics and networking for the 50% final.
  • Confirm you are passing both theory and practical (dual-pass hurdle).

The mistakes that cost marks

01

Weak binary foundation. Every later module assumes fluent binary representation; a shaky start compounds through logic, arithmetic and architecture.

02

Ignoring the dual-pass hurdle. You must separately pass theory and practical. Acing one while failing the other still fails the course.

03

Memorising assembly and networks. These reward understanding the underlying model; rote recall breaks down on unseen exam questions.

Teaching team

Who teaches COMPSCI110

No teaching staff are publicly listed for this offering. Check the official course page for the current coordinator and lecturers.

Where it fits

Prerequisites, related courses & why it matters

Stage I course at the University of Auckland; a foundation for later computer science and computer systems engineering study. Check the official course outline for prerequisites.

Why it matters beyond the grade. The systems foundation underpins later courses in architecture, operating systems, networks and embedded systems, and the software and systems roles they lead to.

FAQ

Frequently asked questions

How is COMPSCI110 assessed at the University of Auckland?

COMPSCI110 has a 50% invigilated final exam and a 20% mid-semester test (both AI-controlled theory components), plus 20% assignments, 8% essays and 2% tutorials (practical). There is a dual-pass hurdle: you must separately pass the theory and the practical parts. Confirm current details on the official Auckland course outline.

What does COMPSCI110 cover?

How computers work from the ground up: binary data representation, Boolean logic and circuits, computer organisation and processor architecture, assembly language, operating-system basics, and computer networks.

Is COMPSCI110 hard?

It is a moderate Stage I course. The main challenge is the dual-pass hurdle (theory and practical must each be passed) and building fluency in binary and logic; students who drill conversions and keep both streams current generally find it manageable.

Is COMPSCI110 a programming course?

No. It is about how the computer works underneath programs: binary, logic, architecture, assembly, operating systems and networks. Programming is covered in COMPSCI101.

Study COMPSCI110 with Sia

Work through the core topics and the rest of the course with a tutor that knows it and quizzes you on the topics the assessments weight most heavily.

Start studying with Sia