FACULTY OF ENGINEERING & TECHNOLOGY

PIET

DEPARTMENT OF CSE/IT

SUBJECT: ARTIFICIAL INTELLIGENCE

QUESTION BANK
ARTIFICIAL INTELLIGENCE [2180703] 2017-18
1. What is Intelligence? Discuss types of problems requiring Intelligence to solve it. Define
AI.
2. What is artificial intelligence? Define the different task domains of artificial intelligence.
3. Define AI? Explain the characteristics of AI problem.
4. Explain the various AI Techniques.
5. Explain Turing test.
6. Explain the State Space with the use of Water Jug Problem, 8 Puzzle Problem.
7. What is Hill Climbing? Explain Simple Hill Climbing and Steepest-Ascent Hill Climbing.
8. What are the Problem Characteristics of Artificial Intelligence?
9. Solve Water-Jug Problem using Production Rule System.
10. Explain & Compare DFS & BFS search algorithm.
11. Explain A* algorithm.
12. Explain mean-end analysis approach to solve AI problems.
13. What is production system? Explain it with an example.
14. Explain depth first search (DFS) and breadth first search (BFS) with suitable examples.
Why is ‘depth limited search’ necessary in DFS?
15. What do you mean by the problem of plateau occurring in hill climbing? How can it be
solved?
16. Explain AND-OR graphs. Give one example where AO* is suitable to apply.
17. What do you mean by constraint satisfaction problems? Explain constraint propagation
Algorithm using suitable example.
18. Discuss simulated annealing search method. Which types of problems are suitable to
solve using this method?
19. Analyze (a) 8-puzzle, (b) Chess and (c) Tower of Hanoi problems with respect to
the Following problem characteristics:
Is the problem decomposable?
Can solution step be ignored?
Is the good solution absolute or relative?
Is the solution state or a path?
What is the role of knowledge?
20.

21.

22.

23. Assume the following facts:

Steve only likes easy courses.
Science courses are hard.
All the courses in the basket weaving department are easy.
BK301 is a basket weaving course.
Use Resolution to answer the question, “What Course would Steve like?”
24. Consider the following sentences and answer the following questions:
Rama likes all kinds of vegetarian food.
Oranges are food.
Mutton is food.
Anything anyone eats and is not killed by is food.
Likex eats peanuts and is still alive.
Lovex eats everything Likex eats.
Translate these sentences into formulas in Predicate Logic.
Prove that Rama likes peanuts using Backward Chaining.
Prove Rama likes peanuts using Resolution

25. Explain the algorithm of predicate logic resolution.

26. Explain the different approaches to knowledge representation.
27. Differentiate between declarative and procedural representation of knowledge.
28. Explain Non Monotonic reasoning.
29. Explain the different issues in Knowledge representation.
30. Explain the Forward and Backward Reasoning with an example.
31. Differentiate between logic programming and PROLOG.
32. Explain the Bayesian Networks.
33. Describe briefly the applications of Neural Networks.
34. Explain Artificial Neural Network in brief.
35. Write a short note on: Hopfield Networks.
36. Explain perceptron learning algorithm for training a neural network. What
are the limitations of this algorithm?
37. What is linearly separable problem? Design a perceptron for any of such problem. State
one example of a problem which is not a linearly separable.
38. Discuss different activation functions in neural network
39. Discuss Fuzzy logic in brief.
40. Write a Prolog program to solve Tower of Hanoi Problem.
41.Write a prolog program to count vowels in a list of characters.
42.Write a prolog program to find the sum of elements of a List.
43.Write a prolog program to find factorial of a given number.
44.Write a prolog program to reverse the given list.
45.Write a prolog program to find maximum number from a list.
46.Write a Prolog program for finding a set, which is result of the intersection of the two
given sets.
47.Write a Prolog program to merge two sequentially ordered (ascending) lists into one
ordered list.
48.What is Red Cut and Green Cut in Prolog?
49.Demonstrate the use of Repeat Predicate in Prolog with example.
a.Explain CUT, FAIL & REPEAT predicates in PROLOG.
50.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.