The University of Sydney · S2 2026 · FACULTY OF COMPUTER SYSTEMS

ELEC1601 Introduction to Computer Systems

- one subject, every graph, every model, every mark
12 Chapters33-page Bible
Our own words - no uploaded lecturer files
Built to mirror S2 2026 · updated this semester
The Complete Exam Bible · S2 2026

ELEC1601 Overview

Introduction to Computer Systems
— A source-grounded ELEC1601 guide to essential-extension-advanced levels, five hurdle controls, state-trace method and the complete published assessment structure.
  • University of Sydney School of Electrical and Computer Engineering
  • Semester 2, 2026
  • an undergraduate unit of study
  • 6 credit points
  • a core introductory computer-systems unit in relevant engineering programs
  • 35% written final exam, 20% fundamentals quizzes, 10% extension quizzes, 15% essential lab completion, 0% laboratory attendance, and three project levels worth 10%, 5% and 5%

ELEC1601 Introduction to Computer Systems develops a bottom-up account of digital representation, computer architecture and AVR assembly alongside top-down Arduino laboratories and a team project. It is taught within University of Sydney School of Electrical and Computer Engineering. It is an undergraduate unit of study.

  • ELEC1601 grading Fundamentals Quizzes 20% · Extension Quizzes 10% · Essential Lab Completion 15% · 5 more published item(s)
  • ELEC1601 task mode Plan around this operating format: The 35% final is a two-hour written examination in the formal exam period.
  • ELEC1601 pressure point The main transfer challenge is this: Maintaining one coherent model across binary representation, registers, memory addresses, stack state and control flow.
  • ELEC1601 pass rule Before relying on the total mark, apply this control: The official outline marks the written exam, fundamentals quizzes, essential lab completion, laboratory attendance and essential project as hurdle tasks. All essential assessments must be passed, and participation in the lab is compulsory, to pass the unit.
ELEC1601 · The University of Sydney
An independent, AskSia-authored study guide. AskSia is not affiliated with, endorsed by, or sponsored by The University of Sydney; the course code and name are used for identification only.
Assessment

How ELEC1601 is assessed

ComponentWeightFormat
Fundamentals Quizzes · hurdle20%Four in-person essential quizzes; hurdle task
Extension Quizzes10%Three in-person quizzes testing extension knowledge
Essential Lab Completion · hurdle15%Group laboratory work with individual explanation; hurdle task
Laboratory Attendance · hurdle0%Participation and group sign-up; hurdle task
Essential Project · hurdle10%Group project assessed through demonstration and Q&A; hurdle task
Extension Project5%Extension-level project criteria
Advanced Project5%Advanced-level project criteria
Final exam · hurdle35%Two-hour mandatory written exam; AI prohibited; hurdle task

The 2026 official outline publishes eight weighted rows totalling 100%. The final exam is 35% and mandatory. Fundamentals quizzes, essential lab completion, laboratory attendance, essential project and the written exam are hurdle tasks; all essential assessments must be passed.

Contents · every chapter, one map

What ELEC1601 covers

The learning path moves from Computer-Systems Competence, Hurdles and State Tracing, through the problems opened by Memory, Addresses and Addressing Modes, to the synthesis required in Arduino Project, Oral Defence and Final Exam.

01

Computer-Systems Competence, Hurdles and State Tracing

essential-extension-advanced levels · five hurdle controls · state-trace method · build an assessment ledger and use one trace format across quizzes, labs, project and exam
02

Programming, Loops, Polling and Interrupts

program state · polling loop · interrupt-driven response · trace when a microcontroller reads an input and changes an output under polling and interrupt designs
03

Binary, Hexadecimal and Signed Integers

positional binary · hexadecimal notation · two's-complement integers · convert representations and detect the signed range and overflow of a fixed-width operation
04

Fixed-Point, Floating-Point and Encoding

fixed-point scale · floating-point fields · precision and range · encode a value and explain the rounding, overflow and comparison consequences of the chosen representation
05

AVR Assembly Language and the Instruction Set

instruction mnemonic · register operands · status flags · translate a small operation into AVR instructions and trace each register and flag change
06

Computer Architecture: CPU, Registers and Memory

CPU datapath · register file · program and data memory · connect an instruction's encoding to fetch, decode, execute and visible machine state
07

Memory, Addresses and Addressing Modes

byte address · pointer register · direct and indirect addressing · calculate the accessed location and show how pointer updates change later reads or writes
08

The Runtime Stack and Stack Pointer

stack pointer · push and pop · activation record · trace the stack across nested calls and recover the caller's state and return address
09

Subroutines and Calling Conventions

call and return · parameter passing · caller- and callee-saved state · design a subroutine interface and prove that registers, arguments and results survive the call correctly
10

Control Flow, Branches and AVR Loops

condition flags · branch instruction · loop invariant · compile a structured loop into branches and demonstrate termination and boundary behaviour
11

Compilers and High-Level Programming Constructs

source-level construct · assembly translation · optimisation and equivalence · relate a C-level expression, branch or function to its AVR assembly and explain an optimisation safely
12

Arduino Project, Oral Defence and Final Exam

sensor-actuator loop · team implementation · explainable evidence · scope, build and test the artefact, then defend the bit-level and instruction-level logic without AI assistance

It carries 6 credit points. It is positioned as a core introductory computer-systems unit in relevant engineering programs.

The lecture sequence follows information from bits and encodings into instructions, memory, stacks, subroutines and compiler translation.

Laboratories approach the same machine from sensors, actuators and programmed behaviour, so strong answers connect the representation in memory with the observable action of the physical or simulated system.

Assessment in ELEC1601 is distributed as follows: 35% written final exam, 20% fundamentals quizzes, 10% extension quizzes, 15% essential lab completion, 0% laboratory attendance, and three project levels worth 10%, 5% and 5%

The operational assessment conditions matter here.

The 35% final is a two-hour written examination in the formal exam period. Attendance is mandatory; the mandatory section uses multiple-choice questions based on in-semester tests, while the advanced section carries a threshold for extra marks.

AI is prohibited.

What makes ELEC1601 demanding is concrete: Maintaining one coherent model across binary representation, registers, memory addresses, stack state and control flow.

Code can appear to work while the student cannot explain which bits represent the value, which instruction changed the state or why a call and return preserve the required registers.

The official outline marks the written exam, fundamentals quizzes, essential lab completion, laboratory attendance and essential project as hurdle tasks.

All essential assessments must be passed, and participation in the lab is compulsory, to pass the unit.

For enrolment planning, The 2026 unit page lists no prerequisite or corequisite and assumes HSC Mathematics Extension 1 or 2.

The learning path moves from Computer-Systems Competence, Hurdles and State Tracing, through the problems opened by Memory, Addresses and Addressing Modes, to the synthesis required in Arduino Project, Oral Defence and Final Exam.

Coverage note: older Canvas pages contain a superseded optional 30% exam; all assessment claims here use the 2026 official outline instead.

Worked example · free

Trace one signed byte from representation to machine meaning

Q [4 marks]. Represent −18 as an 8-bit two's-complement value, convert it to hexadecimal, and explain why the same bits can mean 238.
  • 1Write +18 as the 8-bit pattern 00010010.
  • 1Invert the bits and add one to obtain the negative representation.
  • 1Group the result into nibbles and convert it to hexadecimal.
  • 1State how signedness changes interpretation without changing the bits.
Inverting 00010010 gives 11101101; adding one gives 11101110, or 0xEE. Under 8-bit two's-complement that pattern is −18, while an unsigned interpretation reads the same pattern as 238. Width and representation therefore belong in every machine-state claim.
Sia tip — Do not attach signed meaning to a bit pattern until the width and representation are explicit.
Glossary

Key terms

AVR assembly language
A symbolic low-level language whose mnemonics encode operations executed by an AVR microcontroller instruction set.
Binary number system
A positional numeral system using base two, with each digit representing a power of two.
Two's complement
A fixed-width signed-integer representation in which negation is formed by inverting bits and adding one.
Fixed-point representation
A numeric encoding that assigns an agreed fixed position to the binary radix point.
Floating-point representation
A numeric encoding using sign, significand and exponent fields to represent values across a wide range.
Computer architecture
The programmer-visible organisation of a computer, including its instruction set, registers, memory model and data paths.
Stack pointer
A register holding the address that identifies the current top boundary of the runtime stack.
Subroutine
A reusable instruction sequence entered by a call and completed by returning control to its caller.
Polling
A control technique in which software repeatedly checks a device or condition to determine whether an event requires service.
FAQ

ELEC1601 FAQ

Does ELEC1601 have a hurdle or component-level pass rule?

The official outline marks the written exam, fundamentals quizzes, essential lab completion, laboratory attendance and essential project as hurdle tasks. All essential assessments must be passed, and participation in the lab is compulsory, to pass the unit.

How is ELEC1601 assessed?

35% written final exam, 20% fundamentals quizzes, 10% extension quizzes, 15% essential lab completion, 0% laboratory attendance, and three project levels worth 10%, 5% and 5%

What is the ELEC1601 exam or final-task format?

The 35% final is a two-hour written examination in the formal exam period. Attendance is mandatory; the mandatory section uses multiple-choice questions based on in-semester tests, while the advanced section carries a threshold for extra marks. AI is prohibited.

Where do students usually lose marks in ELEC1601?

Maintaining one coherent model across binary representation, registers, memory addresses, stack state and control flow. Code can appear to work while the student cannot explain which bits represent the value, which instruction changed the state or why a call and return preserve the required registers.

Which offering does this ELEC1601 guide cover?

It is aligned to Semester 2, 2026; confirm your enrolled class and timetable in the current institutional system.

What prerequisites or restrictions apply to ELEC1601?

The 2026 unit page lists no prerequisite or corequisite and assumes HSC Mathematics Extension 1 or 2.

Is this ELEC1601 resource an official university guide?

No. It is an independent ELEC1601 study resource; current institutional instructions remain authoritative for assessment operation.

Study strategy

How to study for the exam

Retrieve the course map, practise the recurring method—represent the data at bit level, trace the instructions and machine state, connect the trace to hardware behaviour and test the result on normal, boundary and failure cases—on changed scenarios, and verify every operational assessment detail in the live institutional system.

Study ELEC1601 with AI

Your AI Computer Systems tutor for ELEC1601

Stuck on a hard ELEC1601 question? Sia is AskSia’s AI Computer Systems tutor — ask any ELEC1601 Introduction to Computer Systems question and get a clear, step-by-step explanation grounded in how the course is actually taught and assessed. Read this whole study guide free, then take your hardest questions to Sia.

A+Everything unlocked
Unlocks this Bible + all 9 of your The University of Sydney subjects - and 1,000+ Bibles across every Australian university.
Sia - your ELEC1601 tutor, unlimited, worked the way the exam marks it
The full 33-page Bible + practice bank with worked solutions
Chrome extension - sync your LMS so Sia knows your deadlines
Bilingual EN / Chinese on every Bible and every Sia answer
$0.99 Trial
30-day money-back · cancel in one tap · how it works
Unlock the full ELEC1601 Bible + 9 The University of Sydney subjects
$0.99 Trial