STUPIDSID
1 (a)
Explain depth first search (DFS) and breadth first search (BFS) with suitable examples. Why is "depth limited search" necessary in DFS?
7 M
1 (b)
What do you mean by state space representation of a problem? Illustrate how you can represent following water jug problem as a state space search: There are two jugs (without any measuring marks on them) of 4 and 3 liters capacity, respectively. There is a tap of water to fill the jugs. The objective is to fill the 4-liter jug with exactly 2 liter of water.
7 M
2 (a)
Translate these sentences into formulas in predicate logic.
1. John likes all kinds of food..
2. Apples are food..
3. Chicken is food..
4. Anything anyone eats and isn't killed-by is food..
5. Bill eats peanuts and is still alive..
6. Sue eats everything Bill eats.
1. John likes all kinds of food..
2. Apples are food..
3. Chicken is food..
4. Anything anyone eats and isn't killed-by is food..
5. Bill eats peanuts and is still alive..
6. Sue eats everything Bill eats.
7 M
2 (b)
Convert the formulas derived in Q2(a) into clauses. Prove that John likes peanuts using resolution.
7 M
2 (c)
Using the formulas derived in Q2(a) prove John likes peanuts using forward chaining as well as backward chaining.
7 M
3 (a)
Answer following questions:
1. What do you mean by the problem of plateau occurring in hill climbing? How can it be solved?
2. Differentiate between declarative and procedural representation of knowledge.
3. What do you mean by admissibility of an algorithm? Is A* algorithm an admissible one? When?
1. What do you mean by the problem of plateau occurring in hill climbing? How can it be solved?
2. Differentiate between declarative and procedural representation of knowledge.
3. What do you mean by admissibility of an algorithm? Is A* algorithm an admissible one? When?
7 M
3 (b)
Consider the game tree of Fig. 1 in which the static scores are from first player's point 07 of view. Suppose the first player is maximizing player. Applying mini-max search, show the backed-up values in the tree. What move will the MAX choose? If the nodes are expanded from left to right, what nodes would not be visited using alpha-beta pruning.
7 M
3 (c)
Answer the following questions:
1. 'Minimax is not good for game playing when the opponent is not playing optimally.' Justify using suitable example.:
2. Explain AND-OR graphs.:
3. Represent following sentence using semantic net: 'Sita gave the pearl garland to Hanuman.'
1. 'Minimax is not good for game playing when the opponent is not playing optimally.' Justify using suitable example.:
2. Explain AND-OR graphs.:
3. Represent following sentence using semantic net: 'Sita gave the pearl garland to Hanuman.'
7 M
3 (d)
Explain Goal Stack planning using suitable example.
7 M
4 (a)
Answer following questions:
1. Explain abductive reasoning using example.
2. Justify using an example that Prolog uses Backward chaining to prove or answer any given goal.
3. Describe any one conflict resolution approach used in rule based systems.
1. Explain abductive reasoning using example.
2. Justify using an example that Prolog uses Backward chaining to prove or answer any given goal.
3. Describe any one conflict resolution approach used in rule based systems.
7 M
4 (b)
Explain simulated annealing algorithm.
7 M
4 (c)
Explain how list is used in Prolog. Discuss how following list-functions can be implemented in Prolog:
Checking membership of an item in a given list, concatenating two lists, and deleting an item in a given list.
7 M
4 (d)
What do you mean by constraint satisfaction problems? Explain constraint propagation algorithm using suitable example.
7 M
5 (a)
Explain Hopfield networks.
7 M
5 (b)
Explain Bayesian networks with example.
7 M
5 (c)
List various components of natural language understanding process. Describe syntactic analysis and semantic analysis in brief.
7 M
5 (d)
Describe the expert system development procedure.
7 M
More question papers from Artificial Intelligence