Google News
logo
Artificial Intelligence - Quiz(MCQ)
A)
John McCarthy
B)
William S.
C)
Doug Cutting
D)
Allen Newell

Correct Answer :   John McCarthy


Explanation : John McCarthy, an American computer scientist pioneer and inventor, was called the “Father of Artificial Intelligence.” In his 1955 proposal for the 1956 Dartmouth Conference, the first artificial intelligence conference, the cognitive scientist coined the term. The intention was to see if there was a way to create a machine that could think abstractly, solve problems, and develop itself like a human. “Every aspect of learning or any other feature of intelligence can, in principle, be described so precisely that a machine can be made to simulate it,” he claimed.

A)
Fisher Ada & Allen Newell
B)
William S. & Doug Cutting
C)
Marvin Minsky & John McCarthy
D)
Rasmus Lerdorf & Alan Turing

Correct Answer :   Marvin Minsky & John McCarthy


Explanation :

Artificial intelligence is the ability of machines to perform certain tasks, which need the intelligence showcased by humans and animals. This definition is often ascribed to Marvin Minsky and John McCarthy from the 1950s, who were also known as the fathers of the field.
 
Artificial intelligence allows machines to understand and achieve specific goals. AI includes machine learning via deep learning. The former refers to machines automatically learning from existing data without being assisted by human beings. Deep learning allows the machine to absorb huge amounts of unstructured data such as text, images, and audio.

A)
Playing a game on Computer
B)
Making a Machine Intelligent
C)
Programming with your own intelligence
D)
Putting your intelligence into Computer

Correct Answer :   Making a Machine Intelligent


Explanation : Artificial intelligence is the simulation of human intelligence processes by machines, especially computer systems. Specific applications of AI include expert systems, natural language processing, speech recognition and machine vision.

A)
The embodiment of human intellectual capabilities within a computer
B)
The study of mental faculties through the use of mental models implemented on a computer
C)
A set of computer programs that produce output that would be considered to reflect intelligence if it were generated by humans
D)
All of the above

Correct Answer :   the embodiment of human intellectual capabilities within a computer

A)
Complex game
B)
Real-life situation
C)
Both (a) and (b)
D)
Small Search Space

Correct Answer :   Small Search Space


Explanation : Blind Search is also known as uninformed search, and it does not contain any domain information such as closeness, location of the goal, etc. Hence the most appropriate situation that can be used for the blind search is Small-search Space.

A)
Biology
B)
Sociology
C)
Philosophy
D)
All of the above

Correct Answer :   All of the above


Explanation : Philosophy, Sociology, Biology all three areas can contribute to build an intelligent system.

A)
TRUE
B)
FALSE
C)
AI is not used to answer question
D)
None of the above

Correct Answer :   FALSE


Explanation : A computer program with AI can answer the generic questions it is meant to solve.

A)
Unlimited memory
B)
Theory of mind
C)
Self-awareness
D)
Reactive machines

Correct Answer :   Unlimited memory


Explanation : There are four(4) types of artificial intelligence : reactive machines, limited memory, theory of mind and self-awareness.

A)
A statement is satisfiable if there is no interpretation for which it is true
B)
A statement is satisfiable if there is no interpretation for which it is false
C)
A statement is satisfiable if there is some interpretation for which it is true
D)
A statement is satisfiable if there is some interpretation for which it is false

Correct Answer :   A statement is satisfiable if there is some interpretation for which it is true


Explanation : ‘Satisfiable’ property is a statement is satisfiable if there is some interpretation for which it is true.

A)
Gaming
B)
Vision Systems
C)
Expert Systems
D)
All of the above

Correct Answer :   All of the above

A)
x/2
B)
(sqrt x)
C)
Sqrt(x)
D)
None of the above

Correct Answer :   (sqrt x)

A)
Locomotion
B)
Manipulation of physical object
C)
Printed language and synthesized speech
D)
All of the above

Correct Answer :   Printed language and synthesized speech

A)
Cognitive Artificial Intelligence approach
B)
Weak Artificial Intelligence approach
C)
Applied Artificial Intelligence approach
D)
Strong Artificial Intelligence approach

Correct Answer :   Cognitive Artificial Intelligence approach


Explanation : In the Cognitive Artificial Intelligence approach, a computer is used to test theories about how the human mind works, for example, theories about how we recognize faces and other objects, or about how we solve abstract problems.

A)
Stanford
B)
Harvard
C)
Dartmouth
D)
New York

Correct Answer :   Dartmouth

A)
Oxford University
B)
Stanford University
C)
Cambridge University
D)
Carnegie Mellon University.

Correct Answer :   Carnegie Mellon University.


Explanation : John McCarthy coined the term Artificial Intelligence. Demonstration of the first running AI program at Carnegie Mellon University.

A)
making a computer
B)
a computer-controlled robot
C)
software think intelligently
D)
All of the above

Correct Answer :   All of the above


Explanation : Artificial Intelligence is a way of making a computer, a computer-controlled robot, or a software think intelligently, in the similar manner the intelligent humans think.

A)
They are equal
B)
They are identical but of opposite sign
C)
They are unequal but of equal sign
D)
They are identical and of equal sign

Correct Answer :   They are identical but of opposite sign


Explanation : Two literals are complementary if They are identical but of opposite sign.

A)
Samples
B)
Words
C)
Codes
D)
Phonemes

Correct Answer :   Samples

A)
Single Test
B)
Two Test
C)
Sequence of Test
D)
No Test

Correct Answer :   Sequence of test


Explanation : A decision tree is the supervised machine learning technique that can be used for both Classification and Regression problems. It reaches its destination using a Sequence of Tests.

A)
syntactic ambiguity
B)
unclear antecedents
C)
multiple word meanings
D)
All of the above

Correct Answer :   All of the above

A)
LMI
B)
Xerox
C)
Symbolics
D)
Texas Instruments

Correct Answer :   Symbolics

A)
Vax
B)
Shakey
C)
Dedalus
D)
Robotics

Correct Answer :   Shakey

A)
speaking
B)
writing
C)
reading
D)
All of the above

Correct Answer :   speaking

A)
Inferential Adequacy
B)
Inferential Efficiency
C)
Representational Adequacy
D)
Representational Verification

Correct Answer :   Representational Verification

A)
Manipulator
B)
Actuator
C)
End effector
D)
Servomechanism

Correct Answer :   Manipulator

A)
Critical
B)
Analytical
C)
Heuristic
D)
Value based

Correct Answer :   Heuristic

A)
Easy to create a website
B)
It helps to deploy applications on the cloud
C)
It helps to exploit vulnerabilities to secure the firm
D)
Language understanding and problem-solving (Text analytics and NLP)

Correct Answer :   Language understanding and problem-solving (Text analytics and NLP)


Explanation : Language understanding and problem-solving come under the NLP and Text Analysis area which involves text recognition and sentiment analysis of the text. NLP ML model is trained to mainly do the task which processes human language’s speech or text. For example voice assistant.

A)
categorized into 5 categories
B)
categorized into 3 categories
C)
processes are categorized based on the input provided
D)
process is not categorized

Correct Answer :   categorized into 3 categories


Explanation :

It is categorized into 3 steps Sensing, Reasoning, Acting
i)  Sensing : Through the sensor taking in the data about the world
ii) Reasoning : Reasoning is thinking or processes the data sensed by the sensor.
iii) Action : On the basis of input and reasoning, acting is generating and controlling actions in the environment.

A)
Inferential Adequacy
B)
Inferential Efficiency
C)
Representational Adequacy
D)
All of the above

Correct Answer :   All of the above


Explanation : Consider an excellent knowledge representation system for a specific topic. Representational Adequacy, Inferential Adequacy, Inferential Efficiency, and Acquisitional Efficiency should be the qualities.

A)
Depth-First Search
B)
Breadth-First search
C)
Binary search
D)
Optimal-Linear Search

Correct Answer :   Depth-First Search

A)
Alan Turing
B)
Lofti Zadeh
C)
Donald Michie
D)
John McCarthy

Correct Answer :   Donald Michie

A)
contexts
B)
parameters
C)
production rules
D)
All of the above

Correct Answer :   All of the above

A)
Mobile
B)
Intelligent
C)
Non-Servo
D)
Open Loop

Correct Answer :   Intelligent


Explanation : If a robot is able to change its own trajectory as per the external conditions, then the robot is considered intelligent. Such type of agents come under the category of AI agents or Rational Agents.

A)
The Explorer
B)
Smalltalk
C)
The Personal Consultant
D)
The Computer-Based Consultant

Correct Answer :   The Explorer

A)
Actuator
B)
Performance
C)
Perceive
D)
Learning

Correct Answer :   Performance

A)
Neuron science
B)
Maths
C)
Geology
D)
Computer Science

Correct Answer :   Geology


Explanation : Geology can not contribute to build an intelligent system.

A)
Design
B)
Field service
C)
Distribution
D)
Project management

Correct Answer :   Design

A)
time and motion
B)
symbolic and numeric
C)
understanding and generation
D)
algorithmic and heuristic

Correct Answer :   algorithmic and heuristic

A)
pattern matching
B)
cognitive science
C)
relative symbolism
D)
heuristic processing

Correct Answer :   relative symbolism

A)
contains declarative knowledge
B)
contains procedural knowledge
C)
expects users to draw their own conclusions
D)
features the retrieval of stored information

Correct Answer :   contains procedural knowledge

A)
Connected word recognition
B)
Isolated word recognition
C)
Continuous speech recognition
D)
Speaker-dependent recognition

Correct Answer :   Speaker-dependent recognition

A)
hierarchical planning
B)
non-hierarchical planning
C)
project planning
D)
None of the above

Correct Answer :   hierarchical planning

A)
Sensor
B)
Actuator
C)
Capacitor
D)
Both (a) and (b)

Correct Answer :   Both (a) and (b)


Explanation : Sensors are used to perceive from the environment and actuators are used to act on the environment by the system.

A)
4
B)
3
C)
2
D)
1

Correct Answer :   2


Explanation :

There are two types of quantification. They are :
i)   Universal
ii)  Existential

A)
Applied approach
B)
Cognitive approach
C)
Weak approach
D)
Strong approach

Correct Answer :   Cognitive approach


Explanation : Cognitive approach is used to build a system which can behave and think like human beings and solve the problems.

A)
Cognitive approach
B)
Applied approach
C)
Weak approach
D)
Strong approach

Correct Answer :   Applied approach


Explanation : Applied approach aims to produce commercially viable “smart” systems such as, for example, a security system that recognizes the faces of people to provide access. The applied approach has already enjoyed considerable success.

A)
Helps in providing security
B)
Reduces the time taken to solve the problem
C)
Have the ability to think hence makes the work easier
D)
All of the above

Correct Answer :   All of the above


Explanation : Artificial intelligence creates a machine that can think and make decisions without human involvement.

A)
ILP
B)
Machine Learning
C)
First-order logic
D)
Propositional logic

Correct Answer :   ILP


Explanation : ILP (Inductive Logic Programming) is a subfield of artificial intelligence. Because ILP can participate in the scientific cycle of experimentation So that it can produce a flexible structure.

A)
robot vision
B)
edge detection
C)
binocular vision
D)
model-based vision

Correct Answer :   model-based vision

A)
Boolean Algebra
B)
Turing Test
C)
Logarithm
D)
Algorithm

Correct Answer :   Turing Test


Explanation : In the year 1950, mathematician and computing pioneer Alan Turing introduced a test to determine whether a machine can think like a human or not, which means it can demonstrate intelligence, known as the Turing Test. It was based on the "Imitation game" with some modifications. This technique is still a measure of various successful AI projects, with some updates.

A)
DFS/BFS algorithm
B)
Min/Max algorithm
C)
Greedy Search Algorithm
D)
Heuristic Search Algorithm

Correct Answer :   Min/Max algorithm


Explanation : A game tree is a directed graph whose nodes represent the positions in Game and edges represent the moves. To make any decision, the game tree uses the Min/Max algorithm. The Min/Max algorithm is the preferred one over other search algorithms, as it provides the best move to the player, assuming that the opponent is also playing Optimally.

A)
Condition-action rule
B)
Simple-action rule
C)
Simple &Condition-action rule
D)
None of the above

Correct Answer :   Condition-action rule


Explanation : The simple reflex agent takes decisions only on the current condition and acts accordingly; it ignores the rest of history; hence it follows the Condition-action rule.

A)
ZetaLISP
B)
InterLISP
C)
Smalltalk
D)
Ethernet

Correct Answer :   Smalltalk

A)
Detect when solution will be found
B)
Detect whether solution exists or not
C)
Detect whether multiple solutions exist
D)
Detect when a solution has been found

Correct Answer :   Detect when a solution has been found


Explanation : Third component of a planning system is to detect when a solution has been found.

A)
Learning theory
B)
Utility functions
C)
Current perception
D)
Perception history

Correct Answer :   Current perception


Explanation : These agents select actions based on the current perception, ignoring the rest of the perception history.

A)
Weak Artificial Intelligence
B)
Strong Artificial Intelligence
C)
Applied Artificial Intelligence
D)
All of the above

Correct Answer :   All of the above


Explanation :

* Strong Artificial Intelligence aims to build machines that can truly reason and solve problems.
* Weak Artificial Intelligence deals with the creation of some form of computer-based artificial intelligence that cannot truly reason and solve problems, but can act as if it were intelligent.
* Applied Artificial Intelligence aims to produce commercially viable “smart” systems.
* In the Cognitive Artificial Intelligence approach, a computer is used to test theories about how the human mind works.

A)
Graphics
B)
More characters
C)
Clearer characters
D)
All of the above

Correct Answer :   More characters

A)
ICOT (Institute for New Generation Computer Technology)
B)
SCP (Strategic Computing Program)
C)
MITI (Ministry of International Trade and Industry)
D)
MCC (Microelectronics and Computer Technology Corporation)

Correct Answer :   ICOT (Institute for New Generation Computer Technology)

A)
History
B)
Sociology
C)
Psychology
D)
Cognitive science

Correct Answer :   Cognitive science

A)
Human logic
B)
Expert reason
C)
Expert system
D)
Personal information

Correct Answer :   Expert system

A)
Justice
B)
Energy
C)
Defense
D)
Education

Correct Answer :   Defense

A)
Budget projections
B)
Business decisions
C)
Vacation schedules
D)
Visual presentations

Correct Answer :   Business decisions

A)
Strong approach
B)
Weak approach
C)
Applied approach
D)
Cognitive approach

Correct Answer :   Strong approach


Explanation : The goal of a strong approach is to create machines that can really think and solve problems. These machines must be self-aware, and their total cognitive aptitude must be comparable to that of a human person. Strong approach argues that robots can have cognitive mental states if they are properly developed.

A)
NaturalLink
B)
PROLOG
C)
Ethernet
D)
None of the above

Correct Answer :   NaturalLink

A)
robot vision
B)
edge detection
C)
binocular vision
D)
model-based vision

Correct Answer :   model-based vision

A)
Mark Fox
B)
Bruce Lee
C)
Ed Feigenbaum
D)
Randy Davis

Correct Answer :   Ed Feigenbaum

A)
Weak Artificial Intelligence approach
B)
Strong Artificial Intelligence approach
C)
Cognitive Artificial Intelligence approach
D)
Applied Artificial Intelligence approach

Correct Answer :   Applied Artificial Intelligence approach


Explanation : Applied Artificial Intelligence approach aims to produce commercially viable “smart” systems such as, for example, a security system that is able to recognize the faces of people who permitted to enter a particular building. Applied Artificial Intelligence has already enjoyed considerable success.

A)
artificial science
B)
human intelligence
C)
cognitive science
D)
heuristic processing

Correct Answer :   human intelligence

A)
Expert system
B)
Artificial intelligence
C)
Database management system
D)
Management information System

Correct Answer :   Expert system

A)
chess
B)
cricket
C)
checkers
D)
football

Correct Answer :   checkers

A)
To discover something or an idea embedded in a program
B)
To compare two nodes in a search tree to see if one is better than the other is
C)
To search and measure how far a node in a search tree seems to be from a goal
D)
All of the above

Correct Answer :   All of the above


Explanation : In a heuristic approach, we discover certain idea and use heuristic functions to search for a goal and predicates to compare nodes.

A)
۷x: dog(y) àhastail(x)
B)
۷x: dog(x) àhastail(y)
C)
۷x: dog(x) àhastail(x)
D)
۷x: dog(x) àhasàtail(x)

Correct Answer :   Û·x: dog(x) àhastail(x)


Explanation : We represent the statement in mathematical logic taking ‘x ‘as Dog and which has tail. We cannot represent two variable x, y for the same object Dog that has tail. The symbol “Û· “represent all.

A)
frame-based CAI
B)
intelligent CAI
C)
generative CAI
D)
problem-solving CAI

Correct Answer :   frame-based CAI

A)
The probability that hypotheses Hi is true given evidence E
B)
The probability that hypotheses Hi is false given evidence E
C)
The probability that hypotheses Hi is true given false evidence E
D)
The probability that hypotheses Hi is false given false evidence E

Correct Answer :   The probability that hypotheses Hi is true given evidence E

A)
Applied Artificial Intelligence approach
B)
Cognitive Artificial Intelligence approach
C)
Strong Artificial Intelligence approach
D)
Weak Artificial Intelligence approach

Correct Answer :   Weak Artificial Intelligence approach


Explanation : Weak Artificial Intelligence deals with the creation of some form of computer-based artificial intelligence that cannot truly reason and solve problems, but can act as if it were intelligent. Weak Artificial Intelligence holds that suitably programmed machines can simulate human cognition.

A)
robot vision control
B)
contact sensing control
C)
continuous-path control
D)
pick-and-place control

Correct Answer :   continuous-path control

A)
AI
B)
LISP
C)
CL (Common Lisp)
D)
Both LISP and CL

Correct Answer :   LISP

A)
LISP machines
B)
Microcomputers
C)
Personal computers
D)
All of the above

Correct Answer :   LISP machines

A)
Second
B)
Third
C)
Fourth
D)
Fifth

Correct Answer :   Fifth

A)
hydraulic
B)
electric
C)
pneumatic
D)
both hydraulic & pneumatic

Correct Answer :   hydraulic

A)
MIT
B)
Xerox
C)
Texas Instruments
D)
All of the above

Correct Answer :   Texas Instruments

A)
intelligent planner
B)
expert system
C)
automatic processor
D)
operational symbolizer

Correct Answer :   expert system

A)
editors
B)
debuggers
C)
assemblers, compilers and interpreters
D)
All of the above

Correct Answer :   All of the above

A)
LISP
B)
BASIC
C)
FORTRAN
D)
IPL(Inductive logic programming)

Correct Answer :   LISP

A)
SIMD
B)
SISD
C)
MIMD
D)
MISD

Correct Answer :   MIMD

A)
DU
B)
MIT
C)
RAMD
D)
BACON

Correct Answer :   BACON

A)
Bitonic reasoning
B)
Analogical reasoning
C)
Monotonic reasoning
D)
Non-monotonic reasoning

Correct Answer :   Non-monotonic reasoning

A)
The overall power of the system
B)
Ease with which the method can be adapted to different domains of application
C)
A learning system to function with unreliable feedback and with a variety of training examples
D)
The average time required to construct the target knowledge structures from some specified initial structures

Correct Answer :   Ease with which the method can be adapted to different domains of application


Explanation : Generality is the measure of the ease with which the method can be adapted to different domains of application.

A)
What to say
B)
Why it is being used
C)
When to say something
D)
Both what to say & when to say something

Correct Answer :   What to say

A)
corporations
B)
department of Defense
C)
educational institutions
D)
All of the above

Correct Answer :   educational institutions

A)
Tree Network
B)
Star Network
C)
Transition Network
D)
Complete Network

Correct Answer :   Transition Network

A)
height and weight
B)
depth and texture
C)
color and motion
D)
color and motion, depth and texture

Correct Answer :   color and motion, depth and texture

A)
Agent
B)
Sensor
C)
Design problem
D)
None of the above

Correct Answer :   Design problem


Explanation : The design problem depends on the percepts and actions available to the agent, the goals that the agent’s behavior should satisfy.

A)
Perl
B)
Java
C)
LISP
D)
PROLOG

Correct Answer :   Perl


Explanation : 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.

A)
Agent
B)
Problem
C)
Solution
D)
Observation

Correct Answer :   Problem


Explanation : Task environments will pose a problem and rational agent will find the solution for the posed problem.

A)
Offline search
B)
Online search
C)
Depth-first search
D)
Breadth-first search

Correct Answer :   Online search


Explanation : In online search, it will first take an action and then observes the environment.

A)
Sensors
B)
Actuators
C)
Perceiver and Sensor
D)
Sensors and Actuators

Correct Answer :   Sensors and Actuators


Explanation : An agent is anything that can be viewed as perceiving and acting upon the environment through the sensors and actuators.

A)
Utility based
B)
Model based
C)
Target based
D)
Simple reflex

Correct Answer :   Target based


Explanation : The four types of agents are Simple reflex, Model based, Goal based and Utility based agents.

A)
An agent is anything that can perceive its environment through sensors
B)
An agent is anything that can control its environment through sensors
C)
An agent is anything that can change its environment through sensors
D)
None of the Above

Correct Answer :   An agent is anything that can perceive its environment through sensors


Explanation : An agent is anything that can perceive its environment through sensors and acts upon that environment through effectors

A)
Complex algorithm
B)
Conditional algortihm
C)
Decision-making algorithm
D)
None of the Above

Correct Answer :   Decision-making algorithm


Explanation : Decision-making and learning algorithms can operate over the joint state space and thereby serve to implement and used to improve the computational activities.

A)
MASE
B)
MEMS
C)
Sensors
D)
Actuators

Correct Answer :   MEMS


Explanation : Micro Electro Mechanical System(MEMS) uses miniaturized accelerometers and gyroscopes and is used to produce actuators.

A)
Performance Measure, Entity, Actuators, and Sensors
B)
Perceptual Measure, Environment, Actuators, and Sensors
C)
Performance Measure, Environment, Agent Function, and Sensors
D)
Performance Measure, Environment, Actuators, and Sensors

Correct Answer :   Performance Measure, Environment, Actuators, and Sensors


Explanation : The problem the agent solves is characterized by Performance Measure, Environment, Actuators, and Sensors (PEAS).

A)
Architecture
B)
Agent Program
C)
Architecture + Agent Program
D)
None of the Above

Correct Answer :   Architecture + Agent Program


Explanation : Agent's structure can be viewed as - Agent = Architecture + Agent Program

A)
Computers in space and earth
B)
Image categorization techniques
C)
Statistical data on image pixel intensity value and histograms
D)
All of the above

Correct Answer :   All of the above


Explanation : An environment is something which agent stays in.

A)
Fully Observable
B)
Partially Observable
C)
Both (a) and (b)
D)
None of the above

Correct Answer :   Fully Observable


Explanation : In crossword puzzle an agent knows the complete state of the environment through its sensors.

A)
Episodic
B)
Partially Observable
C)
Semi-Static
D)
Single agent

Correct Answer :   Partially Observable


Explanation : System knows the current status of the analysis thought its inputs.

A)
Sensors
B)
Actuators
C)
Filtering algorithm
D)
None of the above

Correct Answer :   Filtering algorithm


Explanation : Filtering algorithm is used for tracking uncertain events because in this the real perception is involved.

A)
Objects
B)
Relations
C)
Both Objects & Relations
D)
None of the above

Correct Answer :   Both Objects & Relations


Explanation : Objects and relations are not represented by using propositional logic explicitly.

A)
Partial
B)
Rational
C)
Stochastic
D)
Deterministic

Correct Answer :   Deterministic


Explanation : If the environment is deterministic except for the action of other agent is called deterministic.

A)
Environment Generator
B)
Environment creator
C)
Both (a) and (b)
D)
None of the above

Correct Answer :   Environment Generator

A)
Agent performance changes
B)
Environment will be changed
C)
Environment does not change with the passage of time
D)
Environment does not change with the passage of time, but Agent performance changes

Correct Answer :   Environment does not change with the passage of time, but Agent performance changes

A)
A goal state is denied access
B)
A goal state is unreachable from any state
C)
A goal state is reachable from every state
D)
None of the above

Correct Answer :   A goal state is reachable from every state

A)
Reflex agent
B)
Learning agent
C)
Observing agent
D)
None of the above

Correct Answer :   Learning agent


Explanation : Simple reflex agent is based on the present condition and so it is condition action rule.

A)
Learning agent
B)
Utility based agent
C)
Model based agent
D)
Simple reflex agent

Correct Answer :   Utility based agent


Explanation : A utility function maps a state onto a real number which describes the associated degree of happiness.

A)
Plan
B)
Search
C)
Retrieve
D)
Search & Plan

Correct Answer :   Search & Plan


Explanation : When the environment becomes more tricky means, the agent needs plan and search action sequence to achieve the goal.

A)
No agent / Multiple agents
B)
Static / Dynamic
C)
Discrete / Continuous
D)
Deterministic / Non-deterministic

Correct Answer :   No agent / Multiple agents

A)
RBFS
B)
SMA*
C)
Hill-climbing search algorithm
D)
Both RBFS & SMA*

Correct Answer :   Both RBFS & SMA*


Explanation : RBFE and SMA* will solve any kind of problem that A* can’t by using limited amount of memory.

A)
Solve the given problem and reach to goal
B)
To find out which sequence of action will get it to the goal state
C)
Both (a) and (b)
D)
None of the above

Correct Answer :   Both (a) and (b)

A)
Representing your problem with variable and parameter
B)
The whole problem
C)
Problem you design
D)
Your Definition to a problem

Correct Answer :   Representing your problem with variable and parameter


Explanation : 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. eg. You have given a 4-gallon jug and another 3-gallon jug. 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 4 gallons. 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 4 gallon jug and y represents the quantity of water in the 3-gallon jug.

A)
Breadth-first search
B)
Depth-first search
C)
Depth-limited search
D)
None of the above

Correct Answer :   Depth-first search


Explanation : It implements stack operation because it always expands the deepest node in the current tree.

A)
Admissibility
B)
Problem Instance
C)
Problem Space
D)
Problem Space Graph

Correct Answer :   Problem Instance


Explanation : Problem Instance : It is Initial state + Goal state.

A)
b^2
B)
b
C)
b^b
D)
b^d

Correct Answer :   b^d


Explanation : Time Complexity of Breadth First search algorithm is b^d.

A)
Informed Search
B)
Heuristic Search
C)
Uninformed Search
D)
Informed & Unformed Search

Correct Answer :   Uninformed Search


Explanation : In case of uninformed search no additional information except the problem definition is given.

A)
Bidirectional Search
B)
Depth First Search (DFS)
C)
Breadth First Search (BFS)
D)
All of the above

Correct Answer :   All of the above


Explanation : Several uninformed search techniques includes BFS, DFS, Uniform-cost, Depth-limited, Bidirectional search etc.

A)
Heuristic search
B)
Simple search
C)
Online search
D)
None of the above

Correct Answer :   Heuristic search

A)
To discover something or an idea embedded in a program
B)
To compare two nodes in a search tree to see if one is better than another
C)
To search and measure how far a node in a search tree seems to be from a goal
D)
All of the above

Correct Answer :   All of the above


Explanation : In a heuristic approach, we discover certain idea and use heuristic functions to search for a goal and predicates to compare nodes.

A)
Evaluation function returning highest evaluation
B)
Evaluation function returning lowest evaluation
C)
Evaluation function returning lowest & highest evaluation
D)
None of the above

Correct Answer :   Evaluation function returning lowest evaluation


Explanation : 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 an evaluation function, f (n). Traditionally, the node with the lowest evaluation is selected for expansion, because the evaluation measures distance to the goal.

A)
Length of the shortest path from initial state to goal state.
B)
A property of an algorithm to always find an optimal solution.
C)
The average number of child nodes in the problem space graph.
D)
None of the Above

Correct Answer :   The average number of child nodes in the problem space graph.


Explanation : Branching Factor : The average number of child nodes in the problem space graph.

A)
Extraction
B)
Mining of data
C)
Abstraction
D)
Information Retrieval

Correct Answer :   Abstraction


Explanation : The process of removing detail from a representation is called abstraction.

A)
More time
B)
Less memory
C)
Finds a solution in large infinite space
D)
Less memory & Finds a solution in large infinite space

Correct Answer :   Less memory & Finds a solution in large infinite space


Explanation : Two advantages: (1) they use very little memory-usually a constant amount; and (2) they can often find reasonable solutions in large or infinite (continuous) state spaces for which systematic algorithms are unsuitable.

A)
No neighbor has higher value
B)
Stopping criterion met
C)
Global Min/Max is achieved
D)
All of the above

Correct Answer :   No neighbor has higher value

A)
Online agent
B)
Goal Based & Online agent
C)
Offline agent
D)
Both (a) and (c)

Correct Answer :   Goal Based & Online agent

A)
Local Beam search
B)
Hill-Climbing search
C)
Random restart hill-climbing search
D)
Stochastic hill-climbing search

Correct Answer :   Local Beam search

A)
Local Search Problems
B)
Uninformed Search Problems
C)
Constraints Satisfaction Problems
D)
All of the above

Correct Answer :   Constraints Satisfaction Problems

A)
Constraint Propagation
B)
Backtrack after a forward search
C)
Local Beam search
D)
Forward Searching

Correct Answer :   Forward Searching


Explanation : Forward Searching 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.

A)
CSA
B)
CSP
C)
Planning Problem
D)
Backtrack Problem

Correct Answer :   CSP


Explanation : Schedule developer needs to consider all constraints on teacher as well as students.

A)
NP hard
B)
P Complete
C)
NP complete
D)
Domain dependent

Correct Answer :   NP complete

A)
Constraints
B)
Goal State
C)
Initial State
D)
Current State

Correct Answer :   Constraints

A)
Recursion
B)
First in first out
C)
Last in first out
D)
Both Last in first out & Recursion

Correct Answer :   Both Last in first out & Recursion

A)
Breadth-first search algorithm
B)
Hill-climbing search algorithm
C)
Depth-first search algorithm
D)
None of the above

Correct Answer :   Depth-first search algorithm

A)
Uniform Cost Search
B)
Bidirectional Search
C)
Iterative Deepening Depth-First Search
D)
None of the Above

Correct Answer :   Bidirectional Search


Explanation : Bidirectional Search searches forward from initial state and backward from goal state till both meet to identify a common state.

A)
Breadth-First-Search
B)
Best-First-Search
C)
Depth-First-Search
D)
Uniform Cost Search

Correct Answer :   Best-First-Search


Explanation : Best-first-search is giving the idea of optimization and quick choose of path, and all these characteristic lies in A* algorithm.

A)
Lowest path cost
B)
Average path cost
C)
Cheapest path from root to goal node
D)
Estimated cost of cheapest path from root to goal node

Correct Answer :   Estimated cost of cheapest path from root to goal node

A)
Deepest
B)
Shallowest
C)
Minimum heuristic cost
D)
The one closest to the goal node

Correct Answer :   The one closest to the goal node


Explanation : Sometimes minimum heuristics can be used, sometimes maximum heuristics function can be used. It depends upon the application on which the algorithm is applied.

A)
Initial state
B)
Last state
C)
Intermediate state
D)
None of the above

Correct Answer :   Initial state


Explanation : A problem has four components initial state, goal test, set of actions, path cost.

A)
Breadth-first algorithm
B)
Bidirectional search algorithm
C)
Tree algorithm
D)
None of the above

Correct Answer :   Tree algorithm


Explanation : Tree algorithm is used because specific variants of the algorithm embed different strategies.

A)
O(b)
B)
O(bm)
C)
O(m)
D)
O(bl)

Correct Answer :   O(bm)


Explanation : O(bm) is the space complexity where b is the branching factor and m is the maximum depth of the search tree.

A)
Model based agent
B)
Intelligent goal-based agent
C)
Simple reflex agent
D)
Problem-solving agent

Correct Answer :   Intelligent goal-based agent

A)
A set of Rule
B)
A sequence of steps
C)
Arbitrary representation to problem
D)
Set of Rule & sequence of steps

Correct Answer :   Set of Rule & sequence of steps


Explanation : 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.

A)
Linear approach
B)
Random approach
C)
An Optimal approach
D)
Heuristic approach (Some knowledge is stored)

Correct Answer :   Heuristic approach (Some knowledge is stored)


Explanation : We use a 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.

A)
LIFO
B)
LILO
C)
FILO
D)
FIFO

Correct Answer :   LIFO


Explanation : Depth-First Search implemented in recursion with LIFO stack data structure.

A)
This algorithm is neither complete, nor optimal.
B)
may not terminate and go on infinitely on one path
C)
It can get stuck in loops. It is not optimal.
D)
There can be multiple long paths with the cost ≤ C*

Correct Answer :   It can get stuck in loops. It is not optimal.


Explanation : The disadvantage of Greedy Best First Search is that it can get stuck in loops. It is not optimal.

A)
3
B)
4
C)
5
D)
6

Correct Answer :   4


Explanation : The four types of informed search method are best-first search, Greedy best-first search, A* search and memory bounded heuristic search.

A)
3
B)
4
C)
5
D)
6

Correct Answer :   5


Explanation : The five types of uninformed search method are Breadth-first, Uniform-cost, Depth-first, Depth-limited and Bidirectional search.

A)
O(d2) and O(d2)
B)
O(b2) and O(d2)
C)
O(d2) and O(b2)
D)
O(bd+1) and O(bd+1)

Correct Answer :   O(bd+1) and O(bd+1)


Explanation : We consider a hypothetical state space where every state has b successors. The root of the search tree generates b nodes at the first level, each of which generates b more nodes, for a total of b2 at the second level. Each of these generates b more nodes, yielding b3 nodes at the third level, and so on. Now suppose that the solution is at depth d. In the worst case, we would expand all but the last node at level d (since the goal itself is not expanded), generating bd+1- b nodes at level d+1.

A)
When all step costs are equal
B)
When all step costs are unequal
C)
When there is less number of nodes
D)
None of the above

Correct Answer :   When all step costs are equal

A)
f(n) = h(n)
B)
f(n) > h(n)
C)
f(n) < h(n)
D)
f(n) != h(n)

Correct Answer :   f(n) = h(n)

A)
Single-agent
B)
Multi-agent
C)
Only Single-agent and Multi-agent
D)
Neither Single-agent nor Multi-agent

Correct Answer :   Only Single-agent and Multi-agent


Explanation : Depending upon games it could be single agent (Sudoku) or multi-agent (Chess).

A)
Cooperative Environment
B)
Competitive Environment
C)
Only Competitive and Cooperative Environment
D)
Neither Competitive nor Cooperative Environment

Correct Answer :   Competitive Environment


Explanation : Since in cooperative environment agents’ goals are I conflicts. They compete for goal.

A)
Same as of DFS
B)
Same as BFS
C)
Space – bm and time – bm
D)
Time – bm and space – bm

Correct Answer :   Same as of DFS

A)
Single player
B)
Two player
C)
Three player
D)
Multiplayer

Correct Answer :   Multiplayer


Explanation : Zero sum games could be multiplayer games as long as the condition for zero sum game is satisfied.

A)
Root is independant
B)
Every states are dependant
C)
Pruned leaves x and y
D)
None of the above

Correct Answer :   Pruned leaves x and y


Explanation : The minimax decision are independant of the values of the pruned values x and y because of the root values.

A)
4 States
B)
6 States
C)
8 States
D)
10 states

Correct Answer :   6 States


Explanation : Alpha–beta pruning can be applied to trees of any depth and it is possible to prune entire subtree rather than leaves.

A)
Hill-climbing search
B)
Breadth-first search
C)
Depth-first search
D)
All of the above

Correct Answer :   Depth-first search


Explanation : The minimax search is depth-first search, So at one time we just have to consider the nodes along a single path in the tree.

A)
Evaluation function
B)
Transposition
C)
Alpha-beta pruning
D)
None of the above

Correct Answer :   Evaluation function


Explanation : Because we need to cut the search off at some point and apply an evaluation function that gives an estimate of the utility of the state.

A)
Hash table of previously seen positions
B)
Next value in the search
C)
Hash table of next seen positions
D)
None of the above

Correct Answer :   Hash table of previously seen positions

A)
Alpha = max
B)
Beta = max
C)
Beta = min
D)
Both Alpha = max & Beta = min

Correct Answer :   Both Alpha = max & Beta = min


Explanation : Alpha and beta are the values of the best choice we have found so far at any choice point along the path for MAX and MIN.

A)
Best-first search
B)
State-space search
C)
Depth-first search
D)
Hill-climbing search

Correct Answer :   State-space search


Explanation : The straightforward approach for planning algorithm is state space search because it takes into account of everything for finding a solution.

A)
Effects
B)
Preconditions
C)
Postconditions
D)
Both Preconditions & Effects

Correct Answer :   Both Preconditions & Effects


Explanation : The state-space search takes both precondition and effects into account for solving a problem.

A)
Test planning
B)
Regression planning
C)
Progression planning
D)
None of the above

Correct Answer :   Progression planning


Explanation : It is sometimes called as progression planning, because it moves in the forward direction.

A)
Regression planning
B)
Test planning
C)
State planning
D)
Progression planning

Correct Answer :   Regression planning


Explanation : Backward state-space search will find the solution from goal to the action, So it is called as Regression planning.

A)
Error
B)
Termination
C)
Success
D)
Compilation

Correct Answer :   Termination

A)
Goal independence
B)
Subgoal independence
C)
Both Goal & Subgoal independence
D)
None of the above

Correct Answer :   Subgoal independence


Explanation : Subgoal independence approach is to pretend that a pure divide and conquer algorithm will work for admissible heuristics.

A)
Inductive Systems
B)
Search Based Systems
C)
Deductive Systems
D)
Reasoning with Knowledge Based Systems

Correct Answer :   Deductive Systems

A)
Expressiveness
B)
Many-sorted Logic
C)
Formalizing Natural Languages
D)
All of the above

Correct Answer :   All of the above

A)
Quantification Theory
B)
Lower Order Calculus
C)
First Order Predicate Calculus
D)
All of the above

Correct Answer :   All of the above

A)
Atomic sentences
B)
Complex sentences
C)
Composition sentences
D)
None of the above

Correct Answer :   Atomic sentences

A)
Symbols
B)
Logical connectives
C)
Connectives
D)
All of the above

Correct Answer :   Logical connectives

A)
3
B)
4
C)
5
D)
6

Correct Answer :   5


Explanation : The five logical symbols are negation, conjunction, disjunction, implication and biconditional.

A)
First-order logic
B)
Alpha-beta pruning
C)
Semantics of propositional logic
D)
Both Semantics of propositional logic & Alpha-beta pruning

Correct Answer :   Semantics of propositional logic


Explanation : Because the meaning of the sentences is really needed to compute the truth.

A)
Validity
B)
Satisfiability
C)
Logical equivalence
D)
All of the above

Correct Answer :   All of the above


Explanation : Logical inference algorithm can be solved be using logical equivalence, Validity and satisfiability.

A)
Resolution
B)
Reform
C)
Reference
D)
None of the above

Correct Answer :   Resolution


Explanation : Because resolution yields a complete inference rule when coupled with any search algorithm.

A)
Combine clause
B)
Unit clause
C)
Multiple clause
D)
All of the above

Correct Answer :   Unit clause

A)
Single rule
B)
Module rule
C)
Inference rule
D)
Both Module rule & Inference rule

Correct Answer :   Inference rule

A)
Clauses
B)
Variables
C)
Proposition
D)
Propositional resolution

Correct Answer :   Propositional resolution

A)
Every sentence of inference
B)
Every sentence of first-order logic
C)
Every sentence of propositional logic
D)
None of the above

Correct Answer :   Every sentence of first-order logic

A)
Original statement
B)
Search statement
C)
Reading statement
D)
Replaced statement

Correct Answer :   Original statement


Explanation : The CNF statement will be unsatisfiable just when the original sentence is unsatisfiable.

A)
Removal of redundant literal
B)
Addition of redundant literal
C)
Addition of redundant variable
D)
Removal of redundant variable

Correct Answer :   Removal of redundant literal

A)
Sentence is satisfiable
B)
Sentence remains the same
C)
Sentence is unsatisfiable
D)
None of the above

Correct Answer :   Sentence is unsatisfiable


Explanation : Resolution is refutation-complete, if a set of sentence is unsatisfiable, then resolution will always be able to derive a contradiction.

A)
Added as three
B)
Reduced to one
C)
Remains the same
D)
None of the above

Correct Answer :   Reduced to one


Explanation : Propositional factoring reduces two literals to one if they are identical.

A)
Atomic sentences
B)
No further inference
C)
Complex sentences
D)
All of the above

Correct Answer :   No further inference


Explanation : Forward chain can grow by adding new atomic sentences until no further inference is made.

A)
Inference
B)
Resolution
C)
Conjunction
D)
First-order definite clauses

Correct Answer :   First-order definite clauses

A)
Conjunct ordering
B)
Data complexity
C)
Constraint variable
D)
None of the above

Correct Answer :   Conjunct ordering


Explanation : Conjunct ordering will find an ordering to solve the conjuncts of the rule premise so that the total cost is minimized.

A)
New fact
B)
Old fact
C)
Narrow fact
D)
All of the above

Correct Answer :   New fact

A)
First-order definite clause are mismatch to propositional forward chaining
B)
First-order definite clause are similar to propositional forward chaining
C)
Both (a) and (b)
D)
None of the above

Correct Answer :   First-order definite clause are similar to propositional forward chaining


Explanation : Fixed point reached by forward chaining with first-order definiteclause are similar to those for propositional forward chaining.

A)
Positive literal
B)
Negative literal
C)
Neutral literal
D)
Generalized modus ponens

Correct Answer :   Generalized modus ponens


Explanation : Definite clauses are a suitable normal form for use with generalized modus ponen.

A)
Existentially quantified
B)
Universally quantified
C)
Both (a) and (b)
D)
None of the above

Correct Answer :   Universally quantified


Explanation : First-order literals will accept variables only if they are universally quantified.

A)
Hill-climb algorithm
B)
Forward chaining
C)
Backward chaining
D)
None of the above

Correct Answer :   Backward chaining


Explanation : Backward chaining algorithm will work backward from the goal and it will chain the known facts that support the proof.

A)
Logical statement
B)
Additional statements
C)
Substitutes matching the query
D)
All of the above

Correct Answer :   Substitutes matching the query


Explanation : It will contains the list of goals containing a single element and returns the set of all substitutions satisfying the query.

A)
Stack
B)
List
C)
Vector
D)
Queue

Correct Answer :   Stack


Explanation : The goals can be thought of as stack and if all of them us satisfied means, then current branch of proof succeeds.

A)
Breadth-first search algorithm
B)
Depth-first search algorithm
C)
Hill-climbing search algorithm
D)
All of the above

Correct Answer :   Depth-first search algorithm


Explanation : It is depth-first search algorithm because its space requirements are linear in the size of the proof.

A)
Graph
B)
Vector
C)
Variables
D)
Expressing knowledge in a formal language

Correct Answer :   Expressing knowledge in a formal language


Explanation : Logic programming can be constructed by expressing knowledge in a formal expression and the problem can be solved by running inference process.

A)
Variable check
B)
Proposition check
C)
Occur check
D)
Both Occur & Proposition check

Correct Answer :   Occur check


Explanation : Occur check is omitted in prolog unification algorithm because of unsound inferences.

A)
Complexity
B)
Incompleteness
C)
Repeated states
D)
Both Repeated states & Incompleteness

Correct Answer :   Both Repeated states & Incompleteness

A)
Logic programming
B)
Backward chaining
C)
Forward chaining
D)
Parallel Programming

Correct Answer :   Logic programming


Explanation : Logic programming is mainly used to check the working process of the system.

A)
Partially Observable
B)
Completely Observable
C)
Only Completely and Partially Observable
D)
Neither Completely nor Partially Observable

Correct Answer :   Partially Observable


Explanation : Knowledge and reasoning could aid to reveal other factors that could complete environment.

A)
Knowledge based Game
B)
Reasoning with Knowledge
C)
Single player Game
D)
Two player Game

Correct Answer :   Reasoning with Knowledge


Explanation : Refer the definition of Wumpus World Problem.

A)
It is truth preserving
B)
It can derive any sentence
C)
It can derive any sentence that is an entailed version
D)
It can derive any sentence that is an entailed version & It is truth preserving

Correct Answer :   It can derive any sentence that is an entailed version & It is truth preserving

A)
Modus Ponen
B)
Universal Instantiation
C)
Unification
D)
Existential Instantiation

Correct Answer :   Unification


Explanation : Refer the definition if universal instantiation.

A)
Apply modus ponen, Manipulate rules directly
B)
Reduction to propositional logic, Manipulate rules directly
C)
Reduction to propositional logic, Apply modus ponen
D)
Convert every rule to Horn Clause, Reduction to propositional logic

Correct Answer :   Reduction to propositional logic, Manipulate rules directly

A)
Crown(x) ^ OnHead(y, y, x)
B)
Crown(y) ^ OnHead(y, y, x)
C)
Crown(x) ^ OnHead(x, Venkat)
D)
Crown(Venkat) ^ OnHead(Venkat, Raja)

Correct Answer :   Crown(Venkat) ^ OnHead(Venkat, Raja)

A)
Modus Ponen
B)
Forward Chaining
C)
Backward Chaining
D)
Resolution Refutation

Correct Answer :   Modus Ponen


Explanation : Modus ponen is a rule for an inference.

A)
Data-driven, Goal-driven
B)
Goal-driven, Goal-driven
C)
Goal-driven, Data-driven
D)
Data-driven, Data-driven

Correct Answer :   Data-driven, Goal-driven

A)
Min/Max Tree
B)
And/Or Trees
C)
Binary Search Trees
D)
Minimum Spanning Trees

Correct Answer :   And/Or Trees

A)
Expert Systems
B)
Rule Based Expert Systems
C)
Decision Tree Based Systems
D)
All of the above

Correct Answer :   All of the above

A)
SMH.PAL
B)
DENDRAL
C)
MYSIN
D)
CADUCEUS

Correct Answer :   MYSIN

A)
Knowledge Base
B)
Inference Engine
C)
Resolution Refutation
D)
Inference Engine & Knowledge Base

Correct Answer :   Inference Engine & Knowledge Base


Explanation : Look at the general architecture of rule based expert systems.

A)
True
B)
False
C)
Question Wrong
D)
None of the above

Correct Answer :   True

A)
Data Type
B)
Data Structure
C)
A way of representing knowledge
D)
None of the above

Correct Answer :   A way of representing knowledge

A)
Inheritance Search
B)
Intersection Search
C)
True
D)
False

Correct Answer :   Intersection Search