Item 67/31 - Annexure - 35
Course Code Course Title L T P C
MCSE601L Artificial Intelligence 3 0 0 3
Pre-requisite NIL Syllabus version
1.0
Course Objectives
1. To establish theoretical knowledge and understanding in the field of Artificial
Intelligence and identify its possible applications.
2. To plan and formulate a non-trivial problem as a state space and apply intelligent
search algorithms to identify optimal solutions.
3. To develop and design methods to make decisions in complex uncertain
environments.
Course Outcomes
At the end of the course the student will be able to
1. Understand the foundation of AI and apply various search algorithms to identify
optimal solutions in state spaces.
2. Represent and reason with knowledge and uncertainty to identify solutions for real
world problems.
3. Formulate plan as a state space and apply algorithms to find solutions.
4. To develop data driven learning agents.
Module:1 Intelligent Agents and Uninformed Search 6 hours
Foundations of Artificial Intelligence - Definitions - Evolution of AI - Applications of AI -
Intelligent Agents - Agents and Environments - Nature of Environments - Structure of
Agents- Solving Problem by Searching- Blind Search Techniques – Breadth First Search,
Depth First Search, Uniform Cost Search, Iterative Deepening Search, Bidirectional search.
Module:2 Informed Search Algorithms 5 hours
Informed Search - Introduction to Heuristics – Greedy Breadth First Search, A* - Local
Search Optimization Algorithms - Hill Climbing, Simulated Annealing.
Module:3 Optimal Search Algorithms 6 hours
Global optimization algorithms - Genetic Algorithms, Particle Swarm Optimization Algorithm,
Ant Colony Optimization, Gravitational Search Algorithm - Games - Optimal Decisions in
Games - Minimax Algorithm, Alpha-Beta Pruning Algorithm.
Module:4 Knowledge Representation and Reasoning 9 hours
Logical systems – Knowledge Based systems - Representing knowledge using Propositional
Logic – Inference in Propositional Logic using Laws of Inference, Forward Chaining,
Backward Chaining, Resolution. Representing knowledge using First Logic Order Logic-
Inference in First Order Logic using Unification, Forward Chaining, Backward Chaining,
Resolution.
Module:5 Quantifying Uncertainty 6 hours
Acting under Uncertainty, -Conditional Independence- Bayes Rule –Naïve Bayes Classifier -
Bayesian Belief Network- Inference in Bayesian Belief Network- Making Decisions in
Complex Environments- Markov Decision Processes.
Module:6 Classical Planning 6 hours
Planning Problem –STRIPS representation- Complexity of planning- Algorithms for Planning
as State Space Search – Partial order Planning –Hierarchical Planning.
Module:7 Data Driven Learning Agents 5 hours
Forms of learning – Supervised Learning - Decision Trees – CART - Univariate Linear
Proceedings of the 67th Academic Council (08.08.2022) 1690
Item 67/31 - Annexure - 35
Regression, Multivariate Linear Regression.
Module:8 Contemporary Issues 2 hours
Total Lecture hours: 45 hours
Text Book(s)
1. Russell, S and Norvig, P, 2015, Artificial Intelligence – A Modern Approach, 3rd
Edition, Prentice Hall.
Reference Books
1. Min Xin-She Yang., “Nature-Inspired Computation and Swarm Intelligence Algorithms,
Theory and Applications”, Elsevier, Academic Press, 2020.
2. Elaine Rich, Kevin Knight, Shivashankar B Nair., “Artificial Intelligence”, 3rd Edition,
McGraw Hill Education, 2017.
3. Charu C. Aggarwal, “Data Classification: Algorithms and Applications”, CRC Press,
2014.
Mode of Evaluation: CAT, Assignment, Quiz and FAT
Recommended by Board of Studies 26-07-2022
Approved by Academic Council No. 67 Date 08-08-2022
Proceedings of the 67th Academic Council (08.08.2022) 1691
