Career upgrade: Learn practical AI skills for better jobs and higher pay.
Level up
All Practice Exams

100+ Free Advanced Higher Computing Science Practice Questions

Pass your Advanced Higher Computing Science (C816 77) exam on the first try — instant access, no signup required.

✓ No registration✓ No credit card✓ No hidden fees✓ Start practicing immediately
100+ Questions
100% Free
1 / 100
Question 1
Score: 0/0

Which SQL statement adds a CHECK constraint that ensures the age column is at least 18 when creating a table?

A
B
C
D
to track
2026 Statistics

Key Facts: Advanced Higher Computing Science Exam

A-D

Grading scale

Qualifications Scotland

90 + 60

Marks (paper + project)

SQA course specification

2h 30

Question paper duration

Qualifications Scotland

100

Free practice questions here

OpenExamPrep

Qualifications Scotland Advanced Higher Computing Science (course code C816 77) is graded A-D and assessed by a 2h30 question paper (90 marks) plus a 60-mark coursework project. The 2026 specification covers object-oriented programming, data structures, algorithms with Big O complexity, computer architecture at depth (CISC vs RISC, pipelining, memory hierarchy), operating systems, networking and OSI model, security threats and countermeasures, relational database design with normalisation, SQL with joins and subqueries, ACID transactions, and modern web technologies including HTML5, CSS3 Flexbox/Grid, JavaScript ES6+ and REST APIs.

Sample Advanced Higher Computing Science Practice Questions

Try these sample questions to test your Advanced Higher Computing Science exam readiness. Each question includes a detailed explanation. Start the interactive quiz above for the full 100+ question experience with AI tutoring.

1Which OOP concept allows a subclass to provide its own implementation of a method already defined in its superclass?
A.Method overriding
B.Method overloading
C.Encapsulation
D.Instantiation
Explanation: Method overriding occurs when a subclass redefines a method inherited from its parent class using the same signature. This is a key mechanism enabling polymorphism in object-oriented programming.
2In Python, what is the role of the __init__ method in a class?
A.It initialises a new object's attributes when the object is created
B.It deletes the object from memory
C.It defines the class name
D.It runs only if the class has no other methods
Explanation: __init__ is the constructor method called automatically when an object is instantiated. Its first parameter (self) refers to the new instance and additional parameters set attribute values.
3Which data structure follows LIFO (Last In, First Out) ordering?
A.Stack
B.Queue
C.Linked list
D.Hash table
Explanation: A stack uses push to add and pop to remove items from the same end (the top). The last item pushed is the first item popped, giving LIFO ordering.
4What is the average-case time complexity of binary search on a sorted array of n elements?
A.O(log n)
B.O(n)
C.O(n log n)
D.O(1)
Explanation: Binary search halves the search range at each step, performing at most log2(n) comparisons. Hence the average and worst-case time complexity is O(log n).
5Which sorting algorithm has an average-case time complexity of O(n log n) and uses a divide-and-conquer recursive strategy with merging of sorted halves?
A.Merge sort
B.Bubble sort
C.Insertion sort
D.Selection sort
Explanation: Merge sort recursively splits the array in half, sorts each half and merges them. The merge step costs O(n) per level and there are log n levels, giving O(n log n) overall.
6In a recursive function, what is the purpose of the base case?
A.To stop the recursion and prevent infinite calls
B.To make the function run faster
C.To handle errors thrown by the recursive calls
D.To pass parameters to the next call
Explanation: The base case defines a condition under which the function returns without calling itself again. Without it the recursion would continue indefinitely and produce a stack overflow.
7Which Big O complexity grows fastest as n becomes very large?
A.O(n!)
B.O(2^n)
C.O(n^2)
D.O(n log n)
Explanation: Factorial O(n!) grows faster than exponential O(2^n) for n greater than about 4, and both dwarf polynomial growth. The growth ordering is 1 < log n < n < n log n < n^2 < 2^n < n!.
8Which UML class-diagram symbol represents inheritance (an 'is-a' relationship) between a subclass and its superclass?
A.An open (hollow) triangle arrowhead pointing to the superclass
B.A diamond pointing to the superclass
C.A dashed line with an open arrow
D.A solid line with no arrowhead
Explanation: UML denotes generalisation/inheritance with a solid line ending in a hollow (open) triangle arrowhead pointing from the subclass to the superclass.
9Which OOP principle hides internal data and exposes access through public getter and setter methods?
A.Encapsulation
B.Inheritance
C.Polymorphism
D.Abstraction
Explanation: Encapsulation bundles data and the methods that operate on it within a class, restricting external access to the internal state by routing it through getters and setters.
10Which SDLC approach delivers software in short iterative cycles with continuous user feedback and frequent releases?
A.Agile
B.Waterfall
C.Big-bang
D.V-model
Explanation: Agile methods (such as Scrum or Kanban) split work into short iterations, deliver working software frequently and respond to changing requirements with continuous customer collaboration.

About the Advanced Higher Computing Science Exam

Advanced Higher Computing Science is a Scottish Credit and Qualifications Framework (SCQF) Level 7 course delivered by Qualifications Scotland (formerly SQA). The course code is C816 77 and it covers three units — Software Design and Development, Computer Systems, and Database Design and Development — assessed through a 90-mark question paper and a 60-mark project.

Questions

100 scored questions

Time Limit

Question paper 2 hours 30 minutes; project 60 marks under controlled conditions

Passing Score

Grade A is the highest, A-D count as a pass (A-B-C-D), No Award is a fail

Exam Fee

Funded for school candidates; private entry approx GBP 49.10 per subject (Qualifications Scotland (formerly SQA))

Advanced Higher Computing Science Exam Content Outline

~15%

Object-Oriented Programming

Classes vs objects, attributes, methods, instantiation, inheritance with method overriding, polymorphism, encapsulation with getters and setters, abstraction; UML class diagrams; Python __init__ constructors and self parameter

~10%

Data Structures

1D and 2D arrays, parallel arrays, records and dictionaries, queues (FIFO with enqueue/dequeue), stacks (LIFO with push/pop), linked lists, binary search trees, hash tables and collision handling

~10%

Algorithms and Complexity

Searching (linear O(n) vs binary O(log n) on sorted data), sorting (bubble, insertion, selection, quicksort, merge sort) with complexities, recursion (base and recursive cases, tail vs head), Big O notation O(1)/O(log n)/O(n)/O(n log n)/O(n^2)/O(2^n)/O(n!)

~10%

Software Development Lifecycle

Waterfall vs iterative vs agile approaches; analysis, design, implementation, testing, documentation, evaluation and maintenance; modular programming, code reuse via libraries, test planning and software documentation

~15%

Computer Architecture and Memory

Von Neumann vs Harvard, CISC vs RISC, CPU pipelining, cache levels L1/L2/L3, clock speed vs cores, GPU parallel processing; SRAM vs DRAM, virtual memory paging and segmentation, swap files, ROM/EPROM/EEPROM/Flash

~10%

Operating Systems and Code Translation

Pre-emptive vs cooperative multitasking, scheduling algorithms (FCFS, SJF, Round-robin, Priority), memory and process management, thrashing; compilers vs interpreters vs assemblers, intermediate code and just-in-time compilation

~5%

Binary and Number Representation

Two's complement for signed integers, floating-point IEEE 754 with sign, mantissa and exponent, normalising floating-point representations

~10%

Networking, Protocols and OSI Model

IPv4 vs IPv6, subnetting basics, MAC addresses; TCP/IP layers, HTTP/HTTPS, FTP, SMTP/POP3/IMAP, DNS, DHCP; routers vs switches, packet structure, OSI 7 layers, client-server vs peer-to-peer, cloud IaaS/PaaS/SaaS

~5%

Security Threats and Countermeasures

Malware types, phishing/pharming/social engineering, MITM, DDoS, SQL injection, XSS; firewalls (hardware and software), symmetric (AES, DES) vs asymmetric (RSA) encryption, hash functions (SHA), digital signatures, PKI and certificates, intrusion detection

~15%

Relational Database Design and Normalisation

ERDs with 1:1, 1:N and M:N relationships resolved by linking entities; 1NF, 2NF, 3NF with atomic values, no partial dependencies, no transitive dependencies; primary, foreign, candidate and composite keys; referential integrity

~10%

SQL and Transactions

CREATE TABLE with CONSTRAINTS, INSERT/UPDATE/DELETE, SELECT with WHERE/ORDER BY, INNER/LEFT/RIGHT/FULL JOIN, nested subqueries, aggregate functions with GROUP BY and HAVING, set operations UNION/INTERSECT/EXCEPT, ACID transactions, locking, views, stored procedures, indexing

~10%

Modern Web Technologies

HTML5 semantic elements and WAI-ARIA accessibility, CSS3 Flexbox vs Grid, media queries, animations; JavaScript ES6+ (let/const, arrow functions, async/await, fetch API, DOM, event delegation); REST APIs, JSON vs XML, AJAX, SPA, HTTP methods, cookies vs sessions vs local storage

How to Pass the Advanced Higher Computing Science Exam

What You Need to Know

  • Passing score: Grade A is the highest, A-D count as a pass (A-B-C-D), No Award is a fail
  • Exam length: 100 questions
  • Time limit: Question paper 2 hours 30 minutes; project 60 marks under controlled conditions
  • Exam fee: Funded for school candidates; private entry approx GBP 49.10 per subject

Keys to Passing

  • Complete 500+ practice questions
  • Score 80%+ consistently before scheduling
  • Focus on highest-weighted sections
  • Use our AI tutor for tough concepts

Advanced Higher Computing Science Study Tips from Top Performers

1Drill object-oriented concepts (inheritance, polymorphism, encapsulation) by drawing UML class diagrams from past-paper scenarios — examiners reward correct UML notation
2Memorise the Big O complexities for the named algorithms (binary search O(log n), bubble/insertion/selection O(n^2), merge/quick sort O(n log n) average) and be able to justify them
3Practise normalisation worked examples: take an unnormalised table to 1NF, 2NF and 3NF in three steps, naming the partial or transitive dependency you removed
4Trace recursive algorithms (factorial, Fibonacci, binary search) by hand with a call stack diagram — recursion appears in nearly every Advanced Higher paper

Frequently Asked Questions

What awarding body runs Advanced Higher Computing Science?

Advanced Higher Computing Science is delivered by Qualifications Scotland (formerly SQA). The course code is C816 77 and it sits at SCQF Level 7 within the Scottish qualifications framework.

How is Advanced Higher Computing Science assessed?

Assessment is a 90-mark question paper lasting 2 hours 30 minutes plus a 60-mark project in which candidates analyse a problem, design a solution, implement it in an object-oriented language, test and evaluate it.

Which programming language is used at Advanced Higher Computing Science?

Candidates choose an object-oriented high-level language. Python is the most common, with Java and Visual Basic .NET also accepted. Object-oriented features (classes, inheritance, polymorphism) must be demonstrated in the project.

What grades are awarded for Advanced Higher Computing Science?

Grades A, B, C and D are awarded, with C as the minimum pass and D as a near-pass. The overall grade is calculated from the combined question paper and project mark out of 150.