1.Consider you have a 3X3 board, where all numbers are in range 0 to 8.

The board has no repeating numbers

and an empty space. Implement a program to find the minimum number of steps required to arrange the board
in sequence using 8 puzzle problem.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

2.Implement forward chaining and resolution strategies.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

 3.Implement a cryptarithmetic puzzle to find digits that replace letters to make mathematical statements true.
Consider the puzzle SEND + MORE = MONEY.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total
required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

4.Write a python program to solve tic – tac – toe problem using MINI-MAX algorithm. Find the next optical
move for a player.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

 5.Using heuristic methods write A* search algorithm to achieve optimality and completeness in graph
traversals.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

6.Identify the constraints to find a word in crossword puzzle. Implement a crossword puzzle problem using
Constraint Satisfaction Problem.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total
required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

 7.Import necessary libraries, load required training and test data, and write a program for text classification
using Naive Bayes model.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

8.Consider you have 4 queens, try to arrange them in chess board using python program where no queen
attack each other.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

 9.Implement a python program to solve 8 queens problem using basic search strategies.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

10.Implement a program to discover a better path to a previously expanded node using memory bounded A*
algorithm.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

 11.Implement alpha beta pruning search.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

12.Write a backtracking search algorithm to implement Constraint Satisfaction Problem.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

Page 2 of
20
13.Consider a map is given, color the map with different shades, so that no color is repeated. Implement
Constraint Satisfaction Problem for map coloring problem.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

14.Write a problem to solve Wumpus world problem as a part of propositional model checking algorithms.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total
required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

Page 3 of
20
15.Define a game. Write the MINI-MAX algorithm to determine the optimal strategy for MAX to decide the best
first move.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

16.Implement Bayesian networks and perform inferences.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total
required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

Page 4 of
20
17.Develop a program to place N chess queens on a NXN chessboard so that no queens attack each other.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

18.Implement backward chaining and resolution strategies.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

Page 5 of
20
19.BASE + BALL = GAMES is a cryptarithmetic puzzle. Implement a python program to make this statement
true.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

20.Develop a program to solve 8 puzzle problem, where all numbers are in range 0 to 8. 0 and 4 are swapped in
the 3X3 board, now solve the number of steps required to arrange the sequence in order.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total
required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

Page 6 of
20
 1.Consider you have a 3X3 board, where all numbers are in range 0 to 8. The board has no repeating numbers
and an empty space. Implement a program to find the minimum number of steps required to arrange the board
in sequence using 8 puzzle problem.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

2.Implement forward chaining and resolution strategies.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

Page 7 of
20
 3.Implement a cryptarithmetic puzzle to find digits that replace letters to make mathematical statements true.
Consider the puzzle SEND + MORE = MONEY.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total
required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

4.Write a python program to solve tic – tac – toe problem using MINI-MAX algorithm. Find the next optical
move for a player.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

Page 8 of
20
 5.Using heuristic methods write A* search algorithm to achieve optimality and completeness in graph
traversals.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

6.Identify the constraints to find a word in crossword puzzle. Implement a crossword puzzle problem using
Constraint Satisfaction Problem.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total
required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

Page 9 of
20
 7.Import necessary libraries, load required training and test data, and write a program for text classification
using Naive Bayes model.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

8.Consider you have 4 queens, try to arrange them in chess board using python program where no queen
attack each other.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

Page 10 of
20
 9.Implement a python program to solve 8 queens problem using basic search strategies.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

10.Implement a program to discover a better path to a previously expanded node using memory bounded A*
algorithm.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

Page 11 of
20
 11.Implement alpha beta pruning search.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

12.Write a backtracking search algorithm to implement Constraint Satisfaction Problem.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total
required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

Page 12 of
20
13.Consider a map is given, color the map with different shades, so that no color is repeated. Implement
Constraint Satisfaction Problem for map coloring problem.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

14.Write a problem to solve Wumpus world problem as a part of propositional model checking algorithms.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

Page 13 of
20
15.Define a game. Write the MINI-MAX algorithm to determine the optimal strategy for MAX to decide the best
first move.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

16.Implement Bayesian networks and perform inferences.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

Page 14 of
20
17.Develop a program to place N chess queens on a NXN chessboard so that no queens attack each other.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

18.Implement backward chaining and resolution strategies.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total
required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

Page 15 of
20
19.BASE + BALL = GAMES is a cryptarithmetic puzzle. Implement a python program to make this statement
true.

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total

required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

20.Develop a program to solve 8 puzzle problem, where all numbers are in range 0 to 8. 0 and 4 are swapped in
the 3X3 board, now solve the number of steps required to arrange the sequence in order.
Aim/Principle/Apparatus Tabulation/Circuit/ Calculation & Viva-Voce Record Total
required/Procedure Program/Drawing Results
20 30 30 10 10 100

Marks in words

Internal Examiner External Examiner

Page 16 of
20