0% found this document useful (0 votes)

62 views24 pages

Dog Age to Human Age Converter Program

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

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

62 views24 pages

Dog Age to Human Age Converter Program

Uploaded by

John Rod

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

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]

© OCR 2009 Turn over

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]

Common questions

The seating allocation algorithm takes a number of tickets as input and determines available seats by checking rows from front to back. It ensures all seats for a booking are in the same row and next to each other. Priority is given to booking the closest available seats to the front of the theatre. The algorithm iterates through rows and checks block availability per group size, outputting the best available seats .

The rock-paper-scissors algorithm can be extended by comparing players’ choices for equality. If both choose the same option, it should set a 'draw' variable to true and output 'draw.' If not a draw, the algorithm should determine the winner and output the winning option against the losing one. For example, 'rock beats scissors' if player 1 chooses rock and player 2 chooses scissors, utilizing conditional checks based on input values .

An algorithm for updating player positions around a table can be constructed by taking the number of places to move as input. For an array with elements representing players' names indexed by seat numbers, iterate over the array and use modulo arithmetic to calculate each player's new seating position, considering the total number of seats. This ensures that all players shift to the correct position after movement .

An algorithm to determine if a triangle is isosceles involves comparing the lengths of its sides. If any two sides among the input lengths Length1, Length2, and Length3 are equal in measurement, the triangle is isosceles, and the program should output "Isosceles." If no two sides are equal, it should output "Not Isosceles" .

An algorithm for a free drinks machine involves taking input from a keypad for a drink number between 1 and 20, displaying messages on an LCD, and confirming selection with an OK button. If a mistake is made, the CANCEL button resets the selection process. The algorithm checks if the entered number is valid and dispenses the drink if available, using appropriate short messages for user interaction throughout .

To convert a FOR loop into a WHILE loop for checking CD track length, initialize an index at 1 before starting the loop. Check if the index is within bounds, incrementing it after each iteration. Accumulate song lengths until the WHILE condition exits once the index reaches the number of songs. This approach maintains function integrity while changing loop type .

The algorithm initializes with a basic delivery charge of £5. It checks if the total weight exceeds 1 kg, adding £0.50 for every extra 0.1 kg. Simultaneously, for a volume over 1000 cm³, it adds £0.50 per extra 200 cm³. It utilizes both conditions to compute additional charges, which are added to the base fee to determine the total cost. Global variables TotalWeight and TotalVolume drive the calculations .

In football match scoring, if teams' goals are equal, each gains 1 point. For a win, the algorithm adds 3 points to the winner and none to the loser, with input conditions checking goals of the first and second team. If one team scores more, it updates their points using their goal differentials, reflecting match outcomes in team standings accurately .

To print bingo tickets from a grid array, the algorithm iterates through each row and column. If a row column's value equals zero, it outputs a space; otherwise, it outputs the number. Proper indentation and loop constructs ensure clarity and correctness during number display, accommodating the grid's requirement for both numbers and blank spaces .

To estimate reading time, the algorithm initially asks for the number of pages and then queries if each page is 'easy' or 'difficult.' It increases the reading time estimate by 100 seconds for difficult pages and 40 seconds for easy ones. Finally, it sums up the total seconds and outputs the estimated reading duration for the book .

Decision Trees and Ensemble Learning Guide
No ratings yet
Decision Trees and Ensemble Learning Guide
19 pages
C. Alice's Adventures in Cutting Cake: N A A A M M + 1 M + 1 M + 1 M M V
No ratings yet
C. Alice's Adventures in Cutting Cake: N A A A M M + 1 M + 1 M + 1 M M V
2 pages
Sum and Average Calculation Guide
No ratings yet
Sum and Average Calculation Guide
3 pages
Seal Population Estimation Method
No ratings yet
Seal Population Estimation Method
1 page
Mean Deviation and Standard Deviation Calculations
No ratings yet
Mean Deviation and Standard Deviation Calculations
39 pages
Rabbit Population Dynamics Model
No ratings yet
Rabbit Population Dynamics Model
3 pages
MMW Chapter-3
No ratings yet
MMW Chapter-3
13 pages
2014A
No ratings yet
2014A
32 pages
Mean Deviation Calculations for Data Sets
No ratings yet
Mean Deviation Calculations for Data Sets
40 pages
Mean Deviation and Variance Calculations
No ratings yet
Mean Deviation and Variance Calculations
36 pages
Mean Deviation Calculations for Data Sets
No ratings yet
Mean Deviation Calculations for Data Sets
44 pages
Mean Deviation Calculations in Statistics
No ratings yet
Mean Deviation Calculations in Statistics
35 pages
Student Handout 3
No ratings yet
Student Handout 3
2 pages
MDM4U0 Cycle 2 Test Overview
No ratings yet
MDM4U0 Cycle 2 Test Overview
4 pages
Les7e PTB 09
No ratings yet
Les7e PTB 09
31 pages
Normal Distribution and Empirical Rule Guide
No ratings yet
Normal Distribution and Empirical Rule Guide
19 pages
Standard Deviation Practice Exercises
No ratings yet
Standard Deviation Practice Exercises
6 pages
Mean Deviation Calculations Explained
No ratings yet
Mean Deviation Calculations Explained
2 pages
Discrete Random Process from Die Tosses
No ratings yet
Discrete Random Process from Die Tosses
1 page
ASS6 Central Limit Theorem CALISTA&CLYO
No ratings yet
ASS6 Central Limit Theorem CALISTA&CLYO
15 pages
Random Forest vs SVM: Key Differences
No ratings yet
Random Forest vs SVM: Key Differences
1 page
CH 3 Bulldog FRQ
No ratings yet
CH 3 Bulldog FRQ
2 pages
01 - 6.3 (One-Proportion Z-Intervals)
No ratings yet
01 - 6.3 (One-Proportion Z-Intervals)
2 pages
Cost Analysis: Tallant vs. Saxton
No ratings yet
Cost Analysis: Tallant vs. Saxton
1 page
STATS301 Assignment 1 Solutions Analysis
No ratings yet
STATS301 Assignment 1 Solutions Analysis
1 page
Frequency Distributions and Ogives Analysis
No ratings yet
Frequency Distributions and Ogives Analysis
78 pages
Data Science Mathematical Assignments
No ratings yet
Data Science Mathematical Assignments
2 pages
Handout 8: Problem Set 4: Solutions
No ratings yet
Handout 8: Problem Set 4: Solutions
6 pages
Big Data Computing: Week 7 Overview
No ratings yet
Big Data Computing: Week 7 Overview
4 pages
Poisson Distribution Fitting Analysis
No ratings yet
Poisson Distribution Fitting Analysis
3 pages
Kuc DIA2e ISM Chapter 09
No ratings yet
Kuc DIA2e ISM Chapter 09
22 pages
DOT Accident Prevention Program Analysis
No ratings yet
DOT Accident Prevention Program Analysis
1 page
Moments Calculation for Statistical Analysis
No ratings yet
Moments Calculation for Statistical Analysis
3 pages
Student Height Analysis by School
No ratings yet
Student Height Analysis by School
4 pages
Analyzing Rabbit Population Growth Models
No ratings yet
Analyzing Rabbit Population Growth Models
7 pages
Regression Multiple-Choice Solutions
No ratings yet
Regression Multiple-Choice Solutions
9 pages
Typhoon Probability Distribution Analysis
No ratings yet
Typhoon Probability Distribution Analysis
1 page
MATLAB Assignment #2 Instructions
No ratings yet
MATLAB Assignment #2 Instructions
3 pages
Klasifikasi
No ratings yet
Klasifikasi
25 pages
AS301 Practical Assignment
No ratings yet
AS301 Practical Assignment
2 pages
Compression Methods for Code Sharing
No ratings yet
Compression Methods for Code Sharing
45 pages
Conservation of Matter Lab Report
No ratings yet
Conservation of Matter Lab Report
2 pages
Arrays: Searching & Sorting Assignment
No ratings yet
Arrays: Searching & Sorting Assignment
4 pages
Set Splitting NP-Completeness Proof
No ratings yet
Set Splitting NP-Completeness Proof
1 page
Cost Accounting 15th Edition Horngren Test Bank
No ratings yet
Cost Accounting 15th Edition Horngren Test Bank
100 pages
Mle Assignment I
No ratings yet
Mle Assignment I
4 pages
Math - of - ML - Lecture - Notes2021 Lecture Notes For Mathematics of Machine Learning
No ratings yet
Math - of - ML - Lecture - Notes2021 Lecture Notes For Mathematics of Machine Learning
83 pages
Efficient Quicksort Analysis and Permutation
No ratings yet
Efficient Quicksort Analysis and Permutation
1 page
Daa Assignment - 1
No ratings yet
Daa Assignment - 1
1 page
ICPC成都题解
No ratings yet
ICPC成都题解
40 pages
C43 Lab05 DS
No ratings yet
C43 Lab05 DS
3 pages
Mode DAA
No ratings yet
Mode DAA
2 pages
Gaurav Rawal Extra Credit
No ratings yet
Gaurav Rawal Extra Credit
37 pages
Week 5
No ratings yet
Week 5
4 pages
Ada Que Bank
No ratings yet
Ada Que Bank
2 pages
SESSION 4 (All of My 10 Question)
No ratings yet
SESSION 4 (All of My 10 Question)
7 pages
Lab 4
No ratings yet
Lab 4
2 pages
ML Week - 6
No ratings yet
ML Week - 6
4 pages
ML Assignment 3
No ratings yet
ML Assignment 3
1 page
Factory Wage Calculation Algorithm
No ratings yet
Factory Wage Calculation Algorithm
2 pages
Crime and Punishment: Religious Views
No ratings yet
Crime and Punishment: Religious Views
3 pages
Religion, Creation, and Environmental Stewardship
No ratings yet
Religion, Creation, and Environmental Stewardship
4 pages
AQA GCSE Chemistry Paper 1 Nov 2024
No ratings yet
AQA GCSE Chemistry Paper 1 Nov 2024
5 pages
2004 May MS 7011
No ratings yet
2004 May MS 7011
14 pages
Aqa 8700 2 Final Ms Jun24 V
100% (1)
Aqa 8700 2 Final Ms Jun24 V
20 pages
AQA Physics Mark Scheme Insights 2022
No ratings yet
AQA Physics Mark Scheme Insights 2022
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
GCSE Chemistry Higher Paper 1 June 2022
100% (1)
GCSE Chemistry Higher Paper 1 June 2022
32 pages
2022 AQA Grade Boundaries Insights
No ratings yet
2022 AQA Grade Boundaries Insights
32 pages
ADVIA Chemistry XPT Operators Guide, EN, 11314536 DXDCM 09008b83808870b2-1525997962143
100% (2)
ADVIA Chemistry XPT Operators Guide, EN, 11314536 DXDCM 09008b83808870b2-1525997962143
242 pages
Advanced Python Full Stack Course
No ratings yet
Advanced Python Full Stack Course
12 pages
Word Processing Basics in Microsoft Word
No ratings yet
Word Processing Basics in Microsoft Word
18 pages
Android OS Comparison and Setup Guide
No ratings yet
Android OS Comparison and Setup Guide
284 pages
SC-900 Microsoft Security Exam Guide
No ratings yet
SC-900 Microsoft Security Exam Guide
16 pages
OSMR Exam Documentation Guide
No ratings yet
OSMR Exam Documentation Guide
6 pages
Microsoft Office Setup Guide
100% (1)
Microsoft Office Setup Guide
6 pages
Modbus TCP Integration for Energy Suite
No ratings yet
Modbus TCP Integration for Energy Suite
19 pages
Linked Lists: Stacks and Queues Implementation
No ratings yet
Linked Lists: Stacks and Queues Implementation
39 pages
RPA Specialist Resume - Rahul Kashyap
No ratings yet
RPA Specialist Resume - Rahul Kashyap
6 pages
Honor Device Log Analysis Report
No ratings yet
Honor Device Log Analysis Report
7 pages
Message Passing Interface - MPI
No ratings yet
Message Passing Interface - MPI
15 pages
JOI 2024/2025 Lottery Prize Calculation
No ratings yet
JOI 2024/2025 Lottery Prize Calculation
6 pages
SOP for Software QA Testing Process
100% (1)
SOP for Software QA Testing Process
12 pages
Marking Guide
No ratings yet
Marking Guide
4 pages
Eureka Registration Failure Logs
No ratings yet
Eureka Registration Failure Logs
28 pages
IoT-Based Structural Health Monitoring
No ratings yet
IoT-Based Structural Health Monitoring
9 pages
Computer Programming I Module Overview
No ratings yet
Computer Programming I Module Overview
7 pages
ALV Object Model: 2D Table Basics
No ratings yet
ALV Object Model: 2D Table Basics
16 pages
Factory Test Log: Boot Events Analysis
No ratings yet
Factory Test Log: Boot Events Analysis
1 page
Bhanu Teja: Civil Engineer & IT Specialist
No ratings yet
Bhanu Teja: Civil Engineer & IT Specialist
2 pages
Claroty CTD-QRadar-Installation Guide
No ratings yet
Claroty CTD-QRadar-Installation Guide
15 pages
Campus Lost & Found System Report
No ratings yet
Campus Lost & Found System Report
19 pages
AutoCAD Basics for Engineering Students
100% (3)
AutoCAD Basics for Engineering Students
163 pages
SAP MM Transport Request Guide
No ratings yet
SAP MM Transport Request Guide
10 pages
企業管理與JIT策略分析
No ratings yet
企業管理與JIT策略分析
2 pages
Understanding Pod Affinity & Anti-Affinity
No ratings yet
Understanding Pod Affinity & Anti-Affinity
5 pages
Pseudocode for Array Duplicates and More
No ratings yet
Pseudocode for Array Duplicates and More
15 pages
Relations and Functions in Programming
No ratings yet
Relations and Functions in Programming
2 pages
Murphi.ai Internship Opportunities 2026
No ratings yet
Murphi.ai Internship Opportunities 2026
5 pages

Dog Age to Human Age Converter Program

Uploaded by

Dog Age to Human Age Converter Program

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

Common questions

What are the steps in the algorithm for allocating seating in a small theater for group bookings, and how are they prioritized?

What are the steps in the algorithm for allocating seating in a small theater for group bookings, and how are they prioritized?

What enhancements can be made to a rock-paper-scissors algorithm to handle a draw scenario and output match results?

What enhancements can be made to a rock-paper-scissors algorithm to handle a draw scenario and output match results?

How can an algorithm be formed to allow players to move around a table of seats in a game, where each player can move clockwise by a specified number of positions?

How can an algorithm be formed to allow players to move around a table of seats in a game, where each player can move clockwise by a specified number of positions?

What algorithm can be used to determine if a triangle is isosceles based on the given side lengths?

What algorithm can be used to determine if a triangle is isosceles based on the given side lengths?

What is a suitable algorithm to manage a free drinks machine operation in an office based on item selection and confirmation?

What is a suitable algorithm to manage a free drinks machine operation in an office based on item selection and confirmation?

Explain the transformation from a FOR loop to a WHILE loop in a function checking if the total length of CD tracks exceeds 80 minutes.

Explain the transformation from a FOR loop to a WHILE loop in a function checking if the total length of CD tracks exceeds 80 minutes.

How does one design a delivery cost calculation algorithm considering weight and volume surcharges?

How does one design a delivery cost calculation algorithm considering weight and volume surcharges?

How should a program adjust recorded points during a football match based on match results for either team?

How should a program adjust recorded points during a football match based on match results for either team?

What pseudocode algorithm would print bingo tickets accurately from a given numeric grid?

What pseudocode algorithm would print bingo tickets accurately from a given numeric grid?

Describe the logic behind an algorithm designed to compute the reading time of a book based on page difficulty.

Describe the logic behind an algorithm designed to compute the reading time of a book based on page difficulty.

You might also like