National Computing Education Accreditation

Council
NCEAC

NCEAC.FORM.

COURSE DESCRIPTION FORM

INSTITUTION FAST School of Computing, National University of Computer
and Emerging Sciences, Islamabad
BS-CS Spring 2023

PROGRAM(S) TO BE EVALUATED

Course Description
(Fill out the following table for each course in your computer science curriculum. A filled-out form should
not be more than 2-3 pages.)

Course Code AI-2002

Course Title Artificial Intelligence
Credit Hours 3+1
Prerequisites by Data Structures (CS-2001)
Course(s) and Topics
Object Oriented Programming (CS-1004)
Assessment Lab, project, and assignments will cover the programming part of the course.
Instruments with
Weights (homework, Breakdown of Course Work (Total):
quizzes, midterms,
final, programming Midterm 2 30%
assignments, lab work, Quizzes 8 8%
etc.) Class participation 1 2%
Assignments 5 10%
Project 1 10%
Final 1 40%

Grading Policy Absolute grading

Policy about missed Retake of missed assessment items (other than midterms/ final exam) will not be held.
assessment items in For a missed midterm/ final exam, an exam retake/ pretake application along with
the course necessary evidence are required to be submitted to the department secretary. The
examination assessment and retake committee decides the exam retake/ pretake cases.
Course Plagiarism Plagiarism in project or midterms/ final exam may result in F grade in the course.
Policy Plagiarism in an assignment will result in zero marks in the whole assignments category.
Lab Instructors (if
any)
Mr. Muhammad Aamir Gulzar, Mr. Muhammad Usman
Course Coordinator Mr. Syed M Saad Salman
URL (if any)
Current Catalog This course introduces students to the basic knowledge representation, problem solving,
Description and learning methods of artificial intelligence. Upon completion, students should be able
to develop intelligent systems by assembling solutions to concrete computational
1
NCEAC.FORM.001.D
 National Computing Education Accreditation
Council
NCEAC

NCEAC.FORM.

problems; understand the role of knowledge representation, problem solving, and learning
in intelligent-system engineering; and appreciate the role of problem solving, vision, and
language in understanding human intelligence from a computational perspective.
Textbook (or
Laboratory Manual ● Artificial Intelligence: A Modern Approach, 3rd ed. S. Russell and P.
for Laboratory
Courses) Norvig, Prentice Hall, 2010.

● Artificial Intelligence: Structures and Strategies for Complex Problem Solving,

6th ed. G. Luger, Addison Wesley, 2009

● AI Algorithms, Data Structures, and Idioms in Prolog, Lisp and Java, G.

Luger and W. Stubblefield, Addison Wesley, 2009

● Artificial Intelligence: A Systems Approach. M. Tim Jones, Infinity Science

Press, 2008
Reference Material Supporting website: http://aima.cs.berkeley.edu
Course Learning
Outcomes
A. Course Learning Outcomes (CLOs)

On successful completion of this course students will have to know how of:
1. Understand the notions of rational behavior and intelligent agents.

2. Develop a general appreciation of the goals, subareas, achievements and

difficulties of AI.

3. Knowledge of methods of blind as well as informed search and ability to

practically apply the corresponding techniques.

4. General understanding of major concepts and approaches in knowledge

representation, planning, learning, robotics and other AI areas.

5. Developing programming skills for AI applications.

B. Program Learning Outcomes

For each attribute below, indicate whether this attribute is covered in this course
or not. Leave the cell blank if the enablement is little or non-existent.


2
NCEAC.FORM.001.D
 National Computing Education Accreditation
Council
NCEAC

NCEAC.FORM.

1. Computing Apply knowledge of mathematics, natural sciences,

Knowledge computing fundamentals, and a computing
specialization to the solution of complex computing
problems.

2. Problem Identify, formulate, research literature, and
Analysis analyze complex computing problems, reaching
substantiated conclusions using first principles of
mathematics, natural sciences, and computing
sciences.

3. Design/ Design solutions for complex computing problems
Develop and design systems, components, and processes
Solutions that meet specified needs with appropriate
consideration for public health and safety, cultural,
societal, and environmental considerations.

4. Investigation & Conduct investigation of complex computing
Experimentation problems using research based knowledge and
research based methods.

5. Modern Tool Create, select, and apply appropriate techniques,
Usage resources and modern computing tools, including
prediction and modelling for complex computing
problems.

6. Society Apply reasoning informed by contextual

Responsibility knowledge to assess societal, health, safety, legal,
and cultural issues relevant to context of complex
computing problems.

7. Environment Understand and evaluate sustainability and impact

and Sustainability of professional computing work in the solution of
complex computing problems.

8. Ethics Apply ethical principles and commit to professional

ethics and responsibilities and norms of computing
practice.

9. Individual and Function effectively as an individual, and as a
Team Work member or leader in diverse teams and in multi-
disciplinary settings.

10. Communicate effectively on complex computing

Communication activities with the computing community and with
society at large.

11. Project Demonstrate knowledge and understanding of

Management and management principles and economic decision

3
NCEAC.FORM.001.D
 National Computing Education Accreditation
Council
NCEAC

NCEAC.FORM.

Finance making and apply these to one’s own work as a

member or a team.

12. Life Long Recognize the need for, and have the preparation
Learning and ability to engage in independent and life-long
learning in the broadest context of technological
changes.

C. Mapping of CLOs on PLOs

(CLO: Course Learning Outcome, PLOs: Program Learning Outcomes)
PLOs
1
1 2 3 4 5 6 7 8 9 10 12
1
1      
C
L
2    
O
s
3      
4      
5       
Topics Covered in
the Course, with Topics to be covered:
Number of Lectures
on Each Topic No. of Contact
List of Topics
(assume 15-week Weeks Hours CLO(s)
instruction and one- Introduction to AI 1 3 1
hour lectures)
Intelligent Agents: Problem Solving 1 3 2,3,5
Tree Search, Graph Search,
BFS, DFS, 1 3 2,3,4,5
Greedy Search, UCS
A* Search,
Simulated Annealing
1 3 2,3,4,5
State Spaces,
Problems with Search
Genetic algorithms 2 6 2,3,4,5
Constraint Satisfaction Problems
Backtracking search for CSPs,
Problem structure and problem
2 6 2,3,4,5
decomposition,
Local search for CSPs,
Cryptarithmetic Problem.
Adversarial search Minimax and 1 3 2,3,4
alpha beta pruning,

4
NCEAC.FORM.001.D
 National Computing Education Accreditation
Council
NCEAC

NCEAC.FORM.

Intro to Machine Learning,

KNN, K-Means,
Hierarchal Clustering,
Fuzzy C-Mean,
Naive Bayes
Neural Networks: Perceptron,
Multilayer perceptron, 3 9 1,4,5
Backpropagation
Gradient Decent,
Intro to Reinforcement Learning, 2 6 2,3,4
Q-Learning
Project Presentations 1 3 1,2,3,4,5

Total 15 45
Laboratory
Projects/Experiments
Done in the Course
Programming Yes, All the assignments were programming based, the language should be python.
Assignments Done in
the Course
Class Time Spent on Theory (%) Problem Analysis Solution Design Social and Ethical
(in percentage) (%) (%) Issues (%)
50 25 20 5
Oral and Written Every student is required to submit at least __4__ written reports of typically __4-5_
Communications pages and to make __1___ oral presentation of typically __20___ minute’s duration.

Lab/ Practical Component of the course

Assessment Items
(Case Study/ Exercise
Weeks Contents/Topics
Assignment/
Quiz etc.)
Week-01 Introduction to Python Language Lab Task
OOP concepts, Lambda Functions, NumPy Lab Task
Week-02
Week-03 Intelligent Agents (Reflexive Agents) Lab Task
Week-04 Uninformed Searches (BFS, DFS, Tree search) Lab Task
Week-05 Informed Searches (A*, UCS) Lab Task
Week-06 Local Search Algorithms (Hill climbing, Simulated annealing) Lab Task
Week-07 Genetic Algorithm-1 Lab Task
Week-08 Genetic Algorithm-2 Lab Task
Week-09 Constraint Satisfaction Problems-1 Lab Task
Week-10 Constraint Satisfaction Problems-2 Lab Task
Week-11 Unsupervised Learning (Clustering) Lab Task
Week -12 Classification (KNN, Decision Trees, Naive Bayes) Lab Task
Week 13 Lab Task
Week-14 Neural Networks, backpropagation Lab Task
Week-15 Intro to Reinforcement Learning Lab Task
5
NCEAC.FORM.001.D
 National Computing Education Accreditation
Council
NCEAC

NCEAC.FORM.

6
NCEAC.FORM.001.D