{"id":1336,"date":"2018-07-13T10:51:52","date_gmt":"2018-07-13T10:51:52","guid":{"rendered":"http:\/\/teachcomputerscience.com\/?page_id=1336"},"modified":"2024-09-30T09:12:10","modified_gmt":"2024-09-30T09:12:10","slug":"edexcel","status":"publish","type":"page","link":"https:\/\/teachcomputerscience.com\/edexcel\/","title":{"rendered":"Edexcel GCSE Computing Teaching Resources & Revision Material"},"content":{"rendered":"

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

<\/p><\/th>

Edexcel specification<\/p><\/th>

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

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

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

Computational thinking<\/strong><\/p><\/td>

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

<\/p>

1.1<\/p>

1.2<\/p>

<\/p><\/td>

Decomposition and abstraction<\/p>

Algorithms<\/p><\/td>

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

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

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

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

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

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

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

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

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

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

Compare and contrast a bubble sort with a merge sort, and a linear search with a binary search.<\/p><\/td><\/tr>

1.3<\/p><\/td>

Truth tables<\/span><\/p><\/td>

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

<\/td><\/tr>

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

Data<\/strong><\/p><\/td>

<\/a><\/p><\/td>

<\/td><\/tr>

2.1<\/p><\/td>

Binary<\/span><\/p><\/td>

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

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

2.1.4 Converting signed binary digits to denary multiplication of negative numbers do not work<\/p><\/td><\/tr>

2.1<\/p><\/td>

Data representation<\/span><\/p><\/td>

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

13. Images &<\/span><\/span><\/a><\/p>

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

2.3.1 File size of an image and a sound file<\/p><\/td><\/tr>

2.3<\/p><\/td>

Data storage and compression<\/span><\/p><\/td>

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

Cell<\/td><\/tr>

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

Computers<\/strong><\/p><\/td>

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

3.1<\/span><\/p><\/td>

Hardware<\/span><\/p><\/td>

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

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

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

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

24. Internet technologies<\/span><\/span><\/a><\/p><\/td>

3.1.1 Bus<\/span><\/span><\/p>

3.1.3 Privacy and security concerns associated with Internet of things<\/span><\/span><\/span><\/span><\/a><\/p><\/td><\/tr>

3.2<\/p><\/td>

Software<\/span><\/p><\/td>

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

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

3.2.1 Common file handling functions, process management, user management, file repair <\/span><\/span><\/p>

<\/span><\/span><\/a>3.2.3 Robust software<\/span><\/span><\/p><\/td><\/tr>

3.3<\/p><\/td>

Programming languages<\/p><\/td>

05. Low and high level languages<\/span><\/span><\/a><\/p><\/td>

Cell<\/td><\/tr>

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

Networks<\/span><\/strong><\/p><\/td>

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

4.1<\/span><\/p><\/td>

Networks<\/p><\/td>

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

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

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

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

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

4.1.2 Difference between LAN and WAN<\/p>

4.1.3 Internet backbone and routers<\/p>

4.1.4 bandwidth, range, speed and latency<\/p>

4.1.5 Construct expressions involving file size, transmission rate and time<\/p>

4.1.6 Ethernet and Wi-Fi operate at the link layer<\/p><\/td><\/tr>

4.2<\/span><\/p><\/td>

Network security<\/span><\/p><\/td>

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

4.2.1 Ethical hacking, Internal and external penetration testing, physical security<\/p><\/td><\/tr>

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

Issues and impact<\/span><\/strong><\/p><\/td>

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

5.1<\/p>

5.2<\/p>

5.3<\/p><\/td>

Environmental<\/span><\/p>

Ethical and legal<\/span><\/p>

Cybersecurity<\/span><\/p><\/td>

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

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

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

47. Automated and emerging technologies<\/span><\/span><\/p>

02. Reliablity in computers<\/span><\/span><\/a><\/p><\/td>

5.1 Environmental<\/p>

5.2.2 Accountability, safety and liability in emerging technologies<\/p>

5.3.1 Key logger, technical vulnerabilities & social engineering <\/p>

5.3.2 Anti malware, acceptable use policies, data backup and recovery<\/p><\/td><\/tr>

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

Problem solving with programming<\/span><\/strong><\/p><\/td>

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

6.1<\/p><\/td>

Develop code<\/span><\/p><\/td>

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

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

6.1.3 Develop algorithms using flowchart and psuedocode (give more examples)<\/p>

6.1.5 Runtime error<\/p><\/td><\/tr>

6.2<\/p><\/td>

Constructs<\/span><\/p><\/td>

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

Relational operators and logical operators, include examples for operators<\/p><\/td><\/tr>

6.3<\/p><\/td>

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

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

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

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

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

6.3.3 Add more built in string functions from PLS and string formatting<\/p>

6.3.1 Include list functions<\/p><\/td><\/tr>

6.4<\/p><\/td>

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

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

39. File handling<\/span><\/span><\/a><\/p>

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

6.4.2 File and records<\/p>

6.4.3 Include program for validation and authentication<\/p><\/td><\/tr>

6.5<\/p><\/td>

Operators<\/span><\/p><\/td>

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

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

Modify operators section, difference between repetition and iteration<\/p><\/td><\/tr>

6.6<\/p><\/td>

Subprograms<\/p><\/td>

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

6.6.1 Built-in libraries<\/td><\/tr><\/tbody><\/table>

<\/p>

Well done, you\u2019re almost done with your GCSEs! Soon you\u2019ll have a GCSE in Computer Science. As your exams get closer, you might be starting to feel overwhelmed and anxious about them. Worry not, help is here! Let\u2019s talk about priorities \u2013 the first thing you need to do is write a detailed revision plan. Then half of your worries will be gone as all you have to do is follow your plan up until exam day. In order to do that, here\u2019s all you need to know and how we can help.<\/p>

<\/p>

<\/p>

By now you\u2019ve probably heard of different exam boards. This all may sound confusing, but the good news is that most of the content taught in subjects does not vary much by exam board. So even though you\u2019re taking Edexcel GCSE Computer Science and your friend is taking OCR GCSE Computer Science, you will still be studying the same thing essentially. What is different is what exam boards focus on when assessing your knowledge and understand of the topics. The Edexcel exam board is known for emphasising multiple-choice questions as a means of assessment. You should take this into account when planning your revision and try to incorporate practice quizzes. That way you\u2019ll be ready for what\u2019s ahead!<\/p>

<\/p>

<\/p>

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

<\/p>

<\/p>

For some context and history, Edexcel, as we know it today, was formed in 2003. They became the first privately owned exam board in the UK after Pearson Plc. and the Edexcel Foundation signed an agreement. Fun fact, Edexcel is a combination of the words education and excellence. Edexcel GCSE Computer Science is a linear subject.This means that you will only acquire your certificate if you sit all of your exams at the end of the course (not throughout it).<\/p>

<\/p>

<\/p>

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

<\/p>

<\/p>

Students usually take two years to complete the Edexcel GCSE Computer Science course. However, some have elected to take in just a year and others have taken up to three years.<\/p>

<\/p>

<\/p>

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

<\/p>

<\/p>

There are no prior learning or qualification requirements for taking the Edexcel GCSE Computer Science.<\/p>

<\/p>

<\/p>

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

<\/p>

<\/p>

In your Edexcel GCSE Computer Science course, you will cover problem-solving; programming; data; computers; communication and the internet; and, \u2018the bigger picture\u2019. You will also get to do a programming project in which you\u2019ll develop a computer program.<\/p>

<\/p>

<\/p>

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

<\/p>

<\/p>

The assessment for your GCSE Computer Science course will consist of two components. The first written paper (Principles of Computer Science) will include questions that target computer-related mathematics. It will last 1 hour and 40 minutes and count for 50% of your final grade. The second paper (Application of Computational Thinking) will contain questions based on a scenario. It will last 2 hours in total and will count for another 50% of your final GCSE grade.<\/p>

<\/p>

<\/p>

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

<\/p>

<\/p>

It is recommended that you study for two to three hours each day ahead of your GCSE Computer Science exams. This will mean that you will be studying for long enough to enter the stage of deep learning but not so long as to risk burnout. Another good way to remain balanced during the revision season is to try and lead a healthy lifestyle. Eat your greens, go for a run and make sure you get enough sleep. Following a healthy routine will help you feel fresher and mitigate any risks of anxiety or stress.<\/p>

<\/p>

<\/p>

But you shouldn\u2019t just be balancing your lifestyle, you should also balance how you use your revision hours. Instead of spending 2-3 hours reading, combine reading time with drawing mind maps and doing practice quizzes. Active learning like this increases your chances of information retention. Finally, once you start feeling more confident begin to do practice papers under timed conditions. Using past exam papers for this purpose will mean you\u2019ll know what to expect on exam day and how to manage your time under exam conditions. All of us at GCSE Computer Science are rooting for you to succeed in your exams. To help you do so, we\u2019ve got revision materials like quizzes, mind maps and flashcards waiting for you. Let\u2019s get started!<\/p>

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

Edexcel GCSE (9-1) Computer Science mapping file. Download our comprehensive teaching resources and use the mapping table to align to the Edexcel examination board. Updated and aligned to the new 2020 specification. Edexcel specification GCSE Document Reference Additional content 1 Computational thinking 1.1 1.2 Decomposition and abstraction Algorithms 28. Problem solving and algorithm design 34. Algorithm … <\/p>\n

Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":26,"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-1336","page","type-page","status-publish"],"acf":[],"jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/teachcomputerscience.com\/wp-json\/wp\/v2\/pages\/1336","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=1336"}],"version-history":[{"count":9,"href":"https:\/\/teachcomputerscience.com\/wp-json\/wp\/v2\/pages\/1336\/revisions"}],"predecessor-version":[{"id":684091,"href":"https:\/\/teachcomputerscience.com\/wp-json\/wp\/v2\/pages\/1336\/revisions\/684091"}],"wp:attachment":[{"href":"https:\/\/teachcomputerscience.com\/wp-json\/wp\/v2\/media?parent=1336"}],"wp:term":[{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/teachcomputerscience.com\/wp-json\/wp\/v2\/tags?post=1336"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}