Scribd
Upload
223 views2 pages

Ad3311 Set 1

The document provides instructions for an artificial intelligence lab exam involving 20 programming and problem solving questions. Students must choose 1 question and implement a program to solve a problem using an AI technique like search algorithms, constraint satisfaction problems, Bayesian networks, or cryptarithmetic puzzles. The exam is worth a total of 100 marks and will be evaluated based on various criteria like the required work, program/drawing, calculations, viva voce, and record keeping.

Uploaded by

Vjay Narain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
223 views2 pages

Ad3311 Set 1

The document provides instructions for an artificial intelligence lab exam involving 20 programming and problem solving questions. Students must choose 1 question and implement a program to solve a problem using an AI technique like search algorithms, constraint satisfaction problems, Bayesian networks, or cryptarithmetic puzzles. The exam is worth a total of 100 marks and will be evaluated based on various criteria like the required work, program/drawing, calculations, viva voce, and record keeping.

Uploaded by

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

B.E / B.Tech.

PRACTICAL END SEMESTER EXAMINATIONS, NOVEMBER/DECEMBER 2022


Third Semester

AD3311 - ARTIFICIAL INTELLIGENCE LABORATORY

(Regulations 2021)

Time : 3 Hours Answer any one Question Max. Marks 100

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


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

Consider you have a 3X3 board, where all numbers are in range 0 to 8. The board has no
1. 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 mathematical
3.
statements true. Consider the puzzle SEND + MORE = MONEY.

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

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

Identify the constraints to find a word in crossword puzzle. Implement a crossword puzzle
6.
problem using Constraint Satisfaction Problem.

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

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

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

Page 1 of 2
Implement a program to discover a better path to a previously expanded node using memory
10.
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 is repeated.
13.
Implement Constraint Satisfaction Problem for map coloring problem.

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

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

16. Implement Bayesian networks and perform inferences.

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

18. Implement backward chaining and resolution strategies.

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

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

Page 2 of 2

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy