COURSE OUTLINE

SCHOOL OF ENGINEERING AND APPLIED

SCIENCES (SEAS)

Artificial Intelligence (CS 415)

BS Computer Science / BS Software Engineering
Fall 2017 Semester
Faculty: School of Engineering and Applied Sciences (SEAS)
Credit hours: 3 (Coursework)
Course level: Undergraduate
Campus/Location/Instruction GIFT University/On Campus/In Person
Mode:
Course Convenor: Muhammad Shakeel
m.shakeel@gift.edu.pk
Pre-requisite: CS204 / CS-214 (Data Structures and Algorithms)
Timing: Mondays and Tuesdays (2:50pm to 4:05pm)
Laboratory hours: None
Consultation hours: All weekdays except Fridays.
Core/Elective: Elective
This document was last October 23, 2017
updated:

COURSE OBJECTIVES
In this course, you will learn the fundamental concepts of Artificial Intelligence (AI) and apply
them to the design and implementation of intelligent agents that solve real-world AI problems,
including problems in search, games, planning, learning, logic, and constraint satisfaction.
We will provide a broad understanding of the basic techniques for building intelligent computer
systems. Topics include the history of AI, intelligent agents, state-space problem
representations, uninformed and heuristic search, game playing and adversarial search, logical
agents, constraint satisfaction problems, along with techniques in learning and other
applications of AI, such as natural language processing (NLP).

Page 1 of 4
LEARNING OUTCOMES
The following course learning outcomes would be achieved by students upon a successful
completion of this course:
Understand different types of AI agents.
Know various AI search algorithms (uninformed, informed, heuristic, constraint
satisfaction).
Understand the fundamentals of knowledge representation.
Know how to build simple knowledge-based systems.
Demonstrate working knowledge of reasoning in the presence of incomplete and/or
uncertain information.
Ability to apply knowledge representation, reasoning, and learning techniques to real-
world problems.

TEXT AND REFERENCE BOOKS

Stuart Russell & Peter Norvig, Artificial Intelligence: A Modern Approach, 3rd ed.
Prentice Hall, 2009.
Online Book Resources: aima.cs.berkeley.edu
Handouts and slides shall be provided as needed.

COURSE ORGANIZATION
There will be 28 lectures of 75 minutes each during the semester. The assessment details are
as under:

Item Assessment Task Weightage

1. Assignments 20%
2. Quizzes 15%
3. Midterm 25%
4. Final Examination 40%

Students must complete each component of the assessment to the satisfaction of the course
instructor, and achieve an overall mark of at least 40% in order to pass the course. All
components of the above assessment are compulsory, and must be completed in order to obtain
a pass grade. Students are expected to perform satisfactory in each item.
Late Submissions / Missed Quizzes: There will be no-retake of any missed quiz. A total of
one late days could be provided and could be used in case any graded homework assignment is
given.
Coming Late to Lectures: The instructors reserve the right to not allow late comers to attend
the lecture.

Page 2 of 4
COURSE OUTLINE AND TENTATIVE LECTURE PLAN
SESSIONS TOPICS TEXT
2 Introduction: The big Picture RN-CH01
Introduction to course and outline
What is AI? [Thinking humanly and
Rationally] AI Foundation and History
2 Intelligent Agents RN-CH02
Agents and Environments Quiz-1
Agent Structures [program, reflex, model-based, goal based,
utility, learning]
3 Problem Solving by Search [Uninformed RN-CH03
Search] Problem solving agents, problem Quiz-2
formulation, examples Assignment-1
breadth first search, depth first search, depth limit search,
iterative deepening search, bidirectional search Graph Examples
Discussion
3 Problem Solving by Search [Informed Search] RN-CH04
Difference between uniformed and informed search, strategies, Quiz-3
best first search, greedy search, A* search, properties of A* Assignment-2
search, memory bounded search, IDA*, Heuristics
2 Probability in AI Handout
Probability concepts, Bayes Rule, Independence, Conditional Quiz-4
dependence.
3 Logical Agents: Knowledge Base Systems, Wumpus World, RN-CH07
Logic, Propositional Logic, Knowledge Base, Inference, Quiz-5
Reasoning, Resolution, Forward Chaining, Backward Chaining Assignment-3
1 MID TERM EXAM
2 First Order Logic: Model of FOL, terms, atomic sentences, RN-CH08
quantifiers, Wumpus world example, KE in FOL Quiz-6
2 Inference in FOL: Unification, Forward chaining, Backward RN-CH09
chaining Quiz-7
Assignment-4
3 Learning Agents: Learning from observations RN-CH18
Inductive What is learning (supervised, unsupervised, Quiz-8
learning reinforcement), Inductive learning hypothesis, Assignment-5
hypothesis space, Ockhams Razor
Decision Classification, Decision Tree: ID3 (impurity
Trees measurement gain, noise, over fitting)

Ensemble Set of hypotheses, boosting

learning

Page 3 of 4
 3 Statistical Learning Methods RN-CH20
Bayesian Learning (Maximum posteriori, Maximum Quiz-9
Likelihood, Nave Byes) Instance based Learning (Nearest Assignment-6
neighbor) Neural Networks
2 Knowledge Representation RN-CH10
Quiz-10

2 Applications of AI: Natural Language Processing, Self-Driving

Cars, Image Classifiers

Please note: This is a proposed schedule only and may be varied at the discretion of the Course
Convener to give a greater or lesser degree of emphasis to particular topics.

ATTENDANCE
Excellent attendance is expected. University policy automatically assigns a WF grade if a
student misses 20% of the classes that are not excused.

CHEATING
"The act of plagiarism (unlawful copying of any form of intellectual ideas, thoughts, written
scripts, etc.) will be prosecuted. Cheating or copying from your peers on exam, quiz, or
homework is illegal and unethical and will consequently result in the student receiving
ZERO grade on that particular exam/assignment; resubmission WILL NOT BE
ALLOWED.

MOBILE PHONE USAGE

Usage of mobile phone is strictly prohibited in the class room. In case of mobile phone usage,
it will be dealt according to university policies.

Page 4 of 4