Professional Documents
Culture Documents
201 2007 0 B PDF
201 2007 0 B PDF
School of Computing
Discussion of Assignment 1
COS351D/201/2007
Table of Contents
Chapter 1
Read as background.
Chapter 2
Familiarise yourself with the concepts and terminology.
Chapter 3
Study everything. You have to understand all the algorithms and be able to apply them to a given
problem statement. You do not need to memorise any pseudo-code.
Chapter 4
Study everything except the following sections, which you can omit entirely:
- Memory-bounded heuristic search, pp. 101-104.
- 4.4 Local Search in Continuous Spaces, pp. 119-129.
You have to understand all the algorithms and be able to apply them to a given problem statement.
You do not need to memorise any pseudo-code.
Chapter 5
Study everything except the following section, which you can omit entirely:
- 5.4 The Structure of Problems, pp. 151 – 155.
You have to understand all the algorithms and be able to apply them to a given problem statement.
You do not need to memorise any pseudo-code.
Chapter 6
Study sections 6.1, 6.2 and 6.3. You have to understand the minimax and alpha-beta algorithms, and
be able to apply them to a given problem statement.
Read sections 6.4, 6.5, 6.6, 6.7 and 6.8. You have to understand the concepts covered in these
sections, but you do not need to be familiar with any particular game such as backgammon, chess or
any card game.
3
COS351D/201/2007
Solution: Assignment 1
5. TRUE or FALSE: The Turing Test provides a formal definition of Artificial Intelligence.
1) TRUE
2) FALSE
8. An Expert System is …
1) a system used by experts to make predictions, such as tomorrow’s weather.
2) a group of intelligent programs.
3) a database of knowledge.
4) a computer program containing subject-specific knowledge of human experts.
5) a set of rules on how to solve specific problems.
4
COS351D/201/2007
9. A problem is intractable if …
1) there is no solution to the problem.
2) only a partial solution can be logically deduced.
3) the problem cannot be solved by humans but there exists an AI program that will be
able to solve it.
4) it is not NP-complete.
5) the time required to solve the problem grows exponentially with the size of problem
instances.
This question was not marked, as none of the answers are correct. The correct answer is
1997.
13. Alvinn is …
1) the name of the first robotic vehicle.
2) a neural network.
3) a perception system that controls a vehicle.
4) (1), (2), and (3).
5) (2) & (3)
5
COS351D/201/2007
17. Compatibilism is …
1) a theory that suggests that free will and determinism are compatible.
2) the theory that explains why certain people are attracted to each other.
3) a theory proposed by John Searle.
4) None of the above.
5) All of the above.