C24 Curriculum &

Course Contents
B.Tech. Computer Science & Engineering
w.e.f. batch 2024-28
 FOREWORD
The vital aspect of Computer Science & Engineering program is problem solving through programming.
It is an essential skill required to carry out profession of Software Engineer. CSE graduates practice the
activities (analysis, design, development, testing and maintenance) of software development life cycle to
solve complex and challenging real world problems.

R22 Curriculum enables our students to start with the basic science, basic engineering and introductory
programming courses. Further, they learn the mathematical foundations of computing; get hands-on
experience in building software solutions using various technologies for various real-world problems and
pursue advanced courses such as Artificial Intelligence, Machine Learning, Cloud Computing, Big Data &
Analytics, Internet of Things and much more.

Salient Features of R 22 Curriculum:

  Multidisciplinary holistic education with continuous learning and continuous assessment.
  Lateral entry and lateral exit options.
  Credit Earning by credit transfer.
  Honors/ Research Honors/ Minor/ Add-on Diploma/ Add-on Certification and Dual B.Tech.+
M.Tech./ MBA Degree of 5 Years.
  Semester drop option to pursue innovation, incubation, entrepreneurial and advanced exploratory
activities and subsequent re-entry.

Emphasis on continuous formative assessment with a creative summative assessment will facilitate the student
to “Move away from high stake examinations – towards more continuous and comprehensive evaluation”.

The Board of Studies of B.Tech. CSE Programme consists of a right mix of eminent personalities from
Academic, Research and Industry Organizations, besides experienced faculty members of the University.

External BoS Members:

1. Prof. C. R. Rao, Professor SCIS, University of Hyderabad.
2. Prof. R. B. V. Subramanyam, Professor, Department of CSE, NIT Warangal.
3. Dr. B. Venkata Ramana, Assoc. Professor & HoD, Department of CSE, IIT Tirupathi.
4. Dr. Nagesh Bhattu Sristy, Asst. Professor, Department of CSE, NIT AP.

I thank all the BOS members, Academic Council Members and University authorities for their continuous
support and encouragement towards design of this innovative curriculum for CSE.

Dr. S. V. Phani Kumar

Head, Department of CSE
VFSTR Deemed to be University
 VISION
To evolve into a Centre of Excellence in Science & Technology through creative and
innovative practices in teaching – learning, towards promoting academic achievement
and research excellence to produce internationally accepted, competitive and world class
professionals who are psychologically strong & emotionally balanced, imbued with social
consciousness & ethical values.

MISSION
To provide high quality academic programmes, training activities, research facilities and
opportunities supported by continuous industry - institute interaction aimed at promoting
employability, entrepreneurship, leadership and research aptitude among students and
contribute to the economic and technological development of the region, state and nation.

Department of
COMPUTER SCIENCE &
ENGINEERING

VISION of the department

To evolve as a centre of high repute in Computer Science & Engineering and create
computer software professionals trained on problem solving skills imbued with ethics to
serve the ever evolving and emerging requirements of IT Industry and society at large.
MISSION of the department
M1: Imparting quality education through well designed curriculum, innovative teaching
and learning methodologies integrated with professional skill development activities
to meet the challenges in the career.
M2: Nurture research and consultancy activities amongst students and faculty by providing
State-of-art facilities and Industry-Institute Interaction.
M3: Developing capacity to learn new technologies and apply to solve social and industrial
problems to become an entrepreneur.
 B.Tech in Computer Science and Engineering
Program Educational Objectives (PEOs)
PEO1: Graduates acquire extensive technical knowledge and related skills required to demonstrate themselves as professionals
or pursue higher education.
PEO2: Graduates adapt to upskilling and excel in their careers despite future technological changes, and demonstrate research
aptitude to generate innovative engineering solutions.
PEO3: Graduates acquire the potential to contribute for the field of computing as well as for the societal development by demonstrating
professional, social and ethical practices.

Program Specific Outcomes (PSOs)

The students will be able to
PSO1: Application Development Skills: Design and development of web applications using various technologies such as
HTML, JSP, PHP, ASP and ASP.NET to cater the needs of the society.
PSO2: Enrich Research Skills: Offer solutions which impact geo-socio-economic and environmental scenarios by using
Machine Learning, Artificial Intelligence and IoT.

Program Outcomes (POs)

PO1: Engineering knowledge PO5: Modern tool usage PO9: Individual and team-work
PO2: Problem analysis PO6: The engineer and society PO10: Communication
PO3: Design/development of solutions PO7: Environment and sustainability PO11: Project management and finance
PO4: Conduct investigations of complex PO8: Ethics PO12: Life-long learning
Problems

Student Outcomes (SOs) - Engineering Accreditation Commission (EAC)

SO1: An ability to identify, formulate, and solve complex engineering problems by applying principles of engineering, science,
and mathematics.
SO2: An ability to apply engineering design to produce solutions that meet specified needs with consideration of public health,
safety, and welfare, as well as a global, cultural, social, environmental, and economic factors.
SO3: An ability to communicate effectively with a range of audiences.
SO4: An ability to recognize ethical and professional responsibilities in engineering situations and make informed judgments,
which must consider the impact of engineering solutions in global, economic, environmental, and societal contexts.
SO5: An ability to function effectively on a team whose members together provide leadership, create a collaborative and
inclusive environment, establish goals, plan tasks, and meet objectives.
SO6: An ability to develop and conduct appropriate experimentation, analyze and interpret data, and use engineering
judgment to draw conclusions.
SO7: An ability to acquire and apply new knowledge as needed, using appropriate learning strategies.

Student Outcomes (SOs) - Computing Accreditation Commission (CAC)

SO1: Analyze a complex computing problem and to apply principles of computing and other relevant disciplines to identify
solutions.
SO2: Design, implement, and evaluate a computing-based solution to meet a given set of computing requirements in the
context of the program’s discipline.
SO3: Communicate effectively in a variety of professional contexts.
SO4: Recognize professional responsibilities and make informed judgments in computing practice based on legal and ethical
principles.
SO5: Function effectively as a member or leader of a team engaged in activities appropriate to the program’s discipline.
SO6: Apply computer science theory and software development fundamentals to produce computing-based solutions.
 COURSE STRUCTURE – C24 (M.P.C stream)

Induction Programme
Course Title L T P C Course category
Orientation Session 0 2 0 1 Binary grade

I Year I Semester
Course Title L T P C Course category
Linear algebra & Ordinary differential equations /
3 2 0 4 Basic Sciences
Calculus
Engineering Physics / Engineering Chemistry 3 0 2 4 Basic Sciences
Basic of Electrical & Electronics Engineering/
2 0 2 3 Basic Engineering
Engineering Graphics
Programming in C 2 0 4 4 Basic Engineering
English Proficiency & Communication Skills
0 0 2 1 Humanities
(PET)
IT Tools & Cyber security 0 2 2 2 Basic Engineering
Basic Sciences /
Environmental Studies / Management Science 2 2 0 3
Humanities
12 6 12 21
Physical Fitness, Sports & Games /
0 0 2 1 Binary grade
Self-empowerment & Gender Sensitization
Constitution of India / Indian Knowledge Systems 0 2 2 1 Binary grade
0 2 4 2
36 23

I Year II Semester
Course Title L T P C Course category
Linear algebra & Ordinary differential equations /
3 2 0 4 Basic Sciences
Calculus
Engineering Physics / Engineering Chemistry 3 0 2 4 Basic Sciences
Basic of Electrical & Electronics Engineering/
2 0 2 3 Basic Engineering
Engineering Graphics
Problem Solving through Python 2 0 2 3 Basic Engineering
Technical English Communication 2 0 2 3 Humanities
Basic Sciences /
Environmental Studies / Management Science 2 2 0 3
Humanities
14 4 8 20
Physical Fitness, Sports & Games /
0 0 2 1 Binary grade
Self-empowerment & Gender Sensitization
Constitution of India / Indian Knowledge Systems 0 2 0 1 Binary grade
0 2 2 2
30 22
 B. TECH – CSE
COURSE STRUCTURE – C24

II Year I Semester
Course
Course Title L T P C Course Category
Code
24MT203 Discrete Mathematical Structures 3 2 0 4 Basic Sciences
22TP201 Data Structures 2 2 2 4 Basic Engineering
22CS201 Database Management Systems 2 2 2 4 Professional core
Object-Oriented Programming
24CS204 3 0 2 4 Professional core
through JAVA
24CS208 Digital Logic Design 3 0 2 4 Professional core
24CS205 Front end application Development 0 2 2 2 Professional core
Design Thinking and Engineering
24CS299 0 0 2 1 Basic Engineering
Orientation
Industry interface course Department
24CS801 0 0 2 1
(Modular course) Elective
Sub Total 13 08 14 24
22SA201 Life Skills 0 0 2 1 Binary Grade
Sub Total 13 08 16 25
Total 35 25

II Year II Semester
Course
Course Title L T P C Course Category
Code
22ST202 Probability and Statistics 3 2 0 4 Basic Sciences
24CS209 Design and Analysis of Algorithms 3 0 2 4 Professional core
22CS207 Operating Systems 2 0 2 3 Professional core
24CS210 Computer Organization 2 2 0 3 Professional core
24CS207 Full Stack Development 0 2 2 2 Professional core
Open Elective – 1 (NPTEL) 2 2 0 3 Open Elective
24CS201 Field projects 0 0 2 1 Project
Sub Total 12 08 08 20
24SA101 UHV 0 0 2 1 Binary Grade
Minors/Honours - 1 3 0 2 4 Minors/Honours
Sub Total 15 08 12 25
Total 35 25
III Year I Semester
Course
Course Title L T P C Course Category
Code
22TP301 Soft Skills Laboratory 0 0 2 1 Humanities
24CS301 Optimization Techniques 2 2 0 3 Basic Sciences
24CS302 Artificial Intelligence 2 0 2 3 Professional core
24CS303 Computer Networks 3 0 2 4 Professional core
24CS305 Computing Ethics 1 2 0 2 Humanities
Department
Department Elective 3 0 2 4
Elective
Open Elective 2 2 0 3 Open Elective
24EN301 Professional Communication Skills 0 0 2 1 Humanities
Sub Total 13 06 10 21
Minors/Honours - 2 2 2 2 4 Minors/Honours
Sub Total 15 08 12 25
Total 35 25

III Year II Semester

Course
Course Title L T P C Course Category
Code
Quantitative aptitude & Logical
24TP301 1 2 0 2 Humanities
reasoning
24CS306 Machine Learning 2 2 2 4 Professional core
22CS401 Cryptography and Network Security 3 0 2 4 Professional core
Department Elective 2 0 2 3 Department Elective
Department Elective 3 0 2 4 Department Elective
Open Elective 2 0 2 3 Open Elective
24CS307 Inter Departmental Project 0 0 2 1 Project
Sub Total 13 04 12 21
Minors/Honours - 3 2 2 2 4 Minors/Honours
Sub Total 15 06 14 25
Total 35 25

Page 2 of 5
IV Year I Semester
Course
Course Title L T P C Course Category
Code
24CS401 Software Project Management 2 2 0 3 Professional core

24CS402 Parallel & Distributed Computing 2 2 0 3 Professional core

24CS403 Privacy and Intrusion Detection 2 2 0 3 Professional core

Department
Department Elective 2 2 2 4
Elective
Department
Department Elective 2 2 2 4
Elective
Department
Department Elective 3 0 2 4
Elective
Sub Total 13 10 06 21

Minors/Honours - 4 2 2 2 4 Minors/Honours

Sub Total 15 12 08 25

Total 35 25

IV Year II Semester
Course
Course Title L T P C Course Category
Code
22CS404
/ Internship / Project Work 0 02 22 12 Project
22CS405
Sub Total 0 02 22 12

Minors/Honours - 5 02 02 02 04 Minors/Honours

Sub Total 02 04 24 16

Total 30 16

Page 3 of 5
 Department Electives

Course
Sl. No. Course Title L T P C
Code
1 22CS801 Advanced Data Structures 2 2 2 4

2 22CS802 Advanced JAVA Programming 2 2 2 4

3 22CS803 Computer Graphics 2 2 2 4

4 22CS804 Deep Learning 3 0 2 4

5 22CS805 Digital Image Processing 2 2 2 4

6 22CS807 Mobile Ad-hoc Networks 3 0 2 4

7 22CS809 Text Mining 3 0 2 4

8 22CS810 Numerical Algorithms 3 2 0 4

9 22CS811 Operating System Design 3 0 2 4

10 22CS813 Simulation and Modeling 3 0 2 4

Open Electives offered to Non-Computing Branches

Course
Sl. No. Course Title L T P C
Code
1 22CS851 Database Systems 2 0 2 3
Mobile Application Design and
2 22CS852 2 0 2 3
Development
3 22CS853 Java Programming 2 0 2 3

4 22CS854 Python Programming 2 0 2 3

Design and Development of Internet
5 22CS855 2 0 2 3
Applications

Page 4 of 5
 Honours

Course
Sl. No. Course Title L T P C
Code
1 22CS951 Advanced Graph Algorithms 3 0 2 4

2 22CS952 Biometrics 3 0 2 4

3 22CS953 Parallel and Distributed Computing 3 2 0 4

4 22CS954 Internet of Things 3 0 2 4

5 22CS955 Wireless Sensor Networks 3 0 2 4

6 22CS956 Capstone Project 0 2 6 4

Minor Courses

Course
Sl. No. Course Title L T P C
Code
1 22CS901 Introduction to Python Programming 2 2 2 4

2 22CS902 OOPS through JAVA 2 0 4 4

3 22CS903 Database Management Systems 2 2 2 4

4 22CS904 Web Technologies 2 0 4 4

5 22CS905 Mobile Application Development 2 0 4 4

6 22CS906 Design and Analysis of Algorithms 2 2 2 4

Operating Systems and Shell
7 22CS907 2 2 2 4
Programming
8 22CS908 Computer Networks 3 0 2 4

9 22CS909 Capstone Project 0 2 6 4

Page 5 of 5
 Department Electives

Course
Sl. No. Course Title L T P C
Code
1 22CS801 Advanced Data Structures 2 2 2 4

2 22CS802 Advanced JAVA Programming 2 2 2 4

3 22CS803 Computer Graphics 2 2 2 4

4 22CS804 Deep Learning 3 0 2 4

5 22CS805 Digital Image Processing 2 2 2 4

6 22CS807 Mobile Ad-hoc Networks 3 0 2 4

7 22CS809 Text Mining 3 0 2 4

8 22CS810 Numerical Algorithms 3 2 0 4

9 22CS811 Operating System Design 3 0 2 4

10 22CS813 Simulation and Modeling 3 0 2 4

Open Electives offered to Non-Computing Branches

Course
Sl. No. Course Title L T P C
Code
1 22CS851 Database Systems 2 0 2 3
Mobile Application Design and
2 22CS852 2 0 2 3
Development
3 22CS853 Java Programming 2 0 2 3

4 22CS854 Python Programming 2 0 2 3

Design and Development of Internet
5 22CS855 2 0 2 3
Applications

Page 4 of 5
 Honours

Course
Sl. No. Course Title L T P C
Code
1 22CS951 Advanced Graph Algorithms 3 0 2 4

2 22CS952 Biometrics 3 0 2 4

3 22CS953 Parallel and Distributed Computing 3 2 0 4

4 22CS954 Internet of Things 3 0 2 4

5 22CS955 Wireless Sensor Networks 3 0 2 4

6 22CS956 Capstone Project 0 2 6 4

Minor Courses

Course
Sl. No. Course Title L T P C
Code
1 22CS901 Introduction to Python Programming 2 2 2 4

2 22CS902 OOPS through JAVA 2 0 4 4

3 22CS903 Database Management Systems 2 2 2 4

4 22CS904 Web Technologies 2 0 4 4

5 22CS905 Mobile Application Development 2 0 4 4

6 22CS906 Design and Analysis of Algorithms 2 2 2 4

Operating Systems and Shell
7 22CS907 2 2 2 4
Programming
8 22CS908 Computer Networks 3 0 2 4

9 22CS909 Capstone Project 0 2 6 4

Page 5 of 5
 24MT101 LINEAR ALGEBRA AND ORDINARY DIFFERENTIAL
EQUATIONS
Hours per week:

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Basics of matrices, Differentiation and Integration.

COURSE DESCRIPTION AND OBJECTIVES:
The goal of this course is to build a grasp of the principles of mathematics through matrices,
differential equations and applications that serves as an essential tool in several engineering
applications.
MODULE-1
24L+16T+0P=40 Hours
UNIT-I: MATRICES
Definition of matrix, Types of matrices, Algebra of matrices, adjoint of a matrix, inverse of a
matrix through adjoint and elementary row operations, Rank of a matrix, Echelon form, Normal
form, Eigen values and Eigen vectors (up to 3 x 3 matrices only) and properties (without
proofs).

UNIT-II: APPLICATIONS OF MATRICES

Consistency of system of linear equations, Solution of system of linear equations having unique
solution and involving not more than three variables by Gauss elimination method and Gauss
Jordan method; Cayley-Hamilton theorem (without proof), Power of a matrix, Inverse of a
matrix; Strength of materials and strength of beams using Eigen values and Eigen vectors.

PRACTICES:
 Compute inverse of a matrix if exists.
 Explain with suitable examples how rank of matrix is independent of the elementary
operations.
 Explain with suitable examples how rank of matrix is unique.
 Discuss with suitable examples when Eigen values and Eigen vectors are possible for a
matrix.
 Discuss the possibility of solution of a system of equations.
 Discuss when inverse and power of a matrix exist using Cayley-Hamilton theorem.
MODULE-2
24L+16T+0P=40 Hours
UNIT-1: ORDINARY DIFFERENTIAL EQUATIONS (ODE)
First Order Differential Equations: Introduction to ODE, variable separable method,
homogenous and non-homogenous differential equations, linear differential equations,
Bernoulli’s equations.
Second Order Differential Equations: Linear differential equations with constant
coefficients with RHS of the form eax, xn, sin(ax) or cos(ax).

UNIT-2: APPLICATIONS OF ODE

Applications of ODE: Newton’s law of cooling, Law of natural growth and decay; LR circuit.
PRACTICES:
 Check the order and degree of an ODE.
 Find solution for any four ordinary differential equations by applying suitable method.
 Find numerical solution for any four ordinary differential equations by applying suitable
method.
 Discuss some applications of ODE.

SKILLS:
 Find rank of a matrix using different methods.
 Compute the Eigen values and Eigen vectors of a matrix.
 Find analytical solution of a differential equation using appropriate method.
 Demonstrate any one numerical method to solve differential equation.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

Mapping
CO Blooms Module
Course Outcomes with
No. Level No.
POs
Apply the concepts of rank, Eigen values and
1, 2, 3, 9,
1 Eigenvectors of a matrix and finding inverse of a Apply 1
10, 12
matrix and powers of a matrix.

Apply differential equations in real life 1, 2, 3, 9,

2 Apply 2
problems. 10, 12

Analyse the solution of a system of linear 1, 2, 3, 9,

3 Analyze 1
equations and find it. 10, 12

Inspect the analytical method for solving 1, 2, 3, 9,

4 Analyze 2
differential equations and applications. 10, 12

TEXT BOOKS:

1. B. S. Grewal,” Higher Engineering Mathematics”, 44 Edition, Khanna Publishers, 2018.

2. N. P. Bali, K. L. Sai Prasad, “A Textbook of Engineering Mathematics I, II, III”, 2nd
Edition, Universal Science Press, New Delhi, 2018.

Page 2 of 53
REFERENCE BOOKS:
1. H. K. Dass and Er. RajanishVerma, “Higher Engineering Mathematics”, 3rd revised
edition, S. Chand & Co., 2015.
2. B. V. Ramana, “Advanced Engineering Mathematics”, TMH Publishers,11th edition 2011.
3. T. K.V. Iyengar et. al, “Engineering Mathematics, I, II, III”, S. Chand & Co., New
Delhi,2018.

Page 3 of 53
 24MT102 CALCULUS
Hours per week:

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Differentiation, Integration, Vectors.

COURSE DESCRIPTION AND OBJECTIVES:
The goal of this course is, students should be able to adapt their knowledge and techniques to
solve other similar application problems. Make aware students about the importance and
symbiosis between Mathematics and Engineering. To develop the mathematical skill so that
students are able to apply mathematical methods & principals in solving problem from
Engineering fields. Students will learn applications of differentiation, integration and vectors
to use in solving problem from Engineering fields.
MODULE-1
24L+16T+0P=20 Hours
UNIT-1: CALCULUS
Differential Calculus
Functions, Limits, Continuity, Differentiability, Tangent and normal, Mean value theorems;
Analyzing functions for Extreme value and critical points, Intervals on which a function is
increasing or decreasing, Relative (local) extrema, Absolute (global) extrema, Concavity and
inflection, graphical transformation.

UNIT-2: Integral calculus

Double integral, Triple integral, Change of order, integration in polar coordinates, Finding
Areas and Volumes.
PRACTICES:
 Write basic formulas of differentiation and integration
 Finding the differentiation and integration of functions of several variables.
 What is the tangent and normal?
 Find the velocity and acceleration of given function.
 Tell about maxima and minima.
 Discuss the given function is increasing or decreasing.

MODULE-2
24L+16T+0P=20 Hours
UNIT-1: VECTOR CALCULUS
Introduction to vectors, Vector algebra, Scalar and vector point functions, Gradient,
Divergence and Curl.

Page 4 of 53
UNIT-2: APPLICATIONS OF VECTOR CALCULUS
Normal vector, Directional Derivate, Solenoidal and Irrotational vectors, Scalar potential; Line
integral, surface integral, volume integral, Green’s theorem for plane, Gauss divergence
theorem, Stokes’ theorem (without proofs).
PRACTICES:
 Tell difference between a vector and scalar.
 Algebra of a vectors.
 Find the area and volume bounded by the curves.
 Differentiate between line, surface and volume integrals.
 Applications of vector differential operators.
 Discuss the tangent and normal vector.

SKILLS:
 Needs to evaluate integration and differentiation of all functions
 Understand how to choose the limits from the given curves
 Need to understand the geometrical representation of each given curve

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply differentiation and integration for solving 1, 2, 3, 4,
1 Apply 1
engineering problems 9, 10, 12
Apply vector differential operators in real life 1, 2, 3, 4,
2 Apply 2
problems 9, 10, 12
1, 2, 3, 4,
3 Analyse a function for its extreme values Analyze 1
9, 10, 12
1, 2, 3, 4,
4 Evaluate line, surface and volume integrals Evaluate 2
9, 10, 12

TEXT BOOKS:
1. N. P. Bali, K. L. Sai Prasad, “A Textbook of Engineering Mathematics I, II, III”, 2 nd
Edition, Universal Science Press, New Delhi, 2018.
2. B. S. Grewal, “Higher Engineering Mathematics”, 44 Edition, Khanna Publishers, 2018.

REFERENCE BOOKS:
1. H. K. Dass and Er. Rajanish Verma, “Higher Engineering Mathematics”, Third edition S.
Chand and Co., 2015.
2. B. V. Ramana, “Advanced Engineering Mathematics”, TMH Publishers, 2017.
3. T. K.V. Iyengar et al, “Engineering Mathematics, I, II, III”, S. Chand and Co., New Delhi,
2018.
4. Erwin Kreyszig, “Advanced Engineering Mathematics”, 10th Edition, John Wiley & Sons,
Inc, 2010.

Page 5 of 53
 24PY102 - ENGINEERING PHYSICS
Hours per week:
L T P C
3 0 2 4

PREREQUISITE KNOWLEDGE: Basics of Quantum Mechanics and Semiconductors

COURSE DESCRIPTION AND OBJECTIVES:

This course ensures commensurable understanding of the principles of Quantum Mechanics

and applying them to find the various physical properties of conductors and semiconductors.
This embark perspective outlook on optoelectronic devices and optical fibres in view of
semiconductor physics.

MODULE- 1
24L+0T+16P=40 Hours

UNIT 1: QUANTUM MECHANICS

Quantum Mechanics: Introduction to Quantum Mechanics, Concept of wave and particle
duality of radiation, de Broglie’s concept of matter waves, Schrödinger’s time-independent
wave equation, Eigen values and Eigen functions, Particle confined in a one-dimensional
infinite potential well and finite potential well, Quantum Tunnelling, Applications of Quantum
laws in SEM and Quantum dots.

UNIT 2: FREE ELECTRON THEROY

Free electron theory of solids: Classical free electron theory, expression for electrical
conductivity, Quantum frees electron theory, Fermi-Dirac distribution, electronic specific heat
of solids, Density of states, Bloch’s Theorem, Classification of solids based on energy bands.

PRACTICES
 Photoelectric Effect-Determination of Planck’s constant.
 I-V characteristics of a p-n junction diode.
 Determination of energy bandgap of a p-n junction diode.
 Thermistor-Measurement of resistivity of a thermistor.

MODULE-2
24L+0T+16P=40 Hours

UNIT 1: SEMICONDUCTOR PHYSICS

Introduction, Classification of semiconductors; Direct and indirect bandgap semiconductors,
Intrinsic and extrinsic semiconductors.
Intrinsic semiconductors; Variation of intrinsic carrier concentration, Fermi level, and
electrical conductivity with temperature.
Extrinsic semiconductors; Effect of temperature on carrier concentration, energy band
diagrams Hall Effect.

Page 6 of 53
UNIT-2: OPTOELECTRONICS
Classification of optoelectronic devices; Photovoltaic cell, LED.
LASERs; Introduction, characteristics, population inversion, pumping, Semiconductor diode
Laser and applications of Lasers.
Optical fibers; Acceptance angle, Numerical aperture, applications.

PRACTICES:
 Hall Effect - Determination of Hall coefficient.
 Laser - Determination of wavelength.
 Optical fibre - Determination of Numerical aperture and acceptance angle.
 Solar cell – Determination of Fill factor & Efficiency.
 Study of I-V Characteristics of Light Emitting Diode

SKILLS:
 Apply the quantum laws to understand the electron dynamics of solids.
 Assess the importance of semiconductors in terms of its properties,
 Comprehend the significance of optoelectronic devices.

COURSE OUTCOMES:
Upon successful completion of the course, students will have the ability to:

CO Blooms Module Mapping

Course outcomes
No. level No. with POs
Understand and analyze Quantum Mechanics 1, 2, 3, 4,
1 Analyze 1
principles to solve physical problems 9, 10
Determine of energy levels and classification of 1, 2, 4, 5,
2 Evaluate 1
solids based on energy bands 9, 10
Apply the knowledge of semiconductors to 1,3,4,5,6,
3 Apply 2
illustrate and to assess their properties 9, 10
Interpret the process of optoelectronic transition 1,2,3,5, 9,
4 Evaluate 2
and their functionality 10

TEXT BOOKS:
1. S.M. Sze, “Semiconductor Devices Physics and Technology”, John Wiley & Sons, 3rd
Edition, 2015.
2. C. Kittel, “Introduction to Solid State Physics”, Wiley, 9th Edition, 2019.
REFERENCE BOOKS:
1. N. Zettili, “Quantum Mechanics: Concepts and Applications”, Wiley, 3rd Edition, 2022.
2. P. K. Palanisamy, “Engineering Physics”, Scitech Publications, 3rd Edition, 2013.
3. S. O. Pillai, “Solid State Physics”, New age International publishers, 8th Edition, 2018.
4. M.A. Wahab, “Solid State Physics: Concepts and Applications”, Narosa Publishing House,
3rd Edition, 2015.
5. M. N. Avadhanulu and P.G. Kshirsagar, “A Textbook of Engineering Physics”, S. Chand
Publishing, 11th Edition, 2010.

Page 7 of 53
 24CT101 - ENGINEERING CHEMISTRY
Hours per week:

L T P C
3 0 2 4
PREREQUISITE KNOWLEDGE: Concept of bonding, chemical reactions and
electrochemical cell
COURSE DESCRIPTION AND OBJECTIVES:
The course aims to cover the importance of chemistry and its applications in engineering
disciplines particularly focusing on developing new engineering materials (such as polymers,
nanomaterials etc.) and understanding their property for scientific and engineering
applications. In addition, the students are also expected to acquire knowledge on
electrochemistry and construction of batteries and fuel cells.

MODULE-1
24L+0T+16P=40 Hours
UNIT-1
POLYMER TECHNOLOGY
Introduction and Classification of Polymers, Polymerization techniques, Preparation,
properties and applications of PE, Nylon-6,6; Elastomers-Natural rubber and properties,
vulcanization, synthetic rubbers-Buna N and S; Introduction to conducting polymers
(Polythiophene).

UNIT-2
ELECTROCHEMICAL DEVICES
Introduction to Electrochemistry, Electrochemical series, Galvanic and electrolytic cells, EMF
of an electrochemical cell, Reference Electrode-Standard Hydrogen Electrode; Classification
of batteries, Battery characteristics, Construction, working and applications of: Lead-acid
storage cell, Lithium-ion battery; Fuel Cells- Classification, Construction, working and
applications of H2-O2 fuel cell and solid oxide fuel cell; Concept of Redox-flow batteries.

PRACTICES:
 Synthesis of Bakelite
 Preparation of Nylon-6,6
 Determination of Fe (II) by dichrometry method
 Determination of strength of Weak acid by pH-method
 Determination of strength of acid by conductometry

MODULE-2
24L+0T+16P=40 Hours
UNIT-1
MATERIALS CHEMISTRY
Engineering Materials: Refractories – classification, refractoriness RUL, Chemical &
Thermal stability; Lubricants – classification, viscosity, viscosity index, flash and fire points,

Page 8 of 53
 cloud and pour points and mechanical stability; Abrasives-types and properties; Ionic liquids
as lubricants
Nanomaterials: Introduction, classification, properties, Top-down (Ball Milling) and Bottom-
up (Sol-Gel) synthetic methods; Synthesis, properties and applications of Carbon Nanotubes
and Graphene; Introduction to nanocomposite and membrane technology.

UNIT-2
CHEMISTRY FOR ELECTRONICS AND COMPUTING
Introduction to electronic memory devices, Classification of electronic memory devices;
Organic- Inorganic hybrid materials; Display Systems- Electromagnetic spectrum, Interaction
of light with matter, Photo and electro active materials properties and applications (OLED’s,
QLED’s); Introduction and applications of Computational Chemistry.

PRACTICES:
 Determination of viscosity of oil (Biodiesel, castor oil and coconut oil)
 Purity of lubricant- Saponification and neutralization number
 Synthesis of magnetic Iron oxide nanoparticles
 Estimation using Colorimetry
 Chemsketch and Avogadro

SKILLS:
 Synthesize various polymers.
⮚ Synthesize nanomaterials.
⮚ Identify the properties of different industrially relevant engineering materials.
⮚ Understand the different components of an electrochemical cell.
⮚ Design electrochemical cell such as battery.
⮚ Identify the types of energy conversion/storage systems.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply various synthetic methodologies for preparing
1, 2, 4, 9,
1 different types of polymers for various engineering Apply 1
10, 11, 12
applications.
Evaluate the output of different electrochemical cells 1, 2, 3, 5,
2 and ability to design various batteries and fuel cells Evaluate 1 9, 10, 11,
for different applications. 12
Analyze and design different engineering materials 1, 2, 3, 5,
3 and nano materials by evaluating their properties for Analyze 2 6, 7, 9, 10,
enhancing the productivity. 11, 12
1, 2, 3, 5,
Analyze possible devices and display systems and
4 Analyze 2 6, 7, 9, 10,
their relevance to electromagnetic spectrum.
11, 12

Page 9 of 53
TEXT BOOKS:

1. S. Chawala, “A Textbook of Engineering Chemistry Engineering Materials and

Applications”, Dhanpat Rai Publications, 3rd Edition, 2015.
2. K. S. Maheswaramma and M. Chugh, “Engineering Chemistry”, Pearson, 1st Edition, 2015

REFERENCE BOOKS:

1. VR Gowariker, NVViswanathan, Jayadev, Sreedhar, “Polymer Science”, New age

Int.Publishers, 4th Edition, 2021
2. Kirby W.Beard, “Linden's Handbook of Batteries”, Fifth Edition, McGrawHill, 2019.
3. MaliniS, KSAnantha Raju, “Chemistry of Engineering materials”, CBSpublishers PvtLtd.,
2022
4. T. Pradeep, “Nano: The Essentials; Understanding of Nano Science and Technology” Tata
McGraw-Hill, New Delhi, 2012.
5. Takatoshi Tsujimura, “OLED Display Fundamentals and Applications”, Wiley–Blackwell,
2012
6. Frank Jensen, “Introduction to Computational Chemistry”, Second Edition, John Wiley &
Sons Ltd, 2007.
7. Avogadro User Manual - https://avogadro.cc/docs/

Page 10 of 53
 24CT103 – ENVIRONMENTAL STUDIES
Hours per week:

L T P C
2 2 0 3
PREREQUISITE KNOWLEDGE: General awareness regarding environmental problems
and importance of environmental protection.

COURSE DESCRIPTION AND OBJECTIVES:

It is a multidisciplinary subject where we deal with different aspects using a holistic approach.
It is evolving to be the education for sustainable and ethical development both at a local and
global level. It helps to prepare the next generation and to plan appropriate strategies for
addressing environmental issues. It identifies and create solutions that conserve to manage
ecosystem and biodiversity and also helps to eliminate pollutants, toxicants, preserve air, water
and soil quality. Environmental education recognize impacts of global issues, enhances the
public awareness and helps to take decisions towards environmentally responsible actions.

MODULE-1
16L+16T+0P=32 Hours
UNIT-1: Sustainable Development, Natural Resources and Ecosystems
Sustainable Developments - Concepts and SDGs; Natural Resources (forest, water, land),
Energy Resources (Renewable and non-renewable resources); Global energy scenario;
Concept of Ecology and Ecosystem, Ecological Succession, Population Ecology, Biotic
Interactions.
UNIT-2: Biodiversity and Ecosystem conservation
Biodiversity, Threats to Biodiversity, Man environment interactions; Biodiversity conservation
(in-situ and ex-situ conservation strategies); Protected areas, Traditional Knowledge in
biodiversity conservation, Ecosystem protection.

PRACTICES AND FIELD PROJECTS:

 Visit to biogas plant, solar power plant, waste to energy power plant (document
preparation)
 Detailed study of any environmental problem/situation, Identification of factors pertaining
to that problem with conclusion (Students can choose any environmental problem in the
surrounding. (document preparation)
 Field project: river/pond/lake/forest/grassland/hill/mountain ecosystem study and report
writing.
 Herbarium Sheet preparation
 Preparation of Compost
 Activity on Renewable Energy Resource Research

Page 11 of 53
 MODULE-2
16L+16T+0P=32 Hours
UNIT-1 Pollution Control and Environmental Sanitation
Emerging Local and Global Environmental Issues; Environmental Pollution Control
Monitoring, Strategies and devices in industries; Clean technologies; Waste Management-
Municipal, Industrial, Biomedical, Hazardous, Radioactive Waste, and E-waste management;
Waste-water Treatment (Water Purification Technologies, Adsorption Studies).

UNIT-2 Environmental Health and Safety

Occupational Health and Hygiene; Toxicity Studies (Heavy Metal Toxicity, Xenobiotic and
Carcinogenicity, Effects on Human health by Agents like Asbestos, Tobacco etc.);
Bioremediation Technologies.
PRACTICES AND FIELD PROJECTS
 Field Project: Water and Waste-water analysis and Remediation techniques, Visit to
Sewage Treatment Plant.
 Field Project: Assessment of Plastic Pollution on Campus and nearby Places with Possible
Remediation Strategies
 Disposal of laboratory waste- Individual Practice and Report Writing, Lab Safety
Awareness
 Report Writing: 12 principles of Green Chemistry for Environmental Sustainability
 Report Writing: Environmental Management (ISO 14001), Eco-mark, Eco labeling
 Lab Safety and Local Disaster Management Plan
COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Ability to apply knowledge, research skills and
1 Apply 1 6,7,12
field techniques to protect environment.
Analyze the biodiversity of different
2 ecosystems and formulate various conservation Analyze 1 7,8,10,12
approaches
Collect the data using research skills and analyze
3 the presence of various environmental pollutants Analyze 2 6,7,12
for problem solving
Design and apply remediation technologies for
4 Apply 2 3,6,7,9,12
environmental sustainability
Survey of various waste management
5 approaches and recommend their Evaluate 2 7,8,9,10,1
implementation strategies 2

TEXT BOOKS:
1. A. Kaushik and C. P. Kaushik, “Perspectives in Environmental Studies”, 7th edition, New
Age International Publishers, 2021.
2. B. Joseph, “Environmental Studies”, 3rd edition, McGraw Hill Education, 2017.

Page 12 of 53
REFERENCE BOOKS:

1. Mahua Basu & S.Xavier, “Fundamentals of Environmental Studies”, Cambridge University

Press, 2017.
2. Sanjay K. Sharma, Ackmez Mudhoo, “Green Chemistry for Environmental Sustainability”,
CRC Press, 2019.
3. Ram Chandra, “Environmental Waste Management,”CRC Press, 2020.
4. Srujana Kathi, “Environmental Toxicoloy”, Notion Press, 2021.
5. James E. Girard, “Principles of Environmental chemistry”, 2nd edition, Jones and Bartlett
Publishers, 2009.

Page 13 of 53
 24EE101- BASICS OF ELECTRICAL AND ELECTRONICS
ENGINEERING
Hours Per Week:
L T P C
2 0 2 3
PREREQUISITE KNOWLEDGE: Electrostatics and Electromagnetism.

COURSE DESCRIPTION AND OBJECTIVES:

This course provides an insight into the functioning of basic electrical components like
resistor, inductor and capacitor. It deals with the constructional and operational details of AC
machines. It also deals with the basic electronic components like P-N junction diode, Zener
diode, Transistor and their characteristics.

MODULE-1
16L+0T+16P=32 Hours
UNIT-1
FUNDAMENTALS OF ELECTRIC CIRCUITS:
DC Circuits: Concept of network, Active and passive elements, Voltage and current sources,
Concept of linearity and linear network, Unilateral and bilateral elements, R, L and C as linear
elements, Ohm’s Law, Kirchhoff’s Laws, Application to simple series, Parallel circuits, Mesh
and nodal analysis of resistive circuits with DC source.

AC circuits: Generation of AC voltage, Frequency, Average value, R.M.S. value, Form

factor, Peak factor for sinusoidal only.

UNIT-2
SEMICONDUCTOR DEVICES
Classification of semiconductors, P-N junction diode -operation and its characteristics, Half
wave rectifier - operation, efficiency; Full wave rectifiers -types, operation, efficiency; Zener
diode and its characteristics, Zener diode as Voltage regulator.

Bi polar junction transistor- operation, types (NPN & PNP)

PRACTICES:
 Verification of Ohm’s law.
 Verification of Kirchhoff’s current law.
 Verification of Kirchhoff’s voltage law.
 Determination of R.M.S. Values of sinusoidal waveform.
 Verification of PN junction diode characteristics under both forward and reverse bias.
 Verification of Zener diode characteristics under reverse bias.

MODULE-2
16L+0T+16P=32 Hours
UNIT-1
ANALYSIS OF AC CIRCUITS
Analysis of single - phase AC circuits consisting of R, L, C, RL, RC (series and parallel)

Page 14 of 53
 (simple numerical problems). Introduction to three phase system, Relation between phase and
line quantities of voltages and currents in star and delta connected systems (Elementary
treatment only).

UNIT-2
AC MACHINES:
Electromagnetism: Concepts of Magneto motive force, Reluctance, Flux and flux density,
Concept of self-inductance and mutual inductance, Coefficient of coupling.

Static AC Machine: Principle of operation of single phase transformer, Constructional

features, EMF equation (simple numerical problems).

Rotating AC Machine Principle of operation of three phase induction motor, Slip ring and
squirrel cage motors, Torque equation; Constructional details of synchronous machine.

PRACTICES:
 Transformation ratio of a single phase transformer at different loads.
 Measurement of Energy in single phase resistive load circuit.
 Measurement of Power in single phase resistive load circuit.
 Determination of impedance in complex AC circuits.
 Verification of line and phase quantities in a balanced three phase system.

SKILLS:
 Distinguish between linear and nonlinear elements by looking at VI characteristics
 Develop a simple loop generator.
 Design a voltage regulator using Zener diode.
 Design a half wave rectifier using PN junction diode.
 Design a full wave rectifier using PN junction diodes.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Analyze the resistive circuits with
1 independent sources and find its Analyze 1, 2 1, 2, 6, 9
solution..
Solve the AC (single and three
2 phase) and DC circuits using different Apply 1, 2 1, 2, 9 ,12
methods.
Apply the concepts off
3 Apply 2 1, 2, 3, 9, 12
electromagnetism f or its applications.
Examine the different electrical
4 Evaluate 2 1, 2, 9, 12
equipment.
Acquire the knowledge of
5 semiconductor devices to create Create 1 1, 2, 3, 9, 12
circuits.

Page 15 of 53
TEXT BOOKS:
1. V. K. Mehta, “Principles of Electrical Engineering and Electronics”, 1st edition, S.Chand
& Co., Publications, New Delhi, 2019.
2. D.P. Kothari, “Basic Electrical and Electronics Engineering”, 2nd edition, TMH, New
Delhi, 2017.

REFERENCE BOOKS:
1. Millman and Halkias, “Electronic Devices and Circuits”, Mc Graw Hill, 2006.
2. A.K. Thereja and B.L.Thereja, “Electrical Technology”, Vol.–II, S. Chand & Co., Publications,
2020.
3. U. Bakshi and A. Bakshi, “Basic Electrical Engineering”, 1st edition, Technical
Publications, Pune, Nov 2020

Page 16 of 53
 24ME101 - ENGINEERING GRAPHICS
Hours per week:

L T P C
2 0 2 3
PREREQUISITE KNOWLEDGE: Basics of Geometry.

COURSE DESCRIPTION AND OBJECTIVES:

Engineering graphics is the language of engineers and is the most effective way of
communicating and sharing technical ideas in the form of pictures/drawings. The objective of
this course is to familiarize the students with the conventional concepts of engineering drawing
and computer aided drawing.

MODULE-1
16L+0T+16P=32 Hours
UNIT-1
ENGINEERING CURVES
Types of lines; Lettering, Dimensioning, Geometric constructions - lines, polygons (Angle,
ARC, General and Inscribe in circle method), Conical curves (General method), Ellipse by
Oblong method.

UNIT-2

ORTHOGRAPHIC PROJECTIONS OF POINTS, LINES & PLANES

Principles of projection; Projections of points; Projection of straight lines - Inclined to one
plane, inclined to both planes; Projection of planes - Inclined to one plane.

PRACTICES:
 Construction of polygons using different methods (i.e. ARC, Angle, General).
 Inscribe a regular hexagon & pentagon in a circle of the given diameter.
 Tracing of conical curves (Ellipse, Parabola, Hyperbola) by using General Method.
 Draw the projections of the points situated in all the 4 quadrants.
 Draw the projections of a line when it is inclined to one plane (HP or VP).
 Draw the projections of a line when it is inclined to both the planes (HP &VP).
 Draw the projections of a plane when it is inclined to one plane (HP or VP).

MODULE-2
16L+0T+16P=32 Hours
UNIT-1
PROJECTIONS OF SOLIDS
Projection of solids axis inclined to one reference plane - Prisms, pyramids, Cylinder and cone.

DEVELOPMENT OF SURFACES
Development of lateral surfaces of simple solids - Prisms, Pyramids, Cylinder and cone.

Page 17 of 53
UNIT-2
ORTHOGRAPHIC VIEWS
Conversion of pictorial views into orthographic views.
Drafting Using Computer Package: Introduction to 2D modelling software - AutoCAD;
Conversion of Isometric view into Orthographic views of simple castings; Conversion of
Orthographic views into Isometric view of simple solids - Prisms, Pyramids, Cylinders and
cones.
PRACTICES:
 Draw the projections of Prisms, when they are inclined to one reference plane (HP or VP).
 Draw the projections of Pyramids, when they are inclined to one reference plane (HP or
VP).
 Draw the projections of cylinder & cone, when they are inclined to one reference plane
(HP or VP).
 Draw the complete surface development of prisms & pyramids with the given dimensions.
 Draw the complete surface development of cylinder & cone with the given dimensions.
 Draw the orthographic view’s (i. e. front view, top view, and side view) of the given
pictorial view of the sketches by using AutoCAD.
 Draw the Isometric view of simple solids (Prisms & Pyramids) by using AutoCAD.
 Draw the Isometric view of simple solids (Cylinder & Cone) by using AutoCAD.

SKILLS:
 Convert isometric views of objects into orthographic views and vice versa.
 Visualize the shape of the 3D components.
 Create pictorial views by using AutoCAD
 Know projections by visualization.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Mapping
Course Outcomes Module No.
No. Level with POs
Communicate the technical ideas in the
1 Apply 1 1,2,3,5
form of drawings.
Apply the drawing skills in representing
2 Apply 1 1,2,3,5
various geometrical features.
Develop orthographic projections and
3 Apply 1 1,2,3,5
isometric views of various objects.
Estimate the lateral surface area of
4 Analyze 1,2,3,5
regular geometrical solids.
Sketch simple objects and their pictorial
5 Analyze 2 1,2,3,5
views using AutoCAD.

Page 18 of 53
TEXT BOOKS:
1. J Hole, “Engineering Drawing”, Tata McGraw-Hill, 2nd Edition, 2019.
2. N D Bhatt, “Engineering Drawing”, Charotar Publication, 53rd Edition, 2014.
REFERENCE BOOKS:
1. Basant Agrawal and C.M. Agrawal “Engineering Drawing”, Tata Mc Graw- Hill, 2nd
Edition 2018.
2. K L Narayana, “Engineering drawing”, SciTech Publications, 3rd Edition, 2011.
3. Colin H. Simmons, Dennis E. Maguire, Manual of Engineering Drawing, 2nd Edition,
2003.

Page 19 of 53
 24CY101 - IT TOOLS AND CYBER SECURITY
Hours per week:
L T P C
PREREQUISITE KNOWLEDGE: Nil 0 2 2 2

(OBJECTIVE:) COURSE DESCRIPTION AND OBJECTIVES.

The coursework will introduce cyber security concepts and provide awareness about
cybercrimes and preventive measures and safe practices to be followed. quantum physics
concepts and their applications in quantum computing. It also familiarizes students with the to
learn and practice the usage of software tools such as word, excel, ppt and LaTex, text and
image editors.
MODULE-1
0L+16T+16P=16 hours
UNIT-I
Practicing exercises using software tools:
 Write a passage in a Word document. Give the passage a title, then format it according to
the guidelines below:
o Add the time and date, and make sure the title is bold, italicized, and underlined.
o Increase the font size, style, and line spacing by two-fold.
o Set the margins to 1.75 on the right and 1.5 on the left.
o Set a border for the passage.
 Create a timetable using Table format of Word for your programme
 Preparation of resume
 Preparation of calendar for the current month
 Create an invitation for your department function or college day using the text box and
other options
 Create a call letter for an interview using mail merge.
 Create value-added webpages about course curriculum using Hyperlink, styles, layout etc.
 In Excel, create a student mark statement and determine the total, average, and percentage
of marks
 Create a payroll system in Excel for 5 employees given Basic salary, 40% for D.A;12% for
HRA; 10% for TA; 10% for CCA; 12% for PF; IT 10%. Calculate the gross and net salary
 Create a pivot table to analyse your worksheet data.

UNIT-II
Practicing exercises using software tools:
 Prepare a presentation on your university using PowerPoint.
 Prepare a presentation on launch of a product.
 Prepare a brochure of a value added course
 Create a hierarchy chart of your organization
 Design a Magazine cover.
 Design a poster inviting all students of your department Festival.
 Installation and demonstration of LaTeX.
 Prepare professional pdf documents using LaTeX.
 Prepare LaTex document containing mathematical equations, tables and images.

Page 20 of 53
 MODULE-2
0L+16T+16P=16 hours
UNIT-I
Introduction to Cyber security and Cybercrimes: Defining Cyberspace, Issues and
challenges of cyber security, Cyber Hygiene, Classification of cybercrimes, Common
cybercrimes targeting computers and mobiles, cyber-crime against women and children, social
engineering attacks, reporting of cyber-crimes, Remedial and mitigation measures, Legal
perspective of cyber-crime, IT Act 2000.
Social Media Overview and Security: Types of Social media platforms, Social media
privacy, Challenges, opportunities and pitfalls in online social network, Security issues related
to social media, Best practices for the use of Social media.
UNIT-II
E-Commerce and Digital Payments: Main components of E-Commerce, Elements of
E-Commerce security, E-Commerce threats, E-Commerce security best practices. Modes of
digital payments, Digital payments related common frauds and preventive measures.
Device Security: End Point device and Mobile phone security, Password policy, Security patch
management, Importance of regular data backups, Downloading and management of third party
software, Device security policy, Significance of host firewall and Ant-virus, Management of
host firewall and Anti-virus, Wi-Fi security, Configuration of basic security policy and
permissions.
COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs

Create word documents, presentations and

1 Apply 1 2, 5
spread sheets by applying various tools.

2 Usage of latex tool for report writing Apply 2 5, 6

Apply the concept of Cyber security, issues

and challenges associated with it, cyber-
crimes, their nature, legal remedies and the
3 Apply 1 6, 8
process of reporting crimes and best
practices to be taken up in the usage of
social media.

Apply the basic concepts related to E-

Commerce, digital payments, RBI
4 Apply 2 6, 12
guidelines and preventive measures against
digital payment frauds.

Use basic tools and technologies to protect

5 Apply 2 6
their devices.

Page 21 of 53
SKILLS:
 Integration of various components of a computer system.
 Trouble shooting of components of a computer system.
 Installation of OS and its various tools/ applications.
 Usage of IT tools such as MSWord, LaTex etc.
 Creating the documents using MS-Word and LaTex.
 Analysing and visualizing data with excel.
 Developing vari- ous power point presentations.

TEXT BOOKS:
1. Fundamentals of Computers by Reema Thareja, Oxford University Press 2nd edition 2019,
India.
2. Lamport, Leslie (1994). LaTeX: A Document Preparation System, User’s Guide and
Reference Manual (2nd ed.). Pearson
2. Cyber Security Understanding Cyber Crimes, Computer Forensics and Legal Perspectives
by Sumit Belapure and Nina Godbole, Wiley India Pvt. Ltd.

REFERENCE BOOKS:

1. Information Warfare and Security by Dorothy F. Denning, Addison Wesley.

2. John Walkenbach, Herb Tyson, Michael R.Groh and FaitheWempen, “Microsoft Office
2010 Bible”, Wiley.

Page 22 of 53
 24CS101-PROGRAMMING IN C
Hours per week:
L T P C
2 0 4 4
PREREQUISITE KNOWLEDGE: Fundamentals of Problem Solving
COURSE DESCRIPTION AND OBJECTIVES:
This course is aimed to impart knowledge on basic concepts of C programming language and
problem solving through programming. It covers basic structure of C program, data types,
operators, decision making statements, loops, functions, strings, pointers, structures and
unions. At the end of this course, students will be able to design, implement, test and debug
complex problems using features of C.
MODULE- 1
16L+0T+32P=48 Hours
UNIT-1
INTRODUCTION TO ALGORITHMS AND PROGRAMMING LANGUAGES
Introduction to Algorithms: Introduction to computational thinking – Problem solving with
algorithms and Flowcharts-Introduction to C: Structure of a C program - pre-processor
statement, inline comments, variable declaration statements, executable statements; C Tokens
- C character set, identifiers and keywords, type qualifiers, type modifiers, variables, constants,
punctuations and operators.
Data Types and Operators: Basic data types; Formatted I/O; Reading and writing characters;
Operators - assignment, arithmetic, relational, logical, bitwise, ternary, address, indirection,
size of, dot, arrow, parentheses operators; Expressions - operator precedence, associative rules.
Control Statements: Introduction to category of control statements; Conditional branching
statements - if, if– else, nested-if, if – else ladder, switch case;
Iterative statements - for, while, do - while, nested loops; Jump statements - break, jump,
go to and continue.

UNIT-2
FUNCTIONS& POINTERS
User-defined functions: Function declaration - definition, header of a function, body of a
function, function invocation; Call by value, Call by address. Recursion; Library Functions;
Storage classes; Scope of a variable.
Pointers: Declaration, Initialization, Multiple indirection, Pointer arithmetic.
PRACTICES:
Questions on Data Handling
 Write a program to accept a number as input from the user which denotes the temperature
in Celsius, convert it to Fahrenheit reading and print it
 Write a C program to find maximum between two numbers using conditional operator.
 Write a C program to find maximum between three numbers using conditional operator.

Page 23 of 53
Questions on Decision Making
 Write a program to accept two numbers as input and print the greater of the 2 numbers
 Write a program to accept 3 numbers as input and print the maximum of the 3
 Write a program to accept a number as input and check if it is positive, negative or zero.
 Write a C program to check whether a year is leap year or not.
 Write a C program to find all roots of a quadratic equation.
 Write a C program to input marks of five subjects Physics, Chemistry, Biology,
Mathematics and Computer. Calculate percentage and grade according to following:
Percentage >= 90% : Grade A
Percentage >= 80% : Grade B
Percentage >= 70% : Grade C
Percentage >= 60% : Grade D
Percentage >= 40% : Grade E
Percentage < 40% : Grade F
Questions on Loops
 Write a program to accept a number as input print the sum of its digits
 Write a program to accept a number as input, reverse the number and print it
 Write a program to accept a number as input and check if it is an Armstrong number
 Write a program to accept a number as input and check if the prime number or not.
 Write a program to accept 2 numbers as input and find their LCM
 Write a program to accept a number as input and check if it is a palindrome
 Write a program to accept 2 numbers as input and print their HCF
 Write a program to accept a number as input and check if a number is strong number or
not.
 Write a program to generate prime numbers between two intervals given as input
 Write a program to accept a number N as input from the user and print the following
pattern. Sample N = 5.
1
12
123
1234
12345
 Write a program to accept a number N as input from the user and print the following
pattern. Sample N = 5.
A
AB
ABC
ABCD
ABCDE

Page 24 of 53
Questions on switch statement
 Write a C program print total number of days in a month using switch case.
 Write a C program to create Simple Calculator using switch case.
Questions on functions
 Write a C program to check whether a number is prime number or not using a function.
 Write a C program to check whether a number is an Armstrong number using a function.
 Write a C program to check whether a number is a perfect number using a function.
 Write a C program to swap two numbers using pointers.
 Write a program that finds and returns the sum, largest and average of three integer
numbers using a function and pointers.
 Write a C program to find factorial of any number using recursion.
 Write a C program to generate nth Fibonacci term using recursion.
 Write a C program to find GCD (HCF) of two numbers using recursion.

MODULE-2
16L+0T+32P=48 Hours
UNIT-1
ARRAYS & STRINGS
Arrays: Introduction; Types of arrays; Single dimensional array - declaration, initialization,
usage, reading, writing, accessing, memory representation, operations; Multidimensional
arrays. Passing arrays to functions; Relationship between arrays and pointers, Scaling up - array
of arrays, array of pointers, pointer to a pointer and pointer to an array; Dynamic memory
allocation functions – Creating arrays dynamically and performing operations on them.
Strings: Character array, Reading strings from the standard input device, displaying strings on
the standard output device, Importance of terminating a string, Standard string library
functions.
UNIT-2
STRUCTURES, UNIONS &FILES
Structures: Defining a structure, declaring structure variable, Operations on structures,
Pointers to structure - declaring pointer to a structure, accessing structure members using
pointer; Array of structures, Nested structures, passing structures to functions - passing each
member of a structure as a separate argument, passing structure variable by value, passing
structure variable by reference/ address; Typedef and structures.
Unions: Defining a union - declaring union variable, operations on union;
Files: Introduction to files, Streams, I/O using streams – opening a stream, closing stream;
Character input, Character output, File position indicator, End of file and errors, Line input and
line output, Formatted I/O, Block input and output.

PRACTICES:

Questions on 1-D Arrays

 Print the contents of an array from the left to the right
 Print the contents of an array from the right to the left
 Find the maximum and minimum elements in an unsorted array

Page 25 of 53
 Sort a given list of numbers in ascending order.
 Replace every element in an array with the sum of its every other element
 Reverse the elements of an array (in place replacement)
 Write a program to find the second largest and smallest elements in an unsorted array
Questions on Strings
 Implement the string length function
 Implement the string copy function
 Implement the string concatenate function
 Implement the string compare function
 Implement the count words function
 Implement the string reverse function
 Write a program to accept a string as input and check if it is a palindrome
 Implement the strstr function.
 Write a program to print the character in the string with the count where count is the
occurrence of the character
 Write a program to remove the duplicate characters in the given string
Questions on 2-D Arrays
 Print the contents of a 2D array in a zig-zag order
 Print the contents of a 2D array diagonal-wise
 Print the contents of a 2D array in the lower triangular order
 Find and print the maximum and minimum elements of each row of a matrix
 Write a program to find the sum of two matrices.
 Write a program that finds the product of two matrices.
 Write a program to find the transpose of a given matrix.
Questions on Files, Structures & Unions:
 Ramesh wants to do addition on complex numbers. He did it with regular practice but
Charan asked him to do with the help of structures by following below Criteria.
Write a C program that defines a structure named ‘Complex’ consisting of two floating
point members called “real and imaginary”. Let c1 and c2 are two Complex variables;
compute the sum of two variables.
Example:
c1= 2 8
c2= 6 4
Sum= 8.000000+12.000000i
 Write a C program to accept details of 'n' employee (eno, ename, salary) and display
the details of employee having highest salary. Use array of structure.
 Write a C program that creates a student file containing {Roll No, Student Name,
Address, Stream}, where the data will be inserted and display the list of students who
are in CSE (Stream=CSE).
Input: A file name
Output: The attributes such as Roll_No, Student_Name, Stream, Address.
Sample Input
201fa4200 Raja CSE Guntur
201fa4201 Bala IT Tenali
Sample Output

Page 26 of 53
 201fa4200 Raja CSE Guntur
 Write a C program that reads content from an existing text file and write the same in a
new file by changing all lowercase alphabetic character to upper case. (Existing file
may contain digit and special characters).
Example:
Input: Enter the file name.
Output: New file with updated content
 Write a C program to count the occurrences of the given string in a file.
Example:
Input: Enter the File name to read the string to be counted.
Output: Display the count of occurrences of the string.

SKILLS:
 Analysis of the problem to be solved.
 Select static or dynamic data structures for a given problem and manipulation of data items.
 Application of various file operations effectively in solving real world problems.
 Develop C programs that are understandable, debug gable, maintainable and more likely to
work correctly in the first attempt

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

Mapping
Blooms Module
No. Course Outcome with
Level No.
POs
Identify suitable data type for operands and design
1 Apply 1,2 1
of expressions having right precedence
Apply decision making and iterative features of C
2 Apply 1,2 1
Programming language effectively
Select problem specific data structures and suitable
3 Analyze 1,2 1,2
accessing methods
Design and develop non- recursive and recursive
functions and their usage to build large modular
4 Create 1,2 3
programs and also able to design string
manipulation functions
Develop C programs that are understandable,
5 debuggable, maintainable and more likely to work Evaluate 1,2 3,4
correctly in the first attempt

TEXT BOOKS:
1. Behrouz A. Forouzan, Richard F.Gilberg, “Programming for Problem Solving”, 1st edition,
Cengage publications, 2019.
2. Ajay Mittal, “Programming in C - A Practical Approach”, 1st edition, Pearson Education,
India, 2010.

Page 27 of 53
REFERENCE BOOKS:
1. Reema Thareja, “Computer Fundamentals and Programming in C”, 1stedition, Oxford
University Press, India, 2013.
2. Herbert Schildt, “C: The Complete Reference”, 4thedition, Tata McGraw-Hill, 2017.
3. Byron S Gottfried, “Programming with C”, 4thedition, Tata McGraw-Hill, 2018.

Page 28 of 53
 24CS102– PROBLEM SOLVING THROUGH PYTHON
Hours per week
L T P C
2 0 2 3

PREREQUISITE KNOWLEDGE: Prior knowledge of any programming language and

object-oriented concepts is helpful but not mandatory.

COURSE DESCRIPTION AND OBJECTIVES:

This course offers sufficient knowledge required to understand the fundamental concepts of
Python programming language. This course enables students to choose appropriate data
structures (lists, dictionaries, tuples, sets, strings) for the given problem. In addition, the
students will be able to create reliable, modular and reusable applications using Object- Oriented
Programming approaches. At the end they will get an idea of how to access database using
python programming, develop web applications, and using web Services using python
Programming.
MODULE-1
16L+0T+16P=32 Hours
UNIT-1
INTRODUCTION
Introduction to python, Variables, Assignment, Keywords, Built-in functions, Indentation,
Comments, Basic data types - integers, float, complex, Boolean, strings; Python program
development, running python using REPL shell, Python scripts.
Operators and Expressions: Operators- arithmetic operators, comparison (relational)
operators, assignment operators, logical operators, bitwise operators, membership operators,
identity operators; Expressions and order of evaluations.
Control Structures: Conditional control structures - if, else if, else; Loop control structures
- for, while, for... else, while…else, nested loops, break, continue, pass.

UNIT-2

PYTHON DATA STRUCTURES AND FUNCTIONS

Data Structures: Lists, Tuples, Sets, Strings, Dictionary - creation, accessing, basic operators
and methods; List comprehensions.
Functions: Defining functions, calling functions, Passing arguments - keyword arguments,
default arguments, positional arguments, variable-length arguments; Types of functions-
anonymous functions, fruitful function, recursive functions; Scope of the variables- global and
local variables, Development of recursive and non-recursive functions.

PRACTICES:
 Given two integers N1 and N2, write a program to find their product without using
multiplication (‘*’) operator and loops.
 Given two integers N1 and N2 having same value, write a program to check whether
N1 and N2 points to the same object or not.
 Given an Integer N, write a program to check whether given number is even or odd

Page 29 of 53
 without using modulus operator.
 Given coordinates of centre of a circle, radius and a point coordinate, write a program
to check whether the given point lies inside or on the circle, or outside the circle.
 Print the Nth prime number. you need to find the Nth prime number, where n is given
by user
prime numbers: 2, 3, 5, 7, 11, 13 ...
if n = 3 then prime = 5
Sample Input: 3
Sample Output: 5
 Write a program to find the sum of digits in a given integer.
 Given an integer N as an input, decides the geometrical figure for which the area has
to be calculated, for example N=1 for circle, N=2 for rectangle, and N=3 for triangle.
Write a program to display the area of the respective figure.
 Given an integer amount X, write a program to find the minimum number of currency
notes $ (500, 100, 50, 20, 10, 5, 2, 1) required for the given amount.
Input:
575
Where input is the amount for which we have to calculate the number of currency
notes.
Output: 4
Explanation: Total amount = 1(500-dollar note) + 1(50-dollar note) + 1(20-dollar
note) + 1(5-dollar note) = 575, hence the minimum number of notes required is 4.
 Given a list L of N numbers (integers), Write a program to find the sum of the
elements of given list L with the corresponding elements of the reverse of list L. If
list L has elements [1,2,3], then reverse of the list L will be [3,2,1] and the resultant
list should be [4,4,4].
 Given a positive integer number n. Write a program to generates a dictionary d
which contains (i, i*i*i) such that i is the key and i*i*i is its value, where i is from 1
to n (both included). Print the content of the dictionary d.
 Write a program to create a data structure to store student information such as regd
no, name, percentage of marks, phone number and display the student details based
on the order of percentage of marks.
 For a Given a string, design and implement functions to perform the following:
a) remove vowels in the given string.
b) count number of uppercase and lowercase letters.
c) remove all special characters.
d) check whether it is a palindrome or not.
e) swap case of each letter.
 Create a function that receives 3 numbers and returns the median, i.e. the number that
is not the min and not the max, but the one in between.
 Given two lists of integer numbers, write a function to perform the following
operations.
a. print elements that are common in both the lists. (Print without duplicates).
b. print elements that are present in the first list and not present in second list.
c. print elements that contain the first element of the first list and last element of
the second list.
d. print largest number of both the lists.
e. print smallest number of both the lists.

Page 30 of 53
  Create a function to find Common Elements in Two Lists Using Sets
 Implement a program to calculate GCD using recursive functions.
 Given two non-negative integers num1 and num2 represented as strings, return the
product of num1 and num2, also represented as a string.
Input: num1 = "2", num2 = "3"
Output: "6"
 Create a Python function that rotates a list by a specified number of positions to the
right. For instance, if the list is [1, 2, 3, 4, 5] and the rotation count is 2, the
resulting list should be [4, 5, 1, 2, 3].
Example:

Input: [1, 2, 3, 4, 5], 2

Output: [4, 5, 1, 2, 3]

Input: [1, 2, 3, 4, 5], -1

Output: [2, 3, 4, 5, 1]

Input: ['a', 'b', 'c', 'd'], 3

Output: ['b', 'c', 'd', 'a']

MODULE-2
16L+0T+16P=32 Hours
UNIT-1

MODULES, PACKAGES AND OOPS

Creating modules, Import Statement, From...Import Statement, Name Spacing, Creating user
defined modules.
Standard Modules: sys, math, date, time, os, random and itertools modules.
Packages: Package Initialization, Importing * From a Package, Sub packages.
Object Oriented Programming: Classes and Objects, Attributes and Methods, Constructors
and Destructors- ( init and del methods), Encapsulation - bundling of data and methods
within a class, promotes data integrity and prevents unauthorized access, use of access
modifiers to control access to attributes and methods; Inheritance, Method Overriding,
Polymorphism, Abstraction, Class and Instance Variables - Differentiate between class
variables (shared among all instances) and instance variables (unique to each instance), Access
Modifiers-access modifiers and their role in controlling access to class members. Operator
Overloading: customization of operators for user- defined classes- define methods such as
add, sub, mul , etc.

UNIT-2

ERRORS AND EXCEPTIONS AND FILES

Introduction to Exceptions, Handling Exception, Try Except Else and Finally Block, Raising
Exceptions.
File Processing: Reading and writing files -creating a new file, writing to a file, reading text files,
opening and closing files, reading, writing, tell (), seek (), rename ().

Page 31 of 53
PRACTICES:
 Program that defines a function large in a module which will be used to find larger of two
values and called from code in another module
 Write a program to find the number of lines, words and characters in the file.
 Write a program to append the data to an already existing file.
 Write a program that reads a file line by line. Each line read from the file is copied to
another file with line numbers specified at the beginning of the line.
 Define the following functions that are more robust to erroneous input data
a) To divide two numbers (To handle Zero Division Error).
b) To read two integer numbers and display them (To handle Value Error).
c) To display elements of a list (To handle Index Error).
d) To open a file and display file contents (To handle File Not Found Error).
 Write a python program to handle multiple exceptions using raise keyword.
 Write a program that uses class to store the name and marks of students. Use list to
store the marks in 3 subjects
 Write a program with class Employee that keeps a track of the number of employees in an
organization and also stores and display their name, designation and salary details.
 Write a program that has classes such as Student, Course and Department. Enroll a student
in a course of a particular department
 Write a program that has an abstract class Polygon. Derive two classes Rectangle and
Triangle from Polygon and write methods to get the details of their dimensions and
hence calculate the area.
 ● Write a Program that overloads the + operator on a class Student that has attributes
name and marks
 Write a Program to overload the - operator to subtract two Distance objects.
 Write a program to overload the * operator to multiply two complex numbers

Page 32 of 53
COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Analyze various features of programming
language and their application in problem
solving in computer programming to write, Analyze 1, 2
1 1
compile, and debug programs in python
language.
Make use of different data types to design
2 programs involving decisions, loops, and Apply 1 1, 2, 5
functions.
Analyze the usage of different
data structures for practical and contemporary Analyze 1, 2, 3, 5
3 1
applications for a given problem.
Choose appropriate programming paradigms,
interrupt and handle exceptions using files to Apply 1, 2, 3,5
4 propose solution through 2
reusable modules
Develop applications for a range of problems
Apply 1, 2,3,4,5
5 using object-orientedprogramming techniques. 2

TEXT BOOKS:

1. Kenneth A. Lambert, “The Fundamentals of Python: First Programs”, Cengage Learning,

2011.
2. Mark Lutz, “Learning Python”, 5th edition, Orielly Publishers, 2013.
3. Reema Thareja, ‘Python Programming using problem solving approach”, oxford
university press,2017
REFERENCE BOOKS:

1. Introduction to Computation and Programming Using Python. John V. Guttag, The MIT
Press.
2. James Payne, “Beginning Python using Python 2.6 and Python 3”, Wrox publishing.
3. Paul Gries, “Practical Programming: An Introduction to Computer Science using Python
3”, The Pragmatic Bookshelf, 2nd edition, 4 Oct. 2013.
4. Allen B. Downey, “Think Python”, 1st edition, Orielly publishing.

Page 33 of 53
 24EN101 – ENGLISH PROFICIENCY AND COMMUNICATION
SKILLS
Hours per week
L T P C
0 0 2 1

PREREQUISITE KNOWLEDGE: Basics of grammar, Read and understand for global

context, Cultural sensitivity and Basic writing skills.

COURSE DESCRIPTION AND OBJECTIVES:

English Proficiency and Communication Skills seeks to develop the students’ abilities in
grammar, speaking, reading, writing and overall comprehension skills. The course will provide
students an exposure on a wide range of language use in everyday situations. It will make the
students to equip with functional English and make them use it confidently in their professional
and social contexts. Finally,
students will strengthen their reading, writing, listening and speaking skills in English

MODULE-1
0L+0T+16P=16 Hours
UNIT-1
MY LIFE AND HOME – MAKING CHOICES – HAVING FUN
Reading: Understanding main message, factual information global meaning, specific
information and paraphrasing.
Writing: Developing hints based mail, Writing short messages/paragraphs.
Listening: Understanding short monologues or dialogues and choose the correct visual.
Speaking: Express simple opinions /cultural matters in a limited way.
Vocabulary: Discerning use of right word suiting the context, B1 Preliminary word
list.
Grammar: Frequency Adverbs, State Verbs, AFV and Prepositions.

UNIT-2

ON HOLIDAY - DIFFERENT FEELINGS – THAT’S ENTERTAINMENT!

Reading: Longer text for detailed comprehension, gist and inference.
Writing: Developing notes and responding to penfriends or ‘e-pals’.
Listening: Understand straightforward instructions or public announcements.
Speaking: Describing people, things and places in a photograph.
Vocabulary/Grammar: Comparatives and Superlatives, Gradable and non-gradable
adjectives, Cloze tests.

Page 34 of 53
PRACTICES:
 Developing hints based mail.
 Writing short message.
 Writing paragraphs.
 Expressing opinions and cultural matters.
 Understanding short monologues.
 Understanding straightforward instructions and public announcements.
 Describing people, things and places in a photograph.

MODULE-2
0L+0T+16P=16 Hours

UNIT-1

GETTING AROUND – INFLUENCES - STAY FIT AND HEALTHY

Reading: Reading for understanding coherence of the text and drawing inferences.
Writing: Reading an announcement from a magazine or website for preparing an
article.
Listening: Discussion activities and listening to understand the gist of each short
dialogue.
Speaking: Snap Talks, Make and respond to suggestions, discuss alternatives and
negotiate agreement.
Vocabulary / Grammar: Punctuation, Prepositions, Phrasal Verbs, B1 Preliminary
word list.

UNIT-2

LOOKS AMAZING! – THE NATURAL WORLD – EXPRESS YOURSELF!

Reading: Content, Communicative Achievement, Organisation and Language.
Writing: Developing a story with clear links to the given opening sentence.
Listening: An interview for a detailed understanding of meaning and to identify
attitudes
and opinions.
Speaking: Discuss likes, dislikes, experiences, opinions, habits, etc.
Vocabulary / Grammar: Modals, Conditionals, Verb forms (Time and Tense).

PRACTICES:
 Listening to understand the gist of each short dialogue.
 Listening to an interview for a detailed understanding of meaning and to identify attitudes
and opinions.
 Preparing an article.
 Discuss for alternatives and negotiate agreement.
 Discussion on likes, dislikes, experiences, opinions, habits, etc.

Page 35 of 53
SKILLS:
 Use of appropriate grammar and vocabulary with syntactic patterns in short texts.
 Read and extract the main message, global meaning, specific information, detailed
comprehension, understanding of attitude, opinion and writer purpose and inference.
 Listen to understand key information, specific information, gist and detailed meaning and
to interpret meaning.
 Understand questions and make appropriate responses and talk freely on everyday topics.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply to read and grasp content on a range of
topics/texts related to their everyday life like 7, 8, 9, 10,
1 Apply 1
notifications, advertisements, travel brochures, 12
news reports, articles.
Apply suitable strategies to achieve
comprehension, like listening for main points 7, 8, 9, 10,
2 Apply 1
and checking comprehension using contextual 12
clues etc.
Demonstrate vocabulary beyond that of the 7, 8, 9, 10,
3 Analyze 1, 2
familiar subjects. 12
Show sufficient control of English grammar
7, 8, 9, 10,
4 and sentence variety to coherently organise Evaluate 2
12
information at sentence and discourse levels.
Use functional English to communicate and 7, 8, 9, 10,
5 Create 2
interact effectively in everyday situations. 12

TEXT BOOKS:

1. Emma Heyderman and Peter May, “Complete Preliminary”, Student’s Book with Answers,
2nd edition, Cambridge University Press, 2019.

REFERENCE BOOKS:
1. Annette Capel and Rosemary Nixon, “Introduction to PET”, Oxford University Press, 2009.
2. Adrian Doff and Craig Thaine, “Empower Pre intermediate”, Cambridge University Press,
2015.
3. Louise Hashemi and Barbara Thomas, “Objective PET”, Cambridge University Press, 2010.

Page 36 of 53
 24EN102 – TECHNICAL ENGLISH COMMUNICATION
Hours per week
L T P C
2 0 2 3

PREREQUISITE KNOWLEDGE: Basic sentence formation, understanding contextual

meanings, basic writing skills and moderate fluency in English.

COURSE DESCRIPTION AND OBJECTIVES:

In this course students will read, analyze, and interpret material from technical and general
fields, and practice reading, writing, listening and speaking skills to gain exposure and
functional English on a variety of contemporary topics. The overall course objective is to
provide English for Specific Purposes(ESP) instruction to enhance students’ reading, writing,
listening and speaking skills through a practice in the language. It will aim to build students'
confidence and motivation through exposure to academic skills like Note making/taking,
Paraphrasing, Summarizing, Report Writing, Making Presentations etc., so as to generate
interest in the language from an ESP perspective. Finally, students are expected through the
course to gain key strategies and expression for communicating with professionals and non-
specialists.
MODULE-1
16L+0T+16P=32 Hours
UNIT - 1

GENETICS
Reading: Reading for Note Making Sub skills: Reading for global understanding (skimming),
specific information (scanning), understanding main ideas and supporting ideas, guessing
contextual meanings from the text. -Vocabulary building: commonly used roots, prefixes, and
suffixes.

Writing: Note making, organising main points and sub points, numbering and sequencing,
suggesting titles, paraphrasing and summarising. Functional grammar: Common Errors in
Articles and Prepositions (Handout).

Listening: Listening for Note Taking: top down and bottom up approach, listening for main
ideas and supporting points.

Speaking: Presentation in teams - ideas on the topic summarised, making a PPT, effective
introductions and conclusions, logical organisation of content, using appropriate structure and
cohesive devices.

Page 37 of 53
UNIT - 2
NEW-AGE ENTREPRENEURS
Reading: Reading: predicting, skimming, scanning, reading for inference, extrapolative
reading Vocabulary building: Academic vocabulary from the text: synonyms, antonyms,
Words often confused.
Writing: Paragraph writing; writing a topic sentence, supporting sentences, effective
introductions and conclusions, use of cohesive devices. Types of Paragraphs: Descriptive,
narrative, argumentative and expository. Functional grammar: Common Errors in Verb forms
and Conditional sentences (Handout) Model verbs.

Listening: Listening for identifying parts from a description, listening to and sorting
information, listening for specific information.

Speaking: Narrating/Retelling an incident, using suitable cohesive devices/discourse

markers Speaking of past and present habits/ activities/events - Speaking of future plans.

PRACTICES:
 Note making.
 Summarizing.
 Paragraph Writing.
 Reading Comprehension
 Error Correction and Restructuring.
 Vocabulary building.
 Process Description.
 Tenses.

MODULE-2
16L+0T+16P=32 Hours
UNIT - 1
SOCIAL MEDIA
Reading: Reading for factual information researching for supporting evidence - skimming,
scanning, Vocabulary building: One-word substitutes.

Writing: Letter Writing - E-mail writing – New age communication – Format, protocol, and
style- WhatsApp, Facebook and Twitter Functional grammar: Common Errors in Sub-Verb
Agreement and Modals.

Listening: Listening to a Business Presentation: Listening for deducing information, for

abstract details and specific details, listening for taking a message.

Speaking: Making a presentation with a PPT on a topic assigned- organising the presentation
using appropriate discourse markers - presenting a point of view - Extempore.

Page 38 of 53
UNIT - 2
HEALTH AND NUTRITION
Reading: Reading for data interpretation and information transfer from graphical aids to text
reports (pictograms. tables, graphs, pie charts, flow charts), deducing specific information and
general information -Vocabulary building: business vocabulary, collocations, idioms and
phrasal verbs.

Writing: Writing a Report: Drafting general and factual reports - writing an overview - an
effective introduction - organising information into paragraphs (Stages of writing: planning
/organising /writing /editing /rewriting) - Functional grammar: transformations and
miscellaneous common errors.

Listening: Listening to a Ted talk and sorting information – taking notes from a discussion.

Speaking: Group Discussion – prerequisites -generating content - initiating a discussion -

expressing one’s opinion ~ leading a discussion - agreeing/ disagreeing to someone’s view -
cutting into a speech - body language and voice modulation.

PRACTICES:
 E-mail writing.
 Letter writing.
 Report writing.
 Process Description
 Data Interpretation
 Messaging in Social media.
 Writing Reviews.
 Group Discussion

SKILLS:

 Apply different subskills like skimming, scanning, reading for information, reading for
inference etc. to understand different kinds of text.
 Apply different sub skills like top down, bottom up approaches to listening.
 Use functional vocabulary relevant to engineering and technology to express ideas lucidly.
 Use appropriate sentence structure, cohesive devices to construct simple text in regular
correspondence like e-mails and letters.

Page 39 of 53
COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

Mapping
CO Blooms Module
Course Outcomes with
No. Level No.
POs
Apply a variety of strategies to interpret and
6, 7, 8, 9,
1 comprehend spoken texts/ discourse using Apply 1
10, 12
contextual clues.
Apply appropriate reading strategies to interpret
6, 7, 8, 9,
2 content / material related to engineering and Apply 1
10, 12
technology domain.
Participate in discussions and make short 6, 7, 8, 9,
3 Analyze 1, 2
presentations on general and technical topics. 10, 12
Possess an ability to write clearly on topics
6, 7, 8, 9,
4 related to technology and workplace Evaluate 2
10, 12
communication.
Choose functional language, grammar structures,
6, 7, 8, 9,
5 cohesive devices and skills of organisation to Create 2
10, 12
express clearly in speaking.

TEXT BOOKS:

1. N P Sudharshana & C Savitha, “English for Technical Communication”, Cambridge

University Press, 2016.

REFERENCE BOOKS:

1. Balasubramanian T, “A Text book of Phonetics for Indian Students”, Orient Longman,

New Delhi, 1989.
2. Krishnaswamy, N and Sriraman, T, “Current English for Colleges”, Trinity publications,
2016.
3. Mohan Krishna and Meera Banerjee, “Developing Communication Skills”, Macmillan
India Ltd. New Delhi, 1990.
4. Ashraf Rizvi M, “Effective Technical Communication”, 2nd Edition, McGraw Hill
Education, 2017.
5. Narayanaswamy V R, “Strengthen your Writing”, Third Edition Orient Black Swan, New
Delhi, 2005.
6. Naterop, Jean, B. and Rod Revell, “Telephoning in English”, 3rd Edition Cambridge
University Press, Cambridge, 2004.

Page 40 of 53
 24MS101 MANAGEMENT SCIENCE

L T P C
2 2 0 3

PREREQUISITE KNOWLEDGE: Basic knowledge on the concepts of Management.

COURSE DESCRIPTION & OBJECTIVES: The objective of this course is to examine the
ramifications of managerial practices within the field of engineering and Students will
understand the significance of operation management and develop the ability to analyse the
markets, customers, competitors, and accordingly plan HR function effectively.

MODULE- 1
16L+16T+0P=32Hours
UNIT-1
INTRODUCTION TO MANAGEMENT
Concepts of Management and organization - nature, importance and Functions of Management,
Evolution of Management Thought - Taylor’s Scientific Management Theory, Fayol’s
Principles of Management, Administrative Management Theory, Mayo’s Hawthorne
Experiments, Maslow’s Theory of Human Needs, Herzberg’s Theory, Leadership Styles,
Corporate Social Responsibility in Indian perspectives.

UNIT-2
OPERATIONS MANAGEMENT
Principles of plant location, Principles and types of plant layout, Operations and productivity,
Project Management - Project Planning, Project Scheduling and Project Controlling, Need for
Inventory control, EOQ, ABC Analysis, Purchase Procedure and Stores Management.
Statistical process Control: Control Charts for variables – Setting Mean Charts Limits (X
Charts) and Setting Range Chart Limits (R Charts). Control Charts for attributes- P-charts and
C-charts.
PRACTICES:
 Design a comprehensive management strategy for a startup company, incorporating
elements of planning, organizing, leading, and controlling.
 Develop a quality management plan for a software development project, outlining
procedures for testing and validation with a view of project management procedure.
 Critically evaluate the effectiveness of different styles of leadership in crisis situations
versus during times of stability with suitable examples from different organisations.
 Determining the various statistical controlling methods such as, X and R Charts for a
specific company with the data.

MODULE- 2
16L+16T+0P=32Hours
UNIT- 1
HUMAN RESOURCES MANAGEMENT
Concepts of Human Resource Management, Basic functions of HR Manager - Manpower
planning, Recruitment, Selection, Training and Development, Placement, Wage and Salary
Administration, Promotion, Transfer, Separation, Performance Appraisal, Grievance Handling
and Welfare Administration, Job Evaluation and Merit Rating.

Page 41 of 53
UNIT- 2
MARKETING MANAGEMENT
Evolution of Marketing, Functions of Marketing Selling Vs Marketing, 4 P’s of Marketing –
Product Mix - Product Life Cycle, Place Mix – Channels of Distribution, Price Mix – Pricing
Methods, Promotion Mix – Tools of Promotions. 7p's of marketing - Product, Price, Promotion,
Place, People, Packaging, and Process.

PRACTICES:
 Select any Designation in an organization and describe its job description and job
specifications.
 Develop a procedure on how to deal with grievances at your work with suitable example.
 Analyze marketing mix competencies for product as well as services.
 Analyze the Product Mix strategies of a select company with appropriate examples.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to

Co Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Analyze the nature and consequence of 1,2,4,6,8,9,
1 Analyze 1
management. 11,12
Explore significance of operations 1, 2, 3,
2 Analyze 1
management. 4,5,7,10
Plan and control the HR function 1,2,3,4,5,6,
3 Apply 2
effectively. 8,11,12
Evaluate the markets, customers, and 1,2,4,5,6,7,
4 Evaluate 2
competition. 9,10

TEXT BOOKS:
1. Stoner, Freeman, Gilbert, “Management”, Pearson, 6th edition, 2018.
2. Aryasri, “Management Science”, McGraw Hill, 4th edition, 2014.

REFERENCE BOOKS:
1. Kotler Philip & Keller Kevin Lane, “Marketing Management”, Pearson, 15th Edition,2020.
2. Koontz & Weihrich, “Essentials of Management”, Mc Graw Hill,11th Edition, 2020.
3. PC Tripathi, PN Reddy & Ashish Bajpai “Principles of Management”, Mc Graw Hill, 7th
Edition, 2021.

Page 42 of 53
 24SA101 - ORIENTATION SESSION
Hours per week:
L T P C
0 2 0 1
PREREQUISITE KNOWLEDGE: Nil

COURSE DESCRIPTION AND OBJECTIVES:

This course is intended to help the students in getting adjusted with the new environment, to
develop bondage with other students and faculty along with learning the institutional policies.
The purpose of the orientation course is to create awareness on various issues that are essential
for any individual.
It engages with the new students as soon as they come into the institution, before regular classes
start. At the start, the incumbents learn about the institutional policies, processes, practices,
culture and values, and their mentor groups are formed under SAGE (Socializing, Associating,
Governing,Experiencing)

Objectives:
 To familiarize the fresh entrants with the new environment and system in engineering
education.
 To make the students a responsible citizens.
 To promote smooth transition from +2 level education to graduate program among
students.
MODULE-1
0L+8T+0P=8Hours
UNIT-1
Socializing: Interaction with faculty members, Deans, peers, student bodies and alumni.

UNIT-2
Associating: Eco-friendly practice and sustainable living, teaching sessions to school children
of adopted villages, Interaction with farmers and identifying the problems, Field Visits.

PRACTICES
 Stress assessment and management
 Sustainable living
 Iconic visit
MODULE-2
0L+8T+0P=8Hours
UNIT-1
Governing: Brief about regulations and assessment pattern, Interaction with the functionaries
i.e. Chancellor, Vice Chancellor and Registrar

UNIT-2
Experiencing: Physical activity, Creative arts, Literary activities, Customizing Daily routines
and Habits, Practicing Meditation

Page 43 of 53
PRACTICES
 Yoga and meditation
 Sports and Games
 Any of the one creative art

COURSE OUTCOMES:
Upon successful completion of the course, students will have the ability to:-

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Become familiar with the institute ethics and
1 Analyze 1 7,8,9,10,12
culture
Cope up with stress management through
2 Analyze 1 7,8,9,10,12
meditation
Socially conscious towards the society and
3 Apply 2 7,8,9,10,12
environment

4 Build bonds with peers and faculty members Apply 2 7,8,9,10,12

Page 44 of 53
 24SA103 - PHYSICAL FITNESS, SPORTS AND GAMES

Hours per week:

L T P C
0 0 2 1
PREREQUISITE KNOWLEDGE: Nil

COURSE DESCRIPTION AND OBJECTIVES:

Physical fitness is a state of health and well-being and, more specifically, the ability to perform
aspects of sports, occupations, and daily activities. Being physically active can improve brain
health, help manage weight, reduce the risk of disease, strengthen bones and muscles, and
improve ability to do everyday activities.

OBJECTIVES:
 To make an individual physically fit, mentally alert, emotionally balanced, socially well
adjusted, morally true and spiritually uplifted.
 To make them agile and efficient for hard work and effective instruments for the
achievement of their life’s objectives.

MODULE – 1 & 2
The activities proposed under physical fitness are -

 Yoga and meditation

 100 m
 400 m
 Push Ups
 Individual game warm up
 Volleyball, Basketball, Kabaddi, Kho Kho, Badminton and Football- Basic skills of the
game will be taught on rotation basis each week

PRACTICES:
 Yoga and meditation
 100 m
 400 m
 Push Ups

Page 45 of 53
 CO Blooms Module Mapping
Course Outcomes
No. Level No. with POs

Understand the knowledge about the

1 Analyze 1,2 1,2,6,9
practice of Yoga and its nature.

Make familiar with the different system

2 Apply 1,2 1,2,9,12
of the body.

Skills in explanation and demonstration

3 Apply 2 1,2,3,9,12
of meditation.

Understood the information about the

4 importance of diet and Evaluate 2 1,2,9,12
nutrition.

Ability to set up Yoga therapy center and

5 Create 1 1,2,3,9,12
skill to maintain case studies.

TEXT BOOKS:

1. Sachitra Yoga pradipika: B. K. S. Ayyanger, ISBN 9788125016779

2. Yoga Chaitanya Pradipika: Yogacharya Dr. Raparthi Ramarao, Telugu, Year
Published: 2003

REFERENCE BOOKS:
1. Asana pranayama Mudras Bandhas: Swami Satyananda Saraswati, Saraswati, Swami
Satyananda, and Janez Kristijan Hiti. Asana pranayama mudra bandha. Bihar, India: Yoga
Publications Trust, 1996.

Page 46 of 53
 24SA102 - SELF EMPOWERMENT & GENDER SENSITIZATION
Hours per week:
L T P C
0 0 2 1
PREREQUISITE KNOWLEDGE: Gender Sensitisation and Personality
Development

COURSE DESCRIPTION AND OBJECTIVES: To comprehend the dynamics of gender

roles and relations within social and cultural contexts, and to evaluate legal and behavioral
frameworks that promote gender equality and personal growth.
MODULE-I
0L+0T+16P=16Hours
UNIT-1
UNDERSTANDING GENDER:
Understanding of Gender, Gender Roles & relations, gender & culture, gender based violence,

UNIT-2
GENDER LAWS:
Gender & labour, Gender constitutional & Legal Perspectives.

PRACTICES:
▪ Conduct a survey on gender roles and relations in the banking and IT sectors to assess
employee attitudes and resistance to policy changes.
▪ Undertake a study to identify the impact of cultural perceptions on gender-based violence
and its effects on workplace productivity.
▪ Analyze the characteristics and components of gender laws to evaluate their effectiveness
in promoting labor rights and reducing gender discrimination.
▪ Perform a study on the determinants of gender roles and culture by reviewing media content
and social norms to understand their influence on attitudes.
▪ Conduct a comparative analysis of constitutional and legal perspectives on gender equality
to assess their impact on labor practices and gender sensitivity in various industries.

MODULE-2
0L+0T+16P=16Hours
UNIT-1
SELF EMPOWERMENT:
Types of personality, Good Manners & Etiquettes, Ways to develop positive attitude

UNIT-2

PERSONALITY DEVELOPMENT: Decision Making Skills, Interpersonal Skills, Time

Management, Stress Management, Conflict Management, Leadership Skills.

Page 47 of 53
PRACTICES:
▪ Survey on different personality types and their impact on workplace performance and team
dynamics.
▪ Undertake a study on the effectiveness of etiquette training programs in improving
professional interactions and workplace relationships.
▪ Analyze strategies for developing a positive attitude and their impact on employee
engagement and job satisfaction.
▪ Conduct a study on time management practices and their influence on productivity and
work-life balance.
▪ Perform a study on conflict management techniques and their effectiveness in resolving
workplace disputes and improving team cohesion.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

Mapping
CO Blooms Module
Course Outcomes with
No. Level No.
POs
Analyze the influence of gender roles and cultural
1 Analyze 1 3
norms on individual behavior and social structures.
Apply legal perspectives and gender laws to assess their
2 Apply 1 2
impact on gender equality and labor rights.
Analyze various personality types and develop
3 strategies to apply good manners and etiquette in Analyze 2 4
diverse settings.
Apply decision-making and time management skills to
4 Apply 2 6
enhance personal and professional effectiveness.
Analyze conflict management and leadership skills to
5 effectively handle interpersonal and organizational Analyze 2 1
challenges.

REFERENCES:

1. A World of Equals: A Textbook on Gender, Susie Tharu, Uma Maheswari Bhrugubanda

(2022), Orient Blackswan Pvt Limited
2. Chitra Chellam (2022), Personality Development, Sara Book Publication.

Page 48 of 53
 24SS101-CONSTITUTION OF INDIA
Hours per week:
L T P C
0 2 0 1

PREREQUISITE KNOWLEDGE: High School-level Civics and Social Studies.

COURSE DESCRIPTION AND OBJECTIVES:
To provide students with a basic understanding of Indian Polity and Constitution and make
students understand the functioning of government at the center and state level besides local
self-government. This course also equips students with knowledge pertaining to fundamental
rights and fundamental duties of a citizen in a democracy such as India.

MODULE-1
0L+16T+0P=16 Hours
UNIT-1
HISTORICAL BACKGROUND TO THE INDIAN CONSTITUTION
Meaning of the constitution law and constitutionalism; Historical perspective of the
Constitution of India; Salient features and characteristics of the Constitution of India.
UNIT-2
FUNDAMENTAL RIGHTS, DUTIES, DIRECTIVE PRINCIPLES, AND
AMENDMENT
Scheme of the fundamental rights - scheme of the Fundamental Right to Equality Article 14,
scheme of the Fundamental Right to certain Freedom under Article 19, scope of the Right to
Life and Personal Liberty under Article 21; Scheme of the Fundamental Duties and its legal
status; Directive Principles of State Policy – its importance and implementation; Amendment
of the Constitution - Powers and Procedure.

PRACTICES:
 Enactment of Constituent Assembly debates to further understand the rationale for the
provisions of the constitution.
 Fundamental Rights in our popular culture - discussion in the movie Jai Bhim.
 Understanding the application of DPSPs in the law making procedure of the country
 Critically evaluating the challenges in the amendment of the constitution- reference to
supreme court judgments.
MODULE-2
UNIT-1 0L+16T+0P=16 Hours
STRUCTURE AND FORM OF GOVERNMENT
Federal structure and distribution of legislative and financial powers between the Union and
the States; Parliamentary Form of Government in India – The constitution powers and status
of the President of India; Emergency Provisions-National Emergency, President Rule,
Financial Emergency.

Page 49 of 53
UNIT-2
LOCAL SELF GOVERNMENT
Local Self Government – Constitutional Scheme in India – 73rd and 74th Amendments (PRIs)

PRACTICES:
 Debate on the challenges to federalism in India.
 Critical presentation on the functioning of local self-government- references to the principle
of decentralization
 Analyzing the implementation of reservation for women/marginalized communities in the
local body elections.
 The financial challenges in the functioning of local self-governments- references to the
devolution of the funds by the Finance commission of India (Article-280)

SKILLS:
 Understanding the basics of the Indian constitution.
 Know the fundamental rights, fundamental duties, and Directive Principles of State Policy.
 Fair knowledge about the functioning of various institutions in a democracy.

COURSE OUTCOMES:
Upon successful completion of the course, students will have the ability to:

CO Blooms Module Mapping

CO’s
No. Level No. with PO’s
Analyze major articles and provisions of the Indian
1 Analyze 1 6,8,9,10,12
constitution.
Appreciation for the constitution and safeguarding
2 Apply 1 6,8,9,10,12
individual rights.
Evaluating functions of various organs of the State in
3 Evaluate 2 6,8,9,10,12
a democracy.
Evaluating distribution of powers at the various
4 Evaluate 2 6,8,9,10,12
levels of the Government

TEXTBOOKS:
1. PM Bhakshi, “Constitution of India”, Universal Law Publishing, 15th edition, 2018.
2. DD Basu “Introduction to Constitution of India”, LexisNexis Publishing, 23rd edition,
2018.

REFERENCE BOOKS:
1. B. R. Ambedkar, “The Constitution of India” Educreation Publishing, India, 2020.
2. Subhash Kashyap, “Our Constitution”, National Book Trust, India, 2nd edition, 2011.
3. Arun K. Thiruvengadam, “The Constitution of India: A Contextual Analysis”, Hart
Publishing India, 2017.

Page 50 of 53
 24SS102- INDIAN KNOWLEDGE SYSTEMS
Hours per week:
L T P C
0 2 0 1

PREREQUISITE KNOWLEDGE: High School – level knowledge on Indian history and

society.
COURSE DESCRIPTION AND OBJECTIVES:
The course introduces students to India’s rich and diverse knowledge traditions and heritage.
The profound insights, timeless wisdom, and diverse perspectives, originating from the ancient
past have played a major role in shaping the country’s cultural identity. The richness of India’s
intellectual heritage is vindicated by the existence of innumerable texts and thinkers in the
country. By exploring India’s knowledge traditions, the course aims to help students learn how
the country’s culture developed across the ages and to enable them look beyond conventional
methods in finding solutions to scientific and technological issues.

MODULE-1
0L+16T+0P=16 Hours
UNIT-1
Overview of Indian Knowledge Systems (IKS)
Definition, Scope, and Significance of Indian Knowledge Systems; Various fields of study in
IKS; Texts and sources of information for IKS; Vedic, Buddhist, Jain and other philosophies

UNIT-2
Ancient Contributions to Indian Knowledge Systems (IKS)
Contribution of ancient centers of learning; Contribution of prominent ancient philosophers

PRACTICES:
 Collecting information on Indian Knowledge Systems mentioned in the daily newspapers
that report on unearthing new archeological discoveries, technologies, artforms, etc.
 Engaging in practical application of traditional indigenous techniques such as Yoga,
Meditation, body art, martial arts viz. Karra saamu, etc.
 Group presentations on various indigenous sites of significance
 Poster display of profiles of prominent ancient philosophers

MODULE-2

0L+16T+0P=16 Hours
UNIT-1
Discipline-Specific Indian Knowledge Systems
Role of IKS within the discipline; Identifying and defining key concepts of IKS within the
discipline; Demonstration of IKS via real-life examples (of technology, machinery, practices,
artforms, architecture, etc.)

Page 51 of 53
UNIT-2
IKS in the Modern World
Relevance of IKS in Contemporary Society; Challenges and Opportunities in Preserving and
Utilizing IKS; Contributions of IKS to Global Knowledge Systems; Future Directions:
Integrating IKS with Modern Science and Technology

PRACTICES:
 Exploring native technology, strategies, and methodologies specific to the discipline.
 Documenting various indigenous knowledge traditions.
 Using internet to gain awareness on various indigenous intellectual properties that are at
risk of international appropriation.
 Group discussion on challenges to IKS from within the discipline

SKILLS:

 Analyzing and evaluating IKS practices in the context of modern challenges.

 Inculcates problem-solving skills by applying IKS principles to address contemporary
issues.
 Sharpens research skills by gathering and analyzing information related to IKS.
 Inspires to work with others in preserving and promoting IKS.
 Motivates to learn and practice traditional skills like weaving, pottery, herbal medicine, etc.

COURSE OUTCOMES:

Upon successful completion of the course, students will have the ability to:

Mapping
CO Blooms Module
CO’s with
No. Level No.
PO’s
To understand the history, ancient knowledge and
6, 9, 10,
1 cultural practices of the people of India and apply its Apply 1, 2
12
relevance to contemporary world
To analyze various case-studies from ancient India in
6, 9, 10,
2 the fields of science, technology, psychology, and Analyze 1, 2
12
society
To analyze global implications of protecting 6, 9, 10,
3 Analyze 1, 2
indigenous knowledge systems 12
To revive and revitalize ancient knowledge and
evaluate the applicability of the concepts to 6, 9, 10,
4 Evaluate 1, 2
contemporary scientific/technical methods, 12
individual well-being and society at large

Page 52 of 53
TEXTBOOKS:

1. B. Mahadevan, Vinayak Rajat Bhat, Nagendra Pavana R. N., “Introduction to Indian

Knowledge System: Concepts and Applications”, PHI Learning Private Limited, Delhi,
2023.
2. Mukul Chandra Bora, “Foundations of Bharatiya Knowledge System”, Khanna Book
Publishing, 2023.

REFERENCE BOOKS:

1. Dhirendranath Banerjee and Sanjit Kumar Sadhukan (ed.), “Ancient Indian Scientific
Thought and Modern Theories: An Overview”, National Mission for Manuscripts and D.
K. Printworld, 2019.
2. Shaik Taufiq Khalil, “Indian Knowledge System: Arthshastra by Kautilya”, Notion Press,
2023.
3. Chauhan Bhag Chand, “IKS: The Knowledge System of Bharata”, Garuda Prakashan,
2023.

Page 53 of 53
 CSE - II Year I Semester

24MT203 DISCRETE MATHEMATICAL

STRUCTURES
Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Basic of set theory, Algebra.

Source: https://www.
amazon.in/Discrete-
COURSE DESCRIPTION AND OBJECTIVES: Mathematical-Structures-
The course objective is to provide students with an overview of discrete mathematics. Students will Dr-D-S-C/dp/9388478398

learn about of group and expected to demonstrate analytical and combinatorial methods such as
propositional logic , Mathematical Induction, Boolean functions, combinatorial ,recurrence relation,
generating function and graph theory

MODULE-1
UNIT-1 8L+8T+0P=16 Hours

ALGEBRAIC STRUCTURES AND BOOLEAN ALGEBRA

Group: Group, Subgroup, Lagrange’s theorem, Introduction to rings and fields.
Boolean algebra: Boolean algebra, Truth table, Basic logic gates, Postulates of Boolean algebra,
Principle of duality, Propositions, Connectives, Equivalence of Boolean functions.

UNIT-2 8L+8T+0P=16 Hours

APPLICATIONS OF LOGIC & BOOLEAN ALGEBRA

Normal form: CNF, DNF, CDNF, CCNF, Conversion of CNF to DNF and vice versa. Minimization of
Boolean function (Karnaugh Maps), Generalized Pigeonhole Principle.

PRACTICES:
● Determine order of an element of group.
● Determine the order of a subgroup of a finite group.
● Determine whether algebraic structure is a Ring or a Field.
● Construct Truth table of propositions.
● Check whether propositions are equivalence.
● Obtain CNF, DNF of expression.
● Draw 2 – variables, 3-variables K-map.
● Minimize the Boolean function by K-map.
● Simplify the Boolean expression using Boolean algebra laws.
● Determine the homogeneous solution and particular solution for recurrence relation.
● Switching Circuit in Boolean algebra, Combination of two switches in a Circuit

MODULE-2
UNIT-1 8L+8T+0P=16 Hours

COMBINATORICS AND GRAPH THEORY

Combinatorics: The basics of counting, Permutations and combinations, Discrete Numeric Functions.
Recurrence relations and Generating functions.
Graph theory: Graph terminology, Special types of graphs, Connected graph, Weighed graph, Graph
Isomorphism, Euler and Hamiltonian paths and circuits, Planar graphs, Bipartite graph, Tree.

VFSTR 53
 CSE - II Year I Semester

SKILLS: UNIT-2 8L+8T+0P=16 Hours

 Familiarity of
concepts of APPLICATIONS OF COMBINATORICS AND GRAPHS
statements, logic
and truth tables.
Graph Coloring, Chromatic number, Matrix representation of graph, DFS, BFS algorithms, Minimum
spanning tree, Kruskal’s and Prim’s algorithms.
 Analyze closed
form of discrete
numeric PRACTICES:
function. ● Represent sequence by Generating function.
 Know some ● Solve Generation function by recurrence relation.
basic properties
of graphs,
● Find degree of digraph and undirected graph.
trees and ● Identify Isomorphic graph, Euler circuit, Hamiltonian circuit.
related discrete ● Determine matrix representation of graph.
structures.
● Determine the regions of planer connected graph.
● Draw Kn, Km,n.
● Determine the chromatic number of graphs.
● Find the weight of minimum spanning tree.
● Find number of arrangements that are possible.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply the concepts of mathematical logic and
1 Apply 1 1, 2, 9, 10, 12
Boolean algebra.
2 Apply Karnaugh map to minimize. Apply 1 1, 2, 9, 10, 12
3 Solve generating function by recurrence relations. Apply 2 1, 2, 9, 10, 12

Model and solve real world problems using graphs

4 Apply 2 1, 2, 9, 10, 12
and trees.

TEXT BOOKS:
1. Tremblay, J.P. and Manohar. R, “Discrete Mathematical Structures with Applications to Computer
Science”, 30th Reprint, Tata McGraw Hill Pub. Co. Ltd, New Delhi, 2017.
2. Rosen, K.H., “Discrete Mathematics and its Applications”, 7th Edition, Tata McGraw Hill Pub.
Co. Ltd., New Delhi, 2018.

REFERENCE BOOKS:
1. R.P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied Introduction”, 4th Edition,
Pearson Education Asia, Delhi, 2017.
2. S. Lipschutz and Mark Lipson., “Discrete Mathematics”, Schaum‘s Outlines, Tata McGraw Hill
Pub. Co. Ltd., New Delhi, 2021.
3. T. Koshy, “Discrete Mathematics with Applications”, Elsevier Publications, 2015.
4. S B Singh. “Discrete Structures”, Khanna Book Publishers Co-Pvt. Ltd. 2019.

VFSTR 54
 CSE - II Year I Semester

22TP201 DATA STRUCTURES

Hours Per Week :

L T P C
2 2 2 4
PREREQUISITE KNOWLEDGE: Programming in C.
Source: https://
www.youtube.com/
COURSE DESCRIPTION AND OBJECTIVES: watch?v=Qmt0QwzEmh0
This course is aimed at offering fundamentals concepts of data structures and explains how to implement
them. It begins with the basic concepts of data, data structures and then introduces the primitive and
non-primitive data structures in detail. It forms the basis for understanding various ways of representing
data and its usage in different computing applications.

MODULE-1
UNIT-1 6L+6T+6P=18 Hours

DATA STRUCTURES BASICS

Basic Terminology – data, information, datatype; Data Structures – Introduction, storage structures-
sequential and linked storage representations; classification of data structures; Applications of data
structures.
Sorting: Selection Sort, Bubble Sort, Insertion Sort, Quick Sort and Merge Sort.
Searching: Linear Search and Binary Search.

UNIT-2 10L+10T+10P=30 Hours

LINKED LISTS AND STACKS, QUEUES

Linked List: Introduction, Types of linked list – Singly linked list, doubly linked list and circular linked
list, representation of linked list, Operations of linked list: Traverse forward/ reverse order, searching,
insertion and deletion; Applications of linked lists.
Stack – Introduction, array and linked representations, implementation and their applications; Queue
– Introduction, array and linked representations, implementation; Types – Linear, circular and doubly
ended queues – operations; Applications of Queues.

PRACTICES:

PROBLEMS ON RECURSION – LEVEL 1

● Find the product of 2 numbers using recursion.
● Find the sum of natural numbers using recursion.
● Find the factorial of a number using recursion.
● Find the Nth term of Fibonacci series using recursion.
● Calculate the power using recursion.
● Write a recursive program for checking if a given number is a prime number.
● Given two integers write a function to sum the numbers without using any arithmetic operators.
● Convert a decimal to binary using recursion.
● Print all factors using recursion.
● Find the maximum product of digits among numbers less than or equal to N.

VFSTR 55
 CSE - II Year I Semester

SKILLS: PROBLEMS RECURSION – LEVEL 2

 Experienced to ● Implement insertion sort recursively.
Store data and
various types of ● Write a program to find the numbers less than N that are product of exactly 2 distinct prime
data to handle. numbers - using recursion.
 Ordering and ● Implement selection sort recursively.
sorting of data. ● Find the middle of a singly linked list using recursion.
 Indexing and ● Find the sum of even numbers of an array using recursion.
Searching of
● Check if a given array is in sorted order using recursion.
required data
from large data ● Print alternate nodes of a linked list using recursion.
sequences. ● Reverse a doubly linked list using recursion.
 Exposed ● Write a recursive function that returns all permutations of a given list.
to various
characteristics
● Implement bubble sort recursively.
such as Linear
or non-linear, PROBLEMS ON SORTING AND SEARCHING – LEVEL 1
Homogeneous ● Implement the insertion sort function.
or
heterogeneous ● Implement the bubble sort function.
and Static and ● Implement the quick sort function.
Dynamic.
● Implement the merge sort function.
● Implement the selection sort function.
● Implement linear search function.
● Implement binary search function.

PROBLEMS ON SLL – LEVEL 1

● Implement the insert function to insert nodes into a singly linked list (ascending order).
● Implement the insert function to insert nodes into a singly linked list (descending order).
● Implement the search node function.
● Implement the delete node function.
● Display forwards function.
● Display backwards function.
● Count the number of nodes in a singly linked list.
● Swap alternate nodes of a singly linked list.
● Move last node to the front of the linked list.
● Move first node to the last of the linked list.

PROBLEMS ON STACKS – LEVEL 1

● Implement two stacks using a single array.
● Given an array replace every element with nearest greater element on the right.
● Given a stack reverse the elements using only push and pop functions.
● Postfix evaluation using stack.
● Balance symbols.
● Find middle element in a stack.
● Remove middle element from a stack.
● Implement push and pop using linked list.
● Given an array of characters with the middle marked by X, check if the string is a palindrome.
● Maximum sum in sliding window.

PROBLEMS ON QUEUES – LEVEL 1

● Write a program to accept two numbers as input check if they are equal.
● Write a program to accept two characters as input and check if they are equal.
● Write a program to accept two numbers as input and print the greater of the 2 numbers.
● Write a program to accept two numbers as input and print the lesser of the 2 numbers.
● Write a program to accept 3 numbers as input and print the maximum of the 3.

VFSTR 56
 CSE - II Year I Semester

● Write a program to accept 3 numbers as input and print the minimum of the 3.
● Write a program to accept a number as input and print EVEN if it is an even number and ODD
if it is an odd number.
● Write a program to accept a number as input and check if it is divisible by 3. If it is divisible by
3 print YES else print NO.
● Write a program to accept a number as input and check if it is divisible by both 3 & 5. If it is
divisible print YES else print NO.
● Write a program to accept a number as input and check if it is positive, negative or zero.

PROBLEMS ON DLL – LEVEL 1

● Implement insert function.
● Implement display forward function.
● Implement display backward function.
● Implement search function.
● Implement delete function.
● Reverse a doubly linked list from M to N.
● Find the sum of the odd and even nodes.
● Count odd keys of the linked list.
● Merge two sorted lists.
● Delete adjacent duplicate nodes.

PROBLEMS ON CLL – LEVEL 1

● Insert function (circular doubly linked list).
● Search function.
● Display forward.
● Display backward.
● Delete node (circular doubly linked list).
● Print the middle N nodes of a circular singly linked list.
● Move the last node of a circular singly linked list to the beginning.
● Delete adjacent duplicate nodes of a circular singly linked list.
● Delete nodes greater than a value from a circular doubly linked list.
● Find the sum of the nodes of a circular linked list.

PROBLEMS ON LINKED LIST – LEVEL 2

● Given 2 sorted linked lists, print the common elements.
● Reverse a list (using Stack).
● Given a pointer to a node (not the last node), delete the node.
● Reverse a list (Recursive).
● Reverse a list (Iterative).
● Reverse a singly linked list in pairs (recursive).
● Reverse a singly linked list in pairs (iterative).
● Check if a singly linked list is a palindrome or not.
● Remove the loop if exists.
● Given 2 linked lists with data in the ascending order, merge them into a single list.

MODULE-2
UNIT-1 8L+8T+8P=24 Hours

TREES
Trees: Basic Terminology, Types of Trees, Binary Tree – Introduction, properties, array and linked
representations; Tree traversals and their implementation; Expression trees; BST – definition and
operations, AVL trees – definition and construction; Applications of binary trees.

VFSTR 57
 CSE - II Year I Semester

UNIT-2 8L+8T+8P=24 Hours

GRAPHS & HASHING

Graphs: Basic Terminology, Types of Graphs, Graphs representations – adjacency matric, adjacency
list; Traversals - breath first search and depth first search; Applications of graphs.
Hashing: Introduction, Different hash functions, collision: avoidance and handling methods.

PRACTICES:

PROBLEMS ON BST – LEVEL 1

● Insert function.
● Insert function (recursive).
● Search function.
● Pre order traversal.
● Post order traversal.
● In order traversal.
● Level order traversal.
● Delete child node.
● Delete parent node.
● Delete nodes greater than a value from a circular doubly linked list.

PROBLEMS ON PRIORITY QUEUES – LEVEL 1

● Meeting rooms problem.
● Ugly number.
● Find median from data stream.
● Find the top K frequent elements.
● Find K Pairs with smallest sums.
● Find the Kth smallest element in a sorted matrix.
● Trapping Rain Water.
● Rearrange String k distance apart.
● Sort characters by frequency.
● Solve the maze problem.

PROBLEMS ON GRAPHS – LEVEL 1

● Implement Graph data structure.
● Implement BFS - iterative solution.
● Implement BFS - recursive solution.
● Implement DFS - iterative solution.
● Implement DFS - recursive solution.
● Check if given graph is strongly connected or not.
● Check if given graph is strongly connected or not - using DFS.
● Given a graph find the arrival and departure time of its vertices in DFS. Arrival time is the time
when the vertex was explored for the first time, and departure time is the time at which all the
neighbours are explored and are ready to backtrack.
● Given a directed acyclic graph and a source vertex, find the cost of the shortest path from
source vertex to all other vertices present in the graph. If a vertex cannot be reached from
given source vertex that distance may be printed as infinite.
● Given an undirected graph, check if the graph is 2 edge connected or not.

PROBLEMS ON HASHING – LEVEL 1

● Print a binary tree in vertical order.
● Find whether an array is subset of another array.
● Given an array A [ ] and a number x, check for pair in A [ ] with sum as x.

VFSTR 58
 CSE - II Year I Semester

● Minimum operation to make all elements equal in array.

● Maximum distance between two occurrences of same element in array.
● Check if a given array contains duplicate elements within k distance from each other.
● Find duplicates in a given array when elements are not limited to a range.
● Most frequent element in an array.
● Smallest subarray with all occurrences of a most frequent element.
● First element occurring k times in an array.

PROBLEMS ON GRAPHS – LEVEL 2

● Find the shortest graph distances between every pair vertex in a given path. Assume that the
graph does not have any negative edges.
● Find the shortest graph distances between every pair of vertices in a given path. The graph
can have negative edges.
● Detect cycle in DFS.
● Count the number of connected components of a graph represented in the adjacent matrix.
● Count the number of connected components of a graph represented in the adjacent matrix -
using DFS.
● Find a spanning tree - not necessarily a minimum spanning tree.
● Detect cycle in an undirected graph.
● Given an undirected graph, find its depth.
● Determine if a directed graph has a unique topological ordering.
● Given a directed acyclic graph and two vertices v and w, find the lowest common ancestor.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Explore the organization of several ADTs and
1 the manipulation (searching, insertion, deletion, Apply 1,2 1
traversing) of data stored in various data structures.
Apply different data structures to solve a given
2 Apply 1,2 1
problem.
Analyze the efficiency of using different data
3 structures and choose the efficient data structure Analyze 1,2 2
for solving a given problem.
4 Develop new algorithms to solve various problems. Create 1,2 3,4

TEXT BOOKS:
1. Reema Thareja, “Data Structures Using C”, 2nd Edition, Oxford University Press, 2014.
2. Seymour Lipschutz, “Data Structures with C”, 1st Edition, McGraw Hill Education, 2017.

REFERENCE BOOKS:
1. Ellis Horowitz and Sartaj Sahni, “Fundamentals of Data Structures”, illustrated edition, Computer
Science Press, 2006.
2. Richard F. Gilberg and Behrouz A. Forouzan, “Data Structures: A Pseudocode Approach with
C”, 2nd Edition, CENAGE Learning, 2005.
3. R G Dromey and Pearson, “How to solve it by Computer”, 2nd edition, Impression edition,
1998.

VFSTR 59
 CSE - II Year I Semester

22CS201 DATABASE MANAGEMENT

SYSTEMS
Hours Per Week :

L T P C
2 2 2 4

PREREQUISITE KNOWLEDGE: Discrete Mathematical Structures.

Source: https://
www.youtube.com/
COURSE DESCRIPTION AND OBJECTIVES:
watch?v=lDpB9zF8LBw
This course presents an introduction to database management systems with an emphasis on how to
organize, maintain and retrieve data efficiently from a relational database. It also focuses on requirements
gathering and conceptual, logical, physical database design. The objective of the course is to enable
the student to understand database design, expressing queries using SQL, query optimization and
transaction processing.

MODULE-1
UNIT–1 10L+6T+4P=20 Hours

DATABASE SYSTEM CONCEPTS

Databases And Database Users: Introduction; Characteristics of the database approach; Actors on
the scene; Advantages of using DBMS approach.
Database System Concepts and Architecture: Data models, Schemas and instances; Three-Schema
architecture and data Independence; Database languages and interfaces; The database system
environment; Centralized and Client-Server architectures for DBMS.
Conceptual Data Modeling and Database Design: Entity types, Entity sets, Attributes and keys;
Relationship types, Relationship sets, Roles and structural constraints; Weak entity types; Relationship
types.

UNIT–2 6L+10T+12P=28 Hours

RELATIONAL DATABASE DESIGN

Relational Database Design by ER–To-Relational Mapping: Relational Database design using ER-
to-Relational mapping.
The Relational Data Model and Relational Database Constraints: Relational model concepts;
Relational model constraints and Relational database schemas.
Relational Algebra: Unary relational operations - SELECT and PROJECT; Relational algebra operations
from set theory; Binary relational operations - JOIN and DIVISION.
SQL: SQL data definition and data types; specifying constraints in SQL, Basic retrieval queries in SQL;
INSERT, DELETE, and UPDATE statements in SQL.

PRACTICES:
● Design ER Model for various real time database applications.
● Development of Relational Database schemas for Company/Student/Sailors/ using DDL
constructs of SQL.
● Apply various DML Commands such as select, insert, update etc. of SQL on Relational Database.
● Design of Relational Database schemas by specifying different types of Constraints.
● Apply various Relational Database operators (Arithmetic, Logical &comparison) and string-
matching constructs of SQL.
● Expressing queries using Aggregate Functions of SQL on Relational Database.
● Queries on Relational Database using GROUP BY, HAVING and ORDER BY clauses of SQL.

VFSTR 60
 CSE - II Year I Semester

MODULE-2 SKILLS:
 Develop E-R
UNIT–1 8L+8T+12P=28 Hours model for real
life applications.
NORMALIZATION
 Design of
Complex Queries, Triggers, Views: More complex SQL retrieval queries; Specifying constraints as relational
assertions and actions as triggers; Views (virtual tables) in Pl/SQL. databases
for real world
Basics of Functional Dependencies and Normalization for Relational Databases: Informal applications.
design guidelines for relation schemas; Functional dependencies-inference rules, equivalence and  Devise queries
minimal cover; Normal forms based on primary keys; Boyce-Codd normal form; Properties of relational using relational
decompositions, multi valued dependency, join dependencies. algebra and
SQL.

UNIT–2 8L+8T+4P=20 Hours  Analyze

transaction
TRANSACTION PROCESSING processing,
concurrency
Introduction To Transaction Processing Concepts and Theory: Introduction to transaction control and
processing; Transaction and system concepts; Desirable properties of transactions; Characterizing recovery
techniques
schedules based on serializability.
Concurrency Control Techniques: Two-phase locking techniques for concurrency control, concurrency
control based on timestamp ordering.
Database Recovery Techniques: Recovery concepts; Shadow paging; The ARIES recovery algorithm.
Indexing Structures for Files and Physical Database Design: Single level and multi-Level indexing;
Dynamic multi-level indexing using B-trees and B+ trees.

PRACTICES:
● Design and Development of company database and expressing Nested queries using SQL.
● Design and Development of student database and specifying queries using set operations.
● Design and Development of sailor’s database and specifying queries using different types of JOINs.
● Implementation of PL/SQL programs with Control Structures.
● Implementation of PL/SQL programs with Procedures.
● Implementation of PL/SQL programs with Function.
● Implementation of PL/SQL programs with Triggers.
● Creation and dropping of VIEWS.
● Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F = {CH
-> G, A -> BC, B -> CFH, E -> A, F -> EG} is a set of functional dependencies (FDs) so that F+
is exactly the set of FDs that hold for R. How many candidate keys does the relation R have?
● Apply various DCL and TCL constructs of SQL on Relational Database.

VFSTR 61
 CSE - II Year I Semester

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
1 Develop an E-R model for real life applications. Apply 1 1,10
Design and normalize databases for real time
2 Create 1 1,3
applications.
Devise queries using Relational Algebra and
3 Analyze 2 2
SQL.
Express queries using database tools like Ora-
4 Apply 2 5,10
cle, DB2, MYSQL.

TEXT BOOKS:
1. Ramez, Elmasri and Shamkant B. Navathe, “Fundamentals of Database Systems”, 7th Edition,
Pearson Education, 2016.
2. Raghu Rama Krishnan and Johannes Gehrke, “Database Management Systems”, 3rd Edition,
Tata McGraw Hill, 2013.

REFERENCE BOOKS:
1. Abraham Silberschatz, Henry F.Korth and S.Sudarshan, “Database System Concepts”, 7th
edition, Tata Mc Graw Hill,2019.
2. Allen G. Taylor “Database Development for Dummies” 1st Edition, 2011
3. C. J. Date “Introduction to Database Systems” 7th Edition, Addison Wesley, 2003.

VFSTR 62
24CS208
 CSE - II Year I Semester

24CS205 FRONT-END APPLICATION

DEVELOPMENT
Hours Per Week :

L T P C
0 2 2 2
PREREQUISITE KNOWLEDGE: OOPs through JAVA. No Previous Development Experience
Source: https://www. Required. Access to various Open -Source (Free)Software.
geeksforgeeks.org/
best-way-to-start-
with-competitive- COURSE DESCRIPTION AND OBJECTIVES:
programming- This course covers web development principles such as static webpage design, building a simple HTML
geeksforgeeks-
cp-live-course/ text site, styling web pages with CSS, and programming websites using Javascript.
MODULE-1
UNIT-1 0L+0T+8P=8 Hours
WEB PAGE DESIGNING:
Web technologies, WWW, website, web browser, web server, global and local impact of web
technologies on modern society.
HTML: Creating structured documents, Links and navigation, Tables, Forms, and Frames.
HTML 5: Introduction to HTML5, The HTML5 Canvas, HTML5 audio and Video.
UNIT-2 0L+0T+8P=8 Hours
CSS: INTRODUCTION
CSS Syntax, CSS selectors: (ID, Class, Tags, Attributes)
CSS Properties: Align-Content, Align-items, Align-self, Animation.
PRACTICES:
● Design a webpage having four frames named a) Top, b)Center, c)Bottom, and d) Left. The top
frame should contain the company logo and title. The bottom frame should contain copyright
information. The left frame should contain various links like Home, Products, Services, Branches,
About, etc., When clicked on respective links, the content should display on the center frame.
● Design a catalog page that should contain the details of all the books available on the website
in a table. The details should contain the following: a) Snapshot of Cover Page b) Author Name
c) Publisher. d) Price. e) Add to cart button.
● Design a timetable schedule for your current semester using the Table tag.
● Design a HTML page for Student Registration Form using Form Elements that includes Form,
input upload.
● Write a HTML program with at least two <h1>, two images, two buttons and appropriate CSS
to display,
● All <h1> with font-size 12pt, and italic in Verdana font using Inline CSS.
● All <img> with border color red, thickness 15px using Document Level CSS
● All <input type=’button’> should change background color to red on mouse over them
using External CSS.
● Design a web page to display the videos on-page, on user selection using frames and HTML5
tags.
● Design a web page to display different types of objects using HTML5 Canvas.
MODULE-2
UNIT-1 0L+0T+8P=8 Hours
JAVASCRIPT
JAVASCRIPT: Learning JavaScript-how to add scripts to your page, DOM, Variables, Operators, JavaScript Data Types,
JavaScript Special Characters.

VFSTR 70
 CSE - II Year I Semester

UNIT-2 0L+0T+8P=8 Hours

SKILLS:
JavaScript Arrays, JavaScript Boolean, Loops, For-In, For, Do-While, While Loops, JavaScript Events. Built in Objects, Form
 .
and regular expression, Validation.
PRACTICES:
● Write Java script programs to demonstrate the following objects with atleast five methods: a)
Math b) String c) Array c) Date
● Write a Java script program to display message on OnBlur and OnFocus events
● Design a HTML page having a textbox and four buttons viz Factorial Fibonacci Prime and
Palindrome. When a button is pressed an appropriate java script function should be called to
display the following
● Factorial of that number.
● Fibonacci series up to that number.
● Prime numbers up to that number.
● Is it Palindrome or not?
● Design a web page that contains a color pallet, when the user moves the mouse to the particular
area, then it changes the background color of the web page.
● Write JavaScript Function to modify Style of the Paragraph Text.
● Design a registration page to validate the following fields using Java Script.Make sure the user
name starts with an upper case letter.
● The user name must have at least one digit.
● Ensure that Email is valid.
● Ensure that the password length is between 8 to 20 characters.
● Make sure the password contains at least one upper case letter, one lower case, and one
special character exclude [ . dot, , comma, ; semi colon, :colon].
COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Module Mapping
Course Outcomes Blooms Level
No. No. with POs
Usage of HTML, HTML5, CSS, Java Script in
1 Apply 1,2 1
web application development.
2 Create sand style webpages with html and css. Understanding 1 2
Analyze JavaScript frameworks and how they
3 can be utilized to save time when writing custom Apply 2 4
Javascript code.
4 Design and develop Script Forms,Validation. create 2 1

TEXT BOOKS:
1. Learning Web Design:A beginners guide to HTML,CSS,Javascript and Web Graphics,By
Jennifer Niederst Robbins.
2. Eloquent JavaScript, by Marijn Haverbeke.
3. HTML And CSS: Design And Build Website by Jon Duckett.
4. JavaScript And JQuery: Interactive Front-End Web Development by Jon Duckett.
5. Front-End Development: The Big Nerd Ranch Guide, by Chris Aquino and Todd Gandee.

REFERENCE BOOKS:
1. JavaScript: The Good Parts, Book by Douglas Crockford
2. JavaScript and JQuery: Interactive Front-End Web Development, Book by Jon Duckett
3. JavaScript for dummies.
4. Head First JavaScript (English, Morrison Michael).

VFSTR 71
 24CS299 - DESIGN THINKING AND ENGINEERING ORIENTATION
Hours per week:
L T P C
0 0 2 1
PREREQUISITE KNOWLEDGE: NIL
COURSE DESCRIPTION AND OBJECTIVES:
This course enables students to understand and apply foundational principles of design
thinking and engineering. Students will analyze processes such as empathy, ideation,
prototyping, and testing, and evaluate systems thinking and technical constraints. By
synthesizing knowledge in structured problem-solving, students will explore applications
of design thinking across disciplines, fostering innovative, user-centered approaches to
complex challenges.
MODULE-1
0L+0T+16P=16 Hours
Module 1: Design Thinking Principles and User-Centric Design
UNIT-1
INTRODUCTION TO DESIGN THINKING
Design thinking: Definition, principles, and relevance in software engineering and system
design. Stages of design thinking: Empathize, Define, Ideate, Prototype, Test. Comparison of
linear vs. iterative approaches in software engineering. Role of design thinking in computer
science engineering with applications in software, web development, and system design.

UNIT-2
EMPATHY AND USER-CENTRIC DESIGN
Empathy in design thinking: Understanding user behaviour, needs, and challenges. User
research methods: Surveys, interviews, and contextual inquiry. Development of user personas
and user journeys for software applications. Group ideation workshops and evaluation of ideas
based on feasibility, impact, and scalability. Case studies: Accessibility tools, educational apps,
and assistive technology.

PRACTICES:
 Research thoroughly to understand user needs and challenges.
 Use empathy to create user personas and map user journeys.
 Follow the design thinking process: Empathize, Define, Ideate, Prototype, and Test.
 Encourage collaborative brainstorming and test prototypes with users.
 Prioritize usability, accessibility, and inclusivity in all designs.

MODULE-2
0L+0T+16P=16 Hours
Module 2: Engineering Orientation and Emerging Trends

UNIT-1
ENGINEERING ORIENTATION FOR CSE
Introduction to computer science engineering principles and interdisciplinary roles.
Fundamentals of computational thinking: Problem decomposition, pattern recognition,
abstraction, and algorithms. Application of design thinking in system design, focusing on
scalability, performance, and security. Ethical implications in software engineering: Privacy,
AI bias, cybersecurity. Sustainable and inclusive technology design.
UNIT-2
APPLICATIONS AND EMERGING TRENDS IN CSE
Design thinking applications in artificial intelligence and machine learning, with ethical
considerations and use cases such as chat-bots, recommendation systems, and smart assistants.
User-centric design for big data and data visualization, focusing on actionable insights. Design
thinking for IoT and smart systems with case studies on smart homes, healthcare devices, and
wearable technology.

PRACTICES:
 Apply computational thinking to design scalable, secure, and efficient systems.
 Focus on ethical practices like data privacy, AI fairness, and inclusivity.
 Stay updated with advancements in AI, IoT, and big data, applying user-centric design
principles.
 Use effective data visualization techniques to present insights clearly.
 Continuously refine designs based on user feedback and real-world needs.

SKILLS:
 Critical and creative thinking for problem-solving and innovation.
 Empathy to understand user needs and challenges.
 Collaboration skills to work effectively in teams.
 Basic technical knowledge in computational thinking and system design.
 Prototyping and testing to develop and refine solutions.
 Ethical awareness and adaptability to emerging technologies.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:
Bloom's Mapping
CO Module
Course Outcomes Taxonomy with
No No
Level PO's
Apply design-thinking principles to user- PO1, PO2,
CO1 Apply Module 1
centric software and system development. PO5
Use prototyping tools and frameworks to PO3, PO4,
CO2 Create Module 1
develop and test technology solutions. PO6
Understand the role of empathy, ethics, and PO2, PO4,
CO3 Apply Module 1
sustainability in CSE design. PO7

TEXT BOOKS:
1. Hasso Plattner "Design Thinking: A Guide to Creative Problem Solving for Everyone",
First Edition, Pearson Education, 2018.
2. Norman, Donald A.. "The Design of Everyday Things", Revised Edition, Basic Books,
2013.

REFERENCE BOOKS:
1. Gero, John S. & Maher, Mary Lou. "Designing Design: How Design Thinking
Transforms the Practice of Engineering", First Edition, Springer, 2019.
2. Brown, Tim. "Design Thinking: A Method for Creative Problem Solving", First Edition,
Harper Design, 2015.
 CSE - II Year II Semester

22ST202 PROBABILITY AND STATISTICS

Hours Per Week :

L T P C
3 2 0 4
PREREQUISITE KNOWLEDGE: Basic knowledge in statistics and mathematics.
Source: https://
www.amazon.com/
COURSE DESCRIPTION AND OBJECTIVES:
Differential-Equations/dp/
To provide students with foundation in elementary topics of statistics and probability such as descriptive B01H30X2JA
statistics, correlation, probability, random variables, correlation, regression, and testing of hypothesis.
The course emphasizes statistics to solve engineering and management problems.

MODULE-1
UNIT-1 12L+0T+8P=20 Hours

DESCRIPTIVE STATISTICS
Basic Definitions, Frequencies, Graphical Representation, Histogram, Ogive curves; Measures of
Central tendency, Arithmetic mean, Median, Mode, Mean deviation, Standard deviation; Symmetry and
Skewness, Karl Pearson’s Coefficient of skewness.

UNIT-2 12L+0T+8P=20 Hours

PROBABILITY AND RANDOM VARIABLES

Probability: Introduction, Definition (Classical and Axiomatic approach), Addition theorem, Conditional
probability, Multiplication theorem and Bayes theorem.
Random Variables: Random variables, Discrete and Continuous variables and distribution function.

PRACTICES:
● Various graphical presentation techniques.
● Measures of central tendency.
● Skewness.
● Karl Pearson’s coefficient of skewness.
● Applications of addition theorem.
● Applications of multiplication theorem.

MODULE-2

UNIT-1 12L+0T+8P=20 Hours

REGRESSION ANALYSIS AND DISTRIBUTIIONS

Correlation and Regression: Correlation, types, Pearson’s coefficient of correlation, regression,
regression lines.
Distributions: Introduction to distributions: Binomial, Poisson and Normal distributions with properties
and applications.

UNIT-2 12L+0T+8P = 20 Hours

TESTING OF HYPOTHESIS
Testing large samples-one mean, two means, one proportion and two proportions. Testing small

VFSTR 77
 CSE - II Year II Semester

SKILLS: samples- one mean, two means (independent and paired samples), Chi square tests-goodness of fit
 Collect
. the data and independence of attributes.
from various
data sources
and evaluate
PRACTICES:
mean, median, ● Correlation.
mode mean
deviation and
● Karl Pearson’s coefficient of correlation.
standard devi- ● Regression and regression lines.
ation.
● Applications of statistical distributions.
 Identify the ● Testing the large sample tests-one mean and two sample means.
areas which
we can apply ● One proportion and two proportion tests.
the probability ● Testing small samples-one, two samples and paired tests.
theory.
● Chi-square test for goodness of fit.
● Chi-square test for independence of attributes.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply measures of central tendency, skewness,
1 and Karl Pearson’s coefficient of skewness to Apply 1 1,2
study the statistical data sets.
Apply the probability theory and their applications
2 Apply 1 1,2
to measure the uncertainty.
Study the relations between statistical variables
3 Analyze 2 1,2,3
and can fit the mathematical models for association.
Test the statistical significances for various
4 Evaluate 2 1,2,4
samples.
Identify the distribution type to measure the
5 Evaluate 2 1,4,5
occurrences of chance.

TEXT BOOKS:
1. Sheldon M. Ross, An Introduction to Probability and Statistics for Engineers and Scientists,
3rd Edition, Academic Press, Elsevier.
2. S. C. Gupta and V. K. Kapoor, “Fundamentals of Mathematical Statistics”, Sultan Chand &
Sons, 2012.

REFERENCE BOOKS:
1. P. R. Vittal, “Mathematical Statistics”, Margham Publications, Chennai, 2018.
2. Kishore S. Trivedi, “Probability and Statistics with Realiability, Queueing and Computer Science
Applications”, 2nd edition, Wiley Student edition, 2008.
3. A. Singaravelu, “Probability and Statistics”, 22nd edition, Meenakshi Agency, 2015.

VFSTR 78
24CS209
 CSE - II Year II Semester

22CS207 OPERATING SYSTEMS

Hours Per Week :

L T P C
2 0 2 3
PREREQUISITE KNOWLEDGE: Knowledge of computers fundamentals, Computer organization &
Source: https:// Digital logic and its design.
www.123rf.com/stock-
photo/operating_system.
html
COURSE DESCRIPTION AND OBJECTIVES:
This course aims at concepts and principles of Operating Systems, its overall responsibility inacting as
an interface between the system’s hardware components and the user. Further, it also helps students to
understand the different scheduling policies, process synchronization mechanisms, deadlock handling
mechanisms and memory management techniques.

MODULE-1
UNIT-1 10L+0T+10P=20 Hours

LINUX FILE SYSTEM & PROCESS SCHEDULING

Introduction to LINUX File System: The LINUX file System, File System Hierarchy, File system
Commands, File Attributes, File Permissions.
Filters: cmp, comm, diff, head, tail, find, cut, paste, sort, uniq.
Regular Expressions: grep, egrep, fgrep, Sed- line addressing, context addressing, text editing,
substitution.
Introduction to Operating System: What Operating System do; Operating System Structure; Process
concept-overview, Process Scheduling, Operations on Process; Inter Process Communication; Threads;
Process (CPU) Scheduling-Scheduling Criteria, Scheduling Algorithms; Multiple-Processor scheduling;

UNIT-2 6L+0T+6P=12 Hours

PROCESS SYNCHRONIZATION AND DEADLOCKS

Process Synchronization: The critical-section problem; Peterson’s solution; Synchronization hardware;
Semaphores; Classical problems of synchronization; Monitors.
Deadlocks: Deadlock characterization; Methods of handling deadlocks; Deadlock prevention; Deadlock
avoidance; Deadlock detection and recovery.

PRACTICES:
● Use the cat command to create a file containing the following data. Call it mytable.txt usetabsto
separate the fields.
1425 ravi 15.65
4320 ramu 26.27
6830 sita 36.15
1450 raju 21.86
a. Use the cat command to display the file, mytable.txt.
b. Use the vicomm and to correct any errors in the file, mytable.txt.
c. Use the sort command to sort the file mytable.txt according to the first field.
d. Call thesortedfilemytable.txt (same name)
e. Printthefilemytable.txt.
f. Use the cut &paste commands to swap fields 2and 3mytable.Call itmytable.txt (same name)

VFSTR 82
 CSE - II Year II Semester

g. Print the new file, mytable.txt. SKILLS:

● Write a shell script that takes a command–line argument and reports on whether it is directory,  Manage open-
a file, or something else. source operating
systems like
● Write a shell script that accepts one or more file name as arguments and convertsall of them Ubuntu, Fedora
to uppercase, provided they exist in the current directory. etc.
● Write a shell script that displays a list of all the files in the current directory to which the user  Know the
has read, write and execute permissions. concepts of
● Write a shell script that computes the total and average marks of a student according to the Processes
scheduling and
following; File Systems.
● Ifaveragemarks≥69thenresultis-Distinction .
 Identification of
● Ifaveragemarks≥59and≤70thenresultis-FirstClass . different disk
● Ifaveragemarks≥49and≤60thenresultis-SecondClass If average marks ≤50 then result is -Pass . scheduling
● Note that any subject marks ≤ 40then result is-Fail . methodologies.

● Accept student name and six subject marks through the keyboard.
● Write an interactive file-handling shell program. Let it offer the user the choice of copying,
removing, renaming, or linking files. Once the user has made a choice, have the program ask
the user for the necessary information, such as the file name, new name and so on.
● Write a shell script, which receives two file names as arguments. It should check whether the
two file contents are same or not. If they are same then second file should be deleted.
● Write a shell script that accepts a file name starting and ending line numbers as arguments
and displays all the lines between the given line numbers.
● Write a shell script that deletes all lines containing a specified word in one or more files supplied
as arguments to it.
● Implementation of new process creation and its communications.
● Implement of thread creation and deletion.
● Implementation of FCFS scheduling.
● Implementation of SJF and RR Scheduling.
● Implementation of producer consumer problem.
● Implementation of Banker’s algorithm for Dead lock avoidance.

MODULE-2
UNIT-1 8L+0T+8P=16 Hours

MEMORY MANAGEMENT
Memory Management: Basic concept tofmemory management, Swapping, Contiguous Memory
Allocation, Paging, Structure of the Page Table, Segmentation.
Virtual Memory Management: Demand Paging, Page Replacement: Optimal, First in First Out (FIFO),
Second Chance (SC), Not recently used (NRU), Least Recently used (LRU), Allocation of Frames.

UNIT-2 8L+0T+8P=16 Hours

SECONDARY STORAGE STRUCTURE

Secondary Storage Structure: Over view of mass-storage structure, disk structure, disk scheduling;
File System Interface - File concept, Access Methods, Directory & Disk Structure, File-System Mounting,
File Sharing, Protection; File-system structure.
File System Implementation- Directory implementation, Allocation Methods, Free Space Management.

PRACTICES:
● Assume that you have a page-reference string for a process with m frames (initially all empty).
The page-reference string has length p, and n distinct page numbers occur in it.
a) What is a lower bound on the number of page faults?
b) What is an upper bound on the number of page faults?
● Consider the following page-replacement algorithms. Rank these algorithms on a five-point
scale from “bad” to “perfect” according to their page-fault rate. Separate those algorithms that

VFSTR 83
 CSE - II Year II Semester

suffer from Belady’s anomaly from those that do not.

a) LRU replacement. b) FIFO replacement.
c) Optimal replacement. d) Second-chance replacement.
● Consider the page reference string: 1, 2, 3, 4,2, 1, 5, 6, 2, 1, 2, 3,7, 6, 3, 2, 1, 2, 3, 6.
● How many page faults would occur for the following replacement algorithms, assuming one,
two, three, four, five, six, and seven frames? Remember that all frames are initially empty, so
your first unique pages will cost one fault each.
● LRU replacement.
● FIFO replacement.
● Optimal replacement.
● How many page fault soccur for your algorithm for the following reference string with four page
frames? 1, 2, 3,4, 5, 3, 4, 1, 6,7, 8, 7, 8, 9, 7, 8,9, 5, 4, 5,4, 2.
● What is the minimum number of page faults for an optimal page replacement strategy for
thereference string above with four page frames?
● Consider a demand-paged computer system where the degree of multiprogramming is currently
fixed at four. The system was recently measured to determine utilization of the CPU and the
paging disk. Three alternative results are shown below. For each case, what is happening?
a) Can the degree of multiprogramming be increased to increase the CPU utilization? Is the
paging helping?
b) CPU utilization 13 percent; disk utilization 97 percent.
c) CPU utilization 87percent; disk utilization 3 percent.
d) CPU utilization 13 percent; disk utilization 3 percent.
● Implementation of Disk scheduling algorithm–FCFS.
● Implementation of Disk scheduling algorithm–SSTF and SCAN.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Classify the basic concepts of operating system
1 Analyze 1 1
and explore Linux ecosystem.
Apply the concepts of process scheduling
2 algorithms and process synchronization techniques Apply 1 1, 2, 3, 5, 12
to derive the efficiency of resource utilization.
Analyze the requirements for attempting Operating
3 Analyze 1,2 1,2,12
systems principles.
Design the various memory management
4 Create 2 3,5
schemes For a given scenario.
Apply the concepts of file system interface and
5 Apply 1,2 2,5
implementation.

TEXT BOOKS:
1. Sumitabha Das, Unix concepts and applications , TMH Publications, 4th Edition, July 2017.
2. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, 9th
Edition, John Wiley & SonsInc, 2013.
REFERENCE BOOKS:
1. Richard. Stevens and Stephen A Rago, “Advanced Programming in the Unix Environment”,
3rd Edition, Addison-Wesley, 2013.
2. William Stallings, “Operating Systems-Internals and Design principles” PHI, 7th Edition, 2012.
3. Gary J. Nutt. Addison-Wesley, “Operating Systems: A Modern Perspective”, 2nd Edition, 2001.
4. B.A. Forouzan & R.F.Giberg, - Unix and shell Programming , Thomson, 1st Edition, New Delhi,
2003.

VFSTR 84
24CS210
 24SA201 - UNIVERSAL HUMAN VALUES
Hours per week
L T P C
0 0 2 1
PREREQUISITE KNOWLEDGE: UHV (Universal Human Values) doesn't necessarily
require specific prerequisite knowledge. It's designed to be accessible for students with
various backgrounds. However, there are some foundational concepts that might be helpful:
 Basic understanding of ethics
 Openness to different perspectives
 Ability for critical thinking

COURSE DESCRIPTION AND OBJECTIVE: This course discusses students’ role in

their family. It touches issues very briefly related to their role in the society and the
nature. It is designed to be covered in their I or II semesters 1st year.
The objectives of the course are four fold:
 Development of a holistic perspective based on self-exploration about themselves
(human being), family, society and nature/existence.
 Understanding (or developing clarity) of the harmony in the human being, family,
society and nature/existence.
 Strengthening of self-reflection.
 Development of commitment and courage to act.

MODULE-1
0L+0T+16P=16 Hours
UNIT - 1
COURSE INTRODUCTION -NEED, BASIC GUIDELINES, CONTENT AND
PROCESS FOR VALUE EDUCATION
Self-Exploration – what is it? Its content and process; ‘Natural Acceptance’ and
Experiential Validation- as the process for self-exploration - Continuous Happiness and
Prosperity - A look at basic Human Aspirations - Right understanding, Relationship and
Physical Facility - the basic requirements for fulfillment of aspirations of every human
being with their correct priority.

UNIT - 2
UNDERSTANDING HARMONY IN THE HUMAN BEING - HARMONY IN MYSELF!
Understanding human being as a co-existence of the sentient ‘I’ and the material ‘Body’-
Understanding the needs of Self (‘I’) and ‘Body’ - happiness and physical facility -
Understanding the Body as an instrument of ‘I’ (I being the doer, seer and enjoyer) -
Understanding the characteristics and activities of ‘I’ and harmony in ‘I’.
 MODULE-2
0L+0T+16P=16 Hours
UNIT - 1
UNDERSTANDING HARMONY IN THE FAMILY AND SOCIETY –
HARMONY IN HUMAN – HUMAN RELATIONSHIP
Understanding values in human - human relationship; meaning of Justice (nine universal
values in relationships) and program for its fulfilment to ensure mutual happiness; Trust and
Respect as the foundational values of relationship -Understanding the meaning of Trust;
Difference between intention and competence - Understanding the meaning of Respect,
Difference between respect and differentiation; the other salient values in relationship -
Understanding the harmony in the society (society being an extension of family)

UNIT – 2
UNDERSTANDING HARMONY IN THE NATURE AND EXISTENCE -
WHOLE EXISTENCE AS COEXISTENCE
Understanding the harmony in the Nature-Interconnectedness and mutual fulfillment among
the four orders of nature- recyclability and self- regulation in nature - Understanding Existence
as Co- existence of mutually interacting units in all-pervasive space.

PRACTICES:
 Self-observation, self-reflection activities (academic, career, personal)
 Talk on Everyday life situation
 Reflect on what s/he would do in this situation.
 Consider the potential consequences of each option (returning vs. keeping).
 Case studies: Analyze real-world examples
 Group discussions: Sharing perspectives and learn from others' experiences
 Role-play scenarios to navigate conflict resolution and promote healthy interaction

OUTCOME OF THE COURSE:

Upon successful completion of this course, students will have the ability to:

Mapping
Blooms Module
COs. Course Outcomes with
Level No.
POs
understand and analyse the essentials of
1 human values and skills, self-exploration, Apply 1,2 7,8,9,10
happiness and prosperity.
2 evaluate coexistence of the “I” with the body. Evaluate 1,2 7,8,9,10

identify and evaluate the role of harmony in

3 Evaluate 1, 2 7,8,9,10
family, society and universal order.
understand and associate the holistic
4 perception of harmony at all levels of Apply 1, 2 7,8,9,10
existence.
develop appropriate technologies and
5 management patterns to create harmony in Create 1,2 7,8,9,10
professional and personal life.
TEXT BOOK:
1. R R Gaur, R Sangal, G P Bagaria, “Human Values and Professional Ethics”, Excel
Books, New Delhi, 2010.
REFERENCE BOOKS:
1. A.N. Tripathi, “Human Values”, New Age Intl. Publishers, New Delhi, 2004.
2. Gergen, K. J. “Relational Being: Beyond Self and Community”, United Kingdom:
Oxford University, Press, 2009.
3. A Nagraj, “Jeevan Vidya ek Parichay”, Divya Path Sansthan, Amarkantak”, 1998.
4. E.F. Schumacher, “Small is Beautiful: a study of economics as if people mattered, Blond
&amp; Briggs, Britain” 1973.
5. R R Gaur, R Sangal, G P Bagaria, “A Foundation Course in Human Values and
Professional Ethics”, 2009.

*****
 24CS207 - FULL STACK DEVELOPMENT
Hours per week
L T P C
0 2 2 2
PREREQUISITE KNOWLEDGE:
OOPs through JAVA.
No Previous Development Experience Required.
Access to various Open -Source (Free)Software.

COURSE DESCRIPTION AND OBJECTIVES:

This course covers web development principles such as static webpage design, building a
simple HTML text site, styling web pages with CSS, and programming websites using
Javascript.
MODULE-1
0L+16T+16P = 32 Hours
UNIT-1
INTRODUCTION
HTML Basics: Introduction, Elements & Tags, Attributes, Forms.
HTML Advanced: Semantic Elements, Multimedia, Tables
CSS Basics: Introduction to CSS, Selectors, Properties & Values, Box Model
CSS Layout: Positioning, Flexbox, Grid
CSS Advanced: Media Queries, Transitions & Animations, CSS Variables, Preprocessors

UNIT-2
JavaScript Basics: Introduction, Syntax & Variables, Operators, Functions, Control
Structures
DOM Manipulation: Introduction to DOM, Selecting Elements, Events, Modifying
Elements
JavaScript Advanced: ES6 Features, Asynchronous JavaScript, Fetch API & AJAX, Error
Handling
Object-Oriented JS: Objects & Prototypes, Classes
JavaScript in Web Development: JSON, Local Storage & Session Storage, Libraries &
Frameworks, Testing & Debugging

PRACTICES:
 Build a RESTful API using Express that allows users to perform CRUD operations on a
single resource (e.g., a todo list, a blog post). Include routes for GET , POST , PUT , and
DELETE operations.
 Create and use middleware functions to log request details, authenticate users, and handle
errors in your Express.js application.
 Implement user authentication using JSON Web Tokens (JWT) in a Node.js and Express
application. Create endpoints for user registration, login, and authentication middleware
to protect routes.
 Create a basic server with the help of HTTP that listens on port 3000. Set up routes for a
simple to-do list application where users can add, view, update, and delete to-do items.
 Demonstrate the use of callbacks, promises, and async/await in Node.js by fetching
weather data from an external API, processing the data, and storing it in a MongoDB
collection.
 Write a script to create a database named store and a collection named products
 a. Insert multiple documents into the products collection, each document representing a
product with fields such as name, price, category, and stock.
b. Write a script to update the stock field of all products in the electronics category by
reducing their stock by 5.
c. Create an index on the price field of the products collection to improve query
performance.
d. Define a schema for the products collection using MongoDB’s validation feature to
ensure each product has a name, price, category, and stock.
e. Write a query to find all products in the products collection that have a price greater
than $50.
 Create a global error handling middleware in Express ( app.use ) that catches unhandled
errors and sends appropriate error responses ( 500 Internal Server Error ) to clients. Log
detailed error messages ( console.error ).
 Create a global error handling middleware in Express ( app.use ) that catches unhandled
errors and sends appropriate error responses ( 500 Internal Server Error ) to clients. Log
detailed error messages (console.error ).
 Write a Node.js script that:
a. reads the contents of a text file ( data.txt ) synchronously and logs its content to the
console.
b. read the contents of data.txt asynchronously. Ensure that the file content is logged to
the console once it's fully loaded.
 Implement JWT-based authentication in your Express.js application. Create routes for
user registration, login, and profile management. Protect certain routes to ensure only
authenticated users can access them.

MODULE -2
0L+16T+16P = 32 Hours
UNIT-1
Introduction to MERN Stack: Understand the components and architecture of the MERN
stack
MongoDB Basics: Learn the basics of MongoDB, its data model, and CRUD operations
Advanced MongoDB: Deepen knowledge of MongoDB features like indexing, aggregation,
and transactions
Node.js Fundamentals: Learn the basics of Node.js and asynchronous programming
Express.js Basics: Understand the basics of Express.js and building RESTful APIs
Advanced Express.js: Learn advanced concepts of Express.js like error handling and
security
UNIT-2
React Basics: Understand the basics of React, JSX, and component-based architecture
Advanced React: Learn advanced React concepts like hooks, context API, and lifecycle
methods
Integration: Frontend & Backend: Integrate React with Express and MongoDB to create a
full-stack application
Authentication & Authorization: Implement user authentication and authorization in your
application
State Management: Learn state management in React using Redux or Context API
Testing & Debugging: Understand the basics of testing and debugging in MERN stack
applications
 Deployment: Learn how to deploy your MERN stack application to cloud platforms like
Heroku or AWS
Capstone Project (Virtual Support): Apply all the learned concepts to build a
comprehensive MERN stack application

PRACTICES:
 Set up a new React project using Create React App. Create a ‘ProductList’ component
that displays a list of products, each with a name, price, and image, passed as props.
Render this component in the main ‘App’ component.
 Build a traffic light where the lights switch from green to yellow to red after
predetermined intervals and loop indefinitely. Each light should be lit for the following
durations:
1. Red light: 4000ms
2. Yellow light: 500ms
3. Green light: 3000ms
 Develop a small (test) application to use Redux (or Context API for state management).
Implement actions, reducers, and connect components to the store to manage application-
wide state.
 Create a component that fetches a list of users from a backend API and displays them in a
table.
 Create a ‘Weather’ component that uses the ‘useEffect’ hook to fetch weather data from
an API and the ‘useState’ hook to manage the fetched data. Display the current weather
and forecast for a given city.
 Build a React application that displays a list of books fetched from the Express API.
Implement a form to add new books to the collection and ensure the list updates in real-
time after a new book is added.
 Set up Redux in a React application to manage the state of a blog platform. Implement
actions and reducers to handle fetching, adding, updating, and deleting blog posts.
 Write a Higher-Order Component (HOC) called withAuthentication that wraps a
component and provides an isAuthenticated prop indicating whether the user is
authenticated or not. Assume there’s an authenticate function that returns a boolean value.
 Build a simple mortgage calculator widget that takes in a loan amount, interest rate, loan
term, and calculates the monthly mortgage payment, total payment amount, and total
interest paid.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:
Blooms
Sl. No. Course Outcome Module
Level
Usage of HTML, HTML5, CSS, Java Script in web
1 Apply 1,2
application development
2 Create sand style webpages with html and css Apply 1
Analyze JavaScript frameworks and how they can be utilized
3 Apply 2
to save time when writing custom Javascript code.
4 Design and develop Script Forms,Validation. create 2
TEXT BOOKS:
1. 1.Learning Web Design:A beginners guide to HTML,CSS,Javascript and Web
Graphics,By Jennifer Niederst Robbins.
2. Eloquent JavaScript, by Marijn Haverbeke
3. HTML And CSS: Design And Build Website by Jon Duckett
4. JavaScript And JQuery: Interactive Front-End Web Development by Jon Duckett
5. Front-End Development: The Big Nerd Ranch Guide, by Chris Aquino and Todd
Gandee

REFERENCE BOOKS:
1. JavaScript: The Good Parts, Book by Douglas Crockford
2. JavaScript and JQuery: Interactive Front-End Web Development, Book by Jon Duckett
3. JavaScript for dummies
4. Head First JavaScript (English, Morrison Michael)
 CSE - III Year I Semester

22TP301 SOFT SKILLS LABORATORY

Hours Per Week :

L T P C
0 0 2 1
PREREQUISITE KNOWLEDGE: Grasp on their own academic achievements.
Source: https://
COURSE DESCRIPTION AND OBJECTIVES: choosework.ssa.gov/
blog/2019-07-23-soft-
To impart employability skills like resume preparation and facing interviews. To enable trainees to develop skills-an-intro-to-effective-
interpersonal and leadership skills and to train them on work place skills like making presentations, communication
participating in group discussions etc.

MODULE-1
UNIT-1 0L+0T+8P=8 Hours
PERSONALITY DEVELOPMENT
Soft Skills: Need for soft skills, professionalism, employability skills; Communication: Need for effective
communication - the process of communication, levels of communication, flow of communication,
choice of diction and style with reference to setting (formal, semi-formal or informal); communication
networks, barriers to communication, miscommunication, noise and ways to overcome the barriers;
Career Planning: Job vs. career, SWOT analysis.

UNIT-2 0L+0T+8P=8 Hours

LANGUAGE AND VOCABULARY
Vocabulary Building: Word etymology, roots, prefixes & suffixes, synonyms & antonyms, collocations,
one-word substitutes, analogies, idioms and phrases, contextual guessing of unfamiliar words, task-
oriented learning; Reflection of language on Personality, Gender sensitive language in MNCs, Mind
your language, Seven essential skills for a team player; attentive listening, intelligent questioning, gently
persuading, respecting other’s views, assisting others, sharing, participating actively.

PRACTICES:
● Self-Introduction.
● Personal and Academic SWOC.
● Johari Window.
● Giving and taking opinions of Self Vs others and assessing oneself.
● Goal setting.
● Short, Mid and Long Term goals planning the semester.
● Time management: four quadrant system.
● Stephen Covey Time Management Matrix planning a semester.
● Stress-management.
● Questionnaire to assess level of stress.
● 50 words towards resume preparation and interviews.
● Newly coined words.
● Gender sensitive words and Words acceptable in Indian context and objectionable international
context.

MODULE-2
UNIT-1 0L+0T+8P=8 Hours

LANGUAGE IN ACTION
Functional English: Situational dialogues, Role plays (including small talk); Group Discussion:
Articulation and flow of oral presentation, dynamics of group discussion, intervention, summarizing and
conclusion, voice modulation, content generation, Key Word Approach (KWA), Social, Political, Economic,

VFSTR 93
 CSE - III Year I Semester

SKILLS: Legal and Technical Approach (SPELT), View Point of Affected Part (VAP), language relevance, fluency
 Balance social and coherence – 11th and 12th weeks; Resume preparation: Structure and presentation, defining career
and emotional objective, projecting one’s strengths and skill-sets, summarizing, formats and styles and covering letter-
intelligence Statement of Purpose.
quotients though
SWOC, JOHARI
etc. activities.
UNIT-2 0L+0T+8P=8 Hours

 Prepare tailor PREPARING FOR PRESENTATIONS AND INTERVIEWS

made resume
and face various Facing Interviews: Interview process, understanding employer expectations, pre-interview planning,
job interviews opening strategies, impressive self-introduction, answering strategies, other critical aspects such as body
with enriched language, grooming, other types of interviews such as stress-based interviews, tele- interviews, video
personality traits. interviews, frequently asked questions (FAQs) including behavioral and HR questions and the aspect
 Career planning looked at by corporate during interviews; Presentation Skills: Selection of a topic, preparing an abstract,
with clear gathering information, organizing the information, drafting the paper, citing reference sources – writing
personal and striking introductions, discussing the methodology used, developing the argument, presentation style,
professional
goals.
language, presenting the paper and spontaneously answering audience questions.

 Solve personal PRACTICES:

and professional
life hiccups with
● Opening and closing a telephonic conversation.
confidence and ● Making an appointment.
maturity ● Making a query.
● Offering/Passing on information.
● Communicating with superiors.
● Expressing agreement/objection.
● Opening bank account (combination of prepared and impromptu situations given to each
student).
● Group Discussions on various topics.
● Preparing SoP and Resume.
● Mock interviews on the FAQs including feedback.
● Oral presentation with the help of technology (Preparing PPT and presenting).

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Have the ability to introspect on individual
strengths and weaknesses, and emerge as a bal-
1 Apply 1 12
anced personality with improved self-awareness
and self-worth.
Observe gender sensitive language and workplace
2 Analyze 1 9
etiquette in his professional life.
Be able to prepare a resume and gain the
3 Create 1, 2 10
confidence to face an interview.
Possess the interpersonal skills to conduct himself/
4 herself effectively in everyday professional and Apply 2 8
social contexts.
5 Bring professionalism into his/her daily activities. Create 2 8

TEXT BOOKS:
1. Adrian Furnham, “Personality and intelligence at work”, Psychology Press, 2008.
2. S. P. Dhanvel, “English and Soft skills”, Orient Blackswan, 2011.
REFERENCE BOOKS:
1. Edward Holffman, “Ace the corporate personality”, McGraw Hill, 2001.
2. John Adair Kegan Page, “Leadership for innovation”, Kogan, 2007.
3. Krishna Mohan & NP Singh, “Speaking English effectively”, Macmillan, 2008.
4. Rajiv K. Mishra, “Personality Development”, Rupa & Co. 2004.

VFSTR 94
 CSE - III Year I Semester

24CS301 OPTIMIZATION TECHNIQUES

Hours Per Week :

L T P C
2 2 0 3

PREREQUISITE KNOWLEDGE: Probability & Linear algebra.

Source: https://oworkers.
COURSE DESCRIPTION AND OBJECTIVES: com/8-process-
optimization-techniques-
This course introduces the fundamental concepts of Optimization Techniques and to make the learners how-to-get-started/
aware of the importance of optimizations in real scenarios. The most important objective is to provide
the concepts of various classical and modern methods for constrained and unconstrained problems in
both single and multivariable. Finally, the basic idea behind the evolutionary algorithms like Ant Colony
Optimization, Particle Swarm Optimization could be discussed for further study.

MODULE-1
UNIT-1 12L+8T+0P=20 Hours

INTRODUCTION TO CLASSICAL METHODS AND LINEAR PROGRAMMING PROBLEMS

TERMINOLOGY
Design Variables – Constraints, Objective Function - Problem Formulation, Linear Programming
Problem - Simplex method - Concept of Duality.
General Transportation Problem: The transportation table finding in initial basic feasible solution,
North-West corner method, Least cost method, Row minima method, Column minima method.

UNIT-2 12L+8T+0P=20 Hours

SINGLE VARIABLE OPTIMIZATION

Problems Optimality Criterion - Bracketing Method - Region Elimination Methods -Interval Halving
Method - Gradient Based Methods: Newton -Raphson Method - Bisection Method - Application to Root
finding.
Multi Variable Optimization, Algorithms Optimality: Criteria - Unidirectional Search. Direct Search
Methods: Hooke -Jeeves pattern search method. Gradient Based Methods: Cauchy’s Steepest Descent
Method - Newton’s method, Quasi-Newton methods, L-BFGS.

PRACTICES:
A company makes two products (X and Y) using two machines (A and B). Each unit of X that is produced
requires 50 minutes processing time on machine A and 30 minutes processing time on machine B. Each
unit of Y that is produced requires 24 minutes processing time on machine A and 33 minutes processing
time on machine B. At the start of the current week there are 30 units of X and 90 units of Y in stock.
Available processing time on machine A is forecast to be 40 hours and on machine B is forecast to be
35 hours. The demand for X in the current week is forecast to be 75 units and for Y is forecast to be
95 units. Company policy is to maximise the combined sum of the units of X and the units of Y in stock
at the end of the week. Formulate the problem of deciding how much of each product to make in the
current week as a linear program. Solve this linear program graphically.

VFSTR 95
 CSE - III Year I Semester

SKILLS: Solve using the Simplex method the following problem:

 Project
scheduling Maximize Z = f(x,y) = 3x + 2y
process skills
including
subject to: 2x + y ≤ 18
defining project 2x + 3y ≤ 42
activities, and
estimation 3x + y ≤ 24
of time and x≥0,y≥0
resources
Luminous lamps have three factories - F1, F2, and F3 with production capacity 30, 50, and 20 units
 Resource
optimization
per week respectively. These units are to be shipped to four warehouses W1, W2, W3, and W4 with
skills to adjust requirement of 20, 40, 30, and 10 units per week respectively. The transportation costs (in Rs.) per unit
the project between factories and warehouses are given below. Find an initial basic feasible solution of the given
schedule as transportation problem using northwest corner rule.
per the demand
and supply
issues of project Factory Warehouse Supply
resources
W1 W2 W3 W4
 Feasibility
Analysis. F1 1 2 1 4 30
F2 3 3 2 1 50
F3 4 2 5 9 20
Demand 20 40 30 10

● A mobile phone manufacturing company has three branches located in three different regions,
say Jaipur, Udaipur and Mumbai. The company has to transport mobile phones to three
destinations, say Kanpur, Pune and Delhi. The availability from Jaipur, Udaipur and Mumbai
is 40, 60 and 70 units respectively. The demand at Kanpur, Pune and Delhi are 70, 40 and 60
respectively. The transportation cost is shown in the matrix below (in Rs). Use the Least Cost
method to find a basic feasible solution (BFS).

DESTINATIONS
Kanpur Pune Delhi Supply
Jaipur 4 5 1 40
Sources Udaipur 3 4 3 60
Mumbai 6 2 8 70
Demand 70 40 60 170

● Find Solution using Row minima method.

D1 D2 D3 D4 Supply
S1 11 13 17 14 250
S2 16 18 14 10 300
S3 21 24 13 10 400
Demand 200 225 275 250

VFSTR 96
 CSE - III Year I Semester

● Find Solution using Column minima method.

D1 D2 D3 D4 Supply
S1 11 13 17 14 250
S2 16 18 14 10 300
S3 21 24 13 10 400
Demand 200 225 275 250

● Find the positive root of the following equation by (Bisection) method,

f(x)=sin (x/2π)-cos2x
● Consider figure below. The cross-sectional area A of a gutter with equal base and edge length
of 2 is given by:
A = 4sinθ (1+ cosθ )
Using an initial interval of [0,π / 2], find the interval after 3 iterations. Use an initial interval ε = 0.2.

MODULE-2
UNIT-1 12L+8T+0P=20 Hours

STOCHASTIC OPTIMIZATION PROBLEMS

Notion of regret, online to batch conversion, Methods offering vanishing regret - OGD, EG, OMD
Convex Sets and Functions: Affine and convex sets, convexity preserving operations, separating and
supporting hyper-planes, generalized inequalities, Operations preserving convexity, conjugate function,
Quasi-convex functions, Log-concave and log-convex functions.

UNIT-2 12L+8T+0P=20 Hours

NON-CONVEX OPTIMIZATION PROBLEMS

Applications - sparse recovery, affine rank minimization, low-rank matrix completion, Convex approaches
- relaxation-based methods, Non-convex approaches - projected gradient descent.
Algorithms: Unconstrained problems, equality constrained problems

PRACTICES:
● Show that each convex cone is indeed a convex set.
● Consider the linear system 0 ≤ xi ≤ 1 for i = 1, . . . , n and let P denote the solution set. Explain
how to solve a linear programming problem max{c T x : x ∈ P}.
What if the linear system was ai ≤ xi ≤ bi for i = 1, . . . , n. Here we assume ai ≤ bi for each i.
● Can projected gradient descent (PGD) be used to obtain a stationary solution?
● Show that strong smoothness does not imply convexity by constructing a nonconvex function f : R
● p → R that is 1-SS.

VFSTR 97
 CSE - III Year I Semester

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Mapping
Course Outcomes Module No.
No. Level with POs

Understand the classical, linear programming

1 and transportation problem along with game Understand 1 1
theory.

2 Analyze real world problems around you. Analyze 1 1, 2

3 Apply optimization to real-world problems. Apply 1 1, 2, 3

Implement dynamic programming in real world

4 Implement 2 3, 4, 11, 12
complex problems.

TEXT BOOKS:
1. Kanti Swarup, Man Mohan and P.K.Gupta, “Operations Research”, Sultan Chand &Sons, 2005.
2. S. S. Rao, “Engineering Optimization Theory and Practice”, 4th Edition, Wiley Publishers, 2009.

REFERENCE BOOKS:
1. M.C. Bhuvaneswari, “Application of Evolutionary Algorithms for Multi-Objective Optimization
in VLSI and Embedded Systems”, Spinger, 2014.
2. Ashlock D, “Evolutionary Computation for Modeling and Optimization”, Springer, 2006.
3. Kalyanmoy Deb, “Optimization for Engineering Design”, Prentice Hall of India, 2nd Edition,
2012.
4. A. Ravindran and K.M. Rogsdell, G.V. Reklaites, “Engineering Optimization: Methods and
Applications”,Wiley, 2nd Edition, 2006.
5. E. J. Haug and J.S. Arora, “Applied Optimal Design”, Wiley Publishers,1979.

VFSTR 98
 CSE - III Year I Semester

24CS302 ARTIFICIAL INTELLIGENCE

Hours Per Week :

L T P C
2 0 2 3
PREREQUISITE KNOWLEDGE: Probability and statistics.
Source: https://www.
forbes.com/sites/
COURSE DESCRIPTION AND OBJECTIVES:
bernardmarr/2020/08/03/3-
The primary objective of this course is to introduce the basic principles, techniques, and applications of important-ways-artificial-
intelligence-will-transform-
Artificial Intelligence. In addition to this, student will understand the building blocks of AI such as search, your-business-and-
knowledge representation, inference, logic and learning. This course enables the students to develop turbocharge-success/
a small AI system for real time problems.

MODULE-1
UNIT-1 6L+6T+0P=12 Hours

INTELLIGENT SYSTEMS
Introduction, what is AI, Examples of AI systems, Brief history of AI Agent, Agents and environments,
Structure of agents, the concept of rationality, the nature of environments, Types of agents, problem
solving approaches to typical AI problem.

UNIT-2 10L+10T+0P=20 Hours

PROBLEM SOLVING
State Space Problem; Searching: Uniform search, Informed Search: Solving problems by searching:
Heuristic functions, Hill climbing, Best First Search, A* algorithm, AO* algorithm, Searching game trees:
Min Max Search, Alpha Beta pruning.

PRACTICES:
● In the classical vacuum cleaner problem, we have two rooms and one vacuum cleaner. There
is dirt in both the rooms and it is to be cleaned. The vacuum cleaner is present in any one of
these rooms. Find the solution, how we can reach to reach a state in which both the rooms
are clean and are dust free.
● In this problem, three missionaries and three cannibals must cross a river using a boat which
can carry at most two people, under the constraint that, for both banks, that the missionaries
present on the bank cannot be outnumbered by cannibals. The boat cannot cross the river by
itself with no people on board. Find the solution, how to solve the given problem.
● You are given two jugs, a 4-gallon one and a 3-gallon one, a pump which has unlimited water
which you can use to fill the jug, and the ground on which water may be poured. Neither jug
has any measuring markings on it. Find the solution, how can you get exactly 2 gallons of
water in the 4-gallon jug?
● There is a farmer who wishes to cross a river but he is not alone. He also has a goat, a wolf,
and a cabbage along with him. There is only one boat available which can support the farmer
and either of the goat, wolf or the cabbage. So at a time, the boat can have only two objects
(farmer and one other). But the problem is, if the goat and wolf are left alone (either in the boat
or onshore), the wolf will eat the goat. Similarly, if the Goat and cabbage are left alone, then
goat will eat the cabbage. The farmer wants to cross the river with all three of his belongings:
goat, wolf, and cabbage. What strategy he should use to do so?
● Either place a block that doesn’t have other blocks stacked on top of it on another block with
the same behaviour, or on the table. The initial and the goal state are described by the exact
position of each block. Find the solution, how to solve the given problem.

VFSTR 99
 CSE - III Year I Semester

SKILLS: ● Given a 3×3 board with 8 tiles (every tile has one number from 1 to 8) and one empty space.
 Analyze The objective is to place the numbers on tiles to match the final configuration using the empty
Intelligent space. We can slide four adjacent (left, right, above, and below) tiles into the empty space.
systems.
Find the solution, how to solve the given problem by using using A* search algorithm.
 Apply problem ● The rules of tic-tac-toe on the 3 × 3 field are as follows. Before the first turn all the field cells are
solving
techniques. empty. The two players take turns placing their signs into empty cells (the first player places
Xs, the second player places Os). The player who places Xs goes first, the another one goes
 Interface various
knowledge
second. Find the solution, how to solve the given problem where the winner is the player who
representation. first gets three of his signs in a row next to each other (horizontal, vertical or diagonal).
 Create a ● In crypt arithmetic problem, the digits (0-9) get substituted by some possible alphabets or
dynamic symbols. The task in crypt arithmetic problem is to substitute each digit with an alphabet to get
planning. the result arithmetically correct. Find the solution, how to solve the given problem, where we
can perform all the arithmetic operations on a given crypt arithmetic problem.

MODULE-2
UNIT-1 10L+10T+0P=20 hours

KNOWLEDGE REPRESENTATION AND PLANNING

Propositional logic: Inference in propositional logic, Resolution, Forward chaining, Backward chaining,
First order logic: Reasoning patterns in First order logic, Resolution, Forward chaining, Backward
chaining, The planning problem: Planning with state space search, Partial order planning, Planning
graphs.

UNIT-2 6L+6T+0P=12 hours

LEARNING
Forms of learning: Supervised Learning, Unsupervised learning, Reinforcement learning, Learning
Decision Trees, Ensemble Learning, Expert system.

PRACTICES:
● With logic programming, compare expressions and find out unknown values.
● The Wumpus world is a cave with 16 rooms (4×4). Each room is connected to others through
walkways (no rooms are connected diagonally). The knowledge-based agent starts from Room
[1, 1]. The cave has – some pits, a treasure and a beast named Wumpus. The Wumpus cannot
move but eats the one who enters its room. If the agent enters the pit, it gets stuck there. The
goal of the agent is to take the treasure and come out of the cave. The agent is rewarded,
when the goal conditions are met. The agent is penalized, when it falls into a pit or being eaten
by the Wumpus. Some elements support the agent to explore the cave, like -The Wumpus’s
adjacent rooms are stench. -The agent is given one arrow which it can use to kill the Wumpus
when facing it (Wumpus screams when it is killed). – The adjacent rooms of the room with pits
are filled with breeze. -The treasure room is always glittery. Find the Wumpus presented room.

● you are on one side of a river with a wolf, a goat, and a cabbage. You want to transport all
three to the other side of the river, but you can only transport one object at a time. You cannot
leave the wolf and the goat alone, or the cabbage and the goat alone; you are the only thing
keeping them from eating each other. How can you transport everything from one side of the
river to the other? Formulate it in terms of a Planning Domain Definition Language (PDDL).

VFSTR 100
 CSE - III Year I Semester

● Impliment the working of the decision tree based ID3 algorithm. Use an appropriate data set
for building the decision tree and apply this knowledge to classify a new sample.
● Build an Artificial Neural Network by implementing the Back propagation algorithm and test the
same using appropriate data sets.
● Implement k-nearest neighbors classification using python.
● Implement linear regression using python.
● Implement the naïve Bayesian classifier for a sample training dataset. Compute the accuracy
of the classifier, considering few test data sets.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs

Apply AI search Models and Generic Search

1 Apply 1 1,3
strategies for problem solving.
Inspect and analyze Logic for representing Knowl-
edge and Reasoning of AI systems and Conduct
2 Analyze 1 2
investigation and implement project using AI
learning techniques.
Apply and evaluate the searching strategies to
3 Apply 2 6
achieve the goal for a given situation..
Design different learning algorithms for improving
4 Apply 2 4
the performance of AI systems.

TEXT BOOK:
1. S. Russel and P. Norvig, “Artificial Intelligence – A Modern Approach”, 4th Edition, Pearson
Education, 2010.

REFERENCE BOOKS:
1. David Poole, Alan Mackworth, Randy Goebel, “Computational Intelligence : a logical approach”,
Oxford University Press,2013.
2. G. Luger, “Artificial Intelligence: Structures and Strategies for complex problem solving”, 4th
Edition, Pearson Education, 2008.
3. J. Nilsson, “Artificial Intelligence: A new Synthesis”, Elsevier Publishers. 2012.

VFSTR 101
 24EN301 – PROFESSIONAL COMMUNICATION SKILLS
Hours per week

L T P C
0 0 2 1

PREREQUISITE KNOWLEDGE: Basic sentence formation, understanding contextual

meanings, basic writing skills and moderate fluency in English.

COURSE DESCRIPTION AND OBJECTIVES:

To enhance language proficiency of the students in business contexts, focusing on listening,

speaking, reading, and writing (LSRW) skills. Students will gain exposure to various forms of
corporate communication to develop their speaking and writing abilities. Further, the course aims
to bolster comprehension skills through targeted reading and listening activities, ensuring
students are well-equipped to navigate professional environments effectively. The students also
certified by Cambridge English in Linguaskill test, ranging from B1 to C2 levels.

MODULE – 1
0L+0T+16P=16 Hours
UNIT – 1
STAFF DEVELOPMENT AND TRAINING - JOB DESCRIPTION AND JOB
SATISFACTION
Reading - skimming and scanning a text for effective and speedy reading and dealing with ideas
from different sectors of corporate world in different business contexts.
Writing: understanding mechanics of writing and basics of report writing, letter writing and
structures.
Listening: listening to develop comprehension skills, understand rhythm and accent and finding
missing words or phrases in gapped sentences, Listening- short recordings.
Speaking – Using language expressions - giving opinion, suggestions. Ice breaking activities;
discussing and sharing opinions, extended speaking and presenting on various business topics.

UNIT – 2
GETTING THE RIGHT JOB – MAKING CONTACT
Reading: Reading for specific details and understanding purpose of the text and author’s point of
view-matching with statements, reading business mails, understanding formal communication.
Writing: Understand business correspondence, tone structure and useful language phrases and
expressions in written communication.
Listening: Listening to various speakers to grasp tone and comprehend the text to understand the
native speakers’ accent.
Speaking: Learning language expressions and developing oral communication in business
context-one-minute oral presentations and engaging in dialogues with a group and peers.
Understanding business phone calls and tips and practicing phone conversation in a professional
context.
ACTIVITIES:
 Reading and Listening comprehension tests
 Multiple Text Matching
 Group Discussions
 One-minute presentation
 Role-Play, practicing Business Vocabulary and grammar exercises.
 JAM sessions
 Gapped and open gapped fill in short texts with multiple-choice cloze questions Matching
statements with texts
 Listening to comprehend long recordings, filling gaps
 Business report writing structure, letter writing
 Learning common expressions in business writing
 Open gapped sentences and gapped sentences
 Cohesive devices and linking words tasks in writing

MODULE – 2
0L+0T+16P=16 Hours
UNIT – 1
BREAKING INTO THE MARKET - LAUNCHING A PRODUCT
Reading: Finding missing sentences in a long text, report reading and correcting errors, reading
and finding answers for open gapped tasks, and gapped sentences.
Writing: writing business reports and proposals, mails, letter writing, modal verbs, Passive and
active voices.
Listening: Listening long text on a topic, long monologue to comprehend and answering multiple
choice questions.
Speaking: Role play and group discussions to exchange information.
UNIT – 2
STAND AT A TRADE FAIR - BEING PERSUASIVE
Reading: Reading long texts and answering multiple choice questions focusing on
comprehension skills, filling missing paragraphs in a long text.
Writing: Understanding structure of memo, note and developing memo and note in a professional
context and write and improve online tasks.
Listening: Listening to conversations and finding missing word or phrase, listening to understand
speakers’ intention.
Speaking: Presenting business ideas, making formal requests, art of agreeing and disagreeing to
develop oral skills through negotiation tasks.
ACTIVITIES:
 Doing reviews
 Error correction
 Listening to comprehend native speakers’ accent
 One long text with multiple choice questions
 Five short themed monologues and finding answer
 Grammar- learning prepositions and vocabulary.
 Taking individual long turns and follow-up discussion
 Interview-Collaborative task
 understanding structure of a report writing and developing a business report
 Finding missing sentences
 Grammar- conditional sentences, clauses and linking ideas
 Missing Paragraph Text Completion
 Multiple choice question and answers in reading

COURSE OUTCOMES:
Upon completion of the course, the students will be able to

Blooms Module
COs Course Outcomes POs
level No
Possess comprehensive skills in listening and reading
1 Analyze 2 7
business texts in formal context
Communicate effectively both in their academic as well as
2 Apply 1,2 10
professional environment
Clear grasp on the register of business language and
3 Analyze 1 8
mechanics of writing
Possess the ability to write business reports and proposals
4 create 1 12
clearly and precisely to succeed in their future
Make effective presentations and participate in formal
5 create 2 10
discussions

TEXT BOOK:
1. Guy Brook Hart (2014) Cambridge English Business Bench Mark: Upper Intermediate,
Second Edition: CUP.

WORKBOOK FOR STUDY AND PRACTICE:

1. CUP (2002) Cambridge: BEC VANTAGE Practice Papers, CUP

2. Schnurr, S (2013) Exploring Professional Communication: Language in Action. London:
Routledge.
3. Seely, J (2005) The Oxford Guide to Effective Writing and Speaking. Oxford: OUP
4. Webresource:https://www.cambridgeenglish.org/exams-and-tests/linguaskill/information-
about-the-test/practice-materials/
 CSE - III Year II Semester

24CS305 COMPUTING ETHICS

Hours Per Week :

L T P C
1 2 0 2
PREREQUISITE KNOWLEDGE: General awareness on ethical guidelines.
Source: Figure 2
from Computer and
COURSE DESCRIPTION AND OBJECTIVES:
Information Security
The course will provide students with an understanding on Engineering Ethics and the nature of moral Ethics -- Models |
Semantic Scholar
issues and dilemmas faced by Computer Science and engineers in their professional lives. It will give
them an awareness on professional rights and responsibilities of an engineer and acquaint them on the
Code of Conduct and Ethics prescribed by professional bodies like IEEE, ACM etc. for its members..

MODULE-1
UNIT-1 0L+8T+8P=16 Hours

INTRODUCTION
Introduction to Sociotechnical Computer Ethics.
Introduction: Why Computer Ethics? The Sociotechnical Systems Perspective, Sociotechnical Computer Ethics, Micro-
and Macro-Level Analysis.
Ethics and Information Technology
Introduction: Doing Ethics, Ethical Theories and Concepts.

UNIT-2 12L+0T+8P=20 Hours

ETHICS IN IT CONFIGURED SOCIETIES

Technology as the Instrumentation of Human Action, Three Features of IT-Configured Activities, IT
Configured Domains of Life, Democracy and the Internet.
Information Flow, Privacy and Surveillance
Introduction: Information Flow with and without Information Technology, why care about Privacy, Is
Privacy over? Strategies for shaping Personal Information Flow.

PRACTICES:
● Surprises about Social Networking
● RFID and caring for the Elderly People
● Turing does not need to know
● Turnitin Dot Com
● Email Privacy and Advertising
● Workplace Spying
● Data Mining and e-Business

MODULE-2
UNIT-1 0L+8T+8P=16 Hours

DIGITAL INTELLECTUAL PROPERTY

The complexities of Digital Property, Protecting Property rights in Software, The Philosophical Basis of
Property, Free and Open Source Software, PS Versus FOSS.
Introduction: Law and Order in the Internet, Sociotechnical Order, Online Crime, Hackers and Hacker

VFSTR 109
 CSE - III Year II Semester

SKILLS: Ethic, Sociotechnical Security.

 .
High Throughput Computing- Task Programming: Task computing, Task-based application models,
Aneka task-based programming.

UNIT-2 0L+8T+8P=16 Hours

PROFESSIONAL ETHICS
Introduction: Why Professional Ethics, The Paradigm of Professions, Characteristics of Professions,
Sorting out Computing and its Status as a Profession, Codes of Ethics, Professional Relationships, A
Legal perspective on professionalism in Computing.

PRACTICES:
Laboratory session of this course is designed in such a way that the student should complete three projects of the given type
by performing the below experiments.
● Obtaining pirated Software Abroad
● Free Software that follows Proprietary Software
● Using Public Domain Software in Proprietary Software
● Wiki Warfare
● Yahoo and Nazi Memorabilia
● Bot Roast
● Software Safety
● Conflicts of Interest
● Security in a Custom Database.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Engage in an informed critical reflection on the
Under-
1 nature of professionalism and ethical challenges 1 8
standing
inherent in engineering profession
Understand the role of professional bodies, and
Under-
2 the code of ethics and industrial standards pre- 2 8
standing
scribed for engineers

Apply awareness of professional rights and re-

3 sponsibilities of an engineer to conduct themselves Applying 1 8
ethically within an organization
Apply understanding of safety norms to highlight
4 Applying 2 8
ethical issues in risky situation

TEXT BOOKS:
1. Deborah G. Johnson, Keith W. Miller and Prentice Hall, “Computer Ethics”, 4th Edition, Pearson,
2009.

REFERENCE BOOKS:
1. Charles E. Harris, Michael S. Pritchard and Michael J. Rabins, “Engineering Ethics: Concepts
and Cases”, 4th edition, Wadsworth Thompson Learning, 2009.
2. M. Govindarajan, S.Natarajan and V. S. Senthil Kumar, “Engineering Ethics”, Prentice Hall of
India, Reprint 2013.

VFSTR 110
 CSE - III Year II Semester

24TP301 QUANTITATIVE APTITUDE AND

LOGICAL REASONING
Hours Per Week :

L T P C
1 2 0 2
PREREQUISITE KNOWLEDGE: Basic logical thinking and Problem solving ability.
Source: https://
images.app.goo.gl/
COURSE DESCRIPTION AND OBJECTIVES: kvtVgA8TkvDCqLhj7
The Students will be introduced to various Arithmetic and Reasoning Problems. The students will have
acquaintance with various problems like Time & Work, Time & distance, Percentages, Profit & Loss etc.
besides solving puzzles and Critical Reasoning.

MODULE-1
UNIT-1 0L+4T+12P=16 Hours
Number system, LCM & HCF of numbers, Percentage, Ratio and proportion, Profit, loss and discount,
Average & Mixtures, Simple Interest & Compound interest.

UNIT-2 0L+4T+12P=16 Hours

Time and work, Time & distance, Problems on trains, Problems on ages, Permutation & Combinations,
Probability.

PRACTICES:
● Each concept would be taught in detail in the class followed by 10 problems solved in the class.
● Students would have to solve 10 additional problems as a homework assignment in each
concept.

MODULE-2
UNIT-1 0L+4T+12P=16 Hours
Number series, Letter series, Analogy, Odd man out, Coding and decoding, Syllogisms- Statement &
Conclusions, Puzzle test.

UNIT-2 0L+4T+12P=16 Hours

Blood relations, Direction sense test, Order & Ranking, Seating Arrangements, Calendar & Clocks.

PRACTICES:
● Each concept would be taught in detail in the class followed by 10 problems solved in the class.
Students would have to solve 10 additional problems as homework assignments in each concept.

VFSTR 111
 CSE - III Year II Semester

COURSE OUTCOMES:
SKILLS:
 Helps in Upon successful completion of this course, students will have the ability to:
developing
and improving CO Blooms Module Mapping
problem-solving Course Outcomes
No. Level No. with POs
skills.
 Flexing and 1 Meet the demands of current job market besides
honing logical equipping them higher studies like CAT, GMAT Apply 1 2, 5
abilities. etc.
 Allow students to
2 Solve Arithmetic and Reasoning Problems within
develop critical Apply 1 2, 5
thinking skills. shortest possible time without paper work.
3 Exhibit better analytical skills and aptitude skills. Analyse 2 2, 4
4 Develop interpretational skills. Evalua-
2 2, 4
tion

TEXT BOOKS:
1. R. S. Aggarwal, “Quantitative Aptitude for Competitive Examinations”, S. CHAND Publications-
Revised Edition, 2017.
2. ARIHANT, “A New Approach to Verbal & Non-Verbal Reasoning”, Arihant Publication- Revised
Edition, 2021.

REFERENCE BOOKS:
1.
Trishna Knowledge Systems, “Quantitative Aptitude for Competitive Examinations”, Pearson
Publication, 2013.
2. R. S. Aggarwal, “A Modern Approach to Verbal & Non-Verbal Reasoning”, Revised Edition, S.
CHAND Publications, 2018.COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
1 Meet the demands of current job market besides
equipping them higher studies like CAT, GMAT Apply 1 2, 5
etc.
2 Solve Arithmetic and Reasoning Problems within
Apply 1 2, 5
shortest possible time without paper work.
3 Exhibit better analytical skills and aptitude skills. Analyse 2 2, 4
4 Develop interpretational skills. Evalua-
2 2, 4
tion

TEXT BOOKS:
1. R. S. Aggarwal, “Quantitative Aptitude for Competitive Examinations”, S. CHAND Publications-
Revised Edition, 2017.
2. ARIHANT, “A New Approach to Verbal & Non-Verbal Reasoning”, Arihant Publication- Revised
Edition, 2021.

REFERENCE BOOKS:
1. Trishna Knowledge Systems, “Quantitative Aptitude for Competitive Examinations”, Pearson
Publication, 2013.
2. R. S. Aggarwal, “A Modern Approach to Verbal & Non-Verbal Reasoning”, Revised Edition, S.
CHAND Publications, 2018.

VFSTR 112
22CS401
 CSE - IV Year I Semester

24CS401 SOFTWARE PROJECT MANAGEMENT

Hours Per Week :

L T P C
2 2 0 3

PREREQUISITE KNOWLEDGE: Fundamental of programming and operating system, computer

networking, and computer Organization.. Source: http://uceou.edu/
PDS/About%20PDS.html

COURSE DESCRIPTION AND OBJECTIVES:

This course covers the challenges faced in constructing parallel and distributed applications, Various
implementation techniques, paradigms, architectures and parallel algorithms. And current trends in
parallel and distributed computing like Open MP, POSIX Threads, Apache Hadoop (DFS).

MODULE-1
UNIT-1 12L+8T+0P=20 Hours
INTRODUCTION TO PARALLEL COMPUTING
The idea of Parallelism, Power and potential of parallelism, examining sequential and parallel programs,
Scope and issues of parallel and distributed computing, Goals of parallelism, Parallelism and concurrency
using multiple instructions streams.
Parallel Architecture: Pipeline architecture, Array processor, Multi-processor architecture, Systolic
architecture, Dataflow architecture, Architectural classification schemes, Memory access classification,
Memory Issues: Shared vs. distributed, Symmetric multiprocessing (SMP), SIMD, Vector processing,
GPU co-processing, Flynn’s Taxonomy, Instruction Level support for parallel programming, Multiprocessor
caches and Cache Coherence, Non-Uniform Memory Access (NUMA).

UNIT-2 12L+8T+0P=20 Hours

PARALLEL ALGORITHM DESIGN PRINCIPLES AND PROGRAMMING
Need for communication and coordination/synchronization, Scheduling and contention, Independence
and partitioning, Task- Based Decomposition, Data Parallel Decomposition, Characteristics of task
and interaction, Load balancing, Data Management, parallel algorithm models, Sources of overhead
in parallel programs, Performance metrics for parallel algorithm implementations, Parallel algorithmic
patterns like divide and conquer, Map and Reduce, Specific algorithms like parallel Merge Sort, Parallel
graph Algorithms.

PRACTICES:
● Identify Multiple Instruction Single Data, or MISD. How would an MISD system work? Give
an example.
● Suppose a shared-memory system uses snooping cache coherence and write-back caches.
Also suppose that core 0 has the variable x in its cache, and it executes the assignment x = 5.
Finally suppose that core 1 doesn’t have x in its cache, and after core 0’s update to x, core 1
tries to execute y = x. What value will be assigned to y? Why?
● Consider a simplified version of bucket-sort. You are given an array A of n random integers
in the range [1...r] as input. The output data consist of r buckets, such that at the end of the
algorithm, Bucket i contains indices of all the elements in A that are equal to i.
Describe a decomposition based on partitioning the input data (i.e., the array A) and an
appropriate mapping onto p processes. Describe briefly how the resulting parallel algorithm
would work.
Describe a decomposition based on partitioning the output data (i.e., the set of r buckets)
and an appropriate mapping onto p processes. Describe briefly how the resulting parallel
algorithm would work.

VFSTR 115
 CSE - IV Year I Semester

SKILLS: ● Consider seven tasks with running times of 1, 2, 3, 4, 5, 5, and 10 units, respectively. Assuming
 Recognize that it does not take any time to assign work to a process, compute the best- and worst-case
parallelism in speedup for a centralized scheme for dynamic mapping with two processes.
computational
problems.
MODULE-2
 Know different
parallel systems UNIT-1 12L+8T+0P=20 Hours
and their
classification. INTRODUCTION TO DISTRIBUTED SYSTEMS
 Design parallel Goals of the Distributed Systems, Relation to parallel systems, synchronous versus asynchronous
algorithms execution, design issues and challenges, Types of Distributed Systems, Distributed System Models,
for different
applications. Hardware and software concepts related to distributed systems, middleware models.
 Compare Distributed Computing and Communication design principles: A Model of distributed executions,
replication Models of communication networks, Global state of distributed system, Models of process communication.
schemes with
Communication and Coordination: Shared Memory, Consistency, Atomicity, Message- 08 Passing,
respect to
performance, Consensus, Conditional Actions, Critical Paths, Scalability, and cache coherence in multiprocessor
availability and systems, synchronization mechanism.
consistency
concerns.
UNIT-2 12L+8T+0P=20 Hours
 Design,
implement, PARALLEL AND DISTRIBUTED PROGRAMMING FRAMEWORKS
and debug
distributed Overview of CUDA, Open MP, POSIX Threads, Apache Hadoop (DFS), and current trends in parallel
systems. and distributed computing.
 Implement
parallel PRACTICES:
algorithms
using MPI
● Give five types of hardware resource and five types of data or software resource that can
and OpenMP usefully be shared. Give examples of their sharing as it occurs in practice in distributed systems.
environments. ● The host computers used in peer-to-peer systems are often simply desktop computers in
 Element parallel users’ offices or homes. What are the implications of this for the availability and security of
algorithms any shared data objects that they hold and to what extent can any weaknesses be overcome
using MPI
through the use of replication?
and OpenMP
environments ● Consider two communication services for use in asynchronous distributed systems. In service
3.0 3.5 A, messages may be lost, duplicated or delayed and checksums apply only to headers. In
 AVERAGE. service B, messages may be lost, delayed or delivered too fast for the recipient to handle them,
but those that are delivered arrive with the correct contents. Describe the classes of failure
exhibited by each service. Classify their failures according to their effects on the properties of
validity and integrity. Can service B be described as a reliable communication service?
● Illustrate distributed design through a substantial case study, examining in detail the design of
the Google infrastructure, a platform and associated middleware that supports both Google
search and a set of associated web services and applications including Google Apps.
● Implementation of the parallel algorithms (on a PC-cluster under Linux platform). The programs
will be based on POSIX Thread, MPI programming, Hadoop, Apache Spark etc.

VFSTR 116
 CSE - IV Year I Semester

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply the fundamentals of parallel and parallel
1 Apply 1 1
computing including architectures and paradigms.
Analyse the various design principles of parallel
2 Analyse 1 2
algorithms.
Under-
3 Learn the intricacies of distributed programming. 2 1
stand
Develop and execute basic parallel and distributed
4 applications using basic programming models create 2 5
and tools.

TEXT BOOKS:
1. DISTRIBUTED SYSTEMS Concepts and Design Fifth Edition. George Coulouris. Cambridge
University. Jean Dollimore formerly of Queen Mary, University of London.
2. Distributed Systems Principles and Paradigms Andrew S. Tanenbaum Maarten Van Steen, 3rd
Edition, 2017.

REFERENCE LINKS:
1. Introduction To Parallel Programming, Peter S. Pacheco University of San Francisco.
2. Introduction To Parallel Processing, M.Sasikumar, Dinesh Shikhare and P. Ravi Prakash, Randy
Chow, T. Johnson, Distributed Operating Systems and Algorithms, Addison Wesley.
3. Ian Foster: Designing and Building Parallel Programs – Concepts and tools for Parallel Software
Engineering, Pearson Publisher, 1st Edition, 2019.
4. Parallel Programming in C with MPI and Open MP Michael J.Quinn, McGrawHill Higher
Education.
5. https://hpc.llnl.gov/training/tutorials/introduction-parallel-computing-tutorial.
6. https://www.geeksforgeeks.org/introduction-to-parallel-computing/.
7. https://nptel.ac.in/.
8. https://www.coursera.org/.

VFSTR 117
 CSE - IV Year I Semester

24CS402 PARALLEL & DISTRIBUTED

COMPUTING
Hours Per Week :

L T P C
2 2 0 3

PREREQUISITE KNOWLEDGE: Fundamental of programming and operating system, computer

networking, and computer Organization..
Source: http://uceou.edu/
PDS/About%20PDS.html
COURSE DESCRIPTION AND OBJECTIVES:
This course covers the challenges faced in constructing parallel and distributed applications, Various
implementation techniques, paradigms, architectures and parallel algorithms. And current trends in
parallel and distributed computing like Open MP, POSIX Threads, Apache Hadoop (DFS).

MODULE-1
UNIT-1 12L+8T+0P=20 Hours
INTRODUCTION TO PARALLEL COMPUTING
The idea of Parallelism, Power and potential of parallelism, examining sequential and parallel programs,
Scope and issues of parallel and distributed computing, Goals of parallelism, Parallelism and concurrency
using multiple instructions streams.
Parallel Architecture: Pipeline architecture, Array processor, Multi-processor architecture, Systolic
architecture, Dataflow architecture, Architectural classification schemes, Memory access classification,
Memory Issues: Shared vs. distributed, Symmetric multiprocessing (SMP), SIMD, Vector processing,
GPU co-processing, Flynn’s Taxonomy, Instruction Level support for parallel programming, Multiprocessor
caches and Cache Coherence, Non-Uniform Memory Access (NUMA).

UNIT-2 12L+8T+0P=20 Hours

PARALLEL ALGORITHM DESIGN PRINCIPLES AND PROGRAMMING
Need for communication and coordination/synchronization, Scheduling and contention, Independence
and partitioning, Task- Based Decomposition, Data Parallel Decomposition, Characteristics of task
and interaction, Load balancing, Data Management, parallel algorithm models, Sources of overhead
in parallel programs, Performance metrics for parallel algorithm implementations, Parallel algorithmic
patterns like divide and conquer, Map and Reduce, Specific algorithms like parallel Merge Sort, Parallel
graph Algorithms.

PRACTICES:
● Identify Multiple Instruction Single Data, or MISD. How would an MISD system work? Give
an example.
● Suppose a shared-memory system uses snooping cache coherence and write-back caches.
Also suppose that core 0 has the variable x in its cache, and it executes the assignment x = 5.
Finally suppose that core 1 doesn’t have x in its cache, and after core 0’s update to x, core 1
tries to execute y = x. What value will be assigned to y? Why?
● Consider a simplified version of bucket-sort. You are given an array A of n random integers
in the range [1...r] as input. The output data consist of r buckets, such that at the end of the
algorithm, Bucket i contains indices of all the elements in A that are equal to i.
Describe a decomposition based on partitioning the input data (i.e., the array A) and an
appropriate mapping onto p processes. Describe briefly how the resulting parallel algorithm
would work.
Describe a decomposition based on partitioning the output data (i.e., the set of r buckets)
and an appropriate mapping onto p processes. Describe briefly how the resulting parallel
algorithm would work.

VFSTR 118
 CSE - IV Year I Semester

● Consider seven tasks with running times of 1, 2, 3, 4, 5, 5, and 10 units, respectively. Assuming SKILLS:
that it does not take any time to assign work to a process, compute the best- and worst-case  Recognize
speedup for a centralized scheme for dynamic mapping with two processes. parallelism in
computational
problems.
MODULE-2
 Know different
UNIT-1 12L+8T+0P=20 Hours parallel systems
and their
INTRODUCTION TO DISTRIBUTED SYSTEMS classification.

Goals of the Distributed Systems, Relation to parallel systems, synchronous versus asynchronous  Design parallel
execution, design issues and challenges, Types of Distributed Systems, Distributed System Models, algorithms
for different
Hardware and software concepts related to distributed systems, middleware models. applications.
Distributed Computing and Communication design principles: A Model of distributed executions,  Compare
Models of communication networks, Global state of distributed system, Models of process communication. replication
schemes with
Communication and Coordination: Shared Memory, Consistency, Atomicity, Message- 08 Passing,
respect to
Consensus, Conditional Actions, Critical Paths, Scalability, and cache coherence in multiprocessor performance,
systems, synchronization mechanism. availability and
consistency
concerns.
UNIT-2 12L+8T+0P=20 Hours
 Design,
PARALLEL AND DISTRIBUTED PROGRAMMING FRAMEWORKS implement,
and debug
Overview of CUDA, Open MP, POSIX Threads, Apache Hadoop (DFS), and current trends in parallel distributed
and distributed computing. systems.
 Implement
PRACTICES: parallel
algorithms
● Give five types of hardware resource and five types of data or software resource that can using MPI
usefully be shared. Give examples of their sharing as it occurs in practice in distributed systems. and OpenMP
● The host computers used in peer-to-peer systems are often simply desktop computers in environments.
users’ offices or homes. What are the implications of this for the availability and security of  Element parallel
any shared data objects that they hold and to what extent can any weaknesses be overcome algorithms
using MPI
through the use of replication?
and OpenMP
● Consider two communication services for use in asynchronous distributed systems. In service environments
A, messages may be lost, duplicated or delayed and checksums apply only to headers. In 3.0 3.5
service B, messages may be lost, delayed or delivered too fast for the recipient to handle them,  AVERAGE.
but those that are delivered arrive with the correct contents. Describe the classes of failure
exhibited by each service. Classify their failures according to their effects on the properties of
validity and integrity. Can service B be described as a reliable communication service?
● Illustrate distributed design through a substantial case study, examining in detail the design of
the Google infrastructure, a platform and associated middleware that supports both Google
search and a set of associated web services and applications including Google Apps.
● Implementation of the parallel algorithms (on a PC-cluster under Linux platform). The programs
will be based on POSIX Thread, MPI programming, Hadoop, Apache Spark etc.

VFSTR 119
 CSE - IV Year I Semester

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply the fundamentals of parallel and parallel
1 Apply 1 1
computing including architectures and paradigms.
Analyse the various design principles of parallel
2 Analyse 1 2
algorithms.
Under-
3 Learn the intricacies of distributed programming. 2 1
stand
Develop and execute basic parallel and distributed
4 applications using basic programming models create 2 5
and tools.

TEXT BOOKS:
1. DISTRIBUTED SYSTEMS Concepts and Design Fifth Edition. George Coulouris. Cambridge
University. Jean Dollimore formerly of Queen Mary, University of London.
2. Distributed Systems Principles and Paradigms Andrew S. Tanenbaum Maarten Van Steen, 3rd
Edition, 2017.

REFERENCE LINKS:
1. Introduction To Parallel Programming, Peter S. Pacheco University of San Francisco.
2. Introduction To Parallel Processing, M.Sasikumar, Dinesh Shikhare and P. Ravi Prakash, Randy
Chow, T. Johnson, Distributed Operating Systems and Algorithms, Addison Wesley.
3. Ian Foster: Designing and Building Parallel Programs – Concepts and tools for Parallel Software
Engineering, Pearson Publisher, 1st Edition, 2019.
4. Parallel Programming in C with MPI and Open MP Michael J.Quinn, McGrawHill Higher
Education.
5. https://hpc.llnl.gov/training/tutorials/introduction-parallel-computing-tutorial.
6. https://www.geeksforgeeks.org/introduction-to-parallel-computing/.
7. https://nptel.ac.in/.
8. https://www.coursera.org/.

VFSTR 120
 CSE - IV Year I Semester

24CS403 PRIVACY AND INTRUSION

DETECTION
Hours Per Week :

L T P C
2 2 0 3
PREREQUISITE KNOWLEDGE: Cryptography and Network Security.
Source: https://www.
kirkpatrickprice.com/blog/
COURSE DESCRIPTION AND OBJECTIVES: idps-techniques

This course aims to understand modern concepts related to Intrusion Detection System. The course
compares alternative tools and approaches for Intrusion Detection through quantitative analysis to
determine the best tool or approach to reduce risk from intrusion Students undergoing this course can
identify and describe the parts of all intrusion detection systems and characterize new and emerging
IDS technologies according to the basic capabilities all intrusion detection systems share.

MODULE-1
UNIT-1 8L+0T+8P=16 Hours
INTRODUCTION
Basic Concepts of Security, Introduction to Intrusions, Need of Intrusion Detection, Classification of
Intrusion Detection Systems, Sources of Vulnerabilities, Attacks against various security objectives,
countermeasures of attacks.

UNIT-2 8L+0T+8P=16 Hours

INTRUSION DETECTION AND PREVENTION TECHNOLOGIES
Host-based intrusion detection system (HIDS), Network-based IDS, Information Sources for IDS, Host
and Network Vulnerabilities and Countermeasures. Intrusion detection techniques, misuse detection:
pattern matching, rule-based and state-based anomaly detection: statistical based, machine learning
based, data mining-based hybrid detection.
IDS and IPS Architecture: Tiered architectures, Single-tiered, Multi-tiered, Peer-to-Peer. Sensor: sensor
functions, sensor deployment and security.

PRACTICES:
● Installing Snort into the Operating System
● Configuring and Starting the Snort IDS
● Writing and Adding a Snort Rule
● Triggering an Alert for the New Rule

MODULE- 2
UNIT-1 8L+0T+8P=16 Hours
AGENTS
Agent functions, agent deployment and security. Manager component: manager functions, manager
deployment and security. Information flow in IDS and IPS, defending IDS/IPS, Case study on commercial
and open-source IDS.

UNIT-2 8L+0T+8P=16 Hours

ALERT MANAGEMENT AND CORRELATION DATA FUSION
Alert correlation, Pre-process, Correlation Techniques, Post-process, Alert Correlation architectures.
Cooperative Intrusion Detection, Cooperative Discovery of Intrusion chain, Abstraction-based Intrusion

VFSTR 121
 CSE - IV Year I Semester

SKILLS: Detection, Interest-based communication and cooperation, agent-based cooperation.

 Installation and
configuration of PRACTICES:
IDS.
● Demo of Eavesdropping attack and its Prevention using SSH.
 Compare
various anomaly ● Demonstrate how to provide secure data storage, secure data transmission and for creating
detection digital signatures (GnuPG)
techniques. ● Setup a honey pot and monitor the honeypot on network (KF Sensor)
 Evaluate ● Installation of rootkits and study about the variety of option.
security of
intrusion
● Perform wireless audit on an access point or a router and decrypt WEP and WPA. (NetStumbler)
detection tool. ● Install any open-source IDS and study the logs

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs

Apply Intrusion Detection tools and techniques in

1 Apply 2 1,2
order to improve their security posture.
Apply the knowledge to the architecture, configu-
2 ration, and analysis of specific intrusion detection Apply 2 1, 2
systems.
Analyse appropriate situations and scenarios
where intrusion detection may be applied to
3 Analyse 1 1,2
achieve an increased level of situational aware-
ness and information assurance.
Evaluate the security of an organization for better
4 Evaluate 1 1,2
performance.

TEXT BOOKS:
1. C. Endorf, E. Schultz and J. Mellander, Intrusion Detection & Prevention, McGraw-Hill/Osborne
, 2006.

REFERENCE BOOKS:
1. Ali A. Ghorbani, Network intrusion detection and prevention concepts and techniques, Springer,
2010.
2. J. M. Kizza, Computer Network Security, Springer, 2005.
3. Chris Sanders and Jason Smith, Applied Network Security Monitoring: Collection, Detection,
and Analysis, Syngress, 2013.

VFSTR 122
 COMPUTER SCIENCE
AND ENGINEERING

 22CS801 - Advanced Data Structures

 22CS802 - Advanced JAVA Programming
 22CS803 - Computer Graphics
 22CS804 - Deep Learning
 22CS805 - Digital Image Processing
 22CS807 - Mobile Ad-hoc Networks
 22CS809 - Text Mining
 22CS810 - Numerical Algorithms
 22CS811 - Operating System Design
 22CS813 - Simulation and Modeling

I SEM & II SEM

 CSE - Department Electives

22CS801 ADVANCED DATA STRUCTURES

Hours Per Week :

L T P C
2 2 2 4
PREREQUISITE KNOWLEDGE: Data structures.
Source: https://
COURSE DESCRIPTION AND OBJECTIVES: www.baeldung.
com/cs/advanced-
Advanced data structures are one of the most important disciplines of data science since they are used data-structures
for storing, organizing, and managing data and information to make it more efficient, easier to access,
and modify. The objective of this course is to improve students’ skills in designing data structures and
algorithms for various solutions, and problem design in large systems and applications such as databases,
information retrieval systems, bioinformatics, and geographic information systems.

MODULE-1
UNIT-1 8L+8T+8P=24 Hours

HASHING, EXTERNAL SORTING & PRIORITY QUEUE

Hashing: Introduction, Hash Function, Collision Resolution Technique: Separate Chaining, Open
Addressing.
External Sorting: Merge Sort.
Priority: Priority Queues: Introduction, Types of priority queues, implementing max priority queue and
min priority queue.

UNIT-2 8L+8T+8P=24 Hours

TREES
Trees: Splay tree, Red Black Tree (RBT), Operations on RBT, M-way search tree and operations,
Segment tree.

PRACTICES:
● Implementation of Hash Table.
● Implementation of Separate Chaining and Linear Probing
● Implementation of merge sort by taking a large file as input and sort the file.
● Implement different operations on Priority Queue. i.e. adding an element, removing an element,
size of the priority queue, printing the queue, and top element of the queue.
● Implementation of a Splay tree operation.
● Implementation of a Red-Black tree operation.
● Implementation of M Way Search tree.
● You are given a tree with n vertices (numbered 1, 2, …, n) and an integer k.
A subtree is defined as a connected subgraph of the tree. That is, a subtree is another tree that can be
obtained by removing some (possibly none) vertices and all edges incident to those vertices from T.
A subset S of vertices is called good if every subtree containing all the nodes in S has at least k nodes.
Find the size of the smallest good subset.
Input:
The first line contains a single integer T, the number of test cases. The descriptions of test cases follow.
The first line of each test case contains two integers, n, and k.
The next n-1 lines each contain two integers u, v, denoting an edge between vertices u and v of the tree..

VFSTR 121
 CSE - Department Electives

SKILLS: Output:
 Analyse the For each test case print in a single line, the minimum size of a good subset.
data structure
required
for various MODULE-2
applications.
UNIT-1 8L+8T+8P=24 Hours
 Usage of trees,
graphs, heaps HEAPS
and tries.
Heaps: Introduction, types of heaps, heap implementation with an array, heap sort, technique to sort
 Know various elements, Mergeable heaps, Application of heap.
pattern
searching
algorithms. UNIT-2 8L+8T+8P=24 Hours

PATTERN SEARCHING & TRIES

Pattern Searching: Pattern matching algorithms -Brute force, the Boyer —Moore algorithm, Robin-Karp
algorithm, Knuth-Morris-Pratt algorithm.
Tries: Standard Tries, Compressed Tries, Suffix tries.

PRACTICES:
● You are given N numbers you can decrease each number by 10 % or K kg whichever is more.
If the number, you choose is less than K you can make it zero. Your task is to minimize the sum
of the number as small as possible by performing N operations only. [Note: Use Priority Queue].
Example:
Input:
N=2
k = 10
arr = 100 15
Output:
95
Explanation:
You will remove 10 from 100
then once again remove 10 90.
● Given a Binary Heap of size N in an array arr[]. Write a program to calculate the height of the
Heap.
Input: N = 6
arr = {1, 3, 6, 5, 9, 8}
Output: 2
● Given two binary max heaps as arrays, merge the given heaps to form a new max heap.
Example:
Input :
n=4m=3
a[] = {10, 5, 6, 2},
b[] = {12, 7, 9}
Output :
{12, 10, 9, 2, 5, 7, 6}
● In Doraland, people have unique Identity Numbers called D-id. Doraemon owns the most popular
gadget shop in Doraland. Since his gadgets are in high demand and he has only K gadgets
left he has decided to sell his gadgets to his most frequent customers only. N customers visit
his shop and D-id of each customer is given in an array array [ ]. In case two or more people
have visited his shop the same number of time he gives priority to the customer with higher
D-id. Find the D-ids of people he sells his K gadgets to.

VFSTR 122
 CSE - Department Electives

Example:
Input:
N=6
array[] = {1, 1, 1, 2, 2, 3}
K=2
Output:
12
Explanation:
Customers with D-id 1 and 2 are most frequent.
● You are given q queries of two types:
X: Append value X into an array.
X K: You are required to print the Kth minimum XOR of X with the current array.
You have to make a new array whose ith element is current_array[i]X. Then sort it and print
the Kth element.
Input format
The first line contains q (1d”qd”100000).
Next q lines contain the types of queries. (1 or 2) If type is 1, then it contains X (1d”Xd”10e18).
If type is 2, then it contains X (1d”Xd”10e18) and K (Kd”current array size).
Output format
Print the number in the second type of query. (Note: Use Tries)
● Given an array of strings arr[] of size n and given s a string str and an integer k. The task is
to find the count of strings in arr[] whose prefix of length k matches with the k length prefix of
str. [Note: Use Tries]
Input:
n=6
arr[] = {“abba”, “abbb”, “abbc”, “abbd”, “abaa”, “abca”}
str = “abbg”
k=3
Output: 4
Explanation:
“abba”, “abbb”, “abbc” and “abbd” are the matching strings.
● Given an array of integers of size N find minimum xor of any 2 elements. [Note: Use Tries]
Input:
N=3
arr[] = {9,5,3}
Output: 6
Explanation:
There are 3 pairs –
9^5 = 12
5^3 = 6
9^3 = 10
Therefore output is 6.

VFSTR 123
 CSE - Department Electives

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
1 Implement external sorting and priority queue Apply 1 1,2
Implement different types of trees and apply them
2 Apply 1 1,2,3
to problem solutions.
Apply the concepts of advanced Trees for solving
3 Apply 1 1,2,3
problems effectively.
Analyze how efficient pattern matching principles
4 can be used in the design and implementation of Analyse 2 1,2,3,4
qualitative research.
Analyze the given scenario and choose the
5 Analyse 2 1,2,3,4
appropriate Data Structure for solving problems.

TEXT BOOKS:
1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, 2nd Edition, Pearson, 2004.
2. T.Cormen, R.Rivest, C.Stein, C.Leiserson,“Introduction to Algorithms”, , PHI publication, Second
Edition, 2004, ISBN 81-203-2141-3.

REFERENCE BOOKS:
1. Mark de Berg, Otfried Cheong, Marc van Kreveld, Computational Geometry: Algorithms and
Applications:, Springer; 3rd Edition. 2008.
2. Sahani, Anderson freed, Horowitz, Fundamentals of DATA STRUCTURES in C, Silicon Pr; 2nd
Edition, August 1, 2007.

VFSTR 124
 CSE - Department Electives

22CS802 ADVANCED JAVA PROGRAMMING

Hours Per Week :

L T P C
2 2 2 4

PREREQUISITE KNOWLEDGE: Programming JAVA.

Source: https://
COURSE DESCRIPTION AND OBJECTIVES: www.kpl.
gov/catalog/
Advanced Java programming covers the standard concepts such as database connectivity, web-services, item/?i=ent://
LYNDA/0/
web application development etc. It is specially designed to develop web-based, network-centric or LYNDA:103608
enterprise applications. It simplifies the complexity of building an n-tier application.

MODULE-1
UNIT-1 8L+8T+8P=24 Hours

INTRODUCTION TO JAVA WEB FRAME WORKS

Introduction to Java Web frameworks: What is Framework in Java, Advantages of Frameworks,
Popular Java Web Frameworks: Spring, Spring Boot, Hibernate, Java Server Faces, Google Web Toolkit
etc., Comparison of the web frameworks. Environmental setup to use Web Frameworks.

UNIT-2 8L+8T+8P=24 Hours

ORM AND HIBERNATE

ORM: What is Object Relational Mapping, How ORM Works, Features of ORM, Advantages, Java
ORM- Hibernate, JAVA Persistence API(JPA), ORM implementation.
Hibernate: Overview of Hibernate, Hibernate Architecture, Hibernate Mapping Types, Hibernate O/R
Mapping, Hibernate Annotation, Hibernate Query Language.

PRACTICES:
● Installation and Environmental setup to work with java Web Frameworks.
● Create a simple application of hibernate using XML.
● Create a maven based hibernate application using annotation
● Develop a web application using hibernate framework.
● Using the web application to perform database access with hibernate framework.

MODULE-2
UNIT-1 6L+6T+6P=18 Hours

STRUTS
Struts: Struts framework, Struts features, Model 1vs Model 2 (MVC) Architecture, Core components
of Struts, Configuration of Struts, Creating a Struts Application.

UNIT-2 10L+10T+10P=30 Hours

SPRING AND SPRING BOOT

Spring: Overview of Spring, Spring Architecture, Inversion of Control (IOC) and Dependency Injection,
XML Configuration on Spring, Creating a Spring Application. Spring MVC, flow of Spring Web MVC,
Spring Web MVC Framework Example.
Spring Boot: Overview of Spring Boot, Spring vs Spring MVC vs Spring Boot, SB architecture,
Components of SB, Creating Spring Boot Application.

VFSTR 125
 CSE - Department Electives

SKILLS: PRACTICES:
 To know the ● Develop a simple web application using struts.
importance of
java web frame- ● Develop a CRUD (Create Read Update Delete) Application using spring.
works to develop ● Implement Spring MVC Pagination, which is used to display a large number of records in
enterprise java
different parts. Display 10, 20 or 50 records in one page.
applications.
● Using Spring MVC upload a file.
 To experience
developing a ● Create a self-contained HTTP application that uses embedded server like Tomcat using Spring
web application Boot.
using MVC
architecture. COURSE OUTCOMES:
 Design and Upon successful completion of this course, students will have the ability to:
develop CRUD
applications
CO Blooms Module Mapping
using different Course Outcomes
java frameworks. No. Level No. with POs

 To derive hands Implement web frameworks to develop web

on experience
1 Apply 1 1,2,3
applications using java.
of developing
enterprise Design java web applications using MVC
applications 2 Create 1 1,2,3
architecture using web frameworks like hibernate.
using advanced
web frameworks Implement java application to interact with
like Spring and 3 Apply 2 1,2,3
Spring Boot.
database using struts.
Design secure transaction-based web applications
4 Create 2 1,2,3,4
using Spring framework.

TEXT BOOKS:
1. James Keogh, “Complete Reference J2EE”, 9th Edition, McGraw Hill, Education, 2002.
2. Jeff Linwood and Dave Minter, “Beginning Hibernate”, 2nd Edition, Après publication 2010.

REFERENCES BOOKS:
1. Sharanam Shah, Vaishali Shah. “Structs 2 for Beginners”, 3rd Edition, Arizona Business Alliance,
2014.
2. Craig walls, “Spring in Action”, 5th Edition, Manning Publication, 2018.
3. https://struts.apache.org/getting-started/index.html.
4. https://www.javatpoint.com/hibernate-tutorial.
5. https://www.dineshonjava.com/spring-tutorial/.

VFSTR 126
 CSE - Department Electives

22CS803 COMPUTER GRAPHICS

Hours Per Week :

L T P C
2 2 2 4

PREREQUISITE KNOWLEDGE: Basic Logical Thinking and Problem Solving Ability.

Source: https://www.
COURSE DESCRIPTION AND OBJECTIVES: javatpoint.com/
computer-graphics-
This course provides a comprehensive introduction to computer graphics leading to understanding the
tutorial
contemporary terminology and algorithms of computer graphics. To make the students learn the basic
principles of visualization. To give an introduction to 2D and 3D modelling and animation.

MODULE-1
UNIT-1 8L+8T+8P=24 Hours

OVERVIEW OF GRAPHICS SYSTEM INTRODUCTION

Application areas of Computer Graphics; Video-display devices: raster-scan systems and random scan
systems; Graphics primitives: display devices, primitive devices; Filled area primitives: scan line polygon
fill algorithm, boundary-fill and flood-fill algorithms.

UNIT-2 8L+8T+8P=24 Hours

2D GEOMETRIC TRANSFORMATIONS AND VIEWING BASIC TRANSFORMATION

Geometric Transformations, matrix representations, and homogeneous coordinates. Inverse
transformations, 2DComposite transformations, other 2D transformations, raster methods for geometric
transformations; 2-D Viewing: The viewing pipeline, window to viewport coordinate transformation,
Cohen-Sutherland and Cyrus-beck line clipping algorithms, Sutherland –Hodgeman polygon clipping
algorithm.

PRACTICES:
● Points & Polygons: Suppose the vertices of a convex polygon are p¯1, . . . ,p¯N, given in
counter-clockwise order. Let the coordinates of vertex p¯i be (xi ,yi).

Describe an algorithm that can tell whether a 2D point q¯ is inside the gray-shaded region in
the figure. You should assume that the polygons defined by vertices p¯1, . . . ,p¯N and r¯1, .
. . , r¯M, respectively, are both convex. Hint: Each edge is contained in an infinite line. Each
infinite line divides the 2D plane into two half-planes, the left half-plane and the right half-
plane (here left/right means left/right with respect to a counter-clockwise direction of traversal
of the vertices). The key insight you should use is that the interior of a convex polygon is the
intersection of the left half-planes of all the edges of the polygon.

VFSTR 127
 CSE - Department Electives

SKILLS: ● Transformations & Commutativity: We say that the 2D transformations f() and g() commute if
 Learn various and only if f(g(¯p)) = g(f(¯p)) for all points p¯ ∈ R 2 . For each of the four cases below, where
clipping f() and g() are homographies, prove whether or not they commute:
algorithms.
a) Both f() and g() are arbitrary homographies.
 Compare
2-D and 3_D b) One is an arbitrary rotation and the other an arbitrary translation.
transformations.
c) One is an arbitrary translation and the other is a non-uniform scaling.
 Learn various
surface d) One is an arbitrary rotation and the other is a reflection. In each case, your solution can
detection either be a derivation that proves/disproves commutativity or, if f() and g() do not commute, a
methods
specific counter-example.
● Contrast the implementation of Display File/Frame Buffer for a Random Scan System & Raster
Scan System. Which type of system shall offer more consistent refresh rate and why?
● Determine the most appropriate pixels that will be plotted when Bresenham’s algorithm is used
to draw a line joining the points (10,20) and (20,30)
● Suppose a system with 8 inches by 10 inches video monitor that can display 100 pixels per inch.
If memory is organized as one byte words, the starting frame buffer address is 0 and each pixel
is assigned one byte of storage in memory, what is the frame buffer address of pixel with screen
coordinates (x,y) ? Also, determine the total amount of memory consumed by the frame buffer.
● Consider a raster monitor of resolution 640*480 pixels. A scanning is used with horizontal retrace
time of 4 micro seconds and vertical retrace time of 20 micro seconds respectively. Calculate
the time available to display a pixel for both cases of (i) non-interlaced and (ii) interlaced.
Assume a scan rate of 50 frames.

MODULE-2
UNIT-1 8L+8T+8P=24 Hours

3D GEOMETRIC TRANSFORMATIONS
3-D Object representation, 3-D geometry primitives, transformations, projection clipping. Interaction:
Hardware input devices handling algorithms, Event handling echoing, Interactive techniques,3-D
Geometric transformations, Translation, rotation, scaling, reflection and shear transformations, composite
transformations, 3D viewing: Viewing pipeline, viewing coordinates, general projection transformation
and clipping.

UNIT-2 8L+8T+8P=24 Hours

VISIBLE SURFACE DETECTION METHODS

Back-face detection, depth buffer, A-buffer, Z-buffer, scan-line Illumination Models, and Surface rendering
Methods: Basic illumination models, polygon rendering method.

PRACTICES:
● Matrix implementation is a powerful technique used for computer graphics. For the concerns
stated in section II, matrix for 3D space is represented as a 4X4 array instead of 3X3 array.
● Each operation of object such as translation and rotation can be represented by one Matrix.
By multiplying the matrix, a vector/point can be transformed by the operation. For example, P
= (x, y, z, 1) is a point’s coordinator before the operation, and M = (1 0 0 a) (0 1 0 b)(0 0 1 c)
(0 0 0 1) is the matrix representation of translating the object a blocks right, b blocks up and c
blocks forward, then after the translating, the point’s coordinator will become P’ = P*M is the
coordinator of the point after the operation.
● A sequence of operation can also be composed to be one operation. For example, matrix M1
represent first operation, matrix M2 represent second operation, the matrix M = M1*M2 will
represent this sequence of 2 operations. If P = (x, y, z, 1) is the coordinator of the point before
perform the sequence of the operations, then P’ = P * M will be the coordinator of the point
after the perform the operation1 then perform the operation2.

VFSTR 128
 CSE - Department Electives

Following are matrix representation for some operations:

● Translate object by V, where V is the vector:
M = (1 0 0 V[0]) (0 1 0 V[1]) (0 0 1 V[2]) (0 0 0 1)
● Rotate object along X axis by d degree:
M = (1 0 0 0) (0 cos(d) -sin(d) 0) (0 sind(d) cos(d) 0) (0 0 0 1)
● Rotate object along Y axis by d degree:
M = (cos(d) 0 sin(d) 0) (0 1 0 0) (-sin(d) 0 cos(d) 0) (0 0 0 1)
● Rotate object along Z axis by d degree:
M = (cos(d) -sin(d) 0 0) (sin(d) cos(d) 0 0) (0 0 1 0) (0 0 0 1)
● Start with a unit cube centered at the origin. Use two more cubes like this one and obtain the
model shown in the right image, where each new cube is twice the size of the previous one

Below list the transformations in the order in which they were applied
1) scaling 2) Translation 3) Rotation
● There are situations in which rotations about axes other than the three coordinate axes are
useful. In the next two activities, you will discover how a rotation about an arbitrary axis can
be broken down into a series of rotations about the three coordinate axes.
● The yellow axis passing through the teapot in the image below is parallel to the vector (1, 1,
0). Determine a sequence of coordinate axis rotations that result in the teapot rotating 180
degrees about the yellow axis, as shown in the right image.

Write the sequence of rotations in the order in which you applied them. Hint: use a rotation that aligns
the yellow axis with the x-axis, then rotate the object about the xaxis, then use the reverse rotation that
brings the yellow axis back to original position.

VFSTR 129
 CSE - Department Electives

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs

Implement of various graphics systems along with

1 Apply 1 1, 2
the algorithms used for these devices for drawing.

Demonstrate 2D graphics and algorithms

2 including line drawing, polygon filling, clipping, Apply 1 1, 2
and transformations.

Demonstrate Concepts and techniques used in

3 Apply 2 1, 2, 3
3D computer graphics and basic about animation.

Implement Surface detection methods to get a

4 Apply 2 1, 2,3
realistic screen image.

TEXT BOOKS:
1. Donald Hearn and M. Pauline Baker, “Computer Graphics C version”, Pearson education,
Second Edition, 2014.
2. Zhigang Xiang, Roy Plastock, “Computer Graphics”, Schaum’s outlines, Second Edition, Tata
McGraw Hill Edition, 2000.

REFERENCE BOOKS:
1. Foley, VanDam, Feiner and Hughes, “Computer Graphics Principles &Practice in C”, Pearson
Education. 2nd Edition, 1996.
2. David F Rogers, “Procedural elements for Computer Graphics”, Tata McGraw Hill, 2nd Edition.,
1988.
3. Neuman and Sproul, “Principles of Interactive Computer Graphics, Tata McGraw Hill”, 2nd
Edition., 1978.
4. Shalini, Govil-Pai, “Principles of Computer Graphics”, Springer. 1st Edition, 2006.
5. Steven Harrington, “Computer Graphics”, TMH, 2nd Edition, 1987.

VFSTR 130
 CSE - Department Electives

22CS804 DEEP LEARNING

Hours Per Week :

L T P C
3 0 2 4

PREREQUISITE KNOWLEDGE: Machine learning, Python programming.

Source: https://www.
symmetrymagazine.
COURSE DESCRIPTION AND OBJECTIVES:
org/sites/default/files/
This course offers sufficient details required to understand the basic building blocks of various deep images/standard/neural_
network_visual_final.jpg
learning based models. Especially, focuses on different types of neural network models like feed forward
neural networks, convolutional neural networks, recurrent neural networks, and deep auto encoders.
During this course the students build, train, and evaluate deep neural network models for various
applications in image, text, and speech domains. In addition, throughout this course students will be
able to understand hyper parameter tuning and other best-practices to be followed while training deep
neural network models.

MODULE-1
UNIT-1 12L+0T+8P=20 Hours

EVOLUTION OF DEEP NEURAL NETWORKS

Deep Learning Intuition: History of Deep Learning, what is Deep Learning? Applications of Deep
Learning.
Neural Network Basics: McCulloch–Pitts neuron, Perceptron learning rule, Perceptron convergence
theorem, Sigmoidal neuron, Multi-layer feed forward neural network, back propagation algorithm,
Gradient descent method, Stochastic gradient descent method. Shallow Neural Networks and Deep
Neural Networks.
REGULARIZATION and OPTIMIZATION for training Deep Models: Optimization methods - Adagrad,
Adadelta, RMSProp, Adam; Regularization Methods-Dropout, Drop connect, Batch normalization;
Activation functions - Linear, sigmoid, sigmoid, ReLU and variations of ReLU; Losss Function, Improving
the training process – Dataset Augmentation, Noise Robustness, Weight Initialization methods, Early
stopping, Parameter sharing and tying, bagging and other ensemble methods;

UNIT-2 12L+0T+8P=20 Hours

CONVOLUTIONAL NEURAL NETWORKS

Convolutional Neural Networks (CNNs): Foundations of Convolutional Neural Network, Popular Deep
CNN Models: LeNet, AlexNet, VGGNet, ResNet, Google Net and other architectures.

INSTRUCTIONS FOR PRACTICES:

● Practice Assignments can be implemented using the Keras / Tensorflow APIs of Python
● Relevant data sets can be downloaded from standard repositories such as Kaggle/UCI or can
be developed by the students.

PRACTICES:
● Implement Logistic regression With Neural Network Mindset.
● logistic regression classifier for classification.
● Plot the loss over each epoch.
● Plot the accuracy over each epoch.
● Report final Accuracy.

VFSTR 131
 CSE - Department Electives

SKILLS: ● Implement Shallow Neural Network model:

 Developing ● Implement a binary classification neural network with a single and multiple hidden layers.
Vision and
text based
● Implement a Multi-class classification neural network with a single and multiple hidden
applications layers.
 Hyperparameter ● Vary the number of neurons at suitable layers.
Tuning of a deep ● Hyper parameter Tuning of a Neural Network model implemented for hand-written digit
Neural network classification:
model.
● Vary the type of activation functions.
 Tensor Flow/
Keras tool
● Choose suitable Loss functions.
usage for ● Vary the number of neurons at suitable layers.
neural network
● Vary Weight Initialization methods.
implementation.
● Save the Best Model and load the saved model.
● Building a Deep Neural Network:
● Implement a multi-class classification neural network with number of layers of your choice.
● Include Batch Normalization layers.
● Vary Optimization methods.
● Add drop out layers.
● Convolutional Neural Network Models.
● Design a Convolutional neural network with the layers of your choice
● Compare the performance by changing the
● Kernel size
● Number of feature maps at each convolutional layer
● Stride.
● Padding.
● Number of fully connected layers.
● Visualization of CNN Models.
● Design a Convolutional Neural Network Model for image classification.
● Plot Model Architecture.
● Visualize feature maps after training of CNN.
● Visualize class activation maps.

MODULE-2
UNIT-1 14L+0T+10P=24 Hours

DEEP UNSUPERVISED LEARNING

Transfer learning Approaches: Deep Pre-trained architectures- AlexNet, VGG16, VGG19, ResNEt.
Use deep Convolutional architectures for feature extraction and fine-tuning tasks.
Deep Unsupervised Learning: Autoencoders- Under complete Autoencoders, regularized auto
encoders, Representation power, layer size and depth, stochastic encoders and decoders, Denoising
auto-encoders, Sparse auto encoder, Contractive auto-encoders

UNIT-2 10L+0T+6P=16 Hours

RECURRENT NEURAL NETWORKS

Architecture of an RNN, unfolding of an RNN, Backpropagation through time, Long short term memory
(LSTM), Gated recurrent units, Applications- Text Classification, Sentiment Analysis.

PRACTICES:
● Using Deep pre-trained CNN model for feature extraction:
● Extract features from the FC1 of VGG network.
● Train any traditional ML model like SVM for classification.
● Repeat the above by considering FC2 of VGG for feature extraction.

VFSTR 132
 CSE - Department Electives

● Fine-tuning Deep pre-trained CNN for Classification:

● Fine-tune VGG network for the task under consideration.
● Check the performance by making.
● all the layers trainable.
● freezing the initial layers.
● freezing the entire network except the final layer.
● Design MLFFNN with 3-level stacked autoencoder based pre-training for Black and white
image data, Display features extracted by different levels of stacked autoencoder at the end
of pre-training.
● Sentiment Analysis
● Pre-process the text.
● Convert the text into word embeddings.
● Implement the classification network using LSTMs/ GRUs.
● Pre-process the text.
● Convert the text into word embeddings.
● Implement the classification network using LSTMs/ GRUs.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Implementation of Deep learning models to solve
1 Apply 1,2 1, 3
various real-time problems.
Analyse performance of a deep network and tune
2 Analyze 1 2
its capacity and hyper parameters.
Leveraging tools to Build deep networks and apply
3 Apply 1,2 1,5
them for real word tasks.
Developing core components for deep learning
4 Design 1,2 3
algorithms.

TEXT BOOKS:
1. Ian Good Fellow and Yoshua Bengio and Aaron, “Deep Learning”, 1st Edition, MIT Press, 2016.
2. Charu C Aggarwal “Neural Networks and Deep learning”, Springer International Publishing,
2018.

REFERENCE BOOKS:
1. Francois Chollet, “Deep learning with python”, 1st edition, Manning Publications, 2017.
2. S. Haykin, “Neural Networks and Learning Machines”, 3rd edition, Prentice Hall of India, 2011.
3. Josh Patterson and Adam Gibson, “Deep Learning: A Practitioner’s Approach”, 1st Edition,
O’Reilly, 2017.
4. Satish Kumar, “Neural Networks, A Classroom Approach”, Tata McGraw-Hill, 2007.

VFSTR 133
 CSE - Department Electives

22CS805 DIGITAL IMAGE PROCESSING

Hours Per Week :

L T P C
2 2 2 4
PREREQUISITE KNOWLEDGE: Probability and Statistics.
Source: https://www.
researchgate.net/figure/ COURSE DESCRIPTION AND OBJECTIVES:
Fundamental-steps-in-
digital-image-processing_ This course focuses on imparting knowledge about the aspects of Image Processing and its applications.
fig10_333856607 The main objective of the course is to learn digital image fundamentals, image transforms, image
enhancement, restoration and compression, morphological image processing, representation and
description.

MODULE-1
UNIT-1 6L+6T+6P=18 Hours

FUNDAMENTALS OF IMAGE PROCESSING

Fundamental steps in digital image processing, Components of image processing system, A simple image
formation model, Image sampling and quantization, Basic relationships between pixels, Introduction to
Fourier Transform and DFT – properties of 2D Fourier Transform, FFT.

UNIT-2 10L+10T+10P=30 Hours

IMAGE ENHANCEMENT IN THE SPATIAL AND FREQUENCY DOMAINS

Basic gray - level transformations, Histogram processing, Basics of spatial filtering, Smoothing spatial
filters, Sharpening spatial filters, The basics of filtering in the frequency domain, Image smoothing in
frequency domain filters, Image sharpening in frequency domain filters.
Image Segmentation: Fundamentals, Point, Line and edge detection, Thresholding, Region-based
segmentation, Segmentation using morphological watersheds, The use of motion in segmentation.

PRACTICES:
● Develop a module to enhance the image by using image arithmetic and logical operations.
● Develop a module for an image enhancement using kernel operations.
● Develop a module for gray level slicing with and without background.
● Develop a module for image enhancement using histogram equalization.
● Develop a module to filter an image using low pass & high pass filter in spatial domain. Compare
the performance of both filters.
● Develop a module for smooth an image using low pass & high pass filters in frequency domain.
Compare the performance of both filters.
● Develop a module for detecting lines & edges in an image.
● Develop a module for segmenting region of interest.

MODULE-2
UNIT-1 8L+8T+8P=24 Hours

IIMAGE RESTORATION
A model of image degradation/restoration, Noise models, inverse filtering, wiener filtering, Constrained
Least Squares Filtering, Geometric Mean Filter.
Image Compression: Fundamentals, Huffman coding, Golomb coding, LZW coding, Run-length coding

VFSTR 134
 CSE - Department Electives

UNIT-2 8L+8T+8P=24 Hours SKILLS:

 Apply knowledge
MORPHOLOGICAL IMAGE PROCESSING of science and
Erosion, Dilation, Opening, Closing, The hit-or-miss transformation; Basic morphological algorithms - engineering
principles to
boundary extraction, hole filling, extraction of connected components, thinning, thickening, skeletons, image related
pruning. problems.

Feature Extraction: Background, Boundary preprocessing, Boundary Feature Descriptors, Region  Undertake
image problem
Feature Descriptors, Principle Components as feature descriptors, Whole-image features. identification
and formulate
PRACTICES: solutions.
● Develop a module to perform add & removal of salt and pepper noise. Compute PSNR & MSE  Implement
and check the impact before and after removal of noise. algorithms for
enhancement,
● Develop a module to remove noise using average filter and median filter. Compute PSNR & restoration,
MSE before and after removal of noise. compression etc.
● Develop a module for image compression and decompression.
● Develop a module for morphological image operations - erosion, dilation, opening & closing.
● Develop a module for morphological image operations - hit-or-miss transformation.
● Develop a module for morphological image operations - thinning, thickening
● Develop a module for extracting boundary features of an image.
● Develop a module for extracting features of an image using GLCM.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Understand the fundamental concepts of a digital Under-
1 1 1,2
image processing system. stand
Learn different techniques employed for the en-
2 Analyse 1 1,2,3,5,12
hancement of images.
Employ image segmentation and representation
3 Apply 1 1,2,3,5,12
techniques to extract region of interest.
Learn different causes for image degradation and
4 Evaluate 2 1,2,3,5,12
overview of image restoration techniques.
Apply various compression techniques to reduce
5 image size and morphological operations to extract Apply 2 1,2,3,5,12
features.
Learn different feature extraction techniques for
6 Apply 2 1,2,3,5,12
image analysis and recognition.

TEXT BOOKS:
1. Rafeal C Gonzalez and Richard E.Woods, “Digital Image Processing”, 4th edition, Pearson
Education/ PHI, 2018.
2. Rafeal C Gonzalez and Richard E.Woods, “Digital Image Processing using MATLAB”, 4th
edition, Pearson Education/ PHI, 2020.

REFERENCE BOOKS:
1. Milan Sonka, Vaclav Hlavac and Roger Boyle, “Image Processing, Analysis and Machine
Vision”, 4th Edition, Cengage, 2015.
2. Alasdair McAndrew, “Introduction to Digital Image Processing with Matlab”, Thomson Course
Technology, 2004 Course Technology Press, Boston, MA, United States, 2004.
3. William K. Prat, “Digital Image Processing”, 4th Edition, Wiley-Interscience, A John Wiley &
Sons, Inc., Publication, 2007.

VFSTR 135
 CSE - Department Electives

22CS807 MOBILE AD-HOC NETWORKS

Hours Per Week :

L T P C
3 0 2 4

PREREQUISITE KNOWLEDGE: Computer networks.

Source: https://www.
educba.com/mobile-ad- COURSE DESCRIPTION AND OBJECTIVES:
hoc-network/
This course focuses on major aspects of ad hoc networking, from design through performance issues to
application requirements. It starts with the design issues and challenges associated with implementations
of ad hoc network applications. This includes mobility, disconnections, and battery power consumption.
The course provides a detailed treatment of proactive, reactive, and hybrid routing protocols in mobile
wireless networks. It also covers the IEEE 802.11 Wireless LAN and discusses their characteristics and
operations. Through activities, the course gives students hands-on experience in designing a mobile
ad hoc network using the NS2 simulator.

MODULE-1
UNIT-1 8L+0T+6P=14 Hours

INTRODUCTION
Introduction to ad-hoc networks-definition, characteristics, features, applications; Characteristics of the
wireless channel; Ad-hoc mobility models-indoor and outdoor models.

UNIT-2 16L+0T+10P=26 Hours

MEDIUM ACCESS PROTOCOLS

MAC protocols- design issues, goals and classification; Contention-based protocols – with reservation,
without reservation; Scheduling algorithms; Protocols using directional antennas; IEEE standards -
802.11a, 802.11b, 802.11g, 802.15; HIPERLAN.
Network Protocols: Routing protocols - design issues, goals, and classification; Proactive Vs reactive
routing; Unicast routing algorithms; Multicast routing algorithms; Hybrid routing algorithm; Energy-aware
routing algorithm; Hierarchical routing; QoS aware routing.

PRACTICES:
● Installation of NS-2 and basics of TCL scripting.
● TCL script for
a) computing the arithmetic operations on two operands.
b) finding the given number is prime or not using functions.
c) finding the factorial value of a given number.
● Set the node property and routing protocol in the same MANET scenario.
● Analyse the performance of the MANET.
● Develop MAC Protocol using any suitable Network Simulator for MANETs to send the packet
without any contention through wireless link using the following MAC protocols (CSMA/CA
(802.11)). Analyze its performance with increasing node density and mobility.
● Simulate MANET environment using suitable Network Simulator and test with various mobility
model such as Random walk, Random waypoint and Group mobility. Analyze throughput, PDR
and delay with respect to different mobility models.

VFSTR 136
 CSE - Department Electives

MODULE-2 SKILLS:
 Evaluate
UNIT-1 12L+0T+8P=20 Hours various routing
protocols.
END-END DELIVERY AND SECURITY
 Analyse the
Transport layer - issues in designing, transport layer classification, ad-hoc transport protocols; Security
performance of
issues in ad-hoc networks - issues and challenges, network security attacks; Secure routing protocols. MAC protocols
for Ad-hoc
UNIT-2 12L+0T+8P=20 Hours networks.
 Analyse the
CROSS LAYER DESIGN performance
Cross layer design - need for cross layer design, cross layer optimization; Parameter optimization of Network
techniques; Cross layer cautionary perspective; Integration of adhoc with mobile IP networks. protocols for Ad-
hoc networks.
PRACTICES:
● Create CBR traffic over UDP and TCP.
● Write an awk script that takes data from trace file and give the report for performance metrics
such as packet delivery ratio, and throughput.
● Implement Transport Control Protocol in Sensor Network.
● Design and Implementation of Security algorithm for Wireless networks (b)Implementation of
security protocol for mobile network.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Summarize the protocols used at the MAC layer
1 and scheduling mechanisms to express the Evaluate 1 1, 12
mathematical properties.
Apply proactive and reactive routing algorithms to
2 Apply 1 1, 2, 5, 12
find optimal paths.
Analyze types of routing protocols used for unicast
3 Analyse 1 1, 2, 5, 12
and multicast routing.
Compare the performance of various routing
4 Analyse 2 1, 2
protocols in ad-hoc networks.
Develop the network security solution and routing
5 Apply 2 1, 2, 12
mechanism.

TEXT BOOKS:
1. C. Siva Ram Murthy and B. S. Manoj, “Ad hoc Wireless Networks Architecture and Protocols”,
2nd Edition, Pearson Edition, 2007.
2. Charles E. Perkins, “Ad hoc Networking”, 1st Edition, Addison – Wesley, 2000.

REFERENCE BOOKS:
1. Stefano Basagni, Marco Conti, Silvia Giordano and Ivan stojmenovic, “Mobile ad-hoc
networking”, Wiley-IEEE press, 1st Edition, 2004.
2. Mohammad Ilyas, “The Handbook of Adhoc Wireless Networks”, 1st Edition, CRC press, 2002.
3. T. Camp, J. Boleng and V. Davies “A Survey of Mobility Models for Ad Hoc Network Research”
Wireless Commun. and Mobile Comp., Special Issue on Mobile Ad Hoc Net working Research,
Trends and Applications, vol. 2, no. 5, 2002, pp. 483–502.
4. A survey of integrating IP mobility protocols and Mobile Ad hoc networks, Fekri M. Abduljalil
and Shrikant K. Bodhe, IEEE communication Survey and tutorials, v no.1, 2007.
5. V. T. Raisinhani and S.Iyer “Cross Layer Design Optimization in Wireless Protocol Stacks”
Comp. Communication, Vol 27 no. 8, 2004.

VFSTR 137
 CSE - Department Electives

22CS809 TEXT MINING

Hours Per Week :

L T P C
3 0 2 4

PREREQUISITE KNOWLEDGE: Data analysis skills, Database, Machine learning or Deep learning
Source: https://www. algorithms..
javatpoint.com/text-data-
mining
COURSE DESCRIPTION AND OBJECTIVES:
This course introduces the fundamental concepts and techniques used in Text Processing. Students will
gain an in-depth understanding of the computational properties of natural languages and the commonly
used algorithms for processing linguistic information. The course examines models and algorithms used
in both the traditional symbolic and the more recent statistical approaches.

MODULE-1
UNIT-1 10L+0P+6P=16 Hours

INTRODUCTION
NLP tasks in syntax, semantics, and pragmatics. Applications such as information extraction, question
answering, and machine translation. The role of machine learning. Brief history of the field.
Regular Expressions, Text Normalization, Edit Distance: Regular Expressions, words, Corpora, Text
Normalization and Minimum edit distance.

UNIT-2 14L+0P+10P=24 Hours

N-GRAMS, VECTOR SEMANTICS AND EMBEDDING

N-Gram Language Models: N-Grams, Evaluating Language Models, Generalization and Zeros,
Smoothing, Kneser-Ney Smoothing, Huge Language Models and Stupid Back off.
Vector Semantics and Embeddings: Lexical semantics, Vector semantics, words and vectors, cosine
for measuring similarity, TF-IDF: weighing terms in the vector, Point wise Mutual Information, Applications
of TF/ IDP and PPMI vector models, word 2 vec, visualizing embeddings, semantic properties of
embeddings, bias and embeddings, evaluating vector models.

PRACTICES:
● Perform basic text pre-processing using the following approaches:
● Stop word Elimination.
● Removal of Special Characters.
● Stemming.
● Lemmatization.
● N-gram Tokenization.
● Design and develop a text classification model with various machine learning algorithms over
the following feature extraction methods and compare their performance.
● TF-IDF.
● Word2 Vec.
● Perform Exploratory Data Analysis using following:
● Word Cloud.
● Frequent Word Detection.
● Keyword Extraction based on ranking.

VFSTR 138
 CSE - Department Electives

MODULE-2 SKILLS:
 Exploratory Data
UNIT-1 12L+0P+8P=20 Hours analysis.

SEQUENCE LABELING FOR PARTS OF SPEECH AND NAMED ENTITIES  Opinion Mining/
Sentiment
Part-of-Speech Tagging, Named Entities and Named Entity Tagging, HMM Part-of-Speech Tagging, Analysis using
Conditional Random Fields, Evaluation of Named Entity Recognition. various deep
Learning
models.
UNIT-2 12L+0P+8P=20 Hours
 Text
SEQUENCE AND TRANSLATION PROCESSING Summarization
and
Deep Learning Architectures for Sequence Processing: Language Models Revisited, Self-Attention Categorization
Networks: Transformers. etc.

Machine Translation and Encoder-Decoder Models: The Encoder-Decoder Model, Encoder-Decoder

with RNNs, Attention, Beam Search, Encoder-Decoder with Transformers.

PRACTICES:
● Perform Named Entity Recognition to extract required entities from a given unstructured text
using NLTK.
● Perform POS Tagging with HMM and also optimize the performance of HMM with Viterbi.
● Design and develop a text classification model using Latent Dirichlet allocation and compare
its performance with TF-IDF and Word2Vec.
● Perform text classification using following methods and compare their performance in terms of
various evaluation metrics such as Accuracy, Precision, Recall and F-Score.
● CNN
● LSTM
● GRU
● Encoder-Decoder
● Transformers
● Design and develop text classification model using Attention.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Understand and apply the usage of regular
1 Apply 1 1
expressions to process the raw text.
Apply various approaches to sentiment analysis
2 Apply 1,2 1
using Machine Learning methods.
Analyze the vector semantics and embedding in
3 Analyze 1 2
the representation of the text.
Design and development various statistical
4 Evaluate 1,2 3,4,5
approaches to machine translation.

TEXT BOOK:
1. Daniel Jurafsky and James HMartin, “Speech and Language processing: An introduction to
Natural Language Processing, Computational Linguistics and speech Recognition”, 3rd Edition,
2020.
REFERENCE BOOKS:
1. Steven Bird, Ewan Klein, Edward Lopper, “Natural Language Processing with Python”, 1st
Edition, O’Reilly Publishers, 2009.
2. Nitin Indurkhya, Fred J. Damerau, “Handbook of Natural Language Processing”, 2nd Edition,
CRC Publishers, 2010.

VFSTR 139
 CSE - Department Electives

22CS810 NUMERICAL ALGORITHMS

Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Basics of integration, Differentiation and Polynomials.

Source: https://pasquans.
eu/new-numerical- COURSE DESCRIPTION AND OBJECTIVES:
algorithms-for-old-
problems/ The goal of this course is to build a base for Numerical methods, which are the basic algorithms
underpinning computer predictions in modern systems science. Such methods include techniques for
simple optimisation, interpolation from the known to the unknown, linear algebra underlying systems of
equations, ordinary differential equations to simulate systems, and stochastic simulation under random
influences.

MODULE-1

UNIT-1 12L+8T+0P=20 Hours

ROOT FINDING METHODS, SYSTEM OF LINEAR EQUATIONS AND INTERPOLATION

Absolute error, order of Convergence, Geometrical Description, method of successive approximation,
Bisection method, Regula - Falsi method, Newton’s Method. Gauss Seidal method, Crouts method,
Triangularization method, Relaxation method.
Interpolation - Finite differences, interpolation, Newton’s forward and backward difference formulae,
Newton’s divided difference and Lagrange’s formulae (with proof), errors in interpolation formula.

UNIT-2 12L+8T+0P=20 Hours

APPLICATIONS
Finding positive, negative and real root of algebraic and transcendental equation, Solution of simultaneous
linear algebraic equation. nth difference of a polynomial, finding missing terms in a sequence, sum of
n terms in a series, finding polynomial using a given set of data, estimated values of a function inside
and outside the given intervals of data.

PRACTICES:
● Finding positive, negative and real root of algebraic and transcendental equation using any of
your known programming knowledge.
● Solution of simultaneous linear algebraic equation equation using discrete methods and
implement using C.
● By python program estimate the values of a function inside and outside the given intervals of data.

MODULE-2
UNIT-1 12L+8T+0P=20 Hours

NUMERICAL DIFFERENTIATION, INTEGRATION AND DIFFERENTIAL EQUATION

Numerical Differentiation: Newton’s forward and Backward formulas to compute up to second order
differentiation of a function.
Numerical Integration: Trapezoidal and Simpson’s 1/3 and 3/8 rules.
ODE: Picard’s approximation, Milne’s Predictor Corrector formulas.
PDE: Liebman’s Iteration Process, Bender Schmidth.

VFSTR 140
 CSE - Department Electives

UNIT-2 12L+8T+0P=20 Hours SKILLS:

 Analyze the
APPLICATIONS types and
occurrence of
Finding maxima and minima of a function, population growth, acceleration, area bounded by the curve,
roots.
Solution of ODE, Solution of Elliptic, Parabolic and Hyperbolic PDE.
 Interpolate the
unknown values
PRACTICES: of function.
● Finding maxima and minima of a function.
 Develop a
● Solve ODE numerically and plot the curve. difference
● Classify the PDE. equation.

● Solve PDE numerically and plot the curve.  Gain the

knowledge to
● Developing difference equations from ODE and PDE. solve an ODE
numerically.
COURSE OUTCOMES:
 Gain the
Upon successful completion of this course, students will have the ability to: knowledge to
solve an ODE
CO Blooms Module Mapping numerically.
Course Outcomes
No. Level No. with POs
1, 2, 4, 5, 9, 10,
1 Apply numerical methods to find roots. Apply 1
12
2 Evaluate the unknown values using interpolation. Apply 1 1, 2, 5, 9, 10
3 Develop a finite difference scheme. Analyze 2 1, 2, 3, 5, 9, 10
Apply numerical methods to solve ODE and PDE
4 Analyze 2 1, 2, 5, 9, 10, 12
and analyse graphically.

TEXT BOOKS:
1. S. S. Sastry, “Introductory methods of numerical analysis”, 5th ed, PHI learning, 2012.
2. M K Jain, “Numerical Methods for Scientific and Engineering Computation”, New Age
internarnational, 8th Ed. 2022.

REFERENCE BOOKS:
1. P Kandasamy, “Numerical Methods”, S Chand, 2nd ed, 2015.
2. C. Ray Wylie, Louis C. Barrett: “Advanced Engineering Mathematics”, 6” Edition, 2. McGraw-
Hill Book Co., New York, 1995.
3. Gupta C.B., Singh S.R. and Mukesh Kumar: “Engineering Mathematics for Semester I & II”,
Mc-Graw Hill Education (India) Pvt. Ltd., 2015.

VFSTR 141
 CSE - Department Electives

22CS811 OPERATING SYSTEM DESIGN

Hours Per Week :

L T P C
3 0 2 4

PREREQUISITE KNOWLEDGE: Knowledge of computers fundamentals, Computer organization and

Source: https://www.
tutorialspoint.com. Digital logic design..
cach3.com/operating-
system-design-goals.
html
COURSE DESCRIPTION AND OBJECTIVES:
This course aims at concepts and principles of Operating Systems, its overall responsibility in acting as
an interface between the system’s hardware components and the user. Further, it also helps students to
understand the different scheduling policies, process synchronization mechanisms, deadlock handling
mechanisms and memory management techniques.

MODULE-1
UNIT-1 12L+0T+8P=20 Hours

INTRODUCTION & PROCESSES

Introduction to Operating System: Introduction, Operating System Concepts, System Calls, Operating
System Structure.
Processes: Introduction, Inter Process Communication, Classical IPC Problems, Scheduling,
Implementation of MINIX 3, System Task in MINIX 3 and Clock Task in MINIX 3.

UNIT-2 12L+0T+8P=20 Hours

INPUT/OUTPUT
Input/Output: Principles of Hardware and Software, Deadlock- Principles, Ostrich Algorithm, Detection
and Recovery, Deadlock Prevention and Avoidance; Input/output in MINIX 3, Block Devices in MINIX 3.

PRACTICES:
● Implementation of new process creation and its communications.
● Implement of thread creation and deletion.
● Implementation of FCFS scheduling.
● Implementation of SJF and RR Scheduling.
● Implementation of producer consumer problem.
● Implementation of Banker’s algorithm for Deadlock avoidance.
● A MINIX file whose owner has UID = 12 and GID = 1 has mode rwxr-x - Another user with
UID = 6, GID = 1 tries to execute the file. What will happen?
● In MINIX 3 if user 2 links to a file owned by user 1, then user 1 removes the file, what happens
when user 2 tries to read the file?
● Write a program (or series of programs) to test all the MINIX 3 system calls. For each call, try
various sets of parameters, including some incorrect ones, to see if they are detected.
● Suppose that a computer can execute 1 billion instructions/sec and that a system call takes 1000
instructions, including the trap and all the context switching. How many system calls can the
computer execute per second and still have half the CPU capacity for running application code?
● Write a shell script that produces a file of sequential numbers by reading the last number in
the file, adding 1 to it, and then appending to the file. Run one instance of the script in the
background and one in the foreground, each accessing the same file. How long does it take
before a race condition manifests itself? What is the critical section? Modify the script to prevent
the race (Hint: use ln file file.lock to lock the data file).

VFSTR 142
 CSE - Department Electives

● Show how counting semaphores (i.e., semaphores that can hold an arbitrarily large value) can SKILLS:
be implemented using only binary semaphores and ordinary machine instructions.  Know the
● A fast food restaurant has four kinds of employees: (1) order takers, who take customer’s orders; concepts of
Processes
(2) cooks, who prepare the food; (3) packaging specialists, who stuff the food into bags; and scheduling and
(4) cashiers, who give the bags to customers and take their money. Each employee can be File Systems.
regarded as a communicating sequential process. What form of interprocess communication  Identification of
do they use? Relate this model to processes in MINIX 3. different disk
● Five batch jobs A through E, arrive at a computer center at almost the same time. They have scheduling
methodologies.
estimated running times of 10, 6, 2, 4, and 8 minutes. Their (externally determined) priorities
are 3, 5, 2, 1, and 4, respectively, with 5 being the highest priority. For each of the following  Interpret UNIX
Commands,
scheduling algorithms, determine the mean process turnaround time. Ignore process switching Shell basics,
overhead. and shell
a) Round robin. environments

b) Priority scheduling.
c) First-come, first-served (run in order 10, 6, 2, 4, 8).
d) Shortest job first.
For (a), assume that the system is multi programmed, and that each job gets its fair share of
the CPU. For (b) through (d) assume that only one job at a time runs, until it finishes. All jobs
are completely CPU bound.
● Solve the dining philosopher’s problem using monitors instead of semaphores.
● The banker’s algorithm is being run in a system with m resource classes and n processes. In
the limit of large m and n, the number of operations that must be performed to check a state
for safety is proportional to ma and nb. What are the values of a and b?

MODULE-2
UNIT-1 12L+0T+8P=20 Hours

MEMORY MANAGEMENT
Memory Management: Basic concept of memory management, Swapping, Virtual Memory, Page
Replacement Algorithms, Design issues for Paging systems, Segmentation, Implementation of MINIX
3 Process Manager.

UNIT-2 12L+0T+8P=20 Hours

FILE SYSTEMS
File Systems: Files, Directories, File System Implementation- layout, Implementing files, Disk Space
Management, File System Reliability, File system Performance, Security, Implementation of MINIX 3
File System.

PRACTICES:
● Consider a swapping system in which memory consists of the following hole sizes in memory
order: 10 KB, 4 KB, 20 KB, 18 KB, 7 KB, 9 KB, 12 KB, and 15 KB. Which hole is taken for
successive segment requests of (a) 12 KB (b) 10 KB (c) 9 KB for first fit? Now repeat the
question for best fit, worst fit, and next fit.
● A machine has a 32-bit address space and an 8 KB page. The page table is entirely in hardware,
with one 32-bit word per entry. When a process starts, the page table is copied to the hardware
from memory, at one word every 100 nsec. If each process runs for 100 msec (including the time
to load the page table), what fraction of the CPU time is devoted to loading the page tables?
● A computer with a 32-bit address uses a two-level page table. Virtual addresses are split into
a 9-bit top-level page table field, an 11-bit second-level page table field, and an offset. How
large are the pages and how many are there in the address space?
● Suppose that a 32-bit virtual address is broken up into four fields, a, b, c, and d. The first three
are used for a three-level page table system. The fourth field, d, is the offset. Does the number
of pages depend on the sizes of all four fields? If not, which ones matter and which ones do not?

VFSTR 143
 CSE - Department Electives

● A computer has four page frames. The time of loading, time of last access, and the R and M
bits for each page are as shown below (the times are in clock ticks):

Page Loaded Last ref. R M

0 126 279 0 0
1 230 260 1 0
2 120 272 1 1
3 160 280 1 1

Which page will NRU replace?

Which page will FIFO replace?
Which page will LRU replace?
Which page will second chance replace?
● A small computer has four page frames. At the first clock tick, the R bits are 0111 (page 0 is
0, the rest are 1). At subsequent clock ticks, the values are 1011, 1010, 1101, 0010, 1010,
1100, and 0001. If the aging algorithm is used with an 8-bit counter, give the values of the four
counters after the last tick.
● Free disk space can be kept track of using a free list or a bitmap. Disk addresses require D
bits. For a disk with B blocks, F of which are free, state the condition under which the free list
uses less space than the bitmap. For D having the value 16 bits, express your answer as a
percentage of the disk space that must be free.
● A disk has 4000 cylinders, each with 8 tracks of 512 blocks. A seek takes 1 msec per cylinder
moved. If no attempt is made to put the blocks of a file close to each other, two blocks that are
logically consecutive (i.e., follow one another in the file) will require an average seek, which
takes 5 msec. If, however, the operating system makes an attempt to cluster related blocks,
the mean interblock distance can be reduced to 2 cylinders and the seek time reduced to 100
microsec. How long does it take to read a 100 block file in both cases, if the rotational latency
is 10 msec and the transfer time is 20 microsec per block?
● Write a pair of programs, in C or as shell scripts, to send and receive a message by a covert
channel on a MINIX 3 system. Hint: A permission bit can be seen even when a file is otherwise
inaccessible, and the sleep command or system call is guaranteed to delay for a fixed time,
set by its argument. Measure the data rate on an idle system. Then create an artificially heavy
load by starting up numerous different background processes and measure the data rate again.
● Implement immediate files in MINIX 3, that is small files actually stored in the i-node itself, thus
saving a disk access to retrieve them.
● Assume that you have a page-reference string for a process with m frames (initially all empty).
The page-reference string has length p, and n distinct page numbers occur in it.
a) What is a lower bound on the number of page faults?
b) What is an upper bound on the number of page faults?
● Consider the following page-replacement algorithms. Rank these algorithms on a five- point
scale from “bad” to “perfect” according to their page-fault rate. Separate those algorithms that
suffer from Belady’s anomaly from those that do not.
a) LRU replacement.
b) FIFO replacement.
c) Optimal replacement.
d) Second-chance replacement.

VFSTR 144
 CSE - Department Electives

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
1 Classify the basic concepts of operating system. Analyze 1 1
Apply the concepts of process scheduling algo-
2 rithms and process synchronization techniques to Apply 1 1, 2, 3, 5, 12
derive the efficiency of resource utilization.
Synthesize the concepts of I/O management, file
3 system implementation and problems related to Analyze 1,2 1,2,12
Deadlock.
Design the various memory management
4 Create 2 3,5
schemes for a given scenario.
Apply the concepts of file system interface and
5 Apply 2 2,5
implementation.

TEXT BOOKS:
1. Andrew S. Tanenbaum, Albert S.Woodhull. The MINIX Book Operating Systems Design and
Implementation, Pearson Publicastion, 3rd Edition, June 2006.
2. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, 9th
edition, John Wiley & Sons Inc, 2013.

REFERENCE BOOKS:
1. Richard. Stevens and Stephen A Rago, “Advanced Programming in the Unix Environment”,
3rd edition, Addison-Wesley, 2013.
2. William Stallings, “Operating Systems-Internals and Design principles” PHI, 7 th Edition, 2012.
3. Gary J. Nutt. Addison-Wesley , “Operating Systems: A Modern Perspective”, Aug 2001, 2nd
Edition.
4. B.A. Forouzan& R.F. Giberg, ―Unix and shell Programming , Thomson, First Edition, New
Delhi, 2003.

VFSTR 145
 CSE - Department Electives

22CS813 SIMULATION AND MODELLING

Hours Per Week :

L T P C
3 0 2 4
PREREQUISITE KNOWLEDGE: Probability and statistics, OOPS.
Source: https://www.
researchgate.net/ COURSE DESCRIPTION AND OBJECTIVES:
figure/The-Simulation-
Modelling-Process-
This course introduces discrete-event simulation techniques including model design and development,
Simple-Outline_ comparison to analytical models, input data preparation, random number generation, output statistical
fig1_3834396 analysis, and model validation and evaluate the performance of real-world systems by analyzing the
output of the model under various conditions.

MODULE-1
UNIT-1 8L+0T+6P=14 Hours

INTRODUCTION TO SIMULATION, GENERAL PRINCIPLES

When simulation is the appropriate tool and when it is not appropriate, Advantages and disadvantages of
Simulation, Areas of application, Systems and system Environment, Components of a System-Discrete
and continuous systems, Model of a system, Types of Models, Discrete-Event System Simulation, Steps
in a Simulation Study, Simulation Examples.
General Principles, Simulation Software: Concepts in Discrete-Event Simulation, The Event-
Scheduling/Time-Advance Algorithm, World Views, Manual simulation Using Event Scheduling, List
processing, Basic properties, Operations-Using Arrays, Dynamic Allocation, Linked Lists-Simulation in
Java -Simulation in GPSS.

UNIT-2 16L+0T+10P=26 Hours

MATHEMATICAL AND STASTICAL MODELS

Statistical Models in Simulation: Review of terminology, concepts, Useful statistical models, Discrete
Distributions, Continuous Distributions, Poisson Process, Empirical distributions.
Queuing Models: Characteristics of queuing Systems, Queuing notation, Long-run measures of
performance of queuing Systems, Steady-state behavior of M/G/1 queue, Networks of queues, Rough-
cut modeling: An illustration

PRACTICES:
● Discuss the system components of a grocery store, healthcare system, material dispatching
system.
● Discuss the steps in simulation study for the above given systems.
● A simulation is to be conducted of cooking a porridge to discover at what time a person should
start order to have the it on the table by 7:00 P.M. Read a recipe for preparing a dinner or ask
a friend or relative for the recipe. As best you can, trace what you understand to be needed, in
the data-collection phase of the simulation process, include each step in the recipe. What are
the events, activities, and state variables in this system?
● The daily demand for a product is found to follow the distribution as

VFSTR 146
 CSE - Department Electives

Demand Probability SKILLS:

 Interpret the
10 0.25 model and
11 0.35 apply the results
to resolve
12 0.30 critical issues
in a real world
13 0.10 environment.
Determine the total demand for the next 10 days.  Analyse the
Simulation
● Students are arriving at the college office at the rate of one every 6 ± 2 minutes to pay the fees. models using
They hand over the forms to one of the two clerks available and it takes l 0 ± 2 minutes for the input analyzer,
clerk to verify each form. Then the forms are sent to a single cashier who takes 6 ± l minute and output
per form. Simulate the system for 100 hours and determine the analyzer.

(a) utilization of each clerk (b) utilization of the cashier (c) average time required to process a  Verify and
Validate of
form (clerk + cashier).
simulation
● A patient arrives at the Emergency Room at Hello-Hospital about every 40 ± 19 minutes. Each model.
patient will be treated by either Doctor Slipup or Doctor Gutcut. Twenty percent of the patients
are classified as NIA (need immediate attention) and the test as CW (can wait). NIA patients
are given the highest priority (3), see a doctor as soon as possible for 40 ± 37 minutes, but then
iheir priority is reduced to 2 and they wait until a doctor is free again, when they receive further
treatment for 30 ± 25 minutes and are then discharged. CW patients initially receive the priority
1 and are treated (when their torn comes) for 15 ± 14 minutes; their priority is then increased
to 2, they wait again until a doctor is free and receive I 0 ± 8 minutes of final treatment, and
are then discharged. Simulate for 20 days of continuous operation, 24 hours per day. Precede
this by a 2-day initialization period to load the system with patients. Report conditions at
times 0 days, 2 days, and 22 days. Does a 2-day initialization appear long enough to load the
system to a level reasonably close to steady-state conditions? (a) Measure the average and
maximum queue length of NIA patients from anival to first seeing a doctor. What percent do
not have to wait at all? Also tabulate and plot the distribution of this initial waiting time for NIA
patients. What percent wait less than 5 minutes before seeing a doctor? (b) Tabulate and plot
the distribution of total time in system for all patients. Estimate the 90% quantile-that is, 90%
of the patients spend less than x amount of time in the system. Estimate x. (c) Tabulate and
plot the distribution of remaining time in system from after the first treatment to discharge, for
all patients. Estimate the 90% quantile. (Note: Most simulation packages provide the facility to
automatically tabulate the distribution of any specified variable).
● Using Excel, generate 12 columns, each with 250 values, using the formula = RAND(). In cell
Ml, place the formula = SUM(Al:Ll)-6 and copy it to the 249 cells below M1 in column M.
a) Compute descriptive statistics about the data in that column, including minimum value, maximum
value, mean, median, and standard deviation.
b) Tabulate the values with 9 bins: the first bin will include all values less than or equal to -3.5;
the next six bins are of width one; the last bin will include all values greater than 3.5.
c) Does the histogram resemble any distribution with which you are familiar? If so, what is its
name? Hint l: Use FREQUENCY in Excel to form bins.
● Of the orders a job shop receives, 25% are welding jobs and 75% are machining jobs. What
is the probability that (a) half of the next five jobs will be machining jobs? (b) the next four jobs
will be welding jobs?
● Students’ arrival at a university library follows Poisson with a mean of 20 per hour. Determine
(a) the probability that there are 50 arrivals in the next I hour. (b) the probability that no student
arrives in the next I hour. (c) the probability that there are 75 arrivals in the next 2 hours.
● The cars arriving at a gas station is Poisson distributed with a mean of lO per minute. Determine
the number of pumps to be installed if the ftrm wants to have 50% of arriving cars as zero
entries (i.e., cars serviced without waiting).
● Given the following distributions, Normal (10, 4) Triangular (4, 10, 16) Uniform (4, 16) find the
probability that 6 < X< 8 for each of the distributions.
● Vehicles pass through a toll gate at a rate of 90 per hour. The average time to pass through
the gate is 36 seconds. The arrival rate and service rate follow Poisson distribution. There is

VFSTR 147
 CSE - Department Electives

a complaint that the vehicles wait for a long duration. The authorities are willing to install one
more gate to reduce the average time to pass through to 30 seconds, if the idle time of the
toll gate is less than 10% and the present average queue length at the gate is more than five
vehicles. Check whether the installation of the second gate is justified.

MODULE-2
UNIT-1 6L+0T+10P=26 Hours

RANDOM NUMBERS AND INPUT MODELLING

Random-Number Generation, Random-Variate Generation: Properties of random numbers,
Generation of pseudo-random numbers, Techniques for generating random numbers, Tests for Random
Numbers, Random- Variate Generation, Inverse transform technique, Acceptance-Rejection technique,
Special properties.
Input Modeling: Data Collection, Identifying the distribution with data, Parameter Estimation, Goodness
of Fit Tests, Fitting a non-stationary Poisson process, Selecting input models without data, Multi-variate
and Time-Series input models.

UNIT-2 8L+0T+6P=14 Hours

ANALYSIS OF SIMULATION DATA

Verification and Validation of simulation models: Optimization of simulation Models: Model Building,
Verification, Validation, Verification of simulation models, Calibration, Validation of models, Optimization,
Optimization via Simulation
Output Analysis for A Single Model: Types of simulations with Respect to Output analysis, Stochastic
Nature of Output Data, Measures of Performance and their Estimation, Output Analysis for Terminating
Simulations, Output analysis for steady-State Simulations.

PRACTICES:
● Develop the triangular random-variate generator with range (0, 12) and mode 5.
● In an inventory system, the lead time is found to follow uniform distribution with mean 10 days
and half width 3 days. Generate five lead times.
● Write a computer program to generate exponential random variates for a given mean value.
Generate 1000 values and verify the variates generated using chi-square test.
● In a college library, collect the following in formation at the books return counter: arrival of
students for returning books service time taken by the counter clerk 305 Consolidate the data
collected and verify whether it follows any standard distribution.
● Draw the pdf of normal distribution with J.l. = 6, a= 3
● The following data represent the time to perform transactions in a bank, measured in minutes:
0.740, 1.28, 1 .46, 2.36, 0.354, 0.750, 0.912, 4.44, O.l l4, 3.08, 3.24, 1. 10, 1.59, 1.47, 1.17,
1.27, 9. 12, 1 1.5, 2.42, 1.77. Develop an input model for these data.
● A simulation model. of a job shop was developed to investigate diff erent schedulliJg rules. To
validate the model, the scheduling rule currently used was incorporated into the model and the
resulting output was compared agamst observed system behavior. By searching the previous
year’s database records it was estimated that the average number of jobs in the shop was
22.5 on a given day. Seven independent replications of the model were run, each of 30 days’
duration, with the following results for average number of Jobs in the shop: 18.9 22.0 19.4
22.1 19.8 21.9 20.2 (a) Develop and conduct a stastical test to evaluate whether model output
is consistent with system behavior. Use the level of significance a= 0.05. · (b) What is the
power of this test if a difference of two jobs is viewed as critical? What sample size is needed
to guarantee a power of 0.8 or higher? (Use a= 0.05.)

VFSTR 148
 CSE - Department Electives

● Consider the following inventory system: (a) Whenever the inventory level falls to or below 10
units, an order is placed. Only one order can be outstanding at a time. (b) The size of each
order is Q; Maintaining an inventory costs $0.50 per day per item in inventory. Placing an order
incurs a fixed cost, $10.00. (c) Lead time is distributed in accordance with a discrete uniform
distribution between zero and 5 days. (d) If a demand occurs during a period when the inventory
level is zero, the sale is lost at a cost of $2.00 per unit. (e) The number of customers each day
is given by the following distribution:

No of customers per
Probability
day
1 0.23
2 0.41
3 0.22
4 0.14

f) The demand on the part of each customer is Poisson distributed with a mean of 3 units.
g) For simplicity, assume that an·demands occur at noon and that all orders are placed immediately
thereafter. Assume further that orders are received at 5:00 P.M., or after the demand that
occurred on that day. Consider the poi icy having Q = 20 .. Make five independent replications,
each of length 100 days, and compute a 90% confidence interval for long-run mean daily cost.
Investigate the effect of initial inventory level and existence of an outstanding order on the
estimate of mean daily cost. Begin with an initial inventory of Q + I 0 and no outstanding orders.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Analyze the steps in design of various simulation
1 Analyze 1 2
models.
Conceptualize real world situations related to
systems development decisions, originating from
2 Apply 1 1, 4
source requirements and goals. Construct model
for a given set of data and motivate its validity.
Generate and test random number variates and
3 Apply 2 1
apply them to develop simulation models.
Analyze output data produced by a model and test
4 Analyze 2 2
validity of the model.

TEXT BOOKS:
1. Jerry Banks, John S. Carson II, Barry L. Nelson, David M. Nicol, “Discrete-Event System
Simulation”, 5th Edition, Pearson Education © 2013.
2. Zeigler B.P. Praehofer. H. and Kim I.G. “Theory of modeling and simulation”, 2nd Edition
Academic press 2000.

REFERENCE BOOKS:
1. Averill M. Law, “Simulation Modeling and Analysis”, 4th Edition, Tata McGraw-Hill, 2007.
2. Lawrence M. Leemis, Stephen K. Park, “Discrete – Event Simulation: A First Course”, Pearson
Education, 2006.

VFSTR 149
 CSE - Department Electives

VFSTR 150
 CSE - Department Electives

DIGITAL FORENSICS

Hours Per Week :

L T P C
3 0 2 4
PREREQUISITE KNOWLEDGE: Cyber Security and Cyber Laws, Cryptography and Network Security.
Source: https://www.
electrosoft-inc.com/ COURSE DESCRIPTION AND OBJECTIVES:
resources/digital-
forensics This course focuses on understanding forensic terminologies and approaches along with variety of tools
used for digital forensic investigations. The objective of this course is to understand digital forensics and
its usage in solving computer crimes. By end of the course, students will be able to identify improper
usage of computer systems and legal concepts in digital forensic investigation stages.

MODULE-1
UNIT-1 12L+0T+8P=20 Hours

INTRODUCTION
Computer forensics fundamentals, Benefits of forensics, computer crimes, computer forensics evidence
and courts, legal concerns and private issues, Steps of computer forensics.
Understanding Computing Investigations: Procedure for corporate High-Tech investigations,
understanding data recovery workstation and software, conducting and investigations.

UNIT-2 12L+0T+8P=20 Hours

DATA ACQUISITION
Understanding storage formats and digital evidence, determining the best acquisition method, acquisition
tools, validating data acquisitions, performing RAID data acquisitions, remote network acquisition tools,
other forensics acquisitions tools.

PRACTICES:
● Recover Deleted Files using Forensics Tools.
● Study the steps for hiding and extract any text file behind an image file/ Audio file using
Command Prompt.
● Extract Exchangeable image file format (EXIF) Data from Image Files using Exifreader
● Software How to make the forensic image of the hard drive using EnCase Forensics.
● Restoring the Evidence Image using EnCase Forensics.

MODULE-2
UNIT-1 12L+0T+8P=20 Hours

PROCESSING CRIMES AND INCIDENT SCENES

Securing a computer incident or crime, seizing digital evidence at scene, storing digital evidence,
obtaining digital hash, reviewing case.

UNIT-2 12L+0T+8P=20 Hours

CURRENT COMPUTER FORENSICS TOOLS
Software, hardware tools, validating and testing forensic software, addressing data-hiding techniques,
performing remote acquisitions, E-Mail investigations- investigating email crime and violations,
understanding E-Mail servers, specialized E-Mail forensics tool.

VFSTR 134
 CSE - Department Electives

PRACTICES: SKILLS:
● Study of Computer Forensics and different tools used for forensic investigation.  Identify sources
and methods of
● Live Forensics Case Investigation using Autopsy. system intrusion.
● Collect Email Evidence in Victim PC.
 Create bitwise
● Extracting Browser Artifacts. images of
● View Last Activity of Your PC. hard drives
for forensic
● Find Last Connected USB on your system (USB Forensics). analysis.
● Comparison of two Files for forensics investigation by Compare IT software.  Collecting
evidences from
COURSE OUTCOMES: log files.
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply basic legal concepts related to digital foren-
1 Apply 1 1,2,3
sics and evidence collection.
Analyze various digital forensics frameworks and
2 Analyse 1 1,2,3
its usage to solve crimes.
Analyze artifacts like logs, packet captures, and
3 Analyse 2 1,2,3
registry.
4 Demonstrate the ability to use forensic tools. Create 2 1,2,5
Design and develop various forensic applications
5 using variety of tools to carryout forensic inves- Analyse 2 1,2,3
tigation.

TEXT BOOKS:
1. Warren G. Kruse II and Jay G. Heiser, “Computer Forensics: Incident Response
Essentials”,Addison Wesley, 2020.
2. Nelson, B, Phillips, A, Enfinger, F, Stuart, C., “Guide to Computer Forensics and Investigations,
6th edition, Thomson Course Technology, 2020, ISBN: 0-619-21706-5.

REFERENCE BOOKS:
1. Vacca, J, Computer Forensics: Computer Crime Scene Investigation, 2nd Ed, Charles River
Media, 2015, ISBN: 1-58450-389.

VFSTR 135
 CSE - Department Electives

WEB AND DATABASE SECURITY

Hours Per Week :

L T P C
3 0 2 4
PREREQUISITE KNOWLEDGE: Cryptography and Network Security, Web Technologies and Database
Source: https://www. Systems.
intechopen.com/
chapters/37306 COURSE DESCRIPTION AND OBJECTIVES:
This course is imperative for understanding the fundamental security principles of the web and Data
base security. The course provides an overview of the most common attacks, and illustrates fundamental
countermeasures that every web application should implement. In essence, this course offers you the
knowledge and skills to build better and more secure applications and to identify risks and vulnerabilities
in operating systems from a database perspective.

MODULE-1
UNIT-1 12L+0T+8P=20 Hours
WEB SECURITY FUNDAMENTALS
Introduction to the web security landscape, and an overview of the most relevant threats. Understanding
the security model of the web, and the recent evolution towards client-centric security.

UNIT-2 12L+0T+8P=20 Hours

SECURING THE COMMUNICATION CHANNEL
Understanding the dangers of an insecure communication channel. Practical advice on deploying
HTTPS, and dealing with the impact on your application. Insights into the latest evolutions for HTTPS
deployments.
Preventing Unauthorized Access: Understanding the interplay between authentication, authorization
and session management. Practical ways to secure the authentication process, prevent authorization
bypasses and harden session management mechanisms.

PRACTICES:
● Explore various tools for DOS attacks. (For Ex: SSPing, Land Exploit)
● Explore various tools for DDOS attacks. (For Ex: Trinoo, TFN)
● Identify various computer based social engineering ways to acquire sensitive information or
inappropriate access privileges by an outsider
● Set up IPSEC under LINUX
● Implement a code to simulate buffer overflow attack.

MODULE-2
UNIT-1 12L+0T+8P=20 Hours

SECURELY HANDLING UNTRUSTED DATA

Investigation of injection attacks over time, understanding the cause behind both server-side and client-
side injection attacks. Execution of common injection attacks, and implementation of various defenses.

VFSTR 138
 CSE - Department Electives

UNIT-2 12L+0T+8P=20 Hours SKILLS:

ADMINISTRATION OF USERS  Investigation of
injection attacks
Introduction-Authentication-Creating Users, SQL Server User-Removing, Modifying Users-Default, over time.
Remote Users-Database Links-Linked Servers-Remote Servers-Practices for Administrators and  Execution
Managers-Best Practices Profiles, Password Policies. of common
injection attacks
Privileges and Roles: Introduction-Defining and Using Profiles-Designing and Implementing Password and their
Policies-Granting and Revoking User Privileges-Creating, Assigning and Revoking User Roles-Best defenses.
Practice.  Implement
privacy
Database Application Security Models: Introduction-Types of Users-Security Models-Application preserving
Types-Application Security Models-Data Encryption. data mining
algorithms.
PRACTICES:
● Explore Web Application Vulnerabilities.
● Implement Web based Password Cracking Techniques.
● Implement SQL Injection attack.
● Implement XSS attack.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Analyze the cause behind both server-side and
1 Analyze 1 1,2,,3
client-side injection attacks.
2 Analyze the privileges and roles of the users. Analyze 2 1,2,3
3 Analyze common attacks and countermeasures. Analyze 2 1,2,3
Implement administration policies for users, data-
4 Evaluate 2 1,2,3
base security models.

TEXT BOOKS:
1. Bing Liu, “Web Data Mining”, 2nd edition, Spinger, 2011.
2. Hassan A. Afyouni, “Database Security and Auditing”, Third Edition, Cengage Learning, 2013.

REFERENCE BOOKS:
1. Jiawei Han, Micheline Kamber and Jian Pei, “Data Mining: Concepts and Techniques”, 3rdedition,
Morgan Kaufmann Publishers, 2011.
2. Bing Liu, “Sentiment analysis and opinion mining”, 2nd edition, Morgan & Claypool Publishers,
2012.
3. Jure Leskovec, Anand Raja Raman and Jeffrey D Ullman, “Mining of Massive Datasets”,
5thedition, Stanford University, 2014.Networks, Springer.
4. Frank Adelstein, Sandeep K.S. Gupta, Golden G. Richard III, and Loren Schwiebert.
Fundamentals of Mobile and Pervasive Computing, McGraw-Hill Professional, 2015.

VFSTR 139
 CSE - Department Electives

MACHINE LEARNING

Hours Per Week :

L T P C
3 0 2 4
PREREQUISITE KNOWLEDGE: Probability and Linear algebra, Python programming.
Source: https://www.
forbes.com/sites/ COURSE DESCRIPTION AND OBJECTIVES:
kalevleetaru/2019/01/15/
why-machine-learning- This course provides a broad introduction to various machine learning concepts including Supervised
needs-semantics-not- learning (parametric/non-parametric algorithms, support vector machines, kernels, neural networks) and
just-statistics/
Unsupervised learning (clustering, dimensionality reduction) methods. Students will get an understanding
of various challenges of Machine Learning and will be able to decide on model complexity. Numerous
case studies introduced in this course allow the students to apply machine-learning algorithms in
computer vision, medical imaging, audio, and text domains. Laboratory experiments of this course will
introduce students to advanced Machine Learning Python libraries such as Scikit-Learn, Matplotlib, and
many other recent ML-related APIs. The course is designed such that the students get enough hands-on
experience with a major focus on the practical implementation of theoretical concepts.

MODULE-1
UNIT-1 14L+0T+8P=22 Hours

INTRODUCTION
What is machine learning? Machine learning applications; Types of Learning: Supervised learning;
Un-supervised learning; Reinforcement learning.
Model Training Essentials: Re-sampling methods: Bias–Variance Trade-off. Hypothesis Testing and
Variable Selection, Sub sampling and Upsampling, SMOTE; Cross Validation (validation set, Leave-
One-Cut (LOO), k-fold strategies) and bootstrap; Evaluation measures-Error functions, Confusion Matrix,
Accuracy, Precision and Recall, F1 Score.
Regression Analysis: Linear Regression, Simple and Multiple Linear Regression, Polynomial
Regression, Logistic Regression, Multi nominal Regression. Ordinary Least Squares Method, Model
Shrinkage-Ridge, and LASSO regression.

UNIT-2 10L+0T+8P=18 Hours

FEATURE SELECTION
Feature Selection Strategies: Problem statement and Uses, Filter methods, Wrapper methods,
Embedded methods. Branch and bound algorithm, Sequential forward/backward selection algorithms.
Dimensionality Reduction: Singular value decomposition, matrix factorization, Linear discriminant
analysis, Principal components analysis.

PRACTICES:
● Apply the following tasks to any given dataset:
a) Load and visualize data.
b) Check out and replace missing values.
c) Encode the Categorical data.
d) Splitting the dataset into Training and Test set.
e) Splitting the dataset into k-folds.
f) Feature scaling.

VFSTR 140
 CSE - Department Electives

● House price prediction: SKILLS:

a) Create a model that predicts a continuous value (price) from input features (square footage,  Statistical data
number of bedrooms and bathrooms). analysis.

b) Implement a univariate Model using Least Squares and plot best-fit line.  Classify / Cluster
data.
c) Implement a multivariate Model using Least Squares and plot best-fit line.
 Tool usage for
d) Retrieve model error and model coefficients. developing ML
e) Observe Variance Inflation Factor (VIF). applications.

f) Implement Ridge regression model.

g) Implement LASSO regression model.
h) Report your observations on the above models for house prediction.
● Heart disease prediction:
a) Implement a logistic regression model to predict whether an individual is suffering from heart
disease or not.
b) Evaluate and compare model performance using the following validation approaches:
i. Validation set approach.
ii. K-fold cross validation.
iii. Stratified K-fold cross validation.
iv. LOO strategy.
c) Plot Confusion matrix.
d) Report performance of the model in terms of the following metrics:
i. Accuracy.
ii. Precision-Recall.
iii. F1 Score.
e) Report your observations and explain when to use what type of measures.
● Implement the Polynomial Regression algorithm to fit data points. Select the appropriate data
set for your experiment and draw graphs.
● Working with imbalanced datasets:
a) Load an imbalanced dataset and visualize imbalance in the data as a bar plot.
b) Implement KNN model for classification.
c) Balance the dataset using:
i. Random Over sampling.
ii. Random Under sampling.
iii. SMOTE.
d) Implement KNN model for classifying data balanced in the above steps.
e) Report your observations on the performance of models trained using balanced and
imbalanced data.
● Perform effective feature selection in a given dataset using any one of the feature selection
techniques.
● Dimension Reduction:
a) Load a dataset and Implement Bayes classification model.
b) Apply dimension reduction using:
i. Principal Component Analysis
ii. Linear Discriminant Analysis
c) Apply the model on data with reduced dimension.
d) Compare and contrast model performance in each case.

VFSTR 141
 CSE - Department Electives

MODULE-2
UNIT-1 16L+0T+8P=24 Hours

CLASSIFICATION
Classification: Binary, Multi-class and Multi-label Classification; K-Nearest Neighbours, Support Vector
Machines, Decision Trees, The Naïve Bayes’ Classifier, Class Imbalance, Perceptron ANN model.
Ensemble Methods: Ensemble Learning Model Combination Schemes, Voting, Error-Correcting Output
Codes, Bagging: Random Forest Trees, Boosting: Adaboost, Stacking.

UNIT-2 8L+0T+8P=16 Hours

CLUSTERING
Clustering: Different distance functions and similarity measures, K-means clustering, Medoids,
Hierarchical Clustering-Single linkage and Complete linkage clustering, Graph based Clustering -MST,
DBSCAN, Spectral clustering.

PRACTICES:
● Implement and demonstrate the FIND-S algorithm for finding the most specific hypothesis based
on a given set of training data samples. Read the training data from a .CSV file.
● Implement the naïve Bayesian classifier for a sample training data set stored as a.csv file.
Compute the accuracy of the classifier, considering few test data sets.
● Assuming a set of spam or not-spam mails that need to be classified, use the naïve Bayesian
classifier model to perform this task. Calculate the accuracy, precision, and recall for your
data set.
● Implement k-Nearest Neighbor algorithm to classify the iris data set. Print both correct and
wrong predictions. Python ML library classes can be used for this problem.
● Demonstrate the working of the decision tree-based ID3 algorithm. Use an appropriate data
set for building the decision tree and apply this knowledge to classify a new sample?
● Build a model using SVM with different kernels.
● Implement and build models using the following Ensemble techniques.
a) Bagging.
b) Boosting: Adaboost, Stacking.
● Build a model to perform Clustering using K-means after applying PCA and determining the
value of K using the Elbow method.
● Unsupervised Modeling:
a) Cluster the data using the following models:
i. Spectral Clustering.
ii. K-medoids.
iii. DBSCAN.
iv. Hierarchical Clustering.
b) Compare and contrast model performance in each case.

VFSTR 142
 CSE - Department Electives

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply a wide variety of learning algorithms such
1 as Probabilistic, Discriminative and Generative Apply 1, 2 1
algorithms for a given application.
Design an end-to-end Machine-learning model to
2 Apply 1 3
realize solutions for real-world problems.
Implement various machine learning models using
3 Create 1, 2 5
advanced ML tools.
Analyze and evaluate the performance of var-
4 ious machine learning models approaches on Analyze 2 2
different kinds of data.

TEXT BOOKS:
1. Ethem Alpaydin, “Introduction to Machine Learning”, 3rd Edition, The MIT Press, 2014.
2. Flach, Peter. “Machine learning: the art and science of algorithms that make sense of data”.
Cambridge University Press, 2012.

REFERENCE BOOKS:
1. Murphy, Kevin P. Machine learning: a probabilistic perspective. MIT press, 2012.
2. Aurélien Géron, “Hands-on Machine Learning with Scikit Learn and Tensor Flow”, O’reilly, 2017.
3. Gareth James, Daniela Witten, Trevor Hastie, and Robert Tibshirani, “An Introduction to
Statistical Learning with Applications in R”, Springer, 2013. (ISLR).

VFSTR 143
 CSE - Department Electives

MOBILE APPLICATION
DEVELOPMENT
Hours Per Week :

L T P C
2 0 4 4

PREREQUISITE KNOWLEDGE: OOPs through Java, DDL & DML Commands – DBMS..
Source: https://www.
tatvasoft.com.au/blog/ COURSE DESCRIPTION AND OBJECTIVES:
mobile-application-
development- This course guides the student in designing and building a mobile application using Android™. The main
methodology/ objective of this course is to let the student learn basic Android programming concepts while building
a variety of apps, starting with basic to making use of advanced concepts.

MODULE–1
UNIT-1 8L+0T+16P=24 Hours

INTRODUCTION
Introduction to Mobile Application Development- Mobile Applications and Device Platforms, Alternatives
for Building Mobile Apps; Introduction to Android, Android versions, Android Architecture.
Application Development Process- Developers Workflow basics, Installing the Android SDK Tools;
Anatomy of an Android Application.
Basic Building blocks - Activities, Services, Broadcast Receivers & Content providers; Intents &
Fragments.
View Group- Layout: Linear Layout, Relative Layout, Frame Layout, Grid Layout, constraint Layout,
Table Layout, and Absolute Layout.

UNIT-2 8L+0T+16P=24 Hours

VIEWS
Views: Basic Views; Picker Views- Time Picker View, Data Picker View; List Views – List View, Spinner
View; Scroll View.
Activities: Creating an activity, Understanding the activity life cycle using Log and Toast, applying styles
and themes to an activity, and hiding the activity title.
Linking Activities using Intents: Introduction to Intents and its types with examples, passing data
between activities with intents, Activity Navigation- Implement up navigation with parent activities.
Fragments: Introduction to Fragment, the life cycle of a fragment, Adding fragments dynamically,
Interaction between fragments.

PRACTICES:
● Setting up Android Studio:
a) Installing Android Studio
b) Select an empty activity to simulate the “Welcome App” Using Android Studio.
c) Exploring the interface of the Android Studio to understand the Project Structure.
● Develop an Android application using controls like Button, TextView, and EditText for designing
a calculator having basic functionality like Addition, Subtraction, Multiplication, and Division.
● Design the HelloToast app: The HelloToast app consists of two Button elements and one
Text View. When the user taps the first Button, it displays a short message (a Toast) on the
screen. Tapping the second Button increases a “click” counter displayed in the TextView, which
starts at zero.

VFSTR 146
 CSE - Department Electives

● Design Silent Model Toggle application: This app allows the user to toggle the ringer mode SKILLS:
on the phone by simply pressing a button.  Design mobile
applications
for user
requirements.
 Use of suitable
advanced
components to
design mobile
apps.
 Utilization
of activities,
intents, layouts,
and views for
content.

● In this assignment, students will create and build an app called Two Activities. Students will
build the app in four stages.
a) In the first stage, you create an app whose main activity contains one button, Send. When the
user clicks this button, your main activity uses an intent to start the second activity.
b) In the second stage, you add an EditText view to the main activity. The user enters a message
and clicks Send. The main activity uses an intent to start the second activity and sends the
user’s message to the second activity. The second activity displays the message received.

c) In the final stage of creating the Two Activities app, you add an EditText and a Reply button
to the second activity. The user can now type a reply message and tap Reply, and the reply is
displayed on the main activity. At this point, you use an intent to pass the reply from the second
activity to the main activity.

VFSTR 147
 CSE - Department Electives

d) Implement all the Activity lifecycle call back methods to print messages to logcat when those
methods are invoked. These log messages will allow you to see when the Activity lifecycle
changes state, and how those lifecycle state changes affect your app as it runs.
● Design an application with implicit intents: Create a new app with one Activity and three
options for actions: open a website, open a location on a map, and share a snippet of text. All
the text fields are editable (EditText) but contain default values.

● Design Droid Café: In this practical, the student will create and build a new app starting with
the Basic Activity template that imitates a dessert-ordering app. The user can tap an image
to perform an action-in this case, display a Toast message-as shown in the figure below. The
user can also tap a shopping cart button to proceed to the next Activity.
● Experiment with the android: inputType attribute for EditText elements. You add EditText
elements for a person’s name and address and use attributes to define single-line and multiple-
line elements that make suggestions as you enter text. You also add an EditText that shows a
numeric keypad for entering a phone number.
● Other types of input controls include interactive elements that provide user choices. You add
radio buttons to Droid Cafe for choosing only one delivery option from several options. You
also offer a spinner input control for selecting the label (Home, Work, Other, Custom) for the
phone number.

VFSTR 148
 CSE - Department Electives

MODULE–2
UNIT-1 8L+0T+16P=24 Hours

CREATING A FEATURE-RICH APPLICATION

Creating a Feature-Rich Application: Display Orientation – Anchor Views, resizing and repositioning
Views, Managing changes to Screen Orientation; Notifications; Action bar; Dialog box; Adapters- Array
Adapters and Base Adapters; Recycler View.

UNIT-2 8L+0T+16P=24 Hours

SQLITE DATABASE
SQLite Database – Creating the database, Dealing with CRUD;
Firebase-Getting Started with Firebase, Add Firebase to your Android project, Firebase database-
Introduction to Firebase database, set up Firebase Real-time Database for Android, Read and Write
Data on Android; Publish the App in Play store.

PRACTICES:
● Design an application to keep data when the user rotates the device, and when the screen
is rotated: When the user rotates the device, Android will normally destroy and re-create the
current Activity. You want to keep some data across this cycle, but all the fields in your Activity
are lost during it.
● Create a Splash Screen for the existing project- Droid Café from Module-1.
● Design a News App- Consider the following screen as reference:

NOTE: Use Recycle View to display the news under each category.

VFSTR 149
 CSE - Department Electives

● Adding more features to Droid Café: In the previous assignments, you created an app called
Droid Café, using the Basic Activity template. This template also provides a skeletal options
menu in the app bar at the top of the screen.
a) Update that menu option as shown in the following images:
b) Add notification option: The app must notify the user when the user places the order.
● Provide user authentication for the Droid Café using Firebase – Authentication or SQLite.

● Save all the user preferences in the Firebase Real time Database to fetch whenever required.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply views, intents, and fragments to an existing
1 Apply 1 2
application.
Evaluate an existing app to enrich it with new
2 Evaluate 2 2,3
features.
Analyse methods for storing, sharing, and
3 Analyse 2 5
retrieving data in an Android app.
Design and publish a mobile app in the play store
4 with a database forgiven real-time scenarios using Create 2 5,10
modern tools- Android Studio, and Firebase.

TEXT BOOKS:
1. John Horton “Android Programming for Beginners: Build in-depth, full-featured Android apps
starting from zero programming experience”, 3rd Edition, 2021.
2. Wei-Meng Lee, “Beginning Android Application Development”, 1st Edition, John Wiley & Sons,
2012.

REFERENCE BOOKS:
1. Michael Burton,” Android App Development for Dummies “, 3rd Edition, A Wiley Brand, 2020.
2. Dawn Griffiths & David Griffiths, “Headfirst Android Development A Brain-Friendly Guide”
2nd Edition, O’Reilly, 2015.
3. https://aws.amazon.com/mobile/mobile-application-development/
4. https://google-developer-training.github.io/android-developer-fundamentals-course-concepts/.

VFSTR 150
 CSE - Department Electives

OPTIMIZATION TECHNIQUES

Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Probability & Linear algebra.

Source: https://oworkers.
COURSE DESCRIPTION AND OBJECTIVES: com/8-process-
optimization-techniques-
This course introduces the fundamental concepts of Optimization Techniques and to make the learners how-to-get-started/
aware of the importance of optimizations in real scenarios. The most important objective is to provide
the concepts of various classical and modern methods for constrained and unconstrained problems in
both single and multivariable. Finally, the basic idea behind the evolutionary algorithms like Ant Colony
Optimization, Particle Swarm Optimization could be discussed for further study.

MODULE-1
UNIT-1 12L+8T+0P=20 Hours

INTRODUCTION TO CLASSICAL METHODS AND LINEAR PROGRAMMING PROBLEMS

TERMINOLOGY
Design Variables – Constraints, Objective Function - Problem Formulation, Linear Programming
Problem - Simplex method - Concept of Duality.
General Transportation Problem: The transportation table finding in initial basic feasible solution,
North-West corner method, Least cost method, Row minima method, Column minima method.

UNIT-2 12L+8T+0P=20 Hours

SINGLE VARIABLE OPTIMIZATION

Problems Optimality Criterion - Bracketing Method - Region Elimination Methods -Interval Halving
Method - Fibonacci Search Method - Golden Section Method. Gradient Based Methods: Newton
-Raphson Method - Bisection Method - Application to Root finding.
Multi Variable Optimization, Algorithms Optimality: Criteria - Unidirectional Search. Direct Search
Methods: Hooke -Jeeves pattern search method. Gradient Based Methods: Cauchy’s Steepest Descent
Method - Newton’s method, Quasi-Newton methods, L-BFGS.

PRACTICES:
A company makes two products (X and Y) using two machines (A and B). Each unit of X that is produced
requires 50 minutes processing time on machine A and 30 minutes processing time on machine B. Each
unit of Y that is produced requires 24 minutes processing time on machine A and 33 minutes processing
time on machine B. At the start of the current week there are 30 units of X and 90 units of Y in stock.
Available processing time on machine A is forecast to be 40 hours and on machine B is forecast to be
35 hours. The demand for X in the current week is forecast to be 75 units and for Y is forecast to be
95 units. Company policy is to maximise the combined sum of the units of X and the units of Y in stock
at the end of the week. Formulate the problem of deciding how much of each product to make in the
current week as a linear program. Solve this linear program graphically.

VFSTR 159
 CSE - Department Electives

SKILLS: Solve using the Simplex method the following problem:

 Project
scheduling Maximize Z = f(x,y) = 3x + 2y
process skills
including
subject to: 2x + y ≤ 18
defining project 2x + 3y ≤ 42
activities, and
estimation 3x + y ≤ 24
of time and x≥0,y≥0
resources
Luminous lamps have three factories - F1, F2, and F3 with production capacity 30, 50, and 20 units
 Resource
optimization
per week respectively. These units are to be shipped to four warehouses W1, W2, W3, and W4 with
skills to adjust requirement of 20, 40, 30, and 10 units per week respectively. The transportation costs (in Rs.) per unit
the project between factories and warehouses are given below. Find an initial basic feasible solution of the given
schedule as transportation problem using northwest corner rule.
per the demand
and supply
issues of project Factory Warehouse Supply
resources
W1 W2 W3 W4
 Feasibility
Analysis. F1 1 2 1 4 30
F2 3 3 2 1 50
F3 4 2 5 9 20
Demand 20 40 30 10

● A mobile phone manufacturing company has three branches located in three different regions,
say Jaipur, Udaipur and Mumbai. The company has to transport mobile phones to three
destinations, say Kanpur, Pune and Delhi. The availability from Jaipur, Udaipur and Mumbai
is 40, 60 and 70 units respectively. The demand at Kanpur, Pune and Delhi are 70, 40 and 60
respectively. The transportation cost is shown in the matrix below (in Rs). Use the Least Cost
method to find a basic feasible solution (BFS).

DESTINATIONS
Kanpur Pune Delhi Supply
Jaipur 4 5 1 40
Sources Udaipur 3 4 3 60
Mumbai 6 2 8 70
Demand 70 40 60 170

● Find Solution using Row minima method.

D1 D2 D3 D4 Supply
S1 11 13 17 14 250
S2 16 18 14 10 300
S3 21 24 13 10 400
Demand 200 225 275 250

VFSTR 160
 CSE - Department Electives

● Find Solution using Column minima method.

D1 D2 D3 D4 Supply
S1 11 13 17 14 250
S2 16 18 14 10 300
S3 21 24 13 10 400
Demand 200 225 275 250

● Find the positive root of the following equation by (Bisection) method,

f(x)=sin (x/2π)-cos2x
● Consider figure below. The cross-sectional area A of a gutter with equal base and edge length
of 2 is given by:
A = 4sinθ (1+ cosθ )
Using an initial interval of [0,π / 2], find the interval after 3 iterations. Use an initial interval ε = 0.2.

MODULE-2
UNIT-1 12L+8T+0P=20 Hours

STOCHASTIC OPTIMIZATION PROBLEMS

Notion of regret, online to batch conversion, Methods offering vanishing regret - OGD, EG, OMD
Convex Sets and Functions: Affine and convex sets, convexity preserving operations, separating and
supporting hyper-planes, generalized inequalities, Operations preserving convexity, conjugate function,
Quasi-convex functions, Log-concave and log-convex functions, Convexity with respect to generalized
inequalities

UNIT-2 12L+8T+0P=20 Hours

NON-CONVEX OPTIMIZATION PROBLEMS

Applications - sparse recovery, affine rank minimization, low-rank matrix completion, Convex approaches -
relaxation-based methods, Non-convex approaches - projected gradient descent, alternating minimization
Algorithms: Unconstrained problems, equality constrained problems

PRACTICES:
● Show that each convex cone is indeed a convex set.
● Consider the linear system 0 ≤ xi ≤ 1 for i = 1, . . . , n and let P denote the solution set. Explain
how to solve a linear programming problem max{c T x : x ∈ P}.
What if the linear system was ai ≤ xi ≤ bi for i = 1, . . . , n. Here we assume ai ≤ bi for each i.
● Can projected gradient descent (PGD) be used to obtain a stationary solution?
● Show that strong smoothness does not imply convexity by constructing a nonconvex function f : R
● p → R that is 1-SS.

VFSTR 161
 CSE - Department Electives

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Mapping
Course Outcomes Module No.
No. Level with POs

Understand the classical, linear programming

1 and transportation problem along with game Understand 1 1
theory.

2 Analyze real world problems around you. Analyze 1 1, 2

3 Apply optimization to real-world problems. Apply 1 1, 2, 3

Implement dynamic programming in real world

4 Implement 2 3, 4, 11, 12
complex problems.

TEXT BOOKS:
1. Kanti Swarup, Man Mohan and P.K.Gupta, “Operations Research”, Sultan Chand &Sons, 2005.
2. S. S. Rao, “Engineering Optimization Theory and Practice”, 4th Edition, Wiley Publishers, 2009.

REFERENCE BOOKS:
1. M.C. Bhuvaneswari, “Application of Evolutionary Algorithms for Multi-Objective Optimization
in VLSI and Embedded Systems”, Spinger, 2014.
2. Ashlock D, “Evolutionary Computation for Modeling and Optimization”, Springer, 2006.
3. Kalyanmoy Deb, “Optimization for Engineering Design”, Prentice Hall of India, 2nd Edition,
2012.
4. A. Ravindran and K.M. Rogsdell, G.V. Reklaites, “Engineering Optimization: Methods and
Applications”,Wiley, 2nd Edition, 2006.
5. E. J. Haug and J.S. Arora, “Applied Optimal Design”, Wiley Publishers,1979.

VFSTR 162
 CSE - Department Electives

22CS815 INTRUSION DETECTION AND

PREVENTION SYSTEM
Hours Per Week :

L T P C
3 0 2 4
PREREQUISITE KNOWLEDGE: Cryptography and Network Security.
Source: https://www.
COURSE DESCRIPTION AND OBJECTIVES: kirkpatrickprice.com/blog/
idps-techniques
This course aims to understand modern concepts related to Intrusion Detection System. The course
compares alternative tools and approaches for Intrusion Detection through quantitative analysis to
determine the best tool or approach to reduce risk from intrusion Students undergoing this course can
identify and describe the parts of all intrusion detection systems and characterize new and emerging
IDS technologies according to the basic capabilities all intrusion detection systems share.

MODULE-1
UNIT-1 12L+0T+8P=20 Hours
INTRODUCTION
Basic Concepts of Security, Introduction to Intrusions, Need of Intrusion Detection, Classification of
Intrusion Detection Systems, Sources of Vulnerabilities, Attacks against various security objectives,
countermeasures of attacks.

UNIT-2 12L+0T+8P=20 Hours

INTRUSION DETECTION AND PREVENTION TECHNOLOGIES
Host-based intrusion detection system (HIDS), Network-based IDS, Information Sources for IDS, Host
and Network Vulnerabilities and Countermeasures. Intrusion detection techniques, misuse detection:
pattern matching, rule-based and state-based anomaly detection: statistical based, machine learning
based, data mining-based hybrid detection.
IDS and IPS Architecture: Tiered architectures, Single-tiered, Multi-tiered, Peer-to-Peer. Sensor: sensor
functions, sensor deployment and security.

PRACTICES:
● Installing Snort into the Operating System
● Configuring and Starting the Snort IDS
● Writing and Adding a Snort Rule
● Triggering an Alert for the New Rule

MODULE- 2
UNIT-1 12L+0T+8P=20 Hours
AGENTS
Agent functions, agent deployment and security. Manager component: manager functions, manager
deployment and security. Information flow in IDS and IPS, defending IDS/IPS, Case study on commercial
and open-source IDS.

UNIT-2 12L+0T+8P=20 Hours

ALERT MANAGEMENT AND CORRELATION DATA FUSION
Alert correlation, Pre-process, Correlation Techniques, Post-process, Alert Correlation architectures.
Cooperative Intrusion Detection, Cooperative Discovery of Intrusion chain, Abstraction-based Intrusion

VFSTR 163
 CSE - Department Electives

Detection, Interest-based communication and cooperation, agent-based cooperation.

SKILLS:
 Installation and PRACTICES:
configuration of
IDS. ● Demo of Eavesdropping attack and its Prevention using SSH.
● Demonstrate how to provide secure data storage, secure data transmission and for creating
 Compare
various anomaly digital signatures (GnuPG)
detection ● Setup a honey pot and monitor the honeypot on network (KF Sensor)
techniques.
● Installation of rootkits and study about the variety of option.
 Evaluate
● Perform wireless audit on an access point or a router and decrypt WEP and WPA. (NetStumbler)
security of
intrusion ● Install any open-source IDS and study the logs
detection tool.
COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply Intrusion Detection tools and techniques in
1 Apply 2 1,2
order to improve their security posture.
Apply the knowledge to the architecture, configu-
2 ration, and analysis of specific intrusion detection Apply 2 1, 2
systems.
Analyse appropriate situations and scenarios
where intrusion detection may be applied to
3 Analyse 1 1,2
achieve an increased level of situational aware-
ness and information assurance.
Evaluate the security of an organization for better
4 Evaluate 1 1,2
performance.

TEXT BOOKS:
1. C. Endorf, E. Schultz and J. Mellander, Intrusion Detection & Prevention, McGraw-Hill/Osborne
, 2006.

REFERENCE BOOKS:
1. Ali A. Ghorbani, Network intrusion detection and prevention concepts and techniques, Springer,
2010.
2. J. M. Kizza, Computer Network Security, Springer, 2005.
3. Chris Sanders and Jason Smith, Applied Network Security Monitoring: Collection, Detection,
and Analysis, Syngress, 2013.

VFSTR 164
 CSE - Department Electives

PARALLEL AND DISTRIBUTED

COMPUTING
Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Fundamental of programming and operating system, computer

networking, and computer Organization.. Source: http://uceou.edu/
PDS/About%20PDS.html

COURSE DESCRIPTION AND OBJECTIVES:

This course covers the challenges faced in constructing parallel and distributed applications, Various
implementation techniques, paradigms, architectures and parallel algorithms. And current trends in
parallel and distributed computing like Open MP, POSIX Threads, Apache Hadoop (DFS).

MODULE-1
UNIT-1 12L+8T+0P=20 Hours
INTRODUCTION TO PARALLEL COMPUTING
The idea of Parallelism, Power and potential of parallelism, examining sequential and parallel programs,
Scope and issues of parallel and distributed computing, Goals of parallelism, Parallelism and concurrency
using multiple instructions streams.
Parallel Architecture: Pipeline architecture, Array processor, Multi-processor architecture, Systolic
architecture, Dataflow architecture, Architectural classification schemes, Memory access classification,
Memory Issues: Shared vs. distributed, Symmetric multiprocessing (SMP), SIMD, Vector processing,
GPU co-processing, Flynn’s Taxonomy, Instruction Level support for parallel programming, Multiprocessor
caches and Cache Coherence, Non-Uniform Memory Access (NUMA).

UNIT-2 12L+8T+0P=20 Hours

PARALLEL ALGORITHM DESIGN PRINCIPLES AND PROGRAMMING
Need for communication and coordination/synchronization, Scheduling and contention, Independence
and partitioning, Task- Based Decomposition, Data Parallel Decomposition, Characteristics of task
and interaction, Load balancing, Data Management, parallel algorithm models, Sources of overhead
in parallel programs, Performance metrics for parallel algorithm implementations, Parallel algorithmic
patterns like divide and conquer, Map and Reduce, Specific algorithms like parallel Merge Sort, Parallel
graph Algorithms.

PRACTICES:
● Identify Multiple Instruction Single Data, or MISD. How would an MISD system work? Give
an example.
● Suppose a shared-memory system uses snooping cache coherence and write-back caches.
Also suppose that core 0 has the variable x in its cache, and it executes the assignment x = 5.
Finally suppose that core 1 doesn’t have x in its cache, and after core 0’s update to x, core 1
tries to execute y = x. What value will be assigned to y? Why?
● Consider a simplified version of bucket-sort. You are given an array A of n random integers
in the range [1...r] as input. The output data consist of r buckets, such that at the end of the
algorithm, Bucket i contains indices of all the elements in A that are equal to i.
● Describe a decomposition based on partitioning the input data (i.e., the array A) and an
appropriate mapping onto p processes. Describe briefly how the resulting parallel algorithm
would work.
● Describe a decomposition based on partitioning the output data (i.e., the set of r buckets)
and an appropriate mapping onto p processes. Describe briefly how the resulting parallel
algorithm would work.

VFSTR 169
 CSE - Department Electives

SKILLS: ● Consider seven tasks with running times of 1, 2, 3, 4, 5, 5, and 10 units, respectively. Assuming
 Recognize that it does not take any time to assign work to a process, compute the best- and worst-case
parallelism in speedup for a centralized scheme for dynamic mapping with two processes.
computational
problems.
MODULE-2
 Know different
parallel systems UNIT-1 12L+8T+0P=20 Hours
and their
classification. INTRODUCTION TO DISTRIBUTED SYSTEMS
 Design parallel Goals of the Distributed Systems, Relation to parallel systems, synchronous versus asynchronous
algorithms execution, design issues and challenges, Types of Distributed Systems, Distributed System Models,
for different
applications. Hardware and software concepts related to distributed systems, middleware models.
 Compare Distributed Computing and Communication design principles: A Model of distributed executions,
replication Models of communication networks, Global state of distributed system, Models of process communication.
schemes with
Communication and Coordination: Shared Memory, Consistency, Atomicity, Message- 08 Passing,
respect to
performance, Consensus, Conditional Actions, Critical Paths, Scalability, and cache coherence in multiprocessor
availability and systems, synchronization mechanism.
consistency
concerns.
UNIT-2 12L+8T+0P=20 Hours
 Design,
implement, PARALLEL AND DISTRIBUTED PROGRAMMING FRAMEWORKS
and debug
distributed Overview of CUDA, Open MP, POSIX Threads, Apache Hadoop (DFS), and current trends in parallel
systems. and distributed computing.
 Implement
parallel PRACTICES:
algorithms
using MPI
● Give five types of hardware resource and five types of data or software resource that can
and OpenMP usefully be shared. Give examples of their sharing as it occurs in practice in distributed systems.
environments. ● The host computers used in peer-to-peer systems are often simply desktop computers in
 Element parallel users’ offices or homes. What are the implications of this for the availability and security of
algorithms any shared data objects that they hold and to what extent can any weaknesses be overcome
using MPI
through the use of replication?
and OpenMP
environments ● Consider two communication services for use in asynchronous distributed systems. In service
3.0 3.5 A, messages may be lost, duplicated or delayed and checksums apply only to headers. In
 AVERAGE. service B, messages may be lost, delayed or delivered too fast for the recipient to handle them,
but those that are delivered arrive with the correct contents. Describe the classes of failure
exhibited by each service. Classify their failures according to their effects on the properties of
validity and integrity. Can service B be described as a reliable communication service?
● Illustrate distributed design through a substantial case study, examining in detail the design of
the Google infrastructure, a platform and associated middleware that supports both Google
search and a set of associated web services and applications including Google Apps.
● Implementation of the parallel algorithms (on a PC-cluster under Linux platform). The programs
will be based on POSIX Thread, MPI programming, Hadoop, Apache Spark etc.

VFSTR 170
 CSE - Department Electives

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply the fundamentals of parallel and parallel
1 Apply 1 1
computing including architectures and paradigms.
Analyse the various design principles of parallel
2 Analyse 1 2
algorithms.
Under-
3 Learn the intricacies of distributed programming. 2 1
stand
Develop and execute basic parallel and distributed
4 applications using basic programming models create 2 5
and tools.

TEXT BOOKS:
1. DISTRIBUTED SYSTEMS Concepts and Design Fifth Edition. George Coulouris. Cambridge
University. Jean Dollimore formerly of Queen Mary, University of London.
2. Distributed Systems Principles and Paradigms Andrew S. Tanenbaum Maarten Van Steen, 3rd
Edition, 2017.

REFERENCE LINKS:
1. Introduction To Parallel Programming, Peter S. Pacheco University of San Francisco.
2. Introduction To Parallel Processing, M.Sasikumar, Dinesh Shikhare and P. Ravi Prakash, Randy
Chow, T. Johnson, Distributed Operating Systems and Algorithms, Addison Wesley.
3. Ian Foster: Designing and Building Parallel Programs – Concepts and tools for Parallel Software
Engineering, Pearson Publisher, 1st Edition, 2019.
4. Parallel Programming in C with MPI and Open MP Michael J.Quinn, McGrawHill Higher
Education.
5. https://hpc.llnl.gov/training/tutorials/introduction-parallel-computing-tutorial.
6. https://www.geeksforgeeks.org/introduction-to-parallel-computing/.
7. https://nptel.ac.in/.
8. https://www.coursera.org/.

VFSTR 171
 CSE - Department Electives

VFSTR 172
 COMPUTER SCIENCE
AND ENGINEERING

 22CS951 - Advanced Graph Algorithms

 22CS952 - Biometrics
 22CS953 - Parallel and Distributed Computing
 22CS954 - Internet of Things
 22CS955 - Wireless Sensor Networks
 22CS956 - Capstone Project

I SEM & II SEM

 CSE - Honours

22CS951 ADVANCED GRAPH ALGORITHMS

Hours Per Week :

L T P C
3 0 2 4
PREREQUISITE KNOWLEDGE: Basic Logical Thinking and Problem Solving Ability.
Source: https://
COURSE DESCRIPTION AND OBJECTIVES: towardsdatascience.
com/10-graph-
The course will cover some traditional discrete approaches to various graph problems, especially flow algorithms-visually-
problems, and then contrast these approaches with modern, asymptotically faster methods based on explained-e57faa1336f3

combining convex optimization with spectral and combinatorial graph theory.

MODULE-1
UNIT-1 12L+0T+8P=20 Hours

INTRODUCTION
Introduction to Optimization, Convex Geometry, Linear Algebra, Convexity and Second Derivatives,
Gradient Descent and Acceleration.

UNIT-2 12L+0T+8P=20 Hours

SPECTRAL GRAPH THEORY

Introduction to Spectral Graph Theory, Effective Resistance, Gaussian Elimination as Optimization,
Additive Perspective on Gaussian Elimination.

PRACTICES:
● Implement the gradient descent optimization algorithm with Nesterov Momentum.
● Assume that S is subset of R^n is a convex set and that the function f : S->R is convex. Suppose
that x1, …, xn belongs to S and theta_1,…,theta_n >= 0 with theta_1,…,theta_n = 1. Prove
that f(theta_1x1 + _ _ _ + theta_nxn) <= theta_1f(x1) + …. + theta_nf(xn)

MODULE-2
UNIT-1 12L+0T+8P=20 Hours

RANDOM MATRIX CONCENTRATION

Introduction to Random Matrix Concentration, Spectral Graph Sparsification, Laplacian Linear Equations,
Classical Algorithms for Maximum Flow

UNIT-2 12L+0T+8P=20 Hours

SEPARATING HYPERPLANE THEOREM

Separating Hyperplane Theorem, Langrange Multipliers, and Convex Duality, Karush-Kuhn-Tucker
Conditions, Fenchel Conjugates, Newton’s Method.

VFSTR 167
 CSE - Honours

SKILLS: PRACTICES:
 Develop ● Show that the Ford-Fulkerson algorithm may not terminate; moreover, it may converge a value
a deeper
understanding
not equal to the value of the maximum flow.
of fundamental ● An electric company is setting up a power plant in a foreign country and it has to plan its capacity.
phenomena in The peak period demand for power is given by p1 = 400 − q1 and the off-peak is given by p2
optimization.
= 380 − q2. The variable cost to is 20 per unit (paid in both markets) and capacity costs 10 per
 Deep dive unit which is only paid once and is used in both periods.
into modern
approaches to ● Write down the lagrangian and Kuhn-Tucker conditions for this problem
graph algorithms ● Find the optimal outputs and capacity for this problem.
using convex
optimization
● How much of the capacity is paid for by each market (i.e. what are the values of λ1 and λ2)?
techniques. ● Now suppose capacity cost is 30 per unit (paid only once). Find quantities, capacity and
 Central
how much of the capacity is paid for by each market (i.e. λ1 and λ2)?
techniques in the
development of COURSE OUTCOMES:
graph algorithms Upon successful completion of this course, students will have the ability to:
including graph
decomposition
techniques, CO Blooms Module Mapping
Course Outcomes
oblivious routing No. Level No. with POs
etc.
Analyze key concepts in optimization such as first
and second-order optimization, convex duality,
1 multiplicative weights and dual-based methods, Analyze 1 1, 2, 9, 10, 12
acceleration, preconditioning, and non-Euclidean
optimization.
Design convex optimization through the lens of
2 Create 1 1,2,3,9
graph algorithms
Apply the central techniques in the development
of graph algorithms including graph decomposition
3 Apply 2 1, 2, 9, 10, 12
techniques, sparsification, oblivious routing, and
spectral and combinatorial preconditioning.

TEXT BOOKS:
1. Boyd, Stephen, Stephen P. Boyd, and Lieven Vandenberghe. Convex optimization. Cambridge
university press, 2004.
2. Cartan, Henri. Differential calculus. Hermann, 1983.

REFERENCES:
1. Tarjan, Robert Endre. Data structures and network algorithms. Society for industrial and Applied
Mathematics, 1983.
2. Cook, William J., et al. “Combinatorial optimization.” Oberwolfach Reports 5.4 (2009): 2875-
2942.
3. Rockafellar, R. Tyrrell. Convex analysis. Vol. 18. Princeton university press, 1970.

VFSTR 168
 CSE - Honours

22CS952 BIOMETRICS

Hours Per Week :

L T P C
3 0 2 4
PREREQUISITE KNOWLEDGE: Engineering Mathematics, Probability and Statistics, Image Processing.
Source: https://
COURSE DESCRIPTION AND OBJECTIVES: cyberhoot.com/cybrary/
biometrics/
This course is a foundation for design and implementation of biometric systems which helps in providing
authentication, identification of persons. This can be performed using the biometric traits like finger print,
face, iris etc. It is mainly used in security applications.

MODULE-1
UNIT-1 8L+0T+6P=14 Hours

INTRODUCTION
Introduction: Biometric Systems, Biometric Functionalities, Biometric System Errors. The Design Cycle
of Biometric Systems, Applications of Biometric Systems.

UNIT-2 16L+0T+10P=26 Hours

FINGERPRINT AND FACE RECOGNITION SYSTEMS

Finger Print Recognition: Introduction, Friction Ridge Pattern, Fingerprint Acquisition, Feature
Extraction, Matching, Fingerprint Indexing, Fingerprint Synthesis, Palmprint.
Face Recognition: Introduction, Image Acquisition, Face Detection, Feature Extraction and Matching.

PRACTICES:
● The minutiae-based representation and matching algorithms.
● Collect various data sets of different traits and analyse the usage of these data sets.
● For a given fingerprint, identify the minutia points by binarization and thinning of ridges.
● From a fingerprint image, extract the singularity points.
● Identify the inter subject and intra subject variations for given finger prints.
● Implementation of ViolaJones object detection algorithm.
● Perform feature extraction by using
a. Principal component analysis.
b. Linear Discriminant analysis

MODULE-2
UNIT-1 10L+0T+8P=18 Hours

IRIS RECOGNITION
Iris recognition: Introduction, Design of Iris Recognition System, Iris Segmentation, Iris Normalization,
Iris Encoding and Matching, Iris Quality.

UNIT-2 14L+0T+8P=22 Hours

MULTI-BIOMETRICS
Multi-biometrics: Introduction, Sources of Multiple Evidence, Acquisition and Processing Architecture,
Fusion Levels.

VFSTR 169
 CSE - Honours

SKILLS: PRACTICES:
 Identify the ● Implementation of Iris segmentation.
datasets to be
used in various ● Generation of Iris code.
applications. ● Taking a biometric trait, performing.
 Usage of a. Sensor-level fusion.
multi-biometrics
to enhance
b. Feature-level fusion.
security. ● Working with feature normalization for the fusion of two heterogeneous feature vectors.
 Design of ● Score level fusion using various classifiers.
fingerprint, Iris,
face detection COURSE OUTCOMES:
systems.
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Analyze the steps in design of various biometric
1 system, functionalities, traits and metrics used to Analyze 1 2
measure their performance.
Design of biometric systems depending on the
2 choice of using the trait like fingerprint, face, iris Create 1,2 1, 3, 6
etc.
Applying the multimodal biometric traits and fusion
3 Apply 2 1,6
levels in various applications.
Analyze the usage of various biometric traits in
4 Analyze 2 2,6
real time applications.

TEXT BOOKS:
1. Anil K. Jain, Arun A. Ross, Karthik Nanda kumar, “Introduction to Biometrics”, Springer, 2011.
2. N. V. Boulgouris , Konstantinos N. Plataniotis , Evangelia Micheli-Tzanakou “Biometrics: Theory,
Methods, and Applications”, Wiley, 2009

REFERENCE BOOKS:
1. Samir Nanavati, Michael Thieme, Raj Nanavati, “Biometrics – Identity Verification in a Networked
World”, WILEY, 2002.
2. John D. Woodward, John D.Woodward, Jr.Noicholas M.Orlans Peter T. Hig, “Biometrics-The
Ultimate Reference”, DreamTech Press, 2003.
3. Julian Ashbourn, “Biometrics: Advanced Identity Verification The Complete Guide” Springer,
2020.

VFSTR 170
 CSE - Honours

22CS953 PARALLEL AND DISTRIBUTED

COMPUTING
Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Fundamental of programming and operating system, computer

networking, and computer Organization.. Source: http://uceou.edu/
PDS/About%20PDS.html

COURSE DESCRIPTION AND OBJECTIVES:

This course covers the challenges faced in constructing parallel and distributed applications, Various
implementation techniques, paradigms, architectures and parallel algorithms. And current trends in
parallel and distributed computing like Open MP, POSIX Threads, Apache Hadoop (DFS).

MODULE-1
UNIT-1 12L+8T+0P=20 Hours
INTRODUCTION TO PARALLEL COMPUTING
The idea of Parallelism, Power and potential of parallelism, examining sequential and parallel programs,
Scope and issues of parallel and distributed computing, Goals of parallelism, Parallelism and concurrency
using multiple instructions streams.
Parallel Architecture: Pipeline architecture, Array processor, Multi-processor architecture, Systolic
architecture, Dataflow architecture, Architectural classification schemes, Memory access classification,
Memory Issues: Shared vs. distributed, Symmetric multiprocessing (SMP), SIMD, Vector processing,
GPU co-processing, Flynn’s Taxonomy, Instruction Level support for parallel programming, Multiprocessor
caches and Cache Coherence, Non-Uniform Memory Access (NUMA).

UNIT-2 12L+8T+0P=20 Hours

PARALLEL ALGORITHM DESIGN PRINCIPLES AND PROGRAMMING
Need for communication and coordination/synchronization, Scheduling and contention, Independence
and partitioning, Task- Based Decomposition, Data Parallel Decomposition, Characteristics of task
and interaction, Load balancing, Data Management, parallel algorithm models, Sources of overhead
in parallel programs, Performance metrics for parallel algorithm implementations, Parallel algorithmic
patterns like divide and conquer, Map and Reduce, Specific algorithms like parallel Merge Sort, Parallel
graph Algorithms.

PRACTICES:
● Identify Multiple Instruction Single Data, or MISD. How would an MISD system work? Give
an example.
● Suppose a shared-memory system uses snooping cache coherence and write-back caches.
Also suppose that core 0 has the variable x in its cache, and it executes the assignment x = 5.
Finally suppose that core 1 doesn’t have x in its cache, and after core 0’s update to x, core 1
tries to execute y = x. What value will be assigned to y? Why?
● Consider a simplified version of bucket-sort. You are given an array A of n random integers
in the range [1...r] as input. The output data consist of r buckets, such that at the end of the
algorithm, Bucket i contains indices of all the elements in A that are equal to i.
● Describe a decomposition based on partitioning the input data (i.e., the array A) and an
appropriate mapping onto p processes. Describe briefly how the resulting parallel algorithm
would work.
● Describe a decomposition based on partitioning the output data (i.e., the set of r buckets)
and an appropriate mapping onto p processes. Describe briefly how the resulting parallel
algorithm would work.

VFSTR 171
 CSE - Honours

SKILLS: ● Consider seven tasks with running times of 1, 2, 3, 4, 5, 5, and 10 units, respectively. Assuming
 Recognize that it does not take any time to assign work to a process, compute the best- and worst-case
parallelism in speedup for a centralized scheme for dynamic mapping with two processes.
computational
problems.
MODULE-2
 Know different
parallel systems UNIT-1 12L+8T+0P=20 Hours
and their
classification. INTRODUCTION TO DISTRIBUTED SYSTEMS
 Design parallel Goals of the Distributed Systems, Relation to parallel systems, synchronous versus asynchronous
algorithms execution, design issues and challenges, Types of Distributed Systems, Distributed System Models,
for different
applications. Hardware and software concepts related to distributed systems, middleware models.

 Compare Distributed Computing and Communication design principles: A Model of distributed executions,
replication Models of communication networks, Global state of distributed system, Models of process communication.
schemes with
Communication and Coordination: Shared Memory, Consistency, Atomicity, Message- 08 Passing,
respect to
performance, Consensus, Conditional Actions, Critical Paths, Scalability, and cache coherence in multiprocessor
availability and systems, synchronization mechanism.
consistency
concerns.
UNIT-2 12L+8T+0P=20 Hours
 Design,
implement, PARALLEL AND DISTRIBUTED PROGRAMMING FRAMEWORKS
and debug
distributed Overview of CUDA, Open MP, POSIX Threads, Apache Hadoop (DFS), and current trends in parallel
systems. and distributed computing.
 Implement
parallel PRACTICES:
algorithms
using MPI
● Give five types of hardware resource and five types of data or software resource that can
and OpenMP usefully be shared. Give examples of their sharing as it occurs in practice in distributed systems.
environments. ● The host computers used in peer-to-peer systems are often simply desktop computers in
 Element parallel users’ offices or homes. What are the implications of this for the availability and security of
algorithms any shared data objects that they hold and to what extent can any weaknesses be overcome
using MPI
through the use of replication?
and OpenMP
environments ● Consider two communication services for use in asynchronous distributed systems. In service
3.0 3.5 A, messages may be lost, duplicated or delayed and checksums apply only to headers. In
 AVERAGE. service B, messages may be lost, delayed or delivered too fast for the recipient to handle them,
but those that are delivered arrive with the correct contents. Describe the classes of failure
exhibited by each service. Classify their failures according to their effects on the properties of
validity and integrity. Can service B be described as a reliable communication service?
● Illustrate distributed design through a substantial case study, examining in detail the design of
the Google infrastructure, a platform and associated middleware that supports both Google
search and a set of associated web services and applications including Google Apps.
● Implementation of the parallel algorithms (on a PC-cluster under Linux platform). The programs
will be based on POSIX Thread, MPI programming, Hadoop, Apache Spark etc.

VFSTR 172
 CSE - Honours

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply the fundamentals of parallel and parallel
1 Apply 1 1
computing including architectures and paradigms.
Analyse the various design principles of parallel
2 Analyse 1 2
algorithms.
Under-
3 Learn the intricacies of distributed programming. 2 1
stand
Develop and execute basic parallel and distributed
4 applications using basic programming models create 2 5
and tools.

TEXT BOOKS:
1. DISTRIBUTED SYSTEMS Concepts and Design Fifth Edition. George Coulouris. Cambridge
University. Jean Dollimore formerly of Queen Mary, University of London.
2. Distributed Systems Principles and Paradigms Andrew S. Tanenbaum Maarten Van Steen, 3rd
Edition, 2017.

REFERENCE LINKS:
1. Introduction To Parallel Programming, Peter S. Pacheco University of San Francisco.
2. Introduction To Parallel Processing, M.Sasikumar, Dinesh Shikhare and P. Ravi Prakash, Randy
Chow, T. Johnson, Distributed Operating Systems and Algorithms, Addison Wesley.
3. Ian Foster: Designing and Building Parallel Programs – Concepts and tools for Parallel Software
Engineering, Pearson Publisher, 1st Edition, 2019.
4. Parallel Programming in C with MPI and Open MP Michael J.Quinn, McGrawHill Higher
Education.
5. https://hpc.llnl.gov/training/tutorials/introduction-parallel-computing-tutorial.
6. https://www.geeksforgeeks.org/introduction-to-parallel-computing/.
7. https://nptel.ac.in/.
8. https://www.coursera.org/.

VFSTR 173
 CSE - Honours

22CS954 INTERNET OF THINGS

Hours Per Week :

L T P C
3 0 2 4

PREREQUISITE KNOWLEDGE: Computer networks.

Source: https://toolsense.
io/glossary/iot/ COURSE DESCRIPTION AND OBJECTIVES:
Internet of Things (IoT) is presently a hot technology worldwide. Government, academia, and industry
are involved in different aspects of research, implementation, and business with IoT. IoT cuts across
different application domain verticals ranging from civilian to defense sectors. These domains include
agriculture, space, healthcare, manufacturing, construction, water, and mining, which are presently
transitioning their legacy infrastructure to support a loT. To introduce the terminology, technology and
its applications, to introduce the concept of M2M (machine to machine) with necessary protocols.

MODULE-1
UNIT-1 12L+0T+8P=20 Hours

INTERNET OF THINGS FUNDAMENTALS

Introduction to Internet of Things; Physical design & Functional Block of IoT, Device architectures,
CoreIoT Functional Stack; Resource constrained devices; Sensors and Components; IoT Enabling
Technologies. Societal Benefits of IoT (Domain Specific), Risks, Privacy, and Security.
Network And Communication Protocols: Network Components; Internet Structure, Wireless Protocols;
IoT Communication Model & APIs, Wireless Protocol Stack, IoT levels.

UNIT-2 12L+0T+8P=20 Hours

IOT AND M2M

Software defined networks, Network function virtualization, difference between SDN and NFV for
IoT Basics of IoT System Management with NETCONF-YANG: SDN; NFV; Need for IOT Systems
Management; SNMP-NETCONF, YANG; IOT Systems management with NETCONF-YANG.

PRACTICES:
● Identify different Sensors and IoT devices
● Identify the Components in Raspberry pi, Arduino, and UNO boards
● Examine IoT levels with any one domain specific application like home automation, weather
monitoring system etc.
● Design the Network Configuration and System Management with IoT devices using NETCONF-
YANG.
● Design the Network Configuration and System Management with IoT devices using SNMP-
NETCONF.

MODULE-2
UNIT-1 12L+0T+8P=20 Hours

INTRODUCTION TO SYSTEMS DESIGN & DEVELOPMENT

IoT system building blocks, Arduino, Node MCU– Board details, IDE programming; Raspberry Pi-Model
and Interfaces, Platform: Axonize, Blynk IoT platform, Fogwing.

VFSTR 174
 CSE - Honours

UNIT-2 12L+0T+8P=20 Hours SKILLS:

 Sensor
PROGRAMMING AND CASE STUDY Identification
Embedded C vs Python; Operating systems for constrained devices; Domain Specific IoT Application, and IoT system
design.
Task Support IoT Example: The Refrigerator, Weather Monitoring System – Case study- Design,
Programming and Execution.  Sensor data
analysis.

PRACTICES:  Tool usage for

developing IoT
● Demonstration and study of Raspberry Pi board, GPIO Pins and familiarity of various sensors. applications.
● Demonstration and study of other Hardware board of IoT such as Arduino Uno and NodeMCU.
● Design and Implementation of controlling LED-using Python in Raspberry Pi board.
● Design and Implementation of sensing light through LDR using Python in Raspberry Pi board.
● Design and Implementation to find obstacles through sensor using Python in Raspberry Pi board.
● Design and Implementation of sensing and display temperature using Python in Raspberry
Pi board.
● Design and Implementation of detecting noise through microphone sensor using Python in
Raspberry Pi board.
● Design and Implementation of output devices through relay using Python in Raspberry Pi board.
● Design and Implementation of vibration sensor using Python in Raspberry Pi board.
● Design and Implementation of uploading sensor data into cloud using Python.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Illustrate the impact and challenges posed by IoT
1 Analyze 1 4, 6
networks leading to new architectural models.
Design an end-to-end Machine-learning model to
2 Design 1 3
realize solutions for real-world problems.
Apply various machine-learning models to develop
3 Apply 2 1
IoT applications.
Compare and contrast the deployment of smart
4 objects and the technologies to connect them to Evaluate 2 4
network.

TEXT BOOKS:
1. Arshdeep Bahga and Vijay Madisetti “Internet of Things: A Hands-on Approach”, Universities
Press, 2015.
2. Rajkumar Buyya and Amir Vahid Dastjerdi “Internet of Things: Principles and Paradigms”,
Morgan Kaufmann; 1st Edition, May 25, 2016.

REFERENCE BOOKS:
1. Matt Richardson & Shawn Wallace “Getting Started with Raspberry Pi”, O’Reilly (SPD), 2014,
ISBN: 9789350239759.
2. Waltenegus Dargie, Christian Poellabauer, “Fundamentals of Wireless Sensor Networks: Theory
and Practice”.
3. Beginning Sensor networks with Arduino and Raspberry Pi – Charles Bell, A press, and 2013.

VFSTR 175
 CSE - Honours

22CS955 WIRELESS SENSOR NETWORKS

Hours Per Week :

L T P C
3 0 2 4

PREREQUISITE KNOWLEDGE: Computer networks.

Source: https://www.
electronicshub.org/ COURSE DESCRIPTION AND OBJECTIVES:
wireless-sensor-
networks-wsn/ In this course we will provide an introduction to Wireless Sensor Networks (WSN) and cover latest
topics in WSNs. The goal of this course is to give an overview of fundamental problems in the area of
WSNs. We will discuss existing solutions for some of these problems. Data aggregation, information
dissemination, security issues, power management, localization, topology control, routing, and security,
are the topics will be covered in this course.

MODULE-1
UNIT-1 10L+0T+6P=16 Hours

INTRODUCTION
Introduction to Wireless Sensor Networks: Background of Sensor Network, Motivations, Performance
metrics, Design factors, Sensor node hardware’s and software’s.
WSN Architecture: Traditional layered stack, roles and challenges, Enabling technologies in WSN,
Applications of WSN, Physical layer and transceiver design considerations in WSNs.

UNIT-2 14L+0T+10P=24 Hours

MAC PROTOCOLS FOR WSN

Medium Access Control Protocols for WSN: Introduction, Fundamentals of MAC Protocols, Contention-
Free, Contention-Based and Hybrid MAC Protocols, Data aggregation and fusion, Distributed data bases.
Localization: Global location (GPS-based) and relative location (Beacon-based). Localization methods:
anchor-free, anchor-based, range-free, range-based. Clustering in WSN, Types of clustering.

PRACTICES:
● Implement different network topologies in WSN using NS2 Simulator/Arduino boards.
● Implement traffic signaling using Arduino boards.
● Establish communication between the two motes with Wi-Fi, XBee, modules on arduino and
raspberry pi.
● Create cluster formation with m number of motes in WSN by using Arduino and raspberry pi.
● Collect the sensor geographical location information using Raspberry pi.

MODULE-2
UNIT-1 10L+0T+6P=16 Hours

ROUTING PROTOCOLS
Routing protocols for WSN: Introduction, Routing Challenges and Design Issues in WSN, Flooding
and its variants, LEACH, Location-based protocols and energy-aware routing.
Transport Control Protocols for WSN: Feasibility of Using TCP or UDP for WSNs, TCP Design Issues,
Existing TCPs in WSN: CODA, ESRT, RMST, PSFQ, GARUDA, ATP, Problems with TCP, Performance
of TCP.

VFSTR 176
 CSE - Honours

UNIT-2 14L+0T+10P=24 Hours SKILLS:

 To Know the
SECURITY fundamentals of
Security: Fundamentals, Security challenges in WSN, Security Attacks, Protocols and Mechanisms for wireless sensor
networks and
Security, IEEE 802.15.4 and ZigBee Security, Sensor Network programming, Node-Centric Programming: its application to
nesC Language, TinyGALS, Sensor Network Simulators: Network Simulator Tools and Environments. critical real time
scenarios.
PRACTICES:  To study the
various protocols
● Implement transmission between mobile nodes based on TCP and CBR traffic in WSN nodes
at various
using NS2 simulator. layers and its
● Implement a Low Energy Adaptive Hierarchy protocol using Simulation Tool. differences
with traditional
● Implement different attack and its preventions in WSN using Arduino boards. protocols.

COURSE OUTCOMES:  To know the

issues pertaining
Upon successful completion of this course, students will have the ability to: to sensor
networks and
CO Blooms Module Mapping the challenges
Course Outcomes involved in
No. Level No. with POs
managing a
Design a wireless sensor network for given sensor sensor network.
1 data using microcontroller, transceiver, middle- Create 1 3
ware and operating system.

Evaluate the performance of schedule based and

random Medium Access Control protocols for
2 Analyze 1 1, 2, 3
power consumption, fairness, channel utilization
and control packet overhead.
Evaluate the performance of low energy and geo-
3 graphic routing protocols for power consumption, Analyze 2 1, 2, 3
scalability and latency parameters.
Implement solutions to real world problems using
4 Create 2 3
various sensors and arduino boards.

TEXT BOOKS:
1. Dargie, Waltenegus, and Christian Poellabauer. Fundamentals of wireless sensor networks:
theory and practice. John Wiley & Sons, 2010.
2. Kazem Sohraby, Daniel Minoli and Taieb Znati, “Wireless Sensor Networks Technology,
Protocols, and Applications”, John Wiley & Sons, 2007.

REFERENCE BOOKS:
1. Holger Karl and Andreas Willig, “Protocols and Architectures for Wireless Sensor Networks”,
John Wiley & Sons, Ltd, 2005.
2. Zhao and L. Guibas, “Wireless Sensor Networks”, Morgan Kaufmann, San Francisco, 2004.
3. C. S. Raghavendra, K.M.Shivalingam and T.Znati, “Wireless Sensor Networks”, Springer, New
York, 2004.
4. Anna Hac, “Wireless Sensor Network Designs”, John Wiley & Sons, 2004.

VFSTR 177