PROGRAMME STRUCTURE

&
DETAILED COURSE SYLLABUS

BACHELOR OF TECHNOLOGY

COMPUTER SCIENCE & ENGINEERING

4 YEARS COURSE

SYLLABUS FOR BATCH: 2024 – 2028

SCHOOL OF ENGINEERING & INFORMATION

TECHNOLOGY

(Established under Sanskriti University Uttar Pradesh Act No. of 2016)

28 K.M. Stone, Mathura - Delhi Highway, Chhata, Mathura, U.P.
PROGRAMME SPECIFIC OUTCOMES (PSOs)

PSO 1 To prepare the students ready for industry usage by providing required training in
cutting edge technologies
PSO 2 To use the core concepts of computing and optimization techniques to develop more
efficient and effective computing mechanisms.
PSO 3 An Ability to use inculcate professional, social, ethical, effective communication skills
and entrepreneurial practice among their holistic growth.
PSO 4 Acquaint with the contemporary trends in industrial/research settings and thereby
innovate novel solutions to existing problems.

PROGRAMME OUTCOMES (POs):

PO 1 Engineering knowledge: Applying the knowledge of mathematics, science, engineering

fundamentals, and an engineering specialization to the solution of complex engineering
problems.

PO 2 Problem analysis: Identifying, formulate, review research literature, and Analyzing

complex engineering problems reaching substantiated conclusions using first principles
of mathematics, natural sciences, and engineering sciences.

PO 3 Design/development of solutions: Design solutions for complex engineering problems

and design system components or processes that meet the specified needs with
appropriate consideration for the public health and safety, and the cultural, societal, and
environmental considerations.

PO 4 Conduct investigations of complex problems: Use research-based knowledge and

research methods including design of experiments, analysis and interpretation of data,
and synthesis of the information to provide valid conclusions.

PO 5 Modern tool usage: Create, select, and applying appropriate techniques, resources, and
modern engineering and IT tools including prediction and modeling to complex
 engineering activities with an Understanding of the limitations.

PO 6 The engineer and society: Applying reasoning informed by the contextual knowledge
to assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.

PO7 Environment and sustainability: Understanding the impact of the professional

engineering solutions in societal and environmental contexts, and demonstrate the
knowledge of, and need for sustainable development.

PO 8 Ethics: Applying ethical principles and commit to professional ethics and

responsibilities and norms of the engineering practice.
PO 9 Individual and team work: Function effectively as an individual, and as member
or leader in diverse teams, and in multidisciplinary settings.

PO 10 Communication: Communicate effectively on complex engineering activities with the

engineering community and with society at large, such as, being able to comprehend
and write effective reports and design documentation, make effective presentations, and
give and receive clear instructions.

PO 11 Project management and finance: Demonstrate knowledge and Understanding of the

engineering and management principles and applying these to one‟s own work, as a
member and leader in a team, to manage projects and in multidisciplinary environments.

PO 12 Life-long learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context of technological
change.
 PROGRAMME STUDY
EVALUATION SCHEME
Semester Wise Credit Distribution

Credit Point
Sl. No. Year ODD EVEN
1 First 20 20
2 Second 20 20
3 Third 20 20
4 Fourth 20 20
80 80
Total Credits
160

Subject Category Wise Credit Distribution

Semester
I II III IV `V` VI VII VIII Total
Course Category
Science Core (SC) 9 8 - 3 - - - - 20

Multidisciplinary Course 3 7 - - - - - - 10

(MDC)
Departmental Specific Core 3 3 12 6 6 6 - - 36

(DSC)
Departmental Specific Elective - - 3 9 3 5 9 2 31

(DSE)
Open Elective (OE) - - - - 3 - - 3 6

Programme Elective (PE) - - - - 3 3 3 8 17

Ability Enhancement - - - - 3 2 - - 5

Compulsory Course (AECC)

Skill Enhancement Compulsory 3 - - - - - - - 3

Course (SECC)
Value Added Course(VAC) - 1 2 - - 4 5 6 18

Laboratory (LAB) 2 1 3 2 2 3 1 14

Total Credits 20 20 20 20 20 20 20 20 160

 FIRST SEMESTER

Course Subject
S. No Course Title L T P C
Code Category

1 MAT 103 SC1 Linear Algebra and Calculus 3 0 0 3

2 PHY 101 SC2 Engineering Physics 3 0 0 3

3 Problem Solving and Programming

CSE 111 DSC1 3 0 0 3
Using C

4 EVS 101 SC3 Environmental Science 3 0 0 3

5 MEE 101 MDC1 Basic Mechanical Engineering 3 0 0 3

6 Problem Solving and Programming

CSE 171 LAB1 0 0 2 1
Using C Lab

7 MEE 153 LAB2 Engineering Graphics Lab 0 0 2 1

8 CCS 101 SECC1 Communication Skill 2 0 0 2

9 CCS 151 SECC2 Communication Skill Lab 0 0 2 1

10 VAC 101 VAC1 NSS/NCC/Yoga(Audit Pass) 0 0 0 0

Total Credits 20
 SECOND SEMESTER

Course Subject
S. No Course Title L T P C
Code Category

1 MAT 104 SC4 Differential Equations and Numerical Methods 3 1 0 4

2 CHY 101 SC5 Engineering Chemistry 3 0 0 3

3 CSE 205 DSC Computer Organization and Architecture 3 0 0 3

4 EEE 102 MDC4 Electrical and Electronics Engineering 3 0 0 3

5 CSE 209 DSC2 Object Oriented Programming With C++ 3 0 0 3

6 CSE 251 LAB3 Object Oriented Programming With C++ Lab 0 0 2 1

7 CHY 151 SC6 Engineering Chemistry Lab 0 0 2 1

8 EEE 152 MDC5 Electrical and Electronics Engineering Lab 0 0 2 1

9 VAC2 /
VAC 102 Gandhian Technology 1 0 0 1
IKS

Total Credits 20

THIRD SEMESTER
 Course Subject
S. No Course Title L T P C
Code Category

1 CSE 221 DSC3 Data Structure Using C++ 3 0 0 3

2 CSE 214 DSC4 Discrete Mathematics 3 0 0 3

3 CSE 321 DSC5 Java Programming 3 0 0 3

4 CSE 212 DSE1 Digital Electronics 3 0 0 3

6 CSE 206 DSC6 Operating Systems 3 0 0 3

7 CSE 361 LAB4 Java Programming Lab 0 0 2 1

8 CSE 263 LAB5 Data Structure Using C++ Lab 0 0 2 1

9 CSE 252 LAB6 Operating Systems Lab` 0 0 2 1

10 VAC3 /
VAC 201 Indian Constitution 1 0 0 1
IKS

11 VAC 203 VAC4 Swachh Bharat 1 0 0 1

Total Credits 20

FOURTH SEMESTER

Course Subject
S. No Course Title L T P C
Code Category
 1 CSE 307 DSC7 Computer Networks 3 0 0 3

2 CSE 325 DSE2 Database Management Systems 3 0 0 3

3 CSE 305 DSE3 Compiler Design 3 0 0 3

4 CSE 216 DSE4 Design and Analysis of Algorithms 3 0 0 3

5 CSE 222 SC7 Probability and Statistics Reliability 3 0 0 3

6 CSE 323 DSC8 Python Programming 3 0 0 3

7 CSE 363 LAB7 Python Programming Lab 0 0 2 1

8 CSE 365 LAB8 Database Management Systems Lab 0 0 2 1

Total Credits 20

FIFTH SEMESTER

S. Course Subject
Course Title L T P C
No Code Category

1 CSE 204 DSC9 Theory of Automata and Formal Language 3 0 0 3

 2 CSE 404 DSE5 Machine Learning 3 0 0 3

3 CSE 333 MDC3 Robotics and Drones 3 0 0 3

4 PE PE1 3 0 0 3

5 OE Open Elective I* 3 0 0 3

6 CSE 430 LAB9 Machine Learning Lab 0 0 2 1

7 CSE 371 LAB10 Robotics and Drones Lab 0 0 2 1

8 CAC 300 AECC1 Campus to Corporate 0 0 2 1

9 CSE 375 AECC2 Internship-I 0 0 0 2

Total Credits 20

SIXTH SEMESTER

Course Subject
S. No Course Title L T P C
Code Category

1 CSE 312 DSC11 Internet of Things 3 0 0 3

 2 CSE 405 DSC12 Artificial Intelligence 3 0 0 3

3 CSE 403 DSE6 Cryptography and Network Security 3 0 0 3

4 PE PE2 3 0 0 3

5 CSE 344 DSE7 Expert System and Fuzzy Logic 2 0 0 2

6 CSE 370 AECC3 Internship II 0 0 0 2

7 CSE 360 VAC5 Major Project–I 0 0 8 4

Total Credits 20

SEVENTH SEMESTER

Course Subject
S.No Course Title L T P C
Code Category

1 CSE 429 DSE8 Ethical Hacking 3 0 0 3

 2 CSE 425 DSE9 Competitive Coding 3 0 0 3

3 CSE 336 DSE10 Cloud Computing 3 0 0 3

4 PE PE3 3 0 0 3

5 CSE 461 LAB11 Ethical Hacking Lab 0 0 2 1

6 CSE 463 LAB12 Competitive Coding Lab 0 0 2 1

7 CSE 465 LAB13 Cloud Computing Lab 0 0 2 1

8 CSE 481 VAC6 Major Project–II 0 0 10 5

Total Credits 20

EIGHTH SEMESTER

Course Subject
S. No Course Title L T P C
Code Category

1 CSE 450 VAC7 Research Project / Dissertation 0 0 12 6

2 CSE 331 DSE11 Big Data Analytics 2 0 0 2

3 PE PE4 3 0 2 4

4 PE PE5 3 0 2 4

5 CSE 460 LAB14 Big Data Analytics Lab 0 0 2 1

6 OE Open Elective II* 3 0 0 3

Total Credits 20

List of Open Elective I & II

Open Elective -1
Periods
S. NO. Course Course Name Credit
Code
L T P
 1. CSE 421 Computational Geometry 3 0 0 3

2. CSE 423 Cyber Law and Ethics 3 0 0 3

Fundamentals of IOT
3. CSE 422 3 0 0 3
And Applications

Open Elective -2
Periods
S. NO. Course Course Name Credit
Code
L T P

1 History of Science
CSE 414 3 0 0 3
& Engineering

2 CSE 416 Computational Complexity 3 0 0 3

3 CSE 424 Human Computer Interaction 3 0 0 3

Programme Electives
S. No Course Code Course Title L T P C

1 CSE 051 PE1– Blockchain Technology 3 0 0 3

CSE 052 PE1– Full Stack Developer 3 0 0 3

2 CSE 061 PE2– Exploratory Data Analysis and Visualization 2 0 2 3

CSE 062 PE2– R Programming 2 0 2 3

3 CSE 071 PE3– Artificial Neural Network 2 0 2 3

CSE 072 PE3– Neural Networks and Deep Learning 2 0 2 3

CSE 073 PE3– Soft Computing 2 0 2 3

4 CSE 081 PE4– Data Mining and Data Warehousing 3 0 2 4

CSE 082 PE4– DevOps Tools 3 0 2 4

CSE 083 PE4- Cyber Security 3 0 2 4

5 CSE 084 PE5– Natural language processing 3 0 2 4

CSE 085 PE5– Data Analytics 3 0 2 4

Total Credits 17
 FIRST
SEMESTER

COURSE CODE COURSE TITLE L T P C

MAT 103 LINEAR ALGEBRA AND CALCULUS 3 0 0 3
Course Outcome
CO1: Remembering the extreme values of functions of two variables and partial
derivatives.
 CO2: Understanding the vector differential operator to scalar and vector functions.
CO3: Applying and solving line, surface & volume integrals by Greens, Gauss and Stoke’s
theorems.
CO4: Analyzing the basis & dimension of a vector space and compute linear
transformation.
CO5: Evaluating the matrix methods to solve the system of linear equations.
COURSE CONTENTS
UNIT-I [9 SESSIONS]

Partial Differentiation and Its Applications: Functions of two or more variables, Partial
derivatives, Higher order partial derivatives, Total derivative, Differentiation of implicit
functions, Jacobians, Taylor’s expansion of functions of two variables, Maxima and minima of
functions of two variables.
UNIT-II [9 SESSIONS]

Vector Differential Calculus and multiple Integrals: Scalar and Vector point functions, vector
operator Del, Gradient, Directional derivative, Divergence, Curl, Del applied twice to point
functions, Del applied to product of point functions (vector identities), Irrational fields and
Solenoidal fields, Double integral, Change of order of Integration and Triple integrals.
UNIT-III [9 SESSIONS]

Vector Integral Calculus: Line integral, Surface integral and Volume integral. Verification of
Green’s theorem in a plane (without proof), verification of Stroke’s theorem (without proof) and
Gauss’s divergence theorem (without proof).
UNIT-IV [9 SESSIONS]

Vector space: Vector space, Subspace, linear combination of vectors, linear span, row and
column spaces, linear dependent, independent vectors, basis, dimension, linear transformation,
invertible transformation, matrix of linear transformation, kernel and range of LT, rank and
nullity of LT-rank nullity theorem(without proof), change of basis.
UNIT-V [9 SESSIONS]

Matrices: Rank of a matrix, Echelon form, consistency of linear System of equations, Eigen
values, Eigenvectors, Properties of Eigen values, Cayley-Hamilton theorem, Quadratic forms,
Reduction of quadratic form to canonical form by linear transformation, Nature of quadratic
form.
Text Books
 1. Gilbert Strang, “Introduction to linear algebra”, 5th Edition, Wellesley - Cambridge press,
2016.
2. Erwin kreyszig, “Advanced Engineering Mathematics”, 9th Edition, John Wiley & Sons,
2006.
3. Seymour Lipschutz, “Schaum's Outline of Linear Algebra”, 5th Edition, McGraw Hill,
2013.
Reference Books

1. Veerarajan T., “Engineering Mathematics for first year”, Tata McGraw- Hill, New Delhi,
2008.
2. B.S. Grewal, “Higher Engineering Mathematics”, 44th Edition, Khanna Publishers, 2017.

COURSE CODE COURSE TITLE L T P C

PHY 101 ENGINEERING PHYSICS 3 0 0 3

Course Outcome
CO1: Understanding the fundamental principles of wave mechanics, including wave-particle
duality, de-Broglie matter waves, and the Schrödinger wave equation, and applying them to
solve problems related to one-dimensional systems.
 CO2: Describing energy bands in semiconductors, types of semiconductors, charge
carriers, carrier concentration, conductivity, mobility, and the effects of temperature
on semiconductor behavior.
CO3: Analyzing and interpret phenomena related to wave optics, such as interference, diffraction,
and the behavior of light in various optical systems including thin films, diffraction gratings,
and Newton's rings.
CO4: Evaluating theoretical concepts and mathematical techniques such as Fermi's golden rule and
density of states to Analyzing and solve problems related to semiconductor physics and
optical phenomena
COURSE CONTENTS
UNIT-I [9 SESSIONS]

Wave Mechanics: Wave particle duality, de-Broglie matter waves, Phase and Group velocities,
Time-dependent and time- independent Schrodinger wave equation, Solution to stationary state
Schrodinger wave equation for one- Dimensional particle in a box, Compton effect.
UNIT-II [9 SESSIONS]

Wave Optics: Coherent sources, Interference in uniform and wedge-shaped thin films, Necessity
of extended sources, Newton’s Rings and its applications. Fraunhofer diffraction at single slit,
Diffraction grating, Spectra with grating, Dispersive power, resolving power of grating,
Rayleigh’s criterion of resolution, and Resolving power of grating.
UNIT-III [9 SESSIONS]

Fiber Optics and Holography: Fundamental ideas about optical fiber, Propagation mechanism,
Acceptance angle and cone, Numerical aperture, Single and Multi-Mode Fibers. Holography:
Basic Principle of Holography, Construction and reconstruction of Image on hologram and
applications of holography.
UNIT-IV [9 SESSIONS]

Energy Band and Charge Carriers: Energy bands in semiconductors, Types of

semiconductors, Charge carriers, Intrinsic and extrinsic materials. Carrier concentration: Fermi
Level, Electron and hole concentration equilibrium, Temperature dependence of carrier
concentration, Conductivity and mobility, Effect of temperature.
UNIT-V [9 SESSIONS]

Semiconductors: Intrinsic and extrinsic semiconductors, Carrier generation and recombination,

Carrier transport: diffusion and drift, Einstein relation, Continuity equation, Metal-semiconductor
junction (Ohmic and Schottky), Joint density of states, Density of states for photons, Transition
rates (Fermi's golden rule), Photovoltaic effect, and Hall effect.
Text Books
1. Concepts of Modern Physics - Aurthur Beiser, Medtech science, 2024.

2. Optics –Ajoy Ghatak, Tata McGraw Hill Education Private Ltd. New Delhi, 2008.
3. Solid State Physics - by C. Kittel, 7th edition, Wiley, 2019.
Reference Books

1. Optical Fibre & Laser - Anuradha De. New Age, 2009.

2. Applied Physics for Engineers, Dr. P.K. Diwan, Wiley, 2014.

COURSE CODE COURSE TITLE L T P C

PROBLEM SOLVING AND

CSE 111 3 0 0 3
PROGRAMMING USING C
Course Outcome
CO1: Remembering the datatypes, operators & expressions.
CO2: Understanding the control statements and data structures to implement the
algorithms.
 CO3: Applying techniques to decompose a problem into modules and use functions to
implement the modules.
CO4: Analyzing the concept of arrays, pointers, and structures.
CO5: Evaluating the methods to develop applications using file I/O.
COURSE CONTENTS
UNIT-I [9 SESSIONS]

Introduction: Introduction to Programming, Idea of Algorithm, Representation of Algorithm,

Flowchart, from algorithms to programs, source code. Basics of C: Background, Structure of a C
Program, Data types, Tokens, Operators and Expressions- Evaluating Expressions, Precedence
and Associativity of Operators, Type Conversions, Input and Output Functions.
UNIT-II [9 SESSIONS]
Control Statements: Conditional Execution -Selection Statements, Conditional Operator, Switch
statement. Iteration Execution - while Construct, for Construct, do-while Construct, goto Statement,
Special Control Statements, Nested Loops. Arrays: One-Dimensional Arrays-Declaration, Initialization,
internal representation. Multidimensional Arrays.
UNIT-III [9 SESSIONS]

Strings: Strings: One-dimensional Character Arrays, Arrays of Strings: Two-dimensional

Character Array- Functions: Concept, Uses, Prototype, Declaration, Parameter passing
techniques, Passing Arrays to Functions, Storage Classes, and Recursion.
UNIT-IV [9 SESSIONS]

Search and Sorting: Searching algorithms-linear, binary .sorting algorithms-bubble sort,

selection sort. Pointers: Declaring a Pointer, Initializing Pointers, Indirection Operator and
Dereferencing, Arrays and Pointers, Pointers and Strings, Pointers to Pointers, Array of Pointers,
Pointers To an Array, Two-dimensional Arrays and Pointers, Pointers to Functions and Dynamic
Memory Allocation.
UNIT-V [9 SESSIONS]
User defined Data types: Structures- Declaring Structures and Structure Variables, Accessing
the Members of a Structure, Initialization of Structures, Typedef, Nesting of Structures, Arrays
and Structures, Structures and Pointers, Structures and Functions, Union, Enumeration Types.
Files: Using Files in C, Declaration of File Pointer, Working with Text Files, Character Input
and Output, Working with Binary Files, Sequential Versus Random File Access, File Record.
Text Books
1. Pradip Dey and Manas Ghosh “Programming in C 2/e”, 2nd Edition Oxford University
 Press, 2012.
2. B. W. Kernighan and D.M. Ritchie, "The 'C' Programming Language” Prentice Hall
India, 2nd Edition. 1990.
Reference Books
1. B.A.Forouzan and R.F. Gilberg “A Structured Programming Approach in C”,
Cengage Learning, 2007.
2. Byron Gottfried, “Schaum’s Outline of Programming with C”, McGraw- Hill, 1996.
3. E. Balaguruswamy, “Programming in ANSI C”, Tata McGraw-Hill.

COURSE CODE COURSE TITLE L T P C

PROBLEM SOLVING AND

CSE 171 0 0 2 1
PROGRAMMING USING C LAB
Course Outcome
CO1: Remembering the programming environments and flowchart tools.
CO2: Understanding the computational problems using conditional and iterative
structures.
CO3: Applying the techniques for manipulating arrays, strings, and implementing sorting
 and searching algorithms.
CO4: Analyzing the use of pointers, structures, and performing dynamic memory
allocation.
CO5: Evaluating the applications that incorporate file handling operations.
COURSE CONTENTS
Ex. No List Of Experiments
1. Familiarization with programming environment.
2. Draw flowcharts using Raptor or Drakon Tool.
3. Simple computational problems using arithmetic expressions.
4. Problems involving if-then-else structures.
5. Iterative problems e.g., sum of series, generating patterns.
6. Iterative and Recursive functions.
7. 1D Arrays, 2D arrays and strings.
8. Sorting and Searching, Matrix problems.
9. Pointers and structures.
10. Dynamic memory allocation.
11. File Handling.
Text Books

1. Pradip Dey and Manas Ghosh “Programming in C 2/e”, 2nd Edition, Oxford University
Press, 2012.

2. B. W. Kernighan and D.M. Ritchie, "The 'C' Programming Language”, 2nd Edition.
Prentice Hall India, 1990.
Reference Books

1. B.A.Forouzan and R.F. Gilberg, “A Structured Programming Approach in C”, Cengage

Learning, 2007.

2. E. Balaguruswamy, “Programming in ANSI C”, Tata McGraw-Hill.

COURSE CODE COURSE TITLE L T P C

EVS 101 ENVIRONMENTAL SCIENCE 3 0 0 3

Course Outcome
CO1: Understanding about environment and its components and problems associated with
natural resources and their sustainable use.
CO2: Describing Chemical Toxicity of the chemicals in the environment and Sources of
pollution in air, water and soil and Solid Waste Management and Natural Disaster
Management.
 CO3: Analyzing about social issues.
CO4: Applying the role of Information Technology to address environmental issues.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Environment & Natural Resources: Definition, scope, importance, need for public awareness,
Environmental Management Systems its objectives, components, EIA, Natural Resources –
forest resources – use, exploitation, deforestation, construction of multipurpose dams – effect on
forests, Water resources – use of surface and subsurface water; effect of floods, drought, water
conflicts, Mineral resources – Use and exploitation, environmental effects of extracting and
using mineral resources, Food resources – food problems, advantage and disadvantage of
fertilizers & pesticides, effect on environment, Energy resources – need to develop renewable
energy, land resources – Land degradation, landslides, soil erosion, desertification & case
studies.
UNIT-II [9 SESSIONS]
Chemical Toxicology: Toxic chemicals in the environment, Impact of toxic chemicals on
enzymes, biochemical effects of arsenic, cadmium, lead, chromium, mercury, biochemical
effects of pesticide.
UNIT-III [9 SESSIONS]

Environmental Pollution Definition – Causes, pollution effects and control measures of Air,
Water, Soil, Marine, Noise, Thermal, Nuclear hazards. Solid waste management: causes, effects
and control measures of urban and industrial wastes, pollution measures, case studies, Disaster
management: floods, earthquake, cyclone and landslides
UNIT-IV [9 SESSIONS]

Social Issues, Human Population And The Environment: Urban problems related to energy
& sustainable development, water conservation, problems related to rehabilitation – case studies,
Consumerism and waste products - Environment Protection Act, Air, Water, Wildlife, Forest
Conservation Act, Environmental legislation and public awareness. Population growth, variation
among nations, Population explosion, Environment and human health, Value Education, Women
and Child Welfare, Role of Information Technology – Visit to local polluted site /Case Studies.
UNIT-V [9 SESSIONS]
Green Chemistry: Introduction, Basic principles of green technology, concept of Atom
economy, Tools of Green technology, zero waste technology.
Text Books
 1. Anubha Kaushik, C P Kaushik, “Perspectives in Environmental Studies”, New Age
International Publishers, 2006.

2. S.K. Kataria and Sons. Erach Bharucha, “Text Book of Environmental

Studies”, Orient Blackswan Pvt Ltd, 2021

3. R. Rajagopalan, “Environmental Studies”, Oxford University Press, 2015

Reference Books

1. Benny Joseph, “Environmental Studies”, 3rd Edition, Tata McGraw Hill Education
Private Limited, 2017

2. Anindita Basak, “Environmental Studies”, Pearson Education, 2009

3. William P. Cunningham & Mary Ann Cunningham, “Principles of Environmental
Science (Inquiry and Applications)”, 9th Edition, Tata McGraw Hill Education
Private Limited, 2019

COURSE CODE COURSE TITLE L T P C

MEE 101 BASIC MECHANICAL ENGINEERING 3 0 0 3

Course Outcome
CO1: Understanding stress, strain, Hooke’s law, and their application in analyzing
structures.
CO2: Describing Understanding of measurement systems, types of errors, and calibration
techniques.
CO3: Analyzing knowledge of metal forming, joining, and casting processes.
CO4: Evaluating proficiency in Applying theoretical and practical skills to solve problems
 and make decisions in engineering contexts.
COURSE CONTENTS
UNIT-I [9 SESSIONS]

Introduction to Strength of Materials: Normal and shear Stress, strain, Hooke’s law, Poisson’s
ratio, elastic constants and their relationship, stress- strain diagram for ductile and brittle
materials, factor of safety. Basic Numerical problems. Types of beams under various loads, Shear
force and bending in beams.
UNIT-II [9 SESSIONS]

Introduction to IC Engines: IC Engine: Basic Components, Construction and Working of Two

stroke and four stroke SI & CI engine, merits and demerits, scavenging process; Introduction to
electric, and hybrid electric vehicles.
UNIT-III [9 SESSIONS]

Introduction to Manufacturing Processes: Metal forming processes: Rolling, forging,

drawing, extrusion and sheet metal operations fundamentals only. Metal Joining processes:
Welding, arc and gas welding, Soldering and Brazing. Casting process: Patterns -Molding tools,
Types of molding, Preparation of green sand mold Operation of Cupola furnace.
UNIT-IV [9 SESSIONS]

Measurements and Control System: Concept of Measurement, Error in measurements,

Calibration, measurements of pressure, temperature, mass flow rate, strain, force and torques;
Concept of accuracy, precision and resolution, System of Geometric Limit, Fit, Tolerance and
gauges.
UNIT-V [9 SESSIONS]
Introduction to Materials: Classification, structure, general properties and applications of Cast
Iron, Steel, brass, Bronze, bearing metals, light metal alloys. Material properties like strength,
hardness, toughness, ductility, brittleness etc. and their importance in manufacturing.
Text Books

1. G Shanmugam, S Ravindran, Basic Mechanical Engineering, 4th Edition, McGraw Hill,

2022
2. M.P. Poonia and S.C. Sharma, Basic Mechanical Engineering, Khanna Publishing House,
2023
Reference Books

1. Nitaigour Mahalik, Mechatronics: Principles, Concepts and Applications, McGraw Hill,

 2017
2. K.P. Ramachandran, G.K. Vijayaraghavan, M.S. Balasundaram, Mechatronics, as per
AICTE: Integrated Mechanical Electronic Systems, Wiley India, 2019
3. Dr. D. S. Kumar, Mechanical Measurements & Control, Metropolitan Book Co. Pvt. Ltd,
2015

COURSE CODE COURSE TITLE L T P C

MEE 153 ENGINEERING GRAPHICS LAB 0 0 2 1

Course Outcome
CO1: Understanding principles and significance of engineering graphics, mastering usage
of drawing instruments, lettering, and scales.
CO2: Describing principles of orthographic projections, including conventions and
projections of points, lines, and planes inclined to both planes.
CO3: Analyzing project sections inclined to both planes, create auxiliary views, and
 Applying annotation, dimensioning, and scaling techniques.
CO4: Evaluating regular solids and developing surfaces of right regular solids like prism,
cylinder, pyramid, and cone.
COURSE CONTENTS
Exp. No Name of Experiments

1. To draw the letters (uppercase, lowercase, and numerals) as per engineering

drawing standards

2. To construct plain and diagonal scales to represent dimensions accurately on

reduced or enlarged scales.

3. To draw orthographic projections of points and lines inclined to both the horizontal
and vertical planes.

4. To create projections of planes inclined to both principal planes using auxiliary

planes.

5. To draw sectional views of regular solids (prism, cylinder, pyramid, cone) to

understand their internal details.

6. To develop the surfaces of right regular solids (prism, pyramid, cylinder, and cone)
to create 2D patterns for 3D objects.

7. To construct isometric views of simple and compound solids using an isometric

scale.

8. To convert isometric views into orthographic projections and vice versa.

9. To develop auxiliary views of objects inclined to both planes and apply simple
annotation and dimensioning techniques.

10. To draw a detailed floor plan including windows, doors, and fixtures (WC, sink,
shower, etc.) using appropriate scales and conventions.
Text Books

1. Bhatt N.D., Panchal V.M. & Ingle P.R., Engineering Drawing, Charotar Publishing
House.
2. Shah, M.B. & Rana B.C., Engineering Drawing and Computer Graphics, Pearson
Education.
Reference Books
1. Agrawal B. & Agrawal C.M., Engineering Graphics, McGraw Publication.

2. A.P. Gautam & Pradeep Jain, Engineering Graphics & Design Khanna Publishing
 House.

3. Narayana, K.L. & P Kannaiah, Text book on Engineering Drawing, Scitech Publishers.

COURSE CODE COURSE TITLE L T P C

CCS 101 COMMUNICATION SKILLS 2 0 0 2

Course Outcome
CO1: Remembering to increase the student’s ability to improve and utilize the skills
necessary to be a competent communicator.
CO2: Understanding the students’ linguistic understanding of their own communication
behavior.
 CO3: Applying improved communication skills in both social and professional contexts.
CO4: Analyzing non-verbal communication and body language, and assess their impact on
interpersonal interactions, interviews, group discussions, and presentations.
CO5: Evaluating language proficiency to enhance the employability of budding engineers
and technologists.
COURSE CONTENTS
UNIT-I [6 SESSIONS]
COMMUNICATION SKILL: Introduction to Communication, The Process of Communication,
Barriers to Communication, Listening Skills, Writing Skills, Technical Writing, Letter Writing,
Job Application, Report Writing, Non-verbal Communication and Body Language, Interview
Skills, Group Discussion, Presentation Skills, and Technology-based Communication.
UNIT-II [6 SESSIONS]
CRITICAL THINKING & PROBLEM SOLVING: Creativity, Lateral thinking, Critical thinking,
Multiple Intelligence, Problem Solving, Six thinking hats Mind Mapping & Analytical Thinking.
UNIT-III [6 SESSIONS]
TEAMWORK: Groups, Teams, Group Vs Teams, Team formation process, Stages of Group,
Group Dynamics, Managing Team Performance & Team Conflicts.
UNIT-IV [6 SESSIONS]
ETHICS, MORAL & PROFESSIONAL VALUES: Human Values, Civic Rights, Engineering
Ethics, Engineering as Social Experimentation, Environmental Ethics, Global Issues, Code of
Ethics like ASME, ASCE, IEEE.
UNIT-V [6 SESSIONS]
LEADERSHIP SKILLS: Leadership, Levels of Leadership, Making of a leader, Types of
leadership, Transactions Vs Transformational Leadership, VUCA Leaders, DART Leadership,
Leadership Grid & leadership Formulation.
Text Books

1. Barun K. Mitra; “Personality Development & Soft Skills”, First Edition; Oxford
2. Kalyana; “Soft Skill for Managers”; First Edition; Wiley Publishing Ltd.
Reference Books
1. Larry James “The First Book of Life Skills”; First Edition; Embassy Books.
 COURSE CODE COURSE TITLE L T P C
CCS 151 COMMUNICATION SKILL LAB 0 0 2 1
Course Outcome
CO1: Remembering to improve listening comprehension through diverse audio materials.
CO2: Understanding and practicing correct pronunciation using the International Phonetic
Alphabet (IPA) and intonation techniques.
CO3: Applying enhanced reading skills with various text types and purposes.
CO4: Analyzing and developing effective conversation skills for formal and informal
settings.
CO5: Evaluating and creating impactful oral presentations with effective body language.
COURSE CONTENTS
Ex. No List Of Experiments
]
1. Listening and Comprehension Activities – Listening to selected lectures, seminars, news
1 (BBC, CNN, etc.). Writing a brief summary or answering questions on the material

listened to.
2. Practicing correct Pronunciation through IPA, Stress, Intonation, Rhythm
3. Reading Activities —Reading different types of texts for different purposes with focus
on the sound structure and intonation patterns of English. Emphasis on correct
pronunciation.
4. Conversation Activities— Effective Conversation Skills; Formal/Informal Conversation;
Addressing higher officials, colleagues, subordinates, a public gathering; Participating in
a video conference.
5. Making an Oral Presentation–Planning and preparing a model presentation; Organizing
the presentation to suit the audience and context; Connecting with the audience during
presentation; Projecting a positive image while speaking; Emphasis on effective body
language.
6. Making a Power Point Presentation — Structure and format; Covering elements of an
effective presentation; Body language dynamics.
7. Making a Speech — Basics of public speaking; Preparing for a speech; Features of a
good speech; Speaking with a microphone. Famous speeches may be played as model
speeches for learning the art of public speaking. Some suggested speeches: Barack
Obama, John F Kennedy, Nelson Mandela, Mahatma Gandhi, Jawahar Lal Nehru, Atal
Bihari Vajpayee, Subhash Chandra Bose, Winston Churchil Martin Luther King Jr.
8. Participating in a Group Discussion — Structure and dynamics of a GD; Techniques of
effective participation in group discussion; Preparing for group discussion; Accepting
others’ views / ideas; Arguing against others’ views or ideas, etc.
9. Participating in Mock Interviews — Job Interviews: purpose and process; How to
prepare for an interview; Language and style to be used in an interview; Types of
interview questions and how to answer them.
10. Interview through telephone/videoconferencing.
11. Extempore, Story Telling, Poetry Recitation.
12. Mock Situations and Role Play; Enacting a short skit.
13. Debate (Developing an Argument), News Reading and Anchoring.
Text Books
1. Anna Dept. Of English. Mindscapes: English for Technologists & Engineers PB. New
Delhi: Orient Blackswan.
2. Farhathullah, T. M. Communication Skills for Technical Students. Orient Blackswan,
2002. References Books:
3. Khera, Shiv. You Can Win. New York: Macmillan.
Reference Books
1. Patnaik, Priyadarshi. Group Discussion and Interview Skills: With VCD. Cambridge
University Press India (Foundation Books), 2012 edition.
2. Kaul, Asha. Business Communication. PHI Learning: 2009.
3. Hartman and Lemay. Presentation Success: A Step-by-Step Approach. Thomson
Learning, 2000.
 SECOND
SEMESTER

COURSE CODE COURSE TITLE L T P C

DIFFERENTIAL EQUATIONS AND

MAT 104 3 1 0 4
NUMERICAL METHODS
Course Outcome
CO1: Remembering how to calculate the solutions of first-order linear differential
equations.
CO2: Understanding how to calculate the solutions of higher-order linear differential
equations.
CO3: Applying techniques to solve algebraic, transcendental, and systems of equations.
CO4: Analyzing and applying interpolation and numerical differentiation techniques for
 given data.
CO5: Evaluating the convergence and divergence of infinite series.
COURSE CONTENTS
UNIT-I [12 SESSIONS]
Differential Equations of First Order: Exact Differential Equations, Equations Reducible to
Exact Equations, Linear Equations, Bernoulli’s Equations, Riccati’s and Clairaut’s Equations,
Orthogonal trajectories, Rate of decay of radio-active materials.
UNIT-II [12 SESSIONS]
Higher Order Linear Differential Equations: Higher order linear differential equations with
constant coefficients, rules for finding Complementary function, Particular Integral and General
solution. Method of Variation of Parameters, solution of Cauchy- Euler equation. LR and LCR
circuits.
UNIT-III [12 SESSIONS]
Numerical solution of equations: Numerical solutions of algebraic and transcendental
equations by Bisection method, Regula-falsi method and Newton-Raphson’s method, Solution
of system of linear equations by LU decomposition methods, Crout’s method, Jacobi’s method,
Gauss Seidel method.
UNIT-IV [12 SESSIONS]
Interpolation and Numerical Differentiation: Forward, Backward and Central differences,
Newton's forward and backward interpolation formulae, Gauss's forward and backward
interpolation formulae, Lagrange’s interpolation, Numerical differentiation at the tabulated
points with forward, backward and central differences.
UNIT-V [12 SESSIONS]
Infinite Series: Convergence of sequence and series. Series of positive terms, Necessary
condition for convergence, Comparison tests, limit form comparison test, D’Alembert’s Ratio
test, Raabe’s test, Cauchy’s root test, Alternating series, Leibnitz’s rule, absolutely and
conditionally convergence.
Text Books
1. B.S. Grewal, “Higher Engineering Mathematics”, 44th Edition, Khanna Publishers, 2017.
2. Erwin Kreyszig, “Advanced Engineering Mathematics”, 10th Edition, John Wiley & Sons,
2011.
3. M.K. Jain, S.R.K Iyengar and R.K. Jain, “Numerical Methods for Scientific and
Engineering and Computation”, New age International Publications, 2008.
Reference Books
1. R.K.Jain, S.R.K. Iyengar, “Advanced Engineering Mathematics”, 5th edition, Narosa
Publications, 2016.
2. Ramana B.V, “Higher Engineering Mathematics”, 11th Reprint, Tata McGraw Hill New
Delhi, 2010.
3. A.R.Vasishtha and R.K.Guptha, “Integral Transforms”, Reprint, Krishna’s Educational
Publishers, 2014.

COURSE CODE COURSE TITLE L T P C

CHY 101 ENGINEERING CHEMISTRY 3 0 0 3

Course Outcome

Understanding the principles and applications of molecular orbital theory, including

CO1:
its relevance to diatomic molecules, band theory of solids, and nano- materials.

Describing knowledge of polymers, including their basic concepts, synthesis

CO2: methods, and industrial applications, with a focus on conducting and biodegradable
polymers.

Analyzing the causes of corrosion, methods for prevention, and the properties and
CO3:
applications of cement, plaster of Paris, and lubricants.
CO4: Evaluating water hardness, its effects, and techniques for water softening, along with
 the application of the phase rule to water systems.
COURSE CONTENTS
UNIT-I [9 SESSIONS]

Molecular Orbital Theory: Molecular orbital theory and its applications to homo-nuclear
diatomic molecules- Band theory of solids. Liquid crystals and its applications. Point defects in
Solids. Structure and applications of Graphite and Fullerenes -Concepts of Nano-materials and
its applications.
UNIT-II [9 SESSIONS]

Polymers: Polymer, Basic concepts of polymer- Conducting and bio degradable polymers-
Preparations and applications of some industrially important polymers (Buna N, Buna S, Nylon
6, 6, Terylene, Bakelite). General methods of synthesis of oreganos-metallic compound
(Grignard Reagent).
UNIT-III [9 SESSIONS]

Corrosion: Corrosion, causes and its prevention, Cement: Setting and hardening of cement,
Applications of cement, Plaster of Paris. Lubricants- Classification, mechanism and
applications.
UNIT-IV [9 SESSIONS]

Hardness and Softening: Hardness of water, Disadvantage of hard water. Scale & sludge
formation- Techniques for water softening; Lime-soda, Zeolite, Ion exchange resin, Reverse
osmosis Phase Rule and its application to water system.
UNIT-V [9 SESSIONS]

Fuels And Biogas Fuels, Classification of fuels. Analysis of Coal - Determination of Calorific
values (bomb calorimeter) - Biogas Manufacturing process.
Text Books

1. Darrell Ebbing, Steven Gammon, “General Chemistry”, 10th edition, Cengage Learning,
2014

2. William R. Robinson, Jerome D. Odom, Henry Fuller Holtzclaw, “General Chemistry”,

9th Edition, Houghton Mifflin Harcourt Publishing Company, 2009

3. Arun Bahl, B. S. Bahl and G.D. Tuli, “Essential of Physical Chemistry”, 28th Edition, S.
Chand Publishing, 2020
Reference Books

1. T.W. Graham Solomons and Craig Fryhle, “Organic Chemistry”, 12th Edition, John
 Wiley and Sons, 2016

2. Julio De Paula, Peter Atkins, “Physical Chemistry”,12th Edition, Oxford University

Press, 2022

COURSE CODE COURSE TITLE L T P C

COMPUTER ORGANIZATION AND
CSE 205 3 0 0 3
ARCHITECTURE
Course Outcome
CO1: Understanding to perform computer arithmetic operations.
CO2: Describing control unit operations.
CO3: Applying memory organization that uses banks for different word size operations.
CO4: Analyzing the concept of cache mapping techniques.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Basic Structure of Computers: Functional Modules, Basic operational concepts, Bus structures, Types of
Buses & Bus Arbitration, Register, bus and memory transfer, Instruction and Instruction types, formats,
instruction cycles, stack organization and addressing modes.
UNIT-II [9 SESSIONS]

Arithmetic Module: Addition and subtraction of signed numbers – Design of fast adders,
Multiplication of positive numbers - Signed operand multiplication and fast multiplication,
Integer division, Floating point numbers and operations.
UNIT-III [9 SESSIONS]

Basic Processing Module: Fundamental concepts, Execution of a complete instruction, Multiple

bus organization, Hardwired control, Micro programmed control - Pipelining, Basic concepts,
Data hazards, Instruction hazards, Influence on Instruction sets, Data path and control
consideration.
UNIT-IV [9 SESSIONS]

Memory System: Basic concepts and hierarchy, Semiconductor RAMs, ROMs, Speed, size and
cost, Cache memories: Concept, address mapping, Performance consideration, Virtual memory:
concept implementation, Secondary storage.
UNIT-V [9 SESSIONS]

PLD, Memories and Logic Families: Accessing I/O devices, Interrupts, Direct Memory Access,
Buses, Interface circuits, Standard I/O Interfaces (PCI, SCSI, USB).
Text Books
1. J. L Hennessy and D. A. Patterson, “Computer Architecture: A quantitative approach”,
3rd Edition, Sterling Book Centre, 2010
2. W. Stallings, “Computer organization and Architecture”, 11th Edition, Pearson, 2019

3. B. Parhami, “Computer Architecture: From Microprocessors to Supercomputers”,

Oxford University press, 2005
Reference Books
1. J. L Hennessy and D. A. Patterson, “Computer Architecture: A quantitative approach”,
3rd Edition, Sterling Book Centre, 2010
2. W. Stallings, “Computer organization and Architecture”, 11th Edition, Pearson, 2019
3. B. Parhami, “Computer Architecture: From Microprocessors to Supercomputers”,
Oxford University press, 2005
COURSE CODE COURSE TITLE L T P C

ELECTRICAL AND ELECTRONICS

EEE 102 3 0 0 3
ENGINEERING
Course Outcome

Understanding DC circuit analysis and network theorems, including Kirchhoff's laws,

CO1: network concepts, and the application of the superposition, Thevenin's, Norton's, and
maximum power transfer theorems.

Describing single-phase AC circuits, including sinusoidal waveforms, phasor representation,

CO2:
power calculations, power factor, and resonance phenomena.

Analyzing the principles of three-phase AC circuits, including balanced systems, phase

CO3:
sequences, voltage/current relationships, and power measurement techniques.

Evaluating knowledge of semiconductor physics and diode characteristics, including PN

CO4:
junction behavior, types of diodes, and their applications.
COURSE CONTENTS
UNIT-I [9 SESSIONS]

D C circuit analysis and network theorems Circuit Concepts: Concepts 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, source transformation.
Kirchhoff’s laws; loop and nodal methods of analysis; star-delta transformation; Network
Theorems: Superposition Theorem, Thevenin’s Theorem, Norton’s Theorem, Maximum Power
Transfer Theorem (simple numerical problems).
UNIT-II [9 SESSIONS]

Steady- State Analysis of Single-Phase AC Circuits AC Fundamentals: Sinusoidal, square

and triangular waveforms – average and effective values, form and peak factors, concept of
phasor, phasor representation of sinusoidally varying voltage and current. Analysis of series,
parallel and series-parallel RLC Circuits: apparent, active & reactive powers, power factor,
causes and problems of low power factor, power factor improvement; resonance in series and
parallel circuits, bandwidth and quality factor (simple numerical problems).
UNIT-III [9 SESSIONS]

Three Phase AC Circuits: Three phase system-its necessity and advantages, meaning of phase
sequence, star and delta connections, balanced supply and balanced load, line and phase
voltage/current relations, three- phase power and its measurement (simple numerical problems).
Measuring Instruments: Types of instruments, construction and working principles of PMMC
and moving iron type voltmeters and ammeters, single phase dynamometer wattmeter and
induction type energy meter, use of shunts and multipliers (simple numerical problems on energy
meter, shunts and multipliers).
UNIT-IV [9 SESSIONS]
Semi-Conductors And Diodes: Introduction, Insulators, semiconductors and metals, Mobility
and conductivity, Intrinsic and Extrinsic semiconductors, Charge density, current components in
semiconductors, Continuity Equation, PN junction diode- Characteristics and analysis, Types of
diodes- Zener, Photodiodes, LED, Varactor diode, tunnel diodes.
UNIT-V [9 SESSIONS]

Diode Applications: Rectifiers and filter circuit: Half wave rectifier, Full wave rectifier, bridge
rectifier and their analysis, L,C and Pi filters, Series and shunt diode clippers, Clipping at two
independent levels, Clamping operation , Clamping circuit, Practical clamping circuits, Basic
regulator supply using zener diode.
Text Books
1. Millman & Halkias, “Electronic Devices & Circuits”. Tata McGraw Hill Education, 2007

2. R. Boylestad, “Electronics Devices and Circuit Theory”, 6th Edition, Prentice-Hall

international editions, 1996
Reference Books

1. A.P. Godre & U.A. Bakshi, “Electronics Devices and Circuits-II”, 1st Edition, Technical
Publications, 2015
2. G.K. Mithal, “Electronics Devices and Circuit”, 23rdb Edition, Khanna Publishers, 1988

COURSE CODE COURSE TITLE L T P C

CHY 151 ENGINEERING CHEMISTRY LAB 0 0 2 1

Course Outcome
Understanding analytical techniques for determining the alkalinity, hardness,
CO1:
chlorine content, chloride content, and iron content in water and chemical samples.

Describing pH-metric titrations and viscosity measurements using appropriate

CO2:
laboratory equipment and techniques.

Analyzing skills in qualitative analysis, including element detection and functional

CO3:
group identification in inorganic compounds.

Evaluating principles and procedures involved in the preparation of synthetic resins

CO4:
such as Bakelite and urea-formaldehyde.
COURSE CONTENTS
Ex.No List of Experiments
 1. Determination of alkalinity in the given water sample.
2. Determination of temporary and permanent hardness in water sample using EDTA.
3. Determination of available chlorine in bleaching powder.
4. Determination of chloride content in water sample.
5. Determination of iron content in the given solution by Mohr’s method. PH- metric
titration.
6. Viscosity of an addition polymer like polyester by viscometer.
7. Element detection and functional group identification in organic compounds.
8. Preparation of Bakelite and Urea formaldehyde resin.
Text Books

1. Millman & Halkias, “Electronic Devices & Circuits”, Tata McGraw Hill Education, 2007

2. R. Boylestad, “Electronics Devices and Circuit Theory”, 6th Edition, Prentice-Hall

international editions, 1996
Reference Books

1. A.P. Godre & U.A. Bakshi, “Electronics Devices and Circuits-II”, 1st Edition, Technical
Publications, 2015.
2. G.K. Mithal, “Electronics Devices and Circuit”, 23rdb Edition, Khanna Publishers, 1988
COURSE CODE COURSE TITLE L T P C

OBJECT ORIENTED PROGRAMMING

CSE 209 3 1 0 4
WITH C++
Course Outcome
CO1: Understanding the relative merits of object-oriented programming language.
CO2: Describing how to produce object-oriented software using C++.

Applying how to apply the major object-oriented concepts to implement object- oriented
CO3:
programs, encapsulation, inheritance and polymorphism.

Evaluating advanced features of C++ specifically stream I/O, templates and operator
CO4:
overloading.
COURSE CONTENTS
UNIT-I [12 SESSIONS]

Introduction: The meaning of Object Orientation, object identity, Encapsulation, information

hiding, polymorphism, Procedural language v/s OOP language, Review of C, Object oriented
language features, Characteristics of Object-Oriented Languages, Applications of Object-
Oriented Programming.
UNIT-II [12 SESSIONS]

Basic Structural Modeling: Classes, relationships, common mechanisms and diagrams. Class&
Object Diagrams: Terms, concepts, modeling techniques for Class & Object Diagrams. Classes
and Objects: Abstract data types, Object & classes, attributes, methods, C++ class declaration,
State identity and behavior of an object, Constructors and destructors, instantiation of objects,
Default parameter value, Copy Constructor, Static Class Data, Constant and Classes, C++
garbage collection, dynamic memory allocation, function name overloading, Overriding, New
and delete operator.
UNIT-III [12 SESSIONS]

Inheritance and Polymorphism: Inheritance, Types of Inheritance, Class hierarchy, derivation,

public, private & protected, Aggregation, composition vs classification hierarchies,
Polymorphism, Type of Polymorphism, Compile time and runtime, Method polymorphism,
Polymorphism by parameter, Operator overloading, Parametric polymorphism, Generic function,
Inheritance methods Adjustment of inheritance, passing arguments to methods, Implementing
inheritance, associations encapsulation. Object oriented programming style: reusability,
Comparison between Structures and Classes.
UNIT-IV [12 SESSIONS]

Files and Exception Handling: Persistent objects, Streams and files, Namespaces, Exception
handling, Input Class Streams, ostream, istream Library: Overview of Standard Template
Library, Containers, Introduction, Pure Virtual Function, Virtual Function in Derived Classes,
friend classes and function.
UNIT-V [12 SESSIONS]

Java Concepts: History, Features, Object Oriented concept of Java, Classes and Objects,
Inheritance, Packages, Interface, abstract method and classes.
Text Books
1. A.K. Sharma, “Object Oriented Programming using C++”, 1st Edition, Pearson, 2014
2. S. B. Lippman & J. Lajoie, “C++ Primer”, 5th Edition, Addison Wesley, 2012
3. R. Lafore, “Object Oriented Programming using C++”, 3rd Edition, Galgotia Publications
Pvt Ltd, 1999
Reference Books
1. Benjamin, Cummings. E. Balaguruswamy, “Objected Oriented Programming with C++”, 8 th
 Edition, McGraw Hill Education, 2020
2. Booch “Object Oriented Design & Applications”, 3rd Edition, Addison Wesley, 2007

COURSE CODE COURSE TITLE L T P C

OBJECT ORIENTED PROGRAMMING

CSE 251 0 0 2 1
WITH C++ LAB
Course Outcome

Understanding and implement various control structures in C++ such as if statements, switch
CO1:
case statements, and loops.

CO2: Describing proficiency in using structures, unions, and functions in C++ programs.

Analyzing the concept of recursion and different function call mechanisms including call by
CO3:
reference and call by value.

CO4: Evaluating storage specifiers and their applications in C++ programming.

COURSE CONTENTS
Ep.No List of Experiments
 1. Write C++ programs to implement various control structures.
a) If statement
b) Switch case statement and do while loop
c) For loop
d) While loop
2. Write C++ programs to understand structure & unions.
a) Structure
b) Union
3. Write C++ programs to implement functions & recursion
4. Write C++ programs to understand different function call mechanism. ( Call by
reference & Call by Value)
5. Write C++ programs to understand storage specifiers.
6. Write C++ programs for constructors & destructors.
7. Write C++ programs to implement inheritance and function overriding.
a) Multiple Inheritance, Access Specifiers.
b) Hierarchical Inheritance, Function Overriding /Virtual Function
8. Write C++ programs to overload unary & binary operators as member function
&non-member function
Text Books
1. A.K. Sharma, “Object Oriented Programming using C++
2. S. B. Lippman & J. Lajoie, “C++ Primer”, Addison Wesley.
3. R. Lafore, “Object Oriented Programming using C++”, Galgotia
Reference Books
1. C++ How to Program" by Paul Deitel and Harvey Deitel
2. Programming: Principles and Practice Using C++" by Bjarne Stroustrup
COURSE CODE COURSE TITLE L T P C
ELECTRICAL and ELECTRONICS
EEE 152 0 0 2 1
ENGINEERING LAB
Course Outcome

Understanding fundamental laws and theorems in electrical circuits, including

CO1: Kirchhoff's laws, superposition theorem, Thevenin's theorem, and maximum power
transfer theorem.

Describing operation of various electronic components such as resistors, capacitors,

CO2:
diodes, and transistors.

Analyzing laboratory equipment used in electronics, including multimeters,

CO3:
oscilloscopes (CRO), function generators, and power supplies.

Evaluating practical knowledge of electronic circuits by studying characteristics and

CO4:
behaviors of components like PN junction diodes, rectifiers, and transistors.
COURSE CONTENTS [30
SESSION]
1. Verification of Kirchhoff’s laws.
1
2. To study and identify various electronic components as Resistor, Capacitor, Diode,

Transistor, etc.
3. To study various lab equipment’s – Multimeter, CRO, Function Generator, and Power

Supply.
4. Verification of (i) Superposition theorem (ii) Thevenin’s Theorem (iii) Maximum Power

Transfer Theorem.
5. To plot V-I characteristics of PN Junction Diode.

6. To study half wave full wave and bridge rectifier.

7. Measurement of power and power factor in a single phase ac series inductive circuit and

study improvement of power factor using capacitor.

8. Study of phenomenon of resonance in RLC series circuit and obtain resonant frequency.

9. To study of wave shaping circuit using clippers and clampers.

10. To study V-I Characteristics of Zener Diode.

11. To study transistor characteristics in CB/CE configurations.

12. To study input output characteristics of FET.

Text Books

1. Millman & Halkias, “Electronic Devices & Circuits”.

2. R. Boylestad, “Electronics Devices and Circuit Theory”, Prentice-Hall international

editions.
Reference Books

1. A.P. Godre & U.A. Bakshi, “Electronics Devices and Circuits-II”.

2. G.K. Mithal, “Electronics Devices and Circuit”, Khanna Publishers
COURSE CODE COURSE TITLE L T P C

VAC 102 GANDHIAN TECHNOLOGY 1 0 0 1

Course Outcome

Remembering the lifestyle and significance of M. K. Gandhi in the modern world and
CO1:
his contributions to peace and social justice.

Understanding Gandhian Thought as an academic discipline, including its principles

CO2:
of non-violence, truth, and self-reliance.

Applying Gandhian values in various walks of life to promote compassion, service,

CO3:
and ethical behavior.

Analyzing the significance of Gandhian Thought for academics and everyday life
CO4:
through workshops and related activities organized by the Gandhi Study Center.

Evaluating the relevance of Gandhian principles in addressing contemporary global

CO5:
challenges and fostering a culture of peace and sustainability.
COURSE CONTENTS
UNIT-I [15 SESSIONS]
Ethics in Gandhian Thought: Socio- Political and Economic Thoughts of Gandhiji, Gandhian
methods for Global Peace, Gandhian Development, Mahatma Gandhi's Perspectives on
Technology. Participating practical oriented activities done by GSC/
Technology-attributes/innovation/activities of Gandhian way of life styles/Gandhian economics,
Indian cottage industry and its improvement, Inclusive growth and through sustainable
development
Text Books
1. Gandhi, Gopal krishna, Mohandas Karamchand Gandhi: Restless as Mercury, My Life as a
Young Man, Aleph Book Company, 2021.
2. Beitzel, Terry and et al. Reflections on Mahatma Gandhi: The Global Perspectives, Rawat
Publications, India, 2021.
3. Gandhi, M.K. The story of my experiments with truth (an autobiography), Navajivan
Publishing House, 1927.
Reference Books
1. Awasthi, R.K. Technological Transformation and Relevance of Gandhi in Modern India,
IJSW online, Retrieved May 2022.
2. Talwar, Sushant. Mahatma and machines: Understanding Gandhi's thoughts on modern
technology, https://www.timesnownews.com/, 2019.
3. Kothari,L. S. Science and Technology in India: What Can We Learn From Gandhi?,
Source: International Seminar on Gandhi And The Twenty First Century, (January 30-
February 4, 1998) New Delhi- Wardha.
THIRD
 SEMESTER

COURSE CODE COURSE TITLE L T P C

CSE 221 DATA STRUCTURE USING C++ 3 0 0 3
Course Outcome
CO1: Remembering the basics of data structures, including classification into primitive and
composite data structures, and understanding the concept of time and space
complexity of algorithms.
CO2: Understanding the concepts and operations of arrays, stacks, and queues, along with
their applications in various scenarios such as infix, postfix, prefix expressions, and
recursion.
CO3: Applying knowledge of linked lists, trees, and binary search trees by performing
operations like insertion, deletion, and traversal, as well as exploring minimum
spanning trees and their algorithms.
CO4: Analyzing graph traversal techniques including depth-first search (DFS) and breadth-
first search (BFS), as well as understanding spanning trees, minimum-cost spanning
trees, and path algorithms like Warshall's and Dijkstra's.
CO5: Evaluating proficiency in searching and sorting algorithms such as sequential search,
binary search, and various internal sorting methods including insertion sort, selection
 sort, bubble sort, quicksort, merge sort, and heap sort.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Introductions: Data, Information, Introduction to Data Structure, Classification Data
Structure, Primitive and Composite Data Structure, Time and Space Complexity of Algorithms,
Introduction to Array & its operations, Asymptotic Notation.
UNIT-II [9 SESSIONS]

Stack and Queue: Introduction to Stack & Primitive Operation on Stack; Stacks Application:
Infix, Post Fix, Prefix and Recursion. Primitive Operations on the Queues, Circular Queue,
Dequeue, Priority Queue, Applications of Queue.
UNIT-III [9 SESSIONS]

Linked List and Trees: Singly Linked Lists, Operations on Linked Lists, Insertion and Deletion
of a Node, Introduction to Circularly Linked Lists and Doubly Linked Lists. Basic Terminology,
Binary Trees, Tree Representations as Array & Basic Operation on Binary Tree, Binary Search
Tree (BST), Insertion and Deletion in BST, Basic Operation on MST.
UNIT-IV [9 SESSIONS]

Graph Traversal: Depth First Search and Breadth First Search, Spanning Trees, Minimum
Cost Spanning Trees: Prims and Kruskal algorithm. Path algorithm: Warshal Algorithm and
Dijikstra Algorithm, Traversal of Binary Trees: In Order, Preorder & Post order; Application of
Binary Tree.
UNIT-V [9 SESSIONS]

Searching and Sorting: Sequential search, Binary Search, Comparison and Analysis Internal
Sorting: Insertion Sort, Selection, Bubble Sort, Quick Sort, Merge Sort, Heap Sort.
Text Books
1. Lipschutz & Lipson, “Data Structure using C, Tata McGraw-Hill, 2017
2. Tanenbaum, “Data Structures Using C, 1st Edition, Pearson education, 2003
3. G. S. Baluja, “Data Structure Through C, VISIONIAS, 2022
Reference Books

1. Hopcraft, Ullman, “The Design and Analysis of Computer Algorithms” Edition, Addison
Wesley, 2004

2. E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms", Second Edition,

Universities Press; 2008
 3. Berman, Paul,” Algorithms”, Cengage Learning, 2017
4. AhoRCT Lee, SS Tseng, RC Chang and YT Tsai, “Introduction to the Design and
Analysis of Algorithms”, Mc Graw Hill, 2012

COURSE CODE COURSE TITLE L T P C

CSE 212 DIGITAL ELECTRONICS 3 0 0 3
Course Outcome
CO1: Understanding and conducting experiments, analyze, interpret data and synthesize valid
conclusions.
CO2: Describing a system, component, or process, and synthesize solutions to achieve desired
needs.
CO3: Applying, formulating, research through relevant literature reviews, and solves engineering
problems reaching substantiated inclusions.
CO4: Evaluating memory organization principles, including static and dynamic RAM cells, large
memory construction using chips, associative memory, cache memory organization, and
virtual memory organization.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Logic gates and circuit: Gates (OR, AND, NOR, NAND, XOR & XNOR). De-Morgan’slaws,
Boolean laws, Circuit designing techniques (SOP, POS, K-Map).
UNIT-II [9 SESSIONS]
Combinational Building Blocks and Memory: Combinational Building Blocks: Multiplexes;
Decoder; Encoder; Adder and Subtractor. Memories: ROMs, PROMs, EPROMs, RAMs, Hard
Disk, Floppy Disk and CD-ROM.
UNIT-III [9 SESSIONS]

Sequential Building Blocks: Flip-Flop (RS, D, JK, Master-slave && T flip- flops); Registers &
Shift registers; Counters; Synchronous and Asynchronous Designing method.
UNIT-IV [9 SESSIONS]

Memory Organization: Basic cell of static and dynamic RAM: Building large memories using
chips, Associative memory, Cache memory organization and Virtual memory organization.
UNIT-V [9 SESSIONS]

Asynchronous Sequential Logic: Analysis procedure, circuit with latches, design procedure,
reduction of state and flow table, race Free State assignment, hazards.
Text Books
1. J. L Hennessy and D. A. Patterson, “Computer Architecture: A quantitative approach”,
3rd Edition, Sterling Book Centre, 2010
2. Floyd, “Digital fundamentals”, 10th Edition, Pearson Education, 2011
3. B. Parhami, “Computer Architecture: From Microprocessors to Supercomputers”,
Oxford University press, 2005
Reference Books

1. Malvino and Leach, “Digital Electronics”, 9th Edition, McGraw Hil, 2018

2. William Stallings, “Computer Organization and Architecture: Designing for

Performance”, 9th Edition, Pearson Education, 2013
3. Hamcher, Vranesic and Zaky, Computer Organization”, 6th Edition, MC Graw-Hill,
Signapore, 2012
COURSE CODE COURSE TITLE L T P C
CSE 214 DISCRETE MATHEMATICS 3 0 0 3
Course Outcome
CO1: Understanding simple mathematical proofs and possess the ability to verify them.
CO2: Applying substantial experience to comprehend formal logical arguments.
CO3: Evaluating mathematical properties formally via the formal language of propositional logic
and predicate logic.
CO4: Analyzing and manipulating basic mathematical objects such as sets, functions, and relations
and will also be able to verify simple mathematical properties.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Set Theory: Introduction, Combination of sets, Multi sets, ordered pairs, Set Identities.
Relations: Definition, Operations on relations, Properties of relations, Composite Relations,
Equality of relations, Order of relations.
Functions: Definition, Classification of functions, Operations on functions, Recursively defined
functions. Natural Numbers: Introduction, Mathematical Induction, Variants of Induction,
Induction with Non- Zero- Base cases
UNIT-II [9 SESSIONS]
Algebraic Structures: Definition, Groups, Subgroups and order, Cyclic Groups, Cosets,
Lagrange's theorem, Normal Subgroups, Permutation and Symmetric groups, Group
Homomorphism, Definition and elementary properties of Rings and Fields, Integers Modulo n.
UNIT-III [9 SESSIONS]

Partial order sets: Definition, Partial order sets, Combination of partial order sets, Hasse
diagram. Lattices: Definition, Properties of lattices–Bounded, Complemented, Modular and
Complete Lattice, Morphisms of lattices.

Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Algebraic

manipulation of Boolean expressions. Simplification of Boolean Functions, Karnaugh maps,
Logic gates, Digital circuits and Boolean algebra. Combinational and sequential Circuits
UNIT-IV [9 SESSIONS]

Propositional Logic: Proposition, well-formed formula, Truth tables, Tautology, Satisfiability,

Contradiction, Algebra of proposition, Theory of Inference, Natural Deduction.

Predicate Logic: First order predicate, well-formed formula of predicate, quantifiers, Inference
theory of predicate logic.
UNIT-V [9 SESSIONS]

Trees: Definition, Binary tree, Binary tree traversal, Binary search tree.

Graphs: Definition and terminology, Representation of graphs, Multigraphs, Bipartite graphs,

Planar graphs, Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian paths,
Graph coloring. Recurrence Relation & Generating function: Recursive definition of functions,
Recursive algorithms, Method of solving recurrences. Combinatory: Introduction, Counting
Techniques, Pigeonhole Principle.
Text Books
1. R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5th edition, Pearson Education,
2006
2. Biswal, “Discrete Mathematics and Graph Theory”, Third Edition, Prentice Hall India
Learning Private Limited, 2012
3. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 6th Edition,
Pearson Education India, 2015
Reference Books

1. Malvino and Leach, “Digital Electronics”, 9th Edition, McGraw Hil, 2018

2. William Stallings, “Computer Organization and Architecture: Designing for

 Performance”, 9th Edition, Pearson Education, 2013
3. Floyd, L.Thomas, “Digital fundamentals”, Eleventh Edition, Pearson, 2017

COURSE CODE COURSE TITLE L T P C

CSE 263 DATA STRUCTURE USING C++ LAB 0 0 2 1
Course Outcome
Remembering proficiency in fundamental algorithms and their applications in
CO1:
problem-solving.
CO2: Understanding how to construct and manage linear data structures effectively.
CO3: Applying knowledge to explore non-linear data structures and their uses.
CO4: Analyzing and applying graph algorithms for effective problem-solving.
Evaluating and enhancing algorithmic thinking and problem-solving skills in various
CO5:
contexts.
COURSE CONTENTS
Ex.No List Of Experiments
1. Sorting Algorithms-Non-Recursive.
2. Sorting Algorithms-Recursive.
3. Searching Algorithm.
4. Implementation of Stack using Array.
5. Implementation of Queue using Array.
6. Implementation of Circular Queue using Array.
 7. Implementation of Stack using Linked List.
8. Implementation of Queue using Linked List.
9. Implementation of Circular Queue using Linked List.
10. Implementation of Tree Structures, Binary Tree, Tree Traversal, Binary Search Tree,
Insertion and Deletion in BST.
11. Graph Implementation, BFS, DFS, Minimum cost spanning tree, shortest path
algorithm.
Text Books
1. Lipschutz & Lipson, “Data Structure using C, Tata McGraw-Hill, 2017
2. Tanenbaum, “Data Structures Using C, 1st Edition, Pearson education, 2003
3. G. S. Baluja, “Data Structure Through C, VISIONIAS, 2022
Reference Books

1. Hopcraft, Ullman, “The Design and Analysis of Computer Algorithms” Edition, Addison
Wesley, 2004

2. E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms", Second Edition,

Universities Press; 2008
3. Berman, Paul,” Algorithms”, Cengage Learning, 2017
COURSE CODE COURSE TITLE L T P C
CSE 206 OPERATING SYSTEMS 3 0 0 3
Course Outcome
CO1: Understanding the role of operating system as System software.

CO2: Describing the various algorithms and comment about performance of various algorithms
Used for management of memory, CPU scheduling, File handling and I/O operations
CO3: Applying various concepts related with Deadlock to solve problems related with Resources
Allocate on, after checking system in Safe state or not
CO4: Evaluating role of Process synchronization towards increasing throughput of system.

COURSE CONTENTS
UNIT-I [9 SESSIONS]
Introduction: Basic Elements, Functions and Types of Operating System, Serial Processing,
Multi- Programmed, Batch System, Time Sharing Systems, System Components, Operating
System Services, Interrupts, Interrupt Processing.
UNIT-II [9 SESSIONS]

Process management: Process Concepts, Process States, Process Control Block, Scheduling-
Criteria, Scheduling Algorithms and their Evaluation, Threads, Process synchronization:
Critical-Section Problem, Classic Problems of Synchronization.
UNIT-III [9 SESSIONS]
Memory management: Main Memory, Swapping, Contiguous Memory Allocation, Paging,
Structure of Page Table, Segmentation, Virtual Memory, Demand Paging, Page Replacement
Algorithms, Allocation of Frames, Thrashing.
UNIT-IV [9 SESSIONS]

Deadlock: System Model, Deadlock Characterization, Deadlock Prevention, Detection and

Avoidance, Recovery form Deadlock.
UNIT-V [9 SESSIONS]

Storage management: Mass-Storage Structure, Disk Structure, Disk Attachment, Disk

Scheduling, RAID Structure. File system interface: File Concept, Access Methods, Directory
Structure, File System Structure, Allocation Methods, and Free-Space Management.
Text Books
1. Operating System Concepts, Silberschatz, Ninth Edition, Willey Publication.
2. Operating Systems, Internals and Design Principles, Stallings, Seventh Edition, Pearson
Publication.
3. Modern Operating Systems, Tanenbaum, Fourth Edition. Pearson Publication
Reference Books

1. W. Stallings, “Operating System”, Prentice Hall of India. New Delhi.

2. Charles Crowley, “Operating Systems: A Design-Oriented Approach”, Tata McGraw Hill

Education”.
3. Stuart E. Madnick & John J. Donovan, “Operating Systems”, McGraw Hill Publications.
 COURSE CODE COURSE TITLE L T P C
CSE 252 OPERATING SYSTEMS LAB 0 0 2 1
Course Outcome
Understanding and compare the hardware and software requirements of different
CO1:
operating systems (UNIX, LINUX, WINDOWS XP, WINDOWS 7/8).
Describing proficiency in executing various UNIX system calls for process
CO2:
management, file management, and input/output operations.
Analyzing CPU scheduling policies including Shortest Job First (SJF), Priority,
CO3:
First-Come- First-Served (FCFS), and Multi-level Queue.
Evaluating file storage allocation techniques such as Contiguous (using array),
CO4:
Linked-List, and Indirect Allocation (indexing).
COURSE CONTENTS
List Of Experiments [30
Sessions]
1. Write a program to implement the FCFS(First Come First Served)
1
2. Write a program to implement the SJF(Shortest Job First)

3. Write a program to implement the Priority Scheduling

4. Write a program to implement the RR( Round Robin) Scheduling

 5. Write a program to implement the Sequential File Allocation

6. Write a program to implement the Indexed File Allocation

7. Write a program to the Simulate MVT(Multiprogramming Variable Task)

8. Write a program to implement the Banker’s Algorithm for Dead Lock Avoidance and

Dead Lock Prevention.

9. Write a program to implement the FIFO(First In First Out) Page Replacement

10. Write a program to implement the LRU(Least Recent Used) Page Replacement

11. Write a program to implement the Paging Memory Allocation Technique

12. Write a program to First Fit Memory Allocation Policy

Text Books
1. Operating System Concepts, Silberschatz, Ninth Edition, Willey Publication.
2. Operating Systems, Internals and Design Principles, Stallings, Seventh Edition, Pearson
Publication.
3. Modern Operating Systems, Tanenbaum, Fourth Edition. Pearson Publication
Reference Books

1. W. Stallings, “Operating System”, Prentice Hall of India. New Delhi.

2. Charles Crowley, “Operating Systems: A Design-Oriented Approach”, Tata McGraw Hill

Education”.
COURSE CODE COURSE TITLE L T P C
VAC 203 SWACHH BHARAT 1 0 0 1
Course Outcome
CO1: Remembering the understanding of rural life, culture, and social realities, including
the strong sense of community and traditional values that characterize Indian
villages.
CO2: Understanding the importance of empathy and building bonds of mutuality with local
communities, recognizing their contributions to social cohesion and cultural richness.
CO3: Applying knowledge to appreciate the significant contributions of local communities
to Indian society and economy, particularly in agriculture and cultural traditions.
CO4: Analyzing rural institutions and their roles in contributing to community socio-
economic improvements, including education, health services, and local governance.
CO5: Evaluating the opportunities provided by rural development programs, assessing
their effectiveness in enhancing the livelihoods and well-being of rural populations
COURSE CONTENTS
UNIT-I [3 SESSIONS]
“Responsibility of Cleanliness - Individual or Society” Project : An Initiative For Cleanliness
And Personal Hygiene Awareness Session On Hand Sanitization Benefits Of Hand washing
Cleanliness In Hospitals, Schools And Offices “Stop Complaining & Start Participating”
UNIT-II [3 SESSIONS]

Project: Awareness Sessions Street Play, Role Play- Poster Presentation- Short film
Presentation.
UNIT-III [3 SESSIONS]

Cleanliness in other sectors- Project: Cleanliness Session in Railway Station Cleanliness in

Hospitals, Schools and Offices.
UNIT-IV [3 SESSIONS]

Capacity Building and Public Awareness- Project: Community Mobilization Involving School
Children-Participation of Women SHG Members-Getting Doctors, teachers, local political and
religious leaders.
UNIT-V [3 SESSIONS]

Solid Waste Management-Project : Run To Clean Distribution Of Dustbin-Complete Disposal

And Reuse Of Liquid And Solid Wastes; Session On Waste Management & Plastic Awareness.
Text Books
1. Mridula Sinha & Dr.R.K.Sinha, Swachh Bharath – A Clean India
Reference Books
1."Community Health: A Handbook for Health Promotion" by Michael A. R.
Kearney
COURSE CODE COURSE TITLE L T P C
VAC 201 INDIAN CONSTITUTION 1 0 0 1
Course Outcome
CO1: Remembering the history and features of the Indian Constitution, including its
framing, significant acts, and foundational principles.
CO2: Understanding the realization of Fundamental Rights and Directive Principles of
State Policy and their significance in promoting justice and equality.
CO3: Analyzing challenges to India’s federal system and evaluating the roles of the
President and Prime Minister in governance.
CO4: Underlining the functions of the Legislature and Judiciary in the Union Government
and exploring their interrelations and checks on power.
CO5: Evaluating the evolution of local governments in India and assessing the role of the
Collector in district administration.
COURSE CONTENTS
UNIT-I [3 SESSIONS]
CONSTITUTIONAL HISTORY AND FRAMING OF INDIAN CONSTITUTION
East India Company rule (1757-1857): Social, Economic, Political and Administrative
impact of Company rule in India. British Rule (1858-1947): Indian National Movement,
Government of India Acts 1909, 1919 and 1935, and Indian Independence Act 1947. Framing
of the Indian Constitution: Constituent Assembly, Preamble and Salient Features.
UNIT-II [3 SESSIONS]

FUNDAMENTAL RIGHTS, DUTIES AND DIRECTIVE PRINCIPLES OF STATE

POLICY: The Fundamental Rights: Features and significance of Rights. Fundamental Duties:
Importance and the legal status of Duties. Directive Principles of State Policy: Socialist,
Gandhian and Liberal-intellectual principles, importance and relevance.
UNIT-III [3 SESSIONS]

UNION GOVERNMENT AND ITS ADMINISTRATION: Federalism: Division of

legislative and financial powers between the Union and the State. -Union Executive: Role and
position of President, Prime Minister and Council of Ministers. - Emergency Provisions:
National Emergency, Constitutional Emergency and Financial Emergency.
UNIT-IV [3 SESSIONS]

UNION LEGISLATURE AND JUDICIARY: Union Legislature: Parliament of India-

Composition and functions of Parliament, and Parliamentary Committees. Union Judiciary:
Supreme Court of India-Composition and Functions.
UNIT-V [3 SESSIONS]

LOCAL SELF GOVERNMENTS :Rural Local Governments: Zilla Parishad- CEO and
functions of Zilla Parishad, Mandal Parishad- Role of Elected and Officials, Gram Panchayat-
Sarpanch, Secretary and Gram Sabha. Urban Local Governments: Structure and functions of
Municipalities and Municipal Corporations. District Collector: Powers and functions of
Collector.
Text Books
1. Sastry Ravindra, (Ed), “Indian Government & Politics”, Telugu Akademy, 2nd Edition,
2018.
2. “Indian Constitution at Work”, NCERT, 1st Edition 2006, reprinted in 2022.
Reference Books

1. D.D. Basu, “Introduction to the Constitution of India”, Lexis Nexis, 2015.

2. Dr. S. N. Busi, Dr. B. R. Ambedkar, “Framing of Indian Constitution”, 1st Edition, 2015.
3. M.V. Pylee, “India’s Constitution”, S. Chand Publishing, 16th Edition, 2017.
COURSE CODE COURSE TITLE L T P C
CSE 321 JAVA PROGRAMMING 3 0 0 3
Course Outcome
CO1: Understanding Object-Oriented Thinking and its application in Java programming, including
classes, inheritance, and polymorphism.
CO2: Describing Java packages and interfaces for modular and extensible code development.

CO3: Analyzing exception handling techniques to ensure robust and error-tolerant Java programs.

CO4: Evaluating knowledge of multithreading concepts and techniques for concurrent execution in
Java applications.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Java Fundamentals: Introduction to Java. Difference between C++ and Java. Keywords,
Tokens, Data types. Use of public, private and protected. OOPS using Java: Use of class and
method in Java. Inheritance, Abstraction, Polymorphism, Encapsulation and data privacy.
Difference between method overloading and method overriding.
UNIT-II [9 SESSIONS]

Exception Handing Introduction to Exceptions. Difference between error and exception. Use of
try, catch and throw. Difference between throw and throws. Types of Exceptions, Exception
handling in Java.
UNIT-III [9 SESSIONS]
Collection Framework: Use of Collections in Java. Array List, Linked List, Hash Map, Tree
Map, Hash Set in Java. Multithreading in Java. Thread Synchronization. Thread Priority, Thread
Life Cycle. Wrapper Classes, I/O Streams and Annotations: Use of wrapper classes in Java-
Integer, Character, Long, Boolean. Autoboxing and Unboxing. Byte stream, Character stream,
Object serialization, cloning. System defined annotations, Custom annotations, application of
annotations, Testing using JUnit.
UNIT-IV [9 SESSIONS]

JDBC: Database connectivity, Types of Drivers for connection, Connection Example. CRUD
operations using Database, Configuring various types of drivers for Java Database Connectivity,
MVC Model for project development, Sequence, Dual table , Date type management in Java.
UNIT-V [9 SESSIONS]

Servlet Lifecycle, Generic Servlet, Http Servlet, Linking Servlet to HTML, Http Servlet Request
and Response, Servlet with JDBC, Configuring project using servlet, Servlet Config and Servlet
Mapping JSP declaration, JSP directives, JSP Scriptlets, JSP include tag, JSP page tag, JSTL.
Text Books
1. E Balagurusamy, “Programming with JAVA”, 5th edition, Tata McGraw
Hill, 2014.

Reference Books
1. SurbhiKakar, “A Textbook of Java Programming”, IK International Publishing House,
2017.
COURSE CODE COURSE TITLE L T P C
CSE 361 JAVA PROGRAMMING LAB 0 0 2 1
Course Outcome
CO1: Understanding in using Integrated Development Environments (IDEs) like Eclipse or
NetBeans for Java development, including project creation, class addition, and
debugging functionalities.
CO2: Describing graphical user interfaces (GUIs) in Java using layouts and event handling
mechanisms for a variety of applications such as calculators and applets.
CO3: Analyzing exception handling in Java and learn to implement error handling
mechanisms to ensure robustness and reliability of Java programs.
CO4: Evaluating multi-threading concepts in Java and Applying them to develop concurrent
applications with multiple threads performing different tasks.
COURSE CONTENTS
Ex.No List of Experiments
1. Create an application to save the employee information using arrays.
2. Design and implement a simple inventory control system for a small video rental store.
3. Create an application to calculate interest for FDs, RDs based on certain conditions
using inheritance.
4. Create a program to set view of Keys from Java Hash table.
 5. Create a program to show the usage of Sets of Collection interface.
6. Write a Program to perform the basic operations like insert, delete, display and search in
list. List contains String object items where these operations are to be performed.
7. Create a menu based Java application with the following options.1.Add an
Employee2.Display All3.Exit If option 1 is selected, the application should gather
details of the employee like employee name, employee id, designation and salary and
store it in a file. If option 2 is selected, the application should display all the employee
details. If option 3 is selected the application should exit.
8. Create a palindrome creator application for making a longest possible palindrome out of
given input string.
9. Create a Servlet/ application with a facility to print any message on web browser.
10. Create JSP application for addition, multiplication and division.
Text Books
1. E Balagurusamy, “Programming with JAVA” , 5th edition, Tata McGraw Hill, 2014.
Reference Books

1. SurbhiKakar, “A Textbook of Java Programming”, IK International Publishing House, 2017.

 FOURTH
SEMESTER
COURSE CODE COURSE TITLE L T P C

CSE 307 COMPUTER NETWORKS 3 0 0 3

Course Outcome
Understanding the fundamental components and flow of data communication networks,
CO1:
including connection topologies, protocols, and standards, based on the OSI model.
Describing comprehension of process-to-process communication, transport layer protocols
CO2: such as UDP, TCP, and SCTP, as well as congestion control mechanisms and quality of
service (QoS) algorithms.
Analyzing error detection and correction techniques, flow control, and error control
CO3:
protocols at the data link layer, along with multiple access protocols.
Evaluating switching techniques, logical addressing, and routing protocols at the network
CO4:
layer, including IPv4, IPv6, and address mapping protocols.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Data communication Components: Representation of data and its flow Networks, Various
Connection Topology, Protocols and Standards, OSI model, Transmission Media, LAN: Wired
LAN, Wireless LANs, Connecting LAN and Virtual LAN, Techniques for Bandwidth
utilization: Multiplexing - Frequency division, Time division and Wave division, Concepts on
spread spectrum.
UNIT-II [9 SESSIONS]

Data Link Layer and Medium Access Sub Layer: Error Detection and Error Correction -
Fundamentals, Block coding, Hamming Distance, CRC; Flow Control and Error control
protocols - Stop and Wait, Go back – N ARQ, Selective Repeat ARQ, Sliding Window,
Piggybacking, Random Access, Multiple access protocols -Pure ALOHA, Slotted ALOHA,
CSMA/CD,CDMA/CA
UNIT-III [9 SESSIONS]

Network Layer: Switching, Logical addressing–IPV4, IPV6; Address mapping – ARP, RARP,
BOOTP and DHCP–Delivery, Forwarding and Unicast Routing protocols.
UNIT-IV [9 SESSIONS]

Transport Layer: Process to Process Communication, User Datagram Protocol (UDP),

Transmission Control Protocol (TCP), SCTP Congestion Control; Quality of Service, QoS
improving techniques: Leaky Bucket and Token Bucket algorithm
UNIT-V [9 SESSIONS]

Application Layer: Domain Name Space (DNS), DDNS, TELNET, EMAIL, File Transfer
Protocol (FTP), WWW, HTTP, SNMP, Bluetooth, Firewalls, basic concepts of Cryptography.
Text Books
1. Computer Networks, 8th Edition, Andrew S. Tanenbaum, Pearson New International
Edition.
2. Internetworking with TCP/IP, Volume 1, 6th Edition Douglas Comer, Prentice Hall of
India.
3. TCP/IP Illustrated, Volume 1, W. Richard Stevens, and Addison-Wesley, United States
of America.
Reference Books
1. Data Communication and Networking, 4th Edition, Behrouz A. Forouzan, McGraw- Hill.
2. Data and Computer Communication, 8th Edition, William Stallings, Pearson Prentice
Hall India.
COURSE CODE COURSE TITLE L T P C
CSE 325 DATABASE MANAGEMENT SYSTEMS 3 0 0 3
Course Outcome
CO1: Understanding the fundamental concepts of database systems, including data
abstraction, data models, and database system architecture, such as Data Definition
Language (DDL) and Data Manipulation Language (DML).
CO2: Describing proficiency in relational query languages and database design principles,
including relational algebra, SQL3, normalization techniques, and dependency
preservation.
CO3: Analyzing query processing and optimization, including the evaluation of relational
algebra expressions, query equivalence, join strategies, and query optimization
algorithms.
CO4: Evaluating storage strategies in databases, including indices, B-trees, and hashing
techniques, and understanding the importance of transaction processing, concurrency
control, and database recovery mechanisms.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Database system architecture: Data Abstraction, Data Independence, Data Definition
Language (DDL), Data Manipulation Language (DML). Data models: Entity-relationship
model, network model, relational and object Oriented data models, integrity constraints, data
manipulation operations.
UNIT-II [13 SESSIONS]

Relational query languages: Relational algebra, Tuple and domain relational calculus, SQL3,
DDL and DML constructs, Open source and Commercial DBMS - MYSQL, ORACLE, DB2,
SQL server. Relational database design: Domain and data dependency, Armstrong's axioms,
Normal forms, Dependency preservation, Lossless design. Query processing and optimization:
Evaluation of relational algebra expressions, Query equivalence, Join strategies, Query
optimization algorithms.
UNIT-III [5 SESSIONS]

Storage strategies: Indices, B-trees, hashing.

UNIT-IV [5 SESSIONS]

Transaction processing: Concurrency control, ACID property, Serializability of scheduling,

Locking and timestamp based schedulers, Multi-version and optimistic Concurrency Control
schemes, Database recovery.
UNIT-V [13 SESSIONS]

Database Security: Authentication, Authorization and access control, DAC, MAC and RBAC
models, Intrusion detection, SQL injection. Advanced topics: Object oriented and object
relational databases, Logical databases, Web databases, Distributed databases, Data warehousing
and data mining.
Text Books
1. Henry F. Korth, S. Sudarshan, “Database System Concepts”, 6th Edition by Abraham
Silberschatz, McGraw-Hill.
2. “Principles of Database and Knowledge – Base Systems”, Vol 1 by J. D. Ullman,
Computer Science Press.
3. “Fundamentals of Database Systems”, 5th Edition by R. Elmasri and S. Navathe, Pearson
Education
Reference Books
1. Korth, Silbertz, Sudarshan,” Database Concepts”, McGraw Hill.
2. O‟Neil, Databases, Elsevier Pub.
COURSE CODE COURSE TITLE L T P C
CSE 305 COMPILER DESIGN 3 0 0 3
Course Outcome
CO1: Understanding the design of a compiler including its phases and components.

CO2: Analyzing a large, complex, but well-structured software system that implements various
phases of a compiler such as the scanner, parser, code generator, and optimizer.
CO3: Applying a parse tree, or explain why no parse tree exists, given a BNF grammar and a
String over the appropriate alphabet.
CO4: Evaluating the various optimization techniques for designing various optimizing compilers.

COURSE CONTENTS
UNIT-I [9 SESSIONS]
Introduction to Compiler: Phases and passes, Bootstrapping, Finite state machines and
regular expressions and their applications to lexical analysis, lexical-analyser generator, LEX-
compiler, Formal grammars and their application to syntax analysis, BNF notation, ambiguity,
YACC. The syntactic specification of programming languages: Context free grammars,
derivation and parse trees, capabilities of CFG.
UNIT-II [9 SESSIONS]

Basic Parsing Techniques: Parsers, Shift reduce parsing, top down parsing, predictive parsers
Automatic Construction of efficient Parsers: LR parsers, the canonical Collection of LR (0)
items, constructing SLR parsing tables, constructing Canonical LR parsing tables, Constructing
LALR parsing tables, using ambiguous grammars, an automatic parser generator, and
implementation of LR parsing tables.
UNIT-III [9 SESSIONS]

Basic Parsing Techniques: Parsers, Shift reduce parsing, top down parsing, predictive parsers
Automatic Construction of efficient Parsers: LR parsers, the canonical Collection of LR (0)
items, constructing SLR parsing tables, constructing Canonical LR parsing tables, Constructing
LALR parsing tables, using ambiguous grammars, an automatic parser generator, and
implementation of LR parsing tables.
UNIT-IV [9 SESSIONS]

Symbol Tables: Data structure for symbols tables, representing scope information. Run- Time
Administration: Implementation of simple stack allocation scheme, storage allocation in block
structured language. Error Detection & Recovery: Lexical Phase errors, syntactic phase errors
semantic errors.
UNIT-V [9 SESSIONS]

Code Generation: Design Issues, the Target Language. Addresses in the Target Code, Basic
Blocks and Flow Graphs, Optimization of Basic Blocks, Code Generator. Code optimization:
DAG representation of basic blocks.
Text Books
1. Aho, Sethi & Ullman, "Compilers: Principles, Techniques and Tools”, Pearson
Education.
2. Charles Fischer and Ricard LeBlanc,” Crafting a Compiler with C”, Pearson Education.
3. Alfred V. Aho, Jeffrey D. Ullman (2001), Principles of compiler design, Indian student
edition, Pearson Education, New Delhi, India.
Reference Books
1. Kenneth C. Louden (1997), Compiler Construction– Principles and Practice, 1st edition,
PWS Publishing.
2. K. L. P Mishra, N. Chandrashekaran (2003), Theory of computer science- Automata
Languages and computation, 2nd edition, Prentice Hall of India, New Delhi, India.
COURSE CODE COURSE TITLE L T P C

DESIGN AND ANALYSIS

CSE 216 3 0 0 3
OFALGORITHMS
Course Outcome
CO1: Understanding the correctness of algorithms using inductive proofs and invariants.
CO2: Describing worst-case running times of algorithms using asymptotic analysis.
CO3: Applying the divide-and-conquer paradigm and explain when an algorithmic design
situation calls for it. Recite algorithms that employ this paradigm. Synthesize divide-
and- conquer algorithms. Derive and solve recurrences describing the performance
of divide-and- conquer algorithms.
CO4: Evaluating the dynamic-programming paradigm and explain when an algorithmic
design situation calls for it. Recite algorithms that employ this paradigm. Synthesize
dynamic- programming algorithms, and analyze them
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Introduction: Algorithms, analyzing algorithms, Complexity of algorithms, Growth of
functions, Performance measurements, Sorting and order Statistics - Shell sort, Quick sort,
Merge sort, Heap sort, Comparison of sorting algorithms, Sorting in linear time.
UNIT-II [9 SESSIONS]

Advanced Data Structures: Red-Black trees, B – trees, Binomial Heaps and Fibonacci Heaps.
UNIT-III [9 SESSIONS]

Applications and Examples: Divide and Conquer examples such as Sorting, Convex hull. Greedy
methods with examples Huffman Coding, Knapsack, Minimum Spanning trees – Prim’s and
Kruskal’s algorithms, Single source shortest paths – Dijkstra’s and Bellman Ford algorithms.
UNIT-IV [9 SESSIONS]

Dynamic Programming: Dynamic programming with examples such as LCS, All pair shortest
paths – Warshal’s and Floyd’s algorithms, Resource allocation problem. Backtracking, Branch
and Bound with examples such as Travelling Salesman Problem, Graph Coloring, n-Queen
Problem, Hamiltonian Cycles and Sum of subsets.
UNIT-V [9 SESSIONS]

Approximation and NP: Algebraic Computation, String Matching, Theory of NP- completeness,
Approximation algorithms and Randomized algorithms.
Text Books
1. Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, “Introduction to
Algorithms”, Printice Hall of India.
2. Hopcraft, Ullman, “The Design and Analysis of Computer Algorithms” Pearson
Education.
3. E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms".
Reference Books
1. Berman, Paul, “Algorithms”, Cengage Learning.
2. AhoRCT Lee, SS Tseng, RC Chang and YT Tsai, “Introduction to the Design and
Analysis of Algorithms”, Mc Graw Hill.
COURSE CODE COURSE TITLE L T P C
PROBABILITY AND STATISTICS AND
CSE 222 3 0 0 3
RELIABILITY
Course Outcome
CO1: Remembering the fundamental concepts of probability theory, including random
experiments, events, conditional probability, independent events, and theorems such
as Bayes' theorem and the Law of Total Probability.
CO2: Understanding random variables, including one-dimensional discrete and continuous
random variables, their density and distribution functions, expectation, variance,
covariance, and moments.
CO3: Applying correlation and regression techniques to analyze two-dimensional random
variables, including joint distributions, marginal and conditional distributions, as
well as multiple regression analysis.
CO4: Analyzing hypothesis testing methods, including types of errors, critical regions,
large sample tests (Z-tests), small sample tests (t-tests), and chi-square tests for
goodness of fit and independence of attributes.
CO5: Evaluating design of experiments concepts such as analysis of variance (ANOVA),
various classification designs (CRD, RBD, LSD), and reliability measures including
hazard functions and system reliability.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Probability Theory: Introduction to probability concepts, Random experiments, Events,
Conditional probability, Independent events, Theorem of Total Probability, Baye’s theorem
Sample space, Exercise.
UNIT-II [9 SESSIONS]

Random variables (RV): Introduction to Random variables, - One dimensional Random

Variables, Discrete and Continuous RV- Density and Distribution function of RV, Expectation,
Variance, and its properties, Covariance, and Moments. Moment Generating function Special
Distributions Binomial and Poisson distributions – Normal distribution, Exponential
distributions, Weibull distribution
UNIT-III [9 SESSIONS]

Correlation and Regression: Two dimensional random variables, Joint distribution and Joint
density functions - Marginal, Conditional Distribution and Density functions. Regression and
Correlation. – Partial and Multiple Correlation- Multiple Regression.
UNIT-IV [9 SESSIONS]

Test of Significance: Testing of hypothesis – Introduction - Types of errors, critical region, and
procedure of testing hypothesis. Large sample tests - Z test for Single Proportion, Difference of
Proportion, Single mean and difference of means. Small sample tests - Student’s t-test, F-test -
Chi-square test - Goodness of fit -Independence of Attributes
UNIT-V [9 SESSIONS]

Design of Experiments and Reliability: Analysis of variance – One and Two way
classifications – Completely Randomized Design (CRD), Randomized Block Design (RBD),
Latin Square Design (LSD) Basic concepts - Hazard function - Reliabilities of series and parallel
systems - System Reliability – Maintainability - Preventive and repair maintenance –
Availability.
Text Books
1. Probability and Statistics for engineers and scientists by R.E.Walpole, R.H.Mayers,
S.L.Mayers and K.Ye, 9th Edition, Pearson Education (2012).
2. Probability, Statistics and Reliability for Engineers and Scientists by Bilal M. Ayub and
Richard H. McCuen, 3rd edition, CRC press (2011).
3. Mathematical Statistics by M. Ray, H S Sharma, and S Chaudhary, RP & Sons
Education.
References Books:
1. "Probability and Statistics" by Morris H. DeGroot and Mark J. Schervish
2. "Probability and Random Processes" ,by Geoffrey Grimmett and David Stirzaker
COURSE CODE COURSE TITLE L T P C
CSE 323 PYTHON PROGRAMMING 3 0 0 3
Course Outcome
CO1: Understanding why Python is a useful scripting language for developers.
CO2: Describing how to use lists, tuples, and dictionaries in Python programs.
CO3: Analyzing how to identify Python object types.
CO4: Evaluating how to use indexing and slicing to access data in Python programs.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Algorithms, building blocks of algorithms (statements, state, control flow, functions), notation
(pseudo code, flow chart, programming language), algorithmic problem solving, simple
strategies for developing algorithms (iteration, recursion). Illustrative problems: find minimum
in a list, insert a card in a list of sorted cards, guess an integer number in a range, Towers of
Hanoi.
UNIT-II [9 SESSIONS]

Python interpreter and interactive mode; values and types: int, float, boolean, string, and list;
variables, expressions, statements, tuple assignment, precedence of operators, comments;
modules and functions, function definition and use, flow of execution, parameters and
arguments; Illustrative programs: exchange the values of two variables, circulate the values of n
variables, distance between two points
UNIT-III [9 SESSIONS]

Conditionals: Boolean values and operators, conditional (if), alternative (if-else), chained
conditional (if-elif-else); Iteration: state, while, for, break, continue, pass; Fruitful functions:
return values, parameters, local and global scope, function composition, recursion; Strings: string
slices, immutability, string functions and methods, string module; Lists as arrays. Illustrative
programs: square root, gcd, exponentiation, sum an array of numbers, linear search, binary
search.
UNIT-IV [9 SESSIONS]

Lists: list operations, list slices, list methods, list loop, mutability, aliasing, cloning lists, list
parameters; Tuples: tuple assignment, tuple as return value; Dictionaries: operations and
methods; advanced list processing - list comprehension; Illustrative programs: selection sort,
insertion sort, merge sort.
UNIT-V [9 SESSIONS]

Text files, reading and writing files, format operator; command line arguments, errors and
exceptions, handling exceptions, modules, packages; Illustrative programs: word count, copy file.
Text Books
1. Guido van Rossum and Fred L. Drake Jr, “An Introduction to Python – Revised and
updated for Python3
2. Charles Dierbach, “Introduction to Computer Science using Python: A Computational
Problem-Solving Focus, Wiley India Edition, 2013.
3. John V Guttag, “Introduction to Computation and Programming Using Python‟‟,
Revised and expanded Edition, MIT Press , 2013.
Reference Books
1. Kenneth A. Lambert, “Fundamentals of Python: First Programs”, CENGAGE Learning,
2012.
2. Paul Gries, Jennifer Campbell and Jason Montojo, “Practical Programming: An
Introduction to Computer Science using Python 3”, Second edition, Pragmatic
Programmers, LLC, 2013.
3. Robert Sedgewick, Kevin Wayne, Robert Dondero, “Introduction to Programming in
Python: An Inter - disciplinary Approach, Pearson India Education Services Pvt. Ltd.,
2016.
 COURSE CODE COURSE TITLE L T P C
CSE 363 PYTHON PROGRAMMING LAB 0 0 2 1
Course Outcome
CO1: Understanding the basic principles of Python programming language

CO2: Describing object-oriented concepts.

CO3: Analyzing the concept of dictionary and metadata in python.

CO4: Evaluating database and GUI applications.

Ex.No LIST OF EXPERIMENTS

1. Compute the GCD of two numbers.
1
2. Find the square root of a number (Newton’s method)
2
3. Exponentiation (power of a number)
3
4. Find the maximum of a list of numbers
4
5. Linear search and Binary search
5
6. Selection sort, Insertion sort
6
7. Merge sort
7
8. First n prime numbers
8
9. Multiply matrices
9
10. Programs that take command line arguments (word count)

11. Find the most frequent words in a text read from a file

Text Books
1. Guido van Rossum and Fred L. Drake Jr, “An Introduction to Python – Revised and
 updated for Python3.
2. Charles Dierbach, “Introduction to Computer Science using Python: A Computational
Problem-Solving Focus, Wiley India Edition, 2013.
3. John V Guttag, “Introduction to Computation and Programming Using Python‟‟,
Revised and expanded Edition, MIT Press, 2013.
Reference Books
1. Kenneth A. Lambert, “Fundamentals of Python: First Programs”, CENGAGE Learning,
2012.
2. Paul Gries, Jennifer Campbell and Jason Montojo, “Practical Programming: An
Introduction to Computer Science using Python 3”, Second edition, Pragmatic
Programmers, LLC, 2013.
3. Robert Sedgewick, Kevin Wayne, Robert Dondero, “Introduction to Programming in
Python: An Inter- disciplinary Approach, Pearson India Education Services Pvt. Ltd.,
2016.
COURSE CODE COURSE TITLE L T P C
DATABASE MANAGEMENT SYSTEMS
CSE 365 0 0 2 1
LAB
Course Outcome
CO1: Understanding Oracle database management system.
CO2: Describing case tools to create Entity-Relationship Diagrams for database design.
CO3: Analyzing skills in writing SQL statements using Oracle or MySQL, including basic
SELECT queries, data restriction, sorting, working with multiple tables, aggregation,
manipulation, and table management.
CO4: Evaluating normalization principles in Oracle to optimize database design.
List of Experiments [30 SESSIONS]
1. Installing oracle.
2. Creating Entity-Relationship Diagrams using case tools.
3. Writing SQL statements Using ORACLE/MYSQL:

a) Writing basic SQL SELECT statements.

b) Restricting and sorting data.

c) Displaying data from multiple tables.

d) Aggregating data using group function.

e) Manipulating data.

f) Creating and managing tables.

4. Normalization in ORACLE.
 5. Creating cursor in oracle.
6. Creating procedures and functions in oracle.
Text Books
1. “Database System Concepts”, 6th Edition by Abraham Silberschatz, Henry F. Korth, S.
Sudarshan, McGraw-Hill.
2. “Principles of Database and Knowledge – Base Systems”, Vol 1 by J. D. Ullman,
Computer Science Press.
3. “Fundamentals of Database Systems”, 5th Edition by R. Elmasri and S. Navathe, Pearson
Education
Reference Books
1. Korth, Silbertz, Sudarshan, “Database Concepts”, McGraw Hill
2. O’Neil, Databases, Elsevier Pub.
 FIFTH
SEMESTER
COURSE CODE COURSE TITLE L T P C
THEORY OF AUTOMATA AND FORMAL
CSE 204 3 0 0 3
LANGUAGE
Course Outcome
CO1: Understanding the fundamental concepts of formal languages and grammars,
including the Chomsky hierarchy, and their applications in computational theory.
CO2: Describing and construct regular languages using regular expressions, finite
automata, and related concepts such as minimization and equivalence.
CO3: Analyzing proficiency in context-free languages by utilizing context-free grammars,
pushdown automata, and related techniques such as normalization and parsing.
CO4: Evaluating Turing machines as foundational models of computation, including
variants and their equivalence with other formal language constructs.
COURSE CONTENTS
UNIT-I [8 SESSIONS]
Introduction: Alphabet, languages and grammars, productions and derivation, Chomsky
hierarchy of languages.
UNIT-II [9 SESSIONS]

Regular languages and finite automata: Regular expressions and languages, deterministic
finite automata (DFA) and equivalence with regular expressions, nondeterministic finite
automata (NFA) and equivalence with DFA, regular grammars and equivalence with finite
automata, properties of regular languages, pumping lemma for regular languages, minimization
of finite automata.
UNIT-III [10 SESSIONS]

Context-free languages and pushdown automata: Context-free grammars (CFG) and

languages (CFL), Chomsky and Greibach normal forms, nondeterministic pushdown automata
(PDA) and equivalence with CFG, parse trees, ambiguity in CFG, pumping lemma for context-
free languages, deterministic pushdown automata, closure properties of CFLs. Context-sensitive
languages: Context-sensitive grammars (CSG) and languages, linear bounded automata and
equivalence with CSG.
UNIT-IV [9 SESSIONS]

Turing machines: The basic model for Turing machines (TM), Turing-recognizable
(recursively enumerable) and Turing-decidable (recursive) languages and their closure
properties, variants of Turing machines, nondeterministic TMs and equivalence with
deterministic TMs, unrestricted grammars and equivalence with Turing machines, TMs as
enumerators.
UNIT-V [9 SESSIONS]

Undecidability: Church-Turing thesis, universal Turing machine, the universal and

diagonalization languages, reduction between languages and Rice s theorem, undecidable
problems about languages.
Text Books
1. John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman, Introduction to Automata
Theory, Languages, and Computation, Pearson Education Asia.
2. Harry R. Lewis and Christos H. Papadimitriou, Elements of the Theory of Computation,
Pearson Education Asia.
3. John Martin, Introduction to Languages and the Theory of Computation, Tata McGraw
Hill.
Reference Books
1. Introduction to Automata Theory, Languages and Computation – Hopcroft, Ullman,
Pearson Education
2. Elements of the Theory of Computation – Papadimitrou, C. and Lewis, C.L, PHI
COURSE CODE COURSE TITLE L T P C

CSE 404 MACHINE LEARNING 3 0 0 3

Course Outcome
Understand the informed and uninformed problem types and apply search strategies
CO1:
to solve them.
Describing and enrich knowledge to select and apply AI tools to synthesize
CO2:
information and develop models within constraints of application area.
CO3: Applying the technical aspect of screen design.
Evaluating difficult real life problems in a state space representation so as to solve
CO4:
them using AI Techniques like searching and game playing.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Well defined learning problems, designing a Learning System, Issues in Machine Learning;
The Concept Learning Task - General-to-specific ordering of hypotheses, Find-S, List then
eliminate algorithm, Candidate elimination algorithm, Inductive bias.
UNIT-II [9 SESSIONS]

Decision tree learning algorithm-Inductive bias- Issues in Decision tree learning; ANN –
Perceptrons, Gradient descent and the Delta rule, Adaline, Multilayer networks, Derivation of
back propagation rule Back propagation Algorithm Convergence, Generalization.
UNIT-III [9 SESSIONS]

Evaluating Hypotheses: Estimating Hypotheses Accuracy, Basics of sampling Theory,

Comparing Learning Algorithms; Bayesian Learning: Bayes theorem, Concept learning, Bayes
Optimal Classifier, Naïve Bayes classifier, Bayesian belief networks, EM algorithm
UNIT-IV [9 SESSIONS]

Computational Learning Theory: Sample Complexity for Finite Hypothesis spaces, Sample
Complexity for Infinite Hypothesis spaces, The Mistake Bound Model of Learning;
INSTANCE- BASED LEARNING – k- Nearest Neighbor Learning, Locally Weighted
Regression, Radial basis function networks, Case-based learning.
UNIT-V [9 SESSIONS]

An illustrative example, Hypothesis space search, Genetic Programming, Models of Evolution

and Learning; Learning first order rules-sequential covering algorithms- General to specific beam
search- FOIL; REINFORCEMENT LEARNING - The Learning Task, Q Learning.
Text Books
1. Tom M. Mitchell, ―Machine Learning, McGraw-Hill Education (India) Private Limited,
2013.
2. Ethem Alpaydin ―Introduction to Machine Learning (Adaptive computation and
Machine Learning), The MIT Press 2004.
3. Stephen Marsland, ―Machine learning: An Algorithmic Perspective, CRC Press, 2009.
Reference Books
1. Marco Gori, Machine Learning: A Constraint-Based Approach, Morgan Kaufmann. 2017
2. Stephen Marsland, Taylor & Francis 2009. Machine Learning: An Algorithmic
Perspective.
COURSE CODE COURSE TITLE L T P C
CSE 333 ROBOTICS AND DRONES 3 0 0 3
Course Outcome
CO1: Remembering the fundamental concepts of mechanical structures, motors, sensors,
and circuits essential for constructing robots.
CO2: Understanding the utilization of sensors such as Ultrasonic, IR, and Rotary Encoders
for Arduino interfacing, including reading data and integrating them into robotics
applications.
CO3: Applying expertise in operating robot controllers to control servo and stepper motors
in two-wheel robots, ensuring precise motion.
CO4: Analyzing how to apply Python and OpenCV for image processing tasks, including
RGB extraction and region of interest (ROI) analysis.
CO5: Evaluating the assembly of a quadcopter drone, demonstrating an understanding of
its classification, parts, operational principles, and the development of autonomous
systems.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Robotics, Sensors and Signal processing Robotics: Robotics and AI, Embedded Systems,
Agent-Task-Environment model, Embodied Systems, Synthetic approaches to science, Sensors
and signal processing Common sensors and their properties, 1D signal processing, Vision
UNIT-II [9 SESSIONS]

AI and the Internet of Things: AI and the Internet of Things: Real World Use-Cases: Automated
vacuum cleaners, like that of the iRobot Roomba, Smart thermostat solutions, like that of Nest
Labs.
UNIT-III [9 SESSIONS]

Introduction to Drones: Introduction to Unmanned Aircraft Systems, History of UAV drones,

classification of drones, System Composition, applications.
UNIT-IV [9 SESSIONS]

Introduction to Drones: Design of UAV Drone Systems: Design of UAV Drone Systems:
Introduction to Design and Selection of the System, Aerodynamics and Airframe
Configurations, Characteristics of Aircraft Types, Design Standards and Regulatory Aspects-
India Specific, Design for Stealth.
UNIT-V [9 SESSIONS]

Avionics Hardware of Drones: Avionics Hardware of Drones: Autopilot, AGL-pressure sensors

servos-accelerometer –gyros-actuators- power supply-processor, integration, installation,
configuration.
Text Books
1. Reg Austin, “Unmanned Aircraft Systems UAV design, development and deployment”,
Wiley, 2010.
2. Robert C. Nelson, Flight Stability and Automatic Control, McGraw-Hill, Inc, 1998."
3. Reg Austin ,“Unmanned Aircraft Systems UAV design, development and deployment”,
Wiley, 2010.
Reference Books

1. The Art of Robotics: An introduction to engineering, F Martin, Addison-Wesley,

forthcoming
COURSE CODE COURSE TITLE L T P C

CSE 430 MACHINE LEARNING LAB 0 0 2 1

Course Outcome
CO1: Remembering how to set up the Python environment and install essential machine
learning packages like scikit-learn, Keras, and TensorFlow.
CO2: Understanding and implementing dimensionality reduction techniques through
feature extraction and selection to improve data analysis in machine learning.
CO3: Applying various linear regression models, comparing their performance using
metrics like gradient descent, least squares, LASSO, and RIDGE.
CO4: Analyzing logistic regression on sample datasets, calculating accuracy, precision,
and recall to evaluate model effectiveness in classification tasks.
CO5: Evaluating decision tree algorithms and comparing their performance with ensemble
methods like Random Forest, bagging, boosting, and voting techniques.
COURSE CONTENTS [30 SESSION]
1. Identification and Installation of python environment towards the machine learning,
1 installing python modules/Packages Import scikitlearn, keras and tensorflows etc.
2. Implement Dimensionality Reduction Using Feature Extraction and Feature Selection
3. Build linear regression model using gradient descent, least squares, polynomial, LASSO
and RIDGE approaches also compare all the algorithms and draw a table for all the
metrics.
4. Demonstration of Logistic Regression for a sample training data set stored as a .CSV file.
Calculate the accuracy, precision, and recall for your dataset.
5. Demonstration of decision tree based ID3 algorithm, Random Forest.
6. Build the decision tree classifier compare its performance with ensemble techniques like
random forest, bagging, boosting and voting Demonstrate it with different decision trees.
7. Demonstration of Naïve Bayesian classifier for a sample training data set stored as
a .CSV file.
8. Implementation of SVM, KNN and NN using Tensor flow.
 9. Demonstration of clustering algorithms- k-Means, Agglomerative and DBSCAN to
classify for the standard datasets.
10. Implementation of case studies using supervised learning algorithms.
Text Books

1. Guiseppe Bonaccarco, '' Machine Learning Algorithms'', 2nd Edition,Packt,2018

Reference Book

1. Laboratory Manual of Organic Chemistry, by Raj K Bansal, Wiley Eastern Limited,

New age international limited.
COURSE CODE COURSE TITLE L T P C

CSE 371 ROBOTICS AND DRONES LAB 0 0 2 1

Course Outcome
CO1: Remembering to apply signal processing techniques for data interpretation, including
filtering, noise reduction, and feature extraction to enhance data quality.
CO2: Understanding and implementing basic computer vision techniques, such as image
processing and object detection, using libraries like OpenCV.
CO3: Applying knowledge to develop IoT-based systems for smart applications,
integrating sensors and actuators for real-time data collection and control.
CO4: Analyzing UAV flight dynamics and classification methods to understand the
principles governing unmanned aerial vehicle operations.
CO5: Evaluating the design and configuration of UAV systems for specific tasks, focusing
on system components and operational requirements.
COURSE CONTENTS [30 SESSION]
Experiment 1 Robotics Basics and Simple Agent-Task-Environment Model
Objective: Understand the principles of robotics by building and programming a simple robotic
system. Task: Assemble a basic robot (e.g., line-following or obstacle-avoiding) and program it
to interact with its environment.
Experiment 2 Sensor Interfacing and Data Acquisition
Objective: Interface common sensors with a microcontroller and analyze data.
Task: Connect temperature, proximity, and light sensors to a microcontroller, record sensor
data, and display it on a computer.
Experiment 3 Signal Processing and Noise Filtering
Objective: Apply basic 1D signal processing techniques to clean and interpret sensor data.
Task: Process sensor data (e.g., temperature or light intensity) by implementing noise filtering
algorithms.
Experiment 4 Introduction to Computer Vision
Objective: Explore vision sensors and implement basic image capture and processing.
Task: Use a camera module to capture images, then process these images to detect simple
objects or patterns (e.g., color detection).
Experiment 5 IoT-Based Smart Home Prototype
Objective: Build a simple IoT-based smart home system with multiple sensors.
Task : Set up a smart thermostat system using a temperature sensor and a microcontroller,
simulating automated heating control.
Experiment 6 Automation Simulation with AI and IoT
Objective: Create a basic simulation of a robotic vacuum cleaner’s path finding algorithm.
Task: Program a small robot or simulation to cover a designated area, avoiding obstacles similar
to an automated vacuum cleaner.
Experiment 7 UAV Flight Dynamics and Classification
Objective: Study the history, classification, and basic flight dynamics of drones.
Task: Classify different types of drones (fixed-wing, rotary-wing, hybrid) based on structure and
function, and observe how each type affects flight characteristics.
Experiment 8 Design and Configuration of UAV Systems
Objective: Learn the basics of drone design, aerodynamics, and configuration for specific tasks.
Task: Using a model drone or simulation software, adjust design parameters (e.g., frame type,
propeller size) and observe the impact on flight behavior.
Experiment 9 Autopilot and Avionics System Setup
Objective: Set up an autopilot system with basic avionics components for a drone.
Task: Configure and test an autopilot system with sensors (e.g., accelerometer, gyroscope,
pressure sensor), then analyze sensor data to control drone orientation.
Experiment 10 Full Integration and Testing of a UAV System

Objective: Integrate sensors, actuators, and processors in a complete UAV setup and perform a
test. Task: Integrate a set of sensors (e.g., AGL sensor, gyroscope, and accelerometer), power
supply, and processor in a drone, and perform a test flight in a controlled environment.

Text Books
1. Reg Austin, “Unmanned Aircraft Systems UAV design, development and deployment”,
Wiley, 2010.
2. Robert C. Nelson, Flight Stability and Automatic Control, McGraw-Hill, Inc, 1998."
3. Reg Austin “Unmanned Aircraft Systems UAV design, development and deployment”,
 Wiley, 2010.
Reference Books

1. The Art of Robotics: An introduction to engineering, F Martin, Addison-Wesley,

forthcoming

COURSE CODE COURSE TITLE L T P C

CAC 300 CAMPUS TO CORPORATE 0 0 2 1

COURSE OUTCOME
Understanding effective communication skills, including verbal and non-verbal
CO1:
communication, active listening, and proficient writing abilities.
Describing business etiquette, encompassing first impressions, corporate environment
CO2:
conduct, grooming standards, and appropriate communication in various contexts.
Analyzing presentation skills, covering the fundamentals of effective presentations, use of
CO3:
visual aids, overcoming stage fright, and managing Q&A sessions confidently.
Evaluating goal-setting techniques, including SMART goals, mission statements, and
CO4:
strategies for overcoming procrastination and visualizing objectives.
COURSE CONTENTS
UNIT-I [6 SESSIONS]
Communication Skills: Verbal & Non-Verbal, Manage tone of language, Listening Skills &
Writing Skills, Group Discussion.
UNIT-II [6 SESSIONS]

Business Etiquette: Making the First Impression, Corporate environment Etiquette, Grooming
and Personal Hygiene, Body Language, Telephone and email Etiquette.
UNIT-III [6 SESSIONS]

Presentation Skills :Fundamentals of an Effective Presentation, 5 P‟s of an Effective

Presentation, Importance of Visual Aids, Understanding and Overcoming Fear, Public Speaking,
Importance of Managing Voice and Language, Managing Question and Answer Session.
UNIT-IV [6 SESSIONS]

Goal Setting: Establishing SMART Goals, Importance of Mission Statement, Formulation of

Goals, Procrastination, and Visualization of Goals.
UNIT-V [6 SESSIONS]

Time Management :Prioritization, Dealing with Difficult Tasks, Getting Organized, How to get
away from Distractions, Work-Life Balance.
Text Books

1. "Effective Communication Skills" by John Adair

2. "The Art of Public Speaking" by Stephen E. Lucas

Reference Books

1. "Time Management for Dummies" by Jeffrey J. Mayer

2. "The 7 Habits of Highly Effective People" by Stephen R. Covey

PROGRAM
ELECTIVE-1
COURSE CODE COURSE TITLE L T P C
CSE 051 BLOCKCHAIN TECHNOLOGY 3 0 0 3
Course Outcome
CO1: Remembering the features of blockchain and distributed systems
CO2: Understanding the concepts of bitcoin and consensus mechanisms in bitcoin mining.
CO3: Applying the consensus mechanisms and technologies that support Ethereum.
CO4: Analyzing the Hyperledger Fabric architecture and Hyperledger Projects.
CO5: Evaluating the blockchain use cases.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Blockchain Foundations: Overview of distributed systems, Introduction to Blockchain,
Generic elements of a blockchain, Features of Blockchain, Applications of Blockchain, Hash
Functions and Merkle Trees, Components of Blockchain Ecosystem, Cryptography and
Consensus Algorithms; Types of Blockchain, Blockchain Platforms.
UNIT-II [9 SESSIONS]

Bitcoin Platform: Bitcoin definition, Keys and addresses , Public keys and Private keys in
bitcoin, The transaction life cycle, The transaction structure, Bitcoin payments, Consensus
mechanism in bitcoin, Wallet types, Non-deterministic wallets, Deterministic wallets,
Alternative Coins- Namecoin, Litecoin, Zcash.
UNIT-III [9 SESSIONS]

Permission less Blockchain Ethereum: Introducing Smart Contracts, Ethereum blockchain ,

The Ethereum stack, Ethereum virtual machine (EVM), Consensus mechanism in Ethereum, The
Ethereum network, Ethereum Development, Setting up a development environment,
Development tools and clients, Applications developed on Ethereum.
UNIT-IV [9 SESSIONS]
Permissioned Blockchain Hyperledger Fabric: Introduction to Hyperledger Fabric,
Hyperledger Fabric architecture, Membership services, Hyperledger Projects- Fabric, Sawtooth
lake, Iroha, Components of the Fabric, Peers or nodes, Applications on Blockchain, Alternate
Blockchains- Ripple, Corda.
UNIT-V [9 SESSIONS]

Case studies using Blockchain: Cross border payments, Know Your Customer (KYC), Food
supplychain, Mortgage over Blockchain, Identity on Blockchain, Blockchain in Insurance
Industry, Education, Healthcare, realestate management and Metaverse.
Text Books

1. Imran Bashir, “Mastering Blockchain”, Second Edition, Packt Publishing, 2018

2. Melanie Swan, "Blockchain: Blueprint for a New Economy", First Edition, O'Reilly,
2018

3. Ramchandra Sharad Mangrulkar, Pallavi Vijay Chavan, “Blockchain Essentials - Core

Concepts and Implementations”, Press Publishing, 2024.
Reference Books

1. Andreas M. Antonopoulos, “Mastering Bitcoin Unlocking Digital Cryptocurrencies”,

First Edition Apress,2017
2. Ritesh Modi, “Solidity Programming Essentials: A Beginner’s Guide to Build Smart
Contracts for Ethereum and BlockChain”, Packt Publishing, 2019.
COURSE CODE COURSE TITLE L T P C

CSE 052 FULL STACK DEVELOPER 3 0 0 3

Course Outcome
CO1: Remembering the web pages with good aesthetic sense of design using HTML and
CSS.
CO2: Understanding the real-world React web applications and related tools.
CO3: Applying and Becoming an agile practitioner with the ability to quickly complete
projects.
CO4: Analyzing how to build an end-to-end application from scratch using NODE JS.
CO5: Evaluating and building logical relationships between documents using MongoDB.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Introduction to full stack: MVC pattern, Web Fundamentals. HTML 5.0: Basic tags, HTML
DOM, Images, Tables, Lists, Forms, Layout, Graphics, span and div tags. Introduction to
Cascading Style Sheets: Types of CSS, CSS Selectors, CSS BOX Model, Text and Font,
Color, CSS Positioning and CSS floating, CSS Grid layout Module, CSS Media Queries.
UNIT-II [9 SESSIONS]

Java Script: Data Types & Type Conversion, JSON, Events, String and Date Functions, Local
Storage, Object Oriented Programming (OOP) in JS, JavaScript Regular Expressions.
Bootstrap: Introduction of Bootstrap, Container and Container-fluid, Bootstrap Carousel.
Bootstrap Component: Button, Grid, Table, Form, Alert, Image, Tabs/Pill, Navbar, Modals.
UNIT-III [9 SESSIONS]

React JS: Introduction to React, React with JSX, Actual DOM vs React VDOM, Components,
Lifecycle, State, Props, Fragments, Events, Router, Forms, Pagination, Tables, Portals, Hook,
Signals. React 18 New features. Redux and MUI: Introduction to Redux, State, Actions,
Reducers, Color Reducer, Sort Reducer, Store, Action Creators, Middleware. React Material UI
Introduction and Installation, MUI Input Components. Integration of Google MAP API and GPS
Location Tracking: Incorporating Google MAP API and GPS Location Tracking for location-
based services.
UNIT-IV [9 SESSIONS]

Node JS: Modules, Node Package Manager(npm), Creating Web Server, Sending Requests and
Handling HTTP requests, Handling User authentication with NodeJS, File System, Writing a
file asynchronously and Other I/O Operations. Events: Event Emitter class, Inheriting Events
and Returning event emitter. Express JS: Introduction to the Express framework- Server-side
rendering with Templating Engines, Routing, Middleware, Custom Middleware, static files.
UNIT-V [9 SESSIONS]

Mongo DB: Introduction, Importance of NoSQL databases, JSON Vs BSON, Data types and
examples. CRUD Operations, Data Modelling & Schema Design, Indexing and Aggregation,
MongoDB Replication and Sharding.
Text Books

1. Vasan Subramanian, "Pro MERN Stack: Full Stack Web App Development with Mongo,
Express, React, and Node", second Edition, Apress Publications, 2019.

2. David Hows, Peter Membrey, EelcoPlugge – “MongoDB Basics”, Apress, 2014

Reference Books

1. Ethan Brown, “Web Development with Node and Express”, Oreilly Publishers, First
Edition, 2014.
 OPEN
ELECTIVE-I
COURSE CODE COURSE TITLE L T P C
CSE 421 COMPUTATIONAL GEOMETRY 3 0 0 3
Course Outcome
CO1: Understanding convex hull and triangulation techniques.
CO2: Describing Verona diagrams and their applications.
CO3: Analyzing geometric searching and visibility algorithms.
CO4: Evaluating line arrangements and combinatorial geometry.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Convex hulls: construction in 2d and 3d, lower bounds; 8 Triangulations: polygon
triangulations, representations, point-set, triangulations, planar graphs.
UNIT-II [9 SESSIONS]

Voronoi diagrams: construction and applicant ions, variants; Delayney, 8 triangulations: divide-
and- conquer, flip and incremental algorithms, duality of Voronoi diagrams, min-max angle
properties
UNIT-III [9 SESSIONS]

Geometric searching: point-location, fractional cascading, linear, 8 programming with prune and
search, finger trees, concatenable queues, segment trees, interval trees; Visibility: algorithms for
weak and strong visibility, visibility with reflections, art-gallery problems.
UNIT-IV [9 SESSIONS]

Arrangements of lines: arrangements of hyper planes, zone theorems, 8 many-faces complexity

and algorithms; combinatorial geometry: Ham- sandwich cuts.
UNIT-V [9 SESSIONS]

Code Generation: Design Issues, the Target Language. Addresses, 8 in the Target Code, Basic
Blocks and Flow Graphs, Optimization of Basic Blocks, Code Generator. Code optimization:
Machine-Independent Optimizations, Loop optimization, DAG representation of basic blocks,
value numbers and algebraic laws, Global Data-Flow analysis
Text Books
1. Computational Geometry: An Introduction by Franco P. Preparata and Michael Ian
Shamos; Springer Verlag
2. Mark de Berg , Marc van Kreveld , Mark Overmars , and Otfried Schwarzkopf,
 Computational Geometry, Algorithmsand Applications , Springer-Verlag.
Reference Books
1. Ketan Mulmuley, Computational Geometry: An Introduction through
Randomized Algorithms, Prentice-Hall
2. Joseph O'Rourke, Computational Geometry in C, Cambridge University Press
COURSE CODE COURSE TITLE L T P C
CSE 423 CYBER LAW AND ETHICS 3 0 0 3
Course Outcome
CO1: Understanding information systems fundamentals.
CO2: Describing security threats in applications and data.
CO3: Analyzing secure information systems with governance and risk management.
CO4: Evaluating policies to safeguard information assets.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Introduction: Introduction to Information Systems, Types of Information Systems,
Development of Information Systems, Introduction to Information Security, Need for
Information Security, Threats to Information Systems, Information Assurance, Cyber Security,
and Security Risk Analysis.
UNIT-II [9 SESSIONS]

Application Security: Application Security (Database, E-mail and Internet), Data Security
Considerations- Backups, Archival Storage and Disposal of Data, Security Technology- Firewall
and VPNs, Intrusion Detection, Access Control. Security Threats -Viruses, Worms, Trojan
Horse, Bombs, Trapdoors, Spoofs, E-mail Viruses, Macro Viruses, Malicious Software, Network
and Denial of Services Attack, Security Threats to E-Commerce- Electronic Payment System, e-
Cash, Credit/Debit Cards. Digital Signature, Public Key Cryptography.
UNIT-III [9 SESSIONS]

Developing Secure Information System: Application Development Security, Information

Security Governance & Risk Management, Security Architecture & Design Security Issues in
Hardware, Data Storage & Downloadable Devices, Physical Security of IT Assets, Access
Control, CCTV and Intrusion Detection Systems, Backup Security Measures
UNIT-IV [9 SESSIONS]

Security Policies: Development of Policies, WWW Policies, Email Security Policies, Policy
Review Process-Corporate Policies-Sample Security Policies, Publishing and Notification
Requirement of the Policies. Evolving Technology Security – Mobile, Cloud, Outsourcing,
SCM.
UNIT-V [9 SESSIONS]

Information Security Standards-ISO: IT Act, Copyright Act, Patent Law, IPR. Cyber Laws in
India; IT Act 2000 Provisions, Intellectual Property Law: Copyright Law, Software License,
Semiconductor Law and Patent Law. Case Study – Corporate Security
Text Books
3. Charles P. Pfleeger, Shari Lawerance Pfleeger, “Analysing Computer Security”,
Pearson EducationIndia.
4. V. K. Pachghare, “Cryptography and information Security”, PHI Learning Private
Limited, DelhiIndia.
Reference Books
3. K Anshul Kaushik, “Cyber Security”, Khanna Publishing House.
4. Dr.Surya Prakash Tripathi, Ritendra Goyal, Praveen Kumar Shukla, “Introduction
to Information Security and Cyber Law”, Willey Dreamtech Press.
COURSE CODE COURSE TITLE L T P C
CSE 422 FUNDAMENTALS OF IOT AND
3 0 0 3
APPLICATIONS
Course Outcome
CO1: Understanding IoT fundamentals, architectures, and enabling technologies.
CO2: Describing sensor networks, development boards, and wireless tech for IoT.
CO3: Analyzing wireless communication protocols and edge connectivity.
CO4: Evaluating big data concepts, acquisition, storage, and analytics for IoT.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Fundamentals of IoT: Introduction, Definitions & Characteristics of IoT, IoT Architectures,
Physical & Logical Design of IoT, Enabling Technologies in IoT, History of IoT, About
Things in IoT, The Identifiers in IoT, About the Internet in IoT, IoT frameworks, IoT and
M2M.
UNIT-II [9 SESSIONS]

Sensors Networks : Definition, Types of Sensors, Types of Actuators, Examples and Working,

IoT Development Boards: Arduino IDE and Board Types, RaspberriPi Development Kit, RFID
Principles and components, Wireless Sensor Networks: History and Context, The node,
Connecting nodes, Networking Nodes, WSN and IoT.
UNIT-III [9 SESSIONS]

Wireless Technologies for IoT: WPAN Technologies for IoT: IEEE 802.15.4, Zigbee, HART,
NFC, Z- Wave, BLE, Bacnet, Modbus. IP Based Protocols for IoT IPv6, 6LowPAN, RPL,
REST, AMPQ, CoAP, MQTT. Edge connectivity and protocols
UNIT-IV [9 SESSIONS]

Data Handling& Analytics: Introduction, Bigdata, Types of data, Characteristics of Big data,
Data handling Technologies, Flow of data, Data acquisition, Data Storage, Introduction to
Hadoop. Introduction to data Analytics, Types of Data analytics, Local Analytics, Cloud
analytics and applications
UNIT-V [9 SESSIONS]

Applications of IoT: Home Automation, Smart Cities, Energy, Retail Management, Logistics,
Agriculture, Health and Lifestyle, Industrial IoT, Legal challenges, IoT design Ethics, IoT in
Environmental Protection.
Text Books
5. Hakima Chaouchi, ― “The Internet of Things Connecting Objects to the Web” ISBN :
978- 1- 84821-140-7, Wiley Publications
6. Olivier Hersent, David Boswarthick, and Omar Elloumi, ― “The Internet of Things:
Key Applications and Protocols”, WileyPublications
Reference Books
5. Daniel Minoli, ― “Building the Internet of Things with IPv6 and MIPv6: The
Evolving World of M2M Communications”, ISBN: 978-1-118-47347-4, Willy
Publications
6. Pethuru Raj and Anupama C. Raman, "The Internet of Things: Enabling
Technologies, Platforms, and Use Cases", CRC Press
 SIXTH
SEMESTER

COURSE CODE COURSE TITLE L T P C

 CSE 312 INTERNET OF THINGS 3 0 0 3
Course Outcome
CO1: Understanding the fundamental concepts and vision of the Internet of Things (IoT),
including its current state, strategic research directions, and innovation pathways.
CO2: Describing diverse IoT applications and technologies, including future internet technologies,
infrastructure, data management, security, and standardization efforts.
CO3: Analyzing knowledge of IoT architecture, including reference models and architectural
frameworks, to design scalable and interoperable IoT systems.
CO4: Evaluating proficiency in analyzing and implementing IoT reference architectures, covering
functional, information, deployment, and operational views.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Introduction: Internet of Things Today, Time for Convergence, Towards the IoT Universe,
Internet of Things Vision, IoT Strategic Research and Innovation Directions.
UNIT-II [9 SESSIONS]

IoT Applications: Future Internet Technologies, Infrastructure, Networks and Communication,

Processes, Data Management, Security, Privacy & Trust, Device Level Energy Issues, IoT
Related Standardization.
UNIT-III [9 SESSIONS]

IoT Architecture: State of the Art–Introduction, State of the art, Architecture Reference Model-
Introduction, Reference Model and architecture, IoT reference Model.
UNIT-IV [9 SESSIONS]

IoT Reference Architecture: Introduction, Functional View, Information View, Deployment

and Operational View, Other Relevant architectural views.
UNIT-V [9 SESSIONS]

Definitions and Examples: IoT definitions: overview, applications, potential & challenges, and
architecture. IoT examples: Case studies, e.g. sensor body-area-network and control of a smart
home
Text Books
1. Cuno Pfister, Getting Started with the Internet of Things, O‟Reilly Media, ISBN: 978-1-
4493-9357-1
2. Vijay Madisetti and Arshdeep Bahga, “Internet of Things (A Hands-on-Approach)”,
VPT.
 3. Francis daCosta, “Rethinking the Internet of Things: A Scalable Approach to Connecting
Everything”, A press Publications.
Reference Books

1. Electronic Devices and Circuits, Jimmy J Cathey, Schaum‟s outline series, 1988.

2. Digital Principles, 3/e, Roger L. Tokheim, Schaum‟s outline series, 1994.

COURSE CODE COURSE TITLE L T P C

CSE 405 ARTIFICIAL INTELLIGENCE 3 0 0 3
Course Outcome
CO1: Understanding appropriate idealizations for converting real world problems into AI
search problems formulated using the appropriate search algorithm.
CO2: Describing and formalizing the problem.
CO3: Applying the appropriate search method, and write the algorithm for it.
CO4: Evaluating important search concepts, such as the difference between informed and
uninformed search, the definitions of admissible and consistent heuristics and
completeness and optimality.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Introduction to Artificial Intelligence, Foundations and History of Artificial Intelligence,
Applications of Artificial Intelligence, Intelligent Agents, Structure of Intelligent Agents,
Computer vision, Natural Language Processing.
UNIT-II [9 SESSIONS]

Introduction to Search: Searching for solutions, Uninformed search strategies, Informed search
strategies, Local search algorithms and optimistic problems, Adversarial Search, Search for
games, Alpha - Beta pruning
UNIT-III [9 SESSIONS]

Knowledge Representation & Reasoning: Propositional logic, Theory of first order logic,
Inference in First order logic, Forward & Backward chaining, Resolution, Probabilistic
reasoning, Utility theory, Hidden Markov Models (HMM), Bayesian Networks.
UNIT-IV [9 SESSIONS]

Machine Learning: Supervised and unsupervised learning, Decision trees, Statistical learning
models, Learning with complete data - Naive Bayes models, Learning with hidden data – EM
algorithm, Reinforcement learning.
UNIT-V [9 SESSIONS]

Pattern Recognition: Introduction, Design principles of pattern recognition system, Statistical

Pattern recognition, Parameter estimation methods - Principle Component Analysis (PCA) and
Linear Discriminant Analysis (LDA), Classification Techniques – Nearest Neighbor (NN) Rule,
Bayes Classifier, Support Vector Machine (SVM), K – means clustering.
Text Books
1. AI Superpowers, by Kai-Fu Lee (Author), Houghton Mifflin Harcourt Publishers,
 Release September 1, 2018.
2. Philosophy and Theory of Artificial Intelligence by Vincent C. Müller, Call Number:
EBL E-book.
3. Artificial Intelligence: The Basics by Kevin Warwick, Call Number: EBL E-book.
Reference Books

1. Stuart Russell, Peter Norvig, “Artificial Intelligence – A Modern Approach”, Pearson

Education

2. Elaine Rich and Kevin Knight, “Artificial Intelligence”, McGraw-Hill

3. E Charniak and D McDermott, “Introduction to Artificial Intelligence”, Pearson
Education

COURSE CODE COURSE TITLE L T P C

CSE 403 CRYPTOGRAPHY AND NETWORK 3 0 0 3
 SECURITY
Course Outcome
CO1: Understanding fundamental concepts of security attacks, services, and mechanisms,
including an introduction to cryptography and conventional encryption techniques.
CO2: Describing encryption-decryption algorithms, covering graph theory, modular arithmetic,
RSA algorithm, Diffie-Hellman key exchange, and digital signatures.
CO3: Analyzing

CO4: Evauate authentication applications such as Kerberos, X.509, and email security protocols
like PGP and S/MIME.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Introduction: Introduction to security attacks, services and mechanism, introduction to
cryptography. Conventional Encryption: Conventional encryption model, classical encryption
techniques- substitution ciphers and transposition ciphers, cryptanalysis, stereography, stream
and block ciphers. Modern Block Ciphers: Block ciphers principals, Shannon’s theory of
confusion and diffusion, fiestal structure, data encryption standard (DES), strength of DES,
differential and linear crypt analysis of DES, block cipher modes of operations, triple DES,
IDEA encryption and decryption, strength of IDEA, confidentiality using conventional
encryption, traffic confidentiality, key distribution, random number generation
UNIT-II [9 SESSIONS]

Encryption-Decryption Algorithm: Introduction to graph, ring and field, prime and relative
prime numbers, modular arithmetic, Fermat’s and Euler’s theorem, primality testing, Euclid’s
Algorithm, Chinese Remainder theorem, discrete logarithms. Principals of public key crypto
systems, RSA algorithm, security of RSA, key management, Diffie-Hellman key exchange
algorithm, introductory idea of Elliptic curve cryptography, Elganel encryption.
UNIT-III [9 SESSIONS]

Digital Signature: Message Authentication and Hash Function: Authentication requirements,

authentication functions, message authentication code, hash functions, birthday attacks, security
of hash functions and MACS, MD5 message digest algorithm, Secure hash algorithm (SHA).
Digital Signatures: Digital Signatures, authentication protocols, digital signature standards
(DSS), proof of digital signature algorithm.
UNIT-IV [9 SESSIONS]

Authentication Application: Kerberos and X.509, directory authentication service, electronic

mail security-pretty good privacy (PGP), S/MIME.
UNIT-V [9 SESSIONS]

IP Security: Architecture, Authentication header, Encapsulating security payloads, combining

security associations, key management. Web Security: Secure socket layer and transport layer
security, secure electronic transaction (SET). System Security: Intruders, Viruses and related
threads, firewall design principals, trusted systems.
Text Books
1. Johannes A. Buchmann, “Introduction to Cryptography”, Springer-Verlag.
2. Bruce Schiener, “Applied Cryptography”.
Reference Books

1. William Stallings, “Cryptography and Network Security: Principals and Practice”,

Prentice Hall, New Jersy.

COURSE CODE COURSE TITLE L T P C

CSE 344 EXPERT SYSTEM AND FUZZY LOGIC 2 0 0 2
Course Outcome
CO1: Remembering the expert system characteristics, types, and components like
knowledge base and inference engine.
CO2: Understanding architecture and development processes of expert systems.
CO3: Applying logic techniques in expert systems using chaining methods.
CO4: Analyzing rule-based expert systems' structure and conflict resolution strategies.
CO5: Evaluating effectiveness of expert system types in decision-making applications.
COURSE CONTENTS
UNIT-I [10 SESSIONS]
Introduction: Introduction to Expert System – characteristic and types of Expert System –
Architecture and Development Process of Expert System – Inference Engine – Knowledge
Base. Logic and Inferences: Propositional Logic - First Order Logic (FOL) - Resolution
method for FOL - Forward and Backward chaining. Rule-Based And Frame-Based Expert
Systems: Rule-based Expert systems: Structure of rule based expert system - Conflict
resolution - Uncertainty Management - Advantages & disadvantages of rule-based expert
systems - Example - Introduction to JESS. Frame-based Expert systems: Inheritance in frame-
based expert systems, Methods and demons, Interactions of frames and rules, Example.
UNIT-II [10 SESSIONS]

Neural Expert Systems And Prolog Programming: Artificial Neural Network and Neural Expert
Systems: How brain works, the Neuron as a single computing element, Perceptron, Multilayer
FFNN, Backpropagation algorithm, Recurrent networks, Neural expert system. Introduction to
Prolog Programming language: Syntax and meaning of Prolog Programs, Using Data Structures,
Controlling Backtracking, Input and Output, Built-in Predicates, Using Prolog Grammar Rules.
UNIT-III [10 SESSIONS]

Introduction To Fuzzy Logic Principles: Basic concepts of fuzzy set theory – operations of
fuzzy sets – properties of fuzzy sets – Crisp relations – Fuzzy relational equations – operations
on fuzzy relations – fuzzy systems – propositional logic – Inference – Predicate Logic –
Inference in predicate logic – fuzzy logic principles – fuzzy quantifiers – fuzzy inference – fuzzy
rule based systems – fuzzification and defuzzification – types. Advanced Fuzzy Logic
Applications: Fuzzy logic controllers – principles – review of control systems theory – various
industrial applications of FLC adaptive fuzzy systems – fuzzy decision making – Multiobjective
decision making – fuzzy classification – means clustering – fuzzy pattern recognition – image
processing applications – systactic recognition – fuzzy optimization.
Text Books
1. S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, 3rd Edition,
Pearson, 2010.
2. M. Negnevitsky, Artificial Intelligence: A Guide to Intelligent Systems, 3rd Edition ,
Addison Wesley, 2011.
Reference Books

1. D. Khemani, A first course in Artificial Intelligence, McGraw Hill Education (India) Pvt.
Ltd, 2013.

2. S. Kaushik, Artificial Intelligence, CENGAGE Learning, 2011.

3. I. Bratko, Prolog Programming for Artificial Intelligence, Pearson, 4th Edition, 2011.
 PROGRAM
ELECTIVE-2

COURSE CODE COURSE TITLE L T P C

 EXPLORATORY DATA ANALYSIS AND
CSE 061 2 0 2 3
VISUALIZATION
Course Outcome
CO1: Remembering the fundamental data types in Python and the functionalities of
NumPy, including array creation, indexing, and slicing.
CO2: Understanding the structure and operations of Pandas, including Series and
DataFrame objects, along with data indexing and handling missing values.
CO3: Applying techniques for combining datasets using concatenation, merging, and pivot
tables while leveraging high-performance functions in Pandas.
CO4: Analyzing inferential statistics concepts such as distributions, errors, confidence
intervals, and hypothesis testing methods including ANOVA.
CO5: Evaluating data visualization techniques using Matplotlib and Seaborn to effectively
present data through various plot types and graphical representations.
COURSE CONTENTS
UNIT-I [6 SESSIONS]
Introduction to Numpy: Data types in Python - Fixed type arrays, creating arrays, array indexing,
array slicing, reshaping arrays, array concatenation and splitting, Universal Functions,
Aggregations, Broadcasting rules, Comparisons, Boolean Arrays, Masks Fancy Indexing, Fast
Sorting using np.sort and np.argsort, partial sorting Creating Structured Arrays, Compound types
and Record Arrays.
UNIT-II [6 SESSIONS]

Introduction to Pandas: Series Object, DataFrame Object, Data Indexing and Selecting for Series
and DataFrames, Universal Functions for Index Preservation, Index Alignment and Operations
between Series and DataFrames, Handling missing data, operating on Null values, Hierarchical
Indexing.
UNIT-III [6 SESSIONS]

Combining Datasets: Concat, Append, Merge and Joins, Aggregation and Grouping, Pivot
Tables, Vectorized String Operations, Working with Time Series, High-Performance functions -
query() and eval()
UNIT-IV [6 SESSIONS]

Inferential Statistics - Normal distribution, Poisson distribution, Bernoulli distribution, z-score,

p-score, One- tailed and two-tailed, Type 1 and Type-2 errors, Confidence interval, Correlation,
Z-test vs T-test, F- distribution, Chi-square distribution, the chi-square test of independence,
ANOVA
UNIT-V [6 SESSIONS]

Visualization with Matplotlib : Simple Line plots, Scatter plots, Visualizing errors, Density and
Contour plots, Histograms, Binnings, Multiple subplots, Three-dimensional plotting with
Matplotlib, Geographic data with Basemap, Visualization with Seaborn.
Text Books
1. Jake VanderPlas, “Python Data Science Handbook”, O’Reilly Media, 2016.
2. Samir Madhavan, “Mastering Python for Data Science”, Packt Publishing, 2015.
Reference Books
1. "Statistics for Data Science" by James D. Miller.
2. "Data Visualization with Python and Matplotlib" by Daniel Koller
Lab Experiments:
1. Introduction to Pandas and NumPy for Data Handling
2. Data Cleaning and Preprocessing Techniques
3. Descriptive Statistics and Summary Measures
4. Univariate Analysis using Histograms and Boxplots
5. Bivariate and Multivariate Analysis using Seaborn
6. Visualizing Categorical Data using Bar and Pie Charts
7. Time Series Data Visualization using Line Plots
8. Correlation Analysis and Heatmap Visualization
9. Interactive Visualizations using Plotly
10. Exploratory Data Analysis on a Real-world Dataset

COURSE CODE COURSE TITLE L T P C

 CSE 062 R PROGRAMMING 2 0 2 3
Course Outcome
CO1: Remembering the fundamental concepts of R and RStudio, including installation,
basic syntax, and data types such as vectors, lists, and data frames.
CO2: Understanding data manipulation techniques using dplyr, including
importing/exporting data, filtering, selecting, and cleaning data.
CO3: Applying data visualization principles with ggplot2 to create various plots and
customize them through themes, labels, and advanced techniques.
CO4: Analyzing statistical concepts and methods in R, including descriptive statistics,
hypothesis testing, and regression analysis for model evaluation.
CO5: Evaluating reproducible research practices using R Markdown to create reports that
integrate code and visualizations effectively.
COURSE CONTENTS
UNIT-I [6 SESSIONS]
Introduction to R and RStudio
Overview of R and RStudio, Installation and setup, Basic syntax and operations, Data types
and structures (vectors, lists, matrices, data frames), Basic Operations and Functions,
Arithmetic and functions, Basic data manipulation.
UNIT-II [6 SESSIONS]

Data Manipulation with dplyr: Introduction to dplyr, Data import/export, Filtering, selecting,
and arranging data, Mutating and summarizing data, Data Cleaning Techniques, Handling
missing values, Data reshaping with tidyr .
UNIT-III [6 SESSIONS]

Data Visualization with ggplot2: Introduction to ggplot2, Basic plotting: scatter plots, bar plots,
histograms, Customizing plots: themes, labels, and legends, Advanced Visualization Techniques,
Creating complex plots, Using facets and scales.
UNIT-IV [6 SESSIONS]

Statistical Analysis and Modeling : Basic Statistical Concepts, Descriptive statistics and
probability distributions, Hypothesis testing: tests, chi squared tests, Introduction to Regression
Analysis, Simple linear regression, Model evaluation and interpretation
UNIT-V [6 SESSIONS]

Reproducible Research and Final Project

R Markdown Basics, Creating reports with R Markdown, Embedding code and visualizations in
reports.
Text Books
1. "R for Data Science" by Hadley Wickham and Garrett Grolemund Online resources
and tutorials for R and RStudio.
2. "The Art of R Programming: A Tour of Statistical Software Design" by Norman
Matloff
Reference Books
1. "Statistics for Data Science" by James D. Miller
2. "Practical Statistics for Data Scientists: 50 Essential Concepts" by Peter Bruce and
Andrew Bruce
Lab Experiments:
1. Introduction to R: Data Types and Basic Operations
2. Control Structures: If, Else, Loops in R
3. Functions and Scope in R
4. Working with Vectors, Lists, Matrices, and Data Frames
5. Data Import and Export in R
6. Data Cleaning and Manipulation using dplyr
7. Data Visualization using ggplot2
8. Statistical Analysis and Hypothesis Testing in R
9. Handling Categorical Data and Factors in R
10. Mini Project: Data Analysis using R on a Real-World Dataset
 SEVENTH
SEMESTER

COURSE CODE COURSE TITLE L T P C

 CSE 429 ETHICAL HACKING 3 0 0 3
Course Outcome
CO1: Remembering key hacking terminology and concepts related to ethical hacking,
including reconnaissance, foot printing methods, and information gathering
techniques.
CO2: Understanding the scanning methodologies and enumeration techniques, including
TCP/IP networking, port scanning, and vulnerability assessment.
CO3: Applying web-based hacking techniques to assess web servers and applications, as
well as understanding wireless network security vulnerabilities.
CO4: Analyzing penetration testing methodologies, including different types of tests (black
box, white box) and the structure of penetration testing reports.
CO5: Evaluating remote exploitation techniques, including client-side exploitation,
privilege escalation methods, and tools for maintaining access in compromised
systems.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Introduction to Ethical Hacking: Hacking Terminology, The Ethical Hacker, Reconnaissance,
Information Gathering for the Ethical Hacker, Foot printing, Passive and Active Foot printing,
Foot printing Methods and Tools- Search Engines, Website and E-mail Foot printing, DNS
Foot printing, Network Foot printing.
UNIT-II [9 SESSIONS]

Scanning and Enumeration: TCP/IP Networking, Subnetting, Scanning Methodology,

Identifying Targets, Port Scanning, Evasion, Vulnerability Scanning, Enumeration, Sniffing,
Network Knowledge for sniffing, Active and Passive Sniffing, Sniffing Tools and Techniques.
UNIT-III [9 SESSIONS]

Web-Based Hacking: Servers and Applications, Web servers, Attacking Web Applications,
Wireless Network Hacking, Wireless Networking, Wireless Terminology, Architecture, and
Standards, Wireless Hacking.
UNIT-IV [9 SESSIONS]

Penetration testing, categories of penetration test, black box, white box, fray box, types of
penetration tests, report writing, structure of a penetration testing report, vulnerability
assessment summary, risk assessment, methodology, linux basics.
UNIT-V [9 SESSIONS]
Remote Exploitation: Attacking Network Remote Services, Common Target Protocols, and Tools
of the Trade, Client Side Exploitation, Methods, E-Mails with Malicious Attachments, Post
exploitation, Acquiring Situation Awareness, Privilege Escalation, Maintaining Access,
Backdoors, MSFPayload/MSFEncode, MSFVenom, Dumping the Hashes.
Text Books
1. "CEH Certified Ethical Hacker All-in-One Exam Guide" by Matt Walker, Fourth Edition,
McGraw Hill, 2019.
2. Rafay Baloch “Ethical Hacking and Penetration Testing Guide”, CRC Press, 2015.
3. "Hacking: The Art of Exploitation" by Jon Erickson, Second Edition, No Starch Press,
US, 2008.
Reference Books
1. "The Basics of Hacking and Penetration Testing Ethical Hacking and Penetration Testing
Made Easy” by Patrick Engebretson, Second Edition, Syngress publications, 2013.
2. "Penetration Testing: A Hands-On Introduction to Hacking" by Georgia Weidman, No
Starch Press, US, 2014.

COURSE CODE COURSE TITLE L T P C

 CSE 425 COMPETITIVE CODING 3 0 0 3
Course Outcome
CO1: Remembering the fundamental data structures and algorithms, including arrays,
linked lists, stacks, queues, and basic recursion concepts.
CO2: Understanding the sorting and searching algorithms, including both basic (Bubble
Sort, Linear Search) and advanced techniques (Quick Sort, Binary Search).
CO3: Applying tree and graph algorithms, including tree traversal methods (Pre-order, In-
order) and graph traversal techniques (Breadth-First Search, Depth-First Search).
CO4: Analyzing the dynamic programming concepts and solving basic to advanced
dynamic programming problems effectively.
CO5: Evaluating problem-solving techniques and strategies such as greedy algorithms and
divide-and-conquer methods to optimize code efficiency and performance.
COURSE CONTENTS
UNIT-I [9 SESSIONS]
Data Structures Fundamentals: Arrays and basic array algorithms, Introduction to linked
lists, Stacks and queues implementation, Understanding the basics of recursion.
UNIT-II [9 SESSIONS]

Sorting and Searching Algorithms : Introduction to sorting algorithms (e.g., Bubble Sort,
Selection Sort, Insertion Sort), Advanced sorting algorithms (e.g., Merge Sort, Quick Sort),
Basic searching algorithms (e.g., Linear Search, Binary Search), Advanced searching techniques.
UNIT-III [9 SESSIONS]

Tree and Graph Algorithms : Introduction to trees and binary trees, Tree traversal algorithms
(e.g., Pre-order, In-order, Post-order), Introduction to graphs and graph representations, Graph
traversal algorithms (e.g., Breadth-First Search, Depth-First Search)
UNIT-IV [9 SESSIONS]

Dynamic Programming: Understanding dynamic programming concepts, Basic dynamic

programming problems, Advanced dynamic programming techniques, Practice solving dynamic
programming problems.
UNIT-V [9 SESSIONS]

Problem-solving Techniques and Strategies : Introduction to problem-solving techniques (e.g.,

Greedy Algorithms, Divide and Conquer), Practice applying various problem-solving strategies,
Solving problems from past coding competitions, Tips for optimizing code efficiency and
performance.
Text Books
1. "Competitive Programming" by Steven Halim and Felix Halim
2. "Introduction to Algorithms" by Thomas H. Cormen, Charles E. Leiserson, Ronald L.
Rivest, and Clifford Stein.
Reference Books
1. "Introduction to Algorithms" by Thomas H. Cormen, Charles E. Leiserson, Ronald L.
Rivest, and Clifford Stein.
2. "Data Structures: A Pseudocode Approach with C" by Richard F. Gilberg and Bill D. Irby

COURSE CODE COURSE TITLE L T P C

 CSE 336 CLOUD COMPUTING 3 0 0 3
Course Outcome
CO1: Understanding cloud computing fundamentals, covering types, services, benefits, and
challenges.
CO2: Describing cloud computing models like SaaS and IaaS, and deployment models.

CO3: Acquire knowledge of cloud management, data storage, and collaboration tools.

CO4: Evaluating the importance of virtualization in cloud computing, its types, and implications.

COURSE CONTENTS
UNIT-I [9 SESSIONS]
Fundamental Concepts of Cloud Computing: Goals and Benefits, Risks and Challenges, Cloud
Computing Service, and Deployment Models:Public Cloud, Private Cloud, Hybrid Cloud,
Community Cloud, Multi-Cloud.
UNIT-II [9 SESSIONS]

Cloud-Enabling Technology: Cloud Data Center Technology, Modern Virtualization,

Multitenant Technology, Service Technology and Service APIs, Fundamental of
Containerization, Containers, Container Images, Multi-Container Types. Cloud Infrastructure
Mechanisms: Logical Network Perimeter, Virtual Server, Hypervisor, Cloud Storage Device,
Cloud Usage Monitor, Resource Replication, Ready-Made Environment.
UNIT-III [9 SESSIONS]

Specialized Cloud Mechanisms: Automated Scaling Listener, Load Balancer, SLA Monitor,
Pay-Per-Use Monitor, Audit Monitor, Failover System, Resource Cluster, Multi-Device Broker,
State Management Database Cloud Management Mechanisms: Remote Administration System,
Resource Management System, SLA Management System, Billing Management System.
UNIT-IV [9 SESSIONS]

Cloud Computing Architectures: Workload Distribution Architecture, Elastic Resource Capacity

Architecture, Multi Cloud Architecture, Hypervisor Clustering Architecture, Cloud Balancing
Architecture Specialized Cloud Architectures: Edge Computing Architecture, Fog Computing
Architecture, Meta cloud Architecture, Federated Cloud Application Architecture.
UNIT-V [9 SESSIONS]

Cloud Computing Security: Threat Agents, Common Threats, Cloud Security and Cybersecurity
Access-Oriented Mechanisms: Cloud-Based Security Groups, Hardened Virtual Server Image,
Identity and Access Management (IAM) System, Cloud Security and Cybersecurity Data-
Oriented Mechanisms: Data Loss Prevention (DLP) System, Trusted Platform Module (TPM).
Cloud Delivery Model Considerations: Case Study.
Text Books
1. Thomas Erl, Eric Barceló Monroy, “Cloud Computing: Concepts, Technology, Security,
and Architecture”, 2nd Edition, 2023, Pearson, ISBN: 9780138052287.
2. Sean Howard, “Edge Computing with Amazon Web Services: A practical guide to
architecting secure edge cloud infrastructure with AWS”, 1st Edition, ISBN:
9781835081082, Packt Publishers, 2024.
Reference Books
1. Rajkumar Buyya, Christian Vecchiola, and S. Thamarai Selvi, “Cloud Computing:
Principles and Practice", 2020.
2. Comer, D, “The Cloud Computing Book: The Future of Computing Explained”, 1st
edition,. Chapman and Hall/CRC, 2021. https://doi.org/10.1201/9781003147503.

COURSE CODE COURSE TITLE L T P C

CSE 463 COMPETITIVE CODING LAB 0 0 2 1
Course Outcome
 CO1: Remembering the competitive coding concepts, development environments, and
basic data structures like arrays and linked lists.
CO2: Understanding the time complexity and Big O notation in programming.
CO3: Applying the sorting and searching algorithms through practical problems.
CO4: Analyzing advanced topics like bit manipulation, stacks, queues, and trees.
CO5: Evaluating the problem-solving strategies including dynamic programming, greedy
algorithms, heaps, and hashing.
COURSE CONTENTS
Ex.No List of Experiments
1. Environment Setting
 Overview of Competitive Coding
 Setting up the development environment (IDEs, online judges)
 Introduction to basic data structures (arrays, linked lists, functions, recursion)
2. Time Complexity
 Basic programming constructs in competitive coding
 Time complexity and Big O notation
3. Sorting & Searching
 Introduction to sorting algorithms (bubble, insertion, selection)
 Practice problems on sorting
 Searching algorithms (linear search, binary search)
 Practice problems on searching
4. Bit manipulations
 Practice problems on Bit manipulations
5. Stacks and Queues
 Practice problems on stack and queue implementations
6. Trees & Graphs
 Basic graph traversal algorithms (DFS, BFS)
7. Backtracking
 Basic backtracking algorithms
 Practice problems on backtracking
8. Dynamic Programming
 Top-down and bottom-up approaches
 Fibonacci series as a DP problem
  Practice problems on dynamic programming
9. Greedy algorithms
 Practice problems on greedy algorithms
10. Divide and conquer algorithms
 Practice problems on divide and conquer
11. Heap
 Heaps and priority queues
 Practice problems on heaps
12. Hashing
 Practice problems on hashing
Practice Platforms
1. Regularly practice problems on online coding platforms like Codeforces, HackerRank,
Code Chef, and Leet Code. Contest Simulation: Participate in virtual contests to simulate
real competitive coding environments.
Text Books:

1. "Competitive Programming" by Steven Halim and Felix Halim

2. "Introduction to Algorithms" by Thomas H. Cormen, Charles E. Leiserson, Ronald L.

Rivest, and Clifford Stein

3. Leetcode 50 Common Interview Questions – Leetcode Clean Code Handbook, 2014

COURSE CODE COURSE TITLE L T P C

CSE 461 ETHICAL HACKING LAB 0 0 2 1
Course Outcome
CO1: Remembering the fundamental concepts of foot printing and reconnaissance,
including techniques for information gathering using Google hacking and DNS
 information extraction.
CO2: Understanding network scanning methodologies, including port scanning and
enumeration, as well as the use of IDS and sniffing tools to generate security reports.
CO3: Applying malware analysis techniques by creating and implementing various types
of malware, such as keyloggers, viruses, and Trojans, along with password cracking
methods.
CO4: Analyzing web application vulnerabilities through practical exercises in SQL
injection, session hijacking, and remote file inclusion to assess security weaknesses.
CO5: Evaluating security measures in wireless networks and cloud computing by
implementing encryption algorithms and conducting penetration testing using tools
like Metasploit and Metasploitable.
COURSE CONTENTS
List Of Experiments [30
Sessions]
1. Foot printing and Reconnaissance: Performing foot printing using Google Hacking,
1 website information, information about an archived website, to extract contents of a

website, to trace any received email, to fetch DNS information.

2. "Scanning networks, Enumeration and sniffing: Use port scanning. network scanning
tools, IDS tool, sniffing tool and generate reports."
3. Malware Threats: Worms, viruses, Trojans: Use Password cracking, Dictionary
attack., Encrypt and decrypt passwords, DoS attack, ARP poisoning in windows,
Ifconfig, ping, netstat, traceroute, Steganography tools. Self-Learning Topics: using
additional hacking tools.
4. Developing and implementing malwares: Creating a simple keylogger in python,

creating a virus, creating a trojan. Self-Learning Topics: Additional

implementation of hacking tools.
5. Hacking web servers, web applications: Hacking a website by Remote File Inclusion,

Disguise as Google Bot to view hidden content of a website, to use Kaspersky

for Lifetime without Patch
6. sql injection and Session hijacking : SQL injection for website hacking, session

hijacking. Self-Learning Topics: using additional of hacking tools.

7. Wireless network hacking, cloud computing security, cryptography : Using
 Cryptool to encrypt and decrypt password, implement encryption and decryption
using Ceaser Cipher. Self-Learning Topics: implementing additional encryption
algorithms.
8. Pen testing : Penetration Testing using Meta sploit and metas ploitable,

Text Books
1. "CEH Certified Ethical Hacker All-in-One Exam Guide" by Matt Walker, Fourth Edition,
McGraw Hill, 2019.
2. Rafay Baloch “Ethical Hacking and Penetration Testing Guide”, CRC Press, 2015.
Reference Books
1. "The Basics of Hacking and Penetration Testing Ethical Hacking and Penetration Testing
Made Easy” by Patrick Engebretson, Second Edition, Syngress publications, 2013.
2. "Penetration Testing: A Hands-On Introduction to Hacking" by Georgia Weidman, No
Starch Press, US, 2014.
3. "Hacking: The Art of Exploitation" by Jon Erickson, Second Edition, No Starch Press,
US, 2008.

COURSE CODE COURSE TITLE L T P C

CSE 465 CLOUD COMPUTING LAB 0 0 2 1
Course Outcome
CO1: Remembering the installation processes for VirtualBox or VMware Workstation and
configuring various Linux or Windows operating systems on a host machine.
 CO2: Understanding the setup and execution of a C compiler in a virtual machine,
alongside executing simple programming tasks to reinforce basic coding skills.
CO3: Applying Google App Engine to create and deploy simple web applications.
CO4: Analyzing cloud scenarios through Cloud Sim by implementing and running custom
scheduling algorithms not available in the standard toolset.
CO5: Evaluating file transfer procedures between virtual machines and executing a single-
node Hadoop cluster to run applications like word count effectively.
COURSE CONTENTS
List Of Experiments [30
Sessions]
1. Install Virtual box/VMware Workstation with different flavours of linux or windows OS
on top ofwindows7 or 8.
1
2. Install a C compiler in the virtual machine created using virtual box and execute Simple
Programs
3. Install Google App Engine. Create hello world app and other simple web applications
using python/java.
4. Use GAE launcher to launch the web applications.
5. Simulate a cloud scenario using Cloud Sim and run a scheduling algorithm that is not
present in Cloud Sim.
6. Find a procedure to transfer the files from one virtual machine to another virtual
machine.
7. Find a procedure to launch virtual machine using try stack (Online Open stack Demo
Version)
8. Install Hadoop single node cluster and run simple applications like wordcount
Text Books
1. “Cloud Computing and Virtualization" by Wiley.
2. "Building Cloud and Virtualization Infrastructure" by Mrs. Lavanya S, Dr.
Venkatachalam K, Dr. Saravanakumar N M, Dr. Balamurugan S
Reference Books
1. "Design and Use of Virtualization Technology in Cloud Computing"
2. "Cloud Computing and Virtualization: Security Challenges and Solutions"
 PROGRAM
ELECTIVE-3

COURSE CODE COURSE TITLE L T P C

CSE 071 ARTIFICIAL NEURAL NETWORK 2 0 2 3
Course Outcome
CO1: Remembering the historical development of artificial neural networks, including key
 milestones and comparisons between biological and artificial neural networks.
CO2: Understanding the fundamental models of artificial neural networks, such as the
McCulloch-Pitts neuron model, learning rules, and the architecture of single-layer
and multilayer perceptrons.
CO3: Applying concepts of Adaline and Madaline networks, as well as associative
memory networks, to solve pattern recognition problems.
CO4: Analyzing feedback and feedforward networks, including discrete and continuous
Hopfield nets, backpropagation networks, and radial basis function networks.
CO5: Evaluating self-organizing feature maps and their applications in unsupervised
learning, including methods for determining winners and implementing learning
vector quantization techniques.
COURSE CONTENTS
UNIT-I [6 SESSIONS]
Introduction to Artificial Neural Networks : Introduction, Artificial Neural Networks,
Historical Development of Neural Networks, Biological Neural Networks, Comparison
Between them and the Computer, Comparison Between Artificial and Biological Neural
Network Basic Building Blocks of Artificial Neural Networks, Artificial Neural Network
(ANN) terminologies
UNIT-II [6 SESSIONS]

Fundamental Models of Artificial Neural Networks: Introduction, McCulloch - Pitts Neuron

Model, Learning Rules, Hebbian Learning Rule Perceptron Learning Rule, Delta Learning Rule
(Widrow-Hoff Rule or Least Mean Square(LMS)Rule, Competitive Learning Rule, Out Star
Learning, Boltzmann Based Learning, Hebb Net. Perceptron Networks : Introduction, Single
Layer Perceptron, Brief Introduction to Multilayer Perceptron Networks.
UNIT-III [6 SESSIONS]

Adaline and Madaline Networks: Introduction, Adaline, Madaline. Associative Memory

Networks: Introduction, Algorithms for Pattern Association, Hetero Associative Memory Neural
Networks, Auto Associative Memory Network, Bi- directional Associative Memory.
UNIT-IV [6 SESSIONS]

Feedback Networks: Introduction, Discrete Hopfiled Net, Continuous Hopfiled Net, Relation
between BAM and Hopfiled Nets. Feed Forward Networks: Introduction, Back Propagation
Network (BPN), Radial Basis Function Network (RBFN).
UNIT-V [6 SESSIONS]
Self-Organizing Feature Map : Introduction, Methods Used for Determining the Winner,
Kohonen Self Organizing Feature Maps, Learning Vector Quantization (LVQ),Max Net,
Maxican Hat, Hamming Net.
Text Books
1. Sivanandam, S Sumathi, S N Deepa; “Introduction to Neural Networks”, 2nd ed.,TATA
McGraw HILL : 2005.
2. "Neural Networks for Pattern Recognition" by Simon Haykin
Publisher: Pearson Education
Reference Books
1. Simon Haykin, “Neural networks A comprehensive foundations”, 2nd ed., Pearson
Education, 2004.
2. Li Min Fu, “Neural networks in Computer intelligence”, 1st ed., TMH, 200
3. B Yegnanarayana, “Artificial neural networks”, 1st ed., Prentice Hall of India P Ltd, 2005.
Lab Experiments:
1. Introduction to Perceptron and Logic Gate Implementation
2. Implementing Multi-Layer Perceptron (MLP) from Scratch
3. Backpropagation Algorithm for Supervised Learning
4. Activation Functions: Sigmoid, Tanh, ReLU – Implementation and Comparison
5. Training Neural Networks using Gradient Descent
6. Handwritten Digit Recognition using ANN (MNIST Dataset)
7. Overfitting and Regularization Techniques in Neural Networks
8. Implementing ANN using TensorFlow/Keras
9. Classification Task using ANN on Real-World Dataset
10. Hyperparameter Tuning and Model Evaluation in Neural Networks

COURSE CODE COURSE TITLE L T P C

NEURAL NETWORKS AND DEEP

CSE 072 2 0 2 3
LEARNING
Course Outcome
CO1: Remembering the fundamental concepts of neural networks, including the structure
 and function of biological neurons, artificial neurons, and the basic architecture of
artificial neural networks.
CO2: Understanding single-layer and multi-layer perceptron networks, including the
generalized delta learning rule and backpropagation algorithm for training neural
networks.
CO3: Applying concepts of associative memories, including paradigms of associative
memory, Hebbian learning, and bidirectional associative memory (BAM)
architecture.
CO4: Analyzing historical trends in deep learning and foundational mathematical concepts
such as linear algebra, probability theory, and numerical computation relevant to
neural network training.
CO5: Evaluating fundamental deep learning methods, including (CNNs) and (RNNs),
along with their components and applications in various tasks.
COURSE CONTENTS
UNIT-I [6 SESSIONS]
Introduction: Introduction to Neural Networks: Neural Network, Human Brain, Models of Neuron,
Neural networks viewed as directed graphs, Biological Neural Network, Artificial neuron, Artificial
Neural Network architecture, ANN learning, analysis and applications, Historical notes.
UNIT-II [6 SESSIONS]
Single layer Perception- Multi-Layer Perceptron Networks: Generalized delta learning rule, Back
propagation algorithm.
UNIT-III [6 SESSIONS]
Associative Memories: Paradigms of Associative Memory, Pattern Mathematics, Hebbian Learning,
General Concepts of Associative Memory, Bidirectional Associative Memory (BAM) Architecture, BAM
Training Algorithms: Storage and Recall Algorithm, BAM Energy Function.

UNIT- IV [6 SESSIONS]
Introduction: Historical Trends in Deep Learning - Linear Algebra: Scalars - Vectors - Matrices - Tensors
- Matrices - Norms – Eigen decomposition - Probability and Information Theory: Random variable and
distributed Probability - Bayes Rule -Information Theory and structured probabilistic models. Numerical
Computation: Overflow and Underflow – Gradient-based Optimization – Constrained Optimization.

UNIT - V [6 SESSIONS]
Fundamental Deep Learning Methods: - Convolutional Neural Networks (CNN): convolution, filters,
pooling, stride, drop out, layers and applications; - Recurrent Neural Networks (RNN): unfolding, Back
propagation Through Time (BPTT), LSTM models, bidirectional networks, encoder, decoder and
attention models.
Text Books
1. O J.A. Anderson, an Introduction to Neural Networks, MIT.
2. Laurene V. Fausett, Fundamentals of Neural Networks: Architectures, Algorithms and
Applications, Pearson India.
3. Kosko, Neural Network and Fuzzy Sets, PHI.
Reference Books
1. Yegnanarayana, B., Artificial Neural Networks PHI Learning Pvt. Ltd, 2009.
2. Golub, G., H., and Van Loan, C. F., Matrix Computations, JHU Press, 2013.
3. Satish Kumar, Neural Networks: A Classroom Approach, Tata McGraw-Hill Education,
Lab Experiments:
1. Introduction to Artificial Neural Networks and Deep Learning Frameworks
2. Implementing Feedforward Neural Network using Keras
3. Training a Deep Neural Network with Backpropagation
4. Understanding and Implementing Convolutional Neural Networks (CNN)
5. Image Classification using CNN on CIFAR-10 Dataset
6. Building Recurrent Neural Networks (RNN) for Sequence Data
7. Text Classification using LSTM Networks
8. Transfer Learning with Pre-trained Models (e.g., VGG, ResNet)
9. Model Optimization: Dropout, Batch Normalization, and Learning Rate Scheduling
10. Mini Project: End-to-End Deep Learning Model on Real-world Dataset

COURSE CODE COURSE TITLE L T P C

CSE 073 SOFT COMPUTING 2 0 2 3
Course Outcome
CO1: Remembering the fundamental concepts of neural networks, including neuron
structure, synapses, artificial neurons, and the architecture of single-layer and multi-
layer feedforward networks.
CO2: Understanding various learning techniques in neural networks, such as the
 perceptron model, convergence rules, and backpropagation methods for training
multilayer perceptrons.
CO3: Applying concepts of associative memory, including auto-associative and hetero-
associative memory architectures and their training algorithms.
CO4: Analyzing the principles of fuzzy logic, including fuzzy sets, operations on fuzzy
sets, fuzzy relations, and the process of fuzzy to crisp conversion.
CO5: Evaluating advanced fuzzy logic concepts such as membership functions, fuzzy
rules, and their applications in industrial contexts.
COURSE CONTENTS
UNIT-I [10 SESSIONS]
Neural Networks-Neuron, Nerve structure and synapse, Artificial Neuron and its model,
activation functions, Neural network architecture: single layer and multilayer feed forward
networks, recurrent networks. Various learning techniques; perception and convergence rule,
Auto-associative and hetro-associative memory Back propagation networks Architecture:
perceptron model, solution, single layer artificial neural network, multilayer perception model;
back propagation learning methods, effect of learning rule co-efficient back propagation
algorithm, factors affecting back propagation training, applications.
UNIT-II [10 SESSIONS]

Fuzzy Logic: Basic concepts of fuzzy logic, Fuzzy sets and Crisp sets, Fuzzy set theory and
operations, Properties of fuzzy sets, Fuzzy and Crisp relations, Fuzzy to Crisp conversion. Fuzzy
Logic –II (Fuzzy Membership, Rules Membership functions, interference in fuzzy logic, fuzzy
if-then rules, Fuzzy implications and Fuzzy algorithms, Fuzzyfications & Defuzzificataions,
Fuzzy Controller, Industrial applications.
UNIT-III [10 SESSIONS]

Genetic Algorithm(GA) :Basic concepts, working principle, procedures of GA, flow chart of
GA, Genetic representations, (encoding) Initialization and selection, Genetic operators,
Mutation, Generational Cycle, applications.
Text Books
1. S. Rajsekaran & G.A. Vijayalakshmi Pai, “Neural Networks, Fuzzy Logic and
GeneticAlgorithm:Synthesis and Applications” Prentice Hall of India.
2. N.P.Padhy,”Artificial Intelligence and Intelligent Systems” Oxford University Press.
Reference Books:
3. Siman Haykin,”Neural Netowrks”, Prentice Hall of India
Reference Books
1. Timothy J. Ross, “Fuzzy Logic with Engineering Applications” Wiley India.
2. Kumar Satish, “Neural Networks” Tata Mc Graw Hill
Lab Experiments:
1. Implementation of Fuzzy Logic and Membership Functions
2. Fuzzy Inference System using Mamdani Method
3. Defuzzification Techniques in Fuzzy Systems
4. Solving XOR Problem using Perceptron
5. Backpropagation Algorithm for Multilayer Neural Networks
6. Genetic Algorithm for Optimization Problems
7. Implementing Selection, Crossover, and Mutation in Genetic Algorithms
8. Solving Optimization Problem using Particle Swarm Optimization (PSO)
9. Adaptive Neuro-Fuzzy Inference System (ANFIS) Implementation
10. Comparative Study of Soft Computing Techniques on Real-world Data
 EIGHTH
SEMESTER

COURSE CODE COURSE TITLE L T P C

CSE 331 BIG DATA ANALYTICS 2 0 0 2
Course Outcome
CO1: Understanding big data fundamentals, analytics techniques, and applications.

CO2: Describing Apache Hadoop basics, focusing on data movement and Map Reduce.

CO3: Analyzing Hadoop architecture, including HDFS and Map Reduce paradigm.

CO4: Evaluating Hadoop ecosystem components like YARN and schedulers.

COURSE CONTENTS
UNIT-I [6 SESSIONS]
Introduction to Big Data: Introduction – distributed file system – Big Data and its
importance, Four Vs, Drivers for Big data, Big data analytics, Big data applications.
Algorithms using map reduce, Matrix-Vector Multiplication by Map Reduce.
UNIT-II [6 SESSIONS]

Introduction Hadoop: Big Data – Apache Hadoop & Hadoop Ecosystem – Moving Data in and
out of Hadoop – Understanding inputs and outputs of Map Reduce - Data Serialization.
UNIT-III [6 SESSIONS]

Hadoop Architecture: Hadoop Architecture, Hadoop Storage: HDFS, Common Hadoop Shell
commands, Anatomy of File Write and Read., Name Node, Secondary Name Node, and Data
Node, Hadoop Map Reduce paradigm, Map and Reduce tasks, Job, Task trackers - Cluster Setup
– SSH & Hadoop Configuration – HDFS Administering – Monitoring & Maintenance.
UNIT-IV [6 SESSIONS]

Hadoop Ecosystem and YARN: Hadoop ecosystem components - Schedulers - Fair and
Capacity, Hadoop 2.0 New Features- Name Node High Availability, HDFS Federation, MRv2,
YARN, Running MRv1 in YARN. Hive.
UNIT-V [6 SESSIONS]
Hive, HBase, and Zookeeper : Hive and HiveQL, Hive Architecture and Installation,
comparison with Traditional Databases, HiveQL: Querying Data, Sorting and Aggregating,
MapReduce Scripts, Joins, and Subqueries, HBase Concepts: Advanced Usage and Schema
Design, Advanced Indexing, PIG and Zookeeper: Role of Zookeeper in Cluster Monitoring,
HBase Integration with Zookeeper, Building Applications with Zookeeper.
Text Books
1. Vignesh Prajapati, “Big Data Analytics with R and Hadoop”, Packet Publishing.
2. Tom Plunkett, Brian Macdonald et al, “Oracle Big Data Handbook”, Oracle Press.
3. Boris lublinsky, Kevin t. Smith, Alexey Yakubovich, “Professional Hadoop Solutions”,
Wiley.
Reference Books
1. "Big Data at Work: Dispelling the Myths, Uncovering the Opportunities" by Thomas H.
Davenport, Publisher: Harvard Business Review Press
2. "Big Data in Practice: How 45 Successful Companies Used Big Data Analytics to
Deliver Extraordinary Results" by Bernard Marr , Publisher: Wiley
 COURSE CODE COURSE TITLE L T P C
CSE 460 BIG DATA ANALYTICS LAB 0 0 2 1
Course Outcome
CO1: Remembering basic HDFS commands and their functionalities for managing files
and directories within the Hadoop Distributed File System.
CO2: Understanding the process of reading, writing, and copying files in HDFS to
effectively manage data in a Hadoop environment.
CO3: Applying MapReduce programming to develop a word count application on a single-
 node cluster and analyze a weather dataset on a multi-node cluster.
CO4: Analyzing real-world case studies that demonstrate the applications of MapReduce
in solving complex data processing problems.
CO5: Evaluating user-defined functions in Pig and Hive for filtering unwanted data and
extending functionality in data processing tasks.
COURSE CONTENTS
List Of Experiments [30
Sessions]
1.
Demonstrate the following using HDFS
1

a) Basic HDFS commands

b) Working with Hadoop file system: Reading, Writing and Copying

2. Develop the following applications using MapReduce

a) Word count application using Map Reduce on single node cluster

b) Analysis of Weather Dataset on Multi node Cluster using Hadoop

c) Real world case studies on Map Reduce applications

3. Writing User Defined Functions/Eval functions for filtering unwanted data in Pig

4. Working with Hive on the following

a) HiveQL

b) Writing User Defined Functions in Hive

5. Implement the following on Spark

a) Processing large datasets on Spark framework

b) Word count application

6. Implement structured streaming using spark withretail store dataset

7. Implement streaming using Kafka.

Text Books
1. Tom White, "Hadoop: The Definitive Guide", 4th Edition, O'Reilly Media Inc, 2015.
2. Tanmay Deshpande, “Hadoop Real-World Solutions Cookbook”, 2nd Edition, Packt
Publishing, 2016.
3. Anand Rajaraman and Jeffrey David Ullman, ―Mining of Massive Datasets, Cambridge
 University Press, 2012.
Reference Books

1. Edward Capriolo, Dean Wampler, and Jason Rutherglen, "Programming Hive", O'Reilly
Media Inc, October 2012.

2. Vignesh Prajapati, "Big data Analytics with R and Hadoop", Packt Publishing,
November 2013.
 PROGRAM
ELECTIVE- 4

COURSE CODE COURSE TITLE L T P C

CSE 081 DATA MINING AND DATA WAREHOUSING 3 0 2 4
Course Outcome
CO1: Remembering data warehousing concepts, differences from databases, and their
necessity.
CO2: Understanding data warehouse components, architecture, and the role of metadata.
CO3: Applying ETL processes for data cleaning, transformation, and dimensional
modeling.
 CO4: Analyzing OLAP models, operations, and differences between MOLAP and
ROLAP.
CO5: Evaluating data mining techniques, including classification, clustering, and
association rules.
COURSE CONTENTS
UNIT-I [6 SESSIONS]
Introduction to Data Warehousing: Overview, Difference between Database System and
Data Warehouse, The Compelling Need for data warehousing, Data warehouse – The building
Blocks: Defining Features, data warehouses and data marts, overview of the components,
Three tier architecture, Metadata in the data warehouse.
UNIT-II [6 SESSIONS]

Data Pre-Processing: Data cleaning, Data transformation ETL Process and ETL tools. Defining
the business requirements: Dimensional analysis, information packages – a new concept,
requirements gathering methods, requirements definition: scope and content. Principles of
Dimensional Modeling: Objectives, From Requirements to data design, Multidimensional Data
Model, Schemas: the STAR schema, the Snowflake schema, fact constellation schema.
UNIT-III [6 SESSIONS]

OLAP Models: Demand for Online Analytical Processing, limitations of other analysis methods-
OLAP is the answer, OLAP definitions and rules, OLAP characteristics, major features and
functions, hyper cubes. OLAP Operations: Drill-down and roll-up, slice-and-dice , pivot or
rotation, OLAP models, overview of variations, the MOLAP model, the ROLAP model, the
DOLAP model, ROLAP versus MOLAP, OLAP implementation considerations. Query and
Reporting, Executive Information Systems (EIS), Data Warehouse and Business Strategy.
UNIT-IV [6 SESSIONS]

Data Mining: What is Data Mining, Data Mining Defined, The knowledge discovery process
(KDD Process), Data Mining Applications- The Business Context of Data Mining, Data Mining
for Process Improvement, Data Mining as a Research Tool, Data Mining for Marketing, Benefits
of data mining, Major Data Mining Techniques: Classification and Prediction: Issues Regarding
Classification and Prediction, Classification by Decision Tree Induction, KNN Algorithm.
UNIT-V [6 SESSIONS]

Clustering: Cluster detection, K- means Algorithm, Outlier Analysis, memory-based reasoning,

link analysis, Mining Association Rules in Large Databases: Association Rule Mining, genetic
algorithms, and neural networks. Data mining tools
Text Books
1. W. H. Inmon, “Building the operational data store”, John Wiley.
2. Paul Raj Poonia, “Fundamentals of Data Warehousing”, John Wiley & Sons.
3. Kamber and Han, “Data Mining Concepts and Techniques”, Hart Court India P. Ltd.
Elsevier Publications.
Reference Books
1. Arun K. Pujari, “Data Mining Techniques”, University Press (India) Limited.
2. Efrem O, Mallach, “Decision Support and Data Warehousing Systems” Mcgraw- Hill
International Edition.
Lab Experiments:
1. Introduction to Data Preprocessing Techniques
2. Implementation of Association Rule Mining using Apriori Algorithm
3. Classification using Decision Tree (ID3/CART)
4. Classification using Naive Bayes Algorithm
5. Clustering using K-Means Algorithm
6. Hierarchical Clustering Implementation
7. Data Warehousing: Creating Star and Snowflake Schemas
8. OLAP Operations: Roll-up, Drill-down, Slice and Dice
9. Dimensionality Reduction using PCA
10. Mini Project: Applying Data Mining Techniques on a Real-world Dataset

COURSE CODE COURSE TITLE L T P C

CSE 082 DEVOPS TOOLS 3 0 2 4
Course Outcome
CO1: Remembering the fundamental concepts of DevOps, including its perspective,
relationship with Agile, team structures, and coordination challenges.
CO2: Understanding the features of cloud platforms and the consequences of unique cloud
features on DevOps practices and operations.
CO3: Applying Git for version control by utilizing its command lines, understanding the
 Git process, and implementing branching strategies with Gitflow.
CO4: Analyzing continuous integration and continuous delivery (CI/CD) principles using
tools like Jenkins and GitLab CI to streamline software development.
CO5: Evaluating containerization techniques with Docker and orchestration using
Kubernetes, including deployment practices and best practices in DevOps.
COURSE CONTENTS
UNIT-I [6 SESSIONS]
Introduction to DevOps: DevOps Perspective, DevOps and Agile, Team Structure,
Coordination, Barriers, The Cloud as a Platform: Features of the Cloud, DevOps Consequences
of the Unique Cloud Features, Operations: Operations Services, Scrum, Kanban, and Agile.
UNIT-II [6 SESSIONS]

Overview GIT and its principal command lines: Installation, Configuration, Vocabulary, Git
Command Lines, Understanding the GIT process and Gitflow pattern: Starting with the Git
Process, Isolating your code with branches, Branching Strategy with Gitflow.
UNIT-III [6 SESSIONS]

Continuous Integration and Continuous Delivery: Technical Requirements CI/CD principles,

Using a package manager in the CI/CD process, Using Jenkins for CI/CD implementation ,
Using GitLab CI .
UNIT-IV [6 SESSIONS]

Containerizing your application with Docker: Installing Docker, Creating Docker file,
Building and running a container on a local machine, Pushing an Image to Docker Hub,
Deploying a container to ACI with CI/CD pipeline. Using Docker for running command Line
tools, Introduction to Kubernetes Tools: Docker Compose, Docker Swarm
UNIT-V [6 SESSIONS]

Getting Started with Docker Composer, Deploying a Docker compose containers in ACI,
Installing Kubernetes, First example of Kubernetes application of deployment, Deploying the
code: The Puppet master and Puppet agents, Ansible, PalletOps, Deploying with SaltStack,
DevOps Best Practices, Tools: Ansible, Saltstack.
Text Books
1. Len Bass, Ingo Weber and Liming Zhu, DevOps: A Software Architect’s Perspective,
Addison-Wesley, Pearson Publication, Second Edition, 2015.
2. Mikael Krief, Learning DevOps: A comprehensive guide to accelerating DevOps culture
adoption with Terraform, Azure DevOps, Kubernetes, and Jenkins, Packt Publishing,
 2022.
Reference Books
1. Ryan Russell and Jason Southgate, “Mastering Puppet 5: Optimize enterprise-grade
environment performance with Puppet”, Packt Publishing ,2018.
2. Joakim Verona, “Practical DevOps”, 2nd edition, Packt Publishing, 2018.
Lab Experiments:
1. Introduction to Version Control using Git and GitHub
2. Automating Builds using Maven or Gradle
3. Continuous Integration using Jenkins
4. Containerization using Docker
5. Orchestrating Containers with Kubernetes
6. Configuration Management using Ansible
7. Infrastructure as Code using Terraform
8. Monitoring Applications using Prometheus and Grafana
9. Deploying Web Applications on AWS Cloud
10. CI/CD Pipeline Implementation for a Sample Project

COURSE CODE COURSE TITLE L T P C

CSE 083 CYBER SECURITY 3 0 2 4
Course Outcome
CO1: Remembering the fundamental concepts of logging, including the types of logs, the 5
W’s (Who, What, When, Where, and Why), and the differences between Unix and
Windows logs.
CO2: Understanding various log formats such as CLF, Apache logs, and JSON log format,
as well as how to analyze and summarize log data using tools like Excel.
CO3: Applying log management tools and techniques, including SYSLOG and scripting in
 Python and Shell, to effectively manage log files through rotation and archival
processes.
CO4: Analyzing log collection methods, event correlation, and normalization techniques
using SIEM tools to enhance security monitoring and reporting capabilities.
CO5: Evaluating service delivery concepts within ITIL frameworks, including service
management principles and ticketing systems to improve operational efficiency.
COURSE CONTENTS
UNIT-I [6 SESSIONS]
INTRODUCTION: Concepts of Log, What Should the Logs Log? Everything - The 5 Ws
(Who, What, When, Where, and Why) - Unix Logs – Windows Logs - Windows Event ID -
Events and Event Lifecycle - Linux Logs - Types of logs - Security logs - Application logs –
System Logs- Practical component: Run an application on Linux to see the Linux logs. Export
log to text files. Script for searching logs.
UNIT-II [6 SESSIONS]

LOG FORMATS: Log files – Log formats – CLF - Application specific Log Formats – Apache
Logs Format – IIS Log Format – JSON Log Format – Log 4J Format - Mail logs Format – Mail
Error Code – HTTP Error Code - Firewall Logs Format– vendor Specific Logs Format. Practical
component: Import Apache logs to Excel and summarize. Identify the HTTP error.
UNIT-III [6 SESSIONS]

MANAGING LOG FILES: Log tools – SYSLOG – Python Scripting - SHELL Scripting - Open-
source Log analyzers - Log File Conversion Log Rotation and Archival - Determining an
Archiving Methodology -Separating Logs, Security Controls - Log Management - Policies
Case Studies-Practical component: Write a log management policy for log management.
UNIT-IV [6 SESSIONS]

LOG COLLECTION: Event Correlation - Event Normalization, Correlation Rules - Rule Engine
- Rule Management - Log Collection - Push Log, Pull Log Collection - Prebuilt Log Collection -
Custom Log - Parsing/Normalization of Logs - Correlation Engine - SIEM Tools
Demonstration- Reports Generation. Practical component: Run SIEM Tool.
UNIT-V [6 SESSIONS]

SERVICE DELIVERY: Introduction and Key concepts of service management -Four dimensions
of service management –Ticketing System - ITIL Service value system Principles - Service
Value chain Practices - Case Studies. Practical component: Ticketing workflow.
Text Books
 1. ITIL 4: Acquiring and Managing Cloud Services, AXELOS, 2021.
2. ITIL 4: Create Deliver and Support, AXELOS, 2021.
3. Robert Johnston, Michael Shulver, Nigel Slack and Graham Clark (2021), Service
Operations Management – Pearson 5th Edition. (2021).
Reference Books
1. Don Murdoch (2019).Blue Team Handbook: SOC, SIEM, and Threat Hunting Use Cases
2. Phillip Q. Maier (2006).Audit and Trace Log Management Consolidation and Analysis
Lab Experiments:
1. Introduction to Kali Linux and Basic Security Tools
2. Scanning Networks using Nmap
3. Performing Vulnerability Assessment using Nessus
4. Password Cracking using John the Ripper and Hydra
5. Packet Sniffing and Analysis using Wireshark
6. Implementing Firewall Rules using iptables
7. Web Application Security Testing using OWASP ZAP
8. SQL Injection and Prevention Techniques
9. Cross-Site Scripting (XSS) Attacks and Countermeasures
10. Secure File Transfer and Encryption using GPG
 PROGRAM
ELECTIVE-5

COURSE CODE COURSE TITLE L T P C

CSE 084 NATURAL LANGUAGE PROCESSING 3 0 2 4
Course Outcome
CO1: Understanding word and document structures, including morphology and complexities.

CO2: Describing natural language syntax using parsing algorithms and tree banks.

CO3: Analyzing semantic parsing methods, including interpretation and disambiguation.

CO4: Evaluating predicate-argument structures and meaning representation systems, assessing

 relevant software.
COURSE CONTENTS
UNIT-I [6 SESSIONS]
Finding the Structure of Words: Words and Their Components, Issues and Challenges,
Morphological Models Finding the Structure of Documents: Introduction, Methods,
Complexity of the Approaches, Performances of the Approaches.
UNIT-II [6 SESSIONS]

Syntax Analysis: Parsing Natural Language, Tree banks: A Data-Driven Approach to Syntax,
Representation of Syntactic Structure, Parsing Algorithms, Models for Ambiguity Resolution in
Parsing, Multilingual Issues
UNIT-III [6 SESSIONS]

Semantic Parsing: Introduction, Semantic Interpretation, System Paradigms, Word Sense

Systems, Software.
UNIT-IV [6 SESSIONS]

Predicate-Argument Structure, Meaning Representation Systems, Software.

UNIT-V [6 SESSIONS]

Discourse Processing: Cohesion, Reference Resolution, Discourse Cohesion and Structure

Language Modeling: Introduction, N-Gram Models, Language Model Evaluation, Parameter
Estimation, Language Model Adaptation, Types of Language Models, Language-Specific
Modeling Problems, Multilingual and Cross Lingual Language Modeling.
Text Books
1. W. H. Inmon, “Building the operational data store”, John Wiley.
2. Paul Raj Poonia, “Fundamentals of Data Warehousing”, John Wiley & Sons.
3. Kamber and Han, “Data Mining Concepts and Techniques”, Hart Court India P. Ltd.
Elsevier
Reference Books
1. Breck Baldwin, Language Processing with Java and LingPipe Cookbook, Atlantic
Publisher, 2015.
2. Richard M Reese, Natural Language Processing with Java‖, O‗Reilly Media, 2015.
3. Tanveer Siddiqui, U.S. Tiwary, ―Natural Language Processing and Information
Retrieval‖, Oxford University Press, 2008.
Lab Experiments:
1. Text Preprocessing: Tokenization, Stopword Removal, and Stemming
 2. Lemmatization and Part-of-Speech (POS) Tagging
3. Bag of Words and TF-IDF Vectorization
4. Named Entity Recognition (NER) using spaCy
5. Sentiment Analysis using TextBlob and VADER
6. N-gram Language Modeling and Text Generation
7. Word Embeddings using Word2Vec and GloVe
8. Text Classification using Naive Bayes
9. Building a Chatbot using NLTK or Rasa
10. Topic Modeling using Latent Dirichlet Allocation (LDA)

COURSE CODE COURSE TITLE L T P C

CSE 085 DATA ANALYTICS 3 0 2 4
Course Outcome
CO1: Remembering the fundamental concepts of data analytics, including data sources,
classifications, characteristics, and the importance of analytics in modern contexts.
CO2: Understanding the phases of the data analytics lifecycle, including discovery, data
 preparation, model planning, model building, communicating results, and
operationalization.
CO3: Applying various data analysis techniques such as regression modeling, multivariate
analysis, and time series analysis to derive insights from data.
CO4: Analyzing the processes involved in mining data streams and real-time analytics
applications through case studies and practical examples.
CO5: Evaluating clustering techniques and frequent itemset mining methods to uncover
patterns and relationships within large datasets.
COURSE CONTENTS
UNIT-I [6 SESSIONS]
Introduction to Data Analytics: Sources and nature of data, classification of data (structured,
semi-structured, unstructured), characteristics of data, introduction to Big Data platform, need
of data analytics, evolution of analytic scalability, analytic process and tools, analysis vs
reporting, modern data analytic tools, applications of data analytics. Data Analytics Lifecycle:
Need, key roles for successful analytic projects, various phases of data analytics lifecycle –
discovery, data preparation, model planning, model building, communicating results,
operationalization
UNIT-II [6 SESSIONS]

Data Analysis: Regression modeling, multivariate analysis, Bayesian modeling, inference and
Bayesian networks, support vector and kernel methods, analysis of time series: linear systems
analysis & nonlinear dynamics, rule induction, neural networks: learning and generalisation,
competitive learning, principal component analysis and neural networks, fuzzy logic: extracting
fuzzy models from data, fuzzy decision trees, stochastic search methods
UNIT-III [6 SESSIONS]

Mining Data Streams: Introduction to streams concepts, stream data model and architecture,
stream computing, sampling data in a stream, filtering streams, counting distinct elements in a
stream, estimating moments, counting oneness in a window, decaying window, Real-time
Analytics Platform ( RTAP) applications, Case studies – real time sentiment analysis, stock
market predictions.
UNIT-IV [6 SESSIONS]

Frequent Itemsets and Clustering: Mining frequent itemsets, market based modelling, Apriori
algorithm, handling large data sets in main memory, limited pass algorithm, counting frequent
itemsets in a stream, clustering techniques: hierarchical, K-means, clustering high dimensional
data, CLIQUE and ProCLUS, frequent pattern based clustering methods, clustering in non-
euclidean space, clustering for streams and parallelism.
UNIT-V [6 SESSIONS]

Frame Works and Visualization: MapReduce, Hadoop, Pig, Hive, HBase, MapR, Sharding,
NoSQL Databases, S3, Hadoop Distributed File Systems, Visualization: visual data analysis
techniques, interaction techniques, systems and applications.
Text Books
1. Anand Rajaraman and Jeffrey David Ullman, Mining of Massive Datasets, Cambridge
University Press.
2. John Garrett, Data Analytics for IT Networks : Developing Innovative Use Cases, Pearson
Education
3. Bill Franks, Taming the Big Data Tidal wave: Finding Opportunities in Huge Data
Streams with Advanced Analytics, John Wiley & Sons.
Reference Books
1. Michael Minelli, Michelle Chambers, and Ambiga Dhiraj, "Big Data, Big Analytics:
Emerging Business Intelligence and Analytic Trends for Today's Businesses", Wiley
2. David Dietrich, Barry Heller, Beibei Yang, “Data Science and Big Data Analytics”,
EMC Education Series, John Wiley
3. Frank J Ohlhorst, “Big Data Analytics: Turning Big Data into Big Money”, Wiley and
SAS Business Series
Lab Experiments:
1. Introduction to Data Analytics using Python (NumPy & Pandas)
2. Data Cleaning and Handling Missing Values
3. Exploratory Data Analysis using Visualization Tools
4. Descriptive Statistics and Data Summarization
5. Correlation and Covariance Analysis
6. Data Aggregation and Grouping using Pandas
7. Hypothesis Testing and Statistical Inference
8. Linear Regression Analysis and Model Evaluation
9. Classification using Logistic Regression
10. Mini Project: End-to-End Data Analytics on Real-world Dataset
 OPEN
ELECTIVE-II

COURSE CODE COURSE TITLE L T P C

CSE 414 HISTORY OF SCIENCE & ENGINEERING 3 0 0 3
Course Outcome
CO1: Understanding the historical roots and perspectives of science and technology.

CO2: Describing post-independence policies and plans for science and technology development.

CO3: Analyzing research and development efforts in India, including education and technology
promotion.
 CO4: Evaluating major advancements in areas like space, defense, biotechnology, and energy.

COURSE CONTENTS
UNIT-I [12 SESSIONS]
Historical Perspective: The nature of science and technology, Roots of science and technology
in India, Science and society, Scientists and society, Science and Faith and the rise of applied
sciences.
UNIT-II [12 SESSIONS]

Policies and Plans after Independence :Nehru‟s vision of science for independent India, Science
and technology developments in the new era science and technology developments during the
Five Year Plan Periods and science and technology policy resolutions.
UNIT-III [12 SESSIONS]

Research and Development (R&D) in India: Expenditure in R&D, Science and Technology
Education, Research activities and promotion of technology development, Technology mission,
Programs aimed at technological self-reliance, activities of council of scientific and industrial
research (CSIR).
UNIT-IV [12 SESSIONS]

Science and Technological Developments in Major Areas: Space – Objectives of space

programs, Geostationary Satellite Services – INSAT system and INSAT services remote sensing
applications, Launch Vehicle Technology, Ocean Development – Objectives of ocean
development, Biological and mineral resources, Marine research and capacity building

Defence Research – Spin-off technologies for civilian use, Biotechnology – Applications of

biotechnology in medicine, Biocatalysts, Agriculture, Food, Fuel and Fodder, Development of
biosensors and animal husbandry, Energy – Research and development in conservation of
energy, India‟s nuclear energy program, technology spin-offs.
UNIT-V [12 SESSIONS]

. Nexus between Technology Transfer and Development: Transfer of Technology – Types,

Methods, Mechanisms, Process, Channels and Techniques, Appropriate technology, Technology
assessment, Technological forecasting, Technological innovations and barriers of technological
change.
Text Books
4. Ramasamy, K.A., and Seshagiri Rao, K., (Eds), Science, Technology and education
for Developlemnt, K., Nayudamma Memorial Science Foundation, Chennai – 8.
5. Kohili, G.R., the Role and Impact of Science and Technology in the Development of
 India, Surjeet Publications.
Reference Books
4. Government of India, Five Year Plans, Planning Commission, New Delhi.
5. Sharma K.D., and Quresh M.A., Science, Technology and Development,
Sterling Publications (P) Ltd., New Delhi.

COURSE CODE COURSE TITLE L T P C

CSE 416 COMPUTATIONAL COMPLEXITY 3 0 0 3
Course Outcome
CO1: Remembering the foundational computational models such as Turing Machines,
Universal Turing Machines, and their role in defining complexity classes like P and
NP
CO2: Understanding the key theorems like Cook-Levin, Savitch’s Theorem, and Ladner’s
 Theorem, along with their proofs and implications in computational complexity.
CO3: Applying the space complexity concepts such as configuration graphs and log-space
reductions to solve problems like reachability in NL and PSPACE.
CO4: Analyzing the relationships between computational paradigms, including the
Polynomial Hierarchy, Alternating Turing Machines, and circuit complexity classes
like P/poly and NC.
CO5: Evaluating the power and limitations of randomized computation models by
critically examining classes such as RP, BPP, and ZPP.
COURSE CONTENTS
UNIT-I [12 SESSIONS]
Review of Basics Concepts. Turing Machine Model of Computation, Universal Turing
Machines, Deterministic Turing Machine and Class P. Non-deterministic Turing Machines and
Class NP. Satisfiability and Circuit Value Problems. Polynomial time verifiability, Polynomial-
time reductions and NP-completene .
Cook -Levin Theorem and its proof, Other Time Complexity Classes co-NP, EXP and NEXP.
ss.
UNIT-II [12 SESSIONS]

Diagonalization: Deterministic Time Hierarchy Theorem, Non-deterministic Time Hierarchy

Theorem (without proof), Ladner’s Theorem, Oracle Machines and Limits of Diagonalization -
Baker-Gill-Solovay theorem.
UNIT-III [12 SESSIONS]

Space Complexity: Space Hierarchy Theorem. Classes PSPACE, L, NL and co-NL, Savitch’s
Theorem, Configuration Graphs, Reachability Problems, Log space reductions, Completeness
Results (PSPACE completeness and NL-completeness), NL=co-NL.
UNIT-IV [12 SESSIONS]

The Polynomial Hierarchy and Circuits: The Polynomial Hierarchy, Alternating Turing
Machines, Circuit Model of Computation, Non-uniformity, Class P/poly, Karp-Lipton Theorem,
Parallel Computations and Class NC, P-completeness
UNIT-V [12 SESSIONS]

Randomized Computation : Probabilistic Turing Machines, Classes RP, co-RP, BPP, ZPP.
Sipser-Gacs theorem, Adleman’s theorem.
Text Books
1. Sanjeev Arora and Boaz Barak, Computational Complexity: A Modern Approach,
 Cambridge University Press, 1 edition, 2009, ISBN-13: 978-0521424264.
2. Oded Goldreich, Computational Complexity: A Conceptual Perspective, Cambridge
University Press, 1 edition, 2008, ISBN-13: 978-0521884730.
Reference Books
1. Michiel Siper, Introduction to the theory of computation, Cengage, 3 edition, 2014,
ISBN- 13: 978-8131525296.
2. Luca Trevisan, Lecture Notes on Computational Complexity .

COURSE CODE COURSE TITLE L T P C

CSE 424 HUMAN COMPUTER INTERACTION 3 0 0 3
Course Outcome
CO1: Understanding benefits of good UI design.

CO2: Applying UI design principles in screen design.

CO3: Analyzing organizing screen elements.

CO4: Evaluating effective navigation schemes and controls.

COURSE CONTENTS
UNIT-I [12 SESSIONS]
Importance of user Interface – definition, importance of 8 good designs. Benefits of good
design. A brief history of Screen design. The graphical user interface – popularity of graphics,
the concept of direct manipulation, graphical system, Characteristics, Web user – Interface
popularity, characteristics- Principles of user interface.
UNIT-II [12 SESSIONS]

Design process: Human interaction with computers, importance of 8 human characteristics

human consideration, Human interaction speeds, and Understanding business junctions. III
Screen Designing: Design goals – Screen Designing.
UNIT-III [12 SESSIONS]

Design goals – Screen planning and purpose, 8 organizing screen elements, ordering of screen
data and content – screen navigation and flow – Visually pleasing composition – amount of
information – focus and emphasis – presentation information simply and meaningfully –
information retrieval on web – statistical graphics – Technological consideration in interface
design.
UNIT-IV [12 SESSIONS]

New and Navigation schemes selection of window, 8 selection of devices based and screen-
based controls. Components – text and messages, Icons and increases – Multimedia, colors, uses
problems, choosing colors.
UNIT-V [12 SESSIONS]

Software Tools: Specification methods, interface – Building Tools. 8 Interaction Devices –

Keyboard and function keys – pointing devices – speech recognition digitization and generation
– image and video displays – drivers.
Text Books
3. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale Human Computer Interaction, 3rd
Edition Prentice Hall, 2004.
4. Jonathan Lazar Jinjuan Heidi Feng, Harry Hochheiser, Research Methods in Human
Computer Interaction, Wiley, 2010.
5. Ben Shneiderman and Catherine Plaisant Designing the User Interface: Strategies for
Effective Human-Computer Interaction (5th Edition, pp. 672, ISBN 0- 321-53735-1,
March 2009), Reading, MA: Addison-Wesley Publishing Co.
Reference Books
3. Designing the user interface. 3rd Edition Ben Shneidermann, Pearson Education Asia.
4. Interaction Design Prece, Rogers, Sharps. Wiley Dreamtech.
5. User Interface Design, Soren Lauesen, Pearson Education