Você está na página 1de 10

2180703

ARTIFICIAL INTELLIGENCE

1. *Explain the State Space with the use of 8 Puzzle Problem.


2. **Explain the State Space representation of a Problem. For water jug
problem.
3. **Solve Water-Jug Problem using Production Rule System.
4. Analyze following problems with respect to the 7 problem characteristics of
AI.
1. **8-puzzle
2. **Traveling salesman
5. *Define AI? Explain the characteristics of AI problem.
6. **Explain A* algorithm in detail with an example.
7. **Explain AO* algorithm with an example.
8. *Given an example of a problem for which breadth-first search would work
better than depth-first search.
OR
Differentiate the DFS and BFS with merits and demerits. (Compare)
OR

**Explain depth first search (DFS) and breadth first search (BFS) with
suitable examples. Why is depth limited search necessary in DFS?
9. **What is Hill Climbing? Explain Simple Hill Climbing and Steepest- Ascent
Hill Climbing.
OR
**Explain the method of Hill climbing. Also explain the problems associated
with hill climbing and possible solutions

10. **Explain the Non-monotonic reasoning.


OR
What is non-monotonic reasoning? Explain different subtypes of
Non- monotonic reasoning in brief.

IMZAKIR 1
2180703
ARTIFICIAL INTELLIGENCE

11. **Explain the different issues in Knowledge representation.


OR
Explain the different approaches to knowledge representation.

12. **Explain Semantic Net and Frame with example.


OR
Explain Semantic Net in detail. Explain example of partitioned Semantic Net.

13. **Explain steps of Natural Language Processing.


14. *Enlist the phases of natural language understanding. Describe the role of
each phase in brief.
15. **Write a short note on: Hopfield Networks.
16. **What is an expert system? Explain Architecture of an Expert system.
17. *Explain the algorithm of predicate logic resolution.
18. **Explain Bayesian Network in detail with example.
19. **Explain simulated annealing algorithm.
20. **Explain following terms with reference to Prolog programming language:
Clauses, Predicates, Domains, Goal, Cut, Fail, Repeat Inference engine.

21. *Enlist and explain various phases involved in Natural Language Processing.

22. *Explain goal stack planning in detail with example.

23. *Describe briefly the applications of Neural Networks.

24. *Explain Min-Max search procedure with an example.

OR
Explain Min-max procedure for game playing with any example.

IMZAKIR 2
2180703
ARTIFICIAL INTELLIGENCE

OR
1. Min-max 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: `Site gave the pearl
garland to hanuman.
25. Discuss following:
1. Turing Test
2. State space of a problem
26. (z)How problem characteristics help in the selection of AI technique? Explain
these characteristics with possible examples.
27. (z)Consider the following initial and goal configuration for 8-puzzle problem.
Draw the search tree for initial three iterations of A* algorithm to reach from
initial state to goal state. Assume suitable heuristic function for the same.

Initial state Goal State


1 2 1 2
3 4 5 3 4 5
6 7 8 6 7 8

28. Explain different approaches of knowledge representation


29. Explain the steps of unification in predicate logic. Also discuss the steps of
converting predicate logic wffs to clause form.
30. Explain forward and backward reasoning in detail with suitable examples of
each.
31. What is Red Cut and Green Cut in Prolog?
32. Define certainty factor. How does certainty factor help in dealing with
uncertainty? Explain with reference to rule based system.

IMZAKIR 3
2180703
ARTIFICIAL INTELLIGENCE

33. Explain followings


1. Semantic net
2. Frames
34. Explain perceptron learning algorithm for training a neural network. What are
the limitations of this algorithm?
35. Explain Artificial Neural Network in brief.
36. Explain followings with reference to expert system:
1. Expert system shell
2. Knowledge acquisition
37. Describe different heuristics for the following types of problems:
1. Blocks world
2. Tic Tac Toe
38. 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.
39. Discuss perceptron learning algorithm.
40. Explain Artificial Neural Network Solve Travelling Salesman Problem using
any AI technique.
41. (z)Explain Semantic and Syntactic analysis in NLP.
42. Write a short note on: Recurrent Networks.
43. Explain Inference Rules in Propositional Calculus.
44. Explain mean-end analysis approach to solve AI problems.
45. (z)Explain the Forward and Backward Reasoning.
46. (z)What are the Applications, Features and Limitations of Prolog?
47. Analyze (a) 8-puzzle, (b) Chess and (c) Tower of Hanoi problems with respect
to the following problem characteristics:
1. Is the problem decomposable?
2. Can solution step be ignored?
3. Is the good solution absolute or relative?
4. Is the solution state or a path?
5. What is the role of knowledge?
6. Describe the components of a semantic net.

IMZAKIR 4
2180703
ARTIFICIAL INTELLIGENCE

48. (z)What is artificial intelligence? Define the different task domains of


artificial intelligence. (2)
49. What is production system? Explain it with an example. Discuss the
characteristics of a production system.
50. (z)Explain the Forward and Backward Reasoning.

51. Consider the following sentences:


1. Raj likes all kinds of food.
2. Apples are food.
3. Anything anyone eats and isnt killed by is food.
4. Sachin eats peanuts and is still alive.
5. Vinod eats everything Sachin eats.

Now, attempt following:

1. Translate these sentences into formulas in predicate logic.


2. Use resolution to answer the question, What food does Vinod eat?
52. What is wrong with the following arguments?
1. Men are widely distributed over the earth
2. Socrates is a man.
3. Therefore, Socrates is widely distributed over the earth.

How should the facts represented by these sentences be represented in logic so


that this problem does not arise?

53. *Consider the following axioms:


1. Anyone whom Mary loves is a football star.

2. Any student who does not pass does not play.


3. John is a student.
4. Any student who does not study does not pass.
5. Anyone who does not play is not a football star.

Prove using resolution process that If John does not study, then Mary does
not love John.

IMZAKIR 5
2180703
ARTIFICIAL INTELLIGENCE

54. Consider the following axioms:


1. Anyone whom Mary loves is a football star.
2. Any student who does not pass does not play
3. John is a student.
4. Any student who does not study does not pass.
5. Anyone who does not play is not a football star.
:-Prove using resolution process that If John does not study, then Mary
does not love John.
55. Construct the partitioned semantic net representations for the following:
1. Every batter hit a ball.
2. All the batters like the pitcher.
56. Consider the following sentences and Answer a,b,c given below:
1. Rama likes all kinds of vegetarian food.
2. Oranges are food.
3. Mutton is food.
4. Anything anyone eats and is not killed by is food.
5. Likex eats peanuts and is still alive.
6. Lovex eats everything Likex eats.

a. Translate these sentences into formulas in Predicate Logic.


b. Prove that Rama likes peanuts using Backward Chaining.
c. Prove Rama likes peanuts using Resolution.

IMZAKIR 6
2180703
ARTIFICIAL INTELLIGENCE

57. *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 isnt killed-by is food
5. Bill eats peanuts and is still alive.
6. Sue eats everything Bill eats.

1. Prove that John likes peanuts using resolution.(7)


2. prove John likes peanuts using forward chaining as well as backward
chaining.(7)
58. 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.

59. (z)Describe the expert system development procedure.

IMZAKIR 7
2180703
ARTIFICIAL INTELLIGENCE

PROLOG PROGRAMS:

60. *Write a prolog program to find maximum number from a list.


61. Write a Prolog program for finding a set, which is result of the intersection of
the two given sets
Hint: Goal: intersect ([1, 2, 3], [2, 3, 4], A)
A = [2, 3]
Goal: intersect ([d, f, g], [a, b, c], X)
X = []
62. Write a Prolog program to merge two sequentially ordered (ascending) lists
Into one ordered list.
Hint: Goal: merge ([1, 3, 5, 7], [0, 2, 4, 6], L)
L = [0, 1, 2, 3, 4, 5, 6, 7]
Goal: merge ([a, c], [b, d], [a, b, c, d])
Yes
63. **Write a Prolog program to find the factorial of a number.
64. *Write a prolog program to find sum of all the numbers of a list.
65. *Write a prolog program to solve Tower of Hanoi Problem.
66. Write a prolog program to count vowels in a list of characters.
67. Write a prolog program to reverse the given list

IMZAKIR 8
2180703
ARTIFICIAL INTELLIGENCE

68. Solve The following Crypt arithmetic problem:

CROSS *
+ROADS
-----------------
DENGER

OR

BASE *

+BALL

----------------

GAMES

OR

E A T

+TH A T

-------------------

A P P L E

OR

DONALD

+GERALD

-------------

ROBERT

IMZAKIR 9
2180703
ARTIFICIAL INTELLIGENCE

OR

SEND

+ MORE

------------

MONEY

IMZAKIR 10

Você também pode gostar