Topics tagged with cs607

CS607 Assignment 3 Solution and Discussion

zaasmi — Invalid Date

https://www.youtube.com/watch?v=wJmGSlgXnmQ

CS607 Assignment 2 Solution and Discussion

zaasmi — Invalid Date

@zaasmi said in CS607 Assignment 2 Solution and Discussion: Question No. 2 Marks 10 Using deftemplate add a function with name “person” with slots name, age, degree and gpa. Then add fact of that person with your details. Also write a rule with name “is-student-passed” where you will set condition on cgpa, if cgpa will be 3.5 or 3.7 then student will be passed. Write the code for this rule and run this rule. Take screenshots of your CLIPS IDE window. If any student will send code on word or pdf file marks will be zero. [image: hVsaaUW.png] [image: HpQh5Ji.png] [image: xwg9oKR.png] You can download CLIPS IDE from this link

CS607 Assignment 1 Solution and Discussion

zaasmi — Invalid Date

@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. [image: jwejsAk.png]

CS607 Assignment 2 Solution and Discussion

cyberian — Invalid Date

Re: CS607 Assignment 2 Solution and Discussion

CS607 Assignment 1 Solution and Discussion

moaaz — Invalid Date

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

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.

CS607 Assignment 3 Solution and Discussion

zareen — Invalid Date

[image: dlR77xh.png] [image: DIUIHJx.png]

CS607 Assignment 2 Solution and Discussion

zareen — Invalid Date

[image: PrCtGDT.png] [image: kzcb3Ji.png] [image: KgtNbic.png] [image: LSn7LA0.png]

CS607 Assignment 1 Solution and Discussion

zareen — Invalid Date

[image: 1573737089576-b362235d-f1e1-429a-b44a-ca6bb36d39e0-image.png] [image: 1573737107607-398730c6-64dc-42a4-87d4-a2adb57e8863-image.png]

CS607 GDB 1 Solution and discussion

zareen — Invalid Date

GDB: Fall-2019 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.

CS607 Quiz #2 Solution and Discussion

zaasmi — Invalid Date

Hypothesis space uses the ________________ of the attributes. CS607 conjunctions (AND) (Page No 168) [image: 1565096437598-91bd86e3-fba3-4132-885c-4bb3c224f37f-image.png]