33:I[196793,["/_next/static/chunks/1xyh1u_ku6jw-.js?dpl=nogit-1791882788","/_next/static/chunks/2_6olli-sutu3.js?dpl=nogit-1791882788","/_next/static/chunks/1qp4g--o6-1vf.js?dpl=nogit-1791882788","/_next/static/chunks/0psy-n5us57a4.js?dpl=nogit-1791882788","/_next/static/chunks/3mz725-y91ph6.js?dpl=nogit-1791882788","/_next/static/chunks/2x_dbpl3b_l2r.js?dpl=nogit-1791882788","/_next/static/chunks/0nojijad0occ8.js?dpl=nogit-1791882788","/_next/static/chunks/19ua1o9n5v3ho.js?dpl=nogit-1791882788","/_next/static/chunks/0zkcxwtbsqliz.js?dpl=nogit-1791882788","/_next/static/chunks/3yfg2hrj9oxbd.js?dpl=nogit-1791882788","/_next/static/chunks/35s1d7gs3nyqk.js?dpl=nogit-1791882788","/_next/static/chunks/38w1x0vrld4-w.js?dpl=nogit-1791882788","/_next/static/chunks/3jpl-42mbad5n.js?dpl=nogit-1791882788","/_next/static/chunks/3kzt2piec6aoa.js?dpl=nogit-1791882788","/_next/static/chunks/2lsi6eli88uwt.js?dpl=nogit-1791882788","/_next/static/chunks/2os7nxouq91eq.js?dpl=nogit-1791882788","/_next/static/chunks/3ml3vooxhiupb.js?dpl=nogit-1791882788","/_next/static/chunks/04zr-wqafvwoa.js?dpl=nogit-1791882788","/_next/static/chunks/36r9y5g_s4k64.js?dpl=nogit-1791882788","/_next/static/chunks/40lyu17d590zu.js?dpl=nogit-1791882788","/_next/static/chunks/2g-t2n9ahs3tn.js?dpl=nogit-1791882788","/_next/static/chunks/2mv9l1xl_aa4j.js?dpl=nogit-1791882788","/_next/static/chunks/44w2c3xxfw4wd.js?dpl=nogit-1791882788","/_next/static/chunks/16jtsbm2g52s0.js?dpl=nogit-1791882788","/_next/static/chunks/05mo4k9k-ry1n.js?dpl=nogit-1791882788","/_next/static/chunks/0v4byuex1x38h.js?dpl=nogit-1791882788","/_next/static/chunks/2eanemqjnv2vr.js?dpl=nogit-1791882788","/_next/static/chunks/2f3ohq_f1uov2.js?dpl=nogit-1791882788","/_next/static/chunks/0llqhg6-bxn_b.js?dpl=nogit-1791882788","/_next/static/chunks/2dx-vzwyw9a3g.js?dpl=nogit-1791882788","/_next/static/chunks/0qeo40bqomvxa.js?dpl=nogit-1791882788","/_next/static/chunks/1ku-vdy4ggo41.js?dpl=nogit-1791882788","/_next/static/chunks/1coblm1-go81_.js?dpl=nogit-1791882788","/_next/static/chunks/27ftpb6yvr6lz.js?dpl=nogit-1791882788","/_next/static/chunks/0k-y_4mcfub-p.js?dpl=nogit-1791882788","/_next/static/chunks/1o4x0l2qh0ta-.js?dpl=nogit-1791882788","/_next/static/chunks/3it1o0ex-l5qz.js?dpl=nogit-1791882788","/_next/static/chunks/2gqripb6ybmw9.js?dpl=nogit-1791882788","/_next/static/chunks/2l63yczi1z2qz.js?dpl=nogit-1791882788","/_next/static/chunks/075i0tnxt4not.js?dpl=nogit-1791882788","/_next/static/chunks/1eyu-5752jh17.js?dpl=nogit-1791882788","/_next/static/chunks/1of_-ow2iz1cj.js?dpl=nogit-1791882788","/_next/static/chunks/3ybwgs28on6c8.js?dpl=nogit-1791882788","/_next/static/chunks/13gj59kzq50t_.js?dpl=nogit-1791882788","/_next/static/chunks/1986062z5zb0v.js?dpl=nogit-1791882788","/_next/static/chunks/0uitbylhcd4am.js?dpl=nogit-1791882788","/_next/static/chunks/0wv8cpdr6cvhr.js?dpl=nogit-1791882788","/_next/static/chunks/06b61oz__qen3.js?dpl=nogit-1791882788","/_next/static/chunks/0a4x2f2g83l7b.js?dpl=nogit-1791882788","/_next/static/chunks/1lsxkfxy262n-.js?dpl=nogit-1791882788","/_next/static/chunks/3q5gc8lbwr4b4.js?dpl=nogit-1791882788","/_next/static/chunks/0dspbdeiizrn3.js?dpl=nogit-1791882788","/_next/static/chunks/2yss1g0cimuwe.js?dpl=nogit-1791882788","/_next/static/chunks/0e7v08pdxbxe2.js?dpl=nogit-1791882788","/_next/static/chunks/36nndwkz7iik3.js?dpl=nogit-1791882788","/_next/static/chunks/0zg1om_k0m5zv.js?dpl=nogit-1791882788","/_next/static/chunks/2fnth9-t6i7kd.js?dpl=nogit-1791882788","/_next/static/chunks/24srd-xd1m5z8.js?dpl=nogit-1791882788","/_next/static/chunks/0a57o9qvnv-nb.js?dpl=nogit-1791882788","/_next/static/chunks/41hx021qkamew.js?dpl=nogit-1791882788","/_next/static/chunks/1ksyn9m68446d.js?dpl=nogit-1791882788"],"Gingerbread"] 35:I[647935,["/_next/static/chunks/1xyh1u_ku6jw-.js?dpl=nogit-1791882788","/_next/static/chunks/2_6olli-sutu3.js?dpl=nogit-1791882788","/_next/static/chunks/1qp4g--o6-1vf.js?dpl=nogit-1791882788","/_next/static/chunks/0psy-n5us57a4.js?dpl=nogit-1791882788","/_next/static/chunks/3mz725-y91ph6.js?dpl=nogit-1791882788","/_next/static/chunks/2x_dbpl3b_l2r.js?dpl=nogit-1791882788","/_next/static/chunks/0nojijad0occ8.js?dpl=nogit-1791882788","/_next/static/chunks/19ua1o9n5v3ho.js?dpl=nogit-1791882788","/_next/static/chunks/0zkcxwtbsqliz.js?dpl=nogit-1791882788","/_next/static/chunks/3yfg2hrj9oxbd.js?dpl=nogit-1791882788","/_next/static/chunks/35s1d7gs3nyqk.js?dpl=nogit-1791882788","/_next/static/chunks/38w1x0vrld4-w.js?dpl=nogit-1791882788","/_next/static/chunks/3jpl-42mbad5n.js?dpl=nogit-1791882788","/_next/static/chunks/3kzt2piec6aoa.js?dpl=nogit-1791882788","/_next/static/chunks/2lsi6eli88uwt.js?dpl=nogit-1791882788","/_next/static/chunks/2os7nxouq91eq.js?dpl=nogit-1791882788","/_next/static/chunks/3ml3vooxhiupb.js?dpl=nogit-1791882788","/_next/static/chunks/04zr-wqafvwoa.js?dpl=nogit-1791882788","/_next/static/chunks/36r9y5g_s4k64.js?dpl=nogit-1791882788","/_next/static/chunks/40lyu17d590zu.js?dpl=nogit-1791882788","/_next/static/chunks/2g-t2n9ahs3tn.js?dpl=nogit-1791882788","/_next/static/chunks/2mv9l1xl_aa4j.js?dpl=nogit-1791882788","/_next/static/chunks/44w2c3xxfw4wd.js?dpl=nogit-1791882788","/_next/static/chunks/16jtsbm2g52s0.js?dpl=nogit-1791882788","/_next/static/chunks/05mo4k9k-ry1n.js?dpl=nogit-1791882788","/_next/static/chunks/0v4byuex1x38h.js?dpl=nogit-1791882788","/_next/static/chunks/2eanemqjnv2vr.js?dpl=nogit-1791882788","/_next/static/chunks/2f3ohq_f1uov2.js?dpl=nogit-1791882788","/_next/static/chunks/0llqhg6-bxn_b.js?dpl=nogit-1791882788","/_next/static/chunks/2dx-vzwyw9a3g.js?dpl=nogit-1791882788","/_next/static/chunks/0qeo40bqomvxa.js?dpl=nogit-1791882788","/_next/static/chunks/1ku-vdy4ggo41.js?dpl=nogit-1791882788","/_next/static/chunks/1coblm1-go81_.js?dpl=nogit-1791882788","/_next/static/chunks/27ftpb6yvr6lz.js?dpl=nogit-1791882788","/_next/static/chunks/0k-y_4mcfub-p.js?dpl=nogit-1791882788","/_next/static/chunks/1o4x0l2qh0ta-.js?dpl=nogit-1791882788","/_next/static/chunks/3it1o0ex-l5qz.js?dpl=nogit-1791882788","/_next/static/chunks/2gqripb6ybmw9.js?dpl=nogit-1791882788","/_next/static/chunks/2l63yczi1z2qz.js?dpl=nogit-1791882788","/_next/static/chunks/075i0tnxt4not.js?dpl=nogit-1791882788","/_next/static/chunks/1eyu-5752jh17.js?dpl=nogit-1791882788","/_next/static/chunks/1of_-ow2iz1cj.js?dpl=nogit-1791882788","/_next/static/chunks/3ybwgs28on6c8.js?dpl=nogit-1791882788","/_next/static/chunks/13gj59kzq50t_.js?dpl=nogit-1791882788","/_next/static/chunks/1986062z5zb0v.js?dpl=nogit-1791882788","/_next/static/chunks/0uitbylhcd4am.js?dpl=nogit-1791882788","/_next/static/chunks/0wv8cpdr6cvhr.js?dpl=nogit-1791882788","/_next/static/chunks/06b61oz__qen3.js?dpl=nogit-1791882788","/_next/static/chunks/0a4x2f2g83l7b.js?dpl=nogit-1791882788","/_next/static/chunks/1lsxkfxy262n-.js?dpl=nogit-1791882788","/_next/static/chunks/3q5gc8lbwr4b4.js?dpl=nogit-1791882788","/_next/static/chunks/0dspbdeiizrn3.js?dpl=nogit-1791882788","/_next/static/chunks/2yss1g0cimuwe.js?dpl=nogit-1791882788","/_next/static/chunks/0e7v08pdxbxe2.js?dpl=nogit-1791882788","/_next/static/chunks/36nndwkz7iik3.js?dpl=nogit-1791882788","/_next/static/chunks/0zg1om_k0m5zv.js?dpl=nogit-1791882788","/_next/static/chunks/2fnth9-t6i7kd.js?dpl=nogit-1791882788","/_next/static/chunks/24srd-xd1m5z8.js?dpl=nogit-1791882788","/_next/static/chunks/0a57o9qvnv-nb.js?dpl=nogit-1791882788","/_next/static/chunks/41hx021qkamew.js?dpl=nogit-1791882788","/_next/static/chunks/1ksyn9m68446d.js?dpl=nogit-1791882788"],"RecordResourceResume"] 36:I[830476,["/_next/static/chunks/1xyh1u_ku6jw-.js?dpl=nogit-1791882788","/_next/static/chunks/2_6olli-sutu3.js?dpl=nogit-1791882788","/_next/static/chunks/1qp4g--o6-1vf.js?dpl=nogit-1791882788","/_next/static/chunks/0psy-n5us57a4.js?dpl=nogit-1791882788","/_next/static/chunks/3mz725-y91ph6.js?dpl=nogit-1791882788","/_next/static/chunks/2x_dbpl3b_l2r.js?dpl=nogit-1791882788","/_next/static/chunks/0nojijad0occ8.js?dpl=nogit-1791882788","/_next/static/chunks/19ua1o9n5v3ho.js?dpl=nogit-1791882788","/_next/static/chunks/0zkcxwtbsqliz.js?dpl=nogit-1791882788","/_next/static/chunks/3yfg2hrj9oxbd.js?dpl=nogit-1791882788","/_next/static/chunks/35s1d7gs3nyqk.js?dpl=nogit-1791882788","/_next/static/chunks/38w1x0vrld4-w.js?dpl=nogit-1791882788","/_next/static/chunks/3jpl-42mbad5n.js?dpl=nogit-1791882788","/_next/static/chunks/3kzt2piec6aoa.js?dpl=nogit-1791882788","/_next/static/chunks/2lsi6eli88uwt.js?dpl=nogit-1791882788","/_next/static/chunks/2os7nxouq91eq.js?dpl=nogit-1791882788","/_next/static/chunks/3ml3vooxhiupb.js?dpl=nogit-1791882788","/_next/static/chunks/04zr-wqafvwoa.js?dpl=nogit-1791882788","/_next/static/chunks/36r9y5g_s4k64.js?dpl=nogit-1791882788","/_next/static/chunks/40lyu17d590zu.js?dpl=nogit-1791882788","/_next/static/chunks/2g-t2n9ahs3tn.js?dpl=nogit-1791882788","/_next/static/chunks/2mv9l1xl_aa4j.js?dpl=nogit-1791882788","/_next/static/chunks/44w2c3xxfw4wd.js?dpl=nogit-1791882788","/_next/static/chunks/16jtsbm2g52s0.js?dpl=nogit-1791882788","/_next/static/chunks/05mo4k9k-ry1n.js?dpl=nogit-1791882788","/_next/static/chunks/0v4byuex1x38h.js?dpl=nogit-1791882788","/_next/static/chunks/2eanemqjnv2vr.js?dpl=nogit-1791882788","/_next/static/chunks/2f3ohq_f1uov2.js?dpl=nogit-1791882788","/_next/static/chunks/0llqhg6-bxn_b.js?dpl=nogit-1791882788","/_next/static/chunks/2dx-vzwyw9a3g.js?dpl=nogit-1791882788","/_next/static/chunks/0qeo40bqomvxa.js?dpl=nogit-1791882788","/_next/static/chunks/1ku-vdy4ggo41.js?dpl=nogit-1791882788","/_next/static/chunks/1coblm1-go81_.js?dpl=nogit-1791882788","/_next/static/chunks/27ftpb6yvr6lz.js?dpl=nogit-1791882788","/_next/static/chunks/0k-y_4mcfub-p.js?dpl=nogit-1791882788","/_next/static/chunks/1o4x0l2qh0ta-.js?dpl=nogit-1791882788","/_next/static/chunks/3it1o0ex-l5qz.js?dpl=nogit-1791882788","/_next/static/chunks/2gqripb6ybmw9.js?dpl=nogit-1791882788","/_next/static/chunks/2l63yczi1z2qz.js?dpl=nogit-1791882788","/_next/static/chunks/075i0tnxt4not.js?dpl=nogit-1791882788","/_next/static/chunks/1eyu-5752jh17.js?dpl=nogit-1791882788","/_next/static/chunks/1of_-ow2iz1cj.js?dpl=nogit-1791882788","/_next/static/chunks/3ybwgs28on6c8.js?dpl=nogit-1791882788","/_next/static/chunks/13gj59kzq50t_.js?dpl=nogit-1791882788","/_next/static/chunks/1986062z5zb0v.js?dpl=nogit-1791882788","/_next/static/chunks/0uitbylhcd4am.js?dpl=nogit-1791882788","/_next/static/chunks/0wv8cpdr6cvhr.js?dpl=nogit-1791882788","/_next/static/chunks/06b61oz__qen3.js?dpl=nogit-1791882788","/_next/static/chunks/0a4x2f2g83l7b.js?dpl=nogit-1791882788","/_next/static/chunks/1lsxkfxy262n-.js?dpl=nogit-1791882788","/_next/static/chunks/3q5gc8lbwr4b4.js?dpl=nogit-1791882788","/_next/static/chunks/0dspbdeiizrn3.js?dpl=nogit-1791882788","/_next/static/chunks/2yss1g0cimuwe.js?dpl=nogit-1791882788","/_next/static/chunks/0e7v08pdxbxe2.js?dpl=nogit-1791882788","/_next/static/chunks/36nndwkz7iik3.js?dpl=nogit-1791882788","/_next/static/chunks/0zg1om_k0m5zv.js?dpl=nogit-1791882788","/_next/static/chunks/2fnth9-t6i7kd.js?dpl=nogit-1791882788","/_next/static/chunks/24srd-xd1m5z8.js?dpl=nogit-1791882788","/_next/static/chunks/0a57o9qvnv-nb.js?dpl=nogit-1791882788","/_next/static/chunks/41hx021qkamew.js?dpl=nogit-1791882788","/_next/static/chunks/1ksyn9m68446d.js?dpl=nogit-1791882788"],"FlashcardAccessBranch"] 37:I[315438,["/_next/static/chunks/1xyh1u_ku6jw-.js?dpl=nogit-1791882788","/_next/static/chunks/2_6olli-sutu3.js?dpl=nogit-1791882788","/_next/static/chunks/1qp4g--o6-1vf.js?dpl=nogit-1791882788","/_next/static/chunks/0psy-n5us57a4.js?dpl=nogit-1791882788","/_next/static/chunks/3mz725-y91ph6.js?dpl=nogit-1791882788","/_next/static/chunks/2x_dbpl3b_l2r.js?dpl=nogit-1791882788","/_next/static/chunks/0nojijad0occ8.js?dpl=nogit-1791882788","/_next/static/chunks/19ua1o9n5v3ho.js?dpl=nogit-1791882788","/_next/static/chunks/0zkcxwtbsqliz.js?dpl=nogit-1791882788","/_next/static/chunks/3yfg2hrj9oxbd.js?dpl=nogit-1791882788","/_next/static/chunks/35s1d7gs3nyqk.js?dpl=nogit-1791882788","/_next/static/chunks/38w1x0vrld4-w.js?dpl=nogit-1791882788","/_next/static/chunks/3jpl-42mbad5n.js?dpl=nogit-1791882788","/_next/static/chunks/3kzt2piec6aoa.js?dpl=nogit-1791882788","/_next/static/chunks/2lsi6eli88uwt.js?dpl=nogit-1791882788","/_next/static/chunks/2os7nxouq91eq.js?dpl=nogit-1791882788","/_next/static/chunks/3ml3vooxhiupb.js?dpl=nogit-1791882788","/_next/static/chunks/04zr-wqafvwoa.js?dpl=nogit-1791882788","/_next/static/chunks/36r9y5g_s4k64.js?dpl=nogit-1791882788","/_next/static/chunks/40lyu17d590zu.js?dpl=nogit-1791882788","/_next/static/chunks/2g-t2n9ahs3tn.js?dpl=nogit-1791882788","/_next/static/chunks/2mv9l1xl_aa4j.js?dpl=nogit-1791882788","/_next/static/chunks/44w2c3xxfw4wd.js?dpl=nogit-1791882788","/_next/static/chunks/16jtsbm2g52s0.js?dpl=nogit-1791882788","/_next/static/chunks/05mo4k9k-ry1n.js?dpl=nogit-1791882788","/_next/static/chunks/0v4byuex1x38h.js?dpl=nogit-1791882788","/_next/static/chunks/2eanemqjnv2vr.js?dpl=nogit-1791882788","/_next/static/chunks/2f3ohq_f1uov2.js?dpl=nogit-1791882788","/_next/static/chunks/0llqhg6-bxn_b.js?dpl=nogit-1791882788","/_next/static/chunks/2dx-vzwyw9a3g.js?dpl=nogit-1791882788","/_next/static/chunks/0qeo40bqomvxa.js?dpl=nogit-1791882788","/_next/static/chunks/1ku-vdy4ggo41.js?dpl=nogit-1791882788","/_next/static/chunks/1coblm1-go81_.js?dpl=nogit-1791882788","/_next/static/chunks/27ftpb6yvr6lz.js?dpl=nogit-1791882788","/_next/static/chunks/0k-y_4mcfub-p.js?dpl=nogit-1791882788","/_next/static/chunks/1o4x0l2qh0ta-.js?dpl=nogit-1791882788","/_next/static/chunks/3it1o0ex-l5qz.js?dpl=nogit-1791882788","/_next/static/chunks/2gqripb6ybmw9.js?dpl=nogit-1791882788","/_next/static/chunks/2l63yczi1z2qz.js?dpl=nogit-1791882788","/_next/static/chunks/075i0tnxt4not.js?dpl=nogit-1791882788","/_next/static/chunks/1eyu-5752jh17.js?dpl=nogit-1791882788","/_next/static/chunks/1of_-ow2iz1cj.js?dpl=nogit-1791882788","/_next/static/chunks/3ybwgs28on6c8.js?dpl=nogit-1791882788","/_next/static/chunks/13gj59kzq50t_.js?dpl=nogit-1791882788","/_next/static/chunks/1986062z5zb0v.js?dpl=nogit-1791882788","/_next/static/chunks/0uitbylhcd4am.js?dpl=nogit-1791882788","/_next/static/chunks/0wv8cpdr6cvhr.js?dpl=nogit-1791882788","/_next/static/chunks/06b61oz__qen3.js?dpl=nogit-1791882788","/_next/static/chunks/0a4x2f2g83l7b.js?dpl=nogit-1791882788","/_next/static/chunks/1lsxkfxy262n-.js?dpl=nogit-1791882788","/_next/static/chunks/3q5gc8lbwr4b4.js?dpl=nogit-1791882788","/_next/static/chunks/0dspbdeiizrn3.js?dpl=nogit-1791882788","/_next/static/chunks/2yss1g0cimuwe.js?dpl=nogit-1791882788","/_next/static/chunks/0e7v08pdxbxe2.js?dpl=nogit-1791882788","/_next/static/chunks/36nndwkz7iik3.js?dpl=nogit-1791882788","/_next/static/chunks/0zg1om_k0m5zv.js?dpl=nogit-1791882788","/_next/static/chunks/2fnth9-t6i7kd.js?dpl=nogit-1791882788","/_next/static/chunks/24srd-xd1m5z8.js?dpl=nogit-1791882788","/_next/static/chunks/0a57o9qvnv-nb.js?dpl=nogit-1791882788","/_next/static/chunks/41hx021qkamew.js?dpl=nogit-1791882788","/_next/static/chunks/1ksyn9m68446d.js?dpl=nogit-1791882788"],"TopicFlashcardRunner"] 24:[["$","$L33",null,{"feature":"flashcards"}],"$L34",["$","$L35",null,{"href":"/gcse/computer-science/aqa/representing-algorithms/flashcards","label":"Representing algorithms","subjectCode":"gcse_computer_science__aqa","surface":"flashcards"}],["$","$L36",null,{"runner":["$","div",null,{"className":"min-h-0 flex-1 overflow-hidden bg-background","children":["$","$L37",null,{"decks":[{"id":"4609b8f5-5617-4e7d-9bc5-453914ea8f34","title":"Representing algorithms Flashcards","topicId":"2a39aecd-4b86-53a5-8d74-074389c4b3b0","topicSlug":"representing-algorithms","cards":[{"id":"90f279fd-6433-40f3-81f3-975be0633788","cardType":"cloze","points":null,"front":"An [ ] is a sequence of steps that can be followed to complete a task.","back":"An algorithm is a sequence of steps that can be followed to complete a task.","mcqOptions":[{"text":"algorithm","correct":true,"explanation":"An algorithm is a precise sequence of steps designed to solve a problem or complete a task, independently of any particular programming language."},{"text":"program","correct":false,"explanation":"A program is working code that implements an algorithm. The correct term is algorithm because the definition refers to the sequence of steps itself."},{"text":"variable","correct":false,"explanation":"A variable is a named storage location for data within a program. The correct term is algorithm because it describes an ordered sequence of steps."},{"text":"condition","correct":false,"explanation":"A condition is a true or false test used to control selection or iteration. An ordered set of steps for completing a task is an algorithm."}]},{"id":"efebddbf-6015-4b9f-9351-1b25bc904dd1","cardType":"basic","points":3,"front":"Why is an algorithm not the same as a program?","back":"

Algorithm: plan.
Program: working code implementation.

","mcqOptions":[{"text":"

Algorithm: plan.
Program: working code implementation.

","correct":true,"explanation":"An algorithm is a language-independent plan of steps, whereas a program is the working code produced by implementing that plan in a programming language."},{"text":"

Algorithm: working code implementation.
Program: plan.

","correct":false,"explanation":"This reverses the two definitions. An algorithm is the plan, while a program is the working code implementation of that plan."},{"text":"

Algorithm: working code implementation.
Program: working code implementation.

","correct":false,"explanation":"This incorrectly treats both terms as executable code. An algorithm is a plan of steps, while only the program is the working code implementation."},{"text":"

Algorithm: plan.
Program: plan.

","correct":false,"explanation":"This overlooks the implementation stage. Although an algorithm is a plan, a program is working code that carries out the algorithm."}]},{"id":"6fd2287a-469e-4f9b-b13c-dd5762885ab7","cardType":"cloze","points":null,"front":"A computer program is an [ ] of an algorithm, written in a [ ].","back":"A computer program is an implementation of an algorithm, written in a real programming language.","mcqOptions":[{"text":"A computer program is an implementation of an algorithm, written in a real programming language.","correct":true,"explanation":"A program implements the steps of an algorithm as executable code and must be written using the defined syntax of a real programming language."},{"text":"A computer program is an design of an algorithm, written in a real programming language.","correct":false,"explanation":"A design is still part of planning rather than the finished code. A computer program is an implementation of an algorithm written in a real programming language."},{"text":"A computer program is an implementation of an algorithm, written in a pseudocode notation.","correct":false,"explanation":"Pseudocode represents an algorithm but is not directly executable. A computer program is the implementation written in a real programming language."},{"text":"A computer program is an description of an algorithm, written in a flowchart notation.","correct":false,"explanation":"Flowcharts describe algorithms rather than create executable programs. A computer program is an implementation of an algorithm written in a real programming language."}]},{"id":"7c41bcea-1eae-4233-9cbb-a91134d7ee2b","cardType":"basic","points":1,"front":"If instructions happen one after another in order, which algorithm building block is used?","back":"Sequence.","mcqOptions":[{"text":"Sequence.","correct":true,"explanation":"Sequence is the algorithm building block in which instructions are carried out one after another in a specified order."},{"text":"Selection.","correct":false,"explanation":"Selection chooses between alternative paths according to a condition. Instructions performed one after another in order use sequence."},{"text":"Iteration.","correct":false,"explanation":"Iteration repeats a section of instructions, usually using a loop. Instructions that simply run one after another use sequence."},{"text":"Decomposition.","correct":false,"explanation":"Decomposition breaks a complex problem into smaller sub-problems. The building block for executing instructions one after another is sequence."}]},{"id":"0c317220-af39-4293-9008-5e634233a15f","cardType":"cloze","points":null,"front":"A [ ] is the true/false test used in selection.","back":"A condition is the true/false test used in selection.","mcqOptions":[{"text":"condition","correct":true,"explanation":"A condition is an expression evaluated as true or false, allowing a selection statement to decide which branch of instructions to execute."},{"text":"variable","correct":false,"explanation":"A variable stores a value and may be used within a test, but the true or false test itself is called a condition."},{"text":"operator","correct":false,"explanation":"An operator performs an operation or comparison and may form part of a test. The complete true or false test is called a condition."},{"text":"branch","correct":false,"explanation":"A branch is one of the alternative paths that selection can follow. The true or false test used to choose the branch is the condition."}]},{"id":"0d3423e6-81e2-488d-81dd-364ff625cb2b","cardType":"basic","points":1,"front":"In an IF...ELSE selection, what decides which branch runs?","back":"Whether the condition is true or false.","mcqOptions":[{"text":"Whether the condition is true or false.","correct":true,"explanation":"An IF...ELSE statement evaluates its condition. The IF branch runs when the condition is true, while the ELSE branch runs when it is false."},{"text":"Whether the variable is text or numeric.","correct":false,"explanation":"A variable’s data type does not automatically choose an IF...ELSE branch. The branch is selected according to whether the condition evaluates as true or false."},{"text":"Whether the loop is fixed or conditional.","correct":false,"explanation":"Loop type controls how repetition ends, not which IF...ELSE branch runs. Selection evaluates a condition and follows the true or false branch."},{"text":"Whether the program has errors or not.","correct":false,"explanation":"Program errors may prevent correct execution but are not the selection test. An IF...ELSE branch is chosen by evaluating its condition as true or false."}]},{"id":"e2ed512d-7d58-4eb9-824a-accf3eb675ce","cardType":"cloze","points":null,"front":"[ ] means repetition; a repeated section is a [ ].","back":"Iteration means repetition; a repeated section is a loop.","mcqOptions":[{"text":"Iteration means repetition; a repeated section is a loop.","correct":true,"explanation":"Iteration is the repeated execution of instructions, and the group of instructions that is repeatedly executed is called a loop."},{"text":"Selection means repetition; a repeated section is a loop.","correct":false,"explanation":"Selection chooses between alternative branches rather than repeating instructions. Repetition is iteration, and the section repeatedly executed is called a loop."},{"text":"Iteration means repetition; a repeated section is a branch.","correct":false,"explanation":"A branch is an alternative path used in selection, not a repeated section. Iteration means repetition, and its repeated section is a loop."},{"text":"Sequence means repetition; a repeated section is a condition.","correct":false,"explanation":"Sequence means executing instructions in order, while a condition is a true or false test. Iteration means repetition, and a repeated section is a loop."}]},{"id":"0233ca71-5d4e-4ff8-8ec6-2e959732a3cb","cardType":"basic","points":1,"front":"How many times will FOR count ← 1 TO 5 run its instructions?","back":"5 times.","mcqOptions":[{"text":"5 times.","correct":true,"explanation":"The loop includes both endpoints, so count takes the values 1, 2, 3, 4 and 5. This produces five executions."},{"text":"4 times.","correct":false,"explanation":"This off-by-one result incorrectly excludes one endpoint. A FOR loop from 1 TO 5 includes both 1 and 5, so it runs five times."},{"text":"6 times.","correct":false,"explanation":"This treats the upper bound as five additional steps after the initial value. The inclusive values 1 through 5 give exactly five executions."},{"text":"1 time.","correct":false,"explanation":"This mistakes the loop statement for a single execution. Count takes every integer value from 1 through 5, so the instructions run five times."}]},{"id":"99e0b2d2-6984-4179-a675-4f26c9328b9a","cardType":"basic","points":1,"front":"What does decomposition do to a large problem?","back":"Breaks it into smaller sub-problems.","mcqOptions":[{"text":"Breaks it into smaller sub-problems.","correct":true,"explanation":"Decomposition makes a complex problem easier to understand and solve by dividing it into smaller, manageable sub-problems that can be tackled separately."},{"text":"Combines smaller sub-problems into one large problem.","correct":false,"explanation":"This reverses decomposition: combining parts creates a larger problem. The correct idea is to break the original problem into smaller sub-problems."},{"text":"Removes all inputs from the problem.","correct":false,"explanation":"Decomposition does not remove information or inputs; it structures the task. The correct answer is to divide the large problem into smaller sub-problems."},{"text":"Changes the problem into a flowchart.","correct":false,"explanation":"A flowchart is one way to represent an algorithm, not the result of decomposition. Decomposition instead breaks a large problem into smaller sub-problems."}]},{"id":"4f5c9110-2fa4-4830-85b5-1e1e0aeac4df","cardType":"basic","points":2,"front":"Why must a decomposed calculation algorithm collect inputs before calculating?","back":"The calculation needs the input values first.","mcqOptions":[{"text":"The calculation needs the input values first.","correct":true,"explanation":"A calculation cannot use values that have not been collected. The algorithm must receive the required input values before it can process them."},{"text":"The calculation needs the output values first.","correct":false,"explanation":"Outputs are produced by processing, so they cannot normally be available beforehand. The algorithm must collect the input values before calculating."},{"text":"The calculation needs the variable names first.","correct":false,"explanation":"Variable names identify where data is stored but are not the data being calculated. The required information is the input values themselves."},{"text":"The calculation needs the final answer first.","correct":false,"explanation":"The final answer is the result of the calculation, not something collected before it. The algorithm first needs the input values."}]},{"id":"1ff7c8c4-5a3e-4ecc-8673-757d1a10bbb2","cardType":"cloze","points":null,"front":"[ ] removes unnecessary detail so you can focus on [ ].","back":"Abstraction removes unnecessary detail so you can focus on what matters.","mcqOptions":[{"text":"Abstraction removes unnecessary detail so you can focus on what matters.","correct":true,"explanation":"Abstraction hides details that are not relevant to the current task, allowing attention to be directed towards the important features and information."},{"text":"Decomposition removes unnecessary detail so you can focus on what matters.","correct":false,"explanation":"Decomposition divides a large problem into smaller sub-problems; it does not remove irrelevant detail. The correct term for hiding unnecessary detail is abstraction."},{"text":"Abstraction removes unnecessary detail so you can focus on smaller sub-problems.","correct":false,"explanation":"The second blank describes the relevant features of a problem, not its divided parts. Abstraction lets you focus on what matters."},{"text":"Iteration removes unnecessary detail so you can focus on repeated steps.","correct":false,"explanation":"Iteration means repeating instructions, whereas removing unnecessary detail is abstraction. Abstraction helps you focus on what matters."}]},{"id":"dd958ef0-f8ca-47b3-8481-be6790a404de","cardType":"basic","points":2,"front":"In a rectangle area algorithm, why can the rectangle's colour be ignored?","back":"It does not affect the area calculation.","mcqOptions":[{"text":"It does not affect the area calculation.","correct":true,"explanation":"The area of a rectangle depends on its length and width. Its colour is irrelevant, so abstraction allows the algorithm to ignore it."},{"text":"It does not affect the perimeter calculation.","correct":false,"explanation":"Although colour is also irrelevant to perimeter, the question concerns an area algorithm. The relevant reason is that colour does not affect the area calculation."},{"text":"It determines the area calculation.","correct":false,"explanation":"Colour has no mathematical role in finding a rectangle’s area. The calculation uses length and width, so colour does not affect the area calculation."},{"text":"It replaces the length calculation.","correct":false,"explanation":"Colour cannot replace a dimension or provide the information needed for area. The rectangle’s colour is ignored because it does not affect the area calculation."}]},{"id":"6c8ffa1c-20b0-4ea8-a66e-f50e6c828229","cardType":"basic","points":2,"front":"In the login example, which data should be kept after abstraction?","back":"enteredPassword and storedPassword.","mcqOptions":[{"text":"enteredPassword and storedPassword.","correct":true,"explanation":"These are the two password values needed to compare the user’s entry with the stored password. Other login details are unnecessary for this comparison."},{"text":"username and passwordHint.","correct":false,"explanation":"These details do not provide the two values needed for the password comparison. The relevant data is enteredPassword and storedPassword."},{"text":"enteredPassword and loginButton.","correct":false,"explanation":"A button is a user-interface control, not the stored value used for comparison. The required data is enteredPassword and storedPassword."},{"text":"storedPassword and screenColour.","correct":false,"explanation":"Screen colour is irrelevant to checking login credentials, while the user’s entry is essential. The data to keep is enteredPassword and storedPassword."}]},{"id":"bf086daa-b3ad-47c8-9104-31d88ceada7a","cardType":"basic","points":1,"front":"Which model describes an algorithm using its Input, Processing and Output?","back":"The IPO model.","mcqOptions":[{"text":"The IPO model.","correct":true,"explanation":"The IPO model describes an algorithm through its Input, Processing and Output stages, showing what data enters, what happens to it and what is produced."},{"text":"The IF model.","correct":false,"explanation":"IF is associated with selection and conditions, not the general Input, Processing and Output structure. That structure is described by the IPO model."},{"text":"The CPU model.","correct":false,"explanation":"A CPU is a processor in a computer, not a model for describing algorithm stages. Input, Processing and Output are represented by the IPO model."},{"text":"The RAM model.","correct":false,"explanation":"RAM is a type of temporary computer memory, not an algorithm representation model. The correct model for Input, Processing and Output is IPO."}]},{"id":"b3767a9e-899c-4543-8fe0-a38c6e54aafe","cardType":"basic","points":2,"front":"In IPO terms, what is area ← length * width?","back":"Processing, because it calculates a new value.","mcqOptions":[{"text":"Processing, because it calculates a new value.","correct":true,"explanation":"Multiplying length by width performs an operation on input values and produces a result. In the IPO model, this operation is processing."},{"text":"Input, because it receives a new value.","correct":false,"explanation":"The statement does not collect data from the user; it operates on existing values to produce a result. Therefore it is processing, not input."},{"text":"Output, because it displays a new value.","correct":false,"explanation":"The assignment calculates and stores a value but does not necessarily display it. Calculating the new value is processing; displaying it would be output."},{"text":"Storage, because it saves a new value.","correct":false,"explanation":"Although the result may be stored in area, the statement’s main IPO function is calculating that result. This makes it processing."}]},{"id":"11fbda21-4a36-49a7-b04f-eb0bdb7e7fc6","cardType":"basic","points":1,"front":"What can happen to data in a variable while an algorithm runs?","back":"It may change.","mcqOptions":[{"text":"It may change.","correct":true,"explanation":"A variable represents data that can be assigned a new value while the algorithm runs, so its contents may change during execution."},{"text":"It may disappear.","correct":false,"explanation":"A variable’s value can be updated, but it does not normally disappear simply because the algorithm continues. The correct property is that it may change."},{"text":"It may stay constant.","correct":false,"explanation":"A variable can sometimes keep the same value, but its defining feature is that its stored value may change during execution."},{"text":"It may become a command.","correct":false,"explanation":"A variable stores data rather than turning into an instruction. During an algorithm, the data held by a variable may change."}]},{"id":"8aa4808f-48e0-4365-bb2b-347040922461","cardType":"basic","points":2,"front":"Why is pseudo-code useful when planning an algorithm?","back":"It shows logic without exact programming syntax.","mcqOptions":[{"text":"It shows logic without exact programming syntax.","correct":true,"explanation":"Pseudo-code expresses an algorithm’s logic in a readable, language-independent form, allowing programmers to plan the solution before dealing with a particular language’s strict syntax."},{"text":"It checks code for exact programming syntax.","correct":false,"explanation":"Pseudo-code is intended to describe logical steps rather than check whether program code obeys syntax rules. The correct benefit is showing logic without requiring exact programming syntax."},{"text":"It runs logic without any programming software.","correct":false,"explanation":"Pseudo-code does not automatically execute an algorithm or generate results. It is useful because it communicates the logic without requiring exact programming syntax."},{"text":"It shows logic for one programming language.","correct":false,"explanation":"Pseudo-code is not restricted to one programming language; being language-independent is a major advantage. It shows algorithmic logic without requiring exact programming syntax."}]},{"id":"2924a859-a8dc-4ad8-9996-e7825094baf2","cardType":"basic","points":1,"front":"What extra rule must program code follow compared with pseudo-code?","back":"It must follow the language's syntax rules.","mcqOptions":[{"text":"It must follow the language's syntax rules.","correct":true,"explanation":"Executable program code must use the precise keywords, punctuation and structure defined by its programming language, whereas pseudo-code has no single compulsory syntax."},{"text":"It must include the language's iteration rules.","correct":false,"explanation":"An algorithm does not necessarily need a loop, because some problems require only sequence or selection. Program code must instead follow the chosen language's syntax rules."},{"text":"It must follow the language's variable values.","correct":false,"explanation":"Program code can use many valid variable names, provided they meet the language’s naming restrictions. Its essential extra requirement is following the language's syntax rules."},{"text":"It must include the language's selection rules.","correct":false,"explanation":"Program code does not have to contain selection, since an algorithm may consist only of sequential instructions. It must follow the chosen language's syntax rules."}]},{"id":"6a2f2dfd-aa18-4c61-92ff-cbdbcc1baa88","cardType":"basic","points":1,"front":"In a flowchart, what do arrows show?","back":"The flow of control - the order steps happen.","mcqOptions":[{"text":"The flow of control - the order steps happen.","correct":true,"explanation":"Arrows connect flowchart symbols and indicate which step follows which, showing the flow of control through the algorithm in the order that operations occur."},{"text":"The flow of data - the values entered by users.","correct":false,"explanation":"Input data is represented by a parallelogram, not by arrows. Arrows show the flow of control, indicating the order in which the algorithm’s steps happen."},{"text":"The type of process - the calculation being performed.","correct":false,"explanation":"Processing operations are represented by rectangular symbols rather than arrows. Arrows show the flow of control and therefore the order in which steps happen."},{"text":"The result of decisions - the output produced next.","correct":false,"explanation":"Decisions are represented by diamond symbols, although arrows may lead away along different branches. Arrows fundamentally show the flow of control and the order of steps."}]},{"id":"fb8b51ba-0950-4f0d-aa40-cb0b32f4c9fc","cardType":"cloze","points":null,"front":"A [ ] records variable values as an algorithm [ ].","back":"A trace table records variable values as an algorithm runs.","mcqOptions":[{"text":"A trace table records variable values as an algorithm runs.","correct":true,"explanation":"A trace table follows an algorithm step by step as it runs, recording how variable values change and making the algorithm’s behaviour easier to inspect."},{"text":"A variable table records variable values as an algorithm runs.","correct":false,"explanation":"A variable table may document identifiers and data types, but it does not specifically track execution. A trace table records variable values as an algorithm runs."},{"text":"A trace table records variable values as an algorithm finishes.","correct":false,"explanation":"A trace table records changing values during execution, not merely the final state after execution. The correct completion says that it records values as the algorithm runs."},{"text":"A flowchart records variable values as an algorithm finishes.","correct":false,"explanation":"A flowchart represents the sequence, decisions and loops within an algorithm rather than recording variable values during execution. A trace table performs that task as the algorithm runs."}]},{"id":"cdbdd3ad-c157-4d47-973b-9d3d14f02ee5","cardType":"basic","points":2,"front":"Why is a trace table especially useful for loops?","back":"Variables may change several times.","mcqOptions":[{"text":"Variables may change several times.","correct":true,"explanation":"Each loop iteration can update one or more variables, so a trace table clearly records their changing values after every repeated execution of the loop body."},{"text":"Variables may change data types.","correct":false,"explanation":"Variables can retain the same data type throughout a loop while their values repeatedly change. Trace tables are useful because those values may change several times."},{"text":"Instructions may be skipped permanently.","correct":false,"explanation":"A loop normally repeats instructions rather than permanently skipping them. A trace table is especially useful because variable values may change several times across the iterations."},{"text":"Variables may need repeated inputs.","correct":false,"explanation":"Variables do not have to be entered by the user during every iteration; many are updated through calculations. Trace tables track values that may change several times."}]},{"id":"62475ca5-399e-4d2c-8713-23f9180dd908","cardType":"basic","points":2,"front":"What is the purpose of this algorithm?

highest ← USERINPUT
FOR count ← 1 TO 3
score ← USERINPUT
IF score > highest THEN
highest ← score
ENDIF
ENDFOR
OUTPUT highest

","back":"Outputs the highest of four input scores.","mcqOptions":[{"text":"Outputs the highest of four input scores.","correct":true,"explanation":"The first input initializes highest, and three further scores are compared with it. Whenever a larger score is found, it replaces the stored value before output."},{"text":"Outputs the lowest of four input scores.","correct":false,"explanation":"The comparison updates highest only when a new score is greater, so the algorithm cannot find the lowest score. It outputs the highest of four inputs."},{"text":"Outputs the highest of three input scores.","correct":false,"explanation":"The initial input occurs before the loop, and the loop then accepts three more inputs. Forgetting that initial value causes the mistaken count; four scores are considered."},{"text":"Outputs the total of four input scores.","correct":false,"explanation":"No addition is performed, so the algorithm cannot calculate a total. It repeatedly compares four input scores and retains the highest value encountered."}]}]}],"examCountdown":{"examDate":"2027-05-10","paperLabel":"Paper 1"},"heading":"Representing algorithms","title":"Representing algorithms Flashcards","topbar":{"backHref":"/gcse/computer-science/aqa/flashcards"},"topicSidebar":"$L38"}]}],"topicId":"2a39aecd-4b86-53a5-8d74-074389c4b3b0","walled":"$L39"}],"$L3a","$L3b"]