NPTEL Online Certification Course
Fundamentals of Artificial Intelligence
Assignment Number 09: Detailed Solution
Indian Institute of Technology Guwahati
Each question carries 01 Mark each. There are MORE than ONE correct options for some of
the Questions. All correct options must be identified for the answer to be evaluated as correct.
Q1. Sequential decision problems, which include utilities, uncertainty, and sensing, generalize the search
and planning problems. Transition model refers to the following:
A. set of probabilities associated with the possible transitions between states after any given action.
B. a complete mapping from states to actions.
C. function be specified for the agent in order to determine the value of an action.
D. specification of the outcome probabilities for each action in each possible state.
Q2. The fundamental idea of __________ is that an agent is rational if and only if it chooses the action
that yields the highest expected utility, averaged over all possible outcomes of the action.
A. Decision theory
B. Probability theory
C. Utility theory
D. Markov Decision Process
Q3. _______ provides ways and means of weighing up the desirability of goals and the likelihood of
achieving them.
A. Decision Theory
B. Utility Theory
C. Probability Theory
D. Bayesian Networks
NPTEL Online Certification Course
Fundamentals of Artificial Intelligence
Assignment Number 09: Detailed Solution
Indian Institute of Technology Guwahati
Q4. STRIPS is an alternative representation to the pure situation calculus for planning.
I. Hierarchical Plans cannot be expressed in STRIPS.
II. STRIPS operators are essentially propositional.
III. Real world projects need a better model of time than that in STRIPS.
Which of the above statements are correct?
A. Only Statements I and II
B. Statements I, II and III
C. Only Statements II and III
D. None.
Q5. ________________ provide a general, concise representation for large POMDP, so they can be used
as inputs for any POMDP algorithm including value and policy iteration methods.
A. Bayesian Networks
B. Decision Networks
C. Dynamic Decision Networks
D. Dynamic Belief Networks
Q6. Value Iteration is an algorithm for computing an optimal policy. The basic idea includes
A. Computing the utility of each state.
B. Use state utilities to select an optimal action in each state.
C. Calculate a new Maximum Expected Utility policy based on computed utilities.
D. Start with a random policy and calculate utilities based on if that policy were executed.
NPTEL Online Certification Course
Fundamentals of Artificial Intelligence
Assignment Number 09: Detailed Solution
Indian Institute of Technology Guwahati
Q7. Policy Iteration is an alternate algorithm for computing an optimal policy. The basic idea includes
A. Computing the utility of each state.
B. Use state utilities to select an optimal action in each state.
C. Calculate a new Maximum Expected Utility policy based on computed utilities.
D. Start with a random policy and calculate utilities based on if that policy were executed.
Q8. Assertion A : In real-world domains, agents have to deal with both incomplete and incorrect
information.
Reason R : Incompleteness arises because the world does not necessarily match the agent's
model of it.
A. Both A and R are true and R is the correct explanation for A
B. Both A and R are true but R is not the correct explanation for A
C. A is True but R is False
D. A is false but R is True
Q9. Assertion A : In complex real-world projects, it is common to use scheduling tools from
Operations Research.
Reason R : Scheduling tools essentially take a hand constructed complete partial-order plan
and generate an optimal schedule for it.
A. Both A and R are true and R is the correct explanation for A
B. Both A and R are true but R is not the correct explanation for A
C. A is True but R is False
D. A is False but R is True
NPTEL Online Certification Course
Fundamentals of Artificial Intelligence
Assignment Number 09: Detailed Solution
Indian Institute of Technology Guwahati
Q10. Assertion A : The sensor model in a belief network is the Conditional Probability Table (CPT)
associated with the percept node.
Reason R : If the sensor gives a perfect report of the state, then the sensor model (the CPT)
will be purely deterministic.
A. Both A and R are true and R is the correct explanation for A
B. Both A and R are true but R is not the correct explanation for A
C. A is True but R is False
D. A is false but R is True
