Describe Dijkstra’s algorithm

a method of sorting data in an array into alphabetical or numerical order by placing each item in turn in the correct position in the sorted list.

Describe A* algorithm

– process in which the methods and data from one class, a superclass or base

... - a method of searching an ordered list by testing the value of the middle item in the list and rejecting the half of the list that does not contain the required value.

System which is given no training – learns on basis of ‘reward and punishment’.

Statistical measure used to make predictions from data by finding learning relationships between the inputs and outputs.

programming instructions that use the computer’s basic instruction set.

– a programming methodology that uses selfcontained objects, which contain programming statements (methods) and data, and which communicate with each other.

Time complexity of bubble, insertion sort

statements of facts and rules together with a mechanism for setting goals in the form of a query.

an instance of a class that is self-contained and includes data and methods.

Systems that learn without being programmed to learn.