SE Syllabus 2020 21 COMP IT

Sardar Patel Institute of Technology
Bhavan’s Campus, Munshi Nagar, Andheri (West), Mumbai-400058-India

(Autonomous Institute Affiliated to University of Mumbai)
B.Tech. (Computer Engineering)

and
B.Tech. (Information Technology)
Syllabus
(Semester I-IV)
2020 Iteration (w.e.f. 2020-21)
UG Syllabus 2020 iteration/CS/IT pg. 1

Nomenclature of the Courses
BSC Basic Science Course PC Program Core

BSE Basic Science Elective PE Program Elective
ESC Engineering Science Course MLC Mandatory Learning Course
SCOPE Skill Certification for Outcome
ESE Engineering Science Elective based Professional Education
SBC Skill Based Course OE Open Elective
HSSE Humanities and Social Science
ABL Activity Based Learning Elective
Social Empowerment Through ABL- Self- Accomplishment Through
ABL-SEVA Various Activities SATVA Various Activities
Abbreviations
L Lecture Hour O Other Work (Self Study)

T Tutorial Hour E Total Engagement in Hours
P Laboratory Hour C Credit Assigned
Engagement and Credit Scheme
Sem I
No Type Code Course L T P O E C
1 BSC MA101 Engineering Calculus 3 1 0 8 12 4
2 BSC AS102 Engineering Chemistry 2 0 2 3 07 3
3 BSC AS103 Biology for Engineers 2 0 0 3 05 2
4 ESC AS105 Engineering Mechanics 2 0 2 4 08 3
5 Problem solving using Imperative
ESC CS101 2 0 2 4 08 3
Programming
6 ESC EC101 Digital Systems and Microprocessors 3 0 2 5 10 4
7 SBC AS107 Communication Skills 1 0 2 2 05 2
TOTAL 15 1 10 29 55 21

Sem II
1 BSC MA102 Differential Equations and 3 1 0 8 12 4
Complex Analysis
2 BSC AS101 Engineering Physics 2 1 2 5 10 4
3 ESC AS104 Engineering Graphics 1 0 4 2 07 3
4 ESC ET101 Basic Electrical Engineering 3 0 2 6 11 4
5 ESC CS102 Problem Solving using OOP 2 0 2 3 07 3
6 SBC AS106 Skill Shop 0 0 2 0 02 1
7 ABL SV1X/ST1X SEVA-I or SATVA-I 0 0 0 2 02 1
TOTAL 11 2 12 26 51 20
FIRST SUMMER
1 AS108 ENGINEERING EXPLORATION (Project
SBC 0 0 0 100 100 2
to solve social problem)

Semester-I

Course Teaching Scheme (Hrs/week) Credits Assigned

(Category) Course Name
Code L T P O E L T P Total
3 1 0 8 12 3 1 0 4
(BSC) Examination Scheme
Engineering Calculus Component ISE MSE ESE Total
Theory 100 100 200 400
MA101
Laboratory -- -- -- --
Pre-requisite Course Codes, if any.

Course Objective: To develop mathematical skills for solving engineering problems.
Course Outcomes (CO):At the End of the course students will be able to:-
MA101.1 Differentiate a function partially.
MA101.2 Find extreme values of a given function.
MA101.3 Find the nth order derivative of a given function.
MA101.4 Expand a given function as a power series.
MA101.5 Calculate the value of integrals in one variable using different techniques and solve
multiple integrals in various coordinate systems.
MA101.6 Calculate Area using double integration.
CO-PO Correlation Matrix (3-Strong, 2-Moderate, 1-Weak Correlation)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
MA101.1
MA101.2
MA101.3
MA101.4
MA101.5
MA101.6
CO-PEO/PSO Correlation Matrix (3-Strong, 2-Moderate, 1-Weak Correlation)

PEO1 PEO2 PEO3 PEO4 PSO1 PSO2
MA101.1
MA101.2
MA101.3
MA101.4
MA101.5
MA101.6

BLOOM’S Levels Targeted (Pl. Tick appropriate)

Remember Understand Apply Analyze Evaluate Create
Theory Component
Module Unit
Topics Ref Hrs.
No. No.
1 Title Partial Differentiation 1,2,3 10
1.1 Partial derivatives of first and higher order. Partial derivatives of 4
composite functions.
1.2 Euler’s theorem for homogeneous functions with two and three 3
independent variables, deductions from Euler’s theorem.
1.3 Application of partial derivatives: i) Local Maxima and Minima of 3
functions of two variables. ii) Lagrange’s Method of
undetermined multipliers.
2 Title Successive Differentiation and Series 1,2,3 10
2.1 Successive Differentiation: Proofs of nth derivatives of standard 3
functions. Use of De Moivre's theorem and partial fractions to
calculate nth derivatives of given functions.
2.2 Leibnitz’s Theorem on nth derivative of product of two functions 2
2.3 Infinite series: 1) Maclaurian’s series (without proof) and 5
derivation of series of some standard functions using Maclaurin
series. Expansion of functions in powers of x by using i)
Standard series method ii) Method of differentiation and
integration.
2) Taylor’s series and applications.
3 Title Integral Calculus (one variable ) 1,2,3 8
3.1 Gamma functions: properties of gamma functions and integrals 2
reducible to gamma functions.
3.2 Beta functions: properties, relation between Beta and Gamma 4
functions, integrals reducible to Beta functions, Duplication
formula.
3.3 Differentiation under Integral sign: differentiating integrals with 2
constant limits of integration for one parameter.
4 Title Integral Calculus (multi variable ) 1,2,3 14
4.1 Tracing of curves. Sketching standard solids ( Spheres, Ellipsoids, 2
Cylinders, Cones, Tetrahedrons, planes)
4.2 Double Integration: definition and evaluation. Evaluate by 7
changing the order of integration and by changing to polar form.
4.3 Application of double integral to finding area of given regions. 2
4.4 Triple integration: definition and evaluation (Cartesian and 3
cylindrical coordinates).
5 Self 1.1 Partial differentiation of implicit functions. 1,2,3 08

Study 2.3 Series by method of Substitution

3.2 Proof of Duplication Formula
3.3 Differentiation under Integral sign using two parameters and
variable limits
4.1 Finding lengths of curves in Cartesian and polar form
Total 42*
*Total of 42 hours does not include self study hours.
Text Books
Sr. No Title Edition Authors Publisher Year
Higher Engineering Forty
1 Dr. B. S. Grewal Khanna Publications 2020
Mathematics Fourth
Reference Books
Advanced Engineering Twenty
1 H.K Das S. Chand 2014
Mathematics Eighth
Advanced Engineering
2 Tenth Erwin Kreysizg John Wiley & Sons 2011
Mathematics
Advanced Engineering
3 Fourth Jain and Iyengar Narosa Publications 2014
Mathematics

Course
Teaching Scheme (Hrs/week) Credits Assigned
2 0 2 3 7 2 0 1 3
BS Examination Scheme
Engineering Chemistry Component ISE MSE ESE Total
AS102 Theory 50 50 100 200
Laboratory 50 -- 50 100
Pre-requisite Course Codes, if any. HSC level Chemistry

Course Objective: To provide necessary background of Chemistry suited for relevant areas of
engineering
Course Outcomes (CO):At the End of the course students will be able to
AS102.1 Relate thermodynamic principles and laws to crucial applications like heat engines
(Understanding)
AS102.2 Summarize properties and applications of different materials like polymers, ceramics,
alloys , nanomaterials, conductors and insulators (Understanding)
AS102.3 Identify methods for corrosion control based on knowledge of different types of
corrosion and factors affecting rate of corrosion (Application)
AS102.4 Compare different sources of energy like conventional fossil fuels, alternative fuels,
batteries and fuel cells with respect to availability, working principles, constitution,
efficiency of performance and environmental impact (Understanding)
AS102.5 Apply knowledge of electrochemistry and green chemistry in the interest of public
health and environment (Application)
AS102.6 Make use of analytical techniques (complexometric and iodometric titrations) and
instruments (pHmeter, conductometer and Orsats’s Apparatus) for various purposes
like hardness parameters of water, composition of alloys etc.
AS102.7 Estimate key properties of lubricants like flash point, viscosity and acid value
AS102.8 Estimate molecular weight of polymer
AS102.1
AS102.2
AS102.3
AS102.4
AS102.5
AS102.6
AS102.7
AS102.8


AS102.1
AS102.2
AS102.3
AS102.4
AS102.5
AS102.6
AS102.7
AS102.8

Theory Component
Module Unit
Topics Ref. Hrs.
No. No.
Title Thermodynamics
Introduction, Terminology, Concepts of Internal Energy and
1.1 Thermodynamic equilibrium, Zeroth and First Law of 1,3
Thermodynamics, Implications and Limitations of First law
1 Concept of Enthalpy, Joule Thomson Effect, Carnot's Cycle,
4
1.2 Carnot's theorem and related numericals, Second Law of 1,3
Thermodynamics
Applications of thermodynamic principles to the working of
1.3 1,3
refrigerator and air conditioner
Title Polymers
Introduction, Effect of heat on polymers : Glass transition
2.1 1, 2, 3
2 temperature and melting with significance; 3
Conducting polymers, Liquid crystal polymers, Engineering
2.2 1, 2 ,3
Polymers
Title Corrosion
Introduction, Dry corrosion (i) Due to oxygen (ii) Due to other
3.1 1,2
gases
Electrochemical corrosion and mechanism, Galvanic,
3.2 differential aeration corrosion, Significance of galvanic series 1,2
3 for corrosion phenomenon 5
Factors affecting rate of corrosion
3.3 (i)Position in galvanic series, (ii) relative areas of anode and 1,2
cathode, (iii) conductance of medium
Methods to decrease the rate of corrosion : Material
3.4 1,2
selection, Proper designing, Cathodic protection- i) Sacrificial

anodic
protection ii) Impressed current method, Metallic coatings,
Cathodic and anodic coatings (Galvanisation and Tinning :
principle and application only)
Title Energy Sciences
Definition and classification of fuels, Calorific value :
Definition, Gross or Higher calorific value & Net or lower
4.1 1,2
calorific value, Dulong’s formula & numericals for calculations
of Gross and Net calorific values.
Knocking, Octane number, Cetane number, Antiknock agents,
4.2 1,2
unleaded petrol
4 5
Combustion- Calculations for requirement of only oxygen and
4.3 air (by weight and by volume only) for given solid & gaseous 1,2
fuels.
Disadvantages of fossil fuels, Alternative (Green) Fuels :
Power alcohol , Biomass, Biogas, Biodiesel, Natural Gas and
4.4 1,2
CNG
(Description, Utility, advantages and disadvantages)
Title Batteries and Battery Technology
Introduction, Important terms, Nickel-Hydrogen(metal
5.1 1,2
hydride), Rechargeable Lithium ion batteries
Reserve Batteries, Fuel cells, characteristics, description,
5 4
5.2 construction and working of Hydrogen-oxygen fuel cells, 1,2
Types of fuel cells (in brief)
Electrochemical sensors : Working principle, construction and
5.3 1,2
applications
Title Green Chemistry
12 principles of green chemistry with examples, numericals
6
6.1 on Atom Economy, Green Solvents (Water, Supercritical 1,2 3
Fluids),
Title Engineering Materials
Eutectic mixtures and soft solders, Advanced Ceramic
materials and cermets : magnetic, electronic and electrical
7.1 applications 1,2,3
Carbon nanomaterials : Fullerenes and Carbon nanotubes,
Structure, Properties and applications
7
Insulators, Semiconductors and Superconductors : Thermal 4
and electrical insulating materials and important engineering
7.2 1,2,3
applications, Stoichiometric, defect and controlled valency
semiconductors.
Superconductors, perovskite structure and 1:2:3 compound
7.3 1,2,3
YBa2Cu3O7-y, properties and applications

1. Supramolecular polymers and their applications

2. Anodic Protection as a corrosion control strategy
3. Current research and advances in fuel cells
Self
8 4. Commercial applications of superconducting materials 4*
Study
5. Tops down vs bottoms up approach to
nanotechnology and applications of nanoparticles
other than carbon
Total (* Not Included) 28
Laboratory Component
Sr. No Title of the Experiment
1 Determination of total, temporary and permanent hardness of water sample
2 Removal of hardness using ion exchange column
3 Molecular weight determination of polymers by Oswald’s Viscometer
4 To determine flash point of a lubricating oil
5 Determination of Viscosity of oil by Redwood Viscometer
6 Estimation of acid value of lubricant
7 Determination of amount of strong acid present in a solution using a conductometer
8 Determination of strength of acid using a pH meter
9 Estimation of Copper in brass by Iodometric Titration
10 Analysis of Flue gas for its composition (by Orsat’s Apparatus)
11 Estimation of Iron in plain Carbon steel
12 Determination of COD of wastewater sample
Text Books
Sr No Title Edition Authors Publisher Year

P.C.Jain & Dhanpat Rai & Co.
1 Engineering Chemistry Eleventh 2014
M.Jain (Pvt) Ltd.
A Textbook of Engineering S.S.Dara &
2 Twelfth S. Chand & Co. 2014
Chemistry S.S.Umare
A Textbook of Engineering Dhanpat Rai & Co.
3 Third S Chawla 2015
Chemistry (Pvt) Ltd.
Reference Books
Sr No Title Edition Authors Publisher Year

1 Physical Chemistry Eleventh Peter Atkins Oxford University Press 2017

Course
2 0 0 3 5 2 0 0 2
Biology for Engineers Component ISE MSE ESE Total
Theory 50 50 100 200
AS103
Laboratory - -- - -
Pre-requisite Course Codes, if any. HSC level Biology

Course Objective: To provide engineering perspective towards the biological principles and
systems
AS103.1 understand basic biological principles and organizational structure of living systems
at molecular level.
AS103.2 comprehend basic biological principles and organizational structure of living systems
at cellular level
AS103.3 know Energy transformation and information processing in biological systems
AS103.4 appreciate biological process with engineering perspective
AS103.5 identify significance of Gene, Blood and Skin in human health system.

AS103.1
AS103.2
AS103.3
AS103.4
AS103.5

AS103.1
AS103.2
AS103.3
AS103.4
AS103.5


Theory Component
Module Unit
Topics Ref. Hrs.
No. No.
Title Bio-molecules and bio-polymers: Structure and Function 1,3
1.1 Organic and inorganic molecules, Unique Properties of water
1
Carbohydrates, Lipids, Amino Acids and proteins, Nucleic 4
1.2
Acids (DNA and RNA)
Title Levels of organization of life 1,3
Cell as a basic unit of life, prokaryotic and eukaryotic cells,
2.1 microbes, plant and animal cells; Cell organelles – structure
2 4
and function; Cell membrane.
Levels of organization: cells, tissues, organs, systems &
2.2
organism
Title Energy transformations 1,3
Energy transformations in Chloroplast: Photosynthesis
3.1 (photochemical & biochemical phase) and ATP generation,
3 5
Aerobic and anaerobic systems
Energy transformations in Mitochondria: Cellular respiration
3.2
(glycolysis and Kreb cycle) and ATP generation
Title Transport and Defense mechanisms 1,3
Transport Phenomena in Biological Systems: Membrane
channels and ion channels; Fluid flow and mass transfer
4.1 (nutrients & ions); In plants: Xylem and Phloem; In animals:
4 Blood and Lymph Transport of gases: Oxygen and Carbon 5
dioxide Heat Transport - Body temperature regulation.
Defense mechanisms:
4.2 In plants: Herbivory, secondary metabolites
In animals: Innate and Adaptive immune systems
Title Engineering perspectives of biological sciences: 1,3
Biology and engineering crosstalk –
5.1 At cell level: Hybridoma technology
5 At tissue level: Plant Tissue Culture, Animal Tissue Culture;
6
Tissue Engineering: Principles, methods and applications
5.2 Introduction to Biomimetics and Bio-mimicry, nano-
biotechnology
Title Role of Gene, Blood and Skin in human health system. 2,4
6 Introduction to Genetic Engineering. Blood Type, Complete 4
6.1
Blood Count Test and Abnormalities.

Structure of Skin, Functions of Skin. Engineering methods for

6.2
identification of Skin diseases.
Introduction to Biosensors, transducers, amplifiers;
Self Introduction to medical imaging and different medical
7 4*
Study Imaging modalities; Review of Signals and system; Electro
Physiological Signal Analysis.
Total (* Not included) 28
Text Books
Sr. No. Title Edition Authors Publisher Year
Lodish H, Berk
1 Molecular Cell Biology Fourth W. H. Freeman 2000
A, Zipursky SL
Textbook of Anatomy
and Physiology for Indu Khurana & CBS Publsihers &
2 First 2019
Nurses and allied Health Arushi Distributors Pvt Ltd
Sciences
Reference Books
Sr. No. Title Edition Authors Publisher Year
Lehninger Principles of
3 Fourth Nelson, D. L., & Freeman 2004
Biochemistry
Cox, M. M.
Joseph D.
Introduction to
4 Third Bronzino, John Academic Press 2012
Biomedical Engineering.
Enderle

Course
2 0 2 4 8 2 0 1 3
(ESC) Examination Scheme
Engineering
Component ISE MSE ESE Total
Mechanics
Theory 50 50 100 200
AS105

Course Objective:
AS105.1 Draw free body diagram and determine reactive forces using conditions of
equilibrium and Lami’s theorem
AS105.2 Determine coefficient of friction for various contact surfaces
AS105.3 Analyze the three-dimensional system of space forces.
AS105.4 Analyze the kinematics of particle and obtain the various parameters of motion.
AS105.5 Determine Instantaneous centre of rotation (ICR).
AS105.6 Design and conduct an experiment to demonstrate principles of statics and dynamics

AS105.1
AS105.2
AS105.3
AS105.4
AS105.5
AS105.6

AS105.1
AS105.2
AS105.3
AS105.4
AS105.5
AS105.6


Theory Component
Module Unit
Topics Ref. Hrs.
No. No.
1 Unit1 Equilibrium of forces
1.1 Equilibrant force, conditions of equilibrium for concurrent 1,3
forces, parallel forces and general force system, equilibrium of 8
connected bodies, Lami’s theorem.
1.2 Types of supports, types of loads, Beams, Determination of 3
reactions at supports for various types of loads on beams
2 Unit2 Friction
2.1 Introduction to Laws of friction, Cone of friction, Equilibrium of 1,2 4
bodies on inclined plane, Application to problems involving
wedges, ladders.
3 Unit3 Forces in space 5
3.1 Rectangular Components of Forces in Space, Resultant of Space 1
forces, Moment of a Force about a point, axis and line.
Equilibrium of a particle in space.
4 Unit4 Kinematics of Particle 8
4.1 Motion along straight and curved path, Rectangular component 2,3
of velocity and acceleration, Tangential & Normal component of
acceleration, Motion curves(a-t, v-t, s-t curves), Projectile
motion,
5 Unit5 Kinematics of Rigid Bodies 3
5.1 Instantaneous center of rotation for the velocity of bodies in 3
plane motion, (up to 2 linkage mechanism)
6 Self 1. Applications of resultant of forces, concept of couple and 1,2,3 6*
Study moments,
2. Centroid and center of gravity, analysis of trusses.
3. Kinetics of rigid body, work energy principle.
4. Principle of Law of Conservation of momentum, Impact and
collision.
Total (*Not included) 28
1 Draw the force polygon and determine the equilibrant force for concurrent coplanar
force system.
2 Use the conditions of equilibrium for parallel force system and determine the support
reactions.
3 Apply the principle of moment for equilibrium of levers.
4 Determine the coefficient of friction for glass slab and a metal plate on an inclined plane.

5 Determine the axial forces using Lami’s theorem for Jib crane apparatus.
6 Use the conditions of equilibrium for non-concurrent non-parallel force system and draw
the force polygon.
7 Measure the acceleration due to gravity with the help of simple pendulum apparatus.
8 Determine the range of projectile and the time of flight for the projectile motion.
9 Verify the law of conservation of momentum and determine the coefficient of restitution
for collision
10 (Plot the motion of projectile using air-cushion table apparatus.) A small project based
on Engineering Mechanics concept.
Text Books

Vector Mechanics for Nineth Beer and McGraw Hill 2010
1 Engineers statics and Johnston
dynamics
Engineering Fifth Bhavikatti S and New Age 2009
2 Mechanics Rajsekharappa International
Engineering Fourteenth A K Tayal Umesh 2012
3 Mechanics Statics Publication,
and Dynamics Delhi
Reference Books

Engineering Fifth E.W. Nelson, McGraw Hill 1998
1 Mechanic: Statics and C.L. Best, W.G.
Dynamics, McLean,
Singer’s Engineering Third Vijaya Kumar BS Publication 2012
2 Mechanics Statics and Reddy. K. and
Dynamics Suresh Kumar. J


2 0 2 4 8 2 0 1 3
(ESC) Problem Solving using Examination Scheme
Imperative Component ISE MSE ESE Total
Programming Theory - - - -
CS101

Course Objective: To develop problem solving skills using imperative programming
CS101.1 Explain the problem solving aspects using various programming paradigms.
CS101.2 Solve real world problems using imperative programming approach.
CS101.3 Solve problems using control structures for real world problems.
CS101.4 Solve problems using Arrays and Text processing.
CS101.5 Develop modular code for a given problem.
CS101.6 Solve real world problems using Structures and Unions

CS101.1
CS101.2
CS101.3
CS101.4
CS101.5
CS101.6
PEO1 PEO2 PEO3 PEO4 PSO1 PSO2 PSO3
CS101.1
CS101.2
CS101.3
CS101.4
CS101.5
CS101.6


Theory Component
Module Unit
Topics Ref. Hrs.
No. No.
Title Introduction to Problem Solving and Programming Paradigms
1.1 What is a Problem, Problem Solving Aspect, Top Down Design,
Implementation of Algorithms, Characteristics of a good algorithm,
what is a computer program, real life examples of programming, 3,4 2
1
Computer based applications of programming, Steps followed in
Program Development, Characteristics of good Program
1.2 Overview of Programming Paradigms - Declarative and Imperative,
3,4 2
Problem solving using Algorithm and Flowcharts,
Title Basic Elements of Computer Programming and Control flow
2.1 Variables, keywords, Data types, Operators: Arithmetic, Relational
and Logical, Assignment, Unary, Conditional, Bitwise, Expression, 1,2 1
Statements.
2
2.2 Branching Structures: if statement, if-else statement, multi-way
decision, switch statement, continue statement, break statement 1,2 3
Iterative Structures: while, do-while, for, nested loops
2.3 Problem solving using Control Structures for real world problems 1,2,4 2
Title Problem Solving using Array Techniques
3.1 Introduction to Arrays: Declaration, Definition, accessing array
elements, one-dimensional array, two-dimensional array, array of 1,2 2
characters, Strings
3 3.2 Classical Problem Solving using Arrays like Array Order Reversal,
Array Counting or Histogramming, Finding the maximum number 1,2,4 2
in a set.
3.3 Text Processing problems like finding length, keyword search,
1,2,4 2
finding anagrams
Title Problem Solving using Modular Approach
4.1 Defining a Function, accessing a Function, Function Prototype,
4 Passing Arguments to a Function, call by value, pointers and call by 1,2 4
reference, Recursion
4.2 Problem solving using Functions and Recursive applications 1,2,4 3
Title Structures and Unions
5.1 Structures and Union: Declaration, Initialization, structure within
5 structure, Array of Structure, Operation on structures, Concept of 1,2 3
Union, Difference between structure and union,
5.2 Real world problems using Structures and Unions 1,2,4 2
Self File handling: Types of File, File operation- Opening, Closing,
6 Study Creating, Reading, Processing File, Command line arguments, 1,2,4 4*
Dynamic Memory Allocation
Total (* not counted in total hours) 28

Laboratory Component (Minimum 10 Laboratory experiments are expected)

Note: All problems should be implemented using C language.

1 Use the formatted input/output statements, operators and expressions of C language
2 Apply various control structures to solve given problems.
3 Apply the concept of functions to incorporate modularity.
4 Demonstrate the use of one-dimensional arrays to solve a given problem.
5 Demonstrate the use of two-dimensional arrays to solve a given problem.
6 Apply the concept of recursion to solve a given problem.
7 Implement various text processing problems.
8 Apply the concepts of structures/union to solve a given problem.
9 Demonstrate the use of pointers to solve a given problem.
10 Implement various operations on files to solve a given problem.
Text Books

McGraw Hill
Byron
1 Programming with C Fourth (Schaum’s outline 2018
Gottfried
series)
Kernighan ,
2 The C programming Language Second Pearson 2015
Ritchie
Foundations of Programming
3 Second Kent D. Lee Springer 2017
Languages
4 How to Solve it by Computer First R.G. Dromey Prentice Hall India 1998
Reference Books

1 Let Us C Sixteenth Yashavant Kanetkar BPB 2017
2 Programming Third Carlo Ghezi, Mehdi John Wiley & Sons 2008
Language Concepts Jazayeri
3 Computer Second V. Rajaraman & PHI Learning, 2014
Programming in C Neeharika Adabala Eastern Economy
Edition,

Course(Category) Teaching Scheme (Hrs/week) Credits Assigned

Course Name
3 0 2 5 10 3 0 1 4
Digital Systems and Component ISE MSE ESE Total
Microprocessor
EC101 Theory 75 75 150 300

Course Objective: To prepare students to perform the analysis and design of various digital
electronic circuits and introduce them to the concept of microprocessors
EC101.1 Explain various logic gates, SOP, POS forms and their minimization with k- map for
given combinational circuits.
EC101.2 Construct combinational circuits using given MSI devices.
EC101.3 Apply the knowledge of flip-flops and MSI to design sequential circuits
EC101.4 Compare the logic families based on their characteristics
EC101.5 Comprehend the architectural features of 8085 with basic assembly language
programming
EC101.1
EC101.2
EC101.3
EC101.4
EC101.5

EC101.1
EC101.2
EC101.3
EC101.4
EC101.5


Theory Component
Module Unit
Topics Ref. Hrs.
No. No.
Title Combinational Circuits
1.1 Logic Gates: Basic gates, Universal gates, Sum of products and 1,4
products of sum, minimization with Karnaugh Map (up to four
1 variables), Quine Mc’Clusky method and realization. 11
1.2 Combinational Circuits using basic gates as well as MSI devices: 1,4
Half adder, Full adder, Half Subtractor, Full Subtractor,
Multiplexer, Demultiplexer, Decoder, Comparator
Title Sequential Circuits
2.1 Sequential Logic: Latches and Flip-Flops. Conversions of Flip- 1,4
Flops.
2.2 Counters: Asynchronous Counters, Synchronous Counters, 1,4
2
UpDown Counters, Mod Counters, Ring and Twisted Ring 11
Counters , Shift Registers, Universal Shift Register
2.3 MSI counters (IC 7490, IC 74160, IC 74163, IC 74169), MSI Shift 2,5
registers (IC 74194) and their applications
Title Clocked Synchronous Machines
3 3.1 Mealy and Moore Machines, Clocked synchronous state machine 2,5 05
analysis, State reduction techniques.
TitleLogic Families
4.1 Types of logic families (TTL and CMOS), characteristic 1,4
4 parameters (propagation delays, power dissipation, Noise 05
Margin, Fan-out and Fan-in), transfer characteristics of TTL
NAND.
Title Introduction to Microprocessors
5.1 Evolution of computers and Microprocessors 3
5.2 Essential components of a conventional Central Processing Unit 3
(CPU)
5 5.3 Architecture of 8-bit microprocessor 8085 3 10
5.4 Basic instruction set with its addressing modes and concepts of 3
Instruction cycle, Machine cycle and T states. Elementary
programming in assembly language.
5.5 Elements of I/O data transfer with the concept of interrupts 3
Self Concepts of PROM, PAL and PLA. Timing Considerations and
Study Meta-stability in Flip-Flops. Clocked synchronous state machine
6 design. Interfacing CMOS to TTL and TTL to CMOS. Concepts of 5*
peripherals and memory with its interfacing with 8085
microprocessor


1 To implement the combinational logic for given function using basic gates/MSI ICs.
a. To study and verify the truth table of logic gates
b. To study the universal NAND and NOR gate
c. To study the working of half adder, full adder, half subtractor, Full subtractor
along with truth table
2 To implement TTL and CMOS logic family
a. To study TTL NAND gate (BJT implementation).
b. To study CMOS NAND gate
c. To study interfacing of the TTL /CMOS
3 To implement 4-bit, 5-bit and 8 bit comparator using given MSI
4 To design implement gate level multiplexers and MSI multiplexers
5 To design and implement gate level and MSI circuits of flip-flops
6 To design counters
a. To design a MOD4 synchronous up/down counter
b. To study IC 7490 – Asynchronous Decade Counter
7 To synchronous counters, synchronous counters and shift register using given MSI.
a. To study IC 74160 as Synchronous Decade Counter and Mod 6 counter
b. To study IC 74163 as Synchronous MOD 16 Counter and Mod 10 counter
c. To verify the truth table of IC 74194 as Universal Shift Register and implement Ring
and Twisted Ring Counter.
8 To perform basic arithmetic operations through assembly language program in 8085
9 To simulate COPY and PASTE operation through 8085 assembly program
10 To write a program to add N elements stored in an array of 8 bit numbers (8085)
Text Books
1 Modern Digital Electronics Fourth R. P. Jain Tata McGraw Hill 2009
Digital Design Principles And John F.
2 Third Pearson Education 2001
Practices Wakerly
Microprocessor Architecture, Ramesh
3 Programming, and Applications Sixth S. Penram International 2013
with the 8085 Gaonkar
Reference Books
1 Digital Design Forth Morris Mano Pearson Education 2008
Fundamentals of digital Stephen Brown and
2 Second McGraw Hill 2006
logic design with VHDL ZvonkoVranesic

Course
1 0 2 2 5 1 0 1 2
(SBC) Examination Scheme
Communication Skills Component ISE MSE ESE Total
Theory -- 50** -- 50
AS107
Laboratory 150* -- -- 150
** MSE will be evaluated on the basis of written test based on module 1 and 2.
** ISE will be evaluated on the basis of marks scored in practicals, out of 150.

Course Objective:
Course Outcomes (CO):At the end of the course students will be able to
AS107.1 Apply the principles of business writing for professional documents.
AS107.2 Develop advance vocabulary and grammar for spoken and written communication.
AS107.3 Design the draft a formal speech.
AS107.4 Analyze received information by using active listening and reading skills.
AS107.1
AS107.2
AS107.3
AS107.4

AS107.1
AS107.2
AS107.3
AS107.4

Theory Component

Module Unit L P
Topics Ref.
No. No. Hrs. Hrs
1 Title Vocabulary Building & Grammar
1.1 Concept of word formation, the root words from foreign 7,1 2 4
languages and their use in English
1.2 Common errors in writing, confused pair of words, 6, 2
redundancies, clichés
2 Title Writing Skills 7 14
2.1 Principles of Business Writing: 7Cs of communication, 4
sentence structures, Organizing paragraph in direct and
indirect style; Summarization
2.2 Practices in Writing: E-mail Etiquettes, e-mail for business 3
purposes
2.3 Critical Reading: understanding the concept of critical 5
reading and applying to analyze a given text.
3 Title Oral Skills 5 10
3.1 Listening Comprehension(audio): Pronunciation, 5
intonation, Stress and Rhythm
3.2 Speaking Practices: 3
1. Common everyday situation: Conversation and
dialogues (group activity, ice-breaking session)
2. Public Speaking: Extempore, formal speech
4 Self 1. Basic Rules Of Grammar 6*
Study 2. GRE Vocabulary
3. Reading a book(fiction/non-fiction) and preparing a
review on it
Total (*Not included) 42 hrs
List of activities (Graded, Non-graded)

Sr. No Title of the assignments Marks
1 Skit based on a given situation -
2 ISE 1 – Summary Writing 10
3 ISE 2 – Extempore 10
4 ISE 3 – Grammar 20
5 ISE 4 – Vocabulary 20
6 Reviewing a book (fiction/ non-fiction) 10
7 ISE 5 – Email Writing (Inquiry) 20
8 ISE 6 – Email Writing (Complaint) 20
9 ISE 6 – Speech 20
10 ISE 7 – Critical Reading 20
Total 150

Text Books:
Sr.
Title Edition Authors Publisher Year
No
1 Communication Skills 2013 Shirley Mathews Technical Publication, Pune 2013
English Vocabulary in Michael McCarthy , Cambridge University Press,

2 1999 1999
Use Felicity O’Dell India
Reference Books:
Sr.
No
Oxford Practice
1 1999 John Eastwood Oxford, India 1999
Grammar
Meenakshi Raman,
2 Communication Skills 2011 Oxford, India 2011
Sangeeta Sharma
Synergy
3 Communication Skills 2010 Dr. Meera Bharwani 2010
Knowledgeware, India
English Grammar for
4 2005 Geoffrey Leech Palgrave, UK 2005
Today
Word Power Made Anchor Books, New
5 1978 Norman Lewis 1978
Easy York

Semester-II


3 1 0 8 12 3 1 0 4
(BSC) Differential Equations Examination Scheme
and Component ISE MSE ESE Total
Complex Analysis Theory 75 75 150 400
MA102
Pre-requisite Course Codes, if any. MA101

MA102.1 Solve differential equations of first order.
MA102.2 Solve differential equations of higher order using operators.
MA102.3 Solve differential equations in electrical engineering problems.
MA102.4 Find powers, roots & logarithm of a complex number and to separate the function of
a complex number into real and imaginary.
MA102.5 Check whether a given function is analytic and construct analytic functions.
MA102.6 Compute integrals of complex valued functions.
MA102.1
MA102.2
MA102.3
MA102.4
MA102.5
MA102.6

MA102.1
MA102.2
MA102.3
MA102.4
MA102.5
MA102.6


Theory Component
Module Unit
Topics Ref Hrs.
No. No.
1 Title Linear Differential Equations of first order 1,2,3 11
1.1 Exact Differential Equations, Integrating Factors, equations 3
reducible to exact form.
1.2 Linear differential equations (Definition), equations reducible to 2
linear form, Bernoulli’s equation
1.3 Simple application of differential equation of first and second 2
order to electrical engineering problems.
1.4 Numerical solution of ordinary differential equations of first 4
order and first degree using
(a)Taylor’s series method
(b)Euler’s method
(c) Modified Euler method
(d) Runge‐Kutta fourth order formula.
2 Title Linear Differential Equations of higher order 1,2,3 11
2.1 Linear Differential Equation with constant coefficient‐ 7
complementary function, particular integrals of differential
equation of the type f(D)y = X where X is , sin(ax+b),
cos(ax+b), , V, xV, where V is a function of x.
2.2 Cauchy’s homogeneous linear differential equation and Method 2
of variation of parameters for second order.
2.3 System of Differential Equations. 2
3 Title Complex Numbers 1,2,3 12
3.1 Revision: Complex Numbers as ordered pairs, Argand’s diagram, 1
Cartesian, Polar and Exponential form of Complex Numbers.
3.2 De Moivre's Theorem and its application to determine powers of 3
complex numbers. Roots of complex numbers by De Moivre's
Theorem.
3.3 Expansion of sin and cos in terms of powers of sin and 2
cos . Expansion of and in terms of sines and cosines
of multiples of .
3.4 Hyperbolic Functions: relation between circular and hyperbolic 4
functions, Inverse hyperbolic functions. Separation into real and
imaginary parts of complex functions.
3.5 Logarithm of a complex number. 2
4 Title Analytic functions and Complex Integrals 1,2,3 8

4.1 Analytic functions, Cauchy Reimann equations in cartesian and 4

polar form, construction of analytic functions using Milne-
Thompson’s method, Harmonic functions, poles of f(z).
4.2 Line Integral, Cauchy’s Integral theorem for simply connected 4
regions, Cauchy’s Integral formula (for poles lying inside or outside
the curve).
5 Self 1.3 To form D.E. for given L-C-E-R circuit 08
Study 1.4 Picard’s method
2.1 Method of undetermined coefficients to solve differential
equations.
2.2 Legendre’s differential equation, Method of variation of
parameters for third order differential equations.
3.2 Complex examples using De Moivre's Theorem.
4.1 Construction of analytic function f(z) =u+iv when u+v or u-v is
given. Orthogonal trajectories
Total 42*
*Total of 42 hours does not include self study hours.
Text Books

1. Higher Engineering Mathematics Forty Fourth Dr.B.S. Khanna 2020
Grewal Publications
Reference Books

1. Advanced Engineering Twenty H.K Das S.Chand 2014
Mathematics Eighth
2. Advanced Engineering Tenth Erwin John Wiley & 2011
Mathematics Kreysizg Sons
3. Advanced Engineering Fourth Jain and Narosa 2014
Mathematic Iyengar Publications

Course
2 1 2 5 10 2 1 1 4
BSC Examination Scheme
Engineering Physics Component ISE MSE ESE Total
Theory 75 75 150 300
AS101
Pre-requisite Course Codes, if any. HSC level physics

Course Objective: To provide the knowledge and methodology necessary for solving problems in
the field of engineering
AS101.1 Illustrate the knowledge of basic concepts of semiconductor physics, lasers and quantum
mechanics.
AS101.2 Solve the problems by applying the basics concepts of physics.
AS101.3 Use the Schrodinger equation to realize the concept of discreteness and quantum
tunneling.
AS101.4 Explain the working of various LASERs and its practical applications.
AS101.5 To develop experimental skills and the practical abilities.
AS101.6 To develop an ability of understanding of concepts and principles of physics.
AS101.7 To comprehend importance of precision, accuracy of the experimental data.
AS101.1
AS101.2
AS101.3
AS101.4
AS101.5
AS101.6
AS101.7
AS101.1
AS101.2
AS101.3
AS101.4
AS101.5
AS101.6
AS101.7

Theory Component
Module Unit
Topics Ref. Hrs.
No. No.
1 Title Quantum Mechanics
1.1 de-Broglie hypothesis; experimental verification of de Broglie
hypothesis; wave packet, group velocity and phase velocity;
Wave function, Physical interpretation of wave function; 1,2,3
Heisenberg’s uncertainty principle; Electron diffraction
experiment; Applications of uncertainty principle 09
1.2 Schrodinger’s time dependent wave equation, time
independent wave equation; Application of time-independent
Schrodinger equation - Particle trapped in one dimensional box 1,2,3
and Potential barrier (Tunnelling), Harmonic oscillator
(qualitative)
2 Title Physics of Semiconductors and Semiconductor devices
2.1 Conduction in metals and semiconductors; Fermi-Dirac
distribution function and Fermi level in a conductor, insulator 5
and semiconductor
2.2 Intrinsic and extrinsic semiconductors; intrinsic conductivity
and extrinsic conductivity; Law of mass action, charge
neutrality condition; intrinsic carrier concentration, electron
and hole concentration; Extrinsic carrier concentration as a 5
function of temperature; Effect of impurity concentration and
temperature on the Fermi Level; Hall Effect and its applications. 13
Drift and Diffusion current density
2.3 Formation of a P-N junction, depletion region and barrier
potential; Energy band structure of P-N Junction (unbiased,
forward-bias, reverse-bias); concept of carrier current
densities in p-n junction in equilibrium, forward bias and 5,6
reverse bias; Breakdown mechanism - Zener effect and
avalanche
1.4 P-N junction devices: LED, Zener diode, photoconductors,
5,6
photovoltaic solar cells and Bipolar Junction Transistors
3 Title LASERS 06

3.1 Processes - Absorption of light, spontaneous emission,

stimulated emission; Einstein’s equations, Population inversion;
3,4
metastable states; pumping and pumping schemes; optical
resonance cavity
3.2 Ruby and Helium Neon laser, semiconductor laser; Applications
of laser in industry, medicine and holography. (construction & 3,4
reconstruction of holograms)
4 Self Interference of light in thin films having uniform thickness,
Study Newton’s rings, Applications of interference in anti-reflecting
and highly reflecting thin films. 05*
Diffraction of light, Diffraction due to single slit, double slit and
diffraction grating.
Sr. No Title of the Experiment*

1 Determination of energy band gap of a semiconductor
2 Study of I-V characteristics of a Zener diode
Determination of the type of semiconductor sample, concentration of charge carriers
3
and its mobility using Hall Effect
4 Determination of Planck’s constant using photo vacuum tube
5 Measurement of ultrasonic velocity in liquid medium using ultrasonic interferometer
6 Determination of radius of curvature using Newton’s Rings
Determination of thickness of a thin foil or wire using the interference pattern of a
7
wedge-shaped film
Determination of wavelengths of a mercury source and resolving power of a plane
8
diffraction grating
9 Study of single slit diffraction
10 Determination of grating element of a diffraction grating using a laser source
11 Determination of the numerical aperture of an optical fibre
12 Uses of a Cathode-Ray Oscilloscope
*Students will perform any 10 of the above experiments

Text Books

Sr. No
A Textbook of Dr. M.N. Avadhanulu &
1 Eleventh S. Chand 2018
Engineering Physics Dr. P. G. Kshirsagar
D. K. Bhttacharya & Oxford
2 Engineering Physics First 2015
Poonam Tandon University Press
Reference Books

Concepts of Modern McGraw Hill
1 Sixth Arthur Beiser 2009
Physics Education
Serway, Moses and
2 Modern Physics Third Thomson Learning 2005
Moyer
Fundamentals of
3 Tenth Halliday and Resnick Wiley 2013
Physics
New Age International
4 Solid State Physics Eighth S. O. Pillai 2018
Publishers
Solid State Electronic Sevent Ben G. Streetman and
5 Pearson Education 2016
Devices h Sanjay Kumar Banerjee
Lasers: Fundamentals Ghatak and
6 Second Springer 2011
and Applications Thyagarajan

Course
1 0 4 2 7 1 0 2 3
Engineering Graphics Component ISE MSE ESE Total
Theory 25 25 50 100
AS104

Course Objective:
AS104.1 Construct basic engineering curves.
AS104.2 Read the 3 dimensional view and draw the orthographic projections.
AS104.3 Draw projection of points and lines.
AS104.4 Draw projection of regular solids inclined to both the reference planes.
AS104.5 Read the orthographic projection and draw isometric views.
AS104.6 Draw the development of lateral surfaces of solids.

AS104.1
AS104.2
AS104.3
AS104.4
AS104.5
AS104.6

AS104.1
AS104.2
AS104.3
AS104.4
AS104.5
AS104.6


Theory Component
Module Unit
Topics Ref. Hrs.
No. No.
1 Unit1 Introduction to Engineering Drawing 1,2
1.1 Types of Lines, Dimensioning Systems as per IS conventions. 3
First angle method of projection only
1.2 Basic construction of Cycloid and Involutes.
2 Unit2 Orthographic Projection 1 2
2.1 Orthographic views of a simple machine part as per the first
angle method of projection recommended by I.S.
2.2 Full Sectional views of the Simple Machine parts.
3 Unit3 Projection of Points and Lines:- 1,2 4
3.1 Projection of points in all four quadrants
3.2 Projection of lines parallel to one principal reference plane.
3.3 Lines inclined to both the Reference Planes (Excluding Traces
of lines).
4 Unit4 Projection of solid (Regular solids like Prism, Pyramid, 1,2 5
Cylinder, Tetrahedron, Hexahedron and Cone only)
4.1 Projection of solid resting on plane (Single step projection)
4.2 Projection of solid such that base inclined to one reference
plane (Two step projection)
4.3 Projection of solid such that base inclined to both reference
planes (Three step projection/problem)
(Exclude Spheres, Composite, Hollow solids and frustum of
solids)
5 Unit5 Isometric visualization and DLS 2 Lab
5.1 Isometric view (Natural scale only) session
5.2 Development of lateral surface. (2)
(Exclude DLS of a solid with section or a hole in it and Reverse
Development)
6 Self 1.2 Construction of Engineering curves like ellipse, parabola, 1,2,3 6*
Study hyperbola, helix, other types of cycloid etc. by using different
method of construction.
2.1 Solve more practice examples of orthographic views.
Draw different views of a machine part/any object using third
angle method of projection. (Axonometric view, oblique
view, perspective etc.)
2.2 Half sectional orthographic views.
3.1 Projection of lines with traces, application based
problems on Projection of lines

4.1 Projection of section of solid with cutting planes.

5.1 Development of surfaces of frustum of solid, and
retaining part of the solid after cutting plane, reverse
development of solid.
Sr. No Engineering AutoCAD Laboratory

Introduction to AutoCAD:-Basic Drawing and Editing Commands. Knowledge of setting up layers,
1 Dimensioning, Hatching, plotting and Printing.
AutoCad Practice sheets (Min. Two)
2 Orthographic views (Two Problems)
3 Sectional Orthographic views(Two Problems)
4 Draw cycloid and involute(one each)
5 Draw Projection of lines(parallel and inclined to one plane)
6 Draw Projection of lines (Inclined to both the reference plane)
7 Projection of solid (Single step and two step)
8 Projection of solid (Three step )
9 Draw development of lateral surfaces with simple sections.
Isometric Views:- Isometric View/Drawing of blocks of plain and cylindrical surfaces using
10
plain/natural scale only. (Exclude Spherical surfaces).
Text Books:

1 Engineering Drawing 53rd N D Bhatt Charotar 2016
2 Engineering Drawing 3rd Dhananjay A Jolhe Tata McGraw Hill 2011
Reference Books

Sham
1 AutoCAD 2017 -- DreamTech Press, Delhi 2017
Tickoo
Engineering Drawing and K
2 Fifth New Age International 2011
Graphics Venugopal

Course Teaching Scheme

Credits Assigned
(Category) Course Name (Hrs/week)
3 0 2 6 11 3 0 1 4
Basic Electrical Component ISE MSE ESE Total
Engineering
Theory 75 75 150 300
ET101
Pre-requisite Course Codes, if any. Basic concepts of electric charge, current, voltage and
power
Course Objective: Course Objective: To impart a basic knowledge of electrical quantities, Circuits
and components.
ET101.1 Compute various electrical quantities of given dc circuit using circuit simplification
techniques and various network theorems.
ET101.2 To expose the students to different terms and concepts in AC Circuits at fundamental
frequency and to expose them to basics of effects of harmonics in the waveforms
ET101.3 To study the working principles of electrical machines and their applications
ET101.4 To expose the students the fundamental concepts in Controllable Switch and
Modulation based Power Conversion
ET101.5 To study Electrical Parameters of the Batteries and their selection and design criteria
for a specific application

ET101.1
ET101.2
ET101.3
ET101.4
ET101.5

ET101.1
ET101.2
ET101.3
ET101.4
ET101.5


Theory Component
Mod
Unit Hr
ule Topics Ref.
No. s
No.
1 Title DC Circuits 1,2
1.1 Electrical circuit elements (R, L and C), Voltage and current sources, 10
Equivalent resistance of circuits, Simplification using delta-star and
star-delta transformation.
1.2 Kirchoff’s current and voltage laws, Analysis of simple circuits with dc
excitation. Mesh analysis, Superposition, Thevenin, Norton and
Maximum Power Transfer Theorems
1.3 Time-domain analysis of first-order DC Transients in RL and RC
circuits.
2 Title AC Circuits 1,2 12
2.1 Representation of sinusoidal waveforms, peak and rms values, phasor
representation, real power, reactive power, apparent power, power
factor. Harmonics, Total Harmonic Distortion, Power supplied by
Harmonic voltages and currents, Power factor in case of non-
sinusoidal waveforms.
2.2 AC Analysis of series and parallel RLC Circuits with Resonance,
Concept of Bandwidth and Q-factor,
2.3. Three-phase balanced circuits, voltage and current relations in star
and delta connections.
3 Title Electromagnetic and Electro-Mechanical Energy Converters 1,2 10
3.1 Magnetically Coupled Coils, Self and Mutual Inductance and Dot
Convention
3.1 Single Phase Transformer: Principle of Operation, Equivalent Circuits
3.2 Single Phase Transformer: Efficiency and Regulation
3.3 Introduction to Three-phase Transformers and Applications
3.4 Fundamental Principles of Rotating Machines, Characteristics of
Induction motor and DC motor
4 Title Electric Power Converters 1,2 05
4.1 Fundamental Principles of Buck, Boost and buck-boost DC-DC
converters and their Transfer Characteristics, Duty Ratio Control
4.2 Single-phase voltage source inverters and PWM
5 Title Batteries: Electrical Characteristics and Applications 05

5.1 Introduction to type of Batteries, Generalized Battery parameters

such as SoC, DoD, Energy and Power Densities, Battery C-rating, etc.
Comparison of Batteries, Charging and Discharging Characteristic
5.2 Selection and Sizing of Battery Packs for Specific Applications
6 Self Components of LT Switchgear: Switch Fuse Unit (SFU), MCB, ELCB, 6*
Study MCCB, Types of Wires and Cables, Earthing. Elementary calculations
for energy consumption and power factor improvement.
Total (*Not Included) 42

Introduction to Electrical Measuring instruments, Lamp Loads, Inductor Loads and
01
Capacitor Bank
02 Verification of Star-Delta and Delta-star Transformation with Kirchhoff’s Laws
03 Verification of Thevenin’s Norton’s and Maximum Power Transfer Theorem
04 Verification of DC Transient equations in RL and RC Circuits
Experimental study of single-phase AC circuit with R-L and R-C Load with Measurement
05
of Power and Power factor
Experimental study of R-L-C series Resonance. To plot resonance curve, To compute
06
Bandwidth and Q-factor
07 Experiment on Magnetic Circuit Fundamentals
Loading of a transformer: measurement of primary and secondary voltages and
08
currents, and power. To compute efficiency and regulation.
Three-phase transformers: Star and Delta connections. Voltage and Current
relationships (line-line voltage, phase-to-neutral voltage, line and phase currents).
09
Phase-shifts between the primary and secondary side. Cumulative three-phase
power in balanced three-phase circuits.
Synchronous speed of two and four-pole, three-phase induction motors. Direction
reversal by change of phase-sequence of connections. Torque-Slip Characteristic
10
of an induction motor. Generator operation of an induction machine driven at
super-synchronous speed.
11 Demonstration of (a) dc-dc converters (b) dc-ac converters – PWM waveform.
12 Demonstration of V/F control of Induction motor
13 Experimental study of charge and Discharge characteristics of a Lead-acid Battery
14 Introduction to L.T. Switch gear

Text Books

D.P. Kothari and I.
1 Basic Electrical Engineering Third Tata McGraw Hill 2010
J.
Twenty
2 Electrical Technology B.L.Theraja S. Chand Publications 2003
Third
Reference Books
Sr. No Title Edition Author Publisher Year
1 Basic Electrical Engineering Second D.C. Kulshreshtha McGraw Hill 2019

Fundamentals of Electrical Oxford University
2 Second L.S. Bobrow 2011
Engineering Press
Electrical and Electronics
3 Third E. Hughes Pearson 2010
Technology
Electrical Engineering
4 Second V.D. Toro Prentice Hall India 1989
Fundamentals
Elements of Power Oxford University
5 Second P. T. Krein 2015
Electronics Press
Power Electronics: Ned Mohan, T.M
John Wiley and
6 Converters, Application Second Undelands and W P 1995
Sons. Inc.
and Design Robbins
A. E. Fitzgerald, C.
2003
7 Electric Machinery Sixth Kingsley and S. D. McGraw-Hill
Umans


2 0 2 3 7 2 0 1 3
Problem Solving using
OOP
Theory -- -- -- --
CS102
Pre-requisite Course Codes, if any. Problem Solving using Imperative Programming

Course Objective: To learn problem solving using Object-Oriented programming paradigm
CS102.1 Apply concepts of object oriented programming using classes and objects
CS102.2 Apply Inheritance for a given scenario
CS102.3 Apply polymorphism for solving a given problem
CS102.4 Apply abstraction and exception handling to create efficient program.
CS102.1
CS102.2
CS102.3
CS102.4

CS102.1
CS102.2
CS102.3
CS102.4

Theory (This course content delivery will be in C++/Java. Course Contents to be taken care
accordingly)
Module Unit
Topics Ref. Hrs.
No. No.
Introduction and Encapsulation 8
1.1 Introduction to Object Oriented Programming, Procedural verses 1,2
Object Oriented Programming, Principles, Benefits and
1 applications of Object Oriented Programming.
1.2 Encapsulation: Problem solving with Objects and Classes
1.3 static data member and methods, constructors and their types.
Types of functions and keywords, Strings, Arrays
Inheritance 6
2.1 Concept of Inheritance, parent class, derived class, base class and 1,2
derived class constructor
2
2.2 Types of inheritance: single, multiple, multilevel, hierarchical,
hybrid
2.3 Aggregation and Composition
Polymorphism 6
3.1 Static Polymorphism: Method overloading and Constructor 1,2
3 overloading
3.2 Dynamic Polymorphism: Method overriding
3.3 Data conversion
Abstraction 2
4
4.1 Abstraction: abstract class 1,2
Exception Handling 6
5 5.1 try, throw, and catch exceptions 1,2
5.2 Function exception declaration
Self File Handling, 1,2 5*
6 Study $ STL, $pointers, $virtual functions
@Multithreading, @Packages, @interface
28+
Total
5*
$ only for C++

@ only for Java
** Language used: C++ for Etrx and Extc Branch

** Language used: C++/Java for IT and CE Branch


1 Program on Encapsulation: Write a program to demonstrate classes and objects
2 Program on Encapsulation: Write a program to demonstrate constructor
3 Program on Polymorphism: Implement a Program to demonstrate method overloading,
4 Program on Polymorphism: Implement a Program to demonstrate constructor
overloading
5 Program on Polymorphism: Implement a Program to demonstrate method overriding
6 Program on Inheritance: Implement a Program to demonstrate single, multilevel
Inheritance
7 Program on Inheritance: Implement a Program to demonstrate multiple Inheritance
8 Program on Abstraction: Implement a Program to demonstrate Abstraction using
abstract class
9 Program on Abstraction: Implement a Program to demonstrate multithreading/ STL
10 Program to demonstrate File Handling
Text Books

Object Oriented Tata McGraw
1 Sixth E Balagurusamy 2017
Programming with C++ Hill
Oriented Programming in
2 Fourth Robert Lafore Galgotia 2001
Turbo C++
Java -The Complete Tata McGraw-
3 Tenth Herbert Schildt 2017
Reference Hill
Java Programming From the Ralph Bravaco,Shai Tata McGraw-
4 First 2009
Ground Up Simoson Hill
Reference Books

Tata McGraw
1 The Compete Reference C++ Fourth Herbert Schlitz 2017
Hill
An introduction to
Jaime Nino, Wiley Student
2 Programming and Object Third 2010
Frederick A. Hosch Edition
Oriented Design using Java

Course
0 0 2 0 02 0 0 1 1
Skill Shop Component ISE MSE ESE Total
Theory -- -- -- --
AS106

Course Objective: To equip the students with the fundamental skills involved in the creation of
simulated and physical design.
AS106.1 Operate basic electronic equipment and instruments.
AS106.2 Make PCB designs in simulations.
AS106.3 Assemble, disassemble and troubleshoot computer hardware and network
peripherals.
AS106.4 Fabricate basic jobs in traditional trades.
AS106.5 Design a 3D model and translate it to a 3D printed component.

AS106.1
AS106.2
AS106.3
AS106.4
AS106.5

AS106.1
AS106.2
AS106.3
AS106.4
AS106.5

Lab Component
Trade Unit
Topics Ref. Hrs.
No. No.
1 Unit 1 Electronic Components 5
1.1 Introduction to Electronic Components 4
Exposure to usual electronic equipment/instruments such as
Multi-meter, Oscilloscope, Function generator, IC tester and
Power supply, Information about their front panels,
Demonstrations on their working, Hands-on for measurement
of component values and DC voltage using multi-meter, AC
mains voltage/1 KHz Square wave/any small signal from
function generator on Oscilloscope, Testing of sample digital ICs
using IC tester.
OR
Repairing of gadgets and appliances:
Elementary skills of repairing juicer, mixer, grinder, etc.
2 Unit 2 PCB Laboratory Exercises 6
2.1 Layout drawing, Positive and negative film making, PCB etching 4
and drilling, Tinning and soldering technique.
3 Unit 3 Hardware and Networking 7, 8 4
3.1 Dismantling of a Personal Computer (PC), Identification of
Components of a PC such as power supply, motherboard,
processor, hard disk, memory (RAM, ROM), CMOS battery, CD
drive, monitor, keyboard, mouse, printer, scanner, pen drives,
disk drives etc.
3.2 Assembling of PC, Installation of Operating System and Device
drivers, Boot-up sequence. Installation of application software
(at least one).
3.3 Basic troubleshooting and maintenance.
3.4 Identification of network components: LAN card, wireless card,
switch, hub, router, different types of network cables (straight
cables, crossover cables, rollover cables) Basic networking and
crimping.
4 Unit 4 Traditional Trades* 1, 2 4
Carpentry
Use and setting of hard tools like hacksaws, jack planes, chisels
and gauges for construction of various joints, wood turning and
modern wood turning methods. One carpentry job involving a
joint and report on demonstration of a job involving wood
turning required for successful completion of module.
OR
Electrical board wiring

House wiring, staircase wiring, and wiring diagram for

fluorescent tube light, Godown wiring and three phase wiring
for electrical motors.
OR
Sheet Metal Practice
Introduction to primary technology processes involving
bending, punching and drawing various sheet metal joints,
development of joints. Utility job in sheet metal required for
successful completion of module.
5 Unit 5 3D Modeling and Printing 3, 4 4
5.1 Modeling approaches for ideation and creation. Developing a
CAD file (.iges/.step/.dwg) of a 3D model and export it as an .stl
file for the purpose of 3D printing. Importing the 3D .stl file to
generate a .gcode file for 3D printing through slicing, using open
source software.
5.2 Introduction to 3D printing: methodologies, best practices,
material and model variation. Live printing sessions of
generated .gcode files in real time with optimal parameters and
troubleshooting.
Total 20
* Students can opt for any one of the three trades from Unit 4.
Text Books:
Sr.
No.
1 Workshop Manual Sixth Venkat Reddy BS Publication 2008
Wiring Simplified: Based Forty Frederic P Hartwell, Park Publishing 2017
2 on 2017 National Fifth Herbert P. Richter, W.C.
Electrical Code Schwan
Reference Books:
Sr. Title Edition Authors Publisher Year
No.
3 Autocad 2017 First ShyamTikoo Dreamtech Press 2016
4 Ultimaker 2+ reference manual - - Ultimaker 2017
5 Encyclopedia of Electronic First Charles Platt O Reilly 2012
Components
6 Printed Circuit Boards First Khandpur R.S. Tata McGraw Hill 2005
7 Troubleshooting Your PC For Second Gookin Dan For Dummies 2005
Dummies
8 Networking For Dummies Eighth Lowe Doug For Dummies 2007

Sem III
1 BSC MA203 Probability and Statistics 3 0 0 5 08 3
1 BSC* MA202 Foundation of Mathematics-I* 3 0 0 6 09 3
2 PC CS201/IT201 Discrete Structures and Graph 3 0 0 4 07 3
Theory
3 PC CS202/IT202 Data Structures 3 0 2 5 10 4
4 PC CS203/IT203 Computer Architecture and 3 0 2 4 09 4
Organization
5 PC CS204/IT204 Database Management Systems 3 0 2 5 10 4
6 ABL SVXX/STXX SEVA II or III /SATVA II or III 0 0 0 3 03 1
7 HSSE HSEX1 HSS-I 2 0 0 3 05 2
TOTAL 17 0 6 29 52 21
*Only for Lateral Entry Students
Sem IV
1 BSC MA201 Linear Algebra 2 0 2 5 09 3
1 BSC* MA204 Foundation of Mathematics-II 3 0 0 6 09 3
2 PC CS205/IT205 Design and Analysis of Algorithms 3 0 2 5 10 4
3 PC CS206/IT206 Operating Systems 3 0 2 5 10 4
4 PC CS207/IT207 Computer Communications and 4
3 0 2 5 10
Networks
5 SBC CS208/IT208 Mini Project-I 0 0 0 4 04 2
6 ABL SVXX/STXX SEVA II or III /SATVA II or III 0 0 0 3 01 1
7 HSSE HSEX2 HSS-II 2 0 0 3 05 2
8 SBC AS201 Professional Communication Skills 1 0 2 2 05 2
9 S/M SCX1/MNX1 SCOPE-I/Minor-I 3
TOTAL 14 0 10 32 56 22
*Only for Lateral Entry Students
Second Summer for HSC students

1 MLC AS202 Constitution of India 06 06 NC
Second Summer (For Lateral Entry Students)

1 BSC MA201 Linear Algebra 2 0 2 5 09 3
1 BSC MA203 Probability and Statistics 3 0 0 5 08 3
2 MLC AS202 Constitution of India 06 06 NC

Semester-III


Credits Assigned
3 0 0 4 7 3 0 0 3
(PC) Discrete Examination Scheme
Structures and Component ISE MSE ESE Total
Graph Theory Theory 75 75 150 300
CS201/IT201

Course Objective: To teach students how to think logically and mathematically. It provides the
mathematical foundation that is used in most areas of computer science.
XXXXX.1 Solve problems using set theory, logic and its various proof techniques.
XXXXX.2 Apply the concepts of relations, functions, lattices and recurrence relations to
solve problems
XXXXX.3 Apply the concepts of graph, trees and their various types with their traversing
techniques to solve problems.
XXXXX.4 Apply the basics of coding theory and cryptography to solve real world problems.

0 1 2
XXXXX.1
XXXXX.2
XXXXX.3
XXXXX.4

XXXXX.1
XXXXX.2
XXXXX.3
XXXXX.4

Remember Understand Apply  Analyze Evaluate Create

Theory Component
Module Unit
Topics Ref. Hrs.
No. No.
1 Title Set Theory, Logic and Proofs 1, 2
1.1 Finite and infinite set, Union, Intersection, Disjoint, and 2
Difference of two sets. Power Set, Partition of Sets, Ordered
Sets, De Morgan’s Laws, Principle of Inclusion Exclusion
1.2 Predicates, Propositions, Conditional Propositions, Logical 6
Connectivity, Proposition calculus, Universal and Existential
Quantifiers, First order logic, Equivalence, Normal Forms,
Introduction to proofs, Mathematical Induction, Strong
Induction, Well-ordering principle, Logical inference
2 Title Relations, Functions and Lattices 1, 2
Product Sets and Partitions, Paths in relations and Diagraphs, 8
Properties of Relations, Closure of Relation, Equivalence
2.1 Relations, Operations on Relations, Warshall’s Algorithm,
Partially Ordered Sets, External Elements of Partially Ordered
Sets, Hasse Diagram
Composition of Functions, Invertible Functions, Recursive 3
2.2
Functions, Hashing, Pigeon hole Principle, Extended PHP
Lattice, Sub lattice, Isomorphic Lattices, Properties of Lattice, 4
2.3
Special Types of Lattices
Recurrence Relations – Introduction, Linear Recurrence Relations 5
with constant coefficients, Homogeneous solutions, Particular
2.4
Solutions, Total Solutions, Solution by the method of Generating
functions, solving Recurrence Relations
3 Title Graph Theory 1, 2 4
3.1 Concepts and terminologies, Graphs as Model (Konigsberg
Bridge Problem)
3.2 Matrices, Isomorphism, Bipartite Graphs, Directed Graphs
3.3 Minimal Spanning Trees-Prim’s Algorithm and Kruskal’s
Algorithm
4 Title Graph connectivity 1, 2 6
4.1 Cycles – Transport Networks, Max Flows, Matching Problems,
Maximum Bipartite Matching, Perfect Matching
4.2 Euler Paths- Circuits, Hamiltonian Paths- Circuits
4.3 Coloring Graphs, Chromatic Polynomial, Planer Graphs
5 Title Coding Theory 1, 2 4
5.1 Hamming Code, Minimum Distance
5.2 Number Theory, Modular Arithmetic and applications to
cryptography; Diffie-Hellman Algorithm

6 Self- Algebraic Structures - Semi group, Monoids, Groups, Cyclic 1, 2 5*

Study groups, Abelian groups, Normal Subgroups
Text Books

1 Discrete Mathematics Seventh Kenneth H. Rosen Tata McGraw- 2013
and it's applications Hill
2 Discrete Sixth Bernad Kolman, Pearson 2015

Mathematical Robert Busby, Education
Structures Sharon Cutler Ross,
Nadeem-ur-Rehman
Reference Books

1 Elements of Discrete Fourth C. L. Liu Tata McGraw- 2012
Mathematics Hill
2 Introduction to graph Second Douglas B. West Pearson 2015

Theory Education
3 Discrete Mathematical First Jean-Paul, Tata McGraw- 1987
Structures with Tremblay R. Hill
Applications to Manohar
Computer Science


(Category) Course Name L T P O E L T P Total
Code
2 1 0 0 3 2 1 0 3
Foundations of Component ISE MSE ESE Total
Mathematics-I
Theory 75 75 150 300
MA202
Pre-requisite Course Codes, if any. -

Course Objective: To develop basic foundation of mathematical skills.
MA202.1 Differentiate a function of one variable and partially differentiate a function of more
than one variable.
MA202.2 Apply the concept of partial differentiation to find extreme values of a given
function.
MA202.3 Find nth order derivative of a given function.
MA202.4 Expand a given function as a power series.
MA202.5 Perform operations on matrices and find inverses and determinants of them.
MA202.6 Perform vector operations and compute dot products and cross products between
them.

MA202.1
MA202.2
MA202.3
MA202.4
MA202.5
MA202.6

MA202.1
MA202.2
MA202.3
MA202.4
MA202.5
MA202.6

Theory Component
Module Unit
Topics Ref Hrs.
No. No.
1 Title Differential Calculus 1,2 18
1.1 Partial fractions. Derivatives of standard functions, product and 04

quotient rule for differentiation.
1.2 Partial derivatives of first and higher order, composite 03
differentiation
1.3 Application of partial derivatives: Local Maxima and Minima of 02
functions of two variables.
1.4 Successive Differentiation: Proofs of nth derivatives of standard 05
functions. Use of partial fractions to calculate nth derivatives of
given functions. Leibnitz theorem for nth derivative of product of
two functions.
1.5 Infinite series: expansion of functions in powers of x using 04
maclaurin series. Taylor’s series.
2 Title Matrices 1,2 07
2.1 Addition and scalar multiplication of matrices. Matrix 03
multiplication, types of matrices.
2.2 Elementary row transformations, finding inverses using matrices, 04
determinants and its properties
3 Title Vectors 1,2 03
3.1 Vector definition, addition, scalar multiplication, dot product of 03
two vectors, angle between two vectors, cross product.
Total 28
Text Books
1 Higher Engineering Forty Forth Dr. B. S. Grewal Khanna Publications 2020
Mathematics
Reference Books
1 Advanced Engineering Tenth Erwin John Wiley & Sons 2011
Mathematics Kreysizg
2 Advanced Engineering Twenty H.K.Dass S. Chand Publications 2014
Mathematics Eighth


3 0 0 5 8 3 0 0 3
(BSC) Probability Examination Scheme
and Component ISE MSE ESE Total
Statistics Theory 75 75 150 300
MA203

Course Objective: To give an exposure to the students the basic concepts of Probability and
Statistical methods and their application.
MA203.1 Familiarize with basic probability axioms, rules and their applicability.
MA203.2 Identify the characteristics of various discrete and continuous distributions.
MA203.3 Find unbiased and efficient estimates using estimation theory.
MA203.4 Test the hypothesis for means and variances using‘t’& F; chi-square distribution
tests.
MA203.5 Find Correlation and Regression and fit different types of curves.

MA203.1
MA203.2
MA203.3
MA203.4
MA203.5

MA203.1
MA203.2
MA203.3
MA203.4
MA203.5


Theory Component
Module Unit
Topics Ref. Hrs.
No. No.
1 Title Probability and Random Variables 1, 2 12
1.1 Classical, relative frequency and axiomatic definitions of 04
probability, addition rule and multiplication rule. Conditional
Probability, Bayes’ theorem and independence.
1.2 Discrete, continuous and mixed random variables, probability 04
mass function(PMF), Probability Density Function(PDF) and
cumulative distribution function(CDF). Joint Distributions: Joint,
marginal and conditional distribution.
1.3 Mathematical expectation, moments, moments generating 04
function, Chebyshev’s inequality.
2 Title Probability Distributions 1, 2 12
2.1 Standard discrete distributions: Bernoulli, Binomial, Poisson and 06
Geometric distributions, Probability density function, Cumulative
distribution function, Expectation and Variance,
2.2 Standard continuous distributions – Uniform, Normal, 06
Exponential, Joint distribution and Joint density functions
3 Title Test of Hypothesis and Significance 1, 2 12
3.1 Statistical hypothesis, Null and Alternate hypothesis, test of 03
hypothesis and significance, Type I and Type II errors, Level of
Significance, Tests involving the Normal distribution, One-Tailed
and Two-Tailed tests, P value.
3.2 Special tests of significance for Large samples and Small samples 09
(F, chi- square, z, t- test), ANOVA.
4 Title Correlation and Regression 1, 2 06
4.1 Correlation, Rank correlation, Regression Analysis, Linear and
Non-linear Regression, Multiple regressions, Curve fitting by
method of least squares, fitting of straight lines, Polynomials,
Exponential curves.
5 Self 1. Applicability of Bayes theorem 01*
Study 2. Proofs for mean & variance for all distribution: included in 02*
module 2
3. Examples to test goodness of fit using Chi-square 02*
Total 42
* Not included in Total 42 hrs.

Text Books

Introduction to Probability and
Academic
1 Statistics for Engineers and Fourth Sheldon M. Ross 2011
Foundation
Scientists
E. Walpole, R. H.
Probability and Statistics for Pearson
2 Eighth Mayers, S. L. Mayers 2007
Engineers and Scientists Education
and K. Ye
Reference Books

Probability and Statistics in Fifth
1 Douglas C. Montgomery Wiley India 2012
Engineering
Third Spiegel, M. R., Schiller, J. Tata McGraw
2 Probability & Statistics 2010
and Srinivasan, R. A. Hill


Credits Assigned
3 0 2 5 10 3 0 1 4
(PC) Examination Scheme
Data Structures Component ISE MSE ESE Total
Theory 75 75 150 300
CS202/IT202
Pre-requisite Course Codes, if any. 1. Problem solving using imperative programming

Course Objective: To introduce the fundamentals and abstract concepts of Data Structures for
Problem Solving.
XXXXX.1 Apply various operations of linear and non-linear data structures to given problems.
XXXXX.2 Apply the concepts of Trees and Graphs to a given problem.
XXXXX.3 Apply various operations of heap data structures.
XXXXX.4 Apply the concepts of hashing on a given problem

XXXXX.1
XXXXX.2
XXXXX.3
XXXXX.4

XXXXX.1
XXXXX.2
XXXXX.3
XXXXX.4

Remember Understand Apply Analyze Evaluate Create

Theory Component
Module Unit
Topics Ref. Hrs.
No. No.
1 Title Introduction to Data Structures
1.1 Concept of Linear and Non linear Data Structures 1,2 1

1.2 Stack: Stack as ADT, operations on stack,, Applications of Stacks 1,2 4
1.3 Queue: Queue as ADT, Operations on Queue,, Applications of 1,2 4
Queue , Types of Queue-Circular and Priority Queue
1.4 Linked List: Linked List as ADT, Operations on Singly Linked List. 1,2 6
Types of linked list- Linear and circular linked lists, Doubly Linked
List, Circular Linked List and its operations, Generalized Linked
List (GLL) concept , Applications of linked List and Generalized
Linked List (GLL).
2 Title Trees
2.1 Trees as ADT, General tree v/s Binary Tree Terminology, 1,2 5
Traversal of Binary Tree, Operations on Binary tree, Binary
Search Tree and its operations, Expression Tree
2.2 AVL Trees- Properties of AVL trees, Rotations, Insertion, and 1,2 4
Deletion
2.3 Introduction to B tree- Insertion , Deletion. 1,2 3
3 Title Graphs
3.1 Graph as ADT, Introduction To Graph, Representation of Graph- 1,2 3
Adjacency Matrix, Adjacency List, Graph Traversal Technique
4 Title Heap Structure
4.1 Heap as ADT, Introduction to Heap Structures, Min Heap, Max 1,2 3
Heap, Construction of Heap
4.2 Fibonacci heaps- Structure of Fibonacci heaps, Mergeable-heap, 1,2 5
operations, Decreasing a key and deleting a node
5 Title Hashing
5.1 Introduction to Hash Table, Hash functions, Collision Resolution 1,2 4
Technique.
6 Self Optimal Binary Search Tree and Red-Black Trees 1,2 5*
Study
Total 42

Laboratory Component, if any (Minimum 10 Laboratory experiments are expected)

1 Implement a given problem statement using Stack.
2 Implement a given problem statement using Queue
3 Implement a given problem statement using Linked List.
4 Implement a given problem statement using Doubly Linked List.
5 Implement a given problem statement using Binary Trees.
6 Implement insertion of node in AVL tree.
7 Implementation of expression tree
8 Implement Operations of Heap Structures.
9 Implement hash functions with different collision resolution techniques.
10 Apply Graph Traversal Technique on a given problem statement to solve the problem
Text Books

1 Introduction to Third Thomas H. Cormen, Charles E. MIT Press 2009
Algorithms Leiserson, Ronald L Rivest,
Clifford Stein
2 Fundamentals of Second Horowitz E, Sahni S and Galgotia 2010
Computer S.Rajasekaran Publications
Algorithms
Reference Books

1 Classic Data Second Samanta Debasis PHI 2009
Structures
2 Data Structures First Seymour Lipschutz Schaum's Outline 2010
With C Series

Teaching Scheme
Course(Category) Credits Assigned
Course Name (Hrs/week)
Code
L T P O E L T P Total
3 0 2 4 9 3 0 1 4
(PC) Computer Examination Scheme
Architecture and Component ISE MSE ESE Total
Organization Theory 75 75 150 300
CS203/IT203
Pre-requisite Course Codes, if any. Digital Circuits & Systems, Any Programming Language
Course Objective: Imparting concepts of each component of computer architecture thoroughly
with practical aspects including memory systems and I/O communications with interfacing
Course Outcomes (CO): At the End of the course students will be able to
XXXXX.1 Explain basic computer structure and compare computer architecture models
XXXXX.2 Design algorithms to solve ALU operations and memory mapping techniques
XXXXX.3 Comprehend processor architecture with various design methods of CPU with
comparative analysis
XXXXX.4 Illustrate memory systems with design and analysis of mapping techniques for cache and
virtual memory
XXXXX.5 Analyze different parallel processing and pipelining concepts with pipelining hazards
XXXXX.6 Comprehend different types of I/O buses , compare and contrast different types of data
transfer methods and arbitration techniques

XXXXX.1
XXXXX.2
XXXXX.3
XXXXX.4
XXXXX.5
XXXXX.6
XXXXX.1
XXXXX.2
XXXXX.3
XXXXX.4
XXXXX.5
XXXXX.6


Remember Understand Apply Analyze  Evaluate Create
Theory Component
Module Unit
Topics Ref. Hrs.
No. No.
1 Title Overview of Computer Architecture and Organization
1.1 Introduction of Computer Organization and Architecture, Basic 1 5
organization of computer and block level description of the
functional units, Evolution of x86 Computers, Von Neumann
model, Harvard Model, Embedded system
1.2 Performance Issues: Designing for performance, Amdahl’s Law, 1
Multi-core, GPGPU
2 Title Data Representation and Arithmetic Algorithms 6
2.1 Number representation: Floating-point representation, 2,3
Floating point arithmetic, IEEE 754 floating point number
representation
2.2 Integer Data computation: Addition, Subtraction. 2,3
Multiplication: Signed multiplication, Booth’s algorithm.
2.3 Division of integers: Restoring and non-restoring division 2,3
3 Title Processor Organization and Control Unit 9
3.1 CPU Architecture, Register Organization 1,2,4
Instruction formats, basic instruction cycle. Instruction
interpretation and sequencing,
Case Study of 8086 architecture and Register Organization
3.2 Control Unit: Soft wired (Micro-programmed) and hardwired 2,4
control unit design methods. Microinstruction sequencing and
execution. Micro operations
3.3 RISC and CISC: Introduction to RISC and CISC architectures and 2,4
design issues.
4 Title Memory Organization 11
4.1 Introduction to Memory and Memory parameters. 1,2
Classifications of primary and secondary memories. Types of
RAM and ROM, Allocation policies, Memory hierarchy and
characteristics.
4.2 Cache memory: Concept, architecture (L1, L2, L3), mapping 1,2
techniques. Cache Coherency, Interleaved and Associative
memory.
4.3 Virtual Memory: Concept, Segmentation and Paging, Page 1,2,4
replacement policies
5 Title I/O Organization and Introduction to Parallel Processing 11
5.1 Buses: Types of Buses, Bus Arbitration, BUS standards 2

5.2 I/O Interface, I/O channels, I/O modules and IO processor, 1,2
Types of data transfer techniques: Programmed I/O, Interrupt
driven I/O and DMA.
5,3 Introduction to parallel processing concepts, Flynn’s 1,2,4
classifications, pipeline processing, Pipeline stages, Pipeline
Hazards
6 Self Comparative Study of microprocessors and micro architectures Ref. 6*
Study with respect to their important features. 8086 instructions and 2,5,6
assembler directives with addressing modes with memory
interfacing techniques. Cache memory protocol and virtual
memory concepts in Pentium processors. Vector and Array
Processors with VLIW architecture.
Total (* Not included) 42

1 Implement various Arithmetic Operations through Assembly Language Programming
for microprocessor 8086 (MASM)
2 Simulate the operation of COPY and PASTE in 8086 (MASM)
3 Implement various String Operations in 8086 through the utilities provided by DOS
interrupts (MASM)
4 Generation of alphabetic arrangement of a given string in 8086 (MASM)
5 Design password application (generation and detection) in 8086 (MASM/C)
6 Design of Carry Look Ahead Adder
7 Implement Booth’s Multiplication Algorithm
8 Implement Division Algorithm (Non-Restoring and Restoring)
9 Implement Mapping techniques of Cache memory
10 Implement Page Replacement Policies
Text Books
1 Computer Organization Fifth Carl Hamacher, Zvonko Tata 2002
Vranesic, Safwat Zaky McGraw-Hill
2 Computer Organization Eighth William Stallings Pearson 2010
and Architecture:
Designing for Performance
3 Computer System Third M, Morris Mano Pearson 2007
Architecture
4 Computer Architecture & Third John P. Hayes McGraw-Hill 1998
Organization

Reference Books

Structured Computer Andrew S.
1 Sixth Pearson 2013
Organization Tanenbaum
Microprocessor and Interfacing: Tata-
2 Third Douglas V Hall 2012
Programming & Hardware McGraw Hill
Computer Architecture and

3 Organization: Design Principles Second B. Govindarajulu McGraw Hill 2017
and Applications
Programmer’s reference Manual
4 First Steven Armburst McGraw Hill 1986
for IBM Personal Computers
Don Anderson, Tom Addison-
Pentium Processor System
5 Second Shanley, MindShare Wesley 1995
Architecture
Inc, MindShare, Inc Professional
Modern Processor Design: John Paul
Waveland
6 Fundamentals of Superscalar Second Shen , Mikko H. 2013
Press Inc.
Processors Lipasti

Course
3 0 2 5 10 3 0 1 4
Database Component ISE MSE ESE Total
Management systems
Theory 75 75 150 300
CS204/IT204

Course Objective: To efficiently and effectively Design, develop, maintain and retrieve the
Information from DBMS.
XXXXX.1 Demonstrate understanding of given system to construct a database model.
XXXXX.2 Apply various Relational and SQL commands on the populated database.
XXXXX.3 Examine the functional dependencies to make a normalized database system.
XXXXX.4 Examine transaction processing techniques on a database.
XXXXX.5 Illustrate query processing and optimization method on a database.

XXXXX.1
XXXXX.2
XXXXX.3
XXXXX.4
XXXXX.5

XXXXX.1
XXXXX.2
XXXXX.3
XXXXX.4
XXXXX.5

Remember Understand Apply Analyze  Evaluate Create

Theory Component
Module Unit
Topics Ref. Hrs.
No. No.
1 Title Introduction: Database Concepts and ER Modeling 1,2
1.1 Introduction to basic concept of Database, Characteristics of 09
databases, File system V/s Database system, Users of Database
system, Database Administrator, Data Independence, Codd’s Rule,
DBMS system architecture.
1.2 Introduction to ER model, Benefits of Data Modeling, Types of
data Models, Phases of Database Modeling, The Entity-
Relationship (ER) Model, Extended Entity-Relationship (EER)
Model
2 Title Relational Algebra and SQL 1,2 16
2.1 Introduction, Mapping the ER and EER Model to the Relational
Model, Relational Algebra: Overview, Basic Operators, Extended
Operators
2.2 Overview of SQL, Data Definition Commands, Data Manipulation
commands, Data Control commands, Set operations, aggregate
function, null values, Views in SQL, Subquery, Trigger, stored
procedure
3 Title Normalization 1,2 06
3.1 Design guidelines for relational schema, Functional dependencies
3.2 Normal Forms- 1NF, 2 NF, 3NF, BCNF and 4NF,5NF

4 Title Transaction Processing and Recovery 1,2 07
4.1 Transaction concept, Transaction states, ACID properties,
Implementation of atomicity and durability, Concurrent
Executions, Serializability, Recoverability, Lock-based, Timestamp-
based, Validation-based protocols.
4.2 Shadow paging, Deadlock handling.
5 Title Introduction to Query Processing and Query Optimization 1,2 04
5.1 Basics of Query Processing, Measures of Query Cost
5.2 Query Optimization: Equivalence Rules, Pictorial representations
6 Self 1. Relational Calculus-Information retrieval 1,2 5*

Study 2. NO SQL-Data type, Database creation, Basic command for
creation, updating and querying the database, Mongo dB

Laboratory Component:
Assign a case study for group of 2/3 students and each group will perform following
experiments on the case study.
Exp No. Title of the Experiment
Formulate a case study and create an E-R Diagram.
1
Mapping of E-R model to Relational Model.
To create a database and populate using SQL commands (With constraints)
 Data Definition Language- Create, Alter, Drop, Rename, Truncate
2  Data Manipulation Language- Insert, Update, Delete, Select
 Constraints-Not Null, Unique Key, Primary Key, Foreign Key, Check, Dropping
a Constraint.
To perform DCL, TCL commands
3  Data Control Language: Grant, Revoke, Roles
 Transaction Control Language: Commit, Rollback, Save point
4 To perform Date, Time, Arithmetic and Set operation on database.
5 To perform Aggregate function and Group by- Having clause on database
To perform Join operations on database.
6
 Equijoins, Non-Equijoins, Self Joins, Outer Join, cross Join
7 To retrieve a data using Subquery.
8 To Create a different view of database.
9 To examine integrity of database using Triggers.
10 To improve performance of system using stored procedure.
Textbooks

Database System Seventh Korth, Slberchatz, McGraw – 2019
1
Concepts Sudarshan Hill
Fundamentals of Sixth Elmasri and Navathe PEARSON 2011
2
Database Systems Education
Reference Books

Database Management Raghu Ramkrishnan and
1 Third TMH 2003
Systems Johannes Gehrke
Database Management McGraw –
2 First G. K. Gupta 2018
Systems Hill.
SQL, PL/SQL programming
3 Forth Ivan Bayross BPB 2010
language of ORACLE

Semester-IV


Code
2 0 2 5 9 2 0 1 3
Linear Algebra Component ISE MSE ESE Total
Theory 50 50 100 200
MA201
Pre-requisite Course Codes, if any. Engineering Calculus/Foundation of Mathematics-I and

Differential Equations and Complex Analysis/Foundation of
Mathematics-II
Course Outcomes (CO):At the End of the course students will be able to:
MA201.1 Solve a homogeneous and non-homogeneous system of linear equations using rank of
a matrix.
MA201.2 Solve system of linear equations by Numerical Methods.
MA201.3 Solve equations in real life problems and to encode and decode messages using the
concept of matrices.
MA201.4 Identify whether given structures are vector spaces and subspaces and construct a
basis for them.
MA201.5 Show if a given matrix is diagonalisable or not.
MA201.6 Apply concepts of eigenvalues and eigenvectors to calculate functions of a square
matrix, google page rank vector and solve systems of differential equations using
diagonalisation of matrices.
PO PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
1
MA201.1
MA201.2
MA201.3
MA201.4
MA201.5
MA201.6


MA201.1
MA201.2
MA201.3
MA201.4
MA201.5
MA201.6
Theory Component
Module Unit
Topics Ref Hrs.
No. No.
1 Title Basics of matrices 3,5 03
1.1 Revision of basic matrices and types of matrices. 01

1.2 Row echelon form, Reduced Row Echelon form, Rank of a 02
matrix.
2 Title Linear equations & its solutions 1,2,3,5 07
2.1 Consistency and solution of simultaneous linear homogeneous 02
and non-homogeneous equations.
2.2 Application of solving systems of equations in traffic control. 01
2.3 Solution of system of linear algebraic equations, by 04
(1) Gauss Elimination Method
(2) Gauss Jordan method
(3) Gauss Jacobi Iteration method
(4) Gauss Seidel Method.
(5) LU Decomposition -Crout’s method
3 Title Vector spaces (over field of real numbers) 1,2,5 08
3.1 Vector space, subspace, span, linear dependence and 08
independence of vectors, basis, dimension, orthogonal
projection & gram-Schmidt process. Null space, row space,
column space, Rank-Nullity theorem (only statement). Least
square method.

4 Title Encoding & decoding using Matrices. 4 02

4.1 Application of matrices to Coding and Decoding 02
5 Title Eigenvalues and Eigenvectors 1,2,3,5 08
5.1 Eigenvalues, Eigenvectors and its properties. Cayley Hamilton 04
theorem and its applications. Diagonalisation of matrices.
Derogatory and Non-derogatory matrices.
5.2 Application to find google page rank. Functions of a square 04
matrix. Solving system of differential equations using
diagonalisation.
6 Self 1.2 Normal form. 1,2,3,5 05
Study 2.2 Forming equations using KVL for circuits and solving them
using matrices.
3.1 Singular Value Decomposition.
5.1 Additional properties with proofs of eigenvalues and
eigenvectors.
Total 28*
*Total of 28 hours does not include the self-study hours.

1 Introduction to Scilab (getting started) and its benefits to use as a mathematics tool.
2 Basic commands of Scilab and vectors & matrix operations.
3 Conditional branching and iterations using Scilab.
4 Solution of linear equations using row-echelon and inverse of a matrix.
5 Solutions of linear equations using Gauss Elimination method.
6 Solutions of linear equations using Gauss Jordan method.
7 Solutions of linear equations using Gauss-Jacobi method.
8 Solutions of linear equations using Gauss-Seidel method.
9 Solutions of linear equations using Crout’s method.
10 To find Eigenvalues and Eigenvectors using Scilab
Text Books
Sr.
No
1 Linear Algebra and its applications Fourth Gilbert Strang Cengage 2014
Dr. B. S. Khanna
2 Higher Engineering Mathematics Forty Fourth 2020
Grewal Publications

Reference Books

Pearson
1 Linear Algebra and its applications Third David. C. Lay 2006
Education
Elementary Linear Algebra H Anton and John Wiley
2 Sixth 2010
Application Version Crorres and Sons
Twenty
3 Advanced Engineering Mathematics H.K Das S.Chand 2014
Eighth
Jonaki B At Right
4 Hill Ciphers First 2015
Ghosh Angles
John Wiley &
5 Advanced Engineering Mathematics Tenth Erwin Kreysizg 2011
Sons


Code
2 1 0 0 3 2 1 0 3
Foundations of
Mathematics-II
Theory 75 75 150 300
MA204
Pre-requisite Course Codes, if any. Foundations of Mathematics-I

Course Objective: To develop basic foundation of mathematical skills.
Course Outcomes (CO):At the End of the course students will be able to: -
MA204.1 Integrate a function of one variable using various techniques
MA204.2 Sketch basic curves and solve double and triple integrals.
MA204.3 Solve basic problems using properties of complex numbers.
MA204.4 Solve differential equations of first order.
MA204.5 Apply the techniques of solving first order differential equations to electrical
engineering problems.
MA204.6 Solve differential equations of higher order
MA204.1
MA204.2
MA204.3
MA204.4
MA204.5
MA204.6

MA204.1
MA204.2
MA204.3
MA204.4
MA204.5
MA204.6


Theory Component
Module Unit
Topics Ref Hrs.
No. No.
1 Title Integral Calculus 13
1.1 Formulae for integral of standard functions, integration by parts, 04
integration by method of substitution.
1.2 Gamma functions, Beta functions. Differentiation under Integral 1,2 04
sign with constant limits and one parameter.
1.3 Standard curves (lines, circles, parabolas, ellipses). Concept of 05
double integration. Evaluation of double and triple integrals.
2 Title Complex Numbers 03
2.1 Operations on complex numbers, polar form of a complex 1,2 03
number, properties of a complex number.
3 Title Differential Equations 12
3.1 Exact differential equations. Linear differential equations of the 04
first order and equations reducible to linear.
1,2
3.2 Solving differential equations of first order in electrical networks. 01
3.3 Linear differential equations with constant coefficients: 07
complementary function and particular integral.
Total 28
Text Books

Higher Engineering Khanna
1 Forty Fourth Dr. B. S. Grewal 2020
Mathematics Publications
Reference Books

Erwin John Wiley &
1 Advanced Engineering Mathematics Tenth 2011
Kreysizg Sons
Twenty
2 Advanced Engineering Mathematics H.K.Dass S.Chand 2014
Eighth

Course
3 0 2 5 10 3 0 1 4
Design and Analysis Component ISE MSE ESE Total
of Algorithms
Theory 75 75 150 300
CS205/IT205
Pre-requisite Course Codes, if any. Advanced Data Structures

Course Objective:
XXXXX.1 Analyze time and space complexity of an algorithm.
XXXXX.2 Apply divide and conquer strategy to solve problems.
XXXXX.3 Apply the concept of dynamic programming and greedy approach to solve problems.
XXXXX.4 Apply the idea of backtracking, branch and bound strategy to solve problems.
XXXXX.5 Apply various string matching algorithms.

XXXXX.1
XXXXX.2
XXXXX.3
XXXXX.4
XXXXX.5
XXXXX.1
XXXXX.2
XXXXX.3
XXXXX.4
XXXXX.5

Theory Component
Module Unit
Topics Ref. Hrs.
No. No.
1 Title Introduction to Analysis of algorithm
Role of Algorithms in Computing, Performance analysis-space and
time complexity, Growth of Functions: Asymptotic Notation,
1.1 1,2
Standard Notation and Common Functions, Analysis of sorting
algorithms Such as Selection sort and insertion sort.
12
Divide and Conquer Approach – General Method, Analysis of Merge
1.2 Sort, Analysis of Quick sort, Analysis of Binary search, Finding the 1,2
maximum and minimum, Strassen’s matrix multiplication.
Recurrences: The substitution method, Recursion tree method,
1.3 1
Master method and Proof.
2 Title Dynamic Programming and Amortized Analysis
Dynamic Programming: Assembly-line scheduling, Matrix Chain
2.1 1 12
Multiplication, Longest common subsequence.
Amortized analysis- Aggregate analysis, accounting and Potential
2.2 1
Method, Dynamic Table.
3 Title Greedy Approach
Greedy Approach: Basic strategy, application to job sequencing
3.1 with deadlines problem, single source shortest path-Dijkstra’s 1,2
5
algorithm.
Knapsack problem, Minimum cost spanning trees-Kruskal and
3.2 1,2
prim’s algorithm.
4 Title Backtracking and Branch-and-bound
Backtracking: General method, 8 queen problem (N-queen
4.1 2
problem), Sum of subsets, Graph coloring. 5
Branch and Bound: 0/1 knapsack problem, Travelling salesman
4.2 2
problem, 15 puzzle problem.
5 Title Approximation and String Matching algorithms
Approximation algorithms: The vertex-cover problem, The
5.1 1
traveling-salesman problem, The set covering problem
8
String Matching algorithms: The naïve string matching Algorithms,
5.2 The Rabin Karp algorithm, String matching with finite automata, 1
The Knuth-Morris-Pratt algorithm
6 NP-complete problems: Basic concepts, Non-deterministic
Algorithms, NP-hard and NP-complete, Cook’s Theorem, NP-Hard
Self
graph and scheduling Problems. NP-completeness and reducibility, 1,2 5*
Study
decision and optimization problems, polynomial reduction
Total 42


1 Experiment on finding the running time of an algorithm.
2 Experiment based on divide and conquers approach.
3 Experiment on Recurrence relation.
4 Experiment using dynamic programming approach
5 Experiment based on greedy approach
6 Experiment based on graph Algorithms
7 Experiment using Backtracking strategy
8 Experiment using branch and bound strategy
9 Experiment based on Approximation Algorithms
10 Experiment on string matching algorithms.
Text Book(s):

Thomas H. Cormen, Charles E.
Introduction to
1 Third Leiserson, Ronald L Rivest, MIT Press 2009
Algorithms
Clifford Stein
Fundamentals of Horowitz E, Sahni S and S. Galgotia
2 Second 2010
Computer Algorithms Rajasekaran Publications
Reference Books:

Pearson
The Design and Alfred V. Aho, John E. Hopcroft
1 First Education 2006
analysis of algorithms and Jeffrey D. Ullman
India

Course
3 0 2 5 10 3 0 1 4
Operating Systems Component ISE MSE ESE Total
Theory 75 75 150 300
CS206/IT206
Pre-requisite Course Codes, if any. Computer Architecture and Organization

Course Objective:
XXXXX.1 Comprehend the primitive concepts of Operating System services and System
Programming functionality.
XXXXX.2 Articulate process scheduling algorithms in effective execution of processes.
XXXXX.3 Acquaint with efficient process synchronization techniques in effective execution of
programs.
XXXXX.4 Analyze virtual memory management algorithms in effective allocation of main
memory usage.
XXXXX.5 Evaluates various algorithms of File Storage & I/O management for performance and
quality criterion.

XXXXX.1
XXXXX.2
XXXXX.3
XXXXX.4
XXXXX.5
XXXXX.1
XXXXX.2
XXXXX.3
XXXXX.4
XXXXX.5


Theory Component
Module Unit
Topics Ref. Hrs.
No. No.
Title Introduction to System Software and Operating Systems
1.1 System Software – Introduction, Goal, Systems Programs and
Systems Programming, Views of Systems Software.
Linkers and Loader – Relocation and Linking Concepts, Design of 1
Linker, Self-Relocating Programs, Linking of Overlay Structured
1 8
Programs, Dynamic Linking, Loaders.
1.2 Operating Systems – Introduction, Structure and Principles of
Operations of Operating Systems, Classes of Operating Systems,
1
Batch Processing Systems, Multiprogramming Systems, Time
Sharing Systems, Real Time Operating Systems.
Title Process Management
2.1 Processes and Threads – Process Concept, Process Scheduling,
Operations on Processes, Multicore Programming,
2
Multithreading Models, Thread Libraries, Implicit Threading,
2 Threading Issues, Operating-System Examples 8
2.2 UNIX Process and Threads – Process Abstraction, Process
Creation using fork and exec, invoking new process, process
3
termination, awaiting process termination, User and Kernel
Threads.
Title Process Coordination
3.1 Process Synchronization - Critical-Section Problem, Peterson’s
Solution, Synchronization Hardware, Mutex Locks, Semaphores,
2
Classic Problems of Synchronization, Monitors, Synchronization
Examples
3.2 CPU Scheduling - Scheduling Criteria, Scheduling Algorithms,
3 12
Real-Time CPU Scheduling, Operating-System Examples.
Deadlock - Characterization, Methods for Handling Deadlocks, 2
Detection, Prevention, Avoidance, Recovery methods for
Deadlock.
3.3 UNIX IPC – Universal IPC Facilities, System V IPC, Message, Ports,
3
Message Passing, Port Operations.
Title Memory management
4.1 Memory Management Strategies - Swapping, Contiguous
4 Memory Allocation, Segmentation, Paging, Structure of the Page 2 6
Table.
4.2 Virtual Memory Management - Demand Paging, Allocation of 2

Frames, Thrashing, Memory-Mapped Files, Allocating Kernel

Memory, Operating-System Examples.
Title File Management
5.1 Storage Management - Disk Structure, Disk Scheduling, Disk
2
Management
5.2 File-System Implementation - File-System Structure, File-System
Implementation, Directory Implementation, Allocation Methods, 2
5 8
Free-Space Management
5.3 UNIX Internal File Representation - Inodes, Structure of Regular
File, Directories, Path Name to Inode Conversion, Super Block,
4
Inode Assignment, Allocation of Disk blocks, Other File Types.
1) Explore Features, characteristics and CPU scheduling of

Real-Time Operating System along an example
Self
6 2) Explore the requirements of Kernel, CPU Scheduling, Disk 2,4 5*
Study
Scheduling for Multimedia Systems
3) Explore all UNIX System Calls for File System.
List of Experiments for Operating System Laboratory
Sr.
Title of the Experiment
No
1 Installation of Linux OS on Virtual Machine.
Write a program for creating a static/dynamic link library for complex number operations
2
and then test this library through linuxld linker.
Write a program which creates exactly 16 copies of itself by calling fork() only twice within
3
a loop. The program should also print a tree of the pids.
Write a program to simulate the following non-preemptive CPU scheduling algorithms to
4
find turnaround time and waiting time. a) FCFS b) SJF c) Round Robin d) Priority
The program r.c initializes n number of semaphores. It first assign count equal -1, which is
then used by process p and q. This count is protected by semaphore. It also allocates
shared memory of size 40 ints. It waits for process p and q to enter all n1 and n2 elements
5
through different terminals. This program r.c sorts shared data in ascending order. It waits
to finish p and q. At end, The program r.c detaches and deletes n semaphores and print the
sorted list.
Write a multithreaded program for preventing race conditions and deadlock avoidance for
the banker’s algorithm as follows. Several customers’ request and release resources from
6
the bank. The banker will grant a request only if it leaves the system in a safe state. A
request that leaves the system in an unsafe state will be denied.
Write a program which acts as a chat application between two users on the same
7
computer using shared memory.

Assume that a system has a 32-bit virtual address with a 4-KB page size. Write a C program
that is passed a virtual address (in decimal) on the command line and have it output the
page number and offset for the given address. As an example, your program would run as
follows:
./a.out 19986
8 Your program would output:
The address 19986 contains:
page number = 4
offset = 3602
Writing this program will require using the appropriate data type to store 32 bits. We
encourage you to use unsigned data types as well.
9 Write a program to simulate disk scheduling algorithms a) FCFS b) SCAN c) C-SCAN
Write a program to prevent destructive update of files by locking as follows: Suppose the
10 inode contains a new permission setting such that it allows only one process at a time to
open the file for writing, but many processes can open the file for reading.
Note – Implement all programs in C language under Linux OS environment
Text Books
Sr.
No
Tata McGraw-
1 System Programming First D M Dhamdhere 2011
Hill Education
Operating System Abraham Silberschatz,
2 Ninth Wiley 2012
Concepts Peter B Galvin, Greg Gagne
UNIX Internals: The New
3 First UreshVahalia Prentice Hall 1995
Frontiers
Design of the UNIX
4 First Maurice J. Bach Prentice-Hall 1990
Operating Systems
Reference Books
Sr.
No
Operating Systems: Internals
1 Eighth William Stallings Pearson 2014
and Design Principles
Andrew S. Tanenbaum,
2 Modern Operating Systems Fourth Pearson 2014
Herbert Bos

Course
3 0 2 5 10 3 0 1 4
(PC) Computer Examination Scheme
Communications and Component ISE MSE ESE Total
Networks Theory 50 50 100 200
CS207/IT207

Course Objective: Understand the state-of-the-art in network protocols, architectures and
applications.
XXXXX.1 Describe the fundamental concepts of Data Communication.
XXXXX.2 Distinguish the different layers of the OSI model and TCP/IP.
XXXXX.3 Identify the different types of protocols and their functions within a network.
XXXXX.4 Apply the knowledge of subnetting, routing mechanisms and Software Defined
Networking.
XXXXX.1
XXXXX.2
XXXXX.3
XXXXX.4

XXXXX.1
XXXXX.2
XXXXX.3
XXXXX.4

Theory Component
Module Unit
Topics Ref. Hrs.
No. No.
1 Title Computer Communication and The Internet 1,2 10
1.1 Internet: A Nut and Bolts Description, A Services Description,
Protocol. The Network Edge: Access Network, The Network Core: 1,2
Packet Switching, Circuit Switching, A Network of Networks
1.2 Delay, Loss, Throughput in Packet Switched Networks: Overview
of Delay in Packet Switched Networks, Queuing Delay and Packet 1,2
Loss, End to End Delay, Throughput in Computer Networks.
1.3 Protocol Layers and their Service Models: Layered Architecture
1,2
and their Encapsulation.
1.4 Data and Signals: Analog and Digital, Periodic analog signals,
2
Digital signals, Transmission impairment.
1.5 Digital Transmission: Digital-to-Digital conversion, Analog-to-
Digital conversion. Transmission modes, Analog Transmission: 2
Digital-to-Analog conversion, Analog-to-Analog conversion.
2 Title Application Layer 1,2 6
2.1 Principles of Network Applications: Network Applications
Architecture, Processes Communicating, Transport Services
1,2
Available to Applications, Transport Services Provided by the
Internet, Application Layer Protocols.
2.2 The Web and HTTP: Overview of HTTP, Non Persistent and
Persistent Connections, HTTP Message Format, User Server 1,2
Interaction: Cookies, Web Catching, The Conditional Get.
2.3 File Transfer Ftp: Ftp Commands and Replies. FTP, SMTP, Mail
1,2
Access Protocol (IMAP, POP), DNS
3 Title Transport Layer 1,2 8
3.1 Introduction and Transport-Layer Services: Relationship Between
Transport and Network Layers, Overview of the Transport Layer 1,2
in the Internet
3.2 Multiplexing and Demultiplexing 1,2
3.3 Connectionless Transport - UDP: UDP Segment Structure, UDP
1,2
Checksum
3.4 Principles of Reliable Data Transfer: Building a Reliable Data
Transfer Protocol, Pipelined Reliable Data Transfer Protocols, Go- 1,2
Back-N (GBN), Selective Repeat (SR),
3.5 Connection-Oriented Transport - TCP: The TCP Connection, TCP
1,2
Segment Structure, Round-Trip Time Estimation and Timeout,

Reliable Data Transfer, Flow Control, TCP Connection

Management
3.6 Principles of Congestion Control: The Causes and the Costs of
1,2
Congestion, Approaches to Congestion Control.
4 Title The Network Layer 1,2 10
4.1 Introduction: Forwarding and Routing, Network Service Models. 1,2
4.2 Virtual Circuit and Datagram Networks: Virtual-Circuit Networks,
1,2
Datagram Networks, Origins of VC and Datagram Networks.
4.3 Router: Input Processing, Switching, Output Processing, Queuing,
1,2
The Routing Control Plane.
4.4 The Internet Protocol (IP): Forwarding and Addressing in the
Internet, Datagram Format, IPv4 Addressing, Internet Control 1,2
Message Protocol (ICMP), IPv6
4.5 Routing Algorithms: The Link-State (LS) Routing Algorithm, The
1,2
Distance-Vector (DV) Routing Algorithm, Hierarchical Routing
4.6 Software Defined Networking: Introduction and Overview R3
5 Title The Link Layer: Links, Access Networks, and LANs 1,2 8
5.1 Introduction to the Link Layer: The Services Provided by the Link
1,2
Layer, Implementation of the Link Layer
5.2 Error-Detection and Correction Techniques: Parity Checks,
1,2
Checksumming Methods, Cyclic Redundancy Check (CRC)
5.3 Multiple Access Links and Protocols: Channel Partitioning
1,2
Protocols, Random Access Protocols, Taking-Turns Protocols.
6* Title Self Study Topic 1,2 5*
6.1 Transmission Media: Guided media, Unguided media: Wireless 1,2
6.2 ARP and RARP usage 1,2
6.3 Multicast routing and Broadcast routing 1,2
6.4 Routing in the Internet: Intra-AS Routing in the Internet: RIP,
1,2
Intra-AS Routing in the Internet: OSPF, Inter-AS Routing: BGP
6.5 Network Function Virtualization R3
Total 42
*This module hrs. not included in Total 42 hrs

1 Use and interpret basic Networking Utilities
2 Describe various Network Topology and Networking Hardware
3 Experiment with Packet Tracers/Analyzers
4 Implement Web server and DHCP server for given scenario

5 Implement TELNET and FTP server for given scenario

6 Implement SMTP server for given scenario
7 Implement DNS server for given scenario
8 Develop client-server model using Socket Programming for given scenario
9 Illustrate basic Mininet operations for Software Defined Networking
10 Implement in Mininet to control switch manually
Text Books
Sr.
No
Computer Networking: James Kurose and Kieth
1 Sixth Pearson 2013
Top Down Approach Ross
Data Communication and
2 Second Behrouz Forouzan McGraw Hill 2000
Networking
Reference Books
Sr.
No
1 Computer Networks Fifth Andrew Tanenbaum Pearson 2013
Larry L. Peterson and Bruce Morgon
2 Computer Networks Third 2003
Davie Huffman
Addison
3 SDN and NFV Simplified First Jim Doherty 2016
Wesley

Course
1 0 2 2 5 1 0 1 2
(SBC)
Examination Scheme
Professional
Communication Skills Component ISE MSE ESE Total
AS201 Theory -- -- -- --
Laboratory 200 -- -- 200

Course Objective:
AS201.1 Demonstrate the spoken and written skills for job placements.
AS201.2 Draft professional documents.
AS201.3 Design written communication for social media.
AS201.1
AS201.2
AS201.3

AS201.1
AS201.2
AS201.3
BLOOM’S Levels Targeted (Pl. appropriate)

Theory Component
Module Unit P
Topics Ref. L Hrs.
No. No. Hrs
1. Title Placement Skills 6 12
1.1 Resume Writing & Cover Letter
1.2 Group Discussion
1.3 Case Studies/Pitching a startup

1.4 Team Building Skills/Work

1.5 Interview Skills
2 Title Corporate Communication 6 12
2.1 Presentation Skills
2.2 Meeting: Notice, Agenda, Minutes
2.3 Proposal Writing
2.4 Report Writing: Informative, Analytical report
3 Title Research Writing 2 4
3.1 Sourcing information through digital media
3.2 Written communication using social media: Blog
4 Self Research Paper, News Analysis 6*
Study
Total 42 hrs
*Not included in the total
List of ISEs
1 Resume
2 Cover Letter
3 GD
4 Mock Interview
5 Presentation
6 Blog Writing
7 Team Building Activity
8 Minutes of the Meeting/Notice & Agenda
9 Proposal Writing
10 Report Writing
Text Books

1 Interpersonal Skills at Work 2002 John Hayes McGraw Hill 2002
Education
2 Campus Placement: A 2016 Ankur Malhotra McGraw Hill 2016
Comprehensive Guide Education

Reference Books
Sr.
No
If I Understood You, Would I Have
This Look on My Face? My Random
1 FIRST Alan Alda 2017
Adventures in the Art and Science of House
Relating and Communicating
Robert J. Hamper, McGraw Hill
2 Handbook for Writing Proposals SECOND 2010
Sue Baugh Education
Effective Communication Skills for Paperback
3 2000 Harry Chambers 2000
Scientific and Technical Professionals Basic Books
Crown
4 The Art Of Writing Together 2008 William Issac 2008
Business
Meenakshi
Oxford,
5 Communication Skills 2011 Raman, Sangeeta 2011
India
Sharma


Credits Assigned
Code L T P O E L T P O Total
0 0 0 4 4 0 0 0 2 2
Mini Project-I Component ISE MSE ESE Total
Theory -- -- -- --
CS208/IT208

Course Objective:
XXXXX.1 Discover potential research areas for addressing societal issues
XXXXX.2 Conduct a survey of basic and contemporary literature in the preferred field of study.
XXXXX.3 Formulate and propose a plan for creating a solution for the research plan identified.
XXXXX.4 Exercise the team building, communication and management for design and
implementation of projects.
XXXXX.5 Compare and contrast the several existing solutions for research challenge
XXXXX.6 Report and present the findings of the study conducted in the preferred domain.
XXXXX.1
XXXXX.2
XXXXX.3
XXXXX.4
XXXXX.5
XXXXX.6

XXXXX.1
XXXXX.2
XXXXX.3
XXXXX.4
XXXXX.5
XXXXX.6

BLOOM’S Levels Targeted (Pl. appropriate)
Mini-project is an opportunity to make a difference in the experience of education in its own

way. It is an attempt of scientific study of the problem in surrounding in order to guide, correct and
evaluate the actions and decisions about it. It is based on a small project correlating scientific
knowledge and day to day experience which encourages development of scientific attitude to solve
real life problems among students.
The Objectives of Action Research are:
 To make students sensitive towards societal issues

 To learn scientific principles from day-to-day experiences
 To develop psycho-technological skills through observation, classification, statement
of hypothesis etc.
 Development of communication, organizational skills and maturity through discussion,
presentation etc.
 To develop ability to correlate science, technology and society
 To apply engineering knowledge and propose innovative, sustainable solutions to the real-life
challenges
Steps for Implementation (ISE: 2 Phases) and ESE
 Keen observation of the surrounding/society

 Identification of the problem
 Analysis of the problem
 Collection of relevant information by formulating research questions
 Suggesting plan of action
 Conducting experiments
 To draw conclusion
 To find the possible solution to rectify the problem
 To execute experiments and remedial measures wherever possible
Students can seek guidance from teachers, other experts and make effective use of other
sources of information available around them. Students must ensure that problem to be solved in
manageable in one semester.
Criteria of a good project:

 Appropriate idea, clear understanding, and proper presentation of the concept

 Quality of work
 Project plan and its execution
 Credibility of the work
 Probable impact of the work on the attitude of students and society
 Scientific attitude, creativity and novelty reflected in project work and analysis of the
situation
 Utility and innovation of the remedial measures
 Desirability, Feasibility and Viability in real life
The H/W and S/W resources required to complete the Mini-Project-I may be beyond the scope of
curriculum of courses taken or may be based on the courses but thrust should be on
• Learning additional skills
• Development of ability to define and design the problem and lead to its accomplishment with
proper planning
• Learn the behavioral discipline by working in a team. The team may be maximum three (03)
students.
Evaluation:
Project report should contain project title, student details, certificate and acknowledgements.
Other sections of the report shall be decided by the department based on projects. But it
must have introduction, necessity of project, objectives, hypothesis, plan, observations, analysis
of results, conclusion and references along with other sections related to technology. The ISE and
ESE evaluation will be carried out based on the rubrics framed by the Department. The ESE marks
will be based on final demonstration of the project and viva based on it and report/poster/technical
paper of the project in the standard format provided by the Department.

SE Syllabus 2020 21 COMP IT

Uploaded by

Copyright:

Available Formats

SE Syllabus 2020 21 COMP IT

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

SE Syllabus 2020 21 COMP IT

Uploaded by

Copyright:

Available Formats

Sardar Patel Institute of Technology

Bhavan’s Campus, Munshi Nagar, Andheri (West), Mumbai-400058-India

B.Tech. (Computer Engineering)

2020 Iteration (w.e.f. 2020-21)

UG Syllabus 2020 iteration/CS/IT pg. 1

Nomenclature of the Courses

BSC Basic Science Course PC Program Core

L Lecture Hour O Other Work (Self Study)

Engagement and Credit Scheme

UG Syllabus 2020 iteration/CS/IT pg. 2

UG Syllabus 2020 iteration/CS/IT pg. 3

UG Syllabus 2020 iteration/CS/IT pg. 4

Course Teaching Scheme (Hrs/week) Credits Assigned

Pre-requisite Course Codes, if any.

CO-PO Correlation Matrix (3-Strong, 2-Moderate, 1-Weak Correlation)

CO-PEO/PSO Correlation Matrix (3-Strong, 2-Moderate, 1-Weak Correlation)

UG Syllabus 2020 iteration/CS/IT pg. 5

BLOOM’S Levels Targeted (Pl. Tick appropriate)

UG Syllabus 2020 iteration/CS/IT pg. 6

Study 2.3 Series by method of Substitution

*Total of 42 hours does not include self study hours.

UG Syllabus 2020 iteration/CS/IT pg. 7

Pre-requisite Course Codes, if any. HSC level Chemistry

UG Syllabus 2020 iteration/CS/IT pg. 8

PEO1 PEO2 PEO3 PEO4 PSO1 PSO2

BLOOM’S Levels Targeted (Pl. Tick appropriate)

UG Syllabus 2020 iteration/CS/IT pg. 9

UG Syllabus 2020 iteration/CS/IT pg. 10

1. Supramolecular polymers and their applications

Sr No Title Edition Authors Publisher Year

Sr No Title Edition Authors Publisher Year

UG Syllabus 2020 iteration/CS/IT pg. 11

Pre-requisite Course Codes, if any. HSC level Biology

CO-PO Correlation Matrix (3-Strong, 2-Moderate, 1-Weak Correlation)

CO-PEO/PSO Correlation Matrix (3-Strong, 2-Moderate, 1-Weak Correlation)

UG Syllabus 2020 iteration/CS/IT pg. 12

BLOOM’S Levels Targeted (Pl. Tick appropriate)

UG Syllabus 2020 iteration/CS/IT pg. 13

Structure of Skin, Functions of Skin. Engineering methods for

UG Syllabus 2020 iteration/CS/IT pg. 14

Pre-requisite Course Codes, if any.

CO-PO Correlation Matrix (3-Strong, 2-Moderate, 1-Weak Correlation)

CO-PEO/PSO Correlation Matrix (3-Strong, 2-Moderate, 1-Weak Correlation)

BLOOM’S Levels Targeted (Pl. Tick appropriate)

UG Syllabus 2020 iteration/CS/IT pg. 15

UG Syllabus 2020 iteration/CS/IT pg. 16

Sr. No Title Edition Authors Publisher Year

Sr. No Title Edition Authors Publisher Year

UG Syllabus 2020 iteration/CS/IT pg. 17

Course Teaching Scheme (Hrs/week) Credits Assigned

Pre-requisite Course Codes, if any.

CO-PO Correlation Matrix (3-Strong, 2-Moderate, 1-Weak Correlation)

BLOOM’S Levels Targeted (Pl. Tick appropriate)

UG Syllabus 2020 iteration/CS/IT pg. 18

UG Syllabus 2020 iteration/CS/IT pg. 19

Laboratory Component (Minimum 10 Laboratory experiments are expected)

Sr. No Title of the Experiment

Sr. No Title Edition Authors Publisher Year

Sr. No Title Edition Authors Publisher Year