CAT 2 - ARTIFICIAL INTELLIGENCE

1 MARKS
1. ___________ 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

2. 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

3. What are the 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

4. 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

5. _______________ 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

6. 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

7. 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
8. Which rule is equal to the resolution rule of first-order clauses?
(a) Propositional resolution rule
(b) Inference rule
(c) Resolution rule
(d) None of the mentioned

9. Which of the following statements is correct regarding Conjunction Normal Form?

(a) It is a conjunction of disjunction clauses
(b) It is a disjunction of conjunction clauses
(c) Empty clause indicates true
(d) Empty clause indicates false

10. Which of the following is an equivalent CNF form of the formula (p -> q) -> (p -> r)?
(a) (p ^ ¬q) V (¬p V r)
(b) (¬p V q) ^ (¬p V r)
(c) (¬q V ¬p V r)
(d) r ^ (¬q V ¬p V r)

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
(c) Local Search Techniques
(d) Informed & Uninformed Search Techniques

2. 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

3. What are the 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

4. ___________ Algorithm keeps track of k states rather than just one.

(a) Hill-Climbing search
(b) Techniques Local Beam search
(c) Stochastic hill-climbing search
(d) Random restart hill-climbing search
5. _______________ 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

6. 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

7. 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

8. Which rule is equal to the resolution rule of first-order clauses?

(a) Propositional resolution rule
(b) Inference rule
(c) Resolution rule
(d) None of the mentioned

9. Which of the following statements is correct regarding Conjunction Normal Form?

(a) It is a conjunction of disjunction clauses
(b) It is a disjunction of conjunction clauses
(c) Empty clause indicates true
(d) Empty clause indicates false

10. Which of the following is an equivalent CNF form of the formula (p -> q) -> (p -> r)?
(a) (p ^ ¬q) V (¬p V r)
(b) (¬p V q) ^ (¬p V r)
(c) (¬q V ¬p V r)
(d) r ^ (¬q V ¬p V r)
 2 MARKS

11. What is heuristic search strategy?

 Heuristic search is a problem-solving approach that uses heuristic functions to guide the search for a solution.
 It involves evaluating the potential of each solution based on some rule of thumb or intuition, rather than a formal
algorithm.
 This allows the search to proceed more efficiently than a brute-force search by focusing on the most promising
solutions in the search space.
 Common heuristic search algorithms include A* search, hill-climbing search and beam search.

12. Define ridges.

 A ridge is a special form of the local maximum. It has an area which is higher than its surrounding areas, but itself has a
slope and cannot be reached in a single move.
 Solution : With the use of bidirectional search (or) by moving in different directions, we can improve this problem.

13. List the two levels of knowledge representation.

Two levels of knowledge representation :
1. Symbolic representation - Refers to the representation of knowledge in the form of symbols, rules, and logic. This
approach is used for representing high-level and abstract concepts.
2. Sub-symbolic representation - Refers to the representation of knowledge in the form of numerical or statistical values.
This approach is used to represent low-level and concrete concepts.

14. Compare and contrast propositional and predicate logic.

Propositional Logic Predicate Logic

 Propositional logic is the logic that deals with a
collection of declarative statements which have a
truth value, true or false.
 It is the basic and most widely used logic. Also
known as Boolean logic.
 A proposition has a specific truth value, either
true or false.
 Scope analysis is not done in propositional logic.
 Predicate logic is an expression consisting of
variables with a specified domain. It consists of
objects, relations and functions between the
objects.
 It is an extension of propositional logic covering
predicates and quantification.
 A predicate’s truth value depends on the variables’
value.
 Predicate logic helps analyze the scope of the
subject over the predicate. There are three
quantifiers : Universal Quantifier, Existential
Quantifier and Uniqueness Quantifier.
  Propositions are combined with Logical
Operators or Logical Connectives like
Negation(¬), Disjunction(∨), Conjunction(∧),
etc..
 It is a more generalized representation.
 Predicate Logic adds by introducing quantifiers to
the existing proposition.
 It is a more specialized representation.

15. Convert the given sentence into First order predicates “Not all students like both Mathematics and Science”.
 Here, the predicate is "like(x, y)" where x = student, and y = subject.
 Since there are not all students, so we will use ∀ with negation, so following representation for this:
¬∀ (x) [ student(x) → like(x, Mathematics) ∧ like(x, Science)].

11. What are the steps comes under the GA?

 The steps involved in Genetic Algorithm (GA) are :
1. Initialization
2. Evaluation
3. Selection
4. Crossover
5. Mutation
6. Replacement
7. Termination
 These steps are iterated until a satisfactory solution to the problem is found or the algorithm reaches a stopping
criterion.

12. What is heuristic search strategy?

 Heuristic search is a problem-solving approach that uses heuristic functions to guide the search for a solution.
 It involves evaluating the potential of each solution based on some rule of thumb or intuition, rather than a formal
algorithm.
 This allows the search to proceed more efficiently than a brute-force search by focusing on the most promising
solutions in the search space.
 Common heuristic search algorithms include A* search, hill-climbing search and beam search.

13. Convert the following into Horn clauses.

∀x:∀y:cat(x) v fish(y) -> likes-to-eat(x, y)
¬cat(x) v ¬fish(y) v likes-to-eat(x, y)

14. Define forward and backward chaining. Differentiate them.

Forward Chaining Backward Chaining

 Forward chaining starts from known facts and  Backward chaining starts from the goal and
applies inference rule to extract more data unit it works backward through inference rules to find
reaches to the goal. the required facts that support the goal.
  Forward chaining is known as data-driven
technique because we reaches to the goal using
the available data.
 It is a bottom-up approach.
 It applies the Breadth-First Strategy.
 Its goal is to get the conclusion.
 Slow as it has to use all the rules.
 Backward chaining is known as goal-driven
technique because we start from the goal and
reaches the initial state in order to extract the
facts.
 It is a top-down approach.
 It applies the Depth-First Strategy.
 Its goal is to get the possible facts or the required
data.
 Fast as it has to use only a few rules.

15. Convert the given sentence into First order predicates “Not all students like both Mathematics and Science”
 Here, the predicate is "like(x, y)" where x = student, and y = subject.
 Since there are not all students, so we will use ∀ with negation, so following representation for this:
¬∀ (x) [ student(x) → like(x, Mathematics) ∧ like(x, Science)]
 15 MARKS

16. (b) (i) How to minimize total estimated cost using A* search with an example.
(ii) Write the proof of optimality of A*.

17. (a) (i) Consider the following statements:

Marcus was a man
Marcus was a Pompeian
All Pompeians were Romans
Caesar was a ruler
All Romans were either loyal to Caesar or hated him
Everyone is loyal to someone
People only try to assassinate rulers they are not loyalto
Marcus tried to assassinate Caesar.
All men were people.
Apply the process of simple fact to prove that “Marcus hate Caesar” Write the algorithm
for resolution using predicate logic.
17. (a) (i) Consider the following statements:
1.Ravi likes all kinds of food
2.Apples are food
3.Prawn is food
4.Anything anyone eats and isn’t killed by is food
5.Ram eats peanuts and is still alive.
6.Suji eats everything Ram eats
Apply the process of simple fact to prove that “Ravi
like Peanuts” Write the algorithm for resolution using
predicate logic.