Head to savemyexams.co.

uk for more awesome resources

7.2 Algorithms
Question Paper

Course CIE IGCSE Computer Science

Section 7. Algorithm design and problem-solving
Topic 7.2 Algorithms
Difficulty Medium

Time allowed: 20
Score: /11
Percentage: /100

Page 1 of 9

© 2015-2023 Save My Exams, Ltd. · Revision Notes, Topic Questions, Past Papers
 Head to savemyexams.co.uk for more awesome resources

Question 1
A satellite navigation system is an example of a computer system that is made up of sub-systems.

Part of a satellite navigation system:

allows the user to enter details for a new destination or select a previously saved destination
displays directions in the form of a visual map or as a list.
Draw a structure diagram for this part of the satellite navigation system.
[4]
[4 marks]

Page 2 of 9

© 2015-2023 Save My Exams, Ltd. · Revision Notes, Topic Questions, Past Papers
 Head to savemyexams.co.uk for more awesome resources

Question 2
Describe what the algorithm represented by the flowchart is doing.

[2]

Page 3 of 9

© 2015-2023 Save My Exams, Ltd. · Revision Notes, Topic Questions, Past Papers
 Head to savemyexams.co.uk for more awesome resources

Page 4 of 9

© 2015-2023 Save My Exams, Ltd. · Revision Notes, Topic Questions, Past Papers
 Head to savemyexams.co.uk for more awesome resources

[2 marks]

Question 3
The pseudocode algorithm shown has been written by a teacher to enter marks for the students in her class and then to
apply some simple processing.
   Count ← 0
   REPEAT
      INPUT Score[Count]
      IF Score[Count] >= 70
         THEN
           Grade[Count] ← "A"
         ELSE
           IF Score[Count] >= 60
             THEN
               Grade[Count] ← "B"
             ELSE
               IF Score[Count] >= 50
                 THEN
                   Grade[Count] ← "C"
                 ELSE
                   IF Score[Count] >= 40
                     THEN
                       Grade[Count] ← "D"
                     ELSE
                       IF Score[Count] >= 30
                         THEN
                           Grade[Count] ← "E"
                         ELSE
                           Grade[Count] ← "F"
                       ENDIF
                   ENDIF
               ENDIF
           ENDIF
       ENDIF
        Count ← Count + 1
   UNTIL Count = 30

Describe what happens in this algorithm.

 [3]
Page 5 of 9

© 2015-2023 Save My Exams, Ltd. · Revision Notes, Topic Questions, Past Papers
 Head to savemyexams.co.uk for more awesome resources

[3 marks]

Page 6 of 9

© 2015-2023 Save My Exams, Ltd. · Revision Notes, Topic Questions, Past Papers
 Head to savemyexams.co.uk for more awesome resources

Question 4
Describe the purpose of the algorithm.

 [2]

Page 7 of 9

© 2015-2023 Save My Exams, Ltd. · Revision Notes, Topic Questions, Past Papers
 Head to savemyexams.co.uk for more awesome resources

[2 marks]
Page 8 of 9

© 2015-2023 Save My Exams, Ltd. · Revision Notes, Topic Questions, Past Papers
 Head to savemyexams.co.uk for more awesome resources

Page 9 of 9

© 2015-2023 Save My Exams, Ltd. · Revision Notes, Topic Questions, Past Papers