Introduction

IGCSE Computer Science requires an understanding of the basic concepts of computational thinking and how computers as well as other digital devices work. Through this course, students will gain algorithmic processes, principles, hardware and software design, their applications and their impact on science and real life.

Objectives
Systematize the core knowledge of the subject
Become familiar with most IGCSE exam formats
Reduce pressure and study time
Improve scores effectively
Enhance independant thinking
Create a solid foundation for higher education
Characteristics
Quality teachers with extensive knowledge about students psychology
Teaching programs are based on international standards
Exclusive materials that closely follow the IGCSE formats
Personalized teaching method according to student progress
Commitment on IGCSE pass grade
Alternative to Practical completion support
Course content
Topic 1: Data representation
1.1 Binary and hexadecimal
1.2 Binary manipulation and negative numbers
1.3 How do computers represent text, images and sound?
1.4 Measuring data storage
1.5 Data compression
Topic 2: Data transmission
2.1 The structure of a data packet
2.2 Packet switching
2.3 Methods of data transmission
2.4 The universal serial bus (USB) interface
2.5 Detecting errors in data transmission
2.6 Encryption
Topic 3: Hardware
3.1 The role of the CPU
3.2 The fetch stage
3.3 The decode stage
3.4 The execute stage
3.5 Factors that can affect the performance of a CPU
3.6 Input and output devices
3.7 Data storage
3.8 Virtual memory
3.9 Cloud storage
3.10 Network hardware
Topic 4: Software
4.1 Types of software
4.2 Operating system
4.3 Interrupts
4.4 Types of programming language
4.5 Translators
4.6 Integrated Development Environment
Topic 5: The internet and its uses
5.1 The internet and the world wide web
5.2 Requesting and retrieving web pages
5.3 The purpose of a web browser
5.4 Digital currency
5.5 Cyber security
Topic 6: Automated and emerging technologies
6.1 Automated systems
6.2 Robotics
6.3 Robots in context
6.4 Artificial intelligence
Topic 7: Algorithm design and problem solving
7.1 Program development life cycle
7.2 Analysis
7.3 Design
7.4 Pseudocode
7.5 Coding
7.6 Testing
7.7 Common algorithms
7.8 Trace tables
7.9 Finding the purpose of an algorithm
7.10 Finding errors in a program and correcting the errors
Topic 8: Programming
8.1 Programming concepts
8.2 Data types
8.3 Input and output
8.4 Arithmetic operators
8.5 Sequence
8.6 Selection
8.7 Iteration
8.8 Totalling
8.9 Counting
8.10 String manipulation
8.11 Nested statements
8.12 Subroutines
8.13 Library routines
8.14 Maintainable programs
8.15 Arrays
8.16 File handling
Topic 9: Databases
9.1 Database structure
9.2 SQL
9.3 SELECT... FROM
9.4 SELECT... FROM... WHERE
9.5 Order by
9.6 SUM
9.7 COUNT
Topic 10: Boolean logic
10.1 The role of logic gates
10.2 The NOT logic gate
10.3 The AND logic gate
10.4 The OR logic gate
10.5 The NAND logic gate
10.6 The NOR logic gate
10.7 The XOR logic gate
10.8 Logic expressions
10.9 Representing truth tables
10.10 Representing logic expressions
10.11 Representing problem statements
Topic 11: Programming scenarios practice
11.1 Programming scenario
11.2 Method 1: Identifying the inputs, processes and outputs
11.3 Writing the code
11.4 Method 2: Practically carrying out the program and identifying the stages

Student achievement