We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
+ Link For Assignments, GDBs & Online Quizzes Solution
+ 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
CS607: Artificial Intelligence
Total Marks: 20
Due Date: 08/05/2013
Please read the following instructions carefully before submitting assignment:
It should be clear that your assignment will not get any credit if:
The objective of this assignment is to enhance your knowledge about;
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.
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.
(Sample search is just given as an example to show how you need to fill this table with desired values.)
You are required to submit your solution in MS Word format through LMS.
.+ 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)
sadia yunas butt thanks
it is correct thank you miss sadia younas butt
Thanx sadia yunas butt
@Sadia Thanks for help
for resultant path no.2 isn't it:
as In ASSIGNMENT GRaph the distance from G - I =13
Please correct me if I'm wrong
thanks @sadia younas butt
how you find this? please explain.
sadia yunas butt thanks for sharing
Please Discuss here about this assignment.Thanks
Our main purpose here discussion not just Solution
We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions.
Search Algorithms and Applications
Search algorithms aim to find solutions or objects with specified properties and constraints in a large solution search space or among a collection of objects. A solution can be a set of value assignments to variables that will satisfy the constraints or a sub-structure of a given discrete structure. In addition, there are search algorithms, mostly probabilistic, that are designed for the prospective quantum computer. This book demonstrates the wide applicability of search algorithms for the purpose of developing useful and practical solutions to problems that arise in a variety of problem domains. Although it is targeted to a wide group of readers: researchers, graduate students, and practitioners, it does not offer an exhaustive coverage of search algorithms and applications. The chapters are organized into three parts: Population-based and quantum search algorithms, Search algorithms for image and video processing, and Search algorithms for engineering applications.
share the solution..........vu students..............sb so ry kya.......
last date aa ri............subah
Breadth First Search
kasy aya ha yaaaaaaaaaaaaaaaaaaaaaaaaa??????????????????