Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 41

Complete the trace table using the program in Figure 2.

Figure 2

public static int calculatePrice(int weight, int distance, int expressFee) {
    if (expressFee == 0)
    {
        return weight * distance;
    } else
    {
        return (weight * distance) + expressFee;
    }
}

public static void Main() {
    int numOne, numTwo, numThree, cost;
    Console.Write("Enter weight: ");
    numOne = Convert.ToInt32(Console.ReadLine());
    Console.Write("Enter distance: ");
    numTwo = Convert.ToInt32(Console.ReadLine());
    Console.Write("Enter express fee, 0 for none: ");
    numThree = Convert.ToInt32(Console.ReadLine());

    cost = calculatePrice(numOne, numTwo, numThree);

    if (numThree == 0)
    {
        Console.WriteLine($"Standard: {cost}");
    } else
    {
        Console.WriteLine($"Express: {cost}");
    }
}
numOnenumTwonumThreeFinal output
4150
61025
3812
[3]
Markscheme

Representing algorithms Questions

  1. GCSE
  2. /Computer Science
  3. /Representing algorithms

208 exam-style questions on AQA GCSE Computer Science Representing algorithms. Each one has a worked solution and a mark scheme showing where the marks go.

Question bank