Edexcel igcse CS practice questions
Edexcel igcse CS practice questions
---
## **Table of Contents**
1. **Problem Solving**
1.1 Algorithms
1.2 Decomposition and Abstraction
2. **Programming**
2.1 Develop Code
2.2 Constructs
2.3 Data Types and Structures
2.4 Input/Output
2.5 Operators
2.6 Subprograms
3. **Data**
3.1 Binary
3.2 Data Representation
3.3 Data Storage and Compression
3.4 Encryption
4. **Computers**
4.1 Machines and Computational Modelling
4.2 Hardware
4.3 Logic
4.4 Software
4.5 Programming Languages
---
1. Draw a flowchart to represent a login system where the user has three attempts
to enter the correct password before the account locks. (4 marks)
2. Convert the following pseudocode into a written description:
```
SET total TO 0
FOR num FROM 1 TO 10 DO
SET total TO total + num
END FOR
SEND total TO DISPLAY
```
(3 marks)
3. Write pseudocode for an algorithm that finds the largest number in a given list.
(3 marks)
4. Explain the importance of using trace tables when debugging an algorithm. (2
marks)
5. Describe the difference between a linear search and a binary search. (3 marks)
6. Implement a selection sort algorithm in pseudocode. (4 marks)
7. What is the time complexity of a bubble sort algorithm? (2 marks)
8. Explain how recursion can be used to implement the factorial function. (3 marks)
9. Modify the given pseudocode to calculate the sum of even numbers only. (3 marks)
10. Analyze the efficiency of merge sort versus insertion sort. (4 marks)
---
1. Decompose the task of calculating the average temperature over a week into three
sub-problems. (2 marks)
2. Explain how abstraction is applied in designing a self-driving car system. (3
marks)
3. Identify three benefits of problem decomposition. (3 marks)
4. Describe an example where abstraction is used in video game development. (3
marks)
5. Break down the process of online banking login into smaller components. (3
marks)
6. Explain how decomposition is applied in large software projects. (3 marks)
7. Create a flowchart to demonstrate decomposition in a recipe-following program.
(4 marks)
8. How does procedural programming support decomposition? (3 marks)
9. Define and give an example of an abstract data type (ADT). (3 marks)
10. Compare the use of abstraction in high-level and low-level programming
languages. (4 marks)
---
## **2. Programming**
### **2.1 Develop Code**
---
## **Remaining Sections**
## **3. Data**
### **3.1 Binary**
---
## **4. Computers**
### **4.1 Machines and Computational Modelling**
---
---
---
---
These questions align with **past paper patterns** (e.g., binary/hex conversions,
algorithm design, network topologies).
---
*This document will be completed with questions covering all topics from the
syllabus, ensuring a comprehensive revision resource.*