{"id":1334,"date":"2018-07-13T10:51:38","date_gmt":"2018-07-13T10:51:38","guid":{"rendered":"http:\/\/teachcomputerscience.com\/?page_id=1334"},"modified":"2021-08-12T14:48:06","modified_gmt":"2021-08-12T14:48:06","slug":"aqa","status":"publish","type":"page","link":"https:\/\/teachcomputerscience.com\/aqa\/","title":{"rendered":"AQA GCSE (9-1) Computer Science Teaching Resources & Lesson Plans"},"content":{"rendered":"

AQA GCSE (9-1) Computer Science mapping file. Download our comprehensive teaching resources and use the mapping table to align to the AQA examination board. Updated and aligned to the new 2020 specification.<\/strong><\/strong><\/p>

<\/p><\/th>

AQA specification<\/p><\/th>

GCSE Document Reference<\/p><\/th>

Additional content<\/p><\/th><\/tr><\/thead>

<\/strong>1<\/strong><\/p><\/td>

Fundamentals of algorithm<\/strong><\/p><\/td>

<\/p><\/td>

<\/p><\/td><\/tr>

<\/p><\/td>

Representing algorithms<\/p><\/td>

28. Problem solving and algorithm design<\/a> <\/p>

34. Algorithm in pseudocode<\/a><\/p><\/td>

<\/p><\/td><\/tr>

<\/p><\/td>

Efficiency of algorithms<\/p><\/td>

34A. Efficiency of algorithms<\/a><\/p><\/td>

<\/p><\/td><\/tr>

<\/p><\/td>

Searching algorithms<\/p><\/td>

29. Linear search<\/a><\/p>

30. Binary search<\/a><\/p><\/td>

Cell<\/td><\/tr>

<\/p><\/td>

Sorting algorithms<\/p><\/td>

31. Bubble sort<\/a><\/p>

33. Merge sort<\/a><\/p><\/td>

<\/td><\/tr>

2<\/strong><\/p><\/td>

Programming<\/strong><\/p><\/td>

<\/td>

<\/p><\/td><\/tr>

<\/td>

Data types<\/p><\/td>

36. Variables and data types<\/a><\/p><\/td>

<\/p><\/td><\/tr>

<\/td>

Programming concepts<\/p><\/td>

35. Basic programming constructs<\/a><\/p>

38. Functions and procedures<\/a><\/p><\/td>

<\/p><\/td><\/tr>

<\/td>

Arithmetic operations in a programming language<\/p><\/td>

35. Basic programming constructs<\/a><\/p><\/td>

<\/p><\/td><\/tr>

<\/td>

Relational operations in a programming language<\/p><\/td>

34. Algorithm in pseudocode<\/a><\/p><\/td>

<\/p><\/td><\/tr>

<\/td>

Boolean operations in a programming language<\/p><\/td>

34. Algorithm in pseudocode<\/a><\/p><\/td>

<\/p><\/td><\/tr>

<\/td>

Data structures<\/p><\/td>

40. Data structures<\/a><\/p><\/td>

<\/p><\/td><\/tr>

<\/td>

Input\/output<\/p><\/td>

34. Algorithm in pseudocode<\/a><\/p><\/td>

<\/p><\/td><\/tr>

<\/td>

String handling operations in a programming language<\/p><\/td>

37. String manipulation<\/a><\/p><\/td>

<\/td><\/tr>
<\/td>

Random number generation in a programming language<\/p><\/td>

<\/p>

38A. Random number generation in programming<\/a><\/p><\/td>

<\/p><\/td><\/tr>

<\/td>

Structured programming and subbroutines (procedures and functions)<\/span><\/p><\/td>

38. Functions and procedures<\/a><\/p><\/td>

<\/td><\/tr>
<\/td>

Robust and secure programming<\/p><\/td>

41. Producing robust programs<\/a><\/p><\/td>

<\/td><\/tr>

3<\/strong><\/p><\/td>

Fundamentals of data representation<\/strong><\/p><\/td>

<\/p><\/td>

<\/p><\/td><\/tr>

<\/td>

Number bases<\/p>

Converting between number bases<\/p>

Units of information<\/p>

Binary arithmetic<\/p><\/td>

10. Binary system<\/a><\/p>

11. Hexadecimal system<\/a><\/p><\/td>

<\/p><\/td><\/tr>

<\/td>

Character encoding<\/p><\/td>

12. Character sets<\/a><\/p><\/td>

<\/p><\/td><\/tr>

<\/td>

Representing images<\/p><\/td>

13. Images<\/a><\/p><\/td>

<\/p><\/td><\/tr>

<\/td>

Representing sound<\/p><\/td>

14. Sound<\/a><\/p><\/td>

<\/p><\/td><\/tr>

<\/td>

Data compression <\/p><\/td>

15. File formats and compression<\/a><\/p><\/td>

Cell<\/td><\/tr>

4<\/strong><\/p><\/td>

Computer systems<\/strong><\/p><\/td>

<\/p><\/td>

<\/p><\/td><\/tr>

<\/td>

Hardware and software<\/p><\/td>

04. Operating system<\/a><\/p><\/td>

<\/td><\/tr>
<\/td>

Boolean logic<\/p><\/td>

03. Logic gates and circuits<\/a><\/p><\/td>

<\/td><\/tr>
<\/td>

Software classification<\/p><\/td>

04. Operating system<\/a><\/p><\/td>

<\/td><\/tr>
<\/td>

Systems architecture<\/p><\/td>

06. von Neumann architecture<\/a><\/p>

07. Functions and characteristics of CPU<\/a><\/p>

16. Computer memory<\/a><\/p>

17. Data storage<\/a><\/p>

25. Cloud computing and web applications<\/a><\/p><\/td>

<\/td><\/tr>
Cell<\/td>

Classification of programming languages<\/p><\/td>

05. High and low level languages<\/a><\/p><\/td>

Cell<\/td><\/tr>

5<\/strong><\/p><\/td>

Fundamentals of computer networks<\/strong><\/p><\/td>

18. Introduction to computer networks<\/a><\/p>

19. Network topology<\/a><\/p>

20. Wireless networks<\/a><\/p>

21. Network protocols and layers<\/a><\/p>

22. Network connections<\/a><\/p>

26. Computer security<\/a><\/p><\/td>

<\/p><\/td><\/tr>

6<\/strong><\/p><\/td>

Fundamentals of cyber security<\/strong><\/p><\/td>

<\/td><\/td><\/tr>
<\/td>

Cyber security threats<\/p>

Methods to detect and prevent cyber security threats<\/p><\/td>

26. Computer security<\/a><\/p><\/td>

<\/td><\/tr>

7<\/strong><\/p><\/td>

Relational databases and strucured query language (SQL)<\/span><\/strong><\/p><\/td>

Cell<\/td><\/td><\/tr>
Cell<\/td>

Relational databases<\/span><\/p><\/td>

42.Introduction to databases<\/span><\/a><\/p>

43. Relational databases<\/span><\/a><\/p><\/td>

Cell<\/td><\/tr>
Cell<\/td>

Structured query language (SQL)<\/p><\/td>

44. Structured query language<\/span><\/a><\/p><\/td>

Cell<\/td><\/tr>

8<\/strong><\/p><\/td>

Ethical, legal and environmental impacts of digital technology on wider society, including issues of privacy<\/strong><\/p><\/td>

27. Ethics<\/a><\/p><\/td>

Cell<\/td><\/tr><\/tbody><\/table>

<\/p>

Congrats, you\u2019ve almost made it \u2013 you\u2019re about to get a GCSE in Computer Science! It\u2019s likely starting to dawn on you that your exams are around the corner and that you have a lot to prepare. But don\u2019t worry, help is here! We\u2019ve got all the guidance you need to get you on track to acing all of your exams! First thing\u2019s first \u2013 do you havea revision plan? If not, it\u2019s time to create a well-structured and thought out study plan. Once you have that half of the job is done. All that\u2019s left is to follow it diligently until exam day. To support you as you prepare for your GCSE Computer Science exams, here\u2019s all you have to know about them and how we can help you.<\/p>

<\/p>

<\/p>

GCSE subject content is most often quite standardised across the different examination board to give everyone an equal chance to do well and be prepared for future studies.However, there are some small and common differences between what each exam board places most weight on during exams. AQA, in particular, is known for placing a lot of emphasis on theory. This means you should have your definitions and theories ready for exam day as you are likely to be tested on them directly (not just through context-based questions).<\/p>

<\/p>

<\/p>

About the Board<\/strong><\/h3>

<\/p>

<\/p>

For some history and context, AQA (or the Assessment and Qualification Alliance) is an exam board that was created all the way in 2000 after a series of mergers of exam boards in the 1990s. It has grown into one of the largest exam boards in the country as it offers a very wide range of secondary school certifications. In the parliament,Westminster has debated whether GCSE courses should be graded in a modular or linear way. Currently, the AQA Computer Science course is linear, which meansthat you can only get your qualification if you sit all of your exams at the end of the course and pass.<\/p>

<\/p>

<\/p>

How long will the course take to complete?<\/strong><\/h3>

<\/p>

<\/p>

Most people take two years to complete the GCSE Computer Science course. But, bear in mind that it is possible to do it in less time (one academic year) or to start early and take more time (three years).<\/p>

<\/p>

<\/p>

Is any prior knowledge required?<\/strong><\/h3>

<\/p>

<\/p>

AQA does not ask for any prior knowledge or course completion in order for you to take the GCSE Computer Science course.<\/p>

<\/p>

<\/p>

What will I study?<\/strong><\/h3>

<\/p>

<\/p>

Throughout your AQA GCSE Computer Science course you will learn about the fundamentals of algorithms; programming; fundamentals of data representation; computer systems; fundamentals of computer networks; fundamentals of cybersecurity; ethical, legal and environmental impacts of digital technology on wider society,including issues of privacy; aspects of software development; and, programming project. In addition, you\u2019ll also get to do a programming project.<\/p>

<\/p>

<\/p>

What is the examination process like?<\/strong><\/h3>

<\/p>

<\/p>

The examination process to get your GCSE Computer Science certificate consists of two written papers and one programming project. The first written assessment (Computational Thinking and Problem Solving) will last 1 hour and 30 minutes and count for 50% of your final grade. The second written paper (Written Assessment) will test your theoretical knowledge and last 1 hour and 30 minutes, also counting for 50% of your final mark. Finally, while the programming project doesn\u2019t count towardyour final grade, you are required to complete it. The purpose of the project is to develop your ability to use the knowledge and skills you gained throughout the course to solve a problem. You will be required to produce a computer programme to solve the programming project and to write a report totalling 20 hours of timetabled work.<\/p>

<\/p>

<\/p>

Study Tips<\/strong><\/h3>

<\/p>

<\/p>

You are advised to revise for a few hours each day in order to prepare for your GCSE Computer Science exams. Two to three hours a day would be ideal as this would give you enough time to enter deep learning without risking burnout. While you are revising computer science, you are advised to stay away from distractions on your computer during revision hours. Keep them as a treat for the end of the revision session instead and watch your productivity improve. <\/p>

<\/p>

<\/p>

Revision though, especially for a practical subject like this, is much more than just reading textbooks. One of the good ways to spend your revision time is to make mind maps and flashcards. You can not only use what you create for later revision but the very process of making it will help you retain more information! As time passes, begin to do timed practice papers by using past exam papers. Chances are, you haven\u2019t done too many exams under timed conditions yet. This is a great way to test yourself and learn how to manage your time under pressure ahead of the big day. Those of us at GCSE Computer Science are cheering for you. To help you succeed we\u2019ve got many different revision resources like mind maps, quizzes and past papers waiting for you. So let\u2019s get started!<\/p>

<\/p>","protected":false},"excerpt":{"rendered":"

AQA GCSE (9-1) Computer Science mapping file. Download our comprehensive teaching resources and use the mapping table to align to the AQA examination board. Updated and aligned to the new 2020 specification. AQA specification GCSE Document Reference Additional content 1 Fundamentals of algorithm Representing algorithms 28. Problem solving and algorithm design 34. Algorithm in pseudocode … <\/p>\n

Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":23,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_generate-full-width-content":"","_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"tags":[],"class_list":["post-1334","page","type-page","status-publish"],"acf":[],"jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/teachcomputerscience.com\/wp-json\/wp\/v2\/pages\/1334","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/teachcomputerscience.com\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/teachcomputerscience.com\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/teachcomputerscience.com\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/teachcomputerscience.com\/wp-json\/wp\/v2\/comments?post=1334"}],"version-history":[{"count":1,"href":"https:\/\/teachcomputerscience.com\/wp-json\/wp\/v2\/pages\/1334\/revisions"}],"predecessor-version":[{"id":666673,"href":"https:\/\/teachcomputerscience.com\/wp-json\/wp\/v2\/pages\/1334\/revisions\/666673"}],"wp:attachment":[{"href":"https:\/\/teachcomputerscience.com\/wp-json\/wp\/v2\/media?parent=1334"}],"wp:term":[{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/teachcomputerscience.com\/wp-json\/wp\/v2\/tags?post=1334"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}