0478_s24_qp_23
A paper of Computer Science, 0478
Questions:
9
Year:
2024
Paper:
2
Variant:
3
Login to start this paper & get access to powerful tools
4
This pseudocode algorithm is intended to allow data for up to 50 people to be entered and stored in a two-dimensional (2D) array. The data is their last name, first name and the city in which they live. 01 DECLARE People : ARRAY[1:50, 1:3] OF REAL 02 DECLARE Count : INTEGER 03 DECLARE Response : CHAR 04 DECLARE Continue : BOOLEAN 05 FOR I 1 TO 50 06 FOR J 1 TO 3 07 People[I, J] "" 08 NEXT J 09 NEXT I 10 Count 11 Continue TRUE 12 CASE OF 13 OUTPUT "Enter the last name" 14 INPUT People[Count, 1] 15 OUTPUT "Enter the first name" 16 INPUT People[Count, 2] 17 OUTPUT "Enter the city" 18 INPUT People[Count, 3] 19 OUTPUT "Do you want to enter another name (Y or N)?" 20 INPUT Response 21 IF Response = 'N' 22 THEN 23 Continue FALSE 24 ELSE 25 Count Count + 1 26 ENDIF 27 UNTIL NOT Count Identify the line numbers of the four errors in the pseudocode and suggest corrections. Error 1 line number Correction Error 2 line number Correction Error 3 line number Correction Error 4 line number Correction Write the pseudocode that you could add to the end of this algorithm to output the contents of the array. Make sure that the output ends when the data in the array ends. Explain how you could alter the original corrected algorithm to make sure that the number of elements being added to the array does not exceed the maximum size of the array (50 elements).
7. Algorithm design and problem-solving  →  7. Algorithm design and problem-solving
8. Programming  →  8.1. Programming concepts
Open
5
The flowchart represents an algorithm. L 0 S 10000 T 0 A 0 INPUT Limit Count 1 START STOP INPUT Value No Yes IS Value > L ? IS Value Limit ? OUTPUT "L = ", L, " S = ", S, " T = ", T, " A = ", A L Value T T + Value Count Count + 1 Yes S Value Yes A T / Limit No No Complete the trace table for the input data: 10, 30, 18, 8, 25, 12, 17, 2, 50, 15, 5 L S T A Limit Count Value OUTPUT Outline the purpose of the algorithm. Explain why the identifiers L, S, T and A may not be appropriate to use as identifiers and how they could be improved. State a more appropriate identifier for each of the variables L, S, T and A Original identifier Improved identifier L S T A
7. Algorithm design and problem-solving  →  7. Algorithm design and problem-solving
Open
7
The string operation SUBSTRING(FullText, X, Y) returns a string from FullText beginning at position X that is Y characters long. The first character in FullText is in position 1. Write the pseudocode statements to: • store the string “IGCSE Computer Science at Cambridge” in FullText • extract and display the words “Computer Science” from the string and store it in a suitable variable • output the original string in upper case. Write the pseudocode statements to: • store the content of the variable you created in part to a text file named "Subjects.txt" • close the text file at the end of the algorithm.
8. Programming  →  8.1. Programming concepts
7. Algorithm design and problem-solving  →  7. Algorithm design and problem-solving
Open
8
A database table called Hangar1 stores details of a collection of historic aircraft at a museum. ID Make Model Year Engines Airworthy JM1 Hawker Siddeley Nimrod Y JM2 Douglas DC-10 Y JM3 Aérospatiale-BAC Concorde N PB1 De Havilland DH-9 Y PB2 Hawker Fury Y PB3 Hawker Nimrod Y PM1 Fieseler Storch N PM2 Hawker Hurricane Y PM3 Supermarine Spitfire N PM4 Douglas C-47 Dakota N PS1 Boeing 314 Clipper N State the number of fields and records in the database table. Fields Records Give the output that would be produced by the structured query language (SQL) statement: SELECT Model, Year, Engines FROM Hangar1 WHERE Engines > 1 ORDER BY Year; Complete the SQL statement to display only the ID and model of all the aircraft that are airworthy. SELECT ID, ;
9. Databases  →  9. Databases
Open
9
A one-dimensional (1D) array Teams[] contains the names of 10 football teams in a local league. A two-dimensional (2D) array Results[] stores, for each team, the total number of: • games won • games drawn • games lost • points. The position of any team’s data is the same in both arrays. For example the data in index 3 of Results[] belongs to the team in index 3 of Teams[] The array data will be used to find the current leader of the league. The variable Played stores the number of games played by each team. Each team plays the same number of games. Write a program that meets the following requirements: • allows the number of games played to be input and stored, with a maximum of 18 games • allows the names of the teams to be input and stored • allows the number of games won, drawn and lost to be input and stored for each team • validates the number of games played and the number of games won, drawn or lost against the number of games played • calculates and stores the number of points for each team using three points for a win and one point for a draw; there are no points for a loss • sorts the array Results[] into descending order of number of points, ensuring the corresponding parallel array Teams[] is kept in the same order • determines how many teams have the highest number of points • outputs the nameof the winning teamalong with the number of points achieved. 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.
7. Algorithm design and problem-solving  →  7. Algorithm design and problem-solving
8. Programming  →  8.1. Programming concepts
8. Programming  →  8.2. Arrays
Open