Bharati Vidyapeeth

(Deemed to be University)
Pune, India

College of Engineering, Pune

B. Tech (Information Technology)

(2023 CBCS COURSE)
Program Curriculum
As Per NEP Guidelines
VISION OF THE UNIVERSITY

Social Transformation through Dynamic Education

MISSION OF THE UNIVERSITY

• To make available quality education in different areas of knowledge to the

students as per their choice and inclination
• To offer education to the students in a conducive ambience created by
enriched infrastructure! and academic facilities in its campuses.
• To bring education within the reach of rural, tribal and girl students by
providing them substantive fee concessions and subsidized hostel and mess
facilities
• To make available quality education to the students of rural, tribal and
other deprived sections of the population
VISION OF THE INSTITUTE

To be World Class Institute for Social Transformation Through Dynamic

Education.

MISSION OF THE INSTITUTE

• To provide quality technical education with advanced equipment, qualified

faculty members, infrastructure to meet needs of profession and society.
• To provide an environment conducive to innovation, creativity, research
and entrepreneurial leadership.
• To practice and promote professional ethics, transparency and
accountability for social community, economic and environmental
conditions.
VISION OF THE DEPARTMENT

To be a leading Programme, transforming students into skilled IT professionals.

MISSION OF THE DEPARTMENT

• Amplify the student’s technical skills by conducting continuing education

programs, organizing and participating in various technical events.

• Provide comprehensive support in synchronization with industry to achieve

professional and technological excellence.

• Provide an environment for effective social and ethical skills.

PROGRAM EDUCATIONAL OBJECTIVES

PEO1: Cultivate IT graduates for industry, pertaining to Information Technology

solutions.

PEO2: Practice technical competency and teamwork abilities.

PEO3: Exhibit social responsibilities by following ethical practices in graduate’s

professional pursuits.

PROGRAM OUTCOMES

1. Apply knowledge of Mathematics and Computer Science to analyse computer-

based information systems.

2. Apply logical and programming skills to identify, formulate and analyse for
solving computational problems.

3. Examine complex problems by a diagnosis of available information to provide

an appropriate conclusion.

4. Design applications with suitable consideration of societal needs.

5. Use functional skills of modern IT tools and techniques for modelling
and implementation.

6. Play the role of a team player to accomplish a common goal.

7. Convey technological concepts through significant documentation and

presentation skills.

8. Demonstrate professional conduct by following norms of the Engineering

practice.

9. Apply Software Engineering methodologies for sustainable development.

10. Follow ethical and legal practices related to the functioning of the IT industry.

11. Apply management skills and techniques for creating time-bound and cost-
effective projects.

12. Exhibit lifelong learning by upgrading to state-of-the-art IT practices and

technology.

PROGRAM SPECIFIC OUTCOMES

At the end of the program, Graduates will be able to

PSO 1: Use knowledge of core and allied courses for developing a computer-
based system to deliver a quality product for real-world problems of society.

PSO 2: Apply modern IT tools and techniques for perusing student’s professional
career by practicing effective communication with team members.

PSO 3: Develop time-bound, cost-effective, and sustainable solutions by

following professional ethics.
 CORELATION BETWEEN GRADUATE ATTRIBUTES AND
PROGRAMME OUTCOMES

Graduate Attributes/

Programme a b c d e f g h i j k l
Outcomes

Engineering
✓
Knowledge

Problem Analysis ✓

Design/Development
✓
of Solutions

Conduct
Investigations of ✓
Complex Problems

Modern Tool Usage ✓

The Engineer and

✓
Society

Environment and
✓
Sustainability

Ethics ✓

Individual and
✓
Teamwork

Communication ✓

Project Management
✓
and Finance

Life-Long Learning ✓
A. DEFINITION OF CREDITS:
1 Hour Lecture (L) per week 1 credit

1 Hour Tutorial (T) per week 1 credit

1 Hour Practical (P) per week 0.5 credits

2 Hours Practical (Lab) per week 1 credit

B. Course Code and Definition

Course Definitions
Code

L Lecture

T Tutorial

P Practical

TW Term Work

O Oral

SEE Semester End Examination

MJ Major (Core) Courses

MI Minor Courses

GE General Elective Courses

OE Open Elective Courses

SE Skill Enhancement Courses

AE Ability Enhancement Courses

VE Vocational Enhancement Courses

VS Vocational Skill Courses

VI
VA Value Added Courses

CC Co-curricular Courses

EC Extra-Curricular Courses

ID Inter-disciplinary Courses

MD Multidisciplinary Courses

RP Research I Project Courses

PC Practical Courses

BS Basic Science

ES Engineering Science

AC Audit Course

EC Extracurricular Activities

BM Basic Mathematics

BP Basic Physics

BC Basic Chemistry

UH Universal Human Values

VII
 BHARATI VIDYAPEETH (DEEMED TO BE UNIVERSITY)
COLLEGE OF ENGINEERING, PUNE
B. Tech. (Information Technology): Semester –I (2023 CBCS COURSE)

Teaching
Examination Scheme-Marks Credits
Subject Scheme
Sr. No Category Subject
Code Internal
L P T ESE TW PR OR Total Th Pr/Or Tut Total
Assessment
Engineering
1. BM BM1113101 3 - 1 60 40 - - - 100 3 - 1 4
Mathematics- I
Engineering
2. BC BC1113102 3 2 - 60 40 50 - - 150 3 1 - 4
Chemistry
Digital
3. ES ES1109103 4 2 - 60 40 50 - - 150 4 1 - 5
Electronics
Structured
4. MJ MJ1110104 4 - - 60 40 - - - 100 4 - - 4
Programming
Web
5. MJ MJ1110105 4 2 - 60 40 25 - 125 4 1 - 5
Technologies
Communication
6. AE AE1113106 - 2 - - - 50 - - 50 - 1 - 1
Skills
Information
7. SE SE1110107 Technology - 2 - - - 25 - 25 50 - 1 - 1
Laboratory-I
Computer
8. SE SE1111108 Workshop - 2 - - - 25 - - 25 - 1 - 1
Technology
Total 18 12 1 300 200 225 0 25 750 18 6 1 25

8
 BHARATI VIDYAPEETH (DEEMED TO BE UNIVERSITY)
COLLEGE OF ENGINEERING, PUNE
B. Tech. (Information Technology): Semester –II (2023 CBCS COURSE)

Teaching
Examination Scheme-Marks Credits
Subject Scheme
Sr. No Category Subject
Code Internal
L P T ESE TW PR OR Total Th Pr/Or Tut Total
Assessment
Engineering
1. BM BM1113201 3 - 1 60 40 - - - 100 3 - 1 4
Mathematics- II
Engineering
2. BP BP1113202 3 2 - 60 40 50 - - 150 3 1 - 4
Physics
Content
3. MJ MJ1110203 Management 4 2 - 60 40 50 - - 150 4 1 - 5
System
Computer
4. MJ MJ1110204 Communication 4 2 - 60 40 25 - - 125 4 1 - 5
and Networks
Object Oriented
5. MJ MJ1110205 4 - - 60 40 - - - 100 4 - - 4
Programming
Universal Human
6. UH UH1113206 - 2 - - - 50 - - 50 - 1 - 1
Values
Information
7. SE SE1110207 Technology - 2 - - - 25 - 25 50 - 1 - 1
Laboratory-II
Computer Aided
8. SE SE1111208 - 2 - - - 25 - - 25 - 1 - 1
Drawing & Design
Total 18 12 1 300 200 225 0 25 750 18 6 1 25

9
 BHARATI VIDYAPEETH (DEEMED TO BE UNIVERSITY)
COLLEGE OF ENGINEERING, PUNE
B. Tech. (Information Technology): Semester –III (2023 CBCS COURSE)

Teaching
Examination Scheme-Marks Credits
Sr. Subject Scheme
Category Subject
No Code Internal O Tota Pr/
L P T ESE TW PR Th Tut Total
Assessment R l Or
1. MJ1110301
Discrete Structure and
MJ 3 - 60 40 - - - 100 3 - - 3
Graph Theory
2. MJ1110302
Database Management
MJ 3 2 - 60 40 25 25 - 150 3 1 - 4
Systems
3. MJ1110303
MJ Operating System 3 2 - 60 40 25 - 25 150 3 1 - 4

4. MJ1110304
Microprocessors and
MJ 3 - - 60 40 - - - 100 3 - - 3
Microcontrollers
5. MJ1110305
MJ Data Structures 3 2 - 60 40 25 25 - 150 3 1 - 4

6 SE1110306 Information Technology

SE - 2 1 - - 25 25 - 50 - 1 1 2
Laboratory-III
Total 15 08 1 300 200 100 75 25 700 15 4 1 20

7 AE AE1110307 MOOC-I* - - - - - - - - - - - - 2

VA Value Added Course-I*

8 VA1110308 A) Internet Security 2 - - - 100 - - - 100 - - - 2
B) Data Analysis Tools

* Indicate this is mandatory course.

10
 BHARATI VIDYAPEETH (DEEMED TO BE UNIVERSITY)
COLLEGE OF ENGINEERING, PUNE
C. Tech. (Information Technology): Semester –IV (2023 CBCS COURSE)
D.
Teaching
Examination Scheme-Marks Credits
Subject Scheme
Sr. No Category Subject
Code Internal
L P T ESE TW PR OR Total Th Pr/Or Tut Total
Assessment
MJ1110401 Formal Languages
1. MJ and Automata 3 - 60 40 - - - 100 3 - - 3
Theory
MJ1110402 Advanced
Database
2 MJ 3 2 - 60 40 25 25 - 150 3 1 - 4
Management
Systems
MJ1110403 Software
3. MJ 3 2 - 60 40 25 - 25 150 3 1 - 4
Engineering
MJ1110404 Computer
4. MJ Organization and 3 - - 60 40 - - 100 3 - - 3
Architecture
MJ1110405 Applied
5. MJ 3 2 - 60 40 25 25 - 150 3 1 - 4
Algorithms
SE1110406 Information
6. SE Technology - 2 1 - - 25 25 - 50 - 1 1 2
Laboratory-IV
Total 15 08 1 300 200 100 75 25 700 15 4 1 20
AC1113407 Indian Knowledge
7 AC 2 - 100 - - - 100 - - - 2
System*
EC1110408
8 EC Social Activity* - - - - - - - - - - - - 2

* Indicate this is mandatory course.

11
 BHARATI VIDYAPEETH (DEEMED TO BE UNIVERSITY)
COLLEGE OF ENGINEERING, PUNE

B. Tech. (Information Technology): Semester –III/IV/V/VI (NEP-2020 COURSE)

MINOR DEGREE: CLOUD TECHNOLOGIES

Teaching
Examination Scheme-Marks Credits
Course Scheme
Sr. No Subject
Code Internal
L P T ESE TW PR OR Total Th Pr/Or Tut Total
Assessment
MI1110301 SEM-III: Distributed
1. 3 2 - 60 40 25 - 25 150 3 1 - 4
Computing
MI1110401 SEM-IV: Cloud Systems
2 3 2 - 60 40 25 - 25 150 3 1 - 4
and Infrastructures
MI1110501 SEM-V: Cloud
3. 3 2 - 60 40 25 - 25 150 3 1 - 4
Virtualization
MI1110601 SEM-VI: Cloud
4. Containers and 3 2 - 60 40 25 - 25 150 3 1 - 4
Orchestrations
RP1110602
5. Sem-VI Project 8 - 50 50 100 4 - 4

Total 12 16 - 240 160 150 - 150 700 12 8 - 20

12
13
 B. Tech
Information Technology
Semester I

14
 Engineering Mathematics-I (Common for all Branches)
TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME
Theory:- 03 Hours/ Week End Semester Examination 60 Marks Theory: 03
Tutorial: 01
Tutorial :- 01 Hours/ Week Internal Assessment 40 Marks
Total 100 Marks Total 04

Course Prerequisites:- The students should have knowledge of

Algebra of matrices and its Determinants, Maxima and Minima of
single variable functions.
Course Objective On completion of the course –
1. Fundamental theorems, concepts in Matrices, Demoivr's
theorem and its applications in engineering.
2. Various techniques in Calculus, Explanation of functions
and Infinite series.
3. Partial differentiation, maxima, minima and its applications
in engineering.
Course Outcomes:- After completion of the course students will be able to

1. Understand rank of matrix and apply it to solve system of

linear equations
2. Understand the DeMoiver’s theorem, hyperbolic functions
and apply it in engineering problems.
3. Understand the Leibnitz’s rule and apply it to find nth
derivative of a function.
4. Understand fundamental concepts of convergence,
divergence of infinite series and its tests.
5. Understand the concept of partial differentiation and apply
it to find total derivative.
6. Evaluate the maxima and minima of any two variables
functions..

Unit I: Matrices (6 Hours)

Rank, Normal form, System of Linear Equations, Linear Dependence and
Independence, Linear and Orthogonal Transformations, Eigen values, Eigen
Vectors, Cayley – Hamilton Theorem.

Unit II: Complex Numbers and Applications: (6 Hours)

Definition, Cartesian, Polar and Exponential Forms, Argand’s Diagram,
De'Moivre's theorem and its application to find roots of algebraic equations.,
Hyperbolic Functions, Logarithm of Complex Numbers, Separation into Real
and Imaginary parts, Application to problems in Engineering.
15
Unit III: Differential Calculus: (6 Hours)
Successive Differentiation, nth Derivatives of Standard Functions, Leibnitz's
Theorem,
Expansion of Functions: Taylor's Series and Maclaurin's Series

Unit IV: Differential Calculus: (6 Hours)

Indeterminate Forms, L' Hospital's Rule, Evaluation of Limits.
Infinite Series: Infinite Sequences, Infinite Series, Alternating Series, Tests for
Convergence, Absolute and Conditional Convergence, Power series, Range of
Convergence

Unit V: Partial Differentiation and Applications: (6 Hours)

Partial Derivatives, Euler's Theorem on Homogeneous Functions, Implicit
functions, Total Derivatives, Change of Independent Variables, Errors and
Approximations.

Unit VI: Jacobian: (6 Hours)

Jacobians and their applications, Chain Rule, Functional Dependence.
Maxima and Minima: Maxima and Minima of Functions of two variables,
Lagrange's method of undetermined multipliers.

PBL: Project Base Learning (Topics)

1 Echelon form
2 Normal form
3 Linear and orthogonal transformation
4 Eigen values and eigen vectors
5 Argand diagram
6 De Movre’s theorem
7 Hyperbolic and logarithmic functions
8 Leibnitz theorem
9 Taylor’s theorem
10 L’Hospital rule
11 Tests for convergence
12 Euler theorem for homogeneous functions
13 Total derivative
14 Maxima and minima for two variable function
15 Langrage undetermined multipliers

Textbooks
1. Applied Mathematics (Volumes I and II) by P. N. Wartikar & J. N. Wartikar
(Pune Vidyarthi Griha Prakashan, Pune),7th Edition, 1988, Reprint 2010.

16
Reference Books
1. Higher Engineering Mathematics by B.S. Grewal (Khanna Publication,
Delhi), 42th Edition, 2012.

2. Higher Engineering Mathematics by B.V. Ramana (Tata McGraw-Hill),

Edition, 2008
3. Advanced Engineering Mathematics by Erwin Kreyszig (Wiley Eastern
Ltd.), 8th Edition, 1999, Reprint 2010
4. Advanced Engineering Mathematics, 7e, by Peter V.O'Neil (Thomson
Learning), Edition 2007
5. Advanced Engineering Mathematics, 2e, by M. D. Greenberg (Pearson
Education), 2nd, Edition, 2002

Unit Test –

Unit Test - I Unit I, II, III

Unit Test - II Unit IV, V, VI

17
 Engineering Chemistry (Common for all Branches)

TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME

Theory:-03 Hours/ Week End Semester Examination 60 Marks Theory: 03
Practical:-02Hours/week Internal Assessment 40 Marks Practical: 01
Term Work 50 Marks
Total 150 Marks Total 04

Course Prerequisites:- The student should have

Basic knowledge of chemistry.
Basic knowledge of electrochemistry and chemistry of materials
Introductory knowledge of polymers.

Course Objective The student should acquire the knowledge of

1. To develop the interest among the students regarding
chemistry and their applications in engineering.
2. To develop confidence among students about chemistry,
how the knowledge of chemistry is applied in technological
field.
3. The student should understand the concepts of chemistry to
lay the groundwork for subsequent studies in the
Engineering field

Course Outcomes:- After completion of the course students will be able to

1. Understand the different methods of analysis of
water,different environmental pollutants and importance of
green chemistry
2. Understand the importance of fuels and apply it for various
engineering applications.
3. Explain the drawbacks of corrosion and different methods
of elimination of corrosion
4. Apply the concept of polymer to study advanced materials.
5. Apply the basic concept of chemistry to explain the chemical
properties and processes of materials of nanoscale
6. Understand the instrumental analysis helpful for various
engineering applications

Unit I: Water Technology & Green Chemistry (6 Hours)

Introduction, sources and impurities in water, Hardness of water, types, and
determination of hardness using EDTA titration, softening of hard water by
ion- exchange process. Numerical problems on hardness of water. Major
environmental pollutants, Basic principles of green chemistry. Atom

18
economy, Synthesis of adipic acid, Industrial applications of green chemistry,
Numerical problems on Atom economy.

Unit II: Electrochemical energy and solar energy (6 Hours)

Fuels: Introduction, Definition, importance of fuels, calorific value, types,
fluidized bed catalytic cracking, knocking (Petrol engine), mechanism and its
ill effects, biodiesel, power alcohol, octane and cetane number. Solar Energy:
Introduction, construction, working and applications of photovoltaic cell.

Unit III: Corrosion technology and it’s control (6 Hours)

Introduction, Electrochemical theory of corrosion, Types of corrosion,
Differential metal and differential aeration (pitting and water line) caustic
embrittlement. Factors affecting the rate of corrosion, Corrosion control:
Cathodic protection, sacrificial anode and impressed current methods, Metal
coatings, Galvanization and tinning, Anodizing, Anodizingof aluminium,
Organic coatings: Paint and varnishes.
Metal finishing: Introduction, Technological importance. Principles of
electroplating. Electroplating of chromium. Electro less plating: Introduction,
electro less plating of nickel & copper on PCB with applications

Unit IV: Engineering Materials and Technology (6 Hours)

Polymers: Introduction, classification, Synthesis and applications of
Polyurethane, polycarbonates, Conducting Polymers: Synthesis &
Mechanism of conduction in poly aniline.
Composites: Introduction, constitution, classification. Types: fiber glass,
hybrid and reinforced Composites with applications.

Unit V: Nano materials (6 Hours)

Introduction, size dependent properties (Surface area, Electrical, Optical,
Catalytic and Thermal properties). Synthesis of nano materials: Top down
and bottom up approaches, Synthesis by Sol-gel, precipitation and chemical
vapour deposition, Nano scale materials: Fullerenes, Carbon nano tubes and
graphenes – properties and applications.

Unit VI: Instrumental methods of analysis (6 Hours)

Introduction, Theory, Instrumentation and applications of colorimetry,
pHmetry, conductometry Introduction to spectroscopy, principles and
applications of UV/Vis. Spectroscopy

19
PBL: Project Base Learning (Topics)

Sr. No Topics

1 Comparison of Hardness, Alkalinity, Dissolved

oxygen, Chlorides and COD of water from two
different sources

2 Removal of industrial pollutants from wastewater

by adsorption on activated charcoal

3 Preparation of biofuels from two natural sources

4 Two synthetic approaches for the production of H2

as a clean fuel

5 Prevention of corrosion by metal coupling

6 Construction of bio sensor in engineering

applications

7 Design and simulation of automatic solar - photo

voltaic panels as renewable energy source.
8 Synthesis of Conjugated Polymers and Molecules
Using Sugar Reagents and Solventless Reactions.
OR Composite materials and it properties,
applications and types
9 To study mechanism of lubrication

10 Electroplating- study on how different metals can

be used and the practical applications
11 Prepare Ag- nanoparticles by using sol-gel method

12 Preparation of Ag nanoparticle from two natural

sources
13 With the help of green chemistry principles, prepare
any organic dye by using Traditional and Green
pathway.
14 Prepare epoxy resins by using suitable metho

15 Measurement and effect of waste disposal from

laboratories in the college

20
Practical (Any Eight of the Following)

1. Determination of Hardness of water sample by EDTA method

2. To determine strength of acid by pH – metric Titration
3. To measure the strength of acid by conductometric titration
4. Measurement of Surface tension of a given liquid by Stalgmometer.
5. To determine alkalinity water sample.
6. Estimation of the given amount of copper in the given solution by
colorimetry
7. Synthesis of conducting polyaniline from aniline by oxidative
polymerization
8. Determination of iron content in the given solution by Mohr’s method
9. To determine the strength of given acid solution by titrating it against
base solution using indicator
10. Determination of reaction rate, order and molecularity of hydrolysis
of ethyl acetate
11. Verification of Beer-Lambert's Law.
12. Determination of Viscosity of Liquids by Ostwald's Viscometer
13. Determination Of Chloride Content Of Water By Argentometry
14. Estimation of copper from brass by iodometry
15. To study set up of Daniel cell.

Text Books
1. Engineering Chemistry, Jain P.C & Jain Monica,Dhanpat Rai & Sons,
Delhi (1992)
2. Engineering Chemistry, O. G. Palanna, Tata McGraw-Hill Publication,
New Delhi
3. A textbook of Engineering Chemistry, S. S. Dara, McGraw-Hill
Publication, New Delhi

Reference Books
1. Engineering Chemistry- Fundamentals and applications, Shikha
Agarwal,Cambridge Publishers (2015)
2. Polymer Science and technology (2nd Edition), P. Ghosh, Tata
McGRAW Hill, (2008)
3. Principles of Instrumental Analysis, Douglas A. Skoog, F. James
Holler,Stanley R. Crouch,Cengage learning (2017)
4. Polymers: Chemistry & Physics of Modern Materials (2nd edition)
J.M.G.Cowie, Blackie, Academic & Professional (1994)

21
5. Integrated design and operation of water treatment facilities, Kawamura,
Susumu. John Wiley & Sons (2000)

Unit Test –

Unit Test - I Unit I, II, III

Unit Test - II Unit IV, V, VI

22
 Digital Electronics

TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME

Lecture: 4 Hours/Week End Semester Examination:60 Marks Theory 4
Practical: 2 Hours/Week Internal Assessment: 40 Marks Practical 1
Term work: 50 Marks
Total 6 Hours Total Marks: 150 Marks Total 5

Course Objective:
1. To present the Digital fundamentals, Boolean algebra and its applications in digital systems.
2. To familiarize with the design of various combinational digital circuits using logic gates
3. To introduce the analysis and design procedures for synchronous and asynchronous
sequential circuits.
4. To understand the various semiconductor memories and related technology.

Prerequisite:
Basics of Physics, Mathematics, Basics of computer fundamentals

Course Outcomes: On completion of the course, students will have the ability to:
1. Comprehend different number systems and Boolean algebraic principles.
2. Apply logic design minimization techniques to simplify Boolean expressions
3. Analyze and design combinational logic circuits.
4. Demonstrate the operations of systems with sequential circuit elements.
5. Comprehend characteristics and structure of Programmable Logic Devices and Memory.
6. Draw ASM charts for sequential circuit design.

Unit 1 : Number system and Codes (8 Hours)

Introduction to Number Systems: Decimal, Binary, Octal, Hexadecimal and

interconversion of number system, Representation of Negative Numbers, 1’s
complement and 2’s complement.

Digital Codes : BCD codes(8421-2421), gray code, excess–3 code, cyclic code, code
conversion, ASCII, EBCDIC codes.
Binary Arithmetic: Binary addition, Binary subtraction, Subtraction using 1’s
complement and 2’s complement, Binary multiplication, and division.

Unit II : Boolean Algebra (8 Hours)

Logic Gates: Logic Gates-Basic Gates, (AND, OR, NOT, NAND, NOR, Ex-OR,
ExNOR and their truth tables, ), Logical Operators, Universal Gates, realization of
other gates using universal gates.

Logic Design Minimization: Boolean algebra, De Morgan’s Theorems, Standard

representation of logic functions, Sum of Product (SOP) form, Product of Sum (POS)

23
form, Simplification of logical functions, Minimization of SOP and POS forms using
Karnaugh-Maps up to 4 variables Don’t care condition

Unit III : Combinational Circuits (8 Hours)

Binary and BCD arithmetic, Half Adder, Full Adder, Half Subtractor, Full Subtractor,
Binary Adder (IC 7483), BCD adder, Code converters, Multiplexers, De multiplexer,
Decoder (IC 74138) and their use in combinational logic design, Priority Encoder,
Digital Comparators, Parity generators and Checker (IC 74180)

Unit IV: Sequential Circuits (8 Hours)

Flip- flop: SR, JK, D, T flip flops, Truth Tables and Excitation tables, Conversion
from one type to another type of Flip Flop.
Registers: Buffer register, Shift register.
Counters: Asynchronous counters, Synchronous counters, Modulus counters

Unit V : FSM and ASM chart (8 Hours)

Introduction to FSM, Moore and Mealy State machine, state machine as a sequential
controller. Design of state machines: state table, state assignment,
transition/excitation table, excitation maps and equations, logic realization, ASM
chart notations, ASM block, State diagram, ASM chart for sequential circuits,
Multiplexer Controller.

Unit VI : Memory and PLD (8 Hours)

Semiconductor memories: memory organization, memory expansion, Classification
and characteristics of memories, RAM, ROM, EPROM, EEPROM, NVRAM,
SRAM, DRAM. Programmable logic devices: Study of PROM, PAL, PLAs.
Architecture of PLA, designing combinational circuits using PLDs.

Textbooks:
1. M. Morris Mano and M. D. Ciletti, Digital Design, Pearson Education.
2. R. P. Jain, Modern Digital Electronics, Tata McGraw Hill Publication.
3. F.J. Hill and G.L. Peterson, Switching Theory and Logic Design, John Wiley
4. J.F. Wakerly “Digital Design: Principles and Practices”, 3rd edition, 4th reprint, Pearson
Education, 2

Reference Books:
1. David J. Comer, Digital Logic & State Machine Design, Oxford University Press.
2. Digital Integrated Electronics- H.Taub & D.Shilling, Mc Graw Hill.

List of Laboratory Exercises:

1. Verify truth tables of logic gates. (AND, OR, XOR, NOT, NAND, NOR). Simplify the given
Boolean expression using K-map and implement using gates
2. State De-Morgan’s theorem and write Boolean laws. Implement NAND and NOR as Universal
24
 gates.
3. Design (truth table, K-map) and implement half and full adder/subtractor.
4. Design (truth table, K-map) and implement 4-bit BCD to Excess-3 Code converters.
5. Study of magnitude Comparator using IC 7485.
6. Implement of logic functions using multiplexer IC 74151 (Verification, cascading & logic
function implementation).
7. Implement logic functions using 3:8 decoder IC 74138.
8. Verify truth tables of different types of flip flops.
9. Design (State diagram, state table & K map) and implement 3 bits Up and Down
Asynchronous and Synchronous Counter using JK flip-flop.
10. Design and implement modulo ‘n’ counter with IC 7490.

Project Based Learning Assignments

Note:- *Students in a group of 3 to 4 shall complete any one project from the following list
1. Survey report of basic gates ICs 7432, 4011, 4050, 4070,4071,40106
2. Implement combinational logic Circuit of given Boolean Equation.
3. Implement Half Adder and Half Subtractor.
4. Implement Full Adder using two Half Adders
5. Build 4-bit parallel Adder / Subtractor using IC.
6. Build Code Converters: Binary to Gray
7. Build Code Converters: Excess 3 to Binary)
8. Implement Two Bit Magnitude Comparator using IC 7485
9. Implement given combinational logic using MUX
10. Implement 7 segment decoder driver using IC 7447.
11. Build a Decade counter and Up-Down Counter.
12. Build a Shift Registers: SISO and SIPO
13. Implement the Johnson Counter and Ring Counter.
14.Survey Report on Static I/O and transfer Characteristic of TTL and CMOS

Syllabus for Unit Tests:

Unit Test -1 Unit – I, Unit – II, Unit - III
Unit Test -2 Unit – IV, Unit – V, Unit - VI

25
 Structured Programming
TEACHING SCHEME EXAMINATION SCHEME CREDIT SCHEME

Lecture: 4 Hours/Week End Semester Examination: 60 Marks Theory 4

Internal Assessment: 40 Marks
Total 4 Hours/Week 100 Marks 4

Course Objective:
To provide an overview of fundamental principles, concepts, and constructs of computer
programming.

Prerequisite:
Basic knowledge of Computer Handling.

Course Outcomes: On completion of the course, students will have the ability to:
1. Study steps towards problem solving.
2. Understand fundamental concepts of programming language.
3. Illustrate conditional, branching and iteration
4. Decompose a problem into functions.
5. Explore array and structures to solve simple numerical method problems.
6. Exercise file handling concepts.

Unit I (8 Hours)
Introduction to Computing: Introduction to problem solving using computers,
Problem solving steps, Algorithms-definition, characteristics, examples ,advantages
and limitations, Flowcharts Comparison with algorithms, Pseudo codes,
Programming Languages as tools, types of programming paradigms, Compilation
process, linking and loading, syntax and semantic errors, testing a program, Good
Programming Practices

Unit II (8 Hours)
'C' Fundamentals: Features of C, header files, pre-processor directives, compiling
and executing a C program, syntax and semantic errors, libraries, structure of a C
program, declarations, constants, variables, data types, operators and expressions,
precedence and associativity of operators, type conversions, input and output
functions- printf and scanf.

Unit III (8 Hours)

Control Structures: Decision making structures: if-else statement, nested if-else, use
of logical operators, Loop control structure: for, while, do-while loops, use of break
and continue, Nested structures, Case control structure: switch case
Pointers: Concept, pointer declaration, assignment, initialization, and access.

26
Unit IV
(8 Hours)
Function: Types of functions, function definition and declaration, function
prototype, calling and returning function, passing values between functions,
standard library functions and user defined functions, passing array as function
parameter, call-by-value, call-by-reference, recursive function.

Unit V (8 Hours)
Arrays: Concept, declaration, initialization, processing with array, one, two and
multidimensional array, pointer to an array, Passing arrays to function.
Strings: concept, declaration, initialization, and standard string library functions.
Structures: Concept, declaration, accessing structure elements, array of structures,
pointer to structures, self-referential structures, use of structures, union.

Unit VI (8 Hours)
File handling: File Handling in C, Types of files, Functions for file handling, Defining
and opening a file, closing a file, Input/output and Error Handling on Files.

Textbooks
1. Brian W. Kernighan, Dennis M. Ritchie, “The C Programming Language”, Prentice Hall, ISBN
0131103628.
2. Donald E. Knuth, “The Art of Computer Programming”, Addison-Wesley, ISBN-10:
0201485419, ISBN13: 978-0201485417.
3.T. E. Bailey, “Program design with pseudo code”, Brooks/Cole Publisher, ISBN-10 :
0534055745, ISBN-13: 978-0534055745.
4. Kanetkar Yashavant P, “Let us C”, BPB publications.
5. Subrata Saha and Subhodip M., “Basic Computation and Programming with C”, Cambridge
University of Press, India, ISBN:9781316601853.

Reference Books
1 Lamey Robert, “Logical problem solving”, Prentice Hall, ISBN: 9780130618825.
2 Henry Mullish, Herbert L. Cooper, “The Spirit of C”, Thomson Learning, ISBN 0314285008.

Project Based Learning Assignments*

Note:- *Students in a group of 3 to 4 shall complete any one project from the following list)
1. Design and develop a project for Diary management System
2. Design and develop a project for Calendar using C
3. Design and develop a project for Contact Management System
4. Design and develop a project for Library Management System
5. Design and develop a project for Snake Game
6. Design and develop a project for Bus Reservation system
7. Design and develop a project for Hospital Management system
8. Design and develop a project for Employee management system
27
 9. Design and develop a project for Diary management System
10. Design and develop a project for Calendar using C
11. Design and develop a project for Contact Management System
12. Design and develop a project for Library Management System

Syllabus for Unit Tests:

Unit Test -1 Unit – I, Unit – II, Unit – III
Unit Test -2 Unit – IV, Unit –V, Unit – VI

28
 Web Technologies

TEACHING SCHEME EXAMINATION SCHEME CREDIT SCHEME

Lecture: 4 Hours/Week End Semester Examination: 60 Marks Theory 4

Practical: 2 Hours/Week Internal Assessment: 40 Marks Practical 1
Term Work: 25 Marks
Total 6 Hours/Week 125 Marks 5

Course Objective:
To develop the skill & knowledge of Web page design.

Prerequisite:
Basic knowledge of HTML tags.

Course Outcomes: On completion of the course, students will have the ability to:
1. To learn Internet protocols.
2. To design web pages using html and CSS
3. To design websites using JavaScript and to design responsive web pages
4. To learn eXtensible Markup Language.
5. To learn foundations of Human Computer Interaction.
6. To learn screen designing and web interface designing.

Unit I (8 Hours)
Fundamentals: Introduction to the Internet, World Wide Web, Web Browsers, Web
Servers, URL, Overview of different protocols: HTTP, POP, SMTP, FTP, HTTP
Request message, HTTP Response Message, HTTP Client Server Architecture, IPv4,
IPv6.

Unit II (8 Hours)
HTML: Introduction, history, versions. HTML elements: headings, paragraphs, line
break, colors and fonts, links, frames, lists, tables, images and forms, Difference
between HTML and HTML5.

CSS: Introduction to Style Sheet, CSS features, CSS core syntax, Style sheets and
HTML, Internal Stylesheets, External stylesheets, Inline Stylesheets, Style rule
cascading and inheritance, text properties. Bootstrap.

29
Unit III (8 Hours)
JavaScript: Introduction to JavaScript, JavaScript in perspective, basic syntax,
variables and data types, statements, operators, literals, functions, objects, arrays,
built in objects, JavaScript debuggers, jQuery.

Front End Frameworks: Explore Bootstrap Elements, Downloading Bootstrap,

downloading a Bootstrap Example

Unit IV (8 Hours)
XML: Introduction to XML, Uses of XML, XML Key Components, Comparing
XML with HTML, Describing the Structure of XML - Declaration, Elements,
Attributes, Comments, CDATA, XML Entity References, Parsers, Document Type
Definitions, XSL.

Unit V (8 Hours)
Introduction to HCI: What is HCI, History, Computer devices, User Interface,
Benefits, Principles of User Interface, Good Design, Benefits, Graphical user
interface, Direct Manipulation, Design Thinking, Stages of Design Thinking

Unit VI (8 Hours)
Screen Designing: Design goals, Screen planning, organizing screen elements,
ordering of screen data and content, Screen navigation and flow, Design rules:
Principles, standards, guidelines, Golden rules of HCI.
Web Interface Design: Designing Web Interfaces, Application Designing, game
Designing.

Textbooks
1.Getting Started with Web Components: Build modular and reusable components using HTML,
CSS and JavaScript by Prateek Jadhwani.
2. Jump Start Bootstrap: Get Up to Speed With Bootstrap in a Weekend By Syed Fazle
Rahman.
3. Fronted Web Development/Web Designing, HTML, CSS & JavaScript Basic Tutorial by
Sachin Srivastav
4. Web Design and Development: Website Technologies Fundamentals By Steven Bright.

5. Web Technologies, Black Book, Dreamtech Press.

6.Ben Shneidermann, “Designing the user interface”, Third edition, Pearson education, Asia

30
Reference Books
1. HTML and C Learn HTML, CSS, and JavaScript and Build a Website, App, and Game
by Young Rewired State and Duncan Beedie.
2.Mastering HTML, CSS & Javascript Web Publishing by Laura Lemay, Rafe Colburn
HTML & CSS, and JavaScript & JQuery (2 book set) by Jon Duckett.
3. Wilbert O Galitz, “The essential guide for user interface design”, Wiley Dream Tech.
4. Internet and World Wide Web How to program, P.J. Deitel & H.M. Deitel Pearson.

List of Laboratory Exercise:

1) Design home page for any website according to domain.
2) Implement various functionality using different tags of HTML while designing web pages.
3) Implement web pages formatting and content formatting using CSS.
4) Implement responsive approach in website designing.
5) Explorer front end framework using Bootstrap Elements.
6) Describe user interface with its benefits.
7) How to design a screen with proper planning?

8) Write a case study on application designing.

Project Based Learning Assignments*

Note:- *Students in a group of 3 to 4 shall complete any one project from the following list)
1. Design website for department and college
2. Design website for e-commerce platform.
3. Design website for reservation system (e.g. bus, train, air)
4. Design website for online food delivery system.
5. Design website for CRM (database management).
6. Design website for hospital management system.
7. Design website for advertisement of products.
8. Design website for customer support system.
9. Design website for Business Portfolio.
10. Design website for Quiz Game.
11. Design website for E-library system.
12. Design website for survey system.
13. Design website for Banking system.
14. Design website for social media.
15. Design matrimonial website.

Syllabus for Unit Tests:

Unit Test -1 Unit – I, Unit – II, Unit – III
Unit Test -2 Unit – IV, Unit –V, Unit - VI
31
 Communication Skills (Common for all Branches)

TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME

Practical :- 02 Hours/ Week Term Work 50 Marks Practical: 01
Total 50 Marks Total 01

Course Prerequisites:- Students should have knowledge of Basic English grammar

Students should have basic information of sound system of English
language.
Course Objective The course objective of Communication Skills puts the following
class teaching objectives, considering English Language skills as a
wheel rolling aspects in today’s world, the focus is on honing the
skills such as LSRW and presentation skills. It also puts emphasis
on technical and professional writing skills. Honing the presentation
skills among students through appropriate activities, this will help
them in their business ventures.
Course Outcomes:- After completion of the course students will be able to

1. Understand and construct the error free sentences of English

language and do implementation of it in the spoken and
written business communication
2. Understand and apply the sounds of English language for
correct pronunciation
3. Understand and develop the ability to enhance sound
vocabulary for effective communication
4. Understand communication process and principles to do
applications in business communication
5. Understand the techniques of writing skills and apply them
in appropriate context and domain
6. Create effective business presentation and do effective
implementation of it through activities

Unit I: English grammar (4 Hours)

Application of Basic Grammar: Articles, Prepositions, Tenses, Subject-verb
agreement, Use of phrases & Clauses in sentences, Common errors

Unit II. Phonetics/study of sounds in English (4 Hours)

Introduction to phonetics, study of speech organs, study of phonetic script,
transcriptions of words, articulation of different sound in English, reducing MTI,
stress and intonation

32
Unit III: Vocabulary Enrichment (4 Hours)
Ways of word formation, Foreign phrases, One word substitutions, Synonyms
& antonyms, Words often confused, Indian English words, Usage of idioms &
phrases.GRAS-PT formula

Unit IV: Communication Skills (4 Hours)

Introduction, forms and function of communication process, non-verbal codes
in communication, Importance of listening skills, Listening V/s hearing, Types
of listening, Barriers to communication and listening, Importance of LSRW
skills in communication

Unit V: Technical Writing Skills (4 Hours)

The mechanics and principles of written communication, Technical
Communication, Need and Importance, technical report writing;, email writing,
, notice, agenda, minutes of meeting writing. Use of technology in technical
writing

Unit VI. Presentation skills (4 Hours)

Designing effective presentation, understanding theme, developing content and
layout of presentation, use of tone and language, technological tools for effective
presentation

Reference Books:

1. Business Communication by Meenakshi Raman, Prakash Singh published

by Oxford University press, second edition,
2. Spoken English- A manual of Speech and Phonetics by R. K. Bansal, J. B.
Harrison published by Orient Blackswan
3. Technical Communication by Meenakshi Raman, Sangeeta Sharma
published by Oxford University press
4. Developing Communication Skills by Krishna Mohan, Meera Banerji
published by Macmillan India Pvt Ltd

Recommended web-links for enhancing English language and business

communication
http://www.bbc.co.uk/worldservice/learningenglish
http://www.englishlearner.com/tests/test.html
http://www.hodu.com/default.html
http://www.communicationskills.co.in/index.html

33
 Information Technology Laboratory – I

TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME

Practical: 2 Hours/Week Term Work: 25 Marks Practical: 1
Oral: 25 Marks
Total 2 Hours/Week 50 Marks Total: 1

Course Objective:
To build the programming skills using 'C' programming to solve real world problems

Prerequisite:
• Basics of Computer Handling.

Course Outcomes: On completion of the course, students will have the ability to:
1. Study steps towards problem solving.
2. Understand fundamental concepts of programming language.
3. Illustrate conditional, branching and iteration
4. Develop modular program using functions.
5. Explore array and structures to solve simple numerical method problems.
6. Exercise file handling concepts.

Unit I (4 Hours)
Fundamentals of ‘C’ Programming: Variables and Constants, Keywords, Scope
Rules, Internal and External Linkage, Global Variables, Data Types, Typecasting,
Input/Output, Operators, Types of operators, Operator Precedence and Associativity,
Introduction to C preprocessor #include, #define, Conditional.

Unit II (4 Hours)
Implementing Control Structures: Implementing decision making structures: if-else
statement, nested if-else, use of logical operators, Loop control structure: for, while,
do-while loops, use of break and continue, Nested structures, Case control structure:
switch case
Implementation of Pointers: pointer declaration, assignment, initialization, and access,
Null pointer. Dynamic memory allocation functions — malloc, calloc, realloc and free

Unit III (4 Hours)

Implementation of Functions: function definition and declaration, function
prototype, calling and returning function, passing values between functions, standard
library functions and user defined functions, passing array as function parameter, call-
by-value, call-by-reference, recursive function.

Unit IV (4 Hours)
Implementing Arrays: Implementing One-dimensional Arrays, Declaration of One-
dimensional Arrays, Initialization of One-dimensional Arrays, Example programs-
Bubble sort, Selection sort, insertion sort, Linear search, Binary search, Two-
34
dimensional Arrays, Declaration of Two-dimensional Arrays, Initialization of Two-
dimensional Arrays, Example programs-Matrix Multiplication, Transpose of a matrix,
Applications of array
Implementation of Strings: Declaring and Initializing String Variables, Reading
Strings from Terminal, Writing Strings to Screen, Arithmetic Operations on
Characters, String-handling Functions, Example Programs (with and without using
built-in string functions)

Unit V (4 Hours)
Implementing Structures, Union and Enum:
Structure: Basics, declaring structure and structure variable, typedef statement, array
of structure, array within structure, Nested structure; passing structure to function,
function returning structure.
Union: basics, declaring union and union variable.
Enum: declaring enum and enum variable.

Unit VI (4 Hours)
Implementing File handling: file pointer, File accessing functions: fopen, fclose,
fputc, fgetc, fprintf, fscanf, fread, fwrite,beof, fflush, rewind, fseek, ferror. File
handling through command line argument.

Textbooks:
1. Programming in ANSI C, E Balagurusamy, Tata McGraw-Hill, Third Edition.
2. Let Us C, YashwantKanetkar, Infinity Science Press, Eighth Edition.

Reference Books:
1.The C Programming Language, Brian W. Kernighan, Dennis M. Ritchie, Prentice Hall, 2″
Edition.
2. How to solve it by Computer, R.G.Dromey, Pearson Education.

List of Laboratory Exercise:

1. Write a program to accept the length of three sides of a triangle and to test and print the type
of triangle as equilateral, isosceles or right angled or none.
2. Write a program to check whether input number is prime or not with and without use of
recursive function.
3. Write a program to separate digits of input 4-digit integer, separate and display its digits.
4. Write a program to implement Pascal's Triangle and Floyd's Triangle.
5. Write a program to implement linear and binary search techniques.
6. Write a program to implement sorting techniques: Bubble, Selection, and Insertion sorting.
7. Write a program to accept a string and to display the following:
(a) Total number of characters in the string.

35
 (b) Total number of vowels in the string.
(c) Total number of occurrences of character in the string.
(d) Check whether string is palindrome or not.
8. Write a program with function to swap values of two elements (call by reference).
9. Write a program to carry out following operations on strings using library functions.
(a) To concatenate a string S2 to string S1.
(b) To find the length of a given string.
(c) To compare two strings S1 and S2.
(d) To copy a string S2 to another string S1.
10. Write C program to compare two files and report mismatches

36
 Computer Workshop Technology
TEACHING SCHEME EXAMINATION SCHEME CREDIT SCHEME
Practical: 2 Hours/Week Term Work: 25 Marks Practical: 1
Total 2 Hours/Week Total 25 Marks Total: 1

Course Objective:
To acquire the knowledge of basic manufacturing processes used in computer engineering
technology

Prerequisite:
• Basics of Engineering materials. Basics of computer and laptop.

Course Outcomes: On completion of the course, students will have the ability to:
7. Understand the basics parts used in the computer and laptop.
8. Understand fundamental concepts of assembly of electronics components (PCB).
9. Understand the various joining processes
10. Develop plastic moulding component used in computer engineering.
11. Developing the component used in computer engineering by use of 3D printing technology.
12. Understand the knowledge of making fasteners used for computer and laptop.

Unit I (4 Hours)
Assembly of Computer: Introduction to hardware peripherals like RAM, ROM,
keyboard, Mouse, processors, etc. Generation of processors. Working of SMPS. Study
of various ports. Steps and precautions to assemble computer, Tools used in computer
hardware

Unit II (6 Hours)
Printed Circuit Boards Assembly (PCB): Study of joining processes, Resistance
welding and Soldering processes, why and how flux, tip tinner, solder wick, and post-
soldering cleaners are used in the hand soldering process. Laser welding, orbital
welding. Advantages and disadvantages of welding processes.

Unit III (6 Hours)

CPU Cabinet Manufacturing Process: Introduction to machines in sheet metal
Industry: shearing machine, bending machine, circular profile cutting machines.
Different types of sheet metal folds. Rivets and its different parts, selection of rivet
heads, types of rivets and its uses. Punching, blanking, shearing, bending, and piercing.

Unit IV (2 Hours)
Plastic Molding Process: Introduction to plastic molding. Types of plastics. Types of
plastic molding. Exercise on plastic molding machine ,manufacturing of plastic
moulded job.

37
Unit V (2 Hours)
3D Printing Technology: Introduction to Additive Manufacturing, Need for Additive
Manufacturing, Generic AM process, Classification of AM Processes, 3D Printing
process. Steps in AM process, Advantages of AM, Major Applications

Unit VI (4 Hours)
Study of Machining Processes: Introduction to machining processes, Different types
of turning and grinding operations, by using turning operations making of simple
fastener used in computer engineering.

Textbooks:
1. Khanna O.P. and Lal. M., " Production Technology”, Dhanpatrai Publications (P) Ltd., New
Delhi.
2. Jain R.K., “Production Technology”, Khanna Publishers, Delhi
3. The Complete Reference PC Hardware, Craig Zacker, John Rourke

Reference Books:
1. Choudhary Hajra S. k., Choudhary Hajra A. k. “Elements of Workshop Technology Vol 2
Machine Tools, Publisher: Media Publishers & Promoters, India.
2. Rajput R. K ., “Manufacturing Technology”, Laxmi Publications (P)Ltd, New Delhi..

List of Laboratory Exercise:

1 . Practical on introduction to hardware and different tools used in workshop technology

for computer engineering.
2 . Experiment and demonstration of soldering processes on electronics components such as
PCB assembly.
3 . Practical on resistance welding processes.
4 . Practical demonstration on shearing machine, bending machine, circular profile cutting
machines used in sheet metal operations for manufacturing of cabinet used in computer.
5 . Practical demonstration on Punching, blanking, shearing, bending, and piercing.
6 . Practical demonstration on plastic molding machine.
7 . Practical demonstration on 3 D printing machine
8 . Practical demonstration on making fastener for computer by machining processes .
9 . Industrial visit to the manufacturing industry.

38
 B. Tech
Information Technology
Semester II

39
 Engineering Mathematics-II (Common for all Branches)

TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME

Theory:- 03 Hours/ Week End Semester Examination 60 Marks Theory: 03
Tutorial: 01
Tutorial :- 01 Hours/ Week Internal Assessment 40 Marks
Total : 4 Hours/ Week Total 100 Marks Total 04

Course Prerequisites:- The students should have knowledge of differential calculus.

Course Objective On completion of the course –

1. Fundamental theorems, concepts in Matrices,
Demoivre's theorem and its applications in engineering.
2. Various techniques in Calculus, Explanation of functions
and Infinite series.
3. Partial differentiation, maxima, minima and its applications
in engineering
Course Outcomes:- After completion of the course students will be able to
1. Solve differential equations by different methods.
2. Apply different laws to solve Simple Harmonic
Motion, One–Dimensional Conduction of Heat.
3. Solve integral calculus and Fourier series.
4. Solve integral calculus with error functions.
5. Determine position in solid geometry
6. Solve multiple integration problems.

Unit I: Differential Equation of First Order and First Degree: (06 Hrs)
Definition, Order and Degree of DE, Formation of DE, Solutions of Variable
Separable DE, Exact DE, Linear DE and reducible to these types

Unit II: Applications of Differential Equations (06 Hrs)

Applications of DE to Orthogonal Trajectories, Newton's Law of Cooling,
Kirchoff‟s Law of Electrical Circuits, Motion under Gravity, Rectilinear
Motion, Simple Harmonic Motion, One–Dimensional Conduction of Heat

Unit III: Fourier Series: (06 Hrs)

Definition, Dirichlet's conditions, Fourier Series and Half Range Fourier Series,
Harmonic Analysis

Unit IV: Integral Calculus: (06 Hrs)

Reduction formulae, Beta and Gamma functions, Differentiation under the

40
Integral Sign, Error functions
Unit V. Solid Geometry: (06 Hrs)
Cartesian, Spherical Polar and Cylindrical Coordinate Systems, Sphere, Cone
and Cylinder

Unit VI: Multiple Integrals and their Application: (06 Hrs)

Double and Triple integrations, Applications to Area, Volume, Mean and Root
Mean Square Values

PBL: Project Base Learning (Topics)

1 Formation of differential equation

2 Exact differential Equation
3 Linear differential equation
4 Newton’s law of cooling
5 Newton’s second law of motion
6 Fourier’s law
7 Kirchhoff’s voltage law
8 Fourier series
9 Harmonic analysis
10 Gamma and beta function
11 Reduction formulae
12 Locating position in three dimensional space
13 Multiple integrals applications
14 Error function
Textbooks
1. Applied Mathematics (Volumes I and II) by P. N. Wartikar & J. N. Wartikar
(Pune Vidyarthi Griha Prakashan, Pune),7th Edition, 1988, Reprint 2010.

Reference Books
1. Higher Engineering Mathematics by B.S. Grewal (Khanna Publication)
2. Higher Engineering Mathematics by B.V. Ramana (Tata McGraw-Hill),
Edition, 2008
3. Advanced Engineering Mathematics by Erwin Kreyszig (Wiley Eastern
Ltd.), 8th Edition, 1999, Reprint 2010
4. Advanced Engineering Mathematics, 7e, by Peter V.O'Neil (Thomson
Learning), Edition 2007
5. Advanced Engineering Mathematics, 2e, by M. D. Greenberg (Pearson
Education), 2nd, Edition, 2002

Unit Test –
Unit Test - I Unit I, II, III

Unit Test - II Unit IV, V, VI

41
 Engineering Physics (Common for all Branches)

TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME

Theory:- 03 Hours/ Week End Semester Examination 60 Marks Theory: 03
Practical :- 02 Hours/ Week Internal Assessment 40 Marks Practical: 01
Total:- 05 Hours/ Week Term Work 50 Marks Total 04
Total 150 Marks

Course Prerequisites:- Students are expected to have a basic understanding of physics and
calculus.

Course Objective To impart knowledge of basic concepts in physics relevant to

engineering applications in a broader sense with a view to lay
foundation for the engineers.

Course Outcomes:- After completion of the course students will be able to

1. Analyze the properties of charged particles to develop
modern instruments such as electron microscopy.
2. Understand the problems associated with architectural
acoustics and give their remedies and use ultrasonic as a tool
in industry for non destructive testing.
3. Apply quantum physics problems to micro level phenomena
and solid state physics.
4. Understand the wave nature of light and apply it to measure
stress, pressure and dimension etc.
5. Apply the principles of lasers and fiber optics for
applications in the field of engineering.
6. Remember properties of solid matter and connect to
applications in the field of engineering.

Unit I: Modern Physics (6 Hours)

Motion of a charged particle in electric and magnetic fields, Electrostatic and
Magnetostatic focussing, Electron microscopy, interaction of electron beam
with the material, Wavelength and resolution, transmission electron microscope
(TEM), scanning electron microscope (SEM), Separation of isotopes by
Bainbridge mass spectrograph, cathode ray tube (CRT), CRT in cathode ray
oscilloscope (CRO).

Unit II. Architectural Acoustics (6 Hours)

Elementary acoustics, Reverberation and reverberation time, Sabine’s formula
(without Derivation), Intensity level, Sound intensity level, Loudness, Sound
42
absorption, Sound absorption coefficient, different types of noise and their
remedies, basic requirement for acoustically good hall, factors affecting the
architectural acoustics and their remedies, introduction to ultrasonics,
Production of ultrasonics by magnetostriction and piezoelectric methods,
applications (thickness measurement, flaw detection).

Unit III: Quantum mechanics (6 Hours)

Dual nature of matter, concept of wave packet, group and phase velocity and
relation between them, physical significance of wave function, Schrodinger’s
time dependant and time independent wave equation, Application of
Schrodinger’s time independent wave equation to the problems of Particle in a
rigid box, concept of tunnelling at potential barrier (no derivation-only
conceptual discussion).

Unit IV: Optics – I (Interference and Diffraction) (6 Hours)

INTERFERENCE: Interference due to thin film of uniform thickness and
nonuniform thickness, engineering applications of interference (optical flatness,
non-reflecting coatings).
DIFFRACTION: Diffraction at a single slit (Geometrical method), Conditions
for maximum and minimum, Diffraction at a circular aperture (Result only),
Plane diffraction grating, Conditions for principal maxima and minima.

Unit V: Optics – II (Polarisation and Lasers) (6 Hours)

POLARISATION: Introduction, Double refraction and Huygen’s theory,
Positive and negative crystals, Nicol prism.
LASERS: Lasers introduction, Characteristics of Lasers, Working principle and
components of He-Ne Laser, Nd -YAG Laser, Semiconductor diode Laser,
Applications in the field optical fiber (Principle, Acceptance angle and
acceptance cone, Numerical aperture, Types of optical fibers, Fiber optic
communication).

Unit VI. Solid State Physics (6 Hours)

Origin of band gap, Energy bands in solids, Fermi-Dirac probability function
and position of Fermi level in intrinsic semi-conductors (with derivation) and in
extrinsic semi-conductors, Formation and band structure of p-n junction, Hall
effect and Hall coefficient.
Introductions of nanoparticles, properties of nanoparticles (Optical, electrical,
Magnetic, structural, mechanical), synthesis of nanoparticles (Physical and
chemical), quantum dots – wide band semiconductors, direct/indirect band gap
semiconductors.

43
PBL : Project Based Learning (topics)

Sr. No. Topic

1. Tesla Coil

2. Thin film interference in soap film-formation of colors

3. LiFi- wireless data transfer system using light

4. Need of medium for propagation of sound wave

5. Possible effects of electromagnetic fields (emf) on human health

6. Design and simulation of automatic solar powered time

regulated water pumping
7. Solar technology: an alternative source of energy for national
development
8. Measurement and effect of environmental noise in the college

9. Electronic eye (Laser Security) as auto-switch/security system

10. Electric power generation by road

11. Design and construction of distance measuring instrument using

LASER
12. Design and construction of remote control devices – electronic
bell, Fan etc
13. Absorption coefficient of sound absorbing materials

14. Velocity determination of O-ray and E-ray in double refracting

materials
15. Velocity determination of O-ray and E-ray in double refracting
materials
16. The design and construction of the hearing aid device

17. Study of Quantum confinement effect

18. Wind turbines - a source of electricity

19. Measurement of gravitational constant ‘g’

44
Practical (Any Eight of the Following)
1. Determination of radius of planoconvex lens/wavelength of light/Flatness
testing by Newton’s rings
2. Determination of wavelength of light using diffraction grating
3. Determination of frequency of ac voltage by CRO.
4. Determination of refractive index for O-ray and E-ray
5. Determination of divergence of a laser beam
6. Particle size by semiconductor laser
7. Determination of wavelength of laser by diffraction grating
8. To study Hall effect and determine the Hall voltage
9. Calculation of conductivity by four probe method
10. Study of solar cell characteristics and calculation of fill factor
11. Determination of band gap of semiconductor
12. Synthesis of metal oxide nanoparticles (ZnO/ZnS/silver/Gold)
13. Measurement of average SPL across spherical wavefront and behaviour
with the distance
14. Determination of velocity of sound in liquid by ultrasonic interferometer
15. Study of B-H curve of a sample.
16. Determination of Plank’s constant.

Text Books
1. A Textbook of Engineering Physics, M N Avadhanulu, P G Kshirsagar and
TVS Arun Murthy, S. Chand Publishing (2018).
2. Engineering Physics, R K Gaur and S L Gupta, Dhanpat Rai Publishing Co
Pvt Ltd (2015).
3. Concepts of Modern Physics, Arthur Beiser, Shobhit Mahajan and S. Rai
Choudhury, McGraw Hill Education (2017).

Reference Books
1. Fundamentals of Physics, Jearl Walker, David Halliday and Robert
Resnick, John Wiley and Sons (2013)
2. Optics, Francis Jenkins and Harvey White, Tata Mcgraw Hill (2017)
3. Principles of Physics, John W. Jewett, Cengage publishing (2013)
4. Introduction to Solid State Physics, C. Kittel, Wiley and Sons (2004)
5. Principles of Solid State Physics, H. V. Keer, New Age International (1993)
6. Laser and Non-Linear Optics, B. B. Laud, New Age International Private
Limited (2011)

Unit Test –

Unit Test - I Unit I, II, III

Unit Test - II Unit IV, V, VI

45
 Content Management System

TEACHING SCHEME EXAMINATION SCHEME CREDIT SCHEME

Theory: 4 Hrs/Week End Semester 60 Marks Theory 04
Examination: :
Practical: 2 Hrs/Week Internal Assessment 40 Marks Practical: 01
Term Work: 50 Marks
Total: 6 Hrs/Week Total: 150 Marks Total Credits: 05

Course Objectives:
To design a system for maintaining the content.

Course Prerequisites:
Students should have knowledge of
Fundamental understanding of the scripting languages.

Course Outcome:
Students will be able to:
1) Understand the fundamental concepts and principles of Content Management Systems.

2) Identify the features and functionalities of different CMS platforms.

3) Evaluate and select a suitable CMS for specific organizational requirements.

4) Develop skills to create, organize, and publish content using a CMS.

5) Gain knowledge of best practices for managing and maintaining a CMS.

6) Explore advanced topics such as customization, integration, and security in CMS.

UNIT-I Introduction to Content Management Systems (8 Hours)

Introduction to Content design, Introduction to CMS, Definition
and overview of CMS, Benefits, and challenges of using a CMS,
Types of CMS platforms, CMS vs. traditional web development.

UNIT-II Selecting and implementing a CMS (8 Hours)

Needs assessment and requirements gathering, Evaluating CMS
options, Planning and executing CMS implementation, Data
migration and content import.

46
UNIT-III Content Creation and Organization (8 Hours)
Creating and editing content in a CMS, organizing content using
taxonomies and categories, managing multimedia content
(images, videos, etc.), Working with templates and themes.
UNIT-IV Content Publishing and Workflow (8 Hours)

Content publishing process, Workflow management in CMS,

Versioning and revision control, User roles and permissions.
UNIT-V CMS Management (8 Hours)

Managing a CMS, CMS maintenance and updates, Performance

optimization, Backup and disaster recovery, Analytics, and
reporting.
UNIT-VI Orchestration Customization and Integration (8 Hours)

Extending CMS functionality with plugins and modules,

customizing themes and templates, Integrating third-party
applications and services, CMS Security and User Experience,
Security best practices in CMS, User authentication and access
control

SEO optimization for CMS, Usability, and accessibility

considerations. Tools: WordPress, Drupal, Joomla, Magento.

Project Based Learning Assignments*Note: - *Students in a group of 3 to 4 shall

complete any one project from the following list

1) Use Blogger for publishing the resume.

2) Use WordPress plugins for publishing the contents of the blog.
3) CMS Evaluation Report: Students will research and evaluate different
CMS platforms based on predefined criteria and write a
comprehensive report recommending the most suitable CMS for a
specific use case.
4) Content Creation Exercise: Students will create and publish a sample
website using a chosen CMS platform. The website should
demonstrate their understanding of content creation, organization, and
publishing.
5) CMS Customization Project: Students will customize the design and
functionality of a CMS website by modifying themes, templates, or
plugins. They will document their modifications and present their
customized website.
6) CMS Security Analysis: Students will analyze the security
vulnerabilities of a CMS platform and propose measures to enhance
its security. They will present their findings and recommendations in a
47
 written report.

7) Design and develop a fully functional CMS-driven website from

scratch. They will present their project, demonstrating their ability to
apply the concepts and skills learned throughout the course.
8) Publish the website using Blogger.

9) Publish the website on WordPress and apply the mapping of other

third-party DNS.
10) Design a complete website and publish it on a third-party vendor.

Textbooks:
1) Professional WordPress: Design and Development by Brad Williams,
David Damstra, and Hal Stern
2) Joomla! 3 Explained: Your Step-by-Step Guide by Stephen Burge

Reference Books:

1) Content Management Bible by Bob Boiko

2) Content Strategy for the Web by Kristina Halvorson and Melissa Rach

3) Pro Drupal Development by John K. VanDyk and Todd Tomlinson

Syllabus for Unit Tests:

Unit Test -1 Unit – I, Unit – II, Unit – III

Unit Test -2 Unit – IV, Unit –V, Unit - VI

48
 Computer Communication and Networks

TEACHING EXAMINATION SCHEME CREDIT

SCHEME SCHEME
Lecture: 4 End Semester Examination: 60 Theory 4
Hours/Week Marks
Practical: 2 Internal Assessment: 40 Practical 1
Hours/Week Marks
Term Work: 25
Marks
Total 6 125 Marks 5
Hours/Week

Course Objective:
1.Introduction to the fundamental concepts of computer communication
networks.
2.To understand the basic concepts of layered models, protocols and
interworking between
computer networks and switching components in telecommunication systems.
3.Gain expertise in some specific areas of networking such as the design and
maintenance of individual networks.

Prerequisite: Students should have knowledge of

1. How computer networks operate and the fundamentals of data communication.
2. Concepts and fundamental design principles of modern computer networking in
a top-
down approach, focusing on the Internet’s architecture and protocols.

Course Outcomes: On completion of the course, students will have the ability to:
1. Understand networks & their significance.
2. Use network protocol models to explain the layers of communications in data
networks.
3. Describe the different types of network Transmission Media and
Technologies.
4. Analyze the different types of network devices and their functions within a
network.
5. Distinguish the basic network Layer services and Protocols associated with
each network.
6. Identify the protocols and functions associated with the transport layer
services.

Unit I (8 Hours)
Fundamentals of Computer communication: Computer
Communication Architecture, Communication Models, Data
Communication: Components, Representations, Data Flow, Protocols
49
and Standards. Line Configuration, Transmission impairment, Data
Rate Limits, Performance. Digital and Analog transmission Types.
Fundamentals of Networks: Physical Structures, Building Network
and Network Types, Overview of Topology, Concepts of
Communication Modes, and Transmission Modes.

Unit II (8 Hours)
Network Models and The Basics of Protocols: Reference Models:
OSI Model, TCP/IP Protocol Suite: Layered Architecture, The OSI
Model Versus TCP/IP. Network applications, Novell Networks,
Arpanet, Internet, Connection oriented network, Network Hardwares
and Softwares,
Protocol Layering: Scenarios, Principles, Logical Connections,
Sockets and Ports, Encapsulation and D-encapsulation, Addressing.
Types of Multiplexing and Demultiplexing.

Unit III (8 Hours)

Transmission Media: Types of Transmission Media, Specification of
Medium, Performance and Impact of Transmission Impairments,
Applications of different transmission media.
Switching: Circuit-switched Networks, Packet Switching, Datagram
Switching and Datagram networks, Virtual circuit networks, Structure
of circuit and packet switch. Connection oriented services (Virtual
circuits), Connectionless services (Datagrams).

Unit IV (8 Hours)
Media Access Control and Data Link layer:
Networking Devices: Networking Devices: Hubs, Switch, Router,
Repeaters, Bridges, Gateway, Modem and Access Point, Backbone
networks.
Data-Link Layer: MAC Sub‐layer, LLC, MAC Addressing
Mechanism, Framing, Error control, Flow control, Token Ring,
Ethernet, FDDI, Address Resolution Protocols.

Unit V (8 Hours)
Network Layer: Role of Network layer, Internetworking, Ip Address
classes, IPV4 Addresses: Address Space, Classful Addressing,
Classless Addressing, IPv4 & IPv6 Protocol Packet Format, IPv4 vs
IPv6, Routing Protocols – Delivery, forwarding Types of Routing,
Routing Protocols – Delivery, Concepts of OSPF, BGP, ICMP,
Multicast Routing, Multicast routing protocols.

50
Unit VI (8 Hours)
Transport Layer: Transport Layer Services, Connectionless and
Connection oriented Protocols, Transport Layer Protocols.
User Datagram Protocol, UDP Services, UDP Applications,
Transmission Control Protocol, TCP Services, TCP Features, Segment,
Connection, State Transition diagram, Flow control, Error control, TCP
congestion control, Integrated services, Differentiated Services and
Flow Characteristics.
Application Layer: Services of application layer, Protocols: DNS,
Remote Logging (Telnet), SMTP, FTP, WWW, HTTP.

Textbooks
1. Computer Networks,'' by Andrew S. Tanenbaum, Nick Feamster, and David
Wetherall. Published by Prentice Hall, 6th edition, 2020. ISBN-13: 978-
0136764052
2. “Computer Networking: A Top-Down Approach,” by Jim Kurose and Keith
Ross, Addison-Wesley.
3. Data Communications and Networking , Forouzan, 5th Edition, McGraw
Hill, ISBN: 1-25-906475-3
4. Computer Networks: A system Approach: Larry L, Peterson and Bruce S.
Davie,Elsevier, 4thEdition.
5. Data Communications and Networks, Achyut S. Godbole ,Tata McGraw Hill
6. Computer Networking, Tularam M Bansod Dreamtech, Wiley

Reference Books
1. Computer Networks, James J Kurose, Keith W Ross, Pearson Education,
2013, ISBN: 0-273-76896-4
2. Data and Computer Communications by William Stallings.
3. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, ―Computer Networks: An
Open Source Approach‖, Mc Graw Hill Publisher.
4. Introduction to Data Communication and Networking, Wayarles Tomasi,
Pearson Education, ISBN:0130138282
5. An Engineering Approach to Computer Networks-S.Keshav, 2nd Edition,
Pearson Education

List of Laboratory Exercises:

1. To connect and built computers in different ways in a LAN (Topologies-star,
ring, bus, tree)
2. To connect and understand different network devices used in LAN- Hubs,
Switches, Routers, Bridges, Repeaters, Gateways, Modems.
3. To create network cable using RJ 45 connectors.
4. To install a network interface card (NIC) and locate mac address of computer.
5. Implementation of CRC.
6. Study and execution of Network commands.
51
 7. To discover and assign IP address in Windows & Linux.
8. Socket programming Client Server using RPC.
9. Perform Installation of LAN and troubleshooting of frequently occurred
problems.
10. Study and demonstration of CISCO packet tracer with data transmission.

Project Based Learning Assignments*

Note:- *Students in a group of 3 to 4 shall complete any one project from the
following list)
1. Learner’s Interaction with Information and Communication Technologies.
2. Networking and Security Projects.
3. Use of Information-Centric Networks in Revision Control Systems.
4. Real-Time Networking based Computer Ideas
5. Network Admission Control (NAC) Securing End Point Devices.
6. Network Desktop Manager. Example Modules: Desktop Sharing, Desktop
locking and unlocking, IP Port Scanning.
7. IP based Patient Monitoring System
8. An Internet Voting System Supporting User Privacy.
9. Network Traffic Monitoring & windows Remote Manager. Example
Modules: Remote Desktop, Remote Chat, Monitoring.
10. TCP Performance in an EGPRS system

Syllabus for Unit Tests:

Unit Test -1 Unit – I, Unit – II, Unit – III
Unit Test -2 Unit – IV, Unit –V, Unit - VI

52
 Object Oriented Programming

TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME

Lecture: 4 Hours/Week End Semester Examination:60 Marks Theory 4
Internal Assessment: 40 Marks
Total 4 Hours/Week Total 100 Marks 4

Course Objective:
The course focuses on the understanding of object-oriented concepts such as classes, objects, data
abstraction, methods, method overloading, inheritance, and polymorphism.

Prerequisite:
• Basics of C Programming.

Course Outcomes: On completion of the course, students will have the ability to:
1. Differentiate between procedural and object oriented programming approach
2. Understand the object-oriented programming approach
3. Understand operator overloading
4. Explore the concepts of inheritance
5. Explore the file stream functions
6. Understand the concepts of templates and exceptions.

Unit I (8 Hours)
Introduction to OOP: programming characteristics of object-oriented languages.
Comparison between C and C++. Programming basics of C++: input, output,
directives, program structure, data types, decision and loops structure, type
conversions.

Unit II (8 Hours)
Functions: function prototyping, function overloading, inline function, friend
function, scope resolution operator, static functions
Object and Classes: Encapsulation, Abstraction, Polymorphism, Classes, access
specifiers, static data members, static member functions, implementation of class in
C++, memory allocation of objects, types of constructors and destructor

Unit III (8 Hours)

Arrays and string: arrays as data member, arrays of objects, The standard C++ String
class and library functions.
Operator overloading: rules for overloading operators, overloading unary and binary
operators, overloading operators using friend function, manipulation of string using
operators.

53
Unit IV (8 Hours)
Inheritance: concept of inheritance, derived class and based class, types of
inheritance, virtual base class, abstract class, nesting of classes, constructors in
derived classes.
Pointer, Virtual Function and Polymorphism: pointers, pointer to objects, this
pointer, pointer to derived classes, virtual functions and pure virtual functions

Unit V (8 Hours)
Streams and Files: Stream classes for formatted and unformatted I/O operations, file
stream operations, file pointers and their manipulations, sequential input and output
file operations, random access to update a file, error handling.

Unit VI (8 Hours)
Templates: The Standard Template Library, class template with multiple parameters,
function template with multiple parameters, overloading template functions, member
function templates
Exceptions: basics, exception handling mechanism, mechanism for: throw, catch,
rethrow, specify exception

List of Internal Assignment will be framed by respective Course Coordinator.

Textbooks:
1 Object Oriented Programming with C++ Author: E. Balaguruswamy.
2 C++: The complete Reference Author: Herbert Schildt.

Reference Books:
1 Object Oriented Programming C++, Fourth Edition, By Pearson.
2 Object Oriented Programming in C++ Author: Robert Lafore.

Project Based Learning Assignments

Note:- *Students in a group of 3 to 4 shall complete any one project from the following list
1. Login and Registration System using C++
2. Car Rental System using C++
3. Bookshop inventory system using C++
4. Student Report Management System using C++
5. Sudoku Game using C++
6. Credit Card Validator using C++
7. Using Graphics to Draw and Move Shapes using C++
8. Banking Record System using C++
9. Hotel Management System using C++
10. Student Management System using C++
11. Bus reservation System using C++
54
 12. Library Management System using C++

Syllabus for Unit Tests:

Unit Test -1 Unit – I, Unit – II, Unit – III

Unit Test -2 Unit – IV, Unit – V, Unit - VI

55
 Universal Human Values (Common for all Branches)
TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME
Practical :- 02 Hours/ Week Term Work 50 Marks Practical: 01
Total 50 Marks Total 01

Course Prerequisites:-
During the Induction Program, students would get an initial exposure to
human values through Universal Human Values. This exposure is to be
augmented by this compulsory full semester foundation course.
Course Objective
Development of a holistic perspective based on self-exploration about
themselves (human being), family, society and nature/existence.
Understanding (or developing clarity) of the harmony in the human being,
family, society and nature/existence Strengthening of self-reflection.
Development of commitment and courage to act
Course Outcomes:-
After completion of the course students will be able to
1. Create more awareness of themselves, and their surroundings (family,
society, nature);
2. Understand the Human being is coexisting with self and body and able
to recognize its different needs and fulfillment
3. Develop more responsible life with human relationships, while
keeping in mind the human nature
4. Understand to imbibe sensitive approach towards society and
understand the dimensions of harmony in the society
5. Understand the recycle structure of the nature and able to recognize
the participation
6. Apply what they have learnt to their own self in different day-to-day
settings in real life, at least a beginning would be made in this
direction.

Unit I: Introductions, Aspirations and Concerns (4 Hours)

Getting to know each other, Self-exploration, Individual academic, career
Expectations of family, peers, society, and nation fixing one’s goals Basic
human aspirations Need for a holistic perspective, Role of UHV.

Unit II. Self-Management, Health (4 Hours)

Self-confidence, peer pressure, time management, anger, stress Personality
development, Self-improvement Harmony in the human being. Health issues,
healthy diet, healthy lifestyle Hostel life Harmony of the self and Body Mental
and physical health.

56
Unit III: Relationships (4 Hours)
Home sickness, gratitude towards parents, teachers and others Ragging and
interaction Competition and cooperation Peer pressure. Harmony in
relationship Feelings of trust, respect, gratitude, glory, love.

Unit IV: Society (4 Hours)

Participation in society. Harmony in the society Understanding the harmony
in the society (society being an extension of family): Resolution, Prosperity,
fearlessness (trust) and co-existence as comprehensive Human Goals
.Visualizing a universal harmonious order in society- Undivided Society,
Universal Order- from family to world family.

Unit V: Natural Environment (4 Hours)

Participation in nature Harmony in nature/existence Understanding the
harmony in the Nature
Interconnectedness and mutual fulfillment among the four orders of nature-
recyclability and self regulation in nature.

Unit VI. Self-evaluation Strategy (4 Hours)

Strategy for transition from the present state to Universal Human Order: a. At
the level of individual: as socially and ecologically responsible engineers,
technologists and managers. At the level of society: as mutually enriching
institutions and organizations review role of education Need for a holistic
perspective

Text Book
1. Human Values and Professional Ethics by R R Gaur, R Sangal, G P
Bagaria, Excel Books, New Delhi, 2010

Reference Books
1.Jeevan Vidya: Ek Parichaya, A Nagaraj, Jeevan Vidya Prakashan,
Amarkantak, 1999.
2.Human Values, A.N. Tripathi, New Age Intl. Publishers, New Delhi, 2004.
3. The Story of Stuff (Book).
4. The Story of My Experiments with Truth - by Mohandas Karamchand
Gandhi
5. Small is Beautiful - E. F Schumacher.
6. Slow is Beautiful - Cecile Andrews
7. Economy of Permanence - J C Kumarappa
8. Bharat Mein Angreji Raj – Pandit Sunderlal
9. Rediscovering India - by Dharampal
10. Hind Swaraj or Indian Home Rule - by Mohandas K. Gandhi
11. India Wins Freedom - Maulana Abdul Kalam Azad
12.Vivekananda - Romain Rolland (English)

57
 Information Technology Laboratory – II

TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME

Practical: 2 Hours/Week Term Work : 25 Marks Practical: 1
Total 2 Hours/Week Oral: 25 Marks Total: 1
Total: 50 Marks

Course Objective:
The course focuses on the practical mastery of object-oriented concepts such as classes, objects,
data abstraction, methods, method overloading, inheritance, and polymorphism.

Prerequisite:
• Basics of C Programming.

Course Outcomes: On completion of the course, students will have the ability to:
1. Apply input output derivatives
2. Implement classes with their objects
3. Implement operator overloading.
4. Implement types of inheritance.
5. Apply file stream functions
6. Implement templates and exceptions.

Unit I (4 Hours)
C++ Programming basics: input output directives, variable declarations, input output
of variables, type bool, setw manipulator, type conversions.

Unit II (4 Hours)
Object and Classes: Implementation of class and object in C++, implantation of types
of constructors and destructors, implementing classes, objects and memory static class
data, using Const keyword.
The default copy constructor, returning from function. Structures and classes..
Implementing Functions: Object as function arguments, Returning object from
functions, implementing function overloading, inline and friend functions

Unit III (4 Hours)

Implementing Arrays and string: Arrays as class member, Arrays of object, Array
of string, standard C++ String class
Implementation of Operator overloading: Implementing unary and binary
operators, implementing explicit and mutable overloading.

58
Unit IV (4 Hours)
Implementing Inheritance: Implementing Derived class and based class,
implementing multiple, multilevel, hierarchical inheritance, public and private
inheritance, inheriting constructors
Implemtation of pointers: pointer to objects, this pointer, pointer to derived classes,
implementation of virtual functions and pure virtual functions

Unit V (4 Hours)
Implementing Streams and Files: Implementing formatted and unformatted I/O
operations, Implementing file stream operations for sequential and random access

Unit VI (4 Hours)
Implementing Templates: Implementing class and function template with multiple
parameters, overloading template functions, templates for member function

Implementing Exceptions: Implement throw, catch, rethrow, with specifying

exception

Textbooks:
1 Object Oriented Programming with C++ Author: E. Balagurusamy.
2 C++: The complete Reference Author: Herbert Schildt.

Reference Books:
1 Object Oriented Programming C++, Fourth Edition, By Pearson.
2 Object Oriented Programming in C++ Author: Robert Lafore.

List of Laboratory Exercise:

1. Implement classes and objects

2. Implement a program using array of object and array as data member using suitable programs
3. Implement binary and unary operator overloading
4. Implement types of constructors and destructors
5. Implement multilevel, multiple and hierarchical public and private inheritance
6. Implement this pointer and pointer to object
7. Implement types of functions and overloading of functions
8. Implement file pointers and file stream functions
9. Implement function and class templates with overloading
10. Implement user defined exception with throw, catch and rethrow

59
 COMPUTER AIDED DRAWING & DESIGN

TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME

Practical: 2 Hours/Week Term Work: 25 Marks Practical: 1
Total 2 Hours/Week Total 25 Marks Total: 1

Prerequisite:
Basics of programming skill

Course Objective:
1. To have the knowledge of Orthographic and Isometric projections
2. To understand the basic principles of Engineering drawing
3. To have the knowledge of different AutoCAD commands
4. To understand the algorithm for generating different entities on the screen

Course Outcomes: On completion of the course, students will have the ability to:
1. Prepare and understand drawings.
2. Use the principles of orthographic projections.
3. Use the principles of Isometric projections.
4. Able to draw simple drawing using AutoCAD.
5. Generate the line by highlighting the pixels.
6. Fill the polygon.

Unit I (4 Hours)
Orthographic Projection
Dimensioning and conventions strictly as per SP 46:2003 (Revised). Orthographic
projection of right regular solids such as cube and prism. Orthographic projection of
simple machine blocks
(4 Hours)
Unit II
Isometric Projections
Introduction, Isometric axes, Lines & planes, Isometric scale, Isometric projection and
Isometric view, Conversion of Isometric to Orthographic Projections

Unit III (4 Hours)

Introduction to AutoCAD
Getting Started with AutoCAD. Line, polyline, Circle, arc Rectangle, polygon Ellipse,
Elliptical arc, spline, Xline, Ray, Points Measure, Divide, Region Wipeout, Helix,
Donut

60
Unit IV (4 Hours)
AutoCAD Modify Tools and Dimensioning
Move, copy, Rotate, scale Stretch, fillet, chamfer Erase, offset, explode Array, polar
Array, path array Trim, extend, mirror. Annotations Dimensions, dimension setting
Linear dimension, Aligned dimension Angular dimensions, arc length, Radius
Diameter

Unit V (4 Hours)
Line Drawing Algorithm
The Digital Difference Analyser (DDA) algorithm to draw lines on a screen.
Interpolation points based on the difference between the start and end points.
Bresenham Line Drawing Algorithm. Numerical examples.

Unit VI (4 Hours)
Flood Fill Algorithm
Concept of seed point, four connected approaches and eight connected. Boundary
colour and fill colour. Filling of different polygon.

Textbooks:
1. “Elementary Engineering Drawing” by Bhatt, N.D., Charotar publishing Co.
2. “Engineering Graphics” by K.L. Narayana and P.Kannaiah, SCITECH PUBLICATIONS
(INDIA) PVT.LTD. October 2008
3. “Engineering Graphics with AutoCAD”, D. M. Kulkarni, A. P. Rastogi, and A. K. Sarkar (2009),
PHI Learning Private Limited, New Delhi.
4. “Engineering Drawing: With an Introduction to CAD,” Jolhe, Dhananjay (2006), Tata Mc Graw
Hill, India

List of Laboratory Exercise:

1. Drawing to half imperial size sheet with instruments. Drawing illustrating basic concepts of
Orthographic projections and dimensioning.
2. From the given three views draw isometric
3. Introduction to AutoCAD. Student should get familiarise with the GUI of the software.
4. Commands for drawing basic entities
5. AutoCAD Modify Tools and Dimensioning
6. Digital Difference Analyser (DDA) algorithm
7. Bresenham Line Drawing Algorithm
8. Flood Fill Algorithm

61
 B. Tech
Information Technology
Semester III

62
 Discrete Structures and Graph Theory
TEACHING SCHEME EXAMINATION SCHEME CREDIT SCHEME

Theory 3 Hours/Week End Semester 60 Marks Theory 3

Examination

Internal Assessment 40 Marks

Total 3 Hours/Week Total 100 Marks Total Credits 3

Course Objectives:
1. To apply and relate knowledge of mathematics in computer science.
2. To learn proof theory with propositional calculus and induction.
3. To map, represent and solve network problem with trees and graphs.

Prerequisite:
Basic mathematics and programming fundamentals.
Course Outcomes: On completion of the course, students will have the ability to
1. Formulate real world problems into statement forms using sets and relations which
can be solved or proved mathematically using set theory and logic.
2. Design mathematical model from theoretical statements.
3. Apply counting techniques to real world problems.
4. Apply knowledge of graphs to solve network problems.
5. Design searching algorithm efficiently by applying tree and tree traversal logic.
6. Apply algebraic structure and coding theory in computer science.

Unit I (6 Hours)
Propositional Logic and Proof Theory: Sets, Set operations, Finite and Infinite
sets, Venn diagram, Principle of inclusion and exclusion, Multisets. Propositions,
Conditional Propositions, Logical Connectivity, Propositional calculus,
Universal and ExistentialQuantifiers, Normal forms.

Unit II: (6 Hours)

Induction and Relations: Types of mathematical inductions, Problems on

mathematical induction. Basics of combinatorics, Pigeonhole Principle,
Properties of Binary Relations, Closure of relations, Warshall’s algorithm,
Equivalence.

63
Unit-III:
Probability: Sample Space, Events of an Experiment, Properties of Probability,
permutations, combinations, generalized permutations and combinations
(with/without repetitions), Probability theory, Discrete Random variables,
Bernoulli's Distribution, Binomial coefficients, and identities.

Unit IV (6 Hours)
Graph theory: Basic terminology, multi graphs and weighted graphs, paths and
circuits,shortest path in weighted graph, Dijkstra’s algorithm, Hamiltonian and
Euler paths and circuits, factors of a graph, planer graph and Travelling
salesman problem.

Unit V (6 Hours)
Trees: Trees, rooted trees, path length in rooted trees, prefix codes, binary search
trees,tree traversal, spanning trees and cut set, minimal spanning trees, Kruskal’s
and Prim’s algorithms for minimal Spanning tree. The Max flow- Min Cut
Theorem (Transport network). Case Study- Game Tree, Mini-Max Tree.

Unit VI (6 Hours)
Algebraic Structures: The structure of algebra, Algebraic Systems, Semi
Groups, Monoids, Groups, Homomorphism and Normal Subgroups, coding
theory, Polynomial Rings and polynomial Codes.

List of Internal Assignment will be framed by respective Course Coordinator.

Textbooks:
1. Kenneth H. Rosen, Discrete Mathematics and its Applications, 7th Edition,
McGraw Hill.
2. C. L. Liu, D. P. Mohapatra, Elements of Discrete Mathematics: A Computer Oriented
Approach, 4th Edition, McGraw Hill.

Reference Books
1. Seymour Lipzschutz, M. Lipson, Discrete Mathematics, 3rd Edition, McGraw Hill.
2. P. Tremblay, R. Manohar, Discrete Mathematical Structures with Applications to
Computer Science, McGraw Hill.

List of Assignments:
1. Apply the Principle of Inclusion and Exclusion to solve problems.
2. Formulate propositional calculus expressions
3. Apply Warshall's algorithm to find closure of relations.
4. Explore Bernoulli's Distribution and Binomial coefficients.
64
 5. Solve problems involving paths and circuits.
6. Apply Kruskal’s and Prim’s algorithms for minimal spanning trees.
7. Discuss the applications and implications of these concepts in game theory
8. Analyze a case study involving game trees and Mini-Max algorithms
9. Provide examples and solve problems involving semi-groups and monoids.
10. Explore ring homomorphisms and their properties.
Project Based Learning Assignments
Note:- *Students in a group of 3 to 4 shall complete any one project from the following list
1. Study the writings of Lewis Carroll on symbolic logic. Describe in detail some of the models
he used to represent logical arguments and the rules of inference he used in these arguments.
2. Describe a variety of different applications of the Fibonacci numbers to the biological and
the physical sciences.
3. Explain how graph theory can help uncover networks of criminals or terrorists by studying
relevant social and communication networks.
4. Explain what community structure is in a graph representing a network, such as a social
network, a computer network, an information network, or a biological network. Define what
a community in such a graph is, and explain what communities represent in graphs
representing the types of networks listed.
5. Describe how Euler paths can be used to help determine DNA sequences.
6. Describe some of the strategies and algorithms used to solve the traveling salesperson
problem.
7. Explain how graph multi-colorings can be used in a variety of different models.
8. Define a heap and explain how trees can be turned into heaps. Why are heaps useful in
sorting?
9. Describe the techniques used by chess-playing programs such as Deep Blue or stockfish.
10. Discuss the algorithms used in IP multicasting to avoid loops between routers.
11. Compare and contrast some of the most important sorting algorithms in terms of their
complexity and when they are used.
12. Describe an algorithm for finding the minimum spanning tree of a graph such that the
maximum degree of any vertex in the spanning tree does not exceed a fixed constant k
13. Describe the origins of mathematical induction. Who were the first people to use it and to
which problems did they apply it?

Syllabus for Unit Tests:

Unit Test -1 Unit – I, Unit – II, Unit - III
Unit Test -2 Unit – IV, Unit – V, Unit – VI

65
 Database Management Systems
TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME
Lecture: 03 Hrs/Week End Semester 60 Marks Lecture 03
Examination
Practical: 02 Hrs/Week Internal Assessment 40 Marks
Term Work 25 Marks Practical 01
Practical 25 Marks
Total 05 Hrs/Week Total 150 Marks Total 04
Course Objective:
Introduction to Database Management Systems, with an emphasis on efficiently and
effective organization, maintenance and retrieval of information in Database Management
Systems.
Prerequisite:
Students should have knowledge of
1) Basic understanding of data and data structure
2) Basic understanding of programming language

Course Outcomes: On completion of the course, students will have the ability to:
1. Model an application’s data requirements using conceptual modelling tools
2. Implement concepts of relational database using SQL and PL/SQL
3. Demonstrate concepts of relational database design
4. Interpret the query processing and optimization activities in database
5. Interpret the transaction activities in database
6. Recognize the emerging database applications and security concerns

Unit I (6 Hours)
Introduction: Introduction to Database system architecture, Data Abstraction,
Data Independence
Data models: Extended Entity-relationship model, network model, relational
and object oriented data models, data manipulation operations.
Relational algebra: Fundamental and extended relational algebra operation

Unit II (6 Hours)
Integrity constraints : What are constraints, types of constrains, Relational
database design: Domain and data dependency, Armstrong's axioms, Functional
Dependencies, Normal forms (1NF, 2NF, 3NF, BCNF, 4NF), Dependency
preservation, Lossless design

Unit III (6 Hours)

Introduction to SQL: Data definition language, Data Manipulation Language,
Joined relations, Views
Introduction to PL/SQL: Functions, Procedures, Triggers, Cursors.

66
Unit IV (6 Hours)
Indexing strategies: Indices, B trees, B+ trees, Hashing , Query processing and
optimization: Evaluation of relational algebra expressions, Query equivalence,
Join strategies, Query optimization algorithms

Unit V (6 Hours)
Transaction processing: Concurrency control, ACID property, Serializability of
scheduling, Locking and timestamp based schedulers, Multi-version and
optimistic Concurrency Control schemes, Database recovery, SQL commands
for Transactions

Unit VI (6 Hours)
Database Security: Authentication, Authorization and access control, DAC,
MAC and RBAC models, Intrusion detection, SQL injection.
Data Intensive Computing: Introduction to big data, unstructured data
processing using Hadoop , NoSQL and Cloud Databases: Architecture,
Components, Characteristics
Textbooks
1. Silberschatz, Korth, “Data base System Concepts”, 7th ed., McGraw hill.
2. Raghu Ramakrishnan and Johannes Gehrke, “Database Management Systems” (3/e),
McGraw Hill.
3. Ivan Bayross, “SQL, PL/SQL the Programming Language of Oracle”, BPB
Publication.
Reference Books
1. Ramez Elmasri and Shamkant B. Navathe, Fundamentals of Database Systems (5/e),
Pearson Education
2. C. J. Date, Kannan, “An Introduction to Database Systems”, 8e, Addison-Wesley
List of Assignments
The course coordinator shall design appropriate assignments at least 2 on each unit.
List of Laboratory Exercises
1. Conceptual Designing using ER Diagrams (Identifying entities, attributes, keys and
relationships between entities, cardinalities, generalization, specialization etc.)
2. Converting ER Model to Relational Model (Represent entities and relationships in
Tabular form, Represent attributes as columns, identifying keys) Apply
Normalization to remove the redundancies and anomalies in the above relational
tables, Normalize up to Third Normal Form
3. Study and implementation of SQL : DDL Creation of above Tables using SQL- Data
types in SQL, Creating Tables (along with Primary and Foreign keys), Altering
Tables and Dropping Tables
4. Study and implementation of SQL : DML, Querying with set operations and
wildcards
5. Study and implementation of aggregate functions, joins, nested subqueries in SQL
for querying above tables
6. Study and implementation of views in SQL
67
 7. Study and implementation of PL/SQL – Control statements
8. Study and implementation of PL/SQL Functions and stored procedure
9. Study and implementation of Triggers
10. Study and implementation of Cursors
Project Based Learning - Provisional List of Projects
Implement any database management systems with CRUD functionality and design
normalised at least up to 3 NF. Apply appropriate integrity constraints and access privileges
to database and relations. Show indexing. (Any implemented system must have at least 7
inter-related normalised relations.
Syllabus for Unit Tests:
Unit Test -1 Unit – I, Unit – II, Unit - III
Unit Test -2 Unit – IV, Unit – V, Unit – VI

68
 Microprocessors and Microcontrollers
TEACHING SCHEME EXAMINATION SCHEME CREDIT SCHEME
Theory 3 Hours/Week End Semester 60 Marks Theory 3
Examination
Internal Assessment 40 Marks
Total 3 Hours/Week Total 100 Marks Total 3
Credits

Course Objectives:
This course facilitates the learners with the basic knowledge of microprocessors and
microcontrollers. Also, the course supports the learners with detailed study of ARM processor
andAVR Microcontroller.

Prerequisite:
Digital Electronics, C/C++/Java Programming

Course Outcomes: On completion of the course, students will have the ability to
1. Learn basics of 16/32-bit Microprocessors.

2. Cognize the ARM Cortex Processor with its architecture and programming.
3. Discover Intel Pentium and i7 processor with its architecture and pipelining.
4. Comprehend basics of 8/16-bit Microcontrollers.
5. Uncover the details of AVR Microcontroller with its architecture and programming.
6. Understand the basics of Arduino and Raspberry Pi Controllers.

Unit I (6 Hours)
. Introduction to Microprocessors: Basics of 16-bit and 32-bit processor (Intel
8086 and 80386 processors), Multicore Architecture, Hyperthreading
Technology,Instruction Set Architectures (ISA), Multiprocessor Organizations,
Inter-Processor Communication (IPC). Brief introduction to assembly language
programming

Unit II (6 Hours)
Intel Pentium Processor: Features and Internal Architecture, Superscalar
Operation, Integer &Floating- Point Pipeline Stages, Branch Prediction Logic,
Cache Organization and MESI Protocol, Comparative study of 8086, 80386,
Pentium I, Pentium II and Pentium III, Hyper Threading technology and its use
in Pentium 4, Intel i7 processor

69
Unit III (6 Hours)
ARM Cortex: ARM Micro-architecture (ARMv7/v8/v9/v11), ARM
architectures:Pipelining, ARM OS, Introduction to ARM Programming.

Unit IV (6 Hours)
Introduction to Microcontrollers: Microprocessors vs Microcontrollers, Basics of
8- bit and 16-bit Microcontrollers (Intel 8051 and 8096 microcontrollers),
Applicationsof microcontrollers.

Unit V (6 Hours)
AVR Microcontroller: Types of AVR Microcontrollers, ATmega16/32 8-bit
AVR microcontroller: Features, Pin Description, Internal Architecture, Data and
Program Memory, Brief introduction to AVR Programming using
C/Java/Assembly language

Unit VI (6 Hours)
Introduction to Arduino and Raspberry Pi : Introduction, Difference, Arduino
Unoand Raspberry Pi Pico (RP2040), microcontrollers, Programming concepts of
ArduinoUno with C/C++/Python and IDE, Programming concepts of Raspberry
Pi Pico with C/MicroPython.

Textbooks:
1 Arm Microprocessor Systems Cortex-M Architecture Programming and Interfacing,
MuhammadTahir, T&F India.
2 The Definitive Guide to ARM Cortex-M3 and Cortex-M4 Processors, Joseph Yiu.

3 ARM A32 Assembly Language, Bruce Smith.

4 8051 Microcontrollers, Satish Shah, Oxford University Press.
5 Microprocessors and Interfacing, N.Senthil Kumar, M.Saravanan, Oxford University Press
6 Programming and Interfacing Atmel AVR Microcontrollers, Grace, Cengage Learning.

7 Practical AVR Microcontrollers, Alan Trevennor, Technology In Action.

8 Getting Started with Arduino, Massimo Banzi and Michael Shiloh.
9 Getting Started with Raspberry Pi, Matt Richardson and Shawn Wallace.

Reference Books:
1 The Definitive Guide to ARM Cortex-M3 Processors, Stellaris, Texas Instruments.
2 ARM System-on-Chip Architecture, Steve Furber.
3 ARM processor, Santul Bisht, Lambert Publications
4 Modern Assembly Language Programming with the ARM Processor, Larry D Pyeatt.
70
5 Programming and Customizing AVR Microcontroller, Dhananjay Gadre.
6 Arduino Cookbook 2nd Edition, Michael Margolis.
7 Raspberry Pi The Ultimate Guide, Geoff Adams.
8 Internet of Things with Raspberry Pi and Arduino, Anita Gehlot.

Project Based Learning Assignments

Note:- *Students in a group of 2 to 3 shall complete and submit any one working project
under Arduino/Raspberry Pi/80851 or any other microcontroller

Syllabus for Unit Tests:

Unit Test -1 Unit – I, Unit – II, Unit - III

Unit Test -2 Unit – IV, Unit – V, Unit – VI

71
 Operating System

TEACHING SCHEME EXAMINATION SCHEME CREDIT SCHEME

Theory 3 Hrs/Week End Semester 60 Marks Theory 03
Examination
Practical 2 Hrs/Week Internal 40 Marks Practical 01
Assessment
Term Work 25 Marks
Oral 25 Marks
Total 5 Hrs/Week Total 150 Marks Total 04
Credits

Course Objectives:
1. To understand the mechanism of operating system such as process management, file
management, Memory management and storage structures used in the operating system.
2. To be familiar with the basics of Linux operating system.

Course Prerequisites:
Students should have knowledge of
• Basics of computers
• Knowledge in Computer Organization & Architecture

Course Outcome:
Students will be able to:
1) Install operating system and configure it.
2) Know different operating system services
3) Understand process management system calls.
4) Implement the various scheduling algorithms
5) Understand paging algorithms and its implementation
6) Understand file management and access methods

UNIT-I Operating system Overview (6 Hours)

Operating System – Concept, Evolution of Operating System,
Components of operating system, Functions of OS, Views of OS:
User view, System View
Different Types of Operating Systems-Batch operating system,
Multi Programmed, Time Shared OS, Multiprocessor Systems,
Distributed Systems, Real time systems. Mobile OS
(Android,iOS).System Calls- Concept and its types,, OS
72
 Components: – Process Management, Main Memory
Management, File Management, I/O System management,
Secondary storage management
UNIT-II Process Management (6 Hours)
Process Concept, Process states, Process control block, Process
Scheduling- Scheduling Queues, Schedulers, Context switch,
Inter-process communication (IPC): shared memory system &
message passing system.
Threads – Benefits, users and kernel threads, Multithreading
Models – Many to One, One to One, Many to Many.
Execute process commands- like ps, wait, sleep, exit, kill
UNIT-III CPU Scheduling and Algorithms (6 Hours)
Scheduling objectives, Scheduling Strategies: Pre-emptive, Non-
Pre-emptive Scheduling, Scheduling criteria, CPU and I/O burst
cycles, Uni-processor Scheduling: Types of scheduling:
Preemptive, Non preemptive, Scheduling algorithms: FCFS, SJF,
RR, Priority, Thread Scheduling, Real Time Scheduling,
Deadlock: Principles of deadlock, Deadlock Prevention,
Deadlock Avoidance, Deadlock Detection
UNIT-IV Memory Management (6 Hours)
Memory Management requirements, Memory partitioning: Fixed
and Variable Partitioning, Fragmentation
Memory Allocation: Allocation Strategies (First Fit, Best Fit, and
Worst Fit), , Swapping,
Paging and Segmentation: Page Replacement Policies (FIFO,
LRU, Optimal, Other Strategies)
Virtual Memory: Concepts, management of VM, , Thrashing.
UNIT-V File Management (6 Hours)

File : Concepts, Attributes, Operations, types and File System

Structure.
Access Methods : Sequential, Direct, Swapping
File Allocation Methods: Contiguous, Linked, Indexed.
Directory structure : Single level, two levels, tree-structured
directory
Mass Storage system : Overview of Mass Storage Structure, Disk
Structure, Disk Scheduling and Management, swap space
management
UNIT-VI Multi-Processor Based and Virtualization Concepts (6 Hours)

Virtual machines; supporting multiple operating systems

simultaneously on a single hardware platform; running one
73
 operating system on top of another. Reducing the software
engineering effort of developing operating systems for new
hardware architectures. True or pure virtualization.
Paravirtualization; optimizing performance of virtualization
system; hypervisor call interface.

Project Based Learning

1) Design pf First-fit, worst-fit and best-fit for given allocation memory

requirements
2) Simulation of the behavior of the multiprogramming operating system and use
CPU scheduler, and CPU Execution
3) Design the FCFS, SSTF, and SCAN disk-scheduling algorithms to simulate a
simple disk drive, which has a specified number of logical blocks numbered
from 0 onwards.
4) A Java simulator program to analyze the dependency of Page Faults on the
Page Frames for incoming page requests.
5) CPU Scheduling Algorithm to calculate Throughput, Utilization, Turn
Around time, Waiting Time. Gantt chart displayed for all n processes.
6) To simulate Round Robin algorithm

7) To implement FIFO page replacement policy.

8) To implement Optimal page replacement policy.

9) To implement LRU page replacement policy.

10) To implement Banking algorithm.

Textbooks:

1) Operating System Principles, Abraham Silberchatz, Peter B.Galvin,Greg

Gagne,8th Edition, Wiley Student Edition
2) Operating System-Internals and Design Principles, W.Stallings, 6th Edition,
Pearson.
3) Principles of Operating System,Naresh Chauhan,Oxford University Press

Reference Books:

1) Modern Operating System, Andrew s Tanenbaum, 3rd Edition, PHI

2) Operating System A concept-based Approach, 2nd Edition,

D.M.Dhamdhere, TMH.

74
3) Principle Of Operating Systems, B.LStuart, Cengage Learning, India Edition

Syllabus for Unit Tests:

Unit Test -1 Unit – I, Unit – II, Unit – III

Unit Test -2 Unit – IV, Unit –V, Unit - VI

75
 Data Structures
TEACHING SCHEME EXAMINATION SCHEME CREDIT SCHEME
Lecture: 3 Hours/Week End Semester Examination:60 Marks Theory 3
Practical: 2 Hours/Week Internal Assessment: 40 Marks Practical 1

Term Work 25 Marks

Practical: 25 Marks
Total 5 Hours/week Total 150 Marks Total 4

Course Objective:
The objective of the course is to familiarize students with various data structures and fundamentals
of algorithms.

Prerequisite:
Fundamental knowledge programming and problem-solving steps

Course Outcomes: On completion of the course, students will have the ability to:
1. Understand the fundamentals of data structure and algorithms
2. Execute linear sequential data structures
3. Implement linear linked organization data structures
4. Execute nonlinear data structure-trees
5. Implement nonlinear data structure-graph
6. Know hashing and file organization concepts

Unit I (6 Hours)
Introduction to Algorithm and Data Structures: Introduction to data structures, types of
data structure, abstract data types (ADT), introduction to algorithms, characteristics of
algorithms, algorithm design tools: pseudo code and flowchart, relationship among data,
data structure and algorithms, analysis of algorithms, asymptotic notation.

Unit II (6 Hours)
Sequential Organization Data Structures: Stacks: primitive operations, stack as an
ADT, realization of stacks using array, multi-stack, applications of stack, simulating
recursion using stack
Queue: primitive operations, queues as ADT, realization of queue using array, circular
queue, double ended queue, priority queue, applications of queue.

76
Unit III (6 Hours)
Linked Organization Data Structures: Introduction, sequential vs. linked
organizations, static vs. dynamic memory allocation, realization of linked lists, dynamic
memory management, linked list as ADT, types of linked list, polynomial manipulations,
linked stack, linked queue, generalized linked list, applications of link list.

Unit IV (6 Hours)
Non-Linear Data Structure-Tree: Tree terminology, types of trees, binary tree as an
ADT, realization of tree, tree traversals, binary search tree, operations on BST, threaded
binary tree, AVL tree,heap tree, applications of trees.

Unit V (6 Hours)
Non-Linear Data Structure-Graph: Graph terminologies, graph as an ADT, realization
of graphs using adjacency matrix and adjacency list, graph traversals: breadth first search
traversal, depth first search traversal, spanning tree, prim’s and kruskal’s algorithms,
topological sorting, applications of graph

Unit VI (6 Hours)
Hashing and File Organization:
Hashing: introduction, key terms, hash function, Collision Resolution strategies, hash
table overflow, skip list, comparison of hashing and skip lists.
File: concept of file, file organization, sequential file organization, direct access file
organization, indexed sequential file organization.

List of Internal Assignment will be framed by respective Course Coordinator.

Textbooks:
1. Y. Langsam, M. Augenstin, A. Tannenbaum, "Data Structures using C and C++", Prentice
Hall of India, , ISBN-81-203-1177-9.
2. E. Horowitz, S. Sahni, D. Mehta, "Fundamentals of Data Structures in C++", Galgotia Book
Source, New Delhi, ISBN 16782928
3. S. Lipschutz, “Data Structures”, McGraw Hill Pub.
4. Patil V., “Data Structures using C++”, Oxford university press, ISBN 0-19-806623-6
5. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford
Stein,“Introduction to Algorithms”

Reference Books
1. G. A.V, PAI , “Data Structures and Algorithms “, McGraw Hill, ISBN -13: 978-0-07-
066726-6
2. M. Welss, “Data Structures and Algorithm Analysis in C++", Pearson Education, ISBN-
81-7808-670-0

List of Laboratory Exercise

1. Write a program to implement functions (insert, delete, display) on stack, queue and
circular queue data structure.
2. Write a program to convert and solve expression from
77
 (a)Infix to Prefix
(b) Infix to Postfix
Evaluate Postfix expression
3. Write a program to implement Singly Linked List manipulation for storing student
information (PRN, Name, Marks).
a. Display data of top rank student.
How many students secure first class and above rank?
4. Write a program to implement Doubly Linked List manipulation for storing Employee
information (Name, Salary, Age).
a. Display data of employees having salary more than 50,000.
Display list of employees having age less than 30 and salary greater than 30,000.
5. Write a program to implement Binary Search Tree storing city names and Traversal in
BST (Inorder, Preorder, Postorder).
6. Write a program to implement Threaded Binary Tree and its Traversals.
7. Write a program to implement graph traversals: BFS and DFS.
8. Write a program to implement Prims and Krushkals algorithms MST.

Project Based Learning Assignments

Note:- *Students in a group of 3 to 4 shall complete any one project from the following list
1. Design and develop a project for Basic Search Engine
2. Design and develop a project for Sudoku game
3. Design and develop a project for flight route planner
4. Design and develop a project for Music Player
5. Create a mini project to construct game: Tic-Tac-Toe
6. Design and develop a project for Phone Directory using doubly link list
7. Create a mini project to construct game: Snakes and Ladder

Syllabus for Unit Tests:

Unit Test -1 Unit – I, Unit – II, Unit - III

Unit Test -2 Unit – IV, Unit – V, Unit - VI

78
 Information Technology Laboratory-III
TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME
Marks Credits
Tutorial 01 Hours/Week Term Work 25 Marks Tutorial 01
Practical: 02 Hours/Week Practical 25 Marks Practical 01
Total 03 Hours/Week Total 50 Marks Total 02
Course Objective:
1. Compute time and space complexity for a given program.
2. Demonstrate concepts OOPS using java.
3. Solve specified requirement.
4. Infer various approaches to decide the efficiency of the given approach.
5. Formulate a given problem by providing the proof of behaviour of the given model.
6. Design an application using a platform-independent approach.

Prerequisite:
Basic understanding of Object-Oriented Programming language and logic to solve.
given problem.
Course Outcomes: On completion of the course, students will have the ability to:
1. Design a solution to a given problem applying logic and features of the java language
2. Develop their logical skill through various assignments and practicals.
3. Divide complex problem into subpart and then handle every part to achieve the
Goal.
4. Model a solution to any real-world problem
5. Analyze the significance of platform independence.
6. Design application using object-oriented norms.
Unit I (6 Hours)
Introduction to Java: Java Fundamentals, Features of Java OOPs concepts Java
virtual machine Reflection byte codes Byte code interpretation Data types,
variable, arrays, expressions, operators, and control structures - if, switch, and
loops like for, do while, while. Introduction to Objects and classes.

Unit II (6 Hours)
Classes and objects: Java Classes, Abstract classes Static classes Inner classes
Packages, Wrapper classes. Interfaces, This, Super, Access control, Inheritance,
Encapsulation, Polymorphism, Data Binding, data abstraction.

Unit III (6 Hours)

String and Arrays: One dimensional Array, Multidimensional array, Array of an object,
Introduction to vector. String, StringBuilder, String Buffer, String methods,
manipulations.

79
Unit IV (6 Hours)
Exception Handling: Checked exceptions, unchecked exceptions, and Errors, try catch
block, throws, User-defined exception – Throw, Common exception classes.

Unit V (6 Hours)
Threading and multithreading: Lifecycle of Thread, Basic functions of thread,
multithreading, synchronization.

Unit VI (6 Hours)
Collections and Generics: Introduction to collection framework, List, Set, Maps, utility
class, Reflection API, Generics.

Textbooks
4. OCA Java SE 8 Programmer I Study Guide (Exam 1Z0-808) (Oracle Press) 3rd Edition. by
Edward Finegan, Robert Liguori.
5. OCA Java SE 8 Programmer, Exam Guide (Exams 1Z0-808) 1st Edition, Kathy Sierra, Bert
Bates.
6. Programmer's Guide to Java SE 8 Oracle Certified Associate (OCA), Khalid A. Mughal and
Rolf W Rasmussen.

Reference Books
3. Headfirst Java, 2nd Edition by Kathy Sierra, Bert Bates.
4. Java: The Complete Reference, Eleventh Edition 11th Edition, Herbert Schildt.
5. OCAJP Associate Java 8 Programmer Certification Fundamentals: 1Z0-808, Hanmant
Deshmukh.
List of Laboratory Exercises
1. Write a program to demonstrate the working of control structures in java.
2. Write a program for single inheritance and multilevel inheritance
3. Write a program to perform SUM of all values of integer array
4. Write a program to compare String in JAVA
5. Write a program to Split word into number of substring
6. Write a program to perform Runtime Polymorphism
7. Write a program to demonstrate Palindrome.
8. Write a program for Try Catch block in java
9. What is thread ? WAP for creating thread.
10. Write a program to perform Matrix Multiplication.
Note: * Students can use Leet Code website for assignments.

80
Project Based Learning - Provisional List of Projects
Note:- *Students in a group of 3 to 4 shall complete any one project from the following
list 1. Implement assignment and project submission system.
2. Implement a program to issue Leaving Certificate, Transcripts and Bonafede certificate to
student.
3. Implement a program to assign problem statement for practical examination in secured
environment.
4. Design a template for NBA report.
5. Design an application for Feedback Management System.

81
 Value Added Course -I: A) Internet Security
TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME
Theory: 02 Hrs/Week Internal Assessment 100 Theory 02
Marks
Total 02 Hrs/Week Total 100 Total 02
Marks
Course Objective:
1. Gain knowledge of the various aspects of network architecture and protocols, Network
performance.
2. Explore common vulnerabilities and threats in web applications.
3. Learn techniques to secure web applications and prevent attacks.
4. Gain practical experience through assignments, labs, and projects.
Prerequisite:
Basic networking, web development, cybersecurity awareness, OS basics, critical thinking
Course Outcomes: On completion of the course, students will have the ability to:
1. Analyse and evaluate the cyber security needs of an organization.
2. Describe system and Network vulnerability.
3. Evaluate network defence tools.
4. Understand the cyber laws.
5. Classify cyber forensics investigation and cyber security solutions for information
assurance.
6. Investigate a cybercrime, prepare report, and apply laws for the case.

Unit I: Introduction to CYBER SECURITY (6 Hours)

CYBER SECURITY- Introduction to Cyber Security, Implementing Hardware
Based Security, Software Based Firewalls, Security Standards, Assessing
Threat Levels, Forming an Incident Response Team, Reporting Cybercrime,
Operating System Attacks, Application Attacks, Future scope of cyber security.

Unit II : System and Network vulnerability (6 Hours)

Systems Vulnerability Scanning Overview of vulnerability scanning, Open Port
/ Service Identification, Banner / Version Check, Traffic Probe, Vulnerability
Probe, Vulnerability Examples.
Networks Vulnerability Scanning - Netcat, Socat, understanding Port and
Services tools - Datapipe, Fpipe, WinRelay, Network Reconnaissance – Nmap,
THC-Amap and System tools. Network Sniffers and Injection tools – Tcpdump
and Windump, Wireshark, Ettercap, Hping Kismet

Unit III: Introduction to Network Defence Tool (6 Hours)

82
Network Defence tools Firewalls and Packet Filters: Firewall Basics, Packet
Filter Vs Firewall, Packet Characteristic to Filter, Stateless Vs Stateful
Firewalls, Network Address Translation (NAT) and Port Forwarding, Snort:
Introduction Detection System

Unit IV: Introduction to Cyber Crime and law (6 Hours)

Introduction to Cyber Crime and law Cyber Crimes, Types of Cybercrime,
Hacking, Attack vectors, Cyberspace and Criminal Behavior, Clarification of
Terms, Traditional Problems Associated with Computer Crime, Introduction to
Incident Response, Digital Forensics, Realms of the Cyber world, Recognizing
and Defining Computer Crime, Contemporary Crimes, Contaminants and
Destruction of Data, Indian IT ACT 2000.

Unit V: CYBER FORENSICS INVESTIGATION (6 Hours)

CYBER FORENSICS INVESTIGATION- Introduction to Cyber Forensic
Investigation, Investigation Tools, eDiscovery, Digital Evidence Collection,
Evidence Preservation, E-Mail Investigation, E-Mail Tracking, IP Tracking, E-
Mail Recovery, Encryption and Decryption methods, Search and Seizure of
Computers, Recovering deleted evidence, Password Cracking

Unit VI: Introduction to Cyber Crime Investigation (6 Hours)

Introduction to Cyber Crime Investigation Keyloggers and Spyware, Virus and
Warms, Trojan and backdoors, Steganography, DOS and DDOS attack, SQL
injection, Buffer

Textbooks
1. CyBoK, The Cyber Security Book of Knowledge, Oct 2019.
2. Nina Godbole and Sunit Belpure, Cyber Security Understanding Cyber Crimes,
Computer Forensics and Legal Perspectives, Wiley
3. B. B. Gupta, D. P. Agrawal, Haoxiang Wang, Computer and Cyber Security:
Principles, Algorithm, Applications, and Perspectives, CRC Press, ISBN
9780815371335, 2018.
Reference Books
1. Cyber Security Understanding Cyber Crimes, Computer Forensics and Legal
Perspectives by Nina Godbole and Sunit Belpure, Publication Wiley.
2. Cyber Security and Cyber Laws Paperback – 2018 by Alfred Basta, Nadine Basta
, Mary Brown , Ravinder Kumar, publication Cengage.
3. Cyber SecurityEssentials, James Graham, Richard Howard and Ryan Otson,
CRC Press.
4. Introduction to Cyber Security , Chwan-Hwa(john) Wu,J.David Irwin.CRC
PressT&FGroup
83
List of Laboratory Exercises
1. Install Kali Linux. Examine the utilities and tools available in Kali Linux and find
out which toolis the best for finding cyber attack/vulnerability.
2. Evaluate network defense tools for following (i) IP spoofing (ii) DOS attack.
3. Explore the Nmap tool and list how it can be used for network defence.
4. Explore the NetCat tool. .
5. Use Wireshark tool and explore the packet format and content at each OSI layer.
6. Examine SQL injection attack.
7. Perform SQL injection with SQLMap on vulnerable website found using google
dorks.
8. Conducting packet analysis with tools like Wireshark.
9. Explore configuring intrusion detection and prevention systems.

List of Project Based Learning

1. Setting up web application firewalls.
2. Performing port scanning and vulnerability assessment (using tools like Nmap).
3. Configuring secure network protocols (e.g., SSH, HTTPS).
4. Implementing host-based intrusion detection systems (HIDS).
5. Setting up security information and event management (SIEM) systems.
6. Demonstrate perform cryptographic attacks (e.g., brute force, chosen plaintext).
7. Conducting wireless network penetration testing..
8. Performing social engineering exercises (e.g., phishing simulations, pretexting)..
9. Discussing the implications of cybersecurity on privacy and civil liberties.
10. Understanding cybersecurity laws and regulations (e.g., GDPR, HIPAA).

84
 VAC-I: B) Data Analysis Tools
TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME
Hours/Week Marks Credits
Theory 02 Internal Assessment 100 Theory 02
Total 100 Total 02
Course Objective: Learn new skills and discover the power of Microsoft products in data
analysis.
Prerequisite: None
Course Outcomes: On completion of the course, students will have the ability to:
1. Work with Excel basic and advanced formulas for data manipulation.
2. Perform data analysis using spreadsheets.
3. profile, clean, and load data into Power BI before you model your data.
4. Build out your semantic model to get the data insights.
5. Create an interactive report using common types of data visualization with Power
BI Desktop.
6. Discover the benefits of the Microsoft modern analytics technology suite of tools.

Unit I (8 Hours)
Introduction: About Excel & Microsoft, Columns & Rows, Functionality
Using Ranges, Using Formulas, Formula Functions, Advance Formulas.

Unit II (8 Hours)
Data Analysis with Excel: Spreadsheet Charts, What if analysis, Sorting,
Filter, Text to Column, Data Validation, PivotTables.

Unit III (8 Hours)

Basics of Data analysis with PowerBI: Get data with Power BI Desktop,
Clean, transform, and load data in Power BI, retrieve data from a variety of data
sources, including Microsoft Excel, relational databases, and NoSQL data
stores.
Unit IV (8 Hours)
Model data with Power BI: Design a semantic model in Power BI, Write DAX
formulas for Power BI Desktop models.

Unit V (8 Hours)
Build Power BI visuals and reports: Design effective reports in Power BI,
Create dashboards in Power BI

Unit VI (8 Hours)

85
Perform analytics in Power BI: Use visuals in Power BI, Introduction to
modern analytics using Excel and Power BI, Transition from Excel to Power BI

Textbooks
1. Data Analysis with Microsoft Excel by K. Berk , Partrick Carey
2. Data Analysis and Business Modelling Using Microsoft Excel by Manohar,
Hansa Lysander, Print Book ISBN : 9788120352889
3. Microsoft Power BI Quick Start Guide by Devin Knight, Packt Publishing,
ISBN: 9781789138221.
4. Beginning Microsoft Power BI: A Practical Guide to Self-Service Data
Analytics by Dan Clark, Publisher: Apress, ISBN-13: 978-1484256190

Reference Books
1. Business Statistics Using Excel: A Complete Course in Data Analytics,
December 2023 by R. Panneerselvam
2. Data Analysis with Microsoft Power BI: A Kagen the Damned Novel, 28 January
2020 by Brian Larson.

List of Laboratory Exercises

1. Import the legacy data from different sources such as (Excel, Sq lServer, Oracle
etc.) and load in the target system.
2. Perform the Extraction Transformation and Loading (ETL) process to construct
the database in the Sql server / Power BI.
3. ETL Process in Power BI
4. Data Visualization from ETL Process
5. Apply the what – if Analysis for data visualization. Design and generate
necessary reports based on the data warehouse data.
6. Data Modelling and Analytics with Pivot Table in Excel
7. Data Analysis and Visualization using Advanced Excel
8. Using DAX in Power BI Desktop

86
 Minor Course-I: Distributed Computing

TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME

Hours/Week Marks Credits
Lecture: 3 University Examination 60 Lecture 3
Practical: 2 Internal Assessment 40 Pract/Oral 1
Oral 25
Termwork 25
Total 150 Total 4
Course Objective: To provide an understanding of key concepts underlying the function of
distributed computing systems
Prerequisite: Students should have knowledge of Fundamentals of Data Structures, Operating
Systems, Networking concepts

Course Outcomes: On completion of the course, students will have the ability to:
1. Discover the fundamentals of distributed computing environment
2. Observe the inter process communication
3. Infer the concepts of process and threads
4. Interpret the concepts of clock synchronization
5. Infer the concepts of Distributed file system
6. Interpret the concepts distributed shared memory

Unit I Fundamentals: (6 Hours)

Definition and evolution of Distributed Computing System, Models and Types of
Distributed Computing Systems, Issues and Goals in designing Distributed System,
Distributed Computing Environment, Peer to peer systems and its middleware, Routing
overlays, Mobile and Ubiquitous computing, Data Center architecture and management

Unit II Communication: (6 Hours)

Interprocess communication (IPC): Introduction and need Message Passing system:
Desirable features of good message passing system, Issues in IPC, Group and multicast
communication, Remote Procedure Calls (RPC): The RPC Model, Implementation of
RPC mechanisms (Stubs and marshalling) Java RMI: Architecture, Implementation
(Stubs and Skeletons)
Introduction of Web services and SOAP.

Unit III Processes and Threads: (6 Hours)

87
Process Migration: Introduction, Features, Mechanisms, Advantages, use in
heterogeneous systems.
Threads: Concept, Motivation, Models, Issues, Synchronization, Scheduling,
Implementing.

Unit IV Synchronization and Distributed Transactions: (6 Hours)

Clock synchronization: Drifting, Issues, Algorithms, Event Ordering Deadlock:
Conditions, Modeling, Handling, Avoidance, Prevention, Detection, Election
Algorithms

Distributed Transaction: Introduction, Locks, Optimistic Concurrency Control,

Timestamp Ordering

Unit V Distributed File system (6 Hours)

Distributed Files Systems: Advantages, Features, Models, Caching, Replication, Fault
Tolerance

Unit VI Distributed Shared memory (6 Hours)

Distributed Shared Memory: Architecture, Design and Implementation Issues,
Advantages, Granularity, Structure of Shared Space, Consistency Models, Replacement
Strategy, Thrashing
Textbooks
1. Pradeep K. Sinha, “Distributed Operating Systems: Concepts and Design”, Wiley-IEEE
Press.
2. Andrew S. Tanenbaum, Maarten van Steen, “Distributed Systems: Principles and
Paradigms”, Prentice Hall India Learning Private Limited,
3. George Coulouris, Jean Dollimore, Tim Kindberg, Gordon Blair, “Distributed Systems:
Concepts and Design”, Pearson Education India;

Reference Books
1. Ajay D. Kshemkalyani, Mukesh Singhal, “Distributed Computing: Principles, Algorithms,
and Systems”, Cambridge University Press- South Asian edition
2. Abraham Silberschatz, Peter B. Galvin, Greg Gagne , “Operating System Concepts”, Wiley,
8th Edition

List of Assignments
The course coordinator shall design suitable assignments involving case studies of Opensource
distributed systems, Disctributed Computing models, Distributed security systems etc.

88
List of Laboratory Exercises
The course coordinator shall design suitable laboratory exercises on Opensource distributed systems,
interprocess communications, threads, election algorithms etc.
Project Based Learning –
The course coordinator shall design suitable projects to students in groups of four

Syllabus for Unit Tests:

Unit Test -1 Unit – I, Unit – II, Unit - III
Unit Test -2 Unit – IV, Unit – V, Unit - VI

89
 B. Tech
Information Technology
Semester IV

90
 Formal Languages and Computation Theory
TEACHING SCHEME EXAMINATION SCHEME CREDIT SCHEME

Lecture: 3 Hours/Week End Semester Examination: 60 Marks Theory 3

Internal Assessment: 40 Marks
Total 3 Hours/Week Total 100 Marks 3

Course Objective:
Students will learn about a variety of issues in the mathematical development of computer.
science theory, particularly finite representations for languages and machines. Students will gain
more formal understanding of algorithms and procedures.

Prerequisite:
Students should have knowledge of set theory and state transition diagrams.

Course Outcomes: On completion of the course, students will have the ability to
1.Design automata machines for strings given.
2.Write a regular expression for the given string and find set of strings if regular expression is
given.
3.Write grammar rules for the strings given.
4.Design push down automata for the string and grammar.
5.Design Turing machine and apply the same to solve algorithmic problems.
6.Apply knowledge computation in complexity theory.

Unit I : (6 Hours)
Finite Automata: Introduction to Finite Automata, Structural Representations,
Deterministic finite Automata (DFA)-Formal Definition, Simplified notation:
State transition graph, Transition table, Language of DFA, Nondeterministic finite
Automata (NFA), NFA with epsilon transition, Language of NFA, Equivalence
and Minimization of Automata, Conversion of NFA with epsilon to DFA
Equivalence of Moore and Mealy Machine. Applications and Limitation of FA.

Unit II (6 Hours)
Regular expressions: Regular expression (RE), Definition, Operators of regular
expression and their precedence, Algebraic laws for Regular expressions, Kleen’s
Theorem, Regular expression to DFA, DFA to Regular expression, Non-Regular
Languages, Pumping Lemma for regular Languages, Closure properties of Regular
Languages, Applications of regular expressions.

Unit III (6 Hours)

Grammar: Definition, Production rules, Derivation trees, Ambiguous Grammar,
Removal of ambiguity, Regular Grammar, Inter-conversion between RE and
Grammar, Reduced form of grammar. Linear grammar: left & right linear
grammar, Inter- conversion. Chomsky hierarchy of languages, Context Free
91
Grammar- Definition, Context free language (CFL. Normal Forms- Chomsky
Normal Form (CNF), Griebach Normal Form (GNF).

Unit IV (6 Hours)
Push Down Automata (PDA): Limitations of FA, PDA: Definition, Uses,
Equivalence between FA and PDA, Designing of PDA, Deterministic Push Down
Automata and Non-Deterministic Push Down Automata- Definition, Language
accepted by PDA, Designing a PDA for CFG, Properties of CFL, Pumping Lemma
for CFL. Limitations of PDA, Applications of PDA.

Unit V (6 Hours)
Turing Machine (TM): Definition, Model, Comparison of TM, FSM, PDA,
Design of TM, Examples of TM- Combinational TM, Iterative TM, Recursive TM,
Universal TM, TM as a language acceptor, Some Problems that cannot be solved
by Turning Machines, Language accepted by TM, Church's Turing hypothesis,
Multitask TM, TM limitations.

Unit VI (6 Hours)
Applications: Applications of Turing machine, Compiler phases, editors and its
relevance to TM. Case studies.

List of Internal Assignment will be framed by respective Course Coordinator.

Textbooks
1. “Introduction to Automata Theory, Languages and Computation”, Hopcroft J,
Motwani R, Ullman ,Addison-Wesley, ISBN 81-7808-347-7, Third Edition .
2. “Introduction to Theory of Computation”, Michael Sipser, Course Technology, ISBN-
10: 053494728X, Forth Edition. ISE.

Reference Books

1. “Introduction to Languages and Theory of Computation”, John Martin. Fifth Edition,

McGrawHill.
2. “Computational Complexity”, Christos H. Papadimitriou, Pearson Education.

List of Assignments:
1. Solve problems on designing finite automata.
2. Design and inter-convert Moore and Mealy Machine for same problems.
3. Form grammar rules for language of set of regular expression or strings given.
4. Design Push Down Automata for grammar or given string.
5. Construct Turing Machine to solve given problem.
6. Study Assignment on Complexity Theory.

92
 Project Based Learning Assignments
Note:- *Students in a group of 3 to 4 shall complete any one project from the following list

1. Describe the process of designing the computer. How is it related with the simple
automata?
2. Write project based on famous computer scientist Alan Turing. Select suitable material
for reference and summarize.
3. Describe the set of problems which can be represented using machines. What are the
criteria we can enlist for such representations?
4. Relate computational theory to World War II. What is the role of cryptography in World
War II?
5. Invention of computer as a machine is related to formal automata. How today’s complex
and high-end computer systems can be mapped to these simple automata. Describe in
detail.
6. Select a real-world problem and represent it mathematically. Design an automaton to
solve this problem. Write detailed explanation of the entire process.
7. Study any text editor. Enlist its features. Map these features with the concepts you learned
in the subject.
8. Enlist set of problems which can be solved, and which cannot be solved by memoryless
automata. How does memory affects the power of automata? Explain in detail and justify
your answer with example.
9. Why Ethereum blockchain must be deterministic? Study and explain application of
computation theory to blockchain technology.
10. Can human brain be simulated by Tring machine? Write detailed essay and justify your
conclusions with theorem you learned.
11. Study research paper published by Alan Turing and write a summary in your words.
12. What are the similarities and differences between human brain and machine? Support
your answers with suitable mathematical model.
13. Study any chess game software. Write the process of developing such software. Describe
how this is related to Turing machine.

Syllabus for Unit Tests:

Unit Test -1 Unit – I, Unit – II, Unit - III
Unit Test -2 Unit – IV, Unit – V, Unit – VI

93
 ADVANCED DATABASE SYSTEMS
TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME
Hours/Week Marks Credits
Lecture 03 University Examination 60 Lecture 03
Internal Assessment 40 Practical 01
Practical 02 Term Work 25
Practical 25
Total 05 Total 150 Total 04

Course Objective:
1. Exploring the working of large scale and emerging database management systems
2. Study and analysis of query processing and query optimization in distributed and
parallel databases
Prerequisite:
Student should be well aware of database management systems, analysis of data structure
and algorithms with sufficient programming experience

Course Outcomes: On completion of the course, students will have the ability to:
1. Interpret the working of distributed database management system
2. Infer the processing and optimization of distributed queries
3. Recognise the architecture and query processing in parallel database management
system
4. Analyse the concepts of advanced transaction management
5. Identify the concepts of different information retrieval systems
6. Discover the structure and significance of Big Data and NoSQL Databases

Unit I - Distributed databases: Architecture and Design (6 Hours)

Distributed data processing, What is a DDBS?; Advantages and disadvantages
of DDBS, Problem areas
Distributed DBMS Architecture: Transparencies in a distributed DBMS,
Distributed DBMS architecture, Global directory issues,
Distributed Database Design: Alternative design methodologies and strategies,
Distributed design issues, Types and role of Fragmentation, Types and role of
replication, Data allocation

Unit II - Distributed query processing and optimization (6 Hours)

Distributed Query processing: Problem of query processing, Distributed query,
Query decomposition, Distributed Query Processing Methodology, translation
global queries to fragment queries

94
Distributed Optimization: Objectives of query optimization, Factors governing
query optimization, Ordering of fragment queries, optimization of join
operation, Load balancing, Distributed query optimization algorithms

Unit III - Parallel Database Management System (6 Hours)

Introduction: Types of parallelism in database systems, Parallel Query
Processing, multiprocessor architectures, parallel relational operators,
parallelism in main-memory DBMS, parallel handling of integrity constraints,
Integrated I/O parallelism
Parallel Query Processing and Optimization: Inter-query parallelism, intra-
query parallelism, intra-operation parallelism, inter-operation parallelism,
objectives of parallel query optimization, parallel query optimization, load
balancing, parallelism in join queries, testing the quality of query optimization

Unit IV – Advanced concepts in Transaction Management (6 Hours)

Transaction Management: ACID properties, pessimistic locking, optimistic
locking, flat transactions, nested transactions, deadlock detection and
management and their algorithms, Recovery Methods
Concurrency control and Reliability in Distributed Dtabases: Concurrency
control in centralized database systems vs Concurrency control in DDBSs,
Distributed concurrency control algorithms, Deadlock management, Reliability
issues in DDBSs; Types of failures, Reliability techniques, Commit protocols,
Recovery protocol.

Unit V –Advanced Querying and Information Retrieval (6 Hours)

Decision Support Systems, Data Analysis and OLAP, Data Mining, Data
Warehousing, Information Retrieval Systems, Semantic Search
Database Tuning and Performance: Benchmarking, TPC benchmarks, object
oriented benchmarks, TP Monitors, TPC and Wisconsin benchmarks,
performance measurement, and performance tuning

Unit VI - Big Data, NoSQL and Vector Databases (6 Hours)

What is NoSQL? Why NoSQL? History of NoSQL Databases, Features of
NoSQL, Types of NoSQL Databases, Query Mechanism tools for NoSQL, CAP
Theorem
Big Data - Introduction, Types, Characteristics, Testing, Examples,
Introduction to Hadoop, MongoDB- Introduction, Architecture, Features, Data
Modelling in MongoDB
Vector Databases: Structure, Characteristics, Role, Challenges

95
Textbooks
1. Database System Concepts, Seventh Edition, AviSilberschatz, Henry F. Korth, S.
Sudarshan, McGraw-Hill
2. Data Warehousing: Concepts, Techniques, Products and Applications, 3rd Edition,
C.S.R. Prabhu, PHI Learning Pvt. Ltd.
3. Stefano Ceri and Giuseppe Pelagatti, “Distributed databases principles and
systems”, Tata McGraw Hill

Reference Books
1. NoSQL Distilled: A Brief Guide to the Emerging World of Polyglot Persistence,
Sadalage, P. & Fowler, Wiley Publications
2. M. Tamer Özsu and Patrick Valduriez, “Principles of Distributed Database
Systems”, Springer Science & Business Media, 3rd edition
List of Assignments
1. Compare query processing in RDBMS with DDBMS
2. Analysis of parallel sort and parallel join operations
3. Analysis of Lucene web search engine
4. Comparison of different NoSQL databases types
5. Analyse comprehensive aspects of factors that drive the MongoDB vs SQL decision
6. Study of Hadoop as a big data tool
7. Study of any one Vector Database

List of Laboratory Exercises

The course instructor shall frame appropriate assignment on any NoSQL/ Vector Database
tools with all phases from installation, Design, Modelling and CRUD functionalities
Project Based Learning
Implementation of Database in NoSQL/ Vector Database with monitoring, backup, security,
report generation features.

Syllabus for Unit Tests:

Unit Test -1 Unit – I, Unit – II, Unit – III
Unit Test -2 Unit – IV, Unit – V, Unit – VI

96
 Software Engineering
TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME
Hours/Week Marks Credits
Lecture: 03 University Examination 60 Lecture 03
Practical 02 Internal Assessment 40
Term Work 25 Practical 01
Oral 25
Total 05 Total 150 Total 04
Course Objective:
1) Understand software development life cycle model
2) Understand change management, process and product metrics
Prerequisite:
Students should have knowledge of
Developing well-structured, modular programs
Course Outcomes: On completion of the course, students will have the ability to:
1. Use all the phases of the Software Development Life Cycle to develop software
systems
2. Identify the requirements and implement appropriate software solutions for the real-
world need
3. Apply systematic procedure for software design and deployment
4. Identify items of Software change management system
5. Compare and contrast the various testing and maintenance techniques
6. Understand software product and process quality standards.
7. Work efficiently in teams with effective communication and follow ethical
principles.

Unit I (6 Hours)
Introduction: What is software? Types of software, Characteristics of
Software, Attributes of good software, what is software engineering? key
challenges of software engineering? Systems engineering & software
Engineering.
Software Development Process Models: Traditional Life Cycle Models:
Waterfall, V-model, Evolutionary, Spiral, CBSE, Unified Process, Rapid
Application Development, Prototyping, Agile Software Engineering Process
Models: Extreme Programming, Agile Software Development, Scrum.

Unit II (6 Hours)
Software Requirements Engineering and Analysis: Types of software
requirements: Functional and non-functional requirements, Domain
requirements, User requirements.

97
Analysis of requirements: Viewpoints, Interviewing, Scenarios, Use-cases,
Process modelling with physical and logical DFDs, Entity Relationship
Diagram, Data Dictionary.
Requirement validation, Requirement specification, Software requirement
Specification (SRS) Structure, SRS format, Feasibility.

Unit III (6 Hours)

Software Design: Design concepts: Abstraction, Modularity, Information
hiding, Functional Independence, Refinement, Refactoring, Data Design,
Architectural Styles and Patterns, Architectural design & design process,
Effective modular design, cohesion, coupling, Mapping Data flow into a
Software Architecture.
Agile design practices: Role of design Principles including Single
Responsibility Principle, Open Closed Principle, Liskov Substitution Principle,
Interface Segregation Principles, Dependency Inversion Principle in Agile
Design, Need and significance of Refactoring

Unit IV (6 Hours)
Change Management
Software configuration management (SCM), Elements of SCM Base lines,
Software configuration items, SCM Repository, Scan process, Version Control,
Change Control, Configuration Audit, Status Reporting, GitHub – Introduction,
Continuous Integration, Benefits of Continuous Integration, Git Feature Branch
Workflow: Working in Branches, Making pull request, Continuous Delivery
Key Principles and practices

Unit V (6 Hours)
Software Implementation Techniques: Coding Practices, Refactoring,
Maintenance and Reengineering-BPR model-Reengineering process model,
Reverse and Forward Engineering
Software testing fundamentals: Software Testing Life Cycle, Internal and
external views of Testing-white box test, basis path testing-control structure
testing-black box testing- Regression Testing, Unit Testing, Integration Testing,
Validation Testing, System Testing and Debugging, Defect: Defect Life Cycle

98
Unit VI (6 Hours)
Product metrics: Software quality, metrics for analysis model, metrics for
design model, metrics for source code, metrics for testing, metrics for
maintenance
Process Metrics: process framework, the capability maturity model integration
(CMMI), process patterns, process assessment.
Quality Management: Quality concepts, software quality assurance, software
reviews, formal technical reviews, statistical software quality assurance,
software reliability, the ISO 9000 quality standards.

Textbooks
1. Rajib Mall, Fundamentals of Software Engineering, Prentice Hall India.
2. Pankaj Jalote, An integrated approach to Software Engineering, Springer/Narosa.
3. Roger S. Pressman, Software Engineering: A practitioner's approach, McGraw Hill.
4. Ian Sommerville, Software Engineering, Addison-Wesley

Reference Books
1. Kelkar S.A., ―Software Engineering, Prentice Hall of India Pvt Ltd, 2007.
2. Stephen R.Schach, Software Engineering, Tata McGraw-Hill Publishing Company
Limited,2007

List of Laboratory Exercises

1. Preparing Software Requirements Specifications
2. E-R Modeling
3. Modeling Data Flow Diagrams
4. State chart and Activity Modeling
5. Estimation of Test Coverage Metrics and Structural Complexity
6. Designing Test Suites
7. Study design of Biometric Authentication software
8. Selemium Testing with any online application

Project Based Learning - Provisional List of Projects

1. Development of requirements specification.
2. Function oriented design
3. Demonstrate use of appropriate CASE tools and other tools such as configuration
management tools
4. Demonstrate program analysis tools in the software life cycle.

Syllabus for Unit Tests:

Unit Test -1 Unit – I, Unit – II, Unit - III
Unit Test -2 Unit – IV, Unit – V, Unit - VI

99
 COMPUTER ORGANIZATION AND ARCHITECTURE
TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME
Hours/Week Marks Credits
Lecture: 03 University Examination 60 Lecture 03
Internal Assessment 40
Term Work -- Pract --
/Oral
Practical/Oral --
Total 03 Total 100 Total 03

Course Objective:
1. To learn the low-level design and working of computer/processor
2. To learn parallel computing architectures and platforms
Prerequisite:
Digital Electronics, Microprocessor Architecture, Structured Programming

Course Outcomes: On completion of the course, students will have the ability to:
1. Understand the recent trends in Computer Architecture
2. Apply various design methodologies for the digital design of devices using VHDL.
3. Analyze, understand and apply the various design techniques of control unit of a processor
4. Understand the basic design of a processor and memory technologies
5. Analyze and understand different multiprocessor architectures
6. Analyze and understand different parallel processing architectures

Unit I – Recent Advances (4 Hours)

Technology trends in Computer Architecture, Performance Metrics, Improving
performance, Moore’s law, Cluster Computing, Cloud Computing,Quantum
Computers, Hardware support for Operating Systems, Computer architecture for
AI/ML : GPU,TPU. Multicore architecture

Unit II – Digital Logic Design, Simulation and Debugging with HDLs (8 Hours)
Introduction to hardware description languages. Study of any of the following
HDLs : A) VHDL B) Verilog
Logic Gate and Logic circuit design using above HDLs. Introduction to HDL
simulation and debugging. Introduction to FPGA.

Unit III – Control Unit Design (6 Hours)

Hardwired Control Unit, Micro-programmed Control Unit design, RecentTrends

100
 Unit IV – Processor and Memory Design (6 Hours)
Basic design of a Processor, Control path, Data path

Cache memory: Working principle, Mapping functions, Replacement algorithms,

Cache coherence, Examples, Atomic Memory, UFFO storage,UltraRAM, 3D
NAND, Intel Optane memory, Recent Trends

Unit V – Multiprocessor Architectures (4 Hours)

Shared memory – Distributed Memory multiprocessor architectures, Message-
Passing Multiprocessors, Dataflow machine architecture Supercomputer
architecture, Recent Trends

Unit VI – Parallel Computing and Programming (8 Hours)

Pipelining, Data and Control Hazards, Stalls, RISC/Pentium-4 Pipeline, Complex
Pipelines, Out-of-order Execution, Dynamic Scheduling, Tomasulo Algorithm,
Register renaming, Register Scoreboarding, Basic compiler techniques for
exposing instruction-level parallelism, Vector processors, Array processors, VLIW
architecture, Multithreaded architecture, GPU Computing architecture, Nvidia
Maxwell, CUDA, Writing a simple parallel algorithm, Parallel Programming
languages, OpenMP, MPI, Pthreads, Amdahl’s Law, Gustafson-Barsis’s Law,
Karp-Flatt Metric, isoefficiency, Recent Trends
Textbooks
1. Computer Organization and Architecture, William Stallings, Prentice Hall
2. Computer Organization and Embedded Systems, Hamacher&Zaky, McGraw Hill
3. Advanced Computer Architecture, Kai Hwang, Tata McGraw Hill
4. Fundamentals of Logic Design, Charles Roth & Larry Kinney, Cengage Learning
5. The Verilog: Hardware Description Language, Thomas &Moorby, Extra Materials
6. Advanced Computer Architecture and Parallel Processing, Rewini& Barr, Wiley
Publications
Reference Books
3. Computer Organization and Design: The Software/Hardware Interface, David
Patterson, Elsevier
4. Fundamentals and Standards in Hardware Description Languages, Jean Mermet,
Springer Science
5. Parallel Computers: Architecture and Programming, V.Rajaraman&C.Murthy,
Prentice Hall India
6. Introduction to Parallel Computing: From Algorithms to Programming, Roman
Trobec, Springer
Project Based Learning
1. Case studies in recent trends in Computer Architecture
2. Case studies in Hardware Description Languages and Simulators
3. Recent Trends in Control Unit Design
4. Case studies in recent Memory Technologies

101
 5. Case studies in recent trends in Multiprocessor Architectures
6. Case studies in recent trends in Parallel Computing

Syllabus for Unit Tests:

Unit Test -1 Unit – I, Unit – II, Unit – III
Unit Test -2 Unit – IV, Unit – V, Unit – VI

102
 Applied Algorithms
TEACHING SCHEME EXAMINATION SCHEME CREDIT SCHEME
Lecture: 3 Hours/Week End Semester Examination: 60 Marks Theory 3
Practical: 2 Hours/Week Internal Assessment: 40 Marks
Term Work: 25 Marks Practical 1
Practical: 25 Marks
Total 5 Hours/Week Total 150 Marks 4

Course Objective:
Understand and compare important algorithmic design paradigms and analysis of algorithms. To
choose and extend efficient algorithms required for designs.

Prerequisite:
Students should be well versed with algorithms and operations on basic data structures stacks,
queues, linked lists, trees, graphs. Students should have knowledge of searching sorting algorithms.

Course Outcomes: On completion of the course, students will have the ability to:
1. Interpret the performance of algorithms using analysis techniques.
2. Examine the fundamental algorithmic strategies.
3. Compare the fundamental algorithmic strategies.
4. Implement graphs and trees algorithms.
5. Interpret the tractable or intractable problem.
6. Summarize the advance types of algorithms.

Unit I (6 Hours)
Introduction to Algorithm analysis: Characteristics of Algorithm. Analysis of
Algorithm: Asymptotic analysis of Complexity Bounds – Best, Average and Worst-
Case behavior, Performance Measurements of Algorithm, Time and Space Trade-Offs.
Analysis of Recursive Algorithms through Recurrence Relations: Substitution Method,
Recursion Tree Method and Masters’ Theorem.

Unit II (6 Hours)
Algorithmic Strategies 1: Brute-Force technique, Heuristics, Greedy algorithms,
Divide and Conquer, Illustrations of these techniques for Problem-Solving.

Unit III (6 Hours)

Algorithmic Strategies 2: Dynamic Programming, Branch and Bound algorithms,
Backtracking, methodologies; Illustrations of these techniques for Problem-Solving.

Unit IV (6 Hours)
Graph and Tree Algorithms: Self-Balancing tress, B Trees, B+ Trees, Single source
shortest path algorithms, all pair shortest path algorithms, Network Flow Algorithm

103
Unit V (6 Hours)
Tractable and Intractable Problems: Computability of Algorithms, Computability
classes – P, NP, NP-complete and NP-hard. Cook’s theorem, Standard NP-complete
problems and Reduction techniques.

Unit VI (6 Hours)
Advanced Topics: Approximation algorithms, Randomized algorithms, Class of
problems beyond NP – P SPACE, Introduction to Quantum Algorithms and parallel
algorithms.
List of Internal Assignment will be framed by respective Course Coordinator.

Textbooks
1. “Fundamental of Computer Algorithms”, E. Horowitz and S. Sahni, Orient Black.
2. “Introduction to Algorithms”, T. H. Cormen, C. E. Leiserson and R. L. Rivest,PHI
Learning Pvt. Ltd. (Originally MIT Press).
3. “The Design and Analysis of Computer Algorithms”, A. Aho, J. Hopcroft and J.
Ullman, Pearson Education India.
4. Computer Algorithms: Introduction to Design and Analysis, S. Baase, Pearson
Education India.
5. “The Art of Computer Programming”, D. E. Knuth, Addison Wesley.

Reference Books
1. M. Welss, “Data Structures and Algorithm Analysis in C++", Pearson Education,
ISBN- 81-7808-670-0.
2. G. A.V, PAI , “Data Structures and Algorithms “, McGraw Hill, ISBN -13: 978-0-07-
066726-6.

List of Laboratory Exercise

1. From a given vertex in a weighted connected graph, find shortest paths to other
vertices using Dijkstra's algorithm.
2. Write a Code to find the shortest path using Bellman-Ford algorithm.
3. Write and analyze code to sort an array of integers using merge sort.
4. Write and analyze to sort an array of integers using divide and conquer quick sort
Method.
5. Write a program to implement Longest Common Subsequence problem using
Dynamic Programming.
6. Write a program to Implement 0/1 Knapsack problem using Dynamic Programming.
7. Write a program to Implement N Queen's problem using Back Tracking.
8. Write a program to implement quick sort using randomize algorithm.
9. Write a program to implement network flow algorithm.

Project Based Learning Assignments

Note:- *Students in a group of 3 to 4 shall complete any one project from the following list

1. Design and develop a project for shortest path calculation for travelling salesman problem
2. Design and develop a project for finding keywords from the paragraph

104
 3. Design and develop a project for Customer Billing system
4. Design and develop a project for word dictionary using search tree concept
5. Design and develop a project for salary calculation of employees based on performance
6. Design and develop a project for password recovery system

Syllabus for Unit Tests:

Unit Test -1 Unit – I, Unit – II, Unit - III

Unit Test -2 Unit – IV, Unit – V, Unit – VI

105
 Information Technology Laboratory-IV
TEACHING SCHEME EXAMINATION SCHEME CREDIT CHEME
Hours/Week Marks Credits
Tutorial 01 Hours/Week Term Work 25 Marks Tutorial 01
Practical: 02 Hours/Week Practical 25 Marks Practical 01

Total 03 Hours/Week Total 50 Marks Total 02

Course Objective:
1. Understand web environment for building the application.
2. Implement web application.
3. Implement Servlet.
4. Implement Java Messaging Services.
5. Implement Java Mail API.

Prerequisite:
1) Core Java 2) Scripting languages.

Course Outcomes: On completion of the course, students will have the ability to:
1. Understand the lifecycle of web application.
2. Implement session management using servlet.
3. Apply standard and custom tags of JSP.
4. Design competitive web application which will work real web environment.
5. 5mplement Java Messaging Services.
6. Apply Java Mail API.

Unit I (6 Hours)
Introduction to Servlet: Web Application Basics, Architecture and challenges
of Web, application. Introduction to servlet, Servlet life cycle, Developing and
Deploying Servlets, Exploring Deployment Descriptor (web.xml), Session
Management and Servlet Chaining: Handling Request and Response, Initializing a
Servlet, Accessing Database.
Unit II (6 Hours)
JDBC: Design of JDBC, JDBC configuration, Executing, SQL statement, Query
Execution, Scrollable and updatable, result sets, row sets, metadata, Transaction

Unit III (6 Hours)

Java Server Pages: Standard Tags: Basic JSP Architecture, Life Cycle of JSP
(Translation, compilation), JSP Tags and Expressions, Role of JSP in MVC-2,
JSP with Database, JSP Implicit Objects.

106
Unit IV (6 Hours)
Java Server Pages: Custom Tags: Tag Libraries, JSP Expression Language
(EL), Using Custom Tag, JSP Capabilities Exception Handling Session
Management Directives JSP with Java. Introduction to struts.

Unit V (6 Hours)
Java Messaging Services: JMS Architecture, Point-to-Point Messaging, Domain,
Publisher/Subscriber, Messaging Domain, JMS API, JMS Queue.

Unit VI (6 Hours)
Overview of Hibernate, Hibernate Architecture, Hibernate Mapping Types, Hibernate
O/R Mapping, Hibernate Annotation, Java Mail API: SMTP, POP, IMAP, MIME,
NNTP, sending operations,

Textbooks
1. Web Technologies: HTML, JAVASCRIPT, PHP, JAVA, JSP, ASP.NET, XML and Ajax,
Black Book: HTML, JavaScript, PHP, Java, Jsp, XML and Ajax, Black Book Paperback – 1
January 2009, Kogent Learning Solutions Inc.
2. Java EE 8 Cookbook: Build reliable applications with the most robust and mature technology
for enterprise development, Packt Publication, Elder Moraes.
3. Headfirst Servlets and JSP: Passing the Sun Certified Web Component Developer Exam 2nd
Edition, Bryan Basham, Kathy Sierra, Bert Bates.
4. Java Persistence with Hibernate by Christian Bauer, Gavin King

Reference Books
1. Beginning Java EE 7, Appress Publication, Antonio Goncalves.
2. Java EE 7 Essentials: Enterprise Developer Handbook 1st Edition, Headfirst Publication, Arun
Gupta.
3. J2EE: The complete Reference Paperback, Jim Keogh.

List of Laboratory Exercises

1. Maintain record of students and perform CRUD functionality.
2. Write a program to redirect a request using a dynamic approach.
3. Write a program to pass the data using session.
4. Write a servlet to remove spam.
5. Maintain the record of faculty member using jsp action tags and directives.
6. Design a tag to perform the necessary editing in a given report.
7. Design reusable components of the form using taglib.
8. Implement sending and receiving mail utility using Java Mail API.
9. Implement Java Message Service queue.
10. Understand working of framework – struts- case study.

107
Project Based Learning - Provisional List of Projects
Note:- *Students in a group of 3 to 4 shall complete any one project from the following
list
1. Design application to maintain track of research paper with indexing per year.
2. Create message and mail communication of given message.
3. Design a post customized as per social media platform.
4. Design an interface to collect job opportunities and disseminate to eligible student
5. Design a project to track details of Industrial Training.

108
 Minor Course-2: Cloud Systems and Infrastructure

TEACHING SCHEME EXAMINATION SCHEME CREDIT SCHEME

Theory 3 Hours/Week End Semester 60 Marks Theory 3

Examination
Practical 2 Hours/Week Internal 40 Marks Practical 1
Assessment
Termwork 25 Marks
Oral 25 Marks
Total 5 Hours/Week Total 150 Marks Total 4
Credits

Course Objectives:
1.To provide with the students the essentials and fundamentals of cloud computing.
2.To learn the basics of virtualization and its importance.

Course Prerequisites:
Students should have knowledge of
• Operating System
• Computer Networks

Course Outcome:
Students will be able to:
1) Understand the main concepts, key technologies and fundamentals of cloud computing..
2) Analyse various cloud computing models and apply them to solve problems on cloud.
3) To discuss system virtualization and outline its role in enabling the cloud computing
system model.
4) Understand cloud infrastructure and storage.
5) Analyse the core issues of cloud computing such as security, privacy, and
interoperability.
6) Understand the trends in cloud enabling technologies.

UNIT-I : Introduction to Cloud Technologies (6 Hours)

Introduction to the Cloud Computing, History of cloud computing, Cloud
service options, Cloud Deployment models, Business concerns in the cloud.

109
UNIT-II: Cloud computing Architecture (6 Hours)
Introduction, delivery models: The SPI framework, Meaning of cloud service
model, Types of cloud service models, characteristics and benefits, Difference
between all models, cloud deployment models,Cloud Reference Model, Types
of Clouds, Economics of Clouds, Open Challenges, Cloud Platforms in
Industry: Amazon Web Services, Google AppEngine, And Microsoft Azure.
UNIT-III : Virtualization and cloud platform (6 Hours)
Exploring virtualization, Load balancing, Hypervisors, Machine imaging,
Cloud marketplace overview, Comparison of Cloud providers.
UNIT-IV: Cloud Infrastructure and storage (6 Hours)
History of data centers and their components like IT equipment and facilities
along with design considerations like efficiency power, requirements,
redundancy etc.
Cloud storage systems, their concepts and object storage, databases,
distributed file systems
UNIT-V: Cloud Security (6 Hours)

Securing the Cloud, The security boundary, Security service boundary,

Security mapping, Securing Data, Brokered cloud storage access, Storage
location and tenancy, Encryption, Auditing and compliance, Establishing
Identity and Presence, Identity protocol standards
UNIT-VI: Advanced Topics in Cloud Computing (6 Hours)

Energy Efficiency in Clouds, Market Based Management of Clouds, Federated

Clouds / InterCloud, Third Party Cloud Services.
Cloud Service Providers: EMC, EMC IT, Captiva Cloud Toolkit, Google,
Cloud Platform, Cloud Storage, Google Cloud Connect, Google Cloud Print,
Google App Engine, Amazon Web Services,Amazon Elastic Compute Cloud,
Amazon Simple Storage Service, Amazon Simple Queue , Windows Azure,
Microsoft Assessment and Planning Toolkit

Project Based Learning

1) To transfer the files from one virtual machine to another virtual machine.
2) Installing and running GATE.

3) To Simulate a cloud scenario using CloudSim and run a scheduling algorithm

that is not present in CloudSim.
4) To Implement IaaS using your resources.

5) Design and deploy a PaaS environment.

110
6) Installation and Configuration of virtualization using KVM.
7) Study Cloud Security management.
8) Case study on Amazon EC2/Microsoft Azure/Google Cloud Platform.
9) Study and implementation of Storage as a Service.
10) Study and implementation of identity management.

Textbooks:

1) Mastering Cloud Computing, Buyya R, Vecchiola C, Selvi S T, McGraw

Hill Education (India), 2013.
2) Cloud Computing Bible, Barrie Sosinsky ,Wiley Publishing Inc. 2011
3) Cloud Computing from Beginning to End by Ray J Rafaels

Reference Books:
1) Cloud Computing - Principles and Paradigm, Buyya R, Broberg J, Goscinski
A, , Wiley, 2011
2) Cloud Computing: Concepts, Technology & Architecture by Zaigham
Mahmood, Ricardo Puttini, Thomas Erl,2013
3) The Basics of Cloud Computing: Understanding the Fundamentals of Cloud
Computing in Theory and Practice by Derrick Rountree and Ileana
Castrillo,2013

Syllabus for Unit Tests:

Unit Test -1 Unit – I, Unit – II, Unit – III

Unit Test -2 Unit – IV, Unit –V, Unit - VI

111
 B. Tech (All Programmes) – 2023 Course
Rules and Regulations

(I) Theory
(A) Theory Examination
Theory examination consists of: (i) End semester examination (ESE), and (ii) Internal assessment
(IA).
(i) ESE is of 60 marks for theory courses.
(ii) IA is of 40 marks. Out of 40 marks, 20 marks will be for Unit Tests and 20 marks will be for
Project Based Learning for a given course. Two Unit Tests, each of 20 marks, will be conducted.
Average of marks obtained in these two unit tests will be considered as UT marks. Roll numbers
allotted to the students shall be the examination numbers for the conduction of unit tests.
(B) Standard of Passing
(i) There is a separate passing of 40% of 60 marks, i.e. 24 marks, for ESE for a given course.
(ii) There is a separate passing of 40% of 40 marks, i.e. 16, for IA for a given course.
(iii) A student who fails at ESE in a given course has to reappear only at ESE as a backlog student
and clear the head of passing. Similarly, a student who fails at IA in a given course has to reappear
only at IA as a backlog student and clear the head of passing

(II) Practical
(A) Practical Examination
Practical examination consists of: (i) Term work, and (ii) Practical/Oral examination for a given
course based on term work.
(i) Term work (TW): TW marks are as mentioned in the curriculum structure.
(ii) Practical/Oral (PR/OR): PR/OR marks are as mentioned in the curriculum structure.
(B) Conduction of practical/oral examination
(i) A student will be permitted to appear for practical/oral examination only if he/she submits term
work of a given course.
(ii) Practical/oral examination shall be conducted in the presence of internal and external
examiners appointed by university.

112
(B) Standard of Passing
(i) A student shall pass both heads TW and PR/OR separately with minimum 40% of total marks
of respective head.

(III) MOOC and Social Activity Course

(i) If a student completes one MOOC during a programme, he/ she will earn additional TWO
credits, subjected to submission of the certificate of completion of the respective course. It is
mandatory for a student to complete atleast two MOOC to obtain degree in a given discipline.
Students shall register to MOOCs which are offered by any one the following agencies:
(a) SWAYAM : www.swayam.gov.in
(b) NPTEL : www.onlinecourse.nptel.ac.in
(c) Course Era : www.coursera.org
(d) edX online learning : www.edx.org
(e) MIT Open Course ware : www.ocw.mit.edu
(f) Udemy : www.udemy.com
(g) Spoken tutorial : www.spoken-tutorial.org
(ii) If a student completes social activity, he/she will earn additional TWO credits, subjected to
submission of the certificate of completion of the respective course/ activity from the relevant
authorities. It is mandatory for a student to complete atleast one social activities to obtain degree
in a given discipline.
(iv) The additional credits for MOOC and Social Activity will be given only after verification of
the authentic document by the Head of the Department and a separate mark-sheet will be submitted
by the Head of the Department along with the course examiner

(IV) A. T. K. T
(i) A student who is granted term for B. Tech. Semester-I, III, V, VII will be allowed to keep term
for his/her B. Tech. Semester-II, IV, VI, VIII examination, respectively even if he/she appears and
fails or does not appear at B. Tech. Semester-I,III, V, VII examination respectively.
(ii) A student shall be allowed to keep term for the B. Tech. Semester-III course if he/she has a
backlog of any number of Heads of passing at B. Tech. Semester-I & II taken together.

113
(iii) A student shall be allowed to keep term for the B. Tech. Semester-V of respective course if
he/she has no backlog of B. Tech. Semester-I & II and he/she has a backlog of any number of
Heads of passing at B. Tech. Semester-III & IV taken together.
(iv) A student shall be allowed to keep term for the B. Tech. Semester- VII of respective course if
he/she has no backlog of B. Tech. Semester-I, II, III, IV and he/she has a backlog of any number
of Heads of passing at B. Tech. Semester-V & VI taken together.

(V) Grade Point, Grade Letter and Equivalent Marks

The student must obtain a minimum Grade Point of 5.0 (40% marks) in ESE and also in combined
ESE + IA. A student who fails in ESE of a course has to reappear only to ESE as a backlog student
and clear that head of passing.
Award of the Class for the Degree considering CGPA: A student who has completed the minimum
credits specified for the programme shall be declared to be passed in the programme. The CGPA
will be computed every year of all the courses of that year. The grade will be awarded according
to the CGPA of every year.
Final Performance Equivalent range of Marks
Range of CGPA
Grade Descriptor (%)

9.50 ≤ CGPA ≤10.00 O Outstanding 80 ≤ Marks ≤ 100

9.00 ≤ CGPA ≤ 9.49 A+ Excellent 70 < Marks <80

8.00 ≤ CGPA ≤ 8.99 A Very Good 60 < Marks < 70

7.00 ≤ CGPA ≤ 7.99 B+ Good 55 < Marks < 60

6.00 ≤ CGPA ≤ 6.99 B Average 50 < Marks < 55

5.00 ≤ CGPA ≤ 5.99 C Satisfactory 40 ≤ Marks < 50

CGPA below 5.00 F Fail Marks Below 40

(VI) Minor Programme

(i) A students shall receive a MINOR degree when he/she acquire additional 20 credits in a given
specialization defined by the UG programmes offered at the institute.
114
(ii) The theory and practical/oral components for a given course are mentioned in curriculum
structure. The theory and examination for a given course are mentioned in Section I and II.
(iii) The grade point, grade letter and equivalent marks system for MINOR programme is
mentioned in Section V.
(iv) The MINOR DEGREE programme is OPTIONAL. The interested students may opt MINOR
programme.
(v) A student shall complete the MINOR program prior to his/her graduation.

115