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

Correct Answer : Option (A) :   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 : Option (C) :   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 : Option (B) :   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 : Option (A) :   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 : Option (D) :   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 : Option (D) :   All of the above


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

A)
car
B)
cons
C)
cdr
D)
last

Correct Answer : Option (C) :   cdr

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

Correct Answer : Option (A) :   BACON

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

Correct Answer : Option (B) :   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 : Option (A) :   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 : Option (C) :   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 : Option (D) :   All of the above

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

Correct Answer : Option (B) :   (sqrt x)

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

Correct Answer : Option (D) :   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 : Option (A) :   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 : Option (C) :   Dartmouth

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

Correct Answer : Option (D) :   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 : Option (D) :   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 : Option (B) :   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 : Option (A) :   Samples

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

Correct Answer : Option (C) :   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 : Option (D) :   All of the above

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

Correct Answer : Option (C) :   Symbolics

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

Correct Answer : Option (B) :   Shakey

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

Correct Answer : Option (A) :   speaking

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

Correct Answer : Option (D) :   Representational Verification

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

Correct Answer : Option (A) :   Manipulator

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

Correct Answer : Option (C) :   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 : Option (D) :   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 : Option (B) :   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 : Option (D) :   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 : Option (A) :   Depth-First Search

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

Correct Answer : Option (C) :   Donald Michie

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

Correct Answer : Option (D) :   All of the above

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

Correct Answer : Option (B) :   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 : Option (A) :   The Explorer

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

Correct Answer : Option (B) :   Performance

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

Correct Answer : Option (C) :   Geology


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

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

Correct Answer : Option (A) :   Design

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

Correct Answer : Option (D) :   algorithmic and heuristic

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

Correct Answer : Option (C) :   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 : Option (B) :   contains procedural knowledge

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

Correct Answer : Option (D) :   Speaker-dependent recognition

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

Correct Answer : Option (A) :   hierarchical planning

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

Correct Answer : Option (D) :   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 : Option (C) :   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 : Option (B) :   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 : Option (B) :   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 : Option (D) :   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 : Option (A) :   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)
SIMD
B)
BACON
C)
SHRDLU
D)
STUDENT

Correct Answer : Option (C) :   SHRDLU

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

Correct Answer : Option (D) :   model-based vision

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

Correct Answer : Option (B) :   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 : Option (B) :   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 : Option (A) :   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 : Option (C) :   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 : Option (D) :   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 : Option (C) :   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 : Option (D) :   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 : Option (B) :   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 : Option (A) :   ICOT (Institute for New Generation Computer Technology)

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

Correct Answer : Option (D) :   Cognitive science

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

Correct Answer : Option (C) :   Expert system

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

Correct Answer : Option (C) :   Defense

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

Correct Answer : Option (B) :   Business decisions

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

Correct Answer : Option (A) :   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 : Option (A) :   NaturalLink

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

Correct Answer : Option (D) :   model-based vision

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

Correct Answer : Option (C) :   Ed Feigenbaum

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

Correct Answer : Option (D) :   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 : Option (B) :   human intelligence

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

Correct Answer : Option (A) :   Expert system

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

Correct Answer : Option (C) :   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 : Option (D) :   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 : Option (C) :   Û·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 : Option (A) :   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 : Option (A) :   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 : Option (D) :   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 : Option (C) :   continuous-path control

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

Correct Answer : Option (B) :   LISP

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

Correct Answer : Option (A) :   LISP machines

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

Correct Answer : Option (D) :   Fifth

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

Correct Answer : Option (A) :   hydraulic

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

Correct Answer : Option (C) :   Texas Instruments

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

Correct Answer : Option (B) :   expert system

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

Correct Answer : Option (D) :   All of the above

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

Correct Answer : Option (A) :   LISP

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

Correct Answer : Option (C) :   MIMD

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

Correct Answer : Option (D) :   BACON

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

Correct Answer : Option (D) :   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 : Option (B) :   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 : Option (A) :   What to say

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

Correct Answer : Option (C) :   educational institutions

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

Correct Answer : Option (C) :   Transition Network

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

Correct Answer : Option (D) :   color and motion, depth and texture

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

Correct Answer : Option (C) :   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 : Option (A) :   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 : Option (B) :   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 : Option (B) :   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 : Option (D) :   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 : Option (C) :   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 : Option (A) :   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 : Option (C) :   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 : Option (B) :   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 : Option (D) :   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 : Option (C) :   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 : Option (D) :   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 : Option (A) :   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 : Option (B) :   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 : Option (C) :   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 : Option (C) :   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 : Option (D) :   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 : Option (A) :   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 : Option (D) :   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 : Option (C) :   A goal state is reachable from every state

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

Correct Answer : Option (B) :   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 : Option (B) :   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 : Option (D) :   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 : Option (A) :   No agent / Multiple agents

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

Correct Answer : Option (D) :   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 : Option (C) :   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 : Option (A) :   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 : Option (B) :   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 : Option (B) :   Problem Instance


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

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

Correct Answer : Option (D) :   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 : Option (C) :   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 : Option (D) :   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 : Option (A) :   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 : Option (D) :   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 : Option (B) :   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 : Option (C) :   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 : Option (C) :   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 : Option (D) :   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 : Option (A) :   No neighbor has higher value

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

Correct Answer : Option (B) :   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 : Option (A) :   Local Beam search

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

Correct Answer : Option (C) :   Constraints Satisfaction Problems

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

Correct Answer : Option (D) :   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 : Option (B) :   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 : Option (C) :   NP complete

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

Correct Answer : Option (A) :   Constraints

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

Correct Answer : Option (D) :   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 : Option (C) :   Depth-first search algorithm

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

Correct Answer : Option (B) :   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 : Option (B) :   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 : Option (D) :   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 : Option (D) :   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 : Option (A) :   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 : Option (C) :   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 : Option (B) :   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 : Option (B) :   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 : Option (D) :   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 : Option (D) :   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 : Option (A) :   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 : Option (C) :   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 : Option (B) :   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 : Option (C) :   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 : Option (D) :   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 : Option (A) :   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 : Option (A) :   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 : Option (C) :   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 : Option (B) :   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 : Option (A) :   Same as of DFS

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

Correct Answer : Option (D) :   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 : Option (C) :   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 : Option (B) :   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 : Option (C) :   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 : Option (A) :   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 : Option (A) :   Hash table of previously seen positions

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

Correct Answer : Option (D) :   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 : Option (B) :   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 : Option (D) :   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 : Option (C) :   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 : Option (A) :   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 : Option (B) :   Termination

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

Correct Answer : Option (B) :   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 : Option (C) :   Deductive Systems

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

Correct Answer : Option (D) :   All of the above

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

Correct Answer : Option (D) :   All of the above

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

Correct Answer : Option (A) :   Atomic sentences

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

Correct Answer : Option (B) :   Logical connectives

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

Correct Answer : Option (C) :   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 : Option (C) :   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 : Option (D) :   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 : Option (A) :   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 : Option (B) :   Unit clause

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

Correct Answer : Option (C) :   Inference rule

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

Correct Answer : Option (D) :   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 : Option (B) :   Every sentence of first-order logic

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

Correct Answer : Option (A) :   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 : Option (A) :   Removal of redundant literal

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

Correct Answer : Option (C) :   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 : Option (B) :   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 : Option (B) :   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 : Option (D) :   First-order definite clauses

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

Correct Answer : Option (A) :   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 : Option (A) :   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 : Option (B) :   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 : Option (D) :   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 : Option (B) :   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 : Option (C) :   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 : Option (C) :   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 : Option (A) :   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 : Option (B) :   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 : Option (D) :   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 : Option (C) :   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 : Option (D) :   Both Repeated states & Incompleteness

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

Correct Answer : Option (A) :   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 : Option (A) :   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 : Option (B) :   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 : Option (D) :   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 : Option (C) :   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 : Option (B) :   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 : Option (D) :   Crown(Venkat) ^ OnHead(Venkat, Raja)

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

Correct Answer : Option (A) :   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 : Option (A) :   Data-driven, Goal-driven

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

Correct Answer : Option (B) :   And/Or Trees

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

Correct Answer : Option (D) :   All of the above

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

Correct Answer : Option (C) :   MYSIN

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

Correct Answer : Option (D) :   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 : Option (A) :   True

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

Correct Answer : Option (C) :   A way of representing knowledge

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

Correct Answer : Option (B) :   Intersection Search

A)
A is part of B
B)
A is a kind of B
C)
A is superordinate of B
D)
B has A as a part of itself

Correct Answer : Option (D) :   B has A as a part of itself


Explanation :

Holonymy (in Greek holon = whole and onoma = name) is a semantic relation. Holonymy defines the relationship between a term denoting the whole and a term denoting a part of, or a member of, the whole. That is, ‘X’ is a holonym of ‘Y’ if Ys are parts of Xs, or ‘X’ is a holonym of ‘Y’ if Ys are members of Xs.

A)
Directed graph
B)
Undirected graph
C)
Directed complete graph
D)
Directed Acyclic graph (DAG)

Correct Answer : Option (A) :   Directed graph


Explanation : Semantic Network is a directed graph consisting of vertices, which represent concepts and edges, which represent semantic relations between the concepts.

A)
A is part of B
B)
A is a kind of B
C)
A is superordinate of B
D)
B has A as a part of itself

Correct Answer : Option (A) :   A is part of B


Explanation :

A meronym denotes a constituent part of or a member of something. That is, “X” is a meronym of “Y” if Xs are parts of Y(s), or “X” is a meronym of “Y” if Xs are members of Y(s).

A)
Expert Systems
B)
Rule Based Expert Systems
C)
Partitioned Networks
D)
Decision Tree Based networks

Correct Answer : Option (C) :   Partitioned Networks

A)
A is part of B
B)
A denotes opposite of B
C)
A is superordinate of B
D)
B has A as a part of itself

Correct Answer : Option (B) :   A denotes opposite of B

A)
MYSIN
B)
Human Food Chain
C)
Autonomous car driver
D)
Wordnet

Correct Answer : Option (D) :   Wordnet


Explanation : Wordnet is a lexical database of English.

A)
A is part of B
B)
A is a kind of B
C)
A is superordinate of B
D)
A denotes same as B

Correct Answer : Option (D) :   A denotes same as B

A)
Incomplete
B)
Intractability
C)
Has memory constraints
D)
Lack in expressing some of the properties

Correct Answer : Option (D) :   Lack in expressing some of the properties

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

Correct Answer : Option (C) :   A way of representing knowledge

A)
Facts or Data
B)
Frame names
C)
Frame reference in hierarchy
D)
Procedures and default values

Correct Answer : Option (A) :   Facts or Data

A)
Lists
B)
Hashes
C)
Stack
D)
None of the above

Correct Answer : Option (B) :   Hashes


Explanation : The buckets can be stored in a hash table for efficient access.

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

Correct Answer : Option (B) :   4


Explanation : The four functions are available in the unification and lifting process are tell, ask, store and fetch.

A)
Ponens
B)
Clauses
C)
Variables
D)
Generalized Modus Ponens

Correct Answer : Option (D) :   Generalized Modus Ponens


Explanation : All kinds of inference process can be captured as a single inference rule that can be called as Generalized modus ponens.

A)
Inference
B)
Depth-first search
C)
Unify algorithm
D)
Hill-climbing search

Correct Answer : Option (C) :   Unify algorithm


Explanation : The unify algorithm takes two sentences and returns a unifier if there is one in the sentence.

A)
Most general unifier
B)
Unifier
C)
Unifier & Most general unifier
D)
None of the above

Correct Answer : Option (A) :   Most general unifier


Explanation : For every unifiable pair of expressions, there is a single most general unifier that is unique up to renaming of variables.

A)
Clause
B)
Inference
C)
Resolution
D)
Occur check

Correct Answer : Option (D) :   Occur check


Explanation : Occur check makes the complexity of the entire algorithm quadratic in the size of the expressions being unified.

A)
Datamart
B)
Database
C)
Knowledge base
D)
All of the above

Correct Answer : Option (C) :   Knowledge base


Explanation : The simplest way to implement store and fetch functions is to keep all the facts in the knowledge base in one long list.

A)
Clauses
B)
Generalized modus ponens
C)
Inference
D)
None of the above

Correct Answer : Option (B) :   Generalized modus ponens


Explanation : Generalized modus ponens is a lifted version of modus ponens because it raises modus ponens from propositional to first-order logic.

A)
Partial & Global Information
B)
Partial & local Information
C)
Full & local information
D)
Full & Global information

Correct Answer : Option (B) :   Partial & local Information


Explanation : The Wumpus world is a grid of squares surrounded by walls, where each square can contain agents and objects. The agent (you) always starts in the lower left corner, a square that will be labeled [1, 1]. The agent’s task is to find the gold, return to [1, 1] and climb out of the cave. Therefore, uncertainty is there as the agent gives partial and local information only. Global variable are not goal specific problem solving.

A)
Planning
B)
Problem solving
C)
Non-hierarchical plan
D)
Hierarchical plan

Correct Answer : Option (D) :   Hierarchical plan


Explanation : A plan that describes how to take actions in levels of increasing refinement and specificity is Hierarchical (e.g., “Do something” becomes the more specific “Go to work,” “Do work,” “Go home.”) Most plans are hierarchical in nature.

A)
Partial order planning
B)
Planning problem
C)
Total order planning
D)
Both Planning problem & Partial order planning

Correct Answer : Option (A) :   Partial order planning

A)
Breadth-first search
B)
Depth-first search
C)
Forward state-space search
D)
Hill-climbing search

Correct Answer : Option (C) :   Forward state-space search


Explanation : Forward and backward state-space search are particular forms of totally ordered plan search.

A)
First commitment
B)
Least commitment
C)
Both (a) and (b)
D)
None of the above

Correct Answer : Option (B) :   Least commitment


Explanation : The general strategy of delaying a choice during search is called the least commitment strategy.

A)
Constrained
B)
Most-constrained literal
C)
Most-constrained variable
D)
None of the above

Correct Answer : Option (C) :   Most-constrained variable


Explanation : The most-constrained variable heuristic from CSPs can be adapted for planning algorithm and seems to work well.

A)
Effect
B)
Finish
C)
Preconditions
D)
None of the above

Correct Answer : Option (A) :   Effect


Explanation : Finish has no effects and has as its preconditions the goal literals of the planning algorithm.

A)
Start
B)
Finish
C)
Modest
D)
Both Start & Finish

Correct Answer : Option (D) :   Both Start & Finish


Explanation : The "empty" plan contains just the start and finish actions.

A)
Full-order planner
B)
Total-order planner
C)
Semi-order planner
D)
Partial-order planner

Correct Answer : Option (D) :   Partial-order planner


Explanation : Any planning algorithm that can place two actions into a plan without specifying which should come first is called partial-order planner.

A)
Composition
B)
State search
C)
Problem decomposition
D)
None of the above

Correct Answer : Option (C) :   Problem decomposition


Explanation : As the search explore only linear sequences of actions, So they cannot take advantage of problem decomposition.

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

Correct Answer : Option (B) :   6


Explanation : The partial-order solution corresponds to six possible total-order plans.

A)
Planning graph algorithm
B)
Backward state-space
C)
Forwards state-space
D)
None of the above

Correct Answer : Option (A) :   Planning graph algorithm


Explanation : A special data structure called planning graph is used to give better heuristic estimates.

A)
Mutually exclusive
B)
If two literals are negation of other
C)
If two literals are not negation of other
D)
None of the above

Correct Answer : Option (B) :   If two literals are negation of other


Explanation : If two literals are at the same level if one is the negation of another is called inconsistent support.

A)
Identical
B)
Replicate
C)
Not identical
D)
None of the above

Correct Answer : Option (A) :   Identical

A)
Planning algorithm
B)
Hill-climbing search
C)
Graphplan
D)
All of the above

Correct Answer : Option (C) :   Graphplan


Explanation : We can extract the solution directly from the planning graph, using a specialized algorithm called Graphplan.

A)
Literals
B)
Variables
C)
Heuristic estimates
D)
Sequence of levels

Correct Answer : Option (D) :   Sequence of levels

A)
Action problem
B)
Planning problem
C)
Propositional planning problem
D)
None of the above

Correct Answer : Option (C) :   Propositional planning problem


Explanation : Planning graph work only for propositional planning problem with no variables.

A)
Level 0
B)
Level 1
C)
Level 2
D)
Level 3

Correct Answer : Option (A) :   Level 0

A)
Total order planning
B)
Planning problem
C)
Partial Order planning problem
D)
None of the above

Correct Answer : Option (B) :   Planning problem


Explanation :

 

A)
Conditional Plan
B)
Execution monitoring
C)
Conformant Planning
D)
Both (a) and (b)

Correct Answer : Option (B) :   Execution monitoring

A)
Stochastic
B)
Single agent
C)
Fully observable
D)
Deterministic

Correct Answer : Option (D) :   Deterministic


Explanation : It assumes complete and correct information, deterministic and fully-observable environment, which many domains violates.

A)
Greedy
B)
GraphPlan
C)
SatPlan
D)
None of the above

Correct Answer : Option (C) :   SatPlan


Explanation : The SATPLAN algorithm translates a planning problem into propositional axioms and applies a satisfiability algorithm to find a model that corresponds a valid plan.

A)
SatPlan
B)
GraphPlan
C)
Hierarchical task network (HTN)
D)
None of the above

Correct Answer : Option (C) :   Hierarchical task network (HTN)

A)
Linearization
B)
Solarization
C)
Polarization
D)
None of the above

Correct Answer : Option (A) :   Linearization


Explanation : Each and every total order plan is also called as linearization of the partial-order plan.

A)
Queue
B)
Planning Graphs
C)
Stacks
D)
BST (Binary Search Tree)

Correct Answer : Option (B) :   Planning Graphs


Explanation : A planning graph can be used to give better heuristic estimates.

A)
Knowledge Based Systems
B)
Logic & Knowledge Based Systems
C)
FOL & Logic
D)
Search & Logic

Correct Answer : Option (D) :   Search & Logic

A)
Only Discrete variables
B)
Only Discontinuous variable
C)
Both discrete and continuous variables
D)
Both Discrete and Discontinuous variable

Correct Answer : Option (C) :   Both discrete and continuous variables


Explanation : To specify a Hybrid network, we have to specify two new kinds of distributions: the conditional distribution for continuous variables given discrete or continuous parents, and the conditional distribution for a discrete variable given continuous parents.

A)
DO Approach
B)
FOR Approach
C)
WHILE Approach
D)
IF and THEN Approach

Correct Answer : Option (D) :   IF and THEN Approach


Explanation : FL incorporates a simple, rule-based IF X AND Y THEN Z approach to a solving control problem rather than attempting to model a system mathematically.

A)
Decision Theory = Uncertainty + utility theory
B)
Decision Theory = Inference theory + utility theory
C)
Decision Theory = Probability theory + preference
D)
Decision Theory = Probability theory + utility theory

Correct Answer : Option (A) :   Decision Theory = Uncertainty + utility theory

A)
A consistent hypothesis
B)
A false positive hypothesis
C)
A false negative hypothesis
D)
A specialized hypothesis

Correct Answer : Option (B) :   A false positive hypothesis


Explanation : Consistent hypothesis go with examples, If the hypothesis says it should be negative but in fact it is positive, it is false negative. If a hypothesis says it should be positive, but in fact it is negative, it is false positive. In a specialized hypothesis we need to have certain restrict or special conditions.

A)
Semantic
B)
Syntactic
C)
Pragmatic
D)
None of the above

Correct Answer : Option (A) :   Semantic


Explanation : Semantic analysis is used to extract the meaning from the group of sentences.

A)
Semantics
B)
Logical connectives
C)
Determining the meaning
D)
None of the above

Correct Answer : Option (C) :   Determining the meaning


Explanation : Compositional semantics is the process of determining the meaning of P*Q from P, Q and *.

A)
Semantic
B)
Syntactic
C)
Pragmatic
D)
None of the above

Correct Answer : Option (C) :   Pragmatic

A)
Form
B)
Grammer
C)
Both (a) and (b)
D)
Intermediate form

Correct Answer : Option (D) :   Intermediate form

A)
Logical term
B)
Complete logical sentence
C)
Both (a) and (b)
D)
None of the above

Correct Answer : Option (C) :   Both (a) and (b)

A)
Shape context
B)
Weighted sum of the shape
C)
Size of the shape
D)
None of the above

Correct Answer : Option (B) :   Weighted sum of the shape


Explanation : The distance between two shapes can be defined as a weighted sum of the shape context distance between corresponding points.

A)
Bottom-up segmentation
B)
Top-down segmentation
C)
Both Bottom-up & Top-down segmentation
D)
None of the above

Correct Answer : Option (A) :   Bottom-up segmentation


Explanation : In the process of creating subset of pixels, the bottom-up segmentation is an error-prone process.

A)
Hear
B)
Vision
C)
Speech
D)
Perception

Correct Answer : Option (B) :   Vision


Explanation :  Vision enables people to recognize people, animals and inanimate objects reliably. It is customary to use object recognition.

A)
Motion
B)
Objects
C)
Activities
D)
Both Objects & Activities

Correct Answer : Option (D) :   Both Objects & Activities


Explanation : Vision is used to recognize not only objects, but also activities.

A)
Shape
B)
Context
C)
Shape context
D)
None of the above

Correct Answer : Option (C) :   Shape context


Explanation : Because an object’s shape can be manipulated with respect to the point.

A)
Speech
B)
Hearing
C)
Learning
D)
Perception

Correct Answer : Option (C) :   Learning

A)
Supervised learning
B)
Unsupervised learning
C)
Learning
D)
None of the above

Correct Answer : Option (A) :   Supervised learning


Explanation : Supervised learning or pattern classification provides a framework for studying object recognition.

A)
Feature
B)
Matching
C)
Deformable matching
D)
All of the above

Correct Answer : Option (C) :   Deformable matching

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

Correct Answer : Option (B) :   2


Explanation : The main issues for degree of belief are nature of the sentences and the dependance of degree of the belief.

A)
Literals
B)
Variables
C)
Statements
D)
Propositions

Correct Answer : Option (D) :   Propositions

A)
Random variable
B)
Literal
C)
Variable
D)
All of the above

Correct Answer : Option (A) :   Random variable


Explanation : The basic element for a language is the random variable, which can be thought as a part of world and its status is initially unknown.

A)
Discrete variable
B)
Continuous variable
C)
Probability distributions
D)
Probability distributions for Continuous variables

Correct Answer : Option (D) :   Probability distributions for Continuous variables

A)
Simple event
B)
Complex event
C)
Atomic event
D)
None of the above

Correct Answer : Option (C) :   Atomic event


Explanation : An atomic event is the complete specification of the state of the world about which the event is uncertain.

A)
Discrete
B)
Continuous
C)
Both (a) and (b)
D)
None of the above

Correct Answer : Option (B) :   Continuous


Explanation : For continuous variables, it is not possible to write out the entire distribution as a table.

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

Correct Answer : Option (C) :   3


Explanation : The three required terms are a conditional probability and two unconditional probability.

A)
Using information
B)
Using variables
C)
Both Using variables & information
D)
None of the above

Correct Answer : Option (A) :   Using information


Explanation : Every entry in the full joint probability distribution can be calculated from the information in the network.

A)
Conditionally independent
B)
Dependant
C)
Functionally dependent
D)
Both Conditionally dependant & Dependant

Correct Answer : Option (A) :   Conditionally independent


Explanation : The semantics to derive a method for constructing bayesian networks were led to the consequence that a node can be conditionally independent of its predecessors.

A)
Hybrid
B)
Linear
C)
Dependant
D)
None of the above

Correct Answer : Option (B) :   Linear


Explanation : Local structure is usually associated with linear rather than exponential growth in complexity.

A)
Full distribution
B)
Partial distribution
C)
Joint distribution
D)
All of the above

Correct Answer : Option (C) :   Joint distribution


Explanation : If a bayesian network is a representation of the joint distribution, then it can solve any query, by summing all the relevant joint entries.

A)
Feasibility
B)
Reliability
C)
Both (a) and (b)
D)
Crucial robustness

Correct Answer : Option (D) :   Crucial robustness


Explanation : On a model-based knowledge provides the crucial robustness needed to make probabilistic system feasible in the real world.

A)
Binary set logic
B)
Crisp set logic
C)
Two-valued logic
D)
Many-valued logic

Correct Answer : Option (D) :   Many-valued logic


Explanation : With fuzzy logic set membership is defined by certain value. Hence it could have many values to be in the set.

A)
Fuzzy Set
B)
Crisp Set
C)
Fuzzy & Crisp Set
D)
None of the above

Correct Answer : Option (A) :   Fuzzy Set


Explanation : Fuzzy logic deals with linguistic variables.

A)
AND
B)
OR
C)
NOT
D)
All of the above

Correct Answer : Option (D) :   All of the above


Explanation : The AND, OR, and NOT operators of Boolean logic exist in fuzzy logic, usually defined as the minimum, maximum, and complement;

A)
IF-THEN rules
B)
IF-THEN-ELSE rules
C)
Both (a) and (b)
D)
None of the above

Correct Answer : Option (A) :   IF-THEN rules

A)
Ecorithms
B)
Fuzzy Set
C)
Fuzzy Relational DB
D)
None of the above

Correct Answer : Option (B) :   Fuzzy Set


Explanation : Local structure is usually associated with linear rather than exponential growth in complexity.

A)
Fuzz Variable
B)
Lingual Variable
C)
Hedges
D)
None of the above

Correct Answer : Option (C) :   Hedges

A)
Probabilities
B)
Degree of truth
C)
Discrete Set
D)
None of the above

Correct Answer : Option (B) :   Degree of truth

A)
Breadth-first search
B)
Depth-first search
C)
Hill-climbing search
D)
Hidden markov model

Correct Answer : Option (D) :   Hidden markov model


Explanation : Hidden Markov model is used for solving temporal probabilistic reasoning that was independent of transition and sensor model.

A)
Possible states of the world
B)
Literals
C)
Variables
D)
Discrete variable

Correct Answer : Option (A) :   Possible states of the world


Explanation : The possible values of the variables are the possible states of the world.

A)
Reality model
B)
Probability model
C)
Temporal model
D)
All of the above

Correct Answer : Option (C) :   Temporal model


Explanation : Additional state variables can be added to a temporal model while staying within the HMM framework.

A)
HMM
B)
Reality model
C)
Temporary model
D)
Restricted structure of HMM

Correct Answer : Option (D) :   Restricted structure of HMM


Explanation : Restricted structure of HMM allows for a very simple and elegant matrix implementation of all the basic algorithm.

A)
Matrix
B)
Constant space
C)
Constant time
D)
None of the above

Correct Answer : Option (B) :   Constant space

A)
HMM
B)
Smoothing
C)
Modified smoothing
D)
Depth-first search algorithm

Correct Answer : Option (C) :   Modified smoothing


Explanation : The modified smoothing algorithm works by first running the standard forward pass to compute and then running the backward pass.

A)
Speech recognition
B)
Understanding of real world
C)
Both (a) and (b)
D)
None of the above

Correct Answer : Option (A) :   Speech recognition

A)
SIMD
B)
BACON
C)
SHRDLU
D)
STUDENT

Correct Answer : Option (D) :   STUDENT

A)
human factors
B)
parallel processing
C)
computer-aided design
D)
None of the above

Correct Answer : Option (A) :   human factors

A)
history
B)
information
C)
intelligence
D)
mathematics

Correct Answer : Option (B) :   information

A)
pilot's associate
B)
battle management
C)
autonomous systems
D)
All of the above

Correct Answer : Option (D) :   All of the above

A)
binary
B)
recursive
C)
semantic
D)
electro-chemical

Correct Answer : Option (A) :   binary

A)
Hearing
B)
Speech
C)
Learning
D)
Perceiving

Correct Answer : Option (C) :   Learning

A)
Problem
B)
Feedback
C)
Environment
D)
All of the above

Correct Answer : Option (B) :   Feedback


Explanation : The type of feedback is used in determining the nature of the learning problem that the agent faces.

A)
Polynomial
B)
Linear polynomial
C)
Weighted polynomial
D)
Linear weighted polynomial

Correct Answer : Option (D) :   Linear weighted polynomial


Explanation : Linear weighted polynomial is used for learning element in the game playing programs.

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

Correct Answer : Option (D) :   Sequence of test

A)
Learning element
B)
Changing element
C)
Performance element
D)
None of the above

Correct Answer : Option (A) :   Learning element


Explanation : A learning element modifies the performance element so that it can make better decision.

A)
Active learning
B)
Supervised learning
C)
Reinforcement learning
D)
Unsupervised learning

Correct Answer : Option (C) :   Reinforcement learning


Explanation : Reinforcement learning is the type of learning in which teacher returns reward or punishment to learner.

A)
Active learning
B)
Unsupervised learning
C)
Supervised learning
D)
Reinforcement learning

Correct Answer : Option (B) :   Unsupervised learning


Explanation : In unsupervised learning, no teacher is available hence it is also called unsupervised learning.

A)
WWW
B)
Data mining
C)
Speech Recognition
D)
None of the above

Correct Answer : Option (D) :   None of the above

A)
Active learning
B)
Supervised learning
C)
Unsupervised learning
D)
Reinforcement learning

Correct Answer : Option (B) :   Supervised learning


Explanation : In automatic vehicle set of vision inputs and corresponding actions are available to learner hence it’s an example of supervised learning.

A)
Training scenario
B)
Type of feedback
C)
Representation scheme used
D)
Good data structures

Correct Answer : Option (D) :   Good data structures


Explanation : Factors which affect the performance of learner system does not include good data structures.

A)
Introduction
B)
Analogy
C)
Deduction
D)
Memorization

Correct Answer : Option (A) :   Introduction


Explanation : Different learning methods include memorization, analogy and deduction.

A)
Locality
B)
Detachment
C)
Attachment
D)
Truth-Functionality

Correct Answer : Option (C) :   Attachment

A)
Specific output values are given
B)
Specific output values are not given
C)
No specific Inputs are given
D)
Both inputs and outputs are given

Correct Answer : Option (B) :   Specific output values are not given


Explanation : The problem of unsupervised learning involves learning patterns in the input when no specific output values are supplied. We cannot expect the specific output to test your result. Here the agent does not know what to do, as he is not aware of the fact what propose system will come out. We can say an ambiguous un-proposed situation.

A)
All formal languages are Context free
B)
All formal languages are like natural language
C)
Natural languages are context-oriented free
D)
Not all formal languages are context-free

Correct Answer : Option (D) :   Not all formal languages are context-free


Explanation : Not all formal languages are context-free.

A)
Backtracking algorithm
B)
Backpropagation algorithm
C)
Feed-forward neural network
D)
Feed Forward-backward algorithm

Correct Answer : Option (C) :   Feed-forward neural network


Explanation : A perceptron is a Feed-forward neural network with no hidden units that can be representing only linear separable functions. If the data are linearly separable, a simple weight updated rule can be used to fit the data exactly.

A)
Inductive learning
B)
Weak learning
C)
Forced based learning
D)
Unsupervised Learning

Correct Answer : Option (A) :   Inductive learning


Explanation : Computational learning theory analyzes the sample complexity and computational complexity of inductive learning. There is a tradeoff between the expressiveness of the hypothesis language and the ease of learning.

A)
Nonlinear Functions
B)
Linear Functions
C)
Discrete Functions
D)
Exponential Functions

Correct Answer : Option (A) :   Nonlinear Functions


Explanation : Neural networks parameters can be learned from noisy data and they have been used for thousands of applications, so it varies from problem to problem and thus use nonlinear functions.

A)
Regular Hypothesis
B)
Consistent Hypothesis
C)
Irregular Hypothesis
D)
Inconsistent Hypothesis

Correct Answer : Option (B) :   Consistent Hypothesis


Explanation : Inductive learning involves finding a consistent hypothesis that agrees with examples. The difficulty of the task depends on the chosen representation.

A)
an auto-associative neural network
B)
a neural network that contains feedback
C)
a double layer auto-associative neural network
D)
a single layer feed-forward neural network with pre-processing

Correct Answer : Option (D) :   a single layer feed-forward neural network with pre-processing


Explanation : The perceptron is a single layer feed-forward neural network. It is not an auto-associative network because it has no feedback and is not a multiple layer neural network because the pre-processing stage is not made of neurons.

A)
a neural network that has only one loop
B)
a neural network that contains no loops
C)
a neural network that contains feedback
D)
a single layer feed-forward neural network with pre-processing

Correct Answer : Option (C) :   a neural network that contains feedback


Explanation : An auto-associative network is equivalent to a neural network that contains feedback. The number of feedback paths(loops) does not have to be one.

A)
It has set of nodes and connections
B)
Each node computes it’s weighted input
C)
Node could be in excited state or non-excited state
D)
All of the above

Correct Answer : Option (D) :   All of the above

A)
It is powerful and easy neural network
B)
It is software used by Neurosurgeon
C)
A software used to analyze neurons
D)
Designed to aid experts in real world

Correct Answer : Option (A) :   It is powerful and easy neural network

A)
Because it can be solved by a single layer perceptron
B)
Because it is the simplest linearly inseparable problem that exists.
C)
Because it can be expressed in a way that allows you to use a neural network
D)
Because it is complex binary operation that cannot be solved using neural networks

Correct Answer : Option (B) :   Because it is the simplest linearly inseparable problem that exists.

A)
It can handle noise
B)
It can explain result
C)
It has inherent parallelism
D)
It can survive the failure of some nodes

Correct Answer : Option (B) :   It can explain result


Explanation : The artificial Neural Network (ANN) cannot explain result.

A)
Data validation
B)
Sales forecasting
C)
Risk management
D)
All of the above

Correct Answer : Option (D) :   All of the above


Explanation : All mentioned options are applications of Neural Network.

A)
Perceptrons
B)
Self organizing maps
C)
Recurrent neural network
D)
Multi layered perceptron

Correct Answer : Option (C) :   Recurrent neural network


Explanation : RNN (Recurrent neural network) topology involves backward links from output to the input and hidden layers.

A)
Linear Functions
B)
Discrete Functions
C)
Nonlinear Functions
D)
Exponential Functions

Correct Answer : Option (A) :   Linear Functions


Explanation : Neural networks are complex linear functions with many parameters.

A)
Trees
B)
Graphs
C)
Decision tree
D)
Neural Networks

Correct Answer : Option (C) :   Decision tree

A)
End Nodes
B)
Decision Nodes
C)
Chance Nodes
D)
All of the above

Correct Answer : Option (D) :   All of the above

A)
Disks
B)
Triangles
C)
Circles
D)
Squares

Correct Answer : Option (B) :   Triangles

A)
Disks
B)
Triangles
C)
Circles
D)
Squares

Correct Answer : Option (D) :   Squares

A)
Disks
B)
Triangles
C)
Circles
D)
Squares

Correct Answer : Option (C) :   Circles

A)
Inductive logic programming
B)
Lisp programming
C)
Logic programming
D)
Inductive programming

Correct Answer : Option (A) :   Inductive Logic Programming


Explanation : Inductive logic programming(ILP) combines inductive methods with the power of first-order representations.

A)
Three-dimensional configuration of a protein molecule
B)
Agents
C)
Program
D)
None of the above

Correct Answer : Option (A) :   Three-dimensional configuration of a protein molecule

A)
Bottom-up approach
B)
Top-down approach
C)
Both (a) and (b)
D)
None of the above

Correct Answer : Option (B) :   Top-down approach

A)
Trilogy
B)
Resolution
C)
Program
D)
Inverse resolution

Correct Answer : Option (D) :   Inverse resolution


Explanation : Because it is a complete algorithm for learning first-order theories.

A)
Literal system
B)
Variable-based system
C)
Attribute-based system
D)
None of the above

Correct Answer : Option (C) :   Attribute-based system


Explanation : ILP methods can learn relational knowledge that is not expressible in attribute-based system.

A)
ILP
B)
First-order logic
C)
Propositional logic
D)
Artificial Intelligence

Correct Answer : Option (A) :   ILP


Explanation : Because ILP can participate in the scientific cycle of experimentation, So that it can produce flexible structure.

A)
Signs
B)
Words
C)
Languages
D)
Speech

Correct Answer : Option (C) :   Languages


Explanation : Language is the complex system of structured message that enables us to communicate.

A)
Signs
B)
Formal language
C)
Communication
D)
None of the above

Correct Answer : Option (B) :   Formal language


Explanation : A formal language is defined by a set of strings that is a concatenation of terminal symbols.

A)
Decode syntactic information into a semantic grammar
B)
Decode semantic information into a syntactic grammar
C)
Encode syntactic information into a semantic grammar
D)
Encode semantic information into a syntactic grammar

Correct Answer : Option (D) :   Encode semantic information into a syntactic grammar


Explanation : Semantic grammars encode semantic information into a syntactic grammar.

A)
Recognition
B)
Interpretation
C)
Building a parse tree
D)
All of the above

Correct Answer : Option (C) :   Building a parse tree


Explanation : Parsing is the process of building a parse tree for an input string.

A)
Grammar
B)
Signs
C)
Phrase
D)
Communication

Correct Answer : Option (A) :   Grammar

A)
Perception
B)
Sensation
C)
Organization
D)
Interpretation-Evaluation

Correct Answer : Option (A) :   Perception

A)
The primary effect
B)
The halo effect
C)
The recency effect
D)
A self-fulfilling prophecy

Correct Answer : Option (B) :   The halo effect

A)
Over-attribution
B)
Self-promotion
C)
Self-serving bias
D)
Fundamental attribution error

Correct Answer : Option (C) :   Self-serving bias

A)
careful, critical thinking
B)
inaccurate and faulty processing
C)
processing that focuses on unusual or novel events
D)
information processing that relies heavily on familiar schemata

Correct Answer : Option (D) :   information processing that relies heavily on familiar schemata

A)
Be active in perceiving
B)
Distinguish facts from inference
C)
Recognize that each person’s frame of perception is unique
D)
Recognize the people, objects, and situations remain stable over time

Correct Answer : Option (D) :   Recognize the people, objects, and situations remain stable over time

A)
Schematas
B)
Stereotypes
C)
Attributions
D)
Cultural mores

Correct Answer : Option (A) :   Schematas

A)
Smell
B)
Speech
C)
Hear
D)
None of the above

Correct Answer : Option (B) :   Speech


Explanation : Speech is the dominant modality for communication between humans and reliable speech recognition between machines.

A)
Articulation effects
B)
Coarticulation effects
C)
Both (a) and (b)
D)
None of the above

Correct Answer : Option (B) :   Coarticulation effects


Explanation : Coarticulation effects are partially captured by triphone model, which can be manipulated by acoustic model.

A)
One-state phone model
B)
Two-state phone model
C)
Three-state phone mone
D)
All of the above

Correct Answer : Option (C) :   Three-state phone mone

A)
Trilogy
B)
Biology
C)
Speechology
D)
Phonology

Correct Answer : Option (D) :   Phonology

A)
Hearing
B)
Speaking
C)
Utterance
D)
Speech recognition

Correct Answer : Option (D) :   Speech recognition


Explanation : Speech recognition is viewed as problem of probabilistic inference because different words can sound the same.

A)
Bigram model
B)
Gram model
C)
Speech model
D)
Diagram model

Correct Answer : Option (A) :   Bigram model


Explanation : Bigram model gives the probability of each word following each other word in speech recognition.

A)
Rate
B)
Frames
C)
Hops
D)
All of the above

Correct Answer : Option (B) :   Frames


Explanation : Speech system summarize the properties of the signal that extend over interval called frames.

A)
Sense
B)
Hearing
C)
Perception
D)
Reading

Correct Answer : Option (C) :   Perception


Explanation : Perception provides agents with information about the world they inhabit.

A)
Biology
B)
Lightology
C)
Photometry
D)
None of the above

Correct Answer : Option (C) :   Photometry

A)
Smoothing
B)
Gaussian filter
C)
Diffuse reflection
D)
Specular reflection

Correct Answer : Option (A) :   Smoothing


Explanation : Smoothing meant predicting the value of a state variable from the past and by given evidence and calculating the present and future.

A)
Smoothing
B)
Perception
C)
Segmentation
D)
Canny edge detection

Correct Answer : Option (D) :   Canny edge detection


Explanation : Canny edge detection is assuming any two neighboring that are both edge pixels with consistent orientation and must belong to the same edge.

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

Correct Answer : Option (D) :   5


Explanation : The five types of 3-D image processing techniques are motion, binocular stereopsis, texture, shading and contour.

A)
Surface
B)
Amount of light
C)
Sound
D)
Waves

Correct Answer : Option (B) :   Amount of light


Explanation : The brightness of a pixel in the image is proportional to the amount of light directed towards the camera.

A)
signal
B)
pressure
C)
feedback
D)
temperature

Correct Answer : Option (C) :   feedback

A)
business decisions
B)
budget projections
C)
vacation schedules
D)
visual presentations

Correct Answer : Option (A) :   business decisions

A)
arm
B)
sensor
C)
controller
D)
end effector

Correct Answer : Option (C) :   controller

A)
factory
B)
hospitals
C)
warehouse
D)
private homes

Correct Answer : Option (D) :   private homes

A)
drive
B)
controller
C)
end effectors
D)
peripheral tools

Correct Answer : Option (D) :   peripheral tools

A)
axle
B)
roll
C)
swivel
D)
retrograde

Correct Answer : Option (B) :   roll

A)
work envelope
B)
spatial base
C)
environment
D)
exclusion zone

Correct Answer : Option (A) :   work envelope

A)
flexibility
B)
payload capacity
C)
degrees of freedom
D)
operational limits

Correct Answer : Option (C) :   degrees of freedom

A)
hydraulic
B)
piezoelectric
C)
pneumatic
D)
photosensitive

Correct Answer : Option (C) :   pneumatic

A)
Robots work continuously around the clock
B)
Quality of manufactured goods can be improved
C)
Reduced company cost for worker fringe benefits
D)
Low costs for hardware and software

Correct Answer : Option (A) :   Low costs for hardware and software

A)
CMU
B)
MIT
C)
RAMD
D)
None of the above

Correct Answer : Option (B) :   MIT

A)
robots must make business a greater profit
B)
robots must follow the directions given by humans
C)
robot actions must never result in damage to the robot
D)
robots must never take actions harmful to humans

Correct Answer : Option (D) :   robots must never take actions harmful to humans

A)
CMU
B)
MIT
C)
SRI
D)
RAND

Correct Answer : Option (A) :   CMU

A)
meta-rules
B)
control rules
C)
production rules
D)
rule interpreters

Correct Answer : Option (C) :   production rules

A)
Linguistics
B)
Computer Science
C)
Artificial Intelligence
D)
All of the above

Correct Answer : Option (D) :   All of the above

A)
Information Retrieval
B)
Automatic Text Summarization
C)
Automatic Question-Answering Systems
D)
All of the above

Correct Answer : Option (D) :   All of the above

A)
Converts any human language to English
B)
Converts one human language to another
C)
Converts human language to machine language
D)
Converts Machine language to human language

Correct Answer : Option (B) :   Converts one human language to another


Explanation : The best known example of machine translation is google translator.

A)
Separate words into individual morphemes and identify the class of the morphemes
B)
Does Discourse Analysis
C)
Is an extension of propositional logic
D)
None of the above

Correct Answer : Option (A) :   Separate words into individual morphemes and identify the class of the morphemes

A)
Handling POS-Tagging
B)
Handling Tokenization
C)
Handling Ambiguity of Sentences
D)
All of the above

Correct Answer : Option (C) :   Handling Ambiguity of Sentences

A)
part-of-speech for each word dynamically as per sentence structure
B)
part-of-speech for each word dynamically as per meaning of the sentence
C)
all part-of-speech for a specific word given as input
D)
All of the above

Correct Answer : Option (D) :   All of the above


Explanation : A Bayesian network provides a complete description of the domain.

A)
Fuzzy Logic
B)
Shallow Semantic Analysis
C)
Word Sense Disambiguation
D)
All of the above

Correct Answer : Option (C) :   Word Sense Disambiguation


Explanation : Shallow Semantic Analysis doesn’t cover word sense disambiguation.

A)
Rooting
B)
Stemming
C)
Text-Proofing
D)
Both (a) and (b)

Correct Answer : Option (B) :   Stemming

A)
batch processing
B)
remote access
C)
telecommunication
D)
None of the above

Correct Answer : Option (A) :   batch processing

A)
LOGO
B)
BASIC
C)
MYCIN
D)
FORTRAN

Correct Answer : Option (A) :   LOGO

A)
(eq)
B)
(cons)
C)
(cous =)
D)
(consp)

Correct Answer : Option (D) :   (consp)

A)
mobile
B)
open loop
C)
intelligent
D)
non-servo

Correct Answer : Option (C) :   intelligent

A)
(setq y x)
B)
(setq y ‘x’)
C)
(set y = ‘x’)
D)
(setq y = ‘x’)

Correct Answer : Option (B) :   (setq y ‘x’)

A)
meta-rules
B)
production rules
C)
control rules
D)
rule interpreters

Correct Answer : Option (B) :   production rules

A)
(setq a 10)
B)
(a = b) where b = 10
C)
(a = 10) (d) (setq 10 a)
D)
All of the above

Correct Answer : Option (A) :   (setq a 10)

A)
ISIS
B)
RAND
C)
MOLGEN
D)
MACSYMA

Correct Answer : Option (D) :   MACSYMA

A)
isolated word recognition
B)
connected word recognition
C)
continuous speech recognition
D)
speaker-dependent recognition

Correct Answer : Option (A) :   isolated word recognition

A)
cells
B)
fields
C)
pointers
D)
All of the above

Correct Answer : Option (D) :   All of the above

A)
Allen Newell
B)
A.M. Turning
C)
John McCarthy
D)
Herbert Simon

Correct Answer : Option (B) :   A.M. Turning

A)
heuristic processors
B)
program recognizers
C)
intelligent programming tools
D)
symbolic programmers

Correct Answer : Option (C) :   intelligent programming tools

A)
Super mini computers
B)
Time-sharing terminals
C)
AI workstations
D)
All of the above

Correct Answer : Option (C) :   AI workstations

A)
artificial intelligence
B)
human intelligence
C)
virtual intelligence
D)
machine intelligence

Correct Answer : Option (A) :   artificial intelligence

A)
speaker dependence
B)
speaker independence
C)
isolated word recognition
D)
All of the above

Correct Answer : Option (B) :   speaker independence

A)
robotics
B)
decision support
C)
symbolic processing
D)
natural language processing

Correct Answer : Option (D) :   natural language processing

A)
Study of Boolean values
B)
Study of communication between two humans
C)
Study of communication between two machines
D)
Study of communication between human and machine

Correct Answer : Option (D) :   Study of communication between human and machine


Explanation : Cybernetics is Study of communication between human and machine.

A)
BFS is nothing but Binary First Search
B)
BFS will get trapped exploring a single path
C)
The entire tree so far been generated must be stored in BFS
D)
BFS is not guaranteed to find a solution if exists

Correct Answer : Option (C) :   The entire tree so far been generated must be stored in BFS


Explanation : Regarding BFS-The entire tree so far been generated must be stored in BFS.

A)
It is guaranteed to return an optimal solution when one exists
B)
It guarantees to return more optimal solutions
C)
It returns more solutions, but not an optimal one
D)
It is not guaranteed to return an optimal solution when one exists

Correct Answer : Option (A) :   It is guaranteed to return an optimal solution when one exists

A)
O(n)
B)
O(n!)
C)
O(n2)
D)
O(n/2)

Correct Answer : Option (B) :   O(n!)


Explanation : The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is O(n!).

A)
To extract scientific causes
B)
To solve artificial problems
C)
To solve real-world problems
D)
To explain various sorts of intelligence

Correct Answer : Option (D) :   To explain various sorts of intelligence


Explanation : The scientific goal of artificial intelligence is to explain various sorts of intelligence.

A)
It has a loop
B)
It starts with a solution
C)
It does not terminate with a solution
D)
It terminates with a solution when one exists

Correct Answer : Option (D) :   It terminates with a solution when one exists

A)
color and motion
B)
depth and texture
C)
Both (a) and (b)
D)
height and weight

Correct Answer : Option (C) :   color and motion

A)
LMI
B)
Symbolics
C)
AI corp
D)
Both LMI & Symbolics

Correct Answer : Option (D) :   Both LMI & Symbolics

A)
writing
B)
seeing
C)
reading
D)
speaking

Correct Answer : Option (B) :   seeing

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

Correct Answer : Option (A) :   SIMD

A)
A mouse and specialized keyboard
B)
Large memory and high-speed processor
C)
Letter quality printers and eight-inch disk drives
D)
A mouse and specialized keyboard, Letter quality printers and eight-inch disk drives

Correct Answer : Option (D) :   A mouse and specialized keyboard, Letter quality printers and eight-inch disk drives

A)
1.25+sqrt (1.44)
B)
(1.25+sqrt (1.44))
C)
(+1.25 sqrt (1.44)
D)
All of the above

Correct Answer : Option (C) :   (+1.25 sqrt (1.44)

A)
Influence diagram
B)
Directed Acyclic Graph
C)
Table of conditional probabilities
D)
None of the above

Correct Answer : Option (A) :   Influence diagram


Explanation : The generalized form of Bayesian network that represents and solve decision problems under uncertain knowledge is known as an Influence diagram

A)
Decision graphs
B)
Dynamic Bayesian networks
C)
Parameter tuning
D)
Value of information

Correct Answer : Option (B) :   Dynamic Bayesian networks


Explanation : Dynamic Bayesian networks (DBNs) are used for modeling times series and sequences.