A2 - End of chapter 18 test

Last updated 6 months ago
11 questions
Answer all the questions.
1

Identify the statement that best describes artificial intelligence.

1

Identify the programming language that is not used when programming AI systems.

1

Identify the correct description of a heuristic approach.

8

Match each description to either Machine learning or Deep learning.

Deep learning
Machine learning
needs only a small amount of training data
problems are solved in an end to end manner
enables machines to make decisions with the help of artificial neural networks
has clear rules to explain how decisions were made
makes use of modular approach at design and training stages
needs vast amounts of data during training and development
enables machines to make decisions on their own based on past data
makes decisions based on its own logic so the
reasoning may be difficult to interpret
9
complete the text, using words from the box. Words may be used once, more than once, or not at all.

When designing artificial neural networks, each neuron is given a _____________________.
The __________________ is compared to the _____________________ as part of the training.
____________________ are used to update the neural weightings.
Weightings are updated until the errors are ______________ or are ____________ .
This process is known as _____________________ .
There are two types: ___________ and ______________ .
Machine learning uses _______________ to make predictions from data by looking at learning relationships.
Other Answer Choices:
deep learning
supervised learning
expected results
regression
reinforcement learning
minimised
testing
back propagation
actual output
error gradients
removed
random weighting
recurrent
static
machine learning
6

Describe three features you would associate with:

i) reinforcement learning [3]
ii) supervised learning. [3]

6

Explain why these applications are regarded as artificial intelligence.

i) Chat bots [2]
ii) Search engines [2]
iii) Photographic enhancement applications [2]

2

Explain the difference between the A* algorithm and Dijkstra’s algorithm.

8

The following graph (network) shows how long it takes (in seconds) to walk between ten hotels in a city.

Using Dijkstra’s algorithm, show the shortest time to walk from the City Hotel (C) to the Quality Hotel (Q).

1

Give the route corresponding to your answer in question 9 above.

4

Tom is using a GPS device to navigate from point B to point E.
Tom’s GPS uses the A* algorithm to find the shortest route:
B → C → M → J → K → E
This route is shown in orange on the diagram.
However, due to some major flooding, routes M to J and M to F have been closed, making the original path no longer possible.
Describe how the GPS system will use the A* algorithm to find an alternative
route from B to E.