Struggling to handle boundary conditions of vowel checks when string contains zero or only one vowel.

Ensure validation logic accounts for strings of length less than 2, and trace empty string or single character inputs during dry runs.

Failing to correctly restrict randomisation to a single met challenge, modifying multiple challenges instead.

Implement a control variable/boolean flag to break out of the modification loop immediately after the first swap or change is executed.

Omitting the '#' symbol for immediate values in assembly language instructions (e.g., AND R0, R1, 15 instead of #15).

Double-check your syntax in trace tasks. Immediate numbers must always have a prefixed hash symbol; numbers without hashes indicate memory locations.

Failing to store array values in a temporary variable before performing sliding/shifting operations, resulting in overwritten/lost elements.

Always declare a temporary variable (e.g. temp) to hold the boundary index value before executing array assignment/copy loops.

Confusing the function of the control bus with other buses, claiming that it transmits raw data to memory.

Remember that raw data goes on the Data Bus, addresses go on the Address Bus, and control/synchronisation signals go on the Control Bus.

Omitting necessary parentheses in regular expressions, applying operators (e.g., + or *) to individual letters instead of the intended block.

Use bracket grouping clearly, such as (ab)* instead of ab* when matching repeating sequences of 'ab'.

Writing incorrect relational operators in SQL date filters and missing the check for the null date default '01/01/0001'.

Verify database schema documentation for default date formats and explicitly exclude placeholder/sentinel date entries.

Failing to verify if a circular queue is full before incrementing its rear pointer, causing elements to be overwritten.

Always calculate current queue size or verify pointer equality against front pointer positions before executing insert steps.

AQA A-Level · 試験対策

Computer Science 7517 試験対策

Comprehensive exam tips and profile guide for AQA A Level Computer Science 7517, covering the structural breakdown of Paper 1 (On-Screen) and Paper 2 (Written), highlighting critical programming habits, mathematical representations, and common examiner-reported pitfalls.

読了時間 4 分更新日: 2026年6月21日

試験の概要

試験数

満点

200

制限時間

5時間

出題形式

試験	時間	配点	問題数	配点比率	出題形式
On-Screen Programming and Practical Assessment	2時間 30分	100	37	50%	Short Answer Theory, Trace Table Analysis, Algorithm Design Description, Practical Programming from Scratch, Program Execution Evidence, Code Analysis / Object-Oriented Theory, Subclassing and Inheritance Mod, Procedural/In-place Array Manipulation, Iterative Logic Modification, Screen Evidence of Testing, Mathematical Vector Analysis of movement
Theoretical and Computational Principles Written Paper	2時間 30分	100	26	50%	Calculations & Representations, Structured Analytical Essay, Technical Network Descriptions, SQL Queries & Database Theory, Assembly Trace Table

評価段階

A*ABCDEU

電卓の規定

A scientific or graphical calculator that meets JCQ regulations may be used (some GCSE Mathematics and Science papers are non-calculator). Graphical calculators must be set to exam mode; you must clear any stored programs, notes or data before the exam, and the calculator must not be able to retrieve stored text or formulae.

AO1: Demonstrate knowledge and understanding of the principles and concepts of computer science. (35%)
AO2: Apply knowledge and understanding of the principles and concepts of computer science. (35%)
AO3: Design, write, and evaluate computer programs. (30%)

過去問と採点基準にもとづいて作成（2022–2024）。

電卓プログラム

Graph: zeros, intersections & turning points

Graphical calculator / GDC (exam mode)

目的: Plot a function to read its roots (zeros), points of intersection, and maxima/minima.

使う場面: Checking solutions, sketching, or solving where an analytic method is hard.

手順

Graph the function(s) and use the built-in zero, intersect and maximum/minimum tools.

試験での注意: Allowed under JCQ rules, but you must still show your method — an unsupported calculator answer earns no method marks. Clear all stored programs, notes and data (graphical calculators in exam mode) before the exam.

Numerical equation solver

Graphical calculator / GDC (exam mode)

目的: Solve an equation or find a variable numerically when an algebraic route is long or implicit.

使う場面: Iterative or implicit equations, or to confirm an algebraic solution.

手順

Use the equation/zero solver, entering the equation and a sensible starting estimate.

Numerical integration & differentiation

Graphical calculator / GDC (exam mode)

目的: Evaluate a definite integral \(\int_a^b f(x)\,dx\) or a gradient \(f'(x)\) at a point.

使う場面: Checking calculus answers, or where only a numerical value is needed.

手順

Use the GDC's numeric integral / derivative function with the limits or the point.

Statistics & probability distributions

Graphical calculator / GDC (exam mode)

目的: 1-var/2-var statistics, linear regression, and cumulative binomial / normal / Poisson probabilities without tables.

使う場面: Statistics questions and hypothesis tests.

手順

Enter data in the statistics editor, or use the distribution menu (binomial cdf, normal cdf, …).

よくあるミス

1high影響する配点: 3Programming (Fundamentals of programming)
Struggling to handle boundary conditions of vowel checks when string contains zero or only one vowel.
回避方法: Ensure validation logic accounts for strings of length less than 2, and trace empty string or single character inputs during dry runs.
2medium影響する配点: 4Programming (Fundamentals of programming)
Failing to correctly restrict randomisation to a single met challenge, modifying multiple challenges instead.
回避方法: Implement a control variable/boolean flag to break out of the modification loop immediately after the first swap or change is executed.
3high影響する配点: 2Structure and role of the processor and its components (Fundamentals of computer organisation and architecture)
Omitting the '#' symbol for immediate values in assembly language instructions (e.g., AND R0, R1, 15 instead of #15).
回避方法: Double-check your syntax in trace tasks. Immediate numbers must always have a prefixed hash symbol; numbers without hashes indicate memory locations.
4high影響する配点: 5Data structures and abstract data types (Fundamentals of data structures)
Failing to store array values in a temporary variable before performing sliding/shifting operations, resulting in overwritten/lost elements.
回避方法: Always declare a temporary variable (e.g. temp) to hold the boundary index value before executing array assignment/copy loops.
5medium影響する配点: 1Structure and role of the processor and its components (Fundamentals of computer organisation and architecture)
Confusing the function of the control bus with other buses, claiming that it transmits raw data to memory.
回避方法: Remember that raw data goes on the Data Bus, addresses go on the Address Bus, and control/synchronisation signals go on the Control Bus.
6high影響する配点: 2Regular languages (Theory of computation)
Omitting necessary parentheses in regular expressions, applying operators (e.g., + or *) to individual letters instead of the intended block.
回避方法: Use bracket grouping clearly, such as (ab)* instead of ab* when matching repeating sequences of 'ab'.
7medium影響する配点: 3Structured Query Language (SQL) (Fundamentals of databases)
Writing incorrect relational operators in SQL date filters and missing the check for the null date default '01/01/0001'.
回避方法: Verify database schema documentation for default date formats and explicitly exclude placeholder/sentinel date entries.
8high影響する配点: 4Queues (Fundamentals of data structures)
Failing to verify if a circular queue is full before incrementing its rear pointer, causing elements to be overwritten.
回避方法: Always calculate current queue size or verify pointer equality against front pointer positions before executing insert steps.

コツを高得点につなげよう

thinka は弱点を的確な演習に変え、即時採点と試験形式のフィードバックを提供します。より賢く、より短時間で。

無料で問題を解いてみる料金を見る

本番形式の問題を解いて、AIが即座に採点とフィードバック。

無料で問題を解いてみる