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

B) In the following graph consider node h as your starting point. Marks 5

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.

Submission

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

]]>

]]>

In machine-learning problem space can be represented through concept space, instance space version space and hypothesis space. These problem spaces used the conjunctive space and is very restrictive one and also in the above-mentioned representations of problem spaces, it is not sure that the true concept lies within conjunctive space.

GDB Topic:

Discuss the case if we have a bigger search space and want to overcome the restrictive nature of conjunctive space, then how can we represent our problem space. Secondly in a given scenario which algorithm is used for our problem space to represent the learning problem.

]]>conjunctions (AND) (Page No 168)

]]>