Sunteți pe pagina 1din 7

ARTIFICIAL INTELLIGENCE

(Summer 2016)
a) Describe major branches of AI. Hence explain its importance in current scenario of IT. 7
b) Explain control strategy for water jug problem using breadth-first-search. 6
OR
a) Discuss production system and hence explain application of production system for water jug problem.
6
b) Describe the tic-tac-toe problem and data structure used in implementation: 7
(Winter 2016)
a) Describe level of the model. Hence explain some reasons that might want to performance. 7
b) What is production system? Describe the content of it. 6
OR
a) What is AI? Explain intelligent behaviour that is involved in artificial intelligence. 7
b) What are problem characteristics? Explain any one in detail. 6

(Summer 2017)
Q. a) Explain major steps that are required to build a system to solve a particular problem 7
b) Explain tic-tac-toe problem. With data structure and strategy to win the game 7
OR
Q. a) What is AI? Explain three important AI techniques. 7
b) Explain water - jug problem and its solution in view of implementation of AI technique. 7

(Winter 2017)
Q. a) What is AI? Explain intelligent behaviour that involved in AI.
b) What do you meant by problem characteristics? Explain any one in details.
OR
Q. a) Describe the production system and hence explain its working for search.
b) Describe the model showing the levels which gives reasons to model human performance.

(Summer 2016)
a) What is knowledge representation and frame problem? 7
b) What is hill climbing strategy? Explain with 8-puzzel problem and heuristic function. 7
OR
a) Describe the construction of best-first search. Justify the need to combine the two search algorithms. 7
b) Design a heuristic function for 8-puzzle problem when its start and end states are: 7
Start End

(Winter 2016)
a) What do you mean by weak methods in AI? Explain any one in detail. 7
b) Discuss problem trees and graphs. Thus explain forward versus backward reasoning. 7
OR
a) What is generate and test control strategy? Explain breadth first search and its problems. 7
b) Explain A * Algorithm with its strengths. 7

(Summer 2017)
Q. a) Differentiate between problem trees V/s problem graphs hence explain its importance in search
strategies. 7
b) Describe and explain generate and test algorithm for search technique 6
OR
Q. a) What are the general purpose strategies known as weak methods explain any four.8
b) What do you mean by problem reduction? Explain with an example. 5

(Winter 2017)
Q. a) Differentiate between Forward V/s backward reasoning. 6
b) Describe the hill climbing strategy and explain the search procedure. 7
OR
Q. a) What is heuristic function? Hence explain any two heuristic function. 6
b) Describe and explain best-first search with an example. 7

(Summer 2016)
Q. Describe the general state representation in game playing and search tree with an opponent for tic-tac-
toe game. Explain minimax algorithm for two-play game tree and need of eliminating a
branch of the search tree called "Pruning". 13
OR
a) What are the properties of alpha-beta values to guide the search? 7
b) Explain limitations of game playing procedure. 6

(Winter 2016)
a) Explain minimax search procedure using tic-tac-toe game playing. 7
b) What do you understand by waiting for quiescence? 6
OR
Q. Consider the following game tree and answer the following:

i) Suppose A is maximizing player. What move should he choose? Justify.


ii) What node would not need to be examined using alpha-beta pruning?
iii) Is it a depth-first or breadth-first search? Explain its role in minimax procedure.
iv) Implement the alpha-beta cut off for above tree. 13

(Summer 2017)
Q. a) Write reasons that games appeared to be a good domain in which machine intelligence can be
explore.7
b) Define and explain the state "Waiting for Quiescence". 6
OR
Q. a) What is minimax procedure? Explain with an examples. 6
b) What is iterative deepening? Justify its advantages in game playing procedure.7

(Winter 2017)
Q. a) Explain state space representation in game playing with an example of tic-tac-toe game. 6
b) What are the alpha-beta properties to guide the search for optimism. 7
OR
Q. a) Explain minimax search procedure hence illustrate the strategies of alpha-beta pruning. 8
b) Define and describe "Using Book moves". 5
(Summer 2016)
a) Define and describe:
i) Computable predicates
ii) Well formed formulas. 6
b) Explain the matching process that compares two literals and discovers a set of substitutions that makes
them identical recursively.8
OR
a) Explain resolution in predicate logic by locating pairs of literals that cancel out. 7
b) Convert the following into clause form:
x: [ Roman(x) know(x, Marcus) ]
[[ hate(x, Caesar) (y: (z: hate (y, z)) thinkcrazy(x, y)]] 7

(Winter 2016)
a) Explain the process of augmentation with computable function and predicates. Justify with suitable
example? 7
b) Describe the resolution process. Explain the resolution by refutation with an example. 7
OR
a) Assume following facts:
i) Steve only likes easy courses.
ii) Science courses are hard.
iii) All courses in the basket-weaving department are easy.
iv) BK 301 is a basket-weaving course.
Use the resolution to answer the question, "What course would Steve like"? 7
b) Explain the two sentences are logically equivalent hence describe law of equivalence. 7

(Summer 2017)
Q. a) Define and describe 6
i) Computable predicates
ii) Predicate logic
b) Explain the two sentences are logically equivalent hence describe law of equivalence.8
OR
Q. a) Assume following facts 7
i) Steve only likes easy courses
ii) Science courses are hard
iii) All courses in the basket - weaving department are easy.
iv) BK 301 is a basket - weaving course use the resolution to answer the question, "What course would
Steve like"?
b) Explain the process of natural deduction. 7

(Winter 2017)
Q. a) Explain the process of augmentation with computable function and predicate. Justify with suitable
example. 7
b) Describe and explain resolution process with refutation. 7
OR
Q. a) How simple facts are represented in prepositional logic? Explain with suitable example. 7
b) What do you mean by unification? hi knowledge representation thus explain algorithm of unification
and its importance. 7

(Summer 2016)
a) Define and explain:
i) Knowledge structure
ii) Frames
iii) Property Inheritance. 9
b) What are three important approaches in finding the right structure? 4
OR
a) What are declarative and procedural methods? Give advantages of both the methods. 7
b) Explain reasoning with knowledge in conceptual dependency. 6

(Winter 2016)
a) Explain the process of finding right structure for knowledge representation. 6
b) What are Semantic Nets? Explain binary representation in semantic nets. 7
OR
a) What are the four declarative mechanisms for representing knowledge. 6
b) What are frames? How are knowledge represented in frames? Explain with an example. 7

(Summer 2017)
Q. a) Explain properties of both the ISA and ISPART relations with example. 6
b) What is conceptual dependency explain with an example. 7
OR
Q. a) What are Semantic Nets? illustrate by considering a case. 7
b) What are frames? How are knowledge represented in frames? 6

(Winter 2017)
Q. a) What are declarative and procedural methods? Give advantages of both-methods and justify their
importance. 7
b) How are knowledge represented in semantic nets? 6
OR
Q. a) What are the properties of object? Which are useful for knowledge representation. 6
b) What are four declarative mechanisms for representing knowledge. 7

(Summer 2016)
a) What is semantic grammar? Give principal advantages of semantic grammar. 6
b) Explain relationship among the sentences to be discovered while understanding multiple sentences.
7
OR
a) Explain understanding sentences with syntax, semantics and pragmatics analysis in brief.
6
b) Explain understanding process using Focus in understanding. Consider the following text: "Next,
attach the pump to the platform. The bolts are in a small plastic bag". 7

(Winter 2016)
a) What is case grammar? Explain how syntactic and semantic interpretation can be combined.
6
b) Explain the characteristic features of using focus for understanding sentences. 7
OR
a) Describe the problem in dialogue understanding. Explain how effective dialogue understanding system
helps in problem solving. 7
b) Describe and explain the process of natural language understanding. 6
(Summer 2017)
Q. a) What is natural language understanding? Explain various concepts of understanding. 7
b) Explain dialog understanding thus describe solution with effective dialogue understanding system.6
OR
Q. a) What are the relationship among the sentences to be discovered to understand the multiple sentence.
7
b) Describe and explain syntactic and semantic analysis. 6

(Winter 2017)
Q. a) What do you mean by understanding? What makes understanding hard? 6
b) What is case grammar? How syntactic and semantic can be combined? 7
OR
Q. a) Explain understanding process using "Focus in understanding" consider following text to explain.
"Next, attach the pump to the platform. The bolts are in small plastic bag" 8
b) What is semantic? Hence explain its grammar. 5

S-ar putea să vă placă și