Ay 2022-23 Ecm Sense

SCHOOL OF ELECTRONICS
ENGINEERING
B. Tech Electronics and Computer

Engineering
Curriculum and Syllabus

(2022-23 admitted students)
B. Tech Electronics and Computer Engineering
VISION STATEMENT OF VELLORE INSTITUTE OF TECHNOLOGY
Transforming life through excellence in education and research.
MISSION STATEMENT OF VELLORE INSTITUTE OF TECHNOLOGY
World class Education: Excellence in education, grounded in ethics and critical

thinking, for improvement of life.
Cutting edge Research: An innovation ecosystem to extend knowledge and solve
critical problems.
Impactful People: Happy, accountable, caring and effective workforce and
students.
Rewarding Co-creations: Active collaboration with national & international
industries & universities for productivity and economic development.
Service to Society: Service to the region and world through knowledge and
compassion.
VISION STATEMENT OF THE SCHOOL OF ELECTRONICS

ENGINEERING
To be a leader by imparting in-depth knowledge in Electronics Engineering,

nurturing engineers, technologists and researchers of highest competence, who
would engage in sustainable development to cater the global needs of industry and
society
MISSION STATEMENT OF THE SCHOOL OF ELECTRONICS

ENGINEERING
• Create and maintain an environment to excel in teaching, learning and

applied research in the fields of electronics, communication engineering and
allied disciplines which pioneer for sustainable growth.
• Equip our students with necessary knowledge and skills which enable them
to be lifelong learners to solve practical problems and to improve the quality
of human life.
B.TECH (Electronics and Computer Engineering) Page 2

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs):
PEO_01. Graduates will be engineering practitioners and leaders, who would help
solve industry’s technological problems.
PEO_02. Graduates will be engineering professionals, innovators or entrepreneurs
engaged in technology development, technology deployment, or engineering
system implementation in industry.
PEO_03. Graduates will function in their profession with social awareness and
responsibility.
PEO_04. Graduates will interact with their peers in other disciplines in industry
and society and contribute to the economic growth of the country.
PEO_05. Graduates will be successful in pursuing higher studies in engineering or
management.
PEO_06. Graduates will pursue career paths in teaching or research.

PROGRAMME OUTCOMES (POs):
PO_01: Having an ability to apply mathematics and science in engineering

applications.
PO_02: Having a clear understanding of the subject related concepts and of
contemporary issues and apply them to identify, formulate and analyse complex
engineering problems.
PO_03: Having an ability to design a component or a product applying all the
relevant standards and with realistic constraints, including public health, safety,
culture, society and environment.
PO_04: Having an ability to design and conduct experiments, as well as to analyse
and interpret data, and synthesis of information.
PO_05: Having an ability to use techniques, skills, resources and modern
engineering and IT tools necessary for engineering practice.
PO_06: Having problem solving ability- to assess social issues (societal, health,
safety, legal and cultural) and engineering problems.
PO_07: Having adaptive thinking and adaptability in relation to environmental
context and sustainable development.
PO_08: Having a clear understanding of professional and ethical responsibility.
PO_09: Having cross cultural competency exhibited by working as a member or in
teams.
PO_10: Having a good working knowledge of communicating in English
communication with engineering community and society.
PO_11: Having a good cognitive load management skills related to project
management and finance.
PO_12: Having interest and recognise the need for independent and lifelong
learning.

PROGRAMME SPECIFIC OUTCOMES (PSOs):
On completion of B. Tech. (Electronics and Computer Engineering)

Programme, graduates will be able to:
PSO1: Acquire knowledge and skills to analyse and design Electronic and
Computing systems.
PSO2: Attain expertise in hardware software co-design for prototype development.
PSO3: Apply cutting-edge Electronics and Computer Engineering tools and

modern techniques to find solutions for interdisciplinary problems.

PROGRAMME CREDIT STRUCTURE:
Category-wise Credit distribution
Category Credits
Foundation Core Courses
• Basic Sciences and Mathematics (24)
• Engineering Sciences (14) 53
• Humanities, Social Sciences and
• Management (HSM) (15)
Discipline-linked Engineering Science 11
Courses
Discipline Core Courses 50
Discipline Elective Courses 15
Open Elective Courses 15
Project and Internship 09
Total Graded Credit Requirement 153
Non- Graded Credit Requirement 11

DETAILED CURRICULUM
Foundation Core Courses: 53 Credits
S. Course
Course Title L T P C
No Code
Basic Sciences and Mathematics 24
1 BPHY101L Engineering Physics 3 0 0 3
2 BPHY101P Engineering Physics Lab 0 0 2 1
3 BCHY101L Engineering Chemistry 3 0 0 3
4 BCHY101P Engineering Chemistry Lab 0 0 2 1
5 BMAT101L Calculus 3 0 0 3
6 BMAT101P Calculus Lab 0 0 2 1
7 BMAT102L Differential Equations and Transforms 3 1 0 4
8 BMAT201L Complex Variables and Linear Algebra 3 1 0 4
9 BMAT202L Probability and Statistics 3 0 0 3
10 BMAT202P Probability and Statistics Lab 0 0 2 1
Engineering Sciences 14
Basic Electrical and Electronics
11 BEEE102L Engineering 3 0 0 3
Basic Electrical and Electronics
12 BEEE102P Engineering Lab 0 0 2 1
13 BCSE101E Computer Programming: Python 1 0 4 3
Structured and Object-Oriented
14 BCSE102L Programming 2 0 0 2
Structured and Object-Oriented
15 BCSE102P Programming Lab 0 0 4 2
16 BCSE103E Computer Programming: Java 1 0 4 3
Humanities, Social Sciences and Management 15
Effective English Communication
16 BENG101N (NGC) 0 0 4 2
17 BENG101L Technical English Communication 2 0 0 2
Technical English Communication
18 BENG101P Lab 0 0 2 1
19 BENG102P Technical Report Writing 0 0 2 1
20 BSTS101P Quantitative Skills Practice I 0 0 3 1.5
21 BSTS102P Quantitative Skills Practice II 0 0 3 1.5

22 BSTS201P Qualitative Skills Practice I 0 0 3 1.5

23 BSTS202P Qualitative Skills Practice II 0 0 3 1.5
24 BFLE200L Foreign Language 2 0 0 2
25 BHSM200L HSM Elective 3 0 0 3
TOTAL 53
Discipline-linked Engineering Science Courses: 11 Credits

S. Course Course Title L T P C Pre-
No Code Requisite
1. BMAT205L Discrete Mathematics and 3 1 0 4 NIL
Graph Theory
2. BECE201L Electronic Materials and 3 0 0 3 NIL
Devices
3. BECE203L Circuit Theory 3 1 0 4 BEEE101L
BEEE101P
TOTAL 11
Discipline Core Courses: 50 Credits
S. Course Course Title L T P C Pre-Requisite

No Code
1. BECE102L Digital Systems Design 3 0 0 3 NIL
2. BECE102P Digital Systems Design 0 0 2 1 NIL
Lab
3. BECE204L Microprocessors and 3 0 0 3 BECE102L
Microcontrollers
4. BECE204P Microprocessors and 0 0 2 1 BECE102L
Microcontrollers Lab
5. BECE206L Analog Circuits 3 0 0 3 BECE201L
6. BECE206P Analog Circuits Lab 0 0 2 1 BECE201L
7. BCSE202L Data Structures and 3 0 0 3 NIL
Algorithm
8. BCSE202P Data Structures and 0 0 2 1 NIL
Algorithm Lab

9. BCSE204L Design and Analysis of 3 0 0 3 NIL

Algorithms
10. BCSE204P Design and Analysis of 0 0 2 1 NIL
Algorithms Lab
11. BCSE205L Computer Architecture 3 0 0 3 NIL
and Organisation
12. BECE303L VLSI System Design 3 0 0 3 BECE204L,B
ECE204P
13. BECE303P VLSI System Design Lab 0 0 2 1 BECE204L,
BECE204P
14. BCSE302L Database Systems 3 0 0 3 NIL
15. BCSE302P Database Systems Lab 0 0 2 1 NIL
16. BCSE303L Operating Systems 3 0 0 3 NIL
17. BCSE303P Operating Systems Lab 0 0 2 1 NIL
18. BCSE304L Theory of Computation 3 0 0 3 NIL
19. BCSE307L Compiler Design 3 0 0 3 NIL
20. BCSE307P Compiler Design Lab 0 0 2 1 NIL
21. BCSE308L Computer Networks 3 0 0 3 NIL
22. BCSE308P Computer Networks Lab 0 0 2 1 NIL
23. BECM301L Signal Processing 3 0 0 3 BMAT102L
24. BECM301P Signal Processing Lab 0 0 2 1 BMAT102L
Total 50
Discipline Elective Courses: 15 Credits
S.No Course Course Title L T P C Pre-Requisite

Code
1 BECE302L Control Systems 2 1 0 3 BECE202L/
BECM301L
2 BECE309L Artificial Intelligence and 3 0 0 3 BMAT201L
Machine Learning
3 BECE312L Robotics and Automation 3 0 0 3 NIL

4 BECE403E Embedded Systems Design 3 0 2 4 BECE204L,

BECE204P
5 BECE406E FPGA Based System Design 2 0 2 3 BECE102L,
BECE102P
6 BECE407E ASIC Design 2 0 2 3 BECE303L,
BECE303P
7 BECE411L Cryptography and Network 3 0 0 3 BECE401L,
Security BECE401P/
BCSE308L,
BCSE308P
8 BECM302E Augmented and Virtual 3 0 2 4 NIL
Reality
9 BECM303L Wireless Communication 3 0 0 3 BCSE308L,
Networks BCSE308P
10 BECM304L Principles of 3 0 0 3 BECE206L,
Communication BECE206P
11 BCSE208L Data Mining 2 0 0 2 NIL
12 BCSE208P Data Mining Lab 0 0 2 1 NIL
13 BCSE301L Software Engineering 3 0 0 3 NIL
14 BCSE332L Deep Learning 3 0 0 3 NIL
15 BCSE332P Deep Learning Lab 0 0 2 1 NIL
16 BCSE324L Foundations of Blockchain 3 0 0 3 NIL
Technology
17 BCSE401L Internet of Things 3 0 0 3 NIL
18 BCSE402L Big Data Analytics 3 0 0 3 NIL
19 BCSE404L Internet and Web 3 0 0 3 NIL
Programming
20 BCSE407L Computer Vision 3 0 0 3 NIL
21 BCSE408L Cloud Computing 3 0 0 3 NIL
22 BCSE409L Natural Language 3 0 0 3 NIL
Processing
23 BCSE414L High Performance 3 0 0 3 NIL
Computing
24 BCSE420L Sensors, Actuators and 2 0 0 2 NIL
Signal conditioning

25 BCSE420P Sensors, Actuators and 0 0 2 1 NIL

Signal conditioning Lab
26 BCSE428L Autonomous Drones 2 0 0 2 NIL
27 BCSE428P Autonomous Drones Lab 0 0 2 1 NIL
28 BCSE429L Cyber Physical System 2 0 0 2 NIL
Design
29 BCSE429P Cyber Physical System 0 0 2 1 NIL
Design Lab
30 BECE391J Technical Answers to Real 3 NIL
Problems Project
31 BECE392J Design Project 3 NIL
32 BECE393J Laboratory Project 3 NIL
33 BECE394J Product Development 3 NIL
Project
35 BECE396J Reading Course 3 NIL
36 BECE397J Special Project 3 NIL
37 BECE398J Simulation Project 3 NIL
Open Elective Courses: 15 Credits

Engineering Disciplines | Projects | Sciences | Humanities | Social Sciences |
Liberal Arts | Economics | Finance Entrepreneurship | Management | Skills |
Reading
Project and Internship: 9 Credits

S. Course
No Code
1 BECM399J Summer Industrial Internship 1
2 BECM497J Project-1 3
3 BECM498J Project-II / Internship 5
4 BECM499J One Semester Internship 14

Non-Graded Credit Requirement: 11 Credits
S. Course
No Code
1 BECM101N Introduction to Engineering 1
2 BSSC101N Essence of Traditional Knowledge 2
3 BSSC102N Indian Constitution 2
4 BEXC100N Extracurricular Activities 2
5 BCHY102N Environmental Sciences 2
6 BHUM101N Ethics and Values 2

Vellore Institute of Technology
Annexure 25a
SHORT SYLLABUS
BPHY101L Engineering Physics

3 Credits (3-0-0)
Introduction to waves, Harmonic waves, Standing waves and their eigenfrequencies, Phase veloc-
ity and Group velocity, Electromagnetic waves, Maxwells equations, Electromagnetic wave equation
in free space, Elements of quantum mechanics, Heisenberg uncertainty principle, Schrödinger wave
equation, Quantum confinement and nanostructures, Lasers, Types of lasers, EM wave propagation,
Attenuation, Dispersion, Optoelectronics devices, LED & Laser diode, Photodetectors.
Proceedings of the 62nd Academic Council (15.07.2021) 78

Item 63/8 - Annexure - 5
BPHY101L Engineering Physics L T P C

3 0 0 3
Pre-requisite 12th of equivalent Syllabus version
1.0
Course Objectives
1. To explain the dual nature of radiation and matter.
2. To apply Schrödinger’s equation to solve finite and infinite potential problems and apply
quantum ideas at the nanoscale.
3. To understand the Maxwell’s equations for electromagnetic waves and apply the
concepts to semiconductors for engineering applications.
Course Outcome
At the end of the course the student will be able to
1. Comprehend the phenomenon of waves and electromagnetic waves.
2. Understand the principles of quantum mechanics.
3. Apply quantum mechanical ideas to subatomic domain.
4. Appreciate the fundamental principles of a laser and its types.
5. Design a typical optical fiber communication system using optoelectronic devices.
Module:1 Introduction to waves 7 hours
Waves on a string - Wave equation on a string (derivation) - Harmonic waves- reflection and
transmission of waves at a boundary - Standing waves and their eigenfrequencies - waves
with dispersion - Superposition of waves and Fourier method (qualitative) - Wave packet -
phase velocity and group velocity.
Module:2 Electromagnetic waves 7 hours
Physics of divergence - gradient and curl - surface and volume integral - Maxwell Equations
(Qualitative) - Continuity equation for current densities - Displacement current -
Electromagnetic wave equation in free space - Plane electromagnetic waves in free space -
Hertz’s experiment.
Module:3 Elements of quantum mechanics 7 hours
Need for Quantum Mechanics: Idea of Quantization (Planck and Einstein) - Compton effect
(Qualitative) – de Broglie hypothesis - justification of Bohr postulate - Davisson-Germer
experiment - Wave function and probability interpretation - Heisenberg uncertainty principle -
Gedanken experiment (Heisenberg’s microscope) - Schrödinger wave equation (time
dependent and time independent).
Module:4 Applications of quantum mechanics 6 hours
Eigenvalues and eigenfunction of particle confined in one dimensional box - Basics of
nanophysics - Quantum confinement and nanostructures - Tunnel effect (qualitative) and
scanning tunneling microscope.
Module:5 Lasers 6 hours
Laser characteristics - spatial and temporal coherence - Einstein coefficients and their
significance - Population inversion - two, three and four level systems - Pumping schemes -
threshold gain coefficient - Components of a laser - He-Ne, Nd:YAG and CO2 lasers and
their engineering applications.
Module:6 Propagation of EM waves in optical fibers 5 hours
Introduction to optical fiber communication system - light propagation through fibers -
Acceptance angle - Numerical aperture - V-parameter - Types of fibers – Attenuation -
Dispersion-intermodal and intramodal. Application of fiber in medicine - Endoscopy.
Module:7 Optoelectronic devices 5 hours
Introduction to semiconductors - direct and indirect bandgap – p-n junction, Sources: LED
and laser diode, Photodetectors: PN and PIN
Module:8 Contemporary Topics 2 hours
Guest lectures from Industry and, Research and Development Organisations
Total Lecture hours: 45 hours
Proceedings of the 63rd Academic Council [23.09.2021] 655

Text Book(s)
1. H. D. Young and R. A. Freedman, University Physics with Modern Physics, 2020, 15th
Edition, Pearson, USA.
2. D. K. Mynbaev and Lowell L. Scheiner, Fiber Optic Communication Technology,
2011, Pearson, USA
Reference Books
1. H. J. Pain, The Physics of vibrations and waves, 2013, 6th Edition, Wiley Publications,
2. India.
R. A. Serway, J. W. Jewett, Jr, Physics for Scientists and Engineers with Modern
3. Physics, 2019, 10th Edition, Cengage Learning, USA.
4. K. Krane, Modern Physics, 2020, 4th Edition, Wiley Edition, India.
5. M.N.O. Sadiku, Principles of Electromagnetics, 2015, 6th Edition, Oxford University
Press, India.
W. Silfvast, Laser Fundamentals, 2012, 2nd Edition, Cambridge University Press, India.
Mode of Evaluation: Written assignment, Quiz, CAT and FAT
Recommended by Board of Studies 26.06.2021
Approved by Academic Council No. 63 Date 23.09.2021

Annexure 25a
SHORT SYLLABUS
BPHY101P Engineering Physics Lab

1 Credit (0-0-2)
Experiments to prove the wave and particle duality of light, determine the phase velocity, group
veloc-ity of EM wave, material properties like refractive index of a medium, numerical aperture,
acceptance angle of an optical fibre.

BPHY101P Engineering Physics Lab L T P C

0 0 2 1
Pre-requisite 12th or equivalent Syllabus version
1.0
Course Objectives
To apply theoretical knowledge gained in the theory course and get hands-on experience
of the topics.
Course Outcome
1. Comprehend the dual nature of radiation and matter by means of experiments.
2. Get hands-on experience on the topics of quantum mechanical ideas in the
laboratory.
3. Apply low power lasers in optics and optical fiber related experiments.
Indicative Experiments
1. To determine the dependence of fundamental frequency with the length and tension
of a stretched string using sonometer.
2. To determine the characteristics of EM waves using Hertz experiment
3. To determine the wavelength of laser source (He-Ne laser and diode lasers of different
wavelengths) using diffraction grating
4. To demonstrate the wave nature of electron by diffraction through graphite sheet
5. To determine the Planck’s constant using electroluminescence process
6. To numerically demonstrate the discrete energy levels and the wavefunctions using
Schrödinger equation (e.g., particle in a box problem can be given as an assignment)
7. To determine the refractive index of a prism using spectrometer (angle of prism will
be given)
8. To determine the efficiency of a solar cell
9. To determine the acceptance angle and numerical aperture of an optical fiber
10. To demonstrate the phase velocity and group velocity (simulation)
Total Laboratory Hours 30 hours
Mode of assessment: Continuous assessment / FAT / Oral examination

Annexure 25a
SHORT SYLLABUS
BCHY101L Engineering Chemistry

3 Credits (3-0-0)
Importance of chemical thermodynamics and kinetics; Chemistry and applications of metal com-
plexes, organometallics and organic intermediates; Electrochemical systems for fabricating the en-
ergy devices; Function of metal oxides, polymers and nanomaterials in industries; Introduction to
spectroscopy and the related instrumental techniques for the characterization of molecules and ma-
terials; Utility of chemical concepts in industries; Integrating the chemistry and computer science for
basic understanding the molecular interactions.

BCHY101L Engineering Chemistry

L T P C
3 0 0 3
Pre-requisite NIL Syllabus version
1.0
Course Objectives
1. To enable students to have fundamental understanding of the basic concepts of different
disciplines of chemistry.
2. To provide avenues for learning advanced concepts from school to university
3. To empower students with emerging concepts in applied chemistry to be useful in
addressing societal needs
4. To integrate analytical and computational ability with experimental skills to create
individuals competent in basic science and its by-product of its application.
5. To offer opportunities to create pathways for self-reliant in terms of knowledge and
higher learning
Course Outcomes :
1. Understand the fundamental concepts in organic, inorganic, physical, and analytical
chemistry.
2. Analyze the principles of applied chemistry in solving the societal issues.
3. Apply chemical concepts for the advancement of materials.
4. Appreciate the fundamental principles of spectroscopy and the related applications.
5. Design new materials, energy conversion devices and new protective coating
techniques.
Module:1 Chemical thermodynamics and kinetics 6 hours
Laws of thermodynamics - entropy change (selected processes) – spontaneity of a chemical
reaction and Gibbs free energy - heat transfer; Kinetics - Concept of activation energy and
energy barrier - Arrhenius equation- effect of catalysts (homo and heterogeneous) – Enzyme
catalysis (Michaelis-Menten Mechanism).
Module:2 Metal complexes and organometallics 6 hours
Inorganic complexes - structure, bonding and application; Organometallics – introduction,
stability, structure and applications of metal carbonyls, ferrocene and Grignard reagent;
Metals in biology (haemoglobin, chlorophyll- structure and property).
Module:3 Organic intermediates and reaction transformations 6 hours
Organic intermediates - stability and structure of carbocations, carbanions and radicals;
Aromatics (aromaticity) and heterocycles (3, 4, 5, 6 membered and fused systems); Organic
transformations for making useful drugs for specific disease targets (two examples) and
dyes (addition, elimination, substitution and cross coupling reactions).
Module:4 Energy devices 6 hours
Electrochemical and electrolytic cells – electrode materials with examples (semi-conductors),
electrode-electrolyte interface- chemistry of Li ion secondary batteries, supercapacitors; Fuel
cells: H2-O2 and solid oxide fuel cell (SOFC); Solar cells - photovoltaic cell (silicon based),
photoelectrochemical cells and dye-sensitized cells.
Module:5 Functional materials 7 hours
Oxides of AB, AB2, ABO3 type (specific examples); Composites - types and properties;
Polymers - thermosetting and thermoplastic polymers – synthesis and application (TEFLON,
BAKELITE); Conducting polymers- polyacetylene and effect of doping – chemistry of display
devices specific to OLEDs; Nano materials – introduction, bulk vs nano (quantum dots), top-
down and bottom-up approaches for synthesis, and properties of nano Au.
Module:6 Spectroscopic, diffraction and microscopic techniques 5 hours
Fundamental concepts in spectroscopic and instrumental techniques; Principle and
applications of UV-Visible and XRD techniques (numericals); Overview of various techniques
such as AAS, IR, NMR, SEM and TEM.
Module:7 Industrial applications 7 hours

Water purification methods - zeolites, ion-exchange resins and reverse osmosis; Fuels and
combustion -LCV, HCV, Bomb calorimeter (numericals), anti-knocking agents); Protective
coatings for corrosion control: cathodic and anodic protection - PVD technique; Chemical
sensors for environmental monitoring - gas sensors; Overview of computational
methodologies: energy minimization and conformational analysis.
Module:8 Contemporary topics 2 hours
Guest lectures from Industry and, Research and Development Organizations
Textbook
1. Theodore E. Brown, H Eugene, LeMay Bruce E. Bursten, Catherine Murphy, Patrick
Woodward, Matthew E. Stoltzfus, Chemistry: The Central Science, 2017, 14th edition,
Pearson Publishers, 2017. UK
Reference Books
1. Peter Vollhardt, Neil Schore, Organic Chemistry: Structure and Function, 2018, 8th ed.
WH Freeman, London
2. Atkins' Physical Chemistry: International, 2018, Eleventh edition, Oxford University
Press; UK
3. Colin Banwell, Elaine McCash, Fundamentals for Molecular Spectroscopy, 4th Edition,
McGraw Hill, US
4. Solid State Chemistry and its Applications, Anthony R. West. 2014, 2nd edition, Wiley,
UK.
5.
Photovoltaic solar energy: From fundamentals to Applications, 2017, Wiley publishers,
6. UK.
Lawrence S. Brown and Thomas Holme, Chemistry for engineering students, 2018, 4th
edition – Open access version
Mode of Evaluation: CAT, Written assignment, Quiz and FAT
Recommended by Board of 28.06.2021
Studies

Annexure 25a
SHORT SYLLABUS
BCHY101P Engineering Chemistry Lab

1 Credit (0-0-2)
Thermodynamics functions from EMF measurements; Determination of reaction rate, order and molec-
ularity; Colorimetric estimation of Ni2+; Laboratory scale preparation of important drug intermediate;
Conversion of Chemical to electrical energy; Analysis of iron in an alloy sample by potentiometry;
Preparation of tin oxide by sol- gel method and its characterization; Size dependent color variation of
Cu(I)O / gold nanoparticles by UV-Vis spectroscopy; Determination of hardness of water sample by
complexometric titration; Computational Optimization of molecular geometry using Avogadro software.

BCHY101P Engineering Chemistry Lab L T P C

0 0 2 1
1.0
Course Objective
To apply theoretical knowledge gained in the theory course and get hands-on experience of
the topics.
Course Outcome :
1. Understand the importance and hands-on experience on analysis of metal ions by
means of experiments.
2. Get practical experience on synthesis and characterization of the organic molecules
and nanomaterials in the laboratory.
3. Apply their knowledge in thermodynamic functions, kinetics and molecular
geometries through the experiments.
1. Thermodynamics functions from EMF measurements : Zinc – Copper system
2. Determination of reaction rate, order and molecularity of ethylacetate hydrolysis
3. Colorimetric estimation of Ni2+ using conventional and smart phone digital-imaging
methods
4. Laboratory scale preparation of important drug intermediate - para aminophenol for the
synthesis for acetaminophen
5. Magnesium-sea water activated cell – Effect of salt concentration on voltage
generation
6. Analysis of iron in an alloy sample by potentiometry
7. Preparation of tin oxide by sol- gel method and its characterization
8. Size dependent colour variation of Cu2O nanoparticles by spectrophotometer
9. Determination of hardness of water sample by complexometric titration before and
after ion-exchange process
10. Computational Optimization of molecular geometry using Avogadro software
Mode of assessment: Mode of assessment: Continuous assessment / FAT / Oral
examination and others

SHORT SYLLABUS
BMAT101L Calculus
3 Credits (3-0-0)
Limits and Continuity of Single Variable Functions- Differentiation- Rolle’s Theorem and The Mean
Value Theorem- Maxima and Minima. Integration- Area between Curves - Volumes of Solids Of
Revolution. Functions of Two Variables-Limits and Continuity-Partial Derivatives –Total Differential-
Jacobian. Taylor’s Expansion For two Variables – Maxima and Minima - Lagrange’s Multiplier Method.
Evaluation Of Double Integrals– Change of Order of Integration -Change of Variables -Evaluation of
Triple Integrals-Beta And Gamma Functions-Error Functions Complementary Error Functions. Scalar
and Vector Valued Functions – Gradient, Tangent Plane–Directional Derivative-Divergence and Curl–
Scalar and Vector Potentials. Line, Surface and Volume Integrals - Statement of Green’s, Stoke’s and
Gauss Divergence Theorems.

BMAT101L Calculus L T P C
3 0 0 3
Pre-requisite Nil Syllabus version
1.0
Course Objectives
1. To provide the requisite and relevant background necessary to understand the other
important engineering mathematics courses offered for Engineers and Scientists.
2. To introduce important topics of applied mathematics, namely Single and Multivariable
Calculus and Vector Calculus etc.
3. Enhance to use technology to model the physical situations into mathematical problems,
experiment, interpret results, and verify conclusions.
Course Outcomes
At the end of the course the student should be able to:
1. Apply single variable differentiation and integration to solve applied problems in
engineering and find the maxima and minima of functions
2. Evaluate partial derivatives, limits, total differentials, Jacobians, Taylor series and
optimization problems involving several variables with or without constraints
3. Evaluate multiple integrals in Cartesian, Polar, Cylindrical and Spherical coordinates.
4. Use special functions to evaluate various types of integrals.
5. Understand gradient, directional derivatives, divergence, curl, Green’s, Stokes and Gauss
Divergence theorems.
Module:1 Single Variable Calculus 8 hours
Differentiation- Extrema on an Interval Rolle’s Theorem and the Mean value theorem-
Increasing and decreasing functions.-First derivative test-Second derivative test-Maxima and
Minima-Concavity. Integration-Average function value - Area between curves - Volumes of
solids of revolution.
Module:2 Multivariable Calculus 5 hours
Functions of two variables-limits and continuity-partial derivatives –total differential-Jacobian
and its properties.
Module:3 Application of Multivariable Calculus 5 hours
Taylor’s expansion for two variables–maxima and minima–constrained maxima and minima-
Lagrange’s multiplier method.
Module:4 Multiple integrals 8 hours
Evaluation of double integrals–change of order of integration–change of variables between
Cartesian and polar co-ordinates - evaluation of triple integrals-change of variables between
Cartesian and cylindrical and spherical co-ordinates.
Module:5 Special Functions 6 hours
Beta and Gamma functions–interrelation between beta and gamma functions-evaluation of
multiple integrals using gamma and beta functions. Dirichlet’s integral -Error functions
complementary error functions.
Module:6 Vector Differentiation 5 hours
Scalar and vector valued functions – gradient, tangent plane–directional derivative-
divergence and curl–scalar and vector potentials. Statement of vector identities-simple
problems.
Module:7 Vector Integration 6 hours
Line, surface and volume integrals - Statement of Green’s, Stoke’s and Gauss divergence
theorems -verification and evaluation of vector integrals using them.
Guest lectures from Industry and, Research and Development Organizations
Text Book
1. George B.Thomas, D.Weir and J. Hass, Thomas Calculus, 2014, 13th edition,
Pearson

Reference Books
1. Erwin Kreyszig, Advanced Engineering Mathematics, 2015, 10th Edition, Wiley India
2. B.S. Grewal, Higher Engineering Mathematics, 2020, 44th Edition, Khanna Publishers
3. John Bird, Higher Engineering Mathematics, 2017, 6th Edition, Elsevier Limited.
4. James Stewart, Calculus: Early Transcendental, 2017, 8th edition, Cengage Learning.
5. K.A.Stroud and Dexter J. Booth, Engineering Mathematics, 2013, 7th Edition, Palgrave
Macmillan.
Mode of Evaluation: CAT, Assignment, Quiz and FAT

SHORT SYLLABUS
BMAT101P Calculus Lab

1 Credit (0-0-2)
Extremum of one and two variable functions, Area and Volume evaluations, Lagrange Multiplier opti-
mization method, Evaluation of gradient, curl and divergence, Green’s theorem to real world problems.

BMAT101P Calculus Lab L T P C

0 0 2 1
1.0
Course Objectives
1. To familiarize with the basic syntax, semantics and library functions of MATLAB which
serves as a tool not only in calculus but also many courses in engineering and sciences
2. To visualize mathematical functions and its related properties.
3. To evaluate single and multiple integrals and understand it graphically.
Course Outcomes
1. Demonstrate MATLAB code for challenging problems in engineering
2. Using plots/displays, interpret and illustrate elementary mathematical functions and
procedures.
1. Introduction to MATLAB through matrices and general Syntax
2. Plotting and visualizing curves and surfaces in MATLAB – Symbolic computations
using MATLAB
3. Evaluating Extremum of a single variable function
4. Understanding integration as Area under the curve
5. Evaluation of Volume by Integrals (Solids of Revolution)
6. Evaluating maxima and minima of functions of two variables
7. Applying Lagrange multiplier optimization method
8. Evaluating Volume under surfaces
9. Evaluating triple integrals
10. Evaluating gradient, curl and divergence
11. Evaluating line integrals in vectors
12. Applying Green's theorem to real world problems
Text Book
1. Brian H. Hahn, Daniel T. Valentine, Essential MATLAB for Engineers and
Scientists, Academic Press, 7th edition, 2019.
Reference Books
1. Amos Gilat, MATLAB: An Introduction with Applications, Wiley, 6/e, 2016.
2 Maritn Brokate, Pammy Manchanda, Abul Hasan Siddiqi, Calculus for Scientists and
Engineers, Springer, 2019
Mode of assessment: DA and FAT

SHORT SYLLABUS
BMAT102L Differential Equations and Transforms

4 Credits (3-1-0)
Prerequisites: Calculus Second order non-homogenous differential equations with constant coefficients-
Method of undetermined coefficients-Method of Variation of parameters-Solving Damped forced os-
cillations and LCR circuit theory problems. Formation of partial differential equations –Solutions of
standard types of first order partial differential equations – Lagrange’s linear equation-Method of sep-
aration of variables. Properties of Laplace transform-Laplace transform of standard functions and
periodic functions. Inverse Laplace transform- Applications. Solution of ODE’s - Solution to First or-
der. Fourier series - Dirichlet’s conditions - Half range series –Parseval’s identity- Simple applications
to solve PDE. Z-transform of standard functions - Inverse Z-transform- Difference equation - First and
second order difference equations with constant coefficients - Solution of simple difference equations
using Z-transform.

BMAT102L Differential Equations and Transforms L T P C

3 1 0 4
Pre-requisite BMAT101L, BMAT101P Syllabus version
1.0
Course Objectives
1. To impart the knowledge of Laplace transform, an important transform techniques for
Engineers which requires knowledge of integration.
2. Presenting the elementary notions of Fourier series, this is vital in practical harmonic
analysis.
3. Enriching the skills in solving initial and boundary value problems.
4. Impart the knowledge and application of difference equations and the Z-transform in
discrete systems that are inherent in natural and physical processes.
Course Outcomes
1. Find solution for second and higher order differential equations, formation and
solving partial differential equations.
2. Understand basic concepts of Laplace Transforms and solve problems with periodic
functions, step functions, impulse functions and convolution.
3. Employ the tools of Fourier series and Fourier transforms.
4. Know the techniques of solving differential equations and partial differential
equations.
5. Know the Z-transform and its application in population dynamics and digital signal
processing.
Module:1 Ordinary Differential Equations (ODE) 6 hours

Second order non- homogenous differential equations with constant coefficients- Differential
equations with variable coefficients- method of undetermined coefficients-method of
Variation of parameters-Solving Damped forced oscillations and LCR circuit theory
problems.
Module:2 Partial Differential Equations (PDE) 5 hours
Formation of partial differential equations – Singular integrals — Solutions of standard types
of first order partial differential equations – Lagrange’s linear equation-Method of separation
of variables
Module:3 Laplace Transform 7 hours
Definition- Properties of Laplace transform-Laplace transform of standard functions - Laplace
transform of periodic functions-Unit step function-Impulse function. Inverse Laplace
transform-Partial fractions method and by Convolution theorem..
Module:4 Solution to ODE and PDE by Laplace transform 7 hours
Solution of ODE’s – Non-homogeneous terms involving Heaviside function, Impulse function
- Solving Non-homogeneous system using Laplace transform - solution to First order PDE by
Laplace transform.
Module:5 Fourier Series 6 hours
Fourier series - Euler’s formulae- Dirichlet’s conditions - Change of interval - Half range
series – RMS value – Parseval’s identity.
Module:6 Fourier Transform 6 hours
Complex Fourier transform - properties - Relation between Fourier and Laplace Transforms-
Fourier sine and cosine transforms – Parseval’s identity- Convolution Theorem and simple
applications to solve PDE.
Module:7 Z-Transform 6 hours
Definition of Z-transform and Inverse Z-transform - Standard functions - Partial fractions and
Proceedings of the 64th Academic Council (16.12.2021) 158

convolution method. Difference equation - first and second order difference equations with
constant coefficients - solution of simple difference equations using Z-transform.
Module:8 Contemporary Issues 2 hours

Total Tutorial hours : 15 hours
Text Book(s)
1. Erwin Kreyszig, Advanced Engineering Mathematics, 2015, 10th Edition, John Wiley
India.
2. B.S. Grewal, Higher Engineering Mathematics, 2020, 44th Edition, Khanna
Publishers.
Reference Books
1. Michael D. Greenberg, Advanced Engineering Mathematics, 2006, 2nd Edition,
Pearson Education, Indian edition.
2. A First Course in Differential Equations with Modelling Applications, Dennis Zill,
2018, 11th Edition, Cengage Publishers.
Mode of Evaluation: CAT, written assignment, Quiz, FAT
Recommended by Board of Studies 24-06-2021

Approved by Academic Council No. 64 Date 16-12-2021

SHORT SYLLABUS
BMAT201L Complex Variables and Linear Algebra

4 Credits (3-1-0)
Prerequisites: Differential Equations and Transforms Complex variable - Analytic functions and Cauchy
– Riemann equations- Harmonic functions- Applications of analytic functions to fluid-flow and Field
problems. Conformal mapping Elementary transformations; Bilinear transformation; Power Series -
Taylor and Laurent series. Singularities - Poles – Residues; Integration of a complex function along
a contour; Cauchy-Goursat theorem; Cauchy’s integral formula; Cauchy’s residue theorem; Linear
Algebra-Eigenvalues and Eigen vectors; Cayley-Hamilton theorem; System of linear equations; Gaus-
sian elimination and Gauss Jordan methods, Vector space – subspace- span - linearly dependent –
Independent – bases; Dimensions; Finite dimensional vector space; Row and column spaces; Rank
and nullity, Linear transformations; Invertible linear transformation; Dot products and inner products;
Matrix representations of inner products; Gram - Schmidt – Orthogonalization.

BMAT201L Complex Variables and Linear Algebra L T P C

3 1 0 4
Pre-requisite BMAT102L Syllabus version
1.0
Course Objectives
1. To present comprehensive, compact, and integrated treatment of one of the most
important branches of applied mathematics namely Complex variables to the
engineers and the scientists.
2. To present comprehensive, compact, and integrated treatment of another most
important branches of applied mathematics namely Linear Algebra to the engineers
and the scientists.
3. To provide students with a framework of the concepts that will help them to analyse
deeply about many complex problems.
Course Outcomes
At the end of the course the student should be able to
1. Construct analytic functions and find complex potential of fluid flow and electric fields.
2. Find the image of straight lines by elementary transformations and to express
analytic functions in power series.
3. Evaluate real integrals using techniques of contour integration.
4. Use the power of inner product and norm for analysis.
5. Use matrices and transformations for solving engineering problems.
Module:1 Analytic Functions 7hours

Complex variable - Analytic functions and Cauchy – Riemann equations; Laplace equation
and Harmonic functions; Construction of Harmonic conjugate and analytic functions;
Applications of analytic functions to fluid-flow and electric field problems.
Module:2 Conformal and Bilinear transformations 7 hours
Conformal mapping - Elementary transformations; Translation, Magnification, Rotation,
Inversion; Exponential and Square transformations (w = e z, z2); Bilinear transformation;
Cross-ratio-Images of the regions bounded by straight lines under the above
transformations;
Module:3 Complex Integration 7 hours
Functions given by Power Series - Taylor and Laurent series-Singularities - Poles –
Residues; Integration of a complex function along a contour; Statements of Cauchy-Goursat
theorem- Cauchy’s integral formula-Cauchy’s residue theorem-Evaluation of real integrals-
Indented contour integral.
Module:4 Vector Spaces 6 hours
Vector space – subspace; linear combination - span - linearly dependent – Independent –
bases; Dimensions; Finite dimensional vector space. Row and column spaces; Rank and
nullity.
Module:5 Linear Transformations 6 hours
Linear transformations – Basic properties; Invertible linear transformation; Matrices of linear
transformations; Vector space of linear transformations; Change of bases; Similarity.
Module:6 Inner Product Spaces 5 hours

Dot products and inner products; Lengths and angles of vectors; Matrix representations of
inner products; Gram - Schmidt – Orthogonalization.
Module:7 Matrices and System of Equations 5 hours
Eigenvalues and Eigen vectors; Properties of Eigenvalues and Eigen vectors; Cayley-
Hamilton theorem; System of linear equations; Gaussian elimination and Gauss Jordan
methods.
Module:8 Contemporary issues: 2 hours


Total Tutorial hours : 15 hours
Text Book(s)
1. G. Dennis Zill, Patrick D. Shanahan, A first course in complex analysis with
applications, 2013, 3rd Edition, Jones and Bartlett Publishers Series in Mathematics.
2. Jin Ho Kwak, Sungpyo Hong, Linear Algebra, 2004, Second edition, Springer.
Reference Books
1. Erwin Kreyszig, Advanced Engineering Mathematics, 2015, 10th Edition, John
Wiley & Sons (Wiley student Edition).
2. Michael, D. Greenberg, Advanced Engineering Mathematics, 2006, 2nd Edition,
Pearson Education.
3. Bernard Kolman, David, R. Hill, Introductory Linear Algebra - An applied first course,
2011, 9th Edition Pearson Education.
4. Gilbert Strang, Introduction to Linear Algebra, 2015, 5th Edition, Cengage Learning
5. B.S. Grewal, Higher Engineering Mathematics, 2020, 44th Edition, Khanna
Publishers.
Mode of Evaluation: Digital Assignments(Solutions by using soft skill), Quiz, Continuous
Assessments, Final Assessment Test.


SHORT SYLLABUS
BMAT202L Probability and Statistics
3 Credits (3-0-0)
Prerequisites: Calculus Introduction to statistics and data analysis; Measures of central tendency;
Measures of variability; Random variables, Probability mass Function, Distribution and density func-
tions, Joint Probability distribution and Joint Density functions; Mathematical expectation, and its prop-
erties; Covariance; Moment generating function; Characteristic function. Correlation and Regression;
Rank Correlation; Partial and Multiple correlation; Some standard discrete and continuous distribu-
tions; Testing of hypothesis; Large sample tests - Z test; Small sample tests- Student’s t-test, F-test;
Chi-square test; Design of Experiments; Analysis of variance; CRD-RBD- LSD; Hazard function; Reli-
abilities of series and parallel systems; System Reliability; Maintainability; Preventive and repair main-
tenance; Availability.

BMAT202L Probability and Statistics L T P C

3 0 0 3
1.0
Course Objectives :
1. To provide students with a framework that will help them choose the appropriate
descriptive methods in various data analysis situations.
2. To analyze distributions and relationship of real-time data.
3. To apply estimation and testing methods to make inference and modelling
techniques for decision making.
Course Outcome :
1. Compute and interpret descriptive statistics using numerical and graphical

techniques.
2. Understand the basic concepts of random variables and find an appropriate
distribution for analyzing data specific to an experiment.
3. Apply statistical methods like correlation, regression analysis in analyzing,
interpreting experimental data.
4. Make appropriate decisions using statistical inference that is the central to
experimental research.
5. Use statistical methodology and tools in reliability engineering problems.
Module:1 Introduction to Statistics 6 hours

Statistics and data analysis; Measures of central tendency; Measure of Dispersion,
Moments-Skewness-Kurtosis (Concepts only).
Module:2 Random variables 8 hours
Random variables- Probability mass function, distribution and density functions-Joint
probability distribution and Joint density functions; Marginal, Conditional distribution and
Density functions- Mathematical expectation and its properties- Covariance, Moment
generating function.
Module:3 Correlation and Regression 4 hours
Correlation and Regression – Rank Correlation; Partial and Multiple correlation; Multiple
regression.
Module:4 Probability Distributions 7 hours
Binomial distribution; Poisson distributions; Normal distribution; Gamma distribution;
Exponential distribution; Weibull distribution.
Module:5 Hypothesis Testing-I 4 hours
Testing of hypothesis –Types of errors - Critical region, Procedure for testing of hypothesis-
Large sample tests- Z test for Single Proportion- Difference of Proportion- Mean and
difference of means.
Module:6 Hypothesis Testing-II 9 hours
Small sample tests- Student’s t-test, F-test- chi-square test- goodness of fit - independence
of attributes- Design of Experiments - Analysis of variance – One way-Two way-Three way
classifications - CRD-RBD- LSD.
Module:7 Reliability 5 hours
Basic concepts- Hazard function-Reliabilities of series and parallel systems- System

Reliability - Maintainability-Preventive and repair maintenance- Availability.
Total lecture hours: 45 hours

Text Book:
1. R. E. Walpole, R. H. Myers, S. L. Mayers, K. Ye, Probability and Statistics for
engineers and scientists, 2012, 9th Edition, Pearson Education.
Reference Books
1. Douglas C. Montgomery, George C. Runger, Applied Statistics and Probability for
Engineers, 2016, 6th Edition, John Wiley & Sons.
2. E. Balagurusamy, Reliability Engineering, 2017, Tata McGraw Hill, Tenth reprint.
3. J. L. Devore, Probability and Statistics, 2012, 8th Edition, Brooks/Cole, Cengage
Learning.
4. R. A. Johnson, Miller Freund’s, Probability and Statistics for Engineers, 2011, 8th
edition, Prentice Hall India.
5. Bilal M. Ayyub, Richard H. McCuen, Probability, Statistics and Reliability for
Engineers and Scientists, 2011, 3rd edition, CRC press.
Mode of Evaluation: Digital Assignments, Continuous Assessment Tests, Quiz, Final
Assessment Test.

SHORT SYLLABUS
BMAT202P Probability and Statistics Lab
1 Credit (0-0-2)
Prerequisites: Calculus Simple linear and multiple linear regression models, fitting Binomial, Poisson
and Normal distribution, hypothesis testing, ANOVA for Completely randomized design, Randomized
Block design, Latin square Design.

BMAT202P Probability and Statistics Lab L T P C

0 0 2 1
1.0
Course Objectives:
1. To enable the students for having experimental knowledge of basic concepts of
statistics using R programming.
2. To study the relationship of real-time data and decision making through testing
methods using R.
3. To make students capable to do experimental research using statistics in various
engineering problems.
Course Outcomes:
1. Demonstrate R programming for statistical data.

2. Carry out appropriate analysis of statistical methods through experimental techniques
using R.
1. Introduction: Understanding Data types; importing/exporting data

2. Computing Summary Statistics /plotting and visualizing data using
Tabulation and Graphical Representations
3. Applying correlation and simple linear regression model to real
dataset; computing and interpreting the coefficient of determination Total
4. Applying multiple linear regression model to real dataset; computing Laboratory
and interpreting the multiple coefficients of determination hours: 30
5. Fitting the probability distributions: Binomial distribution
6. Normal distribution, Poisson distribution
7. Testing of hypothesis for one sample mean and proportion from real
time problems
8. Testing of hypothesis for two sample means and proportion from real
time problems
9. Applying the t-test for independent and dependent samples
10. Applying Chi-square test for goodness of fit test and Contingency test
to real dataset
11. Performing ANOVA for real dataset for Completely randomized
design, Randomized Block design, Latin square Design
Text Book
1. Statistical analysis with R by Joseph Schmuller, John wiley and
sons Inc., New Jersey 2017.
Reference Books:
1. The Book of R: A First course in Programming and Statistics, by Tilman M Davies,
William Pollock, 2016.
2. R for Data Science, by Hadley Wickham and Garrett Grolemund, O’ Reilly Media
Inc., 2017.
Mode of assessment: Continuous assessment, FAT / Oral examination and others

Item 67/4.1 - Annexure - 3
Course Code Course Title L T P C

BEEE102L Basic Electrical and Electronics Engineering 3 0 0 3
1.0
Course Objectives
1. Familiarize with various laws and theorems to solve electric and electronic circuits
2. Provide an overview on working principle of machines
3. Excel the concepts of semiconductor devices, op-amps and digital circuits
Course Outcomes
On completion of the course, the students will be able to:
1. Evaluate DC and AC circuit parameters using various laws and theorems
2. Comprehend the parameters of magnetic circuits
3. Classify and compare various types of electrical machines and its applications
4. Design basic combinational circuits in digital system
5. Analyze the characteristics and applications of semiconductor devices
Module:1 DC Circuits 7 hours

Basic circuit elements and sources; Ohms law; Kirchhoff’s laws; Series and Parallel
connection of circuit elements; Star-delta transformation; Mesh current analysis; Node
voltage analysis; Theorems: Thevenin's, Maximum power transfer and Superposition
theorem.
Module:2 AC Circuits 8 hours
Alternating voltages and currents, RMS, average, maximum values, Single Phase RL, RC,
RLC series circuits, Power in AC circuits, Power Factor, Three phase balanced systems,
Star and delta Connections, Electrical Safety, Fuses and Earthing.
Module:3 Magnetic Circuits 7 hours
Magnetic field; Toroidal core: Flux density, Flux linkage; Magnetic circuit with airgap;
Reluctance in series and parallel circuits; Self and mutual inductance; Transformer: turn ratio
determination.
Module:4 Electrical Machines 7 hours
Construction, working principle and applications of DC Machines, Transformers, Three
phase Induction motors, synchronous generators, single phase induction motors, special
machines stepper motor, universal motor and BLDC motor.
Module:5 Digital Systems 7 hours
Binary arithmetic; Number base conversion; Boolean algebra: simplification of Boolean
functions using K-maps; Logic gates; Design of basic combinational circuits: adders,
multiplexers, de-multiplexers.
Module:6 Semiconductor Devices and Applications 7 hours
Characteristics: PN junction diode, Zener diode, BJT, MOSFET; Applications: Rectifier,
Voltage regulator, Operational amplifier.

Text Books
1 Allan R. Hambley, “Electrical Engineering -Principles & Applications”, 2019, 6th Edition,
Pearson Education
2 V. D. Toro, Electrical Engineering Fundamentals, 2nd edition. PHI, 2014
Reference Books
1 R. L. Boylestad and L. Nashelsky, Electronic Devices and Circuit Theory, 11th edition.
Proceedings of the 67th Academic Council (08.08.2022)

112
Pearson, 2012
2 DP Kothari & Nagrath, “Basic Electric Engineering”, 2019, Tata McGraw Hill

113
Course code Course Title L T P C

BEEE102P Basic Electrical and Electronics Engineering Lab 0 0 2 1
1.0
Course Objective
1. Design and solve the fundamental electrical and electronics circuits
Course Outcomes
1. Identify appropriate method of solving the fundamental electrical and electronics circuits
2. Design and conduct experiments on electrical and electronics circuits
Experiments (Indicative)
1 Verification of Kirchoff’s law
2 Verification of Maximum Power Transfer Theorem
3 Staircase wiring circuit layout for multi storage building
4 Lamp dimmer circuit (Darlington pair circuit using transistors) used in cars.
5 Measurement of Earth resistance using Megger
6 Sinusoidal steady state response of RLC circuits
7 Three phase power measurement for ac loads
8 Design of half-adder and full-adder digital circuits
9 Synthesis of 8x1 multiplexer and 1x8 de-multiplexers
10 Characteristics of PN diode and acts as switch
11 Realization of single-phase rectifier
12 Design of regulated power supply using Zener diode.
13 Characteristics of MOSFET
14 Characteristics of BJT
15 Measurement of energy using single-phase energy meter
16 Measurement of power in a 1-phase circuit by using CTs and PTs

Mode of assessment: Continuous assessment, FAT

114
SHORT SYLLABUS
BCSE101E Computer Programming: Python
3 Credits (1-0-4)
Fundamentals of problem Solving. Basic constructs in python. Control Structures. Collections. Strings
and Regular Expressions. Functions. Files and Packages.

BCSE101E Computer Programming: Python L T P C

1 0 4 3
1.0
Course Objectives
1. To provide exposure to basic problem-solving techniques using computers.
2. To inculcate the art of logical thinking abilities and propose novel solutions for real world
problems through programming language constructs.
Course Outcome
1. Classify various algorithmic approaches, categorize the appropriate data representation,
and demonstrate various control constructs.
2. Choose appropriate programming paradigms, interpret and handle data using files to
propose solution through reusable modules; idealize the importance of modules and
packages.
Module:1 Introduction to Problem Solving 1 hour

Problem Solving: Definition and Steps, Problem Analysis Chart, Developing an Algorithm,
Flowchart and Pseudocode.
Module:2 Python Programming Fundamentals 2 hours
Introduction to python – Interactive and Script Mode – Indentation – Comments – Variables
– Reserved Words – Data Types – Operators and their precedence – Expressions – Built-in
Functions – Importing from Packages.
Module:3 Control Structures 2 hours
Decision Making and Branching: if, if-else, nested if, multi-way if-elif statements – Looping:
while loop, for loop – else clauses in loops, nested loops – break, continue and pass
statements.
Module:4 Collections 3 hours
Lists: Create, Access, Slicing, Negative indices, List methods, List comprehensions –
Tuples: Create, Indexing and slicing, Operations on tuples – Dictionary: Create, add, and
replace values, Operations on dictionaries – Sets: Creation and operations.
Module:5 Strings and Regular Expressions 2 hours
Strings: Comparison, Formatting, Slicing, Splitting, Stripping – Regular Expressions:
Matching,
Search and replace, Patterns.
Module:6 Functions and Files 3 hours
Functions – Parameters and Arguments: Positional arguments, Keyword arguments,
Parameters
with default values – Local and Global scope of variables – Functions with Arbitrary
arguments – Recursive Functions – Lambda Function. Files: Create, Open, Read, Write,
Append and Close – tell and seek methods.
Module:7 Modules and Packages 2 hours
Built-in modules – User-Defined modules – Overview of Numpy and Pandas packages.

Text Book(s)
1. Eric Matthes, Python Crash Course: A Hands-On, Project-Based Introduction to
Programming, 2nd Edition, No starch Press, 2019
Reference Books
1. Martic C Brown, Python: The Complete Reference, 4th Edition, McGraw Hill Publishers,
2018.
2. John V. Guttag, Introduction to computation and programming using python: with
applications to understanding data. 2nd Edition, MIT Press, 2016.

Mode of Evaluation: No separate evaluation for theory component.

1. Problem Analysis Chart, Flowchart and Pseudocode Practices.
2. Sequential Constructs using Python Operators, Expressions.
3. Branching (if, if-else, nested if, multi-way if-elif statements) and Looping (for, while,
nested
looping, break, continue, else in loops).
4. List, Tuples, Dictionaries & Sets.
5. Strings, Regular Expressions.
6. Functions, Lambda, Recursive Functions and Files.
7. Modules and Packages (NumPy and Pandas)
Text Book(s)
1. Mariano Anaya, Clean Code in Python: Develop maintainable and efficient code, 2nd
Edition, Packt Publishing Limited, 2021.
Reference Books
1. Harsh Bhasin, Python for beginners, 1st Edition, New Age International (P) Ltd., 2019,
Mode of assessment: Continuous assessments and FAT

SHORT SYLLABUS
BCSE102L Structured and Object-Oriented Programming

2 Credits (2-0-0)
C Programming fundamentals. Arrays and Functions. Pointers, Structures and Unions. Overview of
Object-Oriented Programming. Inheritance and Polymorphism. Generic Programming.

BCSE102L Structured and Object-Oriented Programming L T P C

2 0 0 2
1.0
Course Objectives
1. To impart the basic constructs in structured programming and object-oriented
programming paradigms.
2. To inculcate the insights and benefits in accessing memory locations by
implementing real world problems.
3. To help solving real world problems through appropriate programming paradigms.
Course Outcome
At the end of the course, students should be able to:
1. Understand different programming language constructs and decision-making
statements; manipulate data as a group.
2. Recognize the application of modular programming approach; create user defined
data types and idealize the role of pointers.
3. Comprehend various elements of object-oriented programing paradigm; propose
solutions through inheritance and polymorphism; identify the appropriate data
structure for the given problem and devise solution using generic programming
techniques.
Module:1 C Programming Fundamentals 2 hours

Variables - Reserved words – Data Types – Operators – Operator Precedence -
Expressions - Type Conversions - I/O statements - Branching and Looping: if, if-else, nested
if, if-else ladder, switch statement, goto statement - Loops: for, while and do…while – break
and continue statements.
Module:2 Arrays and Functions 4 hours

Arrays: One Dimensional array - Two-Dimensional Array – Strings and its operations. User
Defined Functions: Declaration – Definition – call by value and call by reference - Types of
Functions - Recursive functions - Storage Classes - Scope, Visibility and Lifetime of
Variables.
Module:3 Pointers 4 hours

Declaration and Access of Pointer Variables, Pointer arithmetic – Dynamic memory
allocation – Pointers and arrays - Pointers and functions.
Module:4 Structure and Union 2 hours

Declaration, Initialization, Access of Structure Variables - Arrays of Structure - Arrays within
Structure - Structure within Structures - Structures and Functions – Pointers to Structure -
Union.
Module:5 Overview of Object-Oriented 5 hours
Programming
Features of OOP - Classes and Objects - “this” pointer - Constructors and Destructors -
Static Data Members, Static Member Functions and Objects - Inline Functions – Call by
reference - Functions with default Arguments - Functions with Objects as Arguments - Friend
Functions and Friend Classes.
Module:6 Inheritance 5 hours

Inheritance - Types of Inheritance: Single inheritance, Multiple Inheritance, Multi-level

Inheritance, Hierarchical Inheritance - Multipath Inheritance - Inheritance and constructors.
Module:7 Polymorphism 4 hours

Function Overloading - Operator Overloading – Dynamic Polymorphism - Virtual Functions -
Pure virtual Functions - Abstract Classes.
Module:8 Generic Programming 4 hours

Function templates and class templates, Standard Template Library.

Text Book(s)
1. Herbert Schildt, C: The Complete Reference, 4th Edition, McGraw Hill Education,
2017
2. Herbert Schildt, C++: The Complete Reference, 4th Edition, McGraw Hill Education,
2017.
Reference Books
1. Yashavant Kanetkar, Let Us C: 17th Edition, BPB Publicaitons, 2020.
2. Stanley Lippman and Josee Lajoie, C++ Primer, 5th Edition, Addison-Wesley publishers,
2012.
Mode of Evaluation: CAT / Written Assignment / Quiz / FAT / Project.

SHORT SYLLABUS
BCSE102P Structured and Object-Oriented Programming Lab
2 Credits (0-0-4) To exercise fundamentals of C Programming language. Idealize the use of one-
dimensional arrays, two dimensional arrays. Exploring operations on string. Design user defined
functions. User defined data type creation using structures and their manipulation. Manipulating
pointers. Classes and Objects. Implementation of Inheritance. Understanding Polymorphism. De-
signing class and function templates. Using Standard Template Libraries.

BCSE102P Structured and Object-Oriented Programming Lab L T P C
0 0 4 2
1.0
Course Objectives
1. To impart the basic constructs in structured programming and object-oriented
programming paradigms.
2. To inculcate the insights and benefits in accessing memory locations by
implementing real world problems.
3. To solve real world problems through appropriate programming paradigms.
Course Outcome
At the end of the course, students should be able to:
1. Understand different programming language constructs and decision-making
statements; manipulate data as a group.
2. Recognize the application of modular programming approach; create user defined
data types and idealize the role of pointers.
3. Comprehend various elements of object-oriented programing paradigm; propose
solutions through inheritance and polymorphism; identify the appropriate data
structure for the given problem and devise solution using generic programming
techniques.
1. Programs using basic control structures, branching and looping
2. Experiment the use of 1-D, 2-D arrays and strings and Functions
3. Demonstrate the application of pointers
4. Experiment structures and unions
5. Programs on basic Object-Oriented Programming constructs.
6. Demonstrate various categories of inheritance
7. Program to apply kinds of polymorphism.
8. Develop generic templates and Standard Template Libraries.
Text Book(s)
1. Mariano Anaya, Clean Code in Python: Develop maintainable and efficient code, 2nd
Edition, Packt Publishing Limited, 2021.
Reference Book(s)
2. Harsh Bhasin, Python for beginners, 1st Edition, New Age International (P) Ltd., 2019.
Mode of assessment: Continuous assessments and FAT.

SHORT SYLLABUS
BCSE103E Computer Programming: Java

3 Credits (1-0-4)
Basics of Object-Oriented Programming. Java basic constructs and data types. Looping and Arrays.
Classes and Objects. Inheritance and Polymorphism. Packages and Exception Handling. Files and
IO Streams. Collection Framework.

BCSE103E Computer Programming : Java L T P C

1 0 4 3
1.0
Course Objectives:
1. To introduce the core language features of Java and understand the fundamentals of
Object -Oriented programming in Java.
2. To develop the ability of using Java to solve real world problems.
Course Outcome:
At the end of this course, students should be able to:
1. Understand basic programming constructs; realize the fundamentals of Object

Orientated Programming in Java; apply inheritance and interface concepts for
enhancing code reusability.
2. Realize the exception handling mechanism; process data within files and use the
data structures in the collection framework for solving real world problems.
Module:1 Java Basics 2 hours
OOP Paradigm - Features of Java Language - JVM - Bytecode - Java program structure –
Basic programming constructs - data types - variables – Java naming conventions –
operators.
Module:2 Looping Constructs and Arrays 2 hours
Control and looping constructs - Arrays – one dimensional and multi-dimensional –
enhanced for loop – Strings - Wrapper classes.
Module:3 Classes and Objects 2 hours
Class Fundamentals – Access and non-access specifiers - Declaring objects and assigning
object reference variables – array of objects – constructors and destructors – usage of “this”
and “static” keywords.
Module:4 Inheritance and Polymorphism 3 hours
Inheritance – types –- use of “super” – final keyword - Polymorphism – Overloading and
Overriding - abstract class – Interfaces.
Module:5 Packages and Exception Handling 2 hours
Packages: Creating and Accessing - Sub packages.
Exception Handling - Types of Exception - Control Flow in Exceptions - Use of try, catch,
finally, throw, throws in Exception Handling - User defined exceptions.
Module:6 IO Streams and Files 2 hours
Java I/O streams – FileInputStream & FileOutputStream – FileReader & FileWriter-
DataInputStream & DataOutputStream – BufferedInputStream & BufferedOutputStream –
PrintOutputStream - Serialization and Deserialization.
Module:7 Collection Framework 2 hours
Generic classes and methods - Collection framework: List and Map.

Text Book(s)
1. Y. Daniel Liang, “Introduction to Java programming” - comprehensive version-11th
Edition, Pearson publisher, 2017.
Reference Books
1. Herbert Schildt , The Complete Reference -Java, Tata McGraw-Hill publisher, 10th
Edition, 2017.
2 Cay Horstmann,”Big Java”, 4th edition, John Wiley & Sons publisher, 5th edition, 2015
3 E.Balagurusamy, “Programming with Java”, Tata McGraw-Hill publishers, 6th edition,
2019

Mode of Evaluation: No separate evaluation for theory component.
1. Programs using sequential and branching structures.

2. Experiment the use of looping, arrays and strings.
3. Demonstrate basic Object-Oriented programming elements.
4. Experiment the use of inheritance, polymorphism and abstract classes.
5. Designing packages and demonstrate exception handling.
6. Demonstrate the use of IO streams, file handling and serialization.
7. Program to discover application of collections.
Text Book(s)
1. Marc Loy, Patrick Niemeyer and Daniel Leuck, Learning Java, O'Reilly Media, Inc.,
5th Edition, 2020.
Reference Books
1. Dhruti Shah, 100+ Solutions in Java: A Hands-On Introduction to Programming in
Java, BPB Publications, 1st Edition, 2020.
Mode of assessment: Continuous assessments and FAT

SHORT SYLLABUS
BENG101N Effective English Communication
2 Credits (0-0-4)
Fundamentals of Grammar, Vocabulary Enrichment, Speaking to Convey and Interactive Speaking,
Basic listening and Pronunciation Practice, Reading Strategies, Skimming Scanning Techniques and
Reading for Pleasure, Drafting Paragraphs, Letter and Email Writing, Reading Short stories by Indian
writers

BENG101N Effective English Communication L T P C

0 0 4 2
Pre-requisite Nil Syllabus Version
1.0
Course Objectives:
1. To hone LSRW skills for effective communication
2. To enhance communication skills for future career aspirations
3. To gain critical communication skills in writing and public speaking
Course Outcomes:
1. Write effective sentences using appropriate grammar and vocabulary
2. Express clearly in everyday conversations with lucid pronunciation
3. Analyse the given listening inputs for effective comprehension
4. Apply different reading strategies to various texts and use them appropriately
1. Fundamentals of Grammar: Parts of Speech, Articles, Tenses, Sentence Structure,
Types of Sentences, Subject-Verb Agreement
Activity: Exercises and worksheets
2. Speaking for Self-Expression: Formal Self-Introduction, Expressing Oneself
Activity: Self-Introduction, Just a Minute (JAM)
3. Basic Listening: Listening to Simple Conversations, Short Speeches/Stories
Activity: Gap fill exercises
4. Reading Skills: Reading Strategies, Skimming and Scanning
Activity: Cloze reading, Reading comprehension, Reading newspaper articles
5. Drafting Paragraphs: Keywords Development, Writing Paragraphs using Connectives
Activity: Picture and poster interpretation
6. Vocabulary Enrichment: Synonyms and Antonyms, Prefixes and Suffixes, Word
Formation, One Word Substitution, Frequently used Idioms and Phrases, Homophones
and Homonyms
Activity: Crossword puzzles and worksheets
7. Listening for Pronunciation: Introduction to Phonemes, Listening to Native
Speakers, Listening to Various Accents
Activity: Listening and imitating, Spell Bee
8. Interactive Speaking: Everyday Conversations, Team Interactions, Simulations
Activity: Situational role plays
9. Email and Letter Writing: Types and Format of Emails and Letters
Activity: Official e-mails and letters, personal letters
10. Reading for Comprehension: Short Stories by Indian Writers
Activity: Summarising, loud reading
Mode of Evaluation: Continuous assessment / FAT / Written assignments / Quiz/ Oral
examination / Group activity

SHORT SYLLABUS
BENG101L Technical English Communication

2 Credits (2-0-0)
Introduction to Communication, grammar, written correspondence, business correspondence, profes-
sional writing, team building, leadership skills, analysing and interpreting texts

BENG101L Technical English Communication L T P C

2 0 0 2
1.0
Course Objectives:
1. To develop LSRW skills for effective communication in professional situations
2. To enhance knowledge of grammar and vocabulary for meaningful communication
3. To understand information from diverse texts for effective technical communication
Course Outcomes:
1. Use grammar and vocabulary appropriately while writing and speaking
2. Apply the concepts of communication skills in formal and informal situations
3. Demonstrate effective reading and listening skills to synthesize and draw intelligent
inferences
4. Write clearly and significantly in academic and general contexts
Module:1 Introduction to Communication 4 hours
Nature and Process - Types of communication: Intra-personal, Interpersonal, Group-verbal
and non-verbal communication / Cross-cultural Communication - Communication Barriers
and Essentials of good communication - Principles of Effective Communications
Module:2 Grammatical Aspects 4 hours
Sentence Pattern - Modal Verbs - Concord (SVA) - Conditionals - Error detection
Module:3 Written Correspondence 4 hours
Job Application Letters - Resume Writing - Statement of Purpose
Module:4 Business Correspondence 4 hours
Business Letters: Calling for Quotation, Complaint & Sales Letter – Memo - Minutes of
Meeting - Describing products and processes
Module:5 Professional Writing 4 hours
Paraphrasing & Summarizing - Executive Summary - Structure and Types of Proposal –
Recommendations
Module:6 Team Building & Leadership Skills 4 hours
Principles of Leadership - Team Leadership Model - Negotiation Skills - Conflict
Management
Module:7 Research Writing 4 hours
Interpreting and Analysing a research article - Approaches to Review Paper Writing -
Structure of a research article - Referencing
Module:8 Guest Lecture from Industry and R&D organizations 2 hours
Contemporary Issues
Text Book(s)
1. Raman, Meenakshi & Sangeeta Sharma. (2015). Technical Communication: Principles
and Practice, (3rd Edition). India: Oxford University Press.
Reference Books
1. Taylor, Shirley & Chandra .V. (2010). Communication for Business A Practical Approach
4th Edition. India: Pearson Longman.
2. Kumar, Sanjay & Pushpalatha. (2018). English Language and Communication Skills for
Engineers. India: Oxford University Press.
3. Koneru Aruna. (2020). English Language Skills for Engineers. India: McGraw Hill
Education.
4. Rizvi, M. Ashraf. (2018). Effective Technical Communication 2nd Edition. Chennai:
McGraw Hill Education.
5. Mishra, Sunitha & Muralikrishna,C. (2014). Communication Skills for Engineers. India:
Pearson Education.

6. Watkins, P. (2018). Teaching and Developing Reading Skills: Cambridge Handbooks for
Language teachers. India: Cambridge University Press.
Mode of Evaluation : CAT / Assignment / Quiz / FAT / Group Discussion

SHORT SYLLABUS
BENG101P Technical English Communication Lab
1 Credit (0-0-2)
Grammar, vocabulary, listening to narratives, presentations, intensive reading, group communication,
public speaking, extensive reading, workplace communication, listening to scientific documentaries,
case study analysis.

BENG101P Technical English Communication Lab L T P C

0 0 2 1
1.0
Course Objectives:
1. To use appropriate grammatical structures in professional communication
2. To improve English communication skills for better employability
3.To enhance meaningful communication skills in writing and public speaking
Course Outcomes:
1.Demonstrate professional rhetoric and articulate ideas effectively
2. Interpret material on technology and deliver eloquent presentations
3. Apply receptive and productive skills in real life situations and develop workplace
communication
1. Grammar & Vocabulary
Error Detection
Activity: -Worksheets
2. Listening to Narratives
Interviews of eminent personalities & Ted Talks
Activity: Listening Comprehension / Summarising
3. Video Resume
SWOT Analysis & digital resume techniques
Activity: Preparing a digital résumé for mock interview
4. Product & Process Description
Describing and Sequencing
Activity: Demonstration of product and process
5. Mock Meetings
Types of meetings and meeting etiquette
Activity: Conduct of meetings and drafting minutes of the meeting
6. Reading research article
Scientific and Technical articles
Activity: Writing Literature review
7. Analytical Reading
Case Studies on Communication, Team Building and Leadership
Activity: Group Discussion
8. Presentations
Preparing Conference/Seminar paper
Activity: Individual/ Group presentations
9. Intensive Listening
Scientific documentaries
Activity: Note taking and Summarising
10. Interview Skills
Interview questions and techniques
Activity: Mock Interviews
Mode of Assessment: Continuous Assessment / FAT / Written Assignments / Quiz/ Oral
Presentation and Group Activity.

SHORT SYLLABUS
BENG102P Technical Report Writing

1 Credit (0-0-2)
Advanced grammar, technical vocabulary, research and analyses, Introduction to technical writing,
systematise and categorize information, Categories and types of reports, Structure of reports,
supple-mentary texts, research paper writing, and Presenting Technical reports.

BENG102P Technical Report Writing L T P C

0 0 2 1
Pre-requisite Technical English Communication Syllabus version
1.0
Course Objectives:
1. To augment specific writing skills for preparing technical reports
2. To think critically, evaluate, analyse general and complex technical information
3. To acquire proficiency in writing and presenting reports
Course Outcomes:
1.Write error free sentences using appropriate grammar, vocabulary and style
2. Synthesize information and concepts in preparing reports
3. Demonstrate the ability to write and present reports on diverse topics
1. Advanced Grammar, Vocabulary and Editing
Usage of Tenses - Adjectives and Adverbs - Jargon vs Technical Vocabulary –
Abbreviations - Mechanics of Editing: Punctuation and Proof Reading
Activity: Worksheets
2. Research and Analyses
Synchronise Technical Details from Newspapers - Magazines - Articles and e-content
Activity: Writing introduction and literature review
3. Systematisation of Information
Techniques to Converge Objective-Oriented data in Diverse Technical
Reports Activity: Preparing Questionnaire
4. Data Visualisation
Interpreting Data - Graphs - Tables – Charts - Imagery - Infographics
Activity: Transcoding
5. Introduction to Reports
Meaning - Definition - Purpose - Characteristics and Types of Reports
Activity: Worksheets on Types of reports
6. Structure of Reports
Title – Preface – Acknowledgement - Abstract/Summary – Introduction - Materials and
Methods – Results – Discussion - Conclusion - Suggestions/Recommendations
Activity: Identifying the structure of report
7. Report Writing
Data Collection - Draft an Outline and Organize Information
Activity: Drafting reports
8. Supplementary Texts
Appendix – Index – Glossary – References – Bibliography - Notes
Activity: Organizing supplementary texts
9. Review of Final Reports
Structure – Content – Style - Layout and Referencing
Activity: Examining clarity and coherence in final reports
10. Presentation
Presenting Technical Reports
Activity: Planning, creating and digital presentation of reports
Mode of assessment: Continuous Assessment / FAT / Assignments / Quiz / Presentations /
Oral examination

Agenda Item 65/49 - Annexure - 45
Short Syllabus
Discipline-Linked Engineering Sciences
BMAT205L Discrete Mathematics and Graph Theory (3-1-0-4)
Mathematical Logic-Tautologies, Predicate Calculus; Algebraic Structures-Groups,

Subgroups, Homomorphism; Counting Techniques-Pigeonhole principle, Permutations and
combinations, Inclusion-exclusion principle, Recurrence relations; Lattices and Boolean
algebra-Partially Ordered Relations, Boolean algebra; Fundamentals of Graphs- Planar,
Complete graph, Euler and Hamilton Paths, Shortest Path algorithms; Trees, Fundamental
circuits, Cut sets-Trees, Spanning Trees, Fundamental circuits and cut-sets; Graph
colouring, covering, Partitioning-Chromatic number, Four Colour problem.

BMAT205L Discrete Mathematics and Graph Theory L T P C

3 1 0 4
Pre-requisite NIL Syllabus Version
1.0
Course Objectives:
1. To address the challenges of the relevance of lattice theoryand algebraic structures
to computer science and engineering problems.
2. To use Counting techniques, in particular recurrence relations to computer science
problems.
3. To understand the concepts of graph theory and related algorithm concepts.
Course Outcomes:
At the end of this course, students are expected to
1. Learn proof techniques and concepts of inference theory
2. Use algebraic structures in applications
3. Counting techniques in engineering problems.
4. Use lattice and Boolean algebra properties in Digital circuits.
5. Solve Science and Engineering problems using Graph theory.
Module:1 Mathematical Logic 7 hours
Statements and Notation-Connectives–Tautologies-Equivalence - Implications–Normal
forms - The Theory of Inference for the Statement Calculus - Predicate Calculus - Inference
Theory of the Predicate Calculus
Module:2 Algebraic Structures 6 hours
Semigroups and Monoids - Groups – Subgroups – Lagrange’s Theorem Homomorphism –
Properties-Group Codes.
Module:3 Counting Techniques 6 hours
Basics of counting - Pigeonhole principle - Permutations and combinations - Inclusion-
exclusion principle - Recurrence relations - Solving recurrence relations - Generating
functions-Solution to recurrence relations.
Module:4 Lattices and Boolean algebra 6 hours
Partially Ordered Relations -Lattices as Posets – Hasse Digram – Properties of Lattices –
Boolean algebra-Properties of Boolean Algebra-Boolean functions.
Module:5 Fundamentals of Graphs 6hours
Basic Concepts of Graph Theory – Planar and Complete graph - Matrix representation of
Graphs – Graph Isomorphism – Connectivity–Cut sets-Euler and Hamilton Paths–Shortest
Path algorithms
Module:6 Trees, Fundamental circuits, Cut sets 6 hours
Trees – properties of trees – distance and centres in tree – Spanning trees – Spanning tree
algorithms- Tree traversals- Fundamental circuits and cut-sets
Module:7 Graph colouring, covering, Partitioning 6 hours
Bipartite graphs - Chromatic number – Chromatic partitioning – Chromatic polynomial -
matching – Covering– Four Colour problem.

Total Tutorial hours: 15 hours
Text Books:
1. Discrete Mathematical Structures with Applications to Computer Science, J .P.
Trembley and R. Manohar, Tata McGraw Hill-35th reprint, 2017.
2. Graph theory with application to Engineering and Computer Science, NarasingDeo,

Prentice Hall India 2016.

Reference Books:
1. Discrete Mathematics and its applications, Kenneth H. Rosen, 8th Edition, Tata McGraw
Hill,
2019.
2. Discrete Mathematical Structures, Kolman, R.C.Busby and S.C.Ross, 6th Edition, PHI,
2018.
3. Discrete Mathematics, Richard Johnsonbaugh, 8th Edition, Prentice Hall, 2017.
4. Discrete Mathematics, S. Lipschutz and M. Lipson, McGraw Hill Education (India) 2017.
5. Elements of Discrete Mathematics–A Computer Oriented Approach, C.L.Liu, Tata
McGraw
Hill, Special Indian Edition, 2017.
6.Introduction to Graph Theory, D. B. West, 3rd Edition, Prentice-Hall, Englewood Cliffs, NJ,
2015.
Mode of Evaluation: CAT, Quizzes, Digital Assignments, FAT

Short Syllabus
BECE201L Electronic Materials and Devices (3-0-0-3)
Atomic Structure, Bonding and Types of solid, Single Crystal Growth, Drude Model , Hall
effect, Skin effect, Energy bands, Semiconductor materials, Doping, Carrier statistics, Carrier
transport, Semiconductor Junctions, Bipolar Junction Transistors (BJT), BJT characteristics
and models, MOS Capacitors, MOS Field Effect Transistors (MOSFET), MOSFET
characteristics and models, Short channel effects, Advanced Materials
BECE201L Electronic Materials and Devices L T P C

3 0 0 3
1.0
Course Objectives
1. To introduce the students with concepts of electronic materials and their properties
2. To demystify semiconductor device physics and electronics.
3. To equip the students with the tools for solving problems of semiconductor devices
and circuits.
4. To familiarize the students with various electronic devices and their circuit
applications.
Course Outcome
Students will be able to:
1. Comprehend the basics of electronic materials, crystal structure, electrical and
thermal conduction in solids.
2. Draw and analyze the band diagrams of semiconductor devices.
3. Understand and model the carrier transport mechanisms in semiconductors.
4. Design and model the PN- junctions for given specifications.
5. Develop small signal models for BJT and also design BJT amplifiers under different
Configurations.
6. Model MOS capacitors, MOSFETs; learn and mitigate the short channel effects and
design future technology nodes.
Module:1 Electrical and Thermal conduction in Solids 6 hours
Crystalline state – Crystalline defects – Single Cyrstal Growth -Czochralski Growth –
Amorphous Semiconductor - Classical Theory: Drude Model – Temperature dependence of
resistivity – The Hall Effect and Hall Devices – Thermal conduction – Electrical conductivity
of non-metals – Skin Effect – Thin metal films.
Module:2 Semiconductor Fundamentals 7 hours
Introduction to Solids, Crystals, and Electronic materials – Formation of energy bands –
Energy band Model – Effective mass - Direct and indirect bandgap – Elemental and
compound semiconductors, Intrinsic and extrinsic semiconductors. The density of states,
Carrier statistics, Fermi level, Equilibrium carrier concentration, Quasi-equilibrium, and
Quasi-Fermi level.
Module:3 Carrier Transport Mechanism 6 hours
Charge carriers in semiconductors – Drift and Diffusion of carriers – Mobility – Generation,
Recombination and injection of carriers – Carrier transport equations – Excess carrier
lifetime.
Module:4 Junction diodes 8 hours
PN Junction – Equilibrium and biased – Contact potential and space charge phenomena,
Current – Voltage relationship, Diode capacitances, One-sided PN junction, Avalanche and
Zener breakdown, Zener diode, small-signal model of PN junction. Metal-Semiconductor
Contact: Schottky diode, current-voltage characteristics, Ohmic contacts. Varactor diode,
Tunnel diode, Photo Diode, Solar Cells.
Module:5 Bipolar Junction Transistor 5 hours
Device structure and physical operation, Current – Voltage relationship – CB, CE, and CC
configuration – Nonideal effects – Base width modulation – Ebers-Moll model. Small signal
models, Device capacitances – Equivalent circuit model.
Module:6 Field Effect Transistor 7 hours
JFET, MOS Capacitors: Energy-band diagrams, flat-band, accumulation, depletion,
inversion, threshold voltage, Capacitance-Voltage characteristics. MOSFETs: Current-
Voltage characteristics, velocity saturation, leakage currents, short channel effects – Vt roll-
off and drain-induced barrier lowering, scaling limits, alternative technologies. Equivalent
circuit model-second order effects.

Module:7 Other Electronic Materials 4 hours

Dielectrics, Insulators, Ferroelectric Materials, Supercapacitors, Graphene, Carbon
Nanotubes, Superconductors
Guest lecture from industry and R & D organizations
Text Book(s)
1. S.O.Kasap, Principles of Electronic Materials and Devices , 2018, 4th Edition,
Reference Books
1. Simon Sze, Ming-Kwei Lee, Semiconductor Devices, Physics and Technology,2012,
3rd Edition, Wiley International Student Version.
2. Ben G Streetman and Sanjay Kumar Banerjee, Solid State Electronic Devices, 2015,
7th Edition, Pearson.
3. Adel S. Sedra, Kenneth C. Smith & Arun N. Chandorkar, Microelectronic
Circuits: Theory and Applications,2014, 7th Edition, Oxford University Press, New
York.
4. Donald A. Neamen, Semiconductor Physics and Devices, 2017,4th Edition, McGraw

Hill.
Mode of Evaluation: CAT / written assignment / Quiz / FAT / Project / Seminar / group
discussion / fieldwork (include only those that are relevant to the course. Use ‘,’ to separate
the evaluations. Eg. CAT, Quiz and FAT.


Short Syllabus
BECE203L Circuit Theory (3-1-0-4)
Steady state and transient sinusoidal analysis and network theorems using phasors,
Resonance , Graph theory and its applications in circuit solving, Two-port networks and
interconnection of networks, Passive filters and attenuators, Applications of Laplace and
Fourier transforms, Fourier series analysis of electrical circuits.
BECE203L Circuit Theory L T P C

3 1 0 4
Pre-requisite BEEE101L, BEEE101P Syllabus version
1.0
Course Objectives
1. To prepare the students to analyse the given electrical network using phasors and
graph theory.
2. To introduce the students with the basic knowledge of Laplace transform, Fourier
Transform and Fourier series and to analyse the network using suitable technique.
3. To prepare the students to analyse the two-port networks, passive filters, and
attenuators.
Course Outcome
1. Apply the knowledge of various circuit analysis techniques such as mesh analysis,
nodal analysis, and network theorems to investigate the given network.
2. Analyse the resonance and transient response of the first order, second order circuits
3. Able to solve the networks using graphical approach.
4. Design and analyse two-port networks, passive filters and attenuators.
5. Able to analyse the given network by transforming from time domain to S domain.
6. Analyse the given network using Fourier series and transforming from time domain to
frequency domain.
Module:1 Sinusoidal Steady-State Analysis 10 hours

Review of steady state sinusoidal analysis using phasors. Node voltage and Mesh current
analysis, special cases. Network theorems: Superposition, Thevenin, Norton and maximum
power transfer theorems.
Module:2 Transient Response of first order, second order circuits 10 hours
and Resonance
Time response in inductance (L) and capacitance (C), steady state response of circuits with
RLC components. Response (forced & natural) of first order circuits (RL & RC): series,
parallel, source free, complex circuits with more than one resistance, power sources and
switches. Response of second order circuit (RLC): series, parallel and complex circuits.
Series and parallel resonance condition.
Module:3 Network Graphs 6 hours
Definition of terms. Matrices associated with graphs: incidence, reduced incidence,
fundamental cut-set and fundamental tie-set.
Module:4 Two-Port Networks 8 hours
Significance and applications of one port and two port networks. Two port network analysis
using Admittance (Y) parameters, Impedance (Z) parameters and Hybrid (h) parameters.
Interconnection of Two port networks
Module:5 Filters, Attenuators and equalizers 8 hours
Concept of filtering. Filter types: Low-pass, High-pass, Band-pass and Band-stop and their
characteristics. Design of attenuators: T, π, Lattice and Bridged-T types, Equalizers.
Module:6 Circuit Analysis in the S domain
8 hours
Introduction to Laplace transform (LT), poles, zeros and transfer functions. Analysis of first
and second order circuits subjected to periodic and aperiodic excitations using Laplace
transforms.
Module:7 Application of Fourier series and Fourier 8 hours
transforms in Circuit Analysis
Trigonometric Fourier series, Symmetry conditions, Applications in circuit solving, Fourier
transforms. Properties, Applications in circuit solving, Comparisons of Fourier and Laplace
transforms.


Text Book(s)
1. Charles K. Alexander, Matthew N. O. Sadiku, “Fundamentals of Electric Circuits,” 2020,
Seventh Edition, McGraw Hill Higher Education.
Reference Books
1. W.H.Hayt, J.E.Kemmerly & S.M.Durbin, “Engineering Circuit Analysis”, 2019, Ninth
Edition, McGraw Hill Higher Education.
2. Allan R. Hambley, “Electrical Engineering – Principles & applications”, 2016, Sixth
Edition, Pearson Education, Noida, India.
Mode of Evaluation: Internal Assessment (CAT, Quizzes, Digital Assignments) & Final
Assessment Test (FAT)


Short Syllabus
BECE102L Digital Systems Design (3-0-0-3)
Digital Logic - Boolean algebra, Gate level minimization; Verilog HDL – Data flow modelling,
Test bench; Design of combinational logic circuits – Full Adder, Full Subtractor, Multiplexers,
Modeling of Combinational logic circuits using Verilog HDL; Design of Data path circuits - N-bit
Parallel Adder/Subtractor; Design of Sequential logic circuits – Shift Registers, state table and
state diagrams; Design of FSM - Modeling of FSM using Verilog HDL; Programmable Logic
devices - FPGA Generic architecture.

BECE102L Digital Systems Design 3 0 0 3
1.0
Course Objectives
1. Provide an understanding of Boolean algebra and logic functions.
2. Develop the knowledge of combinational and sequential logic circuit design.
3. Design and model the data path circuits for digital systems.
4. Establish a strong understanding of programmable logic.
5. Enable the student to design and model the logic circuits using Verilog HDL.
Course Outcome
1. Optimize the logic functions using and Boolean principles and K-map.
2. Model the Combinational and Sequential logic circuits using Verilog HDL.
3. Design the various combinational logic circuits and data path circuits.
4. Analyze and apply the design aspects of sequential logic circuits.
5. Analyze and apply the design aspects of Finite state machines.
6. Examine the basic architectures of programmable logic devices.
Module:1 Digital Logic 8 hours

Boolean Algebra: Basic definitions, Axiomatic definition of Boolean Algebra, Basic Theorems
and Properties of Boolean Algebra, Boolean Functions, Canonical and Standard Forms,
Simplification of Boolean functions. Gate-Level Minimization: The Map Method (K-map up to
4 variable), Product of Sums and Sum of Products Simplification, NAND and NOR
Implementation. Logic Families: Digital Logic Gates, TTL and CMOS logic families.
Module:2 Verilog HDL 5 hours

Lexical Conventions, Ports and Modules, Operators, Dataflow Modelling, Gate Level
Modelling, Behavioural Modeling, Test Bench.
Module:3 Design of Combinational Logic Circuits 8 hours

Design Procedure, Half Adder, Full Adder, Half Subtractor, Full Subtractor, Decoders,
Encoders, Multiplexers, De-multiplexers, Parity generator and checker, Applications of
Decoder, Multiplexer and De-multiplexer. Modeling of Combinational logic circuits using
Verilog HDL.
Module:4 Design of data path circuits 6 hours

N-bit Parallel Adder/Subtractor, Carry Look Ahead Adder, Unsigned Array Multiplier, Booth
Multiplier, 4-Bit Magnitude comparator. Modeling of data path circuits using Verilog HDL.
Module:5 Design of Sequential Logic Circuits 8 hours

Latches, Flip-Flops - SR, D, JK & T, Buffer Registers, Shift Registers - SISO, SIPO, PISO,
PIPO, Design of synchronous sequential circuits: state table and state diagrams, Design of
counters: Modulo-n, Johnson, Ring, Up/Down, Asynchronous counter. Modeling of
sequential logic circuits using Verilog HDL.
Module:6 Design of FSM 4 hours

Finite state Machine(FSM):Mealy FSM and Moore FSM , Design Example : Sequence
detection, Modeling of FSM using Verilog HDL.
Module:7 Programmable Logic Devices 4 hours

Types of Programmable Logic Devices: PLA, PAL, CPLD, FPGA Generic Architecture.

Module:8 Contemporary issues 2 hours

Textbook(s)
1. M. Morris Mano and Michael D. Ciletti, Digital Design: With an Introduction to the
Verilog HDL and System Verilog, 2018, 6th Edition, Pearson Pvt. Ltd.
Reference Books
1. Ming-Bo Lin, Digital Systems Design and Practice: Using Verilog HDL and FPGAs,
2015, 2nd Edition, Create Space Independent Publishing Platform.
2. Samir Palnitkar, Verilog HDL: A Guide to Digital Design and Synthesis, 2009, 2nd
edition, Prentice Hall of India Pvt. Ltd.
3. Stephen Brown and ZvonkoVranesic, Fundamentals of Digital Logic with Verilog
Design, 2013, 3rd Edition, McGraw-Hill Higher Education.
Mode of Evaluation: Continuous Assessment Test, Digital Assignment, Quiz and Final
Assessment Test


BECE102P Digital Systems Design Lab 0 0 2 1
1.0
Course Objective
• To apply theoretical knowledge gained in the theory course and get hands-on
experience of the topics.
Course Outcome
1. Design, simulate and synthesize combinational logic circuits, data path circuits and
sequential logic circuits using Verilog HDL.
2. Design and implement FSM on FPGA.
3. Design and implement small digital systems on FPGA.
1. Characteristics of Digital ICs, Realization of Boolean expressions 2 hours
2. Design and Verilog modeling of Combinational Logic circuits 4 hours
3. Design and Verilog modeling of various data path elements - Adders 2 hours
4. Design and Verilog modeling of various data path elements - Multipliers 2 hours
5. Implementation of combinational circuits – (FPGA / Trainer Kit) 2 hours
6. Implementation of data path circuit - (FPGA / Trainer Kit) 2 hours
7. Design and Verilog modeling of simple sequential circuits like Counters 2 hours
and Shift registers
8. Design and Verilog modeling of complex sequential circuits 2 hours
9. Implementation of Sequential circuits - (FPGA / Trainer Kit) 2 hours
10. Design and Verilog modeling of FSM based design – Serial Adder 2 hours
11. Design and Verilog modeling of FSM based design – Traffic Light 4 hours
Controller / Vending Machine
12. Design of ALU 4 hours

Mode of Assessment: Continuous Assessment and Final Assessment Test

Short Syllabus
BECE204L Microprocessors and Microcontrollers (3-0-0-3)
Overview of Microprocessors - Introduction to 8-bit/16-bit Microprocessor; Microprocessor

Architecture and Interfacing: Intel x86 - 8086 Architecture and Addressing modes;
Microcontroller Architecture: Intel 8051 – RAM ROM Organization, Assembly programming;
Microcontroller 8051 Peripherals – Timers, Counters; I/O interfacing with Microcontroller 8051 -
LCD, Sensor with Signal Conditioning Interface; ARM Processor Architecture - Overview of
ARM architecture; ARM Instruction Set - Assembly Programming.

BECE204L Microprocessors and Microcontrollers 3 0 0 3
Pre-requisite BECE102L Syllabus version
1.0
Course Objectives:
1. To acquaint students with architectures of Intel microprocessors, microcontroller and
ARM processors.
2. To familiarize the students with assembly language programming in 8051
microcontroller and ARM processor.
3. To interface peripherals and I/O devices with the 8051 microcontroller.
Course Outcome:
At the end of the course, the student should be able to
1. Comprehend the various microprocessors including Intel Pentium Processors
2. Infer the architecture and Programming of Intel 8086 Microprocessor.
3. Comprehend the architectures and programming of 8051 microcontroller.
4. Deploy the implementation of various peripherals such as general purpose input/
output, timers, serial communication, LCD, keypad and ADC with 8051
microcontroller
5. Infer the architecture of ARM Processor
6. Develop the simple application using ARM processor.
Module:1 Overview of Microprocessors 3 hours

Introduction to Microprocessors, 8-bit/16-bit Microprocessor, Overview of Intel Pentium, I (i3,
i5, i7) Series Processor.
Module:2 Microprocessor Architecture and Interfacing: Intel x86 8 hours

16-bit Microprocessor: 8086 - Architecture and Addressing modes, Memory Segmentation,
Instruction Set, Assembly Language Processing, Programming with DOS and BIOS function
calls, minimum and maximum mode configuration, Programmable Peripheral Interface
(8255), Programmable Timer Controller (8254), Memory Interface to 8086.
Module:3 Microcontroller Architecture: Intel 8051 7 hours

Microcontroller 8051 - Organization and Architecture, RAM-ROM Organization, Machine
Cycle, Instruction set: Addressing modes, Data Processing - Stack, Arithmetic, Logical;
Branching – Unconditional and Conditional, Assembly programming.
Module:4 Microcontroller 8051 Peripherals 5 hours

I/O Ports, Timers-Counters, Serial Communication and Interrupts.
Module:5 I/O interfacing with Microcontroller 8051 7 hours

LCD, LED, Keypad, Analog-to-Digital Convertors, Digital-to-Analog Convertors, Sensor with
Signal Conditioning Interface.
Module:6 ARM Processor Architecture 5 hours

ARM Design Philosophy; Overview of ARM architecture; States [ARM, Thumb, Jazelle];
Registers, Modes; Conditional Execution; Pipelining; Vector Tables; Exception handling.
Module:7 ARM Instruction Set 8 hours

ARM Instruction- data processing instructions, branch instructions, load store instructions,
SWI Instruction, Loading instructions, conditional Execution, Assembly Programming.


Text Book(s)
1. A.K. Ray, K.M. Bhurchandi, Advanced Microprocessor and Peripherals, 2012, 2nd
Edition, Tata McGraw-Hill, India.
2. Mohammad Ali Mazidi, Janice G. Mazidi, Rolin D. McKinlay, The 8051
Microcontroller and Embedded Systems, 2014, 2nd Edition, Pearson, India.
Reference Books
1. Muhammad Ali Mazidi, ARM Assembly Language Programming & Architecture: 1,
2016, 2nd Edition, Microdigitaled.com
2. A. Nagoor Kani, 8086 Microprocessors and its Applications, 2017, Second Edition, Tata
McGraw-Hill Education Pvt. Ltd., New Delhi, India.
3. Joseph Yiu, The Definitive Guide to ARM® Cortex®-M0 and Cortex-M0+ Processors,
2015, 2nd Edition, Elsevier Science & Technology, UK
Assessment Test


BECE204P Microprocessors and Microcontrollers Lab 0 0 2 1
1.0
Course Objectives
1. To familiarize the students with assembly language programming using
microprocessor and microcontroller.
2. To familiarize the students with Embedded C language programming using
microcontroller.
3. To interface peripherals and I/O devices with the microcontroller and microprocessor.
Course Outcome
Student will be able to
1. Showcase the skill, knowledge and ability of programming microcontroller and
microprocessor using its instruction set.
2. Expertise with microcontroller and interfaces including general purpose input/ output,
timers, serial communication, LCD, keypad and ADC.
Indicative Experiments [Experiments using 8086/8051/ARM]

1 Assembly language programming of Arithmetic/logical operations. 6 hours
2 Assembly language programming of memory operations. 4 hours
3 Assembly language programming/ Embedded C programming for
interfacing the peripherals: 10 hours
General purpose input/ output, timers, serial communication, LCD,
keypad and ADC.
4 Hardware implementation of peripheral interfacing: 10 hours
General purpose input/ output, timers, serial communication, LCD,
keypad and ADC.

Short Syllabus
BECE206L Analog Circuits (3-0-0-3)
DC and AC analysis of amplifiers - BJT Circuits, MOSFET Circuits; MOSFET Power Amplifiers -
Power Transistors; MOSFET Active Biasing and Differential Amplifiers - Introduction to Current
Mirror, Large Signal and Small Signal Analysis of Differential Amplifier; Operational Amplifier
Characteristics and Applications - Ideal and Nonideal characteristics of OP-AMP; Comparators
and Waveform Generators - Comparator and its applications; Active filters and Data converters
- Filter classifications, D/A and A/D conversion techniques; Special Function ICs - IC 555 timer.

BECE206L Analog Circuits 3 0 0 3
1.0
Course Objectives
1. To study the basic principle of BJT and MOSFET amplifiers using suitable biasing
techniques and to perform ac analysis.
2. To understand the operation and design of various classes of MOSFET power
amplifier circuits.
3. To introduce MOSFET active biasing and design a MOSFET differential amplifier
circuit and analyze its frequency response.
4. To study the characteristics of Operational Amplifier and its applications
5. To acquaint and demonstrate the concepts of waveform generators, filter
configurations, Timer, data converters, and Voltage regulators.
Course Outcome
1. Design the BJT and MOSFET amplifier circuits using suitable biasing techniques and
analyze their frequency response characteristics.
2. Distinguish among different classes of MOSFET power amplifiers and employ them
for various applications.
3. Analyze the different active biasing techniques and MOSFET-based differential
amplifiers and their frequency response characteristics.
4. Comprehend the ideal characteristics of OP-AMPs and design the fundamental
circuits based on OP-AMPs.
5. Design and analyze different waveform generator circuits using operational
amplifiers.
6. Analyze the basic concept of filter circuits, multivibrators using 555 timer, and data
converter circuits.
Module:1 DC and AC analysis of amplifiers 9 hours

BJT Circuits: DC biasing, AC coupling and small-signal analysis of amplifiers, Frequency
response of a CE amplifier, the three frequency bands, Unity gain frequency, Miller
Capacitance, Multistage amplifiers. MOSFET Circuits: DC biasing, AC coupling and small-
signal analysis of amplifiers, Frequency response of a CS amplifier, Unity gain frequency,
Miller Capacitance, Multistage amplifiers.
Module:2 MOSFET Power Amplifiers 4 hours

Power Amplifiers, Power Transistors, Classes of Amplifiers, Class A Power Amplifiers, Class
B, Class AB Push-Pull Complementary Output Stages.
Module:3 MOSFET Active Biasing and Differential Amplifiers 6 hours

Introduction to Current Mirror – Basic, Wilson and Cascode Current Mirror, MOSFET Basic
Differential Pair, Large Signal and Small Signal Analysis of Differential Amplifier, Differential
Amplifier with active load.
Module:4 Operational Amplifier Characteristics and Applications 7 hours

Operational amplifier, Ideal and Nonideal characteristics of OP-AMP, DC and AC
characteristics - Operational amplifier with negative feedback: Voltage Series, Voltage
Shunt feedback amplifier - Applications of OP-AMP - summing, scaling, and averaging
amplifiers, I/V and V/I converter, Integrator, Differentiator, Instrumentation amplifiers and
Precision Rectifiers.

Module:5 Comparators and Waveform Generators 6 hours

Comparator and its applications - Schmitt trigger - Free-running, One-shot Multivibrators -
Barkhausen Criterion - Sinewave generators - Phase-shift and Wein-bridge oscillators -
Square, Triangular and Saw-tooth wave function generators.
Module:6 Active filters and Data Converters 6 hours

Filter classifications: First and second order Low-pass and High pass filter designs, Band-
pass filter, Notch filter. Sample-and-hold circuits, DAC characteristics, D/A conversion
techniques, A/D characteristics, A/D conversion techniques.
Module:7 Special Function ICs 5 hours

IC 555 timer, Astable and Monostable operations, and applications. IC voltage regulator -
LM317.
Total Lecture 45 hours
Textbook(s)
1. Adel S. Sedra, Kenneth C. Smith and Arun N. Chandorkar, Microelectronic Circuits:
Theory and Applications, 2014, 7th Edition, Oxford University Press, New York.
Reference Books
1. J. D. Roy Choudhury, Linear Integrated Circuits, 2018, 5th Edition, New-Age
International Publishers, New Delhi.
2. Donald A Neamen, Microelectronics: Circuit Analysis and Design, 2010, 4th Edition, Mc
Graw-Hill.
3. P. Malvino, D. J. Bates, Electronic Principles, 2017, 7th Edition, Tata Mc Graw-Hill.
4. R. L. Boylestad and L. Nashelsky, Electronic Devices and Circuit Theory, 2015, 11th
Edition, Pearson Education.
Assessment Test


BECE206P Analog Circuits Lab 0 0 2 1
1.0
Course Objective
• To apply knowledge gained in the theory course and get hands-on experience of the
topics.
Course Outcome
1. Design and analyse the frequency response of amplifiers and differential amplifiers.
2. Determine the efficiency of different classes of power amplifiers.
3. Design and analyse the waveform generator circuits.
1. Design of single-stage and multistage amplifiers using BJT and to 4 hours
analyse its frequency response characteristics.
2. Design of single-stage and multistage amplifiers using MOSFET 4 hours
and to analyse its frequency response characteristics.
3. Design of a Power Amplifier and estimation of its power conversion 2 hours
efficiency
4. Design of differential amplifier using MOSFET and determine its 4 hours
CMRR and also perform the frequency response analysis.
5. Design of closed-loop amplifiers using Op-amp and perform 2 hours
experimentation to determine voltage gain.
6. Design of circuits using op-amp to determine the DC and AC 4 hours
characteristics.
7. Design of Instrumentation amplifier for the given specifications. 2 hours
8. Design of Comparator and Schmitt trigger circuits using Op-amp. 4 hours
9. Design of waveform generators and filters using op-amp 2 hours
10. Design of circuits using IC 555 timer for different applications. 2 hours

SHORT SYLLABUS
BCSE202L Data Structures and Algorithms (3-0-0-3)
Importance of algorithms and data structures - Algorithm analysis - Algorithm efficiency –

Linear Data Structures: Arrays, Stacks, Queues, List – Searching and Sorting – Trees –
Binary Trees – Binary Search Trees – Graphs: Traversals – Hashing and its types – Heaps –
AVL Trees and its operations.

BCSE202L Data Structures and Algorithms L T P C

3 0 0 3
1.0
Course Objectives
1. To impart basic concepts of data structures and algorithms.
2. To differentiate linear, non-linear data structures and their operations.
3. To comprehend the necessity of time complexity in algorithms.
Course Outcomes
On completion of this course, students should be able to:
1. Understand the fundamental analysis and time complexity for a given problem.
2. Articulate linear, non-linear data structures and legal operations permitted on them.
3. Identify and apply suitable algorithms for searching and sorting.
4. Discover various tree and graph traversals.
5. Explicate hashing, heaps and AVL trees and realize their applications.
Module:1 Algorithm Analysis 8 hours

Importance of algorithms and data structures - Fundamentals of algorithm analysis: Space
and time complexity of an algorithm, Types of asymptotic notations and orders of growth -
Algorithm efficiency – best case, worst case, average case - Analysis of non-recursive and
recursive algorithms - Asymptotic analysis for recurrence relation: Iteration Method,
Substitution Method, Master Method and Recursive Tree Method.
Module:2 Linear Data Structures 7 hours
Arrays: 1D and 2D array- Stack - Applications of stack: Expression Evaluation, Conversion
of Infix to postfix and prefix expression, Tower of Hanoi – Queue - Types of Queue:
Circular Queue, Double Ended Queue (deQueue) - Applications – List: Singly linked lists,
Doubly linked lists, Circular linked lists- Applications: Polynomial Manipulation.
Module:3 Searching and Sorting 7 hours
Searching: Linear Search and binary search – Applications.
Sorting: Insertion sort, Selection sort, Bubble sort, Counting sort, Quick sort, Merge sort -
Analysis of sorting algorithms.
Module:4 Trees 6 hours
Introduction - Binary Tree: Definition and Properties - Tree Traversals- Expression Trees:-
Binary Search Trees - Operations in BST: insertion, deletion, finding min and max, finding
the kth minimum element.
Module:5 Graphs 6 hours
Terminology – Representation of Graph – Graph Traversal: Breadth First Search (BFS),
Depth First Search (DFS) - Minimum Spanning Tree: Prim's, Kruskal's - Single Source
Shortest Path: Dijkstra’s Algorithm.
Module:6 Hashing 4 hours
Hash functions - Separate chaining - Open hashing: Linear probing, Quadratic probing,
Double hashing - Closed hashing - Random probing – Rehashing - Extendible hashing.
Module:7 Heaps and AVL Trees 5 hours
Heaps - Heap sort- Applications -Priority Queue using Heaps. AVL trees: Terminology, basic
operations (rotation, insertion and deletion).

Text Book
1. Mark A. Weiss, Data Structures & Algorithm Analysis in C++, 4th Edition, 2013,
Pearson Education.

Reference Books
1. Alfred V. Aho, Jeffrey D. Ullman and John E. Hopcroft, Data Structures and Algorithms,
1983, Pearson Education.
2. Horowitz, Sahni and S. Anderson-Freed, Fundamentals of Data Structures in C, 2008,
2nd Edition, Universities Press.
3. Thomas H. Cormen, C.E. Leiserson, R L. Rivest and C. Stein, Introduction to
Algorithms, 2009, 3rd Edition, MIT Press.

BCSE202P Data Structures and Algorithms Lab L T P C

0 0 2 1
1.0
Course Objectives
1. To impart basic concepts of data structures and algorithms.
2. To differentiate linear, non-linear data structures and their operations.
3. To comprehend the necessity of time complexity in algorithms.
Course Outcomes
On completion of this course, students should be able to:
1. Apply appropriate data structures to find solutions to practical problems.
2. Identify suitable algorithms for solving the given problems.
1. Implementation of stack data structure and its applications
2. Implementation of queue data structure and its applications
3. Implementation linked list and its application
4. Implementation of searching algorithms
5. Implementation of sorting algorithms
6. Binary Tree Traversal implementation
7. Binary Search Tree implementation
8. Graph Traversal – Depth First Search and Breadth First Search algorithm
9. Minimum Spanning Tree – Prim’s and Kruskal’s algorithm
10. Single Source Shortest Path Algorithm - Dijkstra’s algorithm
Text Book
1. Mark A. Weiss, Data Structures & Algorithm Analysis in C++, 2013, 4th Edition,
Pearson.
Reference Books
1. Alfred V. Aho, Jeffrey D. Ullman and John E. Hopcroft, Data Structures and
Algorithms, 1983, Pearson Education.
2. Horowitz, Sahni and S. Anderson-Freed, Fundamentals of Data Structures in C, 2008,
2nd Edition, Universities Press.
3. Thomas H. Cormen, C.E. Leiserson, R L. Rivest and C. Stein, Introduction to
Algorithms, 2009, 3rd Edition, MIT Press.
Mode of assessment: Continuous assessments and FAT.

SHORT SYLLABUS
BCSE204L Design and Analysis of Algorithms (3-0-0-3)
Algorithm Design Paradigms: Greedy Techniques, Backtracking Techniques, Dynamic

Programming, Backtracking and Branch & Bound Techniques – String Matching Algorithms
– All paths shortest path algorithms – Network Flows – Line Segments – Convex Hull finding
algorithms – Randomized Algorithms – Classification of complexity and approximation
algorithms.

BCSE204L Design and Analysis of Algorithms L T P C

3 0 0 3
1.0
Course Objectives
1. To provide mathematical foundations for analyzing the complexity of the algorithms
2. To impart the knowledge on various design strategies that can help in solving the real world
problems effectively
3. To synthesize efficient algorithms in various engineering design situations
Course Outcomes
On completion of this course, student should be able to:
1. Apply the mathematical tools to analyze and derive the running time of the algorithms
2. Demonstrate the major algorithm design paradigms.
3. Explain major graph algorithms, string matching and geometric algorithms along with their
analysis.
4. Articulating Randomized Algorithms.
5. Explain the hardness of real-world problems with respect to algorithmic efficiency and learning to
cope with it.
Module:1 Design Paradigms: Greedy, Divide and Conquer 6 hours

Techniques
Overview and Importance of Algorithms - Stages of algorithm development: Describing the problem,
Identifying a suitable technique, Design of an algorithm, Derive Time Complexity, Proof of
Correctness of the algorithm, Illustration of Design Stages - Greedy techniques: Fractional Knapsack
Problem, and Huffman coding - Divide and Conquer: Maximum Subarray, Karatsuba faster integer
multiplication algorithm.
Module:2 Design Paradigms: Dynamic Programming, Backtracking 10 hours
and Branch & Bound Techniques
Dynamic programming: Assembly Line Scheduling, Matrix Chain Multiplication, Longest Common
Subsequence, 0-1 Knapsack, TSP- Backtracking: N-Queens problem, Subset Sum, Graph Coloring-
Branch & Bound: LIFO-BB and FIFO BB methods: Job Selection problem, 0-1 Knapsack Problem
Module:3 String Matching Algorithms 5 hours

Naïve String-matching Algorithms, KMP algorithm, Rabin-Karp Algorithm, Suffix Trees.
Module:4 Graph Algorithms 6 hours
All pair shortest path: Bellman Ford Algorithm, Floyd-Warshall Algorithm - Network Flows: Flow
Networks, Maximum Flows: Ford-Fulkerson, Edmond-Karp, Push Re-label Algorithm – Application of
Max Flow to maximum matching problem
Module:5 Geometric Algorithms 4 hours
Line Segments: Properties, Intersection, sweeping lines - Convex Hull finding algorithms: Graham’s
Scan, Jarvis’ March Algorithm.
Module:6 Randomized algorithms 5 hours
Randomized quick sort - The hiring problem - Finding the global Minimum Cut.
Module:7 Classes of Complexity and Approximation 7 hours
Algorithms
The Class P - The Class NP - Reducibility and NP-completeness – SAT (Problem Definition and
statement), 3SAT, Independent Set, Clique, Approximation Algorithm – Vertex Cover, Set Cover and
Travelling salesman
Text Book
1. Thomas H. Cormen, C.E. Leiserson, R L.Rivest and C. Stein, Introduction to Algorithms, Third
edition, MIT Press, 2009.

Reference Books
st
1. Jon Kleinberg and ÉvaTardos, Algorithm Design, Pearson Education, 1 Edition, 2014.
2. Rajeev Motwani, Prabhakar Raghavan; Randomized Algorithms, Cambridge University Press,
1995 (Online Print – 2013)
3. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin, Network Flows: Theory,
st
Algorithms, and Applications, 1 Edition, Pearson Education, 2014.
Mode of Evaluation: CAT, Written assignments, Quiz, FAT.

BCSE204P Design and Analysis of Algorithms Lab L T P C

0 0 2 1
1.0
Course Objectives
1. To provide mathematical foundations for analyzing the complexity of the algorithms
2. To impart the knowledge on various design strategies that can help in solving the real
world problems effectively
3. Synthesize efficient algorithms in various engineering design situations
Course Outcome
1. Demonstrate the major algorithm design paradigms.
2. Explain major graph algorithms, string matching and geometric algorithms along with their
analysis.
1. Greedy Strategy : Activity Selection & Huffman coding
2. Dynamic Programming : ALS, Matrix Chain Multiplication , Longest Common
Subsequence, 0-1 Knapsack
3. Divide and Conquer : Maximum Subarray and Karatsuba faster integer multiplication
algorithm
4. Backtracking: N-queens
5. Branch and Bound: Job selection
6 String matching algorithms : Naïve, KMP and Rabin Karp,suffix trees
7 MST and all pair shortest path algorithms
8 Network Flows : Ford –Fulkerson and Edmond - Karp
9 Intersection of line segments &Finding Convexhull, Finding closest pair of points
10 Polynomial time algorithm for verification of NPC problems
11 Approximation and Randomized algorithms
Total Laboratory Hours 30 Hours
Text Book
1. Thomas H. Cormen, C.E. Leiserson, R L.Rivest and C. Stein, Introduction to
Algorithms, Third edition, MIT Press, 2009.
Reference Books
1. Jon Kleinberg and ÉvaTardos, Algorithm Design, Pearson Education, 1st Edition, 2014.
2. Rajeev Motwani, Prabhakar Raghavan; Randomized Algorithms, Cambridge University
Press, 1995 (Online Print – 2013)
3. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin, Network Flows: Theory,
Algorithms, and Applications, 1st Edition, Pearson Education, 2014.
Mode of assessment: Continuous assessments, FAT.

SHORT SYLLABUS
BCSE205L Computer Architecture and Organization (3-0-0-3)
Understanding and differentiating Computer Architecture - Computer Organization, - Von

Neumann and Harvard Architectures - Data representations in computer arithmetic -
Instruction Set Architecture - Memory Architecture – Interfaces - Secondary storage devices
- High performance processors - Pipelining and parallel processors – Superscalar
Processors.

BCSE205L Computer Architecture and Organization L T P C

3 0 0 3
1.0
Course Objectives
1. To acquaint students with the basic concepts of fundamental component,
architecture, register organization and performance metrics of a computer and to
impart the knowledge of data representation in binary and to understand the
implementation of arithmetic algorithms in a typical computer.
2. To teach students how to describe machine capabilities and design an effective data
path design for instruction execution. To introduce students to syntax and semantics
of machine level programming.
3. To make students understand the importance of memory systems, IO interfacing
techniques and external storage and their performance metrics for a typical
computer. And explore various alternate techniques for improving the performance of
a processor.
Course Outcomes
1. Differentiate Von Neumann, Harvard, and CISC and RISC architectures. Analyze
the performance of machine with different capabilities. Recognize different
instruction formats and addressing modes. Validate efficient algorithm for fixed
point and floating point arithmetic operations.
2. Explain the importance of hierarchical memory organization. Able to construct
larger memories. Analyze and suggest efficient cache mapping technique and
replacement algorithms for given design requirements. Demonstrate hamming
code for error detection and correction.
3. Understand the need for an interface. Compare and contrast memory mapping
and IO mapping techniques. Describe and Differentiate different modes of data
transfer. Appraise the synchronous and asynchronous bus for performance and
arbitration.
4. Assess the performance of IO and external storage systems. Classify parallel
machine models. Analyze the pipeline hazards and solutions.
Module:1 Introduction To Computer Architecture and Organization 5 Hours
Overview of Organization and Architecture –Functional components of a computer:
Registers and register files - Interconnection of components - Overview of IAS computer
function - Organization of the von Neumann machine - Harvard architecture - CISC & RISC
Architectures.
Module:2 Data Representation and Computer Arithmetic 5 Hours

Algorithms for fixed point arithmetic operations: Multiplication (Booths, Modified Booths),
Division (restoring and non-restoring) - Algorithms for floating point arithmetic operations -
Representation of nonnumeric data (character codes).
Module:3 Instruction Sets and Control Unit 9 Hours

Computer Instructions: Instruction sets, Instruction Set Architecture, Instruction formats,
Instruction set categories - Addressing modes - Phases of instruction cycle – ALU - Data‐
path and control unit: Hardwired control unit and Micro programmed control unit -
Performance metrics: Execution time calculation, MIPS, MFLOPS.
Module:4 Memory System Organization and Architecture 7 Hours
Memory systems hierarchy: Characteristics, Byte Storage methods, Conceptual view of
memory cell - Design of scalable memory using RAM’s- ROM’s chips - Construction of larger
size memories - Memory Interleaving - Memory interface address map- Cache memory:
principles, Cache memory management techniques, Types of caches, caches misses, Mean

memory access time evaluation of cache.
Module:5 Interfacing and Communication 5 Hours

I/O fundamentals: handshaking, buffering, I/O Modules - I/O techniques: Programmed I/O,
Interrupt-driven I/O, Direct Memory Access, Direct Cache Access - Interrupt structures:
Vectored and Prioritized-interrupt overhead - Buses: Synchronous and asynchronous -
Arbitration.
Module:6 Subsystems 5 Hours

External storage systems: Solid state drivers - Organization and Structure of disk drives:
Electronic- magnetic and optical technologies - Reliability of memory systems - Error
detecting and error correcting systems - RAID Levels - I/O Performance
Module:7 High Performance Processors 7 Hours

Classification of models - Flynn’s taxonomy of parallel machine models (SISD, SIMD, MISD,
MIMD) - Pipelining: Two stages, Multi stage pipelining, Basic performance issues in
pipelining, Hazards, Methods to prevent and resolve hazards and their drawbacks -
Approaches to deal branches - Superscalar architecture: Limitations of scalar pipelines,
superscalar versus super pipeline architecture, superscalar techniques, performance
evaluation of superscalar architecture - performance evaluation of parallel processors:
Amdahl’s law, speed-up and efficiency.
Module:8 Contemporary Issues 2 Hours
Total Lecture Hours 45 Hours

Text Book(s)
1 David A. Patterson and John L. Hennessy, Computer Organization and Design -The
Hardware / Software Interface 6th Edition, Morgan Kaufmann, 2020
Reference Book(s)
1 Computer Architecture and Organization-Designing for Performance, William Stallings,
Tenth edition, Pearson Education series, 2016
2 Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Computer organization, Mc Graw Hill,
Fifth edition, Reprint 2011.
Mode of Evaluation: CAT, Written Assignments, Quiz and FAT.

Short Syllabus
BECE303L VLSI System Design (3-0-0-3)
VLSI Design Overview and MOSFET Theory - Concepts of Regularity, Modularity and Locality;
CMOS Logic gates - CMOS Sequential Logic Design, Latches and Flip Flops; CMOS
Fabrication and Layout - CMOS Process Technology, Layout Design Rule; CMOS Circuits
Performance Analysis - Logical Effort and Transistor Sizing; CMOS Logic Families -
Transmission Gates based Logic Design; Timing Analysis - Introduction to Static timing
analysis; Semiconductor Memory Design- Introduction and types.

BECE303L VLSI System Design 3 0 0 3
Pre-requisite BECE204L, BECE204P Syllabus version
1.0
Course Objectives :
1. To introduce the basic concepts and techniques of modern integrated circuit design.
2. Describe the fundamental principles underlying digital design using CMOS logic and
analyze the performance characteristics of these digital circuits.
3. Verify that a design meets its functionality, timing constraints, both manually and
through the use of computer-aided design tools.
Course Outcomes :
Students will be able to
1. Analyze the CMOS digital electronics circuits, including logic components and their
interconnect using mathematical methods and circuit analysis models
2. Create models of moderately sized CMOS inverters with specified noise margin and
propagation delay.
3. Apply CMOS technology-specific layout rules in the placement and routing of
transistors and interconnect.
4. Analyse the various logic families and efficient techniques at circuit level for
improving power and speed of combinational and sequential logic.
5. Implement the CMOS digital circuits with the specified timing constraints.
6. Design memories with efficient architectures to improve access times, power
consumption
Module:1 VLSI Design Overview and MOSFET Theory 8 hours

VLSI Design Flow, Design Hierarchy, Concepts of Regularity, Modularity and Locality, VLSI
Design Styles, Design Quality, MOSFET : Device Structure, Electrical behaviour of MOS
transistors, Capacitance- Voltage Characteristics and Non-ideal Effects; Effects of scaling on
MOSFETs and Interconnects.
Module:2 CMOS Logic Gates 8 hours

CMOS Inverter: DC Transfer Characteristics, Static and Dynamic Behaviour, CMOS Basic
Gates, Compound Gates, CMOS Sequential Logic Design – Latches and Flip Flops
Module:3 CMOS Fabrication and Layout 5 hours

CMOS Process Technology N-well, P-well Process, latch up in CMOS technology, Stick
Diagram for Boolean Functions using Euler Theorem, Layout Design Rule
Module:4 CMOS Circuits Performance Analysis 5 hours

Delay Estimation, Logical Effort and Transistor Sizing, Performance Estimation - Static &
Dynamic Power Dissipation.
Module:5 CMOS Logic Families 8 hours

Pass Transistor Logic, Transmission Gates based Logic Design, pseudo NMOS, Cascode
Voltage Switch Logic Dynamic and domino logic, clocked CMOS (C2MOS) logic and np –
CMOS logic.
Module:6 Timing Analysis 4 hours

Introduction to Static timing analysis, Setup Time, Hold Time, calculation of critical path,
slack, setup and hold time violations.
Module:7 Semiconductor Memory Design 5 hours

Introduction, Types - Read-Only Memory (ROM) Circuits, Static Read-Write Memory

(SRAM) and Dynamic Read-Write Memory (DRAM) Circuits.
Total Lecture Hours: 45 hours

Text Book(s)
1. Neil H.Weste, Harris, A. Banerjee, CMOS VLSI Design, A circuits and System
Perspective, 2015, 4th Edition, Pearson Education, Noida, India.
Reference Book
1. Jan M. Rabaey, Anantha Chadrakasan, Borivoje Nikolic, Digital Integrated Circuits: A
Design Perspective Paperback, 2016, 2rd Edition, Pearson Education, India.
2. Sung-Mo Kang, Yusuf Liblebici, Chulwoo Kim, CMOS Digital Integrated Circuits:
Analysis and Design, 2019, Revised 4th Edition, Tata Mc Graw Hill, New Delhi, India.
Assessment Test


BECE303P VLSI System Design Lab 0 0 2 1
1.0
Course Objectives :
• The objective of this laboratory is to apply the theoretical knowledge and explore
various design style of CMOS Integrated Circuits (IC) design using the latest EDA
tools
Course Outcome :
On completion of this lab course the students will be able to
1. Analyze the performance of CMOS Inverter circuits on the basis of their operation
and working.
2. Design the semiconductor memory cell, combinational, sequential and arithmetic
circuit using CMOS design rules.
3. Construct layout of CMOS inverter, universal and basic logic gates.
1 Parameter extraction for basic cell structure (NMOS and PMOS 2 hours
devices).
• Analysis of MOS with width variation, body effect and
estimation of channel length modulation
2 Design and Analysis of CMOS inverter for arbitrary sizing. 4 hours
• Estimation of Power, Delay, Noise Margin.
• Impact of load on performance metrics.
3 Analysis of CMOS inverter for given specification. 2 hours

• Impact of sizing on Power, Delay, Noise Margin
4 Analysis of inverter chains using progressive sizing to improve 2 hours
delay performance.
5 Design and Analysis of Universal gates in static CMOS logic 2 hours
• Effect of input reordering.
6 Design and Analysis of Boolean Expression (Simple Arithmetic 2 hours
Unit) in static CMOS logic.
7 Design and Analysis of Pass transistor and Transmission gate 4 hours
based circuits
8 Design and Analysis of CMOS sequential circuits ( Latches and 4 hours
Flip Flops)
9 Design a CMOS Memory cell (SRAM, DRAM) and verify its 4 hours
operation.
10 Design Layout of CMOS inverter and perform post-layout 4 hours
analysis, DRC, Layout Vs. Schematic, Monte Carlo analysis,
Corner analysis and etc.

SHORT SYLLABUS
BCSE302L Database Systems (3-0-0-3)
Introduction to Data Models - Various architecture of DBMS - Different Relational Models -

Entity and relations model - Different types of Normalization – Types of indexing - Hashing
Techniques - Query processing - Query optimization techniques - Transaction processing -
Concurrency control - Introduction to NoSQL databases.

BCSE302L Database Systems L T P C

3 0 0 3
1.0
Course Objectives
1. To understand the concepts of File system and structure of the database; Designing an
Entity-Relationship model for a real-life application and Mapping a database schema
from the ER model.
2. To differentiate various normal forms, evaluate relational schemas for design qualities
and optimize a query.
3. To impart the working methodologies of transaction management, understand
concurrency control, recovery, indexing, access methods and fundamental view on
unstructured data and its management.
Course Outcomes
1. Comprehend the role of database management system in an organization and design
the structure and operation of the relational data model.
2. Develop a database project depending on the business requirements, considering
various design issues.
3. List the concepts of indexing and accessing methods.
4. Explain the concept of a database transaction processing and comprehend the concept
of database facilities including concurrency control, backup and recovery.
5. Review the fundamental view on unstructured data and describe other emerging
database technologies.
Module:1 Database Systems Concepts and 4 hours

Architecture
Need for database systems – Characteristics of Database Approach – Advantages of
using DBMS approach - Actors on the Database Management Scene: Database
Administrator - Classification of database management systems - Data Models - Schemas
and Instances - Three-Schema Architecture - The Database System Environment -
Centralized and Client/Server Architectures for DBMSs – Overall Architecture of
Database Management Systems
Module:2 Relational Model and E-R Modeling 6 hours
Relational Model: Candidate Keys, Primary Keys, Foreign Keys - Integrity Constraints -
Handling of Nulls - Entity Relationship Model: Types of Attributes, Relationships,
Structural Constraints, Relational model Constraints – Mapping ER model to a relational
schema – Extended ER Model - Generalization – Specialization – Aggregations.
Module:3 Relational Database Design 6 hours
Database Design – Schema Refinement - Guidelines for Relational Schema - Functional
dependencies - Axioms on Functional Dependencies- Normalization: First, Second and
Third Normal Forms - Boyce Codd Normal Form, Multi-valued dependency and Fourth
Normal form - Join dependency and Fifth Normal form
Module:4 Physical Database Design and Query 8 hours
Processing
File Organization - Indexing: Single level indexing, multi-level indexing, dynamic
multilevel Indexing - B+ Tree Indexing – Hashing Techniques: Static and Dynamic Hashing
– Relational Algebra - Translating SQL Queries into Relational Algebra - Query
Processing – Query Optimization: Algebraic Query Optimization, Heuristic query
optimization Rules, Join Query Optimization using Indexing and Hashing - Tuple Relational
Calculus.
Module:5 Transaction Processing and Recovery 8 hours

Introduction to Transaction Processing – Transaction concepts: ACID Properties of

Transactions, Transaction States - Serial and Serializable Schedules - Schedules based on
recoverability – Schedules based on Serializability - Conflict Serializabilty - Recovery
Concepts: Log Based Recovery Protocols, Recovery based on deferred update, Recovery
techniques based on immediate update – Shadow Paging Algorithm
Module:6 Concurrency Control In Transaction 8 hours
Processing
Concurrent Transactions – Lost Update Problem - Concurrency Control Techniques: Time
Stamp Based Protocols, Thomas Write Rule, Lock Based Protocols, Lock Compatibility
Matrix, - Two-Phase Locking Protocol - Lock Conversions - Graph Based Protocols for
Concurrency Control - Tree Protocol for Concurrency Control – Deadlocks Based on Locks
in Transactions – Deadlock Handling Techniques – Transaction Deadlock Detection
Techniques – Transaction Deadlock Prevention Techniques – Multi-Granularity Locking for
avoiding Transaction Deadlocks
Module:7 NOSQL Database Management 3 hours
Introduction, Need of NoSQL, CAP Theorem, different NoSQL data bases: Key-value data
stores, Columnar families, Document databases, Graph databases
Module:8 Contemporary Issues 2 Hours

Text Book
1. R. Elmasri & S. B. Navathe, Fundamentals of Database Systems, Addison Wesley, 7th
Edition, 2016
Reference Books
1. A. Silberschatz, H. F. Korth & S. Sudarshan, Database System Concepts, McGraw Hill,
7th Edition 2019.
2. Raghu Ramakrishnan, Database Management Systems, Mcgraw-Hill, 4th Edition, 2018
3. C.J.Date, A.Kannan, S.Swamynathan,” An Introduction to Database Systems”, Pearson,
Eighth Edition, 2006.
4. Gerardus Blokdyk, NoSQL Databases A Complete Guide, 5STARCooks, 2021
Mode of Evaluation: CAT, Written assignments, Quiz and FAT.

BCSE302P Database Systems Lab L T P C

0 0 2 1
Pre-requisite Syllabus version
1.0
Course Objectives
1. Basic ability to understand the concepts of File system and structure of the database;
Designing an Entity-Relationship model for a real-life application and Mapping a
database schema from the ER model.
2. Differentiate various normal forms, evaluate relational schemas for design qualities and
optimize a query.
3. Explain the working methodologies of transaction management and give a solution
during a transaction failure. Understand the basic concepts on concurrency control,
recovery, indexing, access methods and fundamental view on unstructured data and its
management.
Course Outcome
1. Design the structure and operation of the relational data model.
2. Examine the data requirements of the real world and design a database management
system.
1. Data Definition and Data Manipulation Language
2. Constraints
3. Single row functions
4. Operators and group functions
5. Sub query, views and joins
6. High Level Language Extensions - Procedures, Functions, Cursors and Triggers
Text Book
1. R. Elmasri & S. B. Navathe, Fundamentals of Database Systems, Addison Wesley, 7th
Edition, 2016
Reference Books
1. A. Silberschatz, H. F. Korth & S. Sudarshan, Database System Concepts, McGraw Hill,
7th Edition 2019.
2. Raghu Ramakrishnan, Database Management Systems, Mcgraw-Hill, 4th Edition, 2018
3. C.J.Date, A.Kannan, S.Swamynathan,” An Introduction to Database Systems”, Pearson,
Eighth Edition, 2006.
4. Gerardus Blokdyk, NoSQL Databases A Complete Guide, 5STARCooks, 2021
Mode of assessment: Continuous assessments, FAT


SHORT SYLLABUS
BCSE303L Operating Systems (3-0-0-3)
OS design issues - Structuring methods - System calls, System/Application Call Interface –

Protection – Processes Scheduling - CPU Scheduling - Deadlocks - Inter-process
communication, Synchronization - Memory Management - File System Management -
Device Management - Protection and Security.

BCSE303L Operating Systems L T P C

3 0 0 3
1.0
Course Objectives
1. To introduce the operating system concepts, designs and provide skills required to
implement the services.
2. To describe the trade-offs between conflicting objectives in large scale system design.
3. To develop the knowledge for application of the various design issues and services.
Course Outcomes
1. Interpret the evolution of OS functionality, structures, layers and apply various types of
system calls of various process states.
2. Design scheduling algorithms to compute and compare various scheduling criteria.
3. Apply and analyze communication between inter process and synchronization
techniques.
4. Implement page replacement algorithms, memory management problems and
segmentation.
5. Differentiate the file systems for applying different allocation, access technique,
representing virtualization and providing protection and security to OS.
Module:1 Introduction 3 hours

Introduction to OS: Functionality of OS - OS design issues - Structuring methods
(monolithic, layered, modular, micro-kernel models) - Abstractions, processes, resources -
Influence of security, networking, and multimedia.
Module:2 OS Principles 4 hours
System calls, System/Application Call Interface – Protection: User/Kernel modes - Interrupts
-Processes - Structures (Process Control Block, Ready List etc.), Process creation,
management in Unix – Threads: User level, kernel level threads and thread models.
Module:3 Scheduling 9 hours
Processes Scheduling - CPU Scheduling: Pre-emptive, non-pre-emptive - Multiprocessor
scheduling – Deadlocks - Resource allocation and management - Deadlock handling
mechanisms: prevention, avoidance, detection, recovery.
Module:4 Concurrency 8 hours
Inter-process communication, Synchronization - Implementing synchronization primitives
(Peterson’s solution, Bakery algorithm, synchronization hardware) - Semaphores – Classical
synchronization problems, Monitors: Solution to Dining Philosophers problem – IPC in Unix,
Multiprocessors and Locking - Scalable Locks - Lock-free coordination.
Module:5 Memory Management 7 hours
Main memory management, Memory allocation strategies, Virtual memory: Hardware
support for virtual memory (caching, TLB) – Paging - Segmentation - Demand Paging - Page
Faults - Page Replacement -Thrashing - Working Set.
Module:6 Virtualization and File System 6 hours
Management
Virtual Machines - Virtualization (Hardware/Software, Server, Service, Network - Hypervisors
- Container virtualization - Cost of virtualization - File system interface (access methods,
directory structures) - File system implementation (directory implementation, file allocation
methods) - File system recovery - Journaling - Soft updates - Log-structured file system -
Distributed file system.
Module:7 Storage Management, Protection and 6 hours
Security
Disk structure and attachment – Disk scheduling algorithms (seek time, rotational latency
based)- System threats and security – Policy vs mechanism - Access vs authentication -

System protection: Access matrix – Capability based systems - OS: performance, scaling,
future directions in mobile OS.

Text Book
1. Abraham Silberschatz, Peter B. Galvin, Greg Gagne, “Operating System Concepts”,
2018, 10th Edition, Wiley, United States.
Reference Books
1. Andrew S. Tanenbaum, “Modern Operating Systems”, 2016, 4th Edition, Pearson,
United Kingdom.
2. William Stallings, “Operating Systems: Internals and Design Principles”, 2018, 9th
Edition, Pearson, United Kingdom.
Mode of Evaluation: CAT, Written Assignment, Quiz, FAT

BCSE303P Operating Systems Lab L T P C

0 0 2 1
1.0
Course Objectives
1. To introduce the operating system concepts, designs and provide skills required to
implement the services.
2. To describe the trade-offs between conflicting objectives in large scale system design.
3. To develop the knowledge for application of the various design issues and services.
Course Outcome
1. Interpret the evolution of OS functionality, structures, layers and apply various types of
system calls of various process states.
2. Design scheduling algorithms to compute and compare various scheduling criteria.
3. Apply and analyze communication between inter process and synchronization
techniques.
4. Implement page replacement algorithms, memory management problems and
segmentation.
Differentiate the file systems for applying different allocation, access technique,
representing virtualization and providing protection and security to OS.
1. Study of Basic Linux Commands
2. Implement your own bootloader program that helps a computer to boot an OS.
3. Shell Programming (I/O, Decision making, Looping, Multi-level branching)
4. Creating child process using fork () system call, Orphan and Zombie process creation
5. Simulation of CPU scheduling algorithms (FCFS, SJF, Priority and Round Robin)
6. Implement process synchronization using semaphores / monitors.
7. Simulation of Banker s algorithm to check whether the given system is in safe state or
not. Also check whether addition resource requested can be granted immediately
8. Parallel Thread management using Pthreads library. Implement a data parallelism
using multi-threading
9. Dynamic memory allocation algorithms - First-fit, Best-fit, Worst-fit algorithms
10. Page Replacement Algorithms FIFO, LRU and Optimal
11. Implement a file locking mechanism.
12. Virtualization Setup: Type-1, Type-2 Hypervisor (Detailed Study Report)
Text Book
1. Fox, Richard, “Linux with Operating System Concepts”, 2022, 2nd Edition, Chapman
and Hall/CRC, UK.
Reference Books
1. Love, Robert, "Linux System Programming: talking directly to the kernel and C library",
2013, 2nd Edition, O'Reilly Media, Inc, United States.
2. Abraham Silberschatz, Peter B. Galvin, Greg Gagne, “Operating System Concepts”,
2018, 10th Edition, Wiley, United States.
Mode of Assessment: Continuous Assessments, FAT

SHORT SYLLABUS
BCSE304L Theory of Computation(3-0-0-3)
Concepts of Proof technique - Regular sets - Finite automata - Regular Expressions -

Minimization of finite automata - Context-free languages - Normal Forms for grammars -
Pushdown automata - Turing machines.

BCSE304L Theory of Computation L T P C

3 0 0 3
1.0
Course Objectives
1. Types of grammars and models of automata.
2. Limitation of computation: What can be and what cannot be computed.
3. Establishing connections among grammars, automata and formal languages.
Course Outcome
1. Compare and analyse different computational models
2. Apply rigorously formal mathematical methods to prove properties of languages,
grammars and automata.
3. Identify limitations of some computational models and possible methods of proving them.
4. Represent the abstract concepts mathematically with notations.
Module:1 Introduction to Languages and Grammars 4 hours

Recall on Proof techniques in Mathematics - Overview of a Computational Models -
Languages and Grammars - Alphabets - Strings - Operations on Languages, Overview on
Automata
Module:2 Finite State Automata 8 hours
Finite Automata (FA) - Deterministic Finite Automata (DFA) - Non-deterministic Finite
Automata (NFA) - NFA with epsilon transitions – NFA without epsilon transition, conversion
of NFA to DFA, Equivalence of NFA and DFA – minimization of DFA
Module:3 Regular Expressions and Languages 7 hours
Regular Expression - FA and Regular Expressions: FA to regular expression and regular
expression to FA - Pattern matching and regular expressions - Regular grammar and FA -
Pumping lemma for regular languages - Closure properties of regular languages
Module:4 Context Free Grammars 7 hours
Context-Free Grammar (CFG) – Derivations - Parse Trees - Ambiguity in CFG - CYK
algorithm – Simplification of CFG – Elimination of Useless symbols, Unit productions, Null
productions - Normal forms for CFG: CNF and GNF - Pumping Lemma for CFL - Closure
Properties of CFL
Module:5 Pushdown Automata 5 hours
Definition of the Pushdown automata - Languages of a Pushdown automata – Power of
Non-Deterministic Pushdown Automata and Deterministic pushdown automata
Module:6 Turing Machine 6 hours
Turing Machines as acceptor and transducer - Multi head and Multi tape Turing Machines –
Universal Turing Machine - The Halting problem - Turing-Church thesis
Module:7 Recursive and Recursively Enumerable 6 hours
Languages
Recursive and Recursively Enumerable Languages, Language that is not Recursively
Enumerable (RE) – computable functions – Chomsky Hierarchy – Undecidable problems -
Post’s Correspondence Problem

Text Book
1. J.E. Hopcroft, R. Motwani and J.D. Ullman, “Introduction to Automata Theory,
Languages and Computation”, Third Edition, Pearson Education, India 2008. ISBN:
978-8131720479
Reference Books

1. Peter Linz, “An Introduction to Formal Languages and Automata”, Sixth Edition, Jones &
Bartlett, 2016. ISBN: 978-9384323219
2. K. Krithivasan and R. Rama, “Introduction to Formal Languages, Automata and
Computation”, Pearson Education, 2009. ISBN: 978-8131723562
Mode of Evaluation: CAT, Assignment, Quiz, FAT.

SHORT SYLLABUS
BCSE307L Compiler Design (3-0-0-3)
Language translators - Compilation process – Modules – Interfaces – Tools - Lexical

Analysis - Syntax Analysis - Semantic analysis – Translation - Intermediate Code - Basic
Blocks - Instruction selection - Liveness Analysis - Dataflow Analysis – Code Optimization -
, LEX and YACC tools.

BCSE307L Compiler Design L T P C

3 0 0 3
1.0
Course Objectives
1. To provide fundamental knowledge of various language translators.
2. To make students familiar with lexical analysis and parsing techniques.
3. To understand the various actions carried out in semantic analysis.
4. To make the students get familiar with how the intermediate code is generated.
5. To understand the principles of code optimization techniques and code generation.
6. To provide foundation for study of high-performance compiler design.
Course Outcomes
1. Apply the skills on devising, selecting, and using tools and techniques towards compiler
design
2. Develop language specifications using context free grammars (CFG).
3. Apply the ideas, the techniques, and the knowledge acquired for the purpose of
developing software systems.
4. Constructing symbol tables and generating intermediate code.
5. Obtain insights on compiler optimization and code generation.
Module:1 INTRODUCTION TO COMPILATION AND LEXICAL ANALYSIS 7 hours

Introduction to LLVM - Structure and Phases of a Compiler-Design Issues-Patterns-
Lexemes-Tokens-Attributes-Specification of Tokens-Extended Regular Expression- Regular
expression to Deterministic Finite Automata (Direct method) - Lex - A Lexical Analyzer
Generator.
Module:2 SYNTAX ANALYSIS 8 hours
Role of Parser- Parse Tree - Elimination of Ambiguity – Top Down Parsing - Recursive
Descent Parsing - LL (1) Grammars – Shift Reduce Parsers- Operator Precedence Parsing -
LR Parsers, Construction of SLR Parser Tables and Parsing- CLR Parsing- LALR Parsing.
Module:3 SEMANTICS ANALYSIS 5 hours
Syntax Directed Definition – Evaluation Order - Applications of Syntax Directed Translation -
Syntax Directed Translation Schemes - Implementation of L-attributed Syntax Directed
Definition.
Module:4 INTERMEDIATE CODE GENERATION 5 hours
Variants of Syntax trees - Three Address Code- Types – Declarations - Procedures -
Assignment Statements - Translation of Expressions - Control Flow - Back Patching- Switch
Case Statements.
Module:5 CODE OPTIMIZATION 6 hours
Loop optimizations- Principal Sources of Optimization -Introduction to Data Flow Analysis -
Basic Blocks - Optimization of Basic Blocks - Peephole Optimization- The DAG
Representation of Basic Blocks -Loops in Flow Graphs - Machine Independent Optimization-
Implementation of a naïve code generator for a virtual Machine- Security checking of virtual
machine code.
Module:6 CODE GENERATION 5 hours
Issues in the design of a code generator- Target Machine- Next-Use Information - Register
Allocation and Assignment- Runtime Organization- Activation Records.
Module:7 PARALLELISM 7 hours
Parallelization- Automatic Parallelization- Optimizations for Cache Locality and
Vectorization- Domain Specific Languages-Compilation- Instruction Scheduling and
Software Pipelining- Impact of Language Design and Architecture Evolution on Compilers-
Static Single Assignment


Text Book(s)
1. A. V. Aho, Monica S. Lam, Ravi Sethi and Jeffrey D. Ullman, Compilers: Principles,
techniques, & tools, 2007, Second Edition, Pearson Education, Boston.
Reference Books
1. Watson, Des. A Practical Approach to Compiler Construction. Germany, Springer
International Publishing, 2017.
Mode of Evaluation: CAT, Quiz, Written assignment and FAT

BCSE307P Compiler Design Lab L T P C

0 0 2 1
Pre-requisite Syllabus version
1.0
Course Objectives
1. To provide fundamental knowledge of various language translators.
2. To make students familiar with phases of compiler.
3. To provide foundation for study of high-performance compiler design.
Course Outcome
1. Apply the skills on devising, selecting and using tools and techniques towards compiler
design
2. Develop language specifications using context free grammars (CFG).
3. Apply the ideas, the techniques, and the knowledge acquired for the purpose of
developing software systems.
4. Constructing symbol tables and generating intermediate code.
5. Obtain insights on compiler optimization and code generation.
1. Implementation of LEXR using LLVM.
2. Implementation of handwritten parser using LLVM
3. Generating code with the LLVM backend.
4. Defining a real programming language.
5. Write a recursive descent parser for the CFG language and implement it using
LLVM.
6. Write a LR parser for the CFG language and implement it in the using LLVM.
7. Intro to Flex and Bison
Modify the scanner and parser so that terminating a statement with "; b" instead of ";"
results in the output being printed in binary.
8. Using LLVM-style RTTI for the AST and Generating IR from the AST.
9. Converting types from an AST description to LLVM types.
10. Emitting assembler text and object code.
Mode of assessment: CAT, FAT
Text Book(s)
1 Learn LLVM 12: A beginner's guide to learning LLVM compiler tools and core
libraries with C++
Reference Books
1. Watson, Des. A Practical Approach to Compiler Construction. Germany, Springer
International Publishing, 2017.


SHORT SYLLABUS
BCSE308L Computer Networks (3-0-0-3)
Network models - Error detection and flow control in data link layer - Network layer – IPv4,
IPv6 - Routing algorithms - Sub-netting - Classless addressing – NAT - Transport layer -
Sliding Window revisited - Flow and congestion control - Application layer Protocols - Basics
on network security.

BCSE308L Computer Networks L T P C

3 0 0 3
1.0
Course Objectives
1. To build an understanding among students about the fundamental concepts of computer
networking, protocols, architectures, and applications.
2. To help students to acquire knowledge in design, implement and analyze performance of
OSI and TCP-IP based Architectures.
3. To identify the suitable application layer protocols for specific applications and its
respective security mechanisms.
Course Outcomes
1. Interpret the different building blocks of Communication network and its architecture.
2. Contrast different types of switching networks and analyze the performance of network
3. Identify and analyze error and flow control mechanisms in data link layer.
4. Design sub-netting and analyze the performance of network layer with various routing
protocols.
5. Compare various congestion control mechanisms and identify appropriate transport layer
protocol for real time applications with appropriate security mechanism.
Module:1 Networking Principles and Layered 6 hours
Architecture
Data Communications and Networking: A Communications Model – Data Communications -
Evolution of network, Requirements , Applications, Network Topology (Line configuration,
Data Flow), Protocols and Standards, Network Models (OSI, TCP/IP)
Module:2 Circuit and Packet Switching 7 hours
Switched Communications Networks – Circuit Switching – Packet Switching – Comparison
of Circuit Switching and Packet Switching – Implementing Network Software, Networking
Parameters(Transmission Impairment, Data Rate and Performance)
Module:3 Data Link Layer 8 hours
Error Detection and Correction – Hamming Code , CRC, Checksum- Flow control
mechanism – Sliding Window Protocol - GoBack - N - Selective Repeat - Multiple access
Aloha - Slotted Aloha - CSMA, CSMA/CD – IEEE Standards(IEEE802.3 (Ethernet),
IEEE802.11(WLAN))- RFID- Bluetooth Standards
Module:4 Network Layer 8 hours
IPV4 Address Space – Notations – Classful Addressing – Classless Addressing – Network
Address Translation – IPv6 Address Structure – IPv4 and IPv6 header format
Module:5 Routing Protocols 6 hours
Routing-Link State and Distance Vector Routing Protocols- Implementation-Performance
Analysis- Packet Tracer
Module:6 Transport Layer 5 hours
TCP and UDP-Congestion Control-Effects of Congestion-Traffic Management-TCP
Congestion Control-Congestion Avoidance Mechanisms-Queuing Mechanisms-QoS
Parameters
Module:7 Application layer 3 hours
Application layer-Domain Name System-Case Study : FTP-HTTP-SMTP-SNMP

Text Book
1. Behrouz A. Forouzan, Data communication and Networking, 5th Edition, 2017,


Reference Books
1. James F. Kurose and Keith W.Ross, Computer Networking: A Top-Down Approach, 6th
Edition, 2017, Pearson Education.
2. William Stallings, “Data and Computer Communication”, 10th Edition, 2017, Pearson,
United Kingdom.
Mode of Evaluation: CAT, Written Assignment, Quiz, FAT

BCSE308P Computer Networks Lab L T P C

0 0 2 1
1.0
Course Objectives
1. To build an understanding among students about the fundamental concepts of computer
networking, protocols, architectures, and applications.
2. To help students to acquire knowledge in design, implement and analyze performance of
OSI and TCP-IP based Architectures.
3. To identify the suitable application layer protocols for specific applications and its
respective security mechanisms
Course Outcome
1. Interpret the different building blocks of Communication network and its architecture.
2. Contrast different types of switching networks and analyze the performance of network
3. Identify and analyze error and flow control mechanisms in data link layer.
4. Design sub-netting and analyze the performance of network layer with various routing
protocols.
5. Compare various congestion control mechanisms and identify appropriate transport layer
protocol for real time applications with appropriate security mechanism.
1. Study of Basic Network Commands, Demo session of all networking hardware and
Functionalities
2. Error detection and correction mechanisms
3. Flow control mechanisms
4. IP addressing Classless addressing
5. Observing Packets across the network and Performance Analysis of Routing protocols
6. Socket programming(TCP and UDP) - Some challenging experiments can be given on
Socket programming
7. Simulation of unicast routing protocols
8. Simulation of Transport layer Protocols and analysis of congestion control techniques
in network
9. Develop a DNS client server to resolve the given host name or IP address
Text book
1 W.Richard Stevens, Uix Network Programming, 2ndEdition, Pearson Education, 2015.
Mode of assessment: Continuous assessment, FAT

Bachelor of Technology in Electronics and Computer Engineering
Short Syllabus
Discipline Core Courses
BECM301L Signal Processing (3-0-0-3)
Signal and Systems - classification-continuous and discrete, Operations on signals; System

Analysis using Z-Transform - Z-transform, Properties, S-plane to Z-plane mapping; Fourier
Transforms in Discrete Domain - Review of Continuous-time Fourier transform, Discrete-
time Fourier transform; Design of Digital FIR Filters - Design characteristics of FIR filters
with linear- phase; Design of Digital IIR Filters - Analog low pass filter; Digital filter
Structures - Basic FIR and IIR digital filter structures

BECM301L Signal Processing 3 0 0 3

1.0
Course Objectives
1. To understand the characteristics of signals, systems in time and frequency domain with
the corresponding transformations.
2. To analyse the signals and systems in time and transformed domains such as DTFT, Z-
transform and DFT.
3. To inculcate the design concepts of digital FIR filters, analog and digital IIR Filters.
4. To instill diverse structures for realizing digital filters.
5. To provide an insight into digital signal processors.
6. To learn the usage of appropriate tools for realizing signal processing modules
Course Outcome
On studying this course, students will be able to
1. Differentiate between various types of signal and understand the systems in continuous
and discrete domain.
2. Comprehend, classify and analyse signals in time and frequency domain transfor-
mations
3. Analyze of DT systems using Z-transform.
4. Comprehend various analog filter design techniques and be able to design digital filters
5. Able to realize digital filters using various system interconnections
6. Understand the types and architecture of digital signal processors.
7. Design and implement systems using the imbibed signal processing concepts
Module:1 Signal and Systems 6 hours
Signals: classification-continuous and discrete, Operations on signals, Sampling, System -

classification, Discrete time convolution and correlation.
Module:2 System Analysis using Z-Transform 6 hours
Z-transform, Properties, S-plane to Z-plane mapping, Inverse z-transform, Solution to
difference equations using z-transform, Region of convergence, Stability analysis
Module:3 Fourier Transforms in Discrete Domain 8 hours
Review of Continuous-time Fourier transform, Discrete-time Fourier transform - Dirichlet’s

Conditions, Magnitude and phase response, Parseval’s theorem, Gibbs Phenomenon.
Properties of FT. DFT, Radix-2 FFT Algorithms – Decimation In Time & Decimation In
Frequency.
Module:4 Design of Digital FIR Filters 6 hours
Design characteristics of FIR filters with linear- phase – Frequency response of linear phase
FIR filters, Design of FIR filters using windowing techniques -Rectangular, Bartlett,
Hamming, Hanning and Blackmann
Module:5 Design of Digital IIR Filters 6 hours
Analog low pass filter -Butterworth and Chebyshev approximations, frequency

transformation, Bilinear Transformation Technique
Module:6 Digital filter Structures 7 hours
Basic FIR and IIR digital filter structures - Direct Forms, Cascade, Parallel, Lattice and

Lattice-Ladder structures
Module:7 Digital Signal Processors 4 hours
Fixed-point Architecture -VLIW, Fixed-point and Floating-point coefficients, finite word length
effects

Guest lecture from Industries and R & D Organizations
Text Book(s)
1. John G. Proakis, Dimitris G Manolakis, Digital Signal Processing: Principles, Algorithms
and Applications, 2022, 5th Edition, Pearson, USA
Reference Books
2. Simon Haykin, Barry Van Veen, “Signals and Systems”, 2nd edition, Wiley Publications,
2021
3. P. Rama Krishna Rao and Shankar Prakriya, “Signals and Systems”, 2nd edition - Mc-
Graw Hill, 2017
4. Lizhe Tan, Jean Jiang, Digital Signal Processing: Fundamentals and applications, 3rd
edition, 2018, Academic Press, USA
Assessment Test

BECM301P Signal Processing Lab 0 0 2 1

1.0
Course Objectives
To learn and practice appropriate software and hardware tools for implementing the building
blocks in signal processing.
Course Outcome
On studying this course, students will be able to
1. Generate the various elementary signal properties using software and DSP proces-
sor.
2. Analyze system properties with simulation.
3. Design digital filters for real-time applications using DSP processor
Software [20 hours]
1 Signal generation and sampling 2 hours
2 Convolution (linear and circular) and correlation 2 hours
3 Fourier transform and its properties 2 hours
4 Discrete Fourier transform and its properties 2 hours
5 Stability analysis 2 hours

6 FIR filter design (using DSP tool-kit) 2 hours
7 Analog IIR filter design 2 hours
8 Digital IIR filter design 2 hours
9 Analysis of quantization effects 2 hours
10 Signal smoothening- ECG/EEG signals 2 hours

Hardware (CCStudio&TMS6748):[10 hours]
11 Signal generation 2 hours
12 Fast Fourier transform implementation 2 hours
13 FIR filter design for audio/speech signal 2 hours
14 IIR filter design for audio/speech signal 2 hours
15 Study of quantization effects 2 hours

Text Book(s)

1. John G. Proakis, Dimitris G Manolakis, Digital Signal Processing: Principles,

Algorithms and Applications, 2022, 5th Edition, Pearson, USA
Reference Books
1. Simon Haykin, Barry Van Veen, “Signals and Systems”, 2nd edition, Wiley Publications,
2021
2. P. Rama Krishna Rao and Shankar Prakriya, “Signals and Systems”, 2nd edition - Mc-
Graw Hill, 2017
3. Lizhe Tan, Jean Jiang, Digital Signal Processing: Fundamentals and applications, 3rd
edition, 2018, Academic Press, USA

Short Syllabus
BECE302L Control Systems (2-1-0-3)
Control Systems - Basic components of a control system; Mathematical Modeling of Physical

Systems - Difference and differential equations for LTI SISO and MIMO systems; Time Domain
Response - Time domain specifications, Steady state error; Characterization of Systems –
Stability, Root locus analysis; Frequency Domain Response - Phase and gain margin, Bode
Plot; Controllers and Compensators Design - P, PI, PID controllers; State Space Analysis -
Solutions of state equations of LTI system.

BECE302L Control Systems 2 1 0 3
Pre-requisite BECE202L/BECM301L Syllabus version
1.0
Course Objectives
1. To study the use of transfer function model for the analysis of physical systems and
to introduce the components of control system.
2. To provide adequate knowledge in the time response of systems and steady state
error analysis along with the understanding of closed-loop and open-loop system
analysis in frequency domain.
3. To introduce the design of controllers and compensators for the stability analysis.
4. To introduce state variable representation of physical systems and study the stability
analysis in state space approach.
Course Outcomes
Students will be able to
1. Differentiate between open-loop and closed-loop control systems and obtain the
transfer function from the mathematical modeling of physical systems.
2. Determine transient and steady state responses of the system with first and second
order and also to analyze its error coefficients.
3. Characterize the system stability using R-H criteria and root locus techniques.
4. Analyze the frequency domain response of the control systems.
5. Design the controllers and compensators to estimate the system stability.
6. Analyze the system in state space model through the concept of controllability and
observability.
Module:1 Control Systems 3 hours

Basic components of a control system, Applications, Open-loop control system and closed-
loop control system, Examples of control system (air conditioner, cruise control, phase-
locked loop, etc.), Effects of feedback on overall gain, Types of feedback control system,
Linear and non-linear control systems.
Module:2 Mathematical Modeling of Physical Systems 8 hours

Difference and differential equations for LTI SISO and MIMO systems, Mathematical
modeling of electrical and mechanical systems, Equivalence between the elements of
different types of systems, Transfer function of linear systems, Open-loop transfer function
and closed- loop transfer function, Block diagram representation, Block diagram reduction
techniques, Signal flow graph using Mason’s gain formula.
Module:3 Time Domain Response 6 hours

Transient response and steady state responses, Time domain specifications, Types of test
inputs, Response of first order and second order systems, Steady state error, Static error
coefficients, Generalized error coefficients.
Module:4 Characterization of Systems 5 hours

Stability – concept and definition, Poles, Zeros, Order and Type of systems; R-H criteria,
Root locus analysis.
Module:5 Frequency Domain Response 7 hours

Frequency response – Performance specifications in the frequency domain, Phase margin
and gain margin, Bode plot, Polar plot and Nyquist plot, Stability analysis in frequency
domain.
Module:6 Controllers and Compensators Design 7 hours

Controllers – P, PI, PID, Realization of basic compensators, Cascade compensation in time

domain and frequency domain, Feedback compensation, Design of lag, lead, lag-lead series
compensators.
Module:7 State Space Analysis 7 hours

Dynamic system modeling in state space representation: Diagonal canonical form, Jordan
canonical form, Solutions of state equations of LTI system, Conversion from state space
model to transfer function model and vice versa, Stability analysis in state spaces: Concept
of eigenvalues and eigenvectors, State transition matrix using Cayley-Hamilton theorem,
Controllability and observability.
Module:8 Contemporary issues: 2 hours
Text Book(s)
1. Norman S. Nise, Control Systems Engineering, 2019, 8th Edition, John Wiley &
Sons, New Jersey, USA
Reference Books
1. Farid Golnaraghi and Benjamin C. Kuo, Automatic Control Systems, 2017, 10th
Edition, McGraw-Hill Education, India.
2. I.J. Nagarth and M. Gopal, Control Systems Engineering, 2018, 6th Edition, New Age
International Pvt. Ltd., New Delhi, India.
3. Gene Franklin, J. Powell and Abbas Emami-Naeini, Feedback Control of Dynamic
Systems, 2019, 8th Edition, Pearson Education, New Delhi, India.
Assessment Test

Short Syllabus
BECE309L Artificial Intelligence and Machine Learning (3-0-0-3)
Foundations ofAI - Agents and rationality, Agent Architecture Types; Problem-solving by

Searching - Search algorithms, strategies; Knowledge Representation - Agents based on
Propositional Logic; Probability reasoning and uncertainty - Knowledge representation in
uncertainty, Decision making; Data Preparation for Machine Learning - Data Cleaning,
Integration, Transformation; Learning from Examples - Forms of Learning, Regression,
Decision Trees, Ensemble Learning; Deep Learning - Convolutional Networks, Recurrent
Neural Networks.

BECE309L Artificial Intelligence and Machine Learning 3 0 0 3
1.0
Course Objectives
1. To get acquainted with different types of intelligent agents.
2. To understand the importance and significance of Machine learning.
3. To preface the essentials of Deep Learning.
Course Outcome
At the end of the course, students will be able to
1. Comprehend different intelligent agents and its variants.
2. Solve the real-world problem using the various search algorithms.
3. Infuse various symbolic knowledge representation.
4. Employ intelligent agents for decision making.
5. Handle real-time issues using various learning methodologies.
6. Apply deep learning algorithms for solving real-world problems.
Module:1 Foundations of AI 4 hours

Introduction – Agents and rationality – Task environment – Agent Architecture Types.
Module:2 Problem-solving by Searching 7 hours

Search Space – Search algorithms, strategies – Search in complex environments.
Module:3 Knowledge Representation 6 hours

Knowledge-based agents, Agents based on Propositional Logic – First-order logic.
Module:4 Probability reasoning and uncertainty 6 hours

Quantifying uncertainty, Knowledge representation in uncertainty, Decision making – Simple,
complex.
Module:5 Data Preparation for Machine Learning 4 hours

Basics of Vectors & Matrices – Overview: Data Cleaning, Integration, Transformation &
Reduction.
Module:6 Learning from Examples 9 hours

Forms of Learning – Dimensionality reduction - Regression – Statistical Methods: Naïve-
Bayes, Nearest Neighbor, Decision Trees – Random Forest, Clustering, Ensemble Learning,
Case studies – Machine Learning in Signal Processing, Intelligent Antenna.
Module:7 Deep Learning 7 hours

Simple Feed Forward Networks – Computational graphs for Deep Learning – Convolutional
Networks – Recurrent Neural Networks – Kernel Machines – Hidden Markov Models.

Text Book(s)
1. Stuart J Russell, Peter Norwig, Artificial Intelligence – A modern approach, 2015, 3rd
edition, Pearson, India.
Reference Books
1. Vinod Chandra S.S, Anand Hareendran S., Artificial Intelligence: Principles and

Applications, 2020, 2nd Edition, PHI Learning Pvt. Ltd., India.

2. Alpaydin ethem, Introduction to Machine Learning, 2019, 3rd edition, PHI Learning Pvt.
Ltd., India.
Assessment Test


BECE312L Robotics and Automation 3 0 0 3
1.0
Course Objectives
1. To provide basic understanding of robotics and automation.
2. To demonstrate the need of various sensors and drives in robotic system.
3. To make students understand about the robotic kinematics, path planning
and different trajectories.
4. To deliver the programming languages to design robots in practice and
research for contemporary use.
Course Outcomes
1. Classify robots and summaries their role in diverse applications
2. Infer the working of basic electric, electronic, and other types of drives
required in robots.
3. Distinguish and interpret the sensors for various applications in robotics and
automation.
4. Determine the mathematical model of robotic systems and analyze their
kinematic behavior.
5. Design robots for varied working environments encompassing all types of
motions across different paths and diverse trajectories.
6. Apply the ideas in performing various robotic tasks for contemporary industry
standards using suitable programming skills.
Module:1 Robotics and Automation 5 hours

Robots: Basics, Types-Application, Mobility, D o F , Terrain, components
classification, performance characteristics, Industrial Robots, HRI, Automatic
assembly system.
Module:2 Drives for Robotics 5 hours
Drives: Electric, hydraulic and pneumatic drives.
Module:3 Sensors for Robots 7 hours
Tactile sensors - Proximity and range sensors – Optical Sensor- limit switch
sensor- surface array sensor- Acoustic sensors - Vision sensor systems – Vision
feedback system -Image processing and analysis - Image data reduction –
Segmentation – Feature extraction -Object recognition.
Module:4 Robot Kinematics and Dynamics 10 hours
Kinematics of manipulators, rotational, translation and
transformation Homogeneous, Transformations, Denavat – Hartenberg
Representation, Inverse Kinematics. Linearization of Robot Dynamics – State
variable continuous and discrete models.
Module:5 Path Planning 5 hours
Types of trajectories, trajectory planning and avoidance of obstacles, path
planning, skew motion, joint integrated motion and straight line motion.
Module:6 Programming of Robots 5 hours
Robot programming: ROS1 and ROS2, languages and software packages-
MATLAB/Simulink, OpenRDK, Adams.
Module:7 Application of Robots 6 hours

Industrial robots used for welding, painting and assembly, remote controlled
robots, robots for nuclear, thermal and chemical plants, industrial automation,
typical examples of automated Industries, Humanoid robots, medical robots,
under water robots, drones.
Text Book(s)
1. Kevin M. Lynch, Frank C. Park, “Modern Robotics- Mechanics, Planning, and
Control”, 2017, Cambridge University Press.
Reference Books
1. R. K. Mittal, I. J. Nagrath, “Robotics and Control”, 2017, McGraw Hill Education,
India,
2. Ramkumar Gandhinathan, Lentin Joseph, “ROS Robotics Projects-Build and
Control Robots Powered by the Robot Operating System, Machine Learning,
and Virtual Reality”, 2019, Packt Publishing.
3. Hutchinson, S., Spong, M. W., Vidyasagar, M. “Robot Modeling and Control”,
2020, Wiley publications, United Kingdom.
Pawlak, A. M. Sensors and Actuators in Mechatronics: Design and
4. Applications, 2017, CRC Press, United Kingdom.
Lentin Joseph, “Robot Operating System (ROS) for Absolute Beginners -
5. Robotics Programming Made Easy, 2018, Apress.
Mode of Evaluation: Continuous Assessment Test, Digital Assignment, Quiz and

Final Assessment Test


BECE403E Embedded Systems Design 3 0 2 4
1.0
Course Objectives
1. To acquaint students with definition, characteristics, challenges and design
lifecycle of Embedded Systems by imparting the fundamental knowledge of
I/O interfacing, serial communication protocols, wireless technologies, design
using UML models
2. To familiarize the concepts and features of Real-time operating systems, task
scheduling, and inter-task communication.
3. To impart various programming tools, modeling and simulation packages to
program, design, simulate and build Embedded Systems
Course Outcomes
1. Design any application, based on the given specifications by keeping in mind
different design metrics.
2. Apply the skills attained to differentiate Microprocessor/Microcontroller and
interface various peripherals for a particular application.
3. Demonstrate proficiency in using device drivers, firmware and debugging
tools.
4. Analyze the specific perspective of the embedded application using different
modelling languages
5. Compare and contrast various wired and wireless protocols
6. Explore the concepts of RTOS and apply the knowledge for developing real-
time systems
Module:1 Embedded System Product Development 4 hours

Characteristics of embedded systems, Classification of embedded systems,
Embedded product development cycle, Embedded System Design Challenges,
Performance and Benchmarking Tools.
Module:2 Embedded Hardware Design 5 hours
Processor classification - general purpose, customized, application specific
processors, Microcontroller architectures (RISC, CISC), Embedded Memory,
Strategic selection of processor and memory, Power Supply Design Considerations
for Embedded Systems.
Module:3 Embedded Software Development Environment 6 hours
Cross assemblers/compilers, Linker, Runtime Library, Pre-processor Workflow,
make files, Compiler Tool chains – gcc & ARM, Device Driver, Firmware,
Middleware - Debugging tools: Emulators, Simulators, In-Circuit Debuggers, Logic
Analyzer, Integrated Development Environment (IDE).
Module:4 Modeling Embedded Systems 6 hours
Control data flow graph, Finite state machine model, Petrinet Model, Unified model
language
Module:5 Programming the Peripherals of Microcontrollers 6 hours
Programming GPIO pins, Timers / Counters, Watchdog Timer, PWM generation,
ADC, DAC, LED, switches, keypad, LCD.
Module:6 Emerging Communication Protocols 8 hours

UART, SPI, I2C, NFC, CAN, Bluetooth, Zigbee, Wi-Fi

Module:7 Embedded Real –Time Operating Systems 8 hours
Introduction to basic concepts of RTOS- Task, process & threads, Multiprocessing
and Multitasking, Preemptive and non-preemptive scheduling, Schedulability
Analysis, Inter process Communication, Performance Metrics of RTOS
Text Book(s)
1. Raj Kamal, “Embedded systems Architecture, Programming and Design”,
2017, Third Edition, McGraw Hill Education, India.
Reference Books
1. Marilyn Wolf, “Computers as components: Principles of Embedded
Computing System Design”, 2017, Fourth Edition, Morgan Kaufmann
publications (Elsevier), United States.
2. Jiacun Wang, "Real-Time Embedded Systems'', 2017, First Edition, Wiley
Publishers, United States.
1. Experiments based on interfacing I/O devices 4 hours
2. Experiments based on monitoring and control using sensors and 6 hours
actuators
3. Experiments based on wired Communications Protocols (UART, 8 hours
SPI, I2C, CAN)
4. Experiments based wireless Communications Protocols (Wi-Fi, 6 hours
Bluetooth)
5. Experiments based on RTOS 6 hours
Mode of assessment: Continuous assessment and FAT


BECE406E FPGA Based System Design 2 0 2 3
1.0
Course Objectives
1. Understand FPGA Architecture and technologies
2. Modeling of complex digital sub-systems
3. Implementation of complex FPGA applications in real world scenario
Course Outcomes
1. Understand architectures of programmable logic devices
2. Understand various abstraction level in Verilog HDL
3. Construct high speed arithmetic and memory circuits
4. Analyze the synthesis and timing constraints/reports
5. Design the system using soft core processors
6. Develop the FPGA based system for various applications in signal processing
7. Develop and prototype digital systems using FPGA
Module:1 Programmable Logic Devices 4 hours

Types of Programmable Logic Devices: PLA, PAL, CPLD - FPGA Architecture –
Programming Technologies-Chip I/O- Programmable Logic Blocks- Fabric and
Architecture of FPGA.
Module:2 HDL Fundamentals 3 hours
Verilog Behavioral, Data Flow and Structural Modeling, Useful Modeling
Techniques.
Module:3 Implementation of Arithmetic system 5 hours
Arithmetic Circuits: High Speed Adders, Carry look-ahead adder, Carry save
adders, Conditional Sum adders, Sequential and Parallel Multipliers
Module:4 FSM and memory modelling 5 hours
Synchronous and Asynchronous FIFO – Single port and Dual port ROM and RAM
- FSM Verilog modeling of Sequence detector - Serial adder - Vending machine.
Module:5 Synthesis and Timing Analysis 3 hours
Synthesis, Optimization of Speed: Introduction, Strategies for Timing Improvement;
Optimization of Area, Optimization of power
Module:6 SoC Design 4 hours
Introduction to hardware – software codesign, Introduction to Qsys and Intel Quartus
prime tool, Nios II Software Build Tools for Eclipse, Incorporate custom peripherals
& instructions into an embedded system.
Module:7 FPGA Applications 4 hours
Embedded system design using FPGAs, DSP using FPGAs, Dynamic architecture
using FPGAs, reconfigurable systems, application case studies. Simulation /
implementation exercises of combinational, sequential and DSP kernels on Xilinx /
Altera boards.
Text Book(s)

1. Michael D Ciletti, Advanced Digital Design with the Verilog HDL, Prentice Hall,
Second
Edition, 2017.
Reference Books
1. Charles H Roth Jr, Lizy Kurian John and ByeongKil Lee Digital Systems Design
using Verilog, Cengage Learning, First Edition, 2016.
2. Wayne Wolf, FPGA Based System Design, Prentices Hall Modern
Semiconductor Design Series, 2011.
3. Ming-Bo Lin, Digital Systems Design and Practice: Using Verilog HDL and
FPGAs, Create Space Independent Publishing Platform, Second Edition, 2015.
1. Design of adders and Multipliers 6 hours
2. Design of FSM 6 hours
3. Design of Memory circuits 6 hours
4. Synthesis and Timing Analysis 6 hours
5. System design using Qsys 6 hours


BECE407E ASIC Design 2 0 2 3
` 1.0
Course Objectives
1. Explain the HDL coding guidelines, synthesizable HDL constructs and RTL
synthesis Flow with respect to different cost functions.
2. Teach how to perform Static Timing Analysis for ASIC design.
3. Discuss the guidelines at each abstraction level in physical design
4. Provide detailed insight on importance of physical design verification
Course Outcomes
1. Design a digital system by adhering to synthesizable HDL constructs.
2. Synthesize the given design by considering various constraints and to
optimize the same.
3. Understand various timing parameters and perform Static Timing Analysis for
ASIC design
4. Perform physical design by adhering to guidelines.
5. Apprehend the importance of physical design verification.
6. Design ASIC based systems using industry standard tools.
Module:1 ASIC Design Methodology & Design Flow 3 hours

Implementation Strategies for Digital ICs: Custom IC Design- Cell-based Design
Methodology - Array based implementation approaches - Traditional and Physical
Compiler based ASIC Flow.
Module:2 Verilog HDL Coding Style for Synthesis 6 hours
HDL Coding style – Guidelines and Recommendation - FSM Coding Guideline and
Coding Style for Synthesis. Datapath and Control Logic Design.
Module:3 RTL Synthesis 3 hours
RTL synthesis Flow – Synthesis Design Environment & Constraints – Architecture
of Logic Synthesizer - Technology Library Basics– Components of Technology
Library –Synthesis Optimization- Technology independent and Technology
dependent synthesis- Data path Synthesis – Low Power Synthesis - Formal
Verification.
Module:4 Basic Timing Analysis 4 hours
Timing Parameter Definition – Setup Timing Check- Hold Timing Check- Multicycle
Paths- Half-Cycle Paths- False Paths
Module:5 Advanced Timing Analysis 5 hours
Clock skew optimization – On-Chip Variations- AOCV-Time Borrowing- Setup and
Hold Violation Fixing.
Module:6 Physical Design 5 hours
Detailed steps in Physical Design Flow- Guidelines for Floor plan, Placement, CTS
and routing– ECO flow – Signal Integrity Issues.
Module:7 Physical Design Verification 3 hours
Timing Sign-off, Physical Verification – Signoff DRC and LVS, ERC, IR Drop
Analysis, Electro-Migration Analysis and ESD Analysis.

Text Book(s)
1. Vaibbhav Taraate, ASIC Design and Synthesis RTL Design Using Verilog,
Springer, First Edition, 2021, Singapore.
Reference Books
1. Khosrow Golshan, PHYSICAL DESIGN ESSENTIALS An ASIC Design
Implementation Perspective, First Edition, 2010.
2. Michael John Sebastian Smith, Application-Specific Integrated Circuits, First
Edition, 2002.
3. J. Bhasker and Rakesh Chadha, Static Timing Analysis for Nanometer
Designs, Springer, First Edition, 2010, USA.
1. Design of Digital Architecture for given specification 6 hours
2. Logical Synthesis of Digital Architecture 6 hours
3. Netlist Optimization and Formal Verification 6 hours
4. Physical Synthesis of Digital Architecture 6 hours
5. Physical Verification of digital architecture 6 hours


BECE411L Cryptography and Network Security 3 0 0 3
BECE401L, BECE401P/ Syllabus Version
Pre-requisite
BCSE308L, BCSE308P
1.0
Course Objectives
1. To acquaint students with the basic concepts in need for security mechanism,
classical and traditional Encryption techniques.
2. To impart knowledge to students regarding the significance of message
confidentiality, Integrity and availability using Cryptography.
3. To acquaint the students to the different types of network & internet security
and its significance.
Course Outcomes
1. Analyze OSI Security Architecture and Classical Encryptions.
2. Realize the various mathematical techniques in cryptography, including
number theory, Finite Field, modulo operator, Elliptic Curve Arithmetic and
Discrete Logarithm.
3. Analyze Modern block and stream ciphers, Data Encryption Standard (DES),
Advanced Encryption Standard (AES), IDEA and Key Exchange Algorithms.
4. Analyze Asymmetric ciphers: RSA, ElGamal, RABIN Cryptosystem.
5. Comprehend the various types of data integrity and authentication schemes.
6. Infer the various network and Internet security mechanisms.
Module:1 Cryptography: Overview 4 hours

Introduction, OSI Security Architecture, Security Attacks, Security Services and
Mechanisms, Classical Encryption Techniques.
Module:2 Mathematical Foundations 6 hours
Number Theory and Finite Fields (Group, Ring and Fields), Fermat’s and Euler’s
Theorems, The Chinese Remainder Theorem, Fast Exponentiation, Discrete
Logarithms, Elliptic Curve Arithmetic, and Principles of Pseudorandom Number
Generation.
Module:3 Symmetric Ciphers 8 hours
Modern Block Ciphers and Modern Stream Ciphers- DES, IDEA, AES,
Pseudorandom Number Generation based on symmetric cipher, Key Exchange
Algorithm: Diffie-Hellman Key Exchange.
Module:4 Asymmetric Ciphers 7 hours
RSA cryptosystem, ElGamal Cryptosystem, RABIN Cryptosystem, Elliptic Curve
Cryptography simulating Elgamal, Pseudorandom Number Generation based on an
asymmetric Cipher.
Module:5 Data Integrity Algorithms 7 hours
Cryptographic Hash Functions: MD4, SHA-512, Whirlpool, Message Authentication
Codes, Digital Signatures: RSA, Elgamal, Schnorr, DSS.
Module:6 Mutual Trust 5 hours
Key Management and Distribution, X.509, User Authentication Protocols, Kerberos.
Module:7 Network and Internet Security 6 hours
Transport Layer Security, Wireless LAN Security, Electronic mail Security, Firewalls,
IoT Threats.

Text Book(s)
1. William Stallings, "Cryptography and Network security: Principles and
Practice", 8th Edition, 2020, Pearson Education, India.
Reference Books
1. Atul Kahate, “Cryptography And Network Security”, 4th Edition, 2019, The
McGraw Hill Company.
2 Behrouz A.Forouzan, Debdeep Mukhopadhyay “Cryptography & Network
Security”, 3rd edition, 2015, The McGraw Hill Company.



BECM302E Augmented and Virtual Reality 3 0 2 4
1.0
Course Objectives
The objective of this course is to
1. To introduce the fundamentals of virtual reality systems, including geometric

modelling, transformations, graphical rendering, optics, and human vision.
2. To build a personal VR or AR application for their portfolio
3. To develop Virtual and Augmented Reality industry committed innovative
technologies that can be used in the development and production of immersive
environments in the fields of entertainment, education, training, medical and
industrial innovation.
Course Outcomes
After successfully completing the course, the student should be able to
1. Understand the design, types and the principles of immersive technologies.

2. Design, create, and integrate 3D art elements into a virtual reality environment.
3. Applying motion tracking techniques, visual, and interactive elements into a
virtual reality environment.
4. Design, create, and calibrate the platform, motion tracking and lighting in
augmented reality environment.
5. Develop techniques to work on multiple platforms, including PC, mobile devices,
etc.,
6. Geometric modeling and using immersive effects of visual and audio assets to
AR/VR experiences.
7. Adapt VR/AR designs to meet requirements of the current marketplace.
8. Analyze and design prototypes for serious applications.
Module:1 Design and Art Across Digital Realities 5 hours
Introduction – How human interacts with computers – Modalities through Ages –
Types of Common Human Computer Interaction (HCI) Modalities: Visual, Auditory
and Physical - New Modalities – Note on Hand Tracking and Hand Pose Recognition
– Voice, Hands and Hardware Inputs over Next Generation – Sensory Design –
Sensory Principles
Module:2 Introduction to Virtual Reality 6 hours
A Brief History of Virtual Reality - The five Classic Components of a VR System -
Reality, Virtuality and Immersion -Virtual Reality for Art – VR for Animation – 3D Art
Optimization –Ideal Solution – Topology – Baking – Draw Calls – VR Tools to Create
3D Art – Acquiring 3D models – Creating 3D models.
Module:3 Motion tracking, navigation and controllers 6 hours
in VR
Position and Motion Trackers - Magnetic, Mechanical and Ultrasonic Trackers -
Navigation and Manipulation Interfaces - Three-Dimensional Probes and Controllers
- Data Gloves and Gesture Interfaces - Human Perception and Cognition – Visual
System – Effects of VR Simulations on Users - Cyber-sickness, before and now -
Guidelines for Proper VR Usage - User Centered Design, User Experience and an
Ethical Code of Conduct
Module:4 Introduction to Augmented Reality 6 hours

History of AR – Selection of AR Platform – Integrating Hardware and Software –

Optical & Inertial Calibration – Tracking – AR Computer Vision – Mapping –
Platforms – Lightings
Module:5 Creating Cross-Platform Augmented Reality and 6 hours
Virtual Reality
Cross Platform Game Engines – Understanding 3D graphics – Virtual Camera –
Degree of Freedom – Virtual Reality Toolkit – Best Practices
Module:6 Modeling Interactivity Sound in Immersive 6 hours
Environments
Geometric Modeling - Kinematics Modeling - Physical Modeling - Behavior Modeling
- Model Management – Handling locomotion: Locomotion in AR/VR, Effective use of
audio: Audio in AR/VR, Common Interaction Paradigms: Inventory for AR,
Augmented Reality Raycasts
Module:7 Use Cases in the field of VR/AR 6 hours
Health: VR/AR Health Technology Application Design, Sports: Five Key Principles of
AR and VR for Sports, Training: Enterprise Training, Soft Skills Training, Voice
Recognition
Module:8 Recent Trends in AR/VR 4 hours
Intelligent system design using the AI enabled AR/VR
Text Book(s)
1. Erin Pangilinan, Steve Lukas and Vasanth Mohan, “Creating Augmented and
Virtual Realities Theory & Practice for Next-Generation Spatial Computing”,
O’REILLY 2019
2. Coiffet P, Burdea GC. Virtual reality technology. John Wiley & Sons; 2017
Nov 1.
Reference Books
1. Tom Dieck MC, Jung TH, Loureiro SM, editors. Augmented Reality and Virtual
Reality: New Trends in Immersive Technology. Springer Nature; 2021.
2 Jason Jerald. 2015. The VR Book: Human-Centered Design for Virtual Reality.
Association for Computing Machinery and Morgan & Claypool Publishers
3 Tony Parisi. 2015. Learning Virtual Reality ISBN: 9781491922828
4 Michael Madary and Thomas K. Metzinger. 2016. Real Virtuality: A Code of
Ethical Conduct. Recommendations for Good Scientific Practice and the
Consumers of VR- Technology. Frontiers in Robotics and AI 3, February: 1–23.
http://doi.org/10.3389/frobt.2016.00003
1. VR/AR engines - UNITY Basics/ Google ARCore/ Vuforia, etc., 3 hours
2. 3D environment creation using UNITY 3 hours
3. 2D environment creation using UNITY 3 hours
4. Configure project settings according to VR platform 3 hours
requirements
5. Creating a standalone VR application 3 hours

6. Configure project settings according to AR platform 3 hours

requirements
7. Creating a standalone AR application 3 hours
8. Set up ARCore development environment 3 hours
9. Determine the components needed for a user to physically 3 hours
manipulate objects in a VR environment
10. Understand types of head tracking and degrees of movement 3 hours
in VR equipment
Mode of Assessment: Continuous Assessment and FAT


BECM303L Wireless Communication Networks 3 0 0 3
Pre-requisite BCSE308L, BCSE308P Syllabus version
1.0
Course Objectives
1. To gain fundamentals of wireless communication, system design principles
and factors that influences the capacity, coverage and efficiency of cellular
system.
2. To gain broader knowledge on the evolution of cellular standards from 1G to
5G
3. To gain the knowledge on layer wise protocols and algorithms pertaining to
MAC, Network Layer and Transport layer for wireless mobile networks
4. To learn about different network technologies and challenges involved in
infrastructure & ad hoc mode of network communication.
Course Outcomes
1. To understand the basic concepts related to wireless communication
2. To gain the fundamentals in cellular system design and factors that influences
the system capacity, coverage and spectrum efficiency.
3. To acquaint with the various multiple access techniques used in cellular and
wireless network standards.
4. To understand the evolution of wireless cellular standards
5. To understand the network and transport layers enhancements pertaining to
wireless mobile networks
6. To understand the different types of wireless technologies, services and
protocol stack architectures
7. To understand the design challenges in mobile ad hoc and wireless sensor
networks
Module:1 Overview of Wireless Communication 6 hours

Evolution of Wireless Communication – Frequencies for Radio Transmission –
Signals – Antennas – Signal Propagation – Multiplexing – Modulation – Spread
Spectrum
Module:2 Fundamentals of Cellular System Design 8 hours
Cellular concept, Frequency Re-use, Channel Assignment Strategies, Handoff
Strategies, Interference and System Capacity, Tele-traffic Engineering concepts :
Trunking and Grade of Service, Improving Coverage and Capacity in Cellular
Systems
Module:3 Multiple Access Techniques 6 hours
Motivation for specialized MAC – SDMA – FDMA – TDMA – CDMA – OFDMA -
Comparison
Module:4 Wireless Cellular Standards 6 hours
First-Generation Analog - Second-Generation TDMA - Second-Generation CDMA -
Third-Generation Systems: CDMA 2000 – WCDMA, Fourth Generation Systems and

LTE-Advanced, 5G Roadmap - Pillars of 5G - 5G Architecture

Module:5 Mobile Network and Transport Layers 5 hours
Mobile IP – DHCP – TCP Enhancement for Wireless Networks – Session Initiation
Protocol (SIP)
Module:6 Wireless Network Technologies 6 hours
Wireless Local Area Network (WLAN) - WiFi Technology - IEEE 802.11 Architecture
and Services - Medium Access Control - IEEE 802.11 Physical Layer -Gigabit Wi-Fi -
IEEE 802.11 Standards Evolution. Wireless Personal Area Network (WPAN) -
Bluetooth (IEEE 802.15.1) Protocol Stack , Zigbee Technology (IEEE 802.15.4 LR-
WPAN) Device Architecture
Module:7 Mobile Ad hoc and Sensor Networks 6 hours
Mobile Ad hoc Networks - Issues in Ad Hoc Wireless Networks –Ad hoc routing
protocols - Sensor versus Ad Hoc Networks - Technical Challenges and design
principles of Wireless Sensor Networks – Single node architecture –Hardware
components, Energy consumption of sensor nodes, Sensor Network Applications
Terahertz communication : Beyond 5G, 6LoWPAN , LoRa (Long Range
Technology)
Text Book(s)
1. Schiller. J, Mobile Communications; Pearson Education Asia Ltd., 2014
2. Vijay Garg, Wireless Communications & Networking, Morgan Kaufmann,
2010
Reference Books
1. Cory Beard and William Stallings, Wireless Communication Networks and
Systems, First edition, Global edition, Pearson Education Ltd., 2016.
2. Jonathan Rodriguez, "Fundamentals of 5G Mobile networks", John Wiley, 2015
3. Theodore S. Rappaport, “Wireless Communications: Principles and Practice”,
Second Edition, Pearson Education, 2010.
4. Holger Karl, Andreas Willig, "Protocols and Architectures for Wireless Sensor
Networks" John Wiley & Sons, 2007
FAT Test

BECM304L Principles of Communication Systems (3-0-0-3)
INTRODUCTION TO COMMUNICATION SYSTEMS- Signals-Types of communication

systems, Electromagnetic Spectrum, bandwidth, Noise, Signal to noise ratio; AMPLITUDE
MODULATION - DSB, DSB-SC, AM Transmitter- AM Demodulation- AM Receivers; ANGLE
MODULATION - Frequency modulation and demodulation- FM transmitters- Receiver
characteristics, Super-heterodyne receiver-AM AND FM - Phase Modulation ; BASEBAND
DIGITAL COMMUNICATION- A/D CONVERSION - Line coding techniques; PASSBAND
DIGITAL COMMUNICATION- Digital modulation schemes; Coding Techniques- Source
coding theorem and techniques - Error control coding; ADVANCED COMMUNICATION
SYSTEMS- Satellite, Optical, Radar and Wireless Communication Systems .
L T P C
BECM304L Principles of Communication Systems
3 0 0 3
Pre-requisite BECE206LAnalog Circuits Syllabus version
1.0
Course Objectives
1. To explain the basic building blocks of analog and digital communication systems.
2. To explain the need for modulation and describe the concepts of amplitude and angle
modulation schemes
3. To explain the concepts of baseband, passband communication, and to apply coding
techniques in digital communication.
4. To provide an overview of advanced communication systems.
Course Outcome
1. Comprehend the elements of electronic communication systems.
2. Understand the concepts of amplitude modulation and angle modulation.
3. Sample analog signal and recover original signal without any distortion.
4. Analyze various passband communication techniques.
5. Apply various coding techniques in communication systems.
6. Understand advanced communication systems.
Module:1 INTRODUCTION TO COMMUNICATION 8 hours

SYSTEMS
Signals-Types and Characteristics, Block diagram of communication system, Types of
communication systems, Simplex and Duplex Systems, Analog and digital systems,
Electromagnetic Spectrum for communication systems, Concept of bandwidth, Noise, Types
of noise, noise voltage, Signal to noise ratio, Friis formula, noise figure.
Module:2 AMPLITUDE MODULATION 7 hours
Need for modulation, Amplitude modulation: DSB, DSB-SC, AM Transmitters- Low level and
High level transmitters, Demodulation: Square law detector, Coherent detector, AM
Receivers.
Module:3 ANGLE MODULATION 8 hours
Frequency modulation and demodulation, FM transmitters, Receiver characteristics, Super-
heterodyne receiver, AGC, AFC, Concept of Phase Modulation.
Module:4 BASEBAND DIGITAL COMMUNICATION 4 hours
A/D Conversion: Sampling, quantization, Encoding, PCM, DPCM, DM and ADM. Line
coding techniques.
Module:5 PASSBAND DIGITAL COMMUNICATION 5 hours
Digital modulation schemes: ASK, FSK, PSK, QPSK.
Module:6 Coding Techniques 8 hours
Shannon channel capacity theorem, Source coding: Huffman and Shannon-Fano coding
techniques, Error control coding: Linear Block codes.
Module:7 ADVANCED COMMUNICATION SYSTEMS 3 hours
Principles of Satellite, Optical, Radar and Wireless Communication Systems.
Guest Lecture from Industries and R & D Organizations
Text Book(s)
1. Herbert Taub and Donald L Schilling, “Principles of Communication Systems”, 4th Edn,
McGraw Hill, 2017
2. M L Anand, “Principles of Communication Engineering”, CRC Press, 2021
Reference Books
1. G. Kennedy and B. Davis, “Electronic Communication Systems”, Tata McGraw Hill, 2011
2. Simon Haykin, “An Introduction to Analog and Digital Communications”, John Wiley,
2012
3. Wayne Tomasi, “Electronic Communications Systems – Fundamentals Through
advanced”, 5thEdition, Pearson Education, 2009
4. Rodger E Ziemer, William H Tranter, “Principles of Communications: Systems,
Modulation and Noise” 7th Edn, Wiley, 2015
5. John.G. Proakis, “Fundamentals of Communication Systems”, Pearson Education, 2nd
Edition, 2014.
Assessment Test
Approved by Academic Council No. xx Date DD-MM-YYYY
Short Syllabus
BCSE208L Data Mining (2-0-0-2)
Data Warehousing - Introduction to Data warehouse, Data Warehouse models; Introduction

to Data Mining - Introduction to data mining, Data mining functionalities; Data Preprocessing
- Data Preprocessing, An overview; Frequent Pattern Mining - Frequent Pattern Mining,
Basic Concepts and a Road Map; Classification Techniques - General approach to
classification, Classiﬁcation by decision tree induction, Bayes classification methods; Cluster
Analysis - Types of data in cluster analysis; Data Mining Trends and Research Frontiers
Overview of Web mining, Temporal and Spatial mining.

BCSE208L Data Mining 2 0 0 2
1.0
Course Objectives
1. To introduce the fundamental processes data warehousing and major issues in data
mining.
2. To impart the knowledge on various data mining concepts and techniques that can
be applied to text mining, web mining etc.
3. To develop the knowledge for application of data mining and social impacts of data
mining.
Course Outcome
Upon completion of the course the student will be able to
1. Interpret the contribution of data warehousing and data mining to the decision-
support systems.
2. Construct the data needed for data mining using preprocessing techniques.
3. Discover interesting patterns from large amounts of data using Association Rule
Mining.
4. Extract useful information from the labeled data using various classifiers and Compile
unlabeled data into clusters applying various clustering algorithms.
5. Demonstrate capacity to perform a self-directed piece of practical work that requires
the application of data mining techniques.
Module:1 Data Warehousing 4 hours

Introduction to Data warehouse - Data Warehouse models- Data warehouse architecture:
Three-tier data warehouse architecture - Data warehouse modeling: Data cube and OLAP –
Star and Snowflake Schema.
Module:2 Introduction to Data Mining 3 hours
Introduction to data mining - Data mining functionalities - Steps in data mining process-
Classification of data mining systems - Major issues in data mining.
Module:3 Data Preprocessing 3 hours
Data Preprocessing: An overview - Data cleaning - Data integration -Data reduction - Data
transformation.
Module:4 Frequent Pattern Mining 4 hours
Frequent Pattern Mining: Basic Concepts and a Road Map - Efficient and scalable frequent
item set mining methods: Apriori algorithm, FP-Growth algorithm - Mining frequent item sets
using vertical data format.
Module:5 Classification Techniques 5 hours
General approach to classification - Classiﬁcation by decision tree induction - Bayes
classification methods - Model evaluation and selection - Techniques to improve
classification accuracy - advanced classification methods: Bayesian belief networks- Lazy
learners.
Module:6 Cluster Analysis 5 hours
Types of data in cluster analysis - Partitioning methods - K Medoid Clustering - Density
based methods - Grid based methods - Outlier analysis.
Module:7 Data Mining Trends and Research 4 hours
Frontiers
Overview of Web mining-Temporal and Spatial mining-Other methodologies of data mining:
Statistical data mining- Data mining applications.

Text Book(s)
Jiawei Han and Micheline Kamber, Data Mining: Concepts and Techniques, Morgan
1.
Kaufmann Publishers, third edition, 2013.
Reference Books
Parteek Bhatia, Data Mining and Data Warehousing: Principles and Practical
1.
Techniques, Cambridge University Press, 2019.
Pang-Ning Tan, Michael Steinbach, Anuj Karpatne, Vipin Kumar, Introduction to Data
2.
Mining, Pearson, 2nd Edition, 2019.
Mode of Evaluation : Continuous Assessment Tests, Quizzes, Assignment, Final
Assessment Test


BCSE208P Data Mining Lab 0 0 2 1
1.0
Course Objectives
1. To introduce the fundamental processes data warehousing and major issues in
data mining.
2. To impart the knowledge on various data mining concepts and techniques that
can be applied to text mining, web mining etc.
3. To develop the knowledge for application of data mining and social impacts of
data mining.
Course Outcome
1. Interpret the contribution of data warehousing and data mining to the decision-
support systems.
2. Construct the data needed for data mining using preprocessing techniques.
3. Discover interesting patterns from large amounts of data using Association Rule
Mining.
4. Extract useful information from the labeled data using various classifiers and
Compile unlabeled data into clusters applying various clustering algorithms.
5. Demonstrate capacity to perform a self-directed piece of practical work that
requires the application of data mining techniques.
1. Introduction to exploratory data analysis using R.
2. Demonstrate the Descriptive Statistics for a sample data like mean, median,
variance and correlation etc.,
3. Demonstrate Missing value analysis using sample data.
4. Demo of Apriori algorithm on various data sets with varying confidence and
support.
5. Demo of FP Growth algorithm on various data sets with varying confidence and
support.
6 Demo on Classification Techniques such as Decision Tree (ID3 / CART),
Bayesian etc., and using sample data.
7. Demonstration of Clustering Techniques K-Medoid and Hierarchical.
8. Demonstration on Document Similarity Techniques and measurements.
9. Simulation of Page Rank Algorithm.
10. Demonstration on Hubs and Authorities.
Text Book(s)
Jiawei Han and Micheline Kamber, Data Mining: Concepts and Techniques, Morgan
Kaufmann Publishers, third edition, 2013.
Reference Books
Parteek Bhatia, Data Mining and Data Warehousing: Principles and Practical
Techniques, Cambridge University Press, 2019.
Pang-Ning Tan, Michael Steinbach, Anuj Karpatne, Vipin Kumar, Introduction to Data
Mining, Pearson, 2nd Edition, 2019.
Mode of Assessment: Continuous Assessment / FAT / Oral examination and others


SHORT SYLLABUS
BCSE301L Software Engineering (3-0-0-3)
Software Engineering – Process Models – Introduction to Agility – Project Management –

Cost and Estimates – CASE Tools – Requirements Engineering Process – Design Concepts
and Principles – Validation and Verification – Software Evolution and Maintenance –
Software Quality Assurance – Process Improvement Models.

BCSE301L Software Engineering L T P C

3 0 0 3
1.0
Course Objectives
1. To introduce the essential Software Engineering concepts.
2. To impart concepts and skills for performing analysis, design ,develop, test and evolve
efficient software systems of various disciplines and applications
3. To make familiar about engineering practices, standards and metrics for developing
software components and products.
Course Outcomes
1. Apply and assess the principles of various process models for the software
development.
2. Demonstrate various software project management activities that include planning ,
Estimations, Risk assessment and Configuration Management
3. Perform Requirements modelling and apply appropriate design and testing heuristics
to produce quality software systems.
4. Demonstrate the complete Software life cycle activities from requirements analysis to
maintenance using the modern tools and techniques.
5. Escalate the use of various standards and metrics in evaluating the process and
product.
Module:1 Overview Of Software Engineering 6 hours

Nature of Software, Software Engineering, Software process, project, product, Process
Models
Classical Evolutionary models, Introduction to Agility - Agile Process-Extreme programming
- XP Process – Principles of Agile Software Development framework - Overview of System
Engineering
Module:2 Introduction To Software Project 6 hours
Management
Planning, Scope, Work break-down structure, Milestones, Deliverables, Cost and Estimates
- (Human Resources, Time-scale, Costs), Risk Management, RMMM Plan, CASE TOOLS,
Agile Project Management, Managing team dynamics and communication, Metrics and
Measurement
Module:3 Modelling Requirements 8 hours
Software requirements and its types, Requirements Engineering process, Requirement
Elicitation, System Modeling – Requirements Specification and Requirement Validation,
Requirements Elicitation techniques, Requirements management in Agile.
Module:4 Software Design 8 hours
Design concepts and principles - Abstraction - Refinement - Modularity Cohesion coupling,
Architectural design, Detailed Design Transaction Transformation, Refactoring of designs,
Object oriented Design User-Interface Design
Module:5 Validation And Verification 7 hours
Strategic Approach to Software Testing, Testing Fundamentals Test Plan, Test Design, Test
Execution, Reviews, Inspection and Auditing – Regression Testing – Mutation Testing -
Object oriented testing - Testing Web based System - Mobile App testing – Mobile test
Automation and tools – DevOps Testing – Cloud and Big Data Testing
Module:6 Software Evolution 4 hours

Software Maintenance, Types of Maintenance, - Software Configuration Management –

Overview – SCM Tools. Re-Engineering, Reverse Engineering, Software Reuse
Module:7 Quality Assurance 4 hours
Product and Process Metrics, Quality Standards Models ISO, TQM, Six-Sigma, Process
improvement Models: CMM & CMMI. Quality Control and Quality Assurance - Quality
Management - Quality Factors - Methods of Quality Management

Text Book(s)
1. Ian Somerville, Software Engineering, 10th Edition, Addison-Wesley, 2015
Reference Books
1. Roger S. Pressman and Bruce R. Maxim, Software Engineering: A Practitioner’s
Approach, 10th edition, McGraw Hill Education, 2019
2. William E. Lewis , Software Testing and Continuous Quality Improvement, Third Edition,
Auerbach Publications, 2017
Mode of Evaluation: CAT, Written assignment, Quiz, FAT.

Short Syllabus
BCSE332L Deep Learning (3-0-0-3)
Neural Networks Basics - Deep Neural Networks – Forward and Back Propagation; Deep
Convolutional Models – ResNet, AlexNet, InceptionNet ; Mini-batch Gradient Descent –
Exponential Weighted Averages - Hyperparameter tuning – Batch Normalization ; Recurrent
Neural Networks - Bidirectional RNN - BERT ; Recursive Neural Networks - Echo State
Networks - Long Short-Term Memory; Transfer Learning – Generative Adversarial Network–
Region based CNN – Fast RCNN - You Only Look Once – Single shot detector ; Deep
Reinforcement Learning - Deep Q-Learning - Model based Reinforcement Learning.


BCSE332L Deep Learning 3 0 0 3
1.0
Course Objectives
1. Introduce major deep neural network frameworks and issues in basic neural
networks
2. To solve real world applications using Deep learning
Course Outcomes
At the end of this course, student will be able to:
1. Understand the methods and terminologies involved in deep neural network,
differentiate the learning methods used in Deep-nets.
2. Identify and apply suitable deep learning approaches for given application.
3. Design and develop custom Deep-nets for human intuitive applications
4. Design of test procedures to assess the efficiency of the developed model.
5. To understand the need for Reinforcement learning in real – time problems.
Module:1 Introduction to neural networks and deep neural networks 7 hours

Neural Networks Basics - Functions in Neural networks – Activation function, Loss function -
Function approximation - Classification and Clustering problems - Deep networks basics -
Shallow neural networks – Activation Functions – Gradient Descent – Back Propagation –
Deep Neural Networks – Forward and Back Propagation – Parameters - Hyperparameters
Module:2 Convolution neural networks 6 hours
Foundations of Convolutional Neural Networks – CNN operations – Architecture – Simple
Convolution Network – Deep Convolutional Models – ResNet, AlexNet, InceptionNet and
others
Module:3 Improving deep neural networks 8 hours
Mini-batch Gradient Descent – Exponential Weighted Averages – Gradient Descent with
Momentum – RMSProp and Adam Optimization – Hyperparameter tuning – Batch
Normalization – Softmax Regression – Softmax classifier – Deep Learning Frameworks –
Data Augmentation - Under-fitting Vs Over-fitting
Module:4 Recurrent networks 6 hours
Recurrent Neural Networks - Bidirectional RNNs, Encoder, Decoder, Sequence-to-Sequence
Architectures, Deep Recurrent Networks, Auto encoders - Bidirectional Encoder
Representations from Transformers (BERT)
Module:5 Recursive neural networks 6 hours
Long-Term Dependencies - Echo State Networks - Long Short-Term Memory and Other
Gated RNNs - Optimization for Long-Term Dependencies - Explicit Memory
Module:6 Advanced Neural networks 6 hours
Transfer Learning – Transfer Learning Models – Generative Adversarial Network and their
variants – Region based CNN – Fast RCNN - You Only Look Once – Single shot detector
Module:7 Deep reinforcement learning 5 hours
Deep Reinforcement Learning – Q-Learning – Deep Q-Learning – Policy Gradients -
Advantage Actor Critic (A2C) and Asynchronous Advantage Actor Critic (A3C) – Model
based Reinforcement Learning - Challenges
Total Lecture hours: 45 Hours

Text Book(s)
1. Deep Learning, Ian Goodfellow Yoshua Bengio Aaron Courville, MIT Press, 2017
2 Neural Networks and Deep Learning, Michael Nielsen,, Determination Press
Reference Books
1. Deep Learning Step by Step with Python, N D Lewis, 2016
2. Deep Learning: A Practitioner's Approach, Josh Patterson, Adam Gibson, O'Reilly
Media, 2017
3 Applied Deep Learning. A Case-based Approach to Understanding Deep Neural
Networks, Umberto Michelucci, Apress, 2018.
4 Deep Learning with TensorFlow: Explore neural networks with Python, Giancarlo
Zaccone, Md. RezaulKarim, Ahmed Menshawy, Packt Publisher, 2017.
Mode of Evaluation: CAT / Written Assignment / Quiz / FAT


BCSE332P Deep Learning Lab 0 0 2 1
1.0
Course Objectives
1. Introduce major deep neural network frameworks and issues in basic neural networks
2. To solve real world applications using Deep learning.
Course Outcomes
1. Understand the methods and terminologies involved in deep neural network,
differentiate the learning methods used in Deep-nets.
2. Identify and apply suitable deep learning approaches for given application.
3. Design and develop custom Deep-nets for human intuitive applications
4. Design of test procedures to assess the efficiency of the developed model.
To understand the need for Reinforcement learning in real – time problems.
1. Demonstration and implementation of Shallow architecture, using 10 hours
Python, Tensorflow and Keras
 Google Colaboratory - Cloning GitHub repository, Upload Data,
Importing Kaggle's dataset, Basic File operations
 Implementing Perceptron,
 Digit Classification : Neural network to classify MNIST dataset
2. Hyper parameter tuning and regularization practice - 4 hours

 Multilayer Perceptron (BPN)
 Mini-batch gradient descent,
3. Convolution Neural Network application using Tensorflow and Keras, 4 hours
 Classification of MNIST Dataset using CNN
 Face recognition using CNN
4. Object detection using Transfer Learning of CNN architectures 2 hours
5. Image denoising (Fashion dataset) using Auto Encoders 2 hours

 Handling Color Image in Neural Network aka Stacked Auto
Encoders (Denoising)
6. Text processing, Language Modeling using RNN 2 hours
7. Transfer Learning models for classification problems 2 hours
8. Sentiment Analysis using LSTM 2 hours
9. Image generation using GAN 2 hours

Text Book(s)
1. Deep Learning, Ian Goodfellow Yoshua Bengio Aaron Courville, MIT Press, 2017
2 Neural Networks and Deep Learning, Michael Nielsen,, Determination Press
Reference Books
1. Deep Learning Step by Step with Python, N D Lewis, 2016

2. Deep Learning: A Practitioner's Approach, Josh Patterson, Adam Gibson, O'Reilly

Media, 2017
3 Applied Deep Learning. A Case-based Approach to Understanding Deep Neural
Networks, Umberto Michelucci, Apress, 2018.
4 Deep Learning with TensorFlow: Explore neural networks with Python, Giancarlo
Zaccone, Md. RezaulKarim, Ahmed Menshawy, Packt Publisher, 2017.
Mode of Evaluation: CAT / Mid-Term Lab/ FAT


SHORT SYLLABUS
BCSE324L Foundations of Blockchain Technology (3-0-0-3)
Foundations of Blockchain - Distributed Ledger Technology - Public and Private Ledgers -

Practitioner Perspective: Keyless Technologies, Transparency as a Strategic Risk - Anatomy
of a Smart Contracts - Decentralized Organization - Autonomous Organizations: Aragon,
DAOstack - Blockchain Ecosystem - Components in Blockchain Ecosystem - Blockchain
Protocols - High Performance Computing - Blockchain storage of Integrity Data.

BCSE324L FOUNDATIONS OF BLOCKCHAIN TECHNOLOGY L T P C

3 0 0 3
1.0
Course Objectives
1. To understand building blocks of Blockchain.
2. To significance of Distributed Ledger Technology and Smart Contract.
3. To exploit applications of Blockchain in real world scenarios and their impacts.
Course Outcomes
After completion of this course, the student shall be able to:
1. Understand Blockchain ecosystem and its services in real world sceneries

2. Apply and Analyze the requirement of Distributed Ledger Technology and Smart
Contract
3. Design and Demonstrate end-to-end decentralized applications
4. Acquaint the protocol and assess their computational requirements
Module:1 Foundations of Blockchain 7 hours

Blockchain Architecture – Challenges – Applications – Blockchain Design Principles -The
Blockchain Ecosystem - The consensus problem - Asynchronous Byzantine Agreement -
AAP protocol and its analysis - peer-to-peer network – Abstract Models - GARAY model -
RLA Model - Proof of Work (PoW) - Proof of Stake (PoS) based Chains - Hybrid models.
Module:2 Distributed Ledger Technology 6 hours
Origin of Ledgers – Types and Features of Distributed Ledger Technology (DLT) - Role of
Consensus Mechanism - DLT Ecosystem - Distributed Ledger Implementations – Blockchain
- Ethereum - Public and Private Ledgers – Registries – Ledgers - Practitioner Perspective:
Keyless Technologies, Transparency as a Strategic Risk, Transparency as a Strategic
Asset, Usage of Multiple IDs - Zero Knowledge Proofs - Implementation of Public and
Private Blockchain
Module:3 Smart Contracts 5 hours
Anatomy of a Smart Contracts - Life Cycle - Usage Patterns - DLT-based smart contracts -
Use Cases: Healthcare Industry and Property Transfer.
Module:4 Decentralized Organization 5 hours
Decentralization versus Distribution - Centralized-distributed (Ce-Di) organizations -
Decentralized-distributed (De-Di) organizations - Decentralized Autonomous Organizations:
Aragon, DAOstack, DAOhaus and Colony.
Module:5 Types of Blockchain Ecosystem 7 hours
One-Leader Ecosystem - Joint Venture or Consortia Ecosystems - Regulatory Blockchain
Ecosystems - Components in Blockchain Ecosystem: Leaders, Core Group, Active
Participants, Users, Third-Party Service Providers - Governance for Blockchain Ecosystems.
Module:6 Blockchain Protocols 6 hours
Ethereum tokens – Augur - Golem - Understanding Ethereum tokens - App Coins and
Protocol Tokens - Blockchain Token Securities Law Framework - Token Economy - Token
sale structure - Ethereum Subreddit.
Module:7 High Performance Computing 7 hours
Integrity of High Performance Systems - Data Provenance - Cluster Construction and
Deployment - Mock Workload - Blockchain Software Evaluation - Blockchain storage of
Integrity Data.
Text Book
1. Dhillon, V., Metcalf, D., and Hooper, M, Blockchain enabled applications, 2017, 1st

Edition, CA: Apress, Berkeley.
Reference Books
Diedrich, H., Ethereum: Blockchains, digital assets, smart contracts, decentralized
1.
autonomous organizations, 2016, 1st Edition, Wildfire publishing, Sydney.
Wattenhofer, R. P, Distributed Ledger Technology: The Science of the Blockchain
2. (Inverted Forest Publishing), 2017, 2nd Edition, Createspace Independent Pub,
Scotts Valley, California, US.
Mode of Evaluation: CAT, written assignment, Quiz, FAT

Short Syllabus
BCSE420L Sensors, Actuators and Signal Conditioning (2-0-0-2)
Basics of Energy Transformation - Introduction to sensors and transducers, Principle of

sensing and transduction, Classification of sensors; Performance Characteristics of Sensors
- Actuator Performance and Selection - Measurement of Industrial Parameters -
Measurement of temperature, Measurement of pressure, Measurement of distance; Signal
Conditioning - Data Acquisition System - Sensor Technology.


BCSE420L Sensors, Actuators and Signal Conditioning 2 0 0 2
1.0
Course Objectives:
1. To summarize and analyze the different types of sensors, signal conditioning circuits,
and actuators.
2. To introduce students the criteria for selecting a sensor for a particular measurement.
3. To elucidate students the types of actuators: electrical, pneumatic, and hydraulic and
enlighten their operation.
4. To familiarize students with the basic techniques of designing the required signal
conditioning for a particular sensor.
Course Outcomes:
After the completion of the course, student will be able to:
1. Comprehend, classify and analyze the behavior of different types of sensors.
2. Analyze the characteristics and performance measures of sensors and select suitable
sensor for the given industrial applications.
3. Gain the knowledge about the types of actuators: electrical, pneumatic, and hydraulic,
performance criteria and selection.
4. Elucidate the construction and working of various industrial parameters / devices used to
measure temperature, pressure, flow, level and displacement.
5. Design the sensor interfacing and signal conditioning for various applications.
6. Implement the data acquisition systems with different sensors for real-time applications.
7. Realize the trends in sensor technology, industrial network and automation.
8. Conduct experiments and measurements in laboratory and realize hands-on experience
on real components, sensors and actuators.
Module:1 Basics of Energy Transformation 2 hours
Introduction to sensors and transducers, Principle of sensing and transduction,
Classification of sensors.
Module:2 Performance Characteristics of Sensors 4 hours
Static characteristics: accuracy, precision, resolution, sensitivity, linearity, span and range -
Dynamic characteristics, Mathematical model of transducer: zero, first and second,
Response to impulse, step, ramp and sinusoidal inputs, Selection criteria of sensor.
Module:3 Actuator Performance and Selection 5 hours
Electrical actuating systems: solid-state switches, solenoids and electric motors: DC motor,
stepper motor, and Inertial measurement unit, Mechanical actuating systems: types of
motion, kinematic chains, cams and gears, Pneumatic and hydraulic actuating systems:
diaphragms, bellows and control valves.
Module:4 Measurement of Industrial Parameters 6 hours

Measurement of temperature: thermistor and LM35, Measurement of pressure: strain gauge
and piezoelectric type, Measurement of distance: ultrasonic, linear variable differential
transformer and capacitance type, proximity sensor, Infrared sensor, Pulse oximeter and
Tachometer.
Module:5 Signal Conditioning 5 hours

Amplification, Filtering, Multiplexing, Conversion techniques, Sensor interface design:
Wheatstone bridge and operational amplifier circuits for various applications.

Module:6 Data Acquisition System 3 hours

Data Acquisition: single channel and multi-channel data acquisition, Data logging, Interfacing
of sensors using DAQ cards, Applications: automobile and biological systems.
Module:7 Sensor Technology 3 hours
Process of developing sensors, Trends in sensor technology and IC sensors, Sensor array’s
and multi-sensor systems, Smart sensors, Industrial network and automation.
Text Book(s)
1. D. Patranabis, “Sensors and Actuators”, 2nd Edition, PHI Learning, New Delhi, India,
2013.
2. Ramon Pallas-Areny, John G. Webster, “Sensors and Signal Conditioning”, 2nd Edition,
Wiley India Pvt. Ltd., India, 2012.
Reference Books
1. D. Patranabis, “Sensors and Transducers”, 2nd Edition, PHI Learning Pvt. Ltd., New
Delhi, India, 2011.
2. Jon S. Wilson, “Sensor Technology Hand Book”, Newnes Publishing Company,

Boston, USA, 2005.
3. A.K. Sawhney, Puneet Sawhney, “A Course in Electrical and Electronic Measurements

and Instrumentation”, Dhanpat Rai and Co. Pvt. Ltd., New Delhi, India, 2014.
Mode of Evaluation: Continuous Assessment Test –I (CAT-I), Continuous Assessment Test
–II (CAT-II), Digital Assignments/ Quiz / Completion of MOOC, Final Assessment Test
(FAT).


BCSE420P Sensors, Actuators and Signal Conditioning Lab 0 0 2 1
1.0
Course Objectives
1. To summarize and analyze the different types of sensors, signal conditioning circuits,
and actuators.
2. To introduce students the criteria for selecting a sensor for a particular measurement.
3. To elucidate students the types of actuators: electrical, pneumatic, and hydraulic and
enlighten their operation.
4. To familiarize students with the basic techniques of designing the required signal
conditioning for a particular sensor.
Course Outcome
Comprehend, classify and analyze the behavior of different types of sensors.
1. Analyze the characteristics and performance measures of sensors and select
suitable sensor for the given industrial applications.
2. Gain the knowledge about the types of actuators: electrical, pneumatic, and
hydraulic, performance criteria and selection.
3. Elucidate the construction and working of various industrial parameters / devices
used to measure temperature, pressure, flow, level and displacement.
4. Design the sensor interfacing and signal conditioning for various applications.
5. Implement the data acquisition systems with different sensors for real-time
applications.
6. Realize the trends in sensor technology, industrial network and automation.
7. Conduct experiments and measurements in laboratory and realize hands-on
experience on real components, sensors and actuators.
1. Interfacing of sensors for monitoring the physical quantities (distance, pressure,
temperature, light intensity) and raising an alarm/ actuating a signal if the quantity
exceeds specified limit.
2. Measurements using proximity sensor and LiDAR sensor. Control of speed, direction
and number of revolutions of a stepper motor.
3. Obstacle avoidance robotic systems using servomotors, ultrasonic sensor and IR
sensor.
4. Design and test a signal conditioning circuit for the sensor interface: Instrumentation
amplifier, filter and comparator.
5. Interfacing data acquisition system hardware with computer to measure and control the
robotic system.
Text Book(s)
1. D. Patranabis, “Sensors and Actuators”, 2nd Edition, PHI Learning, New Delhi, India,
2013.
2. Ramon Pallas-Areny, John G. Webster, “Sensors and Signal Conditioning”, 2nd
Edition, Wiley India Pvt. Ltd., India, 2012.
Reference Books
1. D. Patranabis, “Sensors and Transducers”, 2nd Edition, PHI Learning Pvt. Ltd., New
Delhi, India, 2011.
2. Jon S. Wilson, “Sensor Technology Hand Book”, Newnes Publishing Company, Boston,
USA, 2005.
3. A.K. Sawhney, Puneet Sawhney, “A Course in Electrical and Electronic Measurements

and Instrumentation”, Dhanpat Rai and Co. Pvt. Ltd., New Delhi, India, 2014.
Mode of assessment: Continuous assessment / FAT / Oral examination and others

ShortvSyllabus
BCSE428L Autonomous Drones (2-0-0-2)
Introduction to Autonomous Drones - History – Types – Components; Design Fundamentals

- Flight Controllers; Drone Basics - Flight Basics – Preflight Checks – Flight Modes – Key
Skills – Simulators - Autopilot; Modelling and Control With MATLAB/Simulink Implementation
- Quadcopter Project; Stability and control – Static stability, Dynamic stability; Applications -
Expanding Drones Abilities.


BCSE428L Autonomous Drones 2 0 0 2
1.0
Course Objectives
1. To know the principles of flight and how they apply to robotic drones
2. To know different kinds of airframes and how to assemble a drone.
3. To know the basics of drone design and how to choose the right components.
Course Outcomes
1. Understand the evolution and classification of Drones / Unmanned aerial Vehicle
(UAVs)
2. Gain knowledge on UAVs technology side of things ( i.e. sensors, platforms, navigation,
power source, communication, range, altitude and speed)
3. Illustrate the commercial applications used by various types of drones such as aerial
photography, law enforcement surveillance, and border enforcement.
4. Discuss Indian government airspace policy, regulations, and a comparison of other
international regulations, and risk factors
5. Realize the emerging technologies being integrated into the drone market including
semi-autonomous and autonomous systems for various applications.
Module:1 Introduction to Autonomous Drones 4 hours

History of Drones – Types of drones – Airframe – Batteries – Motors – ESC: Electronic
Speed Controller – Propellers.
Module:2 Design Fundamentals 3 hours
Flight Controllers – RC Transmitters – FPV Systems – Telemetry – Timing Gates.
Module:3 Drone Basics 5 hours
Flight Basics – Preflight Checks – Flight Modes – The Maiden Flight – Roll, Pitch, Throttle &
Yaw – Key Skills – Simulators – Manual Mode – GPS Autopilot – Intelligent Flight Modes
Module:4 Modelling and Control With MATLAB/Simulink Implementation 5 hours
Quadcopter Project: Quadcopter Physical Characteristics, Vehicle Dynamic, Components,
Simulink Modelling.
Module:5 Stability and control 5 hours
Static stability, Dynamic stability, static stability and control, Longitudinal control, stick
forces, directional stability and control, roll stability and control.
Module:6 Applications 3 hours
Beneficial Drones, Aerial Photography, Mapping and Surveying, Precision Agriculture,
Search and Rescue, Infrastructure Inspection, Conservation
Module:7 Expanding Drones Abilities 3 hours
Add a camera and FPV, Collect more data with other sensors, Altering Speed and
Increasing flight times. Building a Quadcopter
Total Lecture hours: 30 Hours

Text Book(s)
1. Adam Juniper, “The Complete Guide to Drones”, 2nd Edition, ilex.
2. John Baichtal “Building your own Drones A beginners Guide to Drones, UAVs and
ROVs”, Que Publishing 2016
3. Terry Kilby and Belinda Kilby, Make: Getting Started with Drones, First Edition, Maker
Media Inc, San Francisco CA, 2016

4. Robert C.Nelson, “Flight Stability and Automatic control”, McGraw-Hill.

5. https://in.mathworks.com/help/aeroblks/quadcopter-project.html
Reference Books
1. A. R. Jha, “Theory, Design, and Applications of Unmanned Aerial Vehicles”, First
Edition, CRC Press, 2020
Mode of Evaluation: Continuous Assessment Test –I (CAT-I), Continuous Assessment Test
–II (CAT-II), Digital Assignments/ Quiz / Completion of MOOC, Final Assessment Test
(FAT).


BCSE428P Autonomous Drones Lab 0 0 2 1
1.0
Course Objectives
1. To gain insight into the basic elements of commercial-off-the-shelf (COTS) drone
systems used in civilian missions
2. To introduce unmanned aerial systems (UAS) including drones and autonomous
unmanned aerial vehicles (UAV) with sensors
Course Outcome
1. Gain knowledge on UAVs technology side of things (i.e. sensors, platforms, navigation,
power source, communication, range, altitude and speed)
2. Illustrate the commercial applications used by various types of drones such as aerial
photography, law enforcement surveillance, and border enforcement.
1. Basic building blocks and 3D Design of a Drone
2. Making the drone to be stable and fly autonomously with little human
intervention
3. Design a control system architecture that will hover a quadcopter
4. Position Control: To implement a local navigation algorithm through the use of a PID
controller.
5. Navigation by position:
To implement an autopilot by using the GPS sensor, the IMU, and a position-based PID
controller. For this exercise, a simulated 3D world has been designed that contains the
quadrotor and five beacons arranged in a cross. The objective is to program the drone
to follow a predetermined route visiting the five waypoints in a given sequence. It
illustrates the algorithms typically included in commercial autopilots such as ArduPilot or
PX4.
6. Following an object on the ground:
To implement the logic that allows a quadrotor to follow a moving object on the ground,
using a primary color filter in the images and a vision-based PID controller. The drone
keeps its altitude and moves only in a 2D plane.
7. Searching for people to rescue within a perimeter:
The objective of this exercise is to implement the logic of a global navigation algorithm
to sweep a specific area systematically and efficiently, in conjunction with visual face-
recognition techniques, to report the location of people for subsequent rescue. The
drone behavior is typically implemented as a finite state machine, with several states
such as go-to-the-perimeter, explore-inside-the-perimeter, or go-back-home.
Text Book(s)
1. Terry Kilby and Belinda Kilby Make: Getting Started with Drones, First Edition,
Maker Media Inc, San Francisco CA, 2016
Reference Books
1. Mohammad H. Sadraey “Design of Unmanned Aerial Systems” First Edition, John
Wiley & Sons, Inc., USA 2020
2. A. R. Jha, “Theory, Design, and Applications of Unmanned Aerial Vehicles”, First
Edition, CRC Press, 2020
Mode of assessment: Continuous assessment / FAT / Oral examination and others

BCSE429L Cyber Physical Systems Design (2-0-0-2)
CPS Application Architecture and Challenges - Introduction, CPS Characteristics, CPS

Architecture, Various Systems; Components of CPS – Sensors and Actuators, Interfaces,
Control Systems; Integrating Physical and Cyber Space – Networked Systems,
Communication Systems – Industry 4.0; Models of Computation for CPS – Various Models,
Ptolemy tool; Discrete Time and Other Modeling Tools – Event Models, Control Systems and
Coordination, Various Models; Swarmlet Design – Swarm Sensors, Swarm OS; Case
Studies and Applications – Vehicular Adhoc Networks, Flying Adhoc Networks, Smart
Energy Grids.
BCSE430L Distributed Real Time Systems (2-0-0-2)
Introduction – Real Time Systems, Embedded Systems, Advantages and Disadvantages;

Modelling Timing Constraints – Timing Constraints, State Machines; Scheduling Real Time
Tasks – Types of Schedulers, Issues; Handling Resource Sharing among Real Time Tasks
– Protocols; Scheduling Real Time tasks in Shared Memory Multiprocessor and Distributed
Systems – Real Time Task Scheduling, Clock Synchronization; Real Time Operating
Systems – General concepts, Issues, Open source and Commercial RTOS; Real Time
Communication and Real Time Databases – Issues, Real Time Communication in LAN, over
packet switched networks, Real time databases.


BCSE429L Cyber Physical Systems Design 2 0 0 2
1.0
Course Objectives
1. Learn about tools for physical, computational and communication modeling
2. Understand design choices to integrate the various physical models of computation with
the cyber space
Course Outcomes
1. To understand, analyse and design the communication components, computation
models and coordination models of a CPS
2. To evaluate the design of CPS system through verification and validation
3. To design coordination models for heterogeneous CPS
4. To state the challenges and the opportunities of CPS
Module: 1 CPS Applications Architecture and Challenges 3 hours

Cyber Physical System Introduction - Applications and Advantages - CPS characteristics -
5C Architecture - Technology Platforms in CPS - Abstraction Layers in Computing - Static
Vs. Dynamic Systems - Homogenous Vs. Heterogeneous systems - Possibilities and
Challenges - Role of Architecture Description Languages.
Module: 2 Components of CPS 5 hours
Physical Space - Sensors and Actuators - Embedded Processors, Input and Output
Interfaces - ADC and DAC - Control Systems - Feedback Control systems open and closed
loop - Human in the loop predictive model based control systems - Concurrency and
Synchronization of components in distributed CPS.
Module: 3 Integrating Physical and Cyber Space 3 hours
Highly dynamic networked systems - Designing Communication stack in node operating
system for CPS - Comparison with Industry 4.0, the Industrial Internet, Machine-to-Machine
(M2M) technologies - Issues integrating the heterogeneous physical systems with existing
cyberspace.
Module: 4 Models of Computation for CPS 5 hours
Ptolemy Tool – Models of Computation - Dataflow models - Process Networks -
Synchronous Reactive Models - Finite State Machine (all models with case studies and
examples).
Module: 5 Discrete Time and Other Modelling Tools 5 hours
Discrete Event Models - Hard Firm Soft Real Time Control Systems - Timed Automata
Coordination Models for Heterogeneous CPS - Petri Nets - UPPAAL modelling.
Module: 6 Swarmlet Designs 3 hours
Building IoT Applications with Accessors - CapeCode - Terra Swarms - Swarm Sensors -
Swarm OS (Examples like AprilTags, ClipPlayer and other accessor libraries).
Module: 7 Case Studies and Applications 4 hours
Automotive CPS - Vehicular Adhoc Networks - Flying Adhoc Networks (FANETs) - Drones –
UAVs - Smart Energy Grids.
Module: 8 Contemporary Issues 2 hours
Text Book(s)
Edward A. Lee and Sanjit A. Seshia, “Introduction to Embedded Systems, A Cyber-
1 Physical Systems Approach”, Second Edition, MIT Press, ISBN 978-0-262-53381-2,
2017

Reference Books
“System Design, Modelling, and Simulation” by The Ptolemy Project, University of
1
California, Berkeley
Papadopoulos, G. A. and Arbab, F. (1998). Coordination models and languages. In
2 Zelkowitz, M. V., editor, The Engineering of Large Systems, volume 46 of Advances in
Computers, pages 329–400. Academic Press.
Recommended by Board of Studies 13 – 05 - 2022
Approved by Academic Council No.66 Date 16.06.2022


BCSE429P Cyber Physical System Design Lab 0 0 2 1
1.0
Course Objectives
1. Learn about tools for physical, computational and communication modeling
2. Understand design choices to integrate the various physical models of computation with
the cyber space
Course Outcomes
1. To understand, analyse and design the communication components, computation
models and coordination models of a CPS
2. To evaluate the design of CPS system through verification and validation
3. To design coordination models for heterogeneous CPS
1 Introduction to Ptolemy Tool for CPS 2 hours
2 FSM Design Models in Ptolemy 2 hours
Simulation of Urban Mobility (SUMO) for Floating Cars with
3 2 hours
Electric Vehicle and without electric Vehicle Simulation.
Simulation of Emission norms in Automotive CPS systems and
4 populating polluting gases in vehicles and impact of those 2 hours
gases.
5 Use of Accessors APIs for CPS Modeling 2 hours
6 ClipPlayer using Accessors API 2 hours
Weather Monitoring using GPS locations with Google Maps or
7 2 hours
Open Street Map API
April Tags and their need to automate CPS Systems using
8 2 hours
Accessors API
9 Node JS inclusion in Accessors API 2 hours
10 MQTT and CoAP for Node JS 3 hours
11 Design and develop the obstacle avoidance robot 3 hours
12 Implement the automated guided vehicle systems 3 hours
Design and Implement the swing up control for the inversion
13 3 hours
system
Total Laboratory Hours: 30 hours
Text Book(s)
“System Design, Modelling, and Simulation” by The Ptolemy Project, University of
1
California, Berkeley
Reference Books
1 Principles of Cyber Physical Systems, Rajeev Alur, MIT Press, 2015
Introduction to Embedded Systems: A cyber physical systems approach, Edward
2
Ashford Lee and Others, Second Edition, MIT Press, 2017
Mode of Assessment: Weekly Assignment and FAT
Recommended by Board of Studies 13 – 05 - 2022
Approved by Academic Council No.66 Date 16.06.2022

Short Syllabus
BSSC101N Essence of Traditional Knowledge (0-0-0-2)
Traditional Knowledge - Indigenous Knowledge, Traditional knowledge Versus Western

Knowledge; Culture and Civilization - Cultural practices in India; Languages and
Literature; Religion and Philosophy in India - Religious Reform Movements in Modern
India; Fine Arts in India - Science and Technology; Traditional Medicine; Traditional
Knowledge in Different Sectors - Management of Biodiversity and Protection of Traditional
Knowledge; Legal Framework and Traditional Knowledge - The Protection of Traditional
Knowledge Bill (2016).
BSSC101N Essence of Traditional Knowledge L T P C

0 0 0 2
1.0
Course Objectives:
1. To impart the knowledge on Indian tradition and Culture.
2. To enable the students to acquire the traditional knowledge in different sectors.
3. To analyze and understand the Science, Management and Indian Knowledge
System.
Course Outcomes:
1. Familiarize the concept of Traditional Indian Culture and Knowledge.
2. Explore the Indian religion, philosophy and practices.
3. Analyze and understand the Indian Languages, Culture, Literature and Arts.
4. Gives a clear understanding on the Indian perspective of modern scientific world and
basic principles of Yoga and holistic health care system of India.
5. Enable knowledge on Legal framework and traditional knowledge.
Module:1 Introduction to Traditional Knowledge

Traditional knowledge: Definition, nature and characteristics, scope and importance, kinds of
traditional knowledge, Indigenous Knowledge, characteristics, Traditional knowledge vis-a-
vis Indigenous knowledge, Traditional knowledge Vs Western Knowledge.
Module:2 Culture and Civilization
Introduction to Culture and Civilization, Culture and Heritage, Characteristics features of
Indian Culture, Importance of Culture, Cultural practices in Ancient India, Medieval India and
Modern India.
Module:3 Languages and Literature
Indian Languages and Literature: the role of Sanskrit, significance of scriptures to current
society, Indian philosophies, other Sanskrit literature and literatures of South India.
Module:4 Religion and Philosophy
Religion and Philosophy: Religion and Philosophy in ancient India, Religion and Philosophy
in Medieval India, Religious Reform Movements in Modern India (selected movements only).
Module:5 Fine Arts in India
Indian Painting, Indian handicrafts, Music, divisions of Indian classic music, modern Indian
music, Dance and Drama. Science and Technology in India, Development of science in
ancient, medieval and modern India. Traditional Medicine – Herbal Healing - Yoga and
Pranayama practices.
Module:6 Traditional Knowledge in different sectors
Traditional knowledge and engineering, Traditional medicine system, Traditional knowledge
in agriculture, Dependence of Traditional Societies on food and healthcare needs;
Importance of conservation and sustainable development of environment, Management of
biodiversity and Protection of Traditional knowledge.
Module:7 Legal framework and Traditional Knowledge
Introduction on Legal framework and Traditional Knowledge: The Scheduled Tribes and
Other Traditional Forest Dwellers (Recognition of Forest Rights) Act, 2006, Plant Varieties
Protection and Farmer's Rights Act, 2001 (PPVFR Act); The Biological Diversity Act 2002
and Rules 2004, The protection of traditional knowledge bill, 2016.
Text Books :
1. Shikha Jain, Parul G Munjal And Somya Joshi,(2020) Traditional Knowledge

Systems And Cultural Heritage, Aryan Books International, India.
2. Anindya Bhukta(2020), Legal Protection for Traditional Knowledge: Towards A New

Law for Indigenous Intellectual Property, Emerald Publishing Limited, United

Kingdom.
Reference Books :
1. Traditional Knowledge System in India, by Amit Jha, 2009.
Basant Kumar Mohanta & Vipin Kumar Singh (2012), “Traditional Knowledge System
2. & Technology in India”, Pratibha Prakashan, India.
3. S. Baliyan, Indian Art and Culture, Oxford University Press, India.
4 http://indiafacts.org/author/michel-danino/
5. GN Jha (Eng. Trans.) Ed. R N Jha, Yoga-darshanam with Vyasa Bhashya,

Vidyanidhi Prakasham, Delhi,2016.
Mode of Evaluation: Quiz and Term End – Quiz



BSSC102N Indian Constitution 0 0 0 2
1.0
Course Objectives
This Course is an introduction of Indian Constitution and basic concepts highlighted in
this course for understanding the Constitution of India.
Course Outcome
At the end of the course, the student will acquire:
1. A basic understanding of Constitution of India.
2. The ability to understand the contemporary challenges and apply the knowledge
gained from the course to current social contemporary legal issues.
3. The understanding of constitutional remedies.
Module:1 Introduction to Indian Constitution 5 hours

Introduction to the constitution of India and the Preamble - Sources of Indian
Constitution - Features of Indian Constitution - Citizenship - Fundamental Rights and
Duties - Directive Principles of state policy
Module:2 Union Government and its Administration Structure of 8 hours
the Indian Union
Federalism, Centre- State relationship - President: Role, Power and Position - Prime
Minister and Council of ministers - Cabinet and Central Secretariat - Lok Sabha - Rajya
Sabha- The Supreme Court and High Court: Powers and Functions
Module:3 State Government and its Administration 4 hours

Governor- Role and Position - Chief Minister and Council of Ministers - State Legislative
Assembly - State secretariat: Organization, Structure and Functions
Module:4 Local Administration 7 hours

District’s Administration Head- Role and Importance - Municipalities: Introduction,
Mayor and role of Elected Representative - Panchayati Raj: Composition and Functions
Evolution and 73rd and 74th Amendments - Zila Parishad and district administration:
Composition and Functions Elected officials and their roles, CEO Zila Panchayat:
Position and role- Panchayat Samiti: Composition and Functions - Gram Panchayat:
Composition and Functions Importance of grass root democracy
Module:5 Election Commission 6 hours
Role of Chief Election Commissioner - State Election Commission - Functions of
Commissions for the welfare of SC/ST/OBC and women.

Reference Books
Durga Das Basu, Introduction to the Constitution of India, Gurgaon; LexisNexis,
1.
2018 (23rd edn.)
2. M.V.Pylee, India’s Constitution, New Delhi; S. Chand Pub., 2017 (16th edn.)
3. J.C Johari, Indian Government and Politics, Shoban Lal & Co., 2012
Noorani, A.G , Challenges to Civil Rights Guarantees in India, Oxford University
4.
Press 2012.
R. Bhargava, (2008) ‘Introduction: Outline of a Political Theory of the Indian
5. Constitution’, in R. Bhargava (ed.) Politics and Ethics of the Indian Constitution,
New Delhi: Oxford University Press.
Bidyut Chakrabarty & Rajendra Kumar Pandey, Indian Government and Politics,
6.
SAGE, New Delhi, 2008
G. Austin, The Indian Constitution: CornerStone of a Nation, Oxford, Oxford
7.
University Press, 1966
Mode of Evaluation: CAT, Written assignment, Quiz and FAT

Short Syllabus
BCHY102N Environmental Sciences (0-0-0-2)
Environment and Ecosystem-definition-components and types-food chain, food web, energy

flow-ecological succession; Biodiversity-definition-levels-species roles-hotspots-threats-
conservation-genetically modified crops; Sustaining Environmental Quality-environmental
hazards-conservation-solid waste management; Clean and Green Energy-renewable energy
resources-Hydrogen energy-Electric and CNG vehicles; Environmental Protection Act-
objectives-impact analysis; Sustainable Development-Population growth-effect-SDGs-
Women and child welfare; Global Climate Change-Green house effect-Kyoto-Paris- Montreal
Protocol-Carbon sequestration-role of information technology in environment.

BCHY102N Environmental Sciences L T P C

0 0 0 2
1.0
Course Objectives:
The course is aimed at students to
1. Understand and appreciate the unity of life in all its forms and their
implications of life style on the environment.
2. Identify the different causes for environmental degradation.
3. Analyze individual’s contribution to environmental pollution.
4. Evaluate the impact of pollution at the global/local level and find
solutions for remediation.
Course Outcomes
At the end of the course, the students will be able to:
1. Recognize the environmental issues in a problem-oriented, interdisciplinary
perspective.
2. Classify the key environmental issues, the science behind those problems and
potential solutions.
3. Demonstrate the significance of biodiversity and its preservation.
4. Identify various environmental hazards.
5. Design various methods for the conservation of resources.
6. Formulate action plans for sustainable alternatives that incorporate science,
humanity, and social aspects.
Module: 1 Environment and Ecosystem 5 hours
Environment: definition; Earth–life support system. Ecosystem definition, components and
types. Key environmental problems, their basic causes and sustainable solutions. Food
chain, food web and their significance, Energy flow in ecosystem; Ecological succession-
stages involved, primary and secondary succession - hydrarch, mesarch, xerarch.
Module: 2 Biodiversity 4 hours
Biodiversity-definition, levels and importance. Species: roles: types: extinct, endemic,
endangered and rare species. Hot-spots –Significance, Mega-biodiversity. Threats to
biodiversity due to natural and anthropogenic activities, Conservation methods. GM crops-
advantages and disadvantages.
Module: 3 Sustaining Environmental Quality 4 hours
Environmental hazards: definition, types, causes and solutions: Biological (Malaria,

COVID-19), Chemical (BPA, heavy metals), and Nuclear (Chernobyl); Air, water and soil
quality management and conservation; Solid waste management methods.
Module: 4 Clean and Green Energy 5 hours
Renewable energy resources: Solar energy-thermal and photovoltaic; Hydroelectric
energy. Wind energy, Ocean thermal energy; Geothermal energy; Energy from biomass;
Hydrogen energy; Solar-hydrogen revolution. Electric and CNG vehicles.
Module: 5 Environmental Protection Policies 4 hours
Environmental Protection (EPA) objectives; Air Act, water Act, Forest conservation Act
and Wild life protection Act. Environmental Impact Analysis: guidelines, core values.
Impact assessment methodologies.
Module: 6 Sustainable development 4 hours
Effect of population-urban environmental problems; Population age structure; Sustainable
human societies: tools in economics, sustainable development goals SDGs and promoting
awareness. Women and child welfare, Women empowerment.

Module: 7 Global Climate Change 4 hours

Global climate change and green-house effect. Kyoto Protocol-carbon credits, The Paris
Agreement, carbon sequestration: definition, types and methodologies. Ozone layer
depletion: causes and impacts. Mitigation of ozone layer depletion- Montreal Protocol. Role of
Information Technology in environment.
Assessment: Seminars, Quiz, Case Studies, Final Assessment Test.
Text Books
1. G. Tyler Miller and Scott E. Spoolman (2016), Environmental Science, 15th Edition,
Cengagelearning.
2. Benny Joseph, (2012), Environmental Science and Engineering, 5th Edition, Tata
McGraw Hill Education Private Limited, New Delhi, India.
Reference Book(s)
1. David M. Hassenzahl, Mary Catherine Hager, Linda. R. Berg (2011), Visualizing
Environmental Science, 4th Edition, John Wiley & Sons, USA.
2. Raj Kumar Singh, (2012), Environmental Studies, Tata McGraw Hill Education Private
Limited, New Delhi, India.
3. George Tyler Miller, Jr. and Scott Spoolman (2012), Living in the Environment –
Principles, Connections and Solutions, 17th Edition, Brooks/Cole, USA.


Short Syllabus
BHUM101N Ethics and Values (0-0-0-2)
Civic Responsibilities - Defining Ethics and Morals, Gandhian Philosophy; Personal Social
Responsibility - Leadership Qualities of the Present and Past Leaders; Crimes against
Humanity – Harassment, Violence, Terrorism; Contemporary Social Problems – Corruption,
Electoral Malpractice, White Collar Crimes, Tax Evasion, Unfair Trade Practices; Addiction
and Substance Abuse - Handling peer pressure, Prevention of Suicides; Sexual Health and
Sensitive Issues - Professional Ethics and Personal Values, Behavioural Addiction and
Technological Abuse.
BHUM101N Ethics and Values L T P C

0 0 0 2
1.0
Course Objectives:
1. To understand and appreciate the ethical issues faced by an individual in profession,
society and polity.
2. To understand the negative health impacts of certain unhealthy behavior.
3. To appreciate the need and importance of physical, emotional health and social
health.
Course Outcomes:
1. Students will be able to:
2. Follow sound morals and ethical values scrupulously to prove as good citizens.
3. Understand various social problems and learn to act ethically.
4. Understand the concept of addiction and how it will affect the physical and mental
health.
5. Identify ethical concerns in research and intellectual contexts, including academic
integrity, use and citation of sources, the objective presentation of data, and the
treatment of human subjects.
6. Identify the main typologies, characteristics, activities, actors and forms of
cybercrime.
Module:1 Being Good and Responsible

Gandhian values such as truth and non-violence – Comparative analysis on leaders of past
and present – Society’s interests versus self-interests - Personal Social Responsibility:
Helping the needy, charity and serving the society.
Module:2 Social Issues 1
Harassment – Types - Prevention of harassment, Violence and Terrorism.
Module:3 Social Issues 2
Corruption: Ethical values, causes, impact, laws, prevention – Electoral malpractices;
White collar crimes - Tax evasions – Unfair trade practices.
Module:4 Addiction and Health
Peer pressure - Alcoholism: Ethical values, causes, impact, laws, prevention – Ill effects of
smoking - Prevention of Suicides;
Sexual Health: Prevention and impact of pre-marital pregnancy and Sexually Transmitted
Diseases.
Module:5 Drug Abuse
Abuse of different types of legal and illegal drugs: Ethical values, causes, impact, laws and
prevention.
Module:6 Personal and Professional Ethics
Dishonesty - Stealing - Malpractices in Examinations – Plagiarism.
Module:7 Abuse of Technologies
Hacking and other cyber crimes, Addiction to mobile phone usage, Video games and Social
networking websites.
Text Books :
R R Gaur, R Asthana, G P Bagaria, “A Foundation Course in Human Values and
1.
Professional Ethics”, 2019, 2nd Revised Edition, Excel Books, New Delhi.
2. Hartmann, N., “Moral Values” , 2017, United Kingdom: Taylor & Francis.
Reference Books :
Rachels, James & Stuart Rachels, “The Elements of Moral Philosophy”, 9th edition,
1.
2019, New York: McGraw-Hill Education.

2. Blackburn, S. “Ethics: A Very Short Introduction”, 2001, Oxford University Press.

Dhaliwal, K.K , “Gandhian Philosophy of Ethics: A Study of Relationship between his
3.
Presupposition and Precepts”, 2016, Writers Choice, New Delhi, India.
Ministry of Social Justice and Empowerment, “Magnitude of Substance Use in India”,
4
2019, Government of India.
Ministry of Home Affairs, “Accidental Deaths and Suicides in India”, 2019,
5.
Government of India.
Ministry of Home Affairs, “A Handbook for Adolescents/ Students on Cyber Safety”,
6.
2018, Government of India.
Mode of Evaluation: Poster making, Quiz and Term End - Quiz


Ay 2022-23 Ecm Sense

Uploaded by

Copyright:

Available Formats

Ay 2022-23 Ecm Sense

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

Ay 2022-23 Ecm Sense

Uploaded by

Copyright:

Available Formats

SCHOOL OF ELECTRONICS

B. Tech Electronics and Computer

Curriculum and Syllabus

VISION STATEMENT OF VELLORE INSTITUTE OF TECHNOLOGY

Transforming life through excellence in education and research.

MISSION STATEMENT OF VELLORE INSTITUTE OF TECHNOLOGY

World class Education: Excellence in education, grounded in ethics and critical

VISION STATEMENT OF THE SCHOOL OF ELECTRONICS

To be a leader by imparting in-depth knowledge in Electronics Engineering,

MISSION STATEMENT OF THE SCHOOL OF ELECTRONICS

• Create and maintain an environment to excel in teaching, learning and

B.TECH (Electronics and Computer Engineering) Page 2

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs):

B.TECH (Electronics and Computer Engineering) Page 3

PROGRAMME OUTCOMES (POs):

PO_01: Having an ability to apply mathematics and science in engineering

B.TECH (Electronics and Computer Engineering) Page 4

PROGRAMME SPECIFIC OUTCOMES (PSOs):

On completion of B. Tech. (Electronics and Computer Engineering)

PSO2: Attain expertise in hardware software co-design for prototype development.

PSO3: Apply cutting-edge Electronics and Computer Engineering tools and

B.TECH (Electronics and Computer Engineering) Page 5

PROGRAMME CREDIT STRUCTURE:

Category-wise Credit distribution

B.TECH (Electronics and Computer Engineering) Page 6

B.TECH (Electronics and Computer Engineering) Page 7

22 BSTS201P Qualitative Skills Practice I 0 0 3 1.5

Discipline-linked Engineering Science Courses: 11 Credits

Discipline Core Courses: 50 Credits

S. Course Course Title L T P C Pre-Requisite

B.TECH (Electronics and Computer Engineering) Page 8

9. BCSE204L Design and Analysis of 3 0 0 3 NIL

Discipline Elective Courses: 15 Credits

S.No Course Course Title L T P C Pre-Requisite

B.TECH (Electronics and Computer Engineering) Page 9

4 BECE403E Embedded Systems Design 3 0 2 4 BECE204L,

B.TECH (Electronics and Computer Engineering) Page 10

25 BCSE420P Sensors, Actuators and 0 0 2 1 NIL

Open Elective Courses: 15 Credits

Project and Internship: 9 Credits

B.TECH (Electronics and Computer Engineering) Page 11

Non-Graded Credit Requirement: 11 Credits

B.TECH (Electronics and Computer Engineering) Page 12

BPHY101L Engineering Physics

Proceedings of the 62nd Academic Council (15.07.2021) 78

BPHY101L Engineering Physics L T P C

Proceedings of the 63rd Academic Council [23.09.2021] 655

Proceedings of the 63rd Academic Council [23.09.2021] 656

BPHY101P Engineering Physics Lab

Proceedings of the 62nd Academic Council (15.07.2021) 78

BPHY101P Engineering Physics Lab L T P C

Proceedings of the 63rd Academic Council [23.09.2021] 657

BCHY101L Engineering Chemistry

Proceedings of the 62nd Academic Council (15.07.2021) 78

BCHY101L Engineering Chemistry

Module:7 Industrial applications 7 hours

Proceedings of the 63rd Academic Council [23.09.2021] 652

Proceedings of the 63rd Academic Council [23.09.2021] 653

BCHY101P Engineering Chemistry Lab