Documente Academic
Documente Profesional
Documente Cultură
Semester
Course
Breakdown
Department of
Computer
Science
Course Objectives:
On completion of this module, students should be able to:
Demonstrate an understanding of the fundamental ideas of problem solving using AI.
Demonstrate an understanding of the fundamental ideas of Knowledge Representation and
Reasoning.
Demonstrate an understanding of the principles of a number of different approaches to machine
learning.
Demonstrate the ability to apply AI and Computational Intelligence techniques to a variety of
research and application projects.
Course Contents:
This course serves as an introduction to the techniques and applications of artificial intelligence (AI)
including a study of intelligent agents, search techniques, logical agents, knowledge representation
and reasoning formalisms, learning paradigms, Expert systems and some of machine learning
techniques like neural networks, genetic algorithms, Fuzzy logic, decision trees etc.
Recommended Books:
Text:
S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, Third Edition, Pearson
Education Series in AI
Reference:
Luger, George & Stubblefield, William, Artificial Intelligence: Structures and Strategies for
Complex Problem Solving (6th ed.),
Nils J Nilson, Artificial Intelligence A New Synthesis, Morgan Kaufman Publishers, Elsevier,
USA.
Introduction to PROLOG by P. Brna.
Patrick Henry Winston, Artificial Intelligence, Third Edition, Pearson Eucation Series in AI.
Ivan Bratko, PROLOG Programming for AI, Third Edition, Pearson Education Series in AI.
Grading Policy:
There will be an evaluation from theory and practical separately. Students are required to qualify both
(theory & practical) independently to pass the course.
Total Subject Marks: 60
Theory Marks: 40
Quizzes/Assignments :
08 marks
Mid Term
:
12 marks
Final Term (Theory) :
20 marks
Practical Marks: 20
Lab Reports
:
10 marks
Final Project
:
10 marks
Quizzes and Homework Assignments (HAs): 05 quizzes and 04 HAs shall be given for a 02-2
credit-hours course, evenly distributed over the length of a semester. The quizzes shall be unannounced
and of 10 minutes duration on the average. The graded quizzes shall be returned in the next lecture and
the graded HAs after a week. The HAs shall be solved independently by all students. Plagiarism is not
1
BSCS 6th
Semester
Course
Breakdown
Department of
Computer
Science
allowed; this will result in cancellation of the HA, in addition to reporting the matter to the management
for appropriate action.
Mid Semester Examination (MSE) and End Semester Examination (ESE): MSE and ESE will be
given in the middle and at the end of a semester, respectively, as instructed by the Examination
Branch (Ex Br).
Attendance Policy: 75 % attendance of students is mandatory for eligibility to appear in the ESE.
Students Hours
Monday: 1:00 pm 2:00 pm
Wednesday: 9:00 am 10:00 pm
Lecture Breakdown
Lecture
No.
Week 1
Lect. 1
Lab. 1
Week 2
Lect. 2
Lab. 2
Week 3
Lect. 3
Topics
Introduction to AI
Definition of AI
Typical AI problems
Practical Impact of AI
Approaches to AI
Limits of AI Today
AI History
Introduction to Agent + Lab Excercise
Agent Environment
Agent architectures
Problem Solving using Search
Introduction to State Space Search
State space search
Examples
Explicit vs Implicit state space
Uninformed Search + Lab Excercise
Search Strategies
Breadth-first, Depth-first, Bidirectional, Iterative-Deepening Search etc
Reasoning
Case Study
Informed Search Strategies
Introduction
Best First Search
Hill climbing
2
BSCS 6th
Semester
Lab. 3
Week 4
Lect. 4
Lab. 4
Week 5
Lect. 5
Lab. 5
Week 6
Lect. 6
Lab. 6
Week 7
Lect. 7
Lab. 7
Course
Breakdown
Department of
Computer
Science
BSCS 6th
Semester
Course
Breakdown
Week 8-9
Week 10
Lect. 8
Lab. 8
Week 11
Lect. 9
Lab. 9
Week 12
Lect. 10
Lab. 10
Week 13
Lect. 11
Lab. 11
Week 14
Department of
Computer
Science
Lect. 12
BSCS 6th
Semester
Course
Breakdown
Lab. 12
Week 15
Lect. 13
Lab. 13
Week 16
Lect. 14
Lab. 14
Week 17
Department of
Computer
Science
Introduction to Learning
Taxonomy of Learning Systems
Mathematical formulation of the inductive learning problems
Learning From Observations
Concept Learning
Lect. 15
Project Presentations
Lab. 15
Project Presentations
Week 18-19
Final Term