Reg.

No

Dr. N.G.P. Institute of Technology, Coimbatore – 641048

(An Autonomous Institution)
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai
Recognized by UGC & Accredited by NAAC with A+ Grade and
NBA (BME, CSE, ECE, EEE and Mechanical)

DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

B
22UAD301 – ARTIFICIAL INTELLIGENCE TECHNIQUES AND ALGORITHMS

INTERNAL TEST – I

Semester & Year: III & II Total Marks : 60 Marks

Date & Session: 06.12.2023 & AN Time Duration : 2 Hours

ANSWER ALL THE QUESTIONS

PART- A (10 x 2 marks = 20 marks)
1. Define Artificial Intelligence. CO1/K1

2. Compare agent function and agent program. CO1/K2

The agent function is an abstract mathematical description; the agent program is a
concrete implementation, running within some physical system. The agent function for
an artificial agent will be implemented by an agent program. An agent’s behavior is
described by the agent function that maps any given percept sequence to an action.
3. Define multiagent with an example. CO1/K1
If multiple agents are operating in an environment, then such an environment is called a
multi-agent environment. An agent playing chess is in a two agent environment.
4. Why problem formulation must follow goal formulation? CO1/K1
Goal formulation, based on the current situation and the agent’s performance measure, is
the first step in problem solving. Problem formulation is the process of deciding what
actions and states to consider, given a goal.So problem formulation must follow goal
formulation.
5. List out the various components of a problem. CO2/K1
States, Initial State, Actions, transition Model, Goal test, Path Cost
6. Differentiate complete assignment and partial assignment in CSP. CO2/K1
complete assignment partial assignment
A complete assignment is one in which every
A partial assignment is one that assigns
variable is assigned, and T a solution to a
values to only some of the variables.
CSP is a consistent, complete assignment
 Reg.No

Dr. N.G.P. Institute of Technology, Coimbatore – 641048

(An Autonomous Institution)
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai
Recognized by UGC & Accredited by NAAC with A+ Grade and
NBA (BME, CSE, ECE, EEE and Mechanical)

It uses knowledge for the searching It doesn’t use knowledge for the
process. searching process.
It finds solution slow as compared to an
It finds a solution more quickly.
informed search.
 Greedy Search
 Depth First Search (DFS)
 A* Search
 Breadth First Search (BFS)
 AO* Search
 Branch and Bound
 Hill Climbing Algorithm
7. Write the pseudocode for calculating MAX value in minimax decision. CO2/K1
A problem is solved when each variable has a value that satisfies all the constraints on
the variable.
A constraint satisfaction problem consists of three components, X, D, and C:
X is a set of variables, {X1,...,Xn}.
D is a set of domains, {D1,...,Dn}, one for each variable.
C is a set of constraints that specify allowable combinations of values.
Each domain Di consists of a set of allowable values, {v1,...,vk} for variable Xi. Each
constraint Ci consists of a pair (scope, rel), where scope is a tuple of variables that
participate in the constraint and rel is a relation that defines the values that those
variables can take on
8. State the usage of alpha-beta pruning. CO2/K1
Local maxima: a local maximum is a peak that is higher than each of its neighboring
states but lower than the global maximum. Hill-climbing algorithms that reach the
vicinity of a local maximum will be drawn upward toward the peak but will then be
stuck with nowhere else to go
Ridges: Ridges result in a sequence of local maxima that is very difficult for greedy
algorithms to navigate.
Plateau: a plateau is a flat area of the state-space landscape. It can be a flat local
SHOULDER maximum, from which no uphill exit exists, or a shoulder, from which
progress is possible. A hill-climbing search might get lost on the plateau.
9. What is knowledge base? CO3/K1
For any sentences α and β, α |= β if and only if the sentence (α ⇒ β) is valid
the deduction theorem states that every valid implication sentence describes a legitimate
inference.
10 List out the connectives used in propositional logic. CO3/K1
. A BNF grammar for simple arithmetic expressions:
Expr → Expr Operator Expr | ( Expr ) | Number
AtomicSentence → True | False | P | Q | R | ...

PART – B (2 x 16 marks = 32 marks)

11.a) Explain about task environment and its properties with examples. CO1/K2
The task environments can be:
 Fully observable / Partially observable
 Single agent / Multiple agents
 Deterministic / Non-deterministic
 Episodic / Non-episodic
 Static / Dynamic
 Discrete / Continuous
 Known / Unknown
 Reg.No

Dr. N.G.P. Institute of Technology, Coimbatore – 641048

(An Autonomous Institution)
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai
Recognized by UGC & Accredited by NAAC with A+ Grade and
NBA (BME, CSE, ECE, EEE and Mechanical)

(Or)
11.b) Consider the water jug problem: You are given 2 jugs, a 4-galloon jug & CO1/K2
3-gallon jug. Neither has any measuring mark on it. There is a pump that
can be used to fill the jugs with water. How can you get 2-galloons of
water from the 4-galloon jug? Explicit Assumptions: A jug can be filled
from the pump, water can be poured out of a jug onto the ground. Water
can be poured from 1 jug to another and that there are no other
measuring devices available. Explain the operator involved in it.
 Reg.No

Dr. N.G.P. Institute of Technology, Coimbatore – 641048

(An Autonomous Institution)
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai
Recognized by UGC & Accredited by NAAC with A+ Grade and
NBA (BME, CSE, ECE, EEE and Mechanical)

12.a) Explain in detail about informed search strategies. CO2/K2

Informed search strategies are
 Greedy Best First Search

 A* search

 Place the starting node in the OPEN list.

 Check if the OPEN list is empty or not, if the list is empty then return failure
and stops.

 Select the node from the OPEN list which has the smallest value of
evaluation function (g+h), if node n is goal node then return success and stop,
otherwise

 Expand node n and generate all of its successors, and put n into the closed
list. For each successor n', check whether n' is already in the OPEN or CLOSED list,
if not then compute evaluation function for n' and place into Open list.

 Else if node n' is already in OPEN and CLOSED, then it should be attached to
the back pointer which reflects the lowest g(n') value.
 Reg.No

Dr. N.G.P. Institute of Technology, Coimbatore – 641048

(An Autonomous Institution)
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai
Recognized by UGC & Accredited by NAAC with A+ Grade and
NBA (BME, CSE, ECE, EEE and Mechanical)

 Return to Step 2.
 Memory bounded heuristic search

(Or)
12.b) i) Explain the solution of map-coloring problem for Australian states & CO2/K2
Territories with 3 colors.

X = {WA, NT, Q, NSW , V, SA, T} .

The domain of each variable is the set Di = {red, green, blue}. The constraints require
neighboring regions to have distinct colors. Since there are nine places where regions border,
there are nine constraints:

{WA = red, NT = green, Q = red, NSW = green, V = red, SA = blue, T = red }.

12.b)ii) Solve the cryptarithmetic problem: TWO+TWO=FOUR CO2/K3_
 Reg.No

Dr. N.G.P. Institute of Technology, Coimbatore – 641048

(An Autonomous Institution)
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai
Recognized by UGC & Accredited by NAAC with A+ Grade and
NBA (BME, CSE, ECE, EEE and Mechanical)

PART – C (1 x 8 marks = 8 marks)

13.a) Discuss on semantics of Propositional Logic and Logical equivalences. CO3/K2

(Or)
13.b) Illustrate resolution algorithm for propositional logic. CO3/K2
 Reg.No

Dr. N.G.P. Institute of Technology, Coimbatore – 641048

(An Autonomous Institution)
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai
Recognized by UGC & Accredited by NAAC with A+ Grade and
NBA (BME, CSE, ECE, EEE and Mechanical)

Compare AI with human intelligence and traditional information processing and

CO1:
discuss its strengths and limitations.
CO2: Analyze the various search strategies in the problems.
Recognize the knowledge representation and learning methods of Artificial
CO3:
Intelligence.

Prepared by Verified by Approved by

(Ms.G.Brindha) (Ms.G.Brindha) (Dr.R.Karthikeyan)

Faculty In-charge Course Coordinator Head of the Department