Annexure ‘CD – 01’
FORMAT FOR COURSE CURRICULUM
L T P/S SW/FW No. of TOTAL
PSDA CREDIT
Course Title: Artificial Intelligence Credit Units:05 UNITS
3 - 2 2 3 5
Course Level: UG Course Code: CSE 401
Course Objectives:
To develop semantic-based and context-aware systems to acquire, organize process, share and use the knowledge embedded in multimedia content. Research
will aim to maximize automation of the complete knowledge lifecycle and achieve semantic interoperability between Web resources and services. The field of
Robotics is a multi-disciplinary as robots are amazingly complex system comprising mechanical, electrical, electronic H/W and S/W and issues germane to all
these.
Pre-requisites:
Basic Knowledge of Programming Language, Problem solving Technique
Course Contents/Syllabus:
Weightage (%)
Module I Scope of AI & Problem Solving 20%
Descriptors/Topics
Introduction to Artificial Intelligence. • Applications- Games, Theorem proving, Natural language processing, Vision and speech processing,
Robotics, Expert systems. • AI techniques- search knowledge, Abstraction • State space search, Production systems • Search space control:
depth-first, breadth-first search. Heuristic search - Hill climbing, best-first search, branch and bound. Problem Reduction, Constraint
Satisfaction End, Means-End Analysis
Module II Knowledge Representation 20%
Descriptors/Topics
Knowledge Representation issues • first order predicate calculus • Horn Clauses • Resolution, • Semantic Nets, Frames • Partitioned Nets •
Procedural Vs Declarative knowledge • Forward Vs Backward Reasoning.
Module III Understanding Natural Languages 20%
Introduction to NLP • Basics of Syntactic Processing, • Basics of Semantic Analysis • Basics of Parsing techniques • context free and
transformational grammars • transition nets • augmented transition nets • Conceptual Dependency • Scripts • Basics of grammar free analyzers •
Basics of sentence generation and translation.
Module IV Expert System and Learning 20%
Descriptors/Topics
Expert System: Need • Justification for expert systems • knowledge acquisition • Case studies: MYCIN, RI. • Learning: Concept of learning •
learning automation • Learning by inductions, Handling Uncertainties: Non-monotonic reasoning • Probabilistic reasoning • Use of certainty
factors • Fuzzy logic
Module V Introduction to Robotics 20%
Descriptors/Topics
Robotics – Introduction , Architecture • Robot Kinematics: Position Analysis • Trajectory Planning • Sensors and vision system • Application of
Robotics • Features of Robotics
Student Learning Outcomes:
• Graduates will have an ability to analyze a problem, and identify and define the computing requirements appropriate to its solution.
• Graduates will have an ability to design, implement, and evaluate a computer-based system, process, component, or program to meet desired needs
• Graduates will have an ability to analyze the local and global impact of computing on individuals, organizations, and society.
• Graduate will have an ability to use current techniques, skills, and tools necessary for computing practice.
• Graduates will have an ability to apply design and development principles in the construction of software systems of varying complexity.
Pedagogy for Course Delivery:
The class will be taught using theory and case based method. In addition to assigning the case studies, the course instructor will spend considerable time in
Understanding the concept of innovation through the eyes of the student. The instructor will cover the ways think innovatively liberally using thinking
techniques
List of Professional Skill Development Activities (PSDA):
i. Minor Project
ii. Group Presentation
iii. Quiz
Lab/ Practicals details, if applicable:
List of Experiments:
Write a program to implement A* algorithm in python
Write a program to implement Single Player Game
Write a program to implement Tic-Tac-Toe game problem
Implement Brute force solution to the Knapsack problem in Python
Implement Graph coloring problem using python
Write a program to implement BFS for water jug problem using Python
Write a program to implement DFS using Python
Tokenization of word and Sentences with the help of NLTK package
Design an XOR truth table using Python
Study of SCIKIT fuzzy
Assessment/ Examination Scheme:
Theory L/T (%) Lab/Practical/Studio (%)
80% 20%
Theory Assessment (L&T):
Continuous Assessment/Internal Assessment End Term
(40%) Examination
(60 %)
Components Attendance Class Assignment Case Minor Quiz Group
(Drop down) Test Study Project presentation
Linkage of PSDA 4 3 3
with Internal
Assessment
Component, if any
Weightage (%) 5 10 7 8 60
Lab/ Practical/ Studio Assessment:
Continuous Assessment/Internal Assessment End Term Examination
(40 %) (60 %)
Components (Drop down Lab record Performance Viva Attendance Practical Viva Total
Performance
Weightage (%) 10 15 10 5 30 30 60
Text Reading:
E. Rich and K. Knight, “Artificial intelligence”,
N.J. Nilsson, “Principles of AI”, Narosa Publ. House
John J. Craig, “Introduction to Robotics”, Addison Wesley publication
D.W. Patterson, “Introduction to AI and Expert Systems"
