9. FY MTech CSE Syllabus AY 2023_24

Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)

AY 2023-24
Course Information
Programme M.Tech. ( Computer science and engineering )
Class, Semester First Year M.Tech., Sem I
Course Code 7IC501
Course Name Research Methodology
Desired Requisites: None
Teaching Scheme Examination Scheme (Marks)

Lecture 2 Hrs/week ISE MSE ESE Total
Tutorial - 20 30 50 100
Practical - Nil
Interaction - Credits: 2
Course Objectives
To develop a research orientation among the students and to acquaint them with fundamentals of
1
research methods.
2 To develop understanding of the basic framework of research process and techniques
3 To identify various sources of information for literature review and data collection.
4 To develop an understanding of the ethical dimensions of conducting applied research.
5 To develop understanding about patent process.
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
CO1 Classify various methods to solve research problem. Apply
CO2 Construct a research problem in respective engineering domain. Apply
CO3 Investigate various data analysis techniques for a research problem. Analyze
CO4 Identify various Intellectual Property Rights procedures Apply
Module Module Contents Hours

Research Fundamentals
I What is research, types of research, the process of research, Literature survey and 4
review , Formulation of a research problem.
Research Methods
Research design- Meaning, Need and Types , Research Design Process, Measurement
II 5
and scaling techniques, Data Collection – concept, types and methods, Processing
and analysis of data, Design of Experiment
Analysis Techniques
Quantitative Techniques, Sampling fundamentals, Testing of hypothesis using
various tests like Multivariate analysis, Use of standard statistical software, Data
III 5
processing, Preliminary data analysis and interpretation, Uni-variate and bi-variate
analysis of data, testing of hypotheses.
Research Communication
Writing a conference paper, Journal Paper, Technical report, dissertation/thesis
IV writing. Presentation techniques, software used for report writing such as WORD, 4
Latex etc. Types of journal/conference papers
Intellectual Property Rights
Nature of Intellectual Property: Patents, Designs, Trade and Copyright. Process of
V Patenting and Development: technological research, innovation, patenting,
5
development. International Scenario: International cooperation on Intellectual
Property. Procedure for grants of patents, Patenting under PCT.
Patents and Patenting Procedures
Patent Rights: Scope of Patent Rights. Licensing and transfer of technology. Patent
information and databases. Geographical Indications. New Developments in IPR:
VI
Administration of Patent System. New developments in IPR; IPR of Biological 4
Systems, Computer Software etc. Traditional knowledge Case Studies, IPR and IITs
Text Books
1 C. R. Kothari, Research Methodology, New Age international
Deepak Chopra and Neena Sondhi, Research Methodology : Concepts and cases, Vikas
2
Publishing House, New Delhi
References
E. Philip and Derek Pugh, How to get a Ph. D. – a handbook for students and their supervisors,
1
open university press
Stuart Melville and Wayne Goddard, Research Methodology: An Introduction for Science &
2
Engineering Students
Useful Links
1 NPTEL Lectures
CO-PO Mapping
Programme Outcomes (PO)
1 2 3 4 5 6
CO1 2 1
CO2 2 2
CO3 2
CO4 2
The strength of mapping is to be written as 1,2,3; Where, 1:Low, 2:Medium, 3:High
Each CO of the course must map to at least one PO.
Assessment
There are three components of lab assessment, LA1, LA2 and Lab ESE.
IMP: Lab ESE is a separate head of passing. LA1, LA2 together is treated as In-Semester Evaluation.
Assessment Based on Conducted by Typical Schedule (for 26-week Sem) Marks
Lab activities, Lab Course During Week 1 to Week 6
LA1 30
attendance, journal Faculty Marks Submission at the end of Week 6
LA2 30
Lab ESE 40
Week 1 indicates starting week of a semester. The typical schedule of lab assessments is shown,
considering a 26-week semester. The actual schedule shall be as per academic calendar. Lab activities/Lab
performance shall include performing experiments, mini-project, presentations, drawings, programming
and other suitable activities, as per the nature and requirement of the lab course. The experimental lab
shall have typically 8-10 experiments.
Assessment Plan based on Bloom’s Taxonomy Level (Marks) (For lab Courses)
Bloom’s Taxonomy Level ISE MSE ESE Total
Remember
Understand
Apply 15 15
Analyze 15 10 25
Evaluate 10 20 30
Create 10 20 30
Total Marks 30 30 40 100
AY 2023-24
Course Information
Course Code 7CO501
Course Name Advanced Data Structures
Desired Requisites: UG level course in Data Structures

Tutorial - 20 30 50 100
Practical - Nil
Course Objectives
To impart knowledge of advanced data structures such as temporal data structures and
1
geometric data structures
To make students familiar with advanced concepts related to trees, graphs, hashing and
2
string matching.
To contribute in choosing appropriate data structures and using them for solving real
3
world problems.
4
5
interpret and summarize the purpose and operation of advanced data UNDERSTAND
CO1
structures
apply and demonstrate knowledge of advanced data structures for solving ANAYSE
CO2
real world problems
analyze algorithms, compare data structures and evaluate the performance APPLY
CO3
of the advanced data structures
CO4

Module 1: Advanced Trees
I AVL Trees: Insertion, Deletion, and Rotations 8

Red-Black Trees: Properties, Insertion, Deletion
B-Trees and B+ Trees: Operations, Search, Insertion, Deletion
Module 2: Hashing and Graphs
Extendable Hashing and Linear Hashing
II 6
Graph Representations: Adjacency List, Adjacency Matrix
Topological Sorting and Strongly Connected Components
Module 3: Heaps and Priority Queues
Binomial Heaps
III Fibonacci Heaps 6
D-Heaps and Priority Queue Concepts
Module 4: String and Trie Structures

Suffix Trees
IV 8
Compressed Tries
Trie Data Structure and Applications
Module 5: Disjoint Sets and Amortized Analysis
Union-Find Data Structure with Path Compression and Union by
V Rank 6
Amortized Analysis: Aggregate, Accounting, and Potential Methods
Module 6: Geometric and Specialized Data Structures

Range Trees
VI Data Structures for Text Editors 6
Data Structures for Spatial Databases
Text Books
Cormn Thomas H., Leiserson Charles E., Rivest Ronald L., Stein Clifford,
1 “Introduction to Algorithms,” PHI, Third Edition, 2009
Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars , “Computational
2 Geometry - Algorithms and Applications”, Springer, Third Edition, 2008
3 Erik Demaine, Lecture Notes on MIT Courseware
References
1 O’Rourke Joseph, “Computational Geometry in C”, Cambridge University Press
2 Diestel Reinhard, “Graph Theory”, Springer-Verlag, 2000
3 Brass Peter, “Advanced Data Structures”, Cambridge University Press.
Useful Links
1 NPTEL Lectures
CO-PO Mapping
1 2 3 4 5 6
CO1 2
CO2 2 3 1 2
CO3 3 1
The strength of mapping is to be written as 1,2,3; Here, 1: Low, 2: Medium, 3: High
Assessment
The assessment is based on 2 in-semester examinations in the form of T1 (Test-1) and T2 (Test-2) of 20
marks each. Also, there shall be 1 End-Sem examination (ESE) of 60 marks. T1 shall be typically on
modules 1 and 2, T2 based typically on modules 3, 4 and ESE shall be on all modules with nearly 50%
weightage on modules 1 to 4 and 50% weightage on modules 5, 6.
Assessment Plan based on Bloom’s Taxonomy Level (Marks)

1 Remember
2 Understand
3 Apply 10 15 25 50
4 Analyze 10 15 25 50
5 Evaluate
6 Create
Total 20 30 50 100
AY 2023-24
Course Information
Programme M. Tech. (Computer Science and Engineering)
Class, Semester First Year M. Tech., Sem I
Course Code 7CO502
Course Name Artificial Intelligence and Machine Learning
Desired Requisites: Data structures, Algorithms, Probability and Statistics

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3
Course Objectives
1 To acquaint students with the meaning, purpose, scope, applications, and effects of AI.
2 To solve problems by applying a suitable search method, knowledge representation
3 To understand and represent knowledge in AI systems.
4 To analyse real life problems and provide solutions by applying AI techniques.
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Explain fundamental concepts and challenges in AI. II Understand
CO2 Apply the basic principles, models and algorithms of AI to recognize, Apply
III
model and solve problems.
CO3 Analyze knowledge representation techniques and problem solving Analyze
IV
strategies to common AI applications.
CO4 Apply the basic principles, models and algorithms of ML to Evaluate
V
recognize, model and solve problems.

Introduction to AI and Problem Solving by Search
Introduction to AI: What is AI, Turing test, AI problems, AI application areas,
Intelligent Agents: Introduction, Structure of agents, Types of agents,
I 5
Environments
Informed search methods: Best first, A*, Hill climbing, Simulated annealing,
Admissibility of A*, AO*
Knowledge Representation & Reasoning
First order predicate logic: Syntax and semantics, Extensions and notational
II variations, Simple reflex agent; 7
Inference in First Order Logic: Inference rules involving Quantifiers,
Generalized modus ponens, Forward and Backward chaining, Completeness
Game playing and Introduction to Planning
Game playing: Introduction, Minimax search procedure, Alpha beta pruning;
III 7
Planning: Introduction, Components of planning, Goal stack planning, Partial
order planning
Supervised Machine Learning: Regression and Classification
Regression: Linear regression, Multiple linear regression, Train, dev and test
IV dataset, Performance measure, Bias-variance trade off, Regularization 8
Classification: Binary classification: Logistic regression, Decision tree, SVM,
Ensemble methods: Bagging, Boosting, Random Forest
Course Contents for B. Tech Programme, Department of Computer Science and Engineering, AY
2023-24
Reinforcement learning
Introduction to RL: The RL Problem, Markov Decision Process (MDP):
Markov Process, Markov Reward Process, Markov Decision Process and
V 8
Bellman Equations; Planning by Dynamic Programming (DP): Policy
Evaluation, Value Iteration, Policy Iteration, DP Extensions and Convergence
using Contraction Mapping
Unsupervised learning and Case study
Anomaly Detection: Introduction, Basic techniques for univariate data, LOF,
VI 5
iForest, Clustering: Introduction, BIRCH, Fuzzy clustering
Case study: State-of-the-art AI and ML application
Textbooks
Elaine Rich and Kerin Knight, Artificial Intelligence, 3rd Edition, McGraw Hill. ISBN13:
1
9780070087705
Eugene, Charniak, Drew Mcdermott, Introduction to artificial intelligence, AddisonWesley.
2
ISBN 0-07-052263-4.
Deepak Khemani,”A First Course in Artificial Intelligence”, McGraw Hill Education (India),
3
2013.
4 Stuart Russell, Peter Norvig, “Artificial Intelligence A Modern Approach”, Prentice Hall, 3rd
Edition, 2009
References
Khemani D., “Artificial Intelligence: Knowledge Representation and Reasoning”, IIT Madras,
1
Lecture Notes.
Herbert A. Simon, The Sciences of the Artificial, MIT Press, 3rd Edition, 1998. ISBN:
2 9780262190510. George F Luger, Artificial Intelligence: Structures and Strategies for Complex
Problem Solving, Pearson Edu., 4th Edition. ISBN-13: 978-0-321-54589-3
Useful Links
1 Artificial Intelligence: Knowledge Representation and Reasoning Course on NPTEL: Link
2 Artificial Intelligence Search Methods for Problem Solving Course on NPTEL: Link
CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1 1
CO2 2 3 2 2 2
CO3 3 2 2
CO4 2 2 2 1 1
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Assessment
The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)
2023-24
AY 2023-24
Course Information
Course Code 7CO503
Course Name Mathematical foundations of Computer Science
Desired Requisites: Discrete Mathematics

Tutorial - 20 30 50 100
Practical - Nil
Course Objectives
To introduce the mathematical fundamentals for computer science and engineering.
1
2 To study various sampling and classification problems
3
4
5
CO1 explain the basic notions of discrete and continuous probability. APPLY
analyze the methods of statistical inference, and the role that sampling ANALYSE
CO2
distributions play in those methodS
perform correct and meaningful statistical analysis of simple to moderate CREATE
CO3
complexity.
CO4

Probability
Probability mass, density, and cumulative distribution functions,

I 6
Parametric families of distributions, Expected value, variance, conditional
expectation, Applications of the univariate and multivariate Central Limit
Theorem, Probabilistic inequalities, Markov chains
Sampling
II 7
Random samples, sampling distributions of estimators, Methods of
Moments and Maximum Likelihood
2023-24
Statistical inference
III Statistical inference, Introduction to multivariate statistical models: 7

regression and classification problems, principal components analysis, The
problem of overfitting model assessment.
Graph Theory
Graph Theory: Isomorphism, Planar graphs, graph coloring, Hamiltonian

IV 8
circuits and Euler cycles. Permutations and Combinations with and
without repetition. Specialized techniques to solve combinatorial
enumeration problems
Computer science and engineering applications
Computer science and engineering applications: Data mining, Network

V 8
protocols, analysis of Web traffic, Computer security, Software
engineering, Computer architecture, Operating systems, Distributed
systems, Bioinformatics, Machine learning.
Recent Trends
VI Recent Trends in various distribution functions in mathematical field of 6

computer science for varying fields like bioinformatics, soft computing,
and computer vision.
Text Books
Trivedi K., Probability and Statistics with Reliability, Queuing, and Computer Science
1
Applications. Wiley.
2
References
1 John Vince, Foundation Mathematics for Computer Science, Springer.
Mitzenmacher M. and Upfal E., Probability and Computing: Randomized Algorithms
2
and Probabilistic Analysis, Cambridge University Press.
3 Tucker Alan, Applied Combinatorics, Wile
Useful Links
1
CO-PO Mapping
1 2 3 4 5 6
CO1 3
CO2 1 2 1
CO3 2 3 2 1 2
2023-24
Assessment

1 Remember
2 Understand
3 Apply 10 15 25 50
4 Analyze 10 15 25 50
5 Evaluate
6 Create
Total 20 30 50 100
2023-24
AY 2023-24
Course Information
Programme M.Tech. (Computer Science & Engineering)
Course Code 7CO551
Course Name Advanced Data Structures Lab
Desired Requisites: UG level course in Data Structures Lab

Lecture - LA1 LA2 ESE Total
Tutorial - 30 30 40 100
Practical 2 Hrs/Week
Course Objectives
To impart knowledge of advanced data structures such as temporal data structures and geometric
1
data structures.
To make students familiar with advanced concepts related to trees, graphs, hashing and string
2
matching.
To contribute in choosing appropriate data structures and using them for solving real world
3
problems.
4
apply and demonstrate knowledge of advanced data structures for solving real
CO1 Apply
world problems.
analyse algorithms, compare data structures and evaluate the performance of the
CO2 Evaluate
advanced data structures
Create an application using novel data structures and/ or create our own abstract
CO3 Create
data type
Mini Project Guidelines

Course Contents:
Students are expected to carry out independent research work on the chosen topic in this domain. Initially,
student would be able to understand the usage of different data structures, use them and apply its operations
for solving real-world problems. In discussion with the concerned faculty during laboratory hours,
the student would plan the Mini project and prepare a synopsis. The progress of the work done and
discussion would be documented from time-to-time. The final system would be checked if it meets
the requirements specified and the corrections if any would be incorporated in discussion with the
faculty. Student would submit a brief Project Report that must include proper documentation
including Introduction, Literature survey, Hardware & Software Requirements, System Design
Architecture or Block Diagram, Implementation Details (with proper screenshots), Complexity of
using particular data structure, Conclusion and Future work.
2023-24
Implement the following using C/C++/Java
1. Write a program to perform the following operations on singly linked list. i) Creation ii)
Insertion iii) Deletion iv) Traversal.
2. Write a program to perform the following operations on doubly linked list. i) Creation ii)
Insertion iii) Deletion iv) Traversal in both ways
3. Write a program that implements stack (its operations) using i) Arrays ii) linked list
4. Write a programs that implements Queue (its operations) using i) Arrays ii) linked list
5. Write C program that implements the Quick sort method to sort a given list of integers in
ascending order.
6. Write C program that implement the Merge sort method to sort a given list of integers in
ascending order.
7. Write C program that implement the SHELL sort method to sort a given list of integers in
ascending order. (ex. WALCHAND COLLEGE OF ENGINEERING SANGLI 2023 Batch )
8. Write a program to perform the following: i) Creating a Binary Tree of integers ii) Traversing
the above binary tree in preorder, inorder and postorder.
9. Write a C program to perform the following: i) Creating a AVL Tree of integers ii) Traversing
10. Write a C program that uses functions to perform the following: i) Creating a SplayTree of
integers ii) Traversing the above binary tree in preorder, inorder and postorder.
11. Write a C program to perform the following: i) Creating a B-Tree of integers ii) Traversing
12. Write a program that implements Kruskals algorithm using a disjoint set data structure. The
program takes as input a file (data.txt), in which each line either represents a vertex or an edge.
For the edge lines, the first integer on that line representing the starting vertex, the second the
ending vertex, and the third the weigh of the edge. Use this file to construct, line by line, the
graph upon which Kruskal‟s algorithm will be run (do NOT hardcode this graph!).
13. Write a program to simulate various graph traversing algorithms.
14. Write a program to find the minimal spanning tree of a graph using the Prim‟s algorithm. The
program should be able to read in the weight matrix of a graph and produce the minimal spanning
tree Generate weight matrices (using a random number generator) with a large number of nodes
and estimate the time complexity of the algorithm.
15. Write a program to find the closest pair of points using a divide and conquer strategy. Use the
random number generator to generate a large number of points in a unit square as input to the
algorithm. Test the correctness of the algorithm by using a brute force method.
16. Use dynamic programming to find the optimal binary search tree for a given set of numbers
together with their probabilities. Remember that the numbers may be generated in any order, so,
a presorting step is also required.
Text Books
Cormen Thomas H., Leiserson Charles E., Rivest Ronald L., Stein Clifford, Introduction to
1
Algorithms PHI, Third Edition, 2009
Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars , Computational Geometry -
2
Algorithms and Applications, Springer, Third Edition, 2008
3 Erik Demaine, Lecture Notes on MIT Courseware
References
1 O’Rourke Joseph, Computational Geometry in C, Cambridge University Press
2 Diestel Reinhard, Graph Theory, Springer-Verlag, 2000
3 Brass Peter, Advanced Data Structures, Cambridge University Press.
Useful Links
2023-24
1 NPTEL Videos of ‘Data Structures and Algorithms’ Course: Link
2 Data Structures with Visualization: Link
3 Lecture Videos from Erik Demaine from MIT: Link
4
CO-PO Mapping
1 2 3 4 5 6
CO1 2
CO2 3 2
CO3 2 2 1
Assessment
Assessment Based on Conducted by Typical Schedule Marks
LA1 30
LA2 30
ESE 40
considering a 26-week semester. The actual schedule shall be as per academic calendar. Lab
activities/Lab performance shall include performing experiments, mini-project, presentations, drawings,
programming and other suitable activities, as per the nature and requirement of the lab course. The
experimental lab shall have typically 8-10 experiments.

Bloom’s Taxonomy Level LA1 LA2 ESE Total
Remember
Understand
Apply 20 10 5 35
Analyze 10 10 10 30
Evaluate 10 10 20
Create 15 15
Total 30 30 40 100
2023-24
AY 2023-24
Course Information
Programme B.Tech. (Computer Science & Engineering)
Course Code 7CO552
Course Name Artificial Intelligence and Machine Learning Lab
Desired Requisites: Data structures, Algorithms, Probability and Statistics

Tutorial - 30 30 40 100
Practical 2 Hrs/week
Course Objectives
To make students do practical implementation of the different AI and ML concepts and
1
techniques.
To make students familiar with steps involved in applying machine learning algorithms to
2
real-life problems
3 To get insights of how AI algorithms can be used.
4 To develop research interest towards this field

Bloom’s Bloom’s
Course Outcome Statement/s Taxonomy Taxonomy
Level Description
Apply AI and ML algorithms to solve real world problems and Apply,
CO1 III, IV
analyse the results. Analyse
Design and provide best solution to AI and ML problems by
Evaluate,
CO2 measuring the performance of different algorithms/tools, and V, VI
Create
comparing them.
Course Contents for M. Tech. Programme, Department of Computer Science & Engineering, AY2023-24
List of Topics (Applicable for Interaction mode):
List of Lab Activities:

1. Represent knowledge in different forms a) Logical Representation. b) Semantic Networks c)
Production Rules d) Frame Representation.
2. Implement Uniform Cost algorithm to solve 8-queens’ problem.
3. Implement A* algorithm.
4. Use Minimax approach to find optimal move in a Tic-Tac-Toe Game.
5. Perform regression on given House Prices dataset considering one variable (Area) and multiple
variables.
6. Design and implementation of Naïve Bayes Algorithm to find the probability of playing a Golf or not
playing it, under given environmental conditions.
7. Apply logistic regression on given dataset of penguins.
8. Use breast cancer dataset from UCI repository and apply random forest to predict if a data sample
has breast cancer. Report P, R and F values.
9. Adopt procedures to handle imbalanced datasets and compare performance.
10. Implement GridWorld problem using Reinforcement Learning.
11. Implement K-means and KNN Clustering algorithm to given dataset by varying the number of
clusters and compare the results.
12. Apply LOF and kNN algorithm to detect credit card fraud.
Text Books
Web Technology: Theory and Practice by M. Srinivasan, Released June 2012, Publisher(s):
1
Pearson India, ISBN: 9788131774199
References
Web Application Security by Andrew Hoffman, Released March 2020, Publisher(s): O'Reilly
1 Media, Inc. ISBN: 9781492053118
Web Technologies by Achyut Godbole and Atul Kahate, Publication: Tata McGraw-Hill
2 Education Pvt. Ltd., ISBN13: 9781259062681
Useful Links
1 https://www.w3schools.com/
CO-PO Mapping
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2 2
CO2 2 2 3 3 2 3
CO3 1 1 2 1 1
The strength of mapping is to be written as 1,2,3; Where, 1: Low, 2: Medium, 3: High
Assessment
IMP: Lab ESE is a separate head of passing.(min 40 %), LA1+LA2 should be min 40%
Assessment Based on Conducted by Typical Schedule Marks
Lab activities,
Lab Course During Week 1 to Week 8
LA1 attendance, 30
Faculty Marks Submission at the end of Week 8
journal
LA2 30
attendance, Faculty Marks Submission at the end of Week 16
journal
Lab activities, During Week 18 to Week 19
Lab Course
Lab ESE journal/ Marks Submission at the end of Week 19 40
Faculty
performance
Week 1 indicates starting week of a semester. Lab activities/Lab performance shall include performing
experiments, mini-project, presentations, drawings, programming, and other suitable activities, as per the
nature and requirement of the lab course. The experimental lab shall have typically 8-10 experiments and
related activities if any.
AY 2023-24
Course Information
Course Code 7CO553
Course Name Presentation and Technical Report Writing
Desired Requisites:

Tutorial - 30 30 40 100
Practical -
Interaction 1 Hr/Week Credits: 1
Course Objectives
1 To provide an opportunity to students to do work independently on a topic.
2 To encourage creative thinking process in technical report writing
3 To enable students for good technical report writing and effective presentations.
At the end of the course, students will be able to,
CO1 demonstrate the characteristics of technical and business writing. Apply
use a variety of materials to produce appropriate visual presentation for documents,
CO2 Evaluate
such as instructions, descriptions, and research reports.
produce documents related to technology and writing in the workplace and will have
CO3 Create
improved their ability to write clearly, concisely, and accurately.
Course Content
This course introduces students to the discipline of technical communication. Preparation of visuals to
supplement text, workplace communication, descriptions of mechanisms, explanations of processes, and
writing reports are the major topics included.
This course is designed for students enrolled in technical degree programs for making them industry
ready.
Text Books
1 Suitable books based on the contents of the topic.
References
Suitable books based on the contents of the selected topic and research papers from reputed
1
national and international journals and conferences.
Useful Links
1 As per the need of the topic of report and presentation
CO-PO Mapping
1 2 3 4 5 6
CO1 3 1
CO2 3 1
CO3 3 1
Assessment
Assessment Based on Conducted by Typical Schedule (for 26-week Sem) Marks
LA1 30
LA2 30
Lab ESE 40
activities/Lab performance shall include performing experiments, mini-project, presentations, drawings,
programming and other suitable activities, as per the nature and requirement of the lab course. The
experimental lab shall have typically 8-10 experiments.
Bloom’s Taxonomy Level LA1 LA2 Lab ESE Total
Remember
Understand
Apply 15 15 15 45
Analyze
Evaluate 15 15 15 45
Create 10 10
AY 2023-24
Course Information
Course Code 7CO511
Course Name Image Processing
Desired Requisites: None

Tutorial - 20 30 50 100
Practical - Nil
Course Objectives
1
To provide knowledge about fundamentals of digital image processing.
To illustrate concepts of image transforms, image enhancement, image segmentation,

2
morphological operations, color image processing, compression
3 To apply the image processing algorithms to real world problems.

explain fundamental concepts of digital image processing, mathematical Understand
CO1
transforms, image enhancement, segmentation, morphology, compression
apply image processing algorithms to solve real life problems and compare the Apply
CO2
results
CO3 design and compare different image processing algorithms Analyze
CO4

Digital Image Fundamentals
Introduction: Concept, Fundamental Steps and Components of Image
Processing System
I 6
Digital Image Fundamentals: Image Acquisition, A simple image model,
Sampling and Quantization, Imaging Geometry, Different types of digital
images
Image Transforms
2D systems and Necessary Mathematical preliminaries, 2D Orthogonal and
II 8
Unitary Transforms, 1-D DFT, KL-Transforms, Cosine, Hadamard
Transforms, Introduction to Wavelet transforms
Image Enhancement
Point Processing, Basic Gray Level Transformations, Histogram
III Processing, Spatial domain Filtering, Frequency domain filtering 6
Image Segmentation and Analysis

Edge Detection – using first and second order derivatives, LoG, Canny edge
detector, Boundary Extraction – Connectivity, Heuristic Graph Search,
IV 8
Hough Transform, Active Contour, Watershed Transform, Region-based
Segmentation – region growing, region splitting and merging, Feature
Extraction
Image Compression
Fundamentals, Compression model, Lossless Vs Lossy Compression,
V Fundamentals of Information Theory, Run-length coding, Huffman coding, 6
Dictionary-based compression, Predictive coding, Transform-based coding,
Image Compression Standards
Morphological Image Processing
Introduction, Dilation and Erosion, Opening and Closing, The Hit-or-miss
VI transformation, Basic Morphological Algorithms, Boundary Extraction,
Region Filling, Extraction of connected components, Thinning, Thickening 6
Text Books
1 Gonzalez R. C., Woods R. E., “Digital Image Processing”, PHI, Second Edition. 2002
2 Jain A. K., “Fundamentals of Digital Image Processing”, PHI
References
Sonka Milan, Vaclav Hlavac, Boyle, “Digital Image Processing and Computer Vision”,
1
Cengage Learning, Third edition, 2013
S. Jayaraman, S. Esakkirajan, T. Veerkumar, “Digital Image Processing”, Tata
2
McGrawHill, Third edition, 2010
Useful Links
1 NPTEL Lectures
CO-PO Mapping
1 2 3 4 5 6
CO1 1 1 3
CO2 3 1 2
CO3 1 2 2
Assessment

1 Remember
2 Understand
3 Apply 10 15 25 50
4 Analyze 10 15 25 50
5 Evaluate
6 Create
Total 20 30 50 100
AY 2023-24
Course Information
Course Code 7CO512
Course Name Internet of Things
Desired Requisites:

Tutorial - 20 30 50 100
Practical - Nil
Course Objectives
To discuss various topics related to wireless sensor networks significant towards emerging
1 internet-of-things (IoT).
To impart knowledge of hardware, operating systems, distributed systems, networking,

2 security and databases required for IoT technology.
To illustrate wireless sensor network (WSN) /Internet of Things (IoT) specific issues such
3 as localization, time synchronization, and topology control.
4
5
describe requirements from emerging Smart applications, communication UNDERSTAND
CO1
systems, protocols and middleware.
CO2 compare and analyze communication and network protocols used in IoT APPLY
assess and evaluate mechanisms and algorithms for time synchronization, ANALYZE
CO3
security and localization in WSNs and IoT
CO4

Introduction and Applications:
I smart transportation, smart cities, smart Living, smart energy, smart 6

health, and smart learning. Examples of research areas include for
instance: Self-Adaptive Systems, Cyber Physical Systems, Systems of
Systems, Software Architectures and Connectors, Software
Interoperability, Big Data and Big Data Mining, Privacy and Security.
IoT Reference Architecture
Introduction, Functional View, Information View, Deployment and

Operational View, Other Relevant architectural views.
II 7
Real-World Design Constraints- Introduction, Technical Design
constraints hardware,
Data representation and visualization, Interaction and remote control.

Industrial Automation
Service-oriented architecture-based device integration, SOCRADES:

realizing the enterprise integrated Web of Things, IMC-AESOP: from
the Web of Things to the Cloud of Things.
III 7
Commercial Building Automation- Introduction, Case study: phase
one-commercial
building automation today, Case study: phase two- commercial

building automation in the future.
hardware Platform for IoT
Hardware Platforms and Energy Consumption, Operating Systems,

IV 8
Time Synchronization, Positioning and Localization, Medium Access
Control, Topology and Coverage Control, Routing: Transport
Protocols, Network Security, Middleware, Databases.
IOT Physical Devices & Endpoints
V What is an IOT Device, Exemplary Device Board, Linux on Raspberry 7

, Interface and Programming & IOT Device.
Recent trends in IoT with case studies:
VI Recent trends in sensor network and IOT architecture, Automation in 5

Industrial aspect of IOT.
Text Books
Mandler B., Barja J., Campista Mitre, M.E., Cagá_ová, D. Chaouchi, H. Zeadally, S.
Badra, M. Giordano, S. Fazio, M. Somov, A. Vieriu, R.-L., “Internet of Things. IoT
1 Infrastructures” , Springer International Publishing, Second International Summit, IoT
360° 2015, Rome, Italy, October 27-29, 2015. Revised Selected Papers, Part I
Kyung, C.-M., Yasuura, H. Liu, Y. Lin, Y.-L., “Smart Sensors and Systems”, Springer
2
International Publishing,2017.
References
Hersent Olivier, Boswarthick David , Elloumi Omar , “The Internet of Things: Key
1
Applications and Protocols”, Wiley-Blackwell, Second Edition ,2012
2
Useful Links
1 NPTEL Lectures
CO-PO Mapping
1 2 3 4 5 6
CO1 1 1 3
CO2 3 1 2
CO3 1 2 2
Assessment

1 Remember
2 Understand
3 Apply 10 15 25 50
4 Analyze 10 15 25 50
5 Evaluate
6 Create
Total 20 30 50 100
AY 2023-24
Course Information
Course Code 7CO513
Course Name Human Computer Interaction
Desired Requisites: UG level course in Data Structures

Tutorial - 20 30 50 100
Practical - Nil
Course Objectives
Understand Human-Centered Design Principles
1
2 Learn User Research Techniques
to design for positive user experiences, considering emotional design aspects, aesthetics, and the
3
overall impact of the technology on users' feelings and perceptions.
4
5
Demonstrate a clear understanding of the fundamental principles, concepts, and UNDERSTAND
CO1
theories that underpin human-computer interaction.
Design intuitive and user-friendly interfaces by employing interaction design ANAYSE
CO2 principles, arranging interface elements effectively, and optimizing information
architecture.
Implement different interaction techniques, such as touch interfaces, voice APPLY
CO3
interfaces, and gestures, for various platforms and technologies.
CO4

Module 1: Introduction to Human-Computer Interaction
Definition and importance of HCI

I 8
Historical development and evolution of HCI
Key principles and goals of HCI
Human-centered design and user-centered design
Module 2: User Research and Understanding Users
II 6
User personas and scenarios
Ethnographic studies and field observations
Surveys and questionnaires
Cognitive models and mental models
Task analysis and user workflows
Module 3: Interaction Design
Interface design principles

III Interaction design models (e.g., Norman's model) 6
User interface elements and controls
Visual design and aesthetics
Information architecture and navigation design
Module 4: Usability and User Experience (UX)
Usability testing methods and usability heuristics

IV User feedback and usability evaluation 8
Accessibility and inclusive design
User experience design and emotional design
User journey mapping and touchpoints
Module 5: Interaction Techniques and Technologies
Input and output devices

V Gestural interfaces and touch interaction 6
Voice user interfaces (VUIs)
Virtual reality (VR) and augmented reality (AR)
Multi-modal interaction and cross-device interaction
Module 6: User-Centered Development and Evaluation
Rapid prototyping and iterative design

VI User-centered evaluation methods 6
A/B testing and usability metrics
User feedback analysis and iteration
Design thinking and creativity in HCI
Text Books
"The Design of Everyday Things" by Donald A. Norman
1
This book introduces fundamental principles of design and usability, providing insights into
how people interact with everyday objects and technologies.
"Interaction Design: Beyond Human-Computer Interaction" by Jenny Preece, Yvonne Rogers,
2
and Helen Sharp
"Don't Make Me Think, Revisited: A Common Sense Approach to Web Usability" by Steve Krug
3
References
"Human-Computer Interaction" by Alan Dix, Janet E. Finlay, Gregory D. Abowd, and Russell
1 BealeA comprehensive HCI textbook that covers a wide range of topics, including user-centered
design, usability evaluation, and cognitive models.
"Interaction Design for Complex Problem Solving: Developing Useful and Usable Software" by
Barbara Mirel
Focusing on designing software for complex problem-solving scenarios, this book emphasizes
the importance of user-centered design in software development.
"The Elements of User Experience: User-Centered Design for the Web and Beyond" by Jesse
3 James GarrettThis book breaks down the user experience design process, from strategy and scope
to the final user interface, providing insights into creating holistic user experiences.
Useful Links
1 NPTEL Lectures
CO-PO Mapping
1 2 3 4 5 6
CO1 2
CO2 2 3 1 2
CO3 3 1
Assessment

1 Remember
2 Understand 10 10
3 Apply 10 15 25 50
4 Analyze 15 25 40
5 Evaluate
6 Create
Total 20 30 50 100
AY 2023-24
Course Information
Class, Semester First Year M. Tech., Sem II
Course Code 7CO514
Course Name Natural Language Processing
Desired Requisites: Mathematics – Linear Algebra, Probability Theory

Tutorial - 20 30 50 100
Practical - Nil
Course Objectives
To build AI applications such that it will enable computer to read text, hear speech and interpret
1
it.
2 To acquaint students with the basics of text processing
3 To illustrate steps involved in building text mining applications
4 To share the importance of different set of features for machine learning tasks
CO1 explain fundamental concepts of text processing Understand
CO2 apply text processing algorithms to derive different representations of text Apply
CO3 automate the real-life problems by choosing appropriate features and models Evaluate
CO4 develop models for Information Retrieval and Chatbot application Creating

Introduction
Introduction, Steps Involved, Tokenization, Stemming, Lemmatization, Regular
expressions- extraction of information using Regex, Text Normalization, 4
I
Minimum edit distance, Document Similarity measures - Cosine and cluster
measures, exploration of
python libraries like NLTK, SciPy, re.
Language Models
Information Retrieval & Language Models
Introduction, IDF, Tf-Idf, Boolean Model, Vector Space Model, N-gram 5
II
Language
Models, Spelling correction - Edit distance, Advanced smoothing for language
modelling, POS tagging, Performance Measures, Precision, Recall, F-measure
Distributed Word Representation
Vector Space Model - word vectors, GloVe/Word2Vec model, word embedding,
4
III Contextual Embeddings, Deriving Word Vectors from Corpus, Word Senses and
WordNet
Text Classification
Constituency Grammars, Context-Free Grammar, Constituency Parsing,
4
IV Dependency Parsing, Lexicons for Sentiment, Distributional Semantics, Topic
Models, Sentiment
Classification
Sequence Classification
Sequence Labelling for Parts of Speech and Named Entities, Deep Learning
5
V Architectures for Sequence Processing, Models for Sequential tagging –
MaxEnt, CRF, Recurrent
Neural network relevant to NLP
Case Study
Machine Translation and Encoder-Decoder Models, Discourse Coherence,
VI Question Answering, Chatbots & Dialogue Systems, Sentiment Analysis and 4
Opinion Mining, Text Generation using Language Models
Text Books
Steven Bird, Ewan Klein, and Edward Loper, “Natural Language Processing with Python”, O’reilly
1
Publications, 2009.
Yoav Goldberg, “Neural Network Methods for Natural Language Processing”, Synthesis
2
Lectures on Human Language Technologies, 2017
References
Dan Jurafsky and James H. Martin, “Speech and Language Processing”, Standford University,
1
3rd Edition, 2020
Jason Brownlee, “Deep Learning for Natural Language Processing”, 2017.
2
Useful Links
1 NLP Course on NPTEL: Link
CO-PO Mapping
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 1
CO2 2 3
CO3 2 1
CO4 1 1 2
Remember
Understand 5 5 10 20
Apply 5 5 20 30
Analyze 5 5 10 20
Evaluate 5 5 10 20
Create 10 10
AY 2023-24
Course Information
Course Code 7CO515
Course Name Advanced Network Technology
Desired Requisites: Computer networks

Tutorial - 20 30 50 100
Practical - Nil
Course Objectives
understanding of advanced network protocols, architectures, and technologies, including their roles
1
and functionalities in modern networking.
Gain expertise in network security principles, cryptography, and encryption techniques to design
2
and implement secure communication systems.
Acquire specialized knowledge in wireless and mobile networks, covering cellular technologies,
3
wireless LANs, and mobile ad hoc networks.
4
Exhibit a strong grasp of advanced networking protocols, architectures, and Understand
CO1
technologies, and their roles in modern communication systems.
Implement advanced security mechanisms and encryption techniques to ensure data Apply
CO2
integrity, confidentiality, and authentication in network communication.
Design and implement wireless and mobile networking solutions, considering factors Evaluate
CO3
such as coverage, mobility, and scalability.
Analyze emerging networking trends and technologies, evaluate their potential Creating
CO4
impact, and make informed decisions about their adoption.

Module 1: Network Protocols and Security
OSI and TCP/IP reference models 6

I IPv6 and its features
Network security fundamentals
Cryptography and encryption algorithms
Secure socket layer (SSL) and transport layer security (TLS)
Module 2: Wireless and Mobile Networks
II Cellular networks (3G, 4G, 5G) 7

Wireless LANs and IEEE 802.11 standards
Mobile IP and mobile ad hoc networks
IoT communication protocols (MQTT, CoAP)
Module 3: Software-Defined Networking (SDN) and Cloud Networking

6
SDN architecture and OpenFlow protocol
III
Network virtualization and NFV
Cloud networking and virtualization
Virtualization in cloud environments
Module 4: Internet of Things (IoT) Networking and Edge Computing
6
IoT architectures and middleware
IV
IoT security and privacy considerations
Edge computing and fog computing for IoT
IoT communication protocols
Module 5: Quality of Service (QoS) and Network Management
7
Quality of Service metrics and parameters
V
Traffic engineering and congestion control
Network monitoring tools and techniques
SNMP (Simple Network Management Protocol)
Module 6: Advanced Routing, Switching, and Future Trends
BGP (Border Gateway Protocol) and its configurations

VI 7
MPLS (Multiprotocol Label Switching)
Emerging network technologies and trends
Quantum networking and blockchain applications in networking
Text Books
1 "Computer Networking: Principles, Protocols and Practice" by Olivier Bonaventure
"Computer Networks" by Andrew S. Tanenbaum and David J. Wetherall
2
References
"Computer Networking: A Top-Down Approach" by James F. Kurose and Keith W. Ross
1
"TCP/IP Illustrated, Volume 1: The Protocols" by W. Richard Stevens
2
Useful Links
1 NPTEL
CO-PO Mapping
1 2 3 4 5 6
CO1 1
CO2 2 3
CO3 2 1
CO4 1 1 2
Remember
Apply 5 5 20 30
Analyze 5 5 10 20
Evaluate 5 5 10 20
Create 10 10
AY 2023-24
Course Information
Programme M.Tech. (Computer Science and Engineering)
Course Code 7CO516
Course Name Modern Operating System
Desired Requisites: Operating System

Lecture 3 Hrs/week T1 T2 ESE Total
Tutorial - 20 20 60 100
Practical -
Course Objectives
1 To deliver different components of advanced and distributed computing system.
2 To provide knowledge of issues involved in synchronization, resource and process management.
3 To induce steps involved in designing, simulating and implementing various operating systems.

Analyze the advances in operating systems and characteristics of environment in Analyze
CO1
which they are used
Apply the communication techniques in distributed operating systems Apply
CO2
implementations and analyze the distributed file systems.
Design and implement the different algorithms in synchronization, resource and Evaluate
CO3 process management and build real time operating system kernel for different
applications.

Real Time Operating Systems
Overview, System characteristics, Features of real time kernels, implementing
I 7
real time operating systems, real time CPU scheduling. Case study of different
RTOS and mobile operating System - Android, Windows Phone
Distributed Operating System
Architectures, Issues in Distributed operating systems, Limitations of
Distributed Systems, Lamport’s logical clock, Global states, Chandy-
II 7
Lampert’s global state recording algorithm, Basic concepts of Distributed
Mutual Exclusion, Lamport’s Algorithm, Ricart-Agrawala Algorithm; Basic
concepts of Distributed deadlock detection
Distributed File system and Architecture
Design issues, SUN Network File system Basic concepts of Distributed shared
III 6
memory, Basic concepts of Distributed Scheduling, Load balancing, Load
sharing
Multiprocessor System
Motivation, Classification, Multiprocessor Interconnections, Types,
IV 6
Multiprocessor OS functions & requirements; Design & Implementation Issue;
Introduction to parallel programming; Multiprocessor Synchronization.
Analytic Modeling
V
Introductions, Queuing Theory, Markov Process 5
Security & Protection
Security-threats & goals, Penetration attempts, Security Policies &
mechanisms, Authentication, Protections & access control Formal models of
VI
protection, Cryptography, worms & viruses. 8
Case Study of any two real time OS
ClickOS, Drawbridge,GUK11, MiniOS, OSv or any latest cloud OS
Text Books
1 P. K. Sinha, “Distributed Operating Systems Concepts and Design”, PHI.
2 Silberschatz, Galvin, Gagne “Operating System Concepts”, John Wiley, 8th Edition.2011
References
1 S. Tanenbaum ,“Modern Operating Systems”, Pearson/PH 3rd Edition 2009.
2 S. Tanenbaum ,“Distributed Operating Systems”, Pearson, 5th Impression 2008.
3
Useful Links
1
2
CO-PO Mapping
1 2 3 4 5 6
CO1 2 3 2
CO2 1 1
CO3 2 3 1
Assessment

Bloom’s Taxonomy Level T1 T2 ESE Total
1 Remember
2 Understand
3 Apply 05 05 20 30
4 Analyze 10 10 20 40
5 Evaluate 05 05 25 30
6 Create
Total 20 20 20 60
AY 2023-24
Course Information
Course Code 7CO521
Course Name Advanced Computer Algorithms
Desired Requisites: Design and Analysis of Algorithms Basics

Tutorial - 20 30 50 100
Practical - Nil
Course Objectives
To introduce students to the advanced methods of designing and analysing algorithms.
1
2 To allow students choose appropriate algorithm and use it for a specific problem.
To impart knowledge of different classes of problems along with recent developments in the area
3
of algorithmic design.
CO1 apply algorithms involving different strategies for problem solving Apply
CO2 analyze algorithm for given problem at hand Analyze
CO3 evaluate the complexity of the algorithm Evaluate

Elementary Algorithms
Sorting: Review of various sorting algorithms
I Graph: Topological sorting, Definitions and Elementary Algorithms: Shortest path 8
by BFS, shortest path in edge-weighted case (Dijkstra's), depth-first search and
computation of strongly connected components, emphasis on correctness proof of
the algorithm and time/space analysis, example of
amortized analysis.
Graph Algorithms
Matroids: Introduction to greedy paradigm, algorithm to compute a maximum
II weight maximal independent set. Application to Minimum Spanning Tree. 6
Shortest Path in Graphs: Floyd-Warshall algorithm and introduction to dynamic
programming paradigm. More examples of dynamic programming.
Parallel Algorithms
Introduction, Data and Temporal parallelism, RAM and PRAM Model, Shared
III Memory and Message Passing Models, PRAM Algorithms: Prefix Sum, List 7
Ranking, Merging two sorted lists, Matrix multiplication, Analysis of PRAM
Algorithms.
Modulo Representation and DFT
Modulo Representation of integers/polynomials: Chinese Remainder Theorem,
IV Conversion between base-representation and modulo- representation, Powers of an 7
element, The RSA public-key cryptosystem.
Discrete Fourier Transform (DFT): In complex field, DFT in modulo ring. Fast Fourier
Transform algorithm.
NP-completeness: Basic concepts of complexity classes- P, NP, NP-Hard, NP
Complete, Examples, Proof of NP-hardness and NP-completeness.
V One or more of the following topics based on interest- Approximation algorithms,
6
Randomized Algorithms, Interior Point Method, Advanced Number Theoretic
Algorithm
Recent Trends
VI Recent Trends in problem solving paradigms using recent searching and sorting
5
techniques by applying recently proposed data structures.
Text Books
1 C. R. Kothari, Research Methodology, New Age international
Deepak Chopra and Neena Sondhi, Research Methodology : Concepts and cases, Vikas
2
Publishing House, New Delhi
References
Kleinberg and Tardos, Algorithm Design, Pearson Education Limited
1
Robert Sedgewick, “Algorithms in C++", Addison-Wesley Professional, Third Edition
2
Useful Links
1 NPTEL Videos of ‘Data Structures and Algorithms’ Course: Link
CO-PO Mapping
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2
CO2 2 3
CO3 1 1 2
Remember
Apply 5 10 20 35
Analyze 5 10 10 25
Evaluate 5 5 10 20
Create
AY 2023-24
Course Information
Course Code 7CO522
Course Name Soft Computing
Desired Requisites: Basic knowledge of mathematics

Tutorial - 20 30 50 100
Practical - Nil
Course Objectives
To foster student’s abilities to implement soft computing-based solutions for real-world problems
1
To impart knowledge of non-traditional technologies and fundamentals of artificial neural
2
networks, fuzzy sets, fuzzy logic, genetic algorithms
3 To discuss hybrid applications of ANN, Fuzzy and GA
analyze soft computing techniques and their roles in building intelligent Analyze
CO1
machines
evaluate fuzzy logic and neural networks techniques to solve various Evaluate
CO2
engineering problems
build prototyping applications using genetic algorithms and hybrid Create
CO3
approaches

Introduction: Evolution of Computing: Soft Computing Constituents, From
Conventional AI to Computational Intelligence, Characteristics of Neuro Computing
I
and Soft Computing, Difference between Hard Computing and Soft Computing, 6
Concepts of Learning and Adaptation
Fuzzy Logic: Fuzzy Sets, Operations on Fuzzy Sets, Fuzzy Relations, Membership
Functions: Fuzzy Rules and Fuzzy Reasoning, Fuzzy Inference Systems, Fuzzy Expert
II 7
Systems, Fuzzy Decision Making
Neural Networks: Machine Learning Using Neural Network, Adaptive Networks,

Feed forward Networks, Supervised Learning Neural Networks, Radial Basis
III Function Networks : Reinforcement Learning, Unsupervised Learning Neural 7
Networks, Adaptive Resonance Architectures, Advances in Neural Networks
Genetic Algorithms: Introduction to Genetic Algorithms (GA), Applications of GA in
IV Machine Learning : Machine Learning Approach to Knowledge Acquisition 7
Hybrid Systems: Introduction to Hybrid Systems, Adaptive Neuro Fuzzy Inference
V 6
System(ANFIS)
Deep Learning: Spark auto encoder, Convolutional neural networks, Recurrent
VI neural networks, Deep belief networks 7
Text Books
Rajasekaran S., Vijayalakshmi Pai G.A., “Neural Networks, Fuzzy Logic and Genetic Algorithms”,
1
PHI, 2003
Ian Goodfellow, Yoshua Bengio, Aaron Courville, “Deep Learning”, MIT Press e- book
2
References
Jyh-Shing Roger Jang, Chuen-Tsai Sun, Eiji Mizutani, “Neuro-Fuzzy and Soft Computing”, PHI,
1
2003
George J. Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic: Theory and Applications”, PHI, 1995
2
CO-PO Mapping
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 3
CO2 2 2 2
CO3 2 2 2 2
CO4
Remember
Understand
Apply
Analyze 20 10 20 50
Evaluate 10 20 30
Create 20 20
Remember
Total 20 20 60 100
AY 2023-24
Course Information
Course Code 7CO523
Course Name Information Security
Desired Requisites: Basics of security

Tutorial - 20 30 50 100
Practical - Nil
Course Objectives
Develop a strong foundational understanding of information security concepts, principles, and
1
terminology.
Gain expertise in cryptographic techniques, including encryption, decryption, digital signatures,
2
and certificates, and understand how they contribute to secure communication and data protection.
Develop skills in identifying vulnerabilities, conducting vulnerability assessments, and performing
3
penetration testing to uncover security weaknesses.
CO1 Exhibit a clear grasp of information security principles, concepts, and terminology, Apply
including the security goals of confidentiality, integrity, and availability.
CO2 Design and implement network security measures, including the use of secure Analyze
communication protocols and mechanisms for preventing and mitigating network
attacks.
CO3 Apply best practices for securing web applications, including identifying and addressing Evaluate
common web application vulnerabilities.

Module 1: Introduction to Information Security
I Overview of information security concepts 8

Security goals: confidentiality, integrity, availability
Threats, vulnerabilities, and risks
Security models: Bell-LaPadula, Biba, Clark-Wilson
Module 2: Cryptography and Network Security
II Principles of encryption and decryption 6

Symmetric and asymmetric cryptography
Public key infrastructure (PKI)
Digital signatures and certificates
Network security protocols: SSL/TLS, IPsec
Module 3: Access Control and Authentication
III Access control models: DAC, MAC, RBAC 7

Authentication mechanisms: passwords, biometrics, tokens
Multifactor authentication and single sign-on
Identity management and federation
Module 4: Security in Operating Systems and Software
IV Secure software development lifecycle 7

Buffer overflows and input validation
Malware types: viruses, worms, Trojans
Operating system security mechanisms
Security patches and updates
Module 5: Threats and Vulnerability Management
V Common network attacks: DoS, DDoS, phishing

6
Intrusion detection and prevention systems
Vulnerability assessment and penetration testing
Security incident response and handling
Module 6: Secure Network Communication and Web Security
VI
5
Secure email communication and PGP
VPNs and tunneling protocols
Web security principles: XSS, CSRF, SQL injection
Web application firewalls and secure coding practices
Text Books
1 "Computer Security: Principles and Practice" by William Stallings and Lawrie Brown
"Cryptography and Network Security: Principles and Practice" by William Stallings
2
References
"Security Engineering: A Guide to Building Dependable Distributed Systems" by Ross J.
1
Anderson
"Network Security Essentials: Applications and Standards" by William Stallings
2
Useful Links
1 NPTEL Videos
CO-PO Mapping
1 2 3 4 5 6
CO1 2
CO2 2 3
CO3 1 1 2
Remember
Apply 10 10 20 40
Analyze 10 10 20
Evaluate 5 10 15
Create
AY 2023-24
Course Information
Course Code 7CO572
Course Name Soft Computing Lab
Desired Requisites: Programming knowledge

Tutorial - 30 30 40 100
Practical 2 Hrs/Week Nil
Course Objectives
To demonstrate knowledge of implementation of artificial neural networks, fuzzy sets, fuzzy
1
logic, genetic algorithms and hybrid systems
2 To evaluate soft computing based solutions of real-world problems
Apply appropriate soft computing technique for creating prototyping
CO1 Apply
applications
CO2 Evaluate soft computing techniques in building intelligent machines Evaluate
Module Contents
Course Contents:
Assignments
1. Create a perceptron with appropriate number of inputs and outputs. Train it using fixed
increment learning algorithm until no change in weights is required. Output the final
weights Write a program to implement artificial neural network without back
propagation.
2. Write a program to implement artificial neural network with back propagation.
3. Implement Union, Intersection, Complement and Difference operations on fuzzy sets.
Also create fuzzy relation by Cartesian product of any two fuzzy sets and perform max-
min composition on any two fuzzy relations.
4. Implement travelling sales person problem (tsp) using genetic algorithms.
5. Plot the correlation plot on dataset and visualize giving an overview of relationships
among data on soya bins data. Analysis of covariance: variance (ANOVA), if data have
categorical variables on iris data.
6. Implement linear regression and multi-regression for a set of data points
7. Implement crisp partitions for real-life iris dataset
8. Write a program to implement Hebb’s rule Write a program to implement Delta rule.
9. Write a program to implement logic gates.
10. Implement svm classification by fuzzy concepts.
Text Books
Rajasekaran S., Vijayalakshmi Pai G.A., “Neural Networks, Fuzzy Logic and Genetic Algorithms”, PHI,
1
2003
2 Ian Goodfellow, Yoshua Bengio, Aaron Courville, “Deep Learning”, MIT Press e-book
References
1 Jyh-Shing Roger Jang, Chuen-Tsai Sun, Eiji Mizutani, “Neuro-Fuzzy and Soft Computing”, PHI, 2003
2 George J. Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic: Theory and Applications”, PHI, 1995
Useful Links
1 NPTEL LECTURES
CO-PO Mapping
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 1 2
CO2 1 1
Assessment
Assessme Based on Conducted by Typical Schedule (for 26-week Sem) Marks
nt
LA1 30
LA2 30
Lab ESE 40
and other suitable activities, as per the nature and requirement of the lab course. The experimental lab shall
have typically 8-10 experiments.
Remember
Understand
Apply 20 10 20 50
Analyze
Create
AY 2023-24
Course Information
Course Code 7CO545
Course Name Pre-dissertation work and seminar
Desired Requisites: Programming knowledge

Tutorial - 30 30 40 100
Practical 2 Hrs/Week Nil
Course Objectives
1 to find a high-quality research topic
2 to develop a convincing research proposal
3 to craft a high-quality introduction and literature review
4 to choose a suitable methodology and present your results
5 to polish your dissertation or thesis for the highest marks
CO1 Developing research based knowledge Apply
CO2 Creating research based work Create
Module Contents
Course Contents:
Module I: Introduction.
Module II: Review of Literature.
Module III: Methodology (Research Design & Methods)
Module IV: Presentation of Research (Results)
Module V: Summary, Implications, Conclusions (Discussion)
This second course of a two-semester sequence is designed to assist students in developing a dissertation
proposal consisting of three chapters. This includes working to develop a clearly defined research idea,
introduction, literature review, theoretical/conceptual framework, and research design. The Dissertation
Seminar sequence will also provide networking opportunities with students in a similar place in their
graduate studies as well as professional development designed to help students complete the dissertation
after finishing the course sequence.
Assignments
1. Review paper publication
Text Books
Rajasekaran S., Vijayalakshmi Pai G.A., “Neural Networks, Fuzzy Logic and Genetic Algorithms”, PHI,
1
2003
2 Ian Goodfellow, Yoshua Bengio, Aaron Courville, “Deep Learning”, MIT Press e-book
References
1 Jyh-Shing Roger Jang, Chuen-Tsai Sun, Eiji Mizutani, “Neuro-Fuzzy and Soft Computing”, PHI, 2003
2 George J. Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic: Theory and Applications”, PHI, 1995
Useful Links
1 NPTEL LECTURES
CO-PO Mapping
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 1 2
CO2 1 1
Assessment
Assessme Based on Conducted by Typical Schedule (for 26-week Sem) Marks
nt
LA1 30
LA2 30
Lab ESE 40
and other suitable activities, as per the nature and requirement of the lab course. The experimental lab shall
have typically 8-10 experiments.
Remember
Understand
Apply 20 10 20 50
Analyze
Create
AY 2023-24
Course Information
Course Code 7CO531
Course Name Data Science
Desired Requisites: Basics of mathematics , and strong programming skills

Tutorial - 20 30 50 100
Practical - Nil
Course Objectives
Develop a clear understanding of the fundamental concepts, principles, and terminology of data
1
science.
Acquire skills to collect, scrape, and retrieve data from various sources, and apply preprocessing
2
techniques to clean and prepare data for analysis.
Apply exploratory data analysis techniques to gain insights from data, and create meaningful
3
visualizations to effectively communicate findings.
CO1 Acquire, clean, preprocess, and manipulate diverse datasets from various sources, Apply
ensuring data quality and usability.
CO2 Apply statistical and visualization techniques to explore and summarize data, extracting Analyze
meaningful insights and patterns.
CO3 Apply a range of machine learning algorithms for solving classification, regression, Evaluate
clustering, and recommendation problems.

Module 1: Introduction to Data Science
I Understanding data science concepts and its importance 6

Role of data scientists and their skills
Overview of the data science process and lifecycle
Module 2: Data Collection and Preprocessing
II Data sources and acquisition techniques 8

Data scraping, APIs, and web data collection
Data preprocessing, cleaning, and handling missing values
Module 3: Exploratory Data Analysis and Visualization
III Exploring and summarizing data using statistical measures 7

Data visualization techniques and best practices
Creating visualizations using libraries (e.g., Matplotlib, Seaborn)
Module 4: Machine Learning Fundamentals
IV Introduction to machine learning concepts 7

Supervised, unsupervised, and semi-supervised learning
Feature engineering and selection
Module 5: Supervised and Unsupervised Learning
V Regression analysis and linear models

6
Classification algorithms (e.g., decision trees, random forests)
Clustering techniques and dimensionality reduction
Module 6: Advanced Topics in Data Science
VI
5
Natural Language Processing (NLP) fundamentals
Introduction to deep learning and neural networks
Introduction to big data concepts and tools
Ethical considerations and bias in data science
Text Books
1 "Python for Data Analysis" by Wes McKinney
"Introduction to Machine Learning with Python" by Andreas C. Müller and Sarah Guido
2
References
"Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow" by Aurélien Géron
1
"Python Machine Learning" by Sebastian Raschka and Vahid Mirjalili
2
Useful Links
1 NPTEL Videos
CO-PO Mapping
1 2 3 4 5 6
CO1 2
CO2 2 3
CO3 1 1 2
Remember
Apply 10 10 20 40
Analyze 10 15 25
Evaluate 5 5 10
Create
AY 2023-24
Course Information
Class, Semester First Year M.Tech., Sem II
Course Code 7CO532
Course Name Data Encryption and Compression
Desired Requisites:

Tutorial - 20 30 50 100
Practical - Nil
Course Objectives
To develop a research orientation among the students and to acquaint them with fundamentals of
1
research methods.
2 To develop understanding of the basic framework of research process and techniques
3 To identify various sources of information for literature review and data collection.
4 To develop an understanding of the ethical dimensions of conducting applied research.
5 To develop understanding about patent process.
CO1 Classify various methods to solve research problem. Apply
CO2 Construct a research problem in respective engineering domain. Apply
CO3 Investigate various data analysis techniques for a research problem. Analyze
CO4 Identify various Intellectual Property Rights procedures Apply

Introduction to Data Compression
Data Compression : Modelling and Coding, Statstical Modelling, Dictionary

I 4
Schemes, LZ, Lossy CompressionShannon – Fano Algorithm, Huffman Algorithm,
Adaptive Huffman CodingDifficulties in Huffman Coding, Arithmetic Coding –
Decoding, Dictionary Based Compression
Video and Audio Compression
II Analog Video, Digital Video, MPEG – 2, H – 261 Encoder and Decoder 5
Sound, Digital Audio, g-Law and A-Law Companding, MPEG – 1 Audio Layer
Data Security
Security Goals, Cryptographic Attacks, Techniques, Symmetric Key: Substitution

III 5
Cipher, Transposition Cipher , Stream and Block Cipher, DES, AES
Network Security Email, PGP, S/MIME, Intrusion Detection System
Web Security Considerations, SSL Architecture, SSL Message Formats, TLS,

IV 4
Secure Electronic Transactions
Kerberos, X.509 Authentication Service, Public Key Infrastructure
Compression Techniques
Loss less compression, Lossy Compression, Measures of performance, Modeling and
coding, Mathematical Preliminaries for Loss-less compression: A brief introduction to
V information theory, Models: Physical models, Probability models, Markov models,
com-posite source model, Coding: uniquely decodable codes, Prefix codes. 5
The Huffman coding algorithm

Minimum variance Huffman codes, Adaptive Huffman coding: Update procedure,
Encoding procedure, Decoding procedure. Golomb codes, Rice codes, Tunstall codes,
VI Applications of Hoffman coding: Loss less image compression, Text compression,
Audio Compression. 4
Text Books
Improvement of A5/1 encryption algorithm based on filtration technique
1 Zainab H Jassim, Sattar B Sadkhan
References
International Data Encryption Algorithm Second Edition Gerard Blokdyk
1
Useful Links
1 NPTEL Lectures
CO-PO Mapping
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 1
CO2 2 2
CO3 2
CO4 2
Remember
Understand
Apply 15 15
Analyze 15 10 25
Evaluate 10 20 30
Create 10 20 30
AY 2023-24
Course Information
Course Code 7CO533
Course Name Blockchain Technology
Desired Requisites: Basics of mathematics , and security algorithms

Tutorial - 20 30 50 100
Practical - Nil
Course Objectives
Understand the fundamental concepts of blockchain technology, including decentralization,
1
transparency, and immutability
Gain insights into the cryptographic techniques used in blockchain, such as hashing and digital
2
signatures.
Examine real-world applications of blockchain across industries, including finance, supply chain,
3
and healthcare.
CO1 Describe cryptographic techniques like hashing and digital signatures used in Understand
blockchain security.
CO2 Develop and deploy basic smart contracts using Solidity on the Ethereum Virtual Apply
Machine.
CO3 Analyze and compare features of blockchain platforms like Ethereum and Hyperledger Analyze
for different use cases

Module 1: Introduction to Blockchain
I Overview of blockchain technology and its core principles 8

Types of blockchains: public, private, and consortium
Basics of decentralization, consensus, and immutability
Module 2: Cryptography and Security
II Cryptographic techniques in blockchain: hashing, digital signatures 8

Consensus mechanisms: Proof of Work (PoW), Proof of Stake (PoS)
Security considerations and vulnerabilities in blockchain
Module 3: Smart Contracts and DApps
III Introduction to smart contracts and their benefits 7

Ethereum Virtual Machine (EVM) and Solidity programming language
Design principles and development of decentralized applications (DApps)
Module 4: Blockchain Platforms and Frameworks
IV In-depth exploration of blockchain platforms: Ethereum, Hyperledger 7

Setting up a development environment for Ethereum or Hyperledger
Module 5: Blockchain Applications and Use Cases
V Real-world applications of blockchain in finance, supply chain, etc.

7
Case studies of successful blockchain implementations
Challenges and limitations of blockchain technology
Module 6: Blockchain Development and Capstone Project
VI
6
Hands-on lab sessions for developing smart contracts
Building a simple decentralized application (DApp)
Students work on a blockchain-related project as a capstone
Text Books
1 "Mastering Bitcoin: Unlocking Digital Cryptocurrencies" by Andreas M. Antonopoulos
"Blockchain Basics: A Non-Technical Introduction in 25 Steps" by Daniel Drescher
2
References
"Blockchain Applications: A Hands-On Approach" by Arshdeep Bahga and Vijay Madisetti
1
"Blockchain Basics: A Practical Approach" by Pete Harris
2
Useful Links
1 NPTEL Videos
CO-PO Mapping
1 2 3 4 5 6
CO1 2
CO2 2 3
CO3 1 1 2
Remember
Apply 10 15 25 50
Analyze 10 15 25
Evaluate
Create
AY 2023-24
Course Information
Course Code 7CO534
Course Name Theory and Applications of Remote Sensing & GIS
Desired Requisites: Fundamentals of Image processing

Tutorial - 20 30 50 100
Practical - Nil
Course Objectives
To impart knowledge of the fundamentals of Remote Sensing (RS) and geographical information
1
systems (GIS)
2 To make students familiar with Data and Data Products in RS and GIS.
3 To acquaint students advantages and applications of RS and GIS
CO1 Understand and summarize fundamental concepts in RS and GIS Understand
Interpret and Apply various satellite RS data and demonstrate GIS data and GIS Apply
CO2
database management system
CO3 Compare and examine data and data Products of RS and GIS Analyse
Select and Verify RS and GIS data and data products to design solution for various Evaluate
CO4
interdisciplinary problems

Concepts and Foundation of Remote Sensing
Introduction, Remote Sensing System, Electromagnetic Energy, Electromagnetic
Spectrum and its Characteristics, Energy Interaction in the Atmosphere and with
I 4
the Earth’s Surface, Resolution in Remote Sensing, Broad Classifications of
Sensors and Platform, Earth Observation Satellite and Sensors, Data Reception,
Transmission and Processing, Remote Sensing Data and Data Products.
Satellite Image Interpretation and Processing
Interpretation Procedure and Elements, Interpretation strategies and keys, Digital
II Image processing and Image Analysis steps, Image Rectification and Restoration, 5
Image Enhancement, Spatial Filtering, Image Transformation, Image
Classification and Analysis.
Applications of Remote Sensing
Land use Land Cover Mapping, Crop Inventory, Ground Water Mapping, Urban
III Growth, Flood Plain Mapping, Disaster Management. 5
GIS – An Overview
Introduction, Geographical concepts and Terminology, Difference between
IV Image Processing system and GIS, Various GIS packages and their salient 4
features, Essentials components of GIS, Utility of GIS, GPS
GIS Data
GIS Data types and Data Representation, Data Acquisition, Georeferencing of
V GIS Data, Raster and Vector data, Raster to Vector conversion, Remote Sensing 5
Data in GIS, GIS Database and Database Management System
GIS Spatial Data Analysis and Applications
Measurements in GIS-Lengths, Perimeters, and Areas, Queries, Reclassification,
VI
Buffering and Neighborhood Functions, Map Overlay, Spatial Interpolation, 4
Analysis of Surfaces, Network Analysis, GIS Applications
Text Books
1 Chandra, A.M. and Gosh, S.K., “Remote Sensing and GIS”, Narosa Publishing House. 2008
Lo, C.P. and Young, A.K.W., “Concepts and Techniques of Geographical Information System”,
2
Prentice Hall India. 20012
References
Lillesand, T.M. and Kieffer, “Remote Sensing and Image Interpretation”, John Wiley and Sons,
1
6th Edition. 2012
Chang, K, “Introduction to Geographical Systems”, Tata McGraw-Hill, 4th Edition. 2010
2
Useful Links
NPTEL: https://nptel.ac.in/noc/courses/noc19/SEM1/noc19-ce08
1
https://nptel.ac.in/noc/courses/noc18/SEM1/noc18-ce10
CO-PO Mapping
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2
CO2 2
CO3 2 2
CO4 3 2 2
Remember
Apply 5 5 20 30
Analyze 5 5 15 25
Evaluate 5 10 15
Create
AY 2023-24
Course Information
Class, Semester First Year M.Tech., Sem III
Course Code 7CO535
Course Name Deep Learning

Desired Requisites: Working knowledge of Linear Algebra, Statistics and Probability
Theory

Tutorial - 20 30 50 100
Practical - Nil
Course Objectives
To explain the fundamentals of neural networks, recurrent neural networks (RNN),
long short
1
term memory cells and convolutional neural networks (CNN).
2 To demonstrate various learning models for practical application.

To discuss optimization approach and distribution techniques for Deep Learnin
3 model
4
5
Illustrate fundamentals of deep learning using Understanding
foundation of mathematics
CO1
terminology
Compare various deep learning models by hyper tuning Analyze
CO2 various parameters
CO3 Demonstrate various case studies of deep learning. Apply

Design and deploy deep learning models on various Create
frameworks and
CO4
platform.

Introduction to Deep Learning
I 6
Neural network fundamentals: General Introduction to
Deep Learning,
Perceptron algorithm, Back propagation and Multi-layer
Networks.
Image fundamentals: Pixels, Image coordinate, scaling
and aspect
ratios
Parameterized Learning and Optimization Methods

parameterized Learning: Introduction to linear
classification, Four
components of parameterized learning, role of loss
function.
II 7
Optimization Methods: Optimization Methods: Gradient
descent,
stochastic gradient descent (SGD) and extensions to
SGD,
regularization
Convolutional Neural Networks (CNN)
Understanding Convolutions: Convolutions versus
Cross-correlation,
The “Big Matrix” and “Tiny Matrix" Analogy, Kernels,
A Hand
Computation Example of Convolution The Role of
Convolutions in
III 7
Deep Learning.
CNN Building blocks: Layer Types, Convolutional
Layers, Activation
Layers, Pooling Layers, Fully-connected Layers, Batch
Normalization, Dropout, ShallowNEt, LeNet,
MiniVGGNET
Deep learning-based object detection

Fundamentals of Object detection, Family of R-CNN,
IV Single shot 6
detectors (SSD), You only look once (YOLO)
Sequence Models
Recurrent Neural Networks, Vanishing gradients, Gated
V Recurrent
6
Units (GRU), Long-short-term-memories (LSTMs)
.
Optimization techniques & Distributed Training for
DL model
Fundamentals of optimization techniques, Optimize
TensorFlow
VI
Models For Deployment with TensorRT, Custom and 6
Distributed
Training.
Text Books
Ian Goodfellow, Yoshua Bengio and Aaron Courville Deep Learning, MIT Press,
1 2016
Aurelien Geron, “ Hands-On Machine Learning with Scikit-Learn & TensorFlow”,
2
O’REILLY, Dec 2017
References
1 Neural Networks: A Systematic Introduction, Raúl Rojas, 1996
2 Pattern Recognition and Machine Learning, Christopher Bishop, 2007
3 Prof. Mitesh M. Khapra, “Deep Learning”, course on NPTEL, July 2018
4 Andrew Ng, “Deep Learning Specialization”, Coursera online course
Useful Links
1 https://nptel.ac.in/courses/106/106/106106184/
2 https://www.coursera.org/specializations/deep-learning
CO-PO Mapping
1 2 3 4 5 6
CO1 1
CO2 2 2
CO3 2 1
CO4 2 1 2
Assessment
IMP: Lab ESE is a separate head of passing. LA1, LA2 together is treated as In-Semester
Evaluation.
Assessment Based on Conducted by Typical Schedule (for Marks
26-week Sem)
During Week 1 to Week
Lab activities, Lab Course 6
LA1 30
attendance, journal Faculty Marks Submission at the
end of Week 6
During Week 7 to Week
Lab activities, Lab Course 12
LA2 30
end of Week 12
During Week 15 to
Lab activities, Lab Course Week 18
Lab ESE 40
end of Week 18
activities/Lab performance shall include performing experiments, mini-project, presentations,
drawings, programming and other suitable activities, as per the nature and requirement of the lab
course. The experimental lab shall have typically 8-10 experiments.
Remember
Understand 10 10
Apply 10 10
Analyze 10 10 20
Evaluate 10 20 30
Create 10 20 30
AY 2023-24
Course Information
Course Code 7CO536
Course Name Cyber Security
Desired Requisites: Fundamentals of security

Tutorial - 20 30 50 100
Practical - Nil
Course Objectives
Identify various types of cyber threats, including malware, hacking, and social engineering.
1
2 Examine and implement network security protocols such as IPsec, SSL/TLS, and VPNs.
3 Develop a comprehensive understanding of incident response planning and methodologies.
CO1 Summarize the concepts of information security and the CIA triad. Understand
Apply network security measures to mitigate risks and protect against common Apply
CO2
vulnerabilities
CO3 Analyze and categorize common web vulnerabilities, proposing appropriate solutions. Analyze
Evaluate the security considerations of cloud computing environments and identify Evaluate
CO4
potential risks.

Module 1: Introduction to Cyber Security
Overview of cyber security importance, challenges, and threats

I 8
Information security concepts: confidentiality, integrity, availability (CIA
triad)
Types of cyber threats: malware, hacking, social engineering
Module 2: Network Security and Cryptography
Network vulnerabilities and attacks

II 9
Network security protocols: IPsec, SSL/TLS, VPNs
Cryptography basics: encryption, decryption, hashing
Secure communication and data protection techniques
Module 3: Web and Application Security
III Common web vulnerabilities: SQL injection, XSS, CSRF 8

Secure coding practices and application security testing
Securing web applications: input validation, output encoding
Module 4: Incident Response and Threat Intelligence
IV Incident response planning and methodologies 7

Threat intelligence sources, feeds, and analysis
Handling security incidents: investigation, containment, recovery
Module 5: Cloud and IoT Security
V Cloud security considerations: data privacy, compliance 6

Securing IoT devices and communication
Identity and Access Management (IAM) in the cloud
Module 6: Ethical Hacking and Penetration Testing
VI Introduction to ethical hacking: goals and legal considerations 7

Penetration testing methodologies and tools
Reporting vulnerabilities and risk assessment
Text Books
"Principles of Computer Security: CompTIA Security+ and Beyond" by Wm. Arthur Conklin,
1
Gregory White, Dwayne Williams, Chuck Cothren, Roger L. Davis
"Cybersecurity: A Business Solution" by Rob Arnold
2
References
"Hacking: The Art of Exploitation" by Jon Erickson
1
"Cybersecurity and Cyberwar: What Everyone Needs to Know" by P.W. Singer and Allan
2
Friedman
Useful Links
1 NPTEL:
CO-PO Mapping
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2
CO2 2
CO3 2 2
CO4 3 2 2
Remember
Apply 5 5 20 30
Analyze 5 5 15 25
Evaluate 5 10 15
Create
AY 2023-24
Course Information
Course Code 7CO537
Course Name Advanced Database Management Systems
Desired Requisites: DBMS

Tutorial - 20 30 50 100
Practical - Nil
Course Objectives
Evaluate the use of inheritance, aggregation, and encapsulation in database design.
1
2 Explore modern indexing techniques and their role in optimizing query performance.
3 Compare transaction isolation levels and their trade-offs in multi-user environments.
Understand mapping strategies between object-oriented models and relational Understand
CO1
databases.
Apply advanced query optimization techniques to enhance complex query Apply
CO2
performance
CO3 Analyze the impact of modern indexing techniques on query execution Analyze
CO4 Evaluate the consistency models based on the CAP theorem in distributed databases. Evaluate

Module 1: Advanced Database Design
Review of relational database concepts

I 8
Object-oriented and object-relational database design
Mapping between object-oriented models and relational databases
Inheritance, aggregation, and encapsulation in database design
Module 2: Advanced Query Optimization and Execution
Query optimization techniques: cost-based and rule-based optimization

II 8
Join algorithms: nested loop, hash join, merge join
Parallel query processing and optimization
Introduction to modern indexing techniques: bitmap indexing, R-tree, etc.
Module 3: Advanced Transaction Management
Concurrency control techniques: multiversion concurrency control (MVCC),

III timestamp ordering, two-phase locking 7
Distributed transaction management and protocols
Transaction isolation levels and their trade-offs
Deadlock detection and prevention strategies
Module 4: Data Warehousing and Data Mining
Introduction to data warehousing concepts and architecture

IV 7
ETL (Extract, Transform, Load) processes in data warehousing
Data mining techniques: classification, clustering, association rule mining
Integration of data mining algorithms with databases
Module 5: NoSQL and Big Data
Introduction to NoSQL databases: key-value, document, column-family, graph

databases
V 6
CAP theorem and consistency models in distributed databases
Overview of big data technologies: Hadoop, Spark, and their integration with
databases
Challenges and solutions in managing and querying big data
Module 6: Emerging Trends in Database Systems
NewSQL databases: overview and comparison with traditional databases

VI 7
In-memory databases: benefits, architecture, and use cases
Blockchain and databases: integration, benefits, and challenges
Overview of database-as-a-service (DBaaS) and serverless databases
Text Books
1 "Database System Concepts" by Abraham Silberschatz, Henry F. Korth, S. Sudarshan
"Modern Database Management" by Jeffrey A. Hoffer, V. Ramesh, Heikki Topi
2
References
"Database Management Systems" by Raghu Ramakrishnan, Johannes Gehrke
1
"Transaction Processing: Concepts and Techniques" by Jim Gray, Andreas Reuter
2
Useful Links
1 NPTEL videos
CO-PO Mapping
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2
CO2 2
CO3 2 2
CO4 3 2 2
Remember
Apply 5 5 20 30
Analyze 5 5 15 25
Evaluate 5 10 15
Create
AY 2023-24
Course Information
Programme M.Tech.
Class, Semester First Year M. Tech.CSE Sem II
Course Code 7OE509
Course Name Machine Learning in practice
Desired Requisites: Basic mathematics and python programming

Tutorial - 20 30 50 100
Practical -
Course Objectives
1 To introduce python and mathematical concepts required for machine learning
2 To prepare data for machine learning
3 To implement supervised and unsupervised learning algorithm
CO1 Apply different data pre-processing techniques required for data preparation. Apply
Identify and implement different machine learning algorithms to solve real life
CO2 Analyze
problems.
CO3 Evaluate and compare performance of the machine learning algorithms. Evaluate

Introduction to Machine Learning
Introduction, Types of machine learning, Applications of Machine Learning,
I 6
Python basics: basic constructs of python, pandas, NumPy, Matplotlib for data
visualization
Data pre-processing
Data Cleaning: handling missing values, removing noise from data, handling
II 6
categorical features, Feature selection and reduction, Data normalization,
Train/test split, cross-validation
Supervised Learning-I
Linear regression, multiple regression, MSE, RMSE
III 8
Classification using Naïve Bayes classifier, Decision tree classifier, KNN,
logistic regression
Supervised Learning-II Ensemble models: tree-based algorithms, Bagging,
Boosting, Stacking
IV Model Performance 8
Confusion matrices, accuracy, precision, recall, F1 score, Hyperparameter
tuning, deployment
Unsupervised Learning
V Clustering- K means clustering, HDBSCAN, Dimensionality reduction using 5
PCA.
Reinforcement learning and Case study
VI
Introduction to reinforcement learning, Types, elements and applications of 6
Reinforcement learning, Case studies based on various applications of machine
learning algorithms in real life.
Text Books
1 Machine Learning. Tom Mitchell. First Edition, McGraw- Hill, 1997.
2
3
References
1 Introduction to Machine Learning Edition 2, by Ethem Alpaydin.
2
3
Useful Links
1 NPTEL ‘Introduction to Machine learning’ -Link
2
CO-PO Mapping
1 2 3 4 5 6
CO1 2 2
CO2 3
CO3 1 1 2
The strength of mapping is to be written as 1,2,3; Where, 1: Low, 2: Medium, 3: High.
Assessment (for Theory Course)

The assessment is based on 1 in-semester examinations in the form of ISE of 20 marks and MSE of 30
Marks. Also, there is End-Sem examination (ESE) of 50 marks. MSE shall be typically on modules 1 2 and
3, ISE based typically on all the modules and ESE shall be on all modules with nearly 30% weightage on
first 3 modules and 70% weightage on modules 4, 5, 6.
Assessment Plan based on Bloom’s Taxonomy Level (Marks) For Theory Course
1 Remember
2 Understand
3 Apply 15 20 35
4 Analyse 15 20 35
5 Evaluate 20 10 30
6 Create
Total 20 30 50 100

9. FY MTech CSE Syllabus AY 2023_24

Uploaded by

Copyright:

Available Formats

9. FY MTech CSE Syllabus AY 2023_24

Uploaded by

Document Information

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

9. FY MTech CSE Syllabus AY 2023_24

Uploaded by

Copyright:

Available Formats

Walchand College of Engineering, Sangli

(Government Aided Autonomous Institute)

Teaching Scheme Examination Scheme (Marks)

Module Module Contents Hours

Teaching Scheme Examination Scheme (Marks)

Module Module Contents Hours

I AVL Trees: Insertion, Deletion, and Rotations 8

Module 4: String and Trie Structures

Module 6: Geometric and Specialized Data Structures

3 Erik Demaine, Lecture Notes on MIT Courseware

2 Diestel Reinhard, “Graph Theory”, Springer-Verlag, 2000

3 Brass Peter, “Advanced Data Structures”, Cambridge University Press.

Assessment Plan based on Bloom’s Taxonomy Level (Marks)

Teaching Scheme Examination Scheme (Marks)

Module Module Contents Hours

Teaching Scheme Examination Scheme (Marks)

Module Module Contents Hours

Probability mass, density, and cumulative distribution functions,

III Statistical inference, Introduction to multivariate statistical models: 7

Graph Theory: Isomorphism, Planar graphs, graph coloring, Hamiltonian

Computer science and engineering applications: Data mining, Network

VI Recent Trends in various distribution functions in mathematical field of 6

Assessment Plan based on Bloom’s Taxonomy Level (Marks)

Teaching Scheme Examination Scheme (Marks)

Mini Project Guidelines

Assessment Plan based on Bloom’s Taxonomy Level (Marks)

Teaching Scheme Examination Scheme (Marks)

Course Outcomes (CO) with Bloom’s Taxonomy Level

List of Lab Activities:

Teaching Scheme Examination Scheme (Marks)

Teaching Scheme Examination Scheme (Marks)

To illustrate concepts of image transforms, image enhancement, image segmentation,

Course Outcomes (CO) with Bloom’s Taxonomy Level

Module Module Contents Hours

Image Segmentation and Analysis

2 Jain A. K., “Fundamentals of Digital Image Processing”, PHI

Assessment Plan based on Bloom’s Taxonomy Level (Marks)

Teaching Scheme Examination Scheme (Marks)

To impart knowledge of hardware, operating systems, distributed systems, networking,

Module Module Contents Hours

I smart transportation, smart cities, smart Living, smart energy, smart 6

Introduction, Functional View, Information View, Deployment and

Data representation and visualization, Interaction and remote control.

Service-oriented architecture-based device integration, SOCRADES:

building automation today, Case study: phase two- commercial

Hardware Platforms and Energy Consumption, Operating Systems,

V What is an IOT Device, Exemplary Device Board, Linux on Raspberry 7

VI Recent trends in sensor network and IOT architecture, Automation in 5

Assessment Plan based on Bloom’s Taxonomy Level (Marks)

Teaching Scheme Examination Scheme (Marks)

Module Module Contents Hours

Definition and importance of HCI

Interface design principles

Usability testing methods and usability heuristics

Input and output devices

Rapid prototyping and iterative design

Assessment Plan based on Bloom’s Taxonomy Level (Marks)

Teaching Scheme Examination Scheme (Marks)

Module Module Contents Hours

Teaching Scheme Examination Scheme (Marks)