Course Course Course L T P C

21CSC206T ARTIFICIAL INTELLIGENCE C PROFESSIONAL CORE

Code Name Category 2 1 0 3

Pre-requisite Co- requisite Progressive

Nil Nil Nil
Courses Courses Courses
Course Offering Department School of Computing Data Book / Codes / Standards Nil

Course Learning Rationale (CLR): The purpose of learning this course is to: Program Outcomes (PO) Program
Specific
CLR-1: infer knowledge in problem formulation with AI 1 2 3 4 5 6 7 8 9 10 11 12 Outcomes

Individual & Team Work

Engineering Knowledge
CLR-2: exemplify the uninformed and informed search technique procedures for real world problems

Design/development of

Project Mgt. & Finance

Conduct investigations
of complex problems
Modern Tool Usage
CLR-3: understand the adversarial search methods, constraint satisfaction problems and intelligent agents

Life Long Learning

The engineer and
Problem Analysis

Communication
CLR-4: demonstrate various knowledge representation techniques

Environment &
Sustainability
CLR-5: infer knowledge about expert systems

solutions

society

PSO-1

PSO-2

PSO-3
Ethics
Course Outcomes (CO): At the end of this course, learners will be able to:
CO-1: formulate a problem as a state space search method and its solution using various AI techniques 1 2 - - - - - - - - - - - - -
CO-2: apply appropriate searching techniques to solve a real-world problem 1 2 3 - - - - - - - - - - - -
CO-3: develop various game playing strategies to solve real world adversarial search problems - 2 2 - - - - - - - - - - - -
CO-4: represent various knowledge representation techniques to solve complex AI problems 1 2 - - - - - - - - - - - - -
CO-5: design an expert system to implement advance techniques in Artificial Intelligence 3 2 3 - - - - - 2 - - - - - -

Unit-1- Introduction to AI 9 Hour

AI techniques, Problem solving with AI, AI Models, Data acquisition and learning aspects in AI, Problem solving- Problem solving process, formulating problems, Problem types and characteristics, Problem space
and search, Toy Problems – Tic-tac-toe problems, Missionaries and Cannibals Problem, Real World Problem – Travelling Salesman Problem
Unit-2- Basic Introduction to Data Structure and Search Algorithms 9 Hour
Basic introduction to stacks, queues, trees and graphs - General Search Algorithms – Searching for solutions – Problem-solving agents – Control Strategies – Uninformed Search Methods – Breadth First Search –
Uniform Cost Search - Depth First Search -Depth Limited Search – Informed search - Generate and test - Best First search - A* Algorithm
Unit-3 - Adversarial Search Problems and Intelligent Agent 9 Hour
Adversarial Search Methods (Game Theory) - Mini max algorithm - Alpha beta pruning - Constraint satisfactory problems – Constraints – Crypt Arithmetic Puzzles – Constraint Domain – CSP as a search problem
(Room colouring). Intelligent Agent – Rationality and Rational Agent – Performance Measures – Rationality and Performance – Flexibility and Intelligent Agents – Task environment and its properties – Types of
agents.
Unit-4 - Knowledge Representation 9 Hour
Knowledge Representation -Knowledge based agents – The Wumpus world – Propositional Logic - syntax, semantics and knowledge base building - inferences – reasoning patterns in propositional logic – predicate
logic – representing facts in logic: Syntax and semantics – Unification – Unification Algorithm - Knowledge representation using rules - Knowledge representation using semantic nets - Knowledge representation
using frames inferences - Uncertain Knowledge and reasoning Methods.
Unit-5 - Planning and Expert System 9 Hour
Planning – planning problem – Simple planning agent – Blocks world problem – Mean Ends analysis Learning - Machine learning - Learning concepts, methods and models Introduction to expert system – architecture
of expert systems.

8
B.Tech / M.Tech (Integrated) Programmes-Regulations 2021-Volume-20-Common Courses-Syllabi-Control Copy