Course Code Course Name Credit

CSC601 Data Analytics and Visualization 03

Prerequisite:Basic statistics and Maths, Python programming

Course Objectives: The course aims:

1 To Introduce the concept of Data Analytics Lifecycle.
2 To Develop Mathematical concepts required for advance regression.
3 To Understand data modeling in time series and its process.
4 To create awareness about Text analytics and its applications.
5 To provide overview of Data analytics and visualization with R.
6 To provide overview of Data analytics and visualization with Python.

Course Outcomes: After successful completion of the course students will be able to:
1 Comprehend basics of data analytics and visualization.
2 Apply various regression models on given data set and perform prediction.
3 Demonstrate advance understanding of Time series concepts and analysis of data using
various time series models.
4 Analyze Text data and gain insights.
5 Experiment with different analytics techniques and visualization using R.
6 Experiment with different analytics techniques and visualization using Python.

Modu Detailed Content Hours

le
1 Introduction to Data analytics and life cycle 5
1.1 Data Analytics Lifecycle overview:Key Roles for a Successful
Analytics, Background and Overview of Data Analytics Lifecycle
Project
Phase 1: Discovery: Learning the Business Domain, Resources
Framing the Problem, Identifying Key Stakeholders. Interviewing the
Analytics Sponsor, Developing Initial Hypotheses Identifying
Potential Data Sources
Phase 2: Data Preparation: Preparing the Analytic Sandbox,
Performing ETLT, Learning About the Data, DataConditioning,
Survey and visualize, Common Tools for the Data Preparation Phase
Phase 3: Model Planning: Data Exploration and Variable Selection,
Model Selection ,Common Tools for the Model Planning Phase
Phase 4: Model Building: Common Tools for the Model Building
Phase
Phase 5: Communicate Results
Phase 6: Operationalize
2 Regression Models 8
2.1 Introduction to simple Linear Regression: The Regression Equation,
Fittedvalue and Residuals, Least Square
 Introduction to Multiple Linear Regression: Assessing the Model,
Cross-Validation, Model Selection and Stepwise Regression,
Prediction Using Regression
2.2 Logistic Regression: Logistic Response function and logit, Logistic
Regression and GLM, Generalized Linear model, Predicted values
from Logistic Regression, Interpreting the coefficients and odds
ratios, Linear and Logistic Regression: similarities and Differences,
Assessing the models.
3 Time Series 7
Overview of Time Series Analysis Box-Jenkins Methodology,
ARIMA Model Autocorrelation Function (ACF) ,Autoregressive
Models ,Moving Average Models ,ARMA and ARIMA Models ,
Building and Evaluating an ARIMA Model, Reasons to Choose and
Cautions
4 Text Analytics 7
4.1 History of text mining, Roots of text mining overview of seven
practices of text analytic, Application and use cases for Text mining:
extracting meaning from unstructured text, Summarizing Text.
Text Analysis Steps, A Text Analysis Example , Collecting Raw Text
,Representing Text ,Term Frequency—Inverse Document Frequency
(TFIDF),Categorizing Documents by Topics, Determining
Sentiments , Gaining Insights .
5 Data analytics and visualization with R 6
5.1 Introduction to R: Data Import and Export, Attribute and Data type,
Descriptive statistics.
Exploratory Data Analysis: Visualization before analysis, DirtyData,
visualizing single variable, examining Multiple variable, Data
Exploration versus presentation.
6 Data analytics and Visualization with Python 6
6.1 Essential Data Libraries for data analytics:Pandas, NumPy, SciPy.
Plotting and visualization with python: Introduction to Matplotlib,
Basic Plotting with Matplotlib, Create Histogram, BarChart, Pie
chart, Box Plot, violin plot using Matplotlib.
6.2 Introduction to seaborn Library, MultiplePlots, Regressionplot,
regplot.
Total 39

Textbooks:
1 Data Science and Big Data Analytics: Discovering, Analyzing, Visualizing and Presenting
Data,EMC Education services Wiley Publication

2 Data Analytics using Python: Bharati Motwani, Wiley Publications.

3 Practical Statistics for Data Scientists 50+ Essential Concepts Using R
and Python, O‘Reilly Publications 2nd Edition
4 Practical Text Mining and statistical Analysis for non-structured text data applications,1st
edition,Grey Miner,Thomas Hill.
 References:
1 Data Mining, Concepts and Techniques: 3rd edition, Jiawei Han, Micheline Kamber and
Jian Pei
2 Data Analytics using R, Bharati Motwani, Wiley Publications
3 Python for Data Analysis: 3rd Edition, Wes McKinney ,Publisher(s): O'Reilly Media, Inc.

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first-class test is to be conducted
when approx. 40% syllabus is completed and second-class test when additional 40% syllabus is
completed. Duration of each test shall be one hour.

End Semester Theory Examination:

1 Question paper will consist of 6 questions, each carrying 20 marks.
2 The students need to solve a total of 4 questions.
3 Question No.1 will be compulsory and based on the entire syllabus.
4 Remaining question (Q.2 to Q.6) will be selected from all the modules.

Useful Links
1 http://varianceexplained.org/RData/
2 https://www.kaggle.com/code/iamleonie/time-series-interpreting-acf-and-pacf
3 https://www.geeksforgeeks.org/data-visualization-using-matplotlib/
 Course Code Course Name Credit

CSC602 Cryptographyand System Security 03

Pre-requisite: Basic concepts of OSI Layer

Course Objectives: The course aims:

1 The concepts of classical encryption techniques and concepts of finite fields and number
theory.
2 To explore the working principles and utilities of various cryptographic algorithms including
secret key cryptography, hashes and message digests, and public key algorithms
3 To explore the design issues and working principles of various authentication protocols, PKI
standards.
4 To explore various secure communication standards including Kerberos, IPsec, and SSL/TLS
and email.
5 The ability to use existing cryptographic utilities to build programs for secure communication.
6 The concepts of cryptographic utilities and authentication mechanisms to design secure
applications

Course Outcomes:
1 Identify information security goals, classical encryption techniques and acquire fundamental
knowledge on the concepts of finite fields and number theory.
2 Understand, compare and apply different encryption and decryption techniques to solve
problems related to confidentiality and authentication
3 Apply the knowledge of cryptographic checksums and evaluate the performance of different
message digest algorithms for verifying the integrity of varying message sizes
4 Apply different digital signature algorithms to achieve authentication and create secure
applications .
5 Apply network security basics, analyze different attacks on networks and evaluate the
performance of firewalls and security protocols like SSL, IPSec, and PGP
6 Apply the knowledge of cryptographic utilities and authentication mechanisms to design
secure applications

Module Detailed Content Hours

1 Introduction & Number Theory
1.1 Services, Mechanisms and attacks-the OSI security architecture-Network 7
security model-Classical Encryption techniques (Symmetric cipher model,
mono-alphabetic and poly-alphabetic substitution techniques: Vignere
cipher, playfair cipher, Hill cipher, transposition techniques: keyed and
keyless transposition ciphers, steganography).
2 Block Ciphers & Public Key Cryptography 7
2.1 Data Encryption Standard-Block cipher principles-block cipher modes of
operationAdvanced Encryption Standard (AES)-Triple DES-Blowfish-RC5
algorithm. Public key cryptography: Principles of public key cryptosystems-
The RSA algorithm, The knapsack algorithm, El-Gamal Algorithm. Key
management – Diffie Hellman Key exchange
 3 Cryptographic Hashes, Message Digests and Digital Certificates 7
3.1 Authentication requirement – Authentication function , Types of
Authentication, MAC – Hash function – Security of hash function and MAC
–MD5 – SHA – HMAC – CMAC, Digital Certificate: X.509, PKI
4 Digital signature schemes and authentication Protocols 6
4.1 Digital signature and authentication protocols : Needham Schroeder
Authentication protocol, Digital Signature Schemes – RSA, EI Gamal and
Schnorr, DSS.
5 System Security 6
Operating System Security: Memory and Address Protection, File Protection
Mechanism, User Authentication. Linux and Windows: Vulnerabilities, File
System Security
Database Security: Database Security Requirements, Reliability and Integrity,
Sensitive Data, Inference Attacks, Multilevel Database Security
6 Web security 6
6.1 Web Security Considerations, User Authentication and Session
Management, Cookies, SSL, HTTPS, SSH, Web Browser Attacks,
WebBugs, Clickjacking, CrossSite Request Forgery, Session
Hijacking and Management, Phishing Technique, DNS Attack,
Secure Electronic Transaction, Email Attacks, Firewalls, Penetration
Testing

Textbooks:
1 Computer Security Principles and Practice, William Stallings, Sixth Edition, Pearson
Education
2 Security in Computing, Charles P. Pfleeger, Fifth Edition, Pearson Education
3 Network Security and Cryptography, Bernard Menezes, Cengage Learning

4 Network Security Bible, Eric Cole, Second Edition, Wiley

5 Mark Stamp‘s Information Security Principles and Practice, Wiley

References:
1 Web Application Hackers Handbook by Wiley.
2 Computer Security, Dieter Gollman, Third Edition, Wiley
3 CCNA Security Study Guide, Tim Boyle, Wiley
4 Introduction to Computer Security, Matt Bishop, Pearson. 5.
5 Cloud Security and Privacy, Tim Mather, Subra Kumaraswamy, Shahed Latif , O‘Riely
6 Cryptography and Network Security, Atul Kahate, Tata Mc Graw Hill

Assessment:

Internal Assessment:
 Assessment consists of two class tests of 20 marks each. The first-class test is to be conducted
whenapprox. 40% syllabus is completed and second class test when additional40% syllabus is
completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1 Question paper will consist of 6 questions, each carrying 20 marks.
2 The students need to solve a total of 4 questions.
3 Question No.1 will be compulsory and based on the entire syllabus.
4 Remaining question (Q.2 to Q.6) will be selected from all the modules.

Useful Links
1 https://nptel.ac.in/courses/106105031

2 https://onlinecourses.nptel.ac.in/noc22_cs03/preview

3 https://www.coursera.org/learn/basic-cryptography-and-crypto-api
 Course Code Course Name Credit

CSC603 Software Engineering and Project Management 03

Pre-requisite: None

Course Objectives: The course aims:

1 To provide the knowledge of software engineering discipline.
2 To understand Requirements and analyze it
3 To do planning and apply scheduling

4 To apply analysis, and develop software solutions

5 To demonstrate and evaluate real time projects with respect to software engineering principles
and Apply testing and assure quality in software solution.
6 To understand need of project management and project management life cycle.

Course Outcomes:
1 Understand and use basic knowledge in software engineering.
2 Identify requirements, analyze and prepare models.

3 Plan, schedule and track the progress of the projects.

4 Design & develop the software solutions for the growth of society

5 Apply testing and assure quality in software solutions

6 Generate project schedule and can construct, design and develop network diagram for
different type of Projects. They can also organize different activities of project

Module Detailed Content Hours

1 Introduction to Software Engineering
Nature of Software, Software Engineering, Software Process, Capability 08
Maturity Model (CMM) Generic Process Model, Prescriptive Process
Models: The Waterfall Model, V-model, Incremental Process Models,
Evolutionary Process Models, Concurrent Models, Agile process, Agility
Principles, Extreme Programming (XP), Scrum, Kanban model
2 Requirements Analysis and Cost Estimation 06
2.1 Software Requirements: Functional & non-functional – user-system
requirement engineering process – feasibility studies – elicitation – validation
& management – software prototyping – S/W documentation – Analysis and
modelling Requirement Elicitation, Software requirement specification (SRS)
3Ps (people, product and process) Process and Project metrics Software
Project Estimation: LOC, FP, Empirical Estimation Models - COCOMO II
Model
3 Design Engineering 07
 3.1 Design Process & quality, Design Concepts, The design Model, Pattern-based
Software Design. 4.2 Architectural Design :Design Decisions, Views, Patterns,
Application Architectures, Modeling Component level Design: component,
Designing class based components, conducting component-level design, User
Interface Design: The golden rules, Interface Design steps & Analysis, Design
Evaluation
4 Software Risk, Configuration Management 05
4.1 Risk Identification, Risk Assessment, Risk Projection, RMMM Software
Configuration management, SCM repositories, SCM process Software Quality
Assurance Task and Plan, Metrics, Software Reliability, Formal Technical
Review (FTR), Walkthrough.
5 Software Testing and Maintenance 05
5.1 Testing: Software Quality, Testing: Strategic Approach, Strategic Issues-
Testing: Strategies for Conventional Software, Object oriented software, Web
AppsValidating Testing- System Testing- Art of Debugging.
Maintenance : Software Maintenance-Software Supportability-
Reengineering- Business Process Reengineering- Software Reengineering-
Reverse Engineering- Restructuring- Forward Engineering.
6 IT Project Management and Project Scheduling 08
6.1 Introduction, 4 P‘s, W5HH Principle, Need for Project Management, Project
Life cycle and ITPM, Project Feasibility, RFP, PMBOK Knowledge areas,
Business Case, Project Planning, Project Charter and Project Scope.
6.2 Project Scheduling:Defining a Task Set for the Software Project, Timeline
chartsWBS, Developing the Project Schedule, Network Diagrams (AON,
AOA), CPM and PERT, Gantt Chart , Tracking the Schedule, Earned Value
Analysis

Textbooks:
1 Roger S. Pressman, Software Engineering: A practitioner's approach, McGraw Hill

2 Rajib Mall, Fundamentals of Software Engineering, Prentice Hall India

3 John M. Nicholas, Project Management for Business and Technology, 3rd edition, Pearson
Education.

References:
1 ―Software Engineering : A Precise Approach‖ Pankaj Jalote , Wiley India
2 Ian Sommerville ― Software Engineering‖ 9th edition Pearson Education SBN-13: 978-0- 13-
703515-1, ISBN-10: 0-13-703515-2
3 PankajJalote, An integrated approach to Software Engineering, Springer/Narosa.
 Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first-class test is to be conducted
when
approx. 40% syllabus is completed and second class test when additional40% syllabus is
completed.Duration of each test shall be one hour.

End Semester Theory Examination:

1 Question paper will consist of 6 questions, each carrying 20 marks.
2 The students need to solve a total of 4 questions.
3 Question No.1 will be compulsory and based on the entire syllabus.
4 Remaining question (Q.2 to Q.6) will be selected from all the modules.

Useful Links
1 https://onlinecourses.swayam2.ac.in/cec21_cs21/preview

2
https://nptel.ac.in/courses/106101061
3
http://www.nptelvideos.com/video.php?id=911&c=9 4
 Course Code Course Name Credit

CSC604 Machine Learning 03

Pre-requisite: Data Structures, Basic Probability and Statistics, Algorithms

Course Objectives: The course aims:

1 To introduce Machine learning concepts
2 To develop mathematical concepts required for Machine learning algorithms
3 To understand various Regression techniques
4 To understand Clustering techniques
5 To develop Neural Network based learning models

Course Outcomes:
After successful completion of the course students will be able to:
1 Comprehend basics of Machine Learning
2 Build Mathematical foundation for machine learning
3 Understand various Machine learning models
4 Select suitable Machine learning models for a given problem
5 Build Neural Network based models
6 Apply Dimensionality Reduction techniques

Modul Detailed Content Hours

e
1 Introduction to Machine Learning 6
1.1 Introduction to Machine Learning, Issues in Machine Learning,
Application of Machine Learning, Steps of developing a Machine
Learning Application.
Supervised and Unsupervised Learning: Concepts of Classification,
Clustering and prediction, Training, Testing and validation dataset, cross
validation, overfitting and underfitting of model
Performance Measures: Measuring Quality of model- Confusion Matrix,
Accuracy, Recall, Precision, Specificity, F1 Score, RMSE
2 Mathematical Foundation for ML 5
2.1 System of Linear equations, Norms, Inner products, Length of Vector, Distance
between vectors, Orthogonal vectors
2.2 Symmetric Positive Definite Matrices, Determinant, Trace, Eigenvalues and
vectors, Orthogonal Projections, Diagonalization, SVD and its applications
3 Linear Models 7
3.1 The least-squares method, Multivariate Linear Regression, Regularized
Regression, Using Least-Squares Regression for classification
3.2 Support Vector Machines
4 Clustering 4

4.1 Hebbian Learning rule

 4.2 Expectation -Maximization algorithm for clustering

5 Classification models 10
5.1 Introduction, Fundamental concept, Evolution of Neural Networks, Biological
Neuron, Artificial Neural Networks, NN architecture, McCulloch-Pitts Model.
Designing a simple network, Non-separable patterns, Perceptron model with
Bias. Activation functions, Binary, Bipolar, continuous, Ramp. Limitations of
Perceptron.
5.2 Perceptron Learning Rule. Delta Learning Rule (LMS-Widrow Hoff),
Multi-layer perceptron network. Adjusting weights of hidden layers. Error back
propagation algorithm.
5.3 Logistic regression
6 Dimensionality Reduction 07
6.1 Curse of Dimensionality.
6.2 Feature Selection and Feature Extraction
6.3 Dimensionality Reduction Techniques, Principal Component Analysis.

Textbooks:
1 Nathalie Japkowicz & Mohak Shah, ―Evaluating Learning Algorithms: A
Classification Perspective‖, Cambridge.
2 Marc Peter Deisenroth, Aldo Faisal, Cheng Soon Ong, ―Mathematics for machine learning‖,
3 Samir Roy and Chakraborty, ―Introduction to soft computing‖, Pearson Edition.
4 Ethem Alpaydın, ―Introduction to Machine Learning‖, MIT Press McGraw-Hill Higher
Education
5 Peter Flach, ―Machine Learning‖, Cambridge University Press

References:
1 Tom M. Mitchell, ―Machine Learning‖, McGraw Hill
2 Kevin P. Murphy, ―Machine Learning ― A Probabilistic Perspective‖, MIT Press
3 Stephen Marsland, ―Machine Learning an Algorithmic Perspective‖, CRC Press
4 Shai Shalev-Shwartz, Shai Ben-David, ―Understanding Machine Learning‖, Cambridge
University Press
5 Peter Harrington, ―Machine Learning in Action‖, DreamTech Press

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first-class test is to be conducted
when approx. 40% syllabus is completed and second class test when additional40% syllabus is
completed. Duration of each test shall be one hour.

End Semester Theory Examination:

1 Question paper will consist of 6 questions, each carrying 20 marks.
2 The students need to solve a total of 4 questions.
3 Question No.1 will be compulsory and based on the entire syllabus.
4 Remaining question (Q.2 to Q.6) will be selected from all the modules.
Useful links:

1 NPTEL
2 AI and ML Certification - Enroll in PGP AI ML Courses with Purdue (simplilearn.com)
3 https://www.learndatasci.com/out/coursera-machine-learning/
4 https://www.learndatasci.com/out/google-machine-learning-crash-course/
 CourseCode Course Name Credit

CSDLO6011 High Performance Computing 03

Course Objectives: Students will try to:

1. Learn the concepts of high-performance computing.

2. Gain knowledge of platforms for high performance computing.
3. Design and implement algorithms for parallel programming applications.
4. Analyze the performance metrics of High Performance Computing.
5. Understand the parallel programming paradigm, algorithms and applications.
6. Demonstrate the understanding of different High Performance Computing tools.

Course Outcomes: Students will be able to:

1. Understand the fundamentals of parallel Computing.

2. Describe different parallel processing platforms involved in achieving High
Performance Computing.
3. Demonstrate the principles of Parallel Algorithms and their execution.
4. Evaluate the performance of HPC systems.
5. Apply HPC programming paradigm to parallel applications
6. Discuss different current HPC Platforms.

Prerequisite: Computer Organization, C Programming, Data structures and Algorithm Analysis.

DETAILED SYLLABUS:

Sr. Module Detailed Hours

No. Content

0 Prerequisite Computer Organization, C Programming, Data 02

structures andAlgorithm Analysis.

I Introduction Introduction to Parallel Computing: Motivating 05

Parallelism, Scope of Parallel Computing, Levels of
parallelism (instruction,transaction, task, thread, memory,
function), Models (SIMD,
MIMD, SIMT, SPMD, Dataflow Models, Demand-
drivenComputation).

Self-learning Topics: Parallel Architectures:

Interconnectionnetwork, Processor Array,
Multiprocessor.
 II Parallel Parallel Programming Platforms: Implicit 04
Programming Parallelism:Dichotomy of Parallel Computing
Platforms Platforms, Physical
Organization of Parallel Platforms, Communication
Costs inParallel Machines.

Self-learning Topics: Trends in Microprocessor &

Architectures,Limitations of Memory System Performance.
III Parallel Principles of Parallel Algorithm Design: 09
Algorithm Preliminaries,Decomposition Techniques,
And Characteristics of Tasks andInteractions, Mapping
Concurrency
Techniques for Load Balancing,
Basic Communication operations: Broadcast and
ReductionCommunication types.

Self-learning Topics: Parallel Algorithm Models

IV Performance Performance Measures : Speedup, execution time, 05
Measures for efficiency,cost, scalability, Effect of granularity on
HPC performance, Scalability of Parallel Systems, Amdahl‘s
Law, Gustavson‘s Law.

Self-learning Topics: Performance Bottlenecks.

V Programming Programming Using the Message-Passing 09

Paradigms for Paradigm : Principles of Message Passing
HPC Programming, The BuildingBlocks: Send and Receive
Operations, MPI: the Message Passing Interface,
Topology and Embedding.
Parallel Algorithms and Applications :
One-Dimensional Matrix-Vector Multiplication, Graph
Algorithms, Sample Sort, Two-Dimensional
MatrixVectorMultiplication.

Self-learning Topics: Introduction to OpenMP.

VI General OpenCL Device Architectures, Introduction to OpenCL 05
Purpose Programming.
Graphics
Processing Self-learning Topics: Introduction to CUDA
Unit(GPGPU) architecture, and Introduction to CUDA Programming.
Architecture
and
Programming
Text Books:

1. AnanthGrama, Anshul Gupta, George Karypis, Vipin Kumar , ―Introduction to Parallel

Computing‖, Pearson Education, Second Edition, 2007.
2. Kai Hwang, Naresh Jotwani, ―Advanced Computer Architecture: Parallelism,
Scalability, Programmability‖, McGraw Hill, Second Edition, 2010.
3. Edward Kandrot and Jason Sanders, ―CUDA by Example – An Introduction to General
Purpose GPU Programming‖, Addison-Wesley Professional ©, 2010.
4. Georg Hager, Gerhard Wellein, ―Introduction to High Performance Computing for
Scientists and Engineers", Chapman & Hall / CRC Computational Science series, 2011.
5. Benedict Gaster, Lee Howes, David Kaeli, Perhaad Mistry, Dana Schaa ,
―Heterogeneous Computing with OpenCL‖ , 2nd Edition, Elsevier, 2012.

Reference Books:

1. Michael J. Quinn, ―Parallel Programming in C with MPI and OpenMP‖, McGraw-Hill

International Editions, Computer Science Series, 2008.
2. Kai Hwang, Zhiwei Xu, ―Scalable Parallel Computing: Technology, Architecture,
Programming‖, McGraw Hill, 1998.
3. Laurence T. Yang, MinyiGuo, ―High- Performance Computing: Paradigm and
Infrastructure‖ Wiley, 2006.
4. Fayez Gebali, ―Algorithms and Parallel Computing‖, John Wiley & Sons, Inc., 2011.

Online References:
Sr. No. Website Name
1. https://onlinecourses.nptel.ac.in/noc21_cs46/preview
2. https://onlinecourses.nptel.ac.in/noc22_cs21/preview
Assessment:
Internal Assessment (IA) for 20 marks:
• IA will consist of Two Compulsory Internal Assessment Tests.
Approximately 40% to 50% of syllabus content must be covered in
First IA Test and remaining 40% to 50% of syllabus content must be
covered in Second IA Test.

End Semester Examination: Some guidelines for setting the question papers are as:

● Weightage of each module in end semester examination is expected to

be/will be proportional to number of respective lecture hours mentioned in
the syllabus.
● Question paper format
• Question Paper will comprise of a total of six questions each
carrying 20 marks. Q.1 will be compulsory and should cover
maximum contents of the syllabus
• Remaining questions will be mixed in nature (part (a) and part (b)
of each question must be from different modules. For example, if
Q.2 has part (a) from Module 3 then part (b) must be from any other
Module randomly selected from all the modules)
• A total of four questions need to be answered.

• Suggestion: Laboratory work based on the above syllabus can be

incorporated as amini project in CSM601: Mini-Project.
 Course Code Course Name Credit
CSDLO6012 03
Distributed Computing

Pre-requisite: C Programming

Course Objectives: The course aims:

1 To provide students with contemporary knowledge in distributed systems
2 To equip students with skills to analyze and design distributed applications.
3 To provide master skills to measure the performance of distributed synchronization
algorithms
4 To equip students with skills to availability of resources
5 To provide master skills to distributed file system

Course Outcomes:
1 Demonstrate knowledge of the basic elements and concepts related to distributed system
technologies.
2 Illustrate the middleware technologies that support distributed applications such as RPC, RMI
and Object based middleware.
3 Analyze the various techniques used for clock synchronization and mutual exclusion
4 Demonstrate the concepts of Resource and Process management and synchronization
algorithms
5 Demonstrate the concepts of Consistency and Replication Management

6 Apply the knowledge of Distributed File System to analyze various file systems like NFS,
AFS and the experience in building large-scale distributed applications

Module Detailed Content Hours

1 Introduction to Distributed Systems
1.1 Characterization of Distributed Systems: Issues, Goals, and Types of 06
distributed systems, Distributed System Models, Hardware concepts,
Software Concept.
1.2 Middleware: Models of Middleware, Services offered by middleware, Client
Server model.
2 Communication 06
2.1 Layered Protocols, Interprocess communication (IPC): MPI, Remote Procedure Call
(RPC), Remote Object Invocation, Remote Method Invocation (RMI)
2.2 Message Oriented Communication, Stream Oriented Communication, Group
Communication
3 Synchronization 09
3.1 Clock Synchronization, Physical Clock, Logical Clocks, Election Algorithms,
Mutual Exclusion, Distributed Mutual Exclusion-Classification of Mutual
Exclusion Algorithm, Requirements of Mutual Exclusion Algorithms,
Performance measure.
3.2 Non Token based Algorithms: Lamport Algorithm, Ricart–Agrawala‘s
Algorithm, Maekawa‘s Algorithm
 3.3 Token Based Algorithms: Suzuki-Kasami‘s Broadcast Algorithms, Singhal‘s
Heuristic Algorithm, Raymond‘s Tree.based Algorithm, Comparative
Performance Analysis.
4 Resource and Process Management 06
4.1 Desirable Features of global Scheduling algorithm, Task assignment approach,
Load balancing approach, load sharing approach
4.2 Introduction to process management, process migration, Threads,
Virtualization, Clients, Servers, Code Migration
5 Consistency, Replication and Fault Tolerance 06
5.1 Introduction to replication and consistency, Data-Centric and Client-Centric
Consistency Models, Replica Management
5.2 Fault Tolerance: Introduction, Process resilience, Reliable client-server and group
communication, Recovery
6 Distributed File Systems and Name Services 06
6.1 Introduction and features of DFS, File models, File Accessing models, File-Caching
Schemes, File Replication, Case Study: Distributed File Systems (DSF), Network File
System (NFS), Andrew File System (AFS), HDFS

Textbooks:
1 Andrew S. Tanenbaum and Maarten Van Steen, ―Distributed Systems: Principles and Paradigms,
2nd edition, Pearson Education.
2 George Coulouris, Jean Dollimore, Tim Kindberg, , "Distributed Systems: Concepts and Design",
4th Edition, Pearson Education, 2005.
References:
1 A. S. Tanenbaum and M. V. Steen, "Distributed Systems: Principles and Paradigms", Second
Edition, Prentice Hall, 2006.
2 M. L. Liu, ―Distributed Computing Principles and Applications‖, Pearson Addison Wesley, 2004.
3 Learn to Master Distributed Computing by ScriptDemics, StarEdu Solutions

Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first-class test is to be conducted when
approx. 40% syllabus is completed and second class test when additional40% syllabus is completed.
Duration of each test shall be one hour.

End Semester Theory Examination:

1 Question paper will consist of 6 questions, each carrying 20 marks.
2 The students need to solve a total of 4 questions.
3 Question No.1 will be compulsory and based on the entire syllabus.
4 Remaining question (Q.2 to Q.6) will be selected from all the modules.

Useful Links
1 https://onlinecourses.nptel.ac.in/noc21_cs87/
2 https://nptel.ac.in/courses/106106168

* Suggestion: Laboratory work based on the above syllabus can be incorporated as a mini project in
CSM601: Mini-Project.
 Course Code: Course Title Credit
CSDLO6013 Image and Video Processing 3

Prerequisite: Engineering Mathematics, Algorithms

Course Objectives:
1 To introduce students to the basic concepts of image processing, file formats.
2 To acquire an in-depth understanding of image enhancement technqiues.
3 To gain knowledge of image segmentation and compression techniques.
4 To acquire fundamentals of image transform techniques.

Course Outcomes
1 To gain fundamental knowledge of Image processing.
2 To apply image enhancement techniques.
3 To apply image segmentation and compression techniques.
4 To gain an in-depth understanding of image transforms.
5 To gain fundamental understanding of video processing.

Module Content Hrs

1 Digital Image Fundamentals 04
1.1 Introduction to Digital Image, Digital Image Processing System, Sampling
and Quantization,
1.2 Representation of Digital Image, Connectivity, Image File Formats : BMP,
TIFF and JPEG.
2 Image Enhancement in Spatial domain 08
2.1 Introduction to Image Enhancement :Gray Level Transformations, Zero
Memory Point Operations,
2.2 Histogram Processing,.
2.3 Neighbourhood Processing, Spatial Filtering, Smoothing and Sharpening
Filters
3 Image Segmentation 06
3.1 Segmentation based on Discontinuities (point, Line, Edge)
3.2 Image Edge detection using Robert, Sobel, Previtt masks, Image Edge
detection using Laplacian Mask.
 3.3 Region Oriented Segmentation: Region growing by pixel Aggregation,
Split and Merge
4 Image Transforms 09
4.1 Introduction to Unitary Transforms
4.2 Discrete Fourier Transform(DFT), Inverse DFT, Properties of DFT, Fast
Fourier Transform(FFT),
4.3 Discrete Hadamard Transform(DHT), Inverse DHT, Fast Hadamard
Transform(FHT), Discrete Cosine Transform(DCT), Inverse DCT
5 Image Compression 08
5.1 Introduction, Redundancy, Fidelity Criteria
5.2 Lossless Compression Techniques : Run length Coding, Arithmetic
Coding, Huffman Coding
5.3 Lossy Compression Techniques: Improved Gray Scale Quantization,
Vector Quantization
6 Digital Video Processing 04
6.1 Introduction to Digital Video Processing, Sampled Video
6.2 Composite and Component Video, Digital video formats and
applications
Total 39

Textbooks:

1 Rafael C. Gonzalez and Richard E. Woods, ‗Digital Image Processing‘, Pearson Education
Asia, Third Edition, 2009

2 S. Jayaraman, E. Esakkirajan and T. Veerkumar, ―Digital Image Processing‖ TataMcGraw

Hill Education Private Ltd, 2009

3 Anil K. Jain, ―Fundamentals and Digital Image Processing‖, Prentice Hall of India Private
Ltd, Third Edition

4 S. Sridhar, ―Digital Image Processing‖, Oxford University Press, Second Edition, 2012.

5. Alan C. Bovik, ―The Essential Guide To Video Processing‖ Academic Press,

6 Yao Wang, Jorn Ostermann, Ya-Qin Zang, ―Video Processing and Communications‖,
Prentice Hall, Signal Processing series.
References Books

1. David A. Forsyth, Jean Ponce, ―Computer Vision: A Modern Approach‖, Pearson Education,
Limited, 2011

2. Malay K. Pakhira, ―Digital Image Processing and Pattern Recognition‖, Prentice Hall of
India Private Ltd, Third Edition

3 B. Chandra and D. Dutta Majumder, ―Digital Image Processing and Analysis‖, Prentice Hall
of India Private Ltd, 2011

4 Khalid Sayood, ―Introduction to Data Compression‖, Third Edition , Morgan Kaufman MK

Publication

Assessment:
Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted
when approximately 40% syllabus is completed and the second class test when an additional 40%
syllabus is completed. Duration of each test shall be one hour.
End Semester Theory Examination:
1 Question paper will comprise a total of six questions.
2 All questions carry equal marks.
3 Questions will be mixed in nature (for example supposed Q.2 has part (a) from module 3
then part (b) will be from any module other than module 3).
4 Only Four questions need to be solved.
5 In question, paper weightage of each module will be proportional to the number of
respective lecture hours as mentioned in the syllabus.

Useful Links

1 https://swayam.gov.in

2 https://nptel.ac.in/courses

3 https://www.coursera.org

* Suggestion: Laboratory work based on the above syllabus can be incorporated as a

mini project in CSM601: Mini-Project.
Lab Code Lab Name Credit
CSL601 Data Analytics and Visualization Lab 1

Prerequisite: Basic Python

Lab Objectives:
1 To effectively use libraries for data analytics.
2 To understand the use of regression Techniques in data analytics applications.
3 To use time series models for prediction.
4 To introduce the concept of text analytics and its applications.
5 To apply suitable visualization techniques using R and Python.
Lab Outcomes:
At the end of the course, students will be able to —-
1 Explore various data analytics Libraries in R and Python.
2 Implement various Regression techniques for prediction.
3 Build various time series models on a given data set.
4 Design Text Analytics Application on a given data set.
5 Implement visualization techniques to given data sets using R .
6 Implement visualization techniques to given data sets using Python.

Suggested Experiments: Students are required to complete at least 08 experiments

Preferably using R Programming Language/Python

Sr. No. Name of the Experiment

1 Getting introduced to data analytics libraries in Python and R.
2 Simple Linear Regression in Python/R.
3 Multiple Linear Regression in Python/R.
4 Time Series Analysis in Python/R.
5 Implementation of ARIMA model in python / R.
6 Text analytics: Implementation of Spam filter/Sentiment analysis in python/R.
7,8 Two visualization experiments in R using different Libraries.
9,10 Two visualization experiments in python using different Libraries.

Useful Links:
1 https://www.geeksforgeeks.org/data-visualization-with-python
2 https://www.coursera.org/specializations/data-science-python
3 https://www.geeksforgeeks.org/data-visualization-in-r/
5 https://towardsdatascience.com/introduction-to-arima-for-time-series-forecasting-

References:
1 Data Analytics using R, Bharati Motwani, Wiley Publications
2 Python for Data Analysis: 3rd Edition, WesMcKinney, Publisher(s): O'Reilly Media, Inc.
 3 Better Data Visualizations A Guide for Scholars, Researchers, and Wonks, Jonathan
Schwabish, Columbia University Press

Term Work:
1 Term work should consist of 08 experiments.
2 Journal must include at least 2 assignments based on Theory and Practicals
3 The final certification and acceptance of term work ensures satisfactory performance of
laboratory work and minimum passing marks in term work.
4 Total 25 Marks (Experiments: 15-marks, Attendance Theory & Practical: 05-marks,
Assignments: 05-marks)
Oral & Practical exam
Based on the entire syllabus
Lab Code Lab Name Credit
CSL602 Cryptographic and system security Lab 1

Prerequisite: Operating System, Basics of Java and Python Programming.

Lab Objectives:
1 To be able to apply the knowledge of symmetric cryptography to implement simple ciphers
2 To be able to analyze and implement public key algorithms like RSA and El Gamal
3 To analyze and evaluate performance of hashing algorithms
4 To explore the different network reconnaissance tools to gather information about networks .
Lab Outcomes:
1 Apply the knowledge of symmetric cryptography to implement simple ciphers

2 Analyze and implement public key algorithms like RSA and El Gamal

3 Analyze and evaluate performance of hashing algorithms

4 Explore the different network reconnaissance tools to gather information about networks
5 Use tools like sniffers, port scanners and other related tools for analyzing packets in a network.

6 Apply and set up firewalls and intrusion detection systems using open source technologies and
to explore email security.

Suggested Experiments: Students are required to complete at least 10 experiments.

Star (*) marked experiments are compulsory.
Sr. No. Name of the Experiment
1* Design and Implementation of a product cipher using Substitution and Transposition
ciphers.
2* Implementation and analysis of RSA cryptosystem and Digital signature scheme
using RSA/El Gamal.
3* Implementation of Diffie Hellman Key exchange algorithm
4 For varying message sizes, test integrity of message using MD-5, SHA-1, and analyse
the performance of the two protocols. Use crypt APIs.
5* Exploring wireless security tools like Kismet, NetStumbler etc.
6* Study the use of network reconnaissance tools like WHOIS, dig,traceroute, nslookup
to gather information about networks and domain registrars.
7 Study of packet sniffer tools wireshark, :- 1. Observer performance in promiscuous as
well as non-promiscuous mode. 2. Show the packets can be traced based on different
filters.
8* Download and install nmap. Use it with different options to scan open ports, perform
OS fingerprinting, do a ping scan, tcp port scan, udp port scan, etc. .
9* Detect ARP spoofing using nmap and/or open source tool ARPWATCH and wireshark
10 Use the NESSUS/ISO Kaali Linux tool to scan the network for vulnerabilities
11 Set up IPSEC under LINUX. b) Set up Snort and study the logs. c) Explore the GPG
tool of linux to implement email security.

Useful Links:
1 www.leetcode.com
2 www.hackerrank.com
3 www.cs.usfca.edu/
4 www.codechef.com

Term Work:
1 Term work should consist of 10 experiments.
2 Journal must include at least 2 assignments.
3 The final certification and acceptance of term work ensures that satisfactory performance of
laboratory work and minimum passing marks in term work.
4 Total 25 Marks (Experiments: 15-marks, Attendance Theory & Practical: 05-marks,
Assignments: 05-marks)
Oral & Practical exam
Based on the entire syllabus of CSL602and CSC602
Lab Code Lab Name Credit
CSL603 Software Engineering andProject Management Lab 1

Prerequisite: Knowledge of Linux Operating system, installation and configuration of

services and command line basics, Basics of Computer Networks and Software
Development Life cycle.
Lab Objectives:
1 To understand DevOps practices which aims to simplify Software Development Life Cycle.
2 To be aware of different Version Control tools like GIT, CVS or Mercurial
3 To Integrate and deploy tools like Jenkins and Maven, which is used to build, test and deploy
applications in DevOps environment
4 To understand the importance of Jenkins to Build and deploy Software Applications on server
environment
5 To use Docker to Build, ship and manage applications using containerization
6 To understand the concept of Infrastructure as a code and install and configure Ansible tool
Lab Outcomes:
1 To understand the fundamentals of DevOps engineering and be fully proficient with DevOps
terminologies, concepts, benefits, and deployment options to meet your business requirements
2 To obtain complete knowledge of the ―version control system‖ to effectively track changes
augmented with Git and GitHub
3 Understand the importance of Selenium and Jenkins to test Software Applications
4 To understand the importance of Jenkins to Build and deploy Software Applications on server
environment
5 To understand concept of containerization and Analyze the Containerization of OS images and
deployment of applications over Dockerk.

6 To Synthesize software configuration and provisioning using Ansible.

Suggested Experiments: Students are required to complete at least 10 experiments from the list
given below.
Star (*) marked experiments are compulsory.
Sr. No. Name of the Experiment
1 To understand DevOps: Principles, Practices, and DevOps Engineer Role and
Responsibilities
2 To understand Version Control System / Source Code Management, install git and
create a GitHub account
3 To Perform various GIT operations on local and Remote repositories using GIT
Cheat-Sheet
4 To understand Continuous Integration, install and configure Jenkins with
 Maven/Ant/Gradle to setup a build Job
5 To Build the pipeline of jobs using Maven / Gradle / Ant in Jenkins, create a pipeline
script to Test and deploy an application over the tomcat server.
6 To understand Jenkins Master-Slave Architecture and scale your Jenkins standalone
implementation by implementing slave nodes.
7 To Setup and Run Selenium Tests in Jenkins Using Maven.
8 To understand Docker Architecture and Container Life Cycle, install Docker and
execute docker commands to manage images and interact with containers
9 To learn Dockerfile instructions, build an image for a sample web application using
Dockerfile.
10 To install and Configure Pull based Software Configuration Management and
provisioning tools using Puppet
11 To learn Software Configuration Management and provisioning using Puppet
Blocks(Manifest, Modules, Classes, Function)
12 To provision a LAMP/MEAN Stack using Puppet Manifest.

Useful Links:
1 https://nptel.ac.in/courses/128106012

2 https://www.edureka.co/devops-certification-training

3 https://www.coursera.org/professional-certificates/devops-and-software-engineering

Term Work:
1 Term work should consist of 10 experiments.
2 Journal must include at least 2 assignments.
3 The final certification and acceptance of term work ensures that satisfactory performance of
laboratory work and minimum passing marks in term work.
4 Total 25 Marks (Experiments: 15-marks, Attendance Theory & Practical: 05-marks,
Assignments: 05-marks)
Oral & Practical exam
Based on the entire syllabus of CSL603 and CSC603
Lab Code Lab Name Credit

CSL604 Machine Learning Lab 1

Prerequisite: C Programming Language.

Lab Objectives:
1 To introduce platforms such as Anaconda, COLAB suitable to Machine learning
2 To implement various Regression techniques
3 To develop Neural Network based learning models
4 To implement Clustering techniques
Lab Outcomes:
After successful completion of the course students will be able to:
1 Implement various Machine learning models
2 Apply suitable Machine learning models for a given problem
3 Implement Neural Network based models
4 Apply Dimensionality Reduction techniques

Suggested Experiments: Students are required to complete at least 10 experiments.

Sr. No. Name of the Experiment
1 Introduction to platforms such as Anaconda, COLAB
2 Study of Machine Learning Libraries and tools (Python library, tensorflow, keras,...)
Implementation of following algorithms for a given example data set-
3 Linear Regression.
4 Logistic Regression.
5 Support Vector Machines
6 Hebbian Learning
7 Expectation -Maximization algorithm
8 McCulloch Pitts Model.
9 Single Layer Perceptron Learning algorithm
10 Error Backpropagation Perceptron Training Algorithm
11 Principal Component Analysis
12 Applications of above algorithms as a case study (E.g. Hand Writing Recognition
using MNIST data set, classification using IRIS data set, etc)

Useful Links:
1 https://www.learndatasci.com/out/edx-columbia-machine-learning/
2 https://www.learndatasci.com/out/oreilly-hands-machine-learning-scikit-learn-keras-and-ten
sorflow-2nd-edition/
3 https://www.learndatasci.com/out/google-machine-learning-crash-course/
4 https://www.learndatasci.com/out/edx-columbia-machine-learning/

Term Work:
1 Term work should consist of 10 experiments.
2 Journal must include at least 2 assignments.
3 The final certification and acceptance of term work ensures that satisfactory performance of
laboratory work and minimum passing marks in term work.
4 Total 25 Marks (Experiments: 15-marks, Attendance Theory & Practical: 05-marks,
Assignments: 05-marks)
Oral & Practical exam
Based on the entire syllabus of CSL604and CSC604
 Lab Code Lab Name Credit
CSL605 Skill Based Lab course : Cloud Computing 2

Prerequisite: Computer Networks

Lab Objectives:
1 To make students familiar with key concepts of virtualization.

2 To make students familiar with various deployment models of cloud such as private, public,
hybrid and community so that they start using and adopting appropriate types of cloud for
their application.
3 To make students familiar with various service models such as IaaS, SaaS, PaaS, Security as
a Service (SECaaS) and Database as a Service.
4 To make students familiar with security and privacy issues in cloud computing and how to
address them.
Lab Outcomes:
1 Implement different types of virtualization techniques.

2 Analyze various cloud computing service models and implement them to solve the given
problems.
3 Design and develop real world web applications and deploy them on commercial cloud(s).

4 Explain major security issues in the cloud and mechanisms to address them.

5 Explore various commercially available cloud services and recommend the appropriate one
for the given application.
6 Implement the concept of containerization

Theory :

Module Detailed Contents Hou

rs

1 Introduction and overview of cloud computing. To understand the origin 4

of cloud computing, cloud cube model, NIST model, characteristics of
cloud, different deployment models service models,
advantages and disadvantages.
 2 Concept of Virtualization along with their types, structures and 4
mechanisms. Demonstration of creating and running Virtual machines
inside hosted hypervisors like Virtual Box and KVM with their
comparison based on various virtualization parameters.

Functionality of Bare-metal hypervisors and their relevance in cloud 4

3 computing platforms. Installation, configure and manage Bare Metal
hypervisor along with instructions to create and run virtual machines
inside it. It should also emphasize on accessing VMs in different
environments along with additional services provided by them like Load
balancing, Auto-Scaling, Security etc.

Lab: (Teachers are requested to complete above theory before staring lab work)

1 Title: To study and Implement Infrastructure as a Service using 4

AWS/Microsoft Azure.
Objective: To demonstrate the steps to create and run virtual machines
inside a Public cloud platform. This experiment should emphasize on
creating and running Linux/Windows Virtual machines inside Amazon
EC2 or Microsoft Azure Compute and accessing them using RDP or
VNC tools.

2 Title: To study and Implement Platform as a Service using AWS Elastic 4

Beanstalk/ Microsoft Azure App Service.
Objective: To demonstrate the steps to deploy Web applications or Web
services written in different languages on AWS Elastic Beanstalk/
Microsoft Azure App Service.

3 To study and Implement Storage as a Service using Own Cloud/ AWS 2

S3, Glaciers/ Azure Storage.

4 To study and Implement Database as a Service on SQL/NOSQL 2

databases like AWS RDS, AZURE SQL/ MongoDB Lab/ Firebase.

5 Title: To study and Implement Security as a Service on AWS/Azure 3

Objective: To understand the Security practices available in public cloud
platforms and to demonstrate various Threat detection, Data protection
and Infrastructure protection services in AWS and Azure.
 6 Title: To study and implement Identity and Access Management (IAM) 2
practices on AWS/Azure cloud.
Objective: To understand the working of Identity and Access
Management IAM in cloud computing and to demonstrate the case study
based on Identity and Access Management (IAM) on AWS/Azure cloud
platform.

7 Title: To study and Implement Containerization using Docker 4

Objective: To know the basic differences between Virtual machine and
Container. It involves demonstration of creating, finding, building, installing,
and running Linux/Windows application containers inside a local machine or
cloud platform.

8 Title: To study and implement container orchestration using Kubernetes 2

Objective: To understand the steps to deploy Kubernetes Cluster on local
systems, deploy applications on Kubernetes, creating a Service in
Kubernetes, develop Kubernetes configuration files in YAML and
creating a deployment in Kubernetes using YAML,

9 Mini-project: Design a Web Application hosted on a public cloud 4

platform [It should cover the concept of IaaS, PaaS, DBaaS, Storage as a
Service, Security as a Service etc.]

Suggested Experiments: Students are required to complete the above experiments.

Sr. No. Assignment
1
Assignment based on selection of suitable cloud platform solution based on
requirement analysis considering given problem statement
2
Assignment on recent trends in cloud computing and related technologies
3
Assignment on comparative study of different computing
technologies [Parallel, Distributed, Cluster, Grid, Quantum)
4
Comparative study of different hosted and bare metal Hypervisors with suitable
parameters along with their use in public/private cloud platform
5
Assignment on explore and compare the similar type of services provided by
AWS and Azure [Any ten services]
Useful Links:
1 https://docs.aws.amazon.com/
2 https://docs.microsoft.com/en-us/azure
3 https://kubernetes.io/docs/home/
4 https://docs.docker.com/get-started/

Term Work:
1 Term work should consist of 10 experiments and mini project.
2 Journal must include at least 3 assignments.
3 The final certification and acceptance of term work ensures satisfactory performance of
laboratory work and minimum passing marks in term work.
4 Total 25 Marks (Experiments: 15-marks, Attendance Theory & Practical: 05-marks,
Assignments: 05-marks)

Oral examination will be based on Laboratory work, mini project and above syllabus
Course code Course Name Credits
CSM601 Mini Project 2B 02

Objectives
1 To understand and identify the problem
2 To apply basic engineering fundamentals and attempt to find solutions to the problems.
3 Identify, analyze, formulate and handle programming projects with a comprehensive and
systematic approach
4 To develop communication skills and improve teamwork amongst group members and
inculcate the process of self-learning and research.
Outcome: Learner will be able to…
1 Identify societal/research/innovation/entrepreneurship problems through appropriate
literature surveys
2 Identify Methodology for solving above problem and apply engineering knowledge and
skills to solve it
3 Validate, Verify the results using test cases/benchmark data/theoretical/
inferences/experiments/simulations
4 Analyze and evaluate the impact of solution/product/research/innovation
/entrepreneurship towards societal/environmental/sustainable development
5 Use standard norms of engineering practices and project management principles during
project work
6 Communicate through technical report writing and oral presentation.
● The work may result in research/white paper/ article/blog writing and publication
● The work may result in business plan for entrepreneurship product created
● The work may result in patent filing.
7 Gain technical competency towards participation in Competitions, Hackathons, etc.
8 Demonstrate capabilities of self-learning, leading to lifelong learning.
9 Develop interpersonal skills to work as a member of a group or as leader
Guidelines for Mini Project
1 Mini project may be carried out in one or more form of following:
Product preparations, prototype development model, fabrication of set-ups, laboratory
experiment development, process modification/development, simulation, software
development, integration of software (frontend-backend) and hardware, statistical data
analysis, creating awareness in society/environment etc.
2 Students shall form a group of 3 to 4 students, while forming a group shall not be allowed
less than three or more than four students, as it is a group activity.
3 Students should do survey and identify needs, which shall be converted into problem
statement for mini project in consultation with faculty supervisor/head
of department/internal committee of faculties.
4 Students shall submit an implementation plan in the form of Gantt/PERT/CPM chart,
which will cover weekly activity of mini projects.
5 A logbook may be prepared by each group, wherein the group can record weekly work
progress, guide/supervisor can verify and record notes/comments.
6 Faculty supervisors may give inputs to students during mini project activity; however,
focus shall be on self-learning.
7 Students under the guidance of faculty supervisor shall convert the best solution into a
working model using various components of their domain areas and demonstrate.
8 The solution to be validated with proper justification and report to be compiled in
standard format of University of Mumbai. Software requirement specification (SRS)
documents, research papers, competition certificates may be submitted as part of annexure
to the report.
 9 With the focus on self-learning, innovation, addressing societal/research/innovation
problems and entrepreneurship quality development within the students through the Mini
Projects, it is preferable that a single project of appropriate level and quality be carried
out in two semesters by all the groups of the students. i.e. Mini Project 2 in semesters V
and VI.
10 However, based on the individual students or group capability, with the mentor‘s
recommendations, if the proposed Mini Project adhering to the qualitative aspects
mentioned above, gets completed in odd semester, then that group can be allowed to
work on the extension of the Mini Project with suitable improvements/modifications or a
completely new project idea in even semester. This policy can be adopted on a case by
case basis.
Term Work
The review/ progress monitoring committee shall be constituted by the heads of departments of
each institute. The progress of the mini project to be evaluated on a continuous basis, based on
the SRS document submitted. minimum two reviews in each semester.
In continuous assessment focus shall also be on each individual student, assessment based on
individual‘s contribution in group activity, their understanding and response to questions.
Distribution of Term work marks for both semesters shall be as below: Marks 25
1 Marks awarded by guide/supervisor based on logbook 10
2 Marks awarded by review committee 10
3 Quality of Project report 05
Review / progress monitoring committee may consider following points for assessment
based on either one year or half year project as mentioned in general guidelines
One-year project:
1 In the first semester the entire theoretical solution shall be made ready, including
components/system selection and cost analysis. Two reviews will be conducted based on
a presentation given by a student group.
First shall be for finalization of problem
Second shall be on finalization of proposed solution of problem.
2 In the second semester expected work shall be procurement of component‘s/systems,
building of working prototype, testing and validation of results based on work completed
in an earlier semester.
First review is based on readiness of building working prototype to be conducted.
 Second review shall be based on poster presentation cum demonstration of working
model in the last month of the said semester.

Half-year project:
1 In this case in one semester students‘ group shall complete project in all aspects including,
 Identification of need/problem
Proposed final solution
Procurement of components/systems
Building prototype and testing

2 Two reviews will be conducted for continuous assessment,

First shall be for finalization of problem and proposed solution
Second shall be for implementation and testing of solution.

Mini Project shall be assessed based on following points

1 Clarity of problem and quality of literature Survey for problem identification

2 Requirement gathering via SRS/ Feasibility Study

3 Completeness of methodology implemented

 4 Design, Analysis and Further Plan

5 Novelty, Originality or Innovativeness of project

6 Societal / Research impact

7 Effective use of skill set : Standard engineering practices and Project management
standard

8 Contribution of an individual‘s as member or leader

9 Clarity in written and oral communication

10 Verification and validation of the solution/ Test Cases

11 Full functioning of working model as per stated requirements

12 Technical writing /competition/hackathon outcome being met

In one year project (sem V and VI), first semester evaluation may be based on first 10 criteria
and remaining may be used for second semester evaluation of performance of students in mini
projects.
In case of half year projects (completing in VI sem) all criteria‘s in generic may be considered
for evaluation of performance of students in mini projects.

Guidelines for Assessment of Mini Project Practical/Oral Examination:

1 Report should be prepared as per the guidelines issued by the University of Mumbai.

2 Mini Project shall be assessed through a presentation and demonstration of working

model by the student project group to a panel of Internal and External Examiners
preferably from industry or research organizations having experience of more than five
years approved by the head of Institution.

3 Students shall be motivated to publish a paper/participate in competition based on the

work in Conferences/students competitions.