SIES (Nerul) College of Arts, Science and Commerce (Autonomous)

M.Sc. Computer Science

Sr. Heading Particulars
No.
1 Title of the course M.SC. (Computer Science)

2 Eligibility for The Bachelor’s degree in the Faculty of Science/ Technology of this
admission University or equivalent degree of recognized Universities with Major and
Ancillary Subjects at undergraduate level as detailed below:
Major ANCILIARY
Mathematics
Physics Mathematics (4 Units)
Statistics Mathematics (4 Units)
Life Sciences Biochemistry or Chemistry with
Mathematics or Statistics in first and
second year OR Computer Sciences
OR Information Technology up to
second year of Bachelor’s Degree
Medicine Chemistry/ Microbiology
Bachelor’s degree in technology
(B.Tech./B.E.) in Engineering /
Computer Sciences / Information
Technology
Bachelor’s degree in computer
sciences B.C.A / B.C.S /
Information Technology
3 Minimum 45%
percentage
4 Semester I

5 Level PG 1

6 Pattern 02 years & 04 semesters CBGS

From Academic year 2023-24 in a progressive manner

7 To be implemented
from
 SIES (Nerul) College of Arts, Science and Commerce (Autonomous)
(Affiliated to University of Mumbai)
RE-ACCREDITED GRADE “A” BY NAAC (3rd CYCLE)
BOARD OF STUDIES
SYLLABUS FOR
M.Sc. Computer Science
(WITH EFFECT FROM THE ACADEMIC YEAR 2023-2024)

OBJECTIVES OF THE PROGRAMME:

● To be fundamentally strong at core subject of Computer Science.

● To apply programming and computational skills for industrial solutions.

● Broad understanding of latest technological trends.

● To identify opportunities for establishing an enterprise for immediate Employment.

● Able to understand and apply fundamental research concepts.

PROGRAMME OUTCOMES:
● An ability to apply the skills acquired in post-graduation to get better career prospects.

● An ability to apply mathematical foundations, algorithmic principles, and computer science theory in
the modeling and design of computational systems.

● An ability to apply the knowledge for higher research in a specialized area of Computer Science.

● Ability to understand and apply the core concepts of Computer Science.

● Ability to provide socially acceptable technical solutions in various domains of specializations.

Level Semest Major RM OE VSC, IKS, OJT, RP Cum.

er Mandatory Elective SEC AEC, FP Cr./
VEC Sem.
I Research
Software Defined
Information
Algorithms for Networking OR
Systems and - - - - - 22
Optimization: 06 Credits Wireless Networking:
Computing
04 Credits
(04 Credits)
Applied Signal and Image
Processing: 06 Credits
Advanced Database
Systems: 02 Credits
Total of I
14 04 04 - - - - - 22
SIES Nerul College of Arts, Science and Commerce (Autonomous)

M. Sc. Computer Science Programme

(To be implemented from Academic Year- 2023-24)

No. of
Course Code Semester I Credits
Courses

1 Major

1 M23CS1MJ01 Applied Signal and Image Processing 4

Applied Signal and Image Processing

2 M23CS1MJP01 2
Practical

3 M23CS1MJ02 Algorithm for Optimization 4

4 M23CS1MJP02 Algorithm for Optimization Practical 2

5 M23CS1MJ03 Advanced Database Techniques 1

6 M23CS1MJP03 Advanced Database Techniques Practical 1

2 Electives(E) (Any one)

7 M23CS1E01 Software Defined Networking 3

8 M23CS1EP01 Software Defined Networking Practical 1

9 M23CS1E02 Wireless Networking 3

10 M23CS1EP02 Wireless Networking Practical 1

3 Research Methodology

Research Information Systems and

11 M23CS1RM01 4
Computing

Total Credits 22
 Applied Signal and Image Processing
COURSE CODE : M23CS1MJ01 COURSE CREDIT: 04
1 credit - 15 lectures
1 lecture is 60 minutes
Course Objectives:
• Understanding the terminologies of signal and digital image processing
• Learn about basic image processing techniques.
• Develop skills to design and implement algorithms for advanced image analysis.
• Apply image processing to design solutions to real-life problems
Course Objectives:
• Apply image processing algorithms in practical applications.
• Ability to apply various images, intensity transformations, and spatial filtering.
• Knowledge of Perform frequency domain operations on images.
• Ability to apply image segmentation and extract image features.
No. of
Unit Syllabus
lectures
Signals: Periodic signals, Spectral decomposition, Signals, Reading and writing Waves,
Spectrums, Wave objects, Signal objects Harmonics: Triangle Waves, Square Waves, Aliasing,
Computing the Spectrum, Noise: Uncorrelated noise, Integrated spectrum, Brownian noise, Pink
1. Noise, Gaussian noise; Autocorrelation: Correlation, Serial correlation, Autocorrelation, 15
Autocorrelation of periodic signals, Correlation as a dot product
Case Study
Introduction: What is Digital Image Processing, Examples of Fields that Use Digital Image
Processing, Fundamental Steps in Digital Image Processing, Components of an Image Processing
System, Image types and files formats. Intensity Transformations- Log Transform, Power-law
Transform, Contrast Stretching, Thresholding Histogram Processing- Histogram Equalization
2. 15
and Histogram Matching. Linear and Non-linear smoothing of Images, Sharpening of images.
Image Derivative: Derivatives and gradients, Laplacian, the effect of noise on gradient
computation
Case Study
Edge Detection: Sobel, Canny Prewitt, Robert edge detection techniques, LoG and DoG filters,
Image Pyramids: Gaussian Pyramid, Laplacian Pyramid Morphological Image Processing:
Erosion, Dilation, Opening and closing, Hit-or-Miss Transformation, Skeletonizing, Computing
3. 15
the convex hull, removing small objects, White and black top-hats, Extracting the boundary,
Grayscale operations
Case Study
Extracting Image Features and Descriptors: Feature detector versus descriptors, Boundary
Processing and feature descriptor, Principal Components, Harris Corner Detector, Blob detector,
Histogram of Oriented Gradients, Scale-invariant feature transforms, Haar-like features
4. Image Segmentation: Hough Transform for detecting lines and circles, Thresholding and Otsu’s 15
segmentation, Edge- based/region-based segmentation, Region growing, Region splitting and
Merging, Watershed algorithm, Active Contours, morphological snakes, and GrabCut algorithms
Case Study
References:
1. Digital Image Processing by Rafael Gonzalez & Richard Woods, Pearson; 4th edition, 2018
2. Think DSP: Digital Signal Processing in Python by Allen Downey, O'Reilly Media; 1st edition 2014
Additional References:
1. Understanding Digital Image Processing, Vipin Tyagi, CRC Press, 2018
2. Digital Signal and Image Processing by Tamal Bose, John Wiley 2010
3. Hands-On Image Processing with Python by Sandipan Dey,Packt Publishing, 2018
4. Fundamentals of Digital Images Processing by A K Jain, Pearson, 2010
 Applied Signal and Image Processing - Practical

COURSE CODE : M23CS1MJP01 COURSE CREDIT: 02

1 credit - 30 lectures
1 lecture is 60 minutes

Sr. No. List of Practical

1 Write program to demonstrate the following aspects of image processing on suitable data
1. Upsampling and downsampling on Image
2. Fast Fourier Transform to compute DFT
2 Write program to demonstrate the following aspects of signal on sound/image data
1. Convolution operation
2. Template Matching
3 Write program to implement point/pixel intensity transformations such as
1. Log and Power-law transformations
2. Contrast adjustments
3. Histogram equalization
4. Thresholding, and halftoning operations
4 Write a program to apply various enhancements on images using image derivatives by
implementing Gradient and Laplacian operations.
5 Write a program to implement linear and nonlinear noise smoothing on suitable image or
sound signal.
6 Write a program to apply various image enhancement using image derivatives by
implementing smoothing, sharpening, and unsharp masking filters for generating suitable
images for specific application requirements.
7 Write a program to Apply edge detection techniques such as Sobel and Canny to extract
meaningful information from the given image samples
8 Write the program to implement various morphological image processing techniques.

9 Write the program to extract image features by implementing methods like corner and blob
detectors, HoG and Haar features
10 Write the program to apply segmentation for detecting lines, circles, and other
shapes/objects. Also, implement edge-based and region-based segmentation.
 Algorithm for Optimization
COURSE CODE : M23CS1MJ02 COURSE CREDIT: 04
1 credit - 15 lectures
1 lecture is 60 minutes
Course Objectives:
• You will be able to effectively implement optimization techniques to the existing algorithm to
improve its performance.
• You will be able to work in the areas of Machine Learning and Data Sciences Algorithms
• You will be able to perform sampling using different algorithms.
• You will be able to deal with Uncertainty in optimization.
Course Outcomes:
• Ability to understand the Optimization Process
• Optimization with a focus on practical algorithms for the design of engineering systems.
• Exposure to multivariable calculus, linear algebra, and probability concepts.
• Learn a wide variety of optimization topics, introducing the underlying mathematical problem
formulations and the algorithms for solving them
Unit Syllabus No. of
lectures
Introduction to Optimization Process
Basic Optimization Problem, Constraints, Critical Points, Conditions for Local Minima,
Contour Plots. Unimodality, Fibonacci Search, Golden Section Search, Quadratic Fit
01 Search. 15
Case Study
Order Methods
First-Order Methods, Gradient Descent, Conjugate Gradient, Adagrad, RMSProp,
Adadelta, Adam, Hypergradient Descent. Second-Order Methods, Newton’s Method,
02 Secant Method, QuasiNewton Methods 15
Case Study
Sampling and Surrogate Models
Sampling Plans, Full Factorial, Random Sampling, Uniform Projection Plans, Stratified
Sampling, Space-Filling Metrics. Surrogate Models, Fitting Surrogate Models, Linear
03 Models, Basis Functions, Fitting Noisy Objective Functions, Model Selection, 15
Probabilistic Surrogate Models, Gaussian Distribution, Gaussian Processes, Prediction.
Case Study
Optimization and Uncertainty
Optimization under Uncertainty, Uncertainty, Set-Based Uncertainty, Probabilistic
Uncertainty. Uncertainty Propagation, Sampling Methods, Taylor Approximation,
04 Polynomial Chaos, Bayesian Monte Carlo. Dynamic Programming, Ant Colony 15
Optimization. Expression Optimization, Grammars, Genetic Programming, Grammatical
Evolution, Probabilistic Grammars, Probabilistic Prototype Trees.
Case Study
References:
1. Think Julia: How to Think Like a Computer Scientist by Allen B. Downey and Ben Lauwens 1st Edition
2019 O'reilly.
2. Decision Making Under Uncertainty: Theory and Application by Mykel J. Kochenderfer MIT Lincoln
Laboratory Series 2015.
3. Introduction to Algorithms, By Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford
Stein 3Ed. (International Edition) (MIT Press) 2009
 Algorithm for Optimization - Practical

COURSE CODE : M23CS1MJP02 COURSE CREDIT: 02

1 credit - 30 lectures
1 lecture is 60 minutes
Note:
• All the Practical’s should be implemented using Julia Link: Julia:https://julialang.org/

Sr. No List of practical

Implement Contour Plots.

1
2 Implement Fibonacci and Golden section search

3 Implement Quadratic Fit Search.

4 Implement Gradient descent.

5 Implement quasi-Newton methods to find the local maxima.

6 Implement the Adagrad method with application, RMSprop and Adadelta

7 Implement radial basis functions using surrogate modeling.

8 Apply Random Forest in surrogate Model.

9 Implement Gaussian Process and its application.

10 Path finding using Ant Colony Optimization with an application.

 Advanced Database Techniques
COURSE CODE : M23CS1MJ03 COURSE CREDIT: 02
1 credit - 15 lectures
1 lecture is 60 minutes

Course Objectives:
• To provide students with theoretical knowledge and practical skills in advanced topics in database
systems, big data and modern data-intensive systems.
Course Objectives:
• To form professional competencies related to design and implementation of non-relational databases,
including object-oriented, parallel and Distributed.

Unit Syllabus No. of

lectures
Spatial and Temporal Databases: Temporal Databases: Overview of Temporal
01 Databases- TSQL2, Spatial Databases- Spatial Data Types- Spatial Relationships-
Spatial Data Structures- Spatial Access Methods- Spatial DB Implementation
Distributed Databases: Concepts, Data fragmentation, Replication and allocation
techniques for distributed database design, Query processing, Concurrency control
and recovery in distributed databases, Architecture and Design: Centralised versus
non centralized Databases, Homogeneous and Heterogeneous DDBMS, Functions
and Architecture, Distributed database design, query processing in DDBMS.
Basics Introduction to NoSQL: Characteristics of NoSQL, NoSQL Storage types, 15
Advantages and Drawbacks, NoSQL Products Interfacing and interacting with
NoSQL: Storing Data In and Accessing Data from MongoDB, Redis, HBase and
Apache Cassandra, Language Bindings for NoSQL Data Stores Understanding the
storage architecture: Working with Column Oriented Databases, HBase Distributed
Storage Architecture, Document Store Internals.
Case Study
References:
1. Database Management Systems by Raghu Ramakrishnan and Johannes Gehrke, McGraw Hill,
3rd Edition, 2014
2. Professional NoSQL By Shashank Tiwari, Wrox-John Wiley & Sons, Inc, 2011
3. Getting Started with NoSQL, Gaurav Vaish, Packt Publishing Ltd, 2013
Additional References:
1. Advanced Database Management System by byRini Chakrabarti and Shilbhadra Dasgupta,
Dreamtech Press, 2017
2. SQL & NoSQL Databases, Andreas Meier · Michael Kaufmann, Springer Vieweg, 2019
3. Parallel and Distributed Systems by Arun Kulkarni, Nupur Prasad Giri, Wiley, Second edition,
2017
4. Practical Hadoop Migration: How to Integrate Your RDBMS with the Hadoop Ecosystem and
Re-Architect Relational Applications to NoSQL By Bhushan Lakhe, Apress; 1st edition, 2016
 Advanced Database Techniques-Practical
COURSE CODE : M23CS1MJP03 COURSE CREDIT: 01
1 credit - 30 lectures
1 lecture is 60 minutes

Note:
• All the Practical’s should be implemented using Julia Link: Julia:https://julialang.org/

Sr. No List of Practical

Create different types that include attributes and methods. Define tables for these types
1 by adding a sufficient number of tuples. Demonstrate insert, update and delete operations
on these tables. Execute queries on them.
2 Create an XML database and demonstrate insert, update and delete operations on these
tables. Issue queries on it.

3 Demonstrate distributed databases environment by dividing given global conceCreate a

table that stores spatial data and issue queries on it.

4 Create a table that stores spatial data and issues queries on it.

5 Create a temporal database and issue queries on it.

6 Demonstrate the Accessing and Storing and performing CRUD operations in 21

1. MongoDB
2. Redis
7 Demonstrate the Accessing and Storing and performing CRUD operations in
1. HBase
2. Apache Cassandra

8 Demonstrating MapReduce in MongoDB to count the number of female (F) and male (M)
respondents in the database.

9 Demonstrate the indexing and ordering operations in 1. MongoDB 2. CouchDB 3. Apache

Cassandra
10 Demonstrate the use of data management and operations using NoSQL in the Cloud.
 Software Defined Networking
COURSE CODE : M23CS1E01 COURSE CREDIT: 03

1 credit - 15 lectures

1 lecture is 60 minutes

Course Objectives:

• To make the students capable of understanding computer network basics.

• To Obtain the knowledge of Software defined networks with understanding of data plane, control plane and
application plane.
• To apply network virtualization for industry standard solutions.
Course Objectives:
• To improve skills in implementing network virtualization and Software Defined Network (SDN).
• Learners will be able to explore OpenFlow specifications to build Software defined networks.
• Learners will be able to analyze and implement theories and practical related to Network management and Virtualization

Unit Syllabus No. of

lectures
Introduction to Software Defined Networking
Understanding the layered architecture of OSI/RM and TCP-IP Model Study of
various network Routing protocols, Introduction to Transport layer and Application
layer protocols. Elements of Modern Networking, Requirements and Technology,
01 15
SDN: Background and Motivation, SDN Data Plane and OpenFlow, SDN Control
Plane, SDN Application Plane
Case Study
Network Functions Virtualization
Concepts and Architecture, NFV Functionality, Network Virtualization Quality of
Service, MODERN NETWORK ARCHITECTURE: CLOUDS AND FOG, Cloud
02 15
Computing, The Internet of Things: Components
Case Study
Design and implementation of Network
Understand and implement Layer 2/3 switching techniques
(VLAN/TRUNKING/Managing Spanning Tree), Implementation of OSPF V2 and
V3, Implementation BGP, Implementation Multicast Routing, Implementation of
03 MPLS, Implementation of Traffic Filtering by using Standard and Extended Access 15
Control List, Implementation of Routing redistribution, Implementation of Policy
Based Routing/Load Balancing /QOS/Natting /VRF
Case Study
References:

1. Behrouz A Forouzan ―TCPIP Protocol Suite‖ Fourth Edition 2010

2. William Stallings, ―Foundations of Modern Networking‖, Pearson Ltd.,2016.
3. Software Defined Networks: A Comprehensive Approach by Paul Goransson and Chuck Black, Morgan
Kaufmann Publications, 2014
4. SDN - Software Defined Networks by Thomas D. Nadeau & Ken Gray, O'Reilly, 2013
5. Network Programmability and Automation-Jason Edelman, Matt Oswalt First Edition 2018.
 Software Defined Networking - Practical
COURSE CODE : M23CS1EP01 COURSE CREDIT: 01

1 credit - 30 lectures

1 lecture is 60 minutes

Note:
• All the Practical’s should be implemented using GNS3/EVENG/CISCO VIRL
• Link: GNS3 :https://www.gns3.com/software/download
• EVE-NG: https://www.eve-ng.net/index.php/download/CISCO
• VIRL:https://learningnetwork.cisco.com/s/question/0D53i00000Kswpr/virl-15-download

Sr. No Syllabus

1. Implement SPAN Technologies (Switch Port Analyzer)

1 2. Implement SNMP and Syslog
3. Implement Flexible NetFlow
2 1. Implement a GRE Tunnel
2. Implement VTP
3. Implement NAT
3 Implement Inter-VLAN Routing
4 Observe STP Topology Changes and Implement RSTP
1. Implement Advanced STP Modifications and Mechanisms
2. Implement MST
5 1. Implement EtherChannel
2. Tune and Optimize EtherChannel Operations
6 OSPF Implementation
1. Implement Single-Area OSPFv2
2. Implement Multi-Area OSPFv2
3. OSPFv2 Route Summarization and Filtering
4. Implement Multiarea OSPFv3
7 Implement BGP Communities
1. Implement MP-BGP
2. Implement eBGP for IPv4
8 Implement IPsec Site-to-Site VPNs
1. Implement GRE over IPsec Site-to-Site VPNs
2. Implement VRF Lite
9 Simulating SDN with
1. OpenDaylight SDN Controller with the Mininet Network Emulator
2. OFNet SDN network emulator
10 Simulating OpenFlow Using MININET
 Wireless Networking
COURSE CODE : M23CS1E02 COURSE CREDIT: 03

1 credit - 15 lectures

1 lecture is 60 minutes

Course Objectives:

• To understand the basic concepts of Wireless Networking.

• To understand the various trends in Wireless Technology.
• To understand 5G technologies.
Course Objectives:

• To provide an insight on the advanced concepts of wireless technologies and Wireless Optical Communication.
• To implement the working of 4G Technologies.
• To understand applications of 5G technologies and its implementation.

Unit Syllabus No. of

lectures
Introduction to Wireless Sensor Networks, Types, Advantages, Challenges and
Applications, Mobile Ad-hoc Networks (MANETs), Enabling technologies for
Wireless Sensor Networks. Introduction to wireless optical communication (WOC),
wireless optical channels, atmospheric channel, underwater optical channel,
01 atmospheric losses, WOC and Applications: Weather condition influence, 15
atmospheric turbulence effects, wireless optical communication application areas,
WOC challenges and applications.
Case Study
4G Vision: 4G Features and Challenges, Applications of 4G; 4G Technologies - LTE
FDD vs TDD comparison; frame structure and its characteristics; Smart Antenna
Techniques, OFDM Trends in Wireless Technology: MIMO Systems, Adaptive
02 Modulation and Coding with Time-Slot Scheduler - Bell Labs Layered Space Time 15
(BLAST) System , Software- Defined Radio, Cognitive Radio
Case Study
5G Technology: Understand 5GPP & NGMN, 5G architecture and design objective,
5G spectrum requirements, ITU-R IMT-2020 vision for 5G, 5G RAN & Dynamic
CRAN Architecture and applications: 5G Mobile Edge Computing & Fog computing,
03 5G Protocol Stack, 5G Ultra-dense networks, 5G Air interface, Applications 15
Case Study

References:
1. Anurag Kumar, D.Manjunath, Joy kuri, ―Wireless Networking‖, third Edition, Elsevier 2018
Additional References:
1. Jochen Schiller, ‖Mobile Communications‖, Second Edition, Pearson Education 2019.
2. Vijay Garg, ―Wireless Communications and networking‖, First Edition, Elsevier 2012..
 Wireless Networking – Practical

COURSE CODE : M23CS1EP02 COURSE CREDIT: 01

1 credit - 30 lectures

1 lecture is 60 minutes

Note:
• Practical can be implemented using GNS3, CISCO packet tracer 7.0 and above

Sr. No Practical

1 Configuring WEP on a Wireless Router

2 Demonstrating Distribution Layer Functions

3 Placing ACLs

4 Planning Network-based Firewalls

5 Configure Auto Profiles ACU Utilities

6 Creating an Adhoc Network

7 Configuring Basic AP Settings

8 Configure Ethernet/Fast Ethernet Interface

9 Configure Radio Interfaces through the GUI

10 Configure Site-to-Site Wireless Link

 Research Information Systems and Computing
COURSE CODE : M23CS1RM01 COURSE CREDIT: 04
1 credit - 15 lectures
1 lecture is 60 minutes

Course Objectives:
● The research methodology course is proposed to assist students in planning and carrying out
research projects.
● The course starts with an introduction to research and carries on the various methodologies
involved.
● Able to understand and define research, formulate problems.
● Understand and apply basic research methods including research design, data analysis and
interpretation.
Course Outcomes:
● The students are exposed to the principles, procedures, and techniques of implementing
research project.
● It continues with finding out the literature using technology, basic statistics required for
research and finally report writing.
● Understand ethical issues in research, write research reports, research paper and publish the
paper.
● Describe the research process and research methods.

Unit Syllabus No. of

lectures
Introduction: Role of Business Research, Information Systems and Knowledge
01 Management, Theory Building, Organization ethics and Issues.
Beginning Stages of Research Process: Scientific Research: Definition, Characteristics,
types, need of research. Identification of the problem, assessing the status of the problem,
formulating the objectives, preparing design (experimental or otherwise), Actual
investigation, Determining the mode of attack. Problem definition, Qualitative research 15
tools, Secondary data research.
Literature survey: References, Abstraction of a research paper, Possible ways of getting
oneself abreast of current literature.
Case Study
Research Methods and Data Collection: Survey research, communicating with
02 respondents, Observation methods, Experimental research.
Measurement Concepts, Sampling and Field work: Levels of Scale measurement,
attitude measurement, questionnaire design, sampling designs and procedures,
determination of sample size.
15
Data Analysis and Presentation: Editing and Coding, Basic Data Analysis, Univariate
Statistical Analysis and Bivariate Statistical analysis and differences between two
variables. Multivariate Statistical Analysis.
Case Study
 Documentation and scientific writing: Results and Conclusions, Preparation of
03 manuscript for Publication of Research paper, Presenting a paper in scientific seminar,
Thesis writing. Structure and Components of Research Report, Types of Report: research
papers, thesis, Research Project Reports, Pictures and Graphs, citation styles, writing a
review of paper, Bibliography.
15
Publishing the Paper: Rights and Permissions, How to Submit the Manuscript, How and
When to Use Abbreviations, How to Write a thesis, Outcome of Research, Ethical issues
in research
Case Study
04 Statistical analysis and fitting of data : Introduction to Statistics – Probability Theories
‐ Conditional Probability, Poisson Distribution, Binomial Distribution and Properties of
Normal Distributions, Estimates of Means and Proportions; Chi‐Square Test, Association
of Attributes ‐ t‐Test –Anova‐ Standard deviation ‐ Co‐efficient of variations. Co‐
15
relation and Regression Analysis.
Case Study

References:

1. Business Research Methods William G.Zikmund, B.J Babin, J.C. Carr, Atanu Adhikari,
M.Griffin Cengage 8e 2016.
2. Business Analytics Albright Winston Cengage 5e 2015.
3. Research Methods for Business Students Fifth Edition Mark Saunders 2011.
4. Multivariate Data Analysis Hair Pearson 7e 2014.
5. Thesis & Assignment Writing–J Anderson, B.H. Dursten & M.Poole, Wiley Eastern, 1977
6. A Hand Book of Methodology of Research – P. Rajammal and P. Devadoss, R. M. M. Vidya
Press, 1976.
7. Research Methodology by R. Panneerselvam, PHI, New Delhi 2005.
8. Practical Research Methods, by Dawson, Catherine, 2002, UBS Publishers’ Distributors
New Delhi.
9. Research Methodology‐ A step by step Guide for Beginners, ( 2nd ed.) Kumar Ranjit, 2005,
Pearson Education.
 SCHEME OF EXAMINATION
I. FOR MAJOR PAPERS WITH 6 CREDITS

The scheme of examination shall be divided into two parts:

▪ Internal assessment 40% i.e. 40 marks

▪ Semester end examination 60% i.e. 60 marks

(A) Internal Assessment 40 marks

Description Marks

Internal Two Internal tests of 20 marks each 20

Test Q.1 Multiple choice Questions/True or False - 10 Marks
Q.2. Attempt 2 questions out of 3 questions (5 marks each)- 10 Marks
Project One Mini-Project with presentation 20
Total 40

Note : Average of Two internal tests will be considered for 20 Marks

(B) Semester end examination 60 marks

PAPER PATTERN

Duration : 2 hours
Total Marks: 60
Q.1 15 marks OR 15 marks 15
Q.2 15 marks OR 15 marks 15

Q.3 15 marks OR 15 marks 15

Q.4 15 marks OR 15 marks 15

Total 60

Note:
1. Q.1, 2, 3 and 4 - 15 marks questions may be divided into sub questions if required.

Passing criteria: Minimum 40% in Internal (16 out of 40) and 40% (24 out
of 60) in semester end examination.
II. . FOR MAJOR PAPERS WITH 2 CREDITS

The scheme of examination shall be divided into two parts:

▪ Internal assessment 40% i.e. 20 marks

▪ Semester end examination 60% i.e. 30 marks

(A) Internal Assessment 20 marks

Description Marks

Internal Two Internal tests of 10 marks each 10

Test Q.1 Multiple choice Questions/True or False - 05 Marks
Q.2. Attempt 1 question out of 3 questions - 05 Marks
Project One Mini-Project with presentation 10
Total 20

Note : Average of Two internal tests will be considered for 20 Marks

(B) Semester end examination 30 marks

PAPER PATTERN

Duration : 1 hours
Total Marks: 30
Q.1 10 marks OR 10 marks 10
Q.2 10 marks OR 10 marks 10

Q.3 10 marks OR 10 marks 10

Total 30

Note:
1. Q.1, 2, 3 - 10 marks questions may be divided into sub questions if required.

Passing criteria: Minimum 40% in Internal (8 out of 20) and 40% (12 out
of 30) in semester end examination.
III. FOR MAJOR PAPER WITH 4 CREDITS

The scheme of examination shall be divided into two parts:

▪ Internal assessment 40% i.e. 40 marks

▪ Semester end examination 60% i.e. 60 marks

(A) Internal Assessment 40 marks

Description Marks

Internal Two Internal tests of 20 marks each 20

Test Q.1 Multiple choice Questions/True or False - 10 Marks
Q.2. Attempt 2 questions out of 3 questions (5 marks each)- 10 Marks
Project One Mini-Project with presentation 15
Attendance Attendance and Class behavior 5
Total 40

Note : Average of Two internal tests will be considered for 20 Marks

(B) Semester end examination 60 marks

PAPER PATTERN

Duration : 2 hours
Total Marks: 60
Q.1 15 marks OR 15 marks 15
Q.2 15 marks OR 15 marks 15

Q.3 15 marks OR 15 marks 15

Q.4 15 marks OR 15 marks 15

Total 60

Note:
1. Q.1, 2, 3 and 4 - 15 marks question may be divided into sub questions if required.

Passing criteria: Minimum 40% in Internal (16 out of 40) and 40% (24 out
of 60) in semester end examination.
IV. For RM Paper

The scheme of examination shall be divided into two parts:

▪ Internal assessment 40% i.e. 40 marks

▪ Semester end examination 60% i.e. 60 marks

(A) Internal Assessment 40 marks

Description Marks

Internal Two Internal tests of 20 marks each 20

Test Q.1 Multiple choice Questions/True or False - 10 Marks
Q.2. Attempt 2 questions out of 3 questions (5 marks each)- 10 Marks
Project One Mini-Project with presentation 15
Attendance Attendance and Class behavior 5
Total 40

Note : Average of Two internal tests will be considered for 20 Marks

(B) Semester end examination 60 marks

PAPER PATTERN
Duration : 2 hours
Total Marks: 60
Q.1 15 marks OR 15 marks 15
Q.2 15 marks OR 15 marks 15

Q.3 15 marks OR 15 marks 15

Q.4 15 marks OR 15 marks 15

Total 60

Note:
1. Q.1, 2, 3 and 4 - 15 marks question may be divided into sub questions if required.

Passing criteria: Minimum 40% in Internal (16 out of 40) and 40% (24 out
of 60) in semester end examination.
 SCHEME OF PRACTICAL EXAMINATION
I. FOR MAJOR PAPERS WITH 6 CREDITS

The scheme of examination shall be

● Practical assessment carries 50 Marks : 40 marks + 05 marks (journal)+ 05 marks(viva)
● Minimum 75 % practical are required to be completed and written in the journal.
(Certified Journal is compulsory for appearing at the time of Practical Exam)

(A) Practical Assessment 50 marks

Description Marks
Q.1. Two questions of practical’s (20 marks each) 40
Journal 5
Viva 5
Total 50

Passing criteria: Minimum 40% in Internal (20 out of 50)

II. FOR MAJOR PAPERS WITH 2 CREDITS

The scheme of examination shall be

● Practical assessment carries 50 Marks : 40 marks + 05 marks (journal)+ 05 marks(viva)
● Minimum 75 % practical are required to be completed and written in the journal.
(Certified Journal is compulsory for appearing at the time of Practical Exam)

(A) Practical Assessment 50 marks

Description Marks
Q1. Two questions of practical’s (20 marks each) 40
Journal 5
Viva 5
Total 50

Passing criteria: Minimum 40% in Internal (20 out of 50)

.
III. FOR MAJOR PAPER WITH 4 CREDITS

The scheme of examination shall be

● Practical assessment carries 50 Marks : 40 marks + 05 marks (journal)+ 05 marks(viva)
● Minimum 75 % practical are required to be completed and written in the journal.
(Certified Journal is compulsory for appearing at the time of Practical Exam)

(A) Practical Assessment 50 marks

Description Marks
Q.1 Two questions of practical’s (20marks each) 40
Journal 5
Viva 5
Total 50

Passing criteria: Minimum 40% in Internal (20 out of 50)