CSE Syllabus 2024 1
CSE Syllabus 2024 1
The School of Computer Science and Engineering (SoCSE) of the Kerala University of Digital
Sciences, Innovation, and Technology (KUDSIT) was established in 2020 at the Technopark
Phase 4, Thiruvananthapuram. The school offers the academic programs M.Tech Computer
Science and Engineering, M.Sc Computer Science, and PhD.
M.Tech in Computer Science and Engineering has three specializations: Artificial Intelligence,
Connected Systems and Intelligence, and Cyber Security Engineering. The students must choose
one of the specializations in the second semester. The admission and eligibility requirements
for all three specializations are the same.
M.Sc in Computer Science has two specializations: Cyber Security and Machine Intelligence. The
students must choose one of the specializations while taking admission. The admission and
eligibility requirements for both specializations are the same.
Program Structure
One credit equates to 1 hour of contact classes (lectures or tutorials) per week or 2 hours of
student workload (projects, labs, or self-study). Given that there are 15 teaching weeks, 1 hour
of contact per week counts for 15 hours in a semester, or, on average, 2 hours of self-learning
hours or coursework activities count for 30 hours of activities in a semester.
The normal duration to complete the master's programis24 months, divided into four
semesters. However, the student may be allowed to complete the program in 48 months. Zero
years are permitted for medical reasons or for engaging in startups. To avail of zero years as
part of the startups, the student must be a founder on the director board of a company
registered as a startup. Any other reasons for availing of a zero year are accessed on a case-to-
case basis by the school committee for consideration of approval by the dean academic. The
zero year does not count towards the total duration of the program.
The master programs of the university have the following credit distribution:
Every master’s program has a university core that has a single course Digital Access for
Community Empowerment that covers four components:
A. Two credit modules are called Community Empowerment (CE) / Visits. This is a five-day
outbound program where students are exposed to problems facing society and explore
ways to use digital technologies to find solutions. At the end of the program, the
students are expected to work and report their findings through a short dissertation.
B. One credit module is Design Thinking and Innovation (DTI), where students are exposed
to applying innovative thinking in thedigital sciences.
C. One credit module is Digital Transformation of Societal Problems/Social Innovation.
E. The students complete this course through an interdisciplinary group project that covers
all four modules. Each project group has faculty mentors who guide the students. The
academic office allocates the mentors. Faculty members are responsible for mentorship
for at most ten students annually. Each faculty member has a teaching assistant whom
the faculty could select for the day-to-day administration of the mentoring program.
The common courses are limited to the following levels:
Students must comply with the following credit limits for completing a master's program.
A. Ensure completion of at least 70 credits, with a maximum cap of 80.
B. The students are allowed to take a maximum of 20 credits in a semester.
C. The students are allowed to take a maximum of 12 credits through audit courses. These
credits do not count towards the total credits for the program.
D. The students are allowed to obtain a maximum of 12 credits through challenge exams.
These credits count towards the total credits for the program.
Pass Criteria
Semester 1
Credit Split
Course
Title of the Course Credits Lecture/Lab/ Level
Code
Seminar/Project
M4010000 Digital Access for Community Empowerment I 3 400
M3010002/ AI and Machine Learning/ Introduction to Cyber
4 3-1-0-0 300
M3010009 Security
M3010003 Advanced Data Structures and Algorithms 3 2-1-0-0 300
Open Elective 3 or 4
M2010000 Mathematics for Computer Science 3 3-0-0-0 200
M2010001 Python Programming 2 0-2-0-0 200
Activity 1
Total Credits 19
Semester 2
Credit Split
Course
Title of the Course Credits Lecture/Lab/ Level
Code
Seminar/Project
M4010001 Digital Access for Community Empowerment II 2 400
M3010004/
Advanced Distributed Systems/Data and Intelligence 3 3-0-0-0 300
M3010005
Program/Open Elective 12 300/400
Activity 2
Total Credits 19
Semester 3
Credit Split
Course
Title of the Course Credits Lecture/Lab/ Level
Code
Seminar/Project
Program/Open Elective 15 300/400
Activity 2
Total Credits 17
Semester 4
Credit Split
Course Lecture/Lab/
Title of the Course Credits Level
Code Seminar/
Project
M4010002 Thesis 15 0-0-0-15 400
Total Credits 15
Semester 1
Credit Split
Course Code Title of the Course Credits Lecture/Lab/ Level
Seminar/Project
M4020000 Digital Access for Community Empowerment I 3 400
M3020002/ AI and Machine Learning/Introduction to Cyber 4 3-1-0-0 300
M3020009 Security
M3020003/ Advanced Data Structures and Algorithms/Data 3 2-1-0-0 300
M3020006 Structures and Algorithms
M3020008 Database Systems 3 3-0-0-0 300
M2020000 Mathematics for Computer Science 3 3-0-0-0 200
M2020001 Python Programming 2 0-2-0-0 200
Activity 1
M0000000 Preparatory Mathematics 0
Total Credits 19
Semester 2
Credit Split
Course Code Title of the Course Credits Lecture/Lab/ Level
Seminar/Project
M4020001 Digital Access for Community Empowerment II 2 400
Program / Open Elective 15 300/400
Activity 2
Total Credits 19
Semester 3
Credit Split
Course Code Title of the Course Credits Lecture/Lab/ Level
Seminar/Project
Program / Open Elective 15 300/400
Activity 2
Total Credits 17
Semester 4
Credit Split
Course
Title of the Course Credits Lecture/Lab/ Level
Code
Seminar/Project
M40200002 Project 15 0-0-0-15 400
Total Credits 15
PREPARATORY MATHEMATICS
CO1 3 3 3 0
CO2 3 3 3 2
CO3 3 3 3 2
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus:
Module Content
1 Basic Properties of the integers, divisibility and primality, LCM, GCD, real
numbers, properties of real numbers, Complex numbers, algebra of complex
numbers
2 Sets, Set Operations, Functions, Sequences and Summations, Counting,
Permutation, Combination.
3 Statistical population and sample, Measures of central tendency, Measures of
dispersion, Skewness, Kurtosis.
4 Functions, limits, continuity, derivatives, Product, quotient, and chain rules.
Text Books
1. K. Rosen, Discrete Mathematics and its Applications, 7th ed., McGraw-Hill Education,
2017.
2. G. B. Thomas and R. L. Finney, Calculus and Analytic Geometry, 9th ed. India: Pearson
Education, 2010.
3. D. Freedman, R. Purves, and R. Pisani, Statistics, Viva Books, 4th ed., 2011.
4. T. Koshy, Elementary Number Theory with Applications, Academic Press, Elsevier,
2002.
TECHNICAL COMMUNICATION
Course Code Course Name Credit Split Year of
Lecture/Lab/Seminar/Project Introduction
M1010000/ Technical Communication 1-1-0-0 2023
M1020000
Prerequisites: Basic English, Grammar rules.
Course Objectives:
1. Get the fundamental knowledge of technical communication
2. Write technical documents in proper format and structure
3. Communicate effectively in a professional context, using appropriate rhetorical
approaches
4. Adapt content and rhetorical strategies according to the audience and purpose of each
document
5. Create and deliver technical briefings tailored to specific audiences, purposes, and media.
Course Outcomes: After completion of this course, the students will be able to:
CO1: Understand the nature, objective, and importance of Technical Communication.
C02: Do the technical write-ups.
CO3: Boost their confidence in public speaking
C04: Do presentations in front of a diverse audience.
CO5: Become efficient communicators by learning the voice-dynamics.
Program Learning Outcomes:
PLO 1 Develop strong fundamental disciplinary knowledge
PLO 2 Demonstrate research skills that are of an experimental, computational, or theoretical
nature
PLO 3 Apply for a scholarship to conduct independent and innovative research
PLO 4 Show communication skills in various formats (oral, written) and to expert and non-
expert audiences;
PLO 5 Practice ethical standards of professional conduct and research;
PLO 6 Acquire professional skills such as collaborative skills, ability to write grants,
entrepreneurial skills, and writing articles for scholarly journals if it is taught by faculty in the
school.
Mapping of course outcomes with program learning outcomes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 3 1 2 1 3
CO2 2 1 3 1 3
CO3 3 3
CO4 2 3 2
CO5 2 2 2
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
1 Fundamentals of Technical Communication:
Features of technical communication, The distinction between General and
Technical Communication, Language as a tool of Communication, Dynamics of
Communication: Definition and process, Kinesics, Proxemics, Paralinguistic
features, Importance of Interpersonal and Intercultural Communication in
today’s organization, The flow of Communication: Downward; upward, Lateral or
Horizontal, Barriers to Communication, Code and Content, Stimulus and
Response, Encoding process, Decoding process, Professional Personality
Attributes
2 Forms of Technical Writing
Synopsis writing, Technical Report, Thesis/ Project writing, Technical research
Paper writing, Seminar and Conference paper writing, Expert Technical Lecture, 7
Cs of effective business writing: concreteness, completeness, clarity, conciseness,
courtesy, correctness, consideration, C.V./Resume writing, Technical Proposal,
Email writing, Agenda of meeting, Minutes of meeting
3 Voice Dynamics and Oral Communication
Pronunciation Etiquette; Syllables; Vowel sounds; Consonant sounds; Tone:
Rising tone; Falling Tone; Flow in Speaking, Speaking with a purpose, Speech and
personality, Professional Personality Attributes: Empathy; Considerateness;
Leadership; Competence. Public speaking, Overcoming Stage Fear: Confident
speaking; Audience Analysis and retention of audience interest, Presentation
strategies, Interview skills, Negotiation skills Critical and Creative thinking in
communication.
4 Technical Presentation: Case Studies Using Learnt Strategies and Techniques
Presentation Skills for Technical Paper/Project Reports/ Professional Reports
based on proper Stress and Intonation Mechanics, Comprehension Skills based
on Reading and Listening Practicals on a model AudioVisual Usage, Role Play,
Group Discussion, Extempore, Mock Interview, Conducting meetings and minutes
of meeting.
Text Books
1. M. Raman and S. Sharma, Technical Communication – Principles and Practices, Oxford
Univ. Press, 2007.
2. R.C. Sharma and K. Mohan, Business Correspondence and Report Writing, McGraw-
Hill, 2001.
3. L. U. B. Pandey, Practical Communication: Process and Practice, India: A.I.T.B.S.
Publications, 2014.
4. T. A. Sherman et al., Modern Technical Writing, Apprentice Hall, 2015.
5. S.D. Sharma, A Text Book of Scientific and Technical Writing, Vikas Publication, 2008.
6. M. Murphy, Skills for Effective Business Communication, Harvard University, 2014.
7. P. Mehra, Business Communication for Managers, Pearson Publication, 2011.
CO1: Understand the mathematical foundations of the theory, problem, and state-of-the- art
solutions.
CO2: Analyze and evaluate critically the building and integration of mathematical
foundations.
CO3: Design and demonstrate mathematical foundations through team research projects and
project report presentations.
Program Learning Outcomes:
PLO 1 Develop strong fundamental disciplinary knowledge.
PLO 2 Demonstrate research skills that are of an experimental, computational, or theoretical
nature.
PLO 3 Apply for a scholarship to conduct independent and innovative research.
PLO 4 Show communication skills in various formats (oral, written) and to expert and non-
expert audiences.
PLO 5 Practice ethical standards of professional conduct and research.
PLO 6 Acquire professional skills such as collaborative skills, ability to write grants,
entrepreneurial skills, and writing articles for scholarly journals if it is taught by faculty in the
School.
Mapping of course outcomes with program learning outcomes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 3 2 3 2
CO2 3 3 3 2
CO3 2 3 3 2
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
1 Introduction to Probability Theory - sample space - events - Algebra of sets-
Notion and Axioms of probability-Equally likely events - Conditional probability-
independent events. Bayes’ theorem.
2 Axiomatic definition of Probability - Probability spaces- Random variables- PMF
and PDF - Discrete and Continuous distributions. Joint, probability mass
function, Marginal distribution function, Joint density function. Popular
distributions- binomial, Bernoulli, Poisson, exponential, Gaussian.
3 Fundamental concepts in statistics- Measures of location and variability-
Population, sample, parameters. Sampling and Testing of Hypothesis:
Introduction to testing of hypothesis - Tests of significance for large samples –
t, F and Chi-square tests; ANOVA - one-way and two-way classifications.
Correlation and Regression.
4 Scalar, Vectors, Vector addition and scalar multiplication, i, j, k notation, inner
product, lines and hyperplanes, Vector spaces, Bases, Dimension, Linear
transformations - The matrix representation – Change of basis – Rank and
Nullity – Row and Column space of a matrix -System of linear equations. Inner
product spaces – Cauchy Schwarz inequality- Gram Schmidt Orthogonalization
– Normed linear spaces.
Text Books
1. H.P. Hsu, Theory and Problems of Probability, Random Variables, and Random
Processes, McGraw-Hill, 2014.
2. S. M. Ross, Introduction to Probability Models, 11th ed., Academic Press, 2014.
3. S. Lipschutz, Schaum's Outline of Theory and Problems of Linear Algebra, New York:
McGraw-Hill, 1968.
4. G. Strang, Linear Algebra and its Applications, 4th ed. India: Cengage Learning, 2005.
5. C. D. Meyer, Matrix Analysis and Applied Linear Algebra, Siam, 2000.
6. P. J. Olver and C. Shakiban, Applied Linear Algebra, Prentice Hall, 2006.
7. E. J. Dudewicz and S. N. Mishra, Modern Mathematical Statistics, International
Edition, Wiley, 1988.
8. R. V. Hogg, J. W. McKean, and Allen T. Craig, Introduction to Mathematical Statistics,
7th ed. Asia: Pearson Education, 2014.
References
1. W. Feller, An Introduction to Probability Theory and its Applications, John Wiley and
Sons, 2008.
2. D. S. Bernstein, Matrix Mathematics: Theory, Facts, and Formulas with Application to
Linear Systems Theory, Princeton University Press, 2005.
PYTHON PROGRAMMING
Course Code Course Name Credit Split Year of
Lecture/Lab/Seminar/Project Introduction
M2010001/ Python Programming 0-2-0-0 2024
M2020001
Prerequisites: Nil
Course Objectives:
1. To help students learn problem-solving techniques.
2. To help students understand the fundamental concepts of programming using the Python
programming language and introduce the basic concepts of Object-Oriented programming in
Python.
3. To introduce students to database concepts and simple data science tools.
4. To help students build practical skills for solving problems computationally.
Course Outcomes: After completion of this course, the students will be able to:
CO1: Explain the basic concepts of computational problem solving, procedural and object-
oriented programming paradigms, and database programming.
CO2: Use algorithms and flowcharts to lay out the procedure to solve a problem.
CO3: Explain the basics of Python, such as variables, data types, control structures, functions,
and files, and apply Python knowledge to solve computational problems.
CO4: Explain coding and analyzing data with Python using tools like Pandas, NumPy, and
Matplotlib and understand the basics of cybersecurity data analytics.
Program Learning Outcomes:
PLO 1 Develop strong fundamental disciplinary knowledge
PLO 2 Demonstrate research skills that are of an experimental, computational, or theoretical
nature
PLO 3 Apply for a scholarship to conduct independent and innovative research
PLO 4 Show communication skills in various formats (oral, written) and to expert and non-
expert audiences;
PLO 5 Practice ethical standards of professional conduct and research;
PLO 6 Acquire professional skills such as collaborative skills, ability to write grants,
entrepreneurial skills, and writing articles for scholarly journals if it is taught by faculty in the
school.
Mapping of course outcomes with program learning outcomes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 3
CO2 3 1
CO3 3
CO4 3 2 1
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus:
Module Content
1 Computational Problem Solving. Algorithms and Flowcharts, Introduction to
Computer Programming. Programming Paradigms and Programming
Languages. Introduction to Object Oriented Programming. Introduction to
Database Programming and Scripting. Software Development Process.
Programming Code of Ethics. Introduction to Python. Real-world Applications
of Python. Features of Python Programming Language. Implementations of
Python. Python Career Opportunities.
2 Python Data Types, Variables, Basic Input-Output Operations, Basic
Operators. Boolean Values, Conditional Execution, Loops, Lists and List
Processing, Logical and Bitwise Operations. Functions, Tuples, Dictionaries,
and Data Processing. Modules, Packages, String and List Methods, and
Exceptions.
3 The Object-Oriented Approach: Classes, Methods, Objects, and Exception
Handling. A brief introduction to OO Design. File Handling in Python.
Introduction to Data Science. Tools for Data Science (GitHub, Jupyter
Notebooks). Database Concepts and SQL. SQL using Python.
4 Data Handling using NumPy and Pandas. Data Visualization in Python. Simple
projects. Case studies.
Lab Exercises
Module 1
1. Problems on number systems and data encoding.
2. Writing simple algorithms and flowcharts.
3. Writing advanced algorithms and flowcharts, installing and running Python.
4. Writing simple programs (e.g. Drake equation) to familiarize with variables, keywords,
operators, expressions, data types and operator precedence. The print() function,
type conversion, formatting numbers and strings.
Module 2
5. Conditional statements, writing simple scripts, using comments for program
readability.
6. Loops, nested loops, break and continue statements (e.g. Prime number, Fibonacci
series, Factorial, Armstrong number, Palindrome)
7. Built-in data structures and their applications - Lists, Tuples, Sets and Dictionaries,
Range function, Functions such as zip() and enumerate().
8. More coding exercises using lists (e.g. Merging sorted lists), tuples, sets, dictionaries.
Module 3
9. Defining and calling functions: Passing arguments and returning values (e.g. Pascal’s
triangle.), scope, local functions, Lambda functions, function redefinition, standard
library modules.
10. File and exception handling.
11. Coding exercises to practice Object Oriented Programming.
Module 4
12. Data Handling using NumPy and Pandas.
13. Python and SQL
14. Data Visualization in Python
Text Books
1. C. Dierbach, Introduction to Computer Science Using Python: A Computational
Problem-Solving Focus, Wiley, 2017.
2. A. N. Kamthane and A. A. Kamthane, Programming and Problem Solving with Python,
McGraw-Hill Education, 2018.
3. S. F. Lott, Object Oriented Python, Packt Publishing, 2014.
4. W. McKinney, Python for Data Analysis: Data Wrangling with Pandas, NumPy, and
IPython, O'Reilly, 2012.
References
1. R. Thareja, Python Programming Using Problem Solving Approach, Oxford Higher
Education, 2017.
2. B. N. Miller and D. L. Ranum, Problem Solving with Algorithms and Data Structures
Using Python, Franklin, Beedle and Associates, 2011.
3. D. D. Riley and K. A. Hunt, Computational Thinking for the Modern Problem Solver,
CRC Press, 2014.
4. J. VanderPlas, Python Data Science Handbook: Essential Tools for Working with Data,
O'Reilly, 2016.
5. F. Nelli, Python Data Analytics: With Pandas, NumPy, and Matplotlib, 2nd ed., Apress,
2018.
DIGITAL ACCESS FOR COMMUNITY EMPOWERMENT I
CO1 3 2 3 2
CO2 3 3 3 2
CO3 2 3 3 2
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
1 Concepts of multiple random variables. Bayesian belief networks (BBN):
Representation, Independence and conditional independence, Partial
independence and other structure. Exact inference in BBN: Variable
elimination, Pearl's algorithm, Junction tree, Recursive decomposition, Using
additional structure.
2 Approximate inference: Monte Carlo approximations, Loopy belief
propagation, Variational methods. Learning of BBNs: learning parameters,
learning structure, Bayesian averaging, EM (learning with hidden variables and
missing values), structural EM.
3 Dynamic belief networks: Particle filtering. Markov random fields (Markov
networks): Representation (potentials), Independence and conditional
independence, Trees, Boltzman machines, Conditional Markov random fields.
4 Inference in Markov networks. Learning Markov networks: Iterative
proportional fitting, Cluster variational methods, Other approximations.
Relational graphical models.
Text Books
1. D. Koller and N. Friedman, Probabilistic Graphical Models: Principles and Techniques,
MIT Press, 2009.
2. D. Barber, Bayesian Reasoning and Machine Learning, Cambridge University Press,
2012.
3. D. J. C. Mackay, Information Theory, Inference, and Learning Algorithms, UK: Cam-
bridge University Press, 2003
4. J. Pearl, Probabilistic Reasoning in Intelligent Systems, Morgan Kaufman, 1997.
ROBOTICS
Course Code Course Name Credit Split Year of
Lecture/Lab/Seminar/Project Introduction
M3010001/ Robotics 2-1-0-0 2024
M3020001
Prerequisites: Prior knowledge of undergraduate level Mathematics, Programming
Course Objectives:
1. To impart a comprehensive and in-depth understanding of Robotics, technologies and
applications to students by introducing and researching cutting-edge topics, technologies,
applications and implementations.
2. To expose the students to frontier areas of Robotics while providing sufficient foundations
for further study and research.
Course Outcomes: After completion of this course, the students would be able to:
CO1: Understand the foundations of robotics, concepts, and issues related to mechanics,
planning and control by completing homework, quizzes, and examinations.
CO2: Prepare students for an industrial automation environment by completing robotics
projects.
CO3: Expose students to current literature in robotics.
CO4: Complete a term project, including independent research, oral presentation, and
programming on the latest advancement in robotics.
Program Learning Outcomes:
PLO 1 Develop strong fundamental disciplinary knowledge
PLO 2 Demonstrate research skills that are of an experimental, computational, or theoretical
nature
PLO 3 Apply for a scholarship to conduct independent and innovative research
PLO 4 Show communication skills in various formats (oral, written) and to expert and non-
expert audiences;
PLO 5 Practice ethical standards of professional conduct and research;
PLO 6 Acquire professional skills such as collaborative skills, ability to write grants,
entrepreneurial skills, and writing articles for scholarly journals if it is taught by faculty in the
school.
Mapping of course outcomes with program learning outcomes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 3 2 1 2
CO2 3 2 2 2
CO3 2 2 2 2
CO4 2 2 2 3 3 1
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus:
Module Content
1 Introduction to the subject, automation, Industrial robots, Serial, parallel
robots, configuration space, rigid body motion, kinematics, Inverse and
forward kinematics, dynamics, trajectory planning, Applications. Configuration
space: degrees of freedom (dof), robot joints, Grubler, s formula, Open and
close chains, configuration space and its representation. Configuration and
velocity constraints, taskspace and workspace
2 Rigid body motion: rigid body motion in plane, mathematical description of
position and orientation, rotation and angular velocities, changing the
coordinate frames, representations of rotation, homogenous transformation
matrix, rotating and translating a vector or frame, twists, wrenches. Forward
Kinematics: DH parameters, examples of DH parameters, product of
exponential formulas,
3
Velocity, kinematics and statics: Jacobian, space jacobian, body jacobian,
singularity analysis, manipulability, Inverse kinematics: Analytical and
numerical inverse kinematics, kinematics of closed chains (parallel robots),
Stewart-Gaugh platform. Manipulator dynamics: Acceleration of rigid body,
mass distribution, Newton’s equation, Example of close form dynamic
equations, Lagrangian formulation of manipulator dynamics.
Lab/Assignment
A case study presentation and discussion (by a group of three)
Text Books
1. F. Provost and T. Fawcett, Data Science for Business, Shroff Publishers and
Distributors, 2014.
2. D. T. Larose and C. D. Larose, Data Mining and Predictive Analytics, John Wiley
and Sons, 2016.
References
1. T. Erl et al., Big Data Fundamentals: Concepts, Drivers and Techniques, India:
Pearson Education, 2016.
2. S. Stephens-Davidowitz, Everybody Lies: Big Data, New Data, and What the
Internet Can Tell Us About Who We Really Are, Harper Luxe, 2017.
CLOUD SECURITY
CO1 3 2 1 2
CO2 3 2 1 2
CO3 3 3 2 2 1 1
CO4 3 3 2 2 1 1
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus:
Module Content
1 Cloud Computing Security Concerns, Risk issues and Legal Aspects:
Virtualization, Provisioning, Storage, Operation, Security and Networking – Risk
Tolerance – Legal and Regulatory Issues. Key Strategies and Best Practices.
2 Cloud Architecture security – Security Requirements, Security Patterns and
Architectural elements, Cloud Security Architecture
Cloud Data security – Overview – Data Encryption – Sensitive Data
Categorization – Cloud Data Storage – Cloud Lock in
3 Amazon AWS Monitoring & Auditing: AWS Monitoring Introduction, Cloud
watch metrics – Cloud watch Logs, Live Tail, Agents -Cloud watch Alarms, Even
Bridge – Cloud Trail – AWS Config
4 AWS Security – Introduction, Encryption, KMS, Multi-Region Keys, S3
Replication with encryption, Encrypted AMI Sharing process, SSM Parameter
Store, AWS secrets Manager, AWS certificate Manager, Web Application
Firewall, Shield – DDoS protection, Amazon Guard Duty, Amazon Inspector,
Amazon Macie
Text Books
1. J.R. Winkler, Securing the Cloud: Cloud Computer Security Techniques and Tactics, 1st ed.,
Elsevier, 2011.
2. T. Mather, S. Kumaraswamy, and S. Latif, Cloud Security and Privacy, 1st ed., O’Reilly, 2009.
References
1. J. R. Vacca, Cloud Computing Security Foundations and Challenges, CRC Press, 2017.
DATABASE SYSTEMS
Course Code Course Name Credit Split Year of
Lecture/Lab/Seminar/Project Introduction
M3020008 Database Systems 3-0-0-0 2023
Prerequisites: Nil
Course Objectives:
1. To provide students with a good understanding of fundamental principles of Database
Management Systems (DBMS) with a particular focus on relational databases.
2. To help the students develop the ability to manage the data efficiently by identifying
suitable structures to maintain organizations' data assets and develop systems that utilize
database technologies.
Course Outcomes: After completion of this course, the students will be able to,
CO1: Understand the fundamental nature and characteristics of database systems.
CO2: Model real-world scenarios given as informal descriptions, using Entity Relationship
diagrams.
CO3: Model and design solutions for efficiently representing and querying data using a
relational model.
CO4: Discuss and compare the aspects of Concurrency Control and Recovery in Database
Systems.
CO5: Explain various types of NoSQL databases.
Program Learning Outcomes:
PLO 1 Develop strong fundamental disciplinary knowledge.
PLO 2 Demonstrate research skills that are of an experimental, computational, or theoretical
nature.
PLO 3 Apply for a scholarship to conduct independent and innovative research.
PLO 4 Show communication skills in various formats (oral, written) and to expert and non-
expert audiences.
PLO 5 Practice ethical standards of professional conduct and research.
PLO 6 Acquire professional skills such as collaborative skills, ability to write grants,
entrepreneurial skills, and writing articles for scholarly journals if it is taught by faculty in the
school.
Mapping of course outcomes with program learning outcomes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 3 2 2 2
CO2 3 2 2 2
CO3 3 2 2 2
CO4 3 2 2 2
CO5 3 2 2 2
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
1 Introduction to Database Management Systems: Basic Concepts, History of
DBMS, Comparison with File-based systems, DBMS Facilities, DBMS Users,
DBMS Three Schema Architecture, Abstraction and Data Independence, DBMS
Components, Data Modeling: E-R Modeling, Relational Model: Concepts,
Tables, Keys, Data Integrity and Constraints, Database Normalization: Purpose,
1NF, Functional Dependency (FD), 2NF, 3NF, BCNF, Multi-valued Dependency
(MVD), 4NF, Join Dependency (JD), 5NF.
2 Introduction to Relational Algebra, Introduction to SQL: SQL Features, SQL
Operators, SQL data types, SQL Parsing and Execution, Types of SQL Commands
– DDL, DML, TCL, Querying Data from the database – Basic Queries, Correlated
Sub-queries, Joins, Nested Queries, Aggregation and grouping, Built-in
Functions, Views, Functions, Stored Procedures and Triggers.
3 Introduction to Transaction Processing: ACID Properties of Transactions,
Concepts of Concurrency Control and Recovery, Transaction States, System
Log, Concurrency Control Techniques – Binary Locks, Shared/Exclusive Locks,
Two Phase Locking. Recovery using System Log.
Distributed Databases: Architectures, Data Fragmentation, Replication and
Allocation, Query Processing in Distributed Databases, Commit Protocols,
Concurrency control, Deadlock Handling and Recovery in Distributed Database
Management Systems.
4 Overview, and History of NoSQL. The Emergence of NoSQL, SQL vs. NoSQL,
ACID vs. BASE, CAP Theorem, Types of NoSQL Databases: Key-Value Store,
Document Store, Column Family Store and Graph Database. Examples:
MongoDB, Cassandra, and Neo4j. Replication and Sharding.
Text Books and References
1. R. Elmasri and S. B. Navathe, Fundamentals of Database Systems, Pearson, 2000.
2. A. Silberschatz et al., Database System Concepts, 4th ed., McGraw-Hill, 2002.
3. S. Ceri and G. Pelagatti, Distributed Databases: Principles and Systems, Universities
Press, 2000.
4. A. Meier and M. Kaufmann, SQL and NoSQL Databases: Models, Languages,
Consistency Options and Architectures for Big Data Management, Springer, 2019.
5. P. J. Sadalage and M. Fowler, NoSQL Distilled: A Brief Guide to the Emerging World of
Polyglot Persistence, Addison Wesley Professional, 2012.
6. S. Acharya, Demystifying NoSQL, India: Wiley, 2020.
3 Data Link Layer: Design issues, framing methods, Error Detection and
Correction, PPP, Sliding Window Protocols, Multiple Access Protocols, Address
Resolution, Protocol (ARP), Ethernet, Link Layer Switches, Spanning Tree
Protocol, VLAN
4 Security Attacks, Security Services, Security Mechanisms, Key Management
and Distribution, User Authentication Protocols, SSL, TLS, Wireless Network Sec
urity, Electronic Mail Security, Vulnerability Analysis, Attacks in sensor
and IoT networks, Endpoint Security, familiarization of Network simulators -
NS2/NS3 or Cooja/Contiki and simulation of attacks and analyze network perfor
mance.
Text Books
1. J. Kurose and K. Ross, Computer Networking: A Top-Down Approach, 7th ed., Pearson,
2016.
2. A. S. Tanenbaum, Computer Networks, 5th ed., Pearson, 2013.
3. W. Stallings, Cryptography and Network Security Principles and Practice, Prentice Hall,
1998.
4. V. Tsiatsis et al., Internet of Things: Technologies and Applications for a New Age of
Intelligence, Elsevier Academic press, 2018.
5. Z. Mahmood, Connected Vehicles in the Internet of Things: Concepts, Technologies
and Frameworks for IoT, Springer, 2020.
6. I. F. Akyildiz and M. Can Vuran, Wireless Sensor Networks, Wiley, 2010.
References
1. L. L. Peterson and B. S. Davie, Computer Networks: A Systems Approach, Morgan
Kaufmann, 2011.
2. S. Keshav, An Engineering Approach to Computer Networking, Pearson Education,
2000.
3. S. S. Shinde, Computer Network, New Age International, 2009.
4. P. Raj and A. C. Raman, The Internet of Things: Enabling Technologies, Platforms, and
Use Cases, 1st ed., Auerbach Publications, 2017.
5. A. McEwen, Designing the Internet of Things, Wiley, 2013.
CRYPTOGRAPHY
Credit Split Year of
Course Code Course Name
Lecture/Lab/Seminar/Project Introduction
M3010011/
Cryptography 2-1-0-0 2023
M3020011
Prerequisites: A basic understanding of algebra, linear algebra, modular arithmetic,
probability
Course Objectives:
1. Learn modern cryptographic algorithms, their implementations in contemporary
computing platforms, and security analysis.
2. Analyze countermeasures to thwart implementation-level attacks on cryptographic
operations in hardware and software
3. Identify appropriate cryptographic techniques for real-world applications
Course Outcomes: After completion of this course, the students will be able to:
CO1: Understand the foundations of modern cryptography and its limitations.
CO2: Analyze and evaluate critically various cryptographic schemes and protocols.
CO3: Apply appropriate cryptographic techniques to solve real-world problems in
information security.
Program Learning Outcomes:
PLO 1 Develop strong fundamental disciplinary knowledge
PLO 2 Demonstrate research skills that are of an experimental, computational, or theoretical
nature
PLO 3 Apply for a scholarship to conduct independent and innovative research
PLO 4 Show communication skills in various formats (oral, written) and to expert and non-
expert audiences;
PLO 5 Practice ethical standards of professional conduct and research;
PLO 6 Acquire professional skills such as collaborative skills, ability to write grants,
entrepreneurial skills, and writing articles for scholarly journals if it is taught by faculty in the
school.
Mapping of course outcomes with program learning outcomes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 3 3 2 2 1 2
CO2 3 3 3 2 1 2
CO3 3 3 3 2 3 3
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
1 Basic Properties of the integers, Divisibility and primality, Congruence, Residue
classes, Euler’s phi function, Fermat’s little theorem, Classical cryptosystems
2 Block Ciphers, DES, Triple-DES, AES, Block Cipher Modes, Stream Ciphers, RC4
3 Public-Key Cryptography, Diffie Hellman Key Exchange, RSA, Rabin, ElGamal, ECC,
Lattice Cryptography
4 Hash Functions, SHA-1, SHA3, MAC, HMAC, Digital Signatures, RSA, El Gamal, DSA,
ECDSA
Text Books
1. W. Stallings, Cryptography and Network Security: Principles and Practice, Pearson,
1998
2. N. Koblitz, A Course in Number Theory and Cryptography, 2nd ed., Springer, 1994
3. J.P. Aumasson, Serious Cryptography: A Practical Introduction to Modern Encryption,
No Starch Press, 2017
4. D. R. Stinson, Cryptography: Theory and Practice, Chapman and Hall/CRC, 2018
References
1. R. Anderson, Security Engineering: A Guide to Building Dependable Distributed
Systems, Wiley, 2020
2. T. R. Shemanske, A Beginner's Guide, Modern Cryptography and Elliptic Curves,
American Mathematical Society, 2017
CYBER ANALYTICS
Course Code Course Name Credit Split Year of
Lecture/Lab/Seminar/Project Introduction
M3010012/ Cyber Analytics 2-1-0-0 2023
M3020012
Prerequisites: Nil
Course Objectives:
1. To Introduce various supervises, unsupervised and reinforcement learning algorithms.
2. To enable the students to apply ML techniques to analyze cyber data.
3. To enable the students to perform cyber threat detection, risk estimation, vulnerability
detection, and cyber-attack detection.
4. To make the students design ML-based cyber security solutions.
Course Outcomes: After completion of this course, the students will be able to,
CO1: Demonstrate a comprehensive understanding of the concepts and importance of
cybersecurity analytics in modern cyber defense.
CO2: Apply various data collection and preprocessing techniques to extract valuable insights
from cybersecurity data.
CO3: Utilize data analysis techniques and machine learning algorithms for effective threat
detection and categorization.
CO4: Employ artificial intelligence approaches, including deep learning, natural language
processing, and generative models, for analyzing complex cybersecurity challenges.
CO5: Utilize a comprehensive data engineering and machine learning tool/platform to
explore advanced techniques in cybersecurity analytics, including deep learning and GPT.
Module Content
1 Ethical Hacking Fundamentals and Information Security Threats
Understanding Ethical Hacking: Principles, Importance, and Legal Aspects, Basics
of Cybersecurity: Threats, Attacks, and Defense Mechanisms, Information
Security Laws, Standards, and Regulatory Compliance, Footprinting and
Reconnaissance: Gathering Information for Assessments, Network Scanning and
Enumeration: Identifying Targets and Services, Vulnerability Assessment and
Analysis: Identifying Weaknesses, Developing Comprehensive Vulnerability
Assessment Reports
2 Password Cracking and Social Engineering Techniques
Password Cracking Techniques: Brute Force Attack, Dictionary or Word List
Attack and Rainbow Table Attack, Password Cracking Tools and
Countermeasures; Strengthening Authentication: Multi-Factor Authentication
(MFA), Social Engineering Concepts and Techniques, Countermeasures to Social
Engineering and Identity Theft, Insider Threats and Countermeasures
Hands-on Password Cracking and Social Engineering Simulations
3 Network and Web Application Attacks
Network Level Attacks: DoS, DDoS, Session Hijacking, and Mitigation, Hacking
Web Applications: Common Vulnerabilities and Attack Surfaces, OWASP Top 10:
Understanding and Mitigating Web App Threats, Countermeasures to Web App
Attacks: Security Best Practices, Network Intrusion Detection and Prevention
Systems (IDS/IPS), Firewalls and Network Infra Devices: Concepts and
Configurations, Practical Penetration Testing: Network and Web Application
Targets
4 Wireless, Mobile, and Cloud Security Assessment
Wireless Network Security: Threats, Attacks, and Mitigation, Hacking Wireless
Networks: Techniques and Countermeasures, Mobile Device Security:
Vulnerabilities and Exploits, Assessing Mobile Apps: Identifying Security Flaws,
Cloud Computing Security: Risks, Benefits, and Best Practices, IoT and OT
Security: Attacks and Countermeasures
Hands-on Wireless Hacking, Mobile Exploitation, and Cloud Assessment
Text Books
1. M. Walker, Certified Ethical Hacker All-in-One Exam Guide, 4th ed., McGraw-Hill
Education, 2020.
2. J. Erickson, Hacking: The Art of Exploitation, 2nd ed., No Starch Press, 2021.
3. W. Stallings, Network Security Essentials: Applications and Standards, 7th ed.,
Pearson, 2021.
4. P. L. Wylie, The Pentester Blue Print, Wiley Publication, 2021.
References
1. P. Kim, The Hacker Playbook 2: Practical Guide to Penetration Testing, Createspace
Independent Publishing, 2015
2. M. T. Simpson, Hands-On Ethical Hacking and Network Defense, 2nd ed., Cengage
Learning, 2012.
3. M. Meucci and A. Muller, Owasp Testing Guide v. 4.0, Open Web Application Security
Project, 2014.
4. D. Kennedy et al., Metasploit: The Penetration Tester's Guide, 4th ed., No Starch
Press, 2018.
DIGITAL FORENSICS
Credit Split
Course Code Course Name Year of Introduction
Lecture/Lab/Seminar/Project
M3010015/
Digital Forensics 2-1-0-0 2023
M3020015
Prerequisites: Nil
Course Objectives:
1. Familiarize students with cybercrimes and cyber security
2. Understand various techniques of cyber-attacks and defenses
3. Perform digital forensic investigations
Course Outcomes: After completion of this course, the students will be able to:
CO1 Understand the foundational concepts of digital forensics, including the investigation
process and roles of forensic investigators.
CO2 Analyze different types of storage media and demonstrate proficiency in data acquisition
and duplication.
CO3 Conduct a thorough analysis of operating systems, including memory forensics and file
system examination.
CO4 Apply network forensics techniques to capture, analyze, and interpret network traffic.
CO5 Develop the skills to collaborate with legal professionals, prepare comprehensive
reports, and adhere to ethical considerations in digital investigations.
Program Learning Outcomes:
PLO 1 Develop strong fundamental disciplinary knowledge
PLO 2 Demonstrate research skills that are of an experimental, computational, or theoretical
nature
PLO 3 Apply for a scholarship to conduct independent and innovative research
PLO 4 Show communication skills in various formats (oral, written) and to expert and non-
expert audiences;
PLO 5 Practice ethical standards of professional conduct and research;
PLO 6 Acquire professional skills such as collaborative skills, ability to write grants,
entrepreneurial skills, and writing articles for scholarly journals if it is taught by faculty in the
school.
Mapping of course outcomes with program learning outcomes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 3 3 2
CO2 3 3 3 1 3
CO3 3 3 3 3
CO4 3 3
CO5 2 3 3 3
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
Foundations of Digital Forensics
Fundamentals of Computer Forensics, Digital Evidence and Forensic Readiness,
Roles and Responsibilities of a Forensic Investigator, Digital Forensics
Investigation Process, Importance of Digital Forensics, Investigative Phases: Pre-
investigation, Investigation, Post-investigation; Chain of Custody and Digital
1
Evidence Handling, Steps of a Digital Forensic Investigation: Identification,
Collection, Analysis, Reporting; Technology and Law: Digital Evidence in the
Courtroom, Legal and Ethical Considerations in Digital Investigations,
Collaboration with Law Enforcement and Legal Professionals, Report Preparation
and Effective Communication.
Storage Media Analysis
Characteristics of Different Disk Drive Types, Logical Structure of Disk Drives,
Booting Process of Windows, Linux, and Mac Operating Systems; File Systems of
2
Windows, Linux, and Mac Operating Systems; File System Examination
Techniques, Data Acquisition and Duplication Fundamentals, Data Acquisition
Formats and Methodologies.
Operating System Forensics
Volatile and Non-Volatile Information, Windows Memory forensic, Registry
Analysis,
Analysis of Cache, Cookie, and History Recorded in Web Browsers Windows Files
3
and Metadata analysis. Hibernation File Analysis, Crash Dump Analysis, File
System Analysis.
Linux and Mac Forensics: Volatile and Non-Volatile Data in Linux, Analyze
Filesystem Images Using Sleuth Kit, Memory Forensics, Mac Forensics.
4 Network and Mobile Forensics
Fundamentals of Network Forensics, Understanding Protocols Using Wireshark,
Packet Capturing with Wireshark, tshark, and tcpdump, Packet Filtering and Data
Extraction from PCAP Files, Analysis of Network Logs: Apache, IIS, and System
Logs, Event Correlation: Concepts and Types, Identifying Indicators of
Compromise (IoCs) from Network Logs, Investigating Network Traffic and
Identifying Network-Based Attacks, Intrusion Detection and Identification of
Network-Based Attacks.
Mobile Forensics: Data Extraction Techniques, Analysis of Mobile Data - Call Logs,
Messages, emails, Images, Videos, and App Data; Mobile App and Social Media
Forensic.
Text Books
1. B. Nelson et al., Guide to Computer Forensics and Investigations, 6th ed., 2020.
2. J. Sammons, The Basics of Digital Forensics: The Primer for Getting Started in Digital F
orensics, Elsevier, 2014.
3. A. M. Marshall, Digital Forensics: Digital Evidence in Criminal Investigation, John –
Wiley and Sons, 2008.
4. N. Reddy, Practical Cyber Forensics: An Incident-Based Approach to Forensic
Investigations, 1st ed. New York: Apress, 2019.
5. L. E. Daniel and P. R. Johnson, Digital Forensics for Legal Professionals: Understanding
Digital Evidence from the Warrant to the Courtroom, Syngress, 2012.
References
1. T. J. Holt et al., Cybercrime and Digital Forensics: An Introduction, 2nd ed., Routledge,
2017.
2. S. Widup and J. Sammons, Computer Forensics and Digital Investigation with EnCase
Forensic, Syngress, 2014.
3. M. H. Ligh et al., The Art of Memory Forensics: Detecting Malware and Threats in
Windows, Linux, and Mac Memory, Wiley, 2014.
4. EC-Council, Computer Forensics: Investigating Network Intrusions and Cyber Crime, EC
Council Press Series: Computer Forensics, 2016.
DATABASE SECURITY
Course Code Course Name Credit Split Year of
Lecture/Lab/Seminar/Project Introduction
M3010016/ Database Security 2-1-0-0 2023
M3020016
Prerequisites: Nil
Course Objectives:
1. To teach different types of databases.
2. To teach the security aspects of databases
3. To perform data auditing
Course Outcomes: After completion of this course, the students will be able to:
CO1: Discriminate between different Types of Databases
CO2: Develop and design Entity Relationship Models
CO3: Summarize concepts related to applications of SQL
CO4: Identify differential attributes of Structured Data, Unstructured Data and Semi-
Structured Data
CO5: Apply principles of Database Security for efficient Data auditing.
Program Learning Outcomes:
PLO 1 Develop strong fundamental disciplinary knowledge
PLO 2 Demonstrate research skills that are of an experimental, computational, or theoretical
nature
PLO 3 Apply for a scholarship to conduct independent and innovative research
PLO 4 Show communication skills in various formats (oral, written) and to expert and non-
expert audiences;
PLO 5 Practice ethical standards of professional conduct and research;
PLO 6 Acquire professional skills such as collaborative skills, ability to write grants,
entrepreneurial skills, and writing articles for scholarly journals if it is taught by faculty in the
School.
Mapping of course outcomes with program learning outcomes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 3 2 3 2
CO2 3 3 3 2
CO3 2 3 3 2
C04 2 1
C05 2 1
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
1 Different Types of Databases, Entity Relationship Models, Relational Models,
Relational Algebra, Calculus, ACID Properties, Relational Databases, Concurrency
Control, Process of Database Design, Dependencies and Normalization for
Relational Databases, Object-oriented/Object-Relational Models, Threats to the
Database, Principles of Database Security, Levels of Database Security, Database
Security Issues.
2 Introduction to SQL, SQL Features, SQL Operators, SQL Datatypes, SQL Parsing,
Types of SQL Commands, Advanced Study of Structured Query Language,
Querying Data from the database, Correlated Sub-queries, Joins, Hierarchical
Queries, Bind Variables, Cursors, Functions, Stored Procedures,
MySQL, Basics of New SQL Databases, SQL Injection and Mitigation.
3 Structured Data, Unstructured Data, Semi-Structured Data, Limitations of
Traditional RDBMSs, SQL and Structured Data, SQL and Semi-Structured Data,
SQL and Unstructured Data, The Emergence of NoSQL, NoSQL Database features,
Types of NoSQL Databases, Search Engine Databases, Basics of MongoDB and
Neo4j, Data Auditing, Statistical Database Security, Semantic Integrity Control,
Privilege Analysis, Virtual Private Database (VPD), Data Redaction, Sensitive Data
Protection.
4 Authentication and Authorization in DBMS, Properties and Basic Principles of
Access Control Mechanisms, Views for Access Control, Classical Database Access
Control: Discretionary Access Control, Role-Based Access Control and Mandatory
Access Control; Access Control in Open Environments such as Attribute Based
Encryption and Identity Based Encryption, Access Control in SQL, Network Data
Encryption, Strong Authentication, Private Data Aggregation, Search in Encrypted
Data : Searchable Encryption Overview, Selected Schemes on Searchable
Encryption.
Text Books
1. A. Silberschatz et al., Database System Concepts, 6th ed., McGraw-Hill, 2011.
2. A. Meier and M. Kaufmann, SQL and NoSQL Databases: Models, Languages,
Consistency Options and Architectures for Big Data Management, Springer, 2019.
3. G. Harrison, Next Generation Databases: NoSQL, NewSQL, and Big Data, Apress, 2015.
4. R. Elmasri and S. B. Navathe, Fundamentals of Database Systems, 6th ed., Pearson
Education, 2011.
5. R. B. Vatan, Implementing Database Security and Auditing, Digital Press, 1st ed., 2005.
References
1. C. J. Date et al., An Introduction to Database Systems, 8th ed., Pearson Education, 2006.
2. R. Elmasri and S. Navathe, Fundamentals of Database Systems, Pearson, 2000.
3. G. K. Gupta, Database Management Systems, McGraw-Hill, 2011.
4. J. Hellerstein and M. Stonebraker, Readings in Database Systems (The Red Book), 4th ed.,
MIT Press, 2005.
5. J. L. Harrington, Object Oriented Database Design Clearly Explained, Harcourt, 2000.
6. R. Ramakrishnan, Database Management Systems, 4th ed., McGraw-Hill, 2015.
7. R. Ramakrishan and J. Gehrke, Database Management Systems, 3rd ed. McGraw-Hill,
2002.
8. S. Ceri and G. Pelagatti, Distributed Databases: Principles and Systems, Universities Press,
2000.
9. V. Atluri and P. Samarati, Security of Data and Transaction Processing, Springer, 2000.
HARDWARE SECURITY
Course Course Name Credit Split Year of
Code Lecture/Lab/Seminar/Project Introduction
M3010018/
Hardware Security 2-1-0-0 2023
M3020018
Prerequisites: Prior knowledge of computer networks, cryptography, sensor networks and
basics of computer hardware.
Course Objectives:
1. Provide knowledge of state-of-the-art security methods and devices.
2. Familiarize the range of hardware-level attack techniques and countermeasures.
3. Make students aware of potential hardware vulnerabilities and provide them with the
knowledge and skills to build trustworthy hardware.
Course Outcomes: After completion of this course, the students will be able to:
C01: Describe the vulnerabilities in the current digital system design flow and the physical
attacks on these systems.
C02: Demonstrate proficiencies in understanding hardware security issues.
C03: Apply the tools and skills to build secure and trusted hardware
C04: Discuss the recent trends in hardware security and apply their knowledge in research
and development.
Program Learning Outcomes:
PLO 1 Develop strong fundamental disciplinary knowledge
PLO 2 Demonstrate research skills that are of an experimental, computational, or theoretical
nature
PLO 3 Apply for a scholarship to conduct independent and innovative research
PLO 4 Show communication skills in various formats (oral, written)
PLO 5 Practice ethical standards of professional conduct and research
PLO 6 Acquire professional skills such as collaborative skills and write articles for scholarly
journals.
Mapping of course outcomes with program learning outcomes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 2 1 2
CO2 2 1 1 1
CO3 2 2 1 2 1
C04 2 2 2 3 2
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
1 Hardware Security threats, Vulnerabilities, and Attacks. Challenges in Securing
Hardware, Threats to Hardware. Hardware Security Vulnerability Assessment.
Hardware-Assisted Computer Security: ARM Trust Zone, Intel SGX. Hardware Root
of Trust, Trusted Platform Module (TPMs), TPM Cryptographic Hardware,
Hardware Accelerators, Cryptographic Coprocessors. Implementing Security in
Reprogrammable Hardware. FPGA Basics, Applications and Uses, FPGA Based
Security Solutions.
2 Modern IC Design and Manufacturing Practices and Their Implications: Hardware
Intellectual Property (IP) Piracy and IC Piracy, Design Techniques to Prevent IP and
IC Piracy, Physically Unclonable Functions (PUFs), PUF Implementations and using
PUFs to prevent Hardware Piracy, Model Building Attacks on PUFs (Case Study:
SVM Modeling of Arbiter PUFs, Genetic Programming based Modeling of Ring
Oscillator PUF). JTAG Protection.
3 Side-channel Attacks (SCA) on Cryptographic Hardware: Current-measurement
based Side-channel Attacks, power, electromagnetic SCA. Design Techniques to
Prevent Side-channel Attacks, Improved Side-channel Attack Algorithms and
Cache Attacks. Fault-tolerance of Cryptographic Hardware, Fault Attacks.
Hardware Trojan based SCA.
4 Hardware Trojans: Hardware Trojan Nomenclature and Operating Modes,
Countermeasures-Design and Manufacturing Techniques to Prevent/Detect
Hardware Trojans, Logic Testing and Side-channel Analysis based Techniques for
Trojan Detection.
Case study: Hardware security issues and solutions in vehicles, hardware security
of fog end-devices for the internet of things.
Text Books
1. D. Mukhopadhyay and R. S. Chakraborty, Hardware Security: Design, Threats, and
Safeguards, Chapman and Hall/CRC, 2014.
2. Y. Jin, Introduction to Hardware Security, Electronics, MDPI, 2015.
3. S. Sidhu et al., Hardware Security in IoT Devices with Emphasis on Hardware Trojans,
Journal of Sensor and Actuator Networks, 2019.
4. I. Butun et al., Hardware Security of Fog End-Devices for the Internet of Things, Sensors,
2020.
5. P. Prinetto and G. Roascio, Hardware Security, Vulnerabilities, and Attacks: A
Comprehensive Taxonomy, ITASEC, 2020.
Text Books
1. T. UcedaVelez and M. Morana, PASTA: Risk Centric Threat Modeling: Process for At-
tack Simulation and Threat Analysis,John Wiley and Sons, 2015.
2. J. Freund and J. Jones, Measuring and Managing Information Risk: A FAIR Approach,
Butterworth-Heinemann., 2014.
3. W. Du, Computer Security: A Hands-on Approach, CreateSpace Independent
Publishing, 2017.
References
1. A. Hoffman, Web Application Security, O'Reilly, 2020.
2. P. Ackerman, Industrial Cybersecurity: Efficiently Secure Critical Infrastructure
Systems, Packt Publishing, 2017.
3. W. Stallings, Cryptography and Network Security: Principles and Practice, Prentice
Hall, 2017.
4. M. Ekstedt, Z. Afzal, P. Mukherjee et al., Yet Another Cybersecurity Risk Assessment
Framework, International Journal of Information Security, Springer, 2023.
References
1. H. F. Tipton and M. Krause, Information Security Management Handbook, Auerbach
Publications, 2019.
2. P. H. Gregory, CISM Certified Information Security Manager All-in-One Exam Guide,
McGraw-Hill Education, 2018.
3. A. Kohnke and D. Shoemaker, The Complete Guide to Cybersecurity Risks and Controls,
Apress, 2017.
4. D. Kosutic, ISO 27001 -Risk Management in Plain English, Advisera, 2015.
5. ISO, ISO/IEC 27001:2022 - Information Security Management System - Requirements,
ISO, 2013.
DATA ANALYTICS
Course Code Course Name Credit Split Year of
Lecture/Lab/Seminar/Project Introduction
M3010023/ Data Analytics 2-1-0-0 2023
M3020023
Prerequisites: Basic knowledge in Machine learning, statistics and Python
Course Objectives:
1. To provide students with a good understanding of the concepts of data analytics
described in the syllabus.
2. To help the students develop the ability to solve problems using the learned
concepts.
3. Connect the concepts to other domains, such as machine learning and pattern
recognition, within and without data analytics.
Course Outcomes: After completion of this course, the students will be able to:
CO1: Understand the data analytics techniques and state-of-the-art solutions.
CO2: Analyze and evaluate critically the building and integration of data analytics.
CO3: Design and demonstrate data analytics through team research projects and project
report presentations.
Program Learning Outcomes:
PLO1 Develop strong fundamental disciplinary knowledge
PLO2 Demonstrate research skills that are of an experimental, computational, or
theoretical nature
PLO3 Apply for a scholarship to conduct independent and innovative research
PLO4 Show communication skills in various formats (oral, written) and to expert and non-
expert audiences;
PLO5 Practice ethical standards of professional conduct and research;
PLO6 Acquire professional skills such as collaborative skills, ability to write grants,
entrepreneurial skills, and writing articles for scholarly journals if it is taught by faculty
in the school.
Mapping of course out comes with program learning out comes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 3 3 2 2 1 2
CO2 3 3 3 2 1 2
CO3 2 1 1 2 3 3
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
1 Introduction to Data science fundamentals, Nature of Data and its
characteristics, Total information awareness, Bonferroni's Principle,
Rhine’s paradox, Recap of Statistical and Inferential Analysis, Data
preprocessing, Data wrangling, Data exploration, Dealing with missing
data – single and multiple data imputation, Entropy based techniques.
2 Sampling distributions; Point estimation - estimators, minimum variance
unbiased estimation, maximum likelihood estimation, method of
moments, consistency; Interval estimation; Testing of hypotheses - tests
and critical regions, likelihood ratio tests; Linear regression.
3 Monte Carlo and MCMC simulations; Correcting inconsistent data –
Deduplication, Entity resolution, Pairwise Matching; Fellegi-Sunter Model,
Advanced processing- Regression, Correlation, Covariance analysis,
Aggregation, Sampling.
4 Dimensionality Reduction; Feature extraction and feature selection;
Graph data analysis, Stream processing and online analytics, Dealing with
infinite length, concept drift, concept/feature evolution, Visual analytics,
Current trends and research.
Text Books
1. J. Leskovec, A. Rajaraman and J. Ullman, Mining of Massive Datasets, Cambridge
University Press, 2014.
2. S. Ozdemir, Principles of Data Science, 2nd ed., Packt Publishing, 2018.
3. S. Lau, J. Gonzalez, and D. Nolan, Principles and Techniques of Data Science, UC
Berkeley.
4. J. S. Saltz and J. M. Stanton, An Introduction to Data Science, Sage Publications,
2017.
References
1. R. V. Hogg, J. W. McKean and A. Craig, Introduction to Mathematical Statistics, 6th
ed., India: Pearson Education, 2006.
2. D. Cielen, A. D.B. Meysman, and M. Ali, Introducing Data Science: Big Data, Ma-
chine Learning, and More, Using Python Tools, Simon and Schuster, 2016.
3. G. Grolemund and H. Wickham, R for Data Science, O’Reilly, 2017.
4. N. Zumel and J. Mount, Practical Data Science with R, Simon and Schuster, 2014.
DEEP LEARNING
Course Code Course Name Credit Split Year of
Lecture/Lab/Seminar/Project Introduction
CO3 2 1 1 2 3 3
REINFORCEMENT LEARNING
Credit Split
Course Code Course Name Lecture/Lab/Seminar/Project Year of
Introduction
Reinforcement 2-1-0-0 2023
M3010026/ Learning
M3020026
COMPUTER VISION
Course Code Course Name Credit Split Year of
Lecture/Lab/Seminar/Project Introduction
M3010027/ Computer Vision 2-1-0-0 2023
M3020027
Prerequisites: Mathematics for Computer Science
Course Objectives:
1. To provide students with a good understanding of computer vision concepts described in
the syllabus.
2. To help the students develop the ability to solve problems using the learned concepts.
3. Connect the concepts to other domains, such as machine learning and pattern recognition,
within and without computer vision.
Course Outcomes: After completion of this course, the students will be able to:
CO1: Understand the foundations of modern computer vision theory, problems, and state-of-
the-art solutions.
CO2: Analyse and evaluate critically the building and integration of computer
vision algorithms and systems.
CO3: Design and demonstrate a working computer vision system through a team research
project, project report, and presentation.
Program Learning Outcomes:
PLO 1 Develop strong fundamental disciplinary knowledge
PLO 2 Demonstrate research skills that are of experimental, computational, or theoretical
nature
PLO 3 Apply for a scholarship to conduct independent and innovative research
PLO 4 Show communication skills in various formats (oral, written) and to expert and non-
expert audiences;
PLO 5 Practice ethical standards of professional conduct and research;
PLO 6 Acquire professional skills such as collaborative skills, ability to write grants,
entrepreneurial skills, and writing articles for scholarly journals if it is taught by faculty in the
school.
Mapping of course outcomes with program learning outcomes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 3 2 3 2
CO2 3 3 3 2
CO3 2 3 3 2
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
1 The Four Rs of Computer Vision, Geometry of Image Formation and Sensing,
Single/Two View Geometry, Camera Calibration, Vanishing Points, Planar Scenes
and Homography, Interest Point Detection, Robust Correspondence Estimation
2 Feature Extraction: Edges - Canny, LoG, DoG; Line detectors (Hough Transform),
Corners - Harris and Hessian Affine, Orientation Histogram, SIFT, SURF, HOG,
GLOH, Scale-Space Analysis- Image Pyramids and Gaussian derivative filters,
Gabor Filters and DWT.
3 Image Segmentation: Region Growing, Edge Based approaches to segmentation,
Graph-Cut, Mean-Shift, MRFs, Texture Segmentation; Object detection
4 Motion Analysis: Background Subtraction and Modelling, Optical Flow,
KLT, Spatio-Temporal Analysis, Dynamic Stereo; Motion parameter estimation.
Text Books
1. R. Szeliski, Computer Vision: Algorithms and Applications, London: Springer, 2011.
2. D. A. Forsyth and J. Ponce, Computer Vision: A Modern Approach, Pearson Education,
2003.
3. R. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision, 2nd ed.,
Cambridge University Press, 2004.
References
1. S. J. D. Prince, Computer Vision: Models, Learning, and Inference, 1st ed. USA:
Cambridge University Press, 2012.
2. E. R. Davies, Computer Vision: Principles, Algorithms, Applications, Learning, 5th ed.
USA: Academic Press, 2017.
SOFT COMPUTING
CO1 3 2 3 1 1 2
CO2 3 2 3 1 1 2
CO3 3 3 3 2 1 2
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
1 Difference between Soft and Hard computing, Overview of different components
of soft computing techniques - Fuzzy Logic, Rough Logic, ANNs, Genetic Algorithms,
Swarm Intelligence
2 Introduction to Fuzzy logic, Fuzzy membership functions, Operations on Fuzzy sets,
Fuzzy relations, Fuzzy propositions, Fuzzy implications, Fuzzy inferences,
Defuzzification, Fuzzy logic controller.
3 Genetic algorithms basic concepts, encoding, fitness function, Parent Selection -
Roulette wheel, Rank, Tournament, Mutation and Crossover operators,
Convergence of GA, Applications of GA, Case studies.
4 Swarm Intelligence - agent systems, social agents, Particle Swarm Optimisation -
path planning applications, Ant Colony Optimisation - solving traveling salesman
problem with ACO, introduction to Artificial Immune Systems
Text Books
1. R. Rajasekaran et al., Neural Networks, Fuzzy Logic, and Genetic Algorithms: Synthesis
and Applications, India: Prentice Hall, 2011.
2. T. Ross, Fuzzy Logic with Engineering Applications, McGraw-Hill, 1997.
3. A. Slowik, Swarm Intelligence Algorithms, CRC press, 2020.
References
1. D. E. Goldberg, Genetic Algorithms in Search, Optimisation, and Machine Learning,
Addison-Wesley, 1989.
2. E. Bonabeau et al., Swarm Intelligence: From Natural to Artificial Systems, Oxford
University Press, 1999.
3. L. Polkowski and P. Verlag, Rough Sets: Mathematical Foundations, Heidelberg, 2002.
4 NLP using Deep Learning: word embedding, Dependency Parsing, RNN and CNN
applications in Language Models, Attention, Transformer Models in LLM,
Multilingual Seq2seq Deep Neural Network, Encode-decoder Model.
Text Books
1. E. M. Bender, Linguistic Fundamentals for Natural Language Processing: 100 Essentials
from Morphology and Syntax, Morgan and Claypool Life Sciences, 2013.
2. G. S. Ingersoll et al., Taming Text: How to Find, Organize, and Manipulate It, O'Reilly,
2017.
3. H. Lane et al., Natural Language Processing in Action: Understanding, Analyzing, and
Generating Text with Python, Manning Publications, 2019.
4. J. Eisenstein, Introduction to Natural Language Processing, MIT Press, 2019.
5. N. Indurkhya and F. J. Damerau, Handbook of Natural Language Processing, 2nd
ed., Taylor and Francis, 2010.
6. P. Goyal et al., Deep Learning for Natural Language Processing- Creating Neural Networks
with Python, Apress, 2018.
7. R. Mihalcea and D. Radev., Graph-based Natural Language Processing and Information
Retrieval, Cambridge University Press, 2011.
8. S. Vajjala et al., Practical Natural Language Processing: A Comprehensive Guide to
Building Real-World NLP Systems, O'Reilly, 2020.
9. S. Bird et al., Natural Language Processing with Python – Analyzing Text with the Natural
Language Toolkit, O'Reilly, 2009.
10. T. Strzalkowski, Natural Language Information Retrieval, Springer, 1999.
11. Y. Goldberg and G. Hirst, Neural Network Methods for Natural Language Processing,
Morgan and Claypool Life Sciences, 2017.
SPEECH PROCESSING
Course Code Course Name Credit Split Year of
Lecture/Lab/Seminar/Project Introduction
M3010030/ Speech Processing 2-1-0-0 2023
M3020030
Prerequisites: Mathematics for Computer Science
Course Objectives:
1. To give students a good understanding of speech processing tasks described in the
syllabus.
2. To help the students develop the ability to solve problems using the learned concepts.
3. Connect the concepts to other domains, such as machine learning and pattern recognition,
within and without speech.
Course Outcomes: After completion of this course, the students will be able to:
CO1: Understand the foundations of modern speech processing theory, problems, and state-
of-the-art solutions.
CO2: Analyze and evaluate critically the building and integration of speech signal
processing algorithms and systems.
CO3: Design and demonstrate a working speech signal processing system through a team
research project, project report, and presentation.
Program Learning Outcomes:
PLO 1 Develop strong fundamental disciplinary knowledge
PLO 2 Demonstrate research skills that are of an experimental, computational, or theoretical
nature
PLO 3 Apply for a scholarship to conduct independent and innovative research
PLO 4 Show communication skills in various formats (oral, written) and to expert and non-
expert audiences;
PLO 5 Practice ethical standards of professional conduct and research;
PLO 6 Acquire professional skills such as collaborative skills, ability to write grants,
entrepreneurial skills, and write articles for scholarly journals if it is taught by faculty in the
school.
Mapping of course outcomes with program learning outcomes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 3 2 3 2
CO2 3 3 3 2
CO3 2 3 3 2
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
1 The human vocal and auditory systems. Characteristics of speech signals:
phonemes, prosody, IPA notation. Lossless tube model of speech production.
Time and frequency domain representations of speech; window characteristics
and time/frequency resolution tradeoffs. Properties of digital filters: mean log
response, resonance gain and bandwidth relations, bandwidth expansion
transformation, all-pass filter characteristics.
2 Autocorrelation and covariance linear prediction of speech; optimality criteria
in time and frequency domains; alternate LPC parametrisation. Speech coding:
PCM, ADPCM, CELP. Speech synthesis: language processing, prosody, diphone and
formant synthesis; time domain pitch and speech modification.
3 Speech recognition: hidden Markov models and associated recognition and
training algorithms. Language modelling. Large vocabulary recognition. Acoustic
preprocessing for speech recognition.
4 Speech Processing: Spectral and non-spectral analysis techniques, Model- based
coding techniques, Noise reduction and echo cancellation, Synthetic and coded
speech quality assessment. Selection of recognition unit, Model-based
recognition, Language modeling, Speaker Identification, Text analysis and text-to-
speech synthesis.
Text Books
1. L. Rabiner and R. Schafer, Theory and Applications of Digital Speech Processing, 1st
ed. USA: Prentice Hall Press, 2010.
2. B. Gold et al., Speech and Audio Signal Processing: Processing and Perception of
Speech and Music, 2nd ed. USA: Wiley-Inderscience, 2011.
References
1. D. O’Shaughnessy, Speech Communication: Human and Machine, Addison-Wesley,
1987.
2. T. Ogunfunmi et al., Speech and Audio Processing for Coding, Enhancement and
Recognition, Springer, 2014.
3. J. Benesty et al., Springer Handbook of Speech Processing, Berlin: Springer, 2008.
COGNITIVE COMPUTING
Course Code Course Name Credit Split Year of
Lecture/Lab/Seminar/Project Introduction
M3010031/M3020031 Cognitive 2-1-0-0 2023
Computing
Prerequisites: 10th class biology and chemistry, basic background in simple differential
equations and probability theory, interest in neuroscience and cognitive science.
Course Objectives:
1. To provide students with a basic understanding of the concepts of neuroscience, cognitive
science, and cognitive computing described in the syllabus.
2. To help them understand how to connect the concepts of cognitive science and
neuroscience to the computing domain.
3. To inform students of current research trends in cognitive computing and artificial
emotional intelligence.
Course Outcomes: After completion of this course, the students will be able to:
CO1: Understand the various cognitive and emotional processes in the brain/mind and how
this knowledge can be applied in the computing domain.
CO2: Analyze and evaluate critically the building of cognitive and affective computing models
and systems.
CO3: Think about research ideas in cognitive science and computing and pursue them.
Program Learning Outcomes:
PLO 1 Develop strong fundamental disciplinary knowledge
PLO 2 Demonstrate research skills that are of an experimental, computational, or theoretical
nature
PLO 3 Apply for a scholarship to conduct independent and innovative research
PLO 4 Show communication skills in various formats (oral, written) and to expert and non-
expert audiences
PLO 5 Practice ethical standards of professional conduct and research;
PLO 6 Acquire professional skills such as collaborative skills, ability to write grants,
entrepreneurial skills, and writing articles for scholarly journals if it is taught by faculty in the
school.
Mapping of course outcomes with program learning outcomes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 3 1 1 1
CO2 3 2 1 1 1 1
CO3 2 2 2 1 1
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
1 Basic neuroscience: Neurons, Dendrites and Axons, Synapses, Synaptic and
Action Potentials, Action Potential generation and propagation, Brain
organization, anatomy and functions, Synaptic integration and plasticity, the
Concept of a Basic Circuit, Abstractions of Cortical Basic Circuits, Neocortical
Brain Organization. Neuron models - McCulloch-Pitts, Integrate-and-Fire,
Hodgkin-Huxley.
2 Cognitive psychology of decision making, neural basis, Scientific theories and
measures of Consciousness, Cognitive models of memory, Mental Imagery,
Understanding a problem, a cybernetic view of cognition consciousness and
free will. Hierarchical temporal memories, Brain Simulations, Eye Tracking and
other modalities for data acquisition. Scope of Realization of Cognition in
Artificial Intelligence.
3 Brain Computer Interface: Types – Synchronous and Asynchronous, Invasive-
Partially Invasive - Non-Invasive BCI, Structure of BCI System, BCI Monitoring
Hardware-EEG, EEG Pre-processing Techniques, Analysis -time, spatial and
frequency domains, fMRI, neuro imaging tools, Brain Response useful for
Building BCIs, BCI applications. Emotions and Machines; Theories, models and
neural basis of emotions, computational models for synthetic emotion
simulation and dynamics, application of artificial emotional intelligence in
healthcare, video surveillance.
4 Introduction to Brain networks, graph models for complex systems, graph
theory and brain, connectivity at microscale. Clinical applications of brain
network analysis, network visualization, case studies. Demonstration and tools
for computing different connectivity measures and their visualizations.
References
1. E. Kandel et al., Principles of Neural Science, McGraw-Hill Professional, 2012.
2. E. Bruce Goldstein, Cognitive Psychology: Connecting Mind, Research, and Everyday
Experience, 4th ed., Cengage Learning, 2014
3. Rao, R. P. N., Brain Computer Interfacing: An Introduction, Cambridge University
Press, 2013.
4. N. Panigrahi and S. P. Mohanty, Brain Computer Interface EEG Signal Processing, CRC
Press, 2022
5. A. Ortony, G. L. Clore, and A Collins, The Cognitive Structure of Emotions, Cambridge
University Press, 2011
6. J. Friedenberg and G. Silverman, Cognitive Science: An Introduction to the Study of
Mind, Sage Publications, 2021.
7. M. Gazzaniga, Cognitive Neuroscience: The Biology of the Mind, W. W. Norton, 2018.
3 Data extraction from Online social media, APIs, Modeling and Visualizing Social
Network graphs - Tools- Gephi, Graphviz, and NodeXL. Dataset Collection for
Social Media Analytics – Visualizing data using Ne04j. Challenges in collecting
social media data.
esearch in Social Networks: Design of novel algorithms for analyzing social
networks, Improving the performance of information sharing in social
networks. Rumor Detection, Semantic Analysis, Online Sentiment Analysis-
opinion mining, feature based sentiment analysis, Trust, credibility, and
reputations in social systems. Emerging Areas in OSN: Decentralized Social
Networks- When Blockchain meets social networks, Mobile Social Networks,
Social Internet of Things (SIoT), Internet of Behavior (IoB) and Social Networks,
Cognitive and AI in Social Network Security.
4 Human Cognition and Social Networks: Human Social Networks and ego networks,
Analysis of ego networks in online social networks, Applying structural knowledge
to Online Social Networking services.
User Behavior Analysis in Social Networks: Psychology of social media users,
Personality theories and User Behavior Prediction – Five Factor Theory- TPB-
MBTI, Relationships between Personality and Interactions in social
networks, Cognitive Psychology and Social Network Usage.
Text Books
1. M. Cross, Social Media Security - Leveraging Social Networking While Mitigating
Risk, 1st ed., Newnes, 2013.
2. P. Kazienko et al., Applications of Social Media and Social Network Analysis,
Springer, 2015.
3. S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications,
New York: Cambridge University Press, 1994.
4. P. Federico et al., Sentiment Analysis in Social Networks, 1st ed., Elsevier, 2016.
5. V. Arnaboldi et al., Online Social Networks: Human Cognitive Constraints in
Facebook and Twitter Personal Graphs, 1st ed., Elsevier, 2015
6. D. Hansen et al., Analyzing Social Media Networks with NodeXL: Insights from a
Connected World, Morgan Kaufmann, 2010.
7. R. Missaoui et al., Social Network Analysis - Community Detection and Evolution,
Springer, 2014.
8. R. Missaoui et al., Trends in Social Network Analysis - Information Propagation,
User BehaviorModeling, Forecasting, and Vulnerability Assessment, Springer,
2017.
OPERATING SYSTEMS
Course Code Course Name Credit Split Year of
Lecture/Lab/Seminar/Project Introduction
M3020037 Operating System 2-1-0-0 2023
Prerequisites: Nil
Course Objectives:
1. To help students understand the necessity and fundamental concepts of an Operating
System.
2. To explore all the essential building blocks in an Operating System.
3. To build practical skills for developing application programming in an Operating System.
4. Explore the different types of Operating Systems in different domains and analyse the
security aspects.
Course Outcomes: After completion of this course, the students will be able to:
CO1: Analyze various concepts and building blocks associated with Operating Systems.
CO2: Apply the concepts, building blocks, principles, and best practices to the software
development.
CO3: Illustrate security aspects in the Operating System through its predefined features.
CO4: Design application programming with multi-processing concepts.
CO5: Analyze different types of Operating Systems available and develop applications.
Program Learning Outcomes:
PLO 1 Develop strong fundamental disciplinary knowledge
PLO 2 Demonstrate research skills that are of an experimental, computational, or theoretical
nature
PLO 3 Apply for a scholarship to conduct independent and innovative research
PLO 4 Show communication skills in various formats (oral, written) and to expert and non-
expert audiences;
PLO 5 Practice ethical standards of professional conduct and research;
PLO 6 Acquire professional skills such as collaborative skills, ability to write grants,
entrepreneurial skills, and writing articles for scholarly journals if it is taught by faculty in the
school.
Mapping of course outcomes with program learning outcomes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 3 3 2
CO2 2 3 3 3 3
CO3 3 3 3
C04 2 3 3 3 3
C05 3 3 3 3 3
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
1 Introduction: Basic OS functions, evaluation of OS, different types of OS,
computer system operation, I/O structure, system protection, OS services,
Processor and user modes, kernels, system calls and system programs.
Process Management: Concept of processes, I/O and CPU bound process,
process hierarchy, co-operating processes, inter-process communication.
Process scheduling: Scheduling criteria, preemptive and non-preemptive
scheduling, scheduling algorithms, multiprocessor scheduling.
Threads: Overview, benefits of threads, user and kernel threads.
Process Synchronization: Background, concurrent processes, critical section
problem, classical problems of synchronization, semaphores.
2 Deadlocks: Characterization, detection, prevention, avoidance, recovery.
Memory Management: Background, logical vs. physical address, swapping,
paging, segmentation.
Virtual Memory: Background, demand paging, page replacement algorithms,
thrashing.
Disk Management: Disk structure, disk scheduling, boot block and bad blocks.
Characteristics of Embedded Systems, Embedded Linux, and Application specific
OS. Basic services of NACH Operating System, Principles of protection, domain
of protection, access matrix, access control, language-based protection,
program threats, system and network threats, user authentication,
implementing security defenses, firewalling, exercises - man-in-the middle
attacks.
3 File Systems: File concept, access methods, file system structure, allocation
methods, free-space management, directory structure, efficiency and
performance.
I/O Management: I/O hardware, polling, interrupts, DMA, application I/O
interface, performance.
Protection and Security: Goals of protection, security problem, authentication,
program threats, system threats, threat monitoring, encryption.
4 FreeRTOS: architecture, distribution, management of heap memory, task,
queue, software timer, interrupt, resource management, memory
management, task notification, low power support, porting.
Text Books
1. W. Stallings, Operating System: Internals and Design Principles, 8th ed., Prentice Hall,
2014.
2. A. Silberschatz et al., Operating System Concepts, 9th ed., John Wiley and Sons, 2012.
3. M. J. Bach, The Design of the Unix Operating System, People's Posts and
Telecommunications Publishing House, 2003.
4. L. Qing and C. Yao, Real-time Concepts for Embedded Systems, CRC press, 2003.
5. R. Barry, Mastering the FreeRTOS™ Real Time Kernel -A Hands-On Tutorial Guide, Real
Time Engineers, 2016.
6. W. Mauerer, Professional Linux® Kernel Architecture, O’Reilly, 2010
References
1. E. Siever et al., Linux in a Nutshell, O'Reilly Media, 2005.
2. D. P. Bovet and M. Cesati, Understanding the Linux Kernel, O'Reilly, 2005.
3. F. Mayer et al., SELinux by Example: Using Security Enhanced Linux, Pearson
Education, 2006.
Web References
1. https://freertos.org/FreeRTOS-Plus/index.html
2. http://www.sl2.hu/sexample.pdf
3. https://tldp.org/LDP/lkmpg/2.6/lkmpg.pdf
4. https://www.ibm.com/docs/en/aix/7.2?topic=programming-writing-reentrant-
threadsafe-code
5. https://www.omscs-notes.com/operating-systems/distributed-file-systems/
6. https://searchstorage.techtarget.com/definition/RAID
7. https://www.unf.edu/public/cop4610/ree/Notes/PPT/PPT8E/CH15-OS8e.pdf
8. https://people.cs.rutgers.edu/~pxk/416/notes/content/21-crypto-slides.pdf
9. https://www.jigsawacademy.com/blogs/cyber-security/symmetric-and-asymmetric-
key-cryptography
10. https://bootlin.com/doc/training/linux-kernel/linux-kernel-slides.pdf
11. http://www.cs.unca.edu/~bruce/Fall14/360/RPiUsersGuide.pdf
12. https://www.raspberrypi.org/help/
BLOCKCHAIN TECHNOLOGY
Course Code Course Name Credit Split Year of
Lecture/Lab/Seminar/Project Introduction
M3010038/ Blockchain Technology 2-1-0-0 2023
M3020038
Prerequisites: Nil
Course Objectives:
1. To provide students with a deeper understanding of the concepts of blockchain technology
with due focus on decentralized computing and distributed systems described in the syllabus.
2. To help the students develop the ability to address real-world problems using the learned
concepts of smart contracts and Dapps.
3. To connect the learned concepts with other business domains having opportunities for
disruptive innovation with blockchain.
4. To make students aware of the existing challenges of blockchain and focus on contributing
revolutionary solutions of the same.
Course Outcomes: After completion of this course, the students will be able to:
CO1: Apply the science of blockchain technology in modelling better solutions for distributed
computing.
CO2: Analyze the variants of blockchain/DLT and their adoption in respective domains
CO3: Visualize the use of blockchain technology and its potential disruptions in multiple
business domains in the coming era.
Program Learning Outcomes:
PLO 1 Develop strong fundamental knowledge about the underlying concepts of blockchain
technology
PLO 2 Demonstrate in-depth understanding of different blockchain types, architectures and
distributed consensus methods.
PLO 3 Critically compare and evaluate the need of Blockchain/DLT in industry
PLO 4 Alert the problems and challenges in deploying blockchain based Dapps and Smart
Contracts with a deeper understanding of the multiple tradeoffs in the proposed product.
PLO 5 Demonstrates the disruptive potential of blockchain technology in revolutionizing the
existing business models.
PLO 6 Acquire research skills to propose better algorithms/solutions for the existing
challenges and contribute to the upcoming blockchain protocols.
OPTIMIZATION TECHNIQUES
Course Code Course Name Credit Split Year of
Lecture/Lab/Seminar/Project Introduction
M3010040/ Optimization Techniques 2-1-0-0 2023
M3020040
Prerequisites: Nil
Course Objectives:
1. To provide students with a good understanding of optimization techniques described in
the syllabus.
2. To help the students develop the ability to solve problems using the learned concepts.
3. Connect the concepts to other domains, such as machine learning and pattern recognition,
within and without optimization techniques.
Course Outcomes: After completion of this course, the students will be able to:
CO1: Understand the optimization techniques problem and state-of-the-art solutions.
CO2: Analyze and evaluate critically the building and integration of optimization techniques.
CO3: Design and demonstrate optimization techniques through team research projects,
project reports, and presentations.
Program Learning Outcomes:
PLO 1 Develop strong fundamental disciplinary knowledge
PLO 2 Demonstrate research skills that are of an experimental, computational, or theoretical
nature
PLO 3 Apply for a scholarship to conduct independent and innovative research
PLO 4 Show communication skills in various formats (oral, written) and to expert and non-
expert audiences;
PLO 5 Practice ethical standards of professional conduct and research;
PLO 6 Acquire professional skills such as collaborative skills, ability to write grants,
entrepreneurial skills, and writing articles for scholarly journals if it is taught by faculty in the
School.
Mapping of course outcomes with program learning outcomes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 3 2 3 2
CO2 3 3 3 2
CO3 2 3 3 2
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
1 Optimization - sequences and limits, derivative matrix, level sets and gradients,
Taylor series.
2 Unconstrained optimization - necessary and sufficient conditions for optima,
convex sets, convex functions, optima of convex functions, steepest descent,
Newton and quasi-Newton methods, conjugate direction methods.
3 Constrained optimization - linear and non-linear constraints, equality and
inequality constraints, optimality conditions.
4 Constrained convex optimization, projected gradient methods, penalty
methods.
Text Books
1. E. K. P. Chong and S. H. Zak, An Introduction to Optimisation, 2nd ed. India: Wiley,
2010.
2. D. G. Luenberger and Y. Ye, Linear and Nonlinear Programming, 3rd ed., Springer,
2010.
References
1. S. Sra, S. Nowozin, and S. J. Wright, Optimization for Machine Learning, MIT Press,
2012.
2. R. Battiti and M. Brunato, The LION Way: Machine Learning Plus Intelligent
Optimization, Createspace Independent Publishing, 2014.
COMPUTER ARCHITECTURE
Course Code Course Name Credit Split Year of
Lecture/Lab/Seminar/Project Introduction
M3020041 Computer Architecture 2-1-0-0 2023
Prerequisites: Nil
Course Objectives:
1. To help students understand the fundamentals behind a computer and its architecture.
2. To explore the working principles of a computer's essential building blocks.
3. To understand how these building blocks are assembled to design a so-called computer.
4. To explore a few advanced topics in computer architecture.
Course Outcomes: After completion of this course, the students will be able to:
CO1: Know how different components of a computer system are working.
CO2: Apply the knowledge of computer architecture while modelling systems for security
analysis.
CO3: Compare various types of computer architectures and can analyze the design principles.
CO4: Use a computer more confidently with the acquired knowledge of its constituent
components.
Program Learning Outcomes:
PLO 1 Develop strong fundamental disciplinary knowledge
PLO 2 Demonstrate research skills that are of an experimental, computational, or theoretical
nature
PLO 3 Apply for a scholarship to conduct independent and innovative research
PLO 4 Show communication skills in various formats (oral, written) and to expert and non-
expert audiences;
PLO 5 Practice ethical standards of professional conduct and research;
PLO 6 Acquire professional skills such as collaborative skills, ability to write grants,
entrepreneurial skills, and writing articles for scholarly journals if it is taught by faculty in the
School.
Mapping of course outcomes with program learning outcomes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 3 2
CO2 3 3 2 3 3
CO3 2 3 2 1 2 1
C04 2 2 3 2 3 2
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
1 Computer Fundamentals: Computer types, functional units, Basic concepts.
Von Neumann Architecture
Instruction Sets: Machine instructions, Memory operations, addressing modes,
Instructions sets, Stacks, Subroutines, RISC & CISC architectures.
2 Processing Unit: Components (Registers, ALU, Datapath), Instruction execution,
Control signals, Operations of control unit.
Computer Arithmetic: Basic operations on signed numbers, Floating point
operations.
3 Memory Management: Memory Hierarchy, Semiconductor based memory
(Internal Organization, SRAM, DRAM), Read only memory,
Cache memories – mapping techniques, performance, locality of reference,
Cache hit / miss, Cache coherence problem
Input/output: Accessing I/O devices, Bus Operations, I/O Modules, I/O Control
mechanisms – Programmed I/O, Interrupt controlled, Direct Memory Access, I/O
Interface (Serial, Parallel), I/O interconnection Standards.
4 Pipelining: Pipeline concept, Speedup, Throughput, Hazards in pipeline –
structural hazard, data hazard, control hazard: Branch hazard; Dealing with
hazards - Register Renaming, Branch Prediction.
Advanced Computer Architecture: Parallel Processing - Flynn’s classification,
Amdahl's law, Characteristics of Multiprocessors, Interconnection Structures,
Interprocessor Arbitration, Interprocessor Communication and Synchronization,
Cache Coherence, Vector/Array Processing.
Text Books
1. C. Hamacher et al., Computer Organization, 6th ed., McGraw-Hill Higher Education,
2011.
2. D. A. Patterson and J. L. Hennessy, Computer Organization and Design – The
Hardware/Software Interface, 6th ed., Morgan Kaufmann, 2020.
3. W. Stallings, Computer Organization and Architecture: Designing for Performance, 8th
ed., Pearson, 2009.
4. P. P. Chaudhuri, Computer Organization and Design, 3rd ed., PHI Learning, 2008.
5. A. S. Tanenbaum, Structured Computer Organization, 6th ed., Pearson, 2012.
References
1. William Stallings, Computer Organization and Architecture: Designing for
Performance, 7th ed., Prentice-Hall India.
2. C. Hamacher, Z. Vranesic and S. Zaky, Computer Organization, 5th ed., McGraw-Hill.
3. C. Hamacher, Z. Vranesic, and S. Zaky, Computer Organization, 6th ed., McGraw Hill.
4. M. M. Mano, Digital Logic and Computer Design, 4th ed., Pearson Education.
QUANTUM COMPUTING
Course Code Course Name Credit Split Year of
Lecture/Lab/Seminar/Project Introduction
M3010042/ Quantum Computing 2-1-0-0 2023
M3020042
Prerequisites: Basic linear algebra
Course Objectives:
1. To provide students with a good understanding of the concepts of quantum computing
2. To help the students develop the ability to solve problems using the learned concepts.
3. To connect the concepts to other domains.
Course Outcomes: After completion of this course, the students will be able to:
CO1: Understand the foundations of quantum computing and familiarize students with well-
known quantum algorithms.
CO2: Analyze and critically evaluate various quantum algorithms.
CO3: Apply quantum computing to solve various problems.
Program Learning Outcomes:
PLO 1 Develop strong fundamental disciplinary knowledge.
PLO 2 Demonstrate research skills that are of an experimental, computational, or theoretical
nature
PLO 3 Apply for a scholarship to conduct independent and innovative research
PLO 4 Show communication skills in various formats (oral, written) and to expert and non-
expert audiences.
PLO 5 Practice ethical standards of professional conduct and research;
PLO 6 Acquire professional skills such as collaborative skills, ability to write grants,
entrepreneurial skills, and writing articles for scholarly journals if it is taught by faculty in the
school.
Mapping of course outcomes with program learning outcomes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 3 1 1 1 2
CO2 3 3 3 2 2 2
CO3 2 3 3 2 2 3
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
1 Elements of quantum mechanics, Wave-particle duality, Wave functions and
probability amplitude, Heisenberg’s uncertainty principle, Schrodinger
equation, postulates of quantum mechanics, Quantum tunneling
2 Qubits, combining qubits using the tensor product, measuring qubits,
Performing operations on qubits, Bra-ket notation, Bloch sphere
representation, Qubit rotations, Projective measurements, Qubit modalities.
3 Quantum gates, Quantum circuits, Quantum entanglement, No cloning
theorem, Quantum teleportation, Super dense coding, Quantum parallelism,
DiVincenzo’s criteria for quantum computation
4 Quantum Fourier transform, Deutsch’s Algorithm, Deutsch-Jozsa Algorithm,
Simon’s periodicity algorithm, Grover’s search algorithm, Shor’s Factoring
algorithm.
Text Books
1. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information,
Cambridge University Press, 2000.
2. V. Kasirajan, Fundamentals of Quantum Computing, Theory and Practice, Springer,
2021.
3. M. Nakahara and T. Ohmi, Quantum Computing, CRC Press, 2008.
4. M. Mosca, An Introduction to Quantum Computing, New York: Oxford University
Press, 2007.
References
1. M. L. Bellac, A Short Introduction to Quantum Information and Quantum
Computation, Cambridge University Press, 2006.
2. P. Kaye et al., An Introduction to Quantum Computing, Oxford, 2007.
3. A. Peres, Quantum Theory: Concepts and Methods, New York: Springer, 1993.
4. N. D. Mermin, Quantum Computer Science, Cambridge University Press, 2007.
WEB TECHNOLOGY
Course Code Course Name Credit Split Year of
Lecture/Lab/Seminar/Project Introduction
M3020043 Web Technology 2-1-0-0 2023
Prerequisites: Nil
Course Objectives:
1. To help students understand the web application fundamentals.
2. To explore the architecture and design principles of web-based applications.
3. To understand the most suitable application stack for a requirement and its
implementation.
4. To explore a few related concepts like Microservices, common web application security
issues, REST API
Course Outcomes: After completion of this course, the students will be able to:
CO1: Understand the web technology fundamentals
CO2: Develop web application using MEAN and MERN stack
CO3: Analyze and evaluate critically the building and integration of different web technology
stacks.
CO4: Develop web applications without known/published security risks and issues
Program Learning Outcomes:
PLO 1 Develop strong fundamental disciplinary knowledge
PLO 2 Demonstrate research skills that are of an experimental, computational, or theoretical
nature
PLO 3 Apply for a scholarship to conduct independent and innovative research
PLO 4 Show communication skills in various formats (oral, written) and to expert and non-
expert audiences;
PLO 5 Practice ethical standards of professional conduct and research;
PLO 6 Acquire professional skills such as collaborative skills, ability to write grants,
entrepreneurial skills, and writing articles for scholarly journals if it is taught by faculty in the
School.
Mapping of course outcomes with program learning outcomes:
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6
CO1 3 1 2 2
CO2 3 2 3 2 1
CO3 3 3 1 2 1
CO4 3 3 2 2
(Correlation: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High))
Syllabus
Module Content
1 Fundamentals of TCP/IP protocol, Stateless protocol, HTTP, HTTPS, Web
servers, Web server architecture, Application Server, Request/response
paradigm, The structure of HTTP messages, Request methods, HTTP Header
structure, Status codes. Characteristics of Modern Web Applications, HTML
Responsive Web Design, HTML5 Elements, Attributes and elements, Type of
Style sheets: Internal Style Sheet, Inline Style sheet, External Style Sheet, CSS3
Elements and features, CSS frameworks, Content delivery network, Selectors,
XML Schema, Presenting XML Using XML Processors: DOM and SAX.
2 Introduction to Java Script, Object in JavaScript, Dynamic HTML with Java Script,
JavaScript Object Notation, JSON vs XML, JSON Parsing, Data types, Arrays,
Decisions and Loops, Functions and scope, JavaScript libraries, JavaScript
Frameworks, ECMAScript, TypeScript, Single page applications (SPA),Cookies,
Sessions management, Client side processing. The Web Services based on
technologies such as SOAP, REST, WSDL, Django Framework: Architecture, MVT
Architecture Pattern in Django Structure
3 Basics of angular Framework, Basics of React Web Framework, Nodejs and
Express framework, Introduction to MongoDB, Sample MERN Stack application,
Sample MEAN stack application, Node js design patterns – Singleton, Factory,
Builder, Prototype,
4 Data Visualization Techniques for small and large data, OWASP Top Ten Web
Application Security Risks, Fundamentals of web application architecture (1Tier,
2-Tier,3-Tier, N Tier and MVC) and components, User interface app
components, Structural components, Microservices, Monolithic vs.
Microservices
Text Books
1. J. C. Jackson, Web Technologies - A Computer Science Perspective, Pearson Education,
2009.
2. A. Q. Haviv et al., Web Application Development with MEAN, Packt Publishing, 2016.
3. V. Subramanian, Pro MERN Stack: Full Stack Web App Development with Mongo,
Express, React, and Node, 2nd ed., 2019.
4. J. B. Mille, Internet Technologies and Information Services, ABC-CLIO, 2014.
5. D. Slama et al., Enterprise IoT: Strategies and Best Practices for Connected Products
and Services, O-Reilly, 2015.
References
1. L. Shklar and R. Rosen, Web Application Architecture: Principles, Protocols and
Practices, Wiley, 2009.
2. L. Lemay et al., Mastering HTML, CSS and JavaScript Web Publishing, BPB Publications,
2016.
3. G. Veneri and A. Capasso, Hands-On Industrial Internet of Things: Create a powerful
Industrial IoT infrastructure using Industry 4.0, Ingram short title, 2018.
4. K. K. Pabbathi, Quick Start Guide to Industry 4.0: One-stop reference guide for Industry
4.0, Createspace Independent Publishing Platform, 2018.
4 Case studies of Cloud and Edge Computing, Cloud Analytics, AI and ML at the
Edge and in the Cloud, Fault Tolerance, Load Balancing, Security, Trust
and Privacy in Cloud, Performance and QoS, Future Research
Direction/Opportunity in the Cloud and Edge Computing.
Text Books
1. R. Misra and Y. S. Patel, Cloud and Distributed Computing: Algorithms and Systems,
Wiley, 2020.
2. A. S. Tanenbaum and M. V. Steen, Distributed Systems: Principles and Paradigms, 2nd
ed., Prentice Hall, 2007.
3. G. Tel, Introduction to Distributed Algorithms, 2nd ed., Cambridge University Press,
2000.
4. K. Chandrasekaran, Essentials of Cloud Computing, CRC Press, 2015.
5. R. Buyya et al., Mastering Cloud Computing, McGraw-Hill, 2013.
6. C. Surianarayanan and P. Chelliah, Essentials of Cloud Computing: A Holistic
Perspective, 1st ed., Springer, 2019.
7. R. Buyya, S. N. Srirama, Fog and Edge Computing: Principles and Paradigms, Wiley,
2019.
8. J. R. Vacca, Cloud Computing Security: Foundations and Challenges, CRC Press, 2016.
9. B. Burns et al., Kubernetes: Up and Running: Dive Into the Future of Infrastructure,
O’Reilly, 2019.
10. A. A. A. Donovan and B. W. Kernighan, The Go Programming Language, Addison-
Wesley, 2015.
11. S. Klabnik, C. Nichols, The Rust Programming Language, No Starch Press, 2018.
12. J. S. Chelladhurai, V. Singh, and P. Raj, Learning Docker, 2nd ed., Packt Publishing,
2017.
13. A. Kurniawan, Learning AWS IoT, Packt Publishing, 2018.
14. E. Krishnasamya et al., Edge Computing: An Overview of Framework and Applications,
PRACE Technical Report, 2020.
15. C. Bernhardt, Quantum Computing for Everyone, MIT Press, Cambridge, 2020.