Across
- 2. A problem that exists and has no efficient solution. Heuristics are used to solve this type of problem.
- 6. Refers to a way of approaching problems that is particularly useful in computing.
- 9. When a function calls itself. There must be a halt/stopping point so that the program can terminate. The Quick Sort algorithm uses recursion. Think of Russian Dolls!
- 10. Visual representation that provide a clear way of communicating the software solution.
- 12. The opposite of an AND gate.
- 14. A binary digit appended to a group of binary digits to make the sum of all the digits, including the appended binary digit, either odd or even as established beforehand.
- 18. An algorithm for finding an element within a list.
- 19. A computer component used to store electrical charge.
- 22. Representation of a physical system or process.
- 24. A computer circuit that outputs True if both inputs are True.
- 26. Mental shortcuts or "rules of thumb" that often lead to a solution (but not always). When a time-sensitive computational problem needs to be solved.
- 28. Refers to the measure of the amount of time taken by an algorithm to solve a problem as a function of the size of the input. Measured using "Big O" notation.
- 30. A divide and conquer search algorithm that starts at the middle of a sorted set of numbers and removes half of the data.
- 31. A famous algorithm used to solve the Travelling Salesperson problem.
- 33. A divide-and-conquer sorting algorithm. It works by selecting a 'pivot' element from the list and partitioning the other elements into two sub-lists, according to whether they are less than or greater than the pivot. Has a worst-case algorithmic time complexity of O(n^2).
- 34. used to show all possible inputs and outputs of a Logic Gate or Logic Circuit
- 35. A step by step plan to solve a problem. Always finishes.
Down
- 1. A computer circuit that outputs False if the input is True, and vice-versa.
- 3. Used in computer science to describe the performance or complexity of an algorithm. Specifically describes the best and worst-case scenario.
- 4. Computer component that limits the flow of electrical current in a circuit.
- 5. Using a grid, travel from source to destination to maximise weight, only by moving south and east.
- 7. The opposite of an OR gate.
- 8. The last digit of a barcode number, book ISBN or credit card number is an example of a check digit which makes sure the number is correctly composed. Also known as a Checksum.
- 11. Representing a logic circuit as a diagram.
- 13. A sorting algorithm that repeatedly scans for the smallest item in the list and swaps it with the element at the current index, with a worst-case algorithmic time complexity of O(n^2).
- 15. A combination of logic gates.
- 16. Using a computer to represent a system, without the need to create the system physically.
- 17. Computer component that acts as a switch, controlling the flow of current within a circuit.
- 20. A method of expressing algorithms using a combination of programming code and plain language.
- 21. A sorting algorithm. Compare an item to the items in a sorted list and place the item into the correct position, with a worst-case algorithmic time complexity of O(n^2).
- 23. A computer circuit that outputs True if either one or all inputs are True.
- 25. Breaking down a complex problem into smaller parts
- 27. A model which can simulate the actions and interactions between "agents" in an environment. A real-world example is include modelling traffic.
- 29. A logic gate that outputs 0 if both inputs are the same, and outputs 1 otherwise.
- 32. Finding similarities and patterns in order to solve complex problems more efficiently.