CS607 Assignment 1 Solution and Discussion

zaasmi

Re: CS607 Assignment 1 Solution and Discussion

Artificial Intelligence (CS607)
Assignment # 01
Fall 2020
Total marks = 20

Deadline Date
03-12-20

Please carefully read the following instructions before attempting assignment.

RULES FOR MARKING
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 file is corrupt.
 Strict action will be taken if submitted solution is copied from any other student or from 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.

OBJECTIVE
The objective of this assignment is to:
• Basic understanding of BFS (Breadth First Search) by using Search algorithm.
• Learn and practice basic concepts of Graphs and trees

NOTE

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 assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.

If you find any mistake or confusion in 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
Consider the search space below, where A is the start node and O is a goal node. Consider the tree as given below, show in table displaying how does BFS (Breadth First Search) work on given tree using simple search algorithm.

Questions No. 02 10 marks
Convert mentioned below tree into Graph.

zaasmi

@zaasmi said in CS607 Assignment 1 Solution and Discussion:

Questions No. 01 10 marks
Consider the search space below, where A is the start node and O is a goal node. Consider the tree as given below, show in table displaying how does BFS (Breadth First Search) work on given tree using simple search algorithm.