0% found this document useful (0 votes)

8 views

23_programming_qp

The document outlines requirements for programming tasks involving arrays to manage sports league data, temperature readings, banking details, and contact information. Each task specifies the need for input validation, data processing, and output formatting, while emphasizing the use of pseudocode or program code with comments. The tasks cover calculating points, averaging temperatures, managing bank accounts, and handling contact details with constraints on data size and sorting.

Uploaded by

wuw6904

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

8 views

23_programming_qp

Uploaded by

wuw6904

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 21

14

11 The one-dimensional (1D) array TeamName[] contains the names of teams in a sports league.
The two-dimensional (2D) array TeamPoints[] contains the points awarded for each match.
The position of each team’s data in the two arrays is the same. For example, the team stored at
index 10 in TeamName[] and TeamPoints[] is the same.

The variable LeagueSize contains the number of teams in the league. The variable MatchNo
contains the number of matches played. All teams have played the same number of matches.

The arrays and variables have already been set up and the data stored.

Each match can be played at home or away. Points are recorded for the match results of each
team with the following values:
• 3 – away win
• 2 – home win
• 1 – drawn match
• 0 – lost match.

Write a program that meets the following requirements:

• calculates the total points for all matches played for each team
• counts the total number of away wins, home wins, drawn matches and lost matches for each
team
• outputs for each team:
– name
– total points
– total number of away wins, home wins, drawn matches and lost matches
• finds and outputs the name of the team with the highest total points
• finds and outputs the name of the team with the lowest total points.

You must use pseudocode or program code and add comments to explain how your code works.

You do not need to declare any arrays, variables or constants; you may assume that this has
already been done.

All inputs and outputs must contain suitable messages.

You do not need to initialise the data in the arrays TeamName[] and TeamPoints[] or the
variables LeagueSize and MatchNo

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

© UCLES 2023 0478/22/F/M/23

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

..........................................................................................................................................................
© UCLES 2023 0478/22/F/M/23 [Turn over
16

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

.................................................................................................................................................. [15]

Permission to reproduce items where third-party owned material protected by copyright is included has been sought and cleared where possible. Every
reasonable effort has been made by the publisher (UCLES) to trace copyright holders, but if any items requiring clearance have unwittingly been included, the
publisher will be pleased to make amends at the earliest possible opportunity.

To avoid the issue of disclosure of answer-related information to candidates, all copyright acknowledgements are reproduced online in the Cambridge
Assessment International Education Copyright Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download
at www.cambridgeinternational.org after the live examination series.

Cambridge Assessment International Education is part of Cambridge Assessment. Cambridge Assessment is the brand name of the University of Cambridge
Local Examinations Syndicate (UCLES), which is a department of the University of Cambridge.

© UCLES 2023 0478/22/F/M/23

11 A one-dimensional (1D) array Days[] contains the names of the days of the week. A
two-dimensional (2D) array Readings[] is used to store 24 temperature readings, taken once
an hour, for each of the seven days of the week. A 1D array AverageTemp[] is used to store the
average temperature for each day of the week.

The position of any day’s data is the same in all three arrays. For example, if Wednesday is
in index 4 of Days[], Wednesday’s temperature readings are in index 4 of Readings[] and
Wednesday’s average temperature is in index 4 of AverageTemp[]

The temperature readings are in Celsius to one decimal place. Temperatures can only be from
–20.0 °C to +50.0 °C inclusive.

Write a program that meets the following requirements:

• input and validate the hourly temperatures for one week
• calculate and store the average temperature for each day of the week
• calculate the average temperature for the whole week
• convert all the average temperatures from Celsius to Fahrenheit by using the formula
Fahrenheit = Celsius * 9 / 5 + 32
• output the average temperature in Celsius and in Fahrenheit for each day
• output the overall average temperature in Celsius and in Fahrenheit for the whole week.

You must use pseudocode or program code and add comments to explain how your code works.

You do not need to declare any arrays, variables or constants; you may assume that this has
already been done.

All inputs and outputs must contain suitable messages.

All data output must be rounded to one decimal place.

You will need to initialise and populate the array Days[] at the start of the program.

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

..........................................................................................................................................................
© UCLES 2023 0478/21/M/J/23
15

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

..........................................................................................................................................................
© UCLES 2023 0478/21/M/J/23 [Turn over
16

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

.................................................................................................................................................. [15]

© UCLES 2023 0478/21/M/J/23

12 A two-dimensional (2D) array Account[] contains account holders’ names and passwords for a
banking program.

A 2D array AccDetails[] has three columns containing the following details:

• column one stores the balance – the amount of money in the account, for example 250.00
• column two stores the overdraft limit – the maximum total amount an account holder can
borrow from the bank after the account balance reaches 0.00, for example 100.00
• column three stores the withdrawal limit – the amount of money that can be withdrawn at one
time, for example 200.00

The amount of money in a bank account can be negative (overdrawn) but not by more than the
overdraft limit.
For example, an account with an overdraft limit of 100.00 must have a balance that is greater than
or equal to –100.00

Suitable error messages must be displayed if a withdrawal cannot take place, for example if the
overdraft limit or the size of withdrawal is exceeded.

The bank account ID gives the index of each account holder’s data held in the two arrays.
For example, account ID 20’s details would be held in:
Account[20,1] and Account[20,2]
AccDetails[20,1] AccDetails[20,2] and AccDetails[20,3]

The variable Size contains the number of accounts.

The arrays and variable Size have already been set up and the data stored.

Write a program that meets the following requirements:

• checks the account ID exists and the name and password entered by the account holder
match the name and password stored in Account[] before any action can take place
• displays a menu showing the four actions available for the account holder to choose from:
1. display balance
2. withdraw money
3. deposit money
4. exit
• allows an action to be chosen and completed. Each action is completed by a procedure
with a parameter of the account ID.

You must use pseudocode or program code and add comments to explain how your code works.
All inputs and outputs must contain suitable messages.

You only need to declare any local arrays and local variables that you use.

You do not need to declare and initialise the data in the global arrays Account[] and
AccDetails[] and the variable Size

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

..........................................................................................................................................................
© UCLES 2023 0478/22/M/J/23
13

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

..........................................................................................................................................................
© UCLES 2023 0478/22/M/J/23 [Turn over
14

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

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

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

.................................................................................................................................................. [15]
© UCLES 2023 0478/22/M/J/23
12

11 A two-dimensional (2D) array Contacts[] is used to store names and telephone numbers. All
the data is stored as strings. The array must have the capacity to store 100 contacts in the form of:
• column 1 – contact names as: last name, first name
for example: Smith, John
• column 2 – telephone numbers.

The variable CurrentSize shows how many contacts are in the array.

Write a program that meets the following requirements:

• display a menu of choices:
○ enter new contact details
○ display all the contact details
○ delete all the contact details
• validate the menu input
• allow up to a maximum of five new contacts to be added to the array at any one time
• do not allow more than 100 contacts in total
• after new contacts have been added, sort the array by contact name, as long as there are at
least two contacts in the array
• output the whole of the array
• delete the contents of the array.

You must use pseudocode or program code and add comments to explain how your code works.

You do not need to declare any arrays, variables or constants; you may assume that this has
already been done.

All inputs and outputs must contain suitable messages.

You do not need to initialise the data in the array Contacts[] and the variable CurrentSize

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

© UCLES 2023 0478/23/M/J/23

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

..........................................................................................................................................................
© UCLES 2023 0478/23/M/J/23 [Turn over
14

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

.................................................................................................................................................. [15]

© UCLES 2023 0478/23/M/J/23

10 Drama students put on a performance of a play for one evening. Seats in a small theatre can be
booked for this performance.

The theatre has 10 rows of 20 seats. The status of the seat bookings for the evening is held in the
two-dimensional (2D) Boolean array Evening[]

Each element contains FALSE if the seat is available and TRUE if the seat is booked.

Up to and including four seats can be booked at one time. Seats are allocated in order from those
available. A row or seat number cannot be requested.

The array Evening[] has already been set up and some data stored.

Write a program that meets the following requirements:

• counts and outputs the number of seats already booked for the evening
• allows the user to input the number of seats required
• validates the input
• checks if enough seats are available:
– if they are available
○ changes the status of the seats
○ outputs the row number and seat number for each seat booked
– if they are not available:
○ outputs a message giving the number of seats left or ‘House full’ if the theatre is fully
booked.

You must use pseudocode or program code and add comments to explain how your code works.
You do not need to declare any arrays or variables; you may assume that this has already been
done.
You do not need to initialise the data in the array Evening[]
All inputs and outputs must contain suitable messages.

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

..........................................................................................................................................................
© UCLES 2023 0478/21/O/N/23 [Turn over
14

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

.................................................................................................................................................. [15]

11 A wood flooring company stores the names of up to 100 customers in a one‑dimensional (1D) array
Customers[]. A two‑dimensional (2D) array Quotations[] stores details of each customer’s
quotation:
• length of room (one decimal place)
• width of room (one decimal place)
• area of wood required (rounded up to next whole number)
• choice of wood index (whole number)
• price of wood required in dollars (two decimal places).

The floor measurements (room length and room width) are taken in metres. All floors are rectangles
and room measurements must be between 1.5 and 10.0 inclusive.

The index of any customer’s data is the same in both arrays. For example, a customer named in
index 4 of Customers[] corresponds to the data in index 4 of Quotations[]

The wood choices available are:

Index Wood type Price per square metre ($)

1 Laminate 29.99
2 Pine 39.99
3 Oak 54.99

The data are stored in two 1D arrays named WoodType[] and Price[]. The index of the wood
type and price in their arrays share the same index number.

Write a program that meets the following requirements:

• input a new customer’s name, room length and room width
• check that each measurement is valid
• output an error message and require the measurement to be re‑entered until it is valid
• calculate the area of the room by multiplying together the length of the room and the width of
the room
• input the choice of wood and find its price per square metre
• calculate the price of the wood needed
• store all data in the relevant array
• output the customer’s quotation to include: the name of the customer, the choice of wood and
the calculated price of the wood required
• continue to accept the next customer.

You must use pseudocode or program code and add comments to explain how your code works.
You do not need to declare any arrays or variables; you may assume that this has already been
done.

You will need to initialise WoodType[] and Price[]

All inputs and outputs must contain suitable messages.

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

..........................................................................................................................................................
© UCLES 2023 0478/22/O/N/23
13

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

..........................................................................................................................................................
© UCLES 2023 0478/22/O/N/23 [Turn over
14

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

.................................................................................................................................................. [15]

10 A weather station takes temperature readings once an hour for a week. These temperatures are
stored in a two-dimensional (2D) array Temperatures[]
Each column contains 24 readings for a single day. The first temperature is recorded at 00:00 and
the final temperature at 23:00. There are seven columns, one for each day of the week, starting
with Monday and ending with Sunday.

The variables MaxDay, MinDay and AvDay are used to store the maximum, minimum, and
average temperatures for a day. The variables MaxWeek, MinWeek and AvWeek are used to store
the maximum, minimum, and average temperatures for the week.

The array has already been set up and the data stored.

Write a program that meets the following requirements:

• finds the maximum and minimum temperatures for each day
• calculates the average temperature for each day
• outputs for each day:
– name of the day, for example Monday
– maximum temperature
– minimum temperature
– average temperature
• finds the maximum and minimum temperatures for the week
• calculates the average temperature for the week
• outputs:
– maximum temperature for the week
– minimum temperature for the week
– average temperature for the week.

All temperatures output must be rounded to two decimal places.

You must use pseudocode or program code and add comments to explain how your code works.
All inputs and outputs must contain suitable messages.

You do not need to declare any arrays or variables; you may assume that this has already been
done.
You do not need to initialise the data in the array Temperatures[]

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

..........................................................................................................................................................
© UCLES 2023 0478/23/O/N/23
15

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

..........................................................................................................................................................
© UCLES 2023 0478/23/O/N/23 [Turn over
16

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

.................................................................................................................................................. [15]

Data8 sp22 Midterm Solution
No ratings yet
Data8 sp22 Midterm Solution
16 pages
CompleteSamplePapers Robert Lomax 11plus
No ratings yet
CompleteSamplePapers Robert Lomax 11plus
121 pages
Cricket Score Maintenance C++ Source Code
No ratings yet
Cricket Score Maintenance C++ Source Code
6 pages
Fritzing for Inventors: Take Your Electronics Project from Prototype to Product
From Everand
Fritzing for Inventors: Take Your Electronics Project from Prototype to Product
Simon Monk
No ratings yet
Complete Audio Mastering: Practical Techniques
From Everand
Complete Audio Mastering: Practical Techniques
Gebre E. Waddell
5/5 (5)
Programming FPGAs: Getting Started with Verilog
From Everand
Programming FPGAs: Getting Started with Verilog
Simon Monk
3.5/5 (2)
15 Marks Questions in 2023
No ratings yet
15 Marks Questions in 2023
27 pages
Teams - 15 Marks Que
No ratings yet
Teams - 15 Marks Que
3 pages
abacus notes 1
No ratings yet
abacus notes 1
2 pages
Scenario Question Bank
No ratings yet
Scenario Question Bank
7 pages
CS2210 May June 2024 Paper 2 Variant 1-Question
No ratings yet
CS2210 May June 2024 Paper 2 Variant 1-Question
3 pages
Pseudocode
No ratings yet
Pseudocode
16 pages
Pseudocode Clubs
No ratings yet
Pseudocode Clubs
2 pages
Foot Ball Tournament
No ratings yet
Foot Ball Tournament
1 page
3 B
No ratings yet
3 B
3 pages
Cricket
No ratings yet
Cricket
1 page
Clubs_pesudocode
No ratings yet
Clubs_pesudocode
1 page
15 Marker Cricket Runs
No ratings yet
15 Marker Cricket Runs
2 pages
Project Python-1
No ratings yet
Project Python-1
3 pages
Summary
No ratings yet
Summary
31 pages
15 Marker Clubs and Statistics
No ratings yet
15 Marker Clubs and Statistics
1 page
UGBA196+Summer+2024+Group+Project
No ratings yet
UGBA196+Summer+2024+Group+Project
2 pages
C++ Program
No ratings yet
C++ Program
1 page
Computer_science_paper_1__SL (2)
No ratings yet
Computer_science_paper_1__SL (2)
2 pages
Soccer League Management Software
No ratings yet
Soccer League Management Software
6 pages
MATLAB Fundamentals - Quick Reference
No ratings yet
MATLAB Fundamentals - Quick Reference
14 pages
Numbers & Counting, Grades PK - 1: Canadian Edition
From Everand
Numbers & Counting, Grades PK - 1: Canadian Edition
Carson Dellosa Education
No ratings yet
Soccer Standings: Problem E
No ratings yet
Soccer Standings: Problem E
2 pages
240pgm9
No ratings yet
240pgm9
11 pages
Math Champs! Tables, Charts, and Graphs
From Everand
Math Champs! Tables, Charts, and Graphs
Tom Yager
5/5 (1)
Project 4
No ratings yet
Project 4
20 pages
AGH Computer Science C Programming Laboratory 7
No ratings yet
AGH Computer Science C Programming Laboratory 7
3 pages
2015 Paper 2 Specimen Paper Markscheme (Computer Science)
No ratings yet
2015 Paper 2 Specimen Paper Markscheme (Computer Science)
8 pages
CP 09 Arrays1
No ratings yet
CP 09 Arrays1
66 pages
Hw4 Assignment
No ratings yet
Hw4 Assignment
3 pages
Pitcher Performance
No ratings yet
Pitcher Performance
5 pages
9608 Y15 SP 2
No ratings yet
9608 Y15 SP 2
16 pages
Teardowns: Learn How Electronics Work by Taking Them Apart
From Everand
Teardowns: Learn How Electronics Work by Taking Them Apart
Bryan Bergeron
No ratings yet
cricket scoreboard project dsoop
No ratings yet
cricket scoreboard project dsoop
5 pages
10K Blueprint
From Everand
10K Blueprint
Cian O Farrell
5/5 (2)
CS2210 May June 2024 Paper 2 Variant 1 Marking Scheme
No ratings yet
CS2210 May June 2024 Paper 2 Variant 1 Marking Scheme
3 pages
CS201P Assignment 2 Solution Spring 2024
No ratings yet
CS201P Assignment 2 Solution Spring 2024
9 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)
Lab 10
No ratings yet
Lab 10
5 pages
410 HW Sol Erd1
100% (1)
410 HW Sol Erd1
2 pages
7 - DBMS Python Questions
No ratings yet
7 - DBMS Python Questions
2 pages
12 Scenario Based Questions
No ratings yet
12 Scenario Based Questions
12 pages
Project Three: Simple Linear Regression and Multiple Regression
No ratings yet
Project Three: Simple Linear Regression and Multiple Regression
10 pages
Soccerh PDF
No ratings yet
Soccerh PDF
2 pages
Python Solutions For iPA 10-Feb-23
No ratings yet
Python Solutions For iPA 10-Feb-23
21 pages
Ipl Dataset Write Up
No ratings yet
Ipl Dataset Write Up
14 pages
Software Patterns Made Easy
From Everand
Software Patterns Made Easy
Justice Nanhou
No ratings yet
Assignment 1 E23
No ratings yet
Assignment 1 E23
3 pages
Electronics from the Ground Up: Learn by Hacking, Designing, and Inventing
From Everand
Electronics from the Ground Up: Learn by Hacking, Designing, and Inventing
Ronald Quan
3.5/5 (2)
Data-Engineering EINDE
No ratings yet
Data-Engineering EINDE
13 pages
Test 1
No ratings yet
Test 1
3 pages
3D Printer Projects for Makerspaces
From Everand
3D Printer Projects for Makerspaces
Lydia Sloan Cline
4/5 (1)
Microsoft SQL Server 2005: A Beginner''s Guide
From Everand
Microsoft SQL Server 2005: A Beginner''s Guide
Dusan Petkovic
No ratings yet
PF Final 10th Dec 2019
No ratings yet
PF Final 10th Dec 2019
3 pages
How to Start and Run an eBay Consignment Business
From Everand
How to Start and Run an eBay Consignment Business
Skip McGrath
No ratings yet
Breakthrough Improvement with QI Macros and Excel: Finding the Invisible Low-Hanging Fruit: Finding the Invisible Low-Hanging Fruit
From Everand
Breakthrough Improvement with QI Macros and Excel: Finding the Invisible Low-Hanging Fruit: Finding the Invisible Low-Hanging Fruit
Jay Arthur
No ratings yet
Thesis Examination Board
100% (2)
Thesis Examination Board
4 pages
Mid-Term Revision Tool Kit Grade 7
No ratings yet
Mid-Term Revision Tool Kit Grade 7
10 pages
Thesis Title Number 2
No ratings yet
Thesis Title Number 2
6 pages
FS 2 - Episode 1
No ratings yet
FS 2 - Episode 1
8 pages
2 - Buku Panduan Tesis Edisi Ke - 5
No ratings yet
2 - Buku Panduan Tesis Edisi Ke - 5
90 pages
BofA MM Outlook
No ratings yet
BofA MM Outlook
77 pages
Otm847 G 1
No ratings yet
Otm847 G 1
21 pages
Download full (Ebook) Quantitative Psychological Research; The Complete Student's Companion; 5th Edition by David Clark-Carter ISBN 9781003208419, 9781032103976, 1032103973, 100320841X ebook all chapters
100% (10)
Download full (Ebook) Quantitative Psychological Research; The Complete Student's Companion; 5th Edition by David Clark-Carter ISBN 9781003208419, 9781032103976, 1032103973, 100320841X ebook all chapters
55 pages
Heat Transfer: Spring 2021
No ratings yet
Heat Transfer: Spring 2021
15 pages
Homogenous Transformation Matrix
No ratings yet
Homogenous Transformation Matrix
3 pages
379-Article Text-1473-1-10-20220217
No ratings yet
379-Article Text-1473-1-10-20220217
8 pages
"Industrial Robotics Manual: Fundamentals, Uses, and Applications (Spanish Edition) - Miguel D'Addario.pdf"
No ratings yet
"Industrial Robotics Manual: Fundamentals, Uses, and Applications (Spanish Edition) - Miguel D'Addario.pdf"
216 pages
The YES Reimagining The Future of E-Commerce With Artificial Intelligence (AI) Harvard Case Study Solution & Analysis
No ratings yet
The YES Reimagining The Future of E-Commerce With Artificial Intelligence (AI) Harvard Case Study Solution & Analysis
4 pages
Modular Design of Automated Biochemistry Analyzer: Swati Kapoor Vikas Goel
No ratings yet
Modular Design of Automated Biochemistry Analyzer: Swati Kapoor Vikas Goel
5 pages
4pm1 02 Que 20240608
No ratings yet
4pm1 02 Que 20240608
32 pages
Ssic Lecture Notes Modules 1 To 5 Ordered and Edited
No ratings yet
Ssic Lecture Notes Modules 1 To 5 Ordered and Edited
96 pages
Alan F Chalmers The Scientist S Atom and
No ratings yet
Alan F Chalmers The Scientist S Atom and
18 pages
TS311 Week 2 - Sustainable Tourism - Unit 2 S02 - 2020 - Compressed PDF
No ratings yet
TS311 Week 2 - Sustainable Tourism - Unit 2 S02 - 2020 - Compressed PDF
57 pages
Reny Haryani 51-57 PDF
No ratings yet
Reny Haryani 51-57 PDF
7 pages
Hariyani 2021
No ratings yet
Hariyani 2021
8 pages
ASP Pre-Test Questions
100% (1)
ASP Pre-Test Questions
4 pages
Lecture Notes On Subtyping: 15-312: Foundations of Programming Languages Frank Pfenning October 19, 2004
No ratings yet
Lecture Notes On Subtyping: 15-312: Foundations of Programming Languages Frank Pfenning October 19, 2004
7 pages
Reflection Paper
No ratings yet
Reflection Paper
1 page
EDUC 103 - Final Exam
No ratings yet
EDUC 103 - Final Exam
5 pages
Fabm 1 SS 11 Q4 1007
No ratings yet
Fabm 1 SS 11 Q4 1007
7 pages
USP 1117 Microbiological Best Laboratory Practices - Draft
No ratings yet
USP 1117 Microbiological Best Laboratory Practices - Draft
11 pages
Troubleshooting E9000 Error in ITEVA and Qtegra For ICAP 6000-7000 Series
No ratings yet
Troubleshooting E9000 Error in ITEVA and Qtegra For ICAP 6000-7000 Series
4 pages
Amethyst State of Survival (SOS)
No ratings yet
Amethyst State of Survival (SOS)
9 pages
PPT1 Scientific Attitudes
100% (1)
PPT1 Scientific Attitudes
25 pages