AI chapter & more

123456789101112131415161718192021222324
Across
  1. 3. return an element from the front of the queue
  2. 5. it records the existence of an edge between each node and all of its neighbours (2 words/no space)
  3. 6. In ______ the system has to draw its own conclusions from its experience of the results of the tasks it has performed.(2 words/no space)
  4. 7. statistical measure used to make predictions from data by finding learning relationships between the inputs and outputs.
  5. 10. It is uses when you want to store many pieces of data that are related and have the same data type.
  6. 12. In _____ the system is fed knowledge with associated classification. (2 words/no space)
  7. 16. It is usually implemented as a static data structure that is fixed in size and can only contain elements of the same data type.
  8. 18. This type of data structures reserve memory for a set amount of data.
  9. 20. It is a two-dimensional array that records the relationship between each node and all other nodes in the graph.(2 words/no space)
  10. 21. systems that learn without being programmed to learn. (2 words/no space)
  11. 23. theadjacency list is used to record connections between two nodes (2 words/no space)
  12. 24. it is an abstract data type that defines an unordered collection of data as a set of key-value pairs
Down
  1. 1. machines that think in a way similar to the human brain. They handle huge amounts of data using artificial neural networks.(2 words/no space)
  2. 2. The A* algorithm uses a _____ function to help decide which path to follow next.
  3. 3. The A* algorithm is a modification of the _____ algorithm designed to improve matters.
  4. 4. The purpose of this algorithm is to find the best route from one node to all of the remaining nodes
  5. 8. (also called vertices) are represented in the diagram by labelled circles.
  6. 9. A linked list has the advantage that its size is not predetermined.
  7. 11. The heuristic function provides an _____ of the minimum cost between a given node and the target node.
  8. 13. The connections between nodes are called ____
  9. 14. Static arrays are very efficient in terms of being able to access elements directlyby using this information.
  10. 15. A _____ can be used to represent a variety of scenarios.
  11. 17. It is a data structure that holds a number of data items or elements of the same data type.
  12. 19. ______ are used to provide 'good enough' solutions to very complex problems where finding a perfect solution would take too much time.
  13. 22. It is a conceptual model that describes how data is organized and which operations can be carried out on the data.