Course

Course Name Teaching Scheme

Code Credits Assigned
Contact Hours
Theory Tutorial Theory Tutorial Total
Artificial
3 -- 3 -- 3
MCA22 Intelligence
Examination Scheme
And Machine
Theory
Learning Term Work End Sem Exam Total
CA Test AVG
20 20 20 -- 80 100

Pre-requisite: Basics of data mining and Mathematical foundations of computerscience-MCA11

Course Objectives The course aim to

Sr.No. Course Objective

1 Understand different AI concepts

2 Elucidate knowledge of Artificial Intelligence techniques for problem solving

3 Understand Artificial intelligence search strategies and neural networks

4 Provide an insight into the fundamentals of Machine Learning Techniques

5 Become familiar with regression methods, classification methods, clustering

methods

6 Become familiar with methods to improve the learnin

Course Outcomes: On the successful completion of the course, students will be able to

Sr.No. Outcome Bloom Level

CO1 Interpret Artificial Intelligence concepts intelligence concepts Understanding

CO 2 Apply Artificial intelligence techniques for problem solving Applying

CO 3 Analyze the fundamentals of machine learning, the learning Analyzing

algorithms and the paradigms of supervised and un-supervised
learning
CO 4 Identify methods to improve machine learning results for better Applying
predictive performance
Modul Detailed Contents Hrs
e

1 Module1:Introduction: Artificial Intelligence, Application of AI, AI 6

Problems, Problem Formulation, Intelligent Agents, Types of Agents, Agent
Environments, PEAS representation for an Agent, Architecture of Intelligent
agents. Reasoning and Logic, Prepositional logic, First order logic, Using
First-order logic, Inference in First-order logic, forward and Backward
Chaining

Self-Learning topics: Expert systems

2 Module2: Search Strategies: Solving problems by searching, Search- Issues 8

in The Design of Search Programs, Un-Informed Search- BFS, DFS; Heuristic
Search Techniques: Generate-And- Test, Hill Climbing, Best-First Search, A*
Algorithm, Alpha beta search algorithm, Problem Reduction, AO*Algorithm,
Constraint Satisfaction, Means-Ends Analysis

Self-Learning topics: Tabu search

3 Module3:Artificial Neural Networks : Introduction, Activation Function, 6

Optimization algorithm- Gradient decent, Networks- Perceptrons, Adaline,
Multilayer Perceptrons , Backpropogation Algorithms Training Procedures,
Tuning the Network Size

Self-Learning topics: Maxnet algorithm

4 Module4: Introduction to ML: Machine Learning basics, Applications of 4

ML,Data Mining Vs Machine Learning vs Big Data Analytics.

Supervised Learning- Naïve Base Classifier, , Classifying with k-Nearest

Neighbour classifier, Decision Tree classifier, Naive Bayes classifier.

Unsupervised Learning - Grouping unlabeled items using k-means clustering,

Association analysis with the Apriori algorithm Introduction to reinforcement
learning

Self-Learning topics: Density Based Clustering,K-medoid

5 Module5:Forecasting and Learning Theory : Non-linear regression, 6

Logistic regression, Random forest, Baysian Belief networks, Bias/variance
tradeoff, Tuning Model Complexity, Model Selection Dilemma

Clustering : Expectation-Maximization Algorithm, Hierarchical Clustering,

Supervised Learning after Clustering, Choosing the number of clusters,
Learning using ANN

Self-Learning topics: Maximum Likelihood Estimation

 6 Module6:Kernel Machines & Ensemble Methods 8

Introduction, Optimal Separating Hyperplane, Separating data with maximum

margin, Support Vector Machine (SVM), Finding the maximum margin, The
Non-Separable Case: Soft Margin Hyperplane, Kernel Trick, Defining
Kernels

Ensemble Methods : Mixture Models, Classifier using multiple samples of the

data set, Improving classifier by focusing on error, weak learner with a
decision stump, Bagging , Stacking, Boosting ,Implementing the AdaBoost
algorithm, Classifying with AdaBoostBootstrapping and cross validation

Self-Learning topics: SMO Algorithm

7 Module7:Dimensionality Reduction: Introduction, Subset Selection, 2

Principal Components Analysis, Multidimensional Scaling, Linear
Discriminant Analysis.

Self-Learning topics; Feature selection – feature ranking and subset

selection

Reference Books:

Reference Reference Name

No
1 George F Luger, Artificial Intelligence, Fifth Edition-2009, Pearson Education
Publications ,ISBN-978-81-317-2327-2
2 Stuart Russell, Peter Norvig ,Artificial Intelligence – A Modern Approach, ,
Pearson Education / Prentice Hall of India, 3rd Edition, 2009 .ISBN- 13: 978-
0136042594
3 Elaine Rich, Kevin Knight, S.B. Nair, Artificial Intelligence, 3rd Edition, Tata
McGraw Hill-2008., ISBN 10: 0070087709 / ISBN 13: 9780070087705
4 Anandita Das ,Artificial Intelligence and Soft Computing for Beginners-,2nd
Edition, ShroffPublication, ISBN- 9789351106159
5 Nils J. Nilsson, ―Artificial Intelligence: A new Synthesis, Morgan Kaufmann
Publishers, Harcourt Asia Pvt. Ltd., 2000, ISBN-1-55860-535-5
6 Kumar Satish ,Neural Networks, Second edition Tata McGraw Hill-,2013,
ISBN1259006166, 9781259006166
7 EthemAlpaydın, Introduction to Machine Learning, PHI, Third Edition, ISBN
No. 978-81-203- 5078-6. ( this can be made the text book)
8 Peter Harrington, Machine Learning in Action . Manning Publications , April
2012 ,ISBN 9781617290183
9 Tom Mitchell, Machine Learning, Mcgraw-Hill, First Edition, ISBN No. 0-07-
115467-1.
10 Christopher M. Bishop, Pattern Recognition and Machine Learning, Mcgraw-
Hill, ISBN No. 978-81-322-0906-5
 11 ShaiShalev-Shwartz and Shai Ben David ,Understanding Machine Learning
From Theory to Algorithms, Cambridge University Press, First Edition, ISBN
No. 978-1-107-05713-5
Web References:

Reference Reference Name

No
1 nptel.ac.in-A first course in Artificial Intelligence-Deepak Khemani,
2 nptel.ac.in -Introduction to machine learning – BalaramanRavindran, IIT
Madras
3 Tutorial point.com/machine_learning_with_python/index.htm
Assessment:

Assessment:

Continuous Assessment: 20 marks

Following measures can be used for the continuous assessment as

Assignments /Quiz /Case studies /Projects / Any other measure with the permission of the
Director/Principal/HOD/Coordinator
The continuous evaluation has to be done throughout the Semester. The faculty can use the
flexibility of the mode as per the requirement of the subject.

Test: 20 marks

Assessment consists of one class tests of 20 marks each. The Class Test is to be conducted when
approx. 50 -60% of the syllabus is completed. Duration of each test shall be one hour.

Internal Assessment: 20 marks

The Internal Assessment marks (out of 20) will be the average of the Class test and the
Continuous Assessment.

End Semester Theory Examination:

1. Question paper will comprise of total 06 questions, each carrying 20 marks.

2. Total 04 questions need to be solved.

3. Question No: 01 will be compulsory and based on entire syllabus wherein 4 sub-
questions of 5 marks each will be asked.

4. Remaining questions will be randomly selected from all the modules.

5. Weightage of each module will be proportional to number of respective lecture hours as

mentioned in the syllabus.