Professional Documents
Culture Documents
Topic Wise MCQ of Artificial Intelligence (A.i)
Topic Wise MCQ of Artificial Intelligence (A.i)
I Topic: – Agents
This set of Artificial Intelligence MCQ focuses on “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
Answer is given below:
( Answer = a )
Explanation:An agent is anything that can be viewed as perceiving and acting upon the
environment through the sensors and actuators.
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) Both a & b
Answer is given below:
( Answer = c )
Explanation:An agent‟s percept sequence is the complete history of everything that the agent
has ever perceived.
3. How many types of agents are there in artificial intelligence?
a) 1
b) 2
c) 3
d) 4
Answer is given below:
( Answer = d )
Explanation:The four types of agents are Simple reflex, Model based, Goal based and Utility
based agents.
4. What is the rule of simple reflex agent?
a) Simple-action rule
b) Condition-action rule
c) Both a & b
d) None of the mentioned
Answer is given below:
( Answer = b )
Explanation:Simple reflex agent is based on the present condition and so it is condition action
rule.
5. What are the composition for agents in artificial intelligence?
a) Program
b) Architecture
c) Both a & b
d) None of the mentioned
Answer is given below:
( Answer = c )
Explanation:An agent program will implement function mapping percepts to actions.
6. In which agent does the problem generator is present?
a) Learning agent
b) Observing agent
c) Reflex agent
d) None of the mentioned
Answer is given below:
( Answer = a )
Explanation:Problem generator will give the suggestion to improve the output for learning agent.
7. Which is used to improve the agents performance?
a) Perceiving
b) Learning
c) Observing
d) None of the mentioned
Answer is given below:
( Answer = b )
Explanation:An agent can improve its performance by storing its pervious actions.
8. Which agent deals with happy and unhappy states?
a) Simple reflex agent
b) Model based agent
c) Learning agent
d) Utility based agent
Answer is given below:
( Answer = d )
Explanation:A utility function maps a state onto a real number which describes the associated
degree of happiness.
9. Which action sequences are used to acheive the agent‟s goal?
a) Search
b) Plan
c) Reterive
d) Both a & b
Answer is given below:
( Answer = d )
Explanation: When the environment becomes more tricky means, the agent needs plan and
search action sequence to achieve the goal.
10. Which element in agent are used for selecting external actions?
a) Perceive
b) Performance
c) Learning
d) Actuator
Answer is given below:
( Answer = b )
Explanation:None
This set of Artificial Intelligence MCQs focuses on “Constraints Satisfaction Problems – 1”.
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) Only a) and b)
Answer is given below:
( Answer = a )
Explanation: Refer definition of CSPs.
2. Which of the Following problems can be modeled as CSP?
a) 8-Puzzle problem
b) 8-Queen problem
c) Map coloring problem
d) Sudoku
Answer is given below:
( Answer = a ), b, c, d
Explanation: All of above problems involves constraints to be satisfied.
3. What among the following constitutes to the incremental formulation of CSP?
a) Path cost
b) Goal cost
c) Successor function
d) Objective function
e) Initial state
Answer is given below:
( Answer = a ), b, c, e
Explanation:
Initial state: The empty assignment ( ), in which all variables are unassigned.
Successor function: A value can be assigned to any unassigned variable, provided it does not
conflict with previously assigned variables.
Goal test: The current assignment is complete.
Path cost: A constant cost (e.g., 1) for every step.
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
Answer is given below:
( Answer = b )
Explanation: Refer definition of backtracking algorithm.
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
Answer is given below:
( Answer = a ), b
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.
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
Answer is given below:
( Answer = a )
Explanation: Intelligent backtracking
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
Answer is given below:
( Answer = c )
Explanation: Schedule developer needs to consider all constraints on teacher as well as
students.
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) DFS/BFS Search Algorithms
Answer is given below:
( Answer = a ), b, c, d
Explanation: Any Search techniques can be used
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
Answer is given below:
( Answer = b )
Explanation: None.
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 above
Answer is given below:
( Answer = b )
Explanation: Refer to the definition of Dynamic CSPs algorithm.