Scribd
Upload
16 views

AD3311-SET-1 question set

Artificial intelligence lab

Uploaded by

mail2murutech
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
16 views

AD3311-SET-1 question set

Artificial intelligence lab

Uploaded by

mail2murutech
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

BE / B.Tech.

PRACTICAL END SEMESTER EXAMINATIONS, NOVEMBER/DECEMBER 2024


Third Semester

AD3311 - ARTIFICIAL INTELLIGENCE LABORATORY

(Regulations 2021)

Time : 3 Hours Answer any one Question Max. Marks


100

Aim&Algorithm Program Output Viva-Voce Record Total


&
Results
20 30 30 10 10 100

Consider you have a 3X3 board, where all numbers are in range 0 to 8. The board
1. 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.

2. Implement forward chaining and resolution strategies.

Implement a cryptarithmetic puzzle to find digits that replace letters to make


3.
mathematical statements true. Consider the puzzle SEND + MORE = MONEY.

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

Using heuristic methods write A* search algorithm to achieve optimality and


5.
completeness in graph traversals.

Identify the constraints to find a word in crossword puzzle. Implement a crossword


6.
puzzle problem using Constraint Satisfaction Problem.

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

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


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

11 Implement alpha beta pruning search.


.

12 Write a backtracking search algorithm to implement Constraint Satisfaction


. Problem.

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

Write a problem to solve Wumpus world problem as a part of propositional


14
model checking algorithms.
.

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

16 Develop Naïve Bayes Model by using iris training dataset with gaussian Naïve
. bayes classifier.

Develop a program to place N chess queens on a NXN chessboard so that no


17
queens attack each other.
.

18 Implement backward chaining and resolution strategies.


.

BASE + BALL = GAMES is a cryptarithmetic puzzle. Implement a python program


19
to make this statement true.
.

Develop a program to solve 8 puzzle problem, where all numbers are in range 0
20 to 8. 0 and 4 are swapped in the 3X3 board, now solve the number of steps
. required to arrange the sequence in order.

INTERNAL EXAMINER EXTERNAL


EXAMINER

You might also like