MAHENDRA ENGINEERING COLLEGE

(Autonomous)
Syllabus

Computer Science and Programme

Department 5032
Engineering Code
I Semester

Course code Course Name Hours/week Credit Maximum marks

L T P C
24CSE13101 RESEARCH METHODOLOGY 100
AND IPR 3 0 0 3

 To identify an appropriate research problem in their interesting domain

 To understand the data collections and measurements.
Objective(s)  To learn the data analysis and reporting.
 To know adequate knowledge on IPR
 To expose the law of patent process.
Upon completion of this course , students will be able to
 Identify the research problem and research process.
 Explain the data collection and sources.
Outcome(s)
 Prepare a well-structured research paper and scientific presentations
 Examine on various IPR components and process of filing.
 Prove the adequate knowledge on patent.
UNIT-I RESEARCH DESIGN 9

Overview of research process and design, Use of Secondary and exploratory data to answer the research
question, Qualitative research, Observation studies, Experiments and Surveys.

UNIT-II DATA COLLECTION AND SOURCES 9

Measurements, Measurement Scales, Questionnaires and Instruments, Sampling and methods. Data -
Preparing, Exploring, examining and displaying.

UNIT-III DATA ANALYSIS AND REPORTING 9

Overview of Multivariate analysis, Hypotheses testing and Measures of Association. Presenting Insights
and findings using written reports and oral presentation.

UNIT-IV NEW DEVELOPMENT IN IPR 9

New Development in IPR: Administration of Patent System – New developments in IPR – IPR of
Biological Systems – Computer Software etc – Traditional knowledge Case Studies – IPR and IITs

UNIT-V PATENTS 9

Research Scholar Supervisor

A.VIJAYALAKSHMI (24239697136) Dr. N.VISWANATHAN, (2740144)
(Signature with Name and date) (Signature with Name, date and seal)
Patents – objectives and benefits of patent, Concept, features of patent, Inventive step, Specification,
Types of patent application, process E-filing, Examination of patent, Grant of patent, Revocation,
Equitable Assignments, Licences, Licensing of related patents, patent agents, Registration of patent
agents.
Total hours to be taught 45 HOURS

TEXT BOOK :

Cooper Donald R, Schindler Pamela S and Sharma JK, “Business Research Methods”, Tata
1
McGraw Hill Education, 11e(2012).

2 Catherine J. Holland, “Intellectual property: Patents, Trademarks, Copyrights, Trade Secrets”,

Entrepreneur Press, 2007.
REFERENCES:

David Hunt, Long Nguyen, Matthew Rodgers,“ Patent Searching :tools & techniques”, Wiley,
1
2007.
The Institute of Company Secretaries of India, Statutory body under an Act of parliament,
2
“Professional Programme Intellectual Property Rights, Law and practice”, September2013.

MAHENDRA ENGINEERING COLLEGE (AUTONOMOUS) - SYLLABUS R 2022

Research Scholar Supervisor

A.VIJAYALAKSHMI (24239697136) Dr. N.VISWANATHAN, (2740144)
(Signature with Name and date) (Signature with Name, date and seal)
ELECTRONICS & PROGRAMME
DEPARTMENT 5041
COMMUNICATION ENGINEERING CODE

Elective

HOURS/WEEK CREDIT
COURSE MAXIMUM
COURSE NAME
CODE L T P C MARKS

PATTERN
22COM13013 RECOGNITION AND 3 0 0 3 100
MACHINE LEARNING

OBJECTIVES
 Study the fundamental of pattern classifier.
 To know about various clustering concepts.
 To originate the various structural pattern recognition and feature extraction.
 To understand the basic of concept learning and decision trees
 To explore recent advances in pattern recognition.

OUTCOMES
Upon completion of the course the student will be able to,
 Classify the data and identify the patterns.
 Explain about various clustering concepts
 Utilize the given data set to extract and select features for Pattern recognition.
 Describe the decision tree and concept learning.
 Discuss on recent advances in pattern recognition.

UNIT I PATTERN CLASSIFIER (9 Hrs)

Overview of Pattern recognition – Discriminant functions – Supervised learning –Parametric
estimation – Maximum Likelihood Estimation – Bayesian parameter Estimation – Problems with
Bayes approach– Pattern classification by distance functions –Minimum distance pattern classifier..
UNIT II CLUSTERING (9 Hrs)
Clustering for unsupervised learning and classification -Clustering concept – C-means algorithm –
Hierarchical clustering procedures -Graph theoretic approach to pattern clustering -Validity of
clusters.
FEATURE EXTRACTION AND STRUCTURAL
UNIT III (9 Hrs)
PATTERN RECOGNITION
KL Transforms – Feature selection through functional approximation – Binary selection -Elements
of formal grammars - Syntactic description - Stochastic grammars –Structural representation.
INTRODUCTION, CONCEPT LEARNING AND
UNIT IV (9 Hrs)
DECISION TREES

Research Scholar Supervisor

A.VIJAYALAKSHMI (24239697136) Dr. N.VISWANATHAN, (2740144)
(Signature with Name and date) (Signature with Name, date and seal)
Learning Problems – Designing Learning systems, Perspectives and Issues – Concept Learning –
Version Spaces and Candidate Elimination Algorithm – Inductive bias – Decision Tree learning –
Representation – Algorithm – Heuristic Space Search.
UNIT V RECENT ADVANCES (9 Hrs)
Neural network structures for pattern recognition -Neural network based pattern associators –
Unsupervised learning in neural pattern recognition -Self organizing networks -Fuzzy logic -Fuzzy
pattern classifiers -Pattern classification using Genetic Algorithms.

Total 45 Hrs
REFERENCES
 Duda R.O., and Hart.P.E., Pattern Classification and Scene Analysis, Wiley, New York,
1973.
 Morton Nadier and Eric Smith P., Pattern Recognition Engineering, John Wiley & Sons,
New York, 1993.
 Narasimha Murty M and Susheela Devi V, “Pattern Recognition – An Algorithmic
Approach”, Springer, Universities Press, 2011
 Robert J.Schalkoff, Pattern Recognition : Statistical, Structural and Neural Approaches,
John Wiley &Sons Inc., New York, 2007.
 Tom M. Mitchell, “Machine Learning”, McGraw-Hill Education (Indian Edition, 2013.
 Tou and Gonzalez, Pattern Recognition Principles, Wesley Publication Company,
London, 1974.

MAHENDRA ENGINEERING
COLLEGE
(Autono
Syllabus

Research Scholar Supervisor

A.VIJAYALAKSHMI (24239697136) Dr. N.VISWANATHAN, (2740144)
(Signature with Name and date) (Signature with Name, date and seal)
Computer Science Programme
Department and 5032
Code
Engineering
Program Elective
Maximum
Course code Course Name Hours/week Credit
marks
L T P C
24CSE15103 DATA SCIENCE 100
3 0 0 3
The student should be made to:
 To apply fundamental algorithms to process data.
 To learn hypotheses and data into actionable predictions.
 To understand the results and findings using visualization techniques.
Objective(s)
 To learn statistical methods and machine learning algorithms required for
Data Science.
 To develop the fundamental knowledge and understand concepts to
become a data
Upon completion of this course, students will be able to
 Explain clean/process and transform data.
 Analyze and interpret data using an ethically responsible approach.
 Use appropriate models of analysis, assess the quality of input,
derive insight from results, and investigate potential issues.
Outcome(s)  Apply computing theory, languages and algorithms, as
well as mathematical and statistical models, and the principles of
optimization to appropriately formulate and use data analyses.
 Formulate and use appropriate models of data analysis to solve business-
related challenges.
UNIT-I INTRODUCTION TO DATA SCIENCE 9

Data science process – roles, stages in data science project – working with data from files –
working with relational databases – exploring data – managing data – cleaning and
sampling for modeling and validation – introduction to NoSQL.

UNIT-II MODELING METHODS 9

Choosing and evaluating models – mapping problems to machine learning, evaluating
clustering models, validating models – cluster analysis – K-means algorithm, Naïve Bayes –
Memorization Methods – Linear and logistic regression – unsupervised methods.

UNIT-III INTRODUCTION TO R 9

Research Scholar Supervisor

A.VIJAYALAKSHMI (24239697136) Dr. N.VISWANATHAN, (2740144)
(Signature with Name and date) (Signature with Name, date and seal)
Reading and getting data into R – ordered and unordered factors – arrays and matrices –
lists and data frames – reading data from files – probability distributions – statistical models
in R - manipulating objects – data distribution.
UNIT-IV MAP REDUCE 9
Introduction – distributed file system – algorithms using map reduce, Matrix-
Vector Multiplication by Map Reduce – Hadoop - Understanding the Map Reduce
architecture - Writing Hadoop MapReduce Programs - Loading data into HDFS -
Executing the Map phase
-UNIT-V
Shuffling andDATA
sorting - Reducing phase
VISUALIZATION 9
Handling data, Choosing tools to visualize data, visualizing patterns over time, Visualizing
proportions, visualizing relationships, spotting differences, visualizing spatial relationships

Total hours 45 HOURS

TEXT BOOK :

1 Nina Zumel, John Mount, “Practical Data Science with R”, Manning
Publications,
2014.
2 Mark Gardener, “Beginning R - The Statistical Programming Language”, John
Wiley
& Sons, Inc., 2012.
REFERENCES:
1 W. N. Venables, D. M. Smith and the R Core Team, “An Introduction to R”, 2013.
2 Tony Ojeda, Sean Patrick Murphy, Benjamin Bengfort, Abhijit Dasgupta,
“Practical
Data Science
Nathan Cookbook”,
Yau, PacktThis:
“Visualize Publishing
TheLtd., 2014.
FlowingData Guide to Design,
3
Visualization, andStatistics”, Wiley, 2011.

MAHENDRA ENGINEERING
COLLEGE
(Autono

Research Scholar Supervisor

A.VIJAYALAKSHMI (24239697136) Dr. N.VISWANATHAN, (2740144)
(Signature with Name and date) (Signature with Name, date and seal)
Syllabus

Computer Science Programme

Department 5032
and Code
Engineering
Program
Elective
Maximum
Course code Course Name Hours/week Credit
marks

L T P C
24CSE15131 DEEP LEARNING 100
3 0 0 3
The student should be made to:
 To learn and develop and Train Deep Neural Networks.
 To understand a CNN, R-CNN, Fast R-CNN, Faster-R-CNN, Mask-
Objective(s) RCNN for detection and recognition.
 To explore and train RNNs, work with NLP and Word Embeddings
 To familiarize internal structure of LSTM and GRU and the
differences between them
 To know Auto Encoders for Image Processing

Upon completion of this course, students will be able to

 Explain Feature Extraction from Image and Video Data
 Implement Image Segmentation and Instance Segmentation in Images
Outcome(s)  Implement image recognition and image classification using a
pretrained network (Transfer Learning)
 Traffic Information analysis using Twitter Data
 Develop Autoencoder for Classification & Feature Extraction
UNIT-I DEEP LEARNING CONCEPTS 9

Fundamentals about Deep Learning. Perception Learning Algorithms. Probabilistic

modelling. Early Neural Networks. How Deep Learning different from Machine Learning.
Scalars. Vectors. Matrixes, Higher Dimensional Tensors. Manipulating Tensors. Vector
Data. Time Series Data. Image Data. Video Data.
UNIT-II NEURAL NETWORKS 9
About Neural Network. Building Blocks of Neural Network. Optimizers. Activation
Functions. Loss Functions. Data Pre-processing for neural networks, Feature
Engineering. Overfitting and Underfitting. Hyperparameters.
UNIT-III CONVOLUTIONAL NEURAL NETWORK 9

Research Scholar Supervisor

A.VIJAYALAKSHMI (24239697136) Dr. N.VISWANATHAN, (2740144)
(Signature with Name and date) (Signature with Name, date and seal)
About CNN. Linear Time Invariant. Image Processing Filtering. Building a convolution
neural network. Input Layers, Convolution Layers. Pooling Layers. Dense Layers.
Backpropagation Through the Convolutional Layer. Filters and Feature Maps.
Backpropagation Through the Pooling
Layers. Dropout Layers and Regularization. Batch Normalization. Various Activation
Functions.
Various Optimizers. LeNet, AlexNet, VGG16, ResNet. Transfer Learning with Image Data.
Transfer Learning using Inception Oxford VGG Model, Google Inception Model and
Microsoft
UNIT-IV ResNet Model. R- LANGUAGE
NATURAL CNN, Fast R-CNN, Faster R-CNN,
PROCESSING USINGMask-RCNN,
RNN YOLO 9
About NLP & its Toolkits. Language Modeling. Vector Space Model (VSM). Continuous
Bag of Words (CBOW). Skip-Gram Model for Word Embedding. Part of Speech (PoS)
Global Co- occurrence Statistics–based Word Vectors. Transfer Learning. Word2Vec.
Global Vectors for Word Representation GloVe. Backpropagation Through Time.
Bidirectional RNNs (BRNN). Long Short Term Memory (LSTM). Bi-directional LSTM.
Sequence-to-Sequence Models (Seq2Seq). Gated recurrent unit GRU.
UNIT-V DEEP REINFORCEMENT & UNSUPERVISED LEARNING 9
About Deep Reinforcement Learning. Q-Learning. Deep Q-Network (DQN). Policy Gradient
Methods. Actor-Critic Algorithm. About Autoencoding. Convolutional Auto Encoding.
Variational Auto Encoding. Generative Adversarial Networks. Autoencoders for Feature
Extraction. Auto Encoders for Classification. Denoising Autoencoders. Sparse Autoencoders
Total hours 45 HOURS

TEXT BOOK :
Deep Learning A Practitioner’s Approach Josh Patterson and Adam Gibson O’Reilly
1
Media, Inc.2017
2 Deep Learning Projects Using TensorFlow 2, Vinita Silaparasetty, Apress, 2020
REFERENCES:
1 Learn Keras for Deep Neural Networks, Jojo Moolayil, Apress,2018
2 Deep Learning with Python, François Chollet, Manning Shelter
Island,2017
3 Pro Deep Learning with TensorFlow, Santanu Pattanayak, Apress,2017

Research Scholar Supervisor

A.VIJAYALAKSHMI (24239697136) Dr. N.VISWANATHAN, (2740144)
(Signature with Name and date) (Signature with Name, date and seal)
MAHENDRA ENGINEERING
COLLEGE
(Autono
Syllabus

Computer Science Programme

Department and 5032
Code
Engineering
Program Elective
Maximum
Course code Course Name Hours/week Credit
marks

DATA L T P C
24CSE15121 100
VISUALIZATION
TECHNIQUES 3 0 0 3
The student should be made to:
 To explore skills to both design and critique visualizations.
Objective(s)  To provide visual perception and core skills for visual analysis.
 To understand technological advancements of data visualization
 To learn various data visualization techniques
 To know the methodologies used to visualize large data sets
Upon completion of this course, students will be able to
 Explain the objects in different dimensions.
 Design and process the data for Visualization.
 Apply the visualization techniques in physical sciences, computer
Outcome(s)
science,
applied mathematics and medical sciences.
 Apply the virtualization techniques for research projects.
 Identify appropriate data visualization techniques given
particular requirements imposed by the data. 9
UNIT-I INTRODUCTION AND DATA FOUNDATION

Basics - Relationship between Visualization and Other Fields -The Visualization Process -
Pseudo code Conventions - The Scatter plot. Data Foundation - Types of Data -
Structure within and between Records - Data Preprocessing - Data Sets
UNIT-II FOUNDATIONS FOR VISUALIZATION 9
Visualization stages - Semiology of Graphical Symbols - The Eight Visual Variables –
Historical Perspective - Taxonomies - Experimental Semiotics based on Perception
Gibson‘s Affordance theory – A Model of Perceptual Processing.
UNIT-III VISUALIZATION TECHNIQUES 9

Research Scholar Supervisor

A.VIJAYALAKSHMI (24239697136) Dr. N.VISWANATHAN, (2740144)
(Signature with Name and date) (Signature with Name, date and seal)
Spatial Data: One-Dimensional Data - Two-Dimensional Data – Three Dimensional Data -
Dynamic
Data - Combining Techniques. Geospatial Data : Visualizing Spatial Data - Visualization

Data -Visualization of Line Data - Visualization of Area Data – Other Issues in

Geospatial Data
Visualization Multivariate Data: Point-Based Techniques - LineBased Techniques - Region-
Based Techniques - Combinations of Techniques – Trees Displaying Hierarchical
Structures
UNIT-IV – Graphics and Networks-
INTERACTION DisplayingAND
CONCEPTS Arbitrary Graphs/Networks.
TECHNIQUES 9
Text and Document Visualization: Introduction - Levels of Text Representations - The
Vector Space Model - Single Document Visualizations -Document Collection
Visualizations – Extended Text Visualizations Interaction Concepts: Interaction Operators
- Interaction Operands and Spaces - A Unified Framework. Interaction Techniques:
Screen Space - Object-Space – Data Space - Attribute Space - Data Structure Space -
Visualization Structure – Animating Transformations - Interaction Control.
UNIT-V RESEARCH DIRECTIONS IN VISUALIZATIONS 9
Steps in designing Visualizations – Problems in designing effective Visualizations- Issues of
Data. Issues of Cognition, Perception, and Reasoning. Issues of System Design Evaluation ,
Hardware and Applications
Total hours 45 HOURS

TEXT BOOK :

1 Matthew Ward, Georges Grinstein and Daniel Keim, “Interactive Data

Visualization Foundations, Techniques, Applications”, 2010.

2 Colin Ware, “Information Visualization Perception for Design”, 4th Edition,

Morgan Kaufmann Publishers, 2021.
REFERENCES:
Robert Spence “Information visualization – Design for interaction”, Pearson
1
Education, 2nd
2 Edition,
Alexandru2007.
C. Telea, “Data Visualization: Principles and Practice,” A. K. Peters Ltd,
2008.

Research Scholar Supervisor

A.VIJAYALAKSHMI (24239697136) Dr. N.VISWANATHAN, (2740144)
(Signature with Name and date) (Signature with Name, date and seal)
MAHENDRA ENGINEERING COLLEGE(Autonomous)
Syllabus R-2024
Programme
Department 5041
Code
Elective
Course code Course Name Hours/week Credit Maximum marks
ARTIFICIAL L T P C
INTELLIGENC
3 0 0 3
24COM13022 E AND 100
MACHINE
LEARNING
 Study about uninformed and Heuristic search techniques.
 Learn techniques for reasoning under uncertainty
Objective(s)  Introduce Machine Learning and supervised learning algorithms
 Study about ensembling and unsupervised learning algorithms
 Learn the basics of deep learning using neural networks
UNIT-I PROBLEM SOLVING 9

Introduction to AI - AI Applications - Problem solving agents – search algorithms –

uninformed search strategies – Heuristic search strategies – Local search and optimization
problems – adversarial search – constraint satisfaction problems (CSP)

UNIT-II PROBABILISTIC REASONING 9

Acting under uncertainty – Bayesian inference – naïve bayes models. Probabilistic reasoning –
Bayesian networks – exact inference in BN – approximate inference in BN – causal networks.

UNIT-III SUPERVISED LEARNING 9

Introduction to machine learning – Linear Regression Models: Least squares, single &
multiple variables, Bayesian linear regression, gradient descent, Linear Classification Models:
Discriminant function – Probabilistic discriminative model - Logistic regression, Probabilistic
generative model – Naive Bayes, Maximum margin classifier – Support vector machine,
Decision Tree, Random forests
UNIT-IV ENSEMBLE TECHNIQUES AND 9
UNSUPERVISED LEARNING
Combining multiple learners: Model combination schemes, Voting, Ensemble Learning -
bagging, boosting, stacking, Unsupervised learning: K-means, Instance Based Learning: KNN,
Gaussian mixture models and Expectation maximization
UNIT-V NEURAL NETWORKS 9
Perceptron - Multilayer perceptron, activation functions, network training – gradient descent
optimization – stochastic gradient descent, error backpropagation, from shallow networks to

Research Scholar Supervisor

A.VIJAYALAKSHMI (24239697136) Dr. N.VISWANATHAN, (2740144)
(Signature with Name and date) (Signature with Name, date and seal)
deep networks –Unit saturation (aka the vanishing gradient problem) – ReLU, hyperparameter
tuning, batch normalization, regularization, dropout.
Total 45
 Use appropriate search algorithms for problem solving
 Apply reasoning under uncertainty
Outcome(s
 Build supervised learning models
)
 Build ensembling and unsupervised models
 Build deep learning neural network models

TEXT BOOKS:
Stuart Russell and Peter Norvig, “Artificial Intelligence – A Modern Approach”, Fourth
1 Edition, Pearson Education, 2021.

EthemAlpaydin, “Introduction to Machine Learning”, MIT Press, Fourth Edition, 2020.

2

REFERENCES:
1 Dan W. Patterson, “Introduction to AI and ES”, Pearson Education,2007
Kevin Night, Elaine Rich, and Nair B., “Artificial Intelligence”, McGraw Hill, 2008
2

Patrick H. Winston, "Artificial Intelligence", Third Edition, Pearson Education, 2006

3

Deepak Khemani, “Artificial Intelligence”, Tata McGraw Hill Education, 2013

4 (http://nptel.ac.in/)
Christopher M. Bishop, “Pattern Recognition and Machine Learning”, Springer, 2006.
5

Tom Mitchell, “Machine Learning”, McGraw Hill, 3rd Edition,1997.

6

Charu C. Aggarwal, “Data Classification Algorithms and Applications”, CRC Press,

7 2014
MehryarMohri, Afshin Rostamizadeh, Ameet Talwalkar, “Foundations of Machine
8 Learning”, MIT Press, 2012.

9 Ian Goodfellow, YoshuaBengio, Aaron Courville, “Deep Learning”, MIT Press, 2016

Research Scholar Supervisor

A.VIJAYALAKSHMI (24239697136) Dr. N.VISWANATHAN, (2740144)
(Signature with Name and date) (Signature with Name, date and seal)