Professional Documents
Culture Documents
(c) LISP
(d) Perl
Answers
(e)
1.
Answer : (c)
Reason : Because AI is to make things work automatically through machine without using human effort.
Machine will give the result with just giving input from human. That means the system or machine
will act as per the requirement.
2.
Answer : (d)
Reason : Because Perl is used as a script language, and not of much use for AI practice. All others are
used to generate an artificial program to a great extent.
3.
Answer : (d)
Reason : Because state space is mostly concerned with a problem, when you try to solve a problem, we
have to design a mathematical structure to the problem which can only be through variables and
parameters. Ex. You have given a 4-gallon jug and another 3gallon jugs. Neither has measuring
marker on it. You have to fill the jugs with water .How can you get exactly 2 gallons of water in to
4gallons.Here the state space can defined as set of ordered pairs integers(x,y),such that
x=0,1,2,3 or 4 and y=0,1,2 or 3;X represents the number of gallons in 4galoon jug and y
represents quantity of water in the 3-gallon jug.
4.
Answer : (c)
Reason : When you are trying to solve a problem, you should design how to get a step by step solution
with constraints condition to your problem, e.g Chess board problem.
5.
Answer : (a)
Reason : Depth-First Search takes less memory since only the nodes on the current path are stored, but in
Breadth First Search, all of the tree that has generated must be stored.
6.
Answer : (e)
Reason : In a heuristic approach we discover certain idea and use heuristic functions to search for a goal
and predicates to compare nodes.
7.
Answer : (c)
Reason : Because Best-first-search is giving the idea of optimization and quick choose of path, and all
these characteristic lies in A* algorithm.
8.
Answer : (b)
Reason : We use Heuristic approach as it will find out brute force computation ,looking at hundreds of
thousands of positions. e.g Chess competition between Human and AI based Computer.
9.
Answer : (a)
Reason : We represent the statement in mathematical logic taking x as Dog and which has tail. We can
not represent two variable x, y for the same object Dog which has tail. The symbol represent
all.
10.
Answer : (a)
Reason : There is nothing to go for Representational verification, the verification comes under
Representational adequacy.
(b) iff
(c) or
(d) not
(e) either a
(a) Inference
(b) Search
(c)
Planning
(d) Conclusion
(e) Dynamic search.
15.A plan that describe how to take actions in levels of increasing refinement and specificity is
(a) Problem solving
(b) Planning
(c) Non-hierarchical plan
(d) Hierarchical plan (e) Inheritance.
16.A constructive approach in which no commitment is made unless it is necessary to do so, is
(a) Least commitment approach
(c) Nonlinear planning
(e) Problem based planning.
17.Partial order planning involves
Answers
11.
Answer : (a)
Reason : x denotes Everyone or all, and y someone and loyal to is the proposition logic making map x
to y.
12.
Answer : (d)
Reason : not is coming under propositional logic and is therefore not a connective.
13.
Answer : (d)
Reason : Quantity structure is not a FOL structure while all other are.
14.
Answer : (d)
Reason : Conclusion is a statement to Goal-based agent, but is not considered as Goal-based agent.
15.
Answer : (d)
Reason : A plan that describes how to take actions in levels of increasing refinement and specificity is
Hierarchical (e.g., "Do something" becomes the more specific "Go to work," "Do work," "Go
home.") Most plans are hierarchical in nature.
16.
Answer : (a)
Reason : Because we are not sure about the outcome.
17.
Answer : (a)
Reason : Partial order planning involves searching over the space of possible plans, rather than searching
over possible situations. The idea is to construct a plan piece-by-piece. There are two kinds of
steps we can take in constructing a plan: add an operator (action), or add an ordering constraint
between operators. The name "partial order planning" comes from the fact that until we add the
ordering constraints, we don't specify the order in which actions are taken. This (sometimes)
allows a partial order planning to avoid lots of backtracking that would slow down a state-space
planner.
18.
Answer : (a)
Reason : Utility theory to represent and reason with preference. Preference is expressed by utilities.
Utilities are combined with probabilities in the general theory of rational decisions called decision
theory. Decision theory, which combines probability theory with utility theory, provides a formal
and complete frame work for decisions (economic or otherwise) made under uncertainty-that is,
in case where probabilistic descriptions appropriately capture the decision-makers environment.
19.
Answer : (c)
Reason : The Wumpus world is a grid of squares surrounded by walls, where each square can contain
agents and objects. The agent (you) always starts in the lower left corner, a square that will be
labeled [1, 1]. The agent's task is to find the gold, return to [1, 1] and climb out of the cave. So
uncertainty is there as the agent gives partial and local information only. Global variable are not
goal specific problem solving.
20.
Answer : (a)
Reason : To specify a Hybrid network, we have to specify two new kinds of distributions: the conditional
distribution for continuous variables given discrete or continuous parents, and the conditional
distribution for a discrete variable given continuous parents.
21.Which is not a desirable property of a logical rule-based system?
(a)
Locality
(b)
Attachment
Detachment
(d) Truth-Functionality
(e) Global attribute.
22.How is Fuzzy Logic different from conventional control methods?
(a) IF and THEN Approach
(c) WHILE Approach
(e) Else If approach.
23.In an Unsupervised learning
Specific output values are given
Specific output values are not given
No specific Inputs are given
Both inputs and outputs are given
Neither inputs nor outputs are given.
(c)
Answers
21.
Answer : (b)
Reason : Locality: In logical systems, whenever we have a rule of the form A => B, we can conclude B,
given evidence A, without worrying about any other rules. Detachment: Once a logical proof is
found for a proposition B, the proposition can be used regardless of how it was derived .That is, it
can be detachment from its justification. Truth-functionality: In logic, the truth of complex
sentences can be computed from the truth of the components. But there are no Attachment
properties lies in a Rule-based system. Global attribute defines a particular problem space as
user specific and changes according to users plan to problem.
22.
Answer : (a)
Reason : FL incorporates a simple, rule-based IF X AND Y THEN Z approach to a solving control problem
rather than attempting to model a system mathematically. The FL model is empirically-based,
relying on an operator's experience rather than their technical understanding of the system. For
example, rather than dealing with temperature control in terms such as "SP =500F", "T <1000F",
or "210C <TEMP <220C", terms like "IF (process is too cool) AND (process is getting colder)
THEN (add heat to the process)" or "IF (process is too hot) AND (process is heating rapidly)
THEN (cool the process quickly)" are used. These terms are imprecise and yet very descriptive
of what must actually happen. Consider what you do in the shower if the temperature is too cold:
you will make the water comfortable very quickly with little trouble. FL is capable of mimicking this
type of behavior but at very high rate.
23.
Answer : (b)
Reason : The problem of unsupervised learning involves learning patterns in the input when no specific out
put values are supplied. We can not expect the specific output to test your result. Here the agent
does not know what to do, as he is not aware of the fact what propose system will come out. We
can say an ambiguous unproposed situation.
24.
Answer : (a)
Reason : Inductive learning involves finding a consistent hypothesis that agrees with examples. The
difficulty of the task depends on the chosen representation.
25.
Answer : (b)
Reason : Computational learning theory analyzes the sample complexity and computational complexity of
inductive learning. There is a trade off between the expressiveness of the hypothesis language
and the ease of learning.
26.
Answer : (c)
Reason : Consistent hypothesis go with examples, If the hypothesis says it should be negative but infact it
is positive, it is false negative. If a hypothesis says it should be positive, but in fact it is negative,
it is false positive. In a specialized hypothesis we need to have certain restrict or special
conditions.
27.
Answer : (b)
Reason : Neural networks parameters can be learned from noisy data and they have been used for
thousands of applications, so it varies from problem to problem and thus use nonlinear functions.
28.
Answer : (a)
Reason : A perceptron is a Feed-forward neural network with no hidden units that can be represent only
linear separable functions. If the data are linearly separable, a simple weight updated rule can be
used to fit the data exactly.
29.
Answer : (a)
Reason : Not all formal languages are context-free a well-known counterexample is
This particular language can be generated by a parsing expression grammar, which is a relatively
new formalism that is particularly well-suited to programming languages.
30.
Answer : (e)
Reason : The union and concatenation of two context-free languages is context-free; but intersection need
not be.
31 What is a Cybernetics?
. (a) Study of communication between two machines
(b) Study of communication between human and machine
(c) Study of communication between two humans
(d) Study of Boolean values
(e) Study of communication between logic circuits.
39 Knowledge may be
. I. Declarative.
II. Procedural.
III. Non-procedural.
(a) Only (I) above
(b) Only (II) above
(c) Only (III) above
(d) Both (I) and (II) above
(e) Both (II) and (III) above.
40 Idempotency law is
. I. P P = P.
II. P P = P.
III. P + P = P.
(a)
(b)
(c)
(d)
(e)
31.
32.
33.
34.
Reaso
35.
Reaso
36.
Reaso
37.
Reaso
38.
Answer : (b)
Cybernetics is Study of communication between human and machine
Answer : (c)
The scientific goal of artificial intelligence is to explain various sorts of intelligence
Answer : (a)
An Algorithm is complete if It terminates with a solution when one exists.
Answer : (b)
Regarding BFS-The entire tree so far been generated must be stored in BFS.
Answer : (e)
Heuristic function is a function that maps from problem state descriptions to
measures of desirability
Answer : (c)
The traveling salesman problem involves n cities with paths connecting the
cities. The time
taken for traversing through all the cities, without knowing in
advance the length of a minimum tour, is O(n!)
Answer : (a)
The problem space of means-end analysis has an initial state and one or more
goal states
Answer : (b)
An algorithm A is admissible if It is guaranteed to return an optimal solution when
one exists.
39.
Answer : (d)
Knowledge may be declarative and procedural
40. Answer : (a)
Reaso Idempotency Law is P V P = P
41 Which of the following is true related to Satisfiable property?
. (a) A statement is satisfiable if there is some interpretation for which it is false
(b) A statement is satisfiable if there is some interpretation for which it is true
(c) A statement is satisfiable if there is no interpretation for which it is true
(d) A statement is satisfiable if there is no interpretation for which it is false
(e) None of the above.
42 Two literals are complementary if
. (a) They are equal
(b) They are identical and of equal sign
(c) They are identical but of opposite sign
(d) They are unequal but of equal sign
(e) They are unequal but of opposite sign.
43 Consider a good system for the representation of knowledge in a particular domain.
. What property should it possess?
(a) Representational Adequacy
(b) Inferential Adequacy
(c) Inferential Efficiency
(d) Acquisitional Efficiency
(e) All the above.
44 What is Transposition rule?
. (a) From P Q, infer ~Q P
(b) From P Q, infer Q ~P
(c) From P Q, infer Q P
(d) From P Q, infer ~Q ~P
(e) None of the above.
45 Third component of a planning system is to
. (a) Detect when a solution has been found
(b) Detect when solution will be found
(c) Detect whether solution exists or not
(d) Detect whether multiple solutions exist
(e) Detect a solutionless system.
46 Which of the following is true in Statistical reasoning?
. (a) The representation is extended to allow some kind of numeric measure of
certainty to be associated with each statement
(b) The representation is extended to allow TRUE or FALSE to be associated with
each statement
(c) The representation is extended to allow some kind of numeric measure of
certainty to be associated common to all statements
(d) The representation is extended to allow TRUE or FALSE to be associated
common to all statements
(e) None of the above.
Answers
41.
42.
43.
44.
45.
Answer : (b)
Satisfiable property is a statement is satisfiable if there is some interpretation for
which it is true.
Answer : (c)
Two literals are complementary if They are identical but of opposite sign.
Answer : (e)
Consider a good system for the representation of knowledge in a particular
domain. The properties should be Representational Adequacy,Inferential
Adequacy,Inferential Efficiency and Acquisitional Efficiency
Answer : (d)
Transposition rule- From P Q, infer ~Q ~P
Answer : (a)
Third component of a planning system is to detect when a solution has been
found.
46.
47.
48.
49.
Reaso
50.
Reaso
Answer : (a)
Statistical reasoning is the representation is extended to allow some kind of
numeric measure of certainty to be associated with each statement.
Answer : (a)
In default logic, we allow inference rules of the form:(A : B) / C
Answer : (a)
In Bayes theorem, P(Hi|E) is the probability that hypotheses Hi is true given
evidence E.
Answer : (d)
Default reasoning is another type of non-monotonic reasoning
Answer : (a)
Generality is the measure of ease with which the method can be adapted to
different domains of application.
51 Machine learning is
. (a) The autonomous acquisition of knowledge through the use of computer
programs
(b) The autonomous acquisition of knowledge through the use of manual
programs
(c) The selective acquisition of knowledge through the use of computer programs
(d) The selective acquisition of knowledge through the use of manual programs
(e) None of the above.
52 Factors which affect the performance of learner system does not include
. (a) Representation scheme used
(b) Training scenario
(c) Type of feedback
(d) Good data structures
(e) Learning algorithm.
53 Different learning methods does not include
. (a) Memorization
(b) Analogy
(c) Deduction
(d) Introduction
(e) Acceptance.
54 In language understanding, the levels of knowledge that does not include
. (a) Phonological
(b) Syntactic
(c) Semantic
(d) Logical
(e) Empirical.
55 A model of language consists of the categories which does not include
. (a) Language units
(b) Role structure of units
(c) System constraints
(d) Structural units
(e) Components.
56 Semantic grammars
. (a) Encode semantic information into a syntactic grammar
(b) Decode semantic information into a syntactic grammar
(c) Encode syntactic information into a semantic grammar
(d) Decode syntactic information into a semantic grammar
(e) Encode syntactic information into a logical grammar.
57 What is a top-down parser?
. (a) Begins by hypothesizing a sentence (the symbol S) and successively
predicting lower level constituents until individual preterminal symbols are
written
(b) Begins by hypothesizing a sentence (the symbol S) and successively
predicting upper level constituents until individual preterminal symbols are
written
(c) Begins by hypothesizing lower level constituents and successively predicting a
sentence (the symbol S)
(d) Begins by hypothesizing upper level constituents and successively predicting a
sentence (the symbol S)
(e) All the above.
58 Perception involves
. (a) Sights, sounds, smell and touch
(b) Hitting
(c) Boxing
(d) Dancing
(e) Acting.
59 Among the following which is not a horn clause?
. (a) p
(b) p V q
(c) p q
(d) p q
(e) All the above.
60 The action STACK(A, B) of a robot arm specify to
. (a) Place block B on Block A
(b) Place blocks A, B on the table in that order
(c) Place blocks B, A on the table in that order
(d) Place block A on block B
(e) POP A, B from stack.
Answers
51. Answer : (a)
Reaso
Machine learning is the autonomous acquisition of knowledge through the use
of computer programs.
52. Answer : (d)
Factors which affect the performance of learner system does not include good
data structures
1. Which instruments are used for perceiving and acting upon the environment?
a) Sensors and Actuators
b) Sensors
c) Perceiver
d) None of the mentioned
View Answer
Answer:a
Explanation:An agent is anything that can be viewed as perceiving and acting upon
the environment through the sensors and actuators.
Answer:c
Explanation:An agents percept sequence is the complete history of everything that
the agent has ever perceived.
10. Which element in agent are used for selecting external actions?
a) Perceive
b) Performance
c) Learning
d) Actuator
View Answer
Answer:b
Explanation:None
1. What will take place as the agent observes its interactions with the world?
a) Learning
b) Hearing
c) Perceiving
d) Speech
View Answer
Answer: a
Explanation: Learning will take place as the agent observes its interactions with the
world and its own decision making process.
c) 3
d) 4
View Answer
Answer: c
Explanation: The three types of machine learning are supervised, unsupervised and
reinforcement.
8. What will happen if the hypothesis space contains the true function?
a) Realizable
b) Unrealizable
c) Both a & b
d) None of the mentioned
View Answer
Answer: b
Explanation: A learning problem is realizable if the hypothesis space contains the
true function.
d) Decision tree
View Answer
Answer: d
Explanation: Decision tree takes input as an object described by a set of attributes
and returns a decision.
1. Factors which affect the performance of learner system does not include
a) Representation scheme used
b) Training scenario
c) Type of feedback
d) Good data structures
View Answer
Answer: d
Explanation: Factors which affect the performance of learner system does not
include good data structures.
b) Neural networks
c) Propositional and FOL rules
d) All of the mentioned
View Answer
Answer: d
Explanation: Decision trees, Neural networks, Propositional rules and FOL rules all
are the models of learning.
6. In which of the following learning the teacher returns reward and punishment to learner?
a) Active learning
b) Reinforcement learning
c) Supervised learning
d) Unsupervised learning
View Answer
Answer: b
Explanation: Reinforcement learning is the type of learning in which teacher returns
award or punishment to learner.
d) Truth-Functionality
e) Global attribute
View Answer
Answer: b
Explanation: Locality: In logical systems, whenever we have a rule of the form A =>
B, we can conclude B, given evidence A, without worrying about any other rules.
Detachment: Once a logical proof is found for a proposition B, the proposition can
be used regardless of how it was derived .That is, it can be detachment from its
justification. Truth-functionality: In logic, the truth of complex sentences can be
computed from the truth of the components. However, there are no Attachment
properties lies in a Rule-based system. Global attribute defines a particular problem
space as user specific and changes according to users plan to problem.
3. In an Unsupervised learning
a) Specific output values are given
b) Specific output values are not given
c) No specific Inputs are given
d) Both inputs and outputs are given
e) Neither inputs nor outputs are given
View Answer
Answer: b
Explanation: The problem of unsupervised learning involves learning patterns in the
input when no specific output values are supplied. We cannot expect the specific
output to test your result. Here the agent does not know what to do, as he is not
aware of the fact what propose system will come out. We can say an ambiguous unproposed situation.
advertisements
b) Inconsistent Hypothesis
c) Regular Hypothesis
d) Irregular Hypothesis
e) Estimated Hypothesis
View Answer
Answer: a
Explanation: Inductive learning involves finding a consistent hypothesis that agrees
with examples. The difficulty of the task depends on the chosen representation.
5. Computational learning theory analyzes the sample complexity and computational complexity
of
a) Unsupervised Learning
b) Inductive learning
c) Forced based learning
d) Weak learning
e) Knowledge based learning
View Answer
Answer: b
Explanation: Computational learning theory analyzes the sample complexity and
computational complexity of inductive learning. There is a tradeoff between the
expressiveness of the hypothesis language and the ease of learning.
Answer: b
Explanation: Neural networks parameters can be learned from noisy data and they
have been used for thousands of applications, so it varies from problem to problem
and thus use nonlinear functions.
advertisements
8. A perceptron is a .
a) Feed-forward neural network
b) Back-propagation algorithm
c) Back-tracking algorithm
d) Feed Forward-backward algorithm
e) Optimal algorithm with Dynamic programming
View Answer
Answer: a
Explanation: A perceptron is a Feed-forward neural network with no hidden units
that can be representing only linear separable functions. If the data are linearly
separable, a simple weight updated rule can be used to fit the data exactly.