Course Code: CST 401
Course Name: Artificial Intelligence
Assignment 2
QUESTION QUESTION MA CO
NUMBER RKS
Define node consistency with an example.
1. Definition-1.5 Marks 3 3
Example-1.5 Marks
Define the term least constraining value in CSP.
2. Definition-1.5 Marks 3 3
Example-1.5 Marks
Write an Arc-Consistency algorithm (AC-3).
3. Algorithm in detail-1.5 Marks 3 3
Example-1.5 Marks
Find a most general unifier for the set W = {P(a, x, f (g(y))), P(z, f
(z), f (u))}
4 3 3
For the following pair of atomic sentences, give the
most general unifier, if it exists:
Knows (Father(y), y), Knows (John, x)
Ans: Knows(father(y), y); Knows(John, x)
Substitute x/y
4. 3 4
Knows(father(x), x); Knows(John, x)
Substitute John/father(x)
Knows(John, x); Knows(John, x)
Hence unified-3 Marks
Prove, or find a counter example to, the following 4
assertion: If α |= γ or β |= γ (or both) then (α ∧β) |= γ
5 3
Steps-1.5 Marks
Proof-1.5 Marks
What are the components of a Constraint Satisfaction 4
Problem? Illustrate with an example.
6 Definition-2 Marks 3
Example-1 Mark
Give the definition of Propositional logic. 4
7 Definition-1.5 Marks 3
Example-1.5 Marks
Describe the various forms of learning?
8 3 5
Any 3 with explanation -1 Marks Each
State and explain Ockham’s razor principle
9 Stating-1.5 Marks 3 5
Explain-1.5 Marks
Define overfitting in learning
10 Stating-1.5 Marks 3 5
Explain-1.5 Marks
11 Solve the following Crypt arithmetic problem using 10 3
constraints satisfaction search procedure.
EAT
T HAT
----------
APPLE
Solution-3 Marks
Steps-3
Ways by solving-1 Mark
What is local consistency in CSP constraint
propagation? Explain different types of local
consistencies.
12 local consistency Definition-5 Marks 10 3
Types-5 Marks
Explain backtracking search in CSPs using the example
of 4-queens problem.
13 Backtracking search Defintion-2 Marks 10 3
Example explanation-7 Marks
What is a knowledge-based agent? How does it work?
Write an algorithm for Knowledge based agent.
14 7 3
Knowledge-based agent-2.5 Marks
Working-1 Mark
Algorithm-3.5 Marks
Illustrate the use of First Order Logic to represent
Knowledge.
15 7 4
First Order Logic definition-3.5 Marks
Example-3.5 Marks
Differentiate Forward Chaining and Backward Chaining
with their algorithms.
16 8 4
Forward Chaining Algorithm-4 Marks
Backward Chaining Algorithm-4 Marks
Illustrate the steps for converting First order logic (FOL)
to Conjunctive Normal Form (CNF) with sentence-
17 “Ravi likes all kind of food.” 8 4
Steps-4 Marks
Explanation-4 Marks
Convert the following sentences into first order logic,
FOL and corresponding Conjunctive Normal Form,
CNF:
a. John likes all kind of food.
b. Apple and vegetable are food
c. Anything anyone eats and not killed is food.
18 d. Anil eats peanuts and still alive 8 4
e. Harry eats everything that Anil eats
From a to d-1.5 Marks each
e-2 Marks
19 Consider the following sentence: 10 4
[(Food ⇒ Party) ∨ (Drinks ⇒ Party)] ⇒ [(Food ∧
Drinks) ⇒ Party].
Convert this to CNF
Steps-5 Marks
Explanation with diagram-5 Marks
Suppose my knowledge base consists of the facts
S ∧ T ⇒ ¬ (¬ P ∧ R), ¬¬S, T
And need to prove P is entailed. Use rules of inference
13 to do this. 5 4
Steps-2.5 Marks
Explanation-2.5 Marks
Explain decision tree learning algorithm.What is
entropy? What is its significance in the decision tree
20 learning? 10 5
Algorithm-5 Marks
Significance-5 Marks
What do you meant by Linear classification with logistic
regression? Explain.
21 6 5
Linear Classification -3 Marks
Logistic Regression-3 Marks
Differentiate between classification and regression. Give
three different scenarios each, where these can be used.
22 7 5
Classification-3.5 Marks
Regression-3.4 Marks
How do we evaluate and choose the best hypotheses that
fits the future data? Explain with a suitable method.
Evaluation-5 Marks
23 10 5
Explanation-5 Marks
