IB CS Notes – OS & Databases 14/05/26, 9:52 AM
IB CS Notes
Baumgarten, Ganea & Turland · Hodder 2025 · Operating Systems & Databases
Operating Systems Databases
Search topics...
6 topics Click any topic to expand
▾
A1.3.1 – Role of an Operating System
Definition
An Operating System (OS) is fundamental software that manages computer hardware and
software resources, acting as an intermediary between the user and hardware.
Core Responsibilities
CPU management – allocates CPU time to processes
Memory management – handles RAM allocation/deallocation and virtual memory
Storage management – organises data on storage devices
Device management – controls hardware through device drivers
Top Tip
Examples: Windows, macOS, Linux (desktop); Android, iOS (mobile)
▾
A1.3.2 – Functions of an OS
1. Memory Management
Loads application code from storage into RAM
Allocates separate memory space per process (prevents interference)
Uses virtual memory (disk space as extra RAM) when RAM is full
[Link] Page 1 of 4
IB CS Notes – OS & Databases 14/05/26, 9:52 AM
Manages dynamic allocation/deallocation while apps run
2. File Management
Hierarchical file system (tree of directories/folders)
Operations: create, read, write, delete, rename, move, copy
Enforces unique filenames within a directory
Defragmentation – reorganises scattered file fragments on HDD for faster access
3. Device Management
Device drivers: software bridging OS and hardware
Buffering – temp storage for data in transit (handles speed differences)
Caching – stores frequently accessed data for faster retrieval
Spooling – queues print jobs so CPU can do other tasks
Plug and Play (PnP) – auto-detects and configures new hardware
4. Security
User authentication (passwords, biometrics, security tokens)
Encryption of files and communication channels
Auditing and monitoring (system logs)
Malware protection (antivirus, firewalls, IDS)
Access control – different permissions per user/role
5. Accounting
Tracks CPU usage, memory usage, disk usage, network usage per process/user
Used for cost allocation, quota management, performance monitoring
Generates reports for auditing, security analysis, billing
6. GUI
Visual elements: windows, icons, menus, pointers
Task switching (Alt+Tab), window management, drag-and-drop
Accessibility: screen readers, high-contrast, keyboard shortcuts
Customisation: themes, wallpapers, widgets
7. Virtualisation
Allows multiple Virtual Machines (VMs) to run on one physical machine
Managed via a hypervisor that allocates CPU, memory, storage
VMs are isolated – issues in one don't affect others
Enables snapshots, backups, live migrations, cloud scaling
8. Networking
Manages network interfaces, assigns IP addresses (DHCP)
[Link] Page 2 of 4
IB CS Notes – OS & Databases 14/05/26, 9:52 AM
Implements TCP/IP, HTTP, FTP, SMTP protocols
Firewalls, VPNs, encryption for secure data transmission
▾
A1.3.3 – Scheduling Algorithms
Top Tip
The scheduler decides which process gets CPU time, aiming to maximise utilisation and
responsiveness.
Scheduling Methods Comparison
Algorithm How it Works Advantages Disadvantages
First Come Convoy effect – short
Processes run in arrival order; Simple, fair (arrival
First Served tasks blocked by long
non-preemptive order)
(FCFS) ones
Fair CPU time; high Context-switching
Round Each process gets a fixed time
responsiveness; no overhead if quantum
Robin (RR) quantum; preemptive
monopolising too short
Starvation of low-
Priority Highest-priority process runs Critical tasks execute
priority tasks (fixed
Scheduling first; static or dynamic first; flexible
by ageing)
Multiple queues with own
Multilevel Flexible; tailored per Complex; lower
algorithms; high-priority
Queue process type queues may starve
queues served first
Common Mistake
Context switching – saving and restoring process state – adds overhead. Too much switching
reduces efficiency even though it enables multitasking.
A1.3.4 – Interrupt Handling vs Polling ▾
A1.3.5 – Multitasking & Resource Allocation (HL) ▾
[Link] Page 3 of 4
IB CS Notes – OS & Databases 14/05/26, 9:52 AM
A1.3.6 – Control System Components (HL) ▾
Exam Tips & Additional Guidance
OS When comparing scheduling algorithms, always consider specific context: response time,
fairness, and whether the system is interactive or batch-based.
OS For interrupt vs. polling: don't just say one is 'better'. Always justify based on event
predictability, power requirements, and response time needs.
OS Control systems: always describe how components interact within the feedback loop, not just
what each component does individually.
DB When discussing benefits/limitations of relational databases, always connect your answer to the
specific scenario given — generic answers lose marks.
DB Normalisation: practise step-by-step (1NF → 2NF → 3NF) on past-paper examples. Know how
to identify partial and transitive dependencies.
DB Use precise SQL terminology in exam responses. Saying 'it filters rows' is weaker than 'the
WHERE clause filters records before grouping'.
DB ACID properties apply to both regular SQL transactions and distributed databases — know how
each property is maintained across distributed nodes.
DB For NoSQL: match the database type to the use case. Document DB for semi-structured; Key-
Value for caching; Graph DB for relationships; Wide-column for big data.
Based on IB CS Hodder 2025 · Sections A1.3 & A3
[Link] Page 4 of 4