RASHTRIYA RAKSHA UNIVERSITY

An Institution of National Importance

(Pioneering National Security and Police University of India)
Lavad, Dehgam, Gandhinagar-382305, Gujarat, India

Syllabus and Examination Evaluation Scheme

as per Choice Based Credit System (CBCS)
(For the candidates to be admitted from the academic year 2022 - 2023 onwards)

Name of the School SCHOOL OF INFORMATION TECHNOLOGY,

ARTIFICIAL INTELLIGENCE & CYBER SECURITY

Name of the Programme Master of Technology in Data Science & Machine Learning

Program Coordinator Mr. Jatin Patel

Assistant Professor
School of Information Technology, Artificial Intelligence &
Cyber Security,
Rashtriya Raksha University
Syllabus Approval Granted as per ● Board of Studies
● Academic Council Meeting dated on ----------
 Programme Structure
RASHTRIYA RAKSHA UNIVERSITY
An Institution of National Importance
Lavad, Dehgam, Gandhinagar-382305, Gujarat, India

Name of the School: SCHOOL OF INFORMATION TECHNOLOGY, ARTIFICIAL INTELLIGENCE

& CYBER SECURITY
Name of the Programme: (Approved as per Academic Council)
MASTER OF TECHNOLOGY (DATA SCIENCE & MACHINE LEARNING)

Short Name: M.TECH (DS & ML)

TEACHING AND EXAMINATION SCHEME
Programme M.TECH Specialization Data Science & Machine Learning

Semester I

Programme 2 years
Duration
Effective from Academic 2022- Effective for the batch Admitted in 2022
23
Year
Teaching scheme Examination scheme (Marks)
Code Subject
Name Credit Hours (per week) Theory Practical

Lecture Practical Lecture Practical Int Ext Total Int Ext Total
(Lab.)
L Tu Total P Total L Tu Total P Total

Core Compulsory Papers

1A01DSA Data Structures 3 0 3 1 1 3 0 3 2 2 30 70 100 15 35 50
& Algorithm
1A02ACM Applied 3 1 4 0 0 3 2 5 0 0 30 70 100 15 35 50
Computational
Mathematics
1A03SCP Scientific 3 0 3 1 1 3 0 3 2 2 30 70 100 15 35 50
Computing
using Python

1A04MAL Machine 3 0 3 1 1 3 0 3 2 2 30 70 100 15 35 50

Learning
1A05HPC High 3 0 3 1 1 3 0 3 2 2 30 70 100 15 35 50
Performance
Computing
1A06NSA Network 3 0 3 1 1 3 0 3 2 2 30 70 100 15 35 50
Security & AI
 1A07EDS Ethics in Data 1 0 1 0 0 1 0 1 0 0 00 50 50 15 35 50
Science
TOTAL

Programme Structure
Semester I
Total Credits 25
Theory 20
Practical 5
Total Marks of
Entire Programme
 Syllabus
Semester-I
RASHTRIYA RAKSHA UNIVERSITY
An Institution of National Importance
Lavad, Dehgam, Gandhinagar-382305, Gujarat, India

Name of the Programme: (Approved as per Academic Council)

MASTER OF TECHNOLOGY (DATA SCIENCE & MACHINE LEARNING)
Programme M.TECH (DS & ML) Branch/Spec. DS & ML
Semester I Version I
Effective from Academic Year 2022-23 Effective for the batch Admitted in 2022
Subject Code 1A01DSA Subject Name Data Structure & Algorithm

Teaching scheme Examination scheme (Marks)

(Per week) Lecture Practical Total INT EXT Total
(Lab.)
L TU P
03 00 01 04 30 70 100
Credit Theory

Hours 03 00 02 05 Practical 15 35 50

Content:
Unit Subject Content Hrs
1 Understanding the need for computational complexity analysis: Asymptotic Notations, Proof of 05
correctness, Performance analysis, Recursive Algorithms and Recurrences.

2 Complexity Theory: Various complexity classes, linear reductions. Probabilistic

algorithms, Approximation algorithms and complexity classes relating to Parallel
08
algorithms
3 Data Structures: Hash tables, Binomial heaps, Fibonacci heaps, Disjoint set structures
05
4 Greedy Algorithms: Making change, graphs and minimum spanning tree, shortest path,
Knapsack problem, Scheduling, etc.

Divide and Conquer: Implementing rules, Binary search, Merge Sort, Quick Sort, 12
Convex Hull, Matrix multiplication
5 Dynamic Programming: Introduction of Dynamic Programming, Principle of
05
Optimality, Examples like Single source shortest paths, Knapsack problem, Chained
matrix multiplication, Longest Common Subsequence, etc.
6 Intractable Problems: Polynomial Time, class P, Polynomial Time Verifiable Algorithms, 05
class NP, NP completeness and reducibility, NP Hard Problems, NP completeness proofs,
Approximation Algorithms.
 Graph Algorithms: Elementary algorithms, DFS, BFS, Backtracking, and Branch & Bound 05
techniques with related examples

Practical Content:

Readings:
1. Gilles Brassard and Paul Bratley, Fundamentals of Algorithmics, PHI Publication.
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest& Clifford Stein, Introduction to
Algorithms, PHI Publication.
3. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, Fundamentals of Computer Algorithms,
University Press
4. Jean-Paul Tremblay and Paul G. Sorenson, An Introduction to Data Structures with Applications,
Tata McGraw Hill
5. Robert L. Kruse, Data Structures and Program Design in C, PHI

Subject Code 1A02ACM Subject Name Applied Computational Mathematics

Teaching scheme Examination scheme (Marks)

(Per week) Lecture Practical Total INT EXT Total
(Lab.)
L TU P
Credit 03 01 00 04 Theory 30 70 100

Hours 03 02 00 05 Practical 15 35 50

Content:
Unit Subject Content Hrs
1 Review of Linear Algebra: Matrices, Vector Properties, Eigenvalues and Eigenvectors, 08
Distance Measures, Half-planes, Application for Linear Algebra in Computer Science
2 The Role of Statistics in Engineering: The Engineering Method and Statistical Thinking,
Collecting Engineering Data, Mechanistic and Empirical Models, Probability and 04
Probability Models
3 Probability and Statistics: Probability theory and axioms; Random variables; Probability
distributions and density functions (univariate and multivariate), Expectations and moments, 10
Covariance and correlation, Confidence intervals, Correlation functions, Random walks,
Markov process, Statistical inference
4 Descriptive Statistics and Point Estimation of Parameters: Numerical Summaries of
Data, Frequency Distributions and Histograms, Box and Probability Plots, Point 08
Estimation, Sampling Distributions and the Central Limit Theorem, Methods of Point
Estimation
5 Statistical Intervals for a Single Sample: Confidence Interval on the mean of a Normal
Distribution, Confidence Interval on the Variance and Standard Deviation of a Normal
Distribution, Large-Sample Confidence Interval for a Population Proportion, Guidelines 08
for Constructing Confidence Intervals, Tolerance and Prediction Intervals
 6 Optimization: Basic Concepts, Linear Programming, Duality, Constrained and
unconstrained optimization, gradient decent and non-gradient techniques, Introduction to 07
least squares optimization, optimization in Practice.

Practical Content:

Reference Books:
1. Gilbert Strang, Linear Algebra and its applications, Harcourt, Brace, Jovanovich Publishers
2. Javier R. Movellan, Introduction to Probability Theory and Statistics
3. Douglas C. Montgomery, George C. Runger, Applied Probability and Statistics for
Engineers, Wiley
4. Introduction to Probability, Bertsekas, Dimitri and John Tsitsiklis, Athena Scientific
5. Jeff M. Phillips, Mathematical Foundations for Data Analysis, e-book, University of Utah
Paneerselvam, Operational Research, PHI

Subject Code 1A03SCP Subject Name Scientific Programming with Python

Teaching scheme Examination scheme (Marks)

(Per week) Lecture Practical Total INT EXT Total
(Lab.)
L TU P
Credit 03 00 01 04 Theory 30 70 100

Hours 03 00 02 05 Practical 15 35 50

Content:
Unit Subject Content Hrs
1 Introduction to Python, Object oriented paradigm
Interactive computing with IPython, Jypyter 45
2 Arrays with NumPy
Data structures and formats with Pandas
Scientific functions with Scipy
3 Visualization and plotting with Matplotlib, seaborn, mayavi, PIL
4 Data formats and Analysis with Pandas, Numpy, statsmodels, SymPy, networkx, PyTables
Data Wrangling, Data manipulation dplyr
5 Speeding up code and parallelism using PyMPI, cython, numba
6 Testing with pytest
Documentation with Sphinx
Using Binder
Connecting python and interfacing with other languages
Practical Content:

Reference Books:
1. https://aaltoscicomp.github.io/python-for-scicomp/
2. Jeff M. Phillips, Mathematical Foundations for Data Analysis, e-book, University of Utah
Paneerselvam, Operational Research, PHI
3. Continuum Analytics and Robert Johansson, Introduction to Scientific Computing in Python
 Subject Code 1A04MAL Subject Name Machine Learning

Teaching scheme Examination scheme (Marks)

(Per week) Lecture Practical Total INT EXT Total
(Lab.)
L TU P
Credit 03 00 01 04 Theory 30 70 100
Hours 03 00 02 05 Practical 15 35 50
Content:
Unit Subject Content Hrs
1 Introduction: Understanding the need for AI and Machine Learning (ML), AI & Data,
Types of ML Algorithms: Supervised, Unsupervised Learning and semi supervised learning, 04
reinforcement learning, evolutionary computation
ML Model development life cycle
Deep Learning for Human Like Learning
2 Regression Techniques:
Regression for prediction, Gradient Descent and Ascent, Learning with Momentum, Loss
Functions, Overfitting and underfitting, Model evaluation techniques 12
Types of Regression: Linear Regression, Multi-variate, Polynomial. – Gradient Descent and
Normal Equation Method, Regression with Regularization
Hyper-parameters tuning,

Dimensionality Reduction: PCA, Linear Discriminant Analysis

3 Classification Techniques:
Naïve Bayes Classification: Bayesian Learning, Naïve Bayes Classification, MAP, Bayesian
Belief Networks 10
Decision Tree
K-Nearest Neighbors
Support Vector Machines: Hard Margin and Soft Margin, Kernels and Kernel Trick,
Evaluation Measures for Classification Techniques
4 Artificial Neural Networks (ANN):
Biological Neurons and Biological Neural Networks, Perceptron Learning, Activation 09
Functions, Multilayer Perceptron, Forward and Back Propagation, Types of ANN, Loss
functions and hyperparameter tuning
5 Unsupervised Learning:
Uses in Clustering, associations and dimensionality reduction
Clustering, Hierarchical Agglomerative Clustering, k-means Algorithm 04
6 Reinforcement Learning
Exploration vs Exploitation, MDP, Policy, Q-Learning
06
Practical Content:

Reference Books:
 1. Tom Mitchell, Machine Learning, TMH
2. C. Bishop, Pattern Recognition and Machine Learning, Springer
3. Kishan Mehrotra, Chilukuri Mohan and Sanjay Ranka, Elements of Artificial Neural
Networks, Penram International
4. Rajjan Shinghal, Pattern Recognition, Techniques and Applications, OXFORD
5. Andrew Kelleher, Adam Kelleher, Applied Machine Learning for Data Scientist and Software
engineers, Addison-Wesley Professional

Subject Code 1A05HPC Subject Name High Performance Computing

Teaching scheme Examination scheme (Marks)

(Per week) Lecture Practical Total INT EXT Total
(Lab.)
L TU P
03 01 00 04 30 70 100
Credit Theory

Hours 03 02 00 05 Tutorial 15 35 50

Content:
Unit Subject Content Hrs
1
Intro to High Performance Computing: Components of a high-performance distributed 08
computing system, Types of parallel programming models, Parallel Programming
Platforms, communication model, architecture, static and dynamic interconnection
networks and their evaluation, topologies, communication costs, routing mechanism,
impact of processor-processor mapping and its techniques.
2 High-throughput computing: Preliminaries, decomposition techniques, task
characteristics, mapping techniques, handling interaction overheads, algorithm models, the 08
Multithreaded DAG Model, Work Optimality and Weak Scaling, Basic Concurrency
Primitives, Data Races and Race Conditions
3 Multicore computing
CUDA Parallelism Model, Foundations of Shared Memory, Thread Cooperation and
Execution Efficiency, Constants memory and events, memory management, Scheduling and 08
Work Distribution, Race conditions, Memory Profiling and optimization
4 Assessing and analyzing application scalability: Scalable Parallel Computing, computing
clusters, Clustering for Massive Parallelism, Computer Clusters and MPP Architectures,
Design Principles of Computer Clusters, Cluster Job and Resource Management, Case 06
Studies of Top Supercomputer Systems
5 Cloud Programming and Software Environments: Features of Cloud and Grid Platforms,
Public and Private cloud infrastructure, compute, GPU-compute and storage cloud, cloud-
based resource management, commercial cloud platforms: Google Cloud, Amazon AWS, 09
Microsoft Azure
6 Fault Tolerance and Security: Failure models, failure detection, algorithms for fault
tolerance, and recovery from failure in distributed systems, Authentication in Distributed
Systems, Distribution of security mechanisms, access control, and security management 06

Practical Content:
Reference Books:
1. Ananth Grama, Anshul Gupta, George Karypis and Vipin Kumar, Introduction to Parallel
Computing (2nd Edition), Pearson, 2003. ISBN-13: 978-0201648652.
2. Georg Hager and Gerhard Wellein, Introduction to High Performance Computing for
Scientists and Engineers (1st Edition), CRC Press, Taylor and Francis Group, 2010. ISBN-
13: 978-1439811924.
3. Parallel Algorithms https://nptel.ac.in/courses/106/103/106103188/
4. Kai Hwang, Geoffrey C. Fox and Jack J. Dongarra, Distributed and Cloud Computing from
Parallel Processing to the Internet of Things, Elsevier
5. Andrew S. Tanenbaum and Maarten van Steen, Distributed Systems: Principles and
Paradigms, Createspace
6. Kenneth P Birman, Guide to Reliable Distributed Systems: Building High-Assurance
Applications and Cloud-Hosted Services, Springer

Subject Code 1A06NSA Subject Name Network Security and AI

Teaching scheme Examination scheme (Marks)

(Per week) Lecture Practical Total INT EXT Total
(Lab.)
L TU P
03 00 01 04 30 70 100
Credit Theory
03 00 02 05 15 35 50
Hours Practical
Content:
Unit Subject Content Hrs
1 Security Essentials 08
Network Security, Cybersecurity, Network Access Control, Malwares, attacks, threats,
vulnerabilities, risk, Security controls, NICE Framework
2 Network Basics and Security 08
OSI Models, TCP/IP model, Secure protocols, Common network attacks,
UTM, NGFW, IDS, VLAN, VPN, DNS, DHCP
3 Identity and Access Management 03
AAA, MFA, Authorization and Access Control, LDAP
4 Application and Web Security: Application Security, Web based applications and
associated vulnerabilities, cookies and tracking, database security, Enterprise Security, 10
Software Security, Secure Software Development Life Cycle, Secure Software testing, Coud
Application Security
5 Ransome-ware and Malware Analysis: Malware, Ransomware, Detection and defensive 05
techniques, Malware Analysis, Secure design principles, Threat prevention
6 Ethical Hacking and VAPT: Vulnerability, Vulnerability Assessment, Penetration testing, 05
Attack Simulation, Teaming operations
7 Reporting, Regulation, Compliance and Risk Management 01

8 AI in Security: Role of Artificial Intelligence in Security, Need for Early warning and threat 05
detection, Zero Trust based solution using AI, Adversarial Learning basics
Practical Content:

Reference Books:
1. Stallings, W. Cryptography and Network Security. Pearson Education India.
2. Giannotti, F., &Pedreschi, D. (Eds.). Mobility, data mining and privacy: Geographic knowledge discovery.
Springer Science & Business Media.
3. Bygrave, L. A. Data privacy law: an international perspective (Vol. 63). Oxford: Oxford University Press.
4. Scoble, R., Israel, S., &Benioff, M. R.. Age of context: Mobile, sensors, data and the future of privacy.
USA: Patrick Brewster Press.
5. Bendat, J. S., &Piersol, A. G. Random data analysis and measurement procedures.

Subject Code 1A07EDS Subject Name Ethics in Data Science

Teaching scheme Examination scheme (Marks)

(Per week) Lecture Practical Total INT EXT Total
(Lab.)
L TU P
Credit 01 00 00 01 Theory 00 50 50

Hours 01 00 00 01 Practical 15 35 50

Content:
Unit Subject Content Hrs
1 Ethics: Simple utilitarian ethics, concept of informed consent, data ownership, privacy, 05
anonymity, data validity, data forging and fabrication, algorithmic fairness, societal
consequences, code of ethics, Attributions, philosophical frameworks for assessing fairness,
contemporary theories of fairness, research ethics for data science, legal aspects
2 Big Data and Impact: Overview of ethical issues in data-driven organizations, Significance
of big data, neutral data, important concepts and terms, Mosaic data, found data and designed
data

Responsible AI: Biases in Data, Explainability, removing biases in data, data and model 05
privacy

Values and Actions: Articulating values, Turning values into action, ethical decision points,
Aligning values and actions, Methods and tools, Alignment Methodology Framework
3 Current Practices: Findings summary, Opt-in Versus Opt-out, Correlation through
aggregation, Data Ownership, Manifestation of values, Ethical Incoherence, Cultural Values,
03
data ethics for researchers, ethics of data scraping and storage, privacy and surveillance

4 Case Studies 02
5 Cloud Computing Security Challenges: Security policy implementation,
Virtualization Security Management: virtual threats, hypervisor risks, VM Security
Recommendations, VM-Specific Security Techniques, Cloud Access Security
Broker(CASB)
Practical Content:
Reference Books:
1. Mike Loukides, Hilary Mason, DJ Patil, Ethics and Data Science, O'Reilly 2018
2. Davis, Kord, Ethics of Big Data: Balancing risk and innovation, O'Reilly Media, Inc.
3. Craig, Terence, and Mary E. Ludloff, Privacy and big data: The players, regulators,
andstakeholders, O'Reilly Media
4. Richards, Neil M., Jonathan H. King, Big data ethics, Wake Forest L. Rev.
 Examination Evaluation Scheme as per Choice Based Credit System (CBCS)
RRU is gearing up for several initiatives towards academic excellence, quality improvement and administrative
reforms. In view of this priority and in-keeping with RRU Vision and Mission; process was already initiated
towards introduction of semester system, grading system and credit system. The above initiatives acquired
further strength with UGC Circular D. O. No. F.1-2/2008(XI Plan) dated March 2009 informing all the
Universities regarding UGC’s new initiatives under the 11th Five Year plan, on speedy and substantive academic
and administrative reforms regarding higher education. Given this background RRU has framed this “RRU
CBCS REGULATION- 2021”. As the RRU has adopted this regulation, the same will have to be implemented
by all the Faculties of RRU for their academic Programmes. The Evaluation scheme shall be follows as per
1. Examination Evaluation:
1.1 Continuous Internal Assessment (CIA)
The performance of a student in each course is evaluated in terms of percentage of marks with a provision
for conversion to grade points. Evaluation for each course shall be done by a continuous internal assessment
(CIA) by the concerned course teacher as well as by an end semester examination and will be consolidated
at the end of the course. The components for continuous internal assessment are as follows.

MASTER LEVEL PROGRAMME (M.TECH)

CONTINUOUS ASSESSMENT
Internal Part External Part
Internal
Assessment
Seminar/
Group University Total
No Credit Unit
Discussion/ Practical/ External Marks
Test/Class Total Marks
Presentation Viva Exam
Test
/Class Examination
Activity
Assignments
/ Projects
170
1 5 Credits 35 15 50 50 70
Marks
150
2 4 Credits 35 15 50 30 70
Marks
No Practical 120
3 3 Credits 35 15 50 70
Marks
1 or 2 No Practical 100
4 35 15 50 50
Credits Marks

1.2 Question Paper Pattern:

Each Question Paper will have total four questions as per the following table. Each Student shall have to secure
 minimum 50% marks from External Examination for passing the subject. (i.e., 35 marks out of 70 marks).

MASTER LEVEL PROGRAMME M.TECH

EXTERNAL EXAMINATION QUESTION PAPER PATTERN
Question Marks Pattern Extra Question
No.
1 15 Short Answer (5x3 Marks=15) No
2 20 Long Answer (4x5 Marks =20) No
3 15 Answer in detail (3x5 Marks=15) 2
4 20 Long Answer (2x10 Marks=20) 1
Total 70

1.3 Passing Minimum:

The students shall be required cumulatively 50 % passing marks of the total marks of the individual subject
including both Internal Assessment and End Semester Examination. However, a student must appear in End
Semester Examination otherwise the student's result will be declared as absent for a particular subject(s)."For
the award of grade, calculation of CGPA and award of degree the candidate must score a minimum SGPA
of 5.0 in each semester separately.

1.4 Grading:
 The RRU adopts absolute grading system wherein the marks are converted to grades, and every
semester result will be declared with semester grade point average (SGPA) and Cumulative Grade
Point Average (CGPA). The CGPA will be calculated every semester, except the first semester.
 The grading system is with the following letter grades as given below:

Marks Out of 100 Division/ Grade Point Letter Description

Class Grade
90 to 100 Distinction 10 O Outstanding
80 to <90 9 A+ Excellent
70 to <80 8 A Very Good
60 to <70 First 7 B+ Good
55 to <60 Second 6 B Above Average
50 to <55 Pass 5 C Pass
Less than 50 Fail 0 F Fail
Absent Ab 0 Ab Absent
  A student obtaining Grade “F” shall be considered failed and will be required to reappear in the
examination.
 Number of attempts taken to clear a subject/s shall be shown in the transcripts and grade cards.

2. Declaration of Semester Results:

For Students, who have appeared both in the current Semester Examination and for their backlog courses
of the Previous Semesters and having result status as Fail-Detained in the previous Semesters, the result
of such students shall be declared as Fail-Detained instead of Withheld in the current semester and the
student shall be allowed to appear in the Remedial.
Students failing in the end semester examinations shall be given the option of either to appear in remedial
examination arranged by the University in which the marks obtained in the internal examination shall be
carried forward or opportunity shall be given to repeat the course in line with the policy of detention
due to lack of attendance in which student shall improve the internal marks.
Backlog: At any given point of time student can have maximum 4 backlogs.

2.1 Grade Point: Grade point is an integer indicating the numerical equivalent of the letter grade.
2.2 Credit Point (P): Credit point is the value obtained by multiplying the grade point (G) by the credit (C):
P = G x C.
2.3 Semester Grade Point Average (SGPA): Semester Grade Point Average (SGPA) is the value obtained
by dividing the sum of credit points (P) earned by a student in various courses taken in a semester by the total
number of credits earned by the student in that semester. SGPA shall be rounded off to two decimal places.
2.4 Cumulative Grade Point Average (CGPA): ‘Cumulative Grade Point Average’ (CGPA) is the value
obtained by dividing the sum of credit points in all the courses earned by a student for the entire programme,
by the total number of credits. CGPA shall be rounded off to two decimal places. CGPA indicates the
comprehensive academic performance of a student in a programme.
An overall letter grade (Cumulative Grade) for the entire programme shall be awarded to a student depending
on his/her CGPA.
2.5 Calculation of semester grade point average (SGPA) and cumulative grade point average (CGPA):
 Performance in a semester will be expressed as Semester Grade Point Average (SGPA).
 Cumulative performance of all the semesters together will reflect performance in the whole
programme and will be known as Cumulative Grade Point Average (CGPA). Thus, CGPA is the
real indicator of a student’s performance.
 The formula for calculation of SGPA and CGPA is given below:
SGPA = (Ʃ Ci Mi) / (Ʃ Ci) CGPA = (Ʃ Ʃ Cni Gni) / (Ʃ Ʃ Cni) Where
Ci - number of credits for the ith course, Gi - grade point obtained in the ith course, Cni - number
 of credits of the ith course of the nth semester, Gni - grade points of the ith course of the nth
semester
 Refer the following examples for better understanding of CGPA/SGPA.
Example:

SGPA Total credit points earned by a student in a Semester Total Credit

For Example: Semester - I

Marks Obtained Grade Grade Credit
Course Credit
by Students Letter Point Grade
Core Comp. 4 59 B 6 6×4 = 24
Core Allied 4 52 C 5 5×4 = 20
Elective Generic 4 82 A+ 9 9×4 = 36
Elective Option 4 70 B+ 7 7×4 = 28
Foundation 2 51 C 5 5×2 = 10
Generic
Total 18 118

SGPA = 118/18 = 6.55

Thus, SGPA for Semester – I is 6.55
Percentage for Semester I is 6.55 × 10 = 65.5
Cumulative grade point average (CGPA) is Obtained by dividing the total no. points earned in all
the Semester by the total number of credits in all Semester.

For Example: Semester - II

Marks Obtained Grade Grade Credit
Course Credit
by Students Letter Point Grade
Core Comp. 4 51 C 5 5×4 = 20
Core Comp. 3 95 O 10 10×4 = 40
Core Allied 4 82 A+ 9 9×4 = 36
Elective Generic 4 52 C 5 5×4 = 20
Elective Option 3 40 F 0 0×3 = 00
Foundation 2 59 B 6 6×2 = 12
Generic
Total 20 128

Thus, SGPA= 128/20=6.4

Illustration No.2(a)
 For Example: Semester – II (Repeat Exam)
Marks Obtained Grade Grade
Course Credit Credit Grade
by Students Letter Point
Elective Option 3 60 B+ 7 7×3 = 21
Ci (First Attempt)128 +
Result 20 Ci (subsequent attempt)
21= 149

Thus, SGPA= 149/20=7.45

CGPA= 6.55x18 +7.45x20

………………… =117.9 +149/38 = 7.02 CGPA
38
Sample calculation for SGPA

Course Credit Grade Letter Grade Point Credit Point SGPA(Credit

(Credit X Grade) Point/Credit)
Semester I
1A01ENM 06 B 6 36
1A02FOE 06 B+ 7 42
1A03CFC 06 C 5 30
1A04COP 02 B 6 12
Total 20 120 6.0 (120/20)
Semester II
2A01DMM 06 B 6 36
2A02DGS 06 B 6 36
2A03DCM 06 C 5 30
2A04OOP 02 A+ 9 18
Total 20 120 6.0 (120/20)
Semester III
3A01OPS 06 A 8 48
3A02PSN 06 A+ 9 54
3A03JPM 06 A 8 48
3A04DBM 02 A 8 16
Total 20 166 8.3 (166/20)
Semester IV
4A01SEN 06 C 5 30
4A02PPL 06 B 6 36
4A03DAA 06 B+ 7 42
4A04ITC 02 A+ 9 18
Total 20 126 6.3 (126/20)
Semester V
5A01DAV 06 B 6 36
5A02CNW 06 A+ 9 54
5A03DIP 06 A 8 48
5A04ARI 02 B 6 12
Total 20 150 7.5 (150/20)
Semester VI
6A01IOT 06 B+ 7 42
6A02LNT 06 B 6 36
6A03SCS 06 C 5 30
6B04FOS 02 C 5 10
Total 20 118 5.9 (118/20)
CGPA
Grand Total 120 800 6.67 (800/120)

Sample calculation for CGPA

Semester I Semester II Semester III Semester IV Semester V Semester VI

Credit:20; Credit:20; Credit:20; Credit:20; Credit:20; Credit:20;
SGPA: 6.0 SGPA: 6.0 SGPA: 8.3 SGPA: 6.3 SGPA: 7.5 SGPA: 5.9

Thus CGPA= (20x6.0+20x6.0+20x8.3+20x6.3+20x7.5+20x5.9)/120

=6.67
 Rashtriya Raksha University
An Institution of National Importance
Bachelor of Computer Science & Engineering in Cyber Security Semester V- Winter Examination
Date: Paper Code: Time:
Total sections Subject: Total Marks:
Seat Number:
Q. 1 Give the brief answer (05*03=15)
1
2
3
4
5
Q. 2 Write a short notes (Any Five) (04*05=20)
1
2
3
4
5
6
Q. 3 Give the answer in detail. (Any four) (03*05=15)
1
2
3
4
5
Q.4 Write a long note. (Any two) (02*10=20)
1
2
3