Free AQA GCSE Computer Science (8525) Exam Questions and Answers

An algorithm, that uses the modulus operator, has been represented using pseudo-code in Figure 1. • Line numbers are included but are not part of the algorithm. Figure 1 1 i ← USERINPUT 2 IF i MOD 2 = 0 THEN 3 OUTPUT i * i 4 ELSE 5 OUTPUT i 6 ENDIF The modulus operator is used to calculate the remainder after dividing one integer by another. For example: • 14 MOD 3 evaluates to 2 • 24 MOD 5 evaluates to 4 Shade one lozenge that shows the line number where selection is first used in the algorithm in Figure 1.

• AA. Line number 1
• BB. Line number 2
• CC. Line number 3
• DD. Line number 4

An algorithm, that uses the modulus operator, has been represented using pseudo-code in Figure 1. • Line numbers are included but are not part of the algorithm. Figure 1 1 i ← USERINPUT 2 IF i MOD 2 = 0 THEN 3 OUTPUT i * i 4 ELSE 5 OUTPUT i 6 ENDIF The modulus operator is used to calculate the remainder after dividing one integer by another. For example: • 14 MOD 3 evaluates to 2 • 24 MOD 5 evaluates to 4 Shade one lozenge that shows the output from the algorithm in Figure 1 when the user input is 4

• AA. 0
• BB. 2
• CC. 4
• DD. 8
• EE. 16

An algorithm, that uses the modulus operator, has been represented using pseudo-code in Figure 1. • Line numbers are included but are not part of the algorithm. Figure 1 1 i ← USERINPUT 2 IF i MOD 2 = 0 THEN 3 OUTPUT i * i 4 ELSE 5 OUTPUT i 6 ENDIF The modulus operator is used to calculate the remainder after dividing one integer by another. For example: • 14 MOD 3 evaluates to 2 • 24 MOD 5 evaluates to 4 Shade one lozenge that shows the line number where assignment is first used in the algorithm in Figure 1.

• AA. Line number 1
• BB. Line number 2
• CC. Line number 3
• DD. Line number 4

An algorithm, that uses the modulus operator, has been represented using pseudo-code in Figure 1. • Line numbers are included but are not part of the algorithm. Figure 1 1 i ← USERINPUT 2 IF i MOD 2 = 0 THEN 3 OUTPUT i * i 4 ELSE 5 OUTPUT i 6 ENDIF The modulus operator is used to calculate the remainder after dividing one integer by another. For example: • 14 MOD 3 evaluates to 2 • 24 MOD 5 evaluates to 4 Shade one lozenge that shows the line number that contains a relational operator in the algorithm in Figure 1.

• AA. Line number 1
• BB. Line number 2
• CC. Line number 3
• DD. Line number 4

An algorithm, that uses the modulus operator, has been represented using pseudo-code in Figure 1. • Line numbers are included but are not part of the algorithm. Figure 1 1 i ← USERINPUT 2 IF i MOD 2 = 0 THEN 3 OUTPUT i * i 4 ELSE 5 OUTPUT i 6 ENDIF The modulus operator is used to calculate the remainder after dividing one integer by another. For example: • 14 MOD 3 evaluates to 2 • 24 MOD 5 evaluates to 4 Shade one lozenge to show which of the following is a true statement about the algorithm in Figure 1.

• AA. This algorithm uses a Boolean operator.
• BB. This algorithm uses a named constant.
• CC. This algorithm uses iteration.
• DD. This algorithm uses the multiplication operator.

An algorithm, that uses the modulus operator, has been represented using pseudo-code in Figure 1. • Line numbers are included but are not part of the algorithm. Figure 1 1 i ← USERINPUT 2 IF i MOD 2 = 0 THEN 3 OUTPUT i * i 4 ELSE 5 OUTPUT i 6 ENDIF The modulus operator is used to calculate the remainder after dividing one integer by another. For example: • 14 MOD 3 evaluates to 2 • 24 MOD 5 evaluates to 4 Figure 2 shows an implementation of the algorithm in Figure 1 using the C# programming language. • Line numbers are included but are not part of the program. Figure 2 1 Console.Write("Enter a number: "); 2 int i = Convert.ToInt32(Console.ReadLine()); 3 if (i % 2 == 0) { 4 Console.WriteLine(i * i); 5 } 6 else { 7 Console.WriteLine(i); 8 } The program in Figure 2 needs to be changed so that it repeats five times using definite (count controlled) iteration. Shade one lozenge next to the program that does this correctly.

• AA. for (int x = 0; x < 5; x++) { Console.Write("Enter a number: "); int i = Convert.ToInt32(Console.ReadLine()); if (i % 2 == 0) { Console.WriteLine(i * i); } else { Console.WriteLine(i); } }
• BB. for (int x = 0; x < 6; x++) { Console.Write("Enter a number: "); int i = Convert.ToInt32(Console.ReadLine()); if (i % 2 == 0) { Console.WriteLine(i * i); } else { Console.WriteLine(i); } }
• CC. int x = 1; while (x != 6) { Console.Write("Enter a number: "); int i = Convert.ToInt32(Console.ReadLine()); if (i % 2 == 0) { Console.WriteLine(i * i); } else { Console.WriteLine(i); } x = x + 1; }
• DD. int x = 6; while (x != 0) { Console.Write("Enter a number: "); int i = Convert.ToInt32(Console.ReadLine()); if (i % 2 == 0) { Console.WriteLine(i * i); } else { Console.WriteLine(i); } x = x - 1; }

Figure 3 shows an algorithm, represented using pseudo-code, that calculates the delivery cost for an order from a takeaway company. Figure 3 orderTotal ← USERINPUT deliveryDistance ← USERINPUT deliveryCost ← 0.0 messageOne ← "Minimum spend not met" messageTwo ← "Delivery not possible" IF deliveryDistance ≤ 5 AND orderTotal > 0.0 THEN IF orderTotal > 50.0 THEN deliveryCost ← 1.5 OUTPUT deliveryCost ELSE IF orderTotal > 25.0 THEN deliveryCost ← (orderTotal / 10) * 2 OUTPUT deliveryCost ELSE OUTPUT messageOne ENDIF ELSE OUTPUT messageTwo ENDIF Using Figure 3, complete the table.

Type your answer, then reveal.

Figure 3 shows an algorithm, represented using pseudo-code, that calculates the delivery cost for an order from a takeaway company. Figure 3 orderTotal ← USERINPUT deliveryDistance ← USERINPUT deliveryCost ← 0.0 messageOne ← "Minimum spend not met" messageTwo ← "Delivery not possible" IF deliveryDistance ≤ 5 AND orderTotal > 0.0 THEN IF orderTotal > 50.0 THEN deliveryCost ← 1.5 OUTPUT deliveryCost ELSE IF orderTotal > 25.0 THEN deliveryCost ← (orderTotal / 10) * 2 OUTPUT deliveryCost ELSE OUTPUT messageOne ENDIF ELSE OUTPUT messageTwo ENDIF State how many possible values the result of the comparison deliveryDistance ≤ 5 could have in the algorithm shown in Figure 3.

Type your answer, then reveal.

Figure 3 shows an algorithm, represented using pseudo-code, that calculates the delivery cost for an order from a takeaway company. Figure 3 orderTotal ← USERINPUT deliveryDistance ← USERINPUT deliveryCost ← 0.0 messageOne ← "Minimum spend not met" messageTwo ← "Delivery not possible" IF deliveryDistance ≤ 5 AND orderTotal > 0.0 THEN IF orderTotal > 50.0 THEN deliveryCost ← 1.5 OUTPUT deliveryCost ELSE IF orderTotal > 25.0 THEN deliveryCost ← (orderTotal / 10) * 2 OUTPUT deliveryCost ELSE OUTPUT messageOne ENDIF ELSE OUTPUT messageTwo ENDIF State the most suitable data type for the following variables used in Figure 3.

Type your answer, then reveal.

Figure 3 shows an algorithm, represented using pseudo-code, that calculates the delivery cost for an order from a takeaway company. Figure 3 orderTotal ← USERINPUT deliveryDistance ← USERINPUT deliveryCost ← 0.0 messageOne ← "Minimum spend not met" messageTwo ← "Delivery not possible" IF deliveryDistance ≤ 5 AND orderTotal > 0.0 THEN IF orderTotal > 50.0 THEN deliveryCost ← 1.5 OUTPUT deliveryCost ELSE IF orderTotal > 25.0 THEN deliveryCost ← (orderTotal / 10) * 2 OUTPUT deliveryCost ELSE OUTPUT messageOne ENDIF ELSE OUTPUT messageTwo ENDIF State one other common data type that you have not given in your answer to Question 02.3.

Type your answer, then reveal.