GATE NoteBook

Target JRF - UGC NET Computer Science Paper 2

1000 MEQs
100 Qs on ARTIFICIAL
INTELLIGENCE (AI)
Most Expected Questions Course
901. The performance of an agent can be improved by __________
a) Learning
b) Observing
c) Perceiving

A. a) and b)
B. b) and c)
C. Only a)
D. Only c)
E. All of the above
901. The performance of an agent can be improved by __________
a) Learning
b) Observing
c) Perceiving

A. a) and b)
B. b) and c)
C. Only a) An agent can improve by saving the previous
D. Only c) states on which it was earlier,
hence in future it can learn to respond in the
E. All of the above same situation better.
 Artificial Intelligence Functioning Dependency

 An AI system is composed of an agent and its environment.

 An agent like human or robot is anything that can perceive its environment
through sensors and acts upon that environment through effectors.
 Intelligent agents must be able to set goals and achieve them.
 In classical planning problems, the agent can assume that it is the only system
acting in the world, allowing the agent to be certain of the consequences of its
actions.
 However, if the agent is not the only actor, then it requires that the agent can
reason under uncertainty.
 This calls for an agent that cannot only assess its environment and make
predictions but also evaluate its predictions and adapt based on its assessment.
902. The action of the Simple reflex agent completely depends upon
__________
a) Perception history
b) Current perception
c) Learning theory
d) Utility functions
902. The action of the Simple reflex agent completely depends upon
__________
a) Perception history
b) Current perception
c) Learning theory
d) Utility functions

These agents select actions based on the

current perception, ignoring the rest of the
perception history.
903. Which of the following could be the approaches to Artificial Intelligence?
a) Strong Artificial Intelligence
b) Weak Artificial Intelligence
c) Applied Artificial Intelligence

A. a) and b)
B. b) and c)
C. a) and c)
D. All of the above
E. None of the above
903. Which of the following could be the approaches to Artificial Intelligence?
a) Strong Artificial Intelligence
b) Weak Artificial Intelligence
c) Applied Artificial Intelligence

A. a) and b) Strong Artificial Intelligence aims to build machines

that can truly reason and solve problems.
B. b) and c)
Weak Artificial Intelligence deals with the creation
C. a) and c) of some form of computer-based artificial
intelligence that cannot truly reason and solve
D. All of the above problems, but can act as if it were intelligent.

E. None of the above Applied Artificial Intelligence aims to produce

commercially viable “smart” systems.
904. An Artificial Neural Network Is based on?
a) Strong Artificial Intelligence approach
b) Weak Artificial Intelligence approach
c) Cognitive Artificial Intelligence approach
d) Applied Artificial Intelligence approach
e) All of the above

904. An Artificial Neural Network Is based on?
a) Strong Artificial Intelligence approach
b) Weak Artificial Intelligence approach
Cognitive Artificial Intelligence
Approach
A computer is used to test
theories about how the human
mind works.

c) Cognitive Artificial Intelligence approach Example –

Theories about how we
d) Applied Artificial Intelligence approach recognize faces and other
objects, or about how we solve
e) All of the above abstract problems.
905. Match the following :

LIST I (APPLICATIONS) LIST II (AI APPROACHES)

1) Face Recognition system i. Weak

2) Automated chess engine ii. Strong
3) A basic line following robot iii. Applied

a) 1-i, 2-ii, 3-iii

b) 1-i, 2-iii, 3-ii
c) 1-iii, 2-ii, 3-i
d) 1-ii, 2-i, 3-iii
905. Match the following :

LIST I (APPLICATIONS) LIST II (AI APPROACHES)

1) Face Recognition system i. Weak

2) Automated chess engine ii. Strong
3) A basic line following robot iii. Applied

a) 1-i, 2-ii, 3-iii

b) 1-i, 2-iii, 3-ii
c) 1-iii, 2-ii, 3-i
d) 1-ii, 2-i, 3-iii
906. What among the following is/are the example of the intelligent agent(s)?
a) Human
b) Robot
c) Autonomous Spacecraft

A. a) and b)
B. b) and c)
C. Only a)
D. Only c)
E. All of the above
906. What among the following is/are the example of the intelligent agent(s)?
a) Human
Humans
b) Robot  Can be looked upon as agents.
 They have eyes, ears, skin, taste buds, etc.
c) Autonomous Spacecraft for sensors.
 They have hands, fingers, legs, mouth for
effectors.
A. a) and b)
Robots are agents.
B. b) and c)  Robots may have camera, sonar, infrared,
bumper, etc. for sensors.
C. Only a)  They can have grippers, wheels, lights,
D. Only c) speakers, etc. for actuators.
Autonomous Spacecraft takes decision on its
E. All of the above own based on perceptions.
907. Machine learning is the ____________ acquisition of knowledge
through the use of ______________ programs.

A) selective, manual
B) autonomous, manual
C) selective, computer
D) autonomous, computer
907. Machine learning is the ____________ acquisition of knowledge
through the use of ______________ programs.

A) selective, manual
B) autonomous, manual
C) selective, computer
D) autonomous, computer
908. Which of the following statement(s) is/are CORRECT regarding Machine
Learning and Artificial Intelligence ?

S1 - Machine learning is a subset of AI

S2 - Machine learning and deep learning are the two main subsets of AI.
S3 - Deep learning is a main subset of machine learning.

a) S1 and S2
b) S2 and S3
c) S1 and S3
d) Only S2
e) All of the above
908. Which of the following statement(s) is/are CORRECT regarding Machine
Learning and Artificial Intelligence ?

S1 - Machine learning is a subset of AI

S2 - Machine learning and deep learning are the two main subsets of AI.
S3 - Deep learning is a main subset of machine learning.

a) S1 and S2
b) S2 and S3
c) S1 and S3
d) Only S2
e) All of the above
909. Which of the following is/are NOT main application(s) of AI ?
1) Customer Support Using Catboats
2) Online Recommender System
3) Expert System
4) Google Search Algorithms

a) 1 and 2
b) 2 and 3
c) 2 and 4
d) 1 and 3
909. Which of the following is/are NOT main application(s) of AI ?
1) Customer Support Using Catboats
2) Online Recommender System
3) Expert System
Main applications of AI
4) Google Search Algorithms  Customer support using catboats
 Expert system
 Online game playing
a) 1 and 2  Intelligent humanoid robot

b) 2 and 3 Main applications of Machine Learning

 Online recommender system
c) 2 and 4  Google search algorithms
d) 1 and 3  Facebook auto friend tagging suggestions
910. AI completely deals with Structured, semi-structured, and unstructured data
but Machine learning deals with ____________.
1) Structured data
2) Semi-structured data
3) Unstructured data

a) 1 and 2
b) 2 and 3
c) 1 and 3
d) All of the above
e) None of the above
910. AI completely deals with Structured, semi-structured, and unstructured data
but Machine learning deals with ____________.
1) Structured data
2) Semi-structured data
3) Unstructured data

a) 1 and 2
b) 2 and 3
c) 1 and 3
d) All of the above
e) None of the above
911. Which statement(s) is/are TRUE ?

I. Machine Learning is working to create an intelligent system which can

perform various complex tasks.
II. Artificial Intelligence is working to create machines that can perform only
those specific tasks for which they are trained.

a) Only I
b) Only II
c) Both
d) None
911. Which statement(s) is/are TRUE ?

I. Machine Learning is working to create an intelligent system which can

perform various complex tasks. (AI)
II. Artificial Intelligence is working to create machines that can perform only
those specific tasks for which they are trained. (ML)

a) Only I
b) Only II
c) Both
d) None
Artificial Intelligence Machine learning
a technology which enables a machine to simulate human a subset of AI which allows a machine to automatically learn from past
behavior. data without programming explicitly.
The goal of AI is to make a smart computer system like humans The goal of ML is to allow machines to learn from data so that they can
to solve complex problems. give accurate output.
intelligent systems to perform any task like a human. teach machines with data to perform a particular task and give an
accurate result.
ML and deep learning are the two main subsets of AI. Deep learning is a main subset of machine learning.

AI has a very wide range of scope. Machine learning has a limited scope.
AI is working to create an intelligent system which can perform Machine learning is working to create machines that can perform only
various complex tasks. those specific tasks for which they are trained.
concerned about maximizing the chances of success. Machine learning is mainly concerned about accuracy and patterns.

The main applications are Siri, customer support using The main applications are Online recommender system, Google search
catboats, Expert System, Online game playing, intelligent algorithms, Facebook auto friend tagging suggestions, etc.
humanoid robot, etc.
On the basis of capabilities, AI can be divided into three types, can also be divided into mainly three types that are Supervised
which are, Weak AI, General AI, and Strong AI. learning, Unsupervised learning, and Reinforcement learning.

It includes learning, reasoning, and self-correction. It includes learning and self-correction when introduced with new data.

AI completely deals with Structured, semi-structured, and Machine learning deals with Structured and semi-structured data.
unstructured data.
912. In LISP, the atom that stands for “true” is _____________
a) t
b) ml
c) y
d) time
912. In LISP, the atom that stands for “true” is _____________
a) t
b) ml
c) y
d) time
913. Which of the following data type(s) is/are provided by LISP ?

1) Objects
2) Structures
3) Lists
4) Vectors
5) hash-tables

A. Only 1, 2 and 3
B. Only 4 and 5
C. Only 2 and 3
D. All of the above
E. All except 4
913. Which of the following data type(s) is/are provided by LISP ?

1) Objects
2) Structures
3) Lists
4) Vectors LISP = LISt Processing
5) hash-tables
DEFINITION :
A. Only 1, 2 and 3 A programming language designed for easy
B. Only 4 and 5 manipulation of data strings.
C. Only 2 and 3
LISP provides wide-ranging data types like,
D. All of the above objects, structures, lists, vectors, adjustable
E. All except 4 arrays, hash-tables, and symbols.
914. Which of the following statement(s) is/are NOT TRUE about LISP ?

1) Machine dependent
2) Updating the programs dynamically.
3) Not provides object-oriented programming.
4) Provides a convenient macro system.

a) 1 and 2
b) 2 and 3
c) 2 and 4
d) 1 and 3
e) None of them are FALSE
914. Which of the following statement(s) is/are NOT TRUE about LISP ?

1) Machine dependent
2) Updating the programs dynamically.
3) Not provides object-oriented programming.
4) Provides a convenient macro system.

a) 1 and 2
b) 2 and 3
c) 2 and 4
d) 1 and 3
e) None of them are FALSE
 Features of LISP
 machine-independent
Applications Built in LISP
 uses iterative design methodology
Large successful applications
 easy extensibility.
built in Lisp.
 updating the programs dynamically.
 Emacs
 provides high level debugging.
 G2
 provides advanced OOPs.
 AutoCad
 provides a convenient macro system.
 Igor Engraver
 provides wide-ranging data types like, objects,
 Yahoo Store
structures, lists, vectors, adjustable arrays,
hash-tables, and symbols.
 expression-based.
 provides an object-oriented condition system.
 provides a complete I/O library.
 provides extensive control structures.
915. Knowledge representation and reasoning is the part of Artificial intelligence which
concerned with
1) AI agents thinking and how thinking contributes to intelligent behavior of agents.

2) Responsibility for representing information about the real world so that a computer
can understand and can utilize this knowledge to solve the complex real world
problems such as diagnosis a medical condition or communicating with humans in
natural language.

3) The description is how we can represent knowledge in artificial intelligence.

4) Not just storing data into some database, but it also enables an intelligent machine to
learn from that knowledge and experiences so that it can behave intelligently like a
human.

a) 1 and 2 b) all except 4 c) 2 and 3

d) All of the above e) none of the above
915. Knowledge representation and reasoning is the part of Artificial intelligence which
concerned with
1) AI agents thinking and how thinking contributes to intelligent behavior of agents.

2) Responsibility for representing information about the real world so that a computer
can understand and can utilize this knowledge to solve the complex real world
problems such as diagnosis a medical condition or communicating with humans in
natural language.

3) The description is how we can represent knowledge in artificial intelligence.

4) Not just storing data into some database, but it also enables an intelligent machine to
learn from that knowledge and experiences so that it can behave intelligently like a
human.

a) 1 and 2 b) all except 4 c) 2 and 3

d) All of the above e) none of the above
916. Match the following :
LIST I LIST II
1) Procedural Knowledge i. knowledge about the other types of knowledge
2) Meta-knowledge ii. responsible for knowing how to do something.
3) Heuristic knowledge iii. describes the relationship between concepts or objects.
4) Structural knowledge iv. knowledge of some experts in a filed or subject.

a) 1-i, 2-ii, 3-iii, 4-iv

b) 1-ii, 2-i, 3-iv, 4-iii
c) 1-iv, 2-iii, 3-ii, 4-i
d) 1-i, 2-iii, 3-ii, 4-iv
916. Match the following :
LIST I LIST II
1) Procedural Knowledge i. knowledge about the other types of knowledge
2) Meta-knowledge ii. responsible for knowing how to do something.
3) Heuristic knowledge iii. describes the relationship between concepts or objects.
4) Structural knowledge iv. knowledge of some experts in a filed or subject.

a) 1-i, 2-ii, 3-iii, 4-iv

b) 1-ii, 2-i, 3-iv, 4-iii
c) 1-iv, 2-iii, 3-ii, 4-i
d) 1-i, 2-iii, 3-ii, 4-iv
917. A* Search Algorithm is often used to find the shortest path from one point to
another point. The worse case time complexity is ________ and required auxiliary
space in worst case is ________.

a) O(E), O(V)
b) O(logE), O(E)
c) O(1), O(1)
d) O(ElogV), O(V)
917. A* Search Algorithm is often used to find the shortest path from one point to
another point. The worse case time complexity is ________ and required auxiliary
space in worst case is ________.

a) O(E), O(V)
b) O(logE), O(E)
c) O(1), O(1)
d) O(ElogV), O(V)
TIME COMPLEXITY (A* Algorithm)

Considering a graph, it may take us to travel all the edge to reach the destination cell from
the source cell.
EXAMPLE :-
Consider a graph where source & destination nodes are connected by a series of edges,
like –
0(source) –>1 –> 2 –> 3 (destination)

So, the worse case time complexity is O(E), where E is the number of edges in the graph

Auxiliary Space
In the worse case, we can have all the edges inside the open list, so required auxiliary
space in worst case is O(V), where V is the total number of vertices.
918. Self Organizing Map (SOM) is a type of Artificial Neural Network which

1) inspired by biological models of neural systems form.

2) follows an supervised learning approach and trained its network through a

competitive learning algorithm.

3) Also known as Kohonen Map.

4) used for clustering and mapping or dimensionality reduction techniques to map

multidimensional data onto lower-dimensional which allows people to reduce
complex problems for easy interpretation.

a) 1 and 2 b) all except 2 c) 2 and 4

d) All except 4 e) 2 and 3

918. Self Organizing Map (SOM) is a type of Artificial Neural Network which

1) inspired by biological models of neural systems form.

2) follows an supervised learning approach and trained its network through a

competitive learning algorithm.

3) Also known as Kohonen Map. Using unsupervised learning approach

4) used for clustering and mapping or dimensionality reduction techniques to map

multidimensional data onto lower-dimensional which allows people to reduce
complex problems for easy interpretation.

a) 1 and 2 b) all except 2 c) 2 and 4

d) All except 4 e) 2 and 3

919. In order to define an Artificial Neural Network that consists of a large number of
artificial neurons, which are termed units arranged in a sequence of layers.

a) Artificial Neural Network primarily consists of two layers named as input and output
layers.
b) Artificial Neural Network primarily consists of three layers named as input, hidden and
output layers.
c) Artificial Neural Network primarily consists of only one layer can be used as input or
output layer as per requirement.
d) Artificial Neural Network is a smart way so does not need any layers.
919. In order to define an Artificial Neural Network that consists of a large number of
artificial neurons, which are termed units arranged in a sequence of layers.

a) Artificial Neural Network primarily consists of two layers named as input and output
layers.
b) Artificial Neural Network primarily consists of three layers named as input, hidden and
output layers.
c) Artificial Neural Network primarily consists of only one layer can be used as input or
output layer as per requirement.
d) Artificial Neural Network is a smart way so does not need any layers.
 Artificial Neural Network Primarily Consists Of Three Layers

Input Layer:
 accepts inputs in several different formats provided by the programmer.

Hidden Layer:
 The hidden layer presents in-between input and output layers.
 It performs all the calculations to find hidden features and patterns.

Output Layer:
 The input goes through a series of transformations using the hidden layer, which
finally results in output that is conveyed using this layer.
 The artificial neural network takes input and computes the weighted sum of the
inputs and includes a bias.
 This computation is represented in the form of a transfer function.
920. ANNs can work with numerical data. Problems must be converted into numerical
values before being introduced to ANN.
The duration of the network is

S1 - reduced to a specific value of the error.

S2 - value does not give us optimum results.

A) S1 ONLY
B) S2 ONLY
C) EITHER S1 OR S2
D) NEITHER S1 NOR S2
920. ANNs can work with numerical data. Problems must be converted into numerical
values before being introduced to ANN.
The duration of the network is

S1 - reduced to a specific value of the error.

S2 - value does not give us optimum results.

A) S1 ONLY
B) S2 ONLY
C) EITHER S1 OR S2
The duration of the network is unknown
D) NEITHER S1 NOR S2
921. The primary advantage of ______________ is that it figures out how to evaluate and
recognize input patterns.

a) Feed-Forward ANN
b) Feedback ANN
c) Parallel processing ANN
d) Sigmoidal Hyperbolic ANN
e) binary activation ANN
921. The primary advantage of ______________ is that it figures out how to evaluate and
recognize input patterns.

a) Feed-Forward ANN
b) Feedback ANN
c) Parallel processing ANN
d) Sigmoidal Hyperbolic ANN
e) binary activation ANN
Feedback ANN
 Feed information back into itself and are well suited to solve optimization issues.
 The Internal system error corrections utilize feedback ANNs.

Parallel processing Capability of ANN

 ANNs have a numerical value that can perform more than one task simultaneously.

Sigmoidal Hyperbolic
 A function is generally seen as an "S" shaped curve.
 The tan hyperbolic function is used to approximate output from the actual net input.

Binary Activation Function

 The output is either a one or a 0. Here, to accomplish this, there is a threshold value set up.
922. In binary activation function, the output is either a one or a 0. Here, to accomplish
this, there is a threshold value set up. If the net weighted input of neurons is more than 1,
then

a) the final output of the activation function is returned as 1.

b) the final output of the activation function is returned as 0.
c) the final output of the activation function is returned as 0 or else the output is
returned as 1.
d) the final output of the activation function is returned as 1 or else the output is
returned as 0.
922. In binary activation function, the output is either a one or a 0. Here, to accomplish
this, there is a threshold value set up. If the net weighted input of neurons is more than 1,
then

a) the final output of the activation function is returned as 1.

b) the final output of the activation function is returned as 0.
c) the final output of the activation function is returned as 0 or else the output is
returned as 1.
d) the final output of the activation function is returned as 1 or else the output is
returned as 0.
923. ______________ is a special kind of neural network which is calculated by converging
iterative process and has just one layer of neurons relating to the size of the input and
output, which must be the same.

a) Kohonen Self- Organizing Feature Map

b) Hopfield Network
c) Genetic Algorithm
d) Boltzmann Machines
923. ______________ is a special kind of neural network which is calculated by converging
iterative process and has just one layer of neurons relating to the size of the input and
output, which must be the same.

a) Kohonen Self- Organizing Feature Map

b) Hopfield Network
c) Genetic Algorithm
d) Boltzmann Machines
 Hopfield Network

 An ANNs to collect and retrieve memory like the human brain.

 Here, a neuron is either on or off the situation.
 First prepared to store various patterns or memories.
 Afterward, it is ready to recognize any of the learned patterns by uncovering partial or even
some corrupted data about that pattern.
 It is a single-layered and recurrent network in which the neurons are entirely connected.

Having two different approaches to update the nodes:

1. Synchronously: the update of all the nodes taking place simultaneously at each time.
2. Asynchronously: at each point of time, update one node chosen randomly or according to
some rule. more biologically realistic.
924. Sigmoidal feedback ANN with one hidden layer can approximate
____________.

a) Any continuous function

b) Any discontinuous function
c) Any continuous function and its derivatives of arbitrary order
d) Exact modeling techniques
924. Sigmoidal feedback ANN with one hidden layer can approximate
____________.

a) Any continuous function

b) Any discontinuous function
c) Any continuous function and its derivatives of arbitrary order
d) Exact modeling techniques
925. Which Rule is NOT appropriate regarding propositional logic in AI ?
1) It is also called Boolean logic as it works on 0 and 1.
2) can be either true or false and can be both also.
3) consists of an object, relations or function, and neglects logical connectives.
4) A proposition formula which has both true and false values is called.

a) 1 and 2
b) 2 and 3
c) 2 and 4
d) 1 and 3
e) All are appropriate except 4
925. Which Rule is NOT appropriate regarding propositional logic in AI ?
1) It is also called Boolean logic as it works on 0 and 1.
2) can be either true or false and can be both also.
3) consists of an object, relations or function, and neglects logical connectives.
4) A proposition formula which has both true and false values is called.

a) 1 and 2  can be either true or false but cannot be both.

b) 2 and 3  consists of an object, relations or function, and
logical connectives.
c) 2 and 4
d) 1 and 3
e) All are appropriate except 4
926. Which of the following statement(s) is/are TRUE regarding Atomic Proposition ?

1) These are constructed by combining simpler propositions

2) Using parenthesis and logical connectives.
3) These are the sentences which must be either true or false.
4) It consists of a single proposition symbol.

a) 1 and 2
b) 2 and 3
c) 3 and 4
d) 1 and 4
e) All of the above
926. Which of the following statement(s) is/are TRUE regarding Atomic Proposition ?

1) These are constructed by combining simpler propositions. (Compound Proposition)

2) Using parenthesis and logical connectives. (Compound Proposition)
3) These are the sentences which must be either true or false.
4) It consists of a single proposition symbol.

a) 1 and 2
b) 2 and 3
c) 3 and 4
d) 1 and 4
e) All of the above
927. Which of the following operator or connectors having second precedence ?

a) Parenthesis
b) Negation
c) Implication
d) Biconditional
927. Which of the following operator or connectors having second precedence ?

a) Parenthesis
b) Negation
c) Implication
d) Biconditional
928. Which of the following options having the CORRECT order of precedence in ascending
order regarding operators or connectives ?

a) Parenthesis – Negation – Conjunction – Biconditional – Implication – Disjunction

b) Parenthesis – Negation – Conjunction – Disjunction – Implication – Biconditional
c) Parenthesis – Negation – Conjunction – Disjunction – Biconditional – Implication
d) Parenthesis – Negation – Disjunction – Conjunction – Biconditional – Implication
928. Which of the following options having the CORRECT order of precedence in ascending
order regarding operators or connectives ?

a) Parenthesis – Negation – Conjunction – Biconditional – Implication – Disjunction

b) Parenthesis – Negation – Conjunction – Disjunction – Implication – Biconditional
c) Parenthesis – Negation – Conjunction – Disjunction – Biconditional – Implication
d) Parenthesis – Negation – Disjunction – Conjunction – Biconditional – Implication
929. _____________ are a core area of research of contemporary artificial intelligence and
consists of multiple decision-making agents which interact in a shared environment to
achieve common or conflicting goals.

a) Reactive Machines Systems (RMS)

b) Multi-Agent Systems (MAS)
c) Theory Of Mind Systems (TMS)
d) Limited Memory Systems (LMS)
929. _____________ are a core area of research of contemporary artificial intelligence and
consists of multiple decision-making agents which interact in a shared environment to
achieve common or conflicting goals.

a) Reactive Machines Systems (RMS)

b) Multi-Agent Systems (MAS)
c) Theory Of Mind Systems (TMS)
d) Limited Memory Systems (LMS)
930. In an episodic environment, the agent's experience is divided into episodes which
consist of a percept sequence and an action. Here, episodes are _________ of one another
and the agent ________ the effect of its actions.

a) dependent, need to know

b) independent, need to know
c) dependent, doesn’t need to know
d) independent, doesn’t need to know
930. In an episodic environment, the agent's experience is divided into episodes which
consist of a percept sequence and an action. Here, episodes are _________ of one another
and the agent ________ the effect of its actions.

a) dependent, need to know

b) independent, need to know
c) dependent, doesn’t need to know
d) independent, doesn’t need to know
931. There are so many types of environment of AI. It can be deterministic or non
deterministic, episodic or non – episodic, etc. The environment is said to be discrete if

a) the number of percepts in the environment is limited

b) If the number of percepts and actions in the environment is limited
c) If the number of actions in the environment is limited and distinct
d) If the number of percepts and actions in the environment is limited and distinct
931. There are so many types of environment of AI. It can be deterministic or non
deterministic, episodic or non – episodic, etc. The environment is said to be discrete if

a) the number of percepts in the environment is limited

b) If the number of percepts and actions in the environment is limited
c) If the number of actions in the environment is limited and distinct
d) If the number of percepts and actions in the environment is limited and distinct
932. An environment is dynamic if it

a) changes while an agent is in the process of responding to a percept sequence.

b) does not change while the agent is deciding on an action
c) does not change with time but he agent's performance score does.
d) All of the above
e) None of the above
932. An environment is dynamic if it
a) changes while an agent is in the process of responding to a percept sequence.
b) does not change while the agent is deciding on an action
c) does not change with time but he agent's performance score does.
d) All of the above
e) None of the above

Deterministic And Non-Deterministic

 An environment is deterministic if the next state of the environment is solely determined by the
current state of the environment and the actions selected by the agents.
 An inaccessible environment might appear to be non-deterministic since the agent has no way of
sensing part of the environment and the result of its actions on it.
 We have to take into consideration the point of view of the agent when determining whether an
environment is deterministic or not since the agent might have limited perception capabilities.
933. Which of the following describes best forward chaining ?

1) It is a goal directed strategy that begins with goal state and continues working.
2) Generating more sub goals that must also be satisfied to satisfy main goal until we
reach to start state.
3) Rules are expressed in the form of if-then rules.
4) Language OPS5 uses these reasoning rules.

a) 1 and 2 b) 2 and 3 c) 3 and 4

d) 1 and 4 e) all except 2
933. Which of the following describes best forward chaining ?

1) It is a goal directed strategy that begins with goal state and continues working.
2) Generating more sub goals that must also be satisfied to satisfy main goal until we
reach to start state.
3) Rules are expressed in the form of if-then rules.
4) Language OPS5 uses these reasoning rules.

a) 1 and 2 b) 2 and 3 c) 3 and 4

d) 1 and 4 e) all except 2
1 and 2 describes backward chaining.
Example - Prolog
934. Which chaining strategy is better ?

a) Forward chaining
b) Backward chaining
c) Hybrid chaining
d) Both a) and b)
934. Which chaining strategy is better ?

a) Forward chaining
b) Backward chaining
c) Hybrid chaining
d) Both a) and b)

REASON :
If there are large no. of explicit goal states and one start state, backward
chaining is not efficient because we do not know which goal state is closest to
the start state.
935. Given expression belongs to which normal form ?

p∧q∨r
a) CNF
b) DNF
c) Both
d) None
935. Given expression belongs to which normal form ?

p∧q∨r
a) CNF
b) DNF
c) Both
d) None

Because two different operators are used which is not

allowed in any of the normal forms.
936. Given expression belongs to which normal form ?¬ p∨q∨r
¬p∨q∨r

a) CNF
b) DNF
c) Both
d) None
936. Given expression belongs to which normal form ?¬ p∨q∨r
¬p∨q∨r

a) CNF
b) DNF
c) Both
d) None
937. Given expression belongs to which normal form ?¬ p∨q∨r
p∧q∧r

a) CNF
b) DNF
c) Both
d) None
937. Given expression belongs to which normal form ?¬ p∨q∨r
p∧q∧r

a) CNF
b) DNF
c) Both
d) None
938. Hill climbing algorithm is a local search algorithm which continuously moves in the
direction of increasing elevation/value to find the peak of the mountain or best solution to
the problem. It terminates when

a) it reaches an output state where neighbor has a higher value.

b) it reaches a running state where all the neighbors waiting in waiting queue.
c) it reaches a peak value where no neighbor has a higher value.
d) it reaches a peak value where neighbor has a higher value.
938. Hill climbing algorithm is a local search algorithm which continuously moves in the
direction of increasing elevation/value to find the peak of the mountain or best solution to
the problem. It terminates when

a) it reaches an output state where neighbor has a higher value.

b) it reaches a running state where all the neighbors waiting in waiting queue.
c) it reaches a peak value where no neighbor has a higher value.
d) it reaches a peak value where neighbor has a higher value.
939. Hill climbing algorithm is a technique which is used for optimizing the mathematical
problems. One of the widely discussed examples of Hill climbing algorithm is

a) Greedy Algorithm
b) Traveling-Salesman Problem
c) A* Algorithm
d) AO* Algorithm
939. Hill climbing algorithm is a technique which is used for optimizing the mathematical
problems. One of the widely discussed examples of Hill climbing algorithm is

a) Greedy Algorithm
b) Traveling-Salesman Problem
c) A* Algorithm
d) AO* Algorithm
940. Hill climbing algorithm is also called greedy local search

a) as it only looks to its good immediate neighbor state and not beyond that.
b) as it has two components which are state and value.
c) as we don't need to maintain and handle the search tree or graph as it only keeps a
single current state.
d) as it continuously moves in the direction of increasing elevation/value to find the peak
of the mountain or best solution to the problem.
940. Hill climbing algorithm is also called greedy local search

a) as it only looks to its good immediate neighbor state and not beyond that.
b) as it has two components which are state and value.
c) as we don't need to maintain and handle the search tree or graph as it only keeps a
single current state.
d) as it continuously moves in the direction of increasing elevation/value to find the peak
of the mountain or best solution to the problem.
941. As we have seen in the minimax search algorithm that the number of game states it
has to examine are exponential in depth of the tree. Since we cannot eliminate the
exponent, but we can cut it to half. ___________ is a modified version of the minimax
algorithm.

a) Adversarial Search Algorithm

b) Alpha Beta Algorithm
c) Hill climbing algorithm
d) Informed Search Algorithm
941. As we have seen in the minimax search algorithm that the number of game states it
has to examine are exponential in depth of the tree. Since we cannot eliminate the
exponent, but we can cut it to half. ___________ is a modified version of the minimax
algorithm.

a) Adversarial Search Algorithm

b) Alpha Beta Algorithm
c) Hill climbing algorithm
d) Informed Search Algorithm
942. Alpha-beta pruning can be applied at any depth of a tree, and

a) sometimes it prune the tree leaves.

b) sometimes it prune entire sub-tree.
c) sometimes it not only prune the tree leaves but also entire sub-tree.
d) All the time it prune entire sub-tree.
942. Alpha-beta pruning can be applied at any depth of a tree, and

a) sometimes it prune the tree leaves.

b) sometimes it prune entire sub-tree.
c) sometimes it not only prune the tree leaves but also entire sub-tree.
d) All the time it prune entire sub-tree.
943. The Alpha-beta pruning to a standard minimax algorithm returns the same move as
the standard algorithm does, but it removes all the nodes which are not really affecting
the final decision but making algorithm slow. There are two-parameters are Alpha and
Beta.
Which feature(s) is appropriate regarding Alpha ?

1) The best lowest-value choice

2) The initial value is +∞.
3) The best highest-value choice
4) The initial value is -∞.

a) 1 and 2
b) 2 and 3
c) 3 and 4
d) 1 and 4
e) All of the above except 4
943. The Alpha-beta pruning to a standard minimax algorithm returns the same move as
the standard algorithm does, but it removes all the nodes which are not really affecting
the final decision but making algorithm slow. There are two-parameters are Alpha and
Beta.
Which feature(s) is appropriate regarding Alpha ?

1) The best lowest-value choice (beta)

2) The initial value is +∞. (beta)
3) The best highest-value choice (alpha)
4) The initial value is -∞. (alpha)

a) 1 and 2
b) 2 and 3
c) 3 and 4
d) 1 and 4
e) All of the above except 4
944. When boolean logic fails to represent discrete values ?

a) In case of uncertainty
b) When we require the outcomes representation with degree
c) Both a) and b)
d) None of these
944. When boolean logic fails to represent discrete values ?

a) In case of uncertainty
b) When we require the outcomes representation with degree
c) Both a) and b)
d) None of these
945.
945.
946.
946.
947.
947.
948.
948.
949.
949.
950.
950.
 GATE NoteBook
Target JRF - UGC NET Computer Science Paper 2

1000 MEQs
50 Qs on ARTIFICIAL
INTELLIGENCE (AI)
Most Expected Questions Course
951. The PEAS in the task environment is about____________.

a) Peer, Environment, Actuators, Sense

b) Performance, Environment, Actuators, Sensors
c) Perceiving, Environment, Actuators, Sensors
d) None of the above
951. The PEAS in the task environment is about____________.

a) Peer, Environment, Actuators, Sense

b) Performance, Environment, Actuators, Sensors
c) Perceiving, Environment, Actuators, Sensors
d) None of the above

PEAS is a representation model on which an AI agent works.

It is made up of four words.
952. In state-space, the set of actions for a given problem is expressed by
the_____.

a) Intermediate States
b) Successor function that takes current action and returns next state
c) Initial States
d) None of the above
952. In state-space, the set of actions for a given problem is expressed by
the_____.

a) Intermediate States
b) Successor function that takes current action and returns next state
c) Initial States
d) None of the above

The successor function provides a description of all possible actions and their next
states, which means their outcomes.
953. In which search problem, to find the shortest path, each city must be visited
once only?

a) Map coloring Problem

b) Depth-first search traversal on a given map represented as a graph
c) Finding the shortest path between a source and a destination
d) Travelling Salesman problem
953. In which search problem, to find the shortest path, each city must be visited
once only?

a) Map coloring Problem

b) Depth-first search traversal on a given map represented as a graph
c) Finding the shortest path between a source and a destination
d) Travelling Salesman problem

Travelling Salesman problem is about finding the shortest possible route to visit each
city only once and returning to the origin city when the list of all cities and distances
between each pair of cities is given.
954. In artificial Intelligence, knowledge can be represented as_______.

I. Predicate Logic
II. Propositional Logic
III. Compound Logic
IV. Machine Logic

a) Both I and II
b) Only II
c) Both II and III
d) Only IV
954. In artificial Intelligence, knowledge can be represented as_______.

I. Predicate Logic
II. Propositional Logic There are several techniques
of Knowledge representation in AI, and
III. Compound Logic among them, one is Logical
Representation.
IV. Machine Logic
The logical representation can be done
in two ways Predicate Logic and
a) Both I and II Propositional Logic, hence knowledge
can be represented as both predicate
b) Only II and Propositional logic.
c) Both II and III
d) Only IV
955. For propositional Logic, which statement is false?

a) The sentences of Propositional logic can have answers other than True or False.
b) Each sentence is a declarative sentence.
c) Propositional logic is a knowledge representation technique in AI.
d) None of the above
955. For propositional Logic, which statement is false?

a) The sentences of Propositional logic can have answers other than True or False.
b) Each sentence is a declarative sentence.
c) Propositional logic is a knowledge representation technique in AI.
d) None of the above
956. Which of the given statement is true for Conditional Probability?

a) Conditional Probability gives 100% accurate results.

b) Conditional Probability can be applied to a single event.
c) Conditional Probability has no effect or relevance on independent events.
d) None of the above.
956. Which of the given statement is true for Conditional Probability?

a) Conditional Probability gives 100% accurate results.

b) Conditional Probability can be applied to a single event.
c) Conditional Probability has no effect or relevance on independent events.
d) None of the above.

The conditional probability is said as the probability of occurring an event when another event
has already occurred.
Independent events are those that are not affected by the occurrence of other events; hence
conditional probability has no effect or relevance on independents events.
957. The best AI agent is one which____________

1) Needs user inputs for solving any problem

2) Can solve a problem on its own without any human intervention
3) Need a similar exemplary problem in its knowledge base

a) 1 and 2
b) 2 and 3
c) 1 and 3
d) Only 2
e) Only 3
957. The best AI agent is one which____________

1) Needs user inputs for solving any problem

2) Can solve a problem on its own without any human intervention
3) Need a similar exemplary problem in its knowledge base

a) 1 and 2
b) 2 and 3
c) 1 and 3
d) Only 2
e) Only 3
958. The Bayesian Network gives________

1) A complete description of the problem

2) Partial Description of the domain
3) A complete description of the domain

a) 1 and 2
b) 2 and 3
c) 1 and 3
d) Only 2
e) Only 3
958. The Bayesian Network gives________

1) A complete description of the problem

2) Partial Description of the domain
3) A complete description of the domain

a) 1 and 2
b) 2 and 3
c) 1 and 3
d) Only 2
e) Only 3
959. In LISP, the addition of 3+4 is entered as_______.

a) 3+4
b) 3 add 4
c) 3+4=
d) (+3 4)
959. In LISP, the addition of 3+4 is entered as_______.

a) 3+4
b) 3 add 4
c) 3+4=
d) (+3 4)
960. An Algorithm is said as Complete algorithm if

a) It ends with a solution (if any exists).

b) It begins with a solution.
c) It does not end with a solution.
d) It contains a loop
960. An Algorithm is said as Complete algorithm if

a) It ends with a solution (if any exists).

b) It begins with a solution.
c) It does not end with a solution.
d) It contains a loop
961. Which statement is valid for the Heuristic function?

a) The heuristic function is used to solve mathematical problems.

b) The heuristic function takes parameters of type string and returns an integer value.
c) The heuristic function does not have any return type.
d) The heuristic function calculates the cost of an optimal path between the pair of states.
961. Which statement is valid for the Heuristic function?

a) The heuristic function is used to solve mathematical problems.

b) The heuristic function takes parameters of type string and returns an integer value.
c) The heuristic function does not have any return type.
d) The heuristic function calculates the cost of an optimal path between the pair of states.

 The heuristic function is used in Informed search in AI to find the most promising path in the
search.
 It estimates the closeness of the current state and calculates the cost of an optimal path
between the pair of states.
 It is represented by h(n).
962. Which is not the commonly used programming language for AI?

a) PROLOG
b) Java
c) LISP
d) Perl
962. Which is not the commonly used programming language for AI?

a) PROLOG
b) Java
c) LISP
d) Perl

PERL is not the commonly used programming language for AI.

WHY ?
Because Perl is used as a script language, and not of much use for AI practice.
963. A* Search algorithm is one of the best and popular technique used in path-finding and
graph traversals. A* algorithm is based on ___________

a) Breadth-First-Search
b) Depth-First –Search
c) Best-First-Search
d) Hill climbing
963. A* Search algorithm is one of the best and popular technique used in path-finding and
graph traversals. A* algorithm is based on ___________

a) Breadth-First-Search
b) Depth-First –Search
c) Best-First-Search
d) Hill climbing
WHY ?
Best-first-search is giving the idea of
optimization and quick choose of path, and
all these characteristic lies in A* algorithm.
964. Best-First search is a type of informed search, which uses ________________ to
choose the best next node for expansion.
1) Evaluation function returning lowest evaluation
2) Evaluation function returning highest evaluation
3) Evaluation function returning lowest and highest evaluation

a) 1 and 2
b) Only 1
c) 2 and 3
d) Only 3
e) Only 2
964. Best-First search is a type of informed search, which uses ________________ to
choose the best next node for expansion.
1) Evaluation function returning lowest evaluation
2) Evaluation function returning highest evaluation
3) Evaluation function returning lowest and highest evaluation

a) 1 and 2 BEST-FIRST SEARCH

b) Only 1 It is an instance of the general TREE-SEARCH or GRAPH-SEARCH
algorithm in which a node is selected for expansion based on an
c) 2 and 3 evaluation function, f (n).
Traditionally, the node with the lowest evaluation is selected for
d) Only 3 expansion, because the evaluation measures distance to the goal.
e) Only 2
965. Greedy search strategy chooses the node for expansion in ___________.

a) Shallowest
b) Deepest
c) The one closest to the goal node
d) Minimum heuristic cost
965. Greedy search strategy chooses the node for expansion in ___________.

a) Shallowest
b) Deepest
c) The one closest to the goal node
d) Minimum heuristic cost

Sometimes minimum heuristics can be used, sometimes maximum heuristics function

can be used.
It depends upon the application on which the algorithm is applied.
966. What is the evaluation function in greedy approach?
a) Heuristic function
b) Path cost from start node to current node
c) Average of Path cost from start node to current node

A. a) and b)
B. b) and c)
C. a) and c)
D. All of the above
E. None of the above
966. What is the evaluation function in greedy approach?
a) Heuristic function
b) Path cost from start node to current node
c) Average of Path cost from start node to current node

A. a) and b)
B. b) and c) Greedy best-first search tries to expand the node that is
C. a) and c) closest to the goal, on the grounds that this is likely to lead
to a solution quickly.
D. All of the above Thus, it evaluates nodes by using just the heuristic
E. None of the above function:
f (n) = h(n)
967. What is the form of Fuzzy logic?
a) Two-valued logic
b) Crisp set logic
c) Many-valued logic
d) Binary set logic

A. a), b) and d)
B. a), b) and c)
C. a) and c)
D. Only c)
E. Only d)
967. What is the form of Fuzzy logic?
a) Two-valued logic
b) Crisp set logic
c) Many-valued logic
d) Binary set logic
Traditional set theory = Crisp Set theory

Traditional set theory set membership is fixed or

A. a), b) and d) exact either the member is in the set or not.
B. a), b) and c)
There is only two crisp values true or false.
C. a) and c)
In case of fuzzy logic there are many values.
D. Only c)
E. Only d) With weight say x the member is in the set.
968. The truth values of traditional set theory is ____________ and that of fuzzy set is
__________

a) Either 0 or 1, between 0 & 1

b) Between 0 & 1, either 0 or 1
c) Between 0 & 1, between 0 & 1
d) Either 0 or 1, either 0 or 1
968. The truth values of traditional set theory is ____________ and that of fuzzy set is
__________

a) Either 0 or 1, between 0 & 1

b) Between 0 & 1, either 0 or 1
c) Between 0 & 1, between 0 & 1
d) Either 0 or 1, either 0 or 1

Fuzzy logic is extension of Crisp set with an

extension of handling the concept of Partial Truth.
969. Fuzzy logic is usually represented as ___________

a) IF-THEN-ELSE rules
b) IF-THEN rules
c) Both a) and b)
d) None of them
969. Fuzzy logic is usually represented as ___________

a) IF-THEN-ELSE rules
b) IF-THEN rules
c) Both a) and b)
Fuzzy set theory defines fuzzy operators on fuzzy sets.
d) None of them
The problem in applying this is that the appropriate fuzzy
operator may not be known.
For this reason, fuzzy logic usually uses IF-THEN rules, or
constructs that are equivalent, such as fuzzy associative matrices.

Rules are usually expressed in the form:

IF variable IS property THEN action
971. Which environment is called as semi dynamic?

a) Environment does not change with the passage of time

b) Agent performance changes
c) Environment will be changed
d) Environment does not change with the passage of time, but Agent performance changes
971. Which environment is called as semi dynamic?

a) Environment does not change with the passage of time

b) Agent performance changes
c) Environment will be changed
d) Environment does not change with the passage of time, but Agent performance changes
972. What will happen if a predecessor description is generated that is satisfied by the
initial state of the planning problem?

a) Success
b) Error
c) Compilation
d) Termination
972. What will happen if a predecessor description is generated that is satisfied by the
initial state of the planning problem?

a) Success
b) Error
c) Compilation
d) Termination
973. Which approach is to pretend that a pure divide and conquer algorithm will work?

a) Goal independence
b) Subgoal independence
c) Both a) and b)
d) None of them
973. Which approach is to pretend that a pure divide and conquer algorithm will work?

a) Goal independence
b) Subgoal independence
c) Both a) and b)
d) None of them

Subgoal Independence Approach

To pretend that a pure divide and conquer
algorithm will work for admissible heuristics.
974. What is meant by consistent in state-space search?
a) Change in the desired literals
b) Not any change in the literals
c) No change in goal state

A. a) and b)
B. Only b)
C. Only c)
D. All of the above
E. None of the above
974. What is meant by consistent in state-space search?
a) Change in the desired literals
b) Not any change in the literals
c) No change in goal state

A. a) and b)
B. Only b)
C. Only c)
D. All of the above Consistent means that the completed actions
E. None of the above will not undo any desired literals.
975. Selective retention occurs when

a) we process, store, and retrieve information that we have already selected, organized,
and interpreted
b) we make choices to experience particular stimuli
c) we make choices to avoid particular stimuli
d) we focus on specific stimuli while ignoring other stimuli
975. Selective retention occurs when

a) we process, store, and retrieve information that we have already selected, organized,
and interpreted
b) we make choices to experience particular stimuli
c) we make choices to avoid particular stimuli
d) we focus on specific stimuli while ignoring other stimuli
976. Which of the following strategies would NOT be effective at improving your
communication competence?

a) Recognize the people, objects, and situations remain stable over time
b) Recognize that each person’s frame of perception is unique
c) Be active in perceiving
d) Distinguish facts from inference
976. Which of the following strategies would NOT be effective at improving your
communication competence?

a) Recognize the people, objects, and situations remain stable over time
b) Recognize that each person’s frame of perception is unique
c) Be active in perceiving
d) Distinguish facts from inference
977. How can you evaluate 1.25 + sqrt (144) in LISP?

a) 1.25+sqrt (1.44)
b) (1.25+sqrt (1.44))
c) (+1.25 sqrt (1.44)
d) All of the above
977. How can you evaluate 1.25 + sqrt (144) in LISP?

a) 1.25+sqrt (1.44)
b) (1.25+sqrt (1.44))
c) (+1.25 sqrt (1.44)
d) All of the above
978. When a top-level function is entered, the LISP processor does?

a) It reads the function entered

b) It prints the result returned by the function
c) Large memory and high-speed processor
d) All of the above
e) None of the above
978. When a top-level function is entered, the LISP processor does?

a) It reads the function entered

b) It prints the result returned by the function
c) Large memory and high-speed processor
d) All of the above
e) None of the above
979. In LISP, the following function (minusp (-20 4 8 8 1)) returns?

a) T
b) F
c) NIL
d) -20
979. In LISP, the following function (minusp (-20 4 8 8 1)) returns?

a) T
b) F
c) NIL
d) -20

FALSE = NIL
980. Why is the XOR problem exceptionally interesting to neural network researchers?

a) Because it can be expressed in a way that allows you to use a neural network
b) Because it is complex binary operation that cannot be solved using neural networks
c) Because it can be solved by a single layer perceptron
d) Because it is the simplest linearly inseparable problem that exists.
980. Why is the XOR problem exceptionally interesting to neural network researchers?

a) Because it can be expressed in a way that allows you to use a neural network
b) Because it is complex binary operation that cannot be solved using neural networks
c) Because it can be solved by a single layer perceptron
d) Because it is the simplest linearly inseparable problem that exists.
981. Why are linearly separable problems of interest of neural network researchers?

a) Because they are the only class of problem that network can solve successfully
b) Because they are the only class of problem that Perceptron can solve successfully
c) Because they are the only mathematical functions that are continue
d) Because they are the only mathematical functions you can draw
981. Why are linearly separable problems of interest of neural network researchers?

a) Because they are the only class of problem that network can solve successfully
b) Because they are the only class of problem that Perceptron can solve successfully
c) Because they are the only mathematical functions that are continue
d) Because they are the only mathematical functions you can draw
982. Which of the following is not the promise of artificial neural network?
a) It can explain result
b) It can survive the failure of some nodes
c) It has inherent parallelism
d) It can handle noise

A. a) and b)
B. Only a)
C. Only c)
D. a) and d)
E. c) and d)
982. Which of the following is not the promise of artificial neural network?
a) It can explain result
b) It can survive the failure of some nodes
c) It has inherent parallelism
d) It can handle noise

A. a) and b)
B. Only a)
C. Only c)
D. a) and d)
E. c) and d)
983. A perceptron adds up all the weighted inputs it receives, and if it exceeds a certain
value, it outputs a 1, otherwise it just outputs a 0.

a) True
b) False
c) Sometimes – it can also output intermediate values as well
d) Can’t say
983. A perceptron adds up all the weighted inputs it receives, and if it exceeds a certain
value, it outputs a 1, otherwise it just outputs a 0.

a) True
b) False
c) Sometimes – it can also output intermediate values as well
d) Can’t say
984. Which of the following is an application of NN (Neural Network)?
a) Sales forecasting
b) Data validation
c) Risk management

A. a) and c)
B. b) and c)
C. Only c)
D. Only b)
E. All of the above
984. Which of the following is an application of NN (Neural Network)?
a) Sales forecasting
b) Data validation
c) Risk management

A. a) and c)
B. b) and c)
C. Only c)
D. Only b)
E. All of the above
985. Which of the following is/are mainly used for automated reasoning?
a) Backward chaining
b) Forward chaining
c) Logic programming
d) Parallel programming

A. Only a) and b)
B. Only b) and c)
C. Only c)
D. Only d)
E. Only c) and d)
985. Which of the following is/are mainly used for automated reasoning?
a) Backward chaining
b) Forward chaining
Logic Programming is a strategy that researchers
c) Logic programming are utilizing to attempt to permit machines to
reason since it is helpful for information portrayal.
d) Parallel programming
Parallel programming/processing
By splitting a job in different tasks and executing
A. Only a) and b) them simultaneously in parallel, a significant boost
in performance can be achieved.
B. Only b) and c)
C. Only c)
D. Only d)
E. Only c) and d)
986. What will backward chaining algorithm will return It will contains the list of goals
containing a single element ?
a) Additional statements
b) Substitutes matching the query
c) Logical statement

A. a) and b)
B. Only b)
C. Only c)
D. All of the above
E. None of the above
986. What will backward chaining algorithm will return It will contains the list of goals
containing a single element ?
a) Additional statements
b) Substitutes matching the query
c) Logical statement

A. a) and b)
B. Only b)
C. Only c) It will contains the list of goals containing a
D. All of the above single element and returns the set of all
substitutions satisfying the query.
E. None of the above
987. The goals can be thought of and if all of them us satisfied means, then current branch
of proof succeeds. How can be the goal is thought of in backward chaining algorithm?

a) Queue
b) List
c) Stack
d) Either a) or c)
e) Either a) or b)
987. The goals can be thought of and if all of them us satisfied means, then current branch
of proof succeeds. How can be the goal is thought of in backward chaining algorithm?

a) Queue
b) List
c) Stack
d) Either a) or c)
e) Either a) or b)
988. Which of the Following problems can be modeled as Constraints Satisfaction Problems
CSP?
a) 8-Puzzle problem
b) 8-Queen problem
c) Map coloring problem

A. a) and b)
B. Only b)
C. Only c)
D. All of the above
E. None of the above
988. Which of the Following problems can be modeled as Constraints Satisfaction Problems
CSP?
a) 8-Puzzle problem
b) 8-Queen problem
c) Map coloring problem

A. a) and b)
B. Only b)
C. Only c)
D. All of the above
E. None of the above
CSP :- A solution is a way for assigning a value to each 8-Puzzle problem
variable in such a way that all constraints are satisfied  The eight queens puzzle is
by these values. the problem of
placing eight chess queens on
8-Puzzle problem an 8×8 chessboard so that no
 The puzzle can be solved by moving the tiles one by one two queens threaten each other.
in the single empty space and thus achieving the Goal  Thus, a solution requires that no
state.
two queens share the same row,
 Instead of moving the tiles in the empty space we can
visualize moving the empty space in place of the tile. column, or diagonal.
 The empty space cannot move diagonally and can take
only one step at a time.

Which algorithm is used in CSP ?

Map coloring problem problem variants of
 Graph/Map coloring problem is to assign colors to certain
elements of a graph subject to certain constraints.
backtracking, constraint propagation, and
 Vertex coloring is the most common graph coloring local search.
problem.
 The problem is, given m colors, find a way of coloring the A solution to a CSP is a complete.
vertices of a graph such that no two adjacent vertices are
Assignment that satisfies all constraints.
colored using same color.
989. What among the following constitutes to the incremental formulation of CSP?
a) Path cost
b) Goal cost
c) Successor function

A. a) and b)
B. Only b)
C. Only c)
D. All of the above
E. None of the above
989. What among the following constitutes to the incremental formulation of CSP?
a) Path cost
b) Goal cost
1) Initial state: The empty assignment ( ), in which
c) Successor function all variables are unassigned.

2) Successor function: A value can be assigned to

any unassigned variable, provided it does not
A. a) and b) conflict with previously assigned variables.
B. Only b)
3) Goal test: The current assignment is complete.
C. Only c)
4) Path cost: A constant cost (e.g., 1) for every step.
D. All of the above
E. None of the above
990. To overcome the need to backtrack in constraint satisfaction problem can be
eliminated by ____________

a) Forward Searching
b) Constraint Propagation
c) Backtrack after a forward search
d) Omitting the constraints and focusing only on goals
990. To overcome the need to backtrack in constraint satisfaction problem can be
eliminated by ____________

a) Forward Searching
b) Constraint Propagation
c) Backtrack after a forward search
d) Omitting the constraints and focusing only on goals
Forward Searching
 It is technique in which a
forward check till k steps is
made to analyze that the goal
can be achieved satiating all
constraints.
 With constraint propagation,
constraints on a variable can be
propagated to next
level/hierarchy and satisfied at
that level, eliminating need to
backtrack.
991. Consider a problem of preparing a schedule for a class of student.
What type of problem is this?
a) Search Problem
b) Backtrack Problem
c) CSP
d) Planning Problem

A. a) and b)
B. Only b)
C. Only c)
D. c) and d)
991. Consider a problem of preparing a schedule for a class of student.
What type of problem is this?
a) Search Problem
b) Backtrack Problem
c) CSP
d) Planning Problem

A. a) and b)
B. Only b) REASON
C. Only c) Schedule developer needs to consider all
constraints on teacher as well as students.
D. c) and d)
992. Constraint satisfaction problems on finite domains are typically
solved using a form of ___________
a) Search Algorithms
b) Heuristic Search Algorithms
c) Greedy Search Algorithms

A. a) and b)
B. Only b)
C. Only c)
D. All of the above
E. None of the above
992. Constraint satisfaction problems on finite domains are typically
solved using a form of ___________
a) Search Algorithms
b) Heuristic Search Algorithms
c) Greedy Search Algorithms

A. a) and b)
B. Only b)
C. Only c)
D. All of the above
Any Search techniques can be used
E. None of the above
993. Solving a constraint satisfaction problem on a finite domain is an/a ___________
problem with respect to the domain size.

a) P complete
b) NP complete
c) NP hard
d) Domain dependent
993. Solving a constraint satisfaction problem on a finite domain is an/a ___________
problem with respect to the domain size.

a) P complete
b) NP complete
c) NP hard
d) Domain dependent

A problem is called NP (non-deterministic polynomial) if :

 Its solution can be guessed and verified in polynomial time;

 non-deterministic means that no particular rule is followed to
make the guess.
994. ____________ is/are useful when the original formulation of a problem is altered in
some way, typically because the set of constraints to consider evolves because of the
environment.

a) Static CSPs
b) Dynamic CSPs
c) Flexible CSPs

A. a) and b)
B. Only b)
C. Only c)
D. All of the above
E. None of the above
994. ____________ is/are useful when the original formulation of a problem is altered in
some way, typically because the set of constraints to consider evolves because of the
environment.

a) Static CSPs
Flexible CSPs relax on Constraints
b) Dynamic CSPs
c) Flexible CSPs Language used for programming
Constraint Programming includes
Prolog
A. a) and b)
B. Only b)
C. Only c)
D. All of the above
E. None of the above
995. Which of the following algorithm(s) is/are in general used CSP search algorithm?
a) Breadth-first search algorithm
b) Depth-first search algorithm
c) Hill-climbing search algorithm

A. a) and b)
B. Only b)
C. Only c)
D. All of the above
E. None of the above
995. Which of the following algorithm(s) is/are in general used CSP search algorithm?
a) Breadth-first search algorithm
b) Depth-first search algorithm
c) Hill-climbing search algorithm

A. a) and b)
B. Only b)
C. Only c)
D. All of the above
E. None of the above
Provides backtrack facility.
996. Which are needed to compute the logical inference algorithm?
a) Logical equivalence
b) Validity
c) Satisfiability

A. a) and b)
B. Only b)
C. Only c)
D. All of the above
E. None of the above
996. Which are needed to compute the logical inference algorithm?
a) Logical equivalence
b) Validity
c) Satisfiability

A. a) and b)
B. Only b)
C. Only c)
D. All of the above
E. None of the above
997. Which search uses the problem specific knowledge beyond the definition of the
problem?

a) Informed search
b) Depth-first search
c) Breadth-first search
d) Uninformed search
997. Which search uses the problem specific knowledge beyond the definition of the
problem?

a) Informed search
b) Depth-first search
c) Breadth-first search What is the other name of informed search strategy?
d) Uninformed search Heuristic search

The four types of informed search method are

1) Best-first search
2) Greedy best-first search
3) A* search
4) memory bounded heuristic search
998. Which function will select the lowest expansion node at first for evaluation?
a) Greedy best-first search
b) Best-first search
c) Depth-first search

A. a) and b)
B. Only b)
C. Only c)
D. All of the above
E. None of the above
998. Which function will select the lowest expansion node at first for evaluation?
a) Greedy best-first search
b) Best-first search
c) Depth-first search

A. a) and b)
B. Only b)
C. Only c)
The lowest expansion node is selected because the
D. All of the above evaluation measures distance to the goal.
E. None of the above
999. _________ search uses only the linear space for searching and __________ is used to
search better by learning.

a) Best-first search, Depth-first search

b) Recursive best-first search, Metalevel state space
c) Depth-first search, Metalevel state space
d) Depth-first search, Recursive best-first search
999. _________ search uses only the linear space for searching and __________ is used to
search better by learning.

a) Best-first search, Depth-first search

b) Recursive best-first search, Metalevel state space
c) Depth-first search, Metalevel state space
d) Depth-first search, Recursive best-first search

Recursive best-first search will mimic the Metalevel state space search strategy will
operation of standard best-first search, help to problem solving efficiency by using
but using only the linear space. learning.
1000. Optimality of Breadth-first search is ___________

a) When there is less number of nodes

b) When all step costs are equal
c) When all step costs are unequal

A. a) and b)
B. Only b)
C. Only c)
D. All of the above
E. None of the above
1000. Optimality of Breadth-first search is ___________

a) When there is less number of nodes

b) When all step costs are equal
c) When all step costs are unequal

A. a) and b)
B. Only b)
C. Only c)
D. All of the above
E. None of the above
 Breadth-first search always expands Why Breadth-first search is optimal ?
the shallowest unexpanded node. Because it always expands the shallowest
unexpanded node.
If the solution exists in shallowest node no
Depth-first search always expands the irrelevant nodes are expanded.
deepest node in the current fringe of
the search tree.

Breadth-first search is optimal or not ?

YES

When Breadth-first search is optimal ?

When all step costs are equal
Copy protected with Online-PDF-No-Copy.com