Professional Documents
Culture Documents
SEMESTER V
COURSE CATEGOR
COURSE TITLE L T P C
CODE Y
THEORY COURSES
PE Professional Elective – I 3 0 0 3
OE Open Elective – I 3 0 0 3
Reasoning and Aptitude
21UGS531 BS (Common to CSE, ECE, IT, CSBS, 1 0 0 1
AI&DS, CSD, AI&ML)
PRACTICAL COURSES
21UAD507 PW Creative Thinking and Innovation 0 0 2 1
Machine Learning Techniques
21UAD508 PC 0 0 2 1
Laboratory
Soft Skills Laboratory
21UGS532 HS (Common to CSE, EEE, IT, AGRI, 0 0 2 1
CSBS, AI&DS, CSD)
MANDATORY COURSE
TOTAL 16 1 8 19
Turing machines and halting. Undecidability: Undecidability, A Language that is Not Recursively
Enumerable, An Undecidable Problem That is RE, Undecidable Problems about Turing
Machines, Recursive languages, Properties of recursive languages, Post's Correspondence
Problem, Modified Post Correspondence problem, Other Undecidable Problems, Counter
machines.
TOTAL : 45 PERIODS
TEXT BOOKS:
T1. Introduction to Automata Theory, Languages, and Computation, 3nd Edition, John E.
Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Pearson Education.
T2. Theory of Computer Science – Automata languages and computation, Mishra and
Chandrashekaran, 2nd edition, PHI.
REFERENCE BOOKS:
4. Introduction to the Theory of Computation, Michael Sipser, 3rd edition, Cengage Learning.
UNIT I INTRODUCTION 9
Learning Problems – Perspectives and Issues – Concept Learning – Version Spaces and
Candidate Eliminations – Inductive bias – Decision Tree learning – Representation – Algorithm –
Heuristic Space Search.
UNIT II NEURAL NETWORKS AND GENETIC ALGORITHMS 9
Neural Network Representation – Problems – Perceptron’s – Multilayer Networks and Back
Propagation Algorithms – Advanced Topics – Genetic Algorithms – Hypothesis Space Search –
Genetic Programming – Models of Evaluation and Learning.
UNIT III BAYESIAN AND COMPUTATIONAL LEARNING 9
Bayes Theorem – Concept Learning – Maximum Likelihood – Minimum Description Length
Principle – Bayes Optimal Classifier – Gibbs Algorithm – Naïve Bayes Classifier – Bayesian Belief
Network – EM Algorithm – Probability Learning – Sample Complexity – Finite and Infinite
Hypothesis Spaces – Mistake Bound Model.
UNIT IV INSTANT BASED LEARNING 9
K- Nearest Neighbour Learning – Locally weighted Regression – Radial Bases Functions – Case
Based Learning.
UNIT V ADVANCED LEARNING 9
Learning Sets of Rules – Sequential Covering Algorithm – Learning Rule Set – First Order Rules –
Sets of First Order Rules – Induction on Inverted Deduction – Inverting Resolution – Analytical
Learning – Perfect Domain Theories – Explanation Base Learning – FOCL Algorithm –
Reinforcement Learning – Task – Q-Learning – Temporal Difference Learning
TOTAL : 45 PERIODS
TEXT BOOK:
1. Tom M. Mitchell, Machine Learning, McGraw-Hill Education (India) Private Limited,
2013.
REFERENCES:
1. Ethem Alpaydin, ―Introduction to Machine Learning (Adaptive Computation and
Machine Learning), The MIT Press 2004.
2. Stephen Marsland, ―Machine Learning: An Algorithmic Perspective, CRC Press, 2009.
21UGS531 - REASONING AND APTITUDE
PRE-REQUISITES:
COURSE OBJECTIVE:
To make the student acquire sound knowledge of the characteristic of quantitative and
qualitative aptitude.
To familiarize the student with various principles involved in solving mathematical problems.
TOTAL: 60 PERIODS
List of Equipments:
(30 Students per Batch)
The programs can be implemented in either Python or R.
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1:Apply suitable algorithms for selecting the appropriate features for analysis.
CO2:Implement supervised machine learning algorithms on standard datasets and evaluate the
performance.
CO3:Apply unsupervised machine learning algorithms on standard datasets and evaluate the
performance.
CO4:Build the graph based learning models for standard data sets.
CO5:Assess and compare the performance of different ML algorithms and select the suitable
one based on the application.
https://blog.forgefor ward.in/user-guide-for-product-innovation-rubric-857181b253dd
https://blog.forgefor ward.in/star tup-failure-is-like-true-lie-7812cdfe9b85
21UGS532 SOFT SKILLS LABORATORY
OBJECTIVES:
To be totally learner-centric with minimum teacher intervention as the course revolves around
practice.
Portfolio approach for writing to be followed. Learners are to be encouraged to blog, tweet, text
and email employing appropriate language.
GD/Interview/Role Play/Debate could be conducted off the laboratory (in a regular classroom)
but learners are to be exposed to telephonic interview and video conferencing.