A.I.question Bank

QUESTION BANK III - CSE
Dr. NAVALAR NEDUNCHEZHIYAN COLLEGE OF ENGINEERING

THOLUDUR 606 303, CUDDALORE DIST
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
ANNA UNIVERSITY CHENNAI
YEAR: III / SEM VI
LTPC
3104
UNIT I PROBLEM SOLVING 9
Introduction Agents Problem formulation uninformed search strategies heuristics
informed search strategies constraint satisfaction
UNIT II LOGICAL REASONING 9
Logical agents propositional logic inferences first-order logic inferences in firstorder logic
forward chaining backward chaining unification resolution
UNIT III PLANNING 9
Planning with state-space search partial-order planning planning graphs planning and acting
in the real world
UNIT IV UNCERTAIN KNOWLEDGE AND REASONING 9
Uncertainty review of probability - probabilistic Reasoning Bayesian networks
inferences in Bayesian networks Temporal models Hidden Markov models
UNIT V LEARNING 9
Learning from observation - Inductive learning Decision trees Explanation based
learning Statistical Learning methods - Reinforcement Learning
TOTAL: 45 PERIODS TEXT BOOK:
1. S. Russel and P. Norvig, Artificial Intelligence A Modern Approach, Second
Edition, Pearson Education, 2003.
REFERENCES:
1. David Poole, Alan Mackworth, Randy Goebel, Computational Intelligence : a logical
approach, Oxford University Press, 2004.
2. G. Luger, Artificial Intelligence: Structures and Strategies for complex problem
solving, Fourth Edition, Pearson Education, 2002.
3. J. Nilsson, Artificial Intelligence: A new Synthesis , Elsevier Publishers, 1998.
Mrs.H.ARIFUNISHA ASST.PROFESSOR/CSE
SUBJECT CODE : CS2351

SUBJECT NAME : ARTIFICIAL INTELLIGENCE
UNIT-I PROBLEM SOLVING
PART-A (1 MARKS)
1. What is the term used for describing the judgmental or commonsense part of problem
solving?
A. Heuristic B. Critical C. Value based D.Analytical
2. What stage of the manufacturing process has been described as "the mapping of function onto
form"?
A. Design B. Distribution C. project management D. field service
3. Which kind of planning consists of successive representations of different levels of a plan?
A.hierarchical planning B. non-hierarchical planning C. All of the above D. project
planning
4. What was originally called the "imitation game" by its creator?
A.The Turing Test B. LISP C. The Logic Theorist D. Cybernetics
5. Decision support programs are designed to help managers make:
A. budget projections B. visual presentations C. business decisions D. vacation
schedules
6. PROLOG is an AI programming language which solves problems with a form of symbolic
logic known as predicate calculus. It was developed in 1972 at the University of Marseilles
by a team of specialists. Can you name the person who headed this team?
A. Alain Colmerauer B. Nicklaus Wirth C. Seymour Papert D. John
McCarthy
7. Programming a robot by physically moving it through the trajectory you want it to follow
is called:
A. contact sensing control B. continuous-path control C. robot vision control D. pick-and-
place control
8. To invoke the LISP system, you must enter
A. AI B. LISP C. CL (Common Lisp) D. both b and c
9. DEC advertises that it helped to create "the world's first expert system routinely used in
an industrial environment," called XCON or:
A. PDP-11 B. Rl C. VAX D. MAGNOM
10. Prior to the invention of time sharing, the prevalent method of computer access was:
A. batch processing B. telecommunicat ion C. remote access D. All of the
above
11. Seymour Papert of the MIT AI lab created a programming environment for children
called:
A. BASIC B. LOGO C. MYCIN D. FORTRAN
12. The Strategic Computing Program is a project of the:

A. Defense Advanced Research Projects Agency B. National Science
Foundation
C. Jet Propulsion Laboratory D. All of the above
13. The original LISP machines produced by both LMI and Symbolics were based on
research performed at:
A. CMU B. MIT C. Stanford University D. RAMD
14. In LISP, the addition 3 + 2 is entered as
A. 3 + 2 B. 3 add 2 C. 3 + 2 = D. (+ 3 2)
15. Weak AI is
A. the embodiment of human intellectual capabilities within a computer.
B. a set of computer programs that produce output that would be considered to reflect
intelligence if it were generated by humans.
C. the study of mental faculties through the use of mental models implemented on a
computer.
D. All of the above
16. In LISP, the function assigns the symbol x to y is
A. (setq y x) B. (set y = 'x') C. (setq y = 'x') D. (setq y 'x')
17. In LISP, the function returns t if <object> is a CONS cell and nil otherwise:
A. (cons <object>) B. (consp <object>) C. (eq <object>) D. (cous =
<object>)
18. In a rule-based system, procedural domain knowledge is in the form of:
A. production rules B. rule interpreters C. meta-rules D. control rules
19. If a robot can alter its own trajectory in response to external conditions, it is considered to
be:
A. intelligent B. mobile C. open loop D. non-servo
20. One of the leading American robotics centers is the Robotics Institute located at:
A. CMU B. MIT C. RAND D. SRI
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
A A A A C A B D B A B A B D C D B A A A
PART-B (2 MARKS)
21. Define Artificial in terms of rational thinking. (A.U.Apr/May 2008) (A.U. MAY/JUNE
,2012)
The study of mental faculties through the use of computational models-
Charniak&McDermott.The study of the computations that make it possible to perceive, reason
and act-Winston.
22. Define an agent. (A.U.Nov/Dec 2007) (A.U. MAY/JUNE ,2011)
An agent is anything that can be viewed as perceiving its environment through sensors and
acting upon the environment through effectors.
23. Define rational agent. (A.U.MAY/JUNE 2009), (A.U APR/MAY 2010), (A.U
NOV/DEC 2010)
A rational agent is one that does the right thing. Here right thing is one that will cause agent
to be more successful. That leaves us with the problem of deciding how and when to evaluate
the agents success.
24. Define an Omniscient agent. (A.U APR/MAY 2013)
An omniscient agent knows the actual outcome of its action and can act accordingly; but
omniscience is impossible in reality.
25. Define an Ideal rational agent. (A.U.MAY/JUNE 2009)
For each possible percept sequence, an ideal rational agent should do whatever action is
expected to maximize its performance measure on the basis of the evidence provided by the
percept sequence & whatever built-in knowledge that the agent has.
26. What is AI? (A.U.Apr/May 2008),(A.U MAY/JUNE 2009) (A.U APR/MAY 2013)
Systems that think like humans Systems that think rationally
Systems that act like humans Systems that act rationally
27. Define an agent.

An agent is anything that can be viewed as perceiving its environment through sensors
and acting upon that environment through actuators.
28. What is an agent function?

An agents behavior is described by the agent function that maps any given percept
sequence to an action.
29. Differentiate an agent function and an agent program.
Agent Function Agent Program

An abstract mathematical description A concrete implementation,running on the
agent Architecture.
30. What is a task environment? How it is specified?
Task environments are essentially the "problems" to which rational agents are the
"solutions."
A Task environment is specified using PEAS (Performance, Environment, Actuators, Sensors)
description.
31. Give an example of PEAS description for an automated taxi. (A.U APR/MAY 2013)
32. Give PEAS description for different agent types.
33. List the properties of task environments. (A.U. MAY/JUNE ,2012)

Fully observable vs. partially observable.
Deterministic vs. stochastic.
Episodic vs. sequential
Static vs, dynamic.
Discrete vs. continuous.
Single agent vs. multiagent.
34. What are the four different kinds of agent programs?
Simple reflex agents;
Model-based reflex agents;
Goal-based agents; and
Utility-based agents.
35. Define the problem solving agent.(A.U APR/MAY 2010)

A Problem solving agent is a goal-based agent . It decide what to do by finding sequence of
actions that lead to desirable states. The agent can adopt a goal and aim at satisfying it.
Goal formulation is the first step in problem solving.
36. Write a function for the table driven agent.(A.U APR/ MAY2011)
37. What are utility basedagents?

Goals alone are not really enough to generate high-quality behavior in most environments. For
example, there are many action sequences that will get the taxi to its destination (thereby achieving the
goal) but some are quicker, safer, more reliable, or cheaper than others. A utility function maps a state
(or a sequence of states) onto a real number, which describes the associated degree of happiness.
38. Define the problem solving agent.(A.U APR/MAY 2010)
A Problem solving agent is a goal-based agent . It decide what to do by finding sequence of
actions that lead to desirable states. The agent can adopt a goal and aim at satisfying it.
Goal formulation is the first step in problem solving.
39. Define the terms goal formulation and problem formulation(A.U APR/MAY 2013).
Goal formulation,based on the current situation and the agents performance measure,is the
first step in problem solving.
The agents task is to find out which sequence of actions will get to a goal state.
Problem formulation is the process of deciding what actions and states to consider given a
goal
40. List the steps involved in simple problem solving agent.
Goal formulation
Problem formulation
Search
Search Algorithm
Execution phase
41. Define search and search algorithm.
The process of looking for sequences actions from the current state to reach the goal state is
called search.
The search algorithm takes a problem as input and returns a solution in the form of
action sequence. Once a solution is found,the execution phase consists of carrying out the
recommended action..
42. What are the components of well-defined problems?
The initial state that the agent starts in . The initial state for our agent of example
problem is described by In(Arad)
A Successor Function returns the possible actions available to the agent. Given a
state x,SUCCESSOR-FN(x) returns a set of {action,successor} ordered pairs where each action
is one of the legal actions in state x,and each successor is a state that can be reached from x by
applying the action.
For example,from the state In(Arad),the successor function for the Romania
problem would return
{ [Go(Sibiu),In(Sibiu)],[Go(Timisoara),In(Timisoara)],[Go(Zerind),In(Zerind)] }
Thr goal test determines whether the given state is a goal state.
A path cost function assigns numeric cost to each action. For the Romania problem
the cost of path might be its length in kilometers.
43. Differentiate toy problems and real world problems.
TOY PROBLEMS REAL WORLD PROBLEMS
A toy problem is intended to illustrate A real world problem is one whose
various problem solving methods. It can be solutions people actually care about.
easily used by different researchers to
compare the performance of algorithms.
44. Give examples of real world problems.(A.U APR/ MAY2011) (A.U. MAY/JUNE ,2012)
Touring problems
Travelling Salesperson Problem(TSP)
VLSI layout
Robot navigation
Automatic assembly sequencing
Internet searching
45. List the criteria to measure the performance of different search strategies.
Completeness : Is the algorithm guaranteed to find a solution when there is one?
Optimality : Does the strategy find the optimal solution?
Time complexity : How long does it take to find a solution?
Space complexity : How much memory is needed to perform the search?
46. Differentiate Uninformed Search(Blind search) and Informed Search(Heuristic Search)
strategies.
Uninformed or Blind Search Informed or Heuristic Search
No additional information beyond that More effective
provided in the problem definition Uses problem-specific knowledge
Not effective beyond the definition of the
No information about number of steps or path problem itself.
cost
47. Define Best-first-search. (A.U NOV/DEC 2011)
Best-first search is an instance of the general TREE-SEARCH or GRAPH-SEARCH
algorithm in which a node is selected for expansion based on the evaluation function f(n ).
Traditionally, the node with the lowest evaluation function is selected for expansion.
PART-C (16 MARKS)

48. Write A* algorithm and show how A* algorithm can be used to find minimal-cost overall
path or simply any path as quickly as possible. (A.U.Apr/May 2008) (A.U. MAY/JUNE
,2012)
49. How best-first-search algorithm supports heuristic evaluation function?
(A.U.Apr/May 2008)
50. Explain uniformed search strategies. (A.U.MAY/JUN 2009), (A.U APR/MAY 2010)
,(A.U APR/MAY 2013)
51. Discuss some of the potential problems of using hill climbing search. Give an examples
of the problems cited. (A.U.Apr/May 2008), (A.U APR/ MAY2011)
52. Explain the architecture of different types of agents. (A.U.MAY/JUN 2009),(A.U
APR/MAY 2010), (A.U NOV/DEC 2010) (A.U. MAY/JUNE ,2012)
53. Describe the various properties of the task environment. (A.U.16) (NOV/DEC 2009),
(A.U NOV/DEC 2010)
54. Explain in detail any of the two uniformed search methods with examples.(16)
(A.U.NOV/DEC 2009), (A.U APR/ MAY2011)
55. Give an example and explain the toy and real world problem. (16) (A.U.MAY/JUN
2009)
56. Write short notes on the following Depth First Search, breadth first search, Uniform
cost search, backtracking search. (8) (A.U.Nov/Dec 2007)
57. Write short notes on Iterative deepening depth first search. (8) (A.U.Nov/Dec 2007), (A.U
APR/MAY 2010) (A.U. MAY/JUNE ,2012)
58. Explain in detail about the uniform search strategies. (A.U NOV/DEC 2011)
59. Write note on: (A.U APR/MAY 2013)
a. Avoiding repeated states with an example.
b. Searching with partial information. (A.U NOV/DEC 2011)
UNIT II LOGICAL REASONING

PART-A (1 MARKS)
60. The hardware features of LISP machines generally include:
A. large memory and a high-speed processor B. letter-quality printers and 8-inch
disk drives
C. a mouse and a specialized keyboard D. both (a) and (c)
61. In 1985, the famous chess player David Levy beat a world champion chess program in
four straight games by using orthodox moves that confused the program. What was the
name of the chess program?
A. Kaissa B. CRAY BLITZ C. Golf D. DIGDUG
62. The explanation facility of an expert system may be used to:
A. construct a diagnostic model B. expedite the debugging process
C. explain the system's reasoning process D. both (b) and (c)
63. A process that is repeated, evaluated, and refined is called:
A. diagnostic B. descriptive C. interpretive D. iterative
64. Visual clues that are helpful in computer vision include:

A. colour and motion B. depth and texture C. height and weight D. a and b above
65. In LISP, the function X (x). (2x+l) would be rendered as
A. (lambda (x) (+(*2 x)l)) B. (lambda (x) (+1 (* 2x)
C. (+ lambda (x) 1 (*2x)) D. (* lambda(x) (+2x1)
66. A natural language generation program must decide:
A. what to say B. when to say something C. why it is being used D. both (a) and
(b)
67. Who is considered to be the "father" of artificial intelligence?
A. Fisher Ada B. John McCarthy C. Allen Newell D. Alan Turning
68. In which of the following areas may ICAI programs prove to be useful?
A. educational institutions B. corporations C. department of Defence D. All of
the above
69. A network with named nodes and labeled arcs that can be used to represent certain
natural language grammars to facilitate parsing.
A. Tree Network B. Star Network C. Transition Network D. Complete
Network
70. A series of AI systems developed by Pat Langley to explore the role of heuristics in
scientific discovery.
A. RAMD B. BACON C. MIT D. DU
71. A.M. turing developed a technique for determining whether a computer could or could
not demonstrate the artificial Intelligence,, Presently, this technique is called
A. Turing Test B. Algorithm C. Boolean Algebra D.
Logarithm
72. A Personal Consultant knowledge base contain information in the form of:
A. parameters B. contexts C. production rules D. All of
the above
73. Which approach to speech recognition avoids the problem caused by the variation in
speech patterns among different speakers?
A. Continuous speech recognition B. Isolated word recognition
C. Connected word recognition D.Speaker-dependent recognition
74. Which of the following, is a component of an expert system?
A. inference engine B. knowledge base C. user interface D. All of
the above
75. A computer vision technique that relies on image templates is:
A. edge detection B. binocular vision C. model-based vision D. robot
vision
76. DARPA, the agency that has funded a great deal of American AI research, is part of the
Department of:
A. Defense B. Energy C. Education D. Justice
77. Which of these schools was not among the early leaders in AI research?
A. Dartmouth University B. Harvard University
C. Massachusetts Institute of Technology D. Stanford University
78. A certain Professor at the Stanford University coined the word 'artificial intelligence' in
1956 at a conference held at Dartmouth college. Can you name the Professor?
A. David Levy B. John McCarthy C. Joseph Weizenbaum D. Hans Berliner
79. In LISP, the function (copy-list <list>)
A. returns a new list that is equal to <list> by copying the top-level element of <list>
B. returns the length of <list> C. returns t if <list> is empty. D. All of the
above
118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137
D B D D D A D D D C B A D D D C A B B A
PART-B (2 MARKS)
80. Define Syntax? (A.U. MAY/JUNE ,2010)
Syntax is the arrangement of words. Syntax of a knowledge describes the possible
configurations that can constitute sentences. Syntax of the language describes how to make
sentences.
81. Define Semantics
The semantics of the language defines the truth of each sentence with respect to each
possible world. With this semantics, when a particular configuration exists with in an agent, the
agent believes the corresponding sentence.
82. What is entailment
The relation between sentences is called entailment. The formal definition of is also is true,
if and only if in every model in which entailment is this: is must also be true. Informally
the truth of is true then true or if contained in the truth of.
83. Define Interpretation
Interpretation specifies exactly which objects, relations and functions are reffered to by the
constant predicate, and function symbols.
84. What is propositional logic?(A.U APR/MAY 2010)
It is a way of representing knowledge.
In logic and mathematics, a propositional calculus or logic is a formal system in which
formulae representing propositions can be formed by combining atomic propositions using
logical connectives
Sentences considered in propositional logic are not arbitrary sentences but are the ones that are
either true or false, but not both. This kind of sentences are called propositions.
Example
Some facts in propositional logic:
It is raning. - RAINING
It is sunny - SUNNY
It is windy - WINDY
If it is raining ,then it is not sunny - RAINING -> SUNNY
85. What are the elements of propositional logic? (A.U. MAY/JUNE ,2012)
Simple sentences which are true or false are basic propositions. Larger and more complex
sentences are constructed from basic propositions by combining them with connectives. Thus
propositions and connectives are the basic elements of propositional logic. Though there are
many connectives, we are going to use the following five basic connectives here:
NOT, AND, OR, IF_THEN (or IMPLY), IF_AND_ONLY_IF.
They are also denoted by the symbols:
, , , , , respectively.
86. What is inference?
Inference is deriving new sentences from old.
87. What are modus pones?
There are standard patterns of inference that can be applied to derive chains of
conclusions that lead to the desired goal. These patterns of inference are called inference
rules. The best-known rule is called Modus Pones and is written as follows:
88. What is entailment?

Propositions tell about the notion of truth and it can be applied to logical reasoning.
We can have logical entailment between sentences. This is known as entailment where a
sentence follows logically from another sentence. In mathematical notation we write :
89. Define First order Logic? (A.U APR/ MAY2011)

Whereas propositional logic assumes the world contains facts, first-order logic (like
natural language) assumes the world contains
Objects: people, houses, numbers, colors, baseball games, wars,
Relations: red, round, prime, brother of, bigger than, part of, comes between,
Functions: father of, best friend, one more than, plus,
90. Compare different knowledge representation languages.
91. What are the syntactic elements of First Order Logic? (A.U APR/MAY 2013)
The basic syntactic elements of first-order logic are the symbols that stand for
objects,
relations, and functions. The symbols,come in three kinds:
a) constant symbols, which stand for objects;
b) predicate symbols, which stand for relations;

c) and function symbols, which stand for functions.
We adopt the convention that these symbols will begin with uppercase letters.
Example:
Constant symbols :
Richard and John;
predicate symbols :
Brother, OnHead, Person, King, and Crown;
function symbol :
LeftLeg.
92. What are quantifiers? (A.U. MAY/JUNE ,2012)
There is need to express properties of entire collections of objects,instead of
enumerating the objects by name. Quantifiers let us do this.
FOL contains two standard quantifiers called
a) Universal () and
b) Existential ()
Universal quantification
(x) P(x) : means that P holds for all values of x in the domain associated with that
variable
E.g., (x) dolphin(x) => mammal(x)
Existential quantification
( x)P(x) means that P holds for some value of x in the domain associated with that variable
E.g., ( x) mammal(x) ^ lays-eggs(x)
Permits one to make a statement about some object without naming it
93. Explain Existential quantifiers with an example.
Universal quantification makes statements about every object.
It is possible to make a statement about some object in the universe without naming it,by
using an existential quantifier.
Example
King John has a crown on his head
x Crown(x) ^ OnHead(x,John)
x is pronounced There exists an x such that .. or For some x ..
94. What are nested quantifiers?
Example-2
Everybody loves somebody means that
for every person,there is someone that person loves
x y Loves(x,y)
95. Explain the connection between and
Everyone likes icecream is equivalent

there is no one who does not like ice cream
This can be expressed as :
x Likes(x,IceCream) is equivalent to
Likes(x,IceCream)
96. What is Ontological Engineering?(A.U APR/MAY 2010), (A.U NOV/DEC 2010), (A.U
NOV/DEC 2011)
Ontology refers to organizing every thing in the world into hierarch of categories.
Representing the abastract concepts such as Actions,Time,Physical Objects,and Beliefs is
called Ontological Engineering.
97. How categories are useful in Knowledge representation? (A.U APR/MAY 2013)
CATEGORIES AND OBJECTS
The organization of objects into categories is a vital part of knowledge representation.
Although
interaction with the world takes place at the level of individual objects, much reasoning
takes place at the level of categories.
98. What is taxonomy? (A.U APR/ MAY2011)
Subclass relations organize categories into a taxonomy, or taxonomic
hierarchy.Taxonomies have been used explicitly for centuries in technical fields. For
example, systematicbiology aims to provide a taxonomy of all living and extinct species;
library science has developed a taxonomy of all fields of knowledge, encoded as the Dewey
Decimal system; and tax authorities and other government departments have developed
extensive taxoriornies of occupations and commercial products. Taxonomies are also an
important aspect of general commonsense knowledge.
First-order logic makes it easy to state facts about categories, either by relating objects to
categories or by quantifying over their members:
99. What is physical composition?
100. What are quantifiers? (A.U.NOV/DEC 2009)

There is need to express properties of entire collections of objects, instead of
enumerating the objects by name. Quantifiers let us do this.
FOL contains two standard quantifiers called
c) Universal () and
d) Existential ()
Universal quantification
(x) P(x) : means that P holds for all values of x in the domain associated with that
variable
E.g., (x) dolphin(x) => mammal(x)
Existential quantification
( x)P(x) means that P holds for some value of x in the domain associated with that
variable
E.g., ( x) mammal(x) ^ lays-eggs(x)
Permits one to make a statement about some object without naming it
101. What are the basic Components of propositional logic? (A.U. MAY/JUNE ,2012)
Logical Constants (True, False)
Propositional symbols (P, Q)
Logical 7) , Connectives (^,v,=,
102. Define Modus Pones rule in Propositional logic?
The standard patterns of inference that can be applied to derive chains of conclusions that
lead to the desired goal is said to be Modus Pones rule.
PART-C (16 MARKS)

103. Write four properties a good system for the knowledge representation in particular
domain should posses. (A.U.MAY/JUN 2009)
104. Explain forward chaining and backward chaining in detail for a first order definite
clauses (A.U.MAY/JUN 2009)
105. Distinguish between forward chaining and backward chaining inference. (A.U./JUN
2009), (A.U APR/MAY 2010) (A.U. MAY/JUNE ,2012)
106. Difference between semantic Nets and Partitioned Nets. (A.U.MAY/JUN 2009), (A.U
APR/MAY 2010)
107. Explain the resolution procedure in detail. (A.U.NOV/DEC 2009)
108. Write and explain resolution algorithm for predicate logic. Explain with a suitable
example. (A.U.NOV/DEC 2009)
109. Write and explain unification algorithm. (A.U.NOV/DEC 2009), (A.U APR/ MAY2011)
110. Illustrate the use of first order logic to represent the knowledge. (Nov/Dec 2007), (A.U
NOV/DEC 2011)
111. Explain the forward chaining and backward chaining algorithm with an example.
(A.U.Nov/Dec 2007), (A.U NOV/DEC 2011) ,(A.U APR/MAY 2013)
112. Illustrate the use of predicate logic to represent the knowledge with suitable example.
(Apr/May 2008), (A.U APR/ MAY2011) (A.U. MAY/JUNE ,2012), (A.U APR/MAY 2013)
113. Consider the following sentences:john likes all kinds of food.Apples are food(16)
1.Chicken is food.Anything anyone eats and isnt
2. killed by is food.
3.Bill eats peanuts and is still alive.
4.Sue everything Bill eats.
(i).Translate these sentences in to formulas in predicate logic.
(ii)Prove that john likes peanuts using backward chaining
(iii)Convert the formulas of a part into clause form.
(iv).Prove that john likes peanuts using resolution.( A.U.Apr/May 2008) , (A.U NOV/DEC
2010)
UNIT-III PLANNING
PART-A (1 MARKS)
114. In LISP, the function returns the first element of a list Is
A. set B. car C. first D. second
115. Nils Nilsson headed a team at SRI that created a mobile robot named:
A. Robitics B. Dedalus C. Shakey D. Vax
116. An AI technique that allows computers to understand associations and relationships
between objects and events is called:
A. heuristic processing B. cognitive science C. relative symbolism D. pattern matching
117. The new organization established to implement the Fifth Generation Project is called:
A. ICOT (Institute for New Generation Computer Technology)
B. MITI (Ministry of International Trade and Industry)
C. MCC (Microelectronics and Computer Technology Corporation)
D. SCP (Stategic Computing Program)

118. The field that investigates the mechanics of human intelligence is:
A. history B. cognitive science C. psychology D. sociology
119. A problem is first connected to its proposed solution during the _____ stage.
A. conceptualization B. identification C. formalization D.
implementation.
120. What is the name of the computer program that simulates the thought processes of
human beings?
A. Human logic B. Expert reason C. Expert system D. Personal information
121. What is the name of the computer program that contains the distilled knowledge of an
expert?
A. Data base management system B. Management information System
C. Expert system D. Artificial intelligence
122. Claude Shannon described the operation of electronic switching circuits with a system
of mathematical logic called:
A. LISP B. XLISP C. Boolean algebra D. neural networking
123. A computer program that contains expertise in a particular domain is called an:
A. intelligent planner B. automatic processor C. expert system D. operational
symbolize
124. Ambiguity may be caused by:
A. syntactic ambiguity B. multiple word meanings
C. unclear antecedents D. All of the above
125. Which company offers the LISP machine considered to be "the most powerful
symbolic processor available"?
A. LMI B. Symbolics C. Xerox D. Texas Instruments
126. What of the following is considered to be a pivotal event in the history of AI.
A. 1949, Donald O, The organization of Behaviour,
B. 1950, Computing Machinery and Intelligence.
C. 1956, Dartmouth University Conference Organized by John McCarthy
D. 1961, Computer and Computer Sense.
127. Natural language processing is divided into the two subfields of:
A. symbolic and numeric B. time and motion
C. algorithmic and heuristic D. understanding and generation
128. High-resolution, bit-mapped displays are useful for displaying:
A. clearer characters B. graphics C. more characters D. All of
the above
129. A bidirectional feedback loop links computer modelling with:
A. artificial science B. heuristic processing C. human intelligence D. cognitive
science
130. Which of the following have people traditionally done better than computers?
A. recognizing relative importance B. finding similarities
C. resolving ambiguity D. All of the above
131. In LISP, the function evaluates both <variable> and <object> is
A. set B. setq C. add D. eva
132. Which type of actuator generates a good deal of power but tends to be messy?
A. electric B. hydraulic C. pneumatic D. (B) and (c)
above
133. Research scientists all over the world are taking steps towards building computers
with circuits patterned after the complex inter connections existing among the human
brain's nerve cells. What name is given to such type of computers?
A. Intelligent computers B. Supercomputers C. Neural network computers D.Smart
computers
114 115 116 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133
B C D A B C C C C C D B C D D D D A B
PART-B (2 MARKS)
134. Define Goal cost? (A.U. MAY/JUNE ,2010)
The goal test checks whether the State satisfies the goal of the planning problem.
135. Define Step Cost.
The step cost of each action is 1.Although it would be easy o allow different costs for
different actions.
136. What are the types of planning?
There are two types of planning. they are:
i)Classical planning ii) Non Classical planning
137. Define Conisent plan.
Conisent plan is a plan in which there are no cycles in the ordering constraints and no
conflicts wih the causal links.
138. What are the component of plan and is function in partial order planning?
A set of actions,
A set of ordering constraints
139. What arethe advantage &disadvantage of partial order planning?
Advantage: It decompose the problem
Dis Advantage:does no represent states directly so,it is harder to estimate how far a
partial order plan is from achieving a goal.
140. What is action decomposition?
Each action decomposition reduces a high level action to a partially ordered set of lower
level actions.
141. Define aggregation?
The representation of resources as numerical quantities rather than as named entities
called aggregation.
142. What is the benefit of hierarchical structures?
At each level of hierarchical,a computational task is reduced to a small number of
activites at the next level.
143. Define critical path.

It is the path whose total duration is longes, the path is critical because it determines
the duration of the entire plan shortening other paths doesnot shorten the plan as a whole.
144. What are the approaches to estimate the cost of a conjuction of goals?
There are 3:1) level sum
2)set level
3)max level.
PART-C (16 MARKS)

145. Explain the concept of planning graphs in providing better heuristic estimates with
example.
146. Explain the concept of state space search using examples.
147. Explain Forward state space search.
148. Explain backward state space search.
149. Write and explain of planning graphs.
150. Explain planning & acting in the real world.
UNIT-IV UNCERTAINTY ACKNOWLEDGE AND REASONNING
PART-A (1 MARKS)
151. In LISP, the function (endp <list>)
A. returns a new list that is equal to <list> by copying the top-level element of <list>
B. returns the length of <list> C. returns t if <list> is empty. D. All of the
above
152. In LISP, which of the following function assigns the value 10 to the symbol a?
A. (setq a 10) B. (a = b) where b = 10 C. (a = 10) (d) (setq 10 a) D. None
of the above
153. In LISP, the atom that stands for "False" is
A. t B. nil C. y D. time
154. The expert system developed at MIT to solve mathematical problems is known as:
A. RAND B. ISIS C. MACSYMA D. MOLGEN
155. Which approach to speech recognition avoids the problem caused by the differences in
the way words are pronounced according to context?
A. continuous speech recognition B. connected word recognition
C. isolated word recognition D. speaker-dependent recognition
156. A KES knowledge base contains information in the form of:
A. associations B.actions C.schema D.All of the above
157. In AI programming, a list may contain:
A. cells B. fields C. pointers D. All of the above
158. In LISP, the function (minusp (-20 4 8 8 1) returns
A. T B. F C. NIL D. -20
159. Special programs that assist programmers are called:
A.heuristic processors B.symbolic programmers
C.intelligent programming tools D.program recognizers
160. If the English Philosopher Thomas Hobbes could be called 'grandfather' of artificial
intelligence, then who could be called its father?
A. A.M. Turning B. John McCarthy C. Allen Newell D. Herbert Simon
161. In LISP, the function returns t if <integer> is even and nil otherwise:
A. (evenp <integer>) B. (even <integer>) C. (numeven <integer>) D. (numnevenp
<integer>)
162. Which of the following is an advantage of using an expert system development tool?
A. imposed structure B. knowledge engineering assistance
C. rapid prototyping D. All of the above
163. An AI system developed by Daniel Bobrow to read and solve algebra word problems
A. SHRDLU B. SIMD C. BACON D. STUDENT
164. The "Turing Machine" showed that you could use a/an _____ system to program any
algorithmic task.
A. binary B. electro-chemical C. recursive D. semantic
165. MCC is investigating the improvement of the relationship between people and
computers through a technology called:
A. computer-aided design B. human factors C. parallel processing D. All of
the above
166. The first widely-used commercial form of Artificial Intelligence (Al) is being used in
many popular products like microwave ovens, automobiles and plug in circuit boards
for desktop PCs. It allows machines to handle vague information with a deftness that
mimics human intuition. What is the name of this AI?
A. Boolean logic B. Human logic C. Fuzzy logic D. Functional
logic
167. In his landmark book Cybernetics, Norbert Wiener suggested a way of modeling
scientific phenomena using not energy, but:
A. mathematics B. intelligence C. information D. history
168. Input segments of AI programming contain(s)
A. sound B. smell C. touch D. All of the above
169. The applications in the Strategic Computing Program include:
A. battle management B. autonomous systems C. pilot's associate D. All of the
above
170. In LISP, the function evaluates <object> and assigns this value to the unevaluated
<sconst>.
A. (constant <sconst> <object>) B. (defconstant <sconst> <object>)
C. (eva <sconst> <object>) D. (eva <object> <sconst>)
230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 2
C A B C C D D A C A A D D A B C C D D B
PART-B (2 MARKS)
171. Define decision theory .
Decision theory=probability theory+utility theory
172. What is random sampling?
This is a process for Bayesian networks generates events from a network that has no
evidence associated with it.
173. Define rejection sampling.
It is for producting samples from a hard to sample from a hard to samples distribution
given an easy to sample distribution.
174. Define clustering
It is a join individual nodes of the network to form clusters nodes in such a way that the
resulting network is a polytree.
175. What is likelihood weighting?

It generates only events that are consistent with the evidence.it generates consistent
probability estimates.
176. What is product rule?
P(a^b)=p(a/b) p(b).
177. What are the two ways to understand the semantics of Bayesian networks?
1.Representing the full joint distribution.
2.Method for constructing Bayesian network.
178. Construct a parse tree for the sentence Every agent smells a Wumpus
179. What are the models regarding burglary?
Diagnostic model, causal model

180. What are the types of random variables?
1)Boolean random variables 2)discrete random variables 3)continuous random
variables
PART-C (16 MARKS)
181. Explainclustering algorithm.
182. Write short notes on probabilistic reasoning.
183. Discuss in detail the hidden markov model.
184. Discuss temporal model.
185. Explain inferences in Bayesian networks
186. Explain uncerainty
187. Explain Bayesian networks.
UNIT V LEARNING
PART-A (1 MARKS)
188. LISP machines also are known as:
A. AI workstations B. time-sharing terminals C. super mini computers D. All of
the above
189. Natural language processing can be divided into the two subfields of:
A. context and expectations B. generation and understanding
C. semantics of pragmatics D. recognition and synthesis
190. How many ALU(s) is/are control by one control unit is SIMD (single instruction stream,
multiple data stream) architecture?
A. one or more ALUs B. One ALU C. Only two ALU . D.
Impossible to say
191. Which of the following function returns t if the object is a number in LISP?
A. (number <object>) B. (numberp <object>) C.(numericp<object>)
D.(numeric <object>)
192. Which of the following have computers traditionally done better than people?
A. storing information B. responding flexibly C. computing numerically D. both
(a) and (c)
193. The characteristics of the computer system capable of thinking, reasoning and learning is
known is
A. machine intelligence B. human intelligence C. artificial intelligence D.
virtual intelligence
194. What part of the manufacturing process relate to each stage of the process and to the
process as a whole?
A. field service B. design C. distribution D. project management
195. The area of AI that investigates methods of facilitating communication between people
and computers is:
A. natural language processing B. symbolic processing C. decision support
D. robotics
196. In the 16th century, a Czech rabbi reportedly created a living clay man whose name has
become a synonym for an artificial human. The clay man's name was:
A. Frankenstein B. Golem C. Paracelsus D. Hal
197. For speech understanding systems to gain widespread acceptance in office automation,
they must feature:
A. speaker independence B. speaker dependence C. isolated word recognition D.All
of the above
198. In LISP, the function returns the list that results after the first element is removed (the
rest f the list), is
A. car B. last C. cons D. cdr
199. Output segments of AI programming contain(s)
A. printed language and synthesized speech B. Manipulation of physical
object
C. Locomotion D. All of the above
200. LISP was created by:
A. John McCarthy B. Marvin Minsky C. Alan Turing D. Allen Newell and
Herbert Simon
201. Expert Ease was developed under the direction of:
A. John McCarthy B. Donald Michie C. Lofti Zadeh D. Alan Turing
202. An AI system developed by Terry A. Winograd to permit an interactive dialogue about a
domain he called blocks-world.
A. SHRDLU B. SIMD C. BACON D. STUDENT
203. MLMenu, a natural language interface for the TI Explorer, is similar to:
A. Ethernet B. NaturalLink C. PROLOG D. the Personal
Consultant
204. How many control unit(s) is/are available in SISD (single data stream, single data stream)
architecture?
A. one B. two C. more than one D. none

205. Strong AI is
A. the embodiment of human intellectual capabilities within a computer.
B. a set of computer programs that produce output that would be considered to reflect
intelligence if it were generated by humans.
C. the study of mental faculties through the use of mental models implemented on a
computer.
D. All of the above
206. The traditional way to exit and LISP system is to enter
A. quit B. exit C. bye D. ok
207. In which of the following situations might a blind search be acceptable?
A. real-life situation B. complex game C. small search space D. All of the above
172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191
A B A B D C D A B A D D A B A B A A B C
PART-B (2 MARKS)
208. What is machine learning? (A.U.MAY/JUN 2009)
Machine learning
Like human learning from past experiences, a computer does not have
experiences.
A computer system learns from data, which represent some past experiences of an
application domain.
Objective of machine learning: learn a target function that can be used to predict the
values of a discrete class attribute, e.g., approve or not-approved, and high-risk or
low risk.
The task is commonly called: Supervised learning, classification, or inductive
learning
209. Define the term utility? (A.U.NOV/DEC 2009)
The term utility is used in the sense of "the quality of being useful. utility of a state is relative
to the agents, whose preferences the utility function is supposed to represent.
210. What is the need for probability theory in uncertainty? (A.U.MAY/JUNE 2009)
Probability provides the way of summarizing the uncertainty that comes from our laziness and
ignorance. Probability statements do not have quite the same kind of semantics known as
evidences.
211. What is the need for utility theory in uncertainty? (A.U.MAY/JUN 2009)
Utility theory says that every state has a degree of usefulness, or utility to in agent, and that
the agent will prefer states with higher utility. The use utility theory to represent and reason
with preferences.
212. Define conditional probability?
Once the agents has obtained some evidence concerning the previously unknown
propositions making up the domain conditional or posterior probabilities with the notation
p(A/B) is used. This is important that p(A/B) can only be used when all be is known.
213. Define probability distribution: (A.U. MAY/JUNE ,2012)
If we want to have probabilities of all the possible values of a random variable probability
distribution is used.
Eg.
P(weather) = (0.7,0.2,0.08,0.02). This type of notations simplifies many equations.
214. Define joint probability distribution
This completely specifies an agent's probability assignments to all propositions in the
domain.The joint probability distribution p(x1,x2,--------xn) assigns probabilities to all possible
atomic events;where X1,X2------Xn =variables.
215. Give the Baye's rule equation(A.U APR/ MAY2011)
W.K.T P(A ^ B) = P(A/B) P(B) -------------------------- 1
P(A ^ B) = P(B/A) P(A) -------------------------- 2
DIVIDING BYE P(A) ; WE GET
P(B/A) = P(A/B) P(B)
-------------------- P(A)
216. Define Supervised learning .
Supervised learning is a machine learning technique for learning a function from training
data. The training data consist of pairs of input objects (typically vectors), and desired
outputs. The output of the function can be a continuous value (called regression), or can
predict a class label of the input object (called classification). The task of the supervised
learner is to predict the value of the function for any valid input object after having seen a
number of training examples (i.e. pairs of input and target output). To achieve this, the learner
has to generalize from the presented data to unseen situations in a "reasonable" way.
Another term for supervised learning is classification. Classifier performance depend greatly
on the characteristics of the data to be classified. There is no single classifier that works best
on all given problems. Determining a suitable classifier for a given problem is however still
more an art than a science. The most widely used classifiers are the Neural Network (Multi-
layer Perceptron), Support Vector Machines, k-Nearest Neighbors, Gaussian Mixture
Model, Gaussian, Naive Bayes, Decision Tree and RBF classifiers.
217. Compare Supervised learning and unsupervised learning..
Supervised vs. unsupervised Learning
Supervised learning:
classification is seen as supervised learning from examples.
o Supervision: The data (observations, measurements, etc.) are labeled with pre-
defined classes. It is like that a teacher gives the classes (supervision).
o Test data are classified into these classes too.
Unsupervised learning (clustering)
o Class labels of the data are unknown
o Given a set of data, the task is to establish the existence of classes or clusters
o in the data
Explain the steps in Supervised learning process.
Supervised learning process: two steps
Learning (training): Learn a model using the training data
Testing: Test the model using unseen test data to assess the model accuracy
Number of correct classifica tions
Accuracy ,
Total number of test cases
218. What is a decision tree? (A.U. MAY/JUNE ,2012)

A decision tree takes as input an object or situation described by a set of attributes
and returns a decision the predicted output value for the input.
A decision tree reaches its decision by performing a sequence of tests.
Example : HOW TO manuals (for car repair)
219. Give an example of decision tree induction from examples. (A.U APR/MAY 2013)
An example for a Boolean decision tree consists of a vector of' input attributes, X,
and a single Boolean output value y. A set of examples (X1,Y1) . . . , (X2, y2) is
shown in Figure 18.3. The positive examples are the ones in which the goal Will
Wait is true (XI, X3, . . .); the negative examples are the ones in which it is false
(X2, X5, . . .). The complete set of examples is called the training set.
220. How the performance of learning algorithm is assessed?

Assessing the performance of the learning algorithm
A learning algorithm is good if it produces hypotheses that do a good job of
predicting the classifications of unseen examples.
Obviously, a prediction is good if it turns out to be true, so we can assess the
quality of a
hypothesis by checking its predictions against the correct classification once we
know it. We
do this on a set of examples known as the test set. If we train on all our available
examples, then we will have to go out and get some more to test on, so often it is
more convenient to adopt the following methodology:
1. Collect a large set of examples.

2. Divide it into two disjoint sets: the training set and the test set.
3. Apply the learning algorithm to the training set, generating a hypothesis h.
4. Measure the percentage of examples in the test set that are correctly classified by
h.
5. Repeat steps 2 to 4 for different sizes of training sets and different randomly
selected training sets of each size.
The result of this procedure is a set of data that can be processed to give the average
prediction quality as a function of the size of the training set. This function can be
plotted on a graph, giving what is called the learning curve for the algorithm on the
particular domain.
221. What are learning curves?
.The average predicting quality of an algorithm can be plotted as a function of the size of
the training set as shown in Fig 18.7. This is called a learning curve.
It can be noticed that, as the training set grows, the prediction quality increases. (For this
reason, such curves are also called happy graphs.) This is a good sign that there is indeed
some pattern in the data and the learning algorithm is picking it up.
222. What is Ensemble Learning? (A.U APR/ MAY2011), (A.U APR/MAY 2013)
Ensemble means a group producing a single effect.
Ensemble learning is the process by which multiple models, such as classifiers or experts,
are strategically generated and combined to solve a particular computational intelligence
problem. Ensemble learning is primarily used to improve the (classification, prediction,
function approximation, etc.) performance of a model, or reduce the likelihood of an
unfortunate selection of a poor one.
Recently in the area of machine learning the concept of combining classifiers is proposed as a
new direction for the improvement of the performance of individual classifiers. These
classifiers could be based on a variety of classification methodologies, and could achieve
different rate of correctly classified individuals. The goal of classification result integration
algorithms is to generate more certain, precise and accurate system results.
Ensemble Classification
Aggregation of predictions of multiple classifiers with the goal of improving accuracy.
223. What is Explanation based Learning?(A.U APR/MAY 2010), (A.U NOV/DEC 2010)
Explanation based learning is a method for extracting general rules from individual
observations. The basic idea behind EBL is first construct an explanation of the observation
using prior knowledge.
EXAMPLE A caveman toasting a lizard on the end of a pointed stick:
In the case of lizard toasting,the cavemen generalize by explaining the success of the
pointed stick : It supports the lizard while keeping the hands away from the fire. From this
explanation,they infer a general rule : that any long,rigid,sharp object can be used to toast
small,soft-bodies edibles.
The general rules follows logically from the background knowledge possessed by the
cavemen.
224. What is Relevance Based Learning? (A.U. MAY/JUNE ,2012)
Relevance-based learning (RBL) uses prior knowledge in the form of determinations
to identify the relevant attributes, thereby generating a reduced hypothesis space and speeding
up learning. RBL also allows deductive generalizations from single examples.
EXAMPLE
Consider the case of the traveler to Brazil meeting her first Brazilian. On hearing him speak
Portugese,she immediately conclude that Brazilians speak Portugese. The inferen ce was
based on her Background Knowledge,namely,that people in a given country speak the same
language. The same is expressed in First Order Predicate Logic as follows :
-
(A)
"If x and y have the same nationality n and x speaks language 1, then y also speaks it."
Sentences such as (A) express a strict form of relevance: given nationality, language is fully
determined. (Put another way: language is a function of nationality.) These sentences are
called functional dependencies or determinations. They occur so commonly in certain kind
of applications (e.g., defining database designs)
225. Explain with a diagram the Cumulative Learning Process.
The use of prior knowledge in learning leads to a picture of cumulative learning, in which
learning agents improve their learning ability as they acquire more knowledge.
The modem approach is to design agents that already know something and are trying to learn
some more The general idea is shown schematically in Figure 19.6.
226. What is inductive logic programming?(A.U APR/MAY 2010)
Inductive Logic Programming(ILP) combines inductive methods with the power of
First Order Representation. The object of Inductive learning program is to come up with a
set of sentences for the Hypotheses such that entailment constraint is satisfied.
EXAMPLE
The family tree example:
The descriptions
Father(Philips,Charles)
Father(Philips,Anne)
Parent(x,y) [Mother(x,y) v Father(x,y)]
Grandparent(x,y) [z Parent(x,z) ^ Parent(z,y)]
227. What is Bayesian Learning?

Bayesian learning simply calculates the probability of each hypothesis,given the data,and
makes predictions on that basis. That is,the predictions are made by using all the
hypotheses,weighted by their probabilities,rather than using just ahigh best hypothesis. In
this way learning is reduced to probabilistic inference.
228. What is reinforcement learning? (A.U NOV/DEC 2011)
Reinforcement learning refers to a class of problems in machine learning which postulate an
agent exploring an environment in which the agent perceives its current state and takes
actions. The environment, in return, provide a a reward (which can be positive or negative).
Reinforcement learning algorithms attempt to find a policy for maximising cumulative reward
for the agent over the curse of the problem (Wikipedia).
Examples
Playing chess:
Reward comes at end of game
Ping-pong:
Reward on each point scored
Animals:
Hunger and pain - negative reward
food intake positive reward
229. What is passive reinforcement learning? (A.U NOV/DEC 2011)
Passive Reinforcement Learning
Assume fully observable environment.
Passive learning:
o Policy is fixed (behavior does not change).
o The agent learns how good each state is.
Similar to policy evaluation, but:
o Transition function and reward function or unknown.
Why is it useful?
o For future policy revisions.
230. What is active reinforcement learning? (A.U NOV/DEC 2011)
Active Reinforcement Learning
Using passive reinforcement learning, utilities of states and transition probabilities

are learned.
Those utilities and transitions can be plugged into Bellman equations.
Problem?
o Bellman equations give optimal solutions given correct utility and transition
functions.
o Passive reinforcement learning produces approximate estimates of those functions.
PART-C (16 MARKS)
231. What characteristic feature of Expert system?
232. How is the learning process in a decision tree? (A.U.MAY/JUN 2009), (A.U NOV/DEC
2010)
233. Write importance of Expert System.
234. Write a short note on conceptual dependency.
235. Write a short note on EM Algorithm. (A.U NOV/DEC 2011) (A.U. MAY/JUNE ,2012)
236. Explain multilayer feed-forward networks. (A.U.MAY/JUN 2009), (A.U NOV/DEC 2010)
237. Write a short on:
Non monotonic reasoning. (A.U.MAY/JUN 2009) , (A.U.Apr/May 2008)
Dumpster-Shafer Theory
238. Construct partitioned semantic net for the following:
Every batter hit a ball.
All the batters like the pitcher.
239. Explain the application of certainty factor and probability theory of representation of
uncertain knowledge. (A.U.MAY/JUN 2009)
240. Discuss on learning with hidden variables. (A.U.NOV/DEC 2007)
241. What is fuzzy logic? How it is used for decision making under uncertainty?
242. Explain how Bayesian statistics provides reasoning under various kinds of uncertainty.
(A.U.MAY/JUN 2009), (A.U.Apr/May 2008)
243. Discuss the following:
244. Passive Reinforcement Learning(A.U APR/ MAY2011), (A.U NOV/DEC 2011) (A.U.
MAY/JUNE ,2012) Active Reinforcement Learning (A.U.NOV/DEC 2009), (A.U
APR/MAY 2010)
245. Elaborate upon inductive logic programming. (A.U.NOV/DEC 2009)
246. (i) Describe about decision tree learning. (A.U APR/ MAY2011) (A.U APR/MAY 2013)
(ii) Describe the explanation based learning. (A.U.NOV/DEC 2007), (A.U APR/MAY
2010)

A.I.question Bank

Transféré par

Informations du document

Description originale:

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

A.I.question Bank

Transféré par

Droits d'auteur :

Formats disponibles

QUESTION BANK III - CSE

Dr. NAVALAR NEDUNCHEZHIYAN COLLEGE OF ENGINEERING

SUBJECT CODE : CS2351

12. The Strategic Computing Program is a project of the:

Systems that think like humans Systems that think rationally

Systems that act like humans Systems that act rationally

27. Define an agent.

28. What is an agent function?

29. Differentiate an agent function and an agent program.

Agent Function Agent Program

32. Give PEAS description for different agent types.

33. List the properties of task environments. (A.U. MAY/JUNE ,2012)

35. Define the problem solving agent.(A.U APR/MAY 2010)

37. What are utility basedagents?

PART-C (16 MARKS)

UNIT II LOGICAL REASONING

64. Visual clues that are helpful in computer vision include:

88. What is entailment?

89. Define First order Logic? (A.U APR/ MAY2011)

b) predicate symbols, which stand for relations;

Everyone likes icecream is equivalent

99. What is physical composition?

100. What are quantifiers? (A.U.NOV/DEC 2009)

PART-C (16 MARKS)

D. SCP (Stategic Computing Program)

143. Define critical path.

PART-C (16 MARKS)

175. What is likelihood weighting?

179. What are the models regarding burglary?

Diagnostic model, causal model

A. one B. two C. more than one D. none

218. What is a decision tree? (A.U. MAY/JUNE ,2012)

220. How the performance of learning algorithm is assessed?

1. Collect a large set of examples.

227. What is Bayesian Learning?

Using passive reinforcement learning, utilities of states and transition probabilities

Vous aimerez peut-être aussi