UNIVERSITY EXAMINATIONS; 2024/ 2025
Assignment 1
Explain the following as applied in LISP programming, giving an example of each in each
(5 marks)
i. Atoms
ii. Strings
iii. Lists
Assignment 2
Explain the following components of a planning system (5 marks)
i. States
ii. Goal
iii. Precondition
Assignment 3
Discuss the main features of LISP that make it useful in artificial programming (5 marks)
CAT 1
CAT 2
(a) Explain three knowledge representation techniques other than predicate logic (6 marks)
(b)Consider the search space below, where S is the start node and G1 and G2 are goal nodes.
Arcs are labeled with the value of a cost function; the number gives the cost of traversing the
arc. Above each node is the value of a heuristic function; the number gives the estimate of the
distance to the goal. Assume that uninformed search algorithms always choose the left branch
first when there is a choice. Assume that the algorithms do not keep track of and recognize
repeated states.
For each of the following search strategies, indicate which goal state is reached first
(if any) and list in order, all the states that are popped off the OPEN list.
(i) Depth-first (2 marks)
(ii) Breadth-first (2 marks)