EuraStudy
‹Revision

Revision·Revision / N11UK · A-Levels

Computer Science

A-Level Computer Science is the study of computation itself - how problems are decomposed and abstracted into algorithms, how those algorithms are expressed as programs and reasoned about for correctness and efficiency, and how the whole edifice is built up from binary digits, logic gates and the stored-program processor. Set against the Department for Education GCE AS and A level subject content and delivered here through the AQA 7517 specification, it runs from the fundamentals of programming, data structures and algorithms and the theory of computation, through data representation, computer systems, organisation and architecture, up to networking, databases, big data, functional programming and the consequences of computing, closing with a substantial independently-developed programming project. It is assessed as much on the ability to write, trace and analyse algorithms and to build a working solution as on recall, and it carries a high practical and mathematical demand.

0/62 Texts·14 Chapters·~211 min total

Continue reading — Chapter ITable of contents
LPAQA 7517 4.1.1LPAQA 7517 4.1.2LPDfE GCE Computer Science - programmingLPAQA 7517 4.1.3LPDfE GCE Computer Science - programming constructsLPAQA 7517 4.1.4+128 more●○○Foundation●●○Standard●●●Advanced
Table of contents · 14 ChaptersT·14
Ch. IFundamentals of programming5 texts · 0 read
  • Data types and program structureText L·01 · Recommended start4 min
  • Sequence, selection and iterationText L·023 min
  • Subroutines, parameters, scope and the stackText L·034 min
  • Recursion, string handling and exception handlingText L·043 min
  • Object-oriented programmingText L·054 min
Ch. IIFundamentals of data structures5 texts · 0 read
  • Arrays, records and abstract data typesText L·063 min
  • Stacks and queuesText L·073 min
  • Linked listsText L·084 min
  • Graphs and treesText L·094 min
  • Hash tables and dictionariesText L·104 min
Ch. IIIFundamentals of algorithms5 texts · 0 read
  • Graph traversal: depth-first and breadth-firstText L·113 min
  • Tree traversal and expression treesText L·123 min
  • Searching: linear and binary searchText L·134 min
  • Sorting: bubble sort and merge sortText L·144 min
  • Dijkstra's shortest path algorithmText L·154 min
Ch. IVTheory of computation5 texts · 0 read
  • Abstraction, decomposition and algorithmsText L·163 min
  • Finite state machinesText L·173 min
  • Regular expressions, regular languages and BNFText L·183 min
  • Turing machines and computabilityText L·194 min
  • Big-O and the classification of complexityText L·204 min
Ch. VFundamentals of data representation6 texts · 0 read
  • Number bases and conversionsText L·213 min
  • Signed integers and binary arithmetic (two's complement)Text L·223 min
  • Fixed- and floating-point representationText L·234 min
  • Character sets and bitwise operationsText L·244 min
  • Representing images and soundText L·254 min
  • Data compression and encryptionText L·264 min
Ch. VIFundamentals of computer systems5 texts · 0 read
  • Hardware, software and the operating systemText L·272 min
  • Programming languages and translatorsText L·283 min
  • Logic gates and combinational logicText L·293 min
  • Boolean algebra and simplificationText L·303 min
  • Adders and the flip-flopText L·314 min
Ch. VIIFundamentals of computer organisation and architecture5 texts · 0 read
  • Internal components and the stored-program conceptText L·323 min
  • The CPU: registers, ALU, control unit and busesText L·333 min
  • The fetch-execute cycle and interruptsText L·344 min
  • Machine code, addressing modes and assemblyText L·354 min
  • Performance, I/O, storage and embedded systemsText L·363 min
Ch. VIIIFundamentals of communication and networking5 texts · 0 read
  • Communication basics: serial, parallel and bit rateText L·373 min
  • Network topologies and typesText L·384 min
  • The TCP/IP stack, packet switching and addressingText L·394 min
  • Network security and wirelessText L·403 min
  • The web: DNS and client technologiesText L·413 min
Ch. IXFundamentals of databases5 texts · 0 read
  • Entity relationship modelling and the relational modelText L·423 min
  • Normalisation (1NF, 2NF, 3NF)Text L·433 min
  • SQL: querying dataText L·443 min
  • SQL: defining and modifying data; referential integrityText L·453 min
  • Transaction processing and ACIDText L·463 min
Ch. XBig Data3 texts · 0 read
  • What is big data? The three VsText L·473 min
  • Representing big data: fact-based and graph modelsText L·484 min
  • Processing big data: distributed processing and functional programmingText L·494 min
Ch. XIFundamentals of functional programming4 texts · 0 read
  • Functions and the functional paradigmText L·504 min
  • Function application, composition and partial applicationText L·513 min
  • Higher-order functions: map, filter and foldText L·523 min
  • List processingText L·533 min
Ch. XIIConsequences of uses of computing3 texts · 0 read
  • Ethical, cultural and environmental issuesText L·543 min
  • Privacy, data and surveillanceText L·553 min
  • The legal framework: computing legislationText L·563 min
Ch. XIIISystematic approach to problem solving3 texts · 0 read
  • The stages of problem solvingText L·573 min
  • Decomposition, abstraction and designText L·583 min
  • Testing and evaluationText L·594 min
Ch. XIVNon-exam assessment – the computing practical project3 texts · 0 read
  • What the NEA is and how it is weightedText L·604 min
  • The five assessment sectionsText L·614 min
  • Choosing a problem and working wellText L·623 min
Reading progress · subject
—Read
0/62
Texts
~211
min total
Recommended start
Fundamentals of programming · Ch. I
Data types and program structure
Text L·01 · 4 min
Read now
Instrument · 01Recommended study order
  1. 1Fundamentals of programming
  2. 2Fundamentals of data structures
  3. 3Fundamentals of algorithms
  4. 4Theory of computation
  5. 5Fundamentals of data representation
  6. 6Fundamentals of computer systems
  7. 7Fundamentals of computer organisation and architecture
  8. 8Fundamentals of communication and networking
  9. 9Fundamentals of databases
  10. 10Big Data
  11. 11Fundamentals of functional programming
  12. 12Consequences of uses of computing
  13. 13Systematic approach to problem solving
  14. 14Non-exam assessment – the computing practical project
Instrument · 02Exam structure
Paper 1 (AQA 7517/1) - on-screen
2 hours 30 minutes, 100 marks, 40% of the A-Level. An on-screen examination that tests a student's ability to program together with the theoretical content of programming, data structures, algorithms and the theory of computation (in particular sections 4.1-4.4, with the problem-solving skills of 4.13). Candidates answer on-screen using a Preliminary Material booklet and a Skeleton Program issued in advance in their chosen language (C#, Python, VB.NET, Java, C++ or Pascal/Delphi). Assessment is weighted towards application and design: AO2 (apply knowledge and understanding) and AO3 (design, program, evaluate) dominate, with AO1 (knowledge and understanding) the remainder.
Paper 2 (AQA 7517/2) - written
2 hours 30 minutes, 100 marks, 40% of the A-Level. A written examination that tests the theoretical content of data representation, computer systems, organisation and architecture, the consequences of computing, communication and networking, databases, big data, functional programming and the systematic approach to problem solving (sections 4.5-4.13). A mix of short-answer, structured and extended-response questions, including Boolean simplification, number and logic work, and evaluative essay-style items on the consequences of computing.
Non-exam assessment (NEA) - the practical project
75 marks, 20% of the A-Level, marked by the centre and moderated by AQA. A substantial, independently-developed programming project for a real end user, documented across analysis, documented design, technical solution, testing and evaluation (section 4.14). It is the only component that is not a timed examination and is the principal place the practical programming skills are assessed.
Assessment objectives and grading
Across the whole A-Level the assessment objectives are: AO1 knowledge and understanding of the principles and concepts of computer science (roughly a quarter of the marks); AO2 application of that knowledge and understanding, including to analyse problems in computational terms (the largest single share); and AO3 design, program and evaluate computer systems that solve problems, making reasoned judgements and presenting conclusions (a substantial share, much of it in the NEA and Paper 1). The full linear A-Level is sat at the end of the course and graded A*-E (U below E).
Instrument · 03Official sources
  • GCE AS and A level subject content for computer scienceDepartment for Education
  • AQA AS and A-level Computer Science (7516 / 7517) specificationAQA

EuraStudy·Revision N11·MMXXVI

From study order to the exam — topic by topic.