DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

MASTER OF TECHNOLOGY

IN

COMPUTER SCIENCE AND ENGINEERING

CURRICULUM AND SYLLABUS

IIITUPGCSE22

2022-2024

SCHOOL OF COMPUTING

INDIAN INSTITUTE OF INFORMATION TECHNOLOGY UNA

SALOH, UNA (HIMACHAL PRADESH)

 M. Tech. Curriculum and Syllabus
Computer Science and Engineering
Batch 2022-2024

IIITUPGCSE22

SCHOOL OF COMPUTING
INDIAN INSTITUTE OF INFORMATION TECHNOLOGY UNA
SALOH, UNA (HIMACHAL PRADESH)
 Personal Details
Name:

Batch:

Roll Number:

Residential Address:

Mobile Number:

Email ID:

Twitter ID:

Skype ID:

Blood Group:

Height:

Weight:

Driving License No.:

Vehicle No.:

IIITUPGCSE22 School of Computing 2

 Table of Contents

History of School of Computing ............................................................................................................ 4

Institute Vision and Mission…............................................................................................................... 4
School of Computing Vision and Mission .............................................................................................. 4
M.Tech. CSE PEOs and PSOs ................................................................................................................ 5
Design of Curriculum ............................................................................................................................. 7
Highlights of Curriculum ........................................................................................................................8
Curriculum Components…..................................................................................................................... 8
Semester-wise Program Electives (Specialization in Data Science) ...................................................... 9
Semester-wise Program Electives (Specialization in Cyber Security) ................................................. 10
Semester-wise Curriculum (Specialization in Data Science) ............................................................... 11
Semester-wise Curriculum (Specialization in Cyber Security) ............................................................ 12
Study Chart (Specialization in Data Science) ....................................................................................... 13
Study Chart (Specialization in Cyber Security) ................................................................................... 14
Program Core Syllabus…..................................................................................................................... 15
First Semester… ................................................................................................................. 16
Second Semester ................................................................................................................. 18
Program Electives Syllabus (Specialization in Data Science) ............................................................. 20
First Semester… ................................................................................................................. 21
Second Semester ................................................................................................................. 33
Program Electives Syllabus (Specialization in Cyber Security) .......................................................... 45
First Semester… ................................................................................................................. 46
Second Semester ................................................................................................................. 58
Course Outcome Survey Form............................................................................................................. 70

M.Tech. (CSE) Program Survey Form ................................................................................................. 71

Alumni Survey Form............................................................................................................................ 72

Employer/Scholar Survey Form........................................................................................................... 74

Course Registration Form..................................................................................................................... 75

Time Table…............... ........................................................................................................................ 76

IIITUPGCSE22 School of Computing 3

 1. History of School of Computing
Program Description
UG in B.Tech. (Computer Science and Started with 30 seats in 2014.
Engineering) Intake increased to 66 in 2020.
UG in B.Tech. (Information Technology) Started with 40 seats in 2017.
Intake increased to 44 in 2020.

PG in M.Tech. (Computer Science and Started with 30 seats in 2022.

Engineering)

2. Institute Vision and Mission

Vision
To build a vibrant multicultural learning environment with value based academic
principles and to achieve excellence in teaching and research and to contribute
effectively and responsibly to the national and global community.

Mission
M1: To provide quality education to the students with practical orientation.
M2: To collaborate with industries and research institutions to solve socially relevant
problems.
M3: To inspire students to become responsible citizens and competent professionals
with ethical values.

3. School of Computing Vision and Mission

Vision
To become a center of excellence in emerging areas and train students to become
professionals solving challenging societal problems.

Mission
M1: To impart state-of-the-art knowledge in computer science and information
technology with emphasis on practical knowledge and to promote specialization in
emerging streams.
M2: To participate in research and development in industries and research
organizations.
M3: To make the students aware of ethics and apply them in solving social problems.

IIITUPGCSE22 School of Computing 4

2
 4. M.Tech. CSE (PEOs and PSOs)
4.1 Program Educational Objectives (PEOs)
PEO1: Career
To ensure that the post-graduates will work in renowned industries / research
organizations, pursue advanced degrees, or become entrepreneurs.

PEO2: Professionalism
To ensure that the post graduates demonstrate their ability to solve complex and
socially relevant problems in multidisciplinary contexts, and will apply professional
ethics.

PEO3: Research and Innovation

To ensure that post graduates will have the ability to create innovative products
(hardware/software), and an attitude in adapting to emerging research methodologies
and technological changes.

4.2 PEO to Mission Mapping

M1 M2 M3

PEO1 3 3 1

PEO2 3 2 3

PEO3 2 2 3

4.3 Program Specific Outcomes (PSOs)

PSO1: To identify and formulate computational research problems and solve them by
applying software engineering principles.
PSO2: To identify and capitalize opportunities in the areas of Data Science and Cyber
Security and become a successful entrepreneur.
PSO3: To design robust innovative solutions incorporating security aspects using open
source technologies within the ambit of ethical and social norms, and to design cost-
effective systems (hardware/software) for the betterment of society.

IIITUPGCSE22 School of Computing 5

2
4.4 PO/ PSO to PEO Mapping

PEO1 PEO2 PEO3

Career Professionalism Research and
Innovation
PO1: Engineering Knowledge 3 1 3

PO2: Problem Analysis 3 1 3

PO3: Design/Development of 3 2 3
solutions
PO4: Conduct investigations of 3 1 3
complex problems
PO5: Modern tool usage 3 2 3

PO6: The engineer and society 1 3 1

PO7: Environment and 1 2 3

sustainability
PO8: Ethics 2 3 3

PO9: Individual and Teamwork 3 3 2

PO10: Communication 2 3 3

PO11: Project management and 1 2 2

finance
PO12: Lifelong Learning 3 2 3

PSO1 3 2 3

PSO2 2 3 2

PSO3 1 2 3

IIITUPGCSE22 School of Computing 6

2
 5. Design of Curriculum
The M.Tech. Course Curriculum has been designed conforming to the recommendations of
Senate and guidelines of AICTE, including the NEP 2020.
Curriculum consists of the following components of study:
I. Multiple Entry Multiple Exit Option (MEME):
This program has been designed with MEME option as per the guidelines of NEP 2020.
 First Entry: Admission to 2-year program.
 First Exit: Optionally at the end of one year with Post Graduate Diploma in Data
Science/Cyber Security.
 Normal Exit: At the end of second year with M.Tech. in CSE with specialization in
Data Science/ Cyber Security.
 Reentry: In Second year of the M.Tech. program with a minimum gap of one year or
integral multiple of years.
 Only one reentry permitted for a student.
II. Program Core (PC)
The PC consist of 2 theory courses both comprising labs. All the PC subjects will be covered
in first year.
III. Program Elective (PE)
A total number of three program electives each in first and second semester will be offered.
Student will have to choose any one subject as per their choice in each of the program electives.
IV. Project Work (PW)
The project work is designed for a total duration of two semesters (III and IV) as a single project
involving detailed literature survey, experimentation plan, and implementation. The
percentage of overall project should be 60% in III Semester and 40% in IV Semester.

V. Online Courses (OC)

The students can choose online courses from NPTEL/SWAYAM/MOOCs/etc.

VI. L-T-P-C Notation

L-T-P-C ⇒ Lecture-Tutorial-Practical-Credit.
VII. Grading Criteria
 The Institute follows relative grading with flexibility given to faculty members to decide
the mark ranges for grades. All assessment of a course will be done on the basis of
marks.
 The students shall be placed in any of the bands with letter grades: ‘S’, ‘A’, ‘B’, ‘C’, ‘D’,
‘E’ and ‘I’ with the credit points of ‘10’, ‘9’, ‘8’, ‘7’, ‘6’, ‘5’, ‘0’, respectively.
 The cut-off mark for completion of a course shall be calculated using 𝑋, where X is the
mean or average marks in the class. Students scoring marks above the cut-off mark shall
be appropriately placed in top six bands typically 10, 15, 25, 25, 15, 10 percentages
respectively. Students scoring less than cut-off mark shall be placed in lower most band
(‘I’).
 Faculty members can adopt any one of the following logical methods to decide the
IIITUPGCSE22 School of Computing 7

2
 grades: (a) Normalized curve, (b) Z-score, and (c) Gap analysis.
VIII. Highlights of Curriculum
The students will study the curriculum with the following features:
 More Practical Oriented Teaching and Learning.
 More hands-on Projects.
 Stream Oriented Specialization.
 Multi-Disciplinary Electives/ Research Projects.
 Relative Grading.
 Overall Personality Development.
 Employable Post Graduates for Industries.
 Excellent Placements.
 Conformance to NEP 2020.
IX. Insights of Curriculum
The students will study the curriculum with the following features:
 One core course in I and II Semesters.
 Three program electives in I and II Semesters.
 One Online Course in I and II Semesters.
 Practicals are integrated into theory.
 One Mini project/Term Paper in I and II Semesters.
 Two semesters Project Phase-I and Phase-II in III and IV Semester.
 Industry internship is also permitted in lieu of Project Phase-I and Phase II.
 Total number of credits (28+28+12+12) =80.
X. Curriculum Components

S. No. Category Total Credits Credits (%)

1. Program Core (Theory and Practical) 10 12
2. Program Elective (Theory and Practical) 28 35
3. Online Course 06 08
4. Project Work 36 45
Total 80 100
The curriculum consists of 40% of Theory and 60% of Practical work.
XI. Choice of Specialization
The curriculum offers two specializations, viz., Data Science and Cyber Security. The
students have to opt for any one specialization as per their interest in the first semester
itself and the course registration has to be done accordingly. The specialization once
chosen will remain the same throughout the program of study and in between it cannot
be changed.
IIITUPGCSE22 School of Computing 8

2
 5 A. Semester-wise Program Electives
(Specialization in Data Science)
Program Elective I (Semester I)
S.No. Code Course Name
1 PDSE101 Mathematical Foundation for Data Science
2 PDSE102 Data Engineering

Program Elective II (Semester I)

S.No. Code Course Name
1 PDSE103 Data-Driven Modeling and Optimization*
2 PDSE104 Advanced Artificial Intelligence*

Program Elective III (Semester I)

S.No. Code Course Name
1 PDSE105 Machine Learning*
2 PDSE106 Big Data Computing*

Program Elective IV (Semester II)

S.No. Code Course Name
1 PDSE201 Business Intelligence
2 PDSE202 Quantum Machine Learning

Program Elective V (Semester II)

S.No. Code Course Name
1 PDSE203 Applied Data Science*
2 PDSE204 Data Visualization*

Program Elective VI (Semester II)

S.No. Code Course Name
1 PDSE205 Introduction to Block Chain*
2 PDSE206 Computer Vision: Algorithms and Applications*
*: Includes Lab.
*****

IIITUPGCSE22 School of Computing 9

2
 5 B. Semester-wise Program Electives
(Specialization in Cyber Security)

Program Elective I (Semester I)

S.No. Code Course Name
1 PCBE101 Mathematical Foundation for Cyber Security
2 PCBE102 Network Security and Trust Management.

Program Elective II (Semester I)

S.No. Code Course Name
1 PCBE103 Principles of Cryptography*
2 PCBE104 Advanced Computer Network*

Program Elective III (Semester I)

S.No. Code Course Name
1 PCBE105 Machine Learning for Security*
2 PCBE106 Digital Forensics*

Program Elective IV (Semester II)

S.No. Code Course Name
1 PCBE201 Ethical Hacking
2 PCBE202 Cyber Attacks and Defenses

Program Elective V (Semester II)

S.No. Code Course Name
1 PCBE203 Malware Analysis and Detection*
2 PCBE204 Reverse Engineering and Vulnerability Analysis*

Program Elective VI (Semester II)

S.No. Code Course Name
1 PCBE205 Block Chain Technology*
2 PCBE206 Mobile Security*
*: Includes Lab.

IIITUPGCSE22 School of Computing 10

2
 5 C. Semester-wise Curriculum
(Specialization in Data Science)

Semester I
S.No. Code Course Name L T P C
1 PCSC100 Advanced Data Structures and Algorithms 3 0 4 5
2 PDSE1XX Program Elective I 3 1 0 4
3 PDSE1XX Program Elective II 3 0 4 5
4 PDSE1XX Program Elective III 3 0 4 5
5 PDSO100 Online Course I* 5 1 0 3
6 PCSP100 Mini Project-I 0 0 12 6
Total 17 2 24 28
Total Hours 42

Semester II
S.No. Code Course Name L T P C
1 PCSC200 Advanced Database Systems 3 0 4 5
2 PDSE2XX Program Elective IV 3 1 0 4
3 PDSE2XX Program Elective V 3 0 4 5
4 PDSE2XX Program Elective VI 3 0 4 5
5 PDSO200 Online Course II* 5 1 0 3
6 PCSP200 Mini Project-II 0 0 12 6
Total 17 2 24 28
Total Hours 42
*NPTEL/SWAYAM/MOOCS/etc.
Semester III
S.No. Code Course Name L T P C
1 PCSP300 Project Work- Phase I 0 0 36 12
Total 0 0 36 12
Total Hours 36

Semester IV
S.No. Code Course Name L T P C
1 PCSP400 Project Work- Phase II 0 0 36 12
Total 0 0 36 12
Total Hours 36

Summary
Semester I II III IV Total
Credits 28 28 12 12 80

IIITUPGCSE22 School of Computing 11

2
 5 D. Semester-wise Curriculum
(Specialization in Cyber Security)

Semester I
S.No. Code Course Name L T P C
1 PCSC100 Advanced Data Structures and 3 0 4 5
Algorithms
2 PCBE1XX Program Elective I 3 1 0 4
3 PCBE1XX Program Elective II 3 0 4 5
4 PCBE1XX Program Elective III 3 0 4 5
5 PCBO100 Online Course I* 5 1 0 3
6 PCSP100 Mini Project-I 0 0 12 6
Total 17 2 24 28
Total Hours 42

Semester II
S.No. Code Course Name L T P C
1 PCSC200 Advanced Database Systems 3 0 4 5
2 PCBE2XX Program Elective IV 3 1 0 4
3 PCBE2XX Program Elective V 3 0 4 5
4 PCBE2XX Program Elective VI 3 0 4 5
5 PCBO200 Online Course II* 5 1 0 3
6 PCSP200 Mini Project-II 0 0 12 6
Total 17 2 24 28
Total Hours 42

*NPTEL/SWAYAM/MOOCS/etc.
Semester III
S.No. Code Course Name L T P C
1 PCSP300 Project Work- Phase I 0 0 36 12
Total 0 0 36 12
Total Hours 36

Semester IV
S.No. Code Course Name L T P C
1 PCSP400 Project Work- Phase II 0 0 36 12
Total 0 0 36 12
Total Hours 36

Summary
Semester I II III IV Total
Credits 28 28 12 12 80

IIITUPGCSE22 School of Computing 12

2
 5 E. STUDY CHART (Specialization in Data Science)

Semester-I Semester-II Semester-III Semester-IV

PC I PC II

Advanced Data Advanced Database Project Work Project Work

Structures and Systems - Phase I* - Phase II*
Algorithms

PE I PE IV *: Industry project recommended

Mathematical Business Intelligence

Foundation for Data
Science

Data Engineering Quantum Machine

Learning

PE II PE V
Data Driven Applied Data
Modeling and Science
Optimization

Advanced Artificial Data Visualization

Intelligence

PE III PE VI
Machine Learning Introduction to Block
Chain

Big Data Computing Computer Vision:

Algorithms and
Applications.

Online Course-I Online Course-II

Mini Project-I Mini Project-II

IIITUPGCSE22 School of Computing 13

2
 5 F. STUDY CHART (Specialization in Cyber Security)

Semester-I Semester-II Semester-III Semester-IV

PC I PC II

Advanced Data Advanced Database Project Work Project Work

Structures and Systems - Phase I* - Phase II*
Algorithms
PE I PE IV *: Industry project recommended

Mathematical Ethical Hacking

Foundation for Cyber
Security

Network Security Cyber Attacks and

Defenses

PE II PE V
Principles of Malware Analysis
Cryptography and Detection

Advanced Computer Reverse Engineering

Network and Vulnerability
Analysis

PE III PE VI
ML for Security Block Chain
using R Technology

Digital Forensics Mobile Security

Online Course-I Online Course-II

Mini Project-I Mini Project-II

IIITUPGCSE22 School of Computing 14

2
 6. SYLLABUS

IIITUPGCSE22 School of Computing 15

2
 6.1 PROGRAM CORE (PC)
6.1.1 Program Core I (Semester I)
Course Code PCSC100
Course Title Advanced Data Structures and Algorithms
Number of Credits 3-0-4-5
Course Type PC
Course Objectives:
 To analyze the asymptotic performance of algorithms.
 To demonstrate a familiarity with major algorithms and data structures.
 To apply important algorithmic design paradigms and methods of
analysis.
 To synthesize efficient algorithms in common engineering design
applications.

Course Contents
Unit-I Introduction 8
Fundamental data structures: linked lists and arrays. Efficiency analysis and
Asymptotic analysis. Complexity of algorithms and Algorithmic paradigms. Arrays
and Recursion functions, Stacks and Queues, Heaps as priority queues, heap
implementation, insertion and deletion operations, binary heaps, binomial and
Fibonacci heaps, heapsort, heaps in Huffman coding.

Unit-II Tree Data Structures 8

Trees, Binary trees. Search Trees- Binary search trees, search efficiency, insertion
and deletion operations, importance of balancing, AVL trees, searching, insertion and
deletions in AVL trees, 2-3 tree, B-tree, B+ Trees, Red Black Tree, Splay Tree.

Unit-III Graph Algorithms 8

Definition, terminology, directed and undirected graphs, properties, implementation
of adjacency matrix and linked adjacency chains, connectivity in graphs, graph
traversal, breadth first and depth first, spanning trees, Graph algorithms: DFS and
BFS with applications, MST, shortest paths, matchings.

Unit-IV Basic algorithmic techniques 8

Sorting and Searching techniques with analysis, Greedy algorithms, divide and
conquer, dynamic programming, applications.

Unit-V Advanced Design and Analysis Techniques 8

Tries, randomized algorithm, randomized quicksort, 2-approximation for vertex
cover, stable marriage problem. Bloom filters applications in various domains
(Cryptography MD5, Block Chains, Data Science Locality Sensitive Hashing)
Databases: Searching sorted files, Indexing, Images and Graphics: R Trees, Spatial
Proximity in GIS.
IIITUPGCSE22 School of Computing 16

2
 Total: 40 periods

Text Books
1. Skiena, S. S. (2008). “The Algorithm Design Manual”. Springer Publishing
Company.
2. Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C.
(2022). “Introduction to Algorithms”. MIT press.

Reference Books
1. Dasgupta, S., Papadimitriou, C. H., and Vazirani, U. V. (2008). “Algorithms”.
New York: McGraw-Hill Higher Education.
2. Kruse, R., and Tondo, C. L. (2007). “Data structures and program design in
C”. Pearson Education India.

Course Outcomes:

CO1 Understand and analyze the performance of the fundamental K3

linear and non- linear data structures.
CO2 Illustrate the applications of different types of tree data structures. K3
CO3 Explain the various graph-based algorithms. K4
CO4 Analyze the performance of various algorithmic design K3
techniques.
CO5 Demonstrate a familiarity with applied algorithmic settings such K3
as security and cryptography, parallel and distributed computing,
operating systems, and computer architecture by reciting several
algorithms of importance to different fields.

The symbol in third column represents the knowledge levels (1 to 6).

CO to PO/PSO Mapping

CO/PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 2 - 3 - - - - - 3 - - 3 - 3
CO2 - - - - 3 - - - - - - - 3 - 3
CO3 2 2 - 3 1 - - - - - - - - - -
CO4 2 2 - 3 3 - - - 3 - - - - - -
CO5 2 2 - - 1 - - - - - - - - - 3
Score 8 8 - 9 8 - - - 3 3 - - 6 - 9
Course
2 2 - 3 2 - - - 3 3 - - 3 - 3
Mapping

IIITUPGCSE22 School of Computing 17

2
6.1.2 Program Core II (Semester II)
Course Code PCSC200
Course Title Advanced Database Systems
Number of Credits 3-0-4-5
Course Type PC

Course Objectives:
 To lay a strong foundation into the basic principles using relational databases.
 To demonstrate a familiarity with major query optimization algorithms.
 To apply important database design paradigms for solving problem.
 To apply emerging database technologies in various domains.

Course Contents
Unit-I Introduction 8
DBMS, Requirement and Applications, Data models (ER, relational models,
constraints, normalization), declarative querying (relational algebra, datalog, SQL),
query processing/optimization (basics of indexes, logical/physical query plans, views)
and transaction management (introduction to concurrency control and recovery).

Unit-II Concurrency Control and Recovery Concepts 8

Transaction Processing Concepts: Properties of transaction, Schedules and
recoverability, Serializability of schedules. Locking Techniques for concurrency
control Techniques based on Time Stamp Ordering, Multiversion concurrency control
Techniques, Validation Concurrency Control Techniques.
Recovery techniques: Recovery Concepts, Recovery Techniques Based on Deferred
Update, Recovery Techniques Based on Immediate Update, Shadow Paging, and
Recovery in Multi database Transaction.

Unit-III Distributed Databases 8

Parallel Databases, Inter and Intra Query Parallelism, Distributed Database Features,
Distributed Database Architecture, Fragmentation, Distributed Query Processing,
Distributed Transactions Processing, Concurrency Control, Recovery, Commit
Protocols.
Modeling Concepts: Enhanced ER (EER) to Relational Mapping, Data Abstraction
and Knowledge Representation Concepts, Integrity Constraints in data modeling.

Unit-IV Database Security and Data Management 8

Introduction to Database Security Issues, Discretionary Access Control Based on
Privileges, Mandatory Access Control for Multilevel Security, Statistical Database
Security. Data Warehousing and Data Mining, Overview of XML data management,
text management, distributed data management.
IIITUPGCSE22 School of Computing 18

2
 Unit-V Emerging Systems 8
Enhanced Data Models, Client/Server Model, Web Databases, Mobile Databases,
XML and Web Databases, MongoDB, No SQL. Distributed data management
(including distributed data storage, query processing and transaction management),
web-data management (including managing the web-graph and implementation of
web-search), big data systems, Databases in cloud, Multimedia database, Spatial
databases, Augmented Data Management (ADM), Graph database, Adopting
MDDBMS (Multi-Database), In-memory Database (IMDB), DBMS and AI/ML.

Total: 40 periods

Text Books
1. Elmasri, R., Navathe, S. B. (2016). “Fundamentals of Database Systems”, The
Benj amin. Cummings, Redwood City, California.
2. Dabir, H. and Meher, D. (2014), “Advanced RDBMS Using Oracle”, Vision
Publications.
3. Zaniolo, C., Ceri, S., Faloutsos, C., Snodgrass, R. T., Subrahmanian, V. S.,
Zicari, R. (1997). “Advanced database systems”. Morgan Kaufmann.

Reference Books
1. Diaz, O., Piattini, M. (2000). “Advanced database technology and design”.
Artech.
2. Martin, D. (1986). “Advanced database techniques”. MIT Press.

Course Outcomes:
CO1 Understand and analyze the basic query optimization algorithms. K3
CO2 Illustrate the database concurrency control and recovery K3
concepts.
CO3 Explain the various distributed databases. K4
CO4 Explain database security and advanced management techniques. K3
CO5 Demonstrate a familiarity with database applications in various K3
fields such as mobile computing, business intelligence, cloud
computing, etc.
CO to PO/PSO Mapping

CO/PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 3 - 3 2 - - - - - - - - - -
CO2 3 3 3 3 2 - - - 3 3 - - 3 - -
CO3 3 - 3 - - - - - - - - - 2 - -
CO4 3 3 - - - - - - - - - - 2 - -
CO5 3 3 - 3 - - - - - - - - 2 - -
Score 15 12 6 9 4 - - - 3 3 - - 9 - -
Course
3 3 3 3 2 - - - 3 3 - - 2 - -
Mapping

IIITUPGCSE22 School of Computing 19

2
 6.2 Program Electives (PE)
(Specialization in Data Science)

IIITUPGCSE22 School of Computing 20

2
6.2.1 Program Elective I (Semester I)
Course Code PDSE101
Course Title Mathematical Foundations for Data Science
Number of Credits 3-1-0-4
Course Type PE

Course Objectives:
 To understand the basics of probability theory.
 To learn the fundamentals of optimization techniques.
 To study and apply statistical concepts.
 To understand and formulate problems of data science using linear algebra.

Course Contents
Unit-I Fundamentals 8
Probability Theory, Conditional probability, Bayes’ Theorem and independence,
Random Variables, Probability Distributions (Bernoulli, Binomial, Multinomial,
Uniform and Gaussian), Mathematical Expectation, Moments, Covariance, Correlation
Coefficient, Prior and Posterior.

Unit-II Statistical Concepts 10

Point estimation, Interval estimation, Variances and Correlations, Sampling Theory,
Central Limit Theorem, Sampling distribution of means and variance, Hypothesis
testing, and Type I, II errors, Statistical tests: Parametric test and Non-Parametric Test
(Type I, II errors, Z-test, T-test, F-test, Chi-Square test, Bayesian test), Descriptive
Statistics, Inferential Statistics, ANOVA (Analysis of Variance), Concept of P-Value.

Unit-III Linear Algebra 6

Vectors and Matrix Operations, Eigenvalues, Eigenvectors, Vector Spaces and Norms,
Eigen decomposition of a matrix, LU Decomposition, QR
Decomposition/Factorization, Symmetric Matrices.

Unit-IV Calculus 8
Differential and Integral Calculus, Partial Derivatives, Vector-Values Functions,
Directional Gradient, Hessian, Jacobian, Laplacian and Lagragian Distribution.

Unit-V Optimization 8
Optimization: Unconstrained optimization; Necessary and sufficiency, Conditions for
optima, Gradient descent method, Constrained optimization using Lagrange method
and KKT conditions, Introduction to non-gradient techniques, optimization using least-
squares method, Optimization view of machine learning.

Total Periods: 40
IIITUPGCSE22 School of Computing 21

2
 Text Books
1. Strang, G., Strang, G., Strang, G., Strang, G. (1993). “Introduction to linear
algebra”. Wellesley, MA: Wellesley-Cambridge Press.
2. Walpole, R. E., Myers, R. H., Myers, S. L.,Ye, K. (1993). “Probability and
statistics for engineers and scientists”. (Vol. 5). New York: Macmillan.
3. Luenberger, David G. (1997). “Optimization by vector space methods”. John
Wiley and Sons.

Reference Book
1. Hoffman, K., and Ray K. (1971). "Linear algebra”. Englewood Cliffs, New
Jersey.
2. Greub, W. H. (2012). “Linear algebra” (Vol. 23). Springer Science and
Business Media.

Course Outcomes:

CO1 Understand the fundamentals of probability distribution. K2

CO2 Illustrate the applications and uses of linear algebra. K2
CO3 Explain the basic concepts of optimization techniques. K2
CO4 Apply statistical methods techniques. K5
CO5 Apply the calculus methods for a given problem. K3

CO to PO/PSO Mapping

CO/PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 3 - - - - - - - 3 - - 3 - -
CO2 3 2 - - - - - - - - - - 3 - 3
CO3 3 3 - - - - - - - - - - 2 - -
CO4 3 3 - - - - - - - - - - - - -
CO5 3 2 - - - - - - - - - - - - 3
Score 15 13 - - - - - - - 1 - - 8 - 6
Course
3 3 - - - - - - - 2 - - 3 - 3
Mapping

IIITUPGCSE22 School of Computing 22

2
6.2.2 Program Elective I (Semester I)
Course Code PDSE102
Course Title Data Engineering
Number of Credits 3-1-0-4
Course Type PE

Course Objectives:
 To understand the fundamentals of data engineering concepts.
 To study how to perform various operations over the text data.
 To examine how to store and access the data from the databases.
 To inspect how to extract the matching string from the texts.
 To visualize the data using plotting tools.

Unit-I: Introduction 8
Data Science: Data Analysis Sequence, Data acquisition Pipeline, Report structure.
Files and working with Text Data: Types of Files, Creating and Reading Text Data,
File Methods to Read and Write Data, Reading and Writing Binary Files, Pickle
Module, Reading and Writing CSV Files, Python and Path Modules. Working with
Text Data: JSON and XML in Python.

Unit-II: Text Processing and Operations 8

Processing HTML Files, Processing Texts in Natural Languages. Regular Expression
Operations: Using Special Characters, Regular Expression Methods, Named Groups in
Python Regular Expressions, Regular Expression with glob Module.

Unit-III: Databases and Tabular Numeric Data 8

Databases: Setting Up a MySQL Database, using a MySQL Database: Command Line,
Using a MySQL Database, Taming Document Stores: MongoDB.

Unit-IV Tabular Numeric Data 8

Tabular Numeric Data (NumPy with Python): NumPy Arrays Creation Using array()
Function, Array Attributes, NumPy Arrays Creation with Initial Placeholder Content,
Integer Indexing, Array Indexing, Boolean Array Indexing, Slicing and Iterating in
Arrays, Basic Arithmetic Operations on NumPy Arrays, Mathematical Functions in
NumPy, Changing the Shape of an Array, Stacking and Splitting of Arrays,
Broadcasting in Arrays.

IIITUPGCSE22 School of Computing 23

2
 Unit-V Data Series and Frames 8
Introduction: Pandas Data Structures, Reshaping Data, Handling Missing Data,
Combining Data, Ordering and Describing Data, Transforming Data, Taming Pandas
File I/O. Plotting: Basic Plotting with PyPlot, Getting to know Other plot types,
Mastering Embellishments, Plotting with Pandas.

Total Periods: 40

Text Books
1. Zinoviev, D. (2016). “Data Science Essentials in Python: Collect-Organize-
Explore-Predict-Value”. Pragmatic Bookshelf.
2. Gowrishankar, S.,Veena, A. (2018). “Introduction to Python Programming”.
CRC Press.

Reference Books
1. Severance, C. R., Blumenberg, S., Hauser, E. (2016). “Python for everybody:
exploring data in python”. North Charleston: CreateSpace Independent Publishing
Platform.
2. Albon, C. (2018). “Machine learning with python cookbook: Practical solutions
from preprocessing to deep learning”. O'Reilly Media.
3. Nelli, F. (2015). “Python data analytics: Data analysis and science using
PANDAs, Matplotlib and the Python Programming Language”. Apress.

Course Outcomes:
CO1 Explain different types of files and text data. K2
CO2 Apply regular expression operations for data validation. K4
CO3 Create and test relational databases via SQL. K3
CO4 Apply and experiment with the searching and query’s efficiency. K6
CO5 Visualize the data using PyPlot. K1

CO to PO/PSO Mapping

CO/PO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 - - - 3 - - - - - - - - - 2 2
CO2 - - - 3 - - - - - - - - 3 - 2
CO3 - - - 3 - - - - - - - - - 3 2
CO4 - 2 - - 2 - - - - - - - - - -
CO5 - 2 - - 2 - - - - - - - - 3 2
Score - 4 - 9 4 - - - - - - - 3 8 8
Course
- 2 - 3 2 - - - - - - - 3 3 2
Mapping

IIITUPGCSE22 School of Computing 24

2
6.2.3 Program Elective II (Semester I)
Course Code PDSE103
Course Title Data Driven Modelling and Optimization
Number of Credits 3-0-4-5
Course Type PE

Course Objectives:
 To study the basic data-driven modelling concepts.
 To identify certain complex engineering analysis problems.
 To apply the extracted knowledge to build ontologies.
 To estimate feasible solution given a set of static constraints.
 To formulate the global optimal solutions based on genetic algorithms.

Course Contents
Unit-I: Data-Driven Modelling Concepts 8
Mathematical Linear algebra, Calculus, Probability, Programming: Python,
data exploration foundation, and Computational Thinking.

Unit-II: Unconstrained Optimization 8

Linear and nonlinear least squares, Regression, Regularization, Conjugate gradient, and
Quasi-newton.

Unit-III: Machine Learning and Neural Networks 8

Information extraction, Representation techniques, Foundations of Ontology,
Ontological engineering, Situation Calculus, Semantic networks, and Description
logic.

Unit-IV: Constrained Optimization 8

Linear Programming Problems, Quadratic Programming, and Lagrangian Methods.

Unit-V Bayesian Optimization and Genetic Algorithms 8

Genetic Algorithms, Simulated annealing, Evolutionary algorithms, Hyper parameter
optimization, and Bayesian optimization.

Total Periods: 40

Text Books
1. Dantzig, G. B., Thapa, M. N. (2003). “Linear programming: Theory and
extensions”. New York: Springer.
2. Shah, C. (2020). “A hands-on introduction to data science”. Cambridge
University Press.

IIITUPGCSE22 School of Computing 25

2
 Reference Books
1. Balaji, C. (2011). “Essentials of thermal system design and
optimization”. Ane Books Pvt.
2. Choudhury, A. A. S., Shah, S. L., Thornhill, N. F. (2008). “Diagnosis of
process nonlinearities and valve stiction: data driven approaches”.
Berlin: Springer.

Course Outcomes:

CO1 Apply data-driven approaches to solve engineering problems. K3

CO2 Identify the complexity of problems based on various constraints. K3
CO3 Translate the structure of knowledge for various domains. K2
CO4 Determine the optimal solutions for a given set of constraints. K5
CO5 Develop genetic algorithms to solve combinational optimization K6
problems.

CO to PO/PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 2 3 - - - - - - - - - - - -
CO2 2 2 - - - - - - - - - - 3 - -
CO3 - - - - - - - - - - - - - 3 -
CO4 2 2 - - - - - - - - - - - - -
CO5 2 2 - - 2 - - - - - - - 3 - -
Score 8 8 3 - 2 - - - - - - - 6 3 -
Course
2 2 3 - 2 - - - - - - - 3 3 -
Mapping

IIITUPGCSE22 School of Computing 26

2
6.2.4 Program Elective II (Semester I)

Course Code PDSE104

Course Title Advanced Artificial Intelligence
Number of Credits 3-0-4-5
Course Type PE

Course Objectives:
 To study the basics of artificial intelligence.
 To automate the decision pipelines to predict the features.
 To represent the knowledge using probability to indicate the uncertainty.
 To study how to control the physical things in an intelligent way.

Course Contents
Unit-I: Basic Concepts 8
Foundations of AI, Intelligent Agents, acting under uncertainty, quantifying
uncertainty, basic probability notation, Inference using full joint distribution, Making
Simple Decisions, Utility theory, utility functions, decision networks, sequential
decision problems, Partially, Observable MDPs, Game Theory.

Unit-II: Knowledge in Learning 8

Forms of Learning, Logical Formation of Learning, Knowledge in Learning,
Explanation based Learning, Learning using relevance information, Inductive logic
programming, Statistical Learning, learning with complete data, learning with hidden
variables.

Unit III Reinforcement Learning 8

Introduction, passive, active RL, policy search, generalization, applications of
reinforcement learning.

Unit-IV Communication, Perceiving, and Acting 8

Natural language processing, language models, text classification, information
retrievals, information extraction, perception, robotics, robotics perception, planning
uncertain movements, application domains.

Unit-V Emerging Trends in AI

Introduction to Explainable AI, Explainable AI (XAI) program, Design interpretable
and inclusive AI, Limitations, Edge AI, Components of Edge AI, Applications.

Total Periods: 40

IIITUPGCSE22 School of Computing 27

2
 Text Book
1. Russel, S., Norvig, P. (2015), “Artificial Intelligence: A Modern Approach”,
Third edition, Prentice Hall.

Reference Books
1. Yang, Q. (1997), “Intelligent Planning: A decomposition and abstraction-
based approach”, Springer Verlag, Berlin Heidelberg.
2. Bostrom, N. (2020). “Machine Ethics and Robot Ethics”, Springer.

Course Outcomes:
CO1 Construct probabilistic reasoning to handle uncertain situations. K3
CO2 Examine the logic behind the knowledge in learning. K4
CO3 Interpret the knowledge and relationship using semantic K2
networks.
CO4 Apply reinforcement learning algorithms to solve relevant K4
problems.
CO5 Explore novel AI techniques based on emerging real-world K3
requirements.

CO to PO/PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 2 3 3 - - - - - - - - - - -
CO2 2 2 - - - - - - - - - - 3 - -
CO3 2 2 - - - - - - - - - - - - -
CO4 2 2 - - - - - - - - - - - - -
CO5 2 2 - 3 2 - - - - - - - 3 - -
Score 10 10 3 6 2 - - - - - - - 6 - -
Course
2 2 3 3 - - - - - - - - 3 - -
Mapping

IIITUPGCSE22 School of Computing 28

2
6.2.5 Program Elective III (Semester I)
Course Code PDSE105
Course Title Machine Learning
Number of Credits 3-0-4-5
Course Type PE

Course Objectives:
 To introduce the major concepts of Machine Learning.
 To acquire advanced data analysis skills.
 To create Machine Learning-based solutions for real-world problems.
 To provide hands-on experience of R/Python programming based Machine
Learning.

Course Contents
Unit I: Introduction to Machine Learning 8
Origin of Machine Learning, Uses and Abuses of Machine Learning, Types of Machine
Learning Algorithms, how do machines learn? Steps to apply Machine Leaning to data,
choosing a Machine Learning Algorithm, Review of Linear Algebra, Probability and
Statistics, exploring and understanding data.

Unit II: Data Exploration and Pre-processing 8

Data Objects and Attributes, Statistical Measures, Visualization, Data Cleaning and
Integration, Feature Engineering, Text Feature Engineering, stacked denoising auto-
encoders.

Unit III: Classification and Regression 8

Least Mean Square Regression, Ridge Regression and LASSO regression, Support
Vector Regression, K-nearest-neighbour, Bayesian and Naïve Bayes Classifier,
Decision Tree, Random Forests, Logistic Regression, Support Vector Machine,
Ensemble Classification.

Unit IV Clustering and Dimensionality Reduction 8

K-Means, Hierarchical, and Density-based Clustering, Spectral Clustering. Linear
Discriminant Analysis, Principal Component Analysis, Transform Domain and
Statistical Feature Extraction and Reduction.

Unit V: Artificial Neural Networks 8

Single Layer Neural Network, Multilayer Perceptron, Back Propagation Learning,
Functional Link Artificial Neural Network, and Radial Basis Function Network,
Recurrent Neural Networks, Deep Learning, Convolutional Neural Networks.

Total Periods:40
IIITUPGCSE22 School of Computing 29

2
 Text Books
1. Michalski, R. S., Carbonell, J. G., and Mitchell, T. M. (Eds.). (2013). “Machine
learning: An artificial intelligence approach”. Springer Science and Business
Media.
2. Hearty, J. (2016). “Advanced Machine Learning with Python: Solve data science
problems by mastering cutting-edge machine learning techniques in Python”.
Packt Publishing Limited.

Reference Books
1. Burger, S. V. (2018). “Introduction to machine learning with R: Rigorous
mathematical analysis.” O'Reilly Media.
2. Han, J., Kamber, M. and Pei J. (2012). “Data Mining Concepts and Techniques”,
Third Edition, Morgan Kaufmann Publishers.

Course Outcomes

CO1 Illustrate the functions of machine learning approaches. K2

CO2 Make use of various data exploration and pre-processing K3
approaches for machine learning-based data analyses.
CO3 Analyse different classification- and regression-based learning K4
approaches for data analysis.
CO4 Analyse different clustering- and dimensionality reduction-based K4
learning approaches for data analysis.
CO5 Analyse different artificial neural network-based learning K6
approaches for data analysis, and design and develop machine
learning-based analytics for real-word scenarios.

CO to PO/PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 2 3 1 1 - - 3 - - - - 1 2 2
CO2 2 3 3 3 1 - - - - - - 3 3 2 2
CO3 2 3 3 3 1 - - - - - - 3 3 2 2
CO4 2 3 3 3 1 - - - - - - 3 3 2 2
CO5 3 3 3 3 1 - - 3 - - - 3 3 3 3
Score 11 14 15 13 5 - - 3 - - - 12 13 11 11
Course
2 3 3 1 1 - - 3 - - - 3 3 2 2
Mapping

IIITUPGCSE22 School of Computing 30

2
6.2.6 Program Elective III (Semester I)

Course Code PDSE106

Course Title Big Data Computing
Number of Credits 3-0-4-5
Course Type PE
Course Objectives:
 To study big data challenges and various big data frameworks.
 To apply concepts of Big Data with advanced architectures like Spark.
 To provide hands-on experience of big data tools.

Course Contents
Unit I: Introduction 8
Data Storage and Analysis, Characteristics of Big Data, Big Data Analytics, Typical
Analytical Architecture, Challenges in Big Data Analytics, Need of big data
frameworks. Unstructured Data Analytics, Technologies and tools.

Unit II: Hadoop Framework 8

History of Hadoop, Apache Hadoop and the Hadoop Ecosystem, Map Reduce,
Analyzing Data with Hadoop, Data Flow, Combiner Functions.

Unit III: Hadoop Eco System – PIG and HIVE 8

Introduction to PIG, Execution Modes of Pig, Comparison of Pig with Databases, Pig
Latin, User Defined Functions, Data Processing operators, Introduction to Apache
Hive, Hive SQL over Hadoop MapReduce, Hive Shell, Hive Services, Hive Metastore,
Comparison with Traditional Databases, HiveQL, Querying Data and User Defined
Functions.

Unit IV: Apache Spark, Spark RDD and Spark SQL 8

Introduction of Spark, components, Hadoop EcoSystem vs Spark, Resilient Distributed
Datasets (RDD), RDD in Spark, RDD Operations, Spark SQL Introduction,
DataFrames, Spark SQL Architecture, data formats, DataFrame Using SQL query,
RDD vs DataFrames vs Datasets.

Unit V: Spark MLLib 8

Spark MLlib, Modeling Big Data, Analytics in Spark, ML: Supervised,
Unsupervised, Spark MLlib use for ML Modeling, Spark GraphX.
.
Total Periods:40

IIITUPGCSE22 School of Computing 31

2
 Text Books
1. White, T. (2015). “Hadoop: The Definitive Guide” O’Reilly.
2. Mohri, M., Rostamizadeh, A. and Talwalker, A. (2018). “Foundations of
Machine Learning”, Second Edition, MIT Press.
3. Karau, H., Konwinski, A., Wendell, P., Zaharia, M. (2015).
“Learning spark: lightning-fast big data analysis. " O'Reilly Media, Inc.".

Reference Books
1. Pentreath, N. (2015). “Machine Learning with Spark”, Packt
Publishing.
2. Miner, D. (2012). Adam Shook, “Map Reduce Design Pattern”,
O’Reilly.

Course Outcomes
CO1 Understand Big data challenges and need of Big data storage and K2
computation tools.
CO2 Apply Hadoop, HBase , MapReduce, Spark to solve big data K3
problems
CO3 Analyze big data using Pig, Hive, Spark tools for solving real world K4
problems
CO4 Assess and apply Hadoop and Spark tools for big data analytics K4
CO5 Analyse different big data tools for real-word scenarios. K6

CO to PO/PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 1 1 1 - - - - - - - - 1 1 - 1
CO2 3 3 3 3 3 1 - - 1 - 1 1 2 2 3
CO3 3 3 3 3 3 1 - - 1 - 1 1 2 2 3
CO4 3 3 3 3 3 1 - 1 - 1 1 2 2 3
CO5 2 2 - - - - - - - - - - - - -
Score 10 10 10 9 9 3 - - 3 3 3 4 7 6 10
Course
2 3 3 3 1 - - 3 - - - 3 3 2 2
Mapping

6.2.7 Program Elective IV (Semester II)

IIITUPGCSE22 School of Computing 32

2
 Course Code PDSE201
Course Title Business Intelligence
Number of Credits 3-0-4-5
Course Type PE

Course Objectives:
 To be exposed to the basic rudiments of a Business Intelligence System.
 To understand the modeling aspects behind Business Intelligence.
 To understand the business intelligence life cycle and the techniques used in it.
 To be exposed with different data analysis tools and techniques.
Course Contents
Unit I: Business Intelligence 8
Effective and timely decisions, Data, information and knowledge, Role of
mathematical models, Business intelligence architectures: Cycle of a business
intelligence analysis, Enabling factors in business intelligence projects, Development
of a business intelligence system, Ethics and business intelligence, BI Tools.

Unit II: Knowledge Delivery 8

The business intelligence user types, Standard reports, Interactive Analysis and Ad Hoc
Querying, Parameterized Reports and Self-Service Reporting, dimensional analysis,
Alerts/Notifications, Visualization, Geographic Visualization, Integrated Analytics,
Considerations: Optimizing the Presentation for the Right Message.

Unit III: Business Intelligence and Big Data Analytics 8

Business Definitions of Business Intelligence and Related Terms, The Hype Around
BI, Big Data, Analytics, and Cognitive Business, A Business View of Big Data, A
Business View of Cognitive Business, BI and Analytics, Beyond the Hype, Industry
Views of BI Success.

Unit IV: Business Intelligence and Decision Support Systems 8

Decision Making, Foundation and Technologies for Decision Making, Phases of
Decision Making, Intelligent Phase, Implementation phase, design phase, Components
of Decision support system, Descriptive Analysis, Predictive Analysis, Prescriptive
Analysis, Data Warehousing.

Unit V: Future of Business Intelligence 8

Future of business intelligence, Emerging Technologies, Machine Learning, Predicting
the Future, BI Search and Text Analytics, Advanced Visualization, Rich Report, Future
beyond Technology. Location-Based Analytics for Organizations, Analytics
Applications for Consumers, Recommendation Engines.

Total Periods:40

IIITUPGCSE22 School of Computing 33

2
 Text Books
1. Efraim T., Ramesh S., Dursun D. (2013), “Decision Support and Business
Intelligence Systems”, 9th ed., Pearson.
2. Williams S. (2014). “Business Intelligence Strategy and Big Data Analytics: A
General Management Perspective”, 1st ed, Elsevier.
3. Sharda R., Delen D., Turban E. (2015), “Business Intelligence and Analytics:
Systems for Decision Support”, Pearson.

Reference Books
1. Larissa T. Moss, S. (2003), “Business Intelligence Roadmap: The Complete
Project Lifecycle of Decision Making”, Addison Wesley.
2. Carlo V. (2009). “Business Intelligence: Data Mining and Optimization for
Decision Making”, Wiley Publications.

Course Outcomes:
CO1 Explain the fundamentals of business intelligence. K2
CO2 Link data mining with business intelligence. K3
CO3 Apply various modeling techniques. K4
CO4 Explain the data analysis and knowledge delivery stages. K2
CO5 Apply business intelligence methods to various situations and K4
identify an appropriate technique.

CO to PO/PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 2 3 1 1 - - 3 - - - - 1 2 2
CO2 2 3 3 3 1 - - - - - - 3 3 2 2
CO3 2 3 3 3 1 - - - - - - 3 3 2 2
CO4 2 3 3 3 1 - - - - - - 3 3 2 2
CO5 3 3 3 3 1 - - 3 - - - 3 3 3 3
Score 11 14 15 13 5 - - 3 - - - 12 13 11 11
Course
2 3 3 3 1 - - 3 - - - 3 3 2 2
Mapping

IIITUPGCSE22 School of Computing 34

2
6.2.8 Program Elective IV (Semester II)
Course Code PDSE202
Course Title Quantum Machine Learning
Number of Credits 3-0-4-5
Course Type PE

Course Objectives:
 To introduce the basic concepts of quantum computing.
 To understand the contribution of quantum computing in data mining domain.
 To study quantum mechanics, clustering, and classification.
 To explore tools and best practices for quantum machine learning.

Course Contents
Unit I: Introduction 8
Introduction to Quantum computing, advantages, history and applications, basics of
quantum computing, Global Perspectives, Quantum Bits, Quantum Computation,
Quantum Information, Postulates of Quantum Mechanisms.

Unit II: Quantum Computation 8

Quantum Circuits, Quantum algorithms, Single Orbit operations, Control Operations,
Measurement, Universal Quantum Gates, Simulation of Quantum Systems, Quantum
Fourier transform, Phase estimation, Applications, Speeding up the solution of NP
complete problems, Quantum Search for an unstructured database.

Unit III: Quantum Machine Learning 8

Classical machine learning vs quantum machine learning, quantum machine learning
for data miners, quantum Machine Learning for solving linear algebraic problems,
quantum nearest neighbor, quantum support vector machine.

Unit IV: Quantum Computing for Clustering Structures 8

Quantum Random access memory, calculating dot products, quantum principal
component analysis, quantum k means.

Unit V: Emerging Applications 8

Quantum associative memory, quantum perceptron, quantum neural network,
applications of quantum computing for predictive analytics, natural language
processing, machine learning, case studies.

Total Periods: 40

IIITUPGCSE22 School of Computing 35

2
 Text Books
1. Michael A. Nielsen., Issac L. Chiang, (2002) “Quantum Computation and
Quantum Information”, Cambridge University Press, Fint South Asian edition.
2. Phillip Kaye , Raymond Laflamme , Michele Mosca , “An Introduction to
Quantum Computing”, Oxford.

Reference Book
1. Marco Lanzagorta, Jeffrey Uhlmann (2009). “Quantum Computer Science”,
Morgan and Claypool Publishers.

Course Outcomes:
CO1 Understand and explain the basic notions of Quantum Computing. K2
CO2 Identify the essential difference between the classical paradigm K3
and the quantum paradigm of computation and appreciate why
quantum computers can solve currently intractable problems.
CO3 Analyze the basic Quantum Classification Algorithms. K4
CO4 Understand the principle of quantum clustering. K3
CO5 Understand the emerging trends in quantum machine learning K2
with the help of case-studies.
CO to PO/PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 2 3 1 1 - - 3 - - - - 1 2 2
CO2 2 3 3 3 1 - - - - - - 3 3 2 2
CO3 2 3 3 3 1 - - - - - - 3 3 2 2
CO4 2 3 3 3 1 - - - - - - 3 3 2 2
CO5 3 3 3 3 1 - - 3 - - - 3 3 3 3
Score 11 14 15 13 5 - - 3 - - - 12 13 11 11
Course
2 3 3 3 1 - - 3 - - - 3 3 2 2
Mapping

IIITUPGCSE22 School of Computing 36

2
6.2.9 Program Elective V (Semester II)
Course Code PDSE203
Course Title Applied Data Science
Number of Credits 3-0-4-5
Course Type PE

Course Objectives:
 To provide foundational knowledge of data analytics tools, and a literature-
based exploration of current research frontiers.
 To study recent trends of data Science in various fields.
 To develop understanding of the power of machine learning tools to formulate
and solve real-time problems.
Course Contents
Unit 1 Data Science in Healthcare 8
Smart Sensors for Healthcare and Medical Applications, Data Collection in
Healthcare: CRM (Customer Relationship Management Systems), EHR (Electronic
Health Records) and Mobile Applications, Predictive Methods for Disease/Drug
Detection and Prevention, Descriptive Analytics, Wearable Technology for
Diagnosis, Telemedicine.

Unit 2 Machine Learning in Systems Biology 8

Social Media Analytics, Sentiment Analysis, Data Crawling, Data Preprocessing,
Applications, Stock Market Prediction, Cyber Fraud Detection, Detecting Violent
Activities on Surface Web and Dark Web, Recommendation Systems and
Applications.

Unit 3 Data Science in E-Learning 8

Adaptive Learning, Educational Data Mining; Data Science Case Study in
Academics, Georgia State University, Arizona State University, Predictive Analytics
for new skill sets and Curriculum Design.

Unit 4 Data Science in Cyber Security 8

Introduction to Cyber Attacks, Information Warfare, Critical Infrastructure Attacks,
Detecting Cyber Attacks using Machine Learning and Deep Learning based Methods,
Malware Detection, Block Chain Methods, Cryptocurrency.

Unit 5 Data Science in Agriculture 8

Integrating Big Data Practices in Agriculture, IoT-Enabled Agricultural System,
Automated IoT-Based Irrigation System, Weather Forecasting, Natural Calamities
Prediction.

IIITUPGCSE22 School of Computing 37

2
 Total Periods:40

Text Books
1. El Morr, Christo, and Hossam Ali-Hassan (2019). “Analytics in
Healthcare: a practical introduction”. Springer.
2. Mucherino, Antonio, Petraq Papajorgji, and Panos M. Pardalos (2009).
“Data mining in agriculture”. Vol. 34. Springer Science Business Media,
2009.
3. Cady, Field (2017). “The data science handbook”. John Wiley and Sons.

Reference Book
1. Subrahmanian, V. S., ed (2012). “Handbook of computational approaches
to counterterrorism”. Springer Science Business Media.

Course Outcomes
CO1 Understand and analyze the application of Data Science in K2
various fields.
CO2 Demonstrate the solutions based on Data Science in healthcare K2
and social media.
CO3 Analyze various applications of Data Science in academics, K6
education and cyber security.
CO4 Compare the various deep learning and machine learning K2
techniques for different data science applications.
CO5 Demonstrate a familiarity with applied Data Science approaches K3
and techniques to Forecast Weather/ Natural Calamities.

CO to PO/PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 2 - 3 - - - - - 3 - - 3 - 3
CO2 - - - - 3 - - - - - - - 3 - 3
CO3 2 2 - 3 1 - - - - - - - - - -
CO4 2 2 - 3 3 - - - 3 - - - - - -
CO5 2 2 - - 1 - - - - - - - - - 3
Score 8 8 - 9 8 - - - 3 3 - - 6 - 9
Course
2 2 - 3 2 - - - 3 3 - - 3 - 3
Mapping

IIITUPGCSE22 School of Computing 38

2
6.2.10 Program Elective V (Semester II)
Course Code PDSE204
Course Title Data Visualization
Number of Credits 3-0-4-5
Course Type PE
Course Objectives:
• To develop skills to both design and critique visualizations.
• To introduce visual perception and core skills for visual analysis.
• To understand visualization for time-series analysis, ranking analysis, deviation.
analysis, distribution analysis, correlation analysis, multivariate analysis.
• To understand issues and best practices in information dashboard design.
Course Contents
Unit I: Core Skills for Visual Analysis 8
Information visualization, effective data analysis, traits of meaningful data, visual
perception, making abstract data visible, building blocks of information visualization,
analytical interaction, analytical navigation, optimal quantitative scales, reference lines
and regions, trellises and crosstabs, multiple concurrent views, focus and context,
details on demand, over-plotting reduction, analytical patterns, pattern examples.

Unit II: Time-Series, Ranking, and Deviation Analysis 8

Time-series analysis, series patterns, time-series displays, time-series best practices,
part-to-whole and ranking patterns, part-to-whole and ranking displays, best practices,
deviation analysis, deviation analysis displays, deviation analysis best practices.

Unit III: Distribution, Correlation, and Multivariate Analysis 8

Distribution analysis, describing distributions, distribution patterns, distribution
displays, distribution analysis best practices, correlation analysis, describing
correlations, correlation patterns, correlation displays, correlation analysis techniques
and best practices, multivariate analysis, multivariate patterns, multivariate displays,
multivariate analysis techniques, and best practices.

Unit IV: Information Dashboard Design 8

Information dashboard, Introduction, dashboard design issues and assessment of needs,
Considerations for designing dashboard-visual perception, Achieving eloquence.

Unit V: Graphics Design 8

Advantages of Graphics, Library of Graphs, Designing Bullet Graphs, Designing
Sparkline, Dashboard Display Media, Critical Design Practices, putting it all together,
Unveiling the dashboard.

IIITUPGCSE22 School of Computing 39

2
 Total Periods: 40

Text Books
1. Ben F. (2008). "Visualizing data: Exploring and explaining data with the
processing environment", O'Reilly.
2. Edward R. (2001). "The visual display of quantitative information", Second
Edition, Graphics Press.
3. Evan S. (2011). "The value of business analytics: Identifying the path to
profitability", Wiley.

Reference Books
1. Gert H. N., Jesper T (2010). "Business Analytics for Managers: Taking business
intelligence beyond reporting", Wiley.
2. Nathan Y. (2013). "Data Points: Visualization that means something", Wiley.

Course Outcomes:
CO1 Explain principles of visual perception. K2
CO2 Apply core skills for visual analysis. K4
CO3 Apply visualization techniques for various data analysis tasks. K4
CO4 Design information dashboard. K3
CO5 Design graphics. K2

CO to PO/PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 2 3 1 1 - - 3 - - - - 1 2 2
CO2 2 3 3 3 1 - - - - - - 3 3 2 2
CO3 2 3 3 3 1 - - - - - - 3 3 2 2
CO4 2 3 3 3 1 - - - - - - 3 3 2 2
CO5 3 3 3 3 1 - - 3 - - - 3 3 3 3
Score 11 14 15 13 5 - - 3 - - - 12 13 11 11
Course
2 3 3 3 1 - - 3 - - - 3 3 2 2
Mapping

IIITUPGCSE22 School of Computing 40

2
6.2.11 Program Elective VI (Semester II)

Course Code PDSE205

Course Title Introduction to Block Chain
Number of Credits 3-0-4-5
Course Type PE

Course Objectives:
● To understand the basics of blockchain and data science.
● To learn the use of data science for blockchain.
● To study and apply matrix factorization techniques.
● To understand the blockchain applications.

Course Contents
Unit-I Introduction 8
What is Blockchain, Blockchain Technology Mechanisms and Networks, Blockchain
Origins, Objective of Blockchain, Blockchain Challenges, Transactions and Blocks,
P2P Systems, Keys as Identity, Digital Signatures, Hashing, and public-key
cryptosystems, private vs. public Blockchain.

Unit-II Bitcoin Mining 8

What is Bitcoin, The Bitcoin Network, The Bitcoin Mining Process, Mining
Developments, Bitcoin Wallets, Decentralization and Hard Forks, Ethereum Virtual
Machine (EVM), Merkle Tree, Double-Spend Problem, Transactional Blocks, Impact
of Blockchain Technology On Cryptocurrency, Hyperledger.

Unit-III Clustering 8
Collaborating to Create Better Models, Collecting data from a cohort, Building models
collaboratively, Discovering Association Rules in Data, Describing the apriori
association rules algorithm, Determining When to Use Clustering and Association
Rules.

Unit-IV Decentralized Database System 8

Distributed identity: Legal identification and Digital identification and wallets,
Decentralized network: Client-server model and Peer-to-peer model, Distributed
ledger: Permissioning framework and Blockchain data structure, Blockchain data
structure, Double spending, Network consensus, Sybil attacks, Path to the after-
Bitcoin.

Unit-V Blockchain Applications 8

Using an application programming interface to interact with a blockchain, Reading
from a blockchain, Comparing popular language pros and cons, Deciding on the right
language Benefitting from Standardization, Easing the burden of compliance.

Total Periods:40
IIITUPGCSE22 School of Computing 41

2
 Textbooks
1. Laurence, T. (2019). “Blockchain for dummies”. John Wiley and Sons, 2019.
2. Liiv, I. (2021). “Data Science Techniques for Cryptocurrency Blockchains”.
Springer Singapore.

Reference Books
1. Hougan, M., Lawant, D. (2021). “Cryptoassets: The Guide to Bitcoin,
Blockchain, and Cryptocurrency for Investment Professionals”. CFA Institute
Research Foundation.
2. Liebi, L. J. (2021). “Antony Lewis: The basics of bitcoins and blockchains,”
Springer.
3. Lipton, A., and Treccani, A. (2021). Blockchain and Distributed Ledgers:
Mathematics, Technology, and Economics. World Scientific.
Course Outcomes:
CO1 Explain the fundamentals of blockchain technology. K2
CO2 Illustrate the applications of cryptocurrency. K2
CO3 Explain the basic concepts of clustering. K2
CO4 Compare several classification models. K5
CO5 Apply the data science techniques for blockchains. K3

CO to PO/PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 3 3 3 2 2 2 2 1 3 - 3 3 3 3
CO2 2 3 2 3 3 2 - - - 3 - 3 - 2 2
CO3 2 2 3 3 1 0 - - - 3 - 3 3 2 2
CO4 2 3 3 3 3 0 - - - 3 - 3 - 2 2
CO5 2 3 3 1 0 0 - - - 3 - 3 - 2 2
Score 10 14 14 13 9 4 2 2 1 15 - 15 6 11 11
Course
2 3 3 3 2 2 2 2 1 3 - 3 3 2 2
Mapping

IIITUPGCSE22 School of Computing 42

2
6.2.12 Program Elective VI (Semester II)

Course Code PDSE206

Course Title Computer Vision: Algorithms and Applications
Number of Credits 3-0-4-5
Course Type PE

Course Objectives:
• To learn the fundamental concepts in computer vision.
• To learn the basics of image feature detection and segmentation.
• To review and use deep learning models for computer vision.
• To make use of deep learning models for video analysis.
• To learn generative models and their application in computer vision tasks.

Course Contents
Unit I: Introduction 8
Computer Vision: A brief history, Image Formation: Geometric Primitives and
Transformations, Image Processing: Point Operators, Linear Filtering, Correlation,
Convolution, Fourier Transforms, Pyramid and wavelets, Geometric
Transformations, Global Optimization.

Unit II: Feature Detection and Segmentation 8

Points and patches, Edges, Lines, Scale Space and Scale Selection; SIFT, SURF,
HoG, LBP, Visual Matching: Bag-of-words, VLAD, RANSAC, Hough transform,
Optical Flow, Segmentation: Active contours, Split and merge, Mean shift and mode
finding, Normalized cuts, Graph cuts and energy based methods.
Unit III: Visualization and Understanding CNNs 8
Review of Deep Learning, FFNN, Backpropagation, Introduction to CNNs, Evolution
of CNN Architectures: AlexNet, ZFNet, VGG, InceptionNets, ResNets, DenseNets,
Visualization of Kernels, Backprop-to-image/Deconvolution Methods, Deep Dream,
Hallucination, Neural Style Transfer, CAM,Grad-CAM, Grad-CAM++, Recent
Methods: IG, Segment-IG, SmoothGrad, CNNs for Recognition and Verification:
Siamese Networks, Triplet Loss, Contrastive Loss, Ranking Loss, CNNs for
Detection: Background of Object Detection, R-CNN, Fast R-CNN, Faster R-CNN,
YOLO, SSD, RetinaNet, CNNs for Segmentation: FCN, SegNet, U-Net, Mask-
RCNN.
Unit IV: CNNs and Attention Models 8
Review of RNNs, CNN and RNN Models for Video Understanding: Spatio-temporal
Models, Action/Activity Recognition, Introduction to Attention Models in Vision,
Vision and Language: Image Captioning, Visual QA, Visual Dialog, Spatial
Transformers, Transformer Networks.

IIITUPGCSE22 School of Computing 43

2
 Unit V: Deep Generative Models and Applications in Vision 8
Review of (Popular) Deep Generative Models: GANs, VAEs, Other Generative
Models: Pixel-RNNs, NADE, Normalizing Flows, Applications: Image Editing,
Inpainting, Super-resolution, 3D Object Generation, Security; Variants: Cycle GANs,
Progressive GANs, Stack GANs, Pix2Pix, Recent Trends: Zero-shot, One-shot,
Few-shot Learning, Self-supervised Learning, Reinforcement Learning in Vision.

Total Periods:40

Text Books
1. Szeliski, R. (2010). “Computer Vision: Algorithms and Applications”,
Springer.
2. Goodfellow, I., Bengio Y., Aaron, C. (2016). “Deep Learning”, MIT Press.

Reference Books
1. Prince, S. J. D. (2012). “Computer Vision: Models, Learning, and Inference”,
Cambridge University Press.
2. Nielsen, M. (2016). “Neural Networks and Deep Learning”, Springer.

Course Outcomes:

CO1 Explain the fundamentals of computer vision. K2

CO2 Apply various feature detection techniques on images. K3
CO3 Examine the outcomes of various CNN architectures. K4
CO4 Make use of Attention in RNN and CNN models. K3
CO5 Apply the data science techniques for blockchains. K3

CO to PO/PSO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 2 3 1 1 - - 3 - - - - 1 2 2
CO2 2 3 3 3 1 - - - - - - 3 3 2 2
CO3 2 3 3 3 1 - - - - - - 3 3 2 2
CO4 2 3 3 3 1 - - - - - - 3 3 2 2
CO5 3 3 3 3 1 - - 3 - - - 3 3 3 3
Score 11 14 15 13 5 - - 6 - - - 12 13 11 11
Course
2 3 3 3 1 - - 3 - - - 3 3 2 2
Mapping

IIITUPGCSE22 School of Computing 44

2
 6.3 Program Electives (PE)
(Specialization in Cyber Security)

IIITUPGCSE22 School of Computing 45

2
6.3.1 Program Elective I (Semester I)

Course Code PCBE101

Course Title Mathematical Foundation for Cyber Security
Number of Credits 3-1-0-4
Course Type PE

Course Objectives
 To study the mathematical fundamentals that is prerequisites for understanding
the variety of problems like network protocols, analysis of web traffic, computer
security, etc.
 To understand and formulate problems in the domain of network security.
 To learn various statistical analysis tools for mining web data.

Course Contents
Unit I: Probability Theory 8
Distribution Function: Probability mass, density, and cumulative distribution
functions, Conditional probability, Expected value, Applications of the Univariate
and Multivariate problems. Probabilistic inequalities, Random samples, sampling
distributions of estimators and Maximum Likelihood.

Unit II: Number Theory 8

Definition – Divisibility, Greatest common divisor, Prime numbers - Fundamental
theorem of arithmetic, Mersenne primes, Fermat numbers, Euclidean algorithm,
Fermat‟s theorem, Euler totient function , Euler‟s theorem, Congruences: Definition
Basic properties of congruences, Residue classes, Chinese remainder theorem.
Application of number theory in cyber security.

Unit III: Linear Algebra 8

Linear Algebra: Matrices and their properties (determinants, traces, rank, nullity,
etc.), Eigenvalues and eigenvectors, Diagonalization, Quadratic form and their types.
Mathematics behind Hashing.

Unit-IV Linear Programming 8

Formulation of Linear Programming Problems, Graphical Method, Simplex Method,
Newton and Lagrange’s method to approximation, Assignment Problems.

Unit V: Graph Theory 8

Isomorphism, Planar graphs, graph coloring, Hamilton circuits and Euler cycles.
Specialized techniques to solve combinatorial enumeration problems, Graph Theory
Applications in Cyber Security.
Total Periods: 40

IIITUPGCSE22 School of Computing 46

2
 Text Books
1. John V. (2015). “Foundation Mathematics for Computer Science”, Springer
International Publishing.
2. Metcalf, L., and Casey, W. (2016). Cybersecurity and applied mathematics.
Syngress.

Reference Book
1. Christen, M., Bert G., and Michele L. (2010). “The ethics of cybersecurity”.
Springer Nature.
2. Daras, N. J., and Rassias, T. M. (Eds.). (2017). Operations Research,
Engineering, and Cyber Security: Trends in Applied Mathematics and
Technology (Vol. 113). Springer.

Course Outcomes
CO1 Explain the fundamentals of discrete and continuous probability. K2
CO2 Illustrate the applications and uses of number theory. K2
CO3 Solve basic cyber security problem using graph theory. K2
CO4 Compare linear programming techniques. K5
CO5 Apply the number theory for cryptography problems. K3

CO to PO/PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 3 - - - - - - - 3 - - 3 - -
CO2 3 2 - - - - - - - - - - 3 - 3
CO3 3 3 - - - - - - - - - - 2 - -
CO4 3 3 - - - - - - - - - - - - -
CO5 3 2 - - - - - - - - - - - - 3
Score 15 13 - - - - - - - 1 - - 8 - 6
Course
3 3 - - - - - - - 2 - - 3 - 3
Mapping

IIITUPGCSE22 School of Computing 47

2
6.3.2 Program Elective I (Semester I)
Course Code PCBE102
Course Title Network Security
Number of Credits 3-1-0-4
Course Type PE

Course Objectives:
 To identify the basic networking principles.
 To understand the need for network security.
 To expose themselves to security at various network layers.

Course Contents
Unit I Fundamentals of Networks 8
Networking Technology, Connecting Devices, The OSI Model, TCP/IP Model, Threats
to Network communications, Wireless Network Security, Denial of Service,
Distributed Denial of Service.

Unit II Cryptography in Network Security 8

Malicious vs Non Malicious code, Counter Measures, Authentication, Access Control,
Network and Browser Encryption, Firewalls, IDS, Network Management.

Unit III Network and Transport Layer Security 8

Network Layer: IPSec Protocol, IP Authentication Header IP, ESP, VPN, Key
Management Protocol for IPSec, Transport Layer: SSL Protocol, TLS Protocol.

Unit IV Email and Web Security 8

Pretty Good Privacy, MIME, S/MIME, Enhanced Security Services for S/MIME - SET
for E-commerce Transactions. Social Media Security, IoT Security, Penetration
Testing, IPS and IDS.

Unit V Cloud and Wireless Network Security 8

Cloud Computing, Cloud Security Risks and Counter Measures, Cloud Security as a
Service, Wireless Network Security: Wireless Security, Mobile Device Security,
WLAN Security.

Total Hours:40

IIITUPGCSE22 School of Computing 48

2
 Text Books
1. Man Y. (2003), “Internet Security: Cryptographic Principles”, “Algorithms and
Protocols”, Wiley Publications.
2. Matt Bishop (2004), “Introduction to Computer Security,” Addison-Wesley.

Reference Books
1. Charles P. (2006). “Security in Computing”, Prentice Hall.
2. William S. (2013). “Cryptography and Network Security”, Pearson.

Course Outcomes

CO1 Classify and secure various Layers of Networks. K4

CO2 Understand the concept of Network Layer Security. K2
CO3 Develop protocols for Web and Mail security. K3
CO4 Apply various password management techniques for system K3
security.
CO5 Develop measures for cloud and wireless network security. K3

CO to PO/PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 2 3 1 1 - - 3 - - - - 1 2 2
CO2 2 3 2 2 1 - - - - - - 3 3 2 2
CO3 2 3 2 3 1 - - - - - - 3 3 2 2
CO4 2 3 2 3 1 - - - - - - 3 3 2 2
CO5 2 3 3 3 1 - - 3 - - - 3 3 3 3
Score 10 14 12 12 5 - - 3 - - - 12 13 11 11
Course
2 3 2 2 1 - - 3 - - - 3 3 2 2
Mapping

IIITUPGCSE22 School of Computing 49

2
 6.3.3 Program Elective II (Semester I)
Course Code PCBE103
Course Title Principles of Cryptography
Number of Credits 3-0-4-5
Course Type PE

Course Objectives:
 To understand the foundations of cryptographic attacks.
 To gain knowledge of encrypting data, and to choose between different algorithms.
 To prepare students for research in the area of cryptography and enhance student’s
communication and problem-solving skills.
 To effectively apply their knowledge to the construction of secure cryptosystems.

Course Contents
Unit-I: Classical Cryptography 8
Introduction: Some Simple Cryptosystems, The Shift Cipher, The Substitution Cipher,
The Affine Cipher, The Vigenere Cipher, The Hill Cipher, The Permutation Cipher,
Stream Ciphers, Cryptanalysis.

Unit-II: Advanced Encryption Standard 8

Introduction to DES, Finite field arithmetic, AES Structure, AES Transformation
functions, AES Key expansion, An AES Example, AES
Implementation.

Unit-III: The RSA System and Factoring 8

Introduction to Public-key Cryptography, Number Theory, The Euclidean Algorithm,
The Chinese Remainder Theorem, The RSA Cryptosystem, Implementing RSA,
Probabilistic Primality Testing, Attacks On RSA.

Unit-IV: Elliptic Curve Cryptosystems 8

The basic setup, Diffie-Hellman Key exchange, Massy-Omura Encryption, ElGamal
Public key encryption.

Unit V: Digital Signature Schemes 8

Introduction, The ElGamal Signature Scheme, The Digital Signature Standard, One-time
Signatures, Undeniable Signatures, Fail-stop Signatures, Blind, Dual and ElGamal
Elliptic Curve signature scheme. Hash Functions: Signatures and Hash Functions,
Collision-free Hash Functions, The Birthday Attack, The Discrete Logarithm problem,
A Discrete Log Hash Function, Extending Hash Functions, Hash Functions from
Cryptosystems, The MD4 Hash Function.

IIITUPGCSE22 School of Computing 50

2
 Total Periods:40

Text Books
1. William Stallings (2006). “Cryptography and Network Security: Principles and
Practice”, 4th ed., Pearson Education, India.
2. Matt Bishop (2004), “Introduction to Computer Security,” Addison-Wesley.

Reference Books
1. Charlie K. (2002). “Network Security: Private Communication in a Public
World”, Prentice Hall.
2. Atul K. (2008). “Cryptography and Network Security”, Tata Mc Grawhill.

Course Outcomes

CO1 Understand the various types of cryptographic attacks and the K2

mathematics behind cryptography.
CO2 Describe the various types of ciphers and hash functions. K3
CO3 Apply the different cryptographic techniques to solve real life K3
problems.
CO4 Evaluate different techniques as to their suitability to various K4
applications.
CO5 Develop a cryptosystem keeping in view social issues and societal K5
impacts.

CO to PO/PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 2 - - - - - - - - - - - - -
CO2 3 2 - - - - - - - - - - - - -
CO3 3 2 - - - - - - - - - - - - -
CO4 3 2 - - - 2 - 3 - - - - - 3 -
CO5 3 2 2 - - 2 - 3 - - - - - 3 -
Score 15 10 - - - 4 - 6 - - - - - 6 -
Course
3 2 - - - 2 - 3 - - - - - 3 -
Mapping

IIITUPGCSE22 School of Computing 51

2
 6.3.4 Program Elective II (Semester I)

Course Code PCBE104

Course Title Digital Forensics
Number of Credits 3-0-4-5
Course Type PE

Course Objectives:
 To understand the concept of digital forensic and its terminology.
 To understand technical and legal aspects of computer crime investigations.
 In depth understanding of attacks and their counter measures.
 Information of how to apply defense through data analysis and file system analysis.
 To learn the procedures of recovering computer evidence and seize process.

Course Contents
Unit I: Introduction 8
Computer forensics fundamentals, Benefits of forensics, computer crimes, computer
forensics evidence and courts, legal concerns and private issues.

Unit II: Computing Fundamentals 8

Understanding Computing Investigations, Procedure for corporate High-Tech
investigations, understanding data recovery work station and software, conducting and
investigations.

Unit III: File Systems 8

File Systems, Various Types of File Systems, Introduction to Storage Layers, Hard Disk
Drive, Forensic Analysis of File Systems. Preparation Steps for Forensic Analysis.

Unit IV: Mobile Forensics 8

Processing crimes and incident scenes, securing a computer incident or crime, seizing
digital evidence at scene, storing digital evidence, obtaining digital hash, reviewing case.
Mobile Phone Forensics and Call Forging, Forensic Procedures, Android Forensics,
Mobile Forensic Tools, Computer Forensics Software Tools, Computer Forensics
Hardware Tools, Various Computer/Digital Forensic Tools.

Unit V: Intrusion Detection System 8

Introduction to Intrusion Detection System, Types of Intrusion Detection System,
Advantages and Disadvantages of IDS, Understanding Network Intrusions and Attacks,
Recognizing Pre-Intrusion/Attack Activities, Port Scans, Address Spoofing 10.8
Attacking with Trojans, Viruses, and Worms, Understanding Password Cracking,
Understanding Technical Exploits, Collecting Network-Based Evidence, Investigating
Routers, Network Protocols.

IIITUPGCSE22 School of Computing 52

2
 Total Periods:40

Text Books
1. Warren G., Jay G. H. (2002). “Computer Forensics: Incident Response
Essentials”, Addison Wesley.
2. Nelson, B, Phillips, A, Enfinger, F, Stuart, C. (2004). “Guide to Computer
Forensics and Investigations”, Thomson Course Technology.

Reference Books
1. Vacca, J (2005). “Computer Forensics, Computer Crime Scene Investigation”,
Charles River Media.
2. Pramanik, S., Ghonge, M. M., Mangrulkar, R. (2022). “Cyber Security and Digital
Forensics: Challenges and Future Trends”. John Wiley and Sons.

Course Outcomes

CO1 Understand requirements of digital forensics its related K2

terminology.
CO2 Explain technical and legal aspects of computer crime K2
investigations.
CO3 Know the limitations of law and its enforcement agencies. K1
CO4 Illustrate forensic analysis and data analysis on file systems K2
CO5 Apply techniques for finding, preserving, presenting, and K3
extracting information from the digital devices.

CO to PO/PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 - - - - - - - - - - - - - -
CO2 3 - - - - - - - - - - - - - -
CO3 3 - - - - - - - - - - - - - -
CO4 3 2 2 - - 2 - 3 - - - - - 3 -
CO5 3 2 2 - - 2 - 3 - - - - - 3 -
Score 15 4 4 - - 4 - 6 - - - - - 6 -
Course
3 2 2 - - 2 - 3 - - - - - 3 -
Mapping

IIITUPGCSE22 School of Computing 53

2
6.3.5 Program Elective III (Semester I)

Course Code PCBE105

Course Title Machine Learning for Security
Number of Credits 3-0-4-5
Course Type PE

Course Objectives:
 To learn the fundamentals of machine learning and cyber security.
 To study different technologies used in machine learning and cyber security.
 To learn the functionality of data driven networks.
 To understand the role of machine learning in cyber security.

Course Contents
Unit 1: Foundations of Machine Learning for Security 8
Introduction to supervised learning models: Logistic regression, Naive Bayes, neural
networks, deep learning models. Introduction to unsupervised learning models: PCA,
K-means, Gaussian mixture models, Building a machine learning pipeline in R.

Unit 2: Data-Driven Network and Computer Security 8

Introduction to Internet architecture, measuring Internet traffic behaviour and anomaly
detection, Analyse internet network traffic using unsupervised learning techniques.
Applications of machine learning to network security: Supervised learning examples:
Spam filtering, phishing, Unsupervised learning examples, Anomaly
detection.

Unit 3: Machine Learning in the Presence of Adversaries 8

Introduction to adversarial machine learning, threat models: Distorting personalization,
defending against adversaries, Evading intrusion/attack
detection.
Unit 4: Ethics, Fairness, Responsibility, and Transparency in Data-Driven
Cybersecurity 8
Fairness, Transparency, and Explain ability in cybersecurity ML models: Privacy
definitions and how to actualize privacy for cybersecurity applications in industry,
Externalities and implications of errors in ML models for cybersecurity. Responsible
data lifecycles: Hands-on lab focused on building a model to detect fraudulent accounts
leveraging virtual case study using R tools and packages.
Unit 5: Secure Machine Learning Development and Deployment 8
Students have the option to develop a real or hypothetical cybersecurity machine
learning deployment case study using R, Computational Trust.

Total Periods: 40

IIITUPGCSE22 School of Computing 54

2
 Text Books
1. Stallings W., Brown L. (2018). “Computer Security: Principles and Practice”
Pearson.
2. Tom, M. (2017). “Machine Learning”, McGraw-Hill.
3. Stamp M. (2011). “Information Security: Principles and Practices”, Wiley.

Reference Books
1. Ethem, A. (2005). “Introduction to Machine Learning”, PHI.
2. Stallings W. (2017). “Cryptography and Network Security: Principles and
Practice”, Pearson.

Course Outcomes

CO1 Explain the fundamentals of Machine Learning and Security. K3

CO2 Examine the functionality of internet architecture and supervised K4
learning.
CO3 Analyze the role of machine learning in threat learning. K4
CO4 Understand the ethics and responsibility in cybersecurity K4
applications.
CO5 Develop the case study model using machine learning and cyber K4
security.

CO to PO/PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 2 3 1 1 - - 3 - - - - 1 2 2
CO2 2 3 3 3 1 - - - - - - 3 3 2 2
CO3 2 3 3 3 1 - - - - - - 3 3 2 2
CO4 2 3 3 3 1 - - - - - - 3 3 2 2
CO5 3 3 3 3 1 - - 3 - - - 3 3 3 3
Score 11 14 15 13 5 - - 3 - - - 12 13 11 11
Course
2 3 3 3 1 - - 3 - - - 3 3 2 2
Mapping

IIITUPGCSE22 School of Computing 55

2
6.3.6 Program Elective III (Semester I)
Course Code PCBE106
Course Title Advanced Computer Network
Number of Credits 3-0-4-5
Course Type PE

Course Objectives:
 To understand the TCP/IP architecture.
 To study packet switching networks and routing in packet switching networks
with different routing algorithms.
 To study traffic management at packet level, flow level and flow and aggregate
levels of packet switching networks
 To learn QoS tunneling and overlay networks for understanding mobile
networking.

Unit 1: Reliable Protocol 8

Transmission Control Protocol (TCP): Error Control, Flow Control, Congestion
Control, Timers, And TCP Options: NOP, MSS, Window Scale Factor, Timestamp,
SACK-Permitted and SACK Options.

Unit II: Stream Control Transmission Protocol (SCTP) 7

Introduction, Services, Features, Packet Format, Association, State Transition
Diagram, Flow Control, Error Control, Congestion Control.

Unit III: Congestion Control and Resource Allocation 9

Issues in Resource Allocation, Network Model, Taxonomy,
Evaluation Criteria; Queuing Disciplines: FIFO, Fair Queuing; TCP Congestion
Control: Additive Increase/Multiplicative Decrease, Slow Start, Fast Retransmit and
Fast Recovery; Congestion-Avoidance Mechanisms: DECbit, Random Early Detection
(RED), Source-Based Congestion Avoidance; Quality of Service: Application
Requirements, Integrated Services (RSVP), Differentiated Services, Equation-Based
Congestion Control.

Unit IV: Ethics, Fairness, Responsibility, and Transparency in Data-Driven

Cybersecurity 8
IPV6 Addressing: Introduction, Address Space Allocation, Global Unicast Addresses,
Auto configuration, Renumbering; IPV6 Protocol: Packet Format, Transition from
Ipv4 TO Ipv6, Generic Routing Encapsulation (GRE) for Tunnelling. ICMPv6: Error
Messages, Informational Messages, Neighbours: Discovery Messages, Group
Membership Messages.

IIITUPGCSE22 School of Computing 56

2
 Unit V: Next Generation Network 8
Unicast Routing Protocols: RIP, OSPF; Multicasting And Multicast Routing Protocols:
Introduction, Multicast Addresses, IGMP, Multicast Routing, Routing Protocols,
MBone, Emerging applications: VoIP, SIP, video over P2P Mobile IP.

Total Periods: 40

Text Books
1. Behrouz A. Forouzan (2017). “TCP/IP Protocol Suite”, McGraw- Hill, 4th
Edition.
2. Larry L. Peterson, Bruce S. Davie (2021). “Computer Network: A System
Approach”, Morgan Kaufmann, 6th Edition.

Reference Books
1. Schiller, J. (2010). “Mobile Communications”, Pearson Addison-Wesley, 2nd
Edition.
2. Stallings W. (2017). “Cryptography and Network Security: Principles and
Practice”, Pearson.
3. James F. Kurose, Keith W. Ross (2016). “Computer Networking”, Pearson.

Course Outcomes
CO1 Understand the architecture of TCP/IP, switching, routing and K3
emerging applications.
CO2 Describe traffic management at packet level, flow level and flow K3
and aggregate levels of packet switching networks.
CO3 Apply the knowledge about QoS, tunneling and overlay networks K4
and to understand mobile networking.
CO4 Understand the ethics and responsibility in cybersecurity K3
applications.
CO5 Apply the knowledge about QoS, tunneling and overlay networks K4
and to understand mobile networking and wireless networking

CO to PO/PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 2 3 1 1 - - 3 - - - - 1 2 2
CO2 2 3 3 3 1 - - - - - - 3 3 2 2
CO3 2 3 3 3 1 - - - - - - 3 3 2 2
CO4 2 3 3 3 1 - - - - - - 3 3 2 2
CO5 3 3 3 3 1 - - 3 - - - 3 3 3 3
Score 11 14 15 13 5 - - 3 - - - 12 13 11 11
Course
2 3 3 3 1 - - 3 - - - 3 3 2 2
Mapping

IIITUPGCSE22 School of Computing 57

2
6.3.7 Program Elective IV (Semester II)

Course Code PCBE201

Course Title Ethical Hacking
Number of Credits 3-1-0-4
Course Type PE

Course Objectives:
 To learn various hacking techniques and attacks.
 To understand the benefits of strategic planning process.
 To evaluate where information networks are most vulnerable.
 To perform tests into secure networks for evaluation purposes.

Course Contents
Unit I: Ethical Hacking: Overview 8
Understanding the importance of security, Concept of ethical hacking and essential
Terminologies-Threat, Attack, Vulnerabilities, Target of Evaluation, Exploit. Phases
involved in hacking, System Hacking, Session Hijacking

Unit II: Foot Printing and Port Scanning 8

Foot printing, Introduction to foot printing, Understanding the information gathering
methodology of the Hackers, Tools used for the reconnaissance phase. Port Scanning,
Introduction using port scanning tools, Ping sweeps, Scripting Enumeration,
Introduction Enumerating windows OS and Linux OS.

Unit III: Buffer Overflows and Sniffers 8

Significance of Buffer Overflow Vulnerability, Why Programs/Applications are
vulnerable. Reasons for Buffer Overflow Attacks. Methods of ensuring that buffer
overflows are trapped. Active and passive sniffing. ARP poisoning and
countermeasures. Man in the middle attacks, Spoofing and Sniffing attacks. Sniffing
countermeasures.

Unit IV: Hacking Web Services - SQL Injection 8

Attacking SQL Servers, Sniffing, Brute Forcing and finding Application Configuration
Files, Input validation attacks. Preventive Measures. Web Application Threats, Web
Application Hacking, Cross Site Scripting / XSS Flaws / Countermeasures Correct
Web Application Set-up.
Web Application Security: Core Defence Mechanisms. Handling User Access,
Authentication, Session Management, Access Control. Web Application
Technologies: HTTP Protocol, Requests, Responses and Methods. Encoding schemes.
Server side functionality technologies (Java, ASP, PHP).

IIITUPGCSE22 School of Computing 58

2
 Unit V: Hacking Wireless Networks: Attacking Authentication 8
Attacking Session Management, Design Flaws in Authentication Mechanisms
Attacking Forgotten Password Functionality, attacking Password change functions.
Countermeasures to authentication attacks Attacking other users: Reflected XSS
Vulnerabilities, Stored XSS Vulnerabilities, DOM-Based XSS Vulnerabilities, HTTP
Header Injection. Countermeasures to XSS.

Total Periods: 40

Text Books
1. Patrick E. (2013). “The Basics of Hacking and Penetration Testing”. Elsevier.
2. Khare, R. (2006). “Network Security and Ethical Hacking”. Luniver Press.

Reference Books
1. Thomas M. (2003). “Ethical Hacking”, OSB Publisher.
2. Stuart M., Joel S., George K. (2005). “Hacking Exposed: Network Security
Secrets and Solutions”, McGraw-Hill.

Course Outcomes

CO1 Understand the fundamentals of Hacking and Vulnerabilities. K2

CO2 Illustrate a computer against a variety of different types of K3
security attacks using a number of hands-on techniques.
CO3 Analyze different attacks and the respective countermeasures. K4
CO4 Analyze and critically evaluate techniques used to break into an K5
insecure web application and identify relevant countermeasures.
CO5 Solve hacking attacks and protect data assets. K3

CO to PO/PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 2 3 1 1 - - 3 - - - - 1 2 2
CO2 2 3 3 3 1 - - - - - - 3 3 2 2
CO3 2 3 3 3 1 - - - - - - 3 3 2 2
CO4 2 3 3 3 1 - - - - - - 3 3 2 2
CO5 3 3 3 3 1 - - 3 - - - 3 3 3 3
Score 11 14 15 13 5 - - 3 - - - 12 13 11 11
Course
2 2 3 3 1 - - 3 - - - 3 3 2 2
Mapping

IIITUPGCSE22 School of Computing 59

2
6.3.8 Program Elective IV (Semester II)

Course Code PCBE202

Course Title Cyber Attack and Defenses
Number of Credits 3-1-0-4
Course Type PE

Course Objectives:
 To understand the honeypots, multiple IDS methods, tools to analyze various types
of attacks like wireless attacks and their detection.
 To understand the attack source and also provides practical knowledge for dealing
with intrusions in real world applications.
Course Contents
Unit I Introduction to IDPS 8
IDPS Technologies, Components and Architecture Implementation Uses of IDPS
Technologies, Key Functions, Common Detection Methodologies Signature, Anomaly
and Stateful Protocol Analysis, Types of IDPS Technologies.
Host and Network IDPS 8
Application, Transport, Network and Hardware Layer attacks, Sniffing Network Traffic,
Replay Attacks, Command Injection, Internet Control Message Protocol Redirect,
DDoS, Dangers and defences with Man-in the Middle, Secure Socket Layer attacks,
DNS Spoofing, Defence in-Depth Approach, Port Security, Use Encrypted Protocols.

Unit II Network Behaviour Analysis 8

Components and Architecture Typical, Network Architecture, Sensor Locations.
Honeypots Honeynets- Gen I, II and III, Honeymole, Detecting the Attack - Intrusion
Detection, Network Traffic Capture, monitoring on the box, Setting up the Realistic
Environment.
Unit III Working with SNORT IDS 8
Introduction to Snort, Snort Alert Modes and Format, working with Snort Rules, Rule
Headers, Rule Options, The Snort Configuration File etc., Plugins, Pre-processors and
Output Modules, Using Snort with MySQL. Multiple IDPS Technologies: Need for
multiple IDPS Technologies, Integrating Different IDPS Technologies Direct and
Indirect, Firewalls, Routers and Honeypots, IPS using IP Trace back - Probabilistic and
Deterministic Packet Marking.
Unit IV Wireless IDPS 8
WLAN Standards, WLAN Components, Threats against WLANs, 802.11 Wireless
Infrastructure Attacks, WEP Attacks, Wireless Client Attacks, Bluetooth Attacks, Cell
phones, Personal Digital Assistance and Other Hybrid Devices Attack Detection,
Jailbreaking, Contemporary issues Recent Trend.
Unit V Investigating Incident and Recovery process 8
Investigating a compromised system, Disaster Recovery Plan, Contingency Planning
Vulnerability Management: Information Management, Risk Assessment, Vulnerability
Assessment, Response Planning, Vulnerability management Tools. Log Analysis.

Total Periods: 40
IIITUPGCSE22 School of Computing 60

2
 Text Books:
1. Shui Y. (2014). “Distributed Denial of Service Attack and Defense”, Springer.
2. Yuri D., Erdal O. (2018). “Cybersecurity Attack and Defense Strategies”,
PACKT Publication.

Reference Books:
1. John H., Hoopes, J. (2009). “Virtualization for security: including sandboxing,
disaster recovery, high availability, forensic analysis, and honeypotting”.
Syngress.
2. Karen S. and Peter M. (2007). “Guide to Intrusion Detection and Prevention
Systems”, NIST Special Publication.

Course Outcomes
CO1 Understand the intrusion detection and prevention technologies, K2
various types of network behavior analysis.
CO2 Analyze various types of attacks like wireless attacks and their K4
detection and to understand the honeypots, multiple IDS
methods, tools.
CO3 Apply the practical knowledge for dealing with intrusions in real K3
world applications.
CO4 Analyze and evaluate the attack sources. K5
CO5 Understand the different vulnerabilities and manage the recovery K2
process.

CO to PO/PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 2 3 1 1 - - 3 - - - - 1 2 2
CO2 2 3 3 3 1 - - - - - - 3 3 2 2
CO3 2 3 3 3 1 - - - - - - 3 3 2 2
CO4 2 3 3 3 1 - - - - - - 3 3 2 2
CO5 3 3 3 3 1 - - 3 - - - 3 3 3 3
Score 11 14 15 13 5 - - 3 - - - 12 13 11 11
Course
2 3 3 1 1 - - 3 - - - 3 3 2 2
Mapping

IIITUPGCSE22 School of Computing 61

2
6.3.9 Program Elective V (Semester II)

Course Code PCBE203

Course Title Malware Analysis and Detection
Number of Credits 3-0-4-5
Course Type PE

Course Objectives:
 To study malware analysis and malware detection.
 To make familiar with basic and advanced malware analysis techniques.
 To analyze malicious Windows executables and documents and develop
professional quality malware analysis report.
 To identify common indicators of infection and characteristics of different
types of malwares.
 To learn how to detect different types of malwares.

Course Contents
Unit I: Introduction 8
Introduction-Definition of Malware Analysis, Classification of Malware, Malware
attack lifecycle, Malware Analysis in Virtual Machines, Malware Components,
Malware Packers, Code Injection, Process Hollowing, and API Hooking.

Unit II: Malware Analysis and Classification 8

Static Analysis: Hashing, Finding Strings, Packed and Obfuscated Malware, Portable
Executable File Format, Structure of PE files & analysis Linked Libraries and
Functions, Dynamic Analysis: Sandboxes: The Quick-and-Dirty Approach, Running
Malware

Unit III: Advanced Analysis 8

Advanced Static Analysis: Review of x86 assembly, Disassembly with IDA Pro &
other tools, Recognizing C Code Constructs in Assembly, Analyzing Malicious
Windows Programs, Advanced Dynamic Analysis: Debugging with OllyDbg and
x32dbg, Kernel Debugging with WinDbg.

Unit IV: Malware functionality 8

Malware Behavior & Covert Malware Launching, Analyzing Java Binaries and
Malware, Analyzing .NET Malware, Malware Analysis with Ghidra, Malware
Functionality, Malware Obfuscation, Malicious document analysis, PDF, docs, and
macro.

IIITUPGCSE22 School of Computing 62

2
 Unit V: Malware detection 8
Antivirus Engines, IDS/IPS, hook and rootkit Detection module, malware Sandbox,
binary instrumentation, Anti-reverse engineering: Anti-Disassembly, Anti-Debugging
and obfuscation.

Total Periods:40

Text Books
1. Michael S. and Andrew H. (2012). “Practical Malware Analysis: The Hands-
On Guide to Dissecting Malicious Software”, No Starch Press Publication.
2. Abhijit M., Anoop S. (2020). “Malware Analysis and Detection Engineering:
A Comprehensive Approach to Detect and Analyze Modern Malware”, Apress
Publication.

Reference Books
1. Mannappa K A (2018). “Learning Malware Analysis: Explore the concepts,
tools, and techniques to analyze and investigate Windows malware”, Packt
Publishing.
2. Alexey K., Amr T. (2019). “Mastering Malware Analysis” Packt Publishing.

Course Outcomes
CO1 Understand the types of malware, including rootkits, Trojans, and K2
viruses.
CO2 Perform basic Static and Dynamic analysis for malware analysis K5
with antivirus scanning, strings and sandbox.
CO3 Apply advanced static analysis and dynamic analysis for malware K4
analysis.
CO4 Analyze malware behaviour for different files and documents. K4
CO5 Experiment with Antivirus Engines, IDS/IPS, and Sandbox for K3
malware detection.

CO to PO/PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 - - - - - - - - - - - - - -
CO2 3 3 3 - - - - - 3 3 - - 3 - -
CO3 3 2 2 - - - - - 3 2 - - 2 - -
CO4 3 2 3 - - - - - - - - - 2 - -
CO5 3 - - - - - - - 3 - 3 - - - -
Score 14 7 8 - - - - - 9 5 3 - 7 - -
Course
3 2 3 - - - - - 3 3 3 - 2 - -
Mapping

IIITUPGCSE22 School of Computing 63

2
6.3.10 Program Elective V (Semester II)

Course Code PCBE204

Course Title Reverse Engineering and Vulnerability Analysis
Number of Credits 3-0-4-5
Course Type PE

Course Objectives:
 To learn fundamentals of Reverse engineering.
 To study different Static and Dynamic Reversing Assessment
techniques.
 To identify and resolve various security threats and risks.
 To understand the role of Reverse engineering in cyber security.

Course Contents
Unit I: Introduction to Reverse engineering 8
What is reverse engineering, Reverse engineering process, Types of tools used in
reverse engineering, Tools, reverse engineering analyzing and handling Malware, basic
setup for malware handling, Typical malware behavior, Tools used to identify hidden
components.

Unit II: Static and Dynamic Reversing Assessment 8

Static analysis, file types and header analysis, Deadlisting, Dynamic analysis, tools of
the trade analysis environments: virtual machines, Windows, Linux, Information
gathering tools, Disassemblers, Debuggers, Decompilers, Networking tools, attack
tools.

Unit III: Anti-Reverse-Engineering Techniques 8

Anti-Reverse-Engineering: Anti-Disassembly, Anti-Debugging, Anti-Virtual Machine
Techniques, Packers and Unpacking, code obfuscation.

Unit IV: Vulnerability and security 8

Understanding the need for security assessments, security tests, Types of security tests,
Security testing, Vulnerability assessment versus penetration testing, Penetration
testing execution lifecycle, Penetration testing execution standard.

Unit V: Vulnerability assessment 8

Security audit, Vulnerability assessment: Security scanning process, Vulnerability
assessment and WAF, Deciding upon the type of vulnerability assessment, Types of
vulnerability assessment, vulnerability assessment based on the location, External
vulnerability assessment, Internal vulnerability assessment, Explore Vulnerability
assessment tools.

Total Periods:40
IIITUPGCSE22 School of Computing 64

2
 Text books
1. Reginald W. (2018). “Mastering Reverse Engineering: Re-engineer your
ethical hacking”, skills”, Packt Publishing.
2. Alexey Kleymenov, Amr Thabet (2019). “Mastering Malware Analysis” Packt
Publishing.

Reference Books
1. Bruce D., AlexandreGazet, E. (2014). “Practical Reverse Engineering”, Wiley
Publishers.
2. Eld E. (2005). “Reversing: Secrets of Reverse Engineering”, Wiley Publishers.

Course Outcomes

CO1 Explain the fundamentals of Reverse engineering and analyzing K3

malware.
CO2 Demonstrate and analyze Static and Dynamic analysis and K5
various tools on a malicious file.
CO3 Examine the anti-reverse-engineering techniques for malware K4
analysis.
CO4 Analyze malware behavior for different files and documents. K3
CO5 Discover and resolve various security threats and risks. K4

CO to PO/PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 - - - - - - - - - - - - - -
CO2 3 3 3 - - - - - 3 3 - - 3 - -
CO3 3 2 2 - - - - - 3 2 - - 2 - -
CO4 3 2 3 - - - - - - - - - 2 - -
CO5 3 - - - - - - - 3 - 3 - - - -
Score 15 7 8 - - - - - 9 5 3 - 7 - -
Course
3 2 3 - - - - - 3 3 3 - 2 - -
Mapping

IIITUPGCSE22 School of Computing 65

2
6.3.11 Program Elective VI (Semester II)
Course Code PCBE205
Course Title Block Chain Technology
Number of Credits 3-0-4-5
Course Type PE

Course Objectives:
 To learn the fundamentals of Cryptography and Blockchain.
 To study different technologies used in BitCoin and Cryptocurrency.
 To learn the functionality of Distributed Consensus.
 To understand the blockchain applications.

Course Contents
Unit I: Introduction of Cryptography and Blockchain 8
What is Blockchain, Blockchain Technology Mechanisms and Networks, Blockchain
Origins, Objective of Blockchain, Blockchain Challenges, Transactions and Blocks,
P2P Systems, Keys as Identity, Digital Signatures, Hashing, and public key
cryptosystems, private vs. public Blockchain.

Unit II: BitCoin and Cryptocurrency 8

What is Bitcoin, The Bitcoin Network, The Bitcoin Mining Process, Mining
Developments, Bitcoin Wallets, Decentralization and Hard Forks, Ethereum Virtual
Machine (EVM), Merkle Tree, Double-Spend Problem, Blockchain and Digital
Currency, Transactional Blocks, Impact of Blockchain Technology On Cryptocurrency,
Hyperledger. Smart Contract and Blockchain automation.

Unit III: Distributed Consensus 6

Nakamoto consensus, Proof of Work, Proof of Stake, Proof of Burn, Difficulty Level,
Sybil Attack, Energy utilization and alternate.

Unit IV: Blockchain Applications and Solidity Programming Programming 10

Internet of Things, Medical Record Management System, Domain Name Service and
Future of Blockchain, Alt Coins, Solidity Programming: Solidity - Language of Smart
Contracts, Installing Solidity and Ethereum Wallet, Basics of Solidity, Layout of a
Solidity Source File & Structure of Smart Contracts, General Value Types (Int, Real,
String, Bytes, Arrays, Mapping, Enum, address).

IIITUPGCSE22 School of Computing 66

2
 Unit-V Cryptocurrency Regulation 8
Stakeholders, Roots of Bit coin, Legal Aspects- Crypto currency Exchange, Black
Market and Global Economy. Applications: Internet of Things, Medical Record
Management System, Domain Name Service and future of
Blockchain.

Total Periods: 40
Text Books
1. Laurence, T. (2019). Blockchain for dummies. John Wiley and Sons, 2019.
2. Liiv, I. (2021). Data Science Techniques for Cryptocurrency Blockchains.
Springer.
Reference Books
1. Hougan, M., Lawant, D. (2021). “Cryptoassets: The Guide to Bitcoin,
Blockchain, and Cryptocurrency for Investment Professionals”. CFA Institute
Research Foundation.
2. Liebi, L. J. (2021). “Antony Lewis: The basics of bitcoins and blockchains”,
Springer.

Course Outcomes
CO1 Explain the fundamentals of Cryptography and Blockchain. K3
CO2 Examine the functionality of Bitcoin and Cryptocurrency. K4
CO3 Analyze the role of distributed consensus. K4
CO4 Analyze different block chain applications and solidity K3
programming
CO5 Examine the different regulations for cryptocurrency regulations. K4
CO6 Simulate Bitcoin mining K6

CO to PO/PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 3 3 3 2 2 2 2 1 3 - 3 3 3 3
CO2 2 3 2 3 3 2 - - - 3 - 3 - 2 2
CO3 2 2 3 3 1 - - - - 3 - 3 3 2 2
CO4 2 3 3 3 3 - - - - 3 - 3 - 2 2
CO5 2 3 3 1 - - - - - 3 - 3 - 2 2
CO6 2 3 3 3 3 2 2 2 1 3 3 3 3 3 3
Score 12 17 17 16 12 6 4 4 2 18 3 18 9 14 14
Course
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
Mapping

IIITUPGCSE22 School of Computing 67

2
6.3.12 Program Elective VI (Semester II)

Course Code PCBE206

Course Title Mobile Security
Number of Credits 3-0-4-5
Course Type PE

Course Objectives:
 To learn the fundamentals of security in mobile communication and
applications.
 To study different levels of security.
 To learn the functionality of Application Level Security.
 To understand the working of Encryption.

Course Contents
Unit: I Security 8
Security Issues in Mobile Communication: Mobile Communication History, Security
Wired Vs Wireless, Security Issues in Wireless and Mobile Communications, Security
Requirements in Wireless and Mobile Communications, Security for Mobile
Applications, Advantages and Disadvantages of Application level Security.

Unit II: Security of Device 8

Security of Device, Network, and Server Levels: Mobile Devices Security
Requirements, Mobile Wireless network level Security, Server Level Security.
Application Level Security in Wireless Networks: Application of WLANs, Wireless
Threats, Some Vulnerabilities and Attach Methods over WLANs, Security for 1G Wi-
Fi Applications, Security for 2G Wi-Fi Applications, Recent Security Schemes for Wi-
Fi Applications, Security in VANET, Participatory Sensing and Mobile IoT,
Information Falsification Problem.

Unit III: Application Level Security 8

Application Level Security in Cellular Networks: Generations of Cellular Networks,
Security Issues and attacks in cellular networks, GSM Security for applications, GPRS
Security for applications, UMTS security for applications, 3G security for applications,
Some of Security and authentication Solutions.

Unit IV: Security in MANETs 8

Application Level Security in MANETs: MANETs, Some applications of MANETs,
MANET Features, Security Challenges in MANETs, Security Attacks on MANETs,
External Threats for MANET applications, Internal threats for MANET Applications.

Unit V: Encryption 8
Data Center Operations Security challenges, implement five Principal Characteristics
of Cloud Computing, Data center Security Recommendations Encryption for
Confidentiality and Integrity, Encrypting data at rest, Key Management Lifecycle,
Cloud Encryption Standards.

Total Periods: 40
IIITUPGCSE22 School of Computing 68

2
 Text Books
1. Elenkov, N. (2014). “Android security internals: An in-depth guide to
Android's security architecture”. No Starch Press.
2. Bergman, N., Stanfield, M., Rouse, J., Scambray, J. (2013). “Hacking exposed:
Mobile security secrets and solutions”. McGraw-Hill.

Reference Books
1. Neil B., Mike S., Jason R., and Joel S. (2016), “Hacking Exposed Mobile:
Security Secrets and Solutions”. Springer.
2. Schwartz, M. (2005). “Mobile wireless communications”, Vol. 25. Cambridge:
Cambridge University Press.

Course Outcomes
CO1 Explain the fundamentals of security. K3
CO2 Examine the functionality of security in devices. K4
CO3 Analyze the role of application level security. K4
CO4 Analyze different block chain applications and solidity K3
programming.
CO5 Examine the working of Encryption. K4
CO6 Simulate secure devices for data transmission. K6

CO to PO/PSO Mapping

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO/PO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 3 3 3 2 2 2 2 1 3 - 3 3 3 3
CO2 2 3 2 3 3 2 - - - 3 - 3 - 2 2
CO3 2 2 3 3 1 - - - - 3 - 3 3 2 2
CO4 2 3 3 3 3 - - - - 3 - 3 - 2 2
CO5 2 3 3 1 - - - - - 3 - 3 - 2 2
Score 10 14 14 13 9 4 2 2 1 15 - 15 6 11 11
Course
2 3 3 3 3 2 2 2 1 3 3 3 3 2 2
Mapping

IIITUPGCSE22 School of Computing 69

2
 Course Outcome Survey Form

Date:
Course Code : Course Name : Year/Semester: Faculty:

Your satisfaction on the following Very Generally Generally Very

statements Satisfied Satisfied dissatisfied Dissatisfied
Faculty has made the subject interesting

Faculty is enthusiastic about what is taught

Faculty is good at explain things

The course is well organized
The course is intellectually stimulating

Any changes in the course or teaching have

been communicated effectively
The criteria used in assessment have been
clearly stated in advance
Assessment and marking have been fair
I have been able to contact faculty when I
needed to
I have received detailed comments on my
work
I have received enough advice and support
from the faculty for my studies
I have been able to access general IT resources
when I needed to
My communication skills have improved
Feedback on my work has been prompt
Feedback on my work has helped me clarify
things I did not understand
As a result of the course, I feel confident in
tackling problems related to this course
Overall, I am satisfied with the quality of the
course

Signature of Student

IIITUPGCSE22 School of Computing 70

2
 M.Tech. CSE
(Specialization in Data Science/Cyber Security)
Program Survey Form
(By Final Year M. Tech. Students) Date:

1. Course Outcomes
Overall, Your satisfaction on the following statements: Very Generally Generally Very
Satisfied Satisfied dissatisfied dissatisfied
How current the content is in most subjects in your
courses?
How interesting the teaching is in most subjects in
your courses?
The variety of courses offered in your programme.
How helpful and accurate the academic advising is in
your course?
How helpful and accurate the career counselling is in
your programme?
How challenging the work is intellectually in most
courses in your programme?
The overall educational experience in your
programme.

2. About Faculty
To what extent do you agree or disagree with the Strongly Agree Disagree Strongly
following statements: Agree Disagree
Faculties are good at explaining things
Faculties are good at motivating me to do my best work

Faculties normally give me helpful feedback on how I

am doing
Faculties give feedback promptly
Faculties work hard to make the subjects interesting
Faculties grading method are fair
Faculties treat students with respect
Faculties are available when I need them
Course objectives are clear in most courses
Course objectives are met in most courses

3. Teaching and Learning Environment

What extent are you satisfied with the following aspects Very Generally Generally Very
of the teaching and learning environment? Satisfied Satisfied dissatisfied dissatisfied
Intellectual stimulation of most courses
Amount of work required in most courses
Relevance of lab/practical classes
Group work for assignments
Level of class interactions in most courses
Course Contents in most courses
Assistance from most faculty outside of class
Library access to reading materials

IIITUPGCSE22 School of Computing 71

2
 Opportunities to be involved with other students outside
of class
Being informed about things in the department

4. Skill Development
What extent does your coursework in your major Strongly Agree Disagree Strongly
improve the following skills? Agree Disagree
Communication skills
Writing skills
Interpersonal relationship skills
Self-reliance skills
Decision-making skills
Ability to execute plans
Ability to work in groups on projects
Leadership skills
Analytical skills
Research skills
Making logical judgements
Producing independent work
Understanding my strengths and weaknesses
Achieving personal goals
Achieving career goals
My education from IIITU is important to me

5. Professional Ethics
What extent do you agree or disagree with the Strongly Agree Disagree Strongly
following statements Agree Disagree
I show respectful behavior toward faculty and other
students in most of my classes
I actively participate in most class discussions
I usually attend my classes
I usually read the text or other readings prior to class
I study extensively for exams and quizzes
I study a few days before the cycle tests/ end semester
exam
I complete all course assignments as explained in
syllabus
I ask for help from most of my faculty when I need it
I am motivated to learn course materials
I care about what grade I will receive in most courses

Signature of student

IIITUPGCSE22 School of Computing 72

2
 Alumni Survey Form
(Assessment of Outcomes - M. Tech. (CSE)

Name :
Year of Post-Graduation:
Organization :
Address :
Phone : Email:

Overall, are you satisfied with: Very Generally Generally Very

Satisfied Satisfied dissatisfied dissatisfied
Demonstrate basic knowledge in mathematics,
science, engineering, and humanities.
Define the problems and provide solutions by
designing and conducting experiments, interpreting
and analyzing data, and reporting the results.
Demonstrate the ability to design Computer Science
and Engineering systems
Ability to participate as members of multidisciplinary
design teams along with mechanical, electrical, and
other engineers
Understand quantitative modelling and analysis of a
broad array of systems-level techniques to identify,
formulate and solve technical problems
Broadly educated and will have an understanding of
ethical responsibilities
Proficient in English language in both communicative
and technical forms
Awareness to apply engineering solutions in global,
national, and societal contexts.
Capable of self-education and clearly understand the
value of updating their professional knowledge to
engage in life-long learning
Demonstrate the ability to apply advanced
technologies to solve contemporary and new
problems
Demonstrate the ability to choose and apply
appropriate resource management techniques.

IIITUPGCSE22 School of Computing 73

2
 Employer/Scholar Survey Form
Date: / /

Name of the Company/Institution :

Name of the M.Tech. (CSE) IIITU Alumni:
Batch: 20 to 20
Designation of Alumni :
Job Specification of Alumni :
Name of the Assessor :
Designation :
How do you rate the current potential of IIITU CSE Very Generally Generally Very
alumni working in your organization on the following Satisfied Satisfied Dissatisfied Dissatisfied
criteria:
Application of mathematical foundations
Application of computer science theory and algorithmic
principles
Application of modeling and design of computer-based
systems
Application of engineering knowledge in their domain
Domain: Health care /Banking / Finance/ Medical/ Law/
Others
Others, specify:
Design and conduct of experiments and to analyze and
interpret data
Analyze the problem, subdivide into smaller tasks with
well-defined interface for interaction among
components
Complete the project (given task) within the specified
time frame and financial constraints
Proposal of original ideas and solutions
Design, implement, and evaluation of hardware / software
systems with security features
Design, implement, and evaluation of hardware / software
systems with assured quality and efficiency
Effective communication of engineering solution to peers
and leads
Effective communication of engineering solution to
customers and users
Understanding of contemporary issues
Engagement in lifelong learning

IIITUPGCSE22 School of Computing 74

2
 Course Registration Form
This form must be submitted on the day of Registration of Courses First working day of
the odd/even semester, attaching the proof for fee payment.
Date:
Student Name: Roll No.:
Program: M.Tech. (CSE) Specialization: DS/CS
AY: 20 to 20 Semester:

S. No. Subject Code and Title Credit

1
2
3
4
5
6
7
8
9
10

Fees Payment Details

Date of Payment Bank Transaction Amount Is proof of payment

/ DD Number attached

Encl.: Proof of Payment details

Signature of Student Faculty In-charge

IIITUPGCSE22 School of Computing 75

2
 8:30- 9:20- 10:30- 11:20- 13:30- 14:20- 15:20- 16:10-
Day
9:20 10:10 11:20 12:10 14:20 15:10 16:10 17:00

Mon

L
B

U
Tue

N
R

Wed C H
E

B
R
A

Thur
A
K

Fri

IIITUPGCSE22 School of Computing 76

2
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22
IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22 IIITUPGCSE22

IIITUPGCSE22 School of Computing 77