,"$L3f",null,{"backHref":"/gcse/computer-science/aqa/questions","basePath":"/gcse/computer-science/aqa/representing-algorithms/questions","formulaUrl":null,"initialIndex":34,"initialQuestionWindow":[{"id":"1b86118e-5521-456e-87ff-e7c933da7df0","revisionId":"c8070caa-3ffe-48a4-af3d-e6cd1e3b7adc","questionNumber":null,"questionType":"LA","specification":"","difficulty":2,"difficultyBand":"easy","totalMarks":1,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"3d53b1fd-0744-4f8b-93c7-3e86cd3ec50e","label":null,"content":"State why both `BASE_FEE` and `BOOKING_FEE` from the algorithm in **Figure 3** did not need to be included in a trace table.\n\nFigure 3\n```\nconstant BASE_FEE ← 15\nconstant BOOKING_FEE ← 3\nOUTPUT 'Enter money paid'\npayment ← USERINPUT\ntotalCost ← BASE_FEE + BOOKING_FEE\nticketsBought ← 0\nREPEAT\n payment ← payment - totalCost\n ticketsBought ← ticketsBought + 1\nUNTIL payment < totalCost\n```","markscheme":"- States that they are constants (or their values do not change / are static / fixed) OR that trace tables only track variables whose values change during execution B1","marks":1,"order":0,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null},{"id":"1c0b4207-9d26-4584-9534-a102cddf5e5d","revisionId":"1c0c8e67-4e84-403c-85dc-1f2c2301bbd8","questionNumber":null,"questionType":"LA","specification":"","difficulty":4,"difficultyBand":"easy","totalMarks":2,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"0dd72f30-e312-45a3-9254-32984e5d7ef4","label":null,"content":"Complete the trace table for the algorithm shown in **Figure 4** when the initial value of `value` is 20.\n\nFigure 4\n```text\noutcome ← value RIGHTSHIFT 2\noutcome ← (outcome * value) - 13\n```\n\n| `value` | `outcome` |\n| :---: | :---: |\n| 20 | |\n| | |\n| | |","markscheme":"- Evaluates the first line to find the intermediate value of $5$ for `outcome` M1\n- Evaluates the second line to find the final value of $87$ for `outcome` A1","marks":2,"order":0,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null},{"id":"1d9722a0-98ca-4922-bec1-2ad16e922c78","revisionId":"d8d58062-5d33-427d-8aed-c2f457012cb5","questionNumber":null,"questionType":"LA","specification":"An engineer is tasked with designing an algorithmic control system for an automated vertical farming facility that regulates nutrient delivery, LED lighting cycles, and ambient temperature across multiple hydroponic bays.","difficulty":3,"difficultyBand":"easy","totalMarks":2,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"26ebb642-c54f-438e-8542-ab93dfd1ac2a","label":null,"content":"Explain how the concept of *decomposition* is applied when designing an algorithmic solution to this problem.","markscheme":"- Explains that the complex problem (the overall vertical farming system) is broken down into smaller, simpler, or more manageable sub-problems B1\n- Identifies that these individual components (such as separate algorithms for managing temperature, timing lights, or dosing nutrients) can be designed, solved, and tested independently B1","marks":2,"order":0,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null}],"subjectCode":"gcse_computer_science__aqa","summaries":[{"id":"001d94a5-b069-44de-af3b-7403c7525797","difficultyBand":"medium","calculatorUse":null},{"id":"015b51d0-540a-4a9a-8e83-defb2b62fabe","difficultyBand":"medium","calculatorUse":null},{"id":"01873dd8-aa44-4000-98b0-7e831a05d415","difficultyBand":"hard","calculatorUse":null},{"id":"024acd47-07b5-4c9a-b18a-8f14507d82c0","difficultyBand":"medium","calculatorUse":null},{"id":"027f37c9-881b-4c4d-8577-c1444a1a66e0","difficultyBand":"easy","calculatorUse":null},{"id":"02e6dbb4-9db5-469a-9f76-ce1aa7e2362c","difficultyBand":"medium","calculatorUse":null},{"id":"03870603-cadc-429b-a6ee-f8189f64dec2","difficultyBand":"medium","

`value`	`outcome`
20

`value`	`outcome`
20

Representing algorithms

Question 19

Representing algorithms Questions

Representing algorithms

Question 19

Representing algorithms Questions