Sample Mid Term ACI
Sample Mid Term ACI
Note:
1. Please follow all the Instructions to Candidates given on the cover page of the answer book.
2. All parts of a question should be answered consecutively. Each answer should start from a fresh page.
3. Questions must be answered only in the page numbers mentioned against each question. In case you require more
pages to answer a question, you can continue from page #21
4. Assumptions made if any, should be stated clearly at the beginning of your answer.
For questions (1-b) and (1-c), answer if forward search (data driven search) or backward search (goal driven search) will be more
appropriate with one good reason for the scenarios given:
(1-b) You have met a person Dr. Rajiv who claims to be your distant cousin. You need to verify his claim by finding some common
ancestor who is a few generations older.
(1-c) A system that will help human to classify plants by species
Provide the data structure description of a state. Specify the fields (with details of what goes into), pointers to be kept in the node.
Answers both in pseudo code, pictorial rep, in description are all allowed. [1.5 M]
State diagram, solution to the problem are not expected here
(1-e) Which of DFS or BFS is most preferred for this problem? Why.
DFS is recommended. This will lead to the lease number of nodes being expanded. This will become obvious when the state diagram
is drawn.
Page (1/2)
Show the result of Uniform cost search algorithm on this search tree.
(2-b) Is the uniform cost search (as presented in class and Text Book) a tree search or a graph search? Explain why should it be this
way?
(2-c) When the heuristic function h(n) ≥ 𝞮 ( where 𝞮 is a small positive constant) the states expanded by A* algorithm will be a
subset of uniform cost search. Why or why not?
The sliding-tile puzzle consists of three black tiles, three white tiles, and an empty space in some order. The goal is to arrive at the
goal configuration shown below by legal moves [B- Black tile, W-White tile].
B B B W W W
(2-a) What are measures using which the complexity of a state space can be measured. List each of them and provide the
corresponding expression / value for this problem.
(2-b) Write down an admissible heuristic function h(n) for this problem with a formal description. Explain why this proposed
heuristic is admissible.
1Mark for heuristic function and 1Mark for explaining
(2-c) Generate the A* search tree (using tree search) starting with the following start state for depth up to 3 or until the goal state is
reached, whichever is earlier.
Page (2/2)
W B W B B W
3Marks for : Annotate each node and edges with appropriate values f(n), h(n) and g(n) for better understanding. A search tree
without such annotations will not get full credit here.
Most likely representation of chromosome could be a list with 4 integers with each integer representing variables a,b,c
or d. For example [3,2,3,1] would imply a=3,b=2,c=3,d=1.
Fitness function - use a fitness function (most likely f(x) = 2a + 7b -5c +d) and calculate the fitness of each individual
Apply some selection criteria based on fitness value (could be roulette or the best fit etc.) to come up with initial
population
Apply crossover and mutation (how students chose to incorporate crossover and mutation may differ but it should be
consistent)
Page (3/2)