COMPUTER SCIENCE AND ENGINEERING

ARTIFICIAL CATEGORY L T P CREDIT

CST401
INTELLIGENCE PCC 2 1 0 3

Preamble: The course aims to introduce the fundamental principles of intelligent systems to
students. This involves ideas about the characteristics of intelligent systems, knowledge
representation schemes, logic and inference mechanisms. The course helps the learner to
understand the design of self learning systems along with some of their typical applications in the
emerging scenario where the business world is being transformed by the progress made in
machine learning.
Prerequisite : NIL
Course Outcomes: After the completion of the course the student will be able to

CO# CO
Explain the fundamental concepts of intelligent systems and their architecture.
CO1 (Cognitive Knowledge Level: Understanding)

Illustrate uninformed and informed search techniques for problem solving in

CO2
intelligent systems. (Cognitive Knowledge Level: Understanding )

Solve Constraint Satisfaction Problems using search techniques.

CO3 (Cognitive Knowledge Level: Apply )
Represent AI domain knowledge using logic systems and use inference techniques
CO4 for reasoning in intelligent systems. (Cognitive Knowledge Level: Apply )
Illustrate different types of learning techniques used in intelligent systems
CO5 (Cognitive Knowledge Level: Understand)

Mapping of course outcomes with program outcomes

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1

CO2

CO3

CO4

CO5
 COMPUTER SCIENCE AND ENGINEERING

Abstract POs defined by National Board of Accreditation

PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work
Conduct investigations of complex
PO4 problems PO10 Communication

PO5 Modern tool usage PO11 Project Management and Finance

PO6 The Engineer and Society PO12 Life long learning

Assessment Pattern

Continuous Assessment Tests End Semester

Bloom’s Examination Marks (%)
Category
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 60 30 40
Apply 20 40 30
Analyze
Evaluate
Create

Mark Distribution
Total Marks CIE Marks ESE Marks ESE Duration
150 50 100 3

Continuous Internal Evaluation Pattern:

Attendance 10 marks
Continuous Assessment Tests(Average of SeriesTests1& 2) 25 marks

Continuous Assessment Assignment 15 marks

 COMPUTER SCIENCE AND ENGINEERING

Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A.
Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a student
should answer any 5.

End Semester Examination Pattern:

There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have maximum 2 sub-divisions and carries 14 marks.

Syllabus

Module – 1 (Introduction)
Introduction – What is Artificial Intelligence(AI) ? The Foundations of AI, History of AI,
Applications of AI. Intelligent Agents – Agents and Environments, Good behavior: The concept
of rationality, nature of Environments, Structure of Agents.

Module – 2 (Problem Solving)

Solving Problems by searching-Problem solving Agents, Example problems, Searching for
solutions, Uninformed search strategies, Informed search strategies, Heuristic functions.

Module - 3 (Search in Complex environments)

Adversarial search - Games, Optimal decisions in games, The Minimax algorithm, Alpha-Beta
pruning. Constraint Satisfaction Problems – Defining CSP, Constraint Propagation- inference in
CSPs, Backtracking search for CSPs, Structure of CSP problems.

Module - 4 (Knowledge Representation and Reasoning)

Logical Agents – Knowledge based agents, Logic, Propositional Logic, Propositional Theorem
proving, Agents based on Propositional Logic. First Order Predicate Logic – Syntax and
Semantics of First Order Logic, Using First Order Logic, Knowledge representation in First
Order Logic. Inference in First Order Logic – Propositional Vs First Order inference, Unification
and Lifting, Forward chaining, Backward chaining, Resolution.
 COMPUTER SCIENCE AND ENGINEERING

Module - 5 (Machine Learning)

Learning from Examples – Forms of Learning, Supervised Learning, Learning Decision Trees,
Evaluating and choosing the best hypothesis, Regression and classification with Linear
models.

Text Book
1. Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach, 3rd Edition.
Prentice Hall.

References
1. Nilsson N.J., Artificial Intelligence - A New Synthesis, Harcourt Asia Pvt. Ltd.

Course Level Assessment Questions

Course Outcome 1 (CO1):
1. Explain about the basic types of agent programs in intelligent systems.
2. For the following activities, give a PEAS description of the task environment and characterize
it in terms of the task environment properties.
a) Playing soccer.
b) Bidding on an item at an auction.

Course Outcome 2 (CO2):

1. Differentiate between uninformed and informed search strategies in intelligent systems.
2. Illustrate the working of Minimax search procedure.

Course Outcome 3 (CO3):

1. Solve the following crypt arithmetic problem by hand, using the strategy of backtracking
with forward checking and the MRV & least-constraining-value
heuristics.

Course Outcome 4 (CO4):

1. Prove, or find a counter example to, the following assertion:
If α |= γ or β |= γ (or both) then (α ∧β) |= γ
2. For each pair of atomic sentences, find the most general unifier if it exists:
a) P (A, B, B), P (x, y, z).
b) Q(y, G(A, B)), Q(G(x, x), y).

Course Outcome 5 (CO5):

1. Consider the following data set comprised of three binary input attributes (A1 , A2 , and
 COMPUTER SCIENCE AND ENGINEERING

A3 ) and one binary output.

Use the DECISION-TREE-LEARNING algorithm to learn a decision tree for these data.
Show the computations made to determine the attribute to split at each node.
2. What is multivariate linear regression? Explain.

Model Question Paper

QP CODE:

Reg No: _______________

Name: _________________ PAGES : 4

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

SEVENTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Code: CST401

Course Name: Artificial Intelligence

Max. Marks : 100 Duration: 3 Hours

PART A

Answer All Questions. Each Question Carries 3 Marks

1 What is a rational agent? Explain.

2 Describe any two ways to represent states and the transitions between them in
agent programs.

3 Differentiate between informed search and uninformed search.

4 Define heuristic function? Give two examples.

 COMPUTER SCIENCE AND ENGINEERING

5 What are the components of a Constraint Satisfaction Problem? Illustrate with an

example.

6 Formulate the following problem as a CSP. Class scheduling: There is a fixed

number of professors and classrooms, a list of classes to be offered, and a list of
possible time slots for classes. Each professor has a set of classes that he or she can
teach.

7 What is a knowledge based agent? How does it work?

8. Represent the following assertion in propositional logic:

“A person who is radical (R) is electable (E) if he/she is conservative (C), but
otherwise is not electable.”

9 Describe the various forms of learning?

10 State and explain Ockham’s razor principle (10x3=30)

Part B
(Answer any one question from each module. Each question carries 14 Marks)

11 (a) Explain the structure Goal-based agents and Utility-based agents with the (8)
. help of diagrams.

(b) For the following activities, give a PEAS description of the task environment (6)
and characterize it in terms of the task environment properties.
a) Playing soccer
b) Bidding on an item at an auction.

OR

12 (a) Explain the structure Simple reflex agents and Model-based reflex agents (8)
. with the help of diagrams.

(b) Discuss about any five applications of AI. (6)

13 (a) Explain Best First Search algorithm. How does it implement heuristic search? (6)
.
(b) Describe any four uninformed search strategies. (8)
 COMPUTER SCIENCE AND ENGINEERING

OR

14 (a) Write and explain A* search algorithm. (6)

.
(b) Explain the components of a well defined AI problem? Write the standard (8)
formulation of 8-puzzle problem.

15 (a) (a) Solve the following crypt arithmetic problem by hand, using the strategy (8)
. of backtracking with forward checking and the MRV and least-constraining-
value heuristics.

(b) What is local consistency in CSP constraint propagation? Explain different (6)
types local consistencies.

OR

16 (a) Illustrate the use of alpha-beta pruning in games. (6)

.
(b) Consider the following game tree in which static evaluation score are all from (8)
the players point of view: static evaluation score range is (+10 to -10)

Suppose the first player is the maximizing player. What move should be
chosen? Justify your answer.

17 (a) Convert the following sentences into first order logic: (6)
. Everyone who loves all animals is loved by someone.
Anyone who kills an animal is loved by no one.
Jack loves all animals.
Either Jack or Curiosity killed the cat, who is named Tuna.
 COMPUTER SCIENCE AND ENGINEERING

Did Curiosity kill the cat?

(b) Give a resolution proof to answer the question “Did Curiosity kill the cat? “ (8)

OR

18 (a) Prove or find a counter example to the following assertion in propositional (6)
. logic:
If α |= (β ∧ γ) then α |= β and α |= γ.

(b) For each pair of atomic sentences, give the most general unifier if it exists: (8)
Older (Father (y), y), Older (Father (x), John).

19 (a) How is best hypothesis selected from alternatives? (8)

.
(b) Explain Univariate Linear Regression. (6)

OR

20 (a) Consider the following data set comprised of two binary input attributes (A1 (8)
. and A2) and one binary output.

Use the DECISION-TREE-LEARNING algorithm to learn a decision tree for

these data. Show the computations made to determine the attribute to split at
each node.

(b) Explain Linear classification with logistic regression (6 )