0% found this document useful (0 votes)

55 views

Algorithm Questions 10.4.18

The document describes an algorithm to calculate the equivalent age of a dog in human years. It states that if the dog's age is 2 years or less, the human equivalent is 12 times the dog's age. If the dog's age is more than 2 years, the human equivalent is 24 years for the first 2 years, plus 6 years for each additional year of the dog's age. The algorithm takes the dog's age in years as input, calculates the human equivalent age using the described method, and outputs the result.

Uploaded by

John Rod

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

55 views

Algorithm Questions 10.4.18

Uploaded by

John Rod

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 24

OCR GCSE Computing (prev.

course)
June 2011 9)
13
9 A dog that is 5 years old is equivalent to a 42 year old human. Ashok is writing a program which
converts the age of a dog to the equivalent age for a human.

The program uses the following method:

• The user inputs age of the dog in years

• If the age is 2 or less, the human equivalent is 12 times the age
• If the age is more than 2, the human equivalent is 24 for the first 2 years, plus 6 for every
additional year.

Write an algorithm to calculate and output the human equivalent of the age of a dog using the
method described.

..........................................................................................................................................................

..................................................................................................................................................... [5]

[END]

© OCR 2011
June 2012 12)c
15
(c) A taxi company uses a computer to communicate with central office and to calculate
customers' fares. The cost of a day-time journey is £3 for the first kilometre and £2 for every
kilometre after that. If there are five or more passengers in the taxi, an extra 50% is added to
the charge.
Write an algorithm to calculate the cost of a day-time journey.
Your algorithm should:
• allow the number of passengers and the distance of the journey to be input as whole
numbers,
• calculate the cost of the journey,
• output the cost that has been calculated.

...................................................................................................................................................

.............................................................................................................................................. [7]

© OCR 2012
January 2013 12)c 13
(c) Jim is writing a program to calculate the wages of workers in a teddy bear factory. The
wages earned by a worker is either £2 for every teddy bear they have made or £5 for
every hour they have worked, whichever is larger.
Write an algorithm that:
• allows the user to input the number of teddy bears made and the number of hours
worked
• calculates the wages for the number of teddy bears made
• calculates the wages for the number of hours worked
• outputs the larger of the two results.

...................................................................................................................................................

............................................................................................................................................. [6]

END OF QUESTION PAPER

© OCR 2013
June 2013 10) 14
10 An isosceles triangle is a triangle that has at least two equal sides. The diagram below shows
examples of isosceles triangles. In each diagram the marked sides are equal.

Write an algorithm for a computer program that determines whether a triangle is an isosceles
triangle.

• The user inputs the lengths of the three sides as Length1, Length2 and Length3
• If any two sides have the same length the program outputs “Isosceles”
• Otherwise the program outputs “Not Isosceles”

..........................................................................................................................................................

.................................................................................................................................................... [5]

END OF QUESTION PAPER

The machine has a small keypad with keys 0 to 9, OK and CANCEL. It also has a small LCD
screen, which can display a short message.

To get a drink, users select an item number between 1 and 20 with the keypad and confirm their
choice by pressing OK. If they make a mistake they can press the CANCEL button and start again.
If the selection is valid and the drink is available it dispenses the drink. The display screen is used
to show suitable short messages throughout the process.

Write an algorithm for the process described above.

The quality of written communication will be assessed in your answer.

..........................................................................................................................................................

..........................................................................................................................................................
© OCR 2014
17

..........................................................................................................................................................

..................................................................................................................................................... [6]

END OF QUESTION PAPER

© OCR 2014
June 2015 10) 18
10 A game on a computer shows six players around a table on seats. They are numbered 1 to 6 as
shown below.

Helen

1
Chan Adam
6 2

5 3
Priya Lidia
4
Kwaku

The names of the players are stored in an array with six elements called PlayerName. The
index position of the array is used to indicate the seat number.
For example, the value of PlayerName(1) is “Helen”.

During the game, each player sometimes moves clockwise by a given number of places.

For example, if the number of places is 2, Helen will move to seat 3, Priya will move to seat 1 etc.

Write an algorithm that will update the contents of the array PlayerName after a move has
occurred. Your algorithm should:

- allow the number of places to move to be input

- use iteration

- ensure that all of the players' names are moved to the correct position in the array

© OCR 2015
...................................................................................................................................................

...................................................................................................................................................

.............................................................................................................................................. [6]

END OF QUESTION PAPER

© OCR 2015
June 2016 9) 14
9 A memory game is played where:
• three players (A, B and C) have to choose a number between 0 and 100
• if the number has already been chosen, a message is displayed that says "taken"
• if the number has not already been chosen, the player’s letter is placed next to it
• the quantity of numbers that have not yet been chosen is displayed.

The winner is the player who has chosen the most unique numbers by the end of the game.

The numbers are stored in an array; numbers(). A number that has not yet been chosen is stored
as an empty string "". The players are represented by "A", "B" and "C".

Fig. 5 shows an extract from the array:

Number: 0 1 2 3 4 ... ... 99 100

Player: A C B A B

Fig. 5

You have been asked to program part of the game.

Write an algorithm for player A’s turn, which;

• takes as an input the number that player A chooses
• if it has not already been chosen, stores an "A" in that array element
• if it has already been chosen, outputs "taken"
• counts and outputs the quantity of numbers left that have not been chosen. [6]

..........................................................................................................................................................

END OF QUESTION PAPER

June 2014 12)b

Write an algorithm (using either pseudocode or a flowchart) that calculates the amount of fuel a train
will need to complete a journey. The algorithm must:

 ask the user how many kilometres the journey will be

 only continue if the user enters a value greater than zero
 set the amount of fuel to a number 100 times greater than the number
of kilometres
 not allow the amount of fuel to be less than 1500
 finally, display the amount of fuel needed.
[7 marks]

............................................................................................................................................

............................................................................................................................................
June 2015 9)

An English teacher wants to estimate how long it should take his students to read a
book. You have been asked to develop an algorithm to calculate this estimate. The
algorithm must do the following:

 ask the teacher how many pages the book has and store this in an appropriately
named variable

 for every page in the book the algorithm should:

 ask the teacher if the page looks 'easy' or 'difficult'

 if a page is 'difficult' then the total number of seconds should increase by 100

 if a page is 'easy' then the total number of seconds should increase by 40

 after the teacher has entered the difficulty level for all the pages, the algorithm
should output the estimated number of seconds that it should take to read the book.

Write pseudocode or draw a flowchart that represents this algorithm.

[9 marks]

............................................................................................................................................

...........................................................................................................................................

M/Jun15/4512/2
June 2016 9)d & e

The algorithm in Figure 5 simulates the game of rock–paper–scissors.

Player 1 enters the number 1 for paper, the number 2 for rock or the number 3 for
scissors. Player 2 then does the same.

You should assume that the numbers entered by the players are stored as integers.

Note: line numbers have been included but are not part of the algorithm.

Figure 5

1 options ← [‘paper’, ‘rock’, ‘scissors’]

2 player1 ← USERINPUT
3 player2 ← USERINPUT
4 player1HasWon ← false
5 draw ← false
6 IF player1 = 1 THEN
7 IF player2 = 2 THEN
8 player1HasWon ← true
9 ENDIF
10 ENDIF
11 IF player1 = 2 THEN
12 IF player2 = 3 THEN
13 player1HasWon ← true
14 ENDIF
15 ENDIF
16 IF player1 = 3 THEN
17 IF player2 = 1 THEN
18 player1HasWon ← true
19 ENDIF
20 ENDIF

Using either pseudocode or a flowchart, extend the algorithm in Figure 5 so that the
variable draw is set to the value true when both player 1 and player 2 choose the
same option. This code should follow on from the end of the algorithm in Figure 5.

Following on from this, then output:

• either that the game was a draw

• or, if it was not a draw, which option beat which option.

Example 1: If player 1 entered a 2 and player 2 entered a 3 then the algorithm should
output:
rock
beats
scissors

Example 2: If player 1 entered a 1 and player 2 entered a 2 then the algorithm should
output:
rock
beats
paper

M/Jun15/4512/2
Example 3: If both players entered 1 then the algorithm should output:
draw

Your answer should extend the algorithm in Figure 5 and leave the original algorithm unchanged.

Note: assume that array indexing starts at 1 so OUTPUT options[1] will output the value paper.

[12 marks]

...................................................................................................................................................

M/Jun15/4512/2
•

•
•
-1-

June 2017 3)c

School pupils are voting to change the colour of their uniform. They enter the
letter B for blue or the letter R for red. A flowchart for counting the votes is
shown. It is incomplete.
The parallelogram symbol is defined as input or output.
Complete this flowchart to show the algorithm used to count a single vote.
(4)

_I_
to.

•
OCR A Level Computing (prev. course) – F452

January 2009 1)e

A Computing student has written a program which stores and prints recipes. The student has
written the following algorithm to create the serial file:

OPEN OutputFile in Write Mode

WRITE RecipeName to OutputFile
WRITE NumberOfPeople to OutputFile
FOR each ingredient
WRITE NameOfIngredient,“;”,Units,“;”,Quantity to OutputFile
NEXT ingredient
CLOSE OutputFile

(‘WRITE’ writes a string into a text file and moves to the next line.)
The program can be used to calculate the quantities necessary to cater for different numbers of
people.
• The user inputs the new number of people.
• The data for the recipe is read one line at a time.
• For each ingredient the new quantity is calculated …
• … the data is output to a new file.

Write an algorithm for this process.

...................................................................................................................................................

............................................................................................................................................. [8]

January 2010 4)e

A mail order company charges for delivery depending on the volume and the weight of the items
purchased. A program processes orders and calculates the cost of delivery. Here is an extract:

The cost of delivery is calculated as follows:

• There is a basic delivery charge of £5 for all orders.

• If the total weight of an order is more than 1 kg, there is an additional charge of
£0.50 for every extra 0.1 kg.
• If the total volume of an order is more than 1000 cm3, there is an additional charge
of £0.50 for every extra 200 cm3.

Write an algorithm for a function which makes use of the global variables TotalWeight and
TotalVolume and returns the cost of delivery.

...................................................................................................................................................

.............................................................................................................................................. [7]
© OCR 2010
June 2009 4)c

A programmer is producing a computer program which allocates seats to customers in a small

theatre. The theatre has 10 rows, labelled A to J from front to back, and 15 seats in each row,
numbered 1 to 15 from left to right.

The program uses the following rules to choose the best seats.

Rule 1: All seats in one booking must be in the same row, next to each other.

Rule 2: The seats must be as close to the front as possible.

Write an algorithm which takes the number of tickets wanted as an input, and outputs the best seats
available.
...................................................................................................................................................

...................................................................................................................................................

............................................................................................................................................. [8]
© OCR 2009
June 2010 1)b

A program is designed to store the results of matches in a football competition and calculate the
rankings of the teams. When the results are entered, the number of points of each team are updated as
follows:

• If both teams have the same number of goals (draw) then each team gets 1 point.
• If one team has more goals than the other (i.e. there is a winner) then the winning team gets 3
points, and the losing team gets 0 points.

The algorithm for updating points in the case of a draw is given below.

IF goals_of_first_team = goals_of_second_team THEN

points_of(first_team) = points_of(first_team) + 1
points_of(second_team) = points_of(second_team) + 1
END IF

Using the same format, write the algorithm for updating the points if there is a winner.

...................................................................................................................................................

............................................................................................................................................ [4]

June 2010 2)f

Tacompil Ltd is a company which owns vending machines where customers can purchase audio CDs
containing songs of their choice. The playing length of each song, which has been selected, is stored in
an array called SongLength. When the user wants to write the songs selected onto a CD, the software
must check that the total playing length does not exceed 80 minutes.

The software contains the following function to perform this check.

01 FUNCTION CheckTotalLength() : BOOLEAN

02 TotalLength = 0
03 FOR i = 1 TO NumberOfSongs
04 TotalLength = TotalLength + SongLength(i)
05 NEXT i
06 RETURN (TotalLength > 80)
07 END FUNCTION

The algorithm for the function CheckTotalLength() contains a FOR loop in lines 03 to 05.

Rewrite this FOR loop as a WHILE loop.

...................................................................................................................................................

............................................................................................................................................ [5]

June 2010 3)c

A printing company uses a computer program to randomly generate and print bingo tickets.

Each bingo ticket has a grid with three rows and nine columns. Each row contains 5 numbers and 4
blank spaces.

4 32 45 68 82

9 26 51 62 88

24 47 55 65 71

The bingo ticket is printed using the following method.

• For every row in the array

• For every column in that row
o If the value is 0 then output a space,
o otherwise output the value

Write an algorithm in pseudo-code to print the numbers in the array onto a ticket. You should indent
your pseudo-code correctly to make it easier to understand.

...................................................................................................................................................

............................................................................................................................................ [8]

paper-1-nov-2024-insert-glass-house
No ratings yet
paper-1-nov-2024-insert-glass-house
5 pages
IGCSE Maths Past Examination Papers Classified by Topic
76% (98)
IGCSE Maths Past Examination Papers Classified by Topic
82 pages
Resume Office Boy
54% (39)
Resume Office Boy
1 page
Chapter 1-2-Test COMPUTER SCIENCE IGCSE
100% (6)
Chapter 1-2-Test COMPUTER SCIENCE IGCSE
5 pages
(Linguistics) Frank Palmer Semantics PDF
85% (53)
(Linguistics) Frank Palmer Semantics PDF
170 pages
Fervent Prayer - Dag Heward-Mills
100% (2)
Fervent Prayer - Dag Heward-Mills
10 pages
Angelyn Kim test
No ratings yet
Angelyn Kim test
12 pages
Computer Science Paper 2 Final Revision Questions - 2017
No ratings yet
Computer Science Paper 2 Final Revision Questions - 2017
9 pages
Question Paper5
No ratings yet
Question Paper5
13 pages
Computer Science Topic 1.2 Questions
No ratings yet
Computer Science Topic 1.2 Questions
37 pages
Year 10 Term 1 Revision Questions
No ratings yet
Year 10 Term 1 Revision Questions
36 pages
Ol-Cs ZM
No ratings yet
Ol-Cs ZM
16 pages
0417_m23_qp_12
No ratings yet
0417_m23_qp_12
20 pages
Paper 2 Practice Set A
No ratings yet
Paper 2 Practice Set A
12 pages
7110 s11 QP 21
No ratings yet
7110 s11 QP 21
20 pages
ETE3 ICT Application Revision - With Answer Key
No ratings yet
ETE3 ICT Application Revision - With Answer Key
10 pages
Unit_7_8_Worksheet 1 1
No ratings yet
Unit_7_8_Worksheet 1 1
6 pages
IGCSE - ICT - Paper 1 Theory - Paper 11
No ratings yet
IGCSE - ICT - Paper 1 Theory - Paper 11
11 pages
Cambridge International Advanced Subsidiary and Advanced Level
No ratings yet
Cambridge International Advanced Subsidiary and Advanced Level
16 pages
Math_Paper6_2022_2023_merged
No ratings yet
Math_Paper6_2022_2023_merged
208 pages
4BS0 01 Que 20130522
No ratings yet
4BS0 01 Que 20130522
24 pages
Cambridge International AS & A Level: Computer Science 9618/32
No ratings yet
Cambridge International AS & A Level: Computer Science 9618/32
12 pages
Business Studies - SR III (P1)
No ratings yet
Business Studies - SR III (P1)
8 pages
0450 may june 2024 paper 21
No ratings yet
0450 may june 2024 paper 21
6 pages
2025 Specimen Paper 3
No ratings yet
2025 Specimen Paper 3
12 pages
0478_s24_qp_13
No ratings yet
0478_s24_qp_13
12 pages
G9
No ratings yet
G9
8 pages
TCP Ip Service Programs Appl
No ratings yet
TCP Ip Service Programs Appl
32 pages
Micro 1
No ratings yet
Micro 1
158 pages
Cambridge IGCSE: Computer Science 0478/23
No ratings yet
Cambridge IGCSE: Computer Science 0478/23
21 pages
Robotics Toolbox 9.6 Tutorial
100% (1)
Robotics Toolbox 9.6 Tutorial
149 pages
HTML Theory Questions
No ratings yet
HTML Theory Questions
6 pages
Cambridge IGCSE: 0417/11 Information and Communication Technology
No ratings yet
Cambridge IGCSE: 0417/11 Information and Communication Technology
6 pages
May 2012 Computer Science Ocr Paper
No ratings yet
May 2012 Computer Science Ocr Paper
16 pages
Cambridge O Level: Global Perspectives 2069/12
No ratings yet
Cambridge O Level: Global Perspectives 2069/12
14 pages
Cambridge International AS & A Level: Computer Science 9618/32
No ratings yet
Cambridge International AS & A Level: Computer Science 9618/32
12 pages
CS Past Paper Book
No ratings yet
CS Past Paper Book
177 pages
CS Past Paper Book-pages-1
No ratings yet
CS Past Paper Book-pages-1
117 pages
0478_w24_qp_12
No ratings yet
0478_w24_qp_12
19 pages
Combine 1
No ratings yet
Combine 1
72 pages
06 0478 11 2024 3RP Afp J24 16052024101410
No ratings yet
06 0478 11 2024 3RP Afp J24 16052024101410
12 pages
GCSE Design and Technology - Electronic Products
No ratings yet
GCSE Design and Technology - Electronic Products
20 pages
Chapter 2
No ratings yet
Chapter 2
11 pages
16exact Vs Approx
No ratings yet
16exact Vs Approx
8 pages
Maths - Workbook 5 9
No ratings yet
Maths - Workbook 5 9
5 pages
Chapter 1 Data Representation Guess Papers
No ratings yet
Chapter 1 Data Representation Guess Papers
54 pages
Chap 1 Guess Paper
No ratings yet
Chap 1 Guess Paper
28 pages
Cambridge International Advanced Subsidiary and Advanced Level
No ratings yet
Cambridge International Advanced Subsidiary and Advanced Level
16 pages
Cambridge International Advanced Subsidiary and Advanced Level
No ratings yet
Cambridge International Advanced Subsidiary and Advanced Level
16 pages
Computer Science Past Paper
No ratings yet
Computer Science Past Paper
12 pages
Question Paper Paper 2PR June 2014 PDF
No ratings yet
Question Paper Paper 2PR June 2014 PDF
20 pages
Grade 10 Revision - Programs-If For Switch While Array String
No ratings yet
Grade 10 Revision - Programs-If For Switch While Array String
21 pages
Open Air
No ratings yet
Open Air
147 pages
IGCSE Computer Science 0478 - 11 Paper 1 Theory May - Jun 2023
No ratings yet
IGCSE Computer Science 0478 - 11 Paper 1 Theory May - Jun 2023
6 pages
Chapter 1 Data Representation Guess Papers 1 1 1
No ratings yet
Chapter 1 Data Representation Guess Papers 1 1 1
28 pages
Content: Importance of Computers
No ratings yet
Content: Importance of Computers
56 pages
Cambridge O Level: Computer Science 2210/11
No ratings yet
Cambridge O Level: Computer Science 2210/11
12 pages
4AC0 01 Accounting
No ratings yet
4AC0 01 Accounting
20 pages
Cobol Performance Tuning
No ratings yet
Cobol Performance Tuning
55 pages
Winter HHW Paper1 29tmn15
No ratings yet
Winter HHW Paper1 29tmn15
20 pages
1.6.2
No ratings yet
1.6.2
17 pages
Grade 10 Mathematics - docxTERM 3
No ratings yet
Grade 10 Mathematics - docxTERM 3
7 pages
Programming the Intel Galileo: Getting Started with the Arduino -Compatible Development Board
From Everand
Programming the Intel Galileo: Getting Started with the Arduino -Compatible Development Board
Christopher Rush
5/5 (1)
Programming the Photon: Getting Started with the Internet of Things
From Everand
Programming the Photon: Getting Started with the Internet of Things
Christopher Rush
5/5 (1)
Year-11-Crime-and-punishment.243953560
No ratings yet
Year-11-Crime-and-punishment.243953560
3 pages
Year-11-Religion-and-life.243953560
No ratings yet
Year-11-Religion-and-life.243953560
4 pages
Aqa Ase 2023 Implications Ec BK
No ratings yet
Aqa Ase 2023 Implications Ec BK
27 pages
Aqa Ase 2023 Develop A Level Assess Skills Practical Presentation
No ratings yet
Aqa Ase 2023 Develop A Level Assess Skills Practical Presentation
38 pages
FVJJ UQPSk NYC6 GRN Yhz E41 UN1 Ur Ew L2 GPW 20 USi G
No ratings yet
FVJJ UQPSk NYC6 GRN Yhz E41 UN1 Ur Ew L2 GPW 20 USi G
11 pages
Eor BDJ DH 4 CXI0 YW6 QVQ A1 Gisx A2 Xe KD VCP Vyfc 1 J
No ratings yet
Eor BDJ DH 4 CXI0 YW6 QVQ A1 Gisx A2 Xe KD VCP Vyfc 1 J
23 pages
Aqa Ase 2023 Implications Summer Series Presentation
No ratings yet
Aqa Ase 2023 Implications Summer Series Presentation
32 pages
Chemistry Paper 1 2022 Higher
No ratings yet
Chemistry Paper 1 2022 Higher
32 pages
Grade-11 - Q1-W2b-PCO-2.b For Student
No ratings yet
Grade-11 - Q1-W2b-PCO-2.b For Student
36 pages
Stfloats
No ratings yet
Stfloats
14 pages
Lesson 18
No ratings yet
Lesson 18
8 pages
DOT NET Syllabus (6 Months) : The Common Language Runtime (C.L.R.)
No ratings yet
DOT NET Syllabus (6 Months) : The Common Language Runtime (C.L.R.)
9 pages
Summary + Reference To The Context + Explanation: The Huntsman by Edward Lawbury
No ratings yet
Summary + Reference To The Context + Explanation: The Huntsman by Edward Lawbury
4 pages
Newsletter 10
No ratings yet
Newsletter 10
1 page
Prolegomena To Methods For Using The Ayutthayan Laws As Historical Source Material
No ratings yet
Prolegomena To Methods For Using The Ayutthayan Laws As Historical Source Material
24 pages
Chapter 3 Music and Other Performing Arts
100% (1)
Chapter 3 Music and Other Performing Arts
22 pages
Lesson Plan Preforming Art Baby Shark
No ratings yet
Lesson Plan Preforming Art Baby Shark
5 pages
Research Survey Questionnaire
No ratings yet
Research Survey Questionnaire
3 pages
Csit 365
No ratings yet
Csit 365
24 pages
ARTICLE
No ratings yet
ARTICLE
8 pages
Spoken and Written Language in CLIL-Some Theory
No ratings yet
Spoken and Written Language in CLIL-Some Theory
1 page
Cambridge Standard 12 Chapter 2
100% (1)
Cambridge Standard 12 Chapter 2
20 pages
Germany
No ratings yet
Germany
3 pages
Annex C-4_COT Rating Sheet for Highly Proficient Teacher for SY 2024-2025
No ratings yet
Annex C-4_COT Rating Sheet for Highly Proficient Teacher for SY 2024-2025
1 page
Introduction To: Abdul Alim Shakir
No ratings yet
Introduction To: Abdul Alim Shakir
15 pages
Rashid Khan CV
No ratings yet
Rashid Khan CV
3 pages
Edgar Allan Poe The Works of Edgar Allan Poe Volume 1 of The Raven Edition
No ratings yet
Edgar Allan Poe The Works of Edgar Allan Poe Volume 1 of The Raven Edition
419 pages
Second Analysis - The Flea and She Walks in Beauty
No ratings yet
Second Analysis - The Flea and She Walks in Beauty
5 pages
Fis2014 Fish Biology Individual Assignment (50 Marks)
No ratings yet
Fis2014 Fish Biology Individual Assignment (50 Marks)
2 pages
Richmond
No ratings yet
Richmond
11 pages
Indian History Short Notes - Third Semester
No ratings yet
Indian History Short Notes - Third Semester
10 pages
10 Conclusion
No ratings yet
10 Conclusion
7 pages
Mt940 Format Details
No ratings yet
Mt940 Format Details
12 pages
14-Cleft-Sentences-KTCS-BD-HSG-TA-đã chuyển đổi
No ratings yet
14-Cleft-Sentences-KTCS-BD-HSG-TA-đã chuyển đổi
6 pages
pakistans-unwanted-problem-afghan-refugees-by-ayaz-amir
No ratings yet
pakistans-unwanted-problem-afghan-refugees-by-ayaz-amir
3 pages

Algorithm Questions 10.4.18

Uploaded by

Algorithm Questions 10.4.18

Uploaded by

OCR GCSE Computing (prev.

The program uses the following method:

• The user inputs age of the dog in years

END OF QUESTION PAPER

END OF QUESTION PAPER

Write an algorithm for the process described above.

The quality of written communication will be assessed in your answer.

END OF QUESTION PAPER

- allow the number of places to move to be input

END OF QUESTION PAPER

Fig. 5 shows an extract from the array:

Number: 0 1 2 3 4 ... ... 99 100

You have been asked to program part of the game.

Write an algorithm for player A’s turn, which;

END OF QUESTION PAPER

June 2014 12)b

 ask the user how many kilometres the journey will be

 for every page in the book the algorithm should:

 ask the teacher if the page looks 'easy' or 'difficult'

 if a page is 'easy' then the total number of seconds should increase by 40

Write pseudocode or draw a flowchart that represents this algorithm.

The algorithm in Figure 5 simulates the game of rock–paper–scissors.

1 options ← [‘paper’, ‘rock’, ‘scissors’]

Following on from this, then output:

• either that the game was a draw

June 2017 3)c

January 2009 1)e

OPEN OutputFile in Write Mode

Write an algorithm for this process.

© OCR 2009 Turn over

The cost of delivery is calculated as follows:

• There is a basic delivery charge of £5 for all orders.

A programmer is producing a computer program which allocates seats to customers in a small

Rule 2: The seats must be as close to the front as possible.

IF goals_of_first_team = goals_of_second_team THEN

© OCR 2010 Turn over

The software contains the following function to perform this check.

01 FUNCTION CheckTotalLength() : BOOLEAN

Rewrite this FOR loop as a WHILE loop.

© OCR 2010 Turn over

The bingo ticket is printed using the following method.

• For every row in the array

You might also like