Artificial Intelligence Agents

1. The performance of an agent can be improved by

a) Learning
b) Observing
c) Perceiving
d) None of the mentioned

2. External actions of the agent is selected by

a) Perceive
b) Performance
c) Learning
d) Actuator

3. The action of the Simple reflex agent completely depends upon

a) Perception history
b) Current perception
c) Learning theory
d) Utility functions

4. Following could be the approaches to Artificial Intelligence

a) Strong Artificial Intelligence
b) Weak Artificial Intelligence
c) Applied Artificial Intelligence
d) All of the mentioned

5. An Artificial Neural Network Is based on

a) Strong Artificial Intelligence approach
b) Weak Artificial Intelligence approach
c) Cognitive Artificial Intelligence approach
d) Applied Artificial Intelligence approach

6. The Face Recognition system is based on

a) Strong Artificial Intelligence approach
b) Weak Artificial Intelligence approach
c) Cognitive Artificial Intelligence approach
d) Applied Artificial Intelligence approach

7. A completely automated chess engine (Learn from previous games) is based on

a) Strong Artificial Intelligence approach
b) Weak Artificial Intelligence approach
c) Cognitive Artificial Intelligence approach
d) Applied Artificial Intelligence approach
View Answer
8. A basic line following robot is based on
a) Strong Artificial Intelligence approach
b) Weak Artificial Intelligence approach
c) Cognitive Artificial Intelligence approach
d) Applied Artificial Intelligence approach

9. The following task/tasks Artificial Intelligence could not do yet

a) Understand natural language robustly
b) Web mining
c) Construction of plans in real time dynamic systems
d) All of the mentioned

10. What among the following is/are the example of the intelligent agent/agents?
a) Human
b) Robot
c) Autonomous Spacecraft
d) All of the mentioned

Agents
1. Which instruments are used for perceiving and acting upon the environment?
a) Sensors and Actuators
b) Sensors
c) Perceiver
d) None of the mentioned

2. What is meant by agent’s percept sequence?

a) Used to perceive the environment
b) Complete history of actuator
c) Complete history of perceived things
d) None of the mentioned

3. How many types of agents are there in artificial intelligence?

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

4. What is the rule of simple reflex agent?

a) Simple-action rule
b) Condition-action rule
c) Simple & Condition-action rule
d) None of the mentioned

5. What are the composition for agents in artificial intelligence?

a) Program
b) Architecture
c) Both Program & Architecture
d) None of the mentioned

6. In which agent does the problem generator is present?

a) Learning agent
b) Observing agent
c) Reflex agent
d) None of the mentioned

7. Which is used to improve the agents performance?

a) Perceiving
b) Learning
c) Observing
d) None of the mentioned

8. Which agent deals with happy and unhappy states?

a) Simple reflex agent
b) Model based agent
c) Learning agent
d) Utility based agent

9. Which action sequences are used to achieve the agent’s goal?

a) Search
b) Plan
c) Retrieve
d) Both Search & Plan

10. Which element in agent are used for selecting external actions?
a) Perceive
b) Performance
c) Learning
d) Actuator

Intelligent Agents and Environment

1. What is Artificial intelligence?
a) Putting your intelligence into Computer
b) Programming with your own intelligence
c) Making a Machine intelligent
d) Playing a Game

2. Which is not the commonly used programming language for AI?

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

3. Artificial Intelligence has its expansion in the following application. (Mark all
that apply)
a) Planning and Scheduling
b) Game Playing
c) Diagnosis
d) All of the mentioned

4. An ‘agent’ is anything that,

a) Perceives its environment through sensors and acting upon that environment
through actuators
b) Takes input from the surroundings and uses its intelligence and performs the
desired operations
c) A embedded program controlling line following robot
d) All of the mentioned

5. Agents behavior can be best described by

a) Perception sequence
b) Agent function
c) Sensors and Actuators
d) Environment in which agent is performing

6. Rational agent is the one who always does the right thing. State true or false
a) True
b) False

7. Performance Measures are fixed for all agents. State true or false
a) True
b) False
8. What is rational at any given time depends on
a) The performance measure that defines the criterion of success
b) The agent’s prior knowledge of the environment
c) The actions that the agent can perform
d) All of the mentioned

9. An omniscient agent knows the actual outcome of its actions and can act
accordingly; but omniscience is impossible in reality. Rational Agent always does
the right thing; but Rationality is possible in reality. State true or false
a) True
b) False

10. The Task Environment of an agent consists of

a) Sensors
b) Actuators
c) Performance Measures
d) All of the mentioned

11. What could possibly be the environment of a Satellite Image Analysis System?
a) Computers in space and earth
b) Image categorization techniques
c) Statistical data on image pixel intensity value and histograms
d) All of the mentioned

12. Categorize Crossword puzzle in Fully Observable / Partially Observable.

a) Fully Observable
b) partially Observable
c) All of the mentioned
d) None of the mentioned

13. The game of Poker is a single agent.

a) True
b) False

14. Satellite Image Analysis System is (Choose the one that is not applicable).
a) Episodic
b) Semi-Static
c) Single agent
d) Partially Observable

15. An agent is composed of ________

a) Architecture
b) Agent Function
c) Perception Sequence
d) Architecture and Program

Online Search Agent

1. Which search agent operates by interleaving computation and action?
a) Offline search
b) Online search
c) Breadth-first search
d) Depth-first search

2. What is called as exploration problem?

a) State and actions are unknown to the agent
b) State and actions are known to the agent
c) Only actions are known to agent
d) None of the mentioned

3. Which are necessary for an agent to solve an online search problem?

a) Actions
b) Step-cost function
c) Goal-test
d) All of the mentioned

4. When do we call the states are safely explorable?

a) A goal state is unreachable from any state
b) A goal state is denied access
c) A goal state is reachable from every state
d) None of the mentioned

5. In which state spaces does the online-dfs-agent will work?

a) Irreversible state spaces
b) Reversible state spaces
c) searchable state spaces
d) All of the mentioned

6. Which of the following algorithm is online search algorithm?

a) Breadth-first search algorithm
b) Depth-first search algorithm
c) Hill-climbing search algorithm
d) None of the mentioned

7. Which search algorithm will use limited amount of memory?

a) RBFS
b) SMA*
c) Hill-climbing search algorithm
d) Both RBFS & SMA*
8. What is meant by simulated annealing in artificial intelligence?
a) Returns an optimal solution when there is a proper cooling schedule
b) Returns an optimal solution when there is no proper cooling schedule
c) It will not return an optimal solution when there is a proper cooling schedule
d) None of the mentioned

9. How the new states are generated in genetic algorithm?

a) Composition
b) Mutation
c) Cross-over
d) Both Mutation & Cross-over

10. Which method is effective for escaping from local minima?

a) Updating heuristic estimate
b) Reducing heuristic estimate
c) Eliminating heuristic estimate
d) None of the mentioned

Agent Architecture
1. Which depends on the percepts and actions available to the agent?
a) Agent
b) Sensor
c) Design problem
d) None of the mentioned
2. Which were built in such a way that humans had to supply the inputs and
interpret the outputs?
a) Agents
b) AI system
c) Sensor
d) Actuators

3. Which technology uses miniaturized accelerometers and gyroscopes?

a) Sensors
b) Actuators
c) MEMS
d) None of the mentioned

4. What is used for tracking uncertain events?

a) Filtering algorithm
b) Sensors
c) Actuators
d) None of the mentioned

5. What is not represented by using propositional logic?

a) Objects
b) Relations
c) Both Objects & Relations
d) None of the mentioned

6. Which functions are used as preferences over state history?

a) Award
b) Reward
c) Explicit
d) Implicit

7. Which kind of agent architecture should an agent an use?

a) Relaxed
b) Logic
c) Relational
d) All of the mentioned

8. Specify the agent architecture name that is used to capture all kinds of actions.
a) Complex
b) Relational
c) Hybrid
d) None of the mentioned

9. Which agent enables the deliberation about the computational entities and
actions?
a) Hybrid
b) Reflective
c) Relational
d) None of the mentioned

10. What can operate over the joint state space?

a) Decision-making algorithm
b) Learning algorithm
c) Complex algorithm
d) Both Decision-making & Learning algorithm

Environments
1. What is the action of task environment in artificial intelligence?
a) Problem
b) Solution
c) Agent
d) Observation

2. What is the expansion of PEAS in task environment?

a) Peer, Environment, Actuators, Sense
b) Perceiving, Environment, Actuators, Sensors
c) Performance, Environment, Actuators, Sensors
d) None of the mentioned

3. What kind of observing environments are present in artificial intelligence?

a) Partial
b) Fully
c) Learning
d) Both Partial & Fully

4. What kind of environment is strategic in artificial intelligence?

a) Deterministic
b) Rational
c) Partial
d) Stochastic

5. What kind of environment is crossword puzzle?

a) Static
b) Dynamic
c) Semi Dynamic
d) None of the mentioned

6. What kind of behavior does the stochastic environment posses?

a) Local
b) Deterministic
c) Rational
d) Primary

7.Which is used to select the particular environment to run the agent?

a) Environment creator
b) Environment Generator
c) Both Environment creator & Generator
d) None of the mentioned

8. Which environment is called as semi dynamic?

a) Environment does not change with the passage of time
b) Agent performance changes
c) Environment will be changed
d) Environment does not change with the passage of time, but Agent performance
changes

9. Where does the performance measure is included?

a) Rational agent
b) Task environment
c) Actuators
d) Sensor

10. Which is used to provide the feedback to the learning element?

a) Critic
b) Actuators
c) Sensor
d) None of the mentioned

Problem Solving
1. The main task of a problem-solving agent is
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) All of the mentioned
d) None of the mentioned

2. What is state space?

a) The whole problem
b) Your Definition to a problem
c) Problem you design
d) Representing your problem with variable and parameter

3.The problem-solving agent with several immediate options of unknown value

can decide what to do by just examining different possible sequences of actions
that lead to states of known value, and then choosing the best sequence. This
process of looking for such a sequence is called Search. State True or False
a) True
b) False

4. A search algorithm takes _________ as an input and returns ________ as an

output.
a) Input, output
b) Problem, solution
c) Solution, problem
d) Parameters, sequence of actions

5. A problem in a search space is defined by one of these state.

a) Initial state
b) Last state
c) Intermediate state
d) All of the above

6. The Set of actions for a problem in a state space is formulated by a _________

a) Intermediate states
b) Initial state
c) Successor function, which takes current action and returns next immediate state
d) None of the mentioned

7. A solution to a problem is a path from the initial state to a goal state. Solution
quality is measured by the path cost function, and an optimal solution has the
highest path cost among all solutions. State whether true or false.
a) True
b) False

8. The process of removing detail from a given state representation is called______

a) Extraction
b) Abstraction
c) Information Retrieval
d) Mining of data
9. A problem solving approach works well for
a) 8-Puzzle problem
b) 8-queen problem
c) Finding a optimal path from a given source to a destination
d) Mars Hover (Robot Navigation)

10. The _______ is a touring problem in which each city must be visited exactly
once. The aim is to find the shortest tour.
a) Finding shortest path between a source and a destination
b) Travelling Salesman problem
c) Map coloring problem
d) Depth first search traversal on a given map represented as a graph

11. Web Crawler is a/an

a) Intelligent goal-based agent
b) Problem-solving agent
c) Simple reflex agent
d) Model based agent

12. The major component/components for measuring the performance of problem

solving
a) Completeness
b) Optimality
c) Time and Space complexity
d) All of the mentioned

Uninformed Search Strategy

1. Which search strategy is also called as blind search?
a) Uninformed search
b) Informed search
c) Simple reflex search
d) All of the mentioned

2. How many types are available in uninformed search method?

a) 3
b) 4
c) 5
d) 6
3. Which search is implemented with an empty first-in-first-out queue?
a) Depth-first search
b) Breadth-first search
c) Bidirectional search
d) None of the mentioned

4. When is breadth-first search is optimal?

a) When there is less number of nodes
b) When all step costs are equal
c) When all step costs are unequal
d) None of the mentioned

5. How many successors are generated in backtracking search?

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

6. What is the space complexity of Depth-first search?

a) O(b)
b) O(bl)
c) O(m)
d) O(bm)

7. How many parts does a problem consists of?

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

8. Which algorithm is used to solve any kind of problem?

a) Breadth-first algorithm
b) Tree algorithm
c) Bidirectional search algorithm
d) None of the mentioned

9. Which search algorithm imposes a fixed depth limit on nodes?

a) Depth-limited search
b) Depth-first search
c) Iterative deepening search
d) Bidirectional search

10. Which search implements stack operation for searching the states?
a) Depth-limited search
b) Depth-first search
c) Breadth-first search
d) None of the mentioned

Uninformed Search and Exploration

1. Blind searching is general term for
a) Informed Search
b) Uninformed Search
c) Informed & Unformed Search
d) Heuristic Search

2. Strategies that know whether one non-goal state is “more promising” than
another are called
a) Informed & Unformed Search
b) Unformed Search
c) Heuristic & Unformed Search
d) Informed & Heuristic Search
3. Which of the following is/are Uninformed Search technique/techniques
a) Breadth First Search (BFS)
b) Depth First Search (DFS)
c) Bidirectional Search
d) All of the mentioned

4. Which data structure conveniently used to implement BFS?

a) Stacks
b) Queues
c) Priority Queues
d) All of the mentioned

5. Which data structure conveniently used to implement DFS?

a) Stacks
b) Queues
c) Priority Queues
d) All of the mentioned

6. The time and space complexity of BFS is (For time and space complexity
problems consider b as branching factor and d as depth of the search tree.)
a) O(bd+1) and O(bd+1)
b) O(b2) and O(d2)
c) O(d2) and O(b2)
d) O(d2) and O(d2)

7. Breadth-first search is not optimal when all step costs are equal, because it
always expands the shallowest unexpanded node. State whether true or false.
a) True
b) False

8. uniform-cost search expands the node n with the__________

a) Lowest path cost
b) Heuristic cost
c) Highest path cost
d) Average path cost

9. Depth-first search always expands the ______ node in the current fringe of the
search tree.
a) Shallowest
b) Child node
c) Deepest
d) Minimum cost

10. Breadth-first search always expands the ______ node in the current fringe of
the search tree.
a) Shallowest
b) Child node
c) Deepest
d) Minimum cost

11. Optimality of BFS is

a) When there is less number of nodes
b) When all step costs are equal
c) When all step costs are unequal
d) None of the mentioned

12. LIFO is ______ where as FIFO is ________

a) Stack, Queue
b) Queue, Stack
c) Priority Queue, Stack
d) Stack. Priority Queue

Informed Search Strategy

1. What is the other name of informed search strategy?
a) Simple search
b) Heuristic search
c) Online search
d) None of the mentioned

2. How many types of informed search method are in artificial intelligence?

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

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

4. Which function will select the lowest expansion node at first for evaluation?
a) Greedy best-first search
b) Best-first search
c) Depth-first search
d) None of the mentioned

5. What is the heuristic function of greedy best-first search?

a) f(n) != h(n)
b) f(n) < h(n)
c) f(n) = h(n)
d) f(n) > h(n)

6. Which search uses only the linear space for searching?

a) Best-first search
b) Recursive best-first search
c) Depth-first search
d) None of the mentioned

7. Which method is used to search better by learning?

a) Best-first search
b) Depth-first search
c) Metalevel state space
d) None of the mentioned

8. Which search is complete and optimal when h(n) is consistent?

a) Best-first search
b) Depth-first search
c) Both Best-first & Depth-first search
d) A* search

9. Which is used to improve the performance of heuristic search?

a) Quality of nodes
b) Quality of heuristic function
c) Simple form of nodes
d) None of the mentioned

10. Which search method will expand the node that is closest to the goal?
a) Best-first search
b) Greedy best-first search
c) A* search
d) None of the mentioned

Informed Search and Exploration

1. A heuristic is a way of trying
a) To discover something or an idea embedded in a program
b) To search and measure how far a node in a search tree seems to be from a goal
c) To compare two nodes in a search tree to see if one is better than another
d) All of the mentioned

2. A* algorithm is based on
a) Breadth-First-Search
b) Depth-First –Search
c) Best-First-Search
d) Hill climbing

3. The search strategy the uses a problem specific knowledge is known as

a) Informed Search
b) Best First Search
c) Heuristic Search
d) All of the mentioned

4. Uninformed search strategies are better than informed search strategies.

a) True
b) False

5. Best-First search is a type of informed search, which uses ________________ to

choose the best next node for expansion.
a) Evaluation function returning lowest evaluation
b) Evaluation function returning highest evaluation
c) Evaluation function returning lowest & highest evaluation
d) None of them is applicable

6. Best-First search can be implemented using the following data structure.

a) Queue
b) Stack
c) Priority Queue
d) Circular Queue

7. The name “best-first search” is a venerable but inaccurate one. After all, if we
could really expand the best node first, it would not be a search at all; it would be a
straight march to the goal. All we can do is choose the node that appears to be best
according to the evaluation function. State whether true or false.
a) True
b) False

8. Heuristic function h(n) is ____

a) Lowest path cost
b) Cheapest path from root to goal node
c) Estimated cost of cheapest path from root to goal node
d) Average path cost

9. Greedy search strategy chooses the node for expansion

a) Shallowest
b) Deepest
c) The one closest to the goal node
d) Minimum heuristic cost
10. In greedy approach evaluation function is
a) Heuristic function
b) Path cost from start node to current node
c) Path cost from start node to current node + Heuristic cost
d) Average of Path cost from start node to current node and Heuristic cost

11. What is the space complexity of Greedy search?

a) O(b)
b) O(bl)
c) O(m)
d) O(bm)

12. In A* approach evaluation function is

a) Heuristic function
b) Path cost from start node to current node
c) Path cost from start node to current node + Heuristic cost
d) Average of Path cost from start node to current node and Heuristic cost

13. A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never
underestimates the cost to reach the goal.
a) True
b) False

Local Search Problems and Optimization Problems

1. In many problems the path to goal is irrelevant, this class of problems can be
solved using,
a) Informed Search Techniques
b) Uninformed Search Techniques
c) Local Search Techniques
d) Informed & Uninformed Search Techniques

2. Though local search algorithms are not systematic, key advantages would
include
a) Less memory
b) More time
c) Finds a solution in large infinite space
d) Less memory & Finds a solution in large infinite space
3. A complete, local search algorithm always finds goal if one exists, an optimal
algorithm always finds a global minimum/maximum. State whether True or False.
a) True
b) False

4. _______________ Is an algorithm, a loop that continually moves in the

direction of increasing value – that is uphill
a) Up-Hill Search
b) Hill-Climbing
c) Hill algorithm
d) Reverse-Down-Hill search

5. Hill-Climbing algorithm terminates when,

a) Stopping criterion met
b) Global Min/Max is achieved
c) No neighbor has higher value
d) All of the mentioned

6. One of the main cons of hill-climbing search is,

a) Terminates at local optimum & Does not find optimum solution
b) Terminates at global optimum & Does not find optimum solution
c) Does not find optimum solution & Fail to find a solution
d) Fail to find a solution

7. Stochastic hill climbing chooses at random from among the uphill moves; the
probability of selection can vary with the steepness of the uphil1 move.
a) True
b) False

8. Hill climbing sometimes called ____________ because it grabs a good neighbor

state without thinking ahead about where to go next.
a) Needy local search
b) Heuristic local search
c) Greedy local search
d) Optimal local search

9. Hill-Climbing approach stuck for the following reasons

a) Local maxima
b) Ridges
c) Plateaux
d) All of the mentioned

10. ___________ algorithm keeps track of k states rather than just one.
a) Hill-Climbing search
b) Local Beam search
c) Stochastic hill-climbing search
d) Random restart hill-climbing search

11. A genetic algorithm (or GA) is a variant of stochastic beam search in which
successor states are generated by combining two parent states, rather than by
modifying a single state.
a) True
b) False

12. Mark two main features of Genetic Algorithm

a) Fitness function & Crossover techniques
b) Crossover techniques & Random mutation
c) Individuals among the population & Random mutation
d) Random mutation & Fitness function

13. Searching using query on Internet is, use of ___________ type of agent
a) Offline agent
b) Online agent
c) Both Offline & Online agent
d) Goal Based & Online agent

Constraints Satisfaction Problems

1. _________________ are mathematical problems defined as a set of objects
whose state must satisfy a number of constraints or limitations.
a) Constraints Satisfaction Problems
b) Uninformed Search Problems
c) Local Search Problems
d) All of the mentioned

2. Which of the Following problems can be modeled as CSP?

a) 8-Puzzle problem
b) 8-Queen problem
c) Map coloring problem
d) All of the mentioned

3. What among the following constitutes to the incremental formulation of CSP?

a) Path cost
b) Goal cost
c) Successor function
d) All of the mentioned

4. The term ___________ is used for a depth-first search that chooses values for
one variable at a time and returns when a variable has no legal values left to assign.
a) Forward search
b) Backtrack search
c) Hill algorithm
d) Reverse-Down-Hill search

5. To overcome the need to backtrack in constraint satisfaction problem can be

eliminated by
a) Forward Searching
b) Constraint Propagation
c) Backtrack after a forward search
d) Omitting the constraints and focusing only on goals

6. The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple

policy for what to do when a branch of the search fails: back up to the preceding
variable and try a different value for it. This is called chronological-backtracking.
It is also possible to go all the way to set of variable that caused failure. State
whether True or False.
a) True
b) False

7. Consider a problem of preparing a schedule for a class of student. This problem

is a type of
a) Search Problem
b) Backtrack Problem
c) CSP
d) Planning Problem

8. Constraint satisfaction problems on finite domains are typically solved using a

form of ___________
a) Search Algorithms
b) Heuristic Search Algorithms
c) Greedy Search Algorithms
d) All of the mentioned

9. Solving a constraint satisfaction problem on a finite domain is an/a

___________ problem with respect to the domain size.
a) P complete
b) NP complete
c) NP hard
d) Domain dependent

10. ____________ is/are useful when the original formulation of a problem is

altered in some way, typically because the set of constraints to consider evolves
because of the environment.
a) Static CSPs
b) Dynamic CSPs
c) Flexible CSPs
d) None of the mentioned

11. Flexible CSPs relax on _______

a) Constraints
b) Current State
c) Initial State
d) Goal State

12. Language/Languages used for programming Constraint Programming includes

a) Prolog
b) C#
c) C
d) Fortrun

13. Backtracking is based on,

a) Last in first out
b) First in first out
c) Recursion
d) Both Last in first out & Recursion
14. Constraint Propagation technique actually modifies the CSP problem.
a) True
b) False

15. When do we call the states are safely explored?

a) A goal state is unreachable from any state
b) A goal state is denied access
c) A goal state is reachable from every state
d) None of the mentioned

16. Which of the following algorithm is generally used CSP search algorithm?
a) Breadth-first search algorithm
b) Depth-first search algorithm
c) Hill-climbing search algorithm
d) None of the mentioned

State Space Search

1. Which is the most straightforward approach for planning algorithm?
a) Best-first search
b) State-space search
c) Depth-first search
d) Hill-climbing search

2. What are taken into account of state-space search?

a) Postconditions
b) Preconditions
c) Effects
d) Both Preconditions & Effects

3. How many ways are available to solve the state-space search?

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

4. What is the other name for forward state-space search?

a) Progression planning
b) Regression planning
c) Test planning
d) None of the mentioned

5. How many states are available in state-space search?

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

6. What is the main advantage of backward state-space search?

a) Cost
b) Actions
c) Relevant actions
d) All of the mentioned

7. What is the other name of backward state-space search?

a) Regression planning
b) Progression planning
c) State planning
d) Test planning

8. What is meant by consistent in state-space search?

a) Change in the desired literals
b) Not any change in the literals
c) No change in goal state
d) None of the mentioned

9. What will happen if a predecessor description is generated that is satisfied by the

initial state of the planning problem?
a) Success
b) Error
c) Compilation
d) Termination

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

First-Order Logic
1. There exist only two types of quantifiers, Universal Quantification and
Existential Quantification.
a) True
b) False

2. Translate the following statement into FOL.

“For every a, if a is a philosopher, then a is a scholar”
a) ∀ a philosopher(a) scholar(a)
b) ∃ a philosopher(a) scholar(a)
c) All of the mentioned
d) None of the mentioned

3. A _________ is used to demonstrate, on a purely syntactic basis, that one

formula is a logical consequence of another formula.
a) Deductive Systems
b) Inductive Systems
c) Reasoning with Knowledge Based Systems
d) Search Based Systems

4. The statement comprising the limitations of FOL is/are

a) Expressiveness
b) Formalizing Natural Languages
c) Many-sorted Logic
d) All of the mentioned

5. A common convention is:

• is evaluated first
• and are evaluated next
• Quantifiers are evaluated next
• is evaluated last.
a) True
b) False

6. A Term is either an individual constant (a 0-ary function), or a variable, or an n-

ary function applied to n terms: F(t1 t2 ..tn).
a) True
b) False

7. First Order Logic is also known as ___________

a) First Order Predicate Calculus
b) Quantification Theory
c) Lower Order Calculus
d) All of the mentioned
View Answer
8. The adjective “first-order” distinguishes first-order logic from ___________ in
which there are predicates having predicates or functions as arguments, or in which
one or both of predicate quantifiers or function quantifiers are permitted.
a) Representational Verification
b) Representational Adequacy
c) Higher Order Logic
d) Inferential Efficiency

Propositional Logic
1. Which is created by using single propositional symbol?
a) Complex sentences
b) Atomic sentences
c) Composition sentences
d) None of the mentioned
View Answer
2. Which is used to construct the complex sentences?
a) Symbols
b) Connectives
c) Logical connectives
d) All of the mentioned

3. How many proposition symbols are there in artificial intelligence?

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

4. How many logical connectives are there in artificial intelligence?

a) 2
b) 3
c) 4
d) 5

5. Which is used to compute the truth of any sentence?

a) Semantics of propositional logic
b) Alpha-beta pruning
c) First-order logic
d) Both Semantics of propositional logic & Alpha-beta pruning

6. Which are needed to compute the logical inference algorithm?

a) Logical equivalence
b) Validity
c) Satisfiability
d) All of the mentioned

7. From which rule does the modus ponens are derived?

a) Inference rule
b) Module rule
c) Both Inference & Module rule
d) None of the mentioned

8. Which is also called single inference rule?

a) Reference
b) Resolution
c) Reform
d) None of the mentioned

9. Which form is called as conjunction of disjunction of literals?

a) Conjunctive normal form
b) Disjunctive normal form
c) Normal form
d) All of the mentioned
10. What can be viewed as single lateral of disjunction?
a) Multiple clause
b) Combine clause
c) Unit clause
d) None of the mentioned

Resolution
1. Which is a refutation complete inference procedure for propositional logic?
a) Clauses
b) Variables
c) Propositional resolution
d) Proposition

2. What kind of clauses are available in Conjunctive Normal Form?

a) Disjunction of literals
b) Disjunction of variables
c) Conjunction of literals
d) Conjunction of variables

3. What is the condition of literals in variables?

a) Existentially quantified
b) Universally quantified
c) Quantified
d) None of the mentioned

4. Which can be converted to inferred equivalent CNF sentence?

a) Every sentence of propositional logic
b) Every sentence of inference
c) Every sentence of first-order logic
d) All of the mentioned

5. Which sentence will be unsatisfiable if the CNF sentence is unsatisfiable?

a) Search statement
b) Reading statement
c) Replaced statement
d) Original statement
6. Which rule is equal to resolution rule of first-order clauses?
a) Propositional resolution rule
b) Inference rule
c) Resolution rule
d) None of the mentioned
View Answer

7. At which state does the propositional literals are complementary?

a) If one variable is less
b) If one is the negation of the other
c) All of the mentioned
d) None of the mentioned

8. What is meant by factoring?

a) Removal of redundant variable
b) Removal of redundant literal
c) Addition of redundant literal
d) Addition of redundant variable

9. What will happen if two literals are identical?

a) Remains the same
b) Added as three
c) Reduced to one
d) None of the mentioned

10. When the resolution is called as refutation-complete?

a) Sentence is satisfiable
b) Sentence is unsatisfiable
c) Sentence remains the same
d) None of the mentioned

Expert Systems
1. In LISP, the function returns t if <integer> is even and nil otherwise:
a) (evenp <integer>)
b) (even <integer>)
c) (numeven <integer>)
d) (numnevenp <integer>)
2. Which of the following is an advantage of using an expert system development
tool?
a) imposed structure
b) knowledge engineering assistance
c) rapid prototyping
d) all of the mentioned

3. An AI system developed by Daniel Bobrow to read and solve algebra word

problems
a) SHRDLU
b) SIMD
c) BACON
d) STUDENT

4. The “Turing Machine” showed that you could use a/an _____ system to program
any algorithmic task.
a) binary
b) electro-chemical
c) recursive
d) semantic

5. MCC is investigating the improvement of the relationship between people and

computers through a technology called:
a) computer-aided design
b) human factors
c) parallel processing
d) all of the mentioned

6. The first widely-used commercial form of Artificial Intelligence (Al) is being

used in many popular products like microwave ovens, automobiles and plug in
circuit boards for desktop PCs. It allows machines to handle vague information
with a deftness that mimics human intuition. What is the name of this Artificial
Intelligence?
a) Boolean logic
b) Human logic
c) Fuzzy logic
d) Functional logic

7. In his landmark book Cybernetics, Norbert Wiener suggested a way of modeling

scientific phenomena using not energy, but:
a) mathematics
b) intelligence
c) information
d) history

8. Input segments of AI programming contain(s)

a) sound
b) smell
c) touch
d) None of the mentioned

9. The applications in the Strategic Computing Program include:

a) battle management
b) autonomous systems
c) pilot’s associate
d) all of the mentioned

10. In LISP, the function evaluates <object> and assigns this value to the
unevaluated <sconst>.
a) (constant <sconst> <object>)
b) (defconstant <sconst> <object>)
c) (eva <sconst> <object>)
d) (eva <object> <sconst>)

9. In which of the following situations might a blind search be acceptable?

a) real-life situation
b) complex game
c) small search space
d) all of the mentioned

10. What is Artificial intelligence?

a) Putting your intelligence into Computer
b) Programming with your own intelligence
c) Making a Machine intelligent
d) Playing a Game

11. Which search method takes less memory?

a) Depth-First Search
b) Breadth-First search
c) Optimal search
d) Linear Search

12. A heuristic is a way of trying

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

13. How do you represent “All dogs have tails”?

a) ۷ x: dog(x) àhastail(x)
b) ۷ x: dog(x) àhastail(y)
c) ۷ x: dog(y) àhastail(x)
d) ۷ x: dog(x) àhasàtail(x)

14. Which is not a property of representation of knowledge?

a) Representational Verification
b) Representational Adequacy
c) Inferential Adequacy
d) Inferential Efficiency

7. Which of the following is being investigated as a means of automating the

creation of a knowledge base?
a) automatic knowledge acquisition
b) simpler tools
c) discovery of new concepts
d) all of the mentioned

9. A robot’s “arm” is also known as its:

a) end effector
b) actuator
c) manipulator
d) servomechanism

5. An expert system differs from a database program in that only an expert system:
a) contains declarative knowledge
b) contains procedural knowledge
c) features the retrieval of stored information
d) expects users to draw their own conclusions
Machine Learning
1. Machine learning is
a) The autonomous acquisition of knowledge through the use of computer
programs
b) The autonomous acquisition of knowledge through the use of manual programs
c) The selective acquisition of knowledge through the use of computer programs
d) The selective acquisition of knowledge through the use of manual programs

2. Factors which affect the performance of learner system does not include
a) Representation scheme used
b) Training scenario
c) Type of feedback
d) Good data structures

3. Different learning methods does not include

a) Memorization
b) Analogy
c) Deduction
d) Introduction

4. In language understanding, the levels of knowledge that does not include

a) Phonological
b) Syntactic
c) Empirical
d) Logical

5. A model of language consists of the categories which does not include

a) Language units
b) Role structure of units
c) System constraints
d) Structural units

6. What is a top-down parser?

a) Begins by hypothesizing a sentence (the symbol S) and successively predicting
lower level constituents until individual preterminal symbols are written
b) Begins by hypothesizing a sentence (the symbol S) and successively predicting
upper level constituents until individual preterminal symbols are written
c) Begins by hypothesizing lower level constituents and successively predicting a
sentence (the symbol S)
d) Begins by hypothesizing upper level constituents and successively predicting a
sentence (the symbol S)

7. Among the following which is not a horn clause?

a) p
b) Øp V q
c) p → q
d) p → Øq

8. The action ‘STACK(A, B)’ of a robot arm specify to

a) Place block B on Block A
b) Place blocks A, B on the table in that order
c) Place blocks B, A on the table in that order
d) Place block A on block B

Forward Chaining
1. Which condition is used to cease the growth of forward chaining?
a) Atomic sentences
b) Complex sentences
c) No further inference
d) All of the mentioned

2. Which closely resembles propositional definite clause?

a) Resolution
b) Inference
c) Conjunction
d) First-order definite clauses

3. What is the condition of variables in first-order literals?

a) Existentially quantified
b) Universally quantified
c) Both Existentially & Universally quantified
d) None of the mentioned
4. Which are more suitable normal form to be used with definite clause?
a) Positive literal
b) Negative literal
c) Generalized modus ponens
d) Neutral literal

5. Which will be the instance of the class datalog knowledge bases?

a) Variables
b) No function symbols
c) First-order definite clauses
d) None of the mentioned

6. Which knowledge base is called as fixed point?

a) First-order definite clause are similar to propositional forward chaining
b) First-order definite clause are mismatch to propositional forward chaining
c) All of the mentioned
d) None of the mentioned

7. How to eliminate the redundant rule matching attempts in the forward chaining?
a) Decremental forward chaining
b) Incremental forward chaining
c) Data complexity
d) None of the mentioned

8. From where did the new fact inferred on new iteration is derived?
a) Old fact
b) Narrow fact
c) New fact
d) All of the mentioned

9. Which will solve the conjuncts of the rule so that the total cost is minimized?
a) Constraint variable
b) Conjunct ordering
c) Data complexity
d) All of the mentioned
10. How many possible sources of complexity are there in forward chaining?
a) 1
b) 2
c) 3
d) 4

Backward Chaining
1. Which algorithm will work backward from the goal to solve a problem?
a) Forward chaining
b) Backward chaining
c) Hill-climb algorithm
d) None of the mentioned

2. Which is mainly used for automated reasoning?

a) Backward chaining
b) Forward chaining
c) Logic programming
d) Parallel programming

3. What will backward chaining algorithm will return?

a) Additional statements
b) Substitutes matching the query
c) Logical statement
d) All of the mentioned

4. How can be the goal is thought of in backward chaining algorithm?

a) Queue
b) List
c) Vector
d) Stack

5. What are used in backward chaining algorithm?

a) Conjuncts
b) Substitution
c) Composition of substitution
d) None of the mentioned
6. Which algorithm are in more similar to backward chaining algorithm?
a) Depth-first search algorithm
b) Breadth-first search algorithm
c) Hill-climbing search algorithm
d) All of the mentioned

7. Which problem can frequently occur in backward chaining algorithm?

a) Repeated states
b) Incompleteness
c) Complexity
d) Both Repeated states & Incompleteness

8. How the logic programming can be constructed?

a) Variables
b) Expressing knowledge in a formal language
c) Graph
d) All of the mentioned

9. What form of negation does the prolog allows?

a) Negation as failure
b) Proposition
c) Substitution
d) Negation as success

10. Which is omitted in prolog unification algorithm?

a) Variable check
b) Occur check
c) Proposition check
d) Both Occur & Proposition check

Knowledge and Reasoning

1. Knowledge and reasoning also play a crucial role in dealing with
__________________ environment.
a) Completely Observable
b) Partially Observable
c) Neither Completely nor Partially Observable
d) Only Completely and Partially Observable

2. Treatment chosen by doctor for a patient for a disease is based on

a) Only current symptoms
b) Current symptoms plus some knowledge from the textbooks
c) Current symptoms plus some knowledge from the textbooks plus experience
d) All of the mentioned

3. A knowledge-based agent can combine general knowledge with current percepts

to infer hidden aspects of the current state prior to selecting actions. State whether
True or False.
a) True
b) False

4. A) Knowledge base (KB) is consists of set of statements.

B) Inference is deriving a new sentence from the KB.
Choose the correct option.
a) A is true, B is true
b) A is false, B is false
c) A is true, B is false
d) A is false, B is true

5. Wumpus World is a classic problem, best example of _______

a) Single player Game
b) Two player Game
c) Reasoning with Knowledge
d) Knowledge based Game

6. ‘α |= β ‘(to mean that the sentence α entails the sentence β) if and only if, in
every model in which α is _____ β is also _____
a) True, true
b) True, false
c) False, true
d) False, false
View Answer
7. Which is not a property of representation of knowledge?
a) Representational Verification
b) Representational Adequacy
c) Inferential Adequacy
d) Inferential Efficiency

8. Which is not Familiar Connectives in First Order Logic?

a) and
b) iff
c) or
d) not

9. Inference algorithm is complete only if,

a) It can derive any sentence
b) It can derive any sentence that is an entailed version
c) It is truth preserving
d) It can derive any sentence that is an entailed version & It is truth preserving

10. An inference algorithm that derives only entailed sentences is called sound or
truth-preserving.
a) True
b) False

Inference in First-Order Logic

1. The rule of Universal Instantiation (UI for short) says that we can infer any
sentence obtained by substituting a ground term (a term without variables) for the
variable.
a) True
b) False

2. The corresponding Existential Instantiation rule: for the existential quantifier is

slightly more complicated. For any sentence a, variable v, and constant symbol k
that does not appear elsewhere in the knowledge base
a) True
b) False

3. What among the following could the universal instantiation of ___________

For all x King(x) ^ Greedy(x) => Evil(x)
a) King(John) ^ Greedy(John) => Evil(John)
b) King(y) ^ Greedy(y) => Evil(y)
c) King(Richard) ^ Greedy(Richard) => Evil(Richard)
d) All of the mentioned
4. Lifted inference rules require finding substitutions that make different logical
expressions looks identical.
a) Existential Instantiation
b) Universal Instantiation
c) Unification
d) Modus Ponen
View Answer
Answer: c
Explanation: None.
5. Which of the following is not the style of inference?
a) Forward Chaining
b) Backward Chaining
c) Resolution Refutation
d) Modus Ponen
View Answer
Answer: d
Explanation: Modus ponen is a rule for an inference.
6. In order to utilize generalized Modus Ponens, all sentences in the KB must be in
the form of Horn sentences.
a) True
b) False
View Answer
Answer: a
Explanation: None.
7. For resolution to apply, all sentences must be in conjunctive normal form, a
conjunction of disjunctions of literals.
a) True
b) False
View Answer
Answer: a
Explanation: None.
advertisement
8. Two basic types of inferences are
1. ____________
2. ____________
a) Reduction to propositional logic, Manipulate rules directly
b) Reduction to propositional logic, Apply modus ponen
c) Apply modus ponen, Manipulate rules directly
d) Convert every rule to Horn Clause, Reduction to propositional logic
View Answer
Answer: a
Explanation: None.
9. What among the following could the Existential instantiation of
∃x Crown(x) ^ OnHead(x, Johnny)
a) Crown(John) ^ OnHead(John, Jonny)
b) Crown(y) ^ OnHead(y, Jonny)
c) Crown(x) ^ OnHead(x, Jonny)
d) None of the mentioned
View Answer
Answer: a, b
Explanation: None.
10. Translate the following statement into FOL.
“For every a, if a is a PhD student, then a has a master degree”
a) ∀ a PhD(a) -> Master(a)
b) ∃ a PhD(a) -> Master(a)
c) A is true, B is true
d) A is false, B is false
View Answer
Answer: a
Explanation: None.

Artificial Intelligence Questions and Answers – Rule Based System – 1

This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs)
focuses on “Rule Based System – 1”.
1. Instead of representing knowledge in a relatively declarative, static way (as a
bunch of things that are true), rule-based system represent knowledge in terms
of___________ that tell you what you should do or what you could conclude in
different situations.
a) Raw Text
b) A bunch of rules
c) Summarized Text
d) Collection of various Texts
View Answer
Answer: b
Explanation: None.
2. A rule-based system consists of a bunch of IF-THEN rules. State whether true or
false.
a) True
b) False
View Answer
Answer: a
Explanation: None.
3. In a backward chaining system you start with the initial facts, and keep using the
rules to draw new conclusions (or take certain actions) given those facts. State
whether true or false.
a) True
b) False
View Answer
Answer: b
Explanation: Refer the definition of backward chaining.
4. In a backward chaining system, you start with some hypothesis (or goal) you are
trying to prove, and keep looking for rules that would allow you to conclude that
hypothesis, perhaps setting new sub-goals to prove as you go. State whether true or
false.
a) True
b) False
View Answer
Answer: a
Explanation: None.
5. Forward chaining systems are _____________ where as backward chaining
systems are ___________
a) Goal-driven, goal-driven
b) Goal-driven, data-driven
c) Data-driven, goal-driven
d) Data-driven, data-driven
View Answer
Answer: c
Explanation: None.
6. A Horn clause is a clause with _______ positive literal.
a) At least one
b) At most one
c) None
d) All
View Answer
Answer: b
Explanation: Refer the definition of Horn Clauses.
7. ___________ trees can be used to infer in Horn clause systems.
a) Min/Max Tree
b) And/Or Trees
c) Minimum Spanning Trees
d) Binary Search Trees
View Answer
Answer: b
Explanation: Take the analogy using min/max trees in game theory.
advertisement
8. An expert system is a computer program that contains some of the subject-
specific knowledge of one or more human experts. State whether true or false.
a) True
b) False
View Answer
Answer: a
Explanation: None.
9. A knowledge engineer has the job of extracting knowledge from an expert and
building the expert system knowledge base. State whether true or false.
a) True
b) False
View Answer
Answer: a
Explanation: None.

Artificial Intelligence Questions and Answers – Rule Based System – 2

This set of AI Questions and Answers for Entrance exams focuses on “Rule Based
System – 2”.
1. Autonomous Question/Answering systems are
a) Expert Systems
b) Rule Based Expert Systems
c) Decision Tree Based Systems
d) All of the mentioned
View Answer
Answer: d
Explanation: None.
2. Following are the applications of Expert systems
a) Disease Diagnosis
b) Planning and Scheduling
c) Decision making
d) All of the mentioned
View Answer
Answer: d
Explanation: None.
3. _________ is/are the well known Expert System/s for medical diagnosis systems
a) MYSIN
b) CADUCEUS
c) DENDRAL
d) SMH.PAL
View Answer
Answer: a
Explanation: None.
4. The main components of the expert systems is/are,
a) Inference Engine
b) Knowledge Base
c) Inference Engine & Knowledge Base
d) None of the mentioned
View Answer
Answer: c
Explanation: Look at the general architecture of rule based expert systems.
5. There are primarily two modes for an inference engine: forward chaining and
backward chaining.
a) True
b) False
View Answer
Answer: a
Explanation: None.
6. PXDES is medical expert system, for diagnosis of lung disease.
a) True
b) False
View Answer
Answer: a
Explanation: None.
7. CaDet is used for early cancer detection.
a) True
b) False
View Answer
Answer: a
Explanation: None.
advertisement
8. MYSIN attempts to recommend appropriate therapies for patients with bacterial
infections.
a) True
b) False
View Answer
Answer: a
Explanation: None.
9. GERMWATCHER is used to control infections caused by bacteria.
a) True
b) False
View Answer
Answer: a
Explanation: None.
10. ARGEX is an agricultural expert system that gives correct advice to farmers.
a) True
b) False
View Answer
Answer: a
Explanation: None.
Artificial Intelligence Questions & Answers – Learning – 1
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs)
focuses on “Learning – 1”.
1. What will take place as the agent observes its interactions with the world?
a) Learning
b) Hearing
c) Perceiving
d) Speech
View Answer
Answer: a
Explanation: Learning will take place as the agent observes its interactions with the
world and its own decision making process.
2. Which modifies the performance element so that it makes better decision?
a) Performance element
b) Changing element
c) Learning element
d) None of the mentioned
View Answer
Answer: c
Explanation: A learning element modifies the performance element so that it can
make better decision.
3. How many things are concerned in design of a learning element?
a) 1
b) 2
c) 3
d) 4
View Answer
Answer: c
Explanation: The three main issues are affected in design of a learning element are
components, feedback and representation.
4. What is used in determining the nature of the learning problem?
a) Environment
b) Feedback
c) Problem
d) All of the mentioned
View Answer
Answer: b
Explanation: The type of feedback is used in determining the nature of the learning
problem that the agent faces.
5. How many types are available in machine learning?
a) 1
b) 2
c) 3
d) 4
View Answer
Answer: c
Explanation: The three types of machine learning are supervised, unsupervised and
reinforcement.
6. Which is used for utility functions in game playing algorithm?
a) Linear polynomial
b) Weighted polynomial
c) Polynomial
d) Linear weighted polynomial
View Answer
Answer: d
Explanation: Linear weighted polynomial is used for learning element in the game
playing programs.
7. Which is used to choose among multiple consistent hypotheses?
a) Razor
b) Ockham razor
c) Learning element
d) None of the mentioned
View Answer
Answer: b
Explanation: Ockham razor prefers the simplest hypothesis consistent with the data
intuitively.
8. What will happen if the hypothesis space contains the true function?
a) Realizable
b) Unrealizable
c) Both Realizable & Unrealizable
d) None of the mentioned
View Answer
Answer: b
Explanation: A learning problem is realizable if the hypothesis space contains the
true function.
9. What takes input as an object described by a set of attributes?
a) Tree
b) Graph
c) Decision graph
d) Decision tree
View Answer
Answer: d
Explanation: Decision tree takes input as an object described by a set of attributes
and returns a decision.
10. How the decision tree reaches its decision?
a) Single test
b) Two test
c) Sequence of test
d) No test
View Answer
Answer: c
Explanation: A decision tree reaches its decision by performing a sequence of tests.

Artificial Intelligence Questions and Answers – Learning – 2

This set of Artificial Intelligence (AI) online quiz focuses on “Learning – 2”.
1. Factors which affect the performance of learner system does not include
a) Representation scheme used
b) Training scenario
c) Type of feedback
d) Good data structures
View Answer
Answer: d
Explanation: Factors which affect the performance of learner system does not
include good data structures.
2. Different learning method does not include:
a) Memorization
b) Analogy
c) Deduction
d) Introduction
View Answer
Answer: d
Explanation: Different learning methods include memorization, analogy and
deduction.
3. Which of the following is the model used for learning?
a) Decision trees
b) Neural networks
c) Propositional and FOL rules
d) All of the mentioned
View Answer
Answer: d
Explanation: Decision trees, Neural networks, Propositional rules and FOL rules
all are the models of learning.
4. Automated vehicle is an example of ______
a) Supervised learning
b) Unsupervised learning
c) Active learning
d) Reinforcement learning
View Answer
Answer: a
Explanation: In automatic vehicle set of vision inputs and corresponding actions
are available to learner hence it’s an example of supervised learning.
5. Following is an example of active learning:
a) News Recommender system
b) Dust cleaning machine
c) Automated vehicle
d) None of the mentioned
View Answer
Answer: a
Explanation: In active learning, not only the teacher is available but the learner can
ask suitable perception-action pair example to improve performance.
6. In which of the following learning the teacher returns reward and punishment to
learner?
a) Active learning
b) Reinforcement learning
c) Supervised learning
d) Unsupervised learning
View Answer
Answer: b
Explanation: Reinforcement learning is the type of learning in which teacher
returns reward or punishment to learner.
7. Decision trees are appropriate for the problems where:
a) Attributes are both numeric and nominal
b) Target function takes on a discrete number of values.
c) Data may have errors
d) All of the mentioned
View Answer
Answer: d
Explanation: Decision trees can be used in all the conditions stated.
advertisement
8. Which of the following is not an application of learning?
a) Data mining
b) WWW
c) Speech recognition
d) None of the mentioned
View Answer
Answer: d
Explanation: All mentioned options are applications of learning.
9. Which of the following is the component of learning system?
a) Goal
b) Model
c) Learning rules
d) All of the mentioned
View Answer
Answer: d
Explanation: Goal, model, learning rules and experience are the components of
learning system.
10. Following is also called as exploratory learning:
a) Supervised learning
b) Active learning
c) Unsupervised learning
d) Reinforcement learning
View Answer
Answer: c
Explanation: In unsupervised learning no teacher is available hence it is also called
unsupervised learning.

Artificial Intelligence Questions and Answers – Learning – 3

This set of Artificial Intelligence online test focuses on “Learning – 3”.
1. Which is not a desirable property of a logical rule-based system?
a) Locality
b) Attachment
c) Detachment
d) Truth-Functionality
View Answer
Answer: b
Explanation: Locality: In logical systems, whenever we have a rule of the form A
=> B, we can conclude B, given evidence A, without worrying about any other
rules. Detachment: Once a logical proof is found for a proposition B, the
proposition can be used regardless of how it was derived .That is, it can be
detachment from its justification. Truth-functionality: In logic, the truth of
complex sentences can be computed from the truth of the components. However,
there are no Attachment properties lies in a Rule-based system. Global attribute
defines a particular problem space as user specific and changes according to user’s
plan to problem.
2. How is Fuzzy Logic different from conventional control methods?
a) IF and THEN Approach
b) FOR Approach
c) WHILE Approach
d) DO Approach
View Answer
Answer: a
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.
3. In an Unsupervised learning
a) Specific output values are given
b) Specific output values are not given
c) No specific Inputs are given
d) Both inputs and outputs are given
View Answer
Answer: b
Explanation: The problem of unsupervised learning involves learning patterns in
the input when no specific output values are supplied. We cannot expect the
specific output to test your result. Here the agent does not know what to do, as he
is not aware of the fact what propose system will come out. We can say an
ambiguous un-proposed situation.
4. Inductive learning involves finding a
a) Consistent Hypothesis
b) Inconsistent Hypothesis
c) Regular Hypothesis
d) Irregular Hypothesis
View Answer
Answer: a
Explanation: Inductive learning involves finding a consistent hypothesis that
agrees with examples. The difficulty of the task depends on the chosen
representation.
5. Computational learning theory analyzes the sample complexity and
computational complexity of
a) Unsupervised Learning
b) Inductive learning
c) Forced based learning
d) Weak learning
View Answer
Answer: b
Explanation: Computational learning theory analyzes the sample complexity and
computational complexity of inductive learning. There is a tradeoff between the
expressiveness of the hypothesis language and the ease of learning.
6. If a hypothesis says it should be positive, but in fact, it is negative, we call it
a) A consistent hypothesis
b) A false negative hypothesis
c) A false positive hypothesis
d) A specialized hypothesis
View Answer
Answer: c
Explanation: Consistent hypothesis go with examples, If the hypothesis says it
should be negative but infect 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.
7. Neural Networks are complex ______________with many parameters.
a) Linear Functions
b) Nonlinear Functions
c) Discrete Functions
d) Exponential Functions
View Answer
Answer: b
Explanation: Neural networks parameters can be learned from noisy data and they
have been used for thousands of applications, so it varies from problem to problem
and thus use nonlinear functions.
advertisement
8. A perceptron is a ______________
a) Feed-forward neural network
b) Backpropagation algorithm
c) Backtracking algorithm
d) Feed Forward-backward algorithm
View Answer
Answer: a
Explanation: A perceptron is a Feed-forward neural network with no hidden units
that can be representing only linear separable functions. If the data are linearly
separable, a simple weight updated rule can be used to fit the data exactly.
9. Which of the following statement is true?
a) Not all formal languages are context-free
b) All formal languages are Context free
c) All formal languages are like natural language
d) Natural languages are context-oriented free
View Answer
Answer: a
Explanation: Not all formal languages are context-free.
10. Which of the following statement is not true?
a) The union and concatenation of two context-free languages is context-free
b) The reverse of a context-free language is context-free, but the complement need
not be
c) Every regular language is context-free because it can be described by a regular
grammar
d) The intersection two context-free languages is context-free
View Answer
Answer: d
Explanation: The union and concatenation of two context-free languages is
context-free; but intersection need not be.