Undergraduate pathwayAbout this Computer Science study guide
Computer Science studies the foundations, design, implementation and analysis of computational systems. It combines mathematical reasoning with practical programming and engineering. Students learn how information is represented, how algorithms solve problems, how software is designed and tested, how computers execute instructions, how networks exchange data, and how intelligent systems learn from examples.
This guide is organised into four illustrative academic years and sixteen major subject areas. It is intended as a coherent learning pathway rather than a claim that every university uses an identical syllabus. Course names, credit values, prerequisites, programming languages and semester order vary among institutions and national accreditation frameworks. Students should compare this guide with the approved programme handbook of their university.
Study standard: Each chapter is planned as a substantial university-level learning resource with carefully explained theory, worked examples, labelled diagrams, practical activities, revision summaries and assessment questions. Programming examples should be run, tested and modified rather than memorised.
Programme learning outcomes
- Translate real-world problems into precise computational specifications and algorithms.
- Write, test, debug and document programs using appropriate programming paradigms.
- Apply discrete mathematics, logic, probability and linear algebra to computing problems.
- Explain computer architecture, memory hierarchy, operating systems and network protocols.
- Choose data structures and algorithms using time and space complexity analysis.
- Design relational databases and reason about transactions, integrity and query performance.
- Apply software engineering practices including requirements analysis, version control, testing and maintenance.
- Evaluate AI and machine-learning methods, their limitations, bias, privacy and societal impact.
- Assess security risks and design layered protections for systems and information.
- Plan and communicate a reproducible computing project using ethical research methods.
Year 1 — Foundations of Computing
Chapter 01Introduction to Computer Science and Computing Systems
What computer science studies; data and information; hardware and software; computational thinking; number systems; abstraction; computer history; system components and ethical foundations.
Open Chapter 1 notes · diagrams · practical activities · 15 revision questions · Print / PDF
Chapter 02Programming Fundamentals and Problem Solving
Algorithms, flowcharts, pseudocode, variables, data types, operators, control structures, functions, arrays, debugging, testing and introductory Python programming.
Open Chapter 2 notes · diagrams · practical activities · 15 revision questions · Print / PDF
Chapter 03Discrete Mathematics for Computer Science
Propositional logic, sets, relations, functions, proof techniques, induction, counting, combinatorics, graphs, trees, recurrence relations and Boolean algebra.
Open Chapter 3 notes · diagrams · practical activities · 15 revision questions · Print / PDF
Chapter 04Computer Architecture and Organization
Digital logic, number representation, CPU datapaths, instruction cycles, assembly concepts, memory hierarchy, cache, input/output, buses and performance metrics.
Open Chapter 4 notes · diagrams · practical activities · 15 revision questions · Print / PDF
Year 2 — Core Computer Science
Chapter 05Data Structures and Algorithms
Arrays, linked lists, stacks, queues, trees, heaps, hash tables, graphs, sorting, searching, recursion, asymptotic analysis and algorithm design strategies.
Open Chapter 5 notes · diagrams · practical activities · 15 revision questions · Print / PDF
Chapter 06Database Management Systems
Data modelling, ER diagrams, relational algebra, SQL, normalization, keys, transactions, concurrency control, indexing, query plans, backup and recovery.
Open Chapter 6 notes · diagrams · practical activities · 15 revision questions · Print / PDF
Chapter 07Operating Systems
Processes, threads, scheduling, synchronization, deadlocks, memory management, virtual memory, file systems, storage, protection and virtualization.
Open Chapter 7 notes · diagrams · practical activities · 15 revision questions · Print / PDF
Chapter 08Computer Networks and Data Communications
Network models, Ethernet, IP addressing, subnetting, routing, TCP/UDP, DNS, HTTP, wireless networks, network security and performance calculations.
Open Chapter 8 notes · diagrams · practical activities · 15 revision questions · Print / PDF
Year 3 — Advanced Computing
Chapter 09Software Engineering and Systems Analysis
Requirements, UML, architecture, design patterns, agile methods, version control, software testing, quality assurance, deployment and maintenance.
Open Chapter 9 notes · diagrams · practical activities · 15 revision questions · Print / PDF
Chapter 10Artificial Intelligence
Intelligent agents, state-space search, heuristic methods, knowledge representation, logic, planning, constraint satisfaction, reasoning and responsible AI.
Open Chapter 10 notes · diagrams · practical activities · 15 revision questions · Print / PDF
Chapter 11Cybersecurity and Information Assurance
Threat models, cryptographic foundations, authentication, access control, secure coding, network defence, incident response, risk assessment and digital forensics.
Open Chapter 11 notes · diagrams · practical activities · 15 revision questions · Print / PDF
Chapter 12Web Technologies and Application Development
HTML, CSS, JavaScript, HTTP, APIs, client-server architecture, accessibility, responsive design, authentication, application security and deployment.
Open Chapter 12 notes · diagrams · practical activities · 15 revision questions · Print / PDF
Year 4 — Specialization and Professional Practice
Chapter 13Machine Learning and Data Science
Data preparation, probability, regression, classification, clustering, model validation, feature engineering, neural networks, evaluation and responsible data practice.
Open Chapter 13 notes · diagrams · practical activities · 15 revision questions · Print / PDF
Chapter 14Cloud Computing and Distributed Systems
Virtualization, containers, cloud service models, distributed architectures, consistency, replication, fault tolerance, scalability, serverless computing and observability.
Open Chapter 14 notes · diagrams · practical activities · 15 revision questions · Print / PDF
Chapter 15Advanced Algorithms and Computational Theory
Greedy methods, dynamic programming, graph algorithms, complexity classes, reductions, computability, automata, formal languages and limits of computation.
Open Chapter 15 notes · diagrams · practical activities · 15 revision questions · Print / PDF
Chapter 16Research Methods, Ethics and Final-Year Project
Research questions, literature review, experimental design, data analysis, reproducibility, software project planning, professional ethics, technical writing and presentation.
Open Chapter 16 notes · diagrams · practical activities · 15 revision questions · Print / PDF
How to use the chapters
- Begin with the learning outcomes and prerequisite concepts.
- Work through definitions and diagrams before attempting the examples.
- Trace each algorithm manually with a small input, then implement it in code.
- For calculations, show assumptions, units, intermediate steps and interpretation.
- Complete practical activities and test edge cases, invalid inputs and failure conditions.
- Attempt examination questions without notes, then compare your reasoning with model solutions.
Important: The chapter list is the course roadmap. Individual chapter notes must be published and checked separately before a chapter can be considered complete.