Scribd
Upload
34 views3 pages

CACS 410 Artificial Intelligence VII Semester Elective BCA Syllabus

The document describes an Artificial Intelligence course covering fundamental AI concepts like problem solving, knowledge representation, neural networks, machine learning, and expert systems. The course contains 6 units covering introduction, problem solving methods, knowledge representation and reasoning, learning, neural networks and natural language processing, and expert systems and machine vision.

Uploaded by

Magneto Eric Apollyon Thorn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
34 views3 pages

CACS 410 Artificial Intelligence VII Semester Elective BCA Syllabus

The document describes an Artificial Intelligence course covering fundamental AI concepts like problem solving, knowledge representation, neural networks, machine learning, and expert systems. The course contains 6 units covering introduction, problem solving methods, knowledge representation and reasoning, learning, neural networks and natural language processing, and expert systems and machine vision.

Uploaded by

Magneto Eric Apollyon Thorn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

t

t
Course Name: Artificial Intelligence (3 Cr.)
Course Code: CACS410
Year/Semester: IV/VII
Class Load: 5 Hrs. / Week (Theory: 3Hrs. practical: 2 FIrs.)

Course Description: The course introduces basics of artificial intelligent. It covers fundamental
concepts artificial intelligence, problem solving" hrrowledge representation, neural networks,
machine learning, natural language processing, machine vision and expert systems.

Objective:
The objective of this course is to introdlice the basic princ,iples, techniques, and applications
of
Artificial Intelligence. upon the completion students will be able to:
' Gain fundamental concepts of principles of AI toward problem solving, inference,
perception, knowledge representation, and Iearning.
r Investigate applications of AI techniques in experl systems, artifrcial neural networks and
other machine learning models.

Course Contents:

UNIT 1: INTRODUCTION
[6 Hrs.]
1.1 intelligence. Intelligent behavior, Artificial Intelligence, Understanding AI
baied on
thought process and behavior, Hard vs. Strong AI. So1't vs. weali AI
1.2 Foundations of AI
1.3 Applications of AI
1'4 Intelligent Agents: Introduction of agents, Structure of Intelligent agent, properties
of
Intelligent Agents,PEAS description of Agents, I'ypes of Agents: Simple Reflexive,
Model Based, Goal Based, Utility Basecl, Learning agent, Environment Types:
Deterministic, Stochastic, Static, Dynamic, Observablc, Semi-observable, Single Agent,
Multi Agent

UNIT 2:PRollLEM SOLVING METHODS [t2Hrs.]


2.1Definition of a Problem, Problem as a state space representation, Problem formulation,
Well-deflned problems,Constraint satislaction problem. Water jug problem,N-eleen
problem. Cry,ptarithmetic problem. Graph coloring pr.oblem
2.2 Problem solving by searching, t)'pes o1' scarching. MeasLrring problem solving
performance, General State Space Search
2.3 Uninformed:Breadth-First Search, Depth-First Search,Depth-Limited
Search, Iterative
Deepening depth first Search, Bidirectional Search" Using uninformed search
techniques
for solving N-Queens Problem, puzzle problem etc.
2.4 Infburecl search:Greedy Best-First Search.A Search, Optimality, of A*,
'' Local search:
FIil1 Climbing. Simulated Annealing, lJsing infbrmccl search techniques for solving
N-
Queens Problem, Puzzle problem etc.

i-r !,.'=', It \
E,j
*\.,.
/'!;fd'. .'
s .qgt.-, ,i:.i.
,t; "qh ,' :''
Y:" -*
+rt^
% ,r,-" Bh\
rS* rYi>-r.-'.-.
-/}\ tirrj

S 'qry';. . '
PFrqqd(
2.5 Game Playing, Optimal Decisions in Games, Alpha - Beta Pruning, Minimax Algorithm,
Tic-Tac -Toe Problem, Stochastic Games

UNIT 3: I(NOWLEDGE REPRESENT;\TION AND REASONING[15IIrs.]


3.1 Definition and importance of Knowledge, Issues in I(nou,ledge Representation,
Iftror,i'ledge Representation Systems. Properties of Knowledge Representation Systems,
Types of Knowledge, The Role of Knowledge
3.2 Knou,ledge representation techniques: Rule Based, Semantic Nets. Frames, Logic based
3.3 Propositional Logic, Syntax and Semantic of propositional logic,Proof by Resolution,
Conjunctive Normal Form (CNF). Resolution Algorithm,Limitations of Propositional
Logic. Forward and Backward Chaining
3.4 Predicate Logic, FOPL, Syntax. Semantics. Qr"rantification. horn clauses, Inference w th
FOPL: B,v converling into PL (Existcntial ar.rc'l uni'n'ersal instantiation). Rules of inference,
Unification and lifting, CNF for FOPI-, inf.erence r-rsing resolution. Resolution Refutation
System (RRS)
3.5Handling Uncertain Knowledge. I{adom Variablcs. Prior zrnd Posterior Probability,
Inlerence using Full Joint Distributiorl, llerycs' Rr-r1e and its use, Bayesian Networks,
Reasoning in Bayesian Netu,orks

UNIT 4: LEAITNING [4 Hrs.]


4.1 Concepts ofmachine learning
4.2 Rote learning, learning by analogy, inductive learning, Explanation based learning,
Supervised and unsupervised leaming.learning b-v evolution (genetic algorithm)

UNIT 5: NEUILAL NETWORKS AND NATURAL LANGUAGE PROCESSING [7Hrs.]


5.1 Intlodr-rction to artificial neural network,Mathematical model o1'neural network, types of
neltral netr,vork: feed-forward, feed-back,Gate realization using neural network, Learning
in neural netr,vorks: Back plopagation aigorithm,l{opfie1cl netrvork, Boltzmann machines
5.2 Concepts of natural language understanding and natr:ral language generation, Steps in
natural language processing, Syntax zuralysis, Sentantic anerI1,'sis, Pragmatic analysis

UNIT 6: EXPERT SYSTEM AND MACHINE VISION [,1 Hrs.]


6.i Expert System, Architecture olan exper1 systerrr. Srages of expert systems development
6.2 Concept of Machine Vision. Steps of machine vjsion, application of machine

/.?
q rfo{fl
..-+

stftE(
Laborafory work:
Laboratorl"exercises can be conciucted in LISP, PRol.oG
or.rnv other-high level programming
language' Laboratory exercises must cover theconcepts
ol ruie basecl intelligent agents, inference
and reasoning.searcir techniques, neural networks.
etc.for solving practical problems.

Reference Books:
1' Stuart Russel and Peter Norvig, Artifrcial lntelligence A
Mociern Approach, pearson
2' E' Rich' K. Knight, Shivashankar R. Nair, Artificial Inteiligence.
Tata McGraw Hill.
3' Geolge F' Luger, Artificial Intelligence: Struotures ancl Strategies fbr Complex problem
Solving, Benj amin/Cummings pubiication
4' D' W' Patterson, Artificial Intelligence and Expert Systerns, preltice
Hall.
5. P. H. Winston, Artificial Intelligence, Addison Wesie\,.

s-
*d
flre

You might also like