ADT's + COMPUTATIONAL THINKING

12345678910111213141516171819202122
Across
  1. 4. – a method of showing the detailed logical steps in an algorithm, using keywords, identifiers with meaningful names, and mathematical operators.
  2. 7. – an ordered set of steps to be followed in the completion of a task.
  3. 8. – a list containing several items operating on the first in, first out (FIFO) principle.
  4. 9. – the process of breaking a complex problem into smaller parts.
  5. 12. – (2 words)a list containing several items in which each item in the list points to the next item in the list.
  6. 13. – a classification attributed to an item of data, which determines the types of value it can take and how it can be used.
  7. 14. – a collection of data stored by a computer program to be used again.
  8. 16. – a data structure containing several elements of the same data type.
  9. 19. – (2 words)the practice of subdividing each part of a larger problem into a series of smaller parts, and so on, as required.
  10. 20. – a diagrammatic representation of an algorithm.
  11. 21. - recognition – the identification of parts of a problem that are similar and could use the same solution.
  12. 22. – the process of extracting information that is essential, while ignoring what is not relevant, for the provision of a solution.
Down
  1. 1. – (2 words)a method of showing the logical steps in an algorithm, using an agreed subset of straightforward English words for commands and mathematical operations.
  2. 2. – (3 words)a collection of data and a set of operations on that data.
  3. 3. – (2 words)a data type constructed using several of the basic data types available in a particular programming language.
  4. 5. – (2 words)a method of sorting data in an array into alphabetical or numerical order by comparing adjacent items and swapping them if they are in the wrong order.
  5. 6. – a unique name applied to an item of data.
  6. 10. – a composite data type comprising several related items that may be of different data types.
  7. 11. – a list containing several items operating on the last in, first out (LIFO) principle.
  8. 15. – (2 words)a method of searching in which each element of an array is checked in order.
  9. 17. – (2 words)the index of the first element in an array, usually 0 or 1. Upper bound – the index of the last element in an array.
  10. 18. – a numerical indicator of an item of data’s position in an array.