Skip to course topics

    AQA A-Level Computer Science

    Explore your course, one topic at a time.

    Course 7517
    Course version · 7517Version from Sept 2017Change version

    Explore your topics

    162 study areas

    Programming2 topics

    12 of 18 shown

    Data structures8 topics
    Algorithms6 topics
    Theory of computation5 topics

    12 of 24 shown

    Data representation6 topics

    12 of 32 shown

    Computer systems5 topics
    Computer organisation and architecture4 topics
    Consequences of uses of computing1 topic
    Communication and networking4 topics

    12 of 17 shown

    Databases5 topics
    Big Data1 topic
    Functional programming3 topics
    Systematic approach to problem solving1 topic
    Course topics13 topics

    12 of 13 shown

    Assessment and exam guidance

    What Gets Top Grades

    A*/Grade 9

    Knowledge & Understanding

    Demonstrates comprehensive and accurate knowledge

    • Uses correct subject-specific terminology
    • Shows detailed understanding of concepts
    • Makes accurate connections between topics
    • Demonstrates depth beyond surface-level knowledge

    Application

    Applies knowledge effectively to new contexts

    • Selects relevant knowledge for the question
    • Adapts understanding to unfamiliar scenarios
    • Uses examples appropriately
    • Shows awareness of context

    Analysis & Evaluation

    Develops sophisticated analytical arguments

    • Constructs logical chains of reasoning
    • Considers multiple perspectives
    • Weighs evidence to reach justified conclusions
    • Acknowledges limitations and nuances

    Key Command Words

    AQA
    State
    1 mark

    Give a single fact or term

    Identify
    1 mark

    Name, select, or recognise

    Outline
    2 marks

    Set out main features briefly

    Describe
    2-4 marks

    Give an account of what something is like or what happens

    Explain
    3-6 marks

    Give reasons with developed cause→effect chains

    Compare
    2-4 marks

    State similarities AND differences (both required)

    Analyse
    6-9 marks

    Examine in detail showing cause→effect→consequence chains

    Evaluate
    6-12 marks

    Weigh up BOTH sides, reach JUSTIFIED conclusion

    Assess
    6-12 marks

    Make judgments about importance with justification

    Calculate
    2-4 marks

    Show formula→substitution→calculation→answer with units

    Tips and common mistakes

    Common Exam Mistakes

    Pitfalls to avoid in your exams

    • •Confusing Big Data with simply having a large database.
    • •Failing to explain the significance of the lack of structure in Big Data.
    • •Assuming relational databases can scale indefinitely across multiple machines.
    • •Failing to link technical developments to specific moral or social consequences
    • •Providing generic answers that do not address the 'digital age' context
    • •Ignoring the responsibility of the software engineer in the development process
    • •Overlooking the legal challenges posed by the scale of global software deployment
    • •Confusing the order of traversal in tree algorithms (e.g., pre-order vs post-order)

    Top Examiner Tips

    Expert advice for exam success

    • •Ensure you can clearly define and distinguish between volume, velocity, and variety.
    • •Be prepared to explain why functional programming is particularly suited to distributed processing tasks.
    • •Focus on the challenges posed by unstructured data rather than just the size of the data.
    • •Use case studies to illustrate the impact of computing on society
    • •Use hypothetical scenarios to explore ethical dilemmas
    • •Ensure arguments are balanced, considering both the benefits and the risks of a technology
    • •Relate answers to the power and responsibility of the developer
    • •Practice tracing algorithms manually on paper to ensure accuracy

    Ready for a little practice?

    Create your account to start practising Computer Science.

    Start free

    7 days Premium · Then free forever · No card, no charge