PARSHVANATH CHARITABLE TRUST'S
A. P. SHAH INSTITUTE OF TECHNOLOGY
(All Branches NBA Accredited)
Department of Information Technology
Academic Year: 2020-21 Semester: VII
Class / Branch: BE IT Subject: Artificial Intelligence
Question Bank
1. Module 1:
1. What is PEAS descriptor? Explain PEAS descriptor for Taxi diver Agent.
2. What is Artificial Intelligence?
3. What are the applications of AI?
4. Define Rationality and Rational Agent. Give an example of rational agent.
5. Explain model based Reflex agent with block diagram
6. Explain Learning agent with block diagram
7. Explain Goal based agent with block diagram
2. Module 2:
1. What is heuristics function? How will you find suitable heuristic function? Give suitable
example.
2. Discover shortest path using uniform cost search. G is Goal node and S is start node.
a.
3. Discover shortest path using uniform cost search. I is Goal node and A is start node.
Department of Information Technology | APSIT
PARSHVANATH CHARITABLE TRUST'S
A. P. SHAH INSTITUTE OF TECHNOLOGY
(All Branches NBA Accredited)
a.
4. The start and goal state are S and G, respectively. Remember that in graph search, a state is
expanded only once and the heuristic h shown on the graph. Apply greedy search algorithm
the graph and give the path returned by the algorithm.
5. Figure 2.2 depicts a search space in which the nodes are labeled with names like A, B, C, and
D. Node S is the start node. The goal nodes are drawn as square boxes and the other nodes
in circles. Give the path found by the Breadth First Search algorithm. The Breadth First
Search algorithm explores the graph till termination, searching from left to right.
Department of Information Technology | APSIT
PARSHVANATH CHARITABLE TRUST'S
A. P. SHAH INSTITUTE OF TECHNOLOGY
(All Branches NBA Accredited)
a.
6. Compare Greedy Best first search and A* search algorithms based on performance measure
with justification: Complete, Optimal, Time and Space complexity.
7. Apply Min Max algorithm on the given tree. What is the value for the root node?
a.
8. What is the difference between Informed and Blind search techniques? Give
comparative analysis of various uniformed search techniques
9. Apply Min Max Algorithm along on given game tree.
Department of Information Technology | APSIT
PARSHVANATH CHARITABLE TRUST'S
A. P. SHAH INSTITUTE OF TECHNOLOGY
(All Branches NBA Accredited)
10. Solve the given problem using Crypt Arithmetic method.
SEND
+MORE
________
MONEY
11. Explain constraint satisfaction. Also Give the real world examples of CSPs.
3. Module 3:
• Assume the following facts: i) It is a crime for an American to sell weapons to hosile nations.
ii) The country Nano an enemy of America. iii) Nano has some missiles; all of its missiles were
sold to try it by Colonel West. iv) Colonel West is an American. Use resolution to answer the
question " Colonel West is a Criminal."
• What are modus ponen?
• What is propositional logic
4. Module 4:
• Partial order planner with STRIP representation
• What is planning ? How it defers from searching?
• Explain planning problem for spare Tyre Problem.
5. Module 5:
• You have two nighbour, John and Mary, who have promised to call you at work when they hear
the alarm. John always calls when he hears the alarm, but sometimes confuses the telephones
ringing with the alarm and calls then, too. Mary on other hand, likes rather loud music and some
times misses the alarm altogether. Given the evidence of who has or has not called. We would
like to estimate the probability of a burglary. Draw a Bayesian network for his domain with
suitable probability table.
• Describe Bayes theorem
6. Module 6:
• Explain NLP in Communication.
Department of Information Technology | APSIT
PARSHVANATH CHARITABLE TRUST'S
A. P. SHAH INSTITUTE OF TECHNOLOGY
(All Branches NBA Accredited)
• Explain Cognitive computing and how it works
• What are the levels of knowledge used in language understanding? Also write down the
techniques used in NLP.
Department of Information Technology | APSIT
