AI MCAN2320 Coursepack
AI MCAN2320 Coursepack
SCHEME:
Course Title Artificial intelligence Course Type Integrated
(Specialization)
Self-study
Practical
Tutorial
Theory
SEE
Practical 1 2
CIE
Self-study 0 0
COURSE OVERVIEW:
Students will gain experience on various AI approach to solve the real world problems. This course
introduces the basic concepts and techniques of artificial intelligence. Topics include search, reasoning,
planning, machine learning. The course will cover both theoretical and practical aspects of AI, and will
emphasize the use of Prolog for implementing AI algorithms.
COURSEPACK |
PREREQUISITE COURSE:
COURSE OBJECTIVE:
COURSE OUTCOMES:
After the completion of the course, the student will be able to:
Bloom
CO Taxonomy Level
(BTL)
Remember(L1) Understand(L2) Apply(L Analyze(L4)
3)
203.1 - -
203.2 - - -
COURSEPACK |
203.3 - - -
203.4 - - -
PROGRAM OUTCOMES:
PO1: An ability to independently carry out research /investigation and development work to solve
practical problems.
PO2: An ability to write and present a substantial technical report/document.
PO3: Students should be able to demonstrate a degree of mastery over the area as per the specialization
of the program. The mastery should be at a level higher than the requirements in the appropriate
bachelor program.
2 – 2 1 –
203.1
2 1 2 – 1
203.2
203.3 2 2 1 1 1
203.4 1 2 2 2 2
COURSE ASSESSMENT:
S. No. Assessment CIE TOTALCIE SEE
Tools Marks
CAT: Continuous Assessment Test; SEE: Semester End Examination; ETE: End Term Examination; A1-Assessment-1
COURSEPACK |
COURSE CONTENT:
THEORY
CONTENT
Various definitions of AI, Introduction to AI applications and AI techniques, Production systems, control
strategies, reasoning – forward & backward chaining Intelligent agents – agents and environments - good
Modelling – the nature of Environments –structure of agents – Problem Solving – problem solving agents –
example problems – searching for solutions – uniformed search strategies – avoiding repeated states –
searching with partial information.
Informed search and exploration – Informed search strategies – heuristic function – local search algorithms
and optimistic problems – local search in continuous spaces – online search agents and unknown
environments – Constraint satisfaction problems (CSP) – Backtracking search and Local search for CSP –
Structure of problems – Adversarial Search – Games – Optimal decisions in games – Alpha – Beta Pruning
– imperfect real-time decision – games that include an element of chance.
First order logic – representation revisited – Syntax and semantics for first order logic – Using first order
logic – Knowledge engineering in first order logic - Inference in First order logic –prepositional versus
first order logic – unification and lifting – forward chaining – backward chaining - Resolution -
Knowledge representation – Ontological Engineering - Categories and objects – Actions – Simulation and
events – Mental events and mental objects.
Learning from observations - forms of learning - Inductive learning - Learning decision trees -Ensemble
learning – Knowledge in learning – Logical formulation of learning – Explanation based learning –
Learning using relevant information – Inductive logic programming – Statistical learning methods –
Learning with complete data – Learning with hidden variable – EM algorithm – Instance based learning -
Neural networks - Reinforcement learning – Passive reinforcement learning .
Different types of uncertainty – degree of belief and degree of truth, various probability constructs – prior
probability, conditional probability, probability axioms, probability distributions, and joint probability
distributions, Bayes’ rule, other approaches to modelling uncertainty such as Dempster-Shafer theory and
fuzzy sets/logic
PRACTICAL
CONTENT
Study of Prolog , Write simple fact for the statements using PROLOG, Write predicates that converts
centigrade temperatures to Fahrenheit, Study of Lists in PROLOG, Program to use various mathematical
operators, Write a Program to categorise animal characteristics, Write a Program to show concept of cut
operator , Write a Program to reverse the list, Write a program to a. append b. Delete c. Replace an element
in the list, Write a program to implement factorial, Fibonacci of a given number, Write a program of depth
first search, Write a program for 8-queen problem, Write a program to solve Monkey-Banana problem,
Practice
COURSEPACK |
LESSON PLAN for THEORY:
14 Practice
15 Practice
BIBLIOGRAPHY
Text Book (s)
1. Artificial Intelligence: A Modern Approach,. Russell & Norvig. 1995, Prentice Hall.
Reference Book (s)
2. Artificial Intelligence-A modern approach, Staurt Russel and peter norvig, 1998, PHI.
3. Artificial intelligence, Patrick Henry Winston:, 1992, Addition Wesley 3 Ed.,
.
Journals/Magazines/Govt. Reports/Gazatte/Industry Trends
SWAYAM/NPTEL/MOOCs Certification
6. https://nptel.ac.in/courses/106102220
7. IFACET (iitk.ac.in)
Webliography
8. https://www.youtube.com/watch?v=uB3i-qV6VdM&list=PLxCzCOWd7aiHGhOHV-nwb0HR5US5GFKFI
9. https://www.tutorialspoint.com/artificial_intelligence/index.htm
COURSEPACK |