Aggregated exam tips, time management strategies, and common pitfalls for AQA AS Level Computer Science 7516, detailing the specific patterns and practical traps from recent exam series.
อ่าน 4 นาทีอัปเดตเมื่อ: 21 มิ.ย. 2569
ภาพรวมข้อสอบ
จำนวนฉบับ
2
คะแนนเต็ม
150
เวลาสอบ
3ชม. 15นาที
ประเภทคำถาม
7
ฉบับ
เวลา
คะแนน
จำนวนข้อ
น้ำหนักคะแนน
ประเภทคำถาม
Paper 1: On-Screen Practical Programming
1ชม. 45นาที
75
18
50%
Algorithm Tracing, Conceptual Short-Answer, Direct Coding Implementation, Identifier Identification, Explain Code Subroutines, Object Composition & OOP, Design Outline, Program Modification (Standard), Program Modification (Complex Parameter-passing), Subroutine Authoring and Integration
Paper 2: Written Theory
1ชม. 30นาที
75
31
50%
Multiple Choice & Basic Representations, Binary Arithmetic & Conversions, Quantitative Hardware/Sound Calculations, Logic Circuit and Boolean Algebra, Processor & Stored Program Concepts, Assembly Language Program Writing, External Storage & Reading Technologies, Structured Evaluation Essay, Network Architecture & Protocols
เกณฑ์เกรด
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: Recall, describe and explain common computer science concepts and principles. (35%)
AO2: Apply computer science knowledge and understanding to solve practical and theoretical problems. (35%)
AO3: Design, write, test and evaluate computer programs. (30%)
วัตถุประสงค์: 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.
ข้อควรระวังในการสอบ: 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 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.
ข้อควรระวังในการสอบ: 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.
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, …).
ข้อควรระวังในการสอบ: 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.
ข้อผิดพลาดที่พบบ่อย
1highคะแนนที่เกี่ยวข้อง: 5Programming (Fundamentals of programming)
Attempting to write persistent or duplicated values in trace tables where empty cells are expected.
วิธีหลีกเลี่ยง: Only write values in a column when the variable actually changes value. Keep rows blank if variables are not updated.
2highคะแนนที่เกี่ยวข้อง: 12Data structures and abstract data types
Using high-level built-in collection methods (e.g. .pop(), .insert(), .remove() in Python) to delete/insert elements in arrays.
วิธีหลีกเลี่ยง: Manually shift array elements inside a fixed-size array structure using loops as requested in the program skeleton guidelines.
3highคะแนนที่เกี่ยวข้อง: 2Binary number system
Subtracting binary numbers directly in binary or converting via decimal representation without showing binary two's complement conversion.
วิธีหลีกเลี่ยง: Convert the subtrahend into a two's complement bit pattern first, then show the carry-based binary addition clearly.
4highคะแนนที่เกี่ยวข้อง: 4Programming (Fundamentals of programming)
Forgetting to update index 0 of the program data array (the tracked list length) after executing line deletions or insertions.
วิธีหลีกเลี่ยง: Always decrement or increment the integer representing the count in the first cell of the parallel/source code data structure when structure size changes.
5mediumคะแนนที่เกี่ยวข้อง: 1Number bases
Believing that hexadecimal formats use less physical storage space in computer systems memory.
วิธีหลีกเลี่ยง: Hexadecimal is strictly an abstraction tool for humans to read and write binary representations easily; the data occupies identical memory space.
6highคะแนนที่เกี่ยวข้อง: 1Binary number system
Omitting the carry row bits during binary addition steps on Paper 2.
วิธีหลีกเลี่ยง: Draw a clear carry row just below your operands to show carry bits that carry over to consecutive columns.
7mediumคะแนนที่เกี่ยวข้อง: 2Networking
Assuming that a physical star network topology acts as a logical star topology by default.
วิธีหลีกเลี่ยง: Note that while devices physically wire to a central point, if that central device is a hub rather than a switch, it transmits packets to all nodes logically.