Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

CS607 Assignment 01 Spring 2021 Solution / Discussion Due Date: 23-05-2021

Artificial Intelligence (CS607)

Assignment # 01
Spring 2021


Total marks = 20                                                                              


Deadline Date



Please carefully read the following instructions before attempting the assignment.



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

·        The assignment is submitted after the due date.

·        The submitted assignment does not open or the file is corrupt.

·        Strict action will be taken if the submitted solution is copied from any other student or the internet.


You should consult the recommended books to clarify your concepts as handouts are not sufficient.


You are supposed to submit your assignment in Doc or Docx format.

Any other formats like scan images, Pdf, Zip, Rar, Ppt and Bmp, etc will not be accepted.



The objective of this assignment is to;

·         To learn how to search in different AI searching algorithms.




No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignments in the last hour of the deadline. It is recommended to upload the solution file at least two days before its closing date.


If you find any mistake or confusion in the assignment (Question statement), please consult with your instructor before the deadline. After the deadline, no queries will be entertained in this regard.


For any query, feel free to email at:











Questions No. 01                                                                                       10 Marks  

Considering heuristically informed search (Best first search). You are required to find straight line distance.


  • Based on the cost we devise paths in the graph for traversing towards the goal node.
  • Priority Queue
  • Initial State
  • If the node is a goal


Then return the path from initial to node else generate all successor of nodes and put the newly generated node into open according to their f values. Cost is given on the edge of each node path.














Here is the formula to measure the distance.





Question No. 2                                                                                       10 Marks

Give step-by-step traversing to reach target node “k” based on Progressive Deepening.



















Practice handouts questions to good effect, to solve assignment questions better.



Wish you the very best of luck!


Views: 945

Replies to This Discussion

Stay touched with this discussion, Solution idea will be uploaded as soon as possible in replies here before the due date.

Please post solution file.

any one have this solution file?



cs607 solution


yeah muja gamil send kr da 


Looking For Something? Search Below

VIP Member Badge & Others

How to Get This Badge at Your Profile DP


Management: Admins ::: Moderators

Other Awards Badges List Moderators Group

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

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