Course Plan

A. Course Handout (Version 1.0) | Last updated on 3rd February, 2022

Institute/School Name Chitkara University Institute of Engineering and Technology

Department Name Department of Computer Science & Engineering
Programme Name Bachelor of Engineering (B.E.) - Computer Science & Engineering
Course Name Artificial Intelligence
Course Code CS180 Semester/Batch 4th/2020
L-T-P (Per Week) 2-0-0 Course Credits 02
Course Coordinator Name Dr. Kamal Saluja

1. Scope and Objectives of the Course:

Upon completion of this course, students will be able to do the following:

 Understand the role of knowledge representation, problem-solving techniques, and learning in

intelligent-systems engineering.
 Explore the mechanism that enables intelligent thought and action.
 Develop an intelligent system by combining solutions to concrete computational problems.
 Understand the use of artificial intelligence functionality to support real-time problem analysis.
 Develop an interest in the field sufficient to take more advanced subjects

2. Course Learning Outcomes:

After completion of the course, students will have demonstrated the ability to do the following:
CLO1: Describe the basic fundamental concepts of Artificial Intelligence, Agents, and Environment.
CLO2: Compare the traditional solutions to different problems and their expected AI-based solutions.
CLO3: Demonstrate the problem-solving methods with various AI-based technologies.
CLO4: Correlate the awareness of informed search and uninformed search techniques.
CL05: Design an AI-based problem-solving strategies for intelligent applications in the real world

CLO-PO mapping grid |Program outcomes (Pos) are available as a part of Academic Program Guide (APG) at

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

CLO1 H M H M M

CLO2 H M H M M M M

CLO3 H H H M

CLO4 H M M H

CLO5 H H M M H M

Artificial Intelligence/CS180 Page 1 of 7

 Course Plan

3. Recommended Books (Reference Books/Text Books):

B01: ‘Artificial Intelligence: A Modern Approach-2nd Edition’ by Stuart Russel, Peter Norvig, Pearson
Education
B02: 'Introduction to Artificial Intelligence & Expert Systems' by Dan W. Patterson, Englewood Cliffs, NJ,
1990, Prentice Hall International
B03: 'Artificial Intelligence’ by Elaine Rich, Kevin Knight, Shivashankar B Nair, McGraw-Hill
B04: 'Artificial Intelligence’, 3rd Edition by Patrick Henry Winston, paperback, 1992

4. Other readings and relevant websites:

S.No. Link of Journals, Magazines, Websites, and Research Papers

1. http://www.cs.utexas.edu/~novak/cs381kcontents.html
2. https://www.udacity.com/course/intro-to-artificial-intelligence--cs271
3. http://nptel.ac.in/courses/106105077
4. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-034-artificial-
intelligence-fall-2010

5. Course Plan:

Lecture Topics
Number
1 Introduction – Definition, Future of Artificial Intelligence
2-3 Characteristics of Intelligent Agents, Typical Intelligent Agents, Problem Solving Approach to
Typical AI problems
4-5 Problem-solving Methods, Search Strategies, A* algorithm, Uninformed, Informed, Heuristic
search Techniques: Hill Climbing, Iterative deepening DFS, bidirectional search, Local Search
Algorithms, and Optimization Problems
6-7 Searching with Partial Observations, Constraint Satisfaction Problems, Constraint
Propagation, Backtracking Search.
ST-1 (Lecture 1 – Lecture 7)
8-10 Game Playing, Optimal Decisions in Games, Alpha-Beta Pruning, Stochastic Games,
11-12 First Order Predicate Logic, Unification, Forward Chaining, Backward Chaining
13-14 The resolution, Knowledge Representation, Ontological Engineering, Categories and
Objects, Events, Mental Events, and Mental Objects
15 Reasoning Systems for Categories, Reasoning with Default Information
ST-2 (Lecture 8 – Lecture 15)
16-17 Probability basics, Bayes Rule and its Applications, Bayesian Networks, Exact and
Approximate Inference in Bayesian Networks, Hidden Markov Models
18-19 Forms of Learning, Supervised Learning, Learning Decision Trees, Regression and
Classification with Linear Models, Artificial Neural Networks
20-21 Nonparametric Models, Support Vector Machines, Statistical Learning, Learning with
Complete Data, Learning with Hidden Variables, Introduction to The EM Algorithm –
Reinforcement Learning
22 AI applications, Language Models, Information Retrieval, Information Extraction

Artificial Intelligence/CS180 Page 2 of 7

 Course Plan

23-24 Natural Language Processing, Machine Translation, Speech recognition

25-26 Robot, Hardware, Perception, Planning, Moving
ST-3 (Lecture 16 – Lecture 24)
ETE (Lecture 1 – Lecture 24)

6. Delivery/Instructional Resources:

Lecture Topic (s) PPT Industry Web Audio-

Numbers (link of ppts Expert References Video
on the Session(If yes:
central link of ppts on
server) the central
server)

1 Introduction – Definition, Future of http://cours https://y

Artificial Intelligence es.csail.mit. outu.be/
edu/6.034f/ TjZBTDzG
ai3/SOAR.pd eGg
2-3 Characteristics of Intelligent Agents, https://y
f
Typical Intelligent Agents, Problem outu.be/
Solving Approach to Typical AI problems TjZBTDzG
eGg
4-5 Problem-solving Methods, Search https://y
Strategies, A* algorithm, Uninformed, outu.be/
Informed, Heuristic search Techniques: gGQ-
Hill Climbing, Iterative deepening DFS, vAmdAOI
bidirectional search, Local Search
Algorithms, and Optimization Problems
6-7 Searching with Partial Observations, https://npte https://y
Constraint Satisfaction Problems, l.ac.in/cours outu.be/j
Constraint Propagation, Backtracking es/106/102/ 1H3jAAGl
Search. 106102220/ EA
8-10 Game Playing, Optimal Decisions in https://npte https://y
Games, Alpha-Beta Pruning, Stochastic l.ac.in/cours outu.be/
Games, es/106/102/ STjW3eH
106102220/ 0Cik
11-12 First Order Predicate Logic, Unification, https://y
Forward Chaining, Backward Chaining outu.be/
STjW3eH
13-14 The resolution, Knowledge 0Cik
https://y
Representation, Ontological outu.be/
Engineering, Categories and Objects, uXt8qF2Z
Events, Mental Events, and Mental zfo
Objects
15 Reasoning Systems for Categories, https://npte https://y
Reasoning with Default Information l.ac.in/cours outu.be/
es/106/102/ TjZBTDzG
106102220/ eGg

Artificial Intelligence/CS180 Page 3 of 7

 Course Plan

16-17 Probability basics, Bayes Rule and its https://ocw. https://y

Applications, Bayesian Networks, Exact mit.edu/cou outu.be/
and Approximate Inference in Bayesian rses/electric TjZBTDzG
Networks, Hidden Markov Models al- eGg
engineering-
18-19 Forms of Learning, Supervised Learning, https://y
and-
Learning Decision Trees, Regression and outu.be/
computer-
Classification with Linear Models, h0e2HAP
science/6-
Artificial Neural Networks TGF4
867-
machine-
20-21 Nonparametric Models, Support Vector learning-fall- https://y
Machines, Statistical Learning, Learning 2006/lectur outu.be/
with Complete Data, Learning with e-notes/ h0e2HAP
Hidden Variables, Introduction to The TGF4
EM Algorithm – Reinforcement Learning

22 AI applications, Language Models, https://y

Information Retrieval, Information outu.be/
Extraction h0e2HAP
TGF4
23-24 Natural Language Processing, Machine https://y
Translation, Speech recognition outu.be/
h0e2HAP
TGF4
25-26 Robot, Hardware, Perception, Planning, https://y
Moving outu.be/
h0e2HAP
TGF4

7. Action plan for different types of learners:

Slow Learners Average Learners Fast Learners
Remedial Classes on Saturday Doubt-sessions on Saturday Coding Competitions,
Project

8. Evaluation Scheme & Components:

Evaluation Type of Component No. of Weightage of Mode of

Component Assessments Component Assessment
Component 1 Formative Assessments (FAs) 04* 10% Online/Offline

Component 2 Subjective Test/Sessional Tests 03** 30% Online/Offline

(STs)
Component 3 End Term Examinations (ETE) 01 60% Online/Offline

Total 100%

* Out of 04 FAs, the ERP system automatically picks the best 03 FAs marks for evaluation of the FAs as final
marks.
** Out of 03 STs, the ERP system automatically picks the best 02 ST marks for evaluation of the STs as final
marks.

Artificial Intelligence/CS180 Page 4 of 7

 Course Plan

9. Details of Evaluation Components:

Evaluation Description Syllabus Covered Timeline of Weightage

Component (%) Examination (%)
Component 01 FA1 Up to 25% Week 5 10%
FA2 26%-50% Week 8
FA3 51%-75% Week 12
FA4 76%-100% Week 14
Component 02 ST 01 Up to 30% Week 7 30%

ST 02 31% - 70% Week 11

ST 03 71% - 100% Week 15

Component 03 End Term 100% 2nd Week of June 60%

Examination*
100%

* As per Academic Guidelines minimum of 75% attendance is required to become eligible for continuous
evaluation

Evaluation Components:

Type of Assessment Time of Total Question Paper Format

Conduction Marks
1 Mark 2 Mark 5 Mark 10 Mark
MCQ MCQ

Formative Assessment 1 Week 5 10 10 - - -

Sessional Test 1 Week 7 30 10 5 2

Formative Assessment 2 Week 8 10 10 - - -

Sessional Test 3 Week 11 30 10 5 2

Formative Assessment 3 Week 12 10 10 - - -

Formative Assessment 4 Week 14 10 10 - - -

Sessional Test 3 Week 15 30 10 5 2

End Term Examination 60 10 5 4 2

10. Syllabus of the Course:

Course: Artificial Intelligence (Theory) Course Code: CS180

Lecture Topic (s) No. of Weightage %
Number Lectures
1 Introduction – Definition, Future of Artificial Intelligence 1 30%

Artificial Intelligence/CS180 Page 5 of 7

 Course Plan

2-3 Characteristics of Intelligent Agents, Typical Intelligent Agents, 2

Problem Solving Approach to Typical AI problems
4-5 Problem solving Methods, Search Strategies, A* algorithm, 2
Uninformed, Informed, Heuristic search Techniques: Hill
Climbing, Iterative deepening DFS, bidirectional search, Local
Search Algorithms and Optimization Problems
6-7 Searching with Partial Observations, Constraint Satisfaction 2
Problems, Constraint Propagation, Backtracking Search

8-10 Game Playing, Optimal Decisions in Games, Alpha--Beta 3

Pruning, Stochastic Games
11-12 First Order Predicate Logic, Unification, Forward Chaining, 2
Backward Chaining
13-14 Resolution, Knowledge Representation, Ontological 2
Engineering, Categories and Objects, Events, Mental Events and 30%
Mental Objects
15 Reasoning Systems for Categories, Reasoning with Default 1
Information
16-17 Probability basics, Bayes Rule and its Applications, Bayesian 2
Networks, Exact and Approximate Inference in Bayesian
Networks, Hidden Markov Models
18-19 Forms of Learning, Supervised Learning, Learning Decision 2
Trees, Regression and Classification with Linear Models,
Artificial Neural Networks
30%
20-21 Nonparametric Models, Support Vector Machines, Statistical 2
Learning, Learning with Complete Data, Learning with Hidden
Variables, Introduction to The EM Algorithm – Reinforcement
Learning
22 AI applications, Language Models, Information Retrieval, 1
Information Extraction
23-24 Natural Language Processing, Machine Translation, Speech 1
recognition 10%
25-26 Robot, Hardware, Perception, Planning, Moving 1

B. Course Execution Plan (Faculty)

Lecture Topics (s) Date of Remarks

Number delivery (if any)
1 Introduction – Definition, Future of Artificial Intelligence
2-3 Characteristics of Intelligent Agents, Typical Intelligent Agents, Problem
Solving Approach to Typical AI problems
4-5 Problem-solving Methods, Search Strategies, A* algorithm, Uninformed,
Informed, Heuristic search Techniques: Hill Climbing, Iterative deepening
DFS, bidirectional search, Local Search Algorithms, and and Optimization
Problems
6-7 Searching with Partial Observations, Constraint Satisfaction Problems,
Constraint Propagation, Backtracking Search

Artificial Intelligence/CS180 Page 6 of 7

 Course Plan

8-10 Game Playing, Optimal Decisions in Games, Alpha-Beta Pruning, Stochastic

Games
11-12 First Order Predicate Logic, Unification, Forward Chaining, Backward
Chaining
13-14 The resolution, Knowledge Representation, Ontological Engineering,
Categories and Objects, Events, Mental Events, and Mental Objects
15 Reasoning Systems for Categories, Reasoning with Default Information
16-17 Probability basics, Bayes Rule and its Applications, Bayesian Networks,
Exact and Approximate Inference in Bayesian Networks, Hidden Markov
18-19 Models
Forms of Learning, Supervised Learning, Learning Decision Trees,
Regression and Classification with Linear Models, Artificial Neural Networks
20-21 Nonparametric Models, Support Vector Machines, Statistical Learning,
Learning with Complete Data, Learning with Hidden Variables, Introduction
to The EM Algorithm – Reinforcement Learning
22 AI applications, Language Models, Information Retrieval, Information
23-24 Extraction
Natural Language Processing, Machine Translation, Speech recognition
25-26 Robot, Hardware, Perception, Planning, Moving

This document is approved by:

Designation Name Signature

Course Coordinator Dr. Kamal Saluja
Head Academic Delivery Dr. Srikanta K Mohapatra
Cluster Dean Prof. (Dr.) Abhineet Anand
Dean Academic Affairs Prof. (Dr.) Rajnish Sharma
Date 03.02.2022

Artificial Intelligence/CS180 Page 7 of 7