Superior University Lahore

Faculty of Computer Science & Information Technology

Course Outline
Course Course Title Artificial Intelligence
Information Course ID CAI601150 Course Type Computing Core
Credit hours 3 Hours per week (C- 3
L)
Programs BS (SE) Preferred Semester 5
Date 2022-01-07 Version 2.0
Offered Programs BS (SE) Semester Session Spring 2022
Course Instructor(s) Ms. Tayyaba Farhat TA / Junior Lecturer
Information
Course This course is designed to give introduction to the basic knowledge about artificial intelligence, intelligent agents,
Description problem solving, and learning methods. Upon completion of this course, students should be able to develop
intelligent systems by assembling solutions to concrete computational problems. This course will introduce the
basics of artificial intelligence (AI), its scope and application domain. The course will also cover topics such as
intelligent agents, searching methods, machine learning, clustering, classification and natural language processing.
Assignments and project will be given to enable the student to gain practical experience by using intelligent
techniques. This course will also cover some tools related to Artificial Intelligence.

Course The objective of this course is to enable students;

Objectives No. Objective Relation with
Program
Objectives
1. To introduce the basic principles, techniques, and applications of PO 2, 6
Artificial Intelligence
2. Become familiar with basic principles of AI toward problem PO 1,2,6
solving, searching, and learning
3. Investigate applications of AI techniques in intelligent agents, PO 1,2,6
expert systems, artificial neural networks and other machine
learning models
4. Experience AI development tools such as an ‘AI language’, PO 1,6
expert system shell, and/or data mining tool
5. Explore the current scope, potential, limitations, implications and PO 1,2,6
future trends of intelligent systems.

Course At the end of this course students will be able to demonstrate;

Learning No. Outcome Domain BT Level Relation
Outcomes with PLO
(CLO) 1. Understand key components in the field of Cognitive C2 PLO 2
artificial intelligence
2. Implement classical artificial intelligence Cognitive C3 PLO 1
techniques
3. Analyze artificial intelligence techniques for Cognitive C4 PLO 3
practical problem solving PLO 5

Lecture type Lecture, Videos, Case Studies

Prerequisites Fundamental of Algorithms, Data Structures
Follow up -
Courses

Course Python, Jupyter Notebook, Google Colab

Software
Page 1 of 4
or Tool
Textbook Title Edition Authors Publisher Year ISBN
Artificial Intelligence: A Modern 3rd Edition Stuart Prentice ISBN-13: 978-
Approach Russell, Hall. 0136042594
Peter
Norvig
References Artificial Intelligence: Structures and 6th Edition George F ISBN-13: 978-0-
Strategies for Complex Problem Solving. luger 321-54589-3

Assessment Assessment Weight Used to attain CLO Assessment Weight Used to attain CLO
Criteria Assignment 5% 1,2,3 Quiz 5% 1,2,3
(100%) Lab 20% Project / Presentation 10% 3
Attendance 0% Participation 0%
Mid Term 20% 1,2 Final 40% 2,3
Methods of Minute paper, Case Study, Quiz, Assignment, course embedded questions, Project Presentation
Evaluation
Notes

Week Topic Lectur Lecture Contents Relation with

No. e No. CLO
W1. Introduction of L1.
− Introduction, History of AI, Turing Test 1
Artificial L2. 1
Intelligence − Applications of AI in different domains and Future
trends of AI
W2. Intelligent L3.
− Agent, Intelligent Agents, Structure of Intelligent 1
Agents L4. 1
Agents, Rational Agents, Agent Types,
− Environment Types, PEAS,
− Simple reflex agents, Goal-based agents,
−
W3. States Space & L5. 1
L6. Model based agents and Utility-based agents 2,3
Searching
(uninformed) − State space, Problem solving as search, Problem
space with examples of Water Jug Problem,
Missionaries and cannibals,
− Depth First Search,

− Breadth First Search,

− Uniform Cost Search,

−
W4. Uninformed L7. 3
L8. Iterative Deepening Search, 3
and Informed
Searching − Depth Limited Search,
Methods
− Bidirectional Searching

− Heuristic Functions,

− Informed Searching Methods

 − Best First Searching,

−
W5. Informed L9. 3
L10. Informed Searching Methods 3
Searching
Methods − A* Searching implementation with example

− Local Searching Methods

− Beam Search

−
W6. Informed L11. 3
Hill Climbing Searching
Searching
L12. 3
Methods − Simulated Annealing

− Genetic Algorithms

−
W7. Comparison of L13. 3
Comparison of Searching Methods
Searching
L14.
− Revision

−
W8. Game playing L15. 3
Game playing, Game trees,
L16.
− Adversary searching methods (Min-Max & Alpha- 3

beta pruning
−
W9. Mid Term Exam L17.
Mid Term Examination
Week
L18.

−
W10. Machine L19. 1
Introduction to Machine Learning and its
Learning
L20. Application 1

− Types of Machine Learning

− Steps of a Machine Learning Project

−
W11. Machine L21. 2,3
Data Collection and Preparation
Learning
L22. 2,3
− Data Gathering,

− Evaluation Schemes
− Performance Measures
−
W12. Machine L23. 2,3
Bayesian classifiers
Learning
Algorithms L24. − Decision Trees 2,3

−
W13. Artificial L25. 2,3
Introduction to Artificial Neural Network
Neural
L26. 2,3
Network − Multi-layer Perceptron (MLP)

−
W14. Expert Systems L27. 3
Expert Systems and its Application
& NLP
L28. 3
− Introduction of Natural Language Processing
 (NLP)
−
W15. Deep Learning L29. 3
Deep Learning
L30. − Convolutional Neural Network 3

− Deep Learning Implementation

− Auto-encoder
−
W16. Project L31. 3
Project Presentations
Presentation
L32. 1,2,3
− Revision
−
W17. Final Examination
Final exam
Week

CLO-PLO MAPPING:

CLO
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8
PLO

✔
CLO1
O

CLO2 ✔

CLO3 ✔ ✔