1. Computational thinking is a ….
2. What is this a description of? "Looking for repeating patterns in a sequence"
3. It can be easier to see how a problem is decomposed by making a diagram. ___________are a popular way of doing this.
4. What is another word for 'Iteration'
5. If you were writing an algorithm for a game and needed a way to find out if the game was over, what might you do?
6. What is line two of this algorithm doing?
7. There are generally speaking four elements of computational thinking. What are they?
Elements of Computational Thinking
2. Pattern Recognition
4. Algorithmic Thinking
5. Binary number conversion
8. Read the excerpt on computational thinking (from barefoot computing) and see if you agree.
9. Computational thinking is not thinking about computers or like computers. Computers don’t think for themselves. Not yet, at least!
10. Why is computational thinking so important?
11. This library system menu screen is an example of abstraction as it focuses on the bare basics necessary for a user to interact with the library
12. Using examples from this scenario, explain what is meant by abstraction.
13. In abstraction it is important to pick out the important / relevant parts / components / ideas / details.
14. In the example of a rollercoaster 3d simulation examples of the unimportant details you would NOT include would be:
15. One definition is: Abstraction is the process of removing unnecessary detail from a problem. Why is this useful?
16. Read the following excerpt on top down programming (decomposiiton) and see if you think it is TRUE or FALSE
17. Read this excerpt on reusability of modules and decide whether it is true or false
18. Which of the following statements is an ADVANTAGE of decomposition?
19. In programming, one way of decomposing a task is to break it into…..
20. How would you decompose the task of creating an app?
21. Dealing with many different stages all at once is much more difficult than breaking a problem down into a number of smaller problems and solving each one, one at a time.
22. Which of these is an example of decomposition?
23. In an algorithm, each instruction is identified and the ________in which they should be carried out is planned
24. Algorithms are often used as a starting point for creating a computer program, and they are sometimes written as a ___________________________
25. Computers are only as good as the algorithms they are given. If you give a computer a poor algorithm, you will get a poor result – hence the phrase: ‘Garbage in, garbage out.’
26. Pseudocode can differ, as there are no hard and fast rules, but what is important is that it is…..
27. Pseudocode should also be precise. How could the following pseudocode be improved?
28. Trace the flowchart's logic to find the profit or loss when CP(Cost Price) = 325 and SP (Selling Price) = 458
29. Analyse the logic of the flowchart and predict what it's function/purpose is.
30. Just like in Maths there is the ________________________ for performing calculations, otherwise known as BODMAS/BIDMAS
31. What does the B in BODMAS mean?
32. What is the output of Z for the following algorithm, when the following numbers are input. A=27, B=15, C=52.
33. The code below is for a Binary Search (in python). Where has DIV been used here?
34. Why do we need to look for patterns in problems?
35. All cars have wheels' is a pattern, because all cars have a _____________________ - wheels.