Skip to main content
Advanced Search
Search Terms
Content Type

Exact Matches
Tag Searches
Date Options
Updated after
Updated before
Created after
Created before

Search Results

54 total results found

CHAPTER 4: SYSTEM SOFTWARE

[Concepts] Paper 3

4.1 PURPOSES OF AN OPERATING SYSTEM 4.1.1 Resource Optimisation How OS Maximises Resources: CPU scheduling Memory management I/O optimisation File system management 4.1.2 User Interface Purpose: Hides complexities of hardware from user. Allows user...

CHAPTER 5: SECURITY

[Concepts] Paper 3

5.1 ENCRYPTION AND ENCRYPTION PROTOCOLS 5.1.1 Encryption Concepts Plain Text: Original data before encryption. Cipher Text: Result of applying encryption algorithm to data. Encryption: Process of making cipher text from plain text. Key: Value used by encr...

CHAPTER 6: ARTIFICIAL INTELLIGENCE

[Concepts] Paper 3

6.1 INTRODUCTION TO AI 6.1.1 Definition Artificial Intelligence: The ability of computers to perform tasks that usually only humans would be able to do (decision-making, speech recognition, etc.). Machine Learning (ML): A subfield of AI where computers lear...

CHAPTER 7: COMPUTATIONAL THINKING AND PROBLEM-SOLVING

[Concepts] Paper 3

7.1 RECURSION 7.1.1 Essential Features Base Case: Stopping condition Prevents infinite recursion Recursive Case: Calls itself Changes state toward base case Unwinding: When base case reached Returns through call stack Calculates final resu...

CHAPTER 8: FURTHER PROGRAMMING

[Concepts] Paper 3

8.1 PROGRAMMING PARADIGMS 8.1.1 Low-Level Programming Characteristics: Close to machine language Direct hardware access Instructions converted to machine code without compiler Non-portable (specific to processor) Small memory footprint Examples: Asse...

New Page

[Concepts] Paper 3

CHAPTER 9: SORTING ALGORITHMS

[Concepts] Paper 4

9.1 BUBBLE SORT 9.1.1 How It Works Compare adjacent elements Swap if in wrong order Repeat for entire list Each pass places largest unsorted element at end Continue until no swaps needed 9.1.2 Pseudocode <PSEUDOCODE> DECLARE my...

CHAPTER 10: SEARCHING ALGORITHMS

[Concepts] Paper 4

10.1 LINEAR SEARCH 10.1.1 How It Works Start at first element Compare with target If match, return position If not, move to next element Repeat until found or end of list 10.1.2 Pseudocode <PSEUDOCODE> DECLARE myList : ARRAY[0:...

CHAPTER 11: ABSTRACT DATA TYPES

[Concepts] Paper 4

11.1 STACKS 11.1.1 Characteristics LIFO: Last In, First Out Add and remove from only one end (top) 11.1.2 Operations Push (Add): <PSEUDOCODE> PROCEDURE Push(item) IF topPointer < stackFull THEN topPointer ← topPointer...

CHAPTER 12: RECURSION

[Concepts] Paper 4

12.1 WRITING RECURSIVE ALGORITHMS 12.1.1 Essential Components Base Case: Condition that stops recursion Recursive Case: Function calls itself with modified parameters 12.1.2 Examples Sum of Numbers: <PYTHON> def sum(n): if ...

CHAPTER 13: OBJECT-ORIENTED PROGRAMMING

[Concepts] Paper 4

13.1 CLASSES AND OBJECTS 13.1.1 Defining Classes <PYTHON> class Person: def __init__(self, name, age): self.name = name # Property self.age = age # Property def get_name(self): # Method return self.na...

CHAPTER 14: FILE PROCESSING

[Concepts] Paper 4

14.1 FILE OPERATIONS IN PYTHON 14.1.1 Opening Files <PYTHON> # Read mode file = open("data.txt", "r") # Write mode (overwrites) file = open("data.txt", "w") # Append mode file = open("data.txt", "a") ...

CHAPTER 15: EXCEPTION HANDLING

[Concepts] Paper 4

15.1 TRY-EXCEPT 15.1.1 Basic Structure <PYTHON> try: result = 10 / 0 except ZeroDivisionError: print("Cannot divide by zero") 15.1.2 Multiple Exceptions <PYTHON> try: file = ope...

Checklist for A2

Exam Overview and Tips

EXAM PREPARATION CHECKLIST Paper 3 - Advanced Theory: ☐ User-defined data types ☐ File organisation and hashing ☐ Floating-point representation ☐ TCP/IP protocol layers ☐ Circuit vs packet switching ☐ RISC vs CISC processors ☐ Pipelining ☐ Boolean algebra an...

Pseudocode Vs Python Quick Reference (A2)

Exam Overview and Tips

PSEUDOCODE VS PYTHON QUICK REFERENCE Pseudocode Python DECLARE x : INTEGER x = 0 IF condition THEN if condition: ELSE else: ENDIF (indentation) FOR i ← 1 TO 10 for i in range(1, 11): NEXT i (indentation) W...

PHYSICSBOWL COMPREHENSIVE REVISION NOTES

Concepts

PHYSICSBOWL COMPREHENSIVE REVISION NOTESA Complete Guide to Acing the PhysicsBowl ExamTABLE OF CONTENTS    Mechanics - Kinematics    Mechanics - Newton's Laws    Work, Energy, and Power    Linear Momentum and Collisions    Rotational Motion    Gravitation    S...

main.py

Fun Practicals [Python] Turn-Based Battle Game

"""Main game entry point: title screen, character creation, game loop.""" import sys import os sys.path.insert(0, os.path.dirname(__file__)) from data_types import * from character import create_player_character, JOB_BASE_STATS from game_state import...

battle.py

Fun Practicals [Python] Turn-Based Battle Game

"""Battle engine: handles all combat calculations and the battle loop.""" from __future__ import annotations import random import math from typing import List, Optional, Tuple, Dict from data_types import * from character import Character from monster_u...