WA Computer Science ATAR Unit 1

WA Computer Science ATAR Unit 1 is the first Year 11 unit of the Western Australian (SCSA) Computer Science ATAR course: pseudocode and algorithm design, control structures and data types, modular programming, standard algorithms, and network communications.

The five topic journeys below are built mostly from Cloodit's existing IGCSE, VCE Software Development, ACARA, Python and pseudocode modules, so this page lists the 25 modules written just for this course: user and technical documentation; length, format and list checks; parameters versus arguments, side effects and pure functions; tracing binary search and selection sort and comparing their comparisons; peer-to-peer and client-server models, the OSI and TCP/IP models, encapsulation, network devices and topologies, and designing a network; and file paths, scheduled tasks, shell scripts and automating a backup in Python. Each module includes real practice questions and a full answer key.

Each topic has its own journey below, split into smaller journeys, so teachers can assign a whole topic or one part of it, with progress tracking, class sprints and badges.

Add this whole curriculum to your class, or just the modules your unit needs — Cloodit tracks who's stuck automatically.

Add to class →

Pseudocode and Algorithm Design (1 module)

100

User and technical documentation Documents supplied with a program: user documentation guides users to operate it; technical documentation records design (pseudocode, flowcharts, test results) for developers.

Just this content description: the Pseudocode and Algorithm Design journey · Add Pseudocode and Algorithm Design to a class →

Control Structures and Data Types (3 modules)

193

Length check with len() A length check compares len() of the text with a required length or limit, such as exactly 4 characters for a PIN, to accept or reject the input.

194

Format check with string methods A format check tests that text follows an expected pattern, such as 4 digits for a postcode, using string methods like isdigit(), isalpha(), slicing and len().

195

List check with the in operator A list check uses in to accept a value only if it appears in a list of allowed values, e.g. choice in ['a', 'b']. Use not in to reject a value that is missing.

Just this content description: the Control Structures and Data Types journey · Add Control Structures and Data Types to a class →

Modular Programming (3 modules)

222

Parameters versus arguments The name in a function definition that receives a value, like name in def greet(name). The value passed in the call, like greet('Ava'), is the argument.

230

Side effects and pure functions A change a function makes outside itself, like printing, editing a global or changing a passed-in list. A pure function has no side effects and only returns a result from its inputs.

278

Internal versus external program documentation Internal documentation is inside the code (comments, docstrings). External is separate, like a user guide or technical document covering each module's purpose, inputs and outputs.

Just this content description: the Modular Programming journey · Add Modular Programming to a class →

Standard Algorithms (4 modules)

303

Tracing a binary search Each row of a binary search trace table updates low, high and mid. The range halves each step until the target is found or low becomes greater than high.

313

Tracing a selection sort A table of the array after each selection sort pass: the minimum of the unsorted part is swapped to the left, so the sorted part grows by one each pass.

314

Worst-case comparisons: linear versus binary search Worst-case comparisons for binary search: it halves a sorted range, so 1000 items need about 10 steps. Linear search needs up to n, so 1000 items could need 1000 comparisons.

315

Comparing the number of comparisons in bubble and selection sort Bubble and selection sort both make about n squared comparisons, so doubling n quadruples the work, but selection sort makes far fewer swaps.

Just this content description: the Standard Algorithms journey · Add Standard Algorithms to a class →

Network Communications (14 modules)

323

Peer-to-peer and client-server communication models How devices share the work of requesting and providing data: client-server uses dedicated servers, while peer-to-peer lets every device do both.

344

Purpose of layers in a network model Splits network communication into layers that each do one job and talk only to the layers above and below, so vendors interoperate, layers change alone and faults are easier to find.

345

The OSI seven-layer model A seven-layer network model: physical, data link, network, transport, session, presentation, application. Layer 1 is physical (bottom) and layer 7 is application (top).

347

Mapping the TCP/IP model to the OSI model Each TCP/IP layer covers one or more OSI layers: Application = OSI application, presentation and session; Network Access = physical and data link; Transport and Internet match one each.

348

Encapsulation and decapsulation through the layers Each layer on the sender adds its own header (and sometimes a trailer) as data moves down the layers. The receiver removes them in reverse order, which is called decapsulation.

354

Network devices and the layers they operate at The OSI layer a device works at: hubs at layer 1, NICs and access points at layers 1-2, switches at 2, routers at 3, and firewalls and proxies at layers 3 to 7.

403

Bus, ring and mesh topologies The layout of a network: bus shares one cable, ring passes data around a loop, and mesh links devices by many paths.

405

Factors that affect network design The needs and limits, such as cost, performance, reliability, security, scalability and user needs, that decide which devices, cables and layout a network should use.

406

Scalability of a network A scalable network can grow in users, devices and traffic without a major redesign, for example by planning for growth, keeping spare switch ports and having an upgrade path.

413

Designing a network from requirements Turning user requirements into a plan by choosing devices, media, topology, IP addressing and security controls, then justifying each choice.

459

Folder hierarchy and file paths The location of a file in the folder tree, written from the root (absolute, e.g. /home/sam/file.txt) or from the current folder (relative).

466

Scheduling a task to run automatically A scheduler that runs a command or script at set times without a person starting it, such as a nightly backup. Windows Task Scheduler does the same job.

467

A shell script to automate file tasks A text file of shell commands, such as cp, mv or rm, that run in order each time the script is run, so file tasks like backups can be automated.

470

Automating a file backup with a Python script Python call that copies a file to a backup folder. Put a datetime timestamp in the new name so old backups are not overwritten, and a scheduler can then run the script.

Just this content description: the Network Communications journey · Add Network Communications to a class →

Printable WA Computer Science ATAR Unit 1 Crosswords & Word Searches

Built from the key terms of each block of modules, every one with a full answer key. All free printables →

✎

Crossword: Pseudocode and Algorithm Design to Standard Algorithms (Modules 100–314) 10 clues · User and technical documentation, Length check with len(), Format check with string methods, List check with the in operator and more

✎

Crossword: Standard Algorithms and Network Communications (Modules 315–470) 10 clues · Comparing the number of comparisons in bubble and selection sort, Peer-to-peer and client-server communication models, Purpose of layers in a network model, The OSI seven-layer model and more

🔎

Word Search: Pseudocode and Algorithm Design to Network Communications (Modules 100–470) 20 words to find · User and technical documentation, Length check with len(), Format check with string methods, List check with the in operator and more

Journeys using these modules

WA Computer Science ATAR Year 11 — Pseudocode and Algorithm Design, WA Computer Science ATAR Year 11 — Control Structures and Data Types, WA Computer Science ATAR Year 11 — Modular Programming, WA Computer Science ATAR Year 11 — Standard Algorithms, WA Computer Science ATAR Year 11 — Network Communications

Or build your own Journey from any of these modules →

Frequently Asked Questions

Are these worksheets free?

Yes — every worksheet and its answer key is free to view, download, and print, with no account required to access any individual module.

Do I need an account?

No account is needed to view or print a worksheet. A free teacher account adds extras like assigning modules to a class and tracking progress automatically — it takes under three minutes to set up and doesn't need a credit card.

What year level is this for?

This curriculum is aligned to the Australian Curriculum (ACARA) and Victorian Curriculum, spanning roughly Years 3 to 10 — from first sequencing and variables through to object-oriented programming and advanced data structures. Start wherever matches your class's current level; each module builds on the last.

Can I print them?

Yes — every module has a one-click Print Worksheet button that generates a printable page with the practice questions and a full answer key.

Is this aligned to a curriculum?

Yes — the module sequence is mapped to the Australian Curriculum (ACARA) and Victorian Curriculum, and a class's progress is reported back against those curriculum bands (e.g. ACARA Years 5–6 sequencing and iteration, Years 7–8 functions and data structures), not just a generic difficulty scale.

Can students use this without a teacher?

Yes — students can start any module and practice directly, no class or account required. Joining a teacher's class with a class code adds progress tracking, class badges, and live Sprints, but isn't needed to work through the worksheets or modules solo.

Do I need to know WA Computer Science ATAR Unit 1 myself to teach this?

No — every module comes with a full worked answer key, and Cloodit tracks who's stuck automatically, so you don't need to solve each exercise yourself before assigning it or be able to debug a student's work line by line.

Cloodit turns curriculum-aligned coding content into journeys students work through one biome at a time.

Students earn collectable badges

Over 100 of them, across seven natural biomes.

Study Buddy

Students build a real study resource

Turns their work into revision material ready for Flash Cards and Exam study.

Diamond Dash — one of Cloodit's live, competitive Sprint games

Students lock in with Sprints

Live, competitive practice for the start of the lesson or a teacher-led lesson finisher.

A Cloodit certificate of achievement, ready to personalise and print

Custom printable certificates

Honour your top performers, or encourage a student who's trying hard — ready to print in seconds.

Add to class →

For Teachers

Set this curriculum for your class and see who needs help, automatically.

Create a free teacher account →

No credit card. No setup fee. Make a class and invite students in under three minutes.

For Students

Practice this topic interactively, track progress, and unlock badges.

Start Learning Free →

Have a class code?