1.

Give the PEAS description of an interactive English tutor system

2. Identify whether the assertion given below is true or false and support your
answer with appropriate examples or counterexamples.
3. Are there agent functions that cannot be implemented by any agent
program? If so, what would be the reason?
4. For each of the following activities, give a PEAS description of the task environment and
characterize it in terms of the properties.

i. Bidding on an item at an auction.

ii. Performing a high jump.

5. Why problem formulation must follow goal formulation? Take one example and give your
justification.
6. To what extent are the following computer systems can make use of the
instances of artificial intelligence:
a) Supermarket bar code scanners.
b) Web search engines.
c) Voice-activated telephone menus.
d) Internet routing algorithms that respond dynamically to the state of the
network.
7. “Surely computers cannot be intelligent—they can do only what their
programmers
tell them.” Is the latter statement true, and does it imply the former?
8. Assume that you are asked to identify a suitable agent for automated
assembly line of a motorcycle production plant. In this regard, you have to
analyze the environment to identify its nature based on various properties
present in it. How can you identify the type of environment?
9. Can you suggest a suitable agent program that implements the human
feelings perfectly in the automated taxi driving application?
10. Prove each of the following statements, or give a counterexample:

a. Breadth-first search is a special case of uniform-cost search.

b. Depth-first search is a special case of best-first tree search.
11. Give scenarios where Depth First Search and Breadth First Search yield better results.
12. What is the significance of informed search strategy in problem solving?
13. Whether hill climbing search guarantee to provide solution for n-queen’s problem? If so,
how is it possible?
14. What is the key difference between minimax and expecti-minimax algorithm?
15. How do you solve the map coloring problem which has 3 regions and 2 colors using
constraint satisfaction approach?
16. In what way does first order logic differ from that of propositional logic?
17. Whether the given sentence is a valid sentence or not? x P(x) V P(x)
18. Write the semantics of existential quantifier.
19. Why is it important to implement subsumption while creating knowledge base? Give
suitable example.
20. Why is it important to implement inference rules while developing knowledge base? Give
suitable example.
21. In which circumstance does unification fails? Is it avoidable?
22. What is a Software Agent?
23. What is the role of software agents?
24. Name the three parts in the Architecture of Intelligent Agent.
25. List down some capabilities of a software Agent.
26. Is a live chat-bot a Cooperative MAS or Competitive MAS? Justify.
27. Draw a parse tree for the sentence, “ AI rules the IT World”.
28. From a parse a tree for the sentence “Every wumpus smells” according to the grammar ε 0
for the Wumpus World game.
29. What is a PCFG?
30. Write a context free grammar for palindrome.
31. What are overlapping frames in speech recognition?
32. CYK algorithm requires all rules of the grammar to be in any one of the two specific
formats for parsing. What are they?
1. Consider the following scenario and tell whether the agent is rational or not.

A vacuum cleaner (agent) in one the two rooms as shown in the figure. The rooms initially
contain dirt. The vacuum cleaner can do the following actions only: MoveLeft, MoveRight and
Suck. It has no memory.
2. How does iterative deepening search overcome the drawback of depth first
search? Give your justification.
3. Suppose two friends live in different cities on a map. On every turn, we can
simultaneously move each friend to a neighboring city on the map. The
amount of time needed to move from city i to neighbor j is equal. We want
the two friends to meet as quickly as possible. How would you help them to
succeed in their task?

4. “An agent that senses only partial information about the state cannot
be perfectly rational.”Consider the following graph given below. The numbers written on
edges represent the distance between the nodes. The numbers written on nodes represent the
heuristic value. Find the most cost-effective path to reach from start state S to final state G using
A* Algorithm.

5. For the given graph, find the optimal path using A* search algorithm.
6. Can you show how A* search is optimal when used in tree and graph search algorithm?
7. Write short notes on any two local search strategies with example.

8. Determine the Minimax value for the given game tree using minimax algorithm.

Max

4 3 5 2 1

9. Explain in detail how the minimax algorithm is used to find optimal move in game tree.
How alpha-beta pruning technique does improve the effectiveness of minimax algorithm?
10. Explain why it is a good heuristic to choose the variable that is most constrained rather
than the value that is least constraining in a Constraint Satisfaction Problem search.
11. Convert the following English sentences to First order logic sentences.
a) All students are smart.
b) Manikandan has two sisters.
c) Every girl student respects Manikandan.
d) A sibling is another child of one’s parent.
e) There is one student who is loved by all the students.
f) Bluebeard is a horse.
g) All pray for people of Kerala but army rescue them.
12. Consider a one-bit full adder digital circuit. Show how you will reason out its working
using knowledge engineering process.
13. There is a cave similar to a 4X4 grid in which a beast named Wumpus is living. Assume
a robot which is in (1,1) is assigned the task of grabbing the gold present in (3,2). Pits are
is found in (1,3) and (4,4). Wumpus now in (3,1) is identified by the stench from nearby
grids. Can you create a knowledge base to store knowledge about this case?
14. Use truth tables to Show that (p → q) ∧ (q → p) is logically equivalent to p ↔ q. Use truth tables
to Show ¬(p → q) is equivalent to p ∧ ¬q.
15. What is the significance of universal instantiation and existential instantiation? Give
suitable example.
16. The law says that “It is crime for an American to sell weapons to hostile nations. The
country Iraq, enemy of America has some missiles. All of its missiles were sold to it by
Colonel West who is an American.” Can you deduce the proof that Colonel West is
criminal by applying forward chaining algorithm for the above mentioned case?
17. A = Refutation means proof by contradiction. B = Resolution is refutation complete. How
will prove that A |= B?
18. How does Argumentation-based negotiation (ABN) differ from proposal based
approaches such as Heuristics and Game Theory?
19. Gossip or recommendations coming from other agents are sometimes used for trust
calculation. However, they are a particular source of information that brings specific
risks. Explain why it is interesting to take them into account and what are the associated
risks are. Propose an efficient way to integrate them into a trust calculation process.
20. Explain the essential components of Agent Communication.
21. Compare and contrast your own experiences on speaking over phone to a Customer care
executive and posing questions to a chat bot.
22. Explain trust-building in a Multi Agent System
23. Comment on the below statement: “Trust between agents within Multi-Agent
System may be analogous to the trust that is required between humans.”
24. Explain the terms Cooperation and Coordination in a Multi Agent System.
25. Compare and contrast your own experiences on speaking over phone to a Customer care
executive and posing questions to a chat bot.
26. What is reputation in a Multi Agent System and explain the ways to build reputation in a
Multi Agent System.
27. Consider the scenario of Online Trading. All the traders use Intelligent Agents to buy and
sell stocks and shares. List out and explain the issues faced by these competitive agents in
this Multi Agent system.
28. Find out the problems with PCFG- Probabilistic Context Free Grammar (PCFG) and how
come Markov model helps to overcome the difficulty?
29. Explain the role of phrase structured grammar in natural language for communication.
30. Explain the types of ambiguities of a grammar and the process for making it
unambiguous.
31. How the transfer model is useful in machine translation systems?
32. Among many models of machine translation, statistical models are most popular and
successful one, why? Sketch the procedure for translating a sentence from Tamil into
Chinese.
33. Compare the features of Tensor flow and IBM Watson tool in speech recognition. Which
one you find it as best and why?
34. Explain four classes of grammatical formalisms given by Chomsky with a suitable
example for each.
35. Explain the process of natural language communication. Is it necessary for AI
applications to have this? In what way it is important for an application in AI?
36. How does IBM Watson recognize the speech? Do you find any flaws in the tool? Will it
recognize a speech in Tamil?
37. How does a chart parser CYK algorithm parse a sentence? Explain it with an example.