CS-424 Artificial Intelligence

Credit Hours 3 (2-1)

Program: BSCS Semester: VIII

Pre Requisite: Discrete Structures Follow Up: None

Course Description
This course gives basic knowledge about intelligence in computers. The knowledge representation
techniques and systems (e.g., expert systems. ANN, Fuzzy Logic, Semantics etc.) are discuss in detail.

Course Objectives
This course places emphasis on making machines think and learn like humans. The main objective of this
course is to make intelligent programs to deal with real time problems.

Learning Outcomes
On successful completion of this course students will:
Understand the logic and calculus behind artificial intelligence.
Be able to develop reasoning and logic to solve some real time problems.
Be able to built expert systems and other related programs using Prolog (AI Programming
Language).

Textbooks
Artificial Intelligence by Luger, 4th edition Pearson Education.
Russell and Norvig, Artificial Intelligence: A Modern Approach, 2 nded, Pearson Education.

Reference Books
Lecture Notes

Course Distribution Theory : 30%

Problem Analysis : 35%
Solution Design : 20%
Social and Ethical Issues : 5%

Marks Distribution Mid Term Test: 05 Marks, Assignment: 05 Marks, Paper: No Choice, 30 Marks,
02 hours
End Term Test: 05 Marks, Assignment: 05 Marks, Practical: 15 Marks, Paper:
No Choice, 35 Marks, 03 hours

Technology Involved
Multimedia

Practiced Techniques
Class Room Lecture, Presentations
Theory
Week Topic Recommendation of
Learning Activities
(Assignments, Quizzes,
Practical, Case study,
Project, Lab work or reading
assignment)

1 Introduction to Artificial Intelligence

History and its applications:- Attitude towards intelligence,
knowledge, and human artifice

2 AI Application Areas Assignment 1

Introduction to various applications areas and their details

3 Introduction to Predicate Calculus

Introduction, concept of prepositional calculus, examples.

4 Inference Rule Assignment 2

Introduction, Concept and examples

5 Unification Quiz 1
Definition, Rules, Example (Father Bill)

6 Search Techniques
Introduction to various data structures, search techniques for
state space search, concept of graph theory

7 Search Techniques Quiz 2

Depth-first Search, Breadth-First Search

8 Search Techniques
Best-First Search, Recursion-based search

Mid Term Exam

Week Topic Recommendation of
Learning Activities
(Assignments, Quizzes,
Practical, Case study,
Project, Lab work or
reading assignment)

9 Knowledge Representation
Introduction, various issues in KR

10 AI representational Systems Assignment 3

History, Introduction, Examples (Animal-Bird, Snow-Ice etc.)

11 Conceptual Graph
Introduction, network language, standardization, scripts, frames
etc.

12 Machine Learning
Introduction, Supervised Learning, Unsupervised Learning

13 Machine Learning Connectionist

Introduction, foundation concepts, connectionist network Quiz 3

14 Artificial Neural Networks

Introduction, Design, issues, Example

15 Artificial Neural Networks Assignment 4

Perceptron, learning, classification, activity level, examples

16 Artificial Neural Networks Quiz 4

Back Propagation Algorithm and learning

End term Exam

Lab Objectives
To practice by doing hands on exercises on components development and gain proficiency in various
aspects of professional application development.

Lab Outcomes
Becoming proficient in application development

Textbooks / Lab Manual

Artificial Intelligence by Luger, 4th edition Pearson Education.
Russell and Norvig, Artificial Intelligence: A Modern Aproach, 2 nded, Pearson Education.

Reference Books / Material

Technology Involved (Multimedia, Overhead Projector, Web, etc.)

Multimedia , Web

Practiced Techniques (Lab Lecture, Presentation, Workshop, Group Discussion, Survey, etc.)
Lab Lectures, Presentation, Individual and Group programming assignments
Lab

Week Topic Recommendation of

Learning Activities

1 Introduction to Prolog
Handling Visual Prolog IDE, some examples

2 Simple VP program, its various sections and their usage

3 Working with Predicates, adding facts and figures, Example

Program

4 Working with rules and inferences, Simple Program

5 Handling mathematical operations

6 Developing simple calculator Assignment

7 Search Techniques with examples

8 Searching with multiple GOALS

Mid Term Exam

Week Topic Recommendation of

Learning Activities

9 Handling composite statements including composite GOALS

10 Handling logic under various rules, To calculate the distance

between source and destination

11 Working with System Clock, Birth date program Assignment

12 List Processing, creation, addition, deletion of list elements

13 List Processing, searching, comparison of list elements

14 Finding and removing negative values from list

15 Identification of alphabets (small and upper case)

16 Input handling from user, simple program

End term Exam