Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
5 views1 page

Assignment - 1 QP

This document outlines an assignment for the IT8601 – Computational Intelligence course at Dr. N.G.P. Institute of Technology. It includes four questions related to minimax search procedures, genetic algorithms, knowledge representation using Propositional Logic and FOL, and the training algorithm of Back propagation networks. Each question is associated with specific course outcomes and requires detailed responses from students in their third year of B.Tech IT, semester VI.

Uploaded by

celin.n
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views1 page

Assignment - 1 QP

This document outlines an assignment for the IT8601 – Computational Intelligence course at Dr. N.G.P. Institute of Technology. It includes four questions related to minimax search procedures, genetic algorithms, knowledge representation using Propositional Logic and FOL, and the training algorithm of Back propagation networks. Each question is associated with specific course outcomes and requires detailed responses from students in their third year of B.Tech IT, semester VI.

Uploaded by

celin.n
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Dr. N.G.P. INSTITUTE OF TECHNOLOGY Rec.

Name :
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai) TLP
Recognized by UGC & Accredited by NAAC with A+ and NBA (BME, CSE, ECE, EEE and Mech)
DEPARTMENT OF INFORMATION TECHNOLOGY

IT8601 – COMPUTATIONAL INTELLIGENCE


ASSIGNMENT 2 QUESTION
YEAR: III B.Tech IT SEMESTER: VI
CO /
Knowledge
S.No Questions
level
1 Consider the two player game in which the minimax search procedure is used to CO1
compute the best moves for the first player. Assume a static evaluation function (6 M)
that returns values ranging from -10 to 10, with 10 indicating a win for the first
player and -10 a win for the second player. Assume the following game tree in
which the static scores are from the first player ‘s point of view. Suppose the first
player is the maximizing player and needs to make the next move. What move
should be chosen at this point? Can the search be optimized?

2 Point out the procedures of genetic algorithms and what are the different genetic CO1
representations (6 M)
3 Describe how Propositional Logic and FOL is used to represent knowledge with CO2
its syntax and Semantics for the following facts in this knowledge base. (12 M)
<“1. Lucy* is a professor 2. All professors are people. 3. John is the dean. 4.
Deans are professors. 5. All professors consider the dean a friend or don’t know
him. 6. Everyone is a friend of someone. 7. People only criticize people that are
not their friends. 8. Lucy criticized John .”>
4 Explain the training algorithm of Back propagation networks and discuss how the CO3
various parameters are chosen for training the neural net? (6 M)

Course handling Faculty Head of the Department

You might also like