CS607 Assignment 1 Spring 2023 – Assignments – Solution VU

CS607 Assignment 1 Spring 2023 – Assignments – Solution VU


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:

[email protected]


 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!


#CS607 #Assignment #Spring #Assignments #Query

Leave a Reply

Your email address will not be published. Required fields are marked *

aiou Previous post AIOU launches spring plantation drive
aiou Next post AIOU issues new assignment submission policy