Scribd
Upload
135 views4 pages

Assignement 1 ECE 434 AI

This document contains an assignment for an Artificial Intelligence course. It includes 9 questions covering topics like state space search problems, map coloring, the travelling salesman problem, water jug problems, 8-puzzle problems, cryptarithmetic problems, and definitions for AI terms. Students are assigned specific questions to answer based on their roll number.

Uploaded by

Gourav Gupta
Copyright
© Attribution Non-Commercial (BY-NC)
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
135 views4 pages

Assignement 1 ECE 434 AI

This document contains an assignment for an Artificial Intelligence course. It includes 9 questions covering topics like state space search problems, map coloring, the travelling salesman problem, water jug problems, 8-puzzle problems, cryptarithmetic problems, and definitions for AI terms. Students are assigned specific questions to answer based on their roll number.

Uploaded by

Gourav Gupta
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 4

Department of Electronics & Electrical Engineering ECE-434 Artificial Intelligent Faculty Name: Suryender Kr Sharma Suryender.16890@lpu.co.

in Mo No- 9646909500

------------------------------------------------------------------------------------------------------------------Assignment-1 DOA-01/02/13 Max Marks: 30 DOS-08/02/013

1) Give the initial state, goal test, successor function, and cost function for each of the following: Choose a formulation that is precise enough to be implemented. a) You have to colour a planar map using only four colours, in such a way that no two adjacent regions have the same colour. b) In the travelling salesperson problem (TSP) there is a map involving N cities some of which are connected by roads. The aim is to find the shortest tour that starts from a city, visits all the cities exactly once and comes back to the starting city. c) Missionaries & Cannibals problem: 3 missionaries & 3 cannibals are on one side of the river. 1 boat carries 2. Missionaries must never be outnumbered by cannibals. Give a plan for all to cross the river. 2) Variations of Water Jug Problem A) You have an empty 3-gallon jug and an empty 5-gallon jug. You also have an 8-gallon jug that is full of water. You would like to give your friend exactly half of the water (4 gallons).Solve Using Production Rules B) What amounts can we get using empty jugs are 2-gallon and 6-gallon, and the full jug is 8 gallons. Using Production Rules C) What amounts can we get using empty jugs are 4-gallon and 6-gallon, and the full jug is 10 gallons. Using Production Rules

D) What amounts can we get using empty jugs are 5-gallon and 6-gallon, and the full jug is 11 gallons. Using Production Rules

3) Solve this 8-puzzle problem using a) DFS b) BFS

4) A monkey is in a cage and bananas are suspended from the ceiling, the monkey wants to eat a banana but cannot reach them in the room are a chair and a stick if the monkey stands on the chair and waves the stick, he can knock a banana down to eat it what are the actions the monkey should take? Initial state: monkey on ground with empty hand bananas suspended Goal state: monkey eating bananas. Use state space search to solve the problem. 5) Solve the following 8-puzzle using a) BFS b)DFS

Start state 6) Solve The following Crypt arithmetic problem : a) C R O S S +ROADS DANGER b) DONALD + GERALD ROBERT

Goal state

c)

FIFTY +STATES AMERICA

7) Draw the Space State for the following search space:

8) Assume that in the search space given in question 7 the initial state is A and the goal state is G. Show how each of the following search strategies would create a search tree to find a path from the initial state to the goal state: a) Breadth-first search b) Depth-first search c) Iterative deepening search 9) Define the following terms briefly (Within 3-4 lines) as per your roll no. and the term allotted to you? (a). Artificial Neural Network. (b). Swarm Intelligence (c). McCulloch-Pitts Model (e). Pattern Recognition (g). Syntactical Pattern Recognition (i). Genetic Algorithm (GA) (k). Fuzzy Logic (m). Computer Vision (d). Ant Colony Optimization (f). Statistical Pattern Recognition (h). Synapse, Dendrites, Axon, Neuro Transmitters (j). Evolutionary Algorithms (l). Natural Language Processing (n). Intelligent Agents

Roll no. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

Questions to be solved 1a,2A,3a,4,5a,6a,7,8a,9a 1b,2B,3b,4,5b,6b,7,8b,9b 1c,2C,3a,4,5a,6c,7,8c,9c 1a,2D,3b,4,5b,6a,7,8a,9d 1b,2A,3a,4,5a,6b,7,8b,9e 1a,2A,3a,4,5a,6a,7,8a,9f 1b,2B,3b,4,5b,6b,7,8b,9g 1c,2C,3a,4,5a,6c,7,8c,9h 1b,2B,3b,4,5b,6b,7,8b,9i 1c,2C,3a,4,5a,6c,7,8c,9j 1b,2A,3a,4,5a,6b,7,8b,9k 1c,2C,3a,4,5a,6c,7,8c,9l 1a,2D,3b,4,5b,6a,7,8a,9m 1b,2B,3b,4,5b,6b,7,8b,9n 1c,2C,3a,4,5a,6c,7,8c,9a 1a,2D,3b,4,5b,6a,7,8a,9b 1c,2C,3a,4,5a,6c,7,8c,9c 1a,2D,3b,4,5b,6a,7,8a,9d 1b,2A,3a,4,5a,6b,7,8b,9e 1a,2A,3a,4,5a,6a,7,8a,9f 1b,2B,3b,4,5b,6b,7,8b,9g 1c,2C,3a,4,5a,6c,7,8c,9h 1b,2B,3b,4,5b,6b,7,8b,9i 1c,2C,3a,4,5a,6c,7,8c,9j 1a,2D,3b,4,5b,6a,7,8a,9k 1c,2C,3a,4,5a,6c,7,8c,9l 1a,2D,3b,4,5b,6a,7,8a,9m 1b,2A,3a,4,5a,6b,7,8b,9n 1a,2A,3a,4,5a,6a,7,8a,9a 1b,2B,3b,4,5b,6b,7,8b,9b

Roll No 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60

Questions to be Solved 1c,2C,3a,4,5a,6c,7,8c,9c 1b,2B,3b,4,5b,6b,7,8b,9d 1c,2C,3a,4,5a,6c,7,8c,9e 1a,2D,3b,4,5b,6a,7,8a,9f 1c,2C,3a,4,5a,6c,7,8c,9g 1a,2D,3b,4,5b,6a,7,8a,9h 1b,2A,3a,4,5a,6b,7,8b,9i 1a,2A,3a,4,5a,6a,7,8a,9j 1b,2B,3b,4,5b,6b,7,8b,9k 1c,2C,3a,4,5a,6c,7,8c,9l 1b,2B,3b,4,5b,6b,7,8b,9m 1c,2C,3a,4,5a,6c,7,8c,9n 1a,2D,3b,4,5b,6a,7,8a,9a 1c,2C,3a,4,5a,6c,7,8c,9b 1a,2D,3b,4,5b,6a,7,8a,9c 1b,2A,3a,4,5a,6b,7,8b,9d 1a,2A,3a,4,5a,6a,7,8a,9e 1b,2B,3b,4,5b,6b,7,8b,9f 1c,2C,3a,4,5a,6c,7,8c,9g 1b,2B,3b,4,5b,6b,7,8b,9h 1c,2C,3a,4,5a,6c,7,8c,9i 1a,2D,3b,4,5b,6a,7,8a,9j 1b,2A,3a,4,5a,6b,7,8b,9k 1a,2A,3a,4,5a,6a,7,8a,9l 1b,2B,3b,4,5b,6b,7,8b,9m 1c,2C,3a,4,5a,6c,7,8c,9n 1a,2D,3b,4,5b,6a,7,8a,9a 1b,2B,3b,4,5b,6b,7,8b,9b 1c,2C,3a,4,5a,6c,7,8c,9c 1a,2D,3b,4,5b,6a,7,8a,9d

Note: every student have to solve each assigned questions only, questions assigned are written against their rill no. For eg- Roll no 1 have to solve Q no-1a,2A,3a,4,5a,6a,7,8a,9a .

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