Meerut Institute of Engineering & Technology, Meerut

Department of Computer Science & Engineering

Course / Semester: B.tech 8th Semester
Subject Name: Artificial Intelligence (ECS-801) .

Faculty Name: Shilpa Pandey

S.No Topic covered
.

Periods Reference Tutorial Topics

s

Tut Lab work

Unit- Introduction
I
1

Introduction to Artificial
Intelligence

Foundations and
History of Artificial
Intelligence,
Applications of Artificial
Intelligence
Intelligent Agents

R1 pg no.8
1

1
4
5
6

Structure of Intelligent
Agents
Computer vision
Natural Language
Possessing

R1 pg no.
3

1
1
2

R1 pg
no.31
R1 pg
no.35
W1
R3 pg
no.227

Intelligence, Artificial
Intelligence,
Applications of AI,
History of AI
Performance
Measure, Agent
Environment, and
Agent Architecture,
Computer Vision

Searching for solutions

Uniformed search
strategies
Informed search
strategies, Local search
algorithms and
optimistic problems,
Adversarial Search

R2, pg
no.25

R3, pg
no.174

3.5

R2 pg
no.50

Introduction
to PROLOG
Language &
Programming

Natural Language
Processing

Unit- Introduction to Search

II
7

Problem, Problem
Space, Informed and
Uniformed Search,
Breadth- first and
depth first Search
Hill Climbing,
problems in Hill
climbing, Best First
Search, A* and AO*
search, Alpha beta
pruning

Program in
prolog to
append list
1 and bubble
sort.

1 Implementati
on of Depth
first search.

Hill Climbing,
problems in Hill
climbing, Best First
Search, A* and AO*
search, Alpha beta
pruning

10

R2 pg
Search for games,
1.5
no.231
Alpha - Beta pruning
Unit- Knowledge Representation & Reasoning
III
11

Propositional logic

12

Theory of first order

logic, Inference in First
order
logic
Forward
& Backward
chaining
Resolution

13
14
15
16
17

Probabilistic reasoning,
Utility theory
Hidden Markov Models
(HMM)
Bayesian Networks

R1 pg
no.151

R1 pg
no185

R1 pg
no.272

R1 pg
no.277

R2 pg
no.172

1 Implementati
on of Depth
first search.

Predicate Logic ,
Semantic Net,
Structured analysis

1 Implementati
on of Breadth
first search

Inference Rule,
Resolution Proofs,
Probability and
Bayes theorem
Problems

Solving
Family
1
relations
clauses using
predicate
logic

1
2

R2 pg
no.179

R2 pg
no.347

R1 pg
no.531

R1 pg
no.525

R1 pg
no.588

HMM
Bayesian Network

0.5

Unit- Machine Learning

IV
18
19
20
21
22
23

Supervised and
unsupervised learning
Decision trees
Statistical learning
models
Learning with complete
data - Naive Bayes
models
Learning with hidden
data EM algorithm
Reinforcement learning

2
1

R1 pg
no598

Learning in problem
Solving

Passive learning in
Known environment,
Passive learning in
unknown
environment

Finding the
edges of
0.5 length 2 or (n)
in a given
graph.

1
Implementati
on of Travel
salesman
problem

Unit- Pattern Recognition

V
24

Introduction, Design
principles of pattern
recognition system

W2
3
Introduction,
approaches to
Pattern recognition,
Component of PR
system, PCA and
LDA Discussion

1
Implementati
on of Tower
of Hanoi
problem

25

26

27

Statistical Pattern
recognition methods Principle Component
Analysis (PCA) and
Linear Discriminant
Analysis (LDA),
Classification
Techniques Nearest
Neighbor (NN) Rule,
Bayes
Classifier
Support
Vector Machine
(SVM), K means
clustering
Total No of Lectures

W3
2

Introduction,
approaches to
Pattern recognition,
Component of PR
system, PCA and
LDA Discussion

1
Implementati
on of Tower
of Hanoi
problem

W4
3
2

W5

Bayes Classifier, KNN rule, Nearest

Neighbor rule, Kmean clustering
Problems

45

1 Implementati
on of Monkey
banana
problem
9

Text books References

R1: Stuart Russell, Peter Norvig, Artificial Intelligence A Modern Approach, Pearson
Education
R2: Elaine Rich and Kevin Knight, Artificial Intelligence, McGraw-Hill
R3: Dan W. Patterson, Artificial Intelligence and Expert Systems, Prentice Hall of India

Web references :
W1 : http://www.ecse.rpi.edu/~qji/CV/3dvision_intro.pdf
W2: cmp.felk.cvut.cz/~xfrancv/talks/franc-printro03.ppt
W3: www.cse.unr.edu/~bebis/CS679/Lectures/PCA_LDA_Case_Studies.ppt
W4: http://www.robots.ox.ac.uk/~dclaus/digits/neighbour.htm
W5: http://www.dtreg.com/svm.htm

Meerut Institute of Engineering & Technology, Meerut

LECTURE PLAN
Course / Semester: B.tech 7th Semester
Subject Name: (ECS-075) DATA MINING AND DATA WAREHOUSING
Faculty Name: Anuradha
Unit
Distribution
1.1
1.2
1.3
1.4
1.5
1.6
1.7
1
1.8
1.9
1.1

Topic Covered

co 1

Overview, Motivation(for Data Mining),Data MiningDefinition & Functionalities

Data Processing, Form of Data Preprocessing

co2

co 4

Y
Y

Data Cleaning: Missing Values, Noisy Data, (Binning,

Clustering, Regression) Inconsistent Data

Data Integration &Transformation Data Reduction

Data Cube aggregation

Dimensionality reduction Numerosity Reduction,

Clustering, Discretization and Concept hierarchy
generation

co 3

2.1
2.2

2.3
2.4
2

2.5
2.6

2.7

2.8

Concept Description:- Definition, Data Generalization

Analytical Characterization, Analysis of attribute
relevance
Mining Class comparisons, Statistical measures in
large Databases Measuring Central Tendency
Measuring Dispersion of Data, Graph Displays of
Basic Statistical
class Description, Mining Association Rules in Large
Databases,

Association rule mining, mining SingleDimensional Boolean Association rules from

Transactional Databases Apriori algorithm

Mining Multilevel Association rules from Transaction

Databases and Mining MultiDimensional Association rules from Relational
Databases

2.8

3.1
3.2
3.3
3.4

3.5
3
3.6

Mining Multilevel Association rules from Transaction

Databases and Mining MultiDimensional Association rules from Relational
Databases

Classification and Predictions:What is Classification &

Prediction,
Issues regarding Classification and prediction,
Decision tree
Back propagation Algorithm, Classification methods

Y
Y
Y

K-nearest neighbor classifiers Genetic Algorithm.

Y
Cluster Analysis:Data types in cluster analysis,
Categories of clustering methods, Partitioning
methods.
Hierarchical. Clustering- CURE and Chameleon,
Density Based Methods-DBSCAN, OPTICS

Grid Based Methods- STING, CLIQUE,

3.7

3.8

Model Based Method Statistical Approach, Neural

Network approach, Outlier Analysis
Y

4.1

Data Warehousing: Overview, Definition, Delivery

Process

Difference between DatabaseSystem and Data

Warehouse Architecture & functioning

4.2
4

4.3
4.4
4.5
4.6

5.1
5.2
5.3
5.4
5.5
5.6

Multi Dimensional Data Model, Data Cubes, Stars,

Snow Flakes,Fact Constellations

Concept hierarchy, Process Architecture, 3 Tier

Architecture, Data Marting
Aggregation, Query Facility, Introduction to OLAP

Y
Y
Y

OLAP function and Tools. OLAP Servers

ROLAP, MOLAP, HOLAP
Data Mining interface, Security, Backup and Recovery
Tuning Data Warehouse, Testing Data Warehouse

Y
Y

COURSE OUTCOME:
By the end of this course the student should be able to:
describe and utilize a range of techniques of data mining and data warehousing systems.
1.

Understand the functionality of the various data mining and data warehousing components,

Appreciate the strengths and limitations of various data mining and data warehousing models.

Compare the various approaches to data mining and data warehousing implementations

Meerut Institute of Engineering & Technology, Meerut

COURSE EVALUATION SCHEME

SNo

Subject
Code

Subject

Period

Information
Securityand
EIT-505 Cyber Laws

CT

2 1 0

Evaluation Scheme
Sessional
TA
TAQ
AT
Total

15

25

EIT-505 Information Security and Cyber Laws

Internal Marks Assessment: 25 (15 + 5 + 5)
1st Sessional Exam :
2nd Sessional Exam :
3rd Sessional Exam

15
15
50 (Evaluated at the scale of 15 Marks)

Maximum Sessional Marks to be Counted:

15

Teacher Assesment (TAQ):

(Consist of Assignment and Class Performance)

Attendance:

5
Internal Marks:
External Marks:

25
50

y, Meerut

heme

Exam

Total

50

75