7. Algorithm design and problem-solving
A section of Computer Science, 2210
Listing 10 of 38 questions
The one-dimensional (1D) array Clubs is used to store the names of 12 cricket clubs in a local sports league. The two-dimensional (2D) array Statistics is used to store, for each cricket club, the number of: • matches won • matches drawn • matches lost. The 1D array Points is used to store the total number of points each cricket club has been awarded. The position of any cricket club’s data is the same in all three arrays. For example, the data in index 2 of Statistics and index 2 of Points belongs to the cricket club in index 2 of Clubs The variable Matches stores the number of matches played by each team. Each team plays the same number of matches. Points are awarded for: • a win – 12 points • a draw – 5 points • a loss – 0 points. Write a program that meets the following requirements: • allows the number of matches played to be input and stored, with a maximum of 22 matches • validates the number of matches played • allows the names of the cricket clubs to be input and stored • allows the number of matches won, drawn and lost to be input and stored for each team • validates the number of matches won, drawn or lost against the number of matches played • asks the user to re-enter the number of matches won, drawn or lost if the total does not match the number of matches played • calculates and stores the total number of points for each club • finds the cricket club or clubs with the highest number of points • outputs the name or names of the winning club or clubs, the number of wins and the total number of points awarded. 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. All inputs and outputs must contain suitable messages.
2210_s24_qp_21
THEORY
2024
Paper 2, Variant 1
View
A program needs to make sure the characters input for a product code meet these rules: • The product code is six characters in length. • The first two characters must be “PD”. • The last four characters must be a number in the range 1000 to 9999 inclusive. Identify three validation checks and state how each check would make sure the product code met one of these rules. Check 1 Check 2 Check 3 The program design will include a pseudocode algorithm. Assume that the product code is stored in the variable Product Write the pseudocode to make sure that the product code is six characters in length. Write the pseudocode to make sure that the first two characters of the product code are “PD”.
2210_s24_qp_22
THEORY
2024
Paper 2, Variant 2
View
A programmer is writing a data entry program for booking theatre seats. The programmer needs the program to accept only whole numbers that are greater than or equal to one and less than or equal to six. Give the names of two validation checks that are required for this program. Complete this pseudocode to perform your two validation checks, using your answers given in : OUTPUT "Please enter the number of seats you want to book " INPUT Seats Give one item of test data to use when testing this program. State the reason for your choice of test data. Test data Reason for choice
2210_w23_qp_23
THEORY
2023
Paper 2, Variant 3
View
An algorithm has been written in pseudocode to check if a new password is in a list of previously used passwords OldList If the password is not found, the new password will be stored at the end of the list to replace "XXXX" already stored there. 01 OUTPUT "Enter your new password " 02 INPUT NewPassword 03 Posn 04 Found FALSE 05 REPEAT 06 IF Password = OldList 07 THEN 08 Found TRUE 09 ELSE Posn Posn + 1 10 ENDIF 11 UNTIL Found AND OldList = "XXXX" 12 IF Found 13 THEN 14 OUTPUT "Password has been used before" 15 ELSE 16 INPUT "New password accepted" 17 OldList NewPassword 18 ENDIF Identify the three errors in the pseudocode and suggest corrections. Error 1 Correction Error 2 Correction Error 3 Correction Complete this flowchart for the corrected algorithm: START STOP
2210_w23_qp_23
THEORY
2023
Paper 2, Variant 3
View
This is an algorithm to find if a batch of parts has been manufactured successfully. Accept INPUT PartOK IS PartOK = 'Y'? IS Accept = 10 ? IS Reject > 1 ? Accept OUTPUT "Too many rejected ", Error, "% error" OUTPUT "Success" Accept + 1 Reject Reject Reject + 1 Error Reject/Accept * 100 Yes Yes Yes No No No START STOP Complete the trace table using this data: Y, Y, Y, N, Y, Y, Y, Y, N, Y, Y, Y, Y Accept Reject PartOK Error OUTPUT Describe how the algorithm should be changed to accept ‘Y’ or ‘y’ for a successfully manufactured part.
2210_w23_qp_23
THEORY
2023
Paper 2, Variant 3
View
Questions Discovered
38