CS607 Assignment 1 Solution and Discussion


  • Cyberian's Gold

    Re: CS607 Assignment 1 Solution and Discussion

    Assignment No. 01
    Semester: Spring 2020
    CS607: Artificial Intelligence
    Total Marks: 20

    Due Date:1/06/2020
    Instructions
    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;
     Learn and practice basic concepts of Graphs and trees
     Basic understanding of BFS(Breadth First Search) by using Search algorithm.
    Assignment

    Question No. 1
    Given the following graphs convert it into tree data structure.
    A) In the following graph consider node 1 as your starting point Marks 5
    8f8a98aa-50c5-45a1-a4c8-f741deffeb4e-image.png
    B) In the following graph consider node h as your starting point. Marks 5
    dd97ebe5-ee9e-4edb-a728-0fe639cdac31-image.png

    Question No. 2 Marks 10

    Consider the search space below, where S is the start node and O is goal node. Show with the sequence of diagrams along with table displaying how does BFS (Breadth First Search) work on given tree using simple search algorithm.

    3cf4151b-e716-4a89-a048-52fc5b0bb94c-image.png

    Submission
    You are required to submit your solution through LMS as an MS Word document.



Quiz 100% Result Quiz 100% Result
| |