Assignment No. 01
 Solution and Discussion Semester: Spring 2019


  • Cyberian's

    Spring 2019_CS607_1.doc
    Assignment No. 01
    Semester: Spring 2019
    CS607: Artificial Intelligence

    Total Marks: 20

    Due Date:14/05/19

    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 DFS 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
    ![0_1557943163959_6616e6f2-00cb-4cf7-b7c5-bbd1f95d06f4-image.png](Uploading 100%)
    B) In the following graph consider node b as your starting point.
    ![0_1557943173891_bca85230-5ed3-4428-b2ef-71cea98e1f9d-image.png](Uploading 100%)

    Question No. 2

    Consider the search space below, where 1 is the start node and 10 is goal node. Show with the sequence of steps along with table displaying how does DFS work on given tree using simple search algorithm.

    ![0_1557943191015_444868e3-0ffe-496c-871a-762ecaac5a72-image.png](Uploading 100%)

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


  • Cyberian's



2
Online

26
Users

110
Topics

278
Posts