MSC AI Syllabus

Department of Computer Science
Learning Outcomes-based
based Curriculum Framework (LOCF)
(
For Post-Graduate
raduate Programme
M.Sc. Computer Science

With Specialization in Artificial Intelligence
(Syllabus effective from 2020 Admission onwards)
UNIVERSITY OF KERALA
2020
UNIVERSITY OF KERALA
Syllabus for M.Sc
M. in Computer Science
(With specialization in Artificial Intelligence)
PROGRAMME OUTCOMES
Ability to apply theoretical and advanced knowledge to solve the real
PO1
world problems.
PO2 Develop the skill to do research-oriented projects.
Inculcate the process of lifelong learning to promote self-learning
PO3
among students.
PO4 Develop moral values and ethics to live a better life.
PROGRAMME SPECIFIC OUTCOMES

Develop advanced knowledge in Artificial intelligence, Intelligent Agents,
Advanced Machine Learning, Artificial Intelligence algorithms,
PSO1
applications of Artificial Intelligence Management Systems and
Information Security related courses.
Provide students mathematical and technical skill set of Machine Learning,
PSO2 Data Analytics, Pattern Recognition and thereby facilitating them for
developing intelligent system based on these technologies.
Develop the skill set for industry ready professionals to join the
PSO3
Information Technology field.
Prepare and motivate students for doing research in Computer Science and
PSO4
Artificial Intelligence.
PSO5 Acquire flair on solving real world Case study problems.
Hands on experience on doing experiment for solving real life problems
PSO6
using advanced programming languages.
Allow graduates to increase their knowledge and understanding of
PSO7 computersand their systems, to prepare them for advanced positions in the
workforce.
Develop cutting edge developments in computing technology and
PSO8
contemporary research for society.
Possess the ability to take up advanced innovative development work in
PSO9
the industry as well as to pursue higher research degree qualifications.
Provide great flexibility through extensive choices of electives to respond
PSO10
to rapidly changing industry needs as well as their interests.
Industrial-style methods of analysis, design, implementation, testing and
PSO11
documentation in software development.
Produce a new breed of computer science graduates that have a strong
PSO12
mathematical background along with project management skills.
Graduates with strong technical expertise, and ability to work effectively
PSO13 in interdisciplinary teams and be able to tackle problems that require both
technical and non-technical solution.
Programme structure of M.Sc. Computer Science
(With Specialization in Artificial Intelligence)
Semester
Credits
Course Code Name of the course
Core courses (CC)

CSA-CC-511 Mathematics of Artificial Intelligence 4
Autonomous Systems and Knowledge
CSA-CC-512 4
Representation
CSA-CC-513 Algorithms- Complexity and Optimization 4
I CSA-CC-514 Artificial Intelligence Lab 3
Skill Enhancement Elective (SE)
CSA-SE-501 Entrepreneurial Skills and Scientific Writing 2
Generic Course (GC)
CSA-GC-501 Introduction to Machine Learning and Applications 2
Core courses (CC)
CSA-CC-521 Theoretical Foundations of Machine Learning 4
CSA-CC-522 Analytics and Data Science 4
CSA-CC-523 Database Systems for Big Data 4
CSA-CC-524 Machine Learning Lab 3
II Discipline Specific Electives (DE)
CSA-DE-525(i) Digital Image Processing 4
CSA-DE-525(ii) Natural Language Processing 4
CSA-DE-525(iii) BlockChain Technology 4
CSA-DE-525(iv) Computational Biology 4
CSA-DE-525(v) Cyber Security and Cyber Law 4
Core courses (CC)
CSA-CC-531 Advanced Learning Models 4
CSA-CC-532 Machine Intelligence Lab 3
CSA-CC-533 Case Study 2
CSA-CC-534 Seminar 2
Discipline Specific Electives (DE)
CSA-DE-535(i) Foundations of Robotics 4
III
CSA-DE-535(ii) Internet of Things 4
CSA-DE-535(iii) Cloud Computing 4
CSA-DE-535(iv) Intelligent Agent based computing 4
CSA-DE-535(v) High Performance Computing 4
CSA-DE-536(i) Optimization Techniques 4
CSA-DE-536(ii) Social Network Analysis 4
CSA-DE-536(iii) Artificial Intelligence in Cyber Security 4
CSA-DE-536(iv) Smart Applications 4
CSA-DE-536(v) Nature Inspired Computing 4
Generic Course (GC)
CSA-GC-502 Artificial Intelligence and Daily Life 2
Core courses (CC)
IV
CSA-CC-541 Dissertation and Viva - Voce 18
Eligibility:
Candidates shall be required to possess First class Bachelor’s Degree with not less than
60% marks (or equivalent grade) in Computer Science/Computer
Applications/Electronics/Any other degree in Science with Computer Science or
Computer Applications as major components or an equivalent degree recognized by the
University of Kerala.
SEMESTER I Course Code: CSA-CC-511 Credits: 4
MATHEMATICS FOR ARTIFICIAL INTELLIGENCE
COURSE OUTCOMES
CO1 Find the relationship between the vectors by the help of vector algebra
CO2 Prioritize the components of a matrix with the help of Eigenvalues & eigenvectors
CO3 Articulate the concept and derivation of gradients
Describe the role of local-global maxima & minima Gradient algorithms
CO4
optimization
CO5 State the basics conditional probability and its applications
CO6 Illustrate the use of Information theory in machine learning algorithms
TAGGING OF COURSE OUTCOMES

COURSE OUTCOMES PSO CL KC
Find the relationship between the vectors by the
CO1 PSO2 U, A C, P
help of vector algebra
Prioritize the components of a matrix with the help U, An,
CO2 PSO12 C, P
of Eigenvalues & eigenvectors C
CO3 Articulate the concept and derivation of gradients PSO9 U C
Describe the role of local-global maxima & minima
CO4 PSO2 U, An C, P
Gradient algorithms optimization
State the basics conditional probability and its
CO5 PSO12 U C, P
applications
Illustrate the use of Information theory in machine
CO6 PSO1 An C, P
learning algorithms
COURSECONTENT
MODULE I: Linear Algebra –Review of basic ideas of Vectors and its operations, cosine
similarity, orthogonal vectors. Review of vector norms, Vector space and basis,
Spanning sets, Linear independence, Bases and Dimension.
MODULE II: Matrices, Hadamard product, linear transformation, identity matrix,
invertible matrix and inverse, rank, Type of matrices- symmetric, diagonal, orthogonal,
orthonormal, positive definite matrix.
MODULE III: Calculus – review of Functions, rules of differentiation, partial
derivatives, Gradient concept, intuition properties, directional derivative.
MODULE IV: Vector and matrix calculus, Eigenvalues & eigenvectors, Jacobian
Gradient algorithms,local-global maxima and minima, saddle point, convex functions,
gradient descent algorithms- batch, mini-batch, stochastic.
MODULE V: Probability - Basic rules and axioms, events, sample space, frequentist
approach, dependent and independent events, conditional probability, Random
variables- continuous and discrete, expectation, variance.
MODULE VI: Distributions- joint and conditional, Bayes’ Theorem, Distributions-
binomial, bernoulli, gaussian. Basics of Information theory- entropy, cross-entropy,
mutual information.
SUGGESTED CLASS ROOM ACTIVITIES

 Written/ Lab assignments for each modules will be made available in between
the lectures.
 Seminar on different application areas of course contents in AI.
 Rapid Computing Context – who will solve the mathematical problem first in
class?
LEARNING RESOURCES
References
 Axler, Sheldon. Linear Algebra Done Right. Springer, 2014.
 Deisenroth, Marc Peter, et al. Mathematics for Machine Learning. Cambridge
University Press, 2020.
 Härdle, Wolfgang Karl, and Léopold Simar. Applied Multivariate Statistical
Analysis. Springer, 2015.
 Morin, David. Probability. Createspace Independent Publishing Platform, 2016.
On-line Sources
 https://mml-book.github.io/book/mml-book.pdf
 https://rubikscode.net/2019/05/13/mathematics-for-artificial-intelligence-
calculus-optimization/
 https://www.mobt3ath.com/uplode/book/book-33342.pdf
ASSESSMENT
As per the regulations of the University for the Teaching and Learning Departments
AUTONOMOUS SYSTEMS AND KNOWLEDGE REPRESENTATION
COURSE OUTCOMES:
CO1 Discuss Artificial Intelligence including topics, branches, and applications.
CO2 Explain the significance of intelligent agents in the Artificial Intelligence.
CO3 Discuss about knowledge representation and its structures.
CO4 Compare different reasoning methods and Bayesian networks.
CO5 Compare different association rule mining algorithms.
CO6 Illustrate how Artificial Intelligence works in Gaming applications (basics only).
Explain the principles, components, operations and other technological
CO7
advancements in Robotics.
CO8 Evaluate a selected robotic expert system and discuss its working principle.

Course Outcome PSO CL KC
Discuss Artificial Intelligence including topics,
CO1 PSO1 U F
branches, and applications.
Explain the significance of intelligent agents in the
CO2 PSO2 U C, F, P
Artificial Intelligence.
Discuss about knowledge representation and its
CO3 PSO4 U C, P
structures.
Compare different reasoning methods and Bayesian
CO4 PSO9 An C, P
networks.
Compare different association rule mining
CO5 PSO8 U C, P
algorithms.
Illustrate how Artificial Intelligence works in
CO6 PSO10 A P
Gaming applications (basics only).
Explain the principles, components, operations and
CO7 PSO9 U C, P
other technological advancements in Robotics.
Evaluate a selected robotic expert system and
CO8 PSO13 E P
discuss its working principle.
COURSE CONTENT
MODULE I: Topics of Artificial Intelligence, Timelines of Artificial Intelligence,

Branches of Artificial Intelligence, Applications of Artificial Intelligence. - Intelligent
agents - structure, types of agents, environment, autonomous agents.
Problem Solving - Production Systems, State space representation.
MODULE II: Knowledge Representation - Knowledge Management, Types of

Knowledge, Knowledge representation-bases and structures - First Order logic,
Unification algorithm, Frames, Conceptual Dependency, Scripts, Semantic network
MODULE III: Reasoning - Types of reasoning, Non-monotonic reasoning, reasoning

with Fuzzy logic, Rule Based reasoning, Case Based reasoning, Model based reasoning
systems. - Bayes rule, Bayesian networks, probabilistic inference, sample applications
MODULE IV: Game playing - Minimax procedure, Alpha-Beta pruning, combined

approach, Iterative Deepening.
MODULEV: Expert systems - characteristics, components. Expert system development,

knowledge engineering, application of expert systems. Case studies in expert systems.
MODULE VI: Robotics – principles and components, operations, mathematics of

robotics, line flow robot, applications of robots, case studies in robotics.
LEARNING RESOURCES
References
● Kevin Knight, Elaine Rich – “Artificial Intelligence” ,3rd Edn, Pearson, Chennai
● Stuart Russell and Peter Norvig – “Artificial Intelligence: A Modern Approach”,
3rd Edition Prentice Hall of India, New Delhi, 2009
● Vinod Chandra S S, Anand H S- “Artificial Intelligence: Principles and
Applications”, Prentice Hall of India, New Delhi, 2020
ASSESSMENT
As per the regulations of the University for the Teaching and Learning Departments.
ALGORITHMS- COMPLEXITY AND OPTIMIZATION
COURSE OUTCOMES:
CO1 Write the performance of algorithms in mathematical terms.
CO2 Analyze the performance of algorithms.
Explain the algorithm design techniques including Divide and Conquer,
CO3
Dynamic programming and Backtracking methods.
CO4 Prioritize the knowledge of advanced search and heuristic search techniques.
CO5 Identify the concepts of decision making theory.
CO6 Articulate optimization procedures handled in artificial intelligence.

Write the performance of algorithms in
CO1 PSO12 C C, P
mathematical terms.
CO2 Analyze the performance of algorithms. PSO8 An C, P
Explain the algorithm design techniques
CO3 including Divide and Conquer, Dynamic PSO6 U C, P
programming and Backtracking methods.
Prioritize the knowledge of advanced search and
CO4 PSO7 E C, P
heuristic search techniques.
CO5 Identify the concepts of decision making theory. PSO4 U C, P
Articulate optimization procedures handled in PSO1,
CO6 U C, P
artificial intelligence. PSO4
COURSE CONTENT
MODULE I: Concepts in algorithm analysis – the efficiency of algorithms, average and

worst – case analysis, asymptotic notation, time and space complexity.
Convergence and Regression - Learning via uniform convergence, uniform convergent
series, linear regression, correlation, regression analysis
MODULE II: Techniques -brute force, divide and conquer, decrease and conquer,
dynamic programming, shortest paths, backtracking
MODULE III: Heuristic search techniques - Generate and test, Hill climbing,
Simulated annealing, Problem reduction, AO* algorithm, Constraints satisfaction,
Means - Ends analysis
MODULE IV: Search Techniques - Graph search, Depth First Search, Breadth First
Search, Iterative Deepening search, Uniform cost search, Greedy method, Best first
search, Beam search, Branch and Bound search, A* algorithm.
MODULE V: Decision-Making: basics of utility theory, decision theory, sequential

decision
problems, elementary game theory, sample applications.
MODULE VI: Stochastic optimization – Markov chains, Random search, Fuzzy

optimization, Reactive search optimization, Tabu search, combinatorial optimization.
LEARNING RESOURCES
References
● Kalyanmoy Deb, “Optimization for Engineering Design, Algorithms and

Examples” - Prentice Hall of India, New Delhi, 2012
● Stuart Russell and Peter Norvig - “Artificial Intelligence: A Modern Approach”,
3rd Edition Pearson, Chennai, 2015
● Thomas H. Corman, Charles E. Leiserson and Ronald L. Rivest - “Introduction to
Algorithms”, 3rd Eed., Prentice Hall of India, New Delhi , 2009
● Vinod Chandra S S, Anand H S - “Artificial Intelligence: Principles and
Applications”, Prentice Hall of India, New Delhi, 2020
ASSESSMENT
ARTIFICIAL INTELLIGENCE LAB
COURSE OUTCOMES:
CO1 Implement basic python programs.
CO2 Implement programs in problem solving and state space search in AI.
Implement algorithms in Divide and conquer Decrease and Conquer, Dynamic
CO3
Programming, Shortest paths, Backtracking techniques.
Implement algorithms in Graph Search, Depth First Search, Breadth First Search,
CO4 Iterative Deepening Search, Uniform Cost Search, Greedy Method, Best First
Search, Beam Search, Branch and Bound Search, A* Algorithm.

CO1 Implement basic python programs. PSO3 C C, P
Implement programs in problem solving and PSO3,
CO2 A C, P
state space search in AI. PSO4
Implement algorithms in Divide and conquer
Decrease and Conquer, Dynamic PSO6,
CO3 C C, P
Programming, Shortest paths, Backtracking PSO8
techniques.
Implement algorithms in Graph Search,
Depth First Search, Breadth First Search,
Iterative Deepening Search, Uniform Cost PSO1,
CO4 A C, P
Search, Greedy Method, Best First Search, PSO3
Beam Search, Branch and Bound Search, A*
Algorithm.
COURSE CONTENT
Students should practice python programming and implement different algorithms
applicable in the field of Artificial Intelligence.
List of Experiments
Implement the following algorithms and methods
1. Divide and Conquer.

2. Dynamic programming.
3. Shortest path algorithm.
4. Backtracking techniques.
5. Depth-First searchand Breadth First Search.
6. Iterative Deepening Search.
7. Uniform Cost Search.
8. Greedy Method.
9. Best First Search.
10. Beam Search.
11. Branch and Bound Search.
12. A* Algorithm.
SEMESTER I Course Code: CSA-SE-501 Credits: 2

ENTREPRENEURIAL SKILLS & SCIENTIFIC WRITING
COURSE OUTCOMES:
Demonstrate the ability to plan, organize, and execute a project or new venture
CO1
with the goal of bringing new products and service.
CO2 Develop skill set to carry out scientific research in the field of entrepreneurship.
CO3 Prepare scientific reports and communicate the results in journal/conferences.
CO4 Analyze and prepare research papers and literature review.
CO5 Assess the commercial viability of new technologies, business opportunities.

Demonstrate the ability to plan, organize, and
CO1 execute a project or new venture with the goal of PSO7 A C, P
bringing new products and service.
Develop skill set to carry out scientific research in
CO2 PSO9 C P
the field of entrepreneurship.
Prepare scientific reports and communicate the
CO3 PSO4 C P
results in journal/conferences.
Analyze and prepare research papers and literature
CO4 PSO4 An C, P
review.
Assess the commercial viability of new
CO5 PSO8 E C, P
technologies, business opportunities.
COURSE CONTENT
MODULE I: Introduction to entrepreneurship- Idea generation and business

opportunity – Who is an entrepreneur –Traits- Qualities - competence of an
entrepreneur- Factors affecting entrepreneurship development- Creativity and
entrepreneurship.
MODULE II: Steps in Creativity - Innovation and invention- Legal Protection of

innovation - Skills of an entrepreneur - Decision making and Problem Solving (steps
indecision making) -Procedures for initiation of the Startup.
MODULE III: Introduction to Soft Skills- Communication Skills - Presentation Skills -

Time Management Skills- Group Discussion & Interview Skills - Preparation of CV-
Emotional Intelligence Skills - Life Skills.
MODULE IV: Self awareness- SWOT Analysis- Planning & Goal setting -Leadership
skills- Stress Management Skills- Life Skills.
MODULE V: How to read a research paper? Structure and Components of Research
Report, Data Presentation , Types of Report, Layout of Research Report, Mechanism of
writing a research Thesis, Formats of a research paper, IMRAD format.
MODULE VI: Google Scholar, Web of Science, Scopus, Impact Factor, h-Index, g-
index, Copyrights and Patents, IPR Laws. Citation, Plagiarism, Creative commons
licenses.
LEARNING RESOURCES
References
● C. R. Kothari – “ Research Methodology”, New Age International, 2004

● Cecile Niewwenhuizen, Entrepreneurial Skills: Second Edition,Isbn-13: 978-
0702176937
● J. W. Bames – “Statistical Analysis for Engineers and Scientists”, Tata McGraw-
Hill, New York, 1994
● R. Panneerselvam - “Research Methodology”, Prentice Hall India, New Delhi,
2014
● Vinod Chandra S S, Anand H S - "Research Methodology", Pearson Education,
Chennai, 2017
ASSESSMENT
SEMESTER I Course Code: CSA-GC-501 Credits: 2
INTRODUCTION TO MACHINE LEARNING AND APPLICATIONS

COURSE OUTCOMES:
CO1 Explain the basic concepts and applications of Machine learning.
CO2 Compare and contrast different supervised machine learning algorithms.
CO3 Explain the approaches of machine learning.
CO4 Compare predictive analysis and descriptive analysis.
CO5 Apply machine learning algorithms to solve real world problems.
CO6 Illustrate the training process in machine learning.
CO7 Identify and categorize the types of machine learning.

Explain the basic concepts and applications of
CO1 PSO10 U F, C
Machine learning.
Compare and contrast different supervised machine
CO2 PSO3 U C, P
learning algorithms.
CO3 Explain the approaches of machine learning. PSO7 U C
Compare predictive analysis and descriptive
CO4 PSO10 U C, P
analysis.
Apply machine learning algorithms to solve real
CO5 PSO8 A C, P
world problems.
CO6 Illustrate the training process in machine learning. PSO10 A P
Identify and categorize the types of machine
CO7 PSO7 U C
learning.
COURSE CONTENT
MODULE I: Understanding Machine Learning -What Is Machine Learning? - Defining

Big Data- Big Data in Context with Machine Learning - Leveraging the Power of
Machine Learning- Descriptive analytics - Predictive analytics
MODULE II: The Roles of Statistics and Data Mining with Machine Learning -
Approaches to Machine Learning -Supervised learning -Unsupervised learning -
Reinforcement learning - Neural networks
MODULE III: Applying Machine Learning - Understanding Machine Learning

Techniques- Tying Machine Learning Methods to Outcomes - Applying Machine
Learning to Business Needs
MODULE IV: Looking inside Machine Learning - The role of algorithms - Types of
machine learning algorithms - Training machine learning systems - Data Preparation -
Identify relevant data -The Machine Learning Cycle
MODULE V: Understanding How Machine Learning Can Help - Focus on the Business
Problem- Executing a Pilot Project- Determining the Best Learning Model- Learning
Machine learning skills that you need.
MODULE VI: Using Machine Learning to Provide Solutions to Business Problems -

Applying Machine Learning to Patient Health - Proactively Responding to IT - Issues -
Protecting Against Fraud
LEARNING RESOURCES
References
● Aurélien Géron “Hands-On Machine Learning with Scikt-Learn & TensorFlow”,
O'Reilly Media, Inc.,2019.
● Ethem Alpaydın “Introduction to Machine Learning Second Edition”, The MIT
Press Cambridge, Massachusetts, London, England.
 Judith Hurwitz and Daniel Kirsch, Machine Learning For Dummies, IBM
Limited Edition, Wiley, 2018.
ASSESSMENT
SEMESTER II Course Code: CSA-CC-521 Credits: 4
THEORETICAL FOUNDATIONS OF MACHINE LEARNING
COURSE OUTCOMES
CO1 Explain the basics of machine learning and applications.
CO2 Compare different quantification methods of classification.
CO3 Compare different supervised, semi supervised, and unsupervised algorithms.
CO4 Explain about reinforcement learning and its different learning methods.
CO5 Compare different association rule mining algorithms.
CO6 Differentiate different clustering techniques and algorithms.
CO7 Implement Support Vector Machine algorithm and its variants.
CO8 Explain different learning algorithms based on decision tree.

Explain the basics of machine learning and
CO1 PSO1 U C
applications.
Compare different quantification methods of
CO2 PSO2 An C, P
classification.
Compare different supervised, semi supervised,
CO3 PSO4 An C, P
and unsupervised algorithms.
Explain about reinforcement learning and its
CO4 PSO3 U C
different learning methods.
Compare different association rule mining
CO5 PSO8 U C
algorithms.
Differentiate different clustering techniques and
CO6 PSO6 An C, P
algorithms.
Implement Support Vector Machine algorithm PSO6,
CO7 An, A C, P
and its variants. PSO7
Explain different learning algorithms based on
CO8 PSO9 U, A C
decision tree.
COURSE CONTENT
MODULE I: Learning - Types of learning, learning of Input/ Output Function, history

and timelines of machine learning, Aspects of machine learning, Machine Learning
Applications and examples, intelligent agents.
Quantification of classification - Threshold Fixing, ROC Graphics, ROC formulation
MODULE II: Supervised vs. Unsupervised learning - Prediction system, Training,
testing and validation datasets, cross validation. Supervised learning model - Bias-
variance trade-off, classification problems. Unsupervised learning model - clustering,
data compression, PCA. Semi-supervised learning- self-training, co-training, generative
methods, graph-based methods, Semi-supervised SVM.
MODULE III: Reinforcement learning - Reinforcement learning model, limitation of

reinforcement learning, applications of reinforcement learning. Markov Decision
problem, Q-learning, Temporal Difference learning, On-policy and Off-policy learning,
learning Automata
MODULE IV: Association Rule mining - Concepts and terminology, Apriori algorithm,
Probabilistic correlation algorithm, FP-growth algorithm, Eclat algorithm, Sparse Eclat,
Tertius algorithm, Treap mining algorithm
MODULE V: Clustering - k-Means clustering, Facts about k-means, k-Means clustering

weakness. Fuzzy clustering, hierarchical clustering Agglomerative and Divisive
Clustering, Hierarchical Agglomerative Clustering, Cluster similarity.
MODULE VI: Support Vector Machines- Margins, Learning a maximum hyperplane,

Kernel functions, Linear SVM, Non-linear SVM, Applications of SVM.
Decision Trees - Decision tree construction, types of decision trees. Decision tree
algorithms - C4.5 algorithms, ID3 algorithm, CART, random forest. Univariate trees and
Multivariate trees - functional tree, J48 tree,J48-graft, Best-first trees, Naive Bayesian
tree.
LEARNING RESOURCES
References
● C. Bishop - “Pattern Recognition and Machine Learning”, Springer, 2007.

● K. Murphy - “Machine Learning: a Probabilistic Perspective”, MIT Press, 2012.
● Vinod Chandra S S, Anand H S - “Machine Learning: A Practitioners Approach”,
Prentice Hall of India, New Delhi, 2020
● Vinod Chandra S S, Anand H S- "Artificial Intelligence and Machine Learning",
ASSESSMENT
ANALYTICS AND DATA SCIENCE

COURSE OUTCOMES
CO1 Define data science, its scope and applications.
CO2 Differentiate data science and data analytics.
CO3 Illustrate the statistical and visualization techniques in data science.
CO4 Compare different statistical learning models and classifiers.
CO5 Compare different machine learning algorithms for data science.
CO6 Explain single value decomposition techniques in data science and analysis.
Implement different data science and analysis problems using R programming
CO7
language.

CO1 Define data science, its scope and applications. PSO2 U F, C
PSO2,
CO2 Differentiate data science and data analytics. U F, C
PSO3
Illustrate the statistical and visualization
CO3 PSO4 A C, P
techniques in data science.
Compare different statistical learning models
CO4 PSO8 An C, P
and classifiers.
Compare different machine learning
CO5 PSO9 U C, P
algorithms for data science.
Explain single value decomposition techniques
CO6 PSO8 U C
in data science and analysis.
PSO3,
Implement different data science and analysis
CO7 PSO6, A C, P
problems using R programming language.
PSO12
COURSE CONTENT
MODULE I: Introduction: Data Science –Basic concepts, definition and architecture,

business analytics and visualization techniques, Different industrial application of Data
Science technique.
MODULE II: Statistics and Probability: Statistical measures, probability– conditional

probability, Baye’s theorem, Probability distributions and standard distributions,
density functions, Mathematical expectations and moments, covariance and correlation.
MODULE III: Statistical learning - Stochastic processes, Markov process, HMM,

Forward - Backward procedure, Viterbi algorithm, Baum-Welch algorithm,
Applications of HMM.-Statistical classifiers - Linear classifiers, Fisher linear
discriminant, Quadratic classifiers, Naive Bayes classifier, Bayesian networks.
MODULE IV: Dimensionality Reduction, Clustering, Association Rules – Apriori

algorithm, Anomaly Detection, Spam Filtering, Network Analysis and Recommender
Systems.
MODULE V: Singular value decomposition - Handwritten digits and simple algorithm

- Classification of handwritten digits using SVD bases - Tangent distance - Text Mining.
MODULE VI: Familiarization of R-Studio Integrated Development Environment (IDE)

– Understanding different data types working with R – Reading/storing data from/in
different file types, data manipulation, Loading and saving data, Control flow,
Functions, Data analysis using R.
LEARNING RESOURCES
References
 Cathy O’Neil and Rachel Schutt. Doing Data Science, Straight Talk From The
Frontline. O’Reilly. 2014.
 Bendat J S, and Piersol A G (2011), Random Data Analysis and Measurement
procedures (vol. 729) John Wiley & Sons.
 D.A.Simovici, Linear algebra tools for data mining, World Scientific Publishing,
2012.
 E. Davis, Linear algebra and probability for computer science applications, CRC
Press, 2012.
 EldénLars, Matrix methods in datamining and pattern recognition,Society for
Industrial and Applied Mathematics, 2007.
ASSESSMENT
DATABASE SYSTEMS FOR BIG DATA
COURSE OUTCOMES:
Describe the basic concepts of Database systems and Transactions including ACID
CO1
properties and Concurrency Control techniques.
Explain in detail about Big Data, its types, characteristics, handling techniques and
CO2
Big Data databases.
CO3 Describe about the architecture, challenges and the applications of Big Data.
CO4 Discuss about Hadoop technology, hadoop ecosystem components and its features.
CO5 Explain in detail about Hadoop file system- HDFS and MapReduce framework.
CO6 Discuss about the NoSQL data store, architecture and its advantages.
Explain the use of MongoDB and implement its basic commands- CRUD
CO7
operations.

Describe the basic concepts of Database systems
CO1 and Transactions including ACID properties and PSO7 U F, C
Concurrency Control techniques.
Explain in detail about Big Data, its types,
CO2 characteristics, handling techniques and Big Data PSO3 U F, C
databases.
Describe about the architecture, challenges and the
CO3 PSO8 U C
applications of Big Data.
Discuss about Hadoop technology, hadoop
CO4 PSO9 U C
ecosystem components and its features.
Explain in detail about Hadoop file system- HDFS PSO7,
CO5 U, A C, P
and MapReduce framework. PSO8
Discuss about the NoSQL data store, architecture
CO6 PSO3 U, A P
and its advantages.
Explain the use of MongoDB and implement its
CO7 PSO10 U, A P
basic commands- CRUD operations.
COURSE CONTENT
MODULE I :Review of basic concepts, Transaction processing concepts, ACID

properties, Schedules, Serializability, Concurrency Control – timestamp and validation
concurrency control.
MODULE II : Introduction, Big Data concepts, classification of data - structured, semi-
structured and unstructured, Big Data - definition, characteristics, types, Big Data
handling techniques, Big Data databases.
Introduction to Spark, Big Data architecture and Spark, challenges of Big Data, Big Data
applications and case studies- big data and credit risk management, Big Data in
healthcare and medicine, Big Data and advertising, Limitations of Big Data.
MODULE III : Hadoop Technology- Introduction to hadoop, hadoop and its ecosystem
– core components, features of hadoop, hadoop ecosystem components, hadoop
streaming and pipes.
MODULE IV : Hadoop file system – HDFS, Data storage and file system, MapReduce
framework and programming model, hadoop ecosystem tools.
MODULE V : NoSQL datastore – Introduction and motivation, Schema less models,

Need of NoSQL, Architecture patterns, Features - CAP theorem, Advantages of NoSQL.
MODULE VI : MongoDB – Definition, Characteristics, SQL and MongoDB, Data

modeling, datatypes, Commands in MongoDB, CRUD operations.
LEARNING RESOURCES
References
 Chris Eaton, Dirk deroos et al. “Understanding Big data ”, McGraw Hill, 2012.
 Connolly, Thomas M; Begg, Carolyn E, Database systems: a practical approach to

Design, Implementation, and Management.6th ed., Pearson Education, 2015
ISBN: 978-0132943260.
 Martin Fowler “NoSQL distilled”.
 Vignesh Prajapati,Big Data Analytics with R and Hadoop, Packt Publishing,
2013, ISBN: 978-1-78216-328-2.
On-line Sources
 http://www.ccs.neu.edu/home/kathleen/classes/cs3200/20-
NoSQLMongoDB.pdf
 https://hostingdata.co.uk/nosql-database/
ASSESSMENT
MACHINE LEARNING LAB
COURSE OUTCOMES
Implement Python programs using packages such as Numpy, Scipy, Pandas,
CO1
Scikit-learn, etc.
CO2 Implement programs in association rules mining.
CO3 Implement algorithms in reinforcement learning.
CO4 Implement algorithms in clustering, Decision trees.
CO5 Implement algorithms in SVM.

Implement Python programs using packages such
CO1 PSO6 U C, P
as Numpy, Scipy, Pandas, Scikit-learn, etc.
CO2 Implement programs in association rules mining. PSO7 A C, P
PSO7,
CO3 Implement algorithms in reinforcement learning. A C, P
PSO8
CO4 Implement algorithms in clustering, Decision trees. PSO10 A C, P
PSO6,
CO5 Implement algorithms in SVM. U, A C, P
PSO13
COURSE CONTENT
Students should practice python programming and implement different algorithms in

Machine learning.
List of Experiments
Implement the following algorithms on following methods.
1. Support Vectors Machine.

2. Association rule mining.
3. Reinforcement learning.
4. Clustering.
5. Decision Trees.
6. Classification.
SEMESTER II Course Code: CSA-DE-525(i) Credits: 4
DIGITAL IMAGE PROCESSING
COURSE OUTCOMES:
CO1 Define the elements of image processing.
CO2 Differentiate color image models in image representation.
CO3 Discuss about various spatial domain image transformations and filtering.
CO4 Discuss about various frequency domain image transformations and filtering.
CO5 Illustrate different morphological operations on an image.
CO6 Illustrate different boundary representation methods on an image.
CO7 Discuss about image restoration process.
CO8 Discuss about image segmentation process.
CO9 Compare the current technologies and issues specific to Digital Image Processing.

CO1 Define the elements of image processing. PSO4 U F, C
Differentiate color image models in image
CO2 PSO9 U C
representation.
Discuss about various spatial domain image PSO3,
CO3 U C
transformations and filtering. PSO4
Discuss about various frequency domain image PSO3,
CO4 U C
transformations and filtering. PSO7
Illustrate different morphological operations on
CO5 PSO8 A C, P
an image.
Illustrate different boundary representation
CO6 PSO9 A C, P
methods on an image.
PSO4,
CO7 Discuss about image restoration process. U C, P
PSO12
PSO4,
CO8 Discuss about image segmentation process. U C, P
PSO12
Compare the current technologies and issues
CO9 PSO8 U C, P
specific to Digital Image Processing.
COURSE CONTENT
MODULE I: Digital Image Fundamentals-Elements of Digital Image Processing

Systems, color Image fundamentals, RGB, HSI Color Models, Image sampling,
Quantization.
MODULE II: Spatial Domain: Gray level transformations – Histogram processing –
Basics of Spatial Filtering–Smoothing and Sharpening Spatial Filtering.
MODULE III: Frequency Domain: Introduction to Fourier Transform – Smoothing

and Sharpening frequency domain filters – Ideal, Butterworth and Gaussian filters.
MODULE IV: Morphological operations: Dilation, Erosion, Opening and Closing;

Applications: Boundary extraction - Boundary representation – Chain Code –
Boundary descriptors - Regional Descriptors– Shape number – Fourier Descriptor.
MODULE V: Image Restoration: Noise models – Mean Filters – Order Statistics –

Adaptive filters – Band reject Filters – Band pass Filters – Notch Filters – Optimum
Notch Filtering – Inverse Filtering – Wiener filtering.
MODULE VI: Image Segmentation-Edge detection, Hough transforms – Thresholding

- Region based segmentation – Region growing – Region splitting and merging –
Watershed segmentation algorithm.
LEARNING RESOURCES
References
 Anil Jain K. “Fundamentals of Digital Image Processing”, PHI Learning Pvt. Ltd.,
2011.
 D,E. Dudgeon and RM. Mersereau, , Multidimensional Digital Signal Processing',
Prentice Hall Professional Technical Reference, 1990.
 Kenneth R. Castleman, Digital Image Processing, Pearson, 2006.
 Milan Sonka et aI, 'IMAGE PROCESSING, ANALYSIS AND MACHINE
VISION',Brookes/Cole, Vikas Publishing House, 2nd edition, 1999.
 Rafael C. Gonzales, Richard E. Woods, “Digital Image Processing”, Fourth
Edition, Pearson Education, 2017.
 Rafael C. Gonzalez, Richard E. Woods, Steven L. Eddins, “Digital Image
Processing Using MATLAB”, Third Edition Tata McGraw Hill Pvt. Ltd., 2011.
 William K. Pratt, , Digital Image Processing' , John Wiley, New York, 2002.
ASSESSMENT
SEMESTER II Course Code: CSA-DE-525(ii) Credits: 4
NATURAL LANGUAGE PROCESSING
COURSE OUTCOMES
CO1 Apply the n-gram & Language models in various NLP applications.
CO2 Evaluate the different issues & applications of NLP activity.
CO3 Apply and generalize the different types of Parts-of- speech tagging.
CO4 Identify the different models for computational Morphological analysis.
CO5 Apply and execute the statistical parsing & probabilistic theory.
CO6 Generalize the grammar formalisms & tree banks of syntactical parsing.
CO7 Differentiate between semantic role labelling and semantic parsing.
CO8 Predicate the ambiguity & solutions of different methods.
CO9 Describe the place and manner of articulation in speech processing.
CO10 Evaluate the recall & F-score method in speech processing.
CO11 List out the applications of NLP in research and development.
CO12 Criticize the Named Entity Recognition & relation extraction methods.

Apply the n-gram & Language models in
CO1 PSO8 A C, P
various NLP applications.
Evaluate the different issues & applications of
CO2 PSO4 E C, P
NLP activity.
Apply and generalize the different types of
CO3 PSO9 A C, P
Parts-of- speech tagging.
Identify the different models for
CO4 PSO8 U C
computational Morphological analysis.
Apply and execute the statistical parsing &
CO5 PSO12 A C, P
probabilistic theory.
Generalize the grammar formalisms & tree
CO6 PSO8 C C
banks of syntactical parsing.
Differentiate between semantic role labelling
CO7 PSO9 U C
and semantic parsing.
Predicate the ambiguity & solutions of
CO8 PSO4 U C
different methods.
Describe the place and manner of articulation
CO9 PSO3 U C, P
in speech processing.
Evaluate the recall & F-score method in PSO3,
CO10 E P
speech processing. PSO4
List out the applications of NLP in research
CO11 PSO9 U C
and development.
Criticize the Named Entity Recognition &
CO12 PSO8 E C, P
relation extraction methods.
COURSE CONTENT
MODULE I: Introduction - Natural Language Processing - phonology, morphology,
syntax, semantics, and pragmatics – Issues - Applications - The role of machine learning
- Probability Basics –Information theory – Collocations -N-gram Language Models -
Estimating parameters and smoothing - Evaluating language models.
MODULE II: Morphology and part of speech tagging - Linguistic essentials – Lexical, -
Morphology, syntax. Finite State Transducers - Part of speech Tagging - Tagset - Rule-
Based Part of Speech Tagging - Markov Models - Hidden Markov Models –
Transformation based Models - Maximum Entropy Models. Conditional Random
Fields.
MODULE III: Syntax parsing - Syntax Parsing - Grammar formalisms and treebanks -
Parsing with Context Free Grammars - Features and Unification -Statistical parsing and
probabilistic CFGs (PCFGs)-Lexicalized PCFGs.
MODULE IV: Semantic analysis - Representing Meaning – Semantic Analysis - Lexical

semantics – ambiguity -Word sense disambiguation - Supervised – Dictionary based
and Unsupervised Approaches - Compositional semantics - Semantic Role Labeling and
Semantic Parsing – Pragmatics - Discourse Analysis.
MODULE V: Speech - Phonetics, Hidden Markov Model, Morphology, Graphical

Models for Sequence Labeling in NLP, Consonants (place and manner of articulation)
and Vowels; Phonology: ASR, Speech Synthesis, Hidden Markov Model and Viterbi,
Precision, Recall , F-score, Map.
MODULE VI: Applications - Named entity recognition and relation extraction- IE using
sequence labeling-Machine Translation (MT) - Basic issues in MT-Statistical translation-
word alignment- phrase-based translation, Question Answering, Text Summarization,
Corpus Design, OCR.
LEARNING RESOURCES
References
 Dash, Niladri Sekhar Corpus Linguistics and Language Technology, New Delhi :
Mittal Publications 2005.
 Jacob Eisenstein,Introduction to Natural Language Processing, 2019.
 Bird, Ewan Klein and Edward Loper, Natural Language Processing with Python.
Steven 2016.
 James Allen, Natural Language Understanding (2nd Edition) 2nd Edition- 2017.
 Ruslan Mitkov, The Oxford Handbook of Computational Linguistics, Oxford
University Press2003.
 Dan Jurafsky and James H. Martin, Speech and Language Processing (3rd ed.
draft), Draft chapters in progress, October 16, 2019
 Philipp Koehn , Statistical Machine Translation, 2016.
 Alexander Clark (Editor), Chris Fox (Editor), Shalom Lappin (Editor), The
Handbook of Computational Linguistics and Natural Language Processing
(Blackwell Handbooks in Linguistics) 1st Edition, Kindle Edition.
ASSESSMENT
SEMESTER II Course Code: CSA-DE-525(iii) Credits: 4
BLOCKCHAIN TECHNOLOGY
COURSE OUTCOMES
CO1 Discuss and describe the history, technology, and applications of Blockchain
CO2 Analyze the significance of crptocurrencies in the digital world
CO3 Identify the functional/operational aspects of cryptocurrency ecosystem
CO4 Compare emerging abstract models for Blockchain Technology
CO5 Illustrate the working of Ethereum Virtual Machine
CO6 Assess Blockchain applications in a structured manner
CO7 Analyze the process of creating a crypto currency
CO8 Create an own Crypto token

Course Outcomes PSO CL KC
Discuss and describe the history, technology, and
CO1 PSO2 U C
applications of Blockchain
PSO3,
Analyze the significance of crptocurrencies in the
CO2 PSO7, An P
digital world
PSO9
Identify the functional/operational aspects of
CO3 PSO8 U F, C
cryptocurrency ecosystem
PSO3,
Compare emerging abstract models for Block
CO4 PSO7, U C, P
chain Technology
PSO9
Illustrate the working of Ethereum Virtual PSO7,
CO5 A P
Machine PSO8
PSO3,
Assess Block chain applications in a structured
CO6 PSO7, E C, P
manner
PSO9
PSO3,
CO7 Analyze the process of creating a crypto currency PSO7, An C, P
PSO9
PSO4,
CO8 Create an own Crypto token Cr P,M
PSO9
COURSE CONTENT
MODULE I: Introduction to Blockchain: Evolution and Technology –Applications -

Core components of Block Chain technology- Private block chain vs Public block chain -
The consensus problem - Asynchronous Byzantine Agreement - AAP protocol and its
analysis - Nakamoto Consensus on permission-less, nameless, peer-to-peer network
MODULE II: Abstract Models for BLOCKCHAIN - GARAY model - RLA Model -
Proof of Work ( PoW) as random oracle - formal treatment of consistency, liveness and
fairness - Proof of Stake ( PoS) based Chains - Hybrid models ( PoW + PoS)
MODULE III: Cryptographic basics for cryptocurrency - a short overview of Hashing,

signature schemes, encryption schemes and elliptic curve cryptography
MODULE IV: Bitcoin - Wallet - Blocks - Merkley Tree - hardness of mining - transaction
verifiability - anonymity - forks - double spending - mathematical analysis of properties
of Bitcoin.
MODULE V: Ethereum - Ethereum Virtual Machine ( EVM) - Wallets for Ethereum -

Solidity - Smart Contracts - some attacks on smart contracts
MODULE VI: (Trends and Topics) - Zero Knowledge proofs and protocols in
Blockchain - Succinct non interactive argument for Knowledge (SNARK) - pairing on
Elliptic curves - Zcash.
LEARNING RESOURCES
References
 Mastering Bitcoin: Unlocking Digital Cryptocurrencies, Andreas M. Antonopoulos

O’Reilly 2010.
 Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller, and Steven
Goldfeder, Bitcoin and cryptocurrency technologies: a comprehensive introduction.
Princeton University Press, 2016.
 Joseph Bonneau et al, SoK: Research perspectives and challenges for Bitcoin and
cryptocurrency, IEEE Symposium on security and Privacy, 2015 ( article available
for free download) { curtain raiser kind of generic article, written by seasoned
experts and pioneers}.
 J.A.Garay et al, The bitcoin backbone protocol-analysis and applications
EUROCRYPT 2015 LNCS VOl 9057, (VOLII ),pp 281-310.( Also available at
eprint.iacr.org/2016/1048) . (serious beginning of discussions related to formal
models for bitcoin protocols).
 R.Pass et al, Analysis of Blockchain protocol in Asynchronous networks ,
EUROCRYPT 2017, ( eprint.iacr.org/2016/454) . A significant progress and
consolidation of several principles).
On-line Sources
 Hyperledger Fabric - https://www.hyperledger.org/projects/fabric

 Zero to Blockchain - An IBM Redbooks course, by Bob Dill, David Smits-
https://www.redbooks.ibm.com/Redbooks.nsf/RedbookAbstracts/crse0401.html
ASSESSMENT
SEMESTER II Course Code: CSA-DE-525(iv) Credits: 4
COMPUTATIONAL BIOLOGY
COURSE OUTCOMES
Describe the basic concepts of molecular biology and biological data including
CO1
DNA and RNA.
CO2 Analyze DNA, RNA, and protein sequences.
Explain the properties of DNA, RNA, and proteins, the relationships among these
CO3
molecules.
Describe about in algorithms computational biology including Gene Finding
CO4
Approaches and Bayesian via Hidden Marko.
Articulate the basic concepts of Genetic algorithm and its applications in
CO5
Microbial informatics, Biomedical Images and Microarray.

Describe the basic concepts of molecular biology
CO1 PSO10 U C
and biological data including DNA and RNA.
CO2 Analyze DNA, RNA, and protein sequences. SO9 An C, P
Explain the properties of DNA, RNA, and
CO3 PSO8 U C
proteins, the relationships among these molecules.
Describe about in algorithms computational
CO4 biology including Gene Finding Approaches and PSO12 U C, P
Bayesian via Hidden Marko.
Articulate the basic concepts of Genetic algorithm
CO5 and its applications in Microbial informatics, PSO10 U C, P
Biomedical Images and Microarray.
COURSE CONTENT
MODULE I: Central dogma of Molecular biology, Concepts in Biological data – DNA,

RNA, Protein sequences, RNA classification – coding and non-coding RNA- mRNA,
tRNA, miRNA etc. Genomics and Proteomics.
MODULE II: Sequencing of biological samples, Sequencing Methods – Sanger

sequencing, NGS, WGS, Chipseq RNA seq etc., Sequence Formats – FASTA, SRA, BED
etc., Databases- NCBI SRA, Genebank, RefSeq, uniport, PDB etc.
MODULE III: Sequence alignment – local, global, pairwise, multiple, sequence

alignment, scoring methods. Needleman and Wunsch algorithm, global and local
alignments. Protein and RNA structure prediction, polypeptic composition, secondary
and tertiary structure, algorithms for modelling RNA and protein folding.
MODULE IV: Algorithms in computational biology.Gene Finding Approaches:

statistical, homology-based, Bayesian via Hidden Marko. Viterbi and
forward/backward algorithms Phylogeny, Jukes-Cantor model, maximum-likelihood
method, distance-based methods, neighbour-joining, HMMs. Genome rearrangements
MODULE V: RNA Secondary Structure: Definitions, scoring schemes, dynamic

programming approaches. Motif Finding: Repeat finding. Promoter and enhancer
recognition. Signal peptide recognition. Genotyping: Basic genetics, haplotype
determination, haplotype blocks, forensic identification. Genome Sequence Assembly:
Technology overview. Overlap-layout-consensus paradigm. Approaches.
MODULE VI: Combinatorial Pattern Matching- Hash Tables, Repeat Finding, Exact
Pattern Matching; Expectation and Maximization (EM) with forward and backward
algorithms, discriminative learning; Genetic Algorithm: Basic Concepts, Reproduction,
Cross over, Mutation, Fitness Value, Optimization using GAs; Applications in
Microbial informatics, Biomedical Images, Microarray etc. Image acquisition Region of
interest (RoI), Segmentation, Labelling of images, Image artefacts, Image analysis
LEARNING RESOURCES
References
● Andreas Baxevanisand Francis Ouellette - “Bioinformatics- A practical guide to

the Analysis of Genes and proteins”, Wiley India, 2010.
● P. Baldi and S. Brunak - “Bioinformatics: The Machine Learning Approach”, MIT
Press, 2001.
● R. Durbin, S. Eddy, A. Krogh and G. Mitchison –“ Biological Sequence Analysis”,
Wiley, 1999.
● Rastogi et. al. – “Bioinformatics: Methods and Applications Genomics,
Proteomics and Drug Discovery”, Prentice Hall of India, New Delhi, 2013.
● Vinod Chandra S S, Amjesh R - “Bioinformatics for Beginers", Lambert Academic
Publishers, UK, 2019.
ASSESSMENT
SEMESTER II Course Code: CSA-DE-525(v) Credits: 4
CYBER SECURITY AND CYBER LAW

COURSE OUTCOMES:
CO1 Identify Networking and its issues.
Explain the concepts of Information security, Threats, Vulnerabilities, Impact
CO2
and control measures.
CO3 Evaluate different methods in cryptography.
CO4 Discuss network security issues and Virtual Private Networks.
CO5 Relate Cyber laws with security incidents.
CO6 Analyze fundamentals of Cyber Law.
CO7 Discuss IT Act & its Amendments.
CO8 Relate Cyber laws with security incidents.

CO1 Identify Networking and its issues. PSO10 U, A C
Explain the concepts of Information security,
CO2 Threats, Vulnerabilities, Impact and control PSO1 U C
measures.
CO3 Evaluate different methods in cryptography. PSO8 E P
Discuss network security issues and Virtual
CO4 PSO1 U C, P
Private Networks.
CO5 Relate Cyber laws with security incidents. PSO10 A C, P
CO6 Analyze fundamentals of Cyber Law. PSO13 An C, P
CO7 Discuss IT Act & its Amendments. PSO1 U C
C08 Relate Cyber laws with security incidents. PSO10 A P
COURSE CONTENT
MODULE I: Information System Threats and attacks, Classification of Threats and
Assessing Damages, Security in Mobile and Wireless Computing- Security Challenges
in Mobile Devices, authentication Service Security, Security Implication for
organizations, Laptops Security, confidentiality, Integrity Availability, Access Control-
Biometrics.
MODULE II: Model of Cryptographic Systems, Issues in Documents Security, System

of Keys, Public Key Cryptography, Digital Signature, Requirement of Digital Signature
System, Finger Prints, Firewalls, Design and Implementation Issues, Policies Network
Security- Basic Concepts, Dimensions, Perimeter for Network.
MODULE III: Network Perimeter Security Fundamentals: Introduction, layers of

Network Security, Security by Router – Firewall: Basics, Types - Network Address
Translation Issues. - Virtual Private Networks: VPN Basics, Types of VPN, IPSec
Tunneling & Protocols. - VLAN: introduction, Links, Tagging, VLAN Trunk Protocol
(VTP).
MODULE IV: Constitutional & Human Rights Issues in Cyberspace Freedom of Speech
and Expression in Cyberspace - Right to Access Cyberspace – Access to Internet- Right
to Privacy - Right to Data Protection.
MODULE V: Cyber Crimes & Legal Framework Cyber Crimes against Individuals -
Institution and State - Hacking - Digital Forgery - Cyber Stalking/Harassment - Cyber
Pornography - Identity Theft & Fraud Cyber terrorism - Cyber Defamation - Different
offences under IT Act, 2000.
MODULE VI: Intellectual Property Issues in Cyber Space Interface with Copyright Law
- Interface with Patent Law- trademarks & Domain Names Related issues. Indian
Context of Jurisdiction and IT-Act, 2000. , International Law and Jurisdictional Issues in
Cyberspace.
LEARNING RESOURCES
References
● Forouzan, B.A., Cryptography & Network Security. Tata McGraw-Hill

Education, 2010.
● Godbole,“ Information Systems Security”, Willey.
● IT Act 2000 Jeffrey M. Bradshaw, Software Agents (Editor). MIT Press.
● Kahate, A. Cryptography and Network Security. McGraw-Hill Higher Ed., 2009.
● Luger., Artificial Intelligence. 4 ed.- Pearson Education.
● Merkov, Breithaupt,“ Information Security”, Pearson Education
● Schou, Shoemaker, “Information Assurance for the Enterprise”, Tata McGraw
Hill,“Cyber Laws Simplified”, Mc Graw HillFurnell, “Computer Insecurity”,
Springer.
ASSESSMENT
SEMESTER III Course Code: CSA-CC-531 Credits: 4
ADVANCED LEARNING MODELS
COURSE OUTCOMES
CO1 Explain about fuzzy systems and networks.
CO2 Use fuzzy set theory for solving problems.
CO3 Familiar with Neuro-fuzzy systems and EM models.
CO4 Describe basic programming structure and control statements in scilab.
CO5 Implement KNN, ensemble and adaBoost classifiers for Machine learning.
CO6 Compare different ANN networks and working structure.
CO7 Compare different Deep architectures and their learning models.
C08 Familiarize with different deep frameworks like Tensorflow, Keras, Caffe, GAN.

CO1 Explain about fuzzy systems and networks. PSO1 U C
PSO2,
CO2 Use fuzzy set theory for solving problems. A P
PSO12
Familiar with Neuro-fuzzy systems and EM
CO3 PSO4 U C
models.
Describe basic programming structure and control PSO3,
CO4 U C
statements in scilab. PSO6
Implement KNN, ensemble and adaBoost
CO5 PSO1 A C, P
classifiers for Machine learning.
Compare different ANN networks and working
CO6 PSO8 An C, P
structure.
Compare different Deep architectures and their
CO7 PSO4 An C, P
learning models.
Familiarize with different deep frameworks like
C08 PSO6 U C
Tensorflow, Keras, Caffe, GAN.
COURSE CONTENT
MODULE I: Fuzzy Network-Fuzzy systems, Info Fuzzy networks, Fuzzy neural

systems, Fuzzy logic and fuzzy set, Fuzzy control, defining fuzzy operation, Making
Fuzzy decision, Fuzzy reasoning, De-fuzzification, Neuro-fuzzy systems, ANFIS, Types
of Neuro-fuzzy Systems, Applications and advantages of Fuzzy systems. Expectation
Maximization, General EM, EM algorithm, Features of EM, Mathematics of EM
MODULE II: Nearest neighborhood - Distance measure, Hamming distance, Euclidean

distance, City Block Distance, Square distance, KNN algorithm, KNN algorithm
implications, Nearest Neighborhood applications
MODULE III: Ensemble classifier, Types of ensemble, Simple ensemble models,

advanced ensemble models, AdaBoost, Bayes Optimal classifier, Bayesian model
averaging, Gradient boosting
MODULE IV: ANN basics, Types of networks, The perceptron, RBF networks, Self-
organising maps, Adaptive resonance theory, Recurrent neural network, Hopfield
networks, Boltzmann machines, Probabilistic neural network
MODULE V: Deep architecture -Recurrent and Recursive networks, Bidirectional

RNNs, Deep Recurrent Networks, Recursive Neural Networks, LSTM, GRU. Image
captioning, word prediction. Deep Belief networks, Convolutional neural networks,
Deep reinforcement learning, Geometric stability, Applications of deep learning.
MODULE VI: TensorFlow - Implementing object classification and detection using

CNN networks using any of deep libraries like Tensorflow, Keras, Caffe. Generative
Networks: Auto encoders, Generative Models, GANs framework, GANs application,
Variation auto encoders, DCGANS. Instance recognition, Category recognition, Context
and scene understanding.
LEARNING RESOURCES
References
● Aggarwal Charu – “Neural Networks and Deep Learning”, Springer, 2015.

● Aurélien Géron’s, "Hands-On Machine Learning with Scikit-Learn and
TensorFlow", O'Reilly Media, Inc.,2017.
● Ian Goodfellow, Yoshua Bengio, Aaron Courville – “Deep Learning”, MIT Press,
2016.
● Mike Krebbs - "Deep Learning with Python", CreateSpace Independent
Publishing Platform, 2018.
Prentice Hall of India, New Delhi, 2020.
ASSESSMENT
MACHINE INTELLIGENCE LAB
COURSE OUTCOMES
Implement the basic image processing operations like Histogram equalization,
CO1
thresholding, edge detection, data, data augmentation, morphological operations.
CO2 Implement SVM/Softmax classifier for CIFAR-10 dataset: (i) using KNN, (ii) using
3 layer neural network.
Study the effect of batch normalization and dropout in neural network classifier
CO3 Familiarization of image labelling tools for object detection, segmentation Image
segmentation using Mask RCNN, UNet, SegNet.
Implement Image Captioning with LSTMs, Network Visualization: Saliency maps,
CO4 Class Visualization, Generative Adversarial Networks, Chatbot using bi-
directional LSTMs.
CO5 Familiarization of cloud based computing like Google colab.

Implement the basic image processing
operations like Histogram equalization,
CO1 PSO8 C, A C, P
thresholding, edge detection, data, data
augmentation, morphological operations.
Implement SVM/Softmax classifier for CIFAR-
CO2 10 dataset: (i) using KNN, (ii) using 3 layer PSO9 C, A C, P
neural network.
Study the effect of batch normalization and
dropout in neural network classifier
CO3 Familiarization of image labelling tools for object PSO4 U, C C, P
detection, segmentation Image segmentation
using Mask RCNN, UNet, SegNet.
Image Captioning with LSTMs, Network
Visualization: Saliency maps, Class
CO4 PSO7 C C, P
Visualization, Generative Adversarial Networks,
Chatbot using bi-directional LSTMs.
Familiarization of cloud based computing like PSO3,
CO5 U, C C
Google colab. PSO6
CASE STUDY
COURSE OUTCOMES
Identify a research problem which is significant in the area of computer
CO1
science
CO2 Analyze the literature survey in the selected topic as an individual
CO3 Design the experiment with proper hypothesis
CO4 Evaluate and interpret the experimental results.
CO5 Analyze effectiveness of the method implemented.
CO6 Suggest modifications and improvement of the system.

Identify a research problem which is
CO1 PSO12 C C,P
significant in the area of computer science
PSO1,
Analyze the literature survey in the
CO2 PSO9, An C,P
selected topic as an individual
PSO13
PSO5,
Design the experiment with proper
CO3 PSO6, C C,P
hypothesis
PSO13
Evaluate and interpret the experimental PSO5,
CO4 An C,P
results. PSO6
Analyze effectiveness of the method
CO5 PSO8 An P
implemented.
Suggest modifications and improvement
CO6 PSO3 C P
of the system.
COURSE CONTENT
A case study is a detailed investigation done by a student on a specific topic in the

courses studied till third semester. It is a milestone and precursor to the final
presentation of the Project. The objective of doing Case Study allows students with real
expertise and understanding, how and why an innovation has worked in a specific case.
The students have to implement a published article from the Research and
Development area. The presentation will be oral. The report of the case study should
contain Background of the case, Analysis, Alternatives and recommendations and
Implementation plan.
SEMINAR
COURSE OUTCOMES
CO1 Acquire in-depth knowledge in specific area of study.
CO2 Develop presentation skill and communication skill.
CO3 Apply Professional skills for preparing presentation slides
CO4 Develop defending ability

Course Outcomes
PSO CL KC
PSO2,
Acquire in-depth knowledge in specific area of
CO1 PSO5, U,E C
study.
PSO6
Develop presentation skill and communication
CO2 PSO9 C C,P
skill
Apply Professional skills for preparing PSO3,
CO3 A C,P
presentation slides PSO11
CO4 Develop defending ability PSO13 C C,P
COURSE CONTENT
Seminar is an outstanding work, published in an international journal in the field that

covered in the course need to be presented. The in depth knowledge of the underlying
technology/method of the work is evaluated through this course. Students can make
use of the presentation aids to deliver the theoretical aspects of the work. The
interaction with the audience, Students and faculty is beneficial for the student to
strengthen the different aspects of the presentation such as presentation skill, depth of
knowledge, language and rendering, defending the questions.
SEMESTER III Course Code: CSA-DE-535(i) Credits: 4
FOUNDATIONS OF ROBOTICS
COURSE OUTCOMES:
CO1 Illustrate the evolution and technological advancements in Robotics
CO2 Demonstrate the working principle of robots
CO3 Articulate the working of sensors for the success of a robot
CO4 Describe the role of grippers in industrial robots
CO5 Sketch the Kinematics of robots
CO6 Outline the challenges and importance of robot programming

Course Outcomes
PSO CL KC
Illustrate the evolution and technological
CO1 PSO7 A C, P
advancements in Robotics
PSO8,
CO2 Demonstrate the working principle of robots A P
PSO9
Articulate the working of sensors for the success of a PSO5,
CO3 An C, P
robot PSO10
CO4 Describe the role of grippers in industrial robots PSO4 U C
PSO3,
CO5 Sketch the Kinematics of robots PSO7, C C, P
PSO9
Outline the challenges and importance of robot
CO6 PSO13 U C
programming
COURSECONTENT
MODULE I: Robotics history through research of the industry, applications of
automation and robotics, technologies and their implications on the field of robotics,
Robotics classification with respect to geometrical configuration (Anatomy), Controlled
system & chain type: Serial manipulator & Parallel Manipulator.
MODULE II: Components of Industrial robotics-precession of movement-resolution,
accuracy & repeatability-Dynamic characteristics- speed of motion, load carrying
capacity & speed of response
MODULE III: Sensors- types of sensors and ways in which they can be categorized,
internal sensors: Position sensors, Velocity sensors. External sensors: Proximity sensors,
Tactile Sensors, & Force or Torque sensors.
MODULE IV: Grippers – Mechanical Gripper-Grasping force-Engelberger-g-factors-
mechanisms for actuation, Magnetic gripper, vacuum cup gripper-considerations in
gripper selection & design. Industrial robots specifications. Selection based on the
Application.
MODULE V: Kinematics-Manipulators Kinematics, Rotation Matrix, Homogenous
Transformation Matrix, D-H transformation matrix, D-H method of assignment of
frames. Direct and Inverse Kinematics for industrial robots.
MODULE VI: Robot programming languages and systems – Levels of Robot
Programming, Sample Application, Requirements of a Robot Programming Language,
Problems peculiar to Robot Programming Language. Off-line programming systems

 Written for each modules will be made available in between the lectures.
 Presentation (Video) of different robots and its working.
 Model Your Idea Context – Illustrate and model a robot for your own idea.
LEARNING RESOURCES
References
 Craig, John J. Introduction to Robotics. Prentice Hall, 2017.
 Industrial Robotics (Special Indian Edition). Tata McGraw-Hill Education, 2012.
 Jazar, Reza N. Theory of Applied Robotics. Springer Science & Business Media,
2010.
 Yang, Richard (Chunhui), et al. Robotics and Mechatronics. Springer, 2019.
On-line Sources
 http://engineering.nyu.edu/mechatronics/smart/Archive/intro_to_rob/Intro2
Robotics.pdf
 http://www.mech.sharif.ir/c/document_library/get_file?uuid=5a4bb247-1430-
5e46-942c-d692dead831f&groupId=14040
ASSESSMENT
SEMESTER III Course Code: CSA-DE-535(ii) Credits: 4
INTERNET OF THINGS
COURSE OUTCOMES
CO1 Explain the significance of IoT technology in the modern digital world.
CO2 Explain the awareness of technologies behind IoT.
CO3 Compare IoT and machine to machine technologies.
CO4 Analyze Smart devices and IoT Systems.
CO5 Describe operating systems that support IoT.
CO6 Explain how IoT and Big Data get related.
CO7 Implement IoT concepts in python

Explain the significance of IoT technology in the

CO1 PSO2 U C
modern digital world.
CO2 Explain the awareness of technologies behind IoT. PSO3 U C
CO3 Compare IoT and machine to machine technologies. PSO7 An C,P
CO4 Analyze Smart devices and IoT Systems. PSO8 An C,P
CO5 Describe operating systems that support IoT. PSO4 An C, P
CO6 Explain how IoT and Big Data get related. PSO7 U, A C
CO7 Implement IoT concepts in python PSO6 C, A C,P
COURSE CONTENT
MODULE I: Introduction, to Internet Technology - Internet of Things and Related

Future Internet Technologies - Internet of everything - Internet of Things : Definition,
Vision, Characteristics, Physical design, Logical design, Functional blocks -
Communication models & APIs.
MODULE II: Internet Communication Technologies: Networks and Communication,

Processes, Data Management - IoT Related Standardization: Communication protocols,
Addressing Schemes - Machine to Machine (M2M): Difference between IoT and M2M,
Software define Network, M2M Service Layer Standardization - OGC Sensor Web for
IoT.
MODULE III: Smart Technology: Introduction, Smart devices, Smart environment, IoT
Components, Basic Principles - Embedded technology Vs IoT - Sensors, Wireless sensor
networks - Arduino - Raspberry Pi.
MODULE IV: Prototyping in IoT: Basics of prototypes, Communication in IoT,
Prototyping model, Data handling in IoT, fabryq, Bluetooth Low Energy, μfabryq,
Operating Systems for Low-End IoT Devices - Open Source OS: introduction, Contiki,
RIOT, FreeRTOS, TinyOS, OpenWSN - Closed Source OS : ThreadX, QNX, VxWorks,
Nucleus RTOS.
MODULE V: Big Data: Big Data versus IoT, Big Data in flucement in IoT, A cyclic
model of Big Data - Cloud and Internet of Things: Data Storage, Analysis and
Communication, Classifications, Characteristics of Big Data, Types of Big Data -
Analyzing of Data - Applications, Real time situations, Big Data tools - A combined
application of Cloud and Big Data in IoT.
MODULE VI: Introduction to Python, Introduction to different IoT tools - developing

applications through IoT tools - developing sensor based application through
embedded system platform - Implementing IoT concepts with python.
LEARNING RESOURCES
References
 Adrian McEwen, Hakim Cassimally, Designing internet of things, John Wiley &
Sons, 2013.
 Anthony Townsend, Smart cities: big data, civic hackers, and the quest for a new
utopia, WW Norton & Company, 2013.
 Anthony Townsend, Smart cities: big data, civic hackers, and the quest for a new
utopia, WW Norton & Company, 2013.
 Arshdeep Bahga, Vijay Madisetti, , Internet of things: a hands-on approach,
CreateSpace Independent Publishing Platform, 2013.
 Dieter Uckelmann, Mark Harrison, Michahelles Florian (Ed.), Architecting the
internet of things, Springer, 2011.
 Dr. Ovidiu Vermesan, Dr Peter Friess, Internet of Things: Converging
Technologies for Smart Environments and Integrated Ecosystems, River
Publishers, 2013.
 Olivier Hersent, David Boswarthick, Omar Elloumi The internet of things: key
applications and protocols, Wiley, 2012.
ASSESSMENT
SEMESTER III Course Code: CSA-DE-535(iii) Credits: 4
CLOUD COMPUTING
COURSE OUTCOMES
CO1 Discuss about Cloud Computing, its types and applications
Illustrate the application of Cloud Computing on technology, infra structure,
CO2
and globalize workspace.
CO3 Discuss the issues and challenges related to cloud computing.
CO4 Analyze the security and authentication management in cloud.
CO5 Design a private cloud and integration of different types of cloud
Summarize the steps of developing AWS instances, volumes and understanding
CO6
AWS services

Discuss about Cloud Computing, its types and
CO1 PSO2 U C
applications
Illustrate the application of Cloud Computing on
CO2 PSO7 A C
technology, infra structure, and globalize workspace.
Discuss the issues and challenges related to cloud
CO3 PSO8 U C
computing.
Analyze the security and authentication management
CO4 PSO4 An C,P
in cloud.
Design a private cloud and integration of different
CO5 PSO9 An P
types of cloud
Summarize the steps of developing AWS instances,
CO6 PSO10 E C, P
volumes and understanding AWS services
COURSE CONTENT
MODULE I: Cloud computing-Definition, Characteristics, Cloud Architecture,

Deployment models, Merits and demerits of cloud computing, Application areas
MODULE II: Cloud Services - Infrastructure as a Service (IaaS)- Resource
Virtualization( Server, Storage, Network), Platform as a Service (PaaS) - Cloud platform
& Management (Computation, Storage), Software as a Service (SaaS) - Web services,
Web 2.0, Web OS.
MODULE III: Cloud Security - Cloud issues and challenges, Cloud provider Lock-in,
Infrastructure Security, Data and Storage security.
MODULE IV: Cloud Management - Authentication Management, Access Control,
Trust, Reputation, Cloud contracting Model, Availability and disaster recovery
strategies in Cloud.
MODULE V: Understanding Services and Applications - Cloud SOA, Basics of
developing a private cloud, Moving applications to the cloud, Integration of clouds.
MODULE VI: AWS – Introduction to Amazon web services, AWS architecture and
terminology, Managing and creating Amazon EC2 instances and EBS volumes,
Understanding Simple Storage Service.
LEARNING RESOURCES
References
● Barrie Sosinsky ,”Cloud Computing Bible”, 2011, Wiley-India ,ISBN: 978-0-570-

90356-
● Nick Antonopoulos ,Lee Gillam ,”Cloud Computing: Principles, Systems and
Applications”2012, Springer, ISBN-13: 978-1849962407
● Rajkumar Buyya, James Broberg, Andrzej M. Goscinski,” Cloud Computing:
Principles and Paradigms”, 2011,Wiley,ISBN 978-0-570-88799-8
ASSESSMENT
SEMESTER III Course Code: CSA-DE-535(iv) Credits: 4
INTELLIGENT AGENT BASED COMPUTING
COURSE OUTCOMES:
CO1 Explain the significance of intelligent agents in the computing world.
Describe the basic concepts, methods, techniques, and tools for the use of
CO2
intelligent agents in computer-based systems.
CO3 Identify the components and functions of intelligent agents.
Apply the principles and methods of intelligent agents to a small-scale
CO4
application problem
CO5 Critically evaluate Agent Oriented methodologies.
CO6 Explain the problem solving and planning among agents
CO7 Apply agent based modeling techniques for solving real life problems
Illustrate Agent oriented methodologies including Gaia Methodology, MASE,
CO8
OPEN process framework, Tropos with neat diagram
CO1 Explain the significance of intelligent agents in PSO2,

An C
the computing world. PSO4
Describe the basic concepts, methods, techniques,
CO2 PSO7, U F
and tools for the use of intelligent agents in
PSO10
computer-based systems.
CO3 Identify the components and functions of PSO4, U F,C
intelligent agents. PSO7
CO4 Apply the principles and methods of intelligent A P
PSO12
agents to a small-scale application problem
PSO2,
CO5 Critically evaluate Agent Oriented methodologies PSO7, E C,P
PSO12
CO6 Explain the problem solving and planning among PSO7, An C
agents PSO12
PSO5,
CO7 Apply agent based modeling techniques for A C,P
PSO7,
solving real life problems
PSO12
Illustrate Agent oriented methodologies including PSO2,
CO8 Gaia Methodology, MASE, OPEN process PSO7, A C,P
framework, Tropos with neat diagram PSO12
COURSE CONTENT
MODULE I: Introduction What are agents Abstract architectures for intelligent agents
Concrete architecture for intelligent agents Agent Programming languages Multi-agent
Systems and Societies of Agents Introduction Agent Communications Agent Interaction
Protocols Societies of Agents.
MODULE II: Distributed Problem Solving and Planning Introduction Task Sharing
Result Sharing Distributed Planning Distributed Plan Representations- Distributed
Planning and Execution.
MODULE III: Distributed Rational Decision making- Introduction Evaluation Criteria
Voting Auctions Bargaining _ General Equilibrium market mechanisms Contract nets
coalition formation learning in multi-agent systems general characterization Learning
and activity coordination learning about and from other agents.
MODULE IV: Computational Organization Theory Introduction Organizational
Concepts useful in modeling organizations Formal Methods in DAI Logic based
representation and reasoning.
MODULE V: Agents Development frameworks and languages-Development tools
applications of agents. Agent Oriented methodologies - Agent oriented analysis and
design.
MODULE VI: Agent Oriented Methodologies: Gaia Methodology, MASE, OPEN
process framework, Tropos, Agent UML. Agent-based modeling - Entities in Agent-
Based Modeling- An Example of Agent-Based Models- Tools for Agent-Based
Modeling.
LEARNING RESOURCES
References
 M. Wooldridge: Reasoning about Rational Agents. MIT Press, 2000

 Michael Wooldridge: An Introduction to MultiAgent Systems (2nd ed.). Wiley,
2009. ISBN 978-0-570-51946-2.
 Stuart Russell and Peter Norvig: Artificial Intelligence: A Modern Approach (3rd
ed.). Prentice Hall, 2009. ISBN 978-G. Weiss (ed.): Multi-Agent Systems - A
Modern Approach to Distributed Artificial Intelligence (2nd ed.). MIT Press, 2013
On-line Sources
 Introduction to Agent-Based Modelling https://dimensionless.in/introduction-
to-agent-based-modelling/
ASSESSMENT
SEMESTER III Course Code: CSA-DE-535(v) Credits: 4
HIGH PERFORMANCE COMPUTING
COURSE OUTCOMES
CO1 Illustrate the computational complexity of modern problem methodology.
CO2 Demonstrate the working of parallel computing.
CO3 Discuss the nature and working of parallel algorithms.
CO4 Demonstrate the randomization techniques in parallel programming.
CO5 Illustrate the use SPMD Programming.
CO6 Assess the performance of the parallel programming.

Illustrate the computational complexity of
CO1 PSO4 A C, P
modern problem methodology.
CO2 Demonstrate the working of parallel computing. PSO8 A P
Discuss the nature and working of parallel
CO3 PSO9 U C
algorithms.
Demonstrate the randomization techniques in
CO4 PSO10 A C, P
parallel programming.
CO5 Illustrate the use SPMD Programming. PSO7 A C, P
Assess the performance of the parallel
CO6 PSO4 E C, P
programming.
COURSECONTENT
MODULE I: Review of Computational Complexity, Granularity and Partitioning,
Locality: temporal, spatial, stream, kernel, Basic methods for parallel programming,
Real-world case studies (drawn from multiscale, multi-discipline applications)
MODULE II: High-End Computer Systems: Memory Hierarchies, Multi-core
Processors: Homogeneous and Heterogeneous, Shared-memory Symmetric
Multiprocessors, Vector Computers, Distributed Memory Computers, Supercomputers
and Petascale Systems, Application Accelerators / Reconfigurable Computing, Novel
computers: Stream, multithreaded, and purpose-built
MODULE III: Parallel Algorithms: Parallel models: ideal and real frameworks, Basic
Techniques: Balanced Trees, Pointer Jumping, Divide and Conquer, Partitioning,
Regular Algorithms: Matrix operations and Linear Algebra, Irregular Algorithms: Lists,
Trees, Graphs.
MODULE IV: Randomization: Parallel Pseudo-Random Number Generators, Sorting,
Monte Carlo techniques. Parallel Programming: Revealing concurrency in applications,
Task and Functional Parallelism, Task Scheduling, Synchronization Methods, Parallel
Primitives (collective operations).
MODULE V: SPMD Programming (threads, OpenMP, MPI), I/O and File Systems,
Parallel Matlabs (Parallel Matlab, Star-P, Matlab MPI), Partitioning Global Address
Space (PGAS) languages (UPC, Titanium, Global Arrays)
MODULE VI: Achieving Performance: Measuring performance, Identifying
performance bottlenecks, restructuring applications for deep memory hierarchies,
Partitioning applications for heterogeneous resources, using existing libraries, tools, and
frameworks.
 Written ASSIGNMENTS for each modules will be made available in between the
lectures.
 Presentation (Video) of different robots and its working.
 Model Your Idea Context – Illustrate and model a robot for your own idea.
LEARNING RESOURCES
References
 Bader, David A. Petascale Computing. CRC Press, 2007.
 David Culler Jaswinder Pal Singh,"Parallel Computer Architecture: A
hardware/Software Approach", Morgan Kaufmann, 1999.
 G.E. Karniadakis, R.M. Kirby II, Parallel Scientific Computing in C++ and MPI:
A Seamless Approach to Parallel Algorithms and their Implementation,
Cambridge University Press,2003.
 G.S. Almasi and A. Gottlieb, Highly Parallel Computing, 2/E, Addison-Wesley,
1994.
 Grama, A. Gupta, G. Karypis, V. Kumar, An Introduction to Parallel Computing,
Design and Analysis of Algorithms: 2/e, Addison-Wesley, 2003.
On-line Sources
 http://index-
of.co.uk/Algorithms/Petascale%20Computing%20Algorithms%20and%20Appli
cations.pdf
 http://srmcse.weebly.com/uploads/8/9/0/9/8909020/introduction_to_parallel
_computing_second_edition-ananth_grama..pdf
ASSESSMENT
SEMESTER III Course Code: CSA-DE-536(i) Credits: 4
OPTIMIZATION TECHNIQUES
COURSE OUTCOMES
CO1 Identify the concepts of optimization techniques and its types
CO2 Discuss different optimum design concepts and methods
CO3 Solve the Linear Programming models using graphical and simplex methods
Evaluate different algorithmic methods for solving constrained and
CO4
unconstrained optimization problems
CO5 Explain the need of optimization of engineering systems
Illustrate how dynamic programming used to solve multi stage decision
CO6
problems

PSO2,
Identify the concepts of optimization
CO1 PSO7, U F,P
techniques and its types PSO12
PSO2,
Discuss different optimum design concepts
CO2 PSO7, U C
and methods PSO12
PSO2,
Solve the Linear Programming models using
CO3 PSO7, A C, P
graphical and simplex methods PSO12
Evaluate different algorithmic methods for PSO2,
CO4 solving constrained and unconstrained PSO7, E C, P
optimization problems PSO12
PSO2,
Explain the need of optimization of
CO5 PSO7, An C
engineering systems PSO12
PSO2,
Illustrate how dynamic programming used
CO6 PSO7, A C,P
to solve multi stage decision problems PSO12
COURSE CONTENT
MODULE I: Optimization: Introduction, Statement of an Optimization problem,

formulation of Optimal Problem, Types of Optimization problem.
MODULE II: Optimum design concepts: Definition of Global and Local optima,
Optimality criteria, Convexity and concavity of functions of one and two variables,
Lagrangian function, Hessian matrix formulation.
MODULE III: Linear programming: Standard form of Linear Programming Problem,
Canonical form, Elementary operations, Graphical method for two variable
optimization problem, Simplex method, Karmarkar’s projective scaling method.
MODULE IV: Optimization algorithms for solving unconstrained optimization

problems – Gradient based method: Cauchy’s steepest descent method, Newton’s
method, Conjugate gradient method.
MODULE V: Optimization algorithms for solving constrained optimization problems

– direct methods – penalty function methods – steepest descent method
MODULE VI: Dynamic Programming: Representation of multistage decision process,

Types of multistage decision problems, Computational procedure in dynamic
programming.
LEARNING RESOURCES
References
1. G. Hadley, Linear programming, Narosa Publishing House, New Delhi, ISBN

13: 9788185015910.
2. Singiresu S. Rao, Engineering Optimization: Theory and Practice by John Wiley
and Sons,(5th edition),ISBN: 978-1-119-55479-3.
ASSESSMENT
SEMESTER III Course Code: CSA-DE-536(ii) Credits: 4
SOCIAL NETWORK ANALYSIS
COURSE OUTCOMES:
CO1 Identify the basic concepts semantic web and social networks.
CO2 Explain how semantic web and ontology related.
Describe about the basic concepts and measures of Social Network Analysis
CO3
including ego networks, tie strength, key players and cohesion.
Discuss about the basic metrics used in Social network analysis degree
CO4
distribution, clustering coefficient, clique, k-core, k-plex and network motifs.
Explain the centralities and find the relevance of web pages using page
CO5
ranking algorithms.
CO6 Discuss about the affiliation networks, graphs and its partitioning techniques.
Implement an algorithm to solve social media mining and sentimental
CO7
analysis.

Identify the basic concepts semantic web and social
CO1 PSO4 U F, C
networks.
CO2 Explain how semantic web and ontology related. PSO8 U C
Describe about the basic concepts and measures of
CO3 Social Network Analysis including ego networks, PSO10 U F, C
tie strength, key players and cohesion.
Discuss about the basic metrics used in Social
network analysis degree distribution, clustering
CO4 PSO9 U C, P
coefficient, clique, k-core, k-plex and network
motifs.
Explain the centralities and find the relevance of
CO5 PSO9 U C, P
web pages using page ranking algorithms.
Discuss about the affiliation networks, graphs and
CO6 PSO8 U C
its partitioning techniques.
Implement an algorithm to solve social media
CO7 PSO10 A P
mining and sentimental analysis.
COURSE CONTENT
MODULE I: Introduction to Semantic Web and social networks, limitations of current
web, emergence of social web, Ontology and Semantic Web-Ontology based knowledge
Representation; Resource Description Framework;
MODULE II: Network analysis - Social Network analysis, Key concepts and
measures- Networks- structure- Nodes and edges, network diameter ,ego networks, tie
strength- homophily, transitivity, key players- centrality measures, Cohesion-
reciprocity, density, clustering, average and longest distance, small worlds, preferential
attachment, Applications of SNA.
MODULE III: Basic metrics for social network analysis - Degree distribution, clustering
coefficient, Cliques, k- cores, k-clans, k-plexes, F-groups, Frequent patterns - Network
motifs.
MODULE IV: Centralities and ranking on network- Node centrality metrics: degree ,
closeness and betweenness, eigenvector centrality, Katz centrality, Page Ranking
Algorithm, HITS.
MODULE V: Network communities- Divisive methods, Graph partitioning and cut

metrics. Edge betweenness. Modularity clustering. Affiliation network and bipartite
graphs.
MODULE VI: Information and influence propagation on networks, Social Diffusion,

Basic cascade model, Influence maximization, Social media mining-sentiment mining.
LEARNING RESOURCES
References
● Borko Furht, “Handbook of Social Network Technologies and Applications”, 1st

Edition, Springer, 2010.
● Dion Goh and Schubert Foo, “Social information Retrieval Systems: Emerging
Technologies and Applications for Searching the Web Effectively”, IGI Global
Snippet, 2008.
● Guandong Xu ,Yanchun Zhang and Lin Li, “Web Mining and Social Networking
– Techniques and applications”, First Edition Springer, 2011.
● Maksim Tsvetovat, Alexander Kouznetsov; ”Social Network Analysis for
Startups: Finding Connections on the Social Web”; O'Reilly Media, Inc., ISBN
1449306462, 9781449306465
● Peter J. Carrington, John Scott, Stanley Wasserman; “Models and Methods in
Social Network Analysis”; Cambridge University Press; ISBN 1139443437,
9781139443432
● Peter Mika, “Social Networks and the Semantic Web”, First Edition, Springer
2007.
● Song Yang, Franziska B. Keller, Lu Zheng; “Social Network Analysis: Methods
and Examples”; SAGE Publications; ISBN 1506362125, 9781506362120.
ASSESSMENT
SEMESTER III Course Code: CSA-DE-536(iii) Credits: 4
ARTIFICIAL INTELLIGENCE IN CYBER SECURITY
COURSE OUTCOMES
Explain the fundamentals of Artificial Intelligence and Cyber Security..
CO1
(Understand)
CO2 Identify the challenges in Cyber security with and without Artificial Intelligence.
CO3 Familiar with AI enabled cyber attacks and Threats.
CO4 Describe about Artificial Intelligence enabled network and data security.
CO5 Compare different applications and software powered with Artificial Intelligence.
CO6 Analyze machine learning algorithms in cyber security with examples.

Explain the fundamentals of Artificial Intelligence
CO1 PSO1 U C
and Cyber Security.. (Understand)
Identify the challenges in Cyber security with and
CO2 PSO4 A C, P
without Artificial Intelligence.
Familiar with AI enabled cyber attacks and
CO3 PSO7 U C
Threats.
Describe about Artificial Intelligence enabled
CO4 PSO1 U C, P
network and data security.
Compare different applications and software
CO5 PSO8 U C
powered with Artificial Intelligence.
Analyze machine learning algorithms in cyber PSO1,
CO6 An C, P
security with examples. PSO2
COURSECONTENT
MODULE I: Artificial Intelligence: introduction, applications, challenges, machine

learning and deep learning (basics only) – Cyber security: threats, cryptography,
network security, authenticity, phishing, spamming and spoofing. Artificial Intelligence
in cyber security: introduction, challenges, applications – AI powered attacks and
threats - AI-powered Attacks and corresponding mitigations – AI vs. AI.
MODULEII: AI powered network security: network anomaly detection, botnet

detection, insider test, DDoS detection and prevention. – Information security-
Authentication abuse, account reputation scoring, user authentication security,
biometric authentication.
MODULE III: AI powered cloud based security- fraud detection – credit card frauds –
AI for social engineering- speech recognition, face recognition, deep fake detection, lie
detection, Fake news and fake review detection.
MODULE IV: AI-based defense mechanism- CAPTCHA breaker, neural network

assisted fuzzing, vulnerability scanner, malicious URL detector, software vulnerability
detection. – Wireless indoor localization, Ad blocking.
MODULEV: Data security with AI- password cracking, deep steganography and steg-
analysis, Encryption using AI. – Application analysis- introduction, Android
applications, Gmail and YouTube – social media data security.
MODULE VI: AI powered Cyber security-case study analysis: Spam detection (NN
perceptron, SVM) – Phishing detection (logistic regression and decision trees) –
Malware threat detection (K-means clustering, HMM, Deep learning).
LEARNING RESOURCES
References
 Alessandro Parisi, "Hands-On Artificial Intelligence for Cybersecurity", Packt

publishing 2019, 978-1-789-80402-7.
 Emmanuel Tsukerman, " Machine Learning for Cybersecurity Cookbook", Packt
publishing 2019, 978-1-789-80402-7.
 Leslie F. Sikos, " AI in Cybersecurity", Springer publishing 2019, 978-3-319-98842-
9.
 Christiansen, Bryan, Piekarz, Agnieszka, " lobal Cyber Security Labor Shortage
and International Business Risk", IGI global 2019, 978-1-552-55927-6.
ASSESSMENT
SEMESTER III Course Code: CSA-DE-536(iv) Credits: 4
SMART APPLICATIONS
COURSE OUTCOMES
Describe methods and technologies for the development of smart connected
CO1
applications.
Explain about smart objects, mobile devices (smart phones, tablets), wearables
CO2
(smart watches, fitness trackers) and home automation devices.
Discuss about management of smart devices in virtual environments, human
CO3
user-centered environments and physical environments.
CO4 Articulate the concepts of Autonomous systems and artificial life.
CO5 Assess common designs for smart applications.
CO6 Examine development platforms and cloud services for smart applications.

Describe methods and technologies for the
CO1 PSO1 U, A C
development of smart connected applications.
Explain about smart objects, mobile devices
CO2 (smart phones, tablets), wearable (smart watches, PSO8 U F, C
fitness trackers) and home automation devices.
Discuss about management of smart devices in
CO3 virtual environments, human user-centered PSO4 U C
environments and physical environments.
Articulate the concepts of Autonomous systems
CO4 PSO8 U C, P
and artificial life.
CO5 Assess common designs for smart applications. PSO9 E C, P
Examine development platforms and cloud
CO6 PSO3 U, A P
services for smart applications.
COURSE CONTENT
MODULE I: Smart devices and services: Service architecture models, service provision
life-cycle, virtual machines and operating systems, Application and requirements,
device technology and connectivity. Smart mobiles, cards and device networks: Smart
mobile devices, users, resources and code, operating systems for mobile computers and
communicator devices, smart card devices, device networks
MODULE II: Management of smart devices - Managing smart devices in virtual
environments, managing smart devices in human user-centered environments,
managing smart devices in physical environments. Smart Expert system - Building
Smart systems using different learning techniques, smart system applications, agent
based concurrent engineering
MODULE III: Human Computer Interaction: Explicit HCI, Implicit HCI, User Interface
and Interaction for four hand-held widely used devices, Hidden UI via basic smart
devices, Hidden UI via wearable and implanted devices, Human centered design, user
models, iHCI Design.
MODULE IV: Autonomous systems and artificial life - Basic autonomous intra-acting
systems, reflective and self-aware systems, self-management and autonomic computing,
complex systems, artificial life
MODULE V: Common designs for smart applications (e.g. fuzzy logic in control
systems or cloud analysis of field sensors data streams). Make or buy: selecting
appropriate procurement strategies). Development platforms for smart objects (e.g.:
Brillo (IoT devices) or Android TV (Smart TVs). Development platforms for smart
architectures (e.g. TensorFlow (server-side RNNs), or the Face Recognition API
(mobile)). Cloud services for smart applications (e.g. Google Cloud Machine Learning
API, Google Cloud Vision API, Google Cloud Speech API, or Deploying Deep Neural
Networks on Microsoft Azure GPU VMs)
MODULE VI: Deployment and operations (e.g.: cloud hosting vs. device hosting, or
harnessing user feedback to drive improvement). Measuring success: methods and
metrics (e.g: defining user engagement and satisfaction metrics, or assessing the
naturalness of smart interactions)
LEARNING RESOURCES
References
● Aurélien Géron’s - "Hands-On Machine Learning with Scikit-Learn and

TensorFlow", O'Reilly Media, Inc.,2017
● Jan Holler, Vlasios Tsiatsis, Catherine Mulligan, Stefan Avesand, Stamatis
Karnouskos, David Boyle – “From Machine-to-Machine to the Internet of Things:
Introduction to a New Age of Intelligence”, Elsevier Science Publishing, 2014.
● Stefan Poslad –“Ubiquitous Computing, Smart devices, environment and
interaction”, Wiley, 2011
ASSESSMENT
SEMESTER III Course Code: CSA-DE-536(v) Credits: 4
NATURE INSPIRED COMPUTING
COURSE OUTCOMES
CO1 Describe about bio inspired computing fundamentals. (Understand)
CO2 Explain about optimization problems and its types.(Understand)
CO3 Familiar with Genetic algorithm and its applications. (Understand)
CO4 Compare different Ant Colony Optimization algorithmic models. (Analyze)
Compare different Artificial Bee Colony Optimization algorithmic models.
CO5
(Analyze)
CO6 Illustrate Particle swam optimization algorithm with an example. (Apply)
CO7 Compare different natural inspired computing algorithms. (Analyze)

Describe about bio inspired computing
CO1 PSO1 U F, C
fundamentals. (Understand)
Explain about optimization problems and its
CO2 PSO4 U C
types.(Understand)
Familiar with Genetic algorithm and its
CO3 PSO7 U C
applications. (Understand)
Compare different Ant Colony Optimization
CO4 PSO8 An C, P
algorithmic models. (Analyze)
Compare different Artificial Bee Colony
CO5 PSO9 An C, P
Optimization algorithmic models. (Analyze)
Illustrate Particle swam optimization algorithm
CO6 PSO4 A P
with an example. (Apply)
Compare different natural inspired computing
CO7 PSO9 U C, P
algorithms. (Analyze)
COURSE CONTENT
MODULE I: Models of Life and Intelligence - Fundamentals of bio-inspired models and

bio-inspired computing. Evolutionary models and techniques, Swarm models and its
self-organisation, swarm and evolutionary algorithms. Optimisation problems – single
and multi-objective optimisation, heuristic, meta-heuristic and hyper heuristic
functions.
MODULE II: Genetic algorithms - Mathematical foundation, Genetic problem solving,
cross over and mutation. genetic algorithms and Markov process, applications of
genetic algorithms
MODULE III: Ant Colony Algorithms - Ant colony basics, hybrid ant system, ACO in
combinatorial optimisation, variations of ACO, case studies.
MODULE IV: Particle Swam algorithms - particles moves, particle swarm optimisation,
variable length PSO, applications of PSO, case studies.
Artificial Bee Colony algorithms - ABC basics, ABC in optimisation, Multi-dimensional
bee colony algorithms, applications of bee algorithms, case studies.
MODULE V: Selected nature inspired techniques - Hill climbing, simulated annealing,

Gaussian adaptation, Cuckoo search, Firey algorithm, SDA algorithm, bat algorithm,
case studies.
Other nature inspired techniques - Social spider algorithm, Cultural algorithms,
Harmony search algorithm, Intelligent water drops algorithm, Artificial immune
system, Flower pollination algorithm, case studies.
MODULE VI: Selected nature inspired optimization techniques - Bacterial colony

optimization, Glow-worm Swarm optimization, Plant growth adaptation in
optimization, Termite colony optimization, African Buffalo optimization, case studies.
LEARNING RESOURCES
References
● Albert Y.Zomaya - "Handbook of Nature-Inspired and Innovative Computing",

Springer, 2006
● Floreano, D. and C. Mattiussi -"Bio-Inspired Artificial Intelligence: Theories,
Methods, and Technologies", MIT Press, 2008
● Leandro Nunes de Castro - " Fundamentals of Natural Computing, Basic
Concepts, Algorithms and Applications", Chapman & Hall/ CRC, Taylor and
Francis Group, 2007
● Marco Dorrigo, Thomas Stutzle -” Ant Colony Optimization”, Prentice Hall of
India, New Delhi, 2005
ASSESSMENT
SEMESTER III Course Code: CSA-GC-502 Credits: 2
ARTIFICIAL INTELLIGENCE AND DAILY LIFE
COURSE OUTCOMES
Demonstrate fundamental understanding of the history of artificial intelligence
CO1
(AI) and its foundations.
Demonstrate awareness and a fundamental understanding of various applications
CO2 of AI techniques in intelligent agents, expert systems, Natural language Processing
- machine learning models.
Demonstrate an ability to share in discussions applications of AI, its current scope
CO3
and limitations.
CO4 Apply basic principles of AI in solving daily life.

Demonstrate fundamental understanding of the
CO1 history of artificial intelligence (AI) and its PSO1 A F, C
foundations.
Demonstrate awareness and a fundamental
understanding of various applications of AI
CO2 techniques in intelligent agents, expert systems, PSO10 A C, P
Natural language Processing - machine learning
models.
Demonstrate an ability to share in discussions
CO3 applications of AI, its current scope and PSO8 A C, P
limitations.
CO4 Apply basic principles of AI in solving daily life. PSO7 A P
COURSE CONTENT
MODULE I: Introduction to Artificial Intelligence- History of AI- Advantages and

Disadvantages of AI- Applications- AI domains.
MODULE II: Search and Control Strategies- State- Space representation- Problem
Solving - Heuristic Techniques – Hill Climbing – Simulated Annealing – Generate and
Test, Problem reduction- Constraint Satisfaction- Means End Analysis.
MODULE III: Machine Learning- Supervised and Unsupervised Algorithms- Neural
Networks- Classification and Predictions model – Applications.
MODULE IV: Natural Language Processing - Natural Language Processing Tasks -

NLP Applications- Recommender System - Sentimental Analysis.
MODULE V: Introduction to Game Theory- Two player game - Mini- Max Procedure-
Alpha Beta Cut off.
MODULE VI: AI in real life, Expert system - Expert system development- Modern
expert systems.
LEARNING RESOURCES
References
 Stuart Russell and Peter Norvig, Artifcial Intelligence: A Modern Approach

Third Edition Pearson Education 2010 Inc. ISBN: 978-0-13-604259-5.
 Dan W Patterson, Artificial Intelligence, Prentice Hall of India (1999)
 Nils J.Nilsson, Artificial Intelligence, ELSEVIER.
 E.Rich and K.Knight, Artificial Intelligence, - TMH
On-line Sources
 https://www.tutorialspoint.com/artificial_intelligence/artificial_intelligence_o
verview.htm
ASSESSMENT
SEMESTER IV Course Code: CSA-CC-541 Credits: 18
DISSERTATION AND VIVA VOCE
COURSE OUTCOMES:
CO1 Identify a problem statement for the final project.
CO2 Perform literature review by analyzing the related works.
CO3 Implement the existing work from the literature.
CO4 Analyze the existing system capture the limitations.
CO5 Propose a method improvement to overcome the limitations.
CO6 Evaluate and interpret the design and experimental results.
CO7 Develop the skill set to write research papers and project thesis.

CO1 Identify a problem statement for the final project. PSO12 U C
Perform literature review by analyzing the related
CO2 PSO8 U C, P
works.
CO3 Implement the existing work from the literature. PSO9 A P
Analyze the existing system capture the
CO4 PSO6 An C, P
limitations.
Propose a method improvement to overcome the
CO5 PSO4 C C, P
limitations.
Evaluate and interpret the design and
CO6 PSO3 E C, P
experimental results.
Develop the skill set to write research papers and PSO12,
CO7 C P
project thesis. PSO13
COURSE CONTENT
All the students have to do a project work on a problem which has industry or research
potential as part of this course. The project work can be done in any of the following -
R&D institutions, MNC - IT companies and Department. At the end of the course, all
the students should submit a project report with the details of the work done, findings
and suggestions for evaluation. There will be internal and external evaluation of the
work.
All students need to attend a course viva of the programme at the end of project work.
All students will be evaluated by a panel of experts on their knowledge on different
courses in the program, case studies done and the final project work. There will be
evaluation of their professional development acquired by the programme.

MSC AI Syllabus

Uploaded by

Copyright:

Available Formats

MSC AI Syllabus

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

MSC AI Syllabus

Uploaded by

Copyright:

Available Formats

Department of Computer Science

M.Sc. Computer Science

PROGRAMME SPECIFIC OUTCOMES

Core courses (CC)

MATHEMATICS FOR ARTIFICIAL INTELLIGENCE

TAGGING OF COURSE OUTCOMES

SUGGESTED CLASS ROOM ACTIVITIES

AUTONOMOUS SYSTEMS AND KNOWLEDGE REPRESENTATION

TAGGING OF COURSE OUTCOMES

MODULE I: Topics of Artificial Intelligence, Timelines of Artificial Intelligence,

MODULE II: Knowledge Representation - Knowledge Management, Types of

MODULE III: Reasoning - Types of reasoning, Non-monotonic reasoning, reasoning

MODULE IV: Game playing - Minimax procedure, Alpha-Beta pruning, combined

MODULEV: Expert systems - characteristics, components. Expert system development,

MODULE VI: Robotics – principles and components, operations, mathematics of

ALGORITHMS- COMPLEXITY AND OPTIMIZATION

TAGGING OF COURSE OUTCOMES

MODULE I: Concepts in algorithm analysis – the efficiency of algorithms, average and

MODULE V: Decision-Making: basics of utility theory, decision theory, sequential

MODULE VI: Stochastic optimization – Markov chains, Random search, Fuzzy

● Kalyanmoy Deb, “Optimization for Engineering Design, Algorithms and

ARTIFICIAL INTELLIGENCE LAB

TAGGING OF COURSE OUTCOMES

Implement the following algorithms and methods

1. Divide and Conquer.

SEMESTER I Course Code: CSA-SE-501 Credits: 2

TAGGING OF COURSE OUTCOMES

MODULE I: Introduction to entrepreneurship- Idea generation and business

MODULE II: Steps in Creativity - Innovation and invention- Legal Protection of

MODULE III: Introduction to Soft Skills- Communication Skills - Presentation Skills -

● C. R. Kothari – “ Research Methodology”, New Age International, 2004

INTRODUCTION TO MACHINE LEARNING AND APPLICATIONS

TAGGING OF COURSE OUTCOMES

MODULE I: Understanding Machine Learning -What Is Machine Learning? - Defining

MODULE III: Applying Machine Learning - Understanding Machine Learning

MODULE VI: Using Machine Learning to Provide Solutions to Business Problems -

THEORETICAL FOUNDATIONS OF MACHINE LEARNING

TAGGING OF COURSE OUTCOMES

MODULE I: Learning - Types of learning, learning of Input/ Output Function, history

MODULE III: Reinforcement learning - Reinforcement learning model, limitation of

MODULE V: Clustering - k-Means clustering, Facts about k-means, k-Means clustering

MODULE VI: Support Vector Machines- Margins, Learning a maximum hyperplane,

● C. Bishop - “Pattern Recognition and Machine Learning”, Springer, 2007.

ANALYTICS AND DATA SCIENCE

TAGGING OF COURSE OUTCOMES

CO1 Define data science, its scope and applications. PSO2 U F, C

MODULE I: Introduction: Data Science –Basic concepts, definition and architecture,

MODULE II: Statistics and Probability: Statistical measures, probability– conditional

MODULE III: Statistical learning - Stochastic processes, Markov process, HMM,

MODULE IV: Dimensionality Reduction, Clustering, Association Rules – Apriori

MODULE V: Singular value decomposition - Handwritten digits and simple algorithm

MODULE VI: Familiarization of R-Studio Integrated Development Environment (IDE)

DATABASE SYSTEMS FOR BIG DATA

TAGGING OF COURSE OUTCOMES

MODULE I :Review of basic concepts, Transaction processing concepts, ACID

MODULE V : NoSQL datastore – Introduction and motivation, Schema less models,

MODULE VI : MongoDB – Definition, Characteristics, SQL and MongoDB, Data

 Connolly, Thomas M; Begg, Carolyn E, Database systems: a practical approach to

TAGGING OF COURSE OUTCOMES