We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More


Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

Assignment No. 02
Semester: Spring 2013

CS607: Artificial Intelligence

 

Total Marks: 20

 

Due Date: 08/05/2013

 

Instructions

Please read the following instructions carefully before submitting assignment:

It should be clear that your assignment will not get any credit if:

 

  • The assignment is submitted after due date.
  • The submitted assignment does not open or file is corrupt.
  • Solution is copied from any other source.

 

Objective

The objective of this assignment is to enhance your knowledge about;

 

  • Conversion of Maps/Graphs into Trees.
  • Application of different Search Algorithms.

 

Assignment

Dear Student, Let’s consider we have a connectivity map/graph of Nine cities as given below. Cities are named as A, B, C…I for simplicity. The labeled edges indicate the distance in Km between connected cities e.g. the edge between node B and C is labeled as 3 which indicate that there is 3Km distance between city B and C.

 

Suppose you are currently at city A and you need to carry certain object to city I. In other words, your starting position is city A and destination is city I. Your task is to transform this map/graph into Tree and apply selected search techniques to find the path from A to I.

 

 

Questions

 

Part 1: Draw below your Connectivity Tree of the given Map/Graph. See Page#23 in your handouts for sample conversion of graph into tree.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Part 2: Apply the following search techniques on your connectivity tree and write the path found by each technique along with its cost in terms of total distance from A to I.

 

Search Technique

Resultant Path/s

Total Path Length/s

Sample Search

A-B-C-F-H-I

2+3+3+2+3=13Km

Depth First Search

 

 

Breadth First Search

 

 

Best First Search

 

 

Beam Search (k=2)

 

 

 

 

(Sample search is just given as an example to show how you need to fill this table with desired values.)

 

Note:

  • Total path length is the sum of all edges included in the selected path.
  • Your connectivity tree shall be complete i.e. representing all possible paths from city A without any cycles/loops.
  • Left Sub-tree will be processed first in Depth First Search.
  • Resultant paths mainly depend upon your Tree. If your path is not correct as per your Tree then marks will be deducted.
  • There is no aerial distance information available, so you have to use and make decision upon available local intercity distance information in case of Best First and Beam Search.

 

Submission

 

You are required to submit your solution in MS Word format through LMS.

 

 

 

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 7348

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)

Attachments:

Replies to This Discussion

Beam Search

Read for Beam Search

IF beam search k=2

then we chose best two nodes

like,    A-B and A-D and so on....

click on beam search link and .........

Beam Search (k=2)

A-D-E-F-H-I

10

A-B-G-I

16

please share tree diagram to move forward please....

which Q?

Q part 1....
tree...
how to make a tree ...
please share as image for idea solution...
thanks...

in Q1

Five path are possible.

  1. A-B-G-I
  2. A-B-C-F-H-I
  3. A-D-C-B-G-I
  4. A-D-E-F-H-I
  5. A-D-C-F-H-I

ABCDEFHI ????? ARRIAN

First of all why you people misguide alot???

Read Assignment Carefully...

First need to draw Connectivity Tree then after that Complete Question.2 according to that tree...

so how can you complete Question.2 without Solve Question.1>>>???

Anyhow, lets start from begining...

Good Luck

Mahil is wright
pehly Q1 solve ho ga phir us tree k according hmne Q2 solve krna hai otherwise hmy marks nhi milny
sir ne ye sb file mai likha hua hai.plz read file.

RSS

© 2020   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.