University of Central Punjab

Faculty of Information Technology

INSTITUTION Faculty of Information Technology,

University of Central Punjab, Lahore

PROGRAM (S) TO BE
BSCS
EVALUATED

A. Course Description

Course Code CSAL3243

Course Title
Credit Hours
Prerequisites by Course(s)
and Topics
Assessment Instruments
with Weights (homework,
quizzes, midterms, final,
programming assignments,
lab work, etc.)
Course Instructor
Course Instructor Email
Artificial Intelligence
3 (3-0)
Date Structures and Algorithms
Discrete Structures
Quizzes 12%
Assignments 13%
Mid Term 35%
Final Term 40%
Dr. Muhammad Humayoun
dr.humayoun@ucp.edu.pk

Course Coordinator Dr. Muhammad Humayoun

Office Hours To be announced
Current Catalog Description This course provides an overview of the theoretical and practical
aspects of designing intelligent computer systems. Students are
expected to implement the concepts learned during the course using
standard and AI-specific programing languages and tools. The
following five modules are covered in the course.
 Introduction
 Search Techniques
 Knowledge representation and Logic
 Machine Learning
 Probabilistic Reasoning/Bayesian Networks
Textbook (or Laboratory Artificial Intelligence A Modern Approach – 3rd edition by Stuart
Manual for Laboratory Russell and Peter Norvig
Courses)

1
Reference Material Artificial Intelligence – 5th edition by George F. Luger
Artificial Intelligence Illuminated by Ben Coppin
Software Tools For programming assignments, students can use any standard
programming language (Ex. Java, C#, C++, Python, etc)

 SWI-Prolog (http://www.swi-prolog.org/)
 Weka (http://www.cs.waikato.ac.nz/ml/weka/)

Course Goals/Objectives Introducing students to the basic concepts and techniques of

Artificial Intelligence.
Learning AI by doing it, i.e. developing skills of using AI
algorithms for solving practical problems.
Know various AI search algorithms (uninformed, informed,
heuristic, genetic algorithms).
Understand the fundamentals of knowledge representation and
logic.
Ability to apply knowledge representation, reasoning, and machine
learning techniques to real-world problems.
Know how to build simple knowledge-based systems.

Topics Covered in the Attached

Course, with Number of
Lectures on Each Topic
(assume 15-week instruction
and one-hour lectures)
Programming Assignments Yes
Done in the Course
Class Time Spent on (in Theory Problem Solution Social and Ethical
credit hours) Analysis Design Issues
2 0.5 0.5
Oral and Written Four written assignments
Communications
Plagiarism Policy All the parties involved will be awarded Zero in first instance.
Repeat of the same offense will result in (F) grade.
Marks will be uploaded on portal and can be contested within a
week or would be considered final.

2
 LECTURES Lecture Topics Instruments
Lec#1:
AI Introduction Chapter#1
Week 1
Lec#2:
AI Introduction Chapter#1
Lec#3: Search Overview and
Strategies:
• Search space, State space,
Search Trees
• Examples (Missionaries and
Cannibals, Wolf Duck and
Farmer, 8-Puzzle problem, Tic Chapter#3
Week 2
Tac Toa, 8-Queens problem)

Problem formulation, State,

Space, Initial and Goal State,
Successor Functions, Objective
Functions, Goal Test, Goal Path
Lec#4: Uninformed Search Strategies:
Chapter#3 Quiz 1
Breadth First Search
Lec#5: Uninformed Search Strategies:
 Uniform Cost Search
Chapter#3
 Depth First Search
Week 3
Lec#6: Implementation details
(Breadth First Search,Uniform Assignment 1
Chapter#3
Cost Search,Depth First Search) published

Lec#7: Uninformed Search Strategies:

 Iterative deepening
Chapter#3 Quiz 2
 Depth Limited Search
Week 4
Lec#8: Implementation details
(Iterative deepening, Depth Chapter#3
Limited Search)
Lec#9: Informed Search Strategies:
 Heuristics, Heuristics
Function and Properties
Week 5  Greedy Best First Chapter#3 Assignment 1 due
Search,
 Branch and Bound and
improvements

3
 Lec#10: A* Search,
Monotonicity and Admissibility Chapter#3 Quiz 3
of Heuristics
Lec#11: A* continues
Chapter#3
Implementation details
Week 6 Lec#12: Local Search:
 Hill Climbing Search Chapter#4
 Implementation details
Lec#13: Assignment 2
Chapter#14
published
Basic Genetic Algorithms Ben Coppins
book
Quiz 4
Lec#14: Genetic Algorithm Continues
Week 7
Game Theoretic Search: Chapter#14
• Deterministic Games Ben Coppins
• Min-Max and Alpha-Beta book
Pruning

Lec#15:
Game Theoretic (contd) Chapter#5
Quiz 5
Week 8
Lec#16: Game Theoretic Search
Chapter#5 Assignment 2 due
Implementation
Week 9 Mid Term Week
Lec#17: Knowledge Representation
 Introduction
 Wumpus World Example Chapter#7
Week 10  Model Checking

Lec#18:  Propositional Logic Assignment 3

Chapter#7
 Inference, and Proofs published
Lec#19:
 First Order Logic (FOL) Chapter#8
Week 11
Lec#20:  First Order Logic
Chapter#8
continues
Lec#21: Prolog
Chapter#8 Quiz 6
Week 12
Lec#22: Prolog continues Assignment 3 due
Chapter#18
Lec#23:
Prolog continues Chapter#18
Week 13 Lec#24: Introduction to Machine learning
 Supervised Learning Chapter#18
 Bayes Rule
Lec#25: Bayes Rule (contd)
Week 14 Chapter#13 Quiz 7
Naïve Bayes Classifier
4
 Lec#26: Naïve Bayes Classifier (contd)
Chapter#13
Example: Play Tennis
Lec#27: Weka Demo
Play tennis example with weka Chapter#13
Week 15 Cancer example with weka
Lec#28: Unsupervised Learning
Chapter 18 Quiz 8
 Clustering with K-means
Lec#29:  Clustering with K-means
(cont) Chapter 18
Week 16  K-means in Weka
Lec#30:
Revision

Final Term