Scribd
Upload
3 views3 pages

AI Syllabus

The document outlines the course structure for 'Introduction to Artificial Intelligence' for III B.Sc Computer Science students for the academic year 2023-2024. It includes course objectives, detailed unit topics, expected outcomes, and mapping of course outcomes to program specific outcomes. Additionally, it lists textbooks and references for the course.

Uploaded by

apkbala107
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views3 pages

AI Syllabus

The document outlines the course structure for 'Introduction to Artificial Intelligence' for III B.Sc Computer Science students for the academic year 2023-2024. It includes course objectives, detailed unit topics, expected outcomes, and mapping of course outcomes to program specific outcomes. Additionally, it lists textbooks and references for the course.

Uploaded by

apkbala107
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

For the students who joined in the Academic Year 2023 – 24

III B.Sc Computer Science (Data Science and Analytics)

Semester V Batch 2023-2026

23DCS504
Introduction to
Course Code Course Name
Artificial Intelligence
End Semester
CIA Marks 25 75
Marks

Part III No. of Hours / Week 5

L T P C

5 0 0 4
COURSE OBJECTIVE
To enhance/develop students’ ability to understand the different techniques evolved to develop
Artificial Intelligence.

Hour Allotted: 60 Hrs


Unit- I: 12 hours
Introduction: What is Artificial intelligence? - The History of AI – The First Beginnings – The
New Connectionism – Reasoning under Uncertainty – AI Grow Ups – The AI Revolution– AI
and Transportation – Service Robotics –Knowledge Based System - Propositional Logic –Syntax
and semantics – Horn Clauses – Computability and Complexity – Applications and limitations.
Unit- II : 12 hours
First-Order Predicate Logic – Syntax & Semantic – Quantifiers and Normal Forms – Proof
Calculi – Resolution – Automated Theorem Provers – Mathematical Examples – Applications –
Limitations of Logic – The Search Space Problem – Decidability and Incompleteness – The
Flying Penguin – Modeling Uncertainity.
Unit- III : 12 hours
Search,Games and Problem Solving – Uninformed Search – Heuristic Search – Heuristic
Evaluation Functions – Reasoning with Uncertainity – Computing with Probabilities – An
Interface Rule for Probabilities – Maximum Entropy with Explicit Constraints –Conditional
Probability versus Material Implications – Software for Bayesian Networks – Development of
Bayesian Networks – Semantics of Bayesian Networks.
Unit- IV : 12 hours
Machine Learning and Data Mining – Data Analysis – The Perception, a linear classifier – The
Nearest-Neighbor Method – Two classes ,Many classes ,Approximation –Computation Times –
Decision Tree Learning – Learning of Bayesian Networks – The Naïve Bayes Classifier – One-
class Learning – Clustering.
Unit- V : 12 hours
Neural Networks – Hopfield Networks – Application to a pattern recognition – Neural
Associative Memory – Linear Networks with Minimal Errors - The Backpropagation Algorithm
– Support Vector Machines – Deep Learning – Reinforcement Learning – Uninformed
Combinatorial Search – Value Iteration and Dynamic Programming – A learning walking Robot
and its Simulation – Q Learning – Exploration and Exploitation – Curse of Dimensionality.

COURSE OUTCOMES:
At the end of the course, students will be able to
CO1: Understand and use the various search strategies based on the problem domain.
CO2: Apply various reasoning techniques to real world problems.
CO3: Analyze and apply the appropriate knowledge representation technique based on the
application.
CO4: Understand the usage of various AI Planning techniques.
CO5: Design and implement various learning models based on the problem requirements.
.

CO-PSO-PO MAPPING
PSO1 PSO2 PSO3 PSO4
CO1 2 2 2 2
CO2 2 2 2 2
CO3 1 1 1 1
CO4 1 1 1 1
CO5 1 1 1 1
Mapping 1.25 1.4 1.4 1.4
Strength
(Low-1; Moderate-2; High-3; No Correlation -)
P P P P P P P P P
PO PO PO PO PO PO
O O O O O O O O O
CO’s 10 11 12 13 14 15
1 2 3 4 5 6 7 8 9
CO1 2 2 2 2 2 2 2 2 2 2
- - - - -
CO2 2 2 2 2 2 2 2 2 2 2
- - - - -
CO3 1 1 1 1 1 1 1 1 1 1
- - - - -
CO4 1 1 1 1 1 1 1 1 1 1
- - - - -
CO5 1 1 1 1 1 1 1 1 1 1
- - - - -
Mappin
g
1.4 1.4 1.4 - - - - - 1.4 1.4 1.4 1.4 1.4 1.4 1.4
Strengt
h

(Low-1; Moderate-2; High-3; No Correlation -)

TEXTBOOK:
Wolfgang Ertel, “Introduction to Artificial Intelligence”, Second Edition, Springer International
Publishing, 2017
REFERENCE :
1. Stuart J. Russell, Peter Norvig, “Artificial Intelligence - A Modern Approach”, Fourth Edition,
Pearson Publishers, 2021.
2. Elaine Rich, Kevin Knight, Shivashankar B. Nair, “Artificial Intelligence”, Third Edition, Tata
McGraw-Hill Education, 2008.
3. DheepakKhemani, “A first course in Artificial Intelligence”, McGraw Hill Education Pvt Ltd.,
NewDelhi, 2013.
4. Steven Bird, Ewan Klein and Edward Loper, “Natural Language Processing with Python”,
O’Reilly, 2009, https://www.nltk.org/book/.

You might also like