{"id":662037,"date":"2022-06-24T10:37:57","date_gmt":"2022-06-24T10:37:57","guid":{"rendered":"https:\/\/teachcomputerscience.com\/?page_id=662037"},"modified":"2022-06-24T10:38:00","modified_gmt":"2022-06-24T10:38:00","slug":"igcse","status":"publish","type":"page","link":"https:\/\/teachcomputerscience.com\/igcse\/","title":{"rendered":"Edexcel International GCSE Computer Science Teaching Resources & Lesson Plans"},"content":{"rendered":"

Edexcel IGCSE (9-1) Computer Science mapping file. Download our comprehensive teaching resources and use the mapping table to align to the Edexcel International examination board.<\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\n<\/th>\n\n

IGCSE specification<\/p>\n<\/th>\n

\n

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

\n

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

\n

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

\n

Problem Solving<\/strong><\/p>\n<\/td>\n

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

1.1<\/p>\n

1.2<\/p>\n<\/td>\n

\n

Algorithms<\/p>\n

Decomposition and Abstraction<\/p>\n<\/td>\n

\n

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

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

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

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

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

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

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

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

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

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

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

\n

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

Cell<\/td>\n\n

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

\n

2.1<\/p>\n<\/td>\n

\n

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

\n

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

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

2.2<\/p>\n<\/td>\n

\n

Constructs<\/p>\n<\/td>\n

\n

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

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

2.3<\/p>\n<\/td>\n

\n

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

\n

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

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

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

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

\n

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

\n

2.4<\/p>\n<\/td>\n

\n

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

\n

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

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

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

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

2.5<\/p>\n<\/td>\n

\n

Operators<\/p>\n<\/td>\n

\n

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

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

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

2.6<\/p>\n<\/td>\n

\n

Subprograms<\/p>\n<\/td>\n

\n

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

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

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

\n

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

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

3.1<\/p>\n<\/td>\n

\n

Binary<\/p>\n<\/td>\n

\n

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

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

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

3.2<\/p>\n<\/td>\n

\n

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

\n

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

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

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

\n

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

\n

3.3<\/p>\n<\/td>\n

\n

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

\n

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

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

3.4<\/p>\n<\/td>\n

\n

Encryption<\/p>\n<\/td>\n

\n

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

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

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

\n

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

\n<\/td>\n\n

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

\n

4.1<\/p>\n<\/td>\n

\n

Machines and computational modelling<\/span><\/p>\n<\/td>\n

\n

01. Introduction to computers<\/a><\/p>\n<\/td>\n

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

4.2<\/p>\n<\/td>\n

\n

Hardware<\/p>\n<\/td>\n

\n

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

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

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

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

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

4.3<\/p>\n<\/td>\n

\n

Logic<\/p>\n<\/td>\n

\n

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

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

4.4<\/p>\n<\/td>\n

\n

Software<\/p>\n<\/td>\n

\n

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

\n

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

\n

4.5<\/p>\n<\/td>\n

\n

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

\n

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

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

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

\n

Communications and Internet<\/strong><\/p>\n<\/td>\n

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

5.1<\/p>\n<\/td>\n

\n

Networks<\/p>\n<\/td>\n

\n

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

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

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

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

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

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

5.2<\/p>\n<\/td>\n

\n

Network Security<\/p>\n<\/td>\n

\n

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

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

5.3<\/p>\n<\/td>\n

\n

The Internet and the world wide web<\/p>\n<\/td>\n

\n

24. Internet technologies<\/a><\/p>\n

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

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

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

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

\n

The Bigger Picture<\/strong><\/p>\n<\/td>\n

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

<\/strong>6.1<\/p>\n<\/td>\n

\n

Emerging trends, issues and impact<\/p>\n<\/td>\n

\n

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

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

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

02. Reliability in computers<\/a><\/p>\n

01. Introduction to computers<\/a><\/p>\n

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

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

<\/p>\n\n\n<\/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>

\n\n\n

<\/p>\n

<\/p>\n\n\n<\/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. IGSE, 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>

\n\n\n

<\/p>\n

<\/p>\n\n\n<\/p>

\n\n\n

<\/p>\n

<\/p>\n\n\n<\/p>

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

\n\n\n

<\/p>\n

<\/p>\n\n\n<\/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>

\n\n\n

<\/p>\n

<\/p>\n\n\n<\/p>

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

\n\n\n

<\/p>\n

<\/p>\n\n\n<\/p>

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

\n\n\n

<\/p>\n

<\/p>\n\n\n<\/p>

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

\n\n\n

<\/p>\n

<\/p>\n\n\n<\/p>

Throughout your Edexcel IGCSE 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>

\n\n\n

<\/p>\n

<\/p>\n\n\n<\/p>

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

\n\n\n

<\/p>\n

<\/p>\n\n\n<\/p>

The examination process to get your IGCSE Computer Science certificate consists of two written papers. The first written assessment ( Principles of Computer Science) will last 2 hours and count for 50% of your final grade. The second paper (Application of Computational Thinking) will test your practical knowledge in C#, Java, or Python, and will last 3 hours. It also counts for 50% of your final mark.\u00a0<\/p>

\n\n\n

<\/p>\n

<\/p>\n\n\n<\/p>

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

\n\n\n

<\/p>\n

<\/p>\n\n\n<\/p>

You are advised to revise for a few hours each day in order to prepare for your iGCSE 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>

\n\n\n

<\/p>\n

<\/p>\n\n\n<\/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>

\n\n\n

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

Edexcel IGCSE (9-1) Computer Science mapping file. Download our comprehensive teaching resources and use the mapping table to align to the Edexcel International examination board. IGCSE specification GCSE Document Reference Additional content 1 Problem Solving 1.1 1.2 Algorithms Decomposition and Abstraction 28. Problem solving and algorithm design 34. Algorithm in pseudocode 29. Linear search 30. … <\/p>\n

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