Scribd
Upload
8 views

IGCSE Algorithm Design and Problem Solving Worksheet

The document is a worksheet for IGCSE Algorithm Design and Problem Solving, covering various topics including the program development cycle, computer systems, problem decomposition, algorithms, validation, verification, testing, and debugging. It includes questions on defining key concepts, explaining their importance, and practical tasks like drawing flowcharts and creating trace tables. The worksheet aims to assess understanding of algorithm design and problem-solving techniques in computer science.

Uploaded by

Aahana Singhal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

IGCSE Algorithm Design and Problem Solving Worksheet

The document is a worksheet for IGCSE Algorithm Design and Problem Solving, covering various topics including the program development cycle, computer systems, problem decomposition, algorithms, validation, verification, testing, and debugging. It includes questions on defining key concepts, explaining their importance, and practical tasks like drawing flowcharts and creating trace tables. The worksheet aims to assess understanding of algorithm design and problem-solving techniques in computer science.

Uploaded by

Aahana Singhal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

IGCSE Algorithm Design and Problem Solving Worksheet

Section A: Program Development Cycle

1.​ Define the following stages of the program development cycle: (2 * 4


=8M)

a) Analysis​
b) Design​
c) Coding​
d) Testing​

2.​ Explain why each stage is important in software development. (2M)​


Section B: Computer Systems and Subsystems ​
3. What is a sub-system in the context of computer systems? Give two examples.

​
4. Break down the 'Check time' sub-system from the smartphone alarm app into further
sub-systems. (Refer to Figure 7.3)

​
Section C: Problem Decomposition​
5. What is problem decomposition? How does it help in solving complex problems?​

Section D: Algorithms and Standard Methods of Solution(5M)​


7. What are the standard methods of solution in Algorithm explain?​

8. Draw a flowchart to calculate the average of five numbers.(5M)

​
9. Explain the difference between linear search and bubble sort with examples. (6 M)
​
10. Describe how totalling and counting algorithms are used in data processing.(2M)

Section E: Validation and Verification (4 M)​


11. What is validation? List and explain three types of validation checks.

​
12. Define verification and explain two methods used to verify data input.(4M)
Section F: Testing and Debugging​
13. What is a dry run, and how is it useful in testing algorithms?(2M)

14. Define algorithms and explain different symbols used in flowchart. (8M)

​
14. Create a trace table to dry run the following pseudocode:(5M)

Total <-0
FOR i = 1 TO 5
INPUT number
total <- total + number
NEXT i
OUTPUT total

i number (input) total (before) total (after)

1 2
2 3

3 4

4 1

5 5

15. Identify and correct the errors in the following pseudocode:

counter = 0
WHILE counter < 10
PRINT counter
counter = counter - 1
END WHILE

Section G: Flowcharts and Pseudocode​


16. Draw a flowchart to find the maximum of three numbers.

You might also like