B.

Tech - Odd Sem: Semester in Exam-I

Academic Year: 2020-2021
19CS2212 - Artificial Intelligence

Key and scheme of evaluation

1. List out any three differences between Natural Intelligence and Artificial Intelligence. 4.5M

Artificial Intelligence (AI) is the designing of Intelligent or smart system which has the ability to
perform accurate learning, reasoning and perception of the surrounding actions to produce
maximum success whereas 

Natural Intelligence or we can say Human Intelligence is the quality of the mind which has the
ability to learn from past experience or situations we are currently facing to provide several kinds
of information through that gained knowledge.

Some of the differences between Artificial and Natural Intelligence are:

 Artificial Intelligence machines are designed to perform few specific tasks while
consuming some energy whereas in Natural Intelligence, human can learn hundred of
different skills during life.
 The time needed to teach each and every system is considerably high as compared to
human who can work on multiple responsibilities at the same time.
 Machines use Humans use built-in instructions whereas humans use content memory
and thinking process.
 AI is basically a computer system or machine whereas Human brain is Analogue.

(OR)
2. Define PEAS for an automated taxi. 4.5M

3. Discuss the logic of Bidirectional Search Algorithm and analyze the merits and demerits
of the algorithm. 8M

Logic: 2M
 • Bidirectional search algorithm runs two simultaneous searches, one form initial state
called as forward-search and other from goal node called as backward-search, to
find the goal node.
• Bidirectional search replaces one single search graph with two small sub-graphs in
which one starts the search from an initial vertex and other starts from goal vertex.
The search stops when these two graphs intersect each other.
• Bidirectional search can use search techniques such as BFS, DFS, DLS, etc.

Example: 2M

Forward path: 1->4->8->9

Backward path: 16->12->10->9
Final answer: 1->4->8->9->10->12->16

Merits: 2M
• Bidirectional search is fast.
• Bidirectional search requires less memory
Demerits: 2M

 Implementation of the bidirectional search tree is difficult.

 In bidirectional search, one should know the goal state in advance.
(OR)
4. State the Breadth First Search Algorithm and illustrate it with suitable example. 8M

Algorithm: 5M
 Example: 3M

Final Path: S---> A--->B---->C--->D---->G--->H--->E---->F----> I---->K

5. Discuss the logic of Depth Limited Search Algorithm. Justify that Iterative Deepening
Depth First Search Algorithm is an extension of Depth Limited Search. 12.5M

Depth Limited Search: 6 M

• A depth-limited search algorithm is similar to depth-first search with a
predetermined limit.
• Depth-limited search can solve the drawback of the infinite path in the Depth-first
search.
• In this algorithm, the node at the depth limit will treat as it has no successor nodes
further.
• Sometimes Depth limit can be set based on knowledge of the problem

Example:

Depth Limit=2
Goal state: J
Final path: S->A->C->D->B->I->J

Iterative Deepening Depth Limited Search: 6.5M

 • Iterative deepening search (or iterative deepening depth-first search) is a general
strategy, often used in combination with depth-first tree search that finds the best
depth limit.
• This search algorithm finds out the best depth limit and does it by gradually
increasing the limit until a goal is found.
• In general, iterative deepening is the preferred uninformed search method when the
search space is large and the depth of the solution is not known.
Example:

• 1'st Iteration-----> A
• 2'nd Iteration----> A, B, C
• 3'rd Iteration------>A, B, D, E, C, F, G
• In third iteration the algorithm will find the gold node i.e., G.

As IDDFS starts with depth limit as level 0 and gradually increased limit by one until
goal node is found. Hence we can say that IDDFS is an extension of Depth Limited
Search.

(OR)

6. List the production rules of water jug problem. Illustrate how you solve the water jug
problem with the help of production rules. 12.5M

Production rules: 6M
 Example: 6.5M

Two water jugs with 4 and 3 gallon capacities are given. x represents the number of
gallons of water in the 4-gallon jug. y represents the quantity of water in 3-gallon jug.
• The start state is (0,0).
• The goal state is (2,y).

7. Illustrate the concept of local beam search algorithm. 4.5M

• In this algorithm, it holds k number of states at any given time.

• At the start, these states are generated randomly.
• The successors of these k states are computed with the help of objective function.
• If any of these successors is the maximum value of the objective function, then the
algorithm stops.
• Otherwise the (initial k states and k number of successors of the states = 2k) states
are placed in a pool.
• The pool is then sorted numerically.
• The highest k states are selected as new initial states.
• This process continues until a maximum value is reached.

(OR)
8. Illustrate how Backtracking Search is useful in solving a Constraint Satisfaction
Problem? 4.5M

Explantion: 2M
• The term backtracking search is used for a depth-first search that chooses values for
one variable at a time and backtracks when a variable has no legal values left to
assign.
• It repeatedly chooses an unassigned variable, and then tries all values in the domain
of that variable in turn, trying to find a solution.
• If an inconsistency is detected, then BACKTRACK returns failure, causing the
previous call to try another value
• Only need to consider assignments to a single variable at each node
• Depth-first search for CSPs with single-variable assignments is called backtracking
search

Example: 2.5M

Part of map coloring example:

9. Demonstrate how the blocks world problem given below can be solved using Steepest Ascent Hill
Climbing algorithm. 8M

Heuristic function:
 (OR)

10. Define Constraint Satisfaction Problem. Justify that “Map Coloring problem is an example of
Constraint Satisfaction Problem”. 8M

• CSP: 4M

A constraint satisfaction problem consists of three components X, D, and C:

 – X is a set of variables, {Xi, ., Xn,}.

– D is a set of domains, {Di, , 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,v2,…vn} for variable X.

Each constraint Ci consists of a pair scope rely, where scope is a tuple of variables that
participate in the constraint. And is a relation that defines the values that those variables can take
on.

Map Coloring Example: 4M

Description of Map Coloring As CSP:

• Variables WA, NT, Q, NSW, V, SA, T

• Domains Di = {red,green,blue}

• Constraints: adjacent regions must have different colors

e.g., WA ≠ NT, or (WA,NT) in {(red,green),(red,blue),(green,red), (green,blue),
(blue,red),(blue,green)}.

Hence Map coloring is an example of CSP.

11. Define the terminology used in Genetic Algorithms. Illustrate Genetic algorithm with an
Example. 12.5M

Basic Terminology: 6.5M

• Population − It is a subset of all the possible (encoded) solutions to the given problem.
The population for a GA is analogous to the population for human beings except that
instead of human beings, we have Candidate Solutions representing human beings.

• Chromosomes − A chromosome is one such solution to the given problem.

• Gene − A gene is one element position of a chromosome.

 • Allele − It is the value a gene takes for a particular chromosome
• Genotype − Genotype is the population in the computation space. In the computation
space, the solutions are represented in a way which can be easily understood and
manipulated using a computing system.
• Phenotype − Phenotype is the population in the actual real world solution space in which
solutions are represented in a way they are represented in real world situations.
• Decoding and Encoding − for simple problems, the phenotype and genotype spaces are
the same. However, in most of the cases, the phenotype and genotype spaces are
different. Decoding is a process of transforming a solution from the genotype to the
phenotype space, while encoding is a process of transforming from the phenotype to
genotype space. Decoding should be fast as it is carried out repeatedly in a GA during the
fitness value calculation.

Example: 6M

The Traveling Salesman Problem: Find a tour of a given set of cities so that each city is
visited only once and the total distance traveled is minimized.

Explanation about Mutation and Crossover operators with examples required.

12. Consider the following game tree in which the static scores (at the tip nodes) are all from the
first player’s point of view. Assume that the first player is the maximizing player (i.e. MAX),
and that high numbers represent better scores for MAX.

12. A. Use Mini-max algorithm to determine which move the first player should choose. 6M

Step by step explanation of this solution is required.

12. B. Examine the nodes that are to be pruned using the alpha-beta pruning algorithm assuming
that nodes are examined in left-to right order? 6.5M

Step by step representation of solution is required.