able parts.","points":2},{"id":"42bc7790-3628-43aa-94e0-10d8ff4cf535","cardType":"basic","front":"Before decomposing a system, what must you understand first?","back":"The system’s requirements.","points":1},{"id":"042471e3-13c0-492e-8c47-30c4a3fb53e2","cardType":"cloze","front":"A requirement is something the solution [ ] or a constraint it [ ].","back":"A requirement is something the solution must do or a constraint it must satisfy.","points":null},{"id":"e642e2d6-48f5-41bb-8328-ada204c217b6","cardType":"basic","front":"What three things should be clear for each subproblem boundary?","back":"

Input: data received.
Processing: actions or rules applied.
Output/effect: result produced or state changed.

","points":3},{"id":"b7d6e29e-868c-4f7a-ba57-0f7539c67473","cardType":"basic","front":"Why is "make revision more engaging" too vague to code directly?","back":"It lacks clear data, rules and processing steps.","points":2},{"id":"3707fdb4-7d33-4349-b3e4-cb068a2f20d5","cardType":"cloze","front":"A computational solution can be expressed as [ ] and [ ] a computer can execute.","back":"A computational solution can be expressed as algorithms and data structures a computer can execute.","points":null},{"id":"6cb3a4e5-9557-43fd-b8ed-30eeb0eaef85","cardType":"basic","front":"In top-down decomposition, when should you stop splitting a task?","back":"When it is small enough to design and code.","points":1},{"id":"f50d3021-4279-441e-b5d7-7fdac92fb822","cardType":"cloze","front":"In a decomposition tree, a leaf is the [ ].","back":"In a decomposition tree, a leaf is the lowest-level item.","points":null},{"id":"2f0e3b98-9583-4382-ad16-916762ca8a34","cardType":"basic","front":"What should a good decomposition’s parts be capable of becoming?","back":"Code structures or testable units.","points":1},{"id":"6870cd0e-7c72-4dae-84e4-d9a9f278430a","cardType":"basic","front":"If a subproblem has several unrelated responsibilities, what should you do?","back":"Split it into smaller responsibilities.","points":1},{"id":"cbc900b4-75fc-499a-a699-91f8380d3bec","cardType":"cloze","front":"A module is a [ ] program part with a [ ].","back":"A module is a self-contained program part with a specific responsibility.","points":null},{"id":"28a093a1-b00b-4c4c-98e4-5232e01c3758","cardType":"basic","front":"What extra thing does a function do compared with a procedure?","back":"A function returns a value.","points":1},{"id":"d3e28072-1800-47f0-8d82-ecf83f942680","cardType":"basic","front":"Why is markAnswer a good candidate for a function?","back":"It can return whether the answer is correct.","points":2},{"id":"9e1abb42-220a-47c2-8dea-f9f29cfc15d5","cardType":"basic","front":"Why should "ask one question" be reusable in a ten-question quiz?","back":"The same behaviour is repeated inside a loop.","points":2},{"id":"f6d3f138-5302-4ec4-be41-ba2fdbabbd7d","cardType":"cloze","front":"An algorithm is a [ ] of [ ] used to solve a problem.","back":"An algorithm is a finite sequence of precise steps used to solve a problem.","points":null},{"id":"4b1827ff-cbac-44c2-a260-1c4e81e14d9e","cardType":"basic","front":"Why is decomposing only into screens a weak design?","back":

Decompose the problem Flashcards

Decompose the problem Flashcards