B.Tech.: Delhi Skill and Entrepreneurship University

Delhi Skill and
Entrepreneurship University
B.Tech.
(Computer Science and
Engineering )
Syllabus Document
Effective from Academic Year 2022-26
1
Program Information
Introduction
Delhi Skill and Entrepreneurship University offers a four-year Bachelor’s Degree Program in Technology
(Computer Science and Engineering). The program allows students to train in a promising and job creating
sector. The students will acquire a wide range of skills such as – understand the technical and functional
environment of Computer Science related domain; understand emerging technologies; learn industry best
practices, thereby helping them develop several skills. Students will be exposed to practical knowledge along
with the classroom theoretical and practical sessions. The program intends to make a significant contribution
towards the development of skilled technical manpower and aid the progress of the nation.
Program Objectives
Delhi Skill and Entrepreneurship University’s undergraduate B. Tech (Computer Science and Engineering)
program provides the students with an in-depth understanding of key theoretical concepts and intensive practical
training to enable them to emerge as proficient engineers in Computer Science and Engineering. The program
introduces the students to a number of engineering sciences at the core curriculum level by adopting a
theoretical and experimental solution approach to solving real-world problems. During the 4-year program the
students will develop several skills, such as:
 Good problem-solving ability using appropriate programming skills and practices
 Able to manage data efficiently/Data analysis skills
 Software development skill
 Software testing skills
 Logical and analytical skill
 Exhibit effective personality
 Good communication and team building skills,
 Technical writing skill
 Adapt to the latest trends in computer technology.
Pedagogy and Teaching Methodology

Developed with support of experts from the industry and Subject Matter experts from several renowned
academic institutions, this program’s effective pedagogy, will aid in skilling young professionals. Focus on real-
world examples, activity-based learning, in campus laboratory training, and internships will lead to holistic
development of students pursuing this course. This will give them a much-needed practical exposure that is
currently lacking across most institutions. Classroom training is interspersed with industry visits, guest lectures
and project assignments.
2
SEMESTER I
Credit Scheme
3
Credit scheme
Semester I
Hours/week
S. No. Subject Code Course Titles Total Credits
L T P Total
1. BT-HS101 Professional Communication Skills 3 0 0 3 3
2. BT-BS101 Applied Mathematics –I 3 1 0 4 4
3. BT-BS102 Engineering Chemistry 2 0 2 4 3
4. BT-BS103 Engineering Physics 2 0 2 4 3
5. BT-ES101 Problem Solving Using Python 3 0 2 5 4
6. BT-ES102 Engineering Mechanics 2 1 2 5 4
7. BT-ES103 Basics of Electrical Technology 3 0 2 5 4

Total 18 2 10 30 25
4
Pedagogy & Teaching Methodology
Since the focus of the program is to equip learners with functional use of language and the use of language
in specific situations, the methods need to be interactive and communicative so that learners get
opportunities to use the language and gradually acquire it.
Time spent on developing professional communicative competencies in Semester 1:

Competencies Time spent
Listening 30%
Speaking 30%
Reading 20%
Writing 20%
Objectives:
Listening skill:
Students will:
 listen actively and ask clarifying questions/respond.
 practise listening skills by taking notes from presentations, lectures, and oral reports.
 listen to narratives, articles, news reports, etc. and can paraphrase.
Speaking skill
Students will:
 use spoken language to express feelings, give explanations and describe.
 have meaningful conversations in groups/pairs.
 participate in group discussions, debates, and presentations.
 produce oral reports and narratives.
Reading skill
Students will:
 participate in small group literature discussions, connect own experiences with facts,
characters and situations in stories.
 learn about key reading sub-skills, such as a) skimming, b) scanning, c) identifying the
main ideas of texts or paragraphs, and d) guessing vocabulary from context. 
 build vocabulary by reading.
Writing skill
Students will:
 improve basic writing skills, such as proper punctuation, accurate spelling, and use of the 6
Traits of Writing (voice, word choice, conventions, fluency, ideas and organization).
5
 write book reports/reviews on texts read.
 practise writing formal and informal letters.
 learn to write a memo.
 Learn to write CVs in guided formats.
1.1 Learning Outcomes:
Students are able to:
1. listen actively with comprehension and respond.
2. follow specific instructions.
3. take notes from presentations, lectures, and reports.
4. listen to narratives and reports, and paraphrase.
5. express feelings, describe, and give explanations.
6. participate productively in peer activities.
7. produce oral reports and narratives.
8. participate in literary/ general discussions.
9. Participate in group discussions.
10. engage meaningfully with texts and people.
11. use the reading strategies of skimming, scanning, identifying the main ideas of texts, and
guessing vocabulary from context.
12. build on existing vocabulary repertoire.
13. produce improved written output in terms of punctuation, spelling, and use of the 6 Traits
of Writing (voice, word choice, conventions, fluency, ideas and organisation).
14. write book reports/reviews on texts read.
15. write formal letters.
16. write a memo.
17. write minutes of a meeting.

6
18. write an email.
19. evelop interview skills.
20. portray more confidence and less hesitation in communicating in English.
1.2 Syllabus:
Theory of English Communication

 Introduction to Communication
 Importance of communication
 Process of Communication
 Barriers of communication and ways to overcome them
2. Listening skills
 Types of listening
 Effective listening
 Listening to talks, presentations, reports, narrative, articles, and lectures.
3. Speaking skills
 Oral presentation
 Group discussions
 Interviews
 Debates
 Talking about self, expressing feelings and using descriptive language.
4. Reading skills
 General and local comprehension
 Comprehension of various types of texts - literary, discursive and factual.
 Skimming and scanning
 Understanding contextual vocabulary- tips and strategies
 Extensive reading
 Critical reading
5. Writing skills
 Book reports
 Book reviews
 Memos
 Parts and styles of formal letters- letter of enquiry, letter of complaint, cover letters
 Minutes of a meeting
 CV
 Process writing
7
1.3 Suggested
Reading:
Short stories/plays
1. After Twenty Years- O’Henry
2. Big Brother by Munshi Premchand
3. The Necklace by Guy de Maupassant
4. The Happy Prince by Oscar Wilde
5. The Wolf by Guy De Maupassant,

6. The Gift of the Magi by O’Henry
7. The Postmaster by Rabindranath Tagore
8. Three Men in a Boat by Jerome K Jerome
9. The Mystery of Room 342 by Arthur M Jensen
10. Philomel Cottage by Agatha Christie
11. Rajam and Mani from Swami and Friends By RK Narayan
12. Simba from Gong Solo by Roald Dahl
13. The Golden Frame by RK Lakshman
14. The Eyes are not Here by Ruskin Bond
15. A Devoted Son by Anita Desai
16. Namu, the Dhobi by PL Deshpande
17. An Astrologer’s Day by RK Lakshman
18. The Last Leaf by O Henry
19. The Red-Headed League by Arthur Conan Doyle
20. Three Questions by Leo Tolstoy
8
BT-BS101 APPLIED MATHEMATICS-I
Teaching Scheme
L T P Credit
3 1 0 4
Pre-requisites:
Knowledge on basic mathematics for B.Tech.
Course Objective:
The objective of the paper is to facilitate the student with the basics of Applied Mathematics that are required
for an engineering student.
Course Outcomes:
At the end of this course, the student should be able to:
CO1: Apply differential calculus to notions of Curvature, Radius of Curvature, Asymptotes and Curve
Tracing.
CO2: Apply integral calculus to notions of improper integral. Apart from various applications, they will
have a basic understanding of Beta and Gamma functions.
CO3: Use the effective mathematical tool to find the solution of first order first degree linear Ordinary
Differential Equation (ODE)
CO4: Solve system of linear equations (homogeneous and non-homogeneous)
CO5: Learn the essential tools of matrices including eigen values, eigen vector and Cayley-Hamilton
Theorem.
Syllabus:
Unit 1:
Successive differentiation: Leibnitz’s theorem for nth derivative (Without Proof),Definition of Sequence,
convergence of sequence, Infinite Series: convergence and divergence of series, necessary condition of
convergence, Tests for convergence of series: Geometric series and p-series Test, Comparison test and
Limiting form of comparison test, D’Alembert Ratio Test, Integral test, Raabe’s, Logarithmic and Cauchy’s
root test, (all tests without proofs), Alternating series, Absolute convergence, Conditional convergence.
Taylor’s and Maclaurin’s expansion (without proof and without remainder terms) of function
(𝑒 𝑥 ,log(1 + 𝑥),sin 𝑥 , cos 𝑥, 𝑡𝑎𝑛𝑥)
[No. Of Hours: 11]
Unit 2:
Ordinary differential equations: Order and degree of a differential equation, Formation of differential
equation, First Order First degree linear differential equations (Leibnitz’s and Bernoulli’s equation), Exact
differential equations, Equation reducible to exact form (Integrating Factor).
Asymptotes (in cartesian), Curvature and Radius of Curvature in (cartesian, parametric and polar curves).
[No. Of Hours: 11]
Unit 3:
Basic formula of Hyperbolic function, Reduction formula, Basic definition of Improper integral, Beta and
Gamma Functions, curve tracing (cartesian, parametric and polar curves), Applications of definite integral:
area, length, surface area and volume of solids of revolution (in cartesian, parametric and polar co-
ordinates).
[No. Of Hours: 11]
9
Unit 4:
Matrices: Elementary row transformation, Echelon form, Row reduced echelon form of a matrix, Inverse of
a matrix by Gauss-Jordan Method, Rank of matrix by echelon and normal (Canonical) form, consistency and
inconsistency of system of simultaneous equations, Solution of homogeneous and non-homogeneous
equations, Characteristic equation, Eigenvalue and Eigenvector, Cayley-Hamilton theorem (without proof).
[No. Of Hours: 12]
Required Readings:
1. Zill, D.G. and Wright, W. S.(2016).Advanced Engineering Mathematics, 6th Edition. The Jones and Bartlett
Learning Publishers.
2. Jain, R. K. and Iyengar, S. R. K.(2012).Advanced Engineering Mathematics. 4th Edition, Narosa
Publishing House Pvt. Ltd.
3. Grewal, B. S. (2017).Higher Engineering Mathematics, 44th Edition. Khanna Publishers.
4. George B. Thomas Jr., Ross L. Finney.(2010).Calculus and Analytic Geometry, 9th Edition. Pearson
Education India.
5. Greenberg M., (1998).Advanced Engineering Mathematics, 2nd Edition. Pearson Education.
6. Kreyszig E. (2010). Advanced Engineering Mathematics, 10th Edition. John Wiley & Sons.
10
BT-BS102 ENGINEERING CHEMISTRY
Teaching Scheme
L T P Credit
2 0 2 3
Pre-requisites:
Knowledge of Basic Chemistry
Course Objective:
The course is designed to learn about the new advancements in Engineering Chemistry for industrial
application. The learner will acquire the knowledge of existing and new development in the field of
electrochemistry, storage devices and drug synthesis. Engineering students will also understand the concept
of water chemistry and gain insight into numerous advanced materials used in engineering practise.
Course Outcomes:
At the end of this course, the student should be able to
CO1: Acquire knowledge of electrochemical cells and various energy storage devices and their
applications in present scenario.
CO2: Understand various chemical reactions used for synthesis of drug and polymer molecules.
SEMEER I
CO3:
CO4:
CO5:
Analyze spectral techniques like UV-VIS, NMR and IR for drug characterization.
Distinguish between various parameters of water and their application in industries
Apply the knowledge of advanced engineering materials in industries.
Syllabus:
Unit 1:
Electrochemistry and Storage Devices
Electrochemical cell, Types of electrochemical cells, Electrode potential, Measurement of electrode
potentials (Numerical), Electrochemical series, Derivation of Nernst equation for single electrode potentials,
Electromotive force (EMF) of a cell (Numerical), Types of electrode, reference electrodes, pH measurement
using glass electrode, concentration cells, Energy Storage Devices:- Commercial Cell (Battery),
Classification of Batteries, working and application Zn-MnO2 Dry cell, Lead – Acid Battery, Rechargeable
lithium batteries and solar cell.
[No. Of Hours: 8]
Unit 2:
Synthesis of drug molecules and their characterisation
Introduction to reactions involving substitution, addition, elimination, oxidation, reduction, and drug
chemistry. Synthesis of a commonly used drug molecules, Elementary ideas and simple applications of
spectral techniques for drug Characterisation such as UV-Visible, FTIR and H-NMR Spectral Techniques.
[No. Of Hours: 7]
Unit 3:
Water Chemistry
Sources and Impurities of water, Water consumption in industrial sectors, Hardness and its Determination,
Boiler Troubles like corrosion etc. and their removal, Softening of water – Lime-Soda Process (Numerical),
Zeolite and Ion Exchange method, Industrial Waste Water Treatment, Sea Water desalination technology,
Reverse Osmosis Method, Electro dialysis.
[No. Of Hours: 8]
11
Unit 4:
Engineering Advance Materials
Classification of engineering materials, properties and applications, Metal matrix composites, polymer matrix
composites, ceramic matrix composites, Fibre reinforced plastic (FRP), Metallic Glass, smart materials and
bio materials.
[No. Of Hours: 7]
Practical/Laboratory Content:
1. Determination of conductivity of given solution or water sample
2. To determine the concentration of unknown acid using a base potentiometrically
3. Determine the pH value given water sample or effluents from various industries.
4. Synthesis of Aspirin drug.
5. Determine the lambda maximum of given compound by UV-Vis Spectrophotometer.
6. Determination of temporary and permanent hardness of given water sample.
7. Synthesis of Nylon from interfacial polymerization method
8. Determination of water absorption of given polymer sample.
9. Determination of Molecular weight of given polymer sample by viscometry method
Required Readings:
1. Morrison, R. T., & Boyd, R. N. (1983). Organic chemistry. Boston: Allyn and Bacon.
2. Engineering Chemistry, Wiley India.
3. Gordon M. Barrow (2018) .Physical Chemistry. Mc-Graw Hill.
4. Lee, J.D. Concise Inorganic Chemistry. Wiley India
5. Dara, S.,S. A Textbook of Engineering Chemistry.S. Chand &Company Ltd. New Delhi.
6. Patwardhan ,A.D. Industrial Waste Water Treatment . Prentice-Hall of India Pvt. Ltd.
7. Stephenson, Tom &Stutz Richard .Principles of Water and Wastewater Treatment Processes. IWA
Publishing Volume 8, DOI : https://doi.org/10.2166/9781780401713
12
BT-BS103 ENGINEERING PHYSICS
Teaching Scheme
L T P Credit
2 0 2 3
Pre-requisites:
Basic knowledge of Intermediate class Physics

Course Objective:
The main objective of this course is to develop the student’s skills in scientific inquiry, problem
solving and laboratory techniques. Students will be able to demonstrate competency and
understanding of the fundamental concepts and new advancements in Quantum Mechanics,
Electromagnetic theory, Laser & Fiber-Optics. Students will be able to design the experiments
based on theoretical knowledge gained during the course.
Course Outcomes:
At the end of this course, the students should be able to:
CO1: Demonstrate the application of Semiconductor Physics in designing various electronic
circuits.
CO2: Learn the working principle of Laser and its applications in industry, medical field and
other significant areas. Explain the advantage of using Optical Fiber in Communication.
CO3: Know the basics of Electromagnetic theory and its applications.
CO4: Understand the fundamental concept of Quantum behaviour of matter in its microstate.
CO5: Design the experiments based on theory and concepts of engineering physics.
Syllabus:
Unit 1:
Quantum Mechanics
Failure of classical physics, Origin of quantum mechanics,Compton effect, Wave-particle dualit y,
Davisson and Germer experiment, de-Broglie's hypothesis, Postulates of quantum mechanics,
Wave function, Phase velocity and Group velocity, Probability density, Eigen value and Eigen
function, Operators, Expectation value, Heisenberg's Uncertainty principle, Schrodinger's time
independent wave equation, Particle in a box, Tunnel effect (qualitative discussion only).
[No. Of Hours: 8]
Unit 2:
Electromagnetic Theory
Gradient, Divergence, Curl, Electric Field in matter, Polarization charges, Electrical susceptibility
and dielectric constant, Gauss Law in dielectrics, Continuity equation, displacement current,
Faraday’s law, Ampere’s law, Inconsistency in Ampere’s law, Maxwell’s equations and their
physical significance, Poynting vector and Poynting theorem, Laplace and Poisson equations,
Electromagnetic wave propagation in free space, dielectric and conducting media, Skin depth.
[No. Of Hours: 8]
Unit 3:
Laser
Interaction of radiation with matter, Stimulated absorption, Spontaneous and Stimulated
emissions, Einstein’s coefficients, Coherence, Principle and working of Laser, Meta-stable states,
Population inversion, Pumping, Characteristics of Laser light, Applications of Laser, Types of
Lasers: He-Ne Laser and Semiconductor Laser.
[No. Of Hours: 8]
13
Unit 4:
Fiber Optics
Fiber construction and dimensions, Light propagation in fibers, Acceptance angle, Numerical
aperture, Step and Graded index fibers, Single-mode and Multi-mode fibers, Losses and
Dispersion, Optical Fiber Communication, Applications of Optical Fiber.
[No. Of Hours: 6]
1. To determine the V-I characteristics of a p-n junction diode and Zener diode.
2. To study the V-I Characteristics of solar cell.
3. Plot V-I and P-I characteristics of light emitting diode.
4. To determine the work function of a given material.
5. To study the characteristics of Laser source.
6. To determine wavelength of Laser using plane diffraction grating.
7. To determine the Numerical Aperture and bending losses of Optical fiber.
8. To determine the time constant of R-C circuit.
9. To determine the Quality factor of LCR Circuit.
10. To measure the frequency and amplitude of a sine-wave voltage obtained from signal generator
using CRO.
11. To obtain Lissajous pattern on the CRO screen by feeding two sine wave signals from two
signal generators.
12. Design an experimental Project based on syllabus.
Required Readings:
Text Books
1. H. K. Malik and A. K. Singh, 2nd Edition, “Engineering Physics”, McGraw Hill, 2017.
2. Ajoy K. Ghatak, “Optics”, 6th Edition, McGraw Hill, 2017.
3. N. Subramanyam, Brij Lal and M. N Avdhanulu, “A Text Book of Optics”, S. Chand
Publication, 2012.
Reference Books
1. D.J. Griffith, “Introduction to Electrodynamics”, 4th Edition, Pearson Education, 2015.

2. Arthur Beiser, Shobhit Mahajan and S. Choudhury, “Concepts of Modern Physics”, 7th
Edition, McGraw Hill, 2015.
14
BT-ES101 PROBLEM SOLVING USING PYTHON
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Fundamentals of computer programming, Fundamentals of Object Oriented Approach.
Course Objective:
Python is next generation multi-purpose programming language, that allows different users to create
applications of various domains. Students will be able to learn primary fundamentals of python programming
and potential of python to achieve modern computing requirements.
Course Outcomes:
At the end of this course, students should be able to:
CO1: Understand fundamental Python syntax and semantics and be fluent in the use of Python control
flow statements.
CO2: Apply functions, modules and string handling in Python to solve problems.
CO3: Express proficiency in the handling of strings and functions using string manipulation, string slicing
and formatting functions.
CO4: Apply the concept of object-oriented approach for solving real world problems.
CO5: Develop Console application, Database application, and Machine Learning application in Python.
Syllabus:
Unit 1:
Introduction:
The Programming Cycle for Python, Python IDE, Interacting with Python Programs, Working with Jupyter
notebook, Elements of Python, Type Conversion.
Basics: Expressions, Assignment Statement, Arithmetic Operators, Operator Precedence, Boolean
Expression.
[No. Of Hours: 8]
Unit 2:
Conditionals:
Conditional statement in Python (if-else statement, its working and execution), Nested-if statement and Elif
statement in Python, Expression Evaluation & Float Representation.
Loops: Purpose and working of loops , While loop including its working, For Loop , Nested Loops , Break
and Continue.
Function: Parts of A Function , Execution of A Function , Keyword and Default Arguments ,Scope Rules.
Iterators & Recursion: Recursive Fibonacci , Tower Of Hanoi
Strings : Length of the string and perform Concatenation and Repeat operations in it. Indexing and Slicing
of Strings.
[No. Of Hours: 12]
Unit 3:
Python Data Structure:
15
Tuples, Unpacking Sequences, Lists, Mutable Sequences, List Comprehension, Sets, Dictionaries
Classes and Objects: Introduction, classes and objects, class method and self argument, init() method, class
and object variables, del() method, other special methods, public and private data members, private
methods, calling a class method from another class method, built-in class attributes, garbage collection,
class and static methods
Inheritance: Introduction, inheriting classes in python, types of inheritance,
composition/containership/complex objects, abstract classes and interfaces, Meta class.
[No. Of Hours: 11]
Unit 4:
File I/O:
File input and output operations in Python Programming
Modules : Introduction , Importing Modules , Abstract Data Types : Abstract data types and ADT interface in
Python Programming.
Error and Exception Handling: Introduction to errors and exceptions, handling exceptions, multiple except
blocks, multiple exceptions in a single block, except block without exception, the else clause, raising
exceptions, built-in and user-defined exceptions, the finally block.
[No. Of Hours: 9]
Development of mini project on the basis of the knowledge gained
1. Learning about installation of python and various IDE.
2. Basics
a) Running instructions in Interactive interpreter and a Python Script
b) Write a program to purposefully raise Indentation Error and Correct it
3. Operations
a) Write a program to compute distance between two points taking input from the user.
b) Write a program add.py that takes 2 numbers as command line arguments and prints its sum.
4. Control Flow
a) Write a Program for checking whether the given number is a even number or not.
b) Using a for loop, write a program that prints out the decimal equivalents of 1/2, 1/3, 1/4, . . . ,
1/10.
c) Write a program using a for loop that loops over a sequence.
d) Write a program using a while loop that asks the user for a number, and prints a countdown
from that number to zero.
e) Find the sum of all the primes below two million.
f) Each new term in the Fibonacci sequence is generated by adding the previous two terms. By
starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89,…
g) By considering the terms in the Fibonacci sequence whose values do not exceed four million,
find the sum of the even-valued terms.
5. Dictionary
a) Write a program to count the numbers of characters in the string and store them in a dictionary
data structure.
b) Write a program to use split and join methods in the string and trace a birthday with a dictionary
data structure.
c) Write a program combine lists and then combine these lists into a dictionary.
6. Files
a) Write a program to count frequency of characters in a given file. Can you use character
frequency to tell whether the given file is a Python program file, C program file or a text file?
16
b) Write a program to print each line of a file in reverse order.
c) Write a program to compute the number of characters, words and lines in a file.
7. Functions
a) Write a function ball collide that takes two balls as parameters and computes if they are colliding.
Your function should return a Boolean representing whether or not the balls are colliding. Hint:
Represent a ball on a plane as a tuple of (x, y, r), r being the radius If (distance between two
balls centers) <= (sum of their radii) then (they are colliding).
b) Find mean, median, mode for the given set of numbers in a list.
8. Functions -Continued
a) Write a function nearly equal to test whether two strings are nearly equal. Two strings a and b
are nearly equal when a can be generated by a single mutation on b.
b) Write a function dups to find all duplicates in the list.
c) Write a function unique to find all the unique elements of a list.
9. Functions - Problem Solving

a) Write a function cumulative product to compute cumulative product of a list of numbers.
b) Write a function reverse to reverse a list. Without using the reverse function.
c) Write function to compute gcd, lcm of two numbers. Each function shouldn’t exceed one line.
10. Multi-D Lists

a) Write a program that defines a matrix and prints.
b) Write a program to perform addition of two square matrices.
c) Write a program to perform multiplication of two square matrices.
11. Modules
a) Install packages requests, flask and explore them. using (pip).
b) Write a script that imports requests and fetch content from the page. Eg. (Wiki).
c) Write a simple script that serves a simple HTTP Response and a simple HTML Page.
12. OOP
a) Implement function overloading with different function signatures.
b) Implement concept of class, instances and inheritance.
13. Testing
c) Write a test-case to check the function even_numbers which return True on passing a list of all
even numbers.
d) Write a test-case to check the function reverse string which returns the reversed string.
14. A mini-course project
Note: The program list is only for reference purpose; the concerned subject professor may modify it as per
the need.
Required Readings:
Reference Books:
1. Allen B. Downey, (2016). Think Python: How to Think Like a Computer Scientist, 2nd edition. Updated for
Python 3, Shroff/O‘Reilly Publishers.
2. Guido van Rossum and Fred L. Drake Jr (2011).An Introduction to Python. Network Theory Ltd.
3.John V Guttag (2013). Introduction to Computation and Programming Using Python, Revised and
expanded Edition. MIT Press.
17
4.Robert Sedgewick, Kevin Wayne, Robert Dondero (2016).Introduction to Programming in Python: An Inter-
disciplinary Approach. Pearson India Education Services Pvt. Ltd.
5.Timothy A. Budd (2015). Exploring Python. Mc-Graw Hill Education (India) Private Ltd.
6.Kenneth A. Lambert (2012). Fundamentals of Python: First Programs. CENGAGE Learning.
7.Charles Dierbach (2013). Introduction to Computer Science using Python: A Computational Problem
Solving Focus. Wiley India Edition.
8.Paul Gries, Jennifer Campbell and Jason Montojo (2013).Practical Programming: An Introduction to
Computer Science using Python , Second edition. Pragmatic Programmers, LLC.
18
BT-ES102 ENGINEERING MECHANICS
Teaching Scheme
L T P Credit
2 1 2 4
Pre-requisites:
Mathematics and Physics
Course Objective:
This course helps the students develop the ability to understand and analyse the effect of force and motion
to design structures and machines for engineering applications.
Course Outcomes:

CO 1: Apply appropriate equilibrium equations to the free body diagram for finding the effect of forces.
CO 2: Investigate problems related to perfect plane trusses.
CO 3: Select the mass moment of inertia, area moment of inertia, and polar moment of inertia by an
appropriate method.
CO 4: Apply the concepts of conservation of momentum and work-energy principle to real-life problems.
CO 5: Verify principles/laws of statics and dynamics using an experimental set-up.
Syllabus:
UNIT 1:
Force Systems:
Introduction, Force as a Vector, Composition of forces, Parallelogram Law, Resolution, Principle of
Transmissibility of forces; Moment of a force, Moment for coplanar force system, Varignon’s theorem;
Couple, Vector representation, Resolution of a force into a force and a couple; Coplanar Concurrent Force
system and Coplanar Non Concurrent force systems; Equilibrium of coplanar force system, Free body
diagrams, Determination of reactions, Equilibrium of a body under three forces, Lami’s theorem.
Friction: Wet and Dry friction, Angle of friction, Angle of Repose, Cone of friction, Laws of friction and their
applications to ladder friction, belt-pulley, wedges. Lifting Machines (Screw Jack, Worm and Worm Wheel)
[No. Of Hours: 11]
UNIT 2:
Analysis of Plane Trusses:
Engineering structures, Perfect Truss, Determination of axial forces in the members, Method of Joints,
Method of Section.
Beams: Different support & load conditions, Shear Force and Bending Moment Diagrams for point load,
uniformly distributed load, uniformly varying load.
[No. Of Hours: 11]
UNIT 3:
Centroid of Composite figures,
Area Moment of Inertia, Polar Moment of Inertia, Parallel axis theorem, Perpendicular axis theorem, Principle
Moment of Inertia, Mass Moment of Inertia of a circular ring, disc, cylinder, sphere and cone about their axis
of symmetry.
19
[No. Of Hours: 11]
UNIT 4:
Kinematics of Rigid Body:
Plain motion of a rigid body, Velocity and acceleration under translation and rotational motion, Absolute
motion, Relative motion, Rotation of rigid bodies, Instantaneous centre of zero velocity.
Kinetics of Rigid Body: Force, Mass and Acceleration, D’Alembert’s Principles and Dynamic Equilibrium.
Work, Power and Energy, Linear Impulse and Momentum, Conservation of linear momentum.
[No. Of Hours: 11]
1. To verify the law of Force Polygon.

2. To verify the law of Moments using Parallel Force apparatus. (simply supported type)
3. To determine the coefficient of friction between wood and various surface (like Leather, Wood, and
Aluminium) on an inclined plane.
4. To find the forces in the members of Jib Crane.
5. To determine the mechanical advantage, Velocity ratio and efficiency of a screw jack.
6. To determine the mechanical advantage, Velocity ratio and Mechanical efficiency of the Wheel and
Axle.
7. To verify forces transmitted by members of a given truss.
8. To verify the law of moments using the Bell crank lever.
9. To find CG and Moment of Inertia of an irregular body using the Computation method.
10. To determine the MA, VR, of the worm wheel.
Required Readings:
Textbooks:
TB 1: Shames, I. H., Rao G. K. M. (2015). Engineering Mechanics Statics and Dynamics. India: Pearson
Education.
TB 2: Hibbeler, R. (2015). Engineering Mechanics: Statics & Dynamics, Student Value Edition. United
States: Pearson Education.
TB 3: Siddiquee, A. N., Khan, Z. A., Goel, P. (2018). Engineering Mechanics: Problems and
Solutions. United Kingdom: Cambridge University Press.
Reference Books:
RB 1: Bolton, J. N., Kraige, L. G. (2020). Meriam's Engineering Mechanics: Dynamics. United States: Wiley.
RB 2: Bolton, J. N., Kraige, L. G. (2020). Meriam’s Engineering Mechanics: Statics. United States: Wiley.
RB 3: Bhavikatti, S. S. (2020). Engineering Mechanics: Vector and Classical Approach. India: New Age
International.
RB 4: Pati, S., Young, D. H., Rao, J. V., Timoshenko, S. (2017). Engineering Mechanics: In SI
Units. India: McGraw Hill Education (India).
RB 5: Mazurek, D. F., Self, B. P., Beer, F. P., Cornwell, P. J., Johnston, E. R. (2018). Vector Mechanics for
Engineers: Statics and dynamics. United Kingdom: McGraw-Hill Education.
20
BT-ES103: BASICS OF ELECTRICAL TECHNOLOGY
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Nil
Course Objective:
This course provides comprehensive idea about AC and DC circuit analysis, working and operating principles
of electro-magneto-mechanical systems.
Course Outcomes:
CO 1: Recall basic concepts of Electrical Engineering and Illustrate basics of AC circuits
CO 2: Apply basic circuital laws and simplify the network using reduction techniques and
theorems.
CO 3: Understand sinusoidal response of RLC series and parallel circuits
CO 4: Explain operative principle of transformer with background of magnetic circuits
CO 5: Summarize the basic concepts and principles of AC and DC machines
Syllabus:
UNIT I
Introduction to Basic concepts, Laws and Theorems
Significance of circuits in skill and engineering, Concept of field, charge, current and voltage, power, energy
and their interrelationship; Series and parallel combination of circuit elements; V–I relationship of Dependent
and Independent Voltage and Current Source (Ideal and Practical); Source Transformation; Star (Wye) –
Delta Transformation, Power and Energy in Electrical Elements; Elementary calculations for energy
consumption;
DC Network Analysis methods: KVL and KCL, Mesh and Nodal analysis, Thevenin’s and Norton’s
theorem, Superposition and Maximum power transfer theorem; Modelling of circuits.
[No. of Hours: 12]
UNIT II
Single phase AC circuits
AC fundamentals: ac and effective values of Sinusoids, Phasor Analysis, the concept of impedance triangle,
admittance triangle and power triangle; Complex Power.
Q factor, BW, Selectivity and their relationship in Series resonance and parallel resonating circuits, Half
power points.
[No. of Hours: 11]
UNIT III
Magnetic Circuits and Transformers
Power ports, Faradays law of EM Induction, Amperes circuital law, B–H curve, concept of reluctance, flux
and mmf, EMF equation, losses in transformers, Volt-sec balance, Power Handling Capacity, Equivalent
21
circuit, phasor diagrams, regulation and efficiency of Ideal and practical transformer, Application of
Transformers; Brief introduction to Auto transformer, Distribution transformer and Power Transformer
[No. of Hours: 12]
UNIT IV
DC and AC Machines
Introduction to DC machines, DC Generators, DC Motors, Three phase system, induction motors and
synchronous machines. Latest technology 1* and latest technology 2*
*In addition to aforementioned topics, two latest electrical technology of machines may be included by course
instructor in Unit IV as latest technology 1 and latest technology 2
[No. of Hours: 13]
Practical/Laboratory content:
1. To study different types of electrical symbols.

2. To study and identify differentiating parameters of quick charging, fast charging and superfast charging
technology.
3. To study performance comparison of fluorescent Tube & CFL Lamp and LED Bulb OR
To study performance comparison of mobile phone battery and LMV (Light Motor Vehicle) battery.
4. To Verify any two network theorems: Thevenin’s theorem, Norton’s Theorem, Reciprocity Theorem,
Superposition Theorem, maximum power transfer theorem.
5. To calculate power and power factor for
i. Series or parallel RL Circuit
ii. Series or parallel RC Circuit
iii. Series or parallel RLC circuit
6. To analyze the time and frequency responses of common RLC circuits as a function of their physical
parameters in MATLAB
7. To determine Regulation and Efficiency of a single-phase transformer by
i) open circuit (o.c.) test
ii) short circuit (s.c.) test and
iii) direct loading test
8. To obtain OCC and load characteristics of a d.c. shunt generator
9. To obtain speed-torque characteristics of a dc shunt motor
10. To perform Speed Control of DC Motor by field resistance control
11. To perform Speed Control of DC Motor by using Ward-Leonard Method of speed control
12. To perform load test on three phase induction motor
13. To perform speed control of slip ring Induction Motor
14. To Measure the Power and Power Factor by Three Voltmeter & Three Ammeter method OR
To study the balanced three phase system for star & delta connected load
15. To study and implement connection of lamp by
i. Single Switch Method.
ii. Two-way Switch Method
Required Readings
REFERENCES:
Text Books:
TB1. Fitzgerald, A. E., Higginbotham, D. E., & Grabel, A. (1967). Basic Electrical Engineering; Circuits,
Electronics, Machines, Control. McGraw-Hill Education.
TB2. Chakrabarti A., Chanda, C. K., & Nath, S. (2012). Basic Electrical Engineering, TMH India
Reference Books:
22
RB1. Hughes, E. (2016). Electrical & Electronic Technology. Pearson
RB2. Van Valkenburg M. E. (1986). Network Analysis. Prentice Hall
RB3. Kothari, D. P. & Nagarath, I. J. (2019) Basic Electrical Engineering, McGraw Hill Education (India)
Private Limited
RB4. F. F. Kuo (2009). Network Analysis & Synthesis. Wiley India edition
RB5. Raymond A. De Carlo & Pen-Min Lin (2001). Linear Circuit Analysis: Time, Domain, Phasor and
Laplace Transform Approaches. Oxford University Press
RB6. Alexander C. K. & Mathew N. O. Sadiku (2019). Fundamentals of Electric Circuits, McGraw-Hill
RB7. V. Del Toro.(1989).Electrical Engineering Fundamental. Prentice-Hall.
23
SEMESTER II
24
Credit scheme
Semester II
Hours/week
S.No. Subject Code Course Titles Total Credits
L T P Total
1. BT-BS201 Applied Mathematics-II 3 1 0 4 4
2. BT-BS202 Applied Physics 2 0 2 4 3
3. BT-BS203 Environmental Studies 2 0 2 4 3
4. BT-ES201 Problem Solving using C 3 0 2 5 4
5. BT-ES202 Basics of Electronics Engineering 2 0 2 4 3
6. BT-ES203 Engineering Graphics & CAD 1 0 3 4 2.5
7. BT-ES204 Workshop Practice 1 0 3 4 2.5
8. BT-AU201 Constitution of India 1 0 0 1 0
Total 15 1 14 30 22
25
BT-BS 201 APPLIED MATHEMATICS-II
Teaching Scheme
L T P Credit
3 1 0 4
Pre-requisites:
Knowledge on basic mathematics for B.Tech. students.
Course Objectives:
The objective of the paper is to facilitate the student with the basics of Applied Mathematics that are required
for an engineering student.
Course Outcomes:
CO1: Compute the partial and total derivatives and extreme values of multivariable functions.
CO2: Learn the effective mathematical tools for the solution of Linear Ordinary Differential equations of
higher order with constant coefficients and Partial Differential equations of first order.
CO3: Evaluate multiple integrals of functions of several variables.
CO4: Understand the applications of Laplace Transform and solve ODE using Laplace Transform.
CO5: Recognize the statements of Stoke’s Theorem and the Divergence Theorem and understand how
they are generalizations of the Fundamental Theorem of Calculus.
Syllabus:
Unit 1:
Partial derivatives of first and second order. Euler’s theorem for homogeneous functions (without proof),
Derivatives of Implicit functions, total derivatives, Jacobian, Change of variables, Taylor’s Theorem for
function of two variables (without proof), Extreme values of function of several variables (maxima, minima,
saddle points).
[No. Of Hours: 10]
Unit 2:
Linear Differential Equation of higher order with constant coefficients, Method of variation of Parameters,
Homogeneous linear differential equation, Partial differential equations: Formation, solution of first order
equations, Lagrange’s equations, Charpit’s method.
Multiple Integrals-Double integral, change of order of integration, triple integrals, Application of Double and
Triple Integrals, change of variables using Jacobians to calculate multiple integrals in two different
coordinates
[No. Of Hours: 12]
Unit 3:
Definition of Laplace transform (LT), Existence of LT, LT of standard functions. First shifting theorem,
properties of LT, inverse LT, convolution and convolution theorem. To solve linear differential equations with
constant coefficient using LT. Heaviside Unit step function, second shifting theorem, impulse
function,periodic function and their LTs.
[No. Of Hours: 11]
Unit 4:
Scalar and Vector point functions, Gradient, Divergence, Curl with their geometrical and physical
interpretations, Directional derivatives and the vector identities for them.
26
Line integrals, their application to work done, Green’s theorem (without proof), Surface integrals and Volume
integrals, Stoke’s theorem and Gauss divergence theorem (both without proof).
[No. Of Hours: 12]
Required Readings:
Textbooks:
TB 1: H.K.Dass(2014), Higher Engineering Mathematics,S.Chand publication.

TB 2: Grewal, B. S. (2017).Higher Engineering Mathematics, 44th Edition. Khanna Publishers.
TB 3: Jain, R. K. and Iyengar, S. R. K.(2012).Advanced Engineering Mathematics. 4th Edition, Narosa
Publishing House Pvt. Ltd.
TB 4: R.D.Sharma(2018),Engineering Mathematics, Dhanpat Rai Publication
Reference Books:
RB 1: George B. Thomas Jr., Ross L. Finney.(2010).Calculus and Analytic Geometry, 9th Edition. Pearson
Education India.
RB 2: Kreyszig E. (2010). Advanced Engineering Mathematics, 10th Edition. John Wiley & Sons.
RB3: P.Sivaramakrishna Das,C.Vijayakumari(2017).Engineering Mathematics, first edition,
PearsonEducation India.
RB 4: Zill, D.G. and Wright, W. S.(2016). Advanced Engineering Mathematics, 6th Edition. The Jones and
Bartlett Learning Publishers.
27
BT-BS 202 APPLIED PHYSICS
Teaching Scheme
L T P Credit
2 0 2 3
Pre-requisites:
None
Objectives:
This course covers wide-ranging topics of Physics such as Material Physics, Spectroscopy, Sensors, and
Modern devices. The objective of this paper is to facilitate the students with the fundamental concepts and
their technological applications.
Course Outcomes:
At the end of this course, a learner should be able to:
CO1: Apply their learned knowledge to develop Nanomaterial’s.

CO2: Locate different type of sensors used in real life applications and paraphrase their importance.
CO3: Create analytical design and development solutions for sensors.
CO4: Compare and contrast solar energy to battery power.
CO5: Identify and describe different characterization techniques.
Syllabus:
Unit 1:
Material Physics
Overview of Materials, Crystalline and Amorphous material, Glasses, Solar Energy Materials, Luminescent
and Optoelectronic Material, Liquid crystals, Phase transitions in materials, Electrical and Magnetic
properties of materials, Supercapacitors, Nanomaterials and their properties.
[No. Of Hours: 8]
Unit 2:
Spectroscopy
Introduction to Spectroscopy and types of spectra, Magnetic Dipole Moments, Electron Spin and Vector
Atom Model and Stern-Gerlach Experiment, Zeeman Effect, Paschen-Back effect, Stark Effect, LS and JJ
Coupling.
[No. Of Hours: 8]
Unit 3:
Physics of Sensors
Sensor, Signals and Response, Sensor Characteristics, Static and Dynamic Response, Sensor
Classifications, Direct and Complex Sensors. Resistive Sensors (Temperature, Strain/Piezo-resistive,
Moisture, Gas/Chemical Sensor), Capacitive Sensors (Capacitor formula, Dielectric Constant), Piezoelectric
Sensors (QCM),Thermoelectric Sensor, IR sensors, Light sensors (LDRs), Gravitational Sensors
[No. Of Hours: 8]
Unit 4:
Modern Devices
XRD, Scanning Electron Microscope, Transmission Electron Microscope, Atomic Force Microscopy,
RAMAN, Biomedical Devices(MRI, CT and Ultrasonography)
[No. Of Hours: 6]
28
1. To trace the B-H curve for a ferromagnetic material using CRO and to find the magneticparameters
from the B-H hysteresis loop.
2. To study Hall effect and to measure carrier concentration and Hall coefficient for given
semiconductor.
3. To determine the resistivity of Semiconductors by Four Probe Method at different temperatures and
to calculate Band-Gap from it.
4. To determine the crystal structure from given XRD data.
5. To study and calibrate temperature transducers.
6. To study the (I-V characteristics) of Gas Sensors/LDR.
7. To study response and IV characteristics of infrared (IR) Sensor.
8. Study the principle of scanning electron microscope.
9. Design a model/project based on syllabus.
Required Readings:
Textbooks:
TB1: S. O Pillai (2020). Solid State Physics, New Age International Publishers.
TB2: V.K. Jain (2007). Introduction to Atomic and Molecular Spectroscopy, Narosa Publishing House, New
Delhi.
TB3: H. K. Malik and A. K. Singh (2017), Engineering Physics (2e), McGraw Hill.
TB4: C L Arora (2007). Practical Physics, (28e) S. Chand & Company Ltd.
Reference Books:
RB1: C. Kittel (2019). Introduction to Solid State Physics, Wiley India.

RB2: Jacob Fraden (2010), Handbook of Modern Sensors: Physics, Designs, and Applications, Springer.
29
BT-BS203 | ENVIRONMENTAL STUDIES
Teaching Scheme
L T P Credit
2 0 2 3
Pre-requisites:
Knowledge of basic Environmental Science for B.Tech.
Course Objectives:
The objective of the paper is to facilitate the student with the basics of Environmental Studies that are
required for an engineering student.
Course Outcomes:
CO1: Acquire Knowledge from the Multidisciplinary nature of Environmental studies.

CO2: Understand the Ecosystem and Biodiversity of earth.
CO3: Analyze various types of Pollutions and Resources.
CO4: Apply the knowledge on solving social issues
CO5: Evaluate various environmental policies/acts.
Syllabus:
Unit 1:
Multidisciplinary Nature of environment studies: Introduction, Scope and objectives of environmental
studies, Need for public awareness, Components of Environment, Impact of development on Environment.
[No. Of Hours: 3]
Unit 2:
A) Natural Resources and associated problems: Forest Resource: Use and overexploitation,
Deforestation, case studies, Timber extraction, mining, dams and their effects on forest and tribal people.
Water resources: Use and Overutilization of surface and groundwater, Floods, Drought, and conflicts on
water, Mineral resources: Use and Overexploitation, case study, Food resources: World Food Problems,
the effect of Modern agriculture, Overgrazing, Fertilizer- Pesticide problems. Energy Resources: Growing
energy needs, renewable, and non-renewable energy sources, alternate energy sources. Land resources:
Land Degradation, Soil erosion, and desertification.
- Role of individual in conservation of natural resources.
- Equitable use of resources for sustainable lifestyles.
B) Environmental pollution: Definition, causes, effects, and control measures- Air Pollution, Water
Pollution, Noise Pollution, Soil Pollution, Marine Pollution, Thermal Pollution, Nuclear Hazards, and Solid
Waste Management.
– Role of an individual in the prevention of pollution.
[No. Of Hours: 6+6]
Unit 3:
A) Ecosystem -Concept of an ecosystem, Structure, and function of an ecosystem, producers, consumers
and decomposers, energy flow in the ecosystem, Ecological Succession, food chains, food webs, Different
types of ecosystems- forest ecosystem, grassland ecosystem, desert ecosystem, aquatic ecosystems.
30
B) Biodiversity & its Conversation- Genetic, species and ecosystem diversity, bio-geographical
classification of India, Value of Biodiversity, Biodiversity at global, national, and local level, Hot-spots of
biodiversity, threats to biodiversity, endangered and endemic species of India, Conservation of biodiversity.
[No. Of Hours:6+6]
Unit 4:
Disaster Management and Social Issues
Disaster Management-floods, earthquakes, cyclones and landslides, nuclear accidents and holocaust, case
studies, Social Issues-Sustainable development, climate change, global warming, ozone layer depletion,
Acid rain, and Environmental protection Act.
[No. Of Hours: 3]
Practical /Laboratory Content:
1. To determine the pH, conductivity and turbidity of given water sample.

2. To determine free CO2 of given water sample.
3. To determine percentage moisture content of soil sample.
4. To determine pH and conductivity of soil / sludge sample.
5. To determine the dissolved oxygen in given water sample.
6. Determine the ammonia content in given water sample.
7. Field work and project report: -Visit to local area to document environmental assets/ Visit to local
polluted site/ study of common plants, insects, birds/ study of simple ecosystem- Pond, river, Hills,
grassland etc. (field work equals to 5 lecture hours).
Required Readings:
Textbooks:
TB1: Barucha.E,(2005). Textbook of Environmental Studies for Undergraduate Courses, Universities Press
(India) Pvt. Ltd., 2005.
TB2: Rajagopalan.R, (2011) Environmental Studies: From Crisis to Cure, 2nd Edition, Oxford University
Press.
TB3:Kiely.G,(2010) Environmental Engineering, Tata McGraw-Hill Publishing Company Ltd., New Delhi.
Reference Books:
RB1: Cunningham.W and Cunningham. M. A.(2003) Principles of Environment Science: Enquiry and
Applications, Tata McGraw Hill Publication, N. Delhi
RB2: Kaushik C.P, (2013),Perspectives in Environment Studies, 4th Edition, New Age International
Publishers.
31
BT-ES201 | PROBLEM SOLVING USING C
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
A basic understanding of Computer Programming terminologies.
Course Objectives:
The objective of the course is to facilitate the student with the basics and advanced concept of C
programming.
Course Outcomes:

CO1: Memorise the basics concepts of C programming language.
CO2: Apply and execute simple algorithms for arithmetic and logical problems.
CO3: Analyse the problem for its decomposition into functions and synthesize a complete program.
CO4: Test and measure the complexity of various algorithms.
CO5: Solve the real-world problem using the programming concepts learned.
Syllabus:
Unit 1:
History of C, Concepts of Algorithm, Flowcharts, Assembler, Compiler, Interpreter, Loader, and Linker,
Introduction to different programming paradigms.
Programming Basics: Structure of a C Program, Identifiers, Keywords, Variables, Data types, Input/Output
statements, Storage classes, format specifications, assignment statements.
Operators: Arithmetic, Relational, Logical, Bit wise operators,Conditional operators, precedence of
operators.
Expressions: Arithmetic expressions and their evaluation .
Decision and Case control structure: if statement, if else statement, nested ifelse, switch statements,
conditional statements, use of goto, break statement, continue statement.
[No. Of Hours: 11]
Unit 2:
Iteration/loops: concepts of while, do while, and for loops, jump statements in loops
Pointers: introduction, pointer arithmetic, applications, concept of dynamic memory allocation
Functions: introduction to functions, scope rules, call by value, call by reference, recursive functions, adding
functions to the library,Introduction to command line arguments.
[No. Of Hours: 11]
Unit 3:
Arrays: one-dimensional array, two-dimensional arrays, multi-dimensional arrays, array operations.
Strings: introduction to strings and standard library string functions.
Custom Data types: structures, union, enum and use of typedef.
[No. Of Hours: 11]
Unit 4:
File Management: creating a file, opening and closing of a file, reading from and writing to a file, error
handling during input/output operations, random access to files, command-line arguments.
32
Preprocessor: introduction to preprocessor directives, macro writing and substitution directives, file inclusion
directives, compiler control directives.
C89 vs C99: Features added, Features removed, and Features changed.
Advanced useful functions: mathematical functions, time, date, localization functions, utility Functions,
graphics functions.
[No. Of Hours: 12]
10. Basic Programs:

a. Write a program to print a message.
b. Write a program to add two numbers.
c. Write a program to calculate the simple interest and compound interest.
d. Write a program to check whether a given number is even or odd.
e. Write a program to find the greatest among three numbers:
i. Using elseif construct.
ii. Using conditional operator.
f. Write a program to check whether a given is a leap year or not.
g. Using the switch case, read the name/number of the months and display the corresponding
number of days in that month.
11. Programs on Loops, Pointers and Function:

a. Write a program using functions to implement a calculator to perform the following
operations:
i. Addition
ii. Subtraction
iii. Division
iv. Multiplication
b. Write a program to print the sum of all the numbers from 1 to n, where the value of n is taken
from user.
c. Write a program to check whether the given number is prime or not.
d. Write a program to print the sum of digits of a given integer number.
e. Write a program using function to print the first n numbers of Fibonacci series, where the
value of n is taken from user. (Example: First 7 numbers of Fibonacci Series are: 1, 1, 2, 3,
5, 8, 13, 21)
f. Write programs to print the following patterns:
i. * ii. 1 iii. * * * * * *
** 2 3 *****
*** 4 5 6 ****
**** 7 8 9 ***
***** 10 11 12 * *
*
**
***
****
*****
******
g. Write a program to calculate the factorial of a given number using recursion.
h. Write a program to print Armstrong numbers from 1 to n, where the value of n is taken from
the user.
i. Write a program to swap two numbers using:
i. Call by value
ii. Call by reference
12. Programs on Arrays, Strings, and Custom data types:

a. Write a menu-driven program to perform the following operations (using functions) on a one-
dimensional array:
i. Insertion
ii. Deletion
iii. Display
33
b. Write a program to print the minimum and maximum element in a given integer two-
dimensional array.
c. Write a program to search an element from a given array using:
i. Linear Search
ii. Binary Search
d. Write a program to read the following data of 60 students of a class:
 Roll Number
 Marks in Subject 1, Subject 2, Subject 3, Subject 4, Subject 5
Calculate the following and display the result:

i. Total marks obtained by each student.
ii. Highest marks in each subject and the roll number of students who secured it.
iii. Roll number of the student who secured the highest marks.
e. Write a program to perform the following operations on two-dimensional matrices:
i. Addition
ii. Subtraction
iii. Multiplication
f. Write a program to implement following std library functions:
i. strlen()
ii. strcat()
iii. strcpy()
13. Programs on File management:

a. Write a program to copy the content of one file into another file.
b. Write a program that appends one file at the end of another file.
Note: The program list is only for reference purpose; the concerned subject professor may modify it
as per the need.
Required Readings:
Textbooks:
TB1: Balagurusamy, E. (2019). Programming in ANSI C (8 E) Tata Mc Graw.

TB2: Gottfried Byron S (2018). Programming with C (4 E) Schaum Series.
TB3:Kanetkar, Yashavant (2016). Let Us C (15 E) bpb publication.
Reference Books:
RB1: Kernighan Brian W. and Ritchie Dennis (1988). C Programming Language Prentice Hall.
RB2: Rajaraman V. (1994). Computer Programming in ‘C’ Prentice Hall.
RB3: Sprankle M. (2012). Programming and Problem Solving (9 )E, Pearson Education.
RB4:Dromey R. G.(2008).How to solve it by Computer (latest) Pearson Education.
34
BT-ES202 BASICS OF ELECTRONICS ENGINEERING
Teaching Scheme
L T P Credit
2 0 2 3
Pre-requisites:
Basic knowledge of applied physics.
Course Objective:
To understand analysis and design of simple electronic circuit
Course Outcomes:

CO 1: Analyze PN junctions in semiconductor devices under various conditions.
CO 2: Analyze simple rectifiers and voltage regulators using diodes.
CO 3: Describe the behaviour of special purpose diodes.
CO 4: Analyze simple BJT and MOSFET circuits.
CO 5: Design simple circuits and mini projects.
Syllabus:
Unit 1:
Introduction to Semiconductors
Intrinsic and extrinsic semiconductors, transport mechanism of charge carriers, Hall effect, Energy band
structures in intrinsic and extrinsic semiconductors, equilibrium carrier concentration, direct and indirect
band-gap semiconductors. Carrier transport: diffusion current, drift current, mobility and resistivity,
generation and recombination of carriers, Fermi Level, Carrier Life Time.
[No. Of Hours: 9]
Unit 2:
Diodes and its application
P-N junction diode, Current components in p-n junction, Characteristics and applications. Diode circuit: half
wave, full wave rectifiers, clipping and Clampers circuits etc. Zener diode and its application as voltage
regulator.
[No. Of Hours: 7]
Unit 3:
Bipolar Junction Transistor
Introduction of transistor (NPN, PNP), construction, transistor operations, BJT characteristics, load line,
operating point, leakage currents, saturation and cut off mode of operations, Eber-moll‘s model. Application
of BJT: CE, CB and CC configuration, input-output characteristics and its hybrid model at low frequency.
[No. Of Hours: 8]
Unit 4:
Field Effect Transistor
Introduction to FET - Operation and characteristics, MOSFET-Enhancement and Depletion Modes –
Regions of Operation, introduction to IGBT and CMOS.
[No. of Hours: 6]
35
1. Identification & Testing of the various Active and Passive Components.

2. Introduction to CRO and Function generator & to generate different types of waveform with the help
of Function Generator & to calculate their frequency and amplitude for AC & DC voltage.
3. To study Characteristics of PN junction Diode
4. To study Characteristics of Zener Diode.
5. To study Characteristics of FET.
6. To study Characteristics of CB Configuration.
7. To study Characteristics of CE Configuration.
8. To study Characteristics of CC Configuration.
9. Introduction to bread-board and to design and study half wave rectifier and full wave rectifier.
10. To design and study clipper and clamper circuits.
Note: At least 8 experiments out of the above list are to be performed.
Required Readings:
1. Adel S Sedra, Kenneth C Smith and Arun N Chandorkar(2017). Microelectronic Circuits – Theory
and Applications. Seventh Edition. Oxford University Press.
2. Robert L Boylestad and Louis Nashelsky (2015). Electronic Devices and Circuit Theory. Eleventh
Edition. Pearson India Education Services Pv Ltd..
3. Donald A Neamen,(2006).Electronic Circuits – Analysis and Design. Third Edition. McGraw Hill
Education.
4. Albert Malvino and David Bates(2016). Electronic Principles. Eighth Edition.McGraw Hill
Education.
36
BT-ES203 | ENGINEERING GRAPHICS & CAD
Teaching Scheme
L T P Credit
1 0 3 2.5
Pre-requisites:
A basic understanding of Engineering Graphics and CAD
Course Objectives:
The objective of the course is to facilitate the student with the basics and advanced concept of Engineering
Graphics & CAD that are required for an engineering student.
Course Outcomes:
CO1: State knowledge on the fundamentals of engineering drawing and units.

CO2: Describe proficiency with a metric and engineer scales.
CO3: Demonstrate the proper use of drawing equipment.
CO4: Design the projections in AUTO-CAD.
CO5: Evaluate standards in engineering drawing practice and engineering graphics.
Syllabus:
Unit 1:
INTRODUCTION TO ENGINEERING DRAWING:
Principles of engineering graphics and their significance, Introduction to engineering drawing utilities,
Drawing instruments and their use,Layout of Drawing Sheet, Title block, BIS conventions, Lettering,
Dimensioning, Scales, Sheet Sizes, Types of Lines, Types of Planes, Recent drawing Conventions.
[No of Hours: 09]
Unit 2:
PROJECTIONS OF POINT, LINES AND PLANES:
Introduction of Projection, Angle of Projections, Projections of Points- in different quadrants and planes,
Projection of Lines- True Length and Inclinations, Projection of Planes- Traces, Representations of
Perpendicular and Inclined planes.
[No of Hours: 12]
Unit 3.
ORTHOGRAPHIC AND ISOMETRIC PROJECTIONS:
Introduction of Orthographic Projection, Projection of Solids- Development of Orthographic views.
Introduction of Isometric Projection, Isometric Scale, Isometric Views, Conversion of Isometric Views to
Orthographic Views and Vice-versaSections of Solids- Section Plane or Cutting Plane, Full Section, Half
Section, Sectional Orthographic views of solids.
[No of Hours: 12]
Unit4.
INTRODUCTION TO COMPUTER AIDED DRAFTING (USING SUITABLE SOFTWARE):
Knowledge of Computer screen interface of a software, layout of the software, standard tool bar / menu and
description of most commonly used tool bars. Executions of commands such as creation of Lines, coordinate
37
points, axes, poly-lines, square, rectangle, polygons, splines, circles, ellipse, text, move, copy, off-set, mirror,
rotate, trim, extend, break, chamfer, fillet, curves etc. Dimension tool bar
[No of Hours: 12]
Note: At least 12 Numbers of drawing sheets need to be made in a complete semester.
Required Readings:
Textbooks:
TB1: Gill, P.S Engineering Drawing. (2009). India: S. K. Kataria& Sons

TB2: Rana, B. C., Shah, M. B. (2009). Engineering Drawing. India: Pearson.
TB3: Dr. M H Annaiah, Dr C N Chandrappa and Dr. B Sudheer Premkumar, Computer Aided Engineering
Drawing, Fifth edition, New Age International Publishers.
TB4: Narayana, K.L. & P Kannaiah (2008), Text book on Engineering Drawing, Scitech Publishers.
TB5:Sham Tickoo Swapna D (2009), “AUTOCAD for Engineers and Designers”, Pearson Education
Reference Books:
RB1:Computer Aided Engineering Drawing. (n.d.). India: New Age International(p) Limited N Delhi.
38
BT-ES204 | WORKSHOP PRACTICE
Teaching Scheme
L T P Credit
1 0 3 2.5
Pre-requisites:
Basic Knowledge of Intermediate class physics
Course Objectives:
The objective of this course is to provide students the skills that will help them to succeed in their academic
projects and throughout their engineering careers. In diverse shops such as fitting sheet metal, foundry and
welding students try to fabricate jobs/products/projects utilising various workshop tools.
Course Outcomes:

CO1: Understand the basics of workshop practices in wood working, sheet metals, fittings, forging and
heat treatments.
CO2: Apply the concepts in specified bench work activities using hand and power tools
CO3: Develop the ability to do arc and gas welding and make different types of joints.
CO4: Develop the ability to make sand moulds and patterns for casting process.
CO5: Apply appropriate health, safety and personal hygiene procedures when performing mechanical
engineering tasks.
Syllabus:
Unit 1:
Introduction: Manufacturing processes and their classification
Casting Processes: Principles of metal casting, Pattern types, composition and properties of mouldings and,
foundry tools,concept of cores and core print, elements of gating system, special casting processes and their
applications -die-casting; permanent mould casting; centrifugal casting; investment casting;
[No. Of Hours: 4]
Unit 2:
Smithy and Forging
Hot working and cold working, Forging tools and equipments, Forging operations, Forging types: Smith
forging, Drop forging, Press forging
Bench Work and Fitting:Fitting shop tools, operation: Fitting; sawing; chipping; thread cutting (with taps and
dies); Marking and marking tools. Applications of smithy and forging processes.
[No. Of Hours: 4]
Unit 3:
Metal joining:
Welding principles, classification of welding techniques, Oxyacetylene Gas welding, equipment and field of
application, Arc-welding, Electric resistance welding: spot; seam; flash; butt and percussion welding, Types
of joints and edge preparation, Soldering, applications of metal joining processes.
[No. Of Hours: 4]
Unit 4:
Sheet Metal Work:
39
Tools and equipments used in sheet metal work, standard specification for sheets, Types of sheet metal
operations: shearing, drawing, bending. Other operations - spinning, stretch forming, embossing and coining.
Applications of sheet metal processes.
[No. Of Hours: 3]
1. Introduction to workshop, safetyand first aid practices.
[No. Of Hours: 3]
2. Sheet Metal Shop No. Of Hours: 9]

 To study the tools and machineries used in sheet metal shop.
 To prepare various sheet metal joints such as lap, seam, locked seam, hem, wired edge, cup,
flanged, angular, cap.
 To create a tray/ cylindrical mug using sheet metal tools.
3. Foundry Shop [No. Of Hours: 6]

 To study the tools and equipments used in foundry shop.
 To prepare a sand mould in foundry shop using single/split piece pattern.
4. Carpentry Shop [No. Of Hours: 6]

 To study the tools and equipments used in carpentry shop.
 To make a half lap T-joint/ half cross lap joint using Carpentry tools.
5. Welding Shop [No. Of Hours: 6]

 To study arc and gas welding equipments and tools.
 To make Lap Joint/T-Joint/Butt Joint using gas/arc welding.
6. Fitting Shop [No. Of Hours: 9]

 To study the tools and equipments used in fitting shop.
 To make V-Joint/ T-Joint using fitting tools.
7. Machine Shop [No. Of Hours: 6]

 To study lathe and its basic operations.
 To perform facing, and turning operations on lathe machine.
Required Readings:
Textbooks:
TB1: B. S. Raghuwanshi (2015), A course in Workshop Technology, Tenth Edition, Dhanpat Rai & Co. Ltd.
Delhi, Educational and Technical Publishers.
TB2:Hazra, Chowdhary(2010), Workshop Technology, Media Promoters and Publishers Pvt.Ltd.
TB3:P. N. Rao (2018), Manufacturing Technology, Fifth edition, Mc Graw Hill.
Reference Books:
RB1: Jain, R. k. (2012). Production Technology. India: Khanna Publication.
RB2: :G. K. Lal, S. K. Choudhury (2014), Fundamentals of Manufacturing Processes, Narosa Publishing
House Pvt Ltd.
40
BT-AU201 | CONSTITUTION OF INDIA
Teaching Scheme
L T P Credit
1 0 0 1
Pre-
requisites:
A basic understanding of Democratic Politics.
Objectives:
The objective of the course is to: -
 To make students aware of the theoretical and functional aspects of the Indian
Parliamentary System.
 To conceptualize the basic rights of human being.
 To channelize students’ thinking towards basic understanding of the legal
concepts and its implications for engineers
Learning
Outcomes:

CO1: Know the basic features and modalities about Indian constitution.
CO2: Use of abstract of Indian Constitution in particular and concrete situations.
CO3: Analyze and relate the functioning of constitutional machinery at center and state level.
CO4: Evaluate the relevant of the Constitution of India.
CO5: Acquaint the students with legacies of constitutional development in India
Syllabus:
UNIT-1
Nature of the Indian Constitution. Meaning of the constitution law and constitutionalism and Preamble of
the Constitution. Fundamental Rights, Fundamental Duties and ConstitutionalRemedies.
Union executive: The President, his/her Powers and Position including Ordinance Making Power.
Prime Minister and the Cabinet
[No. of Hours: 8]
UNIT-2
Distribution of Legislative Powers between Union and the states.
Emergency Provisions with Special References to Proclamation of Emergency and President's Rule
Union Judiciary & State Judiciary: Supreme Court of India, High Courts, Composition and Jurisdiction
Amendment of the Constitution. Power and Procedure; BasicStructure of the Constitution
[No. of Hours: 8]
41
Required
Readings:
Text Book:
TB1: Bare Act of the Constitution of India, Universal Law Publishing.
RB1: Jain M.P., Constitutional Law, Lexis Nexis Publishing

ReferenceRB2:
Book: Pandey J.N., Constitutional Law of India, Central Law Agency Publishing
RB3: Shukla V.N., Constitutional Law of India, EBC Publishing
RB4: PM Bakshi: The Constitution of India, Universal Law Publishing
42
SEMESTER III
43
Credit scheme
Semester III
Hours/week Total
S. No. Course Code Course Name
L T p Total Credits
1. BT-CS-ES301 Object Oriented Programming 3 0 2 5 4
2. BT-CS-ES302 Discrete Structures 3 1 0 4 4
3. BT-CS-ES303 Data Structures 3 1 2 6 5
Database Management
4. BT-CS-ES304 3 0 2 5 4
Systems
5. BT-CS-ES305 Artificial Intelligence 3 0 2 5 4
6. BT-EC-ES303 Digital Circuits and Systems 3 1 2 6 5
7. BT-AU30X Creative Art Basket* 0 0 2 2 0
Total 18 3 12 33 26
44
BT-CS-ES301| OBJECT ORIENTED PROGRAMMING
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
A basic understanding of Programming Fundamentals.
Objectives:
The aim of the course is to enable the students to tackle complex programming problems, making good use
of the object-oriented programming paradigm to simplify the design and implementation process.
Course Outcomes:
CO1: Understand fundamentals of programming such as variables, conditional and iterative execution,
methods, etc.
CO2: Describe the important concepts of object-oriented programming like object and class,
Encapsulation, inheritance and polymorphism.
CO3: Use advance features like templates and exception to make programs supporting reusability and
sophistication.
CO4: Apply the principles of virtual functions and polymorphism.
CO5: Develop the applications using object-oriented programming with C++.
Syllabus:
Unit 1:
Introduction to Object Oriented Programming, Need for OOP Paradigm, Comparison of programming
methodologies, Benefits of OOP, Basic concepts of Object-Oriented Programming, Structure of a C++
program, namespace, Data types, C++ tokens, Identifiers, Variables, Constants, Operators, Control
structures & Loops.
[No. Of Hours: 10]
Unit 2:
Objects and Classes: Basics of object and class in C++, Private and public members, Access Control,
Memory Allocation for Objects, static data and function members, scope resolution operator
C++ Functions: Simple functions, Call and Return by reference, Inline functions, Macro Vs. Inline functions,
overloaded function; array of objects, pointers to objects, dynamic allocation operators, Operator
overloading, overloading unary and binary operator, overloading the operator using friend function, stream
operator overloading, data conversion, default arguments, virtual functions.
[No. Of Hours: 11]
45
Unit 3:
Introduction to Constructors, Default Constructors, Parameterized Constructors, Copy Constructors,
Constructor Overloading, constructor with default parameter, Multiple Constructors in a Class, Destructors.
Inheritance: Introduction to inheritance, Base class, derived class, visibility modes, Single Inheritance,
protected data with private inheritance, Multiple Inheritance, Multi level Inheritance, Hierarchical Inheritance,
Hybrid Inheritance, overriding, virtual base class, constructors in derived and base class
[No. Of Hours: 11]
Unit 4:
Polymorphism: Introduction to Memory management, new operator and delete operator, Pointers to objects,
Pointers to Derived Classes, Polymorphism, Compile time polymorphism, Run time polymorphism.
I/O and File Management: Concept of streams, cin and cout objects, C++ stream classes, Unformatted and
formatted I/O, manipulators, File stream, C++ File stream classes, File management functions, File
modes, Binary and random Files.
Templates, Exceptions and STL : What is template? Function templates and class templates, Introduction
to exception, try-catch throw, multiple catch, catch all, rethrowing exception, implementing user defined
exceptions, Overview and use of Standard Template Library
[No. Of Hours: 12]
1. Write a C++ program to find the sum of individual digits of a positive integer.
2. Write a C++ program to generate the first n terms of the sequence.
3. Write a C++ program to find both the largest and smallest number in a list of integers.
4. Write a program Illustrating Class Declarations, Definition, and Accessing Class Members.
5. Program to illustrate default constructor, parameterized constructor and copy constructors
6. Write a program for multiplication of two matrices using OOP.
7. Write a C++ program that illustrates the order of execution of constructors and destructors when new
class is derived from more than one base class.
8. Write a program to find the greatest of two given numbers in two different classes using friend function.
9. Implement a class string containing the following functions:
- Overload + operator to carry out the concatenation of strings.
- Overload = operator to carry out string copy.
- Overload <= operator to carry out the comparison of strings.
- Function to display the length of a string.
- Function tolower( ) to convert upper case letters to lower case.
- Function toupper( ) to convert lower case letters to upper case.
10. Write C++ programs that illustrate how the following forms of inheritance are supported:
a)Single inheritance b)Multiple inheritance c)Multi level inheritance d)Hierarchical inheritance
11. Write a Template Based Program to Sort the Given List of Elements.
12. Write a C++ program that uses function templates to find the largest and smallest number in
a list of integers and to sort a list of numbers in ascending order.
13. Write a Program Containing a Possible Exception. Use a Try Block to Throw it and a Catch
Block to Handle it Properly.
14. Write a Program to Demonstrate the Catching of All Exceptions.
46
as per the need.
Required Readings:
Textbooks:
 TB1: Bjrane Stroustrup (2013). C++ Programming language(4E). Addison–Wesley
 TB2: Balagurusamy, E. (2017). Object-Oriented Programming with C++ (7 E) Tata Mc Graw.
Reference Books:
 RB1: Herbert Schildt (2017).C++, the Complete Reference, 4th Edition. TMH.
 RB2: Robert Lafore (2018). Object oriented Programming in C++. (4E). Pearson
 RB3: Rumbaugh (2006). Object Oriented modelling & Design. Prentice Hall
47
BT-CS-ES302| DISCRETE STRUCTURES
Teaching Scheme
L T P Credit
3 1 0 4
Pre-requisites:
Knowledge of basic mathematics.
Objectives:
Introduce propositional and predicate logic, Introduce the basics of integer theory, counting principles,
Introduce and work with important discrete data structures such as sets, relations, sequences, and discrete
functions and their applications.
Course Outcomes:

CO1: Apply mathematical logic to solve problems.
CO2: Understand sets, relations, functions and discrete structures
CO3: Use logical notations to define and reason about fundamental mathematical concepts such as
sets relations and functions.
CO4: Formulate problems and solve recurrence relation.
CO5: Model and solve real world problems using graphs and trees.
Syllabus:
Unit 1:
Set Theory: introduction to the theory of sets; combination of sets; multisets; ordered pairs, power sets;
finite and infinite sets; principle of inclusion and exclusion; proofs of some general identities on sets.
Relations: definitions and properties of relations; relation composition; representations of relations by binary
matrices and digraphs; operations on relations. closure of relations; reflexive, symmetric and transitive
closures. Warshall's algorithm to compute transitive closure of a relation; equivalence relations and
equivalence classes, partial order sets, combination of partial order sets, Hasse diagram. Definition and
properties of lattices – bounded, complemented, modular and complete lattice.
Functions: definition, classification of functions, operations on functions.
Induction: Introduction to induction and variants of induction.
[No. Of Hours: 11]
Unit 2:
Counting: Introduction, Counting Techniques, Pigeonhole Principle, Permutation and Combinations.
Propositional Logic: Proposition, well formed formula, Truth tables, Tautology, Satisfiability, Contradiction,
Algebra of proposition, Theory of Inference.
Predicate Logic: First order predicate, well formed formula of predicate, quantifiers, Inference theory of
predicate logic.
[No. Of Hours: 12]
Unit 3:
48
Recurrence Relation: Recursive definition of functions, Recursive algorithms, Method of solving
recurrences.
Algebraic Structures: Definition, Groups, types: Semi Groups, Monoid Group, Abelian group, properties of
groups, Subgroups and order, Cyclic Groups, Cosets, Lagrange’s theorem, Normal Subgroups, Permutation
and Symmetric groups, Group Homomorphisms, Definition and elementary properties of Rings and Fields,
Integers Modulo n.
[No. Of Hours: 11]
Unit 4:
Graphs: Definition and terminology, Representation of graphs, Multigraphs, Bipartite graphs, Planar graphs,
Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian paths, Graph coloring.
Trees : Definition, Binary tree, applications of trees, Binary tree traversal, Binary search tree, spanning trees.
[No. Of Hours: 10]
Required Readings:
Textbooks:
TB1: Rosen, Kenneth H (2012), Discrete Mathematics and Its Applications, 7/e, McGraw-Hill publication.
TB2: Liu, C. L., Mohopatra, D. (2017). Elements of discrete mathematics., 4/e, McGraw-Hill publication.
TB3: Tremblay, Jean-Paul, Manohar, R.(2012). Discrete Mathematical Structures with Application to
Computer Science, 1/e, McGraw-Hill Publication.
Reference Books:
RB1: Kolman, Busby, Ross (2015), Discrete Mathematical Structures, 1/e, Pearson Education India.
RB2: Babu Ram (2010), Discrete Mathematics, 1/e, Pearson Education India.
49
BT-CS-ES303 | DATA STRUCTURES
Teaching Scheme
L T P Credit
3 1 2 5
Pre-requisites:
A basic understanding of C Programming language.
Objectives:
The objective of the course is to introduce the student with the designing and implementation of various data
structures to solve the real-life problems.
Course Outcomes:
CO1: Implement abstract data types using arrays and linked list.
CO2: Apply the different linear data structures like stack and queue to various computing problems.
CO3: Discuss graph and tree structure and understand various operations on graphs and trees and
their applicability.
CO4: Analyze the various sorting and searching algorithms.
CO5: Understand and use hashing technique and hash functions.
Syllabus:
Unit 1:
Introduction: Basic Terminology, Algorithm, Efficiency of an Algorithm, Time and Space Complexity,
Abstract Data Types (ADT)
Arrays: Representation of Arrays: Row Major Order, and Column Major Order, Application of arrays, Sparse
Matrices and their representations.
Linked lists: Singly Linked Lists, Doubly Linked List, Circularly Linked List, Operations on a Linked List:
Insertion, Deletion, Traversal. Polynomial Representation and Addition, Generalized Linked List.
[No. Of Hours: 12]
Unit 2:
Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked Implementation of
Stack in C, Application of stack: Prefix and Postfix Expressions, Evaluation of postfix expression, Recursion,
Tower of Hanoi Problem.
Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, Array and linked
implementation of queues in C, Dequeue and Priority Queue.
[No. Of Hours: 10]
50
Unit 3:
Trees: Basic terminology, Binary Trees, Binary Tree Representation: Array Representation and Dynamic
Representation, Complete Binary Tree, Algebraic Expressions, Extended Binary Trees, Array and Linked
Representation of Binary trees, Tree Traversal algorithms: Inorder, Preorder and Postorder Search Trees:
Binary Search Trees (BST), Insertion and Deletion in BST, AVL trees, Introduction to m-way trees.
[No. Of Hours: 10]
Unit 4:
Graphs: Terminology, Sequential and linked Representations of Graphs: Adjacency Matrices, Adjacency
List, Adjacency Multi list, Graph Traversal : Depth First Search and Breadth First Search
Sorting concept, order, stability, Selection sorts (straight, heap), insertion sort (Straight Insertion, Shell sort),
Exchange Sort (Bubble, quicksort), Merge sort (only 2-way merge sort). Searching – List search, sequential
search, binary search, hashing concepts, hashing methods (Direct, subtraction, modulo-division, mid square,
folding, pseudorandom hashing), collision resolution (by open addressing: linear probe, quadratic probe,
pseudorandom collision resolution, linked list collision resolution), Bucket hashing.
[No. Of Hours: 11]
1. Perform Linear Search and Binary Search on an array. Description of programs is as follows:
a. Read an array of type integer.
b. Input element from user for searching.
c. Search the element by passing the array to a function and then returning the position of
the element from the function else return -1 if the element is not found.
d. Display the position where the element has been found.
2. Create a stack and perform Pop, Push, Traverse operations on the stack using Linear Linked list.
3. Create a linked list with nodes having information about a student and perform:
a. Insert a new node at specified position.
b. Delete of a node with the roll number of students specified.
c. Reversal of that linked list.
4. Create a Sorted linked list and perform the following operations:
a. Insertion
b. Deletion
c. Display
5. Create doubly linked list with nodes having information about an employee and perform Insertion at
front of doubly linked list and perform deletion at end of that doubly linked list.
1. Create circular linked list having information about the student and perform Insertion at front perform
Deletion at end and display the elements of queue.
2. Create a Linear Queue using Linked List and implement different operations such as Insert, Delete,
and Display the queue elements.
3. Implement insertion, deletion and display (inorder, preorder and postorder) on binary search tree.
4. To implement Insertion sort, Merge sort, Quick sort, Bubble sort, Bucket sort, Radix sort, Shell sort,
Selection sort, Heap sort and Exchange sort using array as a data structure.
as per the need.
51
Required Readings:
Text books
 TB1: Horowitz, E., Saini, S., & Anderson-Freed, S. (2008). Fundamentals of data structures in C (2E)
university press.
 TB2: Jean Paul Trembley and Paul G. Sorenson, “An Introduction to Data Structures with
applications”, McGraw Hill.
Reference Books
 RB1: Tanenbaum Aaron M., Langsam Yedidyah, Augenstein Moshe J. (2019). Data Structures
using C (1E) Pearson.
 RB2: Lipschutz, “Data Structures” Schaum’s Outline Series, Tata Mc graw-hill Education
(India) Pvt. Ltd
 RB3: R. Kruse et al, “Data Structures and Program Design in C”, Pearson Education
52
BT-CS-ES304| DATABASE MANAGEMENT SYSTEMS
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Fundamentals of computer science.
Objectives:
The course aims to understand the concept of DBMS and ER Modeling. Also to explain the normalization,
SQL, relational algebra, and apply the concurrency control and recovery for real-time data.
Course Outcomes:
CO1: Apply knowledge of databases for real-life applications.
CO2: Apply query processing techniques to automate the real-time problems of databases.
CO3: Identify and solve the redundancy problem in database tables using normalization.
CO4: Understand the concepts of transactions, and their processing so they will familiar with a
broad range of database management issues including data integrity, security, and recovery.
CO5: Design, develop and implement a real database application using database tools.
Syllabus:
Unit 1:
Introduction: Overview, Database System vs File System, Database System Concept and architecture, Data
Model Schema and Instances, Data Independence, Database Language and Interfaces, Database Users.
Data Modeling Using the Entity-Relationship Model: ER Model Concepts, Notation for ER Diagram, Mapping
Constraints, Keys, Concepts of Super Key, Candidate Key, Primary Key, Generalization, Aggregation,
Specialization, Reduction of an ER Diagrams to Tables, Extended ER Model, Relationship of Higher Degree.
[No. Of Hours: 11]
Unit 2:
Relational data Model and Language: Relational Data Model Concepts, Integrity Constraints, Entity Integrity,
Referential Integrity, Keys Constraints, Domain Constraints.
Relational Algebra: Selection and projection set operations, Renaming, Joins, Union, Intersection, Minus,
Division, Examples of Algebra queries.
[No. Of Hours: 10]
Unit 3:
Data Base Design & Normalization: Functional dependencies, Inclusion dependence, Lossless join
decompositions, Dependency preservation, Normal forms: 1st NF, 2nd NF, 3rd NF, BCNF, Multi-valued
Dependencies and 4th NF, Join Dependencies and 5th NF.
Introduction to SQL: Characteristics of SQL, SQL Data Type and Literals, SQL Operators, Tables, Views
and Indexes, Queries and Sub Queries, Aggregate Functions, Joins, Cursors, Triggers, Procedures.
[No. Of Hours: 11]
53
Unit 4:
Transaction Processing Concept: Transaction System, ACID properties, serializability of Transaction,
Testing of Serializability, Serializability of Schedules, Conflict & View Serializable Schedule, Recoverability,
Recovery from Transaction Failures, Log Based Recovery, Checkpoints.
Concurrency Control Techniques: Concurrency Control, Locking Techniques for Concurrency Control, Time
Stamping Protocols for Concurrency Control, Validation Based Protocol, Multiple Granularity, Multi-Version
Schemes, Recovery with Concurrent Transaction, Deadlock Management.
[No. Of Hours: 12]
1. Installing oracle/ MYSQL.

2. Working with DDL, Creating and Managing Constraints (primary key, foreign key, unique, not null,
referential integrity etc.)
3. Working with DML Commands for inserting, deleting, updating, and retrieving Tables.
4. Basic queries using SELECT Statements using the WHERE Clause, Restricting Rows.
5. Queries using Operators: LIKE, NOT, BETWEEN, NOT BETWEEN, IN, NOT IN etc.
6. Sorting of data using Order by clause.
7. Working with aggregate functions and Group By clause using Complex SQL with aggregated data.
8. Database Querying - Nested queries, Sub queries.
9. Working with Joins (natural joins, outer joins, Self joins, Cross joins).
10. Creating and Managing Views.
11. Working with Data Control Language commands.
12. Writing Programs on PL/SQL.
13. Mini project (Design & Development of Data and Application).
Sample Projects:
a) Inventory Control System
b) payroll processing system
c) Library Information System
d) Student Information System
e) Material Requirement Processing
f) Hospital Management System
g) Railway Reservation System
h) Personal Information System
i) Web-Based User Identification System
j) Timetable Management System
k) Hotel Management System
Note:
(1) Based on the latest trends and technology, experiments may be added by Course
Instructor/Supervisor/Faculty.
(2) A minimum of 08 or more practical must be done.
54
Required Readings:
Textbooks:
TB1: Silberschatz, A., Korth, H. F., & Sudharshan, S. (2013). Database System Concepts. McGraw Hill.
TB2: Elmsari, R., & Navathe, S. B. (2017). Fundamentals of Database Systems. Pearson Education.
TB3: Date, C. J., Kannan, A., & Swamynathan, S. (2006). An Introduction to Database Systems. (8th
ed.). Pearson Education.
TB4: Bayross, I. (2021). SQL, PL/SQL: The Programming Language of Oracle. (4th ed.). BPB
Publications.
Reference Books:
RB 1: Ramakrishna, R., & Gehrke, J. (2014). Database Management Systems. McGraw Hill.
RB 2: Desai, B. C. (2012). An Introduction to Database Systems. West Publishing Company.
RB 3: Ullman, J. D. Principles of Database Systems. (3rd ed.). Galgotia Publications.
55
BT-CS-ES305| ARTIFICIAL INTELLIGENCE
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Knowledge of basic Programming Logic .
Objectives:
The objective of the paper is to facilitate the student to develop the computational systems that can
simulation the human intelligence processes.
Course Outcomes:

CO1: Solve the computational problem using AI techniques
CO2: Represent and reasoning of logical problems using knowledge representation techniques.
CO3: Explain the biological computational models in Artificial Intelligence.
CO4: Interpret the applications of Artificial Intelligence.
CO5: Describe the computational models used in AI applications.
Syllabus:
Unit 1:
Introduction: Definition, Foundation, History, Intelligent Agent-Agent and Environment, Rationality,
Environment, Structure.
Problem Solving- Problems, Solution Searching, Uninformed Search Strategies, Informed (Heuristic)
Strategies, Heuristic Functions, Local Search Algorithms and Optimization Problems, Local Search in
Continuous Spaces.
[No. Of Hours: 09]
Unit 2:
Logical Reasoning: Logical agents, propositional logic, inferences, first-order logic, inferences in first
order logic, forward chaining, backward chaining, unification, resolution
Knowledge Representation: Ontological Engineering, Categories and Object, Events.
[No. Of Hours: 08]
Unit 3:
Learning: Learning by Example- Forms, Supervised Learning, Decision Trees, Linear Model, Artificial
Neural Network, Nonparametric Models, Support Vector Machine. Knowledge in Learning, Reinforcement
Learning.
[No. Of Hours:08]
56
Unit 4:
Natural Language Processing-Models, Text Classification, Structure Grammars, Parsing. Perception- Image
Formation, Operations. Robotics-Hardware, Perception and Moment of Robot.
[No. Of Hours: 07]
List of Experiments:
10. Write a Program to implement Uninformal search – Breadth First search or Depth First Search
11. Write a Program to implement Informal search – Best First Search or A*.
12. Write a Program to computes the truth table of a statement in propositional logic.
13. Explore and use the Pylog to implement the first order logic expression.
14. Write a program to implement perceptron using python libraries.
15. Write a program to implement SVM using python.
16. Write a Program to implement to POS in NLP.
17. Write a Program to convert a colour image into black and white image
19.
Required Readings:
Text Book:
TB1: Russel, J., Norvig, P., (2019) Artificial Intelligence – A Modern Approach, Third Edition, Pearson
Edu.
TB2: Rich, E., Knight, K., (2017) Artificial Intelligence, Third Edition, Tata McGraw Hill.
Reference Books:
RB1: KM Fu, (1994) Neural Networks in Computer Intelligence, McGraw Hill
RB2 : Dan Jurafsky and James Martin. Speech and Language Processing: An Introduction to Natural
Language Processing, Computational Linguistics and Speech Recognition. Prentice Hall,
57
BT-EC-ES303| DIGITAL CIRCUITS & SYSTEMS
Teaching Scheme
L T P Credit
3 1 2 5
Pre-requisites
Basic knowledge of Digital logic gates
Course Objectives
This course provides in-depth knowledge of switching theory and the logic design techniques of digital
circuits, which is the basis for design of any digital circuit.
Course Outcomes
CO1: Design digital circuits using Various IC’s
CO2: Gain knowledge of different types of number systems and their conversions.
CO3: Apply the fundamental knowledge of analog and digital electronics to design various digital
circuits.
CO4: Understand the design guidelines of combinational & sequential circuits.
CO5: Illustrate reduction of logical expressions using boolean algebra, k-map and tabulation
method
Syllabus:
Unit - I
Introduction: Signal, type of signals, Analog, discrete and digital Signals
Number Systems and codes: Decimal, Binary, Octal and Hexadecimal Number systems, Conversion of
Number Systems. BCD, Gray Code, Excess-3 Code, ASCII, EBCDIC, Conversion between various Codes.
Switching Theory: Boolean Algebra-Postulates and Theorems, De’Morgan‘s Theorem, Switching Functions-
Canonical Forms- Simplification of Switching Functions- Karnaugh Map, don’t care conditions and Quine
Mc-Clusky Methods.
[No. of Hours: 10]
Unit - II
Combinational Logic Circuits: - Review of basic gates- Universal gates, Adder, Subtractor, Serial Adder,
Parallel Adder- Carry Propagate Adder, Carry Look-ahead Adder, BCD Adder, Comparators, Parity
Generators, Decoder and Encoder, Multiplexer and De-multiplexer, ALU, PLA and PAL.
Integrated circuits: TTL and CMOS logic families and their characteristics.
[No. of Hours: 10]
Unit – III
Sequential Logic Circuits: Latches and Flip Flops- SR, D, T and MS-JK Flip Flops, Asynchronous Inputs.
Counters and Shift Registers: Design of Synchronous and Asynchronous Counters: Binary, BCD, Decade
and Up/Down Counters, Shift Registers, Types of Shift Registers, Counters using Shift Registers- Ring
Counter and Johnson Counter.
[No. of Hours: 10]
Unit - IV
Synchronous Sequential Circuits: State Tables State Equations and State Diagrams, State Reduction and
State Assignment, Design of Clocked Sequential Circuits using State Equations.
Finite state machine-Mealy and Moore models-minimization of completely specified and incompletely
specified sequential machines, Partition techniques and merger chart methods concept of minimal cover
table, Representation of sequential circuits using ASM chart.
[No. of Hours: 10]
Required Readings
58
Textbooks:
TB1: Mano. (2006). Digital design (cd) (3rd ed.).
TB2: KUMAR A. (2016). Switching theory and logic design. PHI Learning Pvt.
TB3: Kohavi, Z., & Jha, N. K. (2010). Switching and finite automata theory. Cambridge University Press.
TB4: Charles H. Roth, (2003). Fundamentals of logic design, Thomson Learning.
Reference Books:
RB1: Malvino, A. P., & Leach, D. P. (2003). Digital principles and applications.
RB2: Dally, W. J. & Poulton J. W. (2008). Digital systems engineering, Cambridge University Press.
1. Realize all gates using NAND & NOR gates
2. Realize Boolean Algebra-Postulates and Theorems
3. Realize Half Adder, Full Adder, Half subtracter, Full subtracter
4. Realize a BCD adder
5. Realize 4-bit Comparator using combinational circuits
6. Realize 4 bit Even and Odd Parity generator
7. Realize BCD to Excess 3 code converter using combinational circuits
8. Realize 4-bit Binary to Gray code converter using combinational circuits and vice versa
9. Realize BCD to 7-Segment display decoder using combinational circuits
10. Realize Multiplexer and De-Multiplexer / Full Adder using Multiplexer
11. Realize a 4-bit Priority Encoder
12. Realize RS, D, JK, T and MS - JK flip-flop using logic gates
13. Realize a 4-bit Asynchronous up/down Counters
14. Realize Asynchronous BCD Counter
15. Realize left and right shift registers / Ring and Johnson ring counters
59
BT-AU301 Dance
Teaching Scheme
L T P Credit
0 0 2 0
Pre-requisites:
No prerequisites required.
Objectives:
The objective of this course is to make students familiar with the history and cultural significance of the
dance style and to gain proficiency in dance skill.
Course Outcomes:

CO1: Develop a multifaceted physicality through a variety of dance practices.
CO2: Acknowledge and transform power dynamics in a dance space.
CO3: Apply a variety of criteria, aesthetics and approaches of dance.
CO4: Create unique, challenging and diverse dance performances.
CO5: Examine the role of dance and rituals in the lives of individual.
Syllabus
1. A brief history of Indian dance.
2. Acquaintance with the themes of Ramayana, Mahabharata.
3. Acquaintance with other myths and legends pertinent to the dance drama or gat bhaav like Kalia
daman, Govardhan lila, Panghat lila, uru Vandana, Sarwasti Vandna ,Makhan chori, Marich vadh
4. Definition and short explanation: Nritta, Nritya, Natya, Tandava, Lasya, Anga, Upanga, Pratyanga.
5. Rasa: definition and explanation of nine rasas
6. Basic understanding of the term Abhinaya and definition of its four aspects: angika, vachika, aharya,
satvika.
7. Ability to write notation of teental and jhaptal (thah, dugun, chaugun)
60
BT-AU302 MUSIC
Teaching Scheme
L T P Credit
0 0 2 0
Pre-requisites:
Objectives:
The objective of this course is to provide an opportunity to the students to have an introduction to the
nuances of Hindustani music and its appreciation.
Course Outcomes:

CO1: Understand nuances of Raga sangeet.
CO2: Articulate basic music theory in Indian music
CO3: Learn various musical instrument.
CO4: Differentiate between swaras and simple alankars.
CO5: Appreciate the contributions of different artists
Syllabus
1. Definition of the following terms: - Swara, Sangeet, Saptak, Laya, Rãga, Varna
2. Study of the following: - a) Jatis of Raga Audav – Shadav – Sampuran
b) Nãd – Nãd ki Jati – Tarta, Tivrata, Gun
c) Ãroha, Avroha, Pakad

3. Basic knowledge of the following instruments: -
Tãnpura, Sitar, Tabla, Harmonium
4 Biographies & Contributions of the following Tansen, Ustad Shahid Parvez, Ustad Zakir Husain,
Ustad Amir Khan
1. Five Alankars in all the Rãgas,
2. Sargam Geet in an Raag Bhopali
61
BT-AU303 DRAMA
Teaching Scheme
L T P Credit
0 0 2 0
Pre-requisites:
Objectives:
The objective of this course is to facilitate the students to develop an awareness and understanding of the
roles and processes undertaken in contemporary professional theatre practice.
Course Outcomes:
CO1: Apply knowledge and understanding when making, performing and responding to drama
CO2: Develop a range of theatrical skills and apply them to create performance
CO3: Work collaboratively to generate, develop and communicate ideas
CO4: Contribute as an individual to a theatrical performance
CO5: Explore performance texts, understanding their social, cultural and historical context
Syllabus
Introduction to Acting.
Introduction to Theatre Techniques & Design

Theatre History, Literature & Aesthetics, Forms and style of theatre
Components of theatre- space, time audience, performance,
Acting exercise for body and movement, acting exercises for voice and speech
Components of theatre- space, time audience, performance, Acting exercise for body and movement, acting
exercises for voice and speech
Definition of Acting, Responsibilities of an actor tools of an actor character analysis.
Observations aspects, Stage presence, concentration, conviction, confidence, energy and directionality,
Stylized acting with reference to historical and mythological plays.
Mime: conventional, occupational and pantomime Mono acting: different types of characters
Stage presence: completeness (gesture, posture, movement)
Interaction: Eye contact and actor, reaction with co-artists, relating to other elements of performance (set,
property, costume, composition and lights)
62
BT-AU304 PHOTOGRAPHY
Teaching Scheme
L T P Credit
0 0 2 0
Pre-requisites:
Objectives:
The objective of this course is to teach students basic photography knowledge of camera and
to develop and practice skills using digital photography tools.
Course Outcomes:

CO1: Explain the working mechanism and production of camera at the basic level in the context of a
historic process.
CO2: Describe the qualities of light in terms of photography.
CO3: Identifies correct and incorrect exposure in photographs.
CO4: Explain the digital photography recording process and its usage principles.
CO5: Apply setting of shutter speed, control depth of field via aperture settings.
Syllabus
History of photography and prominent photographers: background, early history and development of digital
photography.
Types of Photography and techniques
Understanding Image: Types of shots: distance, angle and movement; digital image basics: image format,
resolution, aspect ratio, Pixels, DPI and PPI; composition and aesthetics: rules and guidelines; visual
element and principles; timing and decisive moment; photo critique; prominent photographers
Introduction to digital photography & technicalities: Introduction to digital photography, digital cameras How
camera works;
Exposure: shutter speed, aperture, ISO; arriving at proper exposure, depth of field, white balance,
understanding histograms
Photography techniques: soft focus, long exposure, short exposure, multiple exposures, time-lapse
photography; Understanding lenses: wide angle lenses, telephoto lenses, and macro lenses, image
sensor: types of images.
Understanding lights and lighting techniques: Natural vs artificial lights, the characteristics of light, colour
temperature, Direction of light, intensity of light, hard and soft lighting, direct light, diffused light, high key
lighting, low key lighting,
63
BT-AU305 FINE ARTS
Teaching Scheme
L T P Credit
0 0 2 0
Pre-requisites:
Objectives:
The objective of this course is to develop and enhance students’ awareness and understanding of the visual
world, particularly the natural world and the world of the fine arts,
Course Outcomes:

CO1: Understand the elements of arts and principles of design.
CO2: Recognize the complexities and continual rearrangement of design elements.
CO3: Identify and draw basic geomatric shapes.
CO4: Differentiate between primary and secondary colours
CO5: Prepare for and mount an exhibition of their artwork.
Syllabus
1. Introduction and Definitions.

2. Drawing from object: Drawing from cubes, cones cylindrical objects, drapery, still life groups.
3. Nature Drawing: To develop the sense of structure. Study from any kind of forms in nature – birds,
shells, butterflies, flowers. Plants, insects, minerals, bones etc.
4. Drawing from human figure – mainly based on general form and gesture by pencil / charcoal
medium.
5. Perception of colour, Light and Pigment theory, Understanding of Primary and Secondary colours.
6. Colour Wheel and various Colour Schemes derived from it.

7. Introduction about design-2d, study of two-dimensional space and its organizational possibilities.
8. Elements of pictorial expression related to concepts and forms.
9. Study of three dimensional geometric object. 3D Composition on Animal and Bird Gesture, posture
and motion of animal and Birds
64
SEMESTER IV
65
Credit scheme
Semester IV
S. Hours/week Total
Course Code Course Name
No. L T p Total Credits
1. BT-CS-BS401 Probability and Statistics 3 1 2 6 5
Computer Organization and

2. BT-CS-ES401 3 1 2 6 5
Architecture
3. BT-CS-ES402 Software Engineering 3 0 2 5 4
Theory of Automata and Formal
4. BT-CS-ES403 3 1 0 4 4
Languages
5. BT-EC-ES411 Communication Systems 3 0 2 5 4
6. BT-CS-PE4XX Program Elective-I 3 0 0 3 3
7. BT-AU401 NSS* 0 0 2 2 1
Total 18 3 10 31 26
66
BT-CS-BS401| PROBABILITY & STATISTICS
Teaching Scheme
L T P Credit
3 1 2 5
Pre-requisites:
Must have good knowledge of Differential and Integral Calculus, sequences and series, Basic Linear/Matrix
Objectives:
Algebra (Topics coved in Mathematics-I and II at first year B.Tech Course)
Objectives:
The main objective of this course is to provide students with the foundations of probabilistic and statistical
analysis mostly used in varied applications in engineering and science like disease modeling, climate
prediction and computer networks etc.
Course Outcomes:
CO1: Understand the terminologies of basic probability, two types of random variables and their
probability functions.
CO2: Derive the Marginal and conditional distributions of bivariate random variables.
CO3: Calculate the expected value of a random variable and the moments.
CO4: Compute the measures of central tendency, correlation, correlation coefficient and regression.
CO5: Apply the statistics for testing the significance of the given large and small sample data by
using t-test, F-test and Chi-Square test.
Syllabus:
Unit 1:
Introduction to Probability: Through Set and Relative Frequency, Experiments and Sample Space – Axioms
of Probability – Conditional Probability – Total Probability - Bayes’ Theorem – Discrete and Continuous
Random Variables – Probability Function, PDF, CDF, Expectation, Variance – Bernoulli Trail - Binomial,
Poisson, Exponential, Geometric, Uniform and Normal Distributions and their applications.
[No. Of Hours: 12]
Unit 2:
Pairs of Random Variables – Joint CDF, Joint PMF, Marginal PMF, Joint PDF and Marginal PDF –
Independent Random Variables, Expected Value of a Function of Two Variables, Conditional Probability
Distributions – Covariance, Correlation and Independence – Expected Values of Sums of Random Variables
– Moments Generating Functions- MGF of the sum of Independent Random Variables – Central Limit
Theorem (for independent and identically Distributed Random Variables).
[No. Of Hours: 12]
Unit 3:
Statistical Averages: Statistical Measures, Measures of Central Tendency, Mathematical Expectation and
moments, Relation between Central and Non-central moments, Dispersions, Coefficient of Variation,
Skewness, Kurtosis, Pearson’s Shape Coefficient, Covariance, Linear Correlation, Correlation Coefficient
and its properties, Rank Correlation Coefficient, Regression, Lines of Regression and properties of
Regression Coefficients. Bounds on Probability, Chebyshev’s Inequality.
67
[No. Of Hours: 12]
Unit 4:
Formation of Hypothesis – Test of Significance: Large Sample test for single proportion, Difference of
Proportions, Single Mean, Difference of Means and Difference of Standard Deviations. Test of Significance
for Small Samples: t- test for single mean, difference of means, t- test for correlation coefficients, F-tests for
ratio of Variances, Chi-Square test for Goodness of fit and independence of attributes.
[No. Of Hours: 10]
14. Introduction to R Programming

15. Getting Started with R
16. Basic Syntax
 Variables, data types, vectors, lists, matrix, data frame
 Logical statements, loops, functions
17. Descriptive Statistics
 Reading Data files
 Basic Data Processing
 Some Basic Statistics Terms (Mean, Median, Mode, Interquartile Range, Variance,
Standard Deviation)
18. Data Visualizations
 Bar Chart, Histogram, Line Chart, Pie Chart, Scatter Plot, Box Plot, Scatter plot matrix Using
ggplot2, ggplot 2 common charts
19. Probability Distributions.
 Generate and visualize Discrete and Continuous distributions using the statistical
environment. Demonstration of CDF and PDF of Binomial, Poisson, Uniform and Normal
Distributions.
20. Densities of Random Variables
 Off the Shelf Distributions in R
 Matching a Density to Data
 More about making Histograms
21. Building Confidence in Confidence Intervals
 Population Verses Samples
 Large Sample Confidence Intervals
 Simulating Data Sets
 Evaluating the Coverage of Confidence intervals
22. Perform Tests of Hypotheses
 How to perform tests of hypotheses about the mean when the variance is known. How to
compute the p-value. Explore the connection between critical region, the test statistic, and
the p-value
23. Correlation
 How to calculate the correlation between two variables. How to make scatter plots. Use the
scatter plot to investigate the relationship between two variables.
24. Estimating a Linear Relationship
 A Statistical Model for a Linear Relationship
68
 Least square Estimates
Note: Students must try to write their own functions for probability distribution instead of using the in-buit
functions from libraries for better understanding of subject.
Text Books:
 TB 1: Probability and Stochastic Processes (3rd Edition) By Roy Yates and David Goodman, Wiley
Publicaions
 TB 2: Probability, Statistics and Random Processes (3rd Edition) by T Veerarajan, McGraw Hill Education
(India) Pvt Limited.
 TB 3: Miller & Freund’s Probability and Statistics for Engineers (9th Edition) by Richard A. Johnson,
Pearson Educational Limited.
Reference Books:
 RB 1: Probability and Statistics for Engineering and Sciences by Devore J.L, Cengage Learning.\, New
Delhi 8th Edition, 2014.
 RB 2: Probability & Statistics for Engineers and Scientists by Walpole, Ronald E. Myres, Raymond
H.;Myres, Sharon L;Ye Keying, 9th Global Edition, Pearson Education.
69
BT-CS-ES402| COMPUTER ORGANIZATION AND
ARCHITECTURE
Teaching Scheme
L T P Credit
3 1 2 5
Pre-requisites:
Basics of digital logic design.
Objectives:
This course will expose students to the basic architecture of processing unit, memory unit and i/o
organization in a computer system.
Course Outcomes:

CO1: Understand the basics of instructions sets and their impact on processor design.
CO2: Demonstrate an understanding of the design of the functional units of a digital computer
system.
CO3: Evaluate cost performance and design trade-offs in designing and constructing a computer
processor including memory.
CO4: Design a pipeline for consistent execution of instructions with minimum hazards. Formulate the
computational models using soft computing techniques.
CO5: Recognize and manipulate representations of numbers stored in digital computers.
Syllabus:
Unit 1:
Basic functional blocks of a computer: CPU, memory, input-output subsystems, control unit. Bus
organization and design. Instruction set architecture of a CPU - registers, instruction execution cycle, RTL
interpretation of instructions, addressing modes, instruction set. Arithmetic Micro operatins, logic micro
operations, shift micro operations, Arithmetic logic shift unit.
Case study - instruction sets of 8085.
[No. Of Hours: 10]
Unit 2:
Data representation: Unsigned and signed number representation, fixed and floating point representations,
character representation. Computer arithmetic: shift-and-add, Booth multiplier, carry save multiplier, Division
, floating point arithmetic.
CPU control unit design: hardwired and micro-programmed design approaches, Case study - design of a
simple hypothetical CPU. Introduction to RISC and CISC processors.
[No. Of Hours: 10]

Unit 3:
Performance enhancement techniques: Basic concepts of pipelining, throughput and speedup, pipeline
hazards.
70
Memory system design: Memory organization, semiconductor memory technologies, Memory interleaving,
concept of hierarchical memory organization, cache memory, associative memory, cache size vs block size,
mapping functions, replacement algorithms, write policy, Virtual memory.
[No. Of Hours:10]
Unit 4:
Peripheral devices and their characteristics: Input-output subsystems, I/O transfers - program controlled,
interrupt driven and DMA, privileged and non-privileged instructions, software interrupts and exceptions.
Programs and processes - role of interrupts in process state transitions.
[No. Of Hours: 10]
Based on 8085 simulator
1. To understand and analyse

i. Block diagram and pin diagram of 8085.
ii. Instruction set of 8085.
2. Write a program to perform :
i. Addition of two 8 bit numbers without carry.
ii. Addition of two 8 bit numbers with carry
3. Write a program to perform:
i. Subtraction of two 8 bit numbers without borrows.
ii. Subtraction of two 8 bit numbers with borrows.
4. Write a program to find 1‟s complement of an 8 bit number.
5. Write a program to find 2‟s complement of an 8 bit number.
6. Write a program to perform Multiplication of two 8 bit numbers.
7. Write a program to find to find the smallest and largest number from the given series.
8. Write a program to find sum of series of n consecutive numbers.
9. Write a program to find factorial of a number.
10. Write a program to reverse an 8 bit number.
11. Write a program to sort array in ascending/ descending order.
12. Write a program to perform division of two 8 bit numbers.
Required Readings:
Textbooks:
TB1: M. Moris Mano (2006), Computer System Architecture, 3rd edition, Pearson/PHI, India.
TB2: Carl Hamacher, Zvonks Vranesic, SafeaZaky (2002), Computer Organization, 5th edition,
McGraw Hill, New Delhi, India
Reference Books:
RB1: William Stallings (2010), Computer Organization and Architecture- designing for
performance, 8th edition, Prentice Hall, New Jersy.
71
RB2: Anrew S. Tanenbaum (2006), Structured Computer Organization, 5th edition, Pearson Education
Inc,
RB3: John P. Hayes (1998), Computer Architecture and Organization, 3rd edition, Tata McGrawHill
RB4: David A Patterson, John L. Hennessy (2017), Computer Architecture: A Quantitative
Approach , 6th Edition, Morgan Kaufmann
72
BT-CS-ES403| SOFTWARE ENGINEERING
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Fundamentals of computer science
Objectives:
Understand that software development cannot be done randomly and must adhere to a structured,
methodical approach in order to be completed on time and within the allocated budget.And learn various
techniques used for software project management, software estimation and software testing.
Course Outcomes:

CO1: Translate end-user requirements into system and software requirements, using e.g. UML, and
structure the requirements in a Software Requirements Document (SRD).
CO2: Identify and apply appropriate software architectures and patterns to carry out high level design
system and be able to critically compare alternative choices.
CO3: Analyse software feasibility.
CO4: Build software design patterns to solve design issues
CO5: Develop a simple testing report for experiencing the testing problems.
Syllabus:
Unit 1:
Introduction: Importance of software engineering as a discipline, Role of Software Engineer, Software
Components, Software Characteristics, Software Crisis, Software Engineering Processes, Similarity and
Differences from Conventional Engineering Processes.
Software Development Life Cycle (SDLC)
Models: Water Fall Model, Evolutionary process models, Throwaway prototyping and Exploratory
development like incremental development, Concurrent development and spiral model.
Requirements Engineering: What is a Requirement, types of Requirements: Functional, Non functional,
Domain, Volatile and enduring requirements, Requirement elicitation techniques, Requirements change
management, SRS , Quality of good SRS, Writing an SRS
[No. Of Hours: 11]
73
Unit 2:
Software Design: Basic Concept of Software Design, Architectural Design, Low Level Design:
Modularization, Design Structure Charts, Pseudo Codes, Flow Charts, Data Flow Diagrams, Entity
Relationship Diagrams, Coupling and Cohesion Measures, Design Strategies: Top-Down and Bottom-Up
Design.
Software Measurement and Metrics: Various Size Oriented Measures: LOC, Token Count, Halestead’s
Software Science, Function Point (FP) Based Measures, Estimation for Software projects: COCOMO Model.
[No. Of Hours: 11]
Unit 3:
Overview of different testing techniques: levels of testing, Functional testing: Boundary value analysis,
Equivalence class testing, Decision table testing, Cause effect graphing, Structural testing: Path testing,
Data flow and mutation testing, Cyclomatic Complexity Measures: Control Flow Graphs, Verification and
validation, Unit, Integration Testing, Top down and bottom up integration testing, Alpha, Beta and acceptance
testing , System testing and debugging.
[No. Of Hours: 11]
Unit 4:
Software Maintenance: Software as an Evolutionary Entity, Need for Maintenance, Categories of
Maintenance: Preventive, Corrective and Perfective Maintenance, Cost of Maintenance, Configuration
Management, Software Re-Engineering, Reverse Engineering, Risk management, Agile Methodology.
Software Reliability and Quality Assurance: Reliability issues, Reliability metrics, reliability growth modeling,
measurement and prediction of software reliability, Software quality, Software Quality Frameworks, ISO
9000 Models, SEI-CMM Model
[No. Of Hours: 11]
1. Development of problem statement.
2. Prepare a SRS document in line with the IEEE recommended standards.
3. Draw the use case diagram and specify the role of each of the actors. Also state the precondition, post
condition and function of each use case.
4. To perform the function oriented diagram: Data Flow Diagram (DFD) and Structured chart
5. To perform the user‟s view analysis for the suggested system: Use case diagram.
6. To draw the structural view diagram for the system: Class diagram, object diagram.
7. To draw the behavioral view diagram : State-chart diagram, Activity diagram
8. To perform the behavioral view diagram for the suggested system : Sequence diagram,Collaboration
diagram.
9. To perform the implementation view diagram: Component diagram for the system.
10. To perform the environmental view diagram: Deployment diagram for the system.
11. 10. To perform various testing using the testing tool unit testing, integration testing for a sample code of
the suggested system.
12. To Prepare time line chart/Gantt Chart/PERT Chart for selected software project.
74
Sample Projects:
1. Passport automation System
2. Book Bank
3. Online Exam Registration
4. Stock Maintenance System
5. Online course reservation system
6. E-ticketing
7. Software Personnel Management System
8. Credit Card Processing
9. E-book management System.
10. Recruitment system
Note:
(1) Based on latest trends and technology, experiments may be added by Course
Instructor/Supervisor/Faculty.
(2) A minimum of 08 or more practical must be done.
Required Readings:
Textbooks:
TB1:Roger S. Pressman (2014). Software Engineering, A practitioner’s Approach. (8 edition) Mc Graw
Hill .
TB2: Sommerville (2014). Software Engineering. Addison Wesley.
TB3: K. K. Aggarwal and Yogesh Singh (2008). Software Engineering. New Age International Publishers.
Reference Text Books:

RB 1: Rajib Mall (2018). Fundamentals of Software Engineering. PHI Publication.
RB2: James F. Peters and Witold Pedryez (2007).Software Engineering – An Engineering Approach.
John Wiley and Sons Publisher.
RB3: Grady Booch, James Rambaugh, Ivar Jacobson (2001). The unified modeling language user
guide.Pearson Education
75
BT-CS-ES404| THEORY OF AUTOMATA AND FORMAL LANGUAGES
Teaching Scheme
L T P Credit
3 1 0 4
Pre-requisites:
Knowledge on basic mathematics for B.Tech. students.
Objectives:
The objective of the paper is to facilitate the student with the basics of Formal Language and Automata that
are required for a Computer Science & Engineering student.
Course Outcomes:

CO1: Acquire a full understanding and mentality of Automata Theory as the basis of all computer
science.
CO2: Understanding of the Automata theory concepts such as RE's, DFA's, NFA's,Turing machines,
Grammar, halting problem, computability and complexity.
CO3: Design FAs, NFAs, Grammars, languages modelling, small compilers.
CO4: Solve the problems using formal language.
CO5: Develop a view on the importance of computational theory.
Syllabus:
Unit 1: Introduction to Formal Languages

Basic Concepts of: Languages, Grammars and Automata, DFA, NFA, Equivalence of DFA & NFA, Reduction
of States in Finite Automata.
[No. Of Hours: 10]
Unit 2: Regular Languages & Regular Grammars
Regular Expressions, Connection between Regular Expression & Regular Languages, Regular Grammars,
Properties of Regular Languages, Identifying Nonregular Languages using Pumping Lemma.
[No. Of Hours: 11]
Unit 3: Context-Free Languages (CFL)
Context-Free Grammars: Leftmost & Rightmost Derivatives, Derivation Tree, Relation between Sentential
Forms and Derivation Trees.
Simplification of Context Free Grammars & Normal Forms: Methods of Transforming Grammars – Removing
Useless Production, λ-Productions and Unit Productions, Normal Forms – Chomsky & Greibach,
Pushdown Automata (PDA): Definition, Nondeterministic Pushdown Automata (NPDA), PDA for CFL.
Properties of CFL: Closure Properties, Pumping Lemma for CFL.
[No. Of Hours: 12]
Unit 4: Turing Machine (TM) & Hierarchy of Formal Languages and Automata
Standard TM, TM as Language Accepter, TM as Transducers, Turing Thesis, Universal TM, Linear Bounded
Automata
76
Hierarchy of Formal Languages: Recursive & Recursively Enumerable Languages, Unrestricted Grammar,
Context-Sensitive Grammar, Chomsky Hierarchy.
[No. Of Hours: 10]
Required Readings:
Textbooks:
TB 1: Hopcroft (2008), Automata Theory Language and Computation, 3rd Edition, Pearsons Education
TB 2: An Introduction to Formal Languages and Automata, 6th Edition, Peter Linz, Jones & Bratlet
Learning.
Reference Books:
RB 1: Introduction to Formal Languages, Automata Theory and Computation, Krithivasan Kamala,
Pearson Education India
RB2: Theory of Computer Science: Automata, Languages and Computation, K.L.P. Mishra, N.
Chandrasekaran, 3rd Edition, Prentice Hall India Learning Private Limited
77
BT-EC-ES411| COMMUNICATION SYSTEMS
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Probability and Fourier analysis
Course Objectives:
This course enables the students to understand, design as well as conduct experiments on the key modules
of analog and digital communication systems
Course Outcomes:

CO1: Apply the basic knowledge of signals and systems and understand the concept of Linear and non-
linear modulation
CO2: Summarize the basic principle of AM and FM receiver
CO3: Evaluate basic concepts of pulse analog modulation and Illustrate basics of DC block set
CO4: Evaluate the performance of digital modulation technique in the presence of noise.
CO5: Summarize the basic concepts of analog and digital communication and apply them to solve
practical problems/research problems
Syllabus:
UNIT I Linear Modulation

Basic blocks of communication system, classification, need of modulation, Fundamentals of signal
transmission. Spectrum, Mathematical expression, Modulation and demodulation of: DSB-SC, DSB-FC,
SSB & VSB.
[No. of Hours: 10]
UNIT II Angle Modulation & Receiver
Instantaneous frequency; phase and frequency modulation. Spectrum, BW and power of angle modulated
signal. NBFM and WBFM. Generation and demodulation of FM waves. Comparison of AM, FM & PM. super
heterodyne receivers, image signal rejection, Internal and external noise wrt Receiver
[No. of Hours: 12]
UNIT III Introduction to Digital Communication

Introduction to Digital Communication System: Why Digital? Spectra, Generation and Demodulation of PAM,
PWM, PPM. TDM System, Uniform and Non-uniform Quantization and Companding Concept and Analysis
of PCM, DM and ADM modulators and demodulators, noise in PCM and DM systems. SNR of PCM.
Requirements of a line encoding format, line encoding formats- Unipolar, Polar, Bipolar, Properties of Line
codes. ISI
[No. of Hours: 14]
UNIT IV Digital modulation schemes
78
Digital transmission through career modulation: Amplitude, Frequency and phase shift keying, differential
phase shift keying, CPFSK, MSK OPSK and QAM modulation & detection, probability of error calculation,
Matched Filter
[No. of Hours: 12]
The following practical’s are supposed to be performed on MATLAB/SIMULINK/ LabVIEW/(Open Source
platform: Octave/Scilab)/Trainer Kit as per the discretion of Course instructor
1. Generation and detection of DSB-SC

2. Generation and detection of DSB-FC
3. Generation and detection of SSB
4. Generation and detection of FM
5. Generation and detection of PM
6. Generation of Noise
7. To study classification of communication systems.
8. To understand sampling and reconstruction of a sinusoid signal
9. To observe the impact of AWGN signal on sinusoid.
10. Generation of unipolar line codes for a given sequence
11. Generation of polar line codes for a given sequence
12. Generation of bipolar line codes for a given sequence
13. Generation and detection of PWM
14. Generation and detection of PAM
15. Generation and detection of PPM
16. Generation and detection of PCM
17. Generation and detection of Delta Modulation
18. Generation and detection of Adaptive Delta Modulation
19. Generation and detection of ASK
20. Generation and detection of FSK
21. Generation and detection of PSK
22. Generation and detection of QPSK
23. To understand TDM.
24. To understand quantization.
25. To understand pulse shaping
26. To design matched filter
Note:
Atleast Six Practical should be performed from aforementioned list
Based on latest trends and technology, two experiments may be added from Course
Instructor/Supervisor/Faculty
A minimum of 08 or more practical’s must be done in a way that atleast one practical from each unit of
syllabus is covered on every platform
Text Book
TB1: Carlson, A. B., & Crilly, P. B. (2010). Communication systems: An introduction to signals and noise
REFERENCES:
in electrical communication (5th ed.). McGraw-Hill Higher Education.
TB2: Lathi, B. P., & Ding, Z. (2018). Modern digital and analog communication systems.
Reference Book
RB1: Taub, H., Schilling, D. L., & Saha, G. (2013). Principles of communication systems. MGH
REFERENCES:
RB2: Sklar, B. (2016). Digital communications: Fundamentals and applications.
REFERENCES:
RB3: Haykin, S. S. (1983). Communication systems. John Wiley & Sons.
RB4: Singh, R. P., & Sapre, S. D. (2007). Communication systems. TMH.
79
RB5: Shanmugam. (2006). Digital and analog communication systems. John Wiley & Sons.
RB6: Ziemer, R. E., & Peterson, R. L. (2001). Introduction to digital communication. PHI
RB7: Proakis, J. G., & Salehi, M. (2007). Fundamentals of communication systems. Pearson Education
India.
RB8: Proakis, J. G., & Salehi, M. (2008). Digital communications. McGraw Hill
80
BT-CS-PE401| COMPILER DESIGN
Teaching Scheme
L T P Credit
3 0 0 3
Pre-requisites:
The prerequisites for this course are Theory of Computation, Data Structures and Computer Organization.
It is assumed that you know how to program in C, and have some familiarity with regular expressions,
grammars, and assembly language.
Objectives:
The purpose of this course is to learn how to transform programs written in common user-level programming
languages into code that can be executed by the processor.
Course Outcomes:

CO1: Write lexers and parsers for any programming language, processing program text into an
internal compiler representation.
CO2: Use LEX and YACC to automatically generate lexers and parsers based on a grammar analyse
different representations of intermediate code.
CO3: Implement type checking as a pass over the tree representation of program code.
CO4: Translate the internal representation of program code into executable assembly.
CO5:Analyze and transform programs to improve their time and memory efficiency.
Syllabus:
Unit 1:
Introduction to Compiler, Phases and passes, Bootstrapping, Finite 8 state machines and regular
expressions and their applications to lexical analysis, Optimization of DFA-Based Pattern Matchers,
implementation of lexical analysers, lexical-analyser generator, LEX compiler, Formal grammars and their
application to syntax analysis notation, ambiguity, YACC. The syntactic specification of programming
languages: Context free grammars, derivation and parse trees, capabilities of CFG .
[No. Of Hours: 08]

Unit 2:
Basic Parsing Techniques: Parsers, Shift reduce parsing, operator precedence parsing, top down parsing,
predictive parsers Automatic Construction of efficient Parsers: LR parsers, the canonical Collection of LR(0)
items, constructing SLR parsing tables, constructing Canonical LR parsing tables, Constructing LALR
parsing tables, using ambiguous grammars, an automatic parser generator, implementation of LR parsing
tables.
[No. Of Hours: 10]

Unit 3:
Syntax-directed Translation: Syntax-directed Translation schemes, Implementation of Syntax-directed
Translators, Intermediate code, postfix notation, Parse trees & syntax trees, three address code, quadruple
& triples, translation of assignment statements, Boolean expressions, statements that alter the flow of
control, postfix translation, translation with a top down parser. More about translation: Array references in
arithmetic expressions, procedures call, declarations and case statements.
[No. Of Hours:10]
Unit 4:
81
Symbol Tables: Data structure for symbols tables, representing scope information. Run-Time Administration:
Implementation of simple stack allocation scheme, storage allocation in block structured language. Error
Detection & Recovery: Lexical Phase errors, syntactic phase errors semantic errors. Code Generation:
Design Issues, the Target Language. Addresses in the Target Code, Basic Blocks and Flow Graphs,
Optimization of Basic Blocks, Code Generator.
Code optimization: Machine-Independent Optimizations, Loop optimization, DAG representation of basic
blocks, value numbers and algebraic laws, Global Data-Flow analysis.
[No. Of Hours:12]
Required Readings:
Text Book:
TB1: Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman (2007), Compilers Principles, Techniques and
Tools, 2nd edition, Pearson Education, New Delhi, India.
Reference Books:
RB1: Alfred V. Aho, Jeffrey D. Ullman (2001), Principles of compiler design, Indian student edition,
Pearson Education, New Delhi, India.
RB2: Kenneth C. Louden (1997), Compiler Construction– Principles and Practice, 1st edition, PWS
Publishing.
RB3: K. L. P Mishra, N. Chandrashekaran (2003), Theory of computer science- Automata Languages
and computation, 2nd edition, Prentice Hall of India, New Delhi, India.
RB4: Andrew W. Appel (2004), Modern Compiler Implementation C, Cambridge University Press, UK.
82
BT-CS-PE402| COMPUTER GRAPHICS
Teaching Scheme
L T P Credit
3 0 0 3
Pre-requisites:
Fundamentals of Computer Hardware, Data Structures, Algorithm Design, and Programming Languages.
Objectives:
The objective of this course is to understand the basics of Computer Graphics including how to define
objects, the practical applications of 2D and 3D graphics, projections, transformation, lighting, and shading
models.
Course Outcomes:

CO1: Understand the concept of graphics primitives such as lines and circles based on different
algorithms.
CO2: Implement various graphics algorithms and devise the 2D/3D computer animation.
CO3: Apply the 2D graphics transformations, composite transformation, and Clipping concepts.
CO4: Design and develop 3D objects by comprehending the complexities of illumination in virtual
scenes.
CO5: Perform the concept of projections, curves, and hidden surfaces in real life.
Syllabus:
Unit 1:
Types of computer graphics, Graphic Displays- Random scan displays, Raster scan displays, Components
of Interactive Computer Graphics System, Applications areas, Overview of Input devices, Output devices,
Frame buffer, and video controller.
Points and lines, Line drawing algorithms: DDA and Bresenham’s Line Drawing Algorithms, Circle drawing
algorithms: Bresenham’s and Mid-Point Circle Drawing Algorithms, and parallel versions of these algorithms.
[No of Hours: 10]
Unit 2:
Transformations: Basic 2D transformation (Translation, Scaling, Rotation), Matrix representations, 3D
Transformations, Homogenous coordinate system for 2D and 3D transformations, Composite transformation
matrices, Co-ordinate transform, Other Transformations: Reflections, and shearing, Instance transformation.
Projections: Parallel Projection, Perspective Projection, Types of Parallel and Perspective projection,
Perspective anomalies.
[No of Hours: 12]
Unit 3:
Windowing and Clipping: Viewing pipeline, Viewing transformations, Window-to-Viewport Coordinate
Transformation, 2-D Clipping algorithms, Point clipping.
Line clipping algorithms: Cohen Sutherland line clipping algorithm, Midpoint line clipping algorithm, Liang-
Barsky algorithm line clipping algorithm, Line clipping against non-rectangular clip windows; Polygon
clipping: Sutherland Hodgeman polygon clipping; Curve clipping, Text clipping, Exterior clipping.
[No of Hours: 10]

Unit 4:
Curves and Surfaces: Quadric surfaces, Spheres, Ellipsoid, Blobby objects, Introductory concepts of Spline,
Bspline and Bezier curves and surfaces.
Hidden Lines and Surfaces: Visible surface detection, Back Face Detection algorithm, Depth buffer method
(Z-Buffer, A- Buffer), Scan line method.
83
Illumination models– Ambient light, Diffuse reflection, Specular reflection, Phong model, Combined
approach, Intensity Attenuation, Color consideration, Transparency, and Shadows. Reflection Vector.
Shading Model – Flat shading, Gouraud shading, and Phong Shading model.
[No of Hours: 12]
Required Readings:
Textbooks:
TB1: Hearn, D., & Baker, M. P. Computer Graphics C Version. Pearson Education.
TB2: Foley, J. D., Feiner, S. K., Hughes J. F., Feiner & Vandam, A. Mcguire, M., Sklar, D. F., & Akeley,
K. Computer Graphics Principles and Practice. (3rd ed.). Pearson Education.
TB3: Xiang, Z., & Plastock, R. Schaum’s Outline: Computer Graphics. McGraw-Hill Education.
Reference Books:
RB1: Rogers,D. F. Procedural Elements of Computer Graphics. McGraw Hill.
RB2: Newman, W. M., & Sproull, R. F. Principles of Interactive Computer Graphics. McGraw Hill.
RB3: Sinha, A. N., & Udai, A. D. Computer Graphics. McGraw Hill.
84
BT-CS-PE403| MULTIMEDIA TECHNOLOGIES
Teaching Scheme
L T P Credit
3 0 0 3
Pre-requisites:
Knowledge of basics File System for B.Tech. students.
Objectives:
The objective of the paper is to facilitate the student with the basic of Multi Media System.
Course Outcomes:

CO1: Explain the Concepts, Architecture of multimedia system.
CO2: Use and classify the compression and decompression techniques in video/images
CO3: Describe the file system of multimedia system.
CO4: Examine the Input and Output operation of the Multimedia system.
CO5: Organize the Multimedia system.
Syllabus:
Unit 1:
Multimedia Elements, Multimedia Applications, Multimedia System Architecture, Evolving Technologies for
Multimedia Systems, Defining Objects for Multimedia System, Multimedia Data Interface Standards, Need
of Data Compression, Multimedia Databases.
[No. Of Hours: 08]
Unit 2:
Compression and Decompression- Types of Compression, Binary Image Compression Schemes, Color,
Gray Scale and Still- Video Image Compression, Video Image Compression, Audio Compression, Fractal
Compression
[No. Of Hours: 09]
Unit 3:
Data and File Format Standards- Rich Text Format, TIFF File Format, Resource Interchange File Format
(RIFF), MIDI File Format, JPEG DIB File Format for Still and Motion Images, AVI Indeo File Format,
MPEG Standards, TWAIN
[No. Of Hours:08]
Unit 4:
Multimedia Input/ Output Technologies- Key Technology Issues, Pen Input, Video and Image System, Print
Output Technologies, Image Scanner, Digital Voice and Audio, Digital Camera, Video Images and
Animation, Full-Motion Video
[No. Of Hours: 09]
Required Readings:
Textbooks:
TB1: Andleigh, K., P., Thakrar, K., (2019) Multimedia System Design , Pearson.
TB2: Steinmetz, R., Nahrstedt, K., (2021) Multimedia: Computing, Communications and Applications,
Pearson Education Asia
Reference Books:
85
RB1:Halshall, F., (2009) Multimedia Communications, Applications, Networks, Protocols and Standards,
Pearson Education Asia
RB2:Koegel, B., John, F., (1995) Multimedia Systems, Pearson Education Asia
86
BT-CS-PE404| GRAPH THEORY
Teaching Scheme
L T P Credit
3 0 0 3
Pre-requisites:
Knowledge of basic set theory for B.Tech. students.
Objectives:
The objective of the course is to make students familiar with the basic graph theory concepts
and their applications in Computer Science.
Course Outcomes:

CO1: Demonstrate some of the most important notions and types of graph theory and
develop their skill in solving basic exercises
CO2: Interpret the fundamentals of graphs and trees and to relate them with the use in
computer science applications
CO3: Explore a graph with the help of matrices and to find a minimal spanning tree for a
given weighted graph.
CO4: Apply graph-theoretic algorithms and methods used in computer science.
CO5: Develop efficient graph-theoretic algorithms (mathematically)explore the applications
of coloring problem of graph theory
Syllabus:
Unit 1: Introduction
Graph Terminologies - Types of Graphs - Sub Graph- Multi Graph - Regular Graph - Isomorphism - Isomorphic
Graphs - Sub-graph - Euler graph - Hamiltonian Graph - Related Theorems, adjacency matrices, Connected
graphs and complement of a graph problem, Definitions: Walks, trail, path, cycles and circuits, traveling
salesman problem, trees, spanning trees, cut sets, Connectivity and Separability, Network Flows.
[No. Of Hours: 08]

Unit 2: Trees
Definitions: Trees, Spanning trees, Some Properties of trees(no proof). Rooted and binary tree. Finding all the
spanning trees of a graph and Spanning trees in a weighted graph. Traversal of Binary Tree, Pre-order and
Post- order Traversal. Prefix codes, optimal tree. Cut – sets. Cut – sets in a graph. Fundamental Circuits and
Cut – sets, Network Flows. Max- flow Mincut Theorem (Statement only) and problems.
[No. Of Hours: 09]
87
Unit 3: Planar, Dual Graphs and Matrix representation of Graphs
Planar Graphs. Kuratowski’s graphs. Different representation of planar graph. Detection of planar graphs.
Euler’s polyhedral formula (No proof). Geometrical Dual( no theorems) problems. Adjacency matrix,
Incidence matrix, Sub-matrices of Incidence matrix, Circuit matrix, Fundamental circuit matrix and rank of
Circuit matrix. Cut – set matrix. All matrices with both undirected and directed graphs. Problems on Network.
[No. Of Hours: 11]
Unit 4: Coloring and Dominating sets
Definition of Chromatic number. Chromatic Partitioning. Chromatic Polynomial. Finding Chromatic
polynomial by Decomposition Theorem and by Multiplication Theorem (without Proofs).Dominating set.
Minimal Dominating set. Domination number. Independent dominating set. Finding minimal dominating sets.
Graph theory applications.
[No. of Hours: 10]
Required Readings:
Textbooks:
TB1: Douglas West (2015).Introduction to Graph Theory, , 2nd Edition, Pearson.

TB2: N. Deo(1979). Graph theory with applications to engineering and computer science, , PHI, India.
TB3: Ralph P. Grimaldi (2006).Discrete and Combinatorial Mathematics. 5th Edition , Pearson.
Reference Books:
RB1: Geir Agnarsson and Raymond Greenlaw(2009) .Graph Theory, Modeling, Applications and
Algorithms , 1st Edition, Pearson Education, Inc, New Delhi .
RB2: John Clark and Holton D.A (2001). A First Look at Graph Theory ,Allied Publishers.
88
BT-CS-PE405| SYSTEM SOFTWARES
Teaching Scheme
L T P Credit
3 0 0 3
Pre-requisites:
A basic understanding of fundamentals of computer
Objectives:
To have an understanding of the foundations of the design of assemblers, loaders, linkers, and macro
processors.
Course Outcomes:

CO1: Understand the relationship between system software and machine architecture.
CO2: Design and implementation of assemblers
CO3: Design and implementation of linkers and loaders
CO4: Understand the working of macroprocessors.
CO5: Have an understanding of system software tools
Syllabus:
Unit 1:
System software and machine architecture, The Simplified Instructional Computer (SIC), Machine
architecture, Data and instruction formats, addressing modes, instruction sets, I/O and programming.
Language Processors: Fundamental of language processing, Symbol tables, Data structures for Language
processing.
[No. Of Hours: 10]
Unit 2:
Assemblers: Basic assembler functions, A simple SIC assembler, Assembler algorithm, and data structures,
Machine dependent assembler features, Instruction formats and addressing modes, Program relocation,
Machine independent assembler features, Literals, Symbol-defining statements, Expressions, One pass
assemblers and Multi pass assemblers, Implementation example - MASM assembler.
[No. Of Hours: 10]
Unit 3:
Loaders and Linkers: Basic loader functions, Design of an Absolute Loader, A Simple Bootstrap Loader,
Machine dependent loader features, Relocation, Program Linking, Algorithm and Data Structures for Linking
Loader, Machine-independent loader features, Automatic Library Search, Loader Options, Loader design
options, Linkage Editors, Dynamic Linking, Bootstrap Loaders, Implementation example - MSDOS linker.
[No. Of Hours: 11]

Unit 4:
Macro Processors: Basic macro processor functions, Macro Definition and Expansion, Macro Processor
Algorithm and data structures, Machine-independent macro processor features, Concatenation of Macro
Parameters, Generation of Unique Labels, Conditional Macro Expansion, Keyword Macro Parameters,
89
Macro within Macro, Implementation example - MASM Macro Processor, ANSI C Macro
language.Debuggers: Types of errors, Debugging procedure, Classification of Debuggers, Interactive
debugging systems.
[No. Of Hours: 11]
Required Readings:
Textbooks:
TB1: Beck, L. L. (2000). System Software – An Introduction to Systems Programming. (3rd ed). Pearson
Education Asia.
Reference Books:
RB1: Dhamdhere, D. M. (1999). Systems Programming and Operating Systems. (2nd ed.). Tata McGraw-
Hill.
RB2: Donovan, J. J. Systems Programming. Tata McGraw-Hill Edition.
90
BT-CS-PE406| PRINCIPLES OF PROGRAMMING LANGUAGES
Teaching Scheme
L T P Credit
3 0 0 3
Pre-requisites:
Basics of programming.
Objectives:
To provide the understanding of the concept of the various paradigm and their components developed to
solve variety of problem using computer programming.
Course Outcomes:

CO1: Define the semantics and syntax of a programming language.
CO2: Understand the salient features in the landscape of programming languages.
CO3: Apply propositions-as-types principle in language design and program verification.
CO4: Ensure compiler correctness using static and dynamic semantics of languages that compiles
with the definitions.
CO5: Solve problems using a range of programming paradigms and assess the effectiveness of each
paradigm for a particular problem.
Syllabus:
Unit 1:
Introduction: Syntax, semantics and pragmatics; Formal translation models, Variables, Expressions &
Statements, Binding time spectrum; Variables and expressions; Assignment; I-values and r-values;
Environments and stores; Storage allocation; Constants and initialization; Statement-level control structure.
[No. Of Hours: 10]
Unit 2:
Primitive Types: Pointers; Structured types; Coercion; Notion of type equivalence;
Polymorphism: overloading, inheritance, type parameterization, Abstract data types; Information hiding and
abstraction; Visibility, Procedures, Modules, Classes, Packages, Objects and Object-Oriented Programming.
[No. Of Hours: 10]
Unit3:
Storage Management: Static and dynamic, stack-based, and heap-based storage management.
Sequence Control: Implicit and explicit sequencing with arithmetic and non-arithmetic expressions;
Sequence control between statements.
Subprogram Control: Subprogram sequence control, data control and referencing environments;
parameter passing; static and dynamic scope; block structure.
[No. Of Hours: 11]

Unit 4:
Concurrent Programming: Concepts, Communication, Deadlocks, Semaphores, Monitors, Threads,
Synchronization.
Logic programming: Introduction; Rules, Structured Data and Scope of the variables; Operators and
Functions; Recursion and recursive rules; Lists, Input and Output; Program control; Logic Program design.
[No. Of Hours: 11]
91
Required Readings:
Text Books:
TB1: Pratt T.V. ,Programming Languages. Pearson Ed
TB2: Chen Y., Tsai W-T. (Kendall ).Introduction to Programming Languages: Programming in C, C++,
Scheme, Prolog, C# and SOA
TB3: Pratt T.W., Zelkowski M.V. Programming Languages: Design & Implementation – (PHI).
TB4: Adesh K Pandey .Programming Languages, , Narosa Publishing House
References:
RB1: Louden K.C..Programming Languages: Principles and Practice ,Addision-Wesley.
RB2: Grover P.S. Programming languages .S. Chand.
RB3: Tucker A., Noonan R.Programming Languages: Principles and Paradigms .TMH
SEMESTER V
92
SEMESTER V
93
Credit scheme
Semester V
S Hours/week Total
1. BT-CS-ES501 Java Programming 3 0 2 5 4
2. BT-CS-ES502 Operating Systems 3 1 2 6 5
Analysis and Design of

3. BT-CS-ES503 3 1 2 6 5
Algorithms
Microprocessors and
4. BT-EC-ES511 3 1 2 6 5
Microcontrollers
Program Elective-II
5. BT-CS-PE5XX 3 0 2 5 4
6. BT-SI501 Industrial/Summer Training# 0 0 0 0 1
Essence of Indian Traditional

7. BT-AU501 1 0 0 1 0
Knowledge*
Total 16 3 10 29 24
94
BT-CS-ES501|JAVA PROGRAMMING
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Knowledge of basic programming.
Objectives:
The objective of this course is to introduce basic concepts of object oriented and platform independent
programming language and to demonstrate skills in writing programs using concepts like exception handling
techniques and multithreading.
Course Outcomes:

CO1: Apply object-oriented programming concepts.
CO2: Understand syntax and semantics of java programming language.
CO3: Use packages, multithreading, exception handling to solve the problems.
CO4: Acquire the knowledge of database connectivity, web applications using java.
CO5: Design event driven GUI and web related applications which mimic the real word scenario.
Syllabus:
Unit 1:
Introduction: Overview and characteristics of Java, Java program Compilation and Execution Process,
Organization of the Java Virtual Machine, Security Promises of the JVM.
Java Language Fundamentals: Data Types & Literals Variables, dynamic initialization, scope and life time,
Wrapper Classes, Arithmetic Operators, Logical Operators, Control of Flow.
Classes and Objects: Concepts, methods, constructors, usage of static, access control, this key word,
garbage collection, method overloading, parameter passing mechanisms, nested classes and inner classes.
[No. Of Hours: 11]
Unit 2:
Inheritance: Basic concepts, access specifiers, usage of super key word, method overriding, final methods
and classes, abstract classes, dynamic method dispatch, Object class.
Interfaces: Differences between classes and interfaces, defining an interface, implementing interface,
variables in interface and extending interfaces.
Packages: Creating a Package, setting CLASSPATH, Access control protection, importing packages.
[No. Of Hours: 11]
Unit 3:
Exception Handling: Concepts of Exception handling, types of exceptions, usage of try, catch, throw,
throws and finally keywords, Built-in exceptions, creating own exception sub classes.
Strings And Arrays: Exploring the String class, String buffer class, Command-line arguments. Arrays in
Java.
Multithreading: Concepts of Multithreading, differences between process and thread, thread life cycle,
Thread class, Runnable interface, creating multiple threads, Synchronization, thread priorities, inter thread
communication, daemon threads, deadlocks.
95
I/O Streams: Streams, Byte streams, Character streams, File class, Filestreams.
[No. Of Hours: 12]
Unit 4:
Applets: Concepts of Applets, life cycle of an applet, creating applets, passing parameters to applets,
accessing remote applet, Color class and Graphics
Event Handling: Events, Event sources, Event classes, Event Listeners, Delegation event model, handling
events.
AWT: AWT Components, windows, canvas, panel, File Dialog boxes, Layout Managers, Event handling
model of AWT, Adapter classes, Menu, Menu bar.
JDBC: Database connectivity with MS-Access, Oracle, MS-SQL Server,The connectivity models.
[No. Of Hours: 11]
Practical/Laboratory Contents :
Lab Assignment-1 (Basic Java Programming )

1. WAP to find factorial of a given number
2. WAP to print Fibbonacci series for a given number
3. WAP to print grades for given input percentage from command line using nested if-else.
4. WAP to find maximum of three numbers.
5. WAP to check whether a number is prime.
6. WAP to print first n prime nymbers
7. WAP to print series of prime numbers upto n.
8. WAP to print reverse of digits of a given number (for example 123 becomes 321)
9. WAP to find whether a given char is vowel using switch case.
10. WAP to print
1
1 2 1
1 2 3 2 1
Lab Assignment-2 (Classes )
1. WAP to create a Simple Box class that defines three instance variables width, height and depth.
Add a method “void volume ()” to compute volume of box. Create two instances and compute their
volume.
2. Rewrite program 1 to modify volume method containing return statement.
3. Create a class to compute area of square, rectangle and triangle (use method overloading
concept)
4. Add constructor to your box class
5. Show constructor overloading using Box class.
6. Write a program to show use of this keyword.
7. Write a class arithmetic for calculation of addition, subtraction, multiplication and division of two
numbers.
8. WAP to demonstrate call by value and call by reference.
9. Write a program to show use of static members and static block.
Lab Assignment-3 (Inheritance and polymorphism)
1. create a base class shape. It contains 2 methods get() and print () to accept and display
parameters of shape respectively. Create a subclass Rectangle. It contains a method to
display length and breadth of rectangle (Method overrifing)
2. Use Box class. Create a subclass ColoredBox with one parameter String color. Override print
method of Box class.
3. Write a program to show Dynamic method dispatch concept
4. WAP to implement stack using arrays in java
96
5. Write an abtract class Employee with three variables name, sal and Grosssal , suitable
constructors, print method and two abstract methods calculategrosssalary() and
annualincrement(). Create a manager sub class of employee with Hra as member variable
and write implimentation of the abstract method. Also create a subclass of manager as sales
manger with commision as member variable and override the calulategrosssalary() method.
6. Write a program to show the use of Interfaces (show multipe inheritence as discussed in class)
Lab Assignement-4 (Exception Handling)
1. Demonstrate Exception handling using single try catch block
2. Show use of multiple catch block
3. Show use of finally block
4. Write a program to show use of throw and trhows keyword. Create your own exception class
AgeException. Also create two subclassess TooYoungException and InvalidAgeException of
AgeExcep-tion as discussed in class.
Lab Assignment 5 (Packages and Multithreading)
1. Write a program to display the current thread.
2. Write a program to create multiple threads , use Thread class.
3. Write a program to create multiple threads, implementing Runnable Interface.
4. Write a program to create multiple threads by making use of thread priorities.
5. Create a package named as MyPackage with class names as Calculate. The class should
contain three methods with the following specifications:
a. Volume: accepts three double type arguments i.e. width, height, depth. Calculate
volume and return double type value.
b. Add: which accepts two integer type values, adds them and returns the value.
c. Divide:Accepts two integer type values, divides them and returns results.
6. mport package created in previous program into a file named as PackageDemo and call the
above three methods to add, divide and find the volume.
Lab Exercise 6 (Applets ,AWT Controls and Event handling)

1. WAP to create an applet showing different AWT controls like buttons,check box,list box,text
box, choice,scroll bar,labels
2. WAP to demonstrate events to buttons, checkbox,checkbox group, text box, Labels.
3. WAP for key Event Demonstration
4. WAP to show Mouse Evewnts using MouseListeners and MouseMotion Listerners
5. WAP to demonstrate a calculator functioning as addition,multiplication,division and subtraction
using Button and Label controls and Button Events.Program to demonstrate
Lab Exercise 7 (Layouts, Graphics and Menus)
1. WAP to Design an menu driven program which draw different shapes
2. WAP to show use of different layouts
a. Border
b. Card
c. Flow
d. Gridlayout
3. Programs to create and display an image
6. Program to demonstrate menu containing a list of movie channels, a list of car names and a
list of prices of different books.(Movie Chanels Car names books)
7. Program to draw rectangle,line,polygon,circle,ellipse,arc also fill them with colour.
8. Program for copying contents of one file into another file.
Lab Exercise 8 (I.O. & JDBC)
97
1. Program or console input output.
2. Program to show JDBC connectivity
Note: Students must submit a small group project at the end of semester.
Required Readings:
Textbooks:
TB 1: Schidt, Herbertz (2020). Java Complete Reference, 11/e, McGraw Hills Publication.
Reference Books:
RB 1: Balaguruswamy, E. (2019). Programming with Java , 6/e, McGraw Hill Publication.
RB 2: Horstmann, C. S. (1999). Computing Concepts with Java 2 Essentials. John Willey and Sons
Publication
98
BT-CS-ES502| OPERATING SYSTEMS
Teaching Scheme
L T P Credit
3 1 2 5
Pre-requisites:
Fundamentals of Data structures and Programming language.
Objectives:
Students will understand Operating Systems and their principles. The course will cover theory as well as
practical aspects of the subject through scheduled lectures and labs, course will cover details of processes,
CPU scheduling, memory management, file system, storage subsystem, and input/output management.
Course Outcomes:
CO1: Understand the evolution of OS functionality, structures, and layers.
CO2: Learn about Processes, Threads, and Scheduling algorithms.
CO3: Apply and analyze the communication between inter-process and synchronization techniques
CO4: Implement and compare page replacement algorithms, and memory management schemes.
CO5: Study the working of I/O management and File systems.
Syllabus:
Unit 1:
Introduction: Operating system and functions, Evolution of operating system, Classification of Operating
systems: Batch, Interactive, Time sharing, Multiprocessor Systems, Multiuser Systems, Multiprocess
Systems, Real-Time System, Multithreaded Systems.
Operating System Structure: Layered structure, Monolithic and Microkernel Systems/models.
Process: Process States, Process Transition Diagram, Process Control Block (PCB), Process address
space, Process identification information, Threads, and their management.
[No. Of Hours: 10]
Unit 2:
CPU Scheduling: Scheduling Concepts, Performance Criteria, Preemptive and non-preemptive scheduling,
Schedulers, Types of schedulers-Long term, short term, medium term schedulers; Scheduling Algorithms:
FCFS, SJF, Priority Scheduling, Round Robin, Multilevel Queues scheduling, Multilevel feedback queue
scheduling, Multiprocessor Scheduling, Real-time scheduling.
Inter-process Communication: Principle of Concurrency, Concurrent processes, Race conditions, Critical
Regions, Mutual Exclusion with busy waiting, Sleep & Wakeup, Semaphores, Monitors, Message passing,
Barriers, Classical Problem in Concurrency: Readers / Writers problem, Dining Philosophers Problem,
Producer/ Consumer Problem.
[No. Of Hours: 12]
Unit 3:
99
Memory Management: Basic bare machine, Resident monitor, Memory hierarchy, Multiprogramming with
fixed partitions, Multiprogramming with variable partitions, Protection schemes, Paging, Segmentation,
Paged segmentation.
Virtual memory: Concepts, Hardware support for virtual memory, Demand paging, Performance of demand
paging, Page Faults, Page replacement algorithms, Thrashing, Working set.
Deadlock: System model, Resources, Deadlock characterization, Prevention, Avoidance and Detection,
Recovery from deadlock.
[No. Of Hours: 12]
Unit 4:
I/O Management and Disk Scheduling: I/O devices, and I/O subsystems, I/O buffering; Disk storage, and
disk scheduling, Rotational Optimization, Caching and Buffering.
File System: File concept, File types, Logical File System, Physical File System, File organization, and
access mechanism, Directory structures, File sharing, File system implementation issues, Allocation
methods: Contiguous, Linked, Indexed; Free space Management: Bit vector, Linked list; File system
protection and security.
[No. Of Hours: 10]
1. Study of different operating systems (UNIX, WINDOWS XP/ 7/ 8/10).

2. Write a program to implement CPU scheduling policies:
a. First come first serve
b. SJF
c. Priority
d. Round Robin
3. Write a program to implement contiguous memory allocation techniques:
a. Worst-Fit
b. Best- Fit
c. First- Fit
4. Write a program for page replacement policy using:
a. LRU
b. FIFO
c. Optimal
5. Write a program to calculate the external and internal fragmentation:
a. Free space list of blocks from the system
b. List process files from the system
6. Write a program to implement a resource allocation graph (RAG).
7. Write a program to implement the solutions for Readers-Writers problem using the inter-process
communication technique - Semaphore.
8. Write a program to implement the solution for the Bounded Buffer (producer-consumer) problem
using inter-process communication techniques-Semaphores.
9. Write a program to implement Banker’s algorithm for deadlock avoidance.
10. Write a program to implement the File storage allocation technique:
a. Contiguous(using array)
b. Linked–list (using linked-list)
c. Indirect allocation (indexing)
100
as per the need.
NOTE: - At least 8 Experiments out of the list must be done in the semester.
Required Readings:
Textbooks:
TB1: Silberschatz, A., Galvin, P. B., & Gagne, G. (2018). Operating Systems Concepts. (9th ed.). Wiley.
TB2: Deitel, H. M., Deitel, P. J., & Choffnes, D. R., Operating System. (3rd ed.). Prentice Hall.
TB3: Stallings, W. Operating Systems: Internals and Design Principles. (7th ed.). Pearson Education.
Reference Books:
RB1: Halder, S., & Aravind, A. A. Operating Systems. Pearson Education.
RB2: Dietel, H. M. An Introduction to Operating System. Pearson Education.
RB3: Dhamdhere, D. M. Operating Systems: A Concept based Approach. TMH.
101
BT-CS-ES503| DESIGN AND ANALYSIS OF ALGORITHMS
Teaching Scheme
L T P Credit
3 1 2 5
Pre-requisites:
Knowledge on basic mathematics for B.Tech. students and Data Structure.
Objectives:
The objective of the course is to facilitate the student with the basics of Algorithm Design and it’s analysis
that are required for a Computer Science & Engineering student.
Course Outcomes:

CO1: Establish the relationship between Input and Output of a problem.
CO2: Learn to design an algorithm for simple problems
CO3: Compute the Time Complexity of an Algorithm in various cases (Best, Average, Worst) of the
problem and represent the same in Asymptotic Notations
CO4: Compare and Analyse different algorithms for a problem.
CO5: Learn Basic of P, NP Problems.
Syllabus:
Unit 1: Introduction to Algorithms
Definitions & Terminologies: Problem, Problem Instance, Algorithm. Types of Problems to be solved by
algorithms, Algorithms as Technology, Steps to check correctness of an algorithm, Growth Function.
Recurrence Relation, Methods to solve Recurrence Relation: Substitution, Recurrence Tree, Master Method.
Data Structures for Disjoint Sets, Medians and Order statistics.
[No. Of Hours: 10]
Unit 2: Algorithms Design Technics – I
Incremental Approach with examples such as Insertion Sort, Counting Sort, Radix Sort, Bucket Sort.
Divide-And-Conquer Technique with examples such as Quick Sort, Merge Sort, Binary Search, Strassen’s
Matrix Multiplication.
Backtracking Approach with examples such as 8-Queens Problem, Sum of Subsets, Graph Colouring.
Branch-And-Bound Technique with examples such as: Least Cost Search
[No. Of Hours: 10]
Unit 3: Algorithms Design Technics – II
Dynamic Programming : Ingredients of Dynamic Programming, emphasis on optimal substructure ,

overlapping substructures, memorization with examples such as All Pair Shortest Path, Single Source
Shortest Path, Matrix Chain Multiplication, 0/1 Knapsack.
102
Greedy Approach: Elements of Greedy strategy, overview of local and global optima with examples such as
Fractional Knapsack, Minimum Cost Spanning Tree, Single source shortest path .
Approximation Approach with examples such as Travelling Salesman Problem, Vertex Cover Problem.
[ No. Of Hours: 10]
Unit 4: NP-Completeness & String Matching
NP-Completeness: NP-completeness and the classes P and NP, Reduction, Polynomial Time & its
verification, NP-completeness and Reducibility, NP-completeness Proof, NP-Complete Problem
String Matching : Naïve String Matching Algorithm, Rabin-Karp, String Matching with Finite Automata, Knuth-
Morris-Pratt Algorithm
[No. Of Hours: 10]

1. Implementation and Time analysis of factorial program using iterative and recursive method.
2. Implementation and Time analysis of sorting algorithms.
A) Insertion sort
B) Merge sort
C) Quick sort
D) Radix sort
E) Counting sort
3. Implementation and Time analysis of linear and binary search algorithm.
4. Implementation of a knapsack problem using dynamic programming.
5. Implementation of chain matrix multiplication using dynamic programming.
6. Implementation of 8 queen problem using backtracking algorithm.
7. Implementation of a knapsack problem using greedy algorithm.
8. Implementation of Graph and Searching (DFS and BFS).
9. Implementation of MST using greedy algorithm.
10. Implement kruskal’s algorithm.
11. Implementation of LCS problem using branch and bound algorithm.
12. Implement naïve String Matching algorithm, Rabin Karp algorithm and Knuth Morris Pratt algorithm
and analyse its time complexity
Required Readings:
Textbooks:
 TB 1: Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, “Introduction to Algorithms”,
 Printice Hall of India.
 TB 2: E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms"
Reference Books:
 RB 1: RCT Lee, SS Tseng, RC Chang and YT Tsai (2005). “Introduction to the Design and Analysis of
Algorithms”, Mc Graw Hill.
 RB2: Berman, Paul,” Algorithms”, Cengage Learning
 RB3: Aho, Hopcraft, Ullman(2008). “The Design and Analysis of Computer Algorithms” Pearson
Education
103
BT-EC-ES511| MICROPROCESSORS AND MICROCONTROLLERS
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Basic knowledge of number systems and digital electronics

Objectives:
To understand the operation of microprocessor & microcontroller, to develop assembly language

programming skills and learn about the interfacing of chips with microprocessor/ microcontroller.
Course Outcomes:
At the end of this course, a learner should be able:

CO1: To gain the knowledge of a basic cellular system with various important terms
CO2: To study the various cell-site antennas and mobile antennas
CO3: To study the important modulation techniques and multiple access techniques useful for the
wireless communication
CO4: To understand the various mobile networks from 2G to 3G with introduction to 4G and 5G
CO5: To study the various wireless systems along with a few equalization techniques and advanced
techniques used in wireless communication
Syllabus:
UNIT-1
Introduction: Introduction to Wireless Communication, Examples of Wireless Communication Systems,
Overview of Generation of Cellular Systems.
Cellular System: Cellular Concept, Frequency Reuse, Channel Assignment Strategies, Handoff Strategies,
Interference and system Capacity, Trunking and Grade of Service, Improving Coverage and Capacity, Cell
Splitting and Cell Sectoring.
[No. of Hours: 10]
UNIT-II
Cell-Site Antennas and Mobile Antennas: Equivalent Circuits of Antennas, Gain and pattern relationship,
Antennas at Cell Site, Mobile antennas.
Modulation and Multiple Access Techniques: MSK, GMSK, Spread Spectrum Modulation Techniques:
Direct Sequence Spread Spectrum and Frequency Hopping Spread Spectrum; Multiple Access Techniques:
FDMA, TDMA, SDMA, Cellular CDMA with Power Control.
[No. of Hours: 10]
UNIT-III
2G Networks: GSM: Architecture, Protocols, Interfaces, Logical Channels, Frame Structure, Authentication,
Security; CDMA: Specifications, Introduction to IS-95 and IS-136
3G Mobile Services: UMTS: Architecture, Air interface specifications, Channels, Security; Introduction to
IMT-2000, CDMA-2000 and W-CDMA, Quality of Services in 3G, Introduction to 4G and 5G.
[No. of Hours: 10]
UNIT-IV
Equalization: Basics, Linear Equalization, Non-Linear Equalization, Adaptive Equalization, Diversity
Techniques, Rake Receiver
104
Wireless Systems: Introduction to WLL, Its Architecture and Technologies, Bluetooth, Wi-Max, Introduction
to WLAN.
Advanced Techniques: Introduction to OFDM and MIMO Technologies.
Required Readings:
Textbooks:
TB 1: Rappaport, T. S. (2008). Wireless Communication- Principles and Practices (2nd Ed.). Pearson
Education Pvt. Ltd.
TB 2: Dalal, U. (2016). Wireless and Mobile Communications. Oxford University Press.
TB 3: Lee, W. C. (1990). Mobile cellular telecommunications systems. McGraw-Hill Education.
Reference Books:
RB 1: Lathi, B. P., & Ding, Z. (1998). Modern Analog and Digital Communication Systems. Oxford
University Press.
RB2: Smith, C., & Collins, D. (2002). 3G Wireless Networks. McGraw-Hill Education.
RB3: Singhal, T. L. (2010). Wireless Communication. Tata McGraw Hill.
RB4: Pandya, R. (1999). Mobile and Personal Communication Systems and Services. Wiley
Publications.
105
BT-EC-ES511| MICROPROCESSORS AND MICROCONTROLLERS
Teaching Scheme
L T P Credit
3 1 2 5
Pre-requisites:
Basic knowledge of number systems and digital electronics
Objectives:
To understand the operation of microprocessor & microcontroller, to develop assembly language

programming skills and learn about the interfacing of chips with microprocessor/ microcontroller.
Course Outcomes:
CO1: Design a microprocessor/microcontroller based system as per the application requirement.
CO2: Illustrate how the different peripherals are interfaced with Microprocessor/ Microcontroller.
CO3: Execute programs using assembly language programming.
CO4: Apply knowledge and demonstrate programming proficiency using various addressing
modes
CO5: Understand the fundamentals of Microprocessors/ Microcontrollers
Syllabus:
Unit 1
8085 Microprocessor
Introduction, evolution of microprocessor, applications, system bus, 8085 architecture, pin diagram,
instruction set, addressing modes, timing diagrams, interrupts, assembly language programming
[No. Of Hours: 8]
Unit 2:
8086 Microprocessor
Architecture, pin diagram, minimum and maximum mode, physical address generation, instruction
format, addressing modes, instruction set, interrupts, assembly language programming, memory
interfacing
[No. Of Hours: 10]
Unit 3
Peripheral Interfacing
Interfacing of 8086 with 8255,8253/8254,8251,8259, 8279, Switches, LED’s, Analog to Digital
Converter, Digital To Analog Converter, DC motor, Stepper Motor
[No. Of Hours: 10]
Unit 4
8051 Microcontroller
Difference between microcprocessor and microcontroller, Introduction to Intel 8051 Microcontroller
family, block diagram, pin diagram, memory organization, special function registers, addressing modes,
assembly language programming, Timer/counter programming, interrupts, memory interfacing
[No. Of Hours: 10]
1) To write an assembly language program to add and subtract two 8 bit numbers using 8085.
2) To write an assembly language program to add and subtract two 16 bit numbers using 8086.
3) To write an assembly language program to multiply two 8 bit numbers using 8085.
4) To write an assembly language program to find the larger of two numbers using 8085.
5) To write an assembly language program to find the smallest number from the series of ten numbers
using 8085.
106
6) To write an assembly language program to multiply two 8 bit numbers using bit rotation method in
8085.
7) To write an assembly language program to add two 16 bit numbers using 8086.
8) To write an assembly language program to generate factorial of an 8 bit number using 8086.
9) A data string of ten bytes is located from the starting address 0500. Write an assembly language
program to convert the data string to its equivalent 2’s compliment form and store the result at 0600
onwards locations.
10) To write an assembly language program to generate square wave of 1 KHZ frequency using 8086.
11) To write an assembly language program to interface stepper motor with 8086 and rotate the motor in
clock wise and anti clockwise direction.
12) Write an assembly language program to interface the 8255 with 8086. Read the status of switches
connected at the input and display the status at output LEDs and display of trainer kit.
13) To write an assembly language program to find the sum of five bytes stored at any five RAM locations
of 8051. Store the lower byte of result in register A and higher byte in register R7.
14) To write an assembly language program to generate a square wave of 5 KHz using timer 0 in mode 0.
15) To write an assembly language program to read a hex byte from the keyboard and split it into two
nibbles using 8051.
Required Readings:
Text Books:
1. Gaonkar R.S, (2013), Microprocessor Architecture, Programming and Application with 8085, (6th
edition), Penram International Publishing Pvt. Ltd.
2. Hall D.V.(2005), Microprocessors and Interfacing, Tata McGraw Hill
3. Singh V.,Singh G. ( 2017), Microprocessor and Interfacing, (1st edition), Satya Prakashan.
4. Mazidi M.A, Mazidi J.G, McKinlay R, Das L.B. (2013), Microprocessor and Microcontrollers, (2 nd
edition), Pearson.
Reference Books:
1. Ayala K. (2007), The 8051 Microcontroller (3rd edition), Cengage Learning

2. Brey B. B, (2013), Intel Microprocessors, (8th edition), Pearson New International Edition.
3. Ray A.K, Bhurchandi K.M. (2017), Advanced Microprocessors and Peripherals,(3rd edition), McGraw
Hill Education Private Limited
4. Ram B. (2008), Fundamentals of Microprocessor and Microcontrollers, Dhanpat Rai Publication.
107
BT-CS-PE501| SOFT COMPUTING
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Knowledge on basic Discrete mathematics and Artificial Intelligence for B.Tech. students.
Objectives:
The objective of the paper is to facilitate the student with the basic of Soft Computing that are required for
Artificial Intelligent Enabled Applications design.
Course Outcomes:

CO1: Explain and use the concepts of Artificial Neural Network.
CO2: Recognise and solve the computational problems using degree of truthfulness .
CO3: Translate and implement the computational problems using hybrid system.
CO4: Resolve the computational problems using Evolutionary Techniques.
CO5: Formulate the computational models using soft computing techniques.
Syllabus:
Unit 1:
Problem Solving Technologies, Artificial Neural Network: Introduction, Fundamental Concept, Evolution,
Basic Model, Supervised Learning Network-Perceptron Network, Adaptive Linear Neuron (Adaline),
Multiple Adaptive Linear Neuron, Back-propagation Network. Unsupervised Learning Network:
Introduction, Fixed Weight Competitive Nets-Maxnet, Mexican-Hat, Hamming Network.
[No. Of Hours: 09]

Unit 2:
Fuzzy Logic – Introduction, Classical Sets, Fuzzy Sets, Classical Relations and Fuzzy Relations,
Membership Functions- Features, Fuzzification, Methods- Intuition, Inference, Rank Ordering, Angular
Fuzzy Sets, Defuzzsification - Lambda-Cuts for Fuzzy Sets, Lambda-Cuts for Fuzzy Relation, Defuzzification
Methods
[No. Of Hours: 08]

Unit 3:
Genetic Algorithm – Introduction, Simple Genetic Algorithm operators- Encoding, Selection, Crossover,
Mutation, Stopping Condition, Differential Evolution Algorithm – Process Flow, Operators, Control
Parameters, Schemes.
[No. Of Hours:08]
Unit 4:
Hybrid Systems – Neuro Fuzzy Hybrid System , Neuro Genetic Hybrid System and Fuzzy Genetic Hybrid
System .
Applications: Fusion Approach of Multispectral Images with SAR, Optimization of TSP using GA, GA
Internet Search Technique, Soft Computing Based Hybrid Fuzzy Controllers, Soft Computing Based
Rocket Engine Control
[No. Of Hours: 07]
108
1. Development of mathematical learning model using single/multilayer layer perceptron.

2. Development of mathematical learning model using back propagation algorithm
3. Perform the comparative analysis of mathematical learning models
4. Find the maximum degree of membership of fuzzy sets
5. Find the minimum degree of membership of fuzzy sets
6. Find the inverse degree of membership of fuzzy set.
7. Find the difference of two fuzzy sets.
8. Find the feasible set of solution of single objective problem using evolutionary algorithms.
9. Find the feasible set of solution of single objective problem with single constraint using
evolutionary algorithms .
10. Perform the comparative analysis using evolutionary algorithm
Required Readings:
Textbooks:
TB1. Sivanandam, S. N., Deepa, S. N., (2019). Principal of Soft Computing, Third Edition,
Wiley.
TB2. Roy, S., Chakraborty, U., (2013) Introduction to Soft Computing: Neuro-Fuzzy and Genetic
Algorithm, Pearson.
Reference Books:
RB1. Karray, F. O., Silva, De. C,. (2009), Soft Computing and Intelligent System Design, Pearson
RB2. Krogh, J. H., Palmer, G. R., (1991), Introduction to The Theory of Neural Computation,
Addison-Wesely.
109
BT-CS-PE502|ADVANCED DATABASE MANAGEMENT SYSTEMS
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Basics of Database management systems.
Objectives:
To understand the advanced concept of database systems. The main topics covered are the advanced
concept of relational data model, Extended E-R model, new database management technologies, query
optimization, and big data processing techniques.
Course Outcomes:

CO1: Explore new developments in database technology
CO2: Interpret and explain the impact of emerging database standards
CO3: Evaluate the contribution of database theory to practical implementations of database
management systems.
CO4: Design and implement Distributed and Parallel Databases.
CO5: Develop more advanced applications based on different types of databases
Syllabus:
Unit 1:
Enhanced Entity Relationship Model and Relational Model: Entity Relationship Model Revised, Subclasses,
Superclasses and Inheritance, Specialization and Generalization, Constraints and characteristics of
specialization and Generalization, Union Types, Aggregation, Relational Model Revised, Converting ER and
EER Model to Relational Model, SQL, and Advanced Features, Concepts of File Structures, Hashing, and
Indexing.
[No. Of Hours: 10]
Unit 2:
Query Processing and Optimization: Concept of Query Processing; Query Trees and Heuristics for Query
Optimization; Choice of Query Execution Plans; Cost-Based Optimization.
Object Database Systems: New Data Types, Manipulating the New Kinds of Data, User-Defined Abstract
Data Types, Structured Types, Objects, Object Identity, and Reference Types, Inheritance, Database Design
for an ORDBMS, New Challenges in Implementing an ORDBMS, OODBMS, The ODMG Data Model and
ODL, OQL, Comparing RDBMS with OODBMS and ORDBMS.
[No. Of Hours: 12]
Unit 3:
Distributed Database: Concepts and Advantages, Data Fragmentation, Replication and Allocation
Techniques for Distributed Database Design, Types of Distributed Database Systems, Distributed Database
Architectures.
Parallel Databases: Architectures for Parallel Databases, Parallel Query Evaluation, Parallelizing Individual
Operations, Parallel Query Optimization.
[No. Of Hours: 12]
110
Unit 4:
Advanced Database Models, Systems, and Applications: Active Database Concepts and Triggers, Temporal
Database Concepts, Spatial Database Concepts, Multimedia Database Concepts, Deductive Database
Concepts.
NOSQL Databases and Big Data Storage Systems: Introduction to NOSQL Systems, The CAP Theorem,
Document-Based NOSQL Systems and MongoDB, NOSQL Key-Value Stores, Column-Based or Wide
Column NOSQL Systems, NOSQL Graph Databases and Neo4.
[No. Of Hours: 12]
1. Database Querying – Basic & Complex queries.

2. Working with Natural joins, Outer joins, self joins, and Cross joins.
3. Working with Views, sequences, and indexes.
4. Writing Programs on PL/SQL:
a. Write a PL/SQL program to swap two numbers.
b. Write a PL/SQL program to find the largest of three numbers.
c. Write a PL/SQL program to find the sum of digits in a given number.
d. Write a PL/SQL program to display the number in reverse order.
5. Creating procedures:
a. Create the procedure for the palindrome of the given number.
b. Create the procedure to find the factorial of a given number
6. Creating functions:
a. Create a function to find the factorial of the given number.
b. Create a function to the reverse of the given number.
7. Creation of insert trigger, delete trigger, and update trigger using any sample database.
8. Creating cursors.
9. Develop a database application to demonstrate storing and retrieving of BLOB and CLOB objects.
10. Develop a database application to demonstrate the representation of multi valued attributes, and the
use of nested tables to represent complex objects. Write suitable queries to demonstrate their use.
11. Design and develop a suitable Student Database application by considering appropriate attributes.
Couple of attributes to be maintained is the Attendance of a student in each subject for which he/she
has enrolled and Internal Assessment Using TRIGGERS, write active rules to do the following:
a. Whenever the attendance is updated, check if the attendance is less than 85%; if so, notify
the Head of the Department concerned.
b. Whenever, the marks in an Internal Assessment Test are entered, check if the marks are
less than 40%; if so, notify the Head of the Department concerned.
Note: The program list is only for reference purposes; the concerned subject professor may modify
it as per the need.
NOTE: - At least 8 Experiments out of the list must be done in the semester.
Required Readings:
Textbooks:
TB1: Elmsari, R., & Navathe, S. B. (2017). Fundamentals of Database Systems. Pearson Education.
TB2: Ramakrishna, R., & Gehrke, J. (2014). Database Management Systems. Tata McGraw Hill.
TB3: Silberschatz, A., Korth, H. F., & Sudharshan, S. (2013). Database System Concepts. Tata McGraw
Hill.
TB4: Bayross, I. (2021). SQL, PL/SQL: The Programming Language of Oracle. (4th ed.). BPB Publications.
Reference Books:
111
RB1: Date, C. J., Kannan, A., & Swamynathan, S. (2006). An Introduction to Database Systems. (8th ed.).
Pearson Education.
RB2: Peter Rob and Coronel, Database Systems, Design, Implementation and Management, Thomson
Learning.
RB3: Tiwari, S. Professional NoSQL. O'Reilly Media Company.
RB4: Gunarathne, T. (2015). Hadoop MapReduce v2 Cookbook. (2nd ed.). Packt Publishing
112
BT-CS-PE503| NATURAL LANGUAGE PROCESSING
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Knowledge on basic mathematics and Automata for B.Tech. students.
Objectives:
The objective of the paper is to facilitate the student with the basic of Natural Language Processing that are
required for Artificial Intelligent Enabled Applications.
Course Outcomes:

CO1: Explain and use the mathematical /logical models of text processing.
CO2: Translate and execute the computational models of speech processing.
CO3: Identify, use and differentiate the computational semantics of natural language processing.
CO4: Appraise and judge the discourses of Natural Languages using computational models.
CO5: Support the Natural Language enabled applications.
Syllabus:
Unit 1:
Introduction, Words, Regular Expressions and Automata, Words and Transducers, N-grams, Part-of-
Speech Tagging, Hidden Markov and Maximum Entropy Models
[No. Of Hours: 08]
Unit 2:
Speech: Phonetics, Speech Synthesis, Automatic Speech Recognition, Speech Recognition: Advanced
Topics, Computational Phonology
[No. Of Hours: 09]

Unit 3:
Semantics and Pragmatics: The Representation of Meaning, Computational Semantics, Lexical
Semantics, Computational Lexical Semantics, Computational Discourse
[No. Of Hours:08]
Unit 4:
Applications: Information Extraction, Question Answering and Summarization, Dialogue and
Conversational Agents, Machine Translation
[No. Of Hours: 09]

1. Write a program to find out the word tokenization of given sentence.

2. Write a program to estimation of Type-Token (TT) of given paragraph.
3. Write a program to find all the sentences of given corpus.
4. Write a program to normalize the text.
5. Write a program to lemmatization of the words of natural language.
6. Write a program to produce the morphological variants of root/ base word in a sentence.
113
7. Write a program to find bigram and trigram in given corpus.
8. Write a program to implement hidden Markov model
9. Write a program to implement Viterbi Decoding
10. Investigate the various Part of Speech (PoS) techniques.
Required Readings:
Textbooks:
TB1. Dan Jurafsky and James Martin. Speech and Language Processing: An Introduction to Natural
Language Processing, Computational Linguistics and Speech Recognition. Prentice Hall, Second
Edition, 2009. Some draft chapters of the third edition are available
online: https://web.stanford.edu/~jurafsky/slp3/
TB2. Chris Manning and Hinrich Schütze. Foundations of Statistical Natural Language Processing.
MIT Press, Cambridge, MA: May 1999.
Reference Books:
RB1. Natural language processing by Akshar Bhartati, Sangal and Chaitanya, Eastern Economy
Edition
RB2. An introduction to Linguistics, language grammar and semantics by P. Syal and D.V. Jindal,
Eastern Economy Edition
RB3. Natural Language Processing with Python 1st Edition, Steven Bird
RB4. Foundations of Statistical Natural Language Processing, Christopher Manning
114
BT-CS-PE504| DATA MINING & WAREHOUSING
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Knowledge of probability and statistics.

Database management systems
Objectives:
The objective of this course is to Introduce principles and techniques and to make students familiar data
mining as a cutting edge business intelligence tool with
Course Outcomes:

CO1: Ability to understand the types of the data to be mined and present a general classification of
tasks and primitives to integrate a data mining system.
CO2: Apply pre-processing methods for any given raw data.
CO3: Extract interesting patterns from large amounts of data.
CO4: Discover the role played by data mining in various fields and choose and employ suitable data
mining algorithms to build analytical applications
CO5: To understand data warehouse concepts, architecture, business analysis and tools.
Syllabus:
Unit 1:
Introduction: Data, Types of Data, Introduction to Data Mining Systems, Knowledge Discovery Process,
Data Mining Techniques, Issues & applications, Data Objects and attribute types, Statistical description of
data.
Data Preprocessing: Cleaning, Integration, Reduction, Transformation and discretization, Data
Visualization, Data similarity and dissimilarity measures.
Data Reduction: Data Cube Aggregation, Dimensionality reduction, Data Compression, Numerosity
Reduction, Data Compression, Discretization and Concept hierarchy generation.
[No. Of Hours: 10]

Unit 2:
Frequent Pattern Mining: Associations and correlations, Applications of association rule mining,
Evaluation Matrix, Mining Method-Apriori, Eclat, FPGrowth, Multilevel and Multidimensional Association
Rules, Correlation Analysis, Constraint-based Association Mining, Classification using Frequent Patterns.
Classification: Classification and Prediction, Basic concepts, classification by Artificial Neural Network
(Backpropagation), Decision tree induction–Bayesian classification, Rule–based classification, Lazy learner,
Support Vector Machine (SVM), Associative Classification, Other Classification Methods, Prediction, Model
Evaluation and Selection, Combining Classifiers (Ensemble Methods)
[No. Of Hours: 14]

Unit 3:
115
Clustering in Data Mining: Cluster Analysis, Types of Data in Clustering, Categorization of Major Clustering
Methods, Partitioning Methods, Hierarchical Methods, Density-Based Clustering, Grid-based Methods,
Model-based Clustering Methods, Clustering High Dimensional Data, Constraint-based Cluster Analysis,
Outlier Analysis
[No. Of Hours: 11]
Unit 4:
Data Warehousing : Basic Concepts , Data Warehousing Components, Building a Data Warehouse ,
Warehouse 8 /management and Support Processes, Warehouse Planning and Implementation, Hardware
and Operating Systems for Data Warehousing, Client/Server Computing Model & Data Warehousing,
Database Architectures for Parallel Processing, Parallel DBMS Vendors, Multidimensional Data Model, Data
Warehouse Schemas for Decision Support, Concept Hierarchies, Characteristics of OLAP Systems , Typical
OLAP Operations, OLAP and OLTP.
[No. Of Hours: 9]
1. Implementation of OLAP operations

2. To Extract the data from various sources
a) Var File
b) Oracle Database
c) Microsoft Excel
d) Microsoft Access Database
3. To explain different field options that facilitates to manipulate the data
4. To explain different record options that facilitates to manipulate the data
5. Training the given dataset for an application
6. Testing the given dataset for an application
7. Generating accurate models
8. To explain different visualization measures that includes different graphs of data.
9. To Generate Association rules by using Apriori and GRI algorithm.
10. A case study of Business Intelligence in Government sector/Social Networking/Business.
Required Readings:
Textbooks:
TB 1: Han, J., Kamber, M. (2012). Data Mining Concepts and Techniques, 3/e, Elsevier Publication
TB 2: Dunham, M. H. , Sridhar, S. (2002). ,”Data Mining: Introductory and Advanced Topics, 1/e, Pearson
Education India.
Reference Books:
RB 1: Tiwari S., Chaudhary N. (2010). Data Mining and Warehousing , 1/e, Dhanpat Rai Co.
Rb 2: Arun K. Pujari (2010). Data Mining Technique, 1/e, University Press.
116
BT-CS-PE505| ADVANCED DATA STRUCTURE
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
A basic understanding of Data Structures.
Objectives:
This course introduces students to a number of highly efficient algorithms and data structures for
fundamental computational problems across a variety of areas.
Course Outcomes:

CO1: Understand and apply amortised analysis on data structures, including binary search trees,
mergable heaps, and disjoint sets.
CO2: Understand the implementation and complexity analysis of fundamental algorithms such as
RSA, primality testing, max flow, discrete Fourier transform.
CO3: Have an idea of applications of algorithms in a variety of areas, including linear programming
and duality, string matching, game-theory.
CO4: Apply the concepts of advanced Trees and Graphs for solving problems effectively.
CO5: Analyze the given scenario and choose appropriate Data Structure for solving problems.
Unit 1:
Priority Queues (Heaps) – Model, Simple implementations, Binary Heap:Structure Property, Heap Order
Property, Basic Heap Operations: insert, delete,Percolate down, Other Heap Operations.
Binomial Queues: Binomial Queue Structure, Binomial Queue Operations,Implementation of Binomial
Queue, Priority Queues in the Standard Library
[No. Of Hours: 12]
Unit 2:
Multiway Search Trees ,Height Balanced Search Trees, Weight Balanced Search Trees, Red-Black Trees,
Splay Trees, B-trees, B+ Trees, Heaps: Balanced Search Tree as Heap, Array based heap, Binomial
heaps, Fibonacci heaps
Unit 3:
Data Structures for Disjoint Sets, Augmented Data Structures, Self-Adjusting Data Structures, Temporal
data structures, Succinct data structures, Hashing, Dictionaries and cuckoo hashing.
[No. Of Hours: 10]
Unit 4:
Graph and it’s Representation, Type of graphs, Paths and circuits, Euler graphs, Hamiltonian paths and
circuits, Cut-sets, Connectivity and separability, Planar graphs, Isomorphism, Graph colouring, Covering and
partitioning, , Max flow: Ford-Fulkerson algorithm, Max flow-min cut.
[No. Of Hours: 10]
117
Experiment 1 (AVL Trees and Red-Black Trees)

1. WAP for AVL Tree to implement following operations: (For nodes as integers)
a. Insertion: Test program for all cases (LL, RR, RL, LR rotation)
b. Deletion: Test Program for all cases (R0, R1, R-1, L0, L1, L-1)
c. Display: using set notation.
2. Implement the above program I for nodes as Student structure, with key as Student_
3. roll_no.
4. WAP to implement Red-Black trees with insertion and deletion operation for the given input data as Strings
5. Implement the above program III for nodes as Employee structure, with key as emp_no.
6. WAP using function which computes the balance factor of any given node in a BST.
7. WAP to transform BST into AVL trees and also count the number rotations performed.
8. WAP to find whether the given BST is AVL tree or not.
9. WAP to convert BST into Red-Black trees.
10. WAP to find the black height of any given node in Red-Black tree and find the black height of the Red-
Black tree.
Experiment 2( B-Trees)
1. WAP to implement insertion, deletion, display and search operation in m-way B tree (i.e. a non-leaf node
can have atmost m children) for the given data as integers (Test the program for m=3, 5, 7).
can have atmost m children) for the given data as strings (Test the program for m=3, 5, 7).
can have atmost m children) for the given data as Student structures (as given above), with key as student_
roll_no . (Test the program for m=3,5, 7).
can have atmost m children) for the given data as Employee structures (as given above), with key as
emp_no. (Test the program for m=3, 5, 7).
can have atmost m children) for the given data as Faculty structures (as given above), with key as faculty_ID.
(Test the program for m=3, 5, 7).
Experiment 7 (Min-Max Heaps, Binomial Heaps and Fibonacci Heaps )
1. WAP to implement insertion, deletion and display operation in Min-Max Heap for the given data as I I
integers.
2. WAP to implement Make_Heap, Insertion, Find_Min, Extract_Min, Union,Decrease_Key and Delete_Key
operations in Binomial Heap for the given data as strings.
3. WAP to implement Make_Heap, Insertion, Find_Min, Extract_Min, Union,Decrease_Key and Delete_Key
operations in Fibonacci Heap for the given data as Student structures (contains student_name,
student_roll_no, total_marks), with key as student_ roll_no.
4. Implement the above program (I) of Min-Max heap for Employee structures (contains employee_name,
emp_no, emp_salary), with key as emp_no.
5. Implement the above program (II) of Binomial Heap for Faculty structures (contains faculty_name,
faculty_ID, subject_codes, class_names), with key as faculty_ID.
6. Implement the above program (III) of Fibonacci Heap for strings.
Experiment 3 (Disjoint Sets)

1. WAP to implement Make_Set, Find_Set and Union functions for Disjoint Set Data
Structure for a given undirected graph G(V,E) using the linked list representation with
simple implementation of Union operation.
2. WAP to implement Make_Set, Find_Set and Union functions for Disjoint Set Data
Structure for a given undirected graph G(V,E) using the linked list representation with
weighted-union heuristic approach..
3.. WAP to implement Make_Set, Find_Set and Union functions using Union by rank
heuristic for Disjoint Set forest rooted trees representation.
4.. WAP to implement Make_Set, Find_Set and Union functions using Path compression
heuristic for Disjoint Set forest rooted trees representation.
Experiment 4 (Graphs Algorithms)
1. WAP to perform topological sort on dag using depth first search.
2. WAP to generate minimum spanning tree in a connected, undirected weighted graph
using Kuruskal’s algorithm with disjoint set data structures.
118
3. WAP to generate minimum spanning tree in a connected, undirected weighted graph using Prims’s
algorithm with disjoint set data structures.
4. WAP to find single-source shortest path in a weighted directed graph using Bellman-Ford algorithm
5. WAP to find single-source shortest path in a weighted dag using topological sort.
6. WAP to implement Dijkstra’s algorithm for single-source shortest path in a weighted directed graph
using fibonacci heap.
7. WAP to find all-pairs shortest path using dynamic-programming algorithm based on matrix
multiplication.
8. WAP to find all-pairs shortest path using Floyd-Warshall algorithm.
9. WAP to find all-pairs shortest path using Johnson’s algorithm for sparse graphs.
10. WAP to print strongly connected components in a directed graph.
11. WAP to find articulation points, bridges, and biconnected components usnig depth-first search in a
connected, undirected graph.
Experiment 5 (String Matching)
1. WAP to perform string matching using naive algorithm
2. WAP to perform string matching using Rabin-Karp algorithm.
3. WAP to perform string matching using Finite Automata.
4. WAP to perform string matching using Knuth-Morris-Pratt algorithm.
5. WAP to perform string matching using Boyer-Moore algorithm.
Required Readings:
Text books
TB1: T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms,
The MIT Press.
TB2: Y. Langsam, M. J. Augenstein, and A. O. Tenenbaum, Data Structures Using C and
C++, Pearson Education India.
Reference Books
RB1: Peter Brass, Advanced Data Structures, Cambridge University Press.
RB2: J. Kleinberg and E. Tardos, Algorithm Design, Pearson Education India.
RB3: E. Horowitz, S Sahni, & S. Rajasekaran, Computer Algorithms, Computer Science Press.
119
BT-CS-PE506 | SOFTWARE TESTING
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Basic knowledge of software development and debugging.
Objectives:
This course emphasises the role of testing for the purpose of better software quality and acceptance.
Various testing techniques are involved at multiple stage of software development and this course introduces
them.
Course Outcomes:

CO1: Create Test Case Criteria.
CO2: Design Test Suits.
CO3: Understand various Testing Techniques.
CO4: Apply the Testing Techniques and Metrics.
CO5: Develop and validate a test plan.
Syllabus:
Unit 1: Testing as an Engineering Activity, Testing as a Process, Testing Maturity Model, Testing axiom,
Basic definitions, Software Testing Principles, The Tester‘s Role in a Software Development Organization,
Artifacts of testing (Faults, Errors, and Failures), Limitations of Testing, Challenges in Software Testing,
Testing and debugging, Verification, Validation, Test.
[No. Of Hours: 8]
Unit 2: Test case Design Strategies, Using Black Box Approach to Test Case Design – Boundary Value
Analysis, Equivalence Class Partitioning, State based testing, Cause-effect graphing, Compatibility testing,
User documentation testing, domain testing, Random Testing, Requirements based testing, Using White
Box Approach to Test design, Test Adequacy Criteria, static testing vs. structural testing, code functional
testing, Coverage and Control Flow Graphs, Covering Code Logic, Paths, code complexity testing, Additional
White box testing approaches- Evaluating Test Adequacy Criteria.
[No. Of Hours: 12]
Unit 3: The need for Levels of Testing, Unit Test, Unit Test Planning, Designing the Unit Tests, The Test
Harness, Running the Unit tests and Recording results, Integration tests, Designing Integration Tests,
Integration Test Planning, Scenario testing, Defect bash elimination System Testing, Acceptance testing,
Performance testing, Regression Testing, Internationalization testing, Ad-hoc testing, Alpha, Beta Tests,
Testing OO systems, Usability and Accessibility testing, Configuration testing, Compatibility testing, Testing
the documentation, Website testing.
[No. Of Hours: 10]
Unit 4: People and organizational issues in testing, Organization structures for testing teams, testing
services, Test Planning, Test Plan Components, Test Plan Attachments, Locating Test Items, test
management, test process, Reporting Test Results, Introducing the test specialist, Skills needed by a test
specialist, Building a Testing Group, The Structure of Testing Group, The Technical Training Program.
[No. Of Hours: 10]
120
Required Readings:
Textbooks:
TB1: Ron Patton, Software Testing‖, Second Edition, Sams Publishing, Pearson Education, 2007. AU
Library.com
TB2: Yogesh Singh, Software Testing, Cambridge University Press, 2011

TB3: Srinivasan Desikan and Gopalaswamy Ramesh, Software Testing- Principles and Practices, Pearson
Education, 2006.
Reference Books:
RB1: Effective methods for Software Testing William Perry, Wiley
RB2: Ilene Burnstein, Practical Software Testing, Springer International Edition, 2003.
RB3: Aditya P. Mathur, ―Foundation of Software Testing, Pearson Education.

RB4: Milind Limaye, Software Quality Assurance, McGraw-Hill publication.
121
BT-AU501|Essence of Indian Traditional Knowledge
Teaching Scheme
L T P Credit
1 0 0 1
Pre-requisites:
Objectives:
The objective of this course is to facilitate the students with the concepts of Indian traditional
knowledge and to make them understand the importance of roots of knowledge system.
Course Outcomes:

CO1: Understand and elucidate the basic knowledge of traditional knowledge.
CO2: Describe the significance of traditional knowledge protection
CO3: Discuss different characteristics of Indigenous Knowledge.
CO4: Demonstrate the engineering, biotechnology, agricultural and medicine system.
CO5: Examine the sustainability and development of environment.
Syllabus:
Unit 1:
Define traditional knowledge, nature and characteristics, scope and importance, kinds of traditional
knowledge, the physical and social contexts in which traditional knowledge develop, the historical impact of
social change on traditional knowledge systems. Indigenous Knowledge (IK), characteristics, traditional
knowledge vis-à-vis indigenous knowledge, traditional knowledge Vs western knowledge traditional
knowledge vis-à-vis formal knowledge
Unit 2:
Protection of traditional knowledge: The need for protecting traditional knowledge Significance of Traditional
Knowledge Protection, value of Traditional Knowledge in global economy, Role of Government to harness
Traditional Knowledge.
Unit 3
Systems of traditional knowledge protection, Legal concepts for the protection of traditional knowledge,
Certain non IPR mechanisms of traditional knowledge protection, Patents and traditional knowledge,
Strategies to increase protection of traditional knowledge, global legal FORA for increasing protection of
Indian Traditional Knowledge
Unit 4:
Traditional knowledge and engineering, Traditional medicine system, Traditional Knowledge and
biotechnology, Traditional Knowledge in agriculture, Traditional societies depend on it for their food and
122
healthcare needs, Importance of conservation and sustainable development of environment, Management
of biodiversity, Food security of the country and protection of Traditional Knowledge.
Required Readings:
Textbooks:
TB1: Traditional Knowledge System in India, by Amit Jha, 2009.
TB2: Traditional Knowledge System and Technology in India by Basanta Kumar Mohanta and
Vipin Kumar Singh, Pratibha Prakashan 2012.
Reference Books:
RB1: Traditional Knowledge System in India by Amit Jha Atlantic publishers, 2002.
RB2: Knowledge Traditions and Practices of India" Kapil Kapoor, Michel Danino.
123
SEMESTER VI
124
Credit scheme
Semester VI
S. Hours/week Total
1. BT-HS601 Universal Human Values 2 0 2 4 3
2. BT-CS-ES601 Computer Networks 3 1 2 6 5
3. BT-CS-ES602 Machine Learning 3 1 2 6 5
4. BT-CS-ES603 Web Engineering 3 0 2 5 4
Program Elective-III
5. BT-CS-PE6XX 0 0 2 2 1
6. BT-OE6XX Open Elective-I 3 0 0 3 3
7. BT-SM601 Seminar 0 0 2 2 1
8. BT-AU601 Health and Well Being* 0 0 2 2 0
Total 14 2 14 30 22
125
BT–HS601|Universal Human Value
Teaching Scheme
L T P Credit
2 0 2 3
Pre-requisites
Nil
Objectives
To facilitate the development of a Holistic perspective among students towards life and profession
as well as towards happiness and prosperity based on a correct understanding of the Human reality
and the rest of existence.
Course Outcomes

CO1: Understand the significance of value inputs in a classroom and start applying them in
their life and profession
CO2: Distinguish between values and skills, happiness and accumulation of physical facilities,
the Self and the Body, Intention and Competence of an individual, etc.
CO3: Understand the role of a human being in ensuring harmony in society and nature.
CO4: Distinguish between ethical and unethical practices, and start working out the strategy to
actualize a harmonious environment wherever they work.
CO5: understand commitment and responsibility
Syllabus
UNIT I: Introduction to Value Education

1. Education, Definition, Concept and Need for Value Education.
2. The Content and Process of Value Education.
3. Basic Guidelines for Value Education.
a. Sense of duty, Devotion, Confidence, Concentration.
b. Truthfulness, Honesty, Humanity, Discipline.
c. Power of faith, National Unity, Patriotism, Love for nature, Cleanliness.
4. Self-exploration as a means of Value Education.
5. Happiness and Prosperity Value as parts of Value Education.
[No. of Hours: 12]
UNIT II: Harmony in the Human Being
1. Human Being is more than just the Body.
2. Harmony of the Self (‘I’) with the Body.
3. Understanding Myself as Co-existence of the Self and the Body.
4. Understanding Needs of the Self and the needs of the Body.
5. Understanding the activities in the Self and the activities in the Body.
[No. of Hours: 08]
UNIT III: Harmony in the Family and Society; Harmony in the Nature
1. Family as a basic unit of Human Interaction and Values in Relationships.
2. The Basics for Respect and today’s Crisis: Affection, Guidance, Reverence, Glory,
Gratitude and Love.
3. Harmony in Nature: The Four Orders in Nature.
4. The Holistic Perception of Harmony in Existence.
[No. of Hours: 08]
126
UNIT IV: Social Ethics
1. The Basics for Ethical Human Conduct.
2. Defects in Ethical Human Conduct.
3. Holistic Alternative and Universal Order.
4. Universal Human Order and Ethical Conduct.
5. Human Rights violation and Social Disparities.
[No. of Hours: 08]
Required Readings
Text Books
1. Tripathi, A. N. (2009). Human values. New Age International.

2. Bajpai, B. L. (2004). Indian ethos and modern management: Amalgam of the best of the ideas from
the east and the west. New Royal Book Co.
3. Russell, B. (2013). Human society in ethics and politics. Routledge.
Reference Books
1. Gaur, R., Sangal, R., & Bagaria, G. , (2009). A foundation course in Value Education, Excel Books
2. Gaur, R., Sangal, R., & Bagaria, G. , (2009), Teachers Manual Excel Books.
3. Sharma I.C.“Ethical Philosophy of India”, Nagin & Co , Jalandhar
Practical/ Laboratory
content
1. Visit to old age home and to Identify and extending a helping hand.
2. Study on road traffic signals through visit.
3. Visit to temples, mosque, gurudwara.
4. Conducting weekend camps.
5. Visit to picnic spots for a day long picnic.
6. Educational tour to Hills station, seashore, dessert and sand dunes.
7. Plantation during rainy season.
8. Visit to orphanage home
Note: All the students shall prepare visit report with photograph
127
BT-CS-ES601| Computer Networks
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Basic knowledge of computer networks.
Objectives:
To understand the basics of networking with reference to OSI and TCP/IP models.
Course Outcomes:

CO1: Understand basic computer network technology.
CO2: Enumerate the layers of the OSI model and TCP/IP. Explain the function(s) of each Layer.
CO3: Identify the different types of network topologies and protocols.
CO4: Evaluate and implement the skills of sub-netting and routing mechanisms.
CO5: Design and implement a peer to peer file sharing application utilizing application layer protocols
such as HTTP, DNS, and SMTP and transportation layer protocol.
Syllabus:
Unit 1: Introduction
Computer networks, applications and uses, Network Criteria, Network Hardware, Network Software,
Types of Connections, Topologies, Categories of Networks, Protocols and Standards. The Layered
Architecture: Protocol Layering, the OSI Reference Model, TCP/IP Protocol Suite. Connecting devices
(Hub, Repeaters, Switches, Bridges, Routers and Gateways). Physical Layer: Data Communications,
Components, Data Flow, Transmission Media: Guided and Unguided Media, Switching (Circuit and
Packet), Multiplexing (FDM, TDM and WDM), Overview of ISDN and ATM.
[No. of Hours: 12]
Unit 2: Data Link Layer
Design issues, Framing, Error Detection and Correction Techniques, HDLC and PPP.
Flow Control- Stop and Wait Protocol, Sliding window –Go-back N, ARQ and Selective repeat (ARQ).
MAC- Sub-layer Protocols: ALOHA, CSMA, CSMA/CA, CSMA/CD protocols, IEEE Standards 802.3,
802.4, 802.5, 802.11, FDDI, SONET/SDH.
[No. Of Hours: 12]
Unit 3: Network Layer
Network layer design issues, Routing algorithms, Congestion control algorithms, Quality of service,
Internetworking, The network layer in the Internet: IPV4 Addresses, IPV6, Internet Control protocol,
OSPF, BGP, IP, ICMP, IGMP.
[No. Of Hours: 11]
Unit 4: Transport and Application Layer
The Transport Service, Elements of Transport Protocols, Congestion Control, transport protocols: UDP,
128
TCP, Performance problems in computer networks, Network performance measurement.
Application Layer: Introduction, Client Server Programming, WWW and HTTP, FTP, email, TELNET,
Domain Name System, SNMP.
[No. Of Hours: 11]
1. Analyze different types of Network cables and practically implement the cross-wired cable and
straight through cable using clamping tool.
2. Analyse Network Devices in Detail.
3. Connect the computers in Local Area Network.
4. Study of basic network command and Network configuration commands.
5. Configure a Network topology using packet tracer software.
6. Configure a Network using Distance Vector Routing protocol.
7. Configure a Network using Link State Vector Routing protocol.
8. To Perform File Transfer in Client & Server Using TCP/IP.
Required Readings:
Textbooks:
 TB1: Forouzan, B.A., Data Communication and Networking, Tata McGraw Hill.
 TB2: Achyut, S. G., Data Communications & Networks, Tata McGraw Hill.
 TB3: Forouzan, B.A., TCP/IP Protocol Suit, Tata McGraw Hill.
Reference Books:
 RB1: Stallings, W., Data and Computer Communication, Macmillan Press.
 RB2: Keshav, S., An Engineering Approach on Computer Networking, Addison-Wesley.
 RB3: Larry, L.P. and Peter, S.D., Computer Network, Harcourt Asia.
 RB4: Tanenbaum, A.S.” Computer Networks”, 4th Edition, PHI
129
BT-CS-ES602| MACHINE LEARNING
Teaching Scheme
L T P Credit
3 1 2 5
Pre-requisites:
Knowledge on basic Data Structure and Programming Logic for B.Tech. students.
Objectives:
To introduce the students about the knowledge of basic concepts of machine learning systems, types of
learning etc.
Course Outcomes:

CO1: Understand fundamental concepts of machine learning and its various algorithms
CO2: Analyse various strategies of generating models from data and evaluating them.
CO3: Apply ML algorithms on given data and interpret the results obtained
CO4: Design appropriate ML solution to solve real world problems in AI domain.
CO5: Develop scaling up machine learning techniques and associated computing techniques and
technologies for various applications
Syllabus:
Unit 1:
Basic concepts: Definition of learning systems, Goals and applications of machine learning. Aspects of
developing a learning system: training data, concept representation, function approximation.
Types of Learning: Supervised learning and unsupervised learning. Overview of classification: setup,
training, test, validation dataset, overfitting and underfitting.
Classification Families: linear discriminative, non-linear discriminative, decision trees, probabilistic
(conditional and generative), nearest neighbour.
[No. Of Hours: 09]
Unit 2:
Logistic regression, Perceptron, Exponential family, Generative learning algorithms, Gaussian discriminant
analysis, Naive Bayes, Support vector machines: Optimal hyper plane, Kernels. Model selection and feature
selection. Combining classifiers: Bagging, boosting (The Ada boost algorithm), Evaluating and debugging
learning algorithms, Classification errors.
[No. Of Hours: 10]
Unit 3:
Unsupervised learning: Clustering. K-means. EM Algorithm. Mixture of Gaussians. Factor analysis. PCA
(Principal components analysis), ICA (Independent components analysis), latent semantic indexing.
Spectral clustering, Markov models Hidden Markov models (HMMs).
[No. Of Hours:08]
Unit 4:
130
Reinforcement Learning and Control: MDPs. Bellman equations, Value iteration and policy iteration, Linear
quadratic regulation (LQR). LQG. Q-learning. Value function approximation, Policy search. Reinforce.
POMDPs.
Artificial Neural Networks: MLP, Backprop, and RBF-Net .Foundations of Deep Learning: DNN, CNN,
Autoencoders.
[No. Of Hours: 07]
1.Analyse and Implement the Naive Bayes learner . (The datasets taken can be: Breast Cancer data file or
Reuters data set).
2. Study and Implement the Decision Tree learners . (The datasets taken can be: Breast Cancer data file
or Reuter‟s data set).
3. Estimate the accuracy of decision classifier on breast cancer dataset using 5-fold cross-validation. (You
need to choose the appropriate options for missing values).
4. Estimate the precision, recall, accuracy, and F-measure of the decision tree classifier on the text
classification task for each of the 10 categories using 10-fold cross-validation.
5. Develop a machine learning method to classifying your incoming mail.
6. Develop a machine learning method to Predict stock prices based on past price variation.
7. Develop a machine learning method to predict how people would rate movies, books, etc.
8. Develop a machine learning method to Cluster gene expression data, how to modify existing methods to
solve the problem better
9. Select two datasets. Each dataset should contain examples from multiple classes. For training purposes
assume that the class label of each example is unknown (if it is known, ignore it). Implement the K-means
algorithm and apply it to the data you selected. Evaluate performance by measuring the sum of Euclidean
distance of each example from its class center. Test the performance of the algorithm as a function of the
parameter k.
10. Implement the EM algorithm assuming a Gaussian mixture. Apply the algorithm to your datasets and
report the parameters you obtain. Evaluate performance by measuring the sum of Mahalanobis distance of
each example from its class center. Test performance as a function of the number of clusters.
11. Suggest and test a method for automatically determining the number of clusters.
12. Using a dataset with known class labels compare the labeling error of the K-means and EM algorithms.
Measure the error by assigning a class label to each example. Assume that the number of clusters is
known.
Required Readings:
Textbooks:
TB 1: Tom Mitchell (1997).Machine Learning, McGraw Hill.
TB 2: S. Rogers and M. Girolami (2011). A first course in Machine Learning, CRC Press.
Reference Books:
RB 1: Bishop(2007). Pattern Recognition and Machine Learning,Springer
RB 2: Barber(2012). Bayesian Reasoning and Machine Learning. Cambridge university press.
131
RB 3: Duda, Hart and Stork( 2001).Pattern Classification, Wiley
132
BT-CS-ES603| Web Engineering
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Knowledge of basic Computer Programming Science.
Objectives:
The objective of the course is to provide a foundation for the development of user Interface which includes
front end and back-end development.
Course Outcomes:

CO1: Create Static Web Pages.
CO2: Identify the difference between HTML, CSS, XML, JavaScript, PHP.
CO3: Understand the concept of JavaScript.
CO4:Apply the knowledge of Web Technology on solving social issues.
CO5:Develop a Static and Dynamic Web Application.
Syllabus:
Unit 1: Introduction to WWW, HTML, Style Sheet: Introduction to Web- Protocols and programs, secure
connections, application and development tools, the web browser, Web site design principles, planning the
site and navigation HTTP, Introduction to HTML- The development process, HTML tags and simple HTML
forms, Frames, web site structure, HXTML, CSS- Need for CSS, introduction to CSS, basic
syntax and structure, using CSS, background images, colours and properties, manipulating texts, using
fonts, borders and boxes, margins, padding lists, positioning using CSS.
[No. Of Hours: 8]
Unit 2: XML, JavaScript, DHTML: XML- Introduction to XML, Defining XML tags, their attributes and values,
Document type definition, XML Schemas, Document Object model, XHTML. Introduction to JavaScript:
JavaScript language – declaring variables, scope of variables functions, event handlers (on click, on submit
etc.), Document Object Model, Form validations. Simple AJAX applications. JavaScript and objects,
JavaScript own objects, the DOM and web browser environments, forms and validations. DHTML:
Combining HTML, CSS and JavaScript, events and buttons, controlling your browser, Ajax: Introduction,
advantages & disadvantages.
[No. Of Hours: 12]
Unit 3: Servlets and JSP: Introduction to Java Server Page (JSP), JSP Application Design, JSP objects,
Conditional Processing, declaring variables and methods, sharing data between JSP pages, Sharing
Session and Application Data, Database Programming using JDBC, development of java beans in JSP,
Introduction to Servlets, Lifecycle, JSDK, Servlet API, Servlet Packages,
[No. Of Hours: 10]
133
Unit 4: PHP, MySQL: Introduction to PHP: Declaring variables, data types, arrays, strings, operations,
expressions, control structures, functions, reading data from web form controls like Text Boxes, radio
buttons, lists etc., Handling File Uploads, connecting to database (My SQL as reference), executing simple
queries, handling results, Handling sessions and cookies. File Handling in PHP: File operations like opening,
closing, reading, writing, appending, deleting etc. on text and binary files, listing directories
[No. Of Hours: 10]
1. To explore the functionality of web debugger.

2. To design a static web page using basic html tags.
3. HTML Table design without CSS.
4. HTML Table design with CSS.
5. Menu option and HTML Forms.
6. Form validation using JavaScript.
7. Ajax implementation.
8. Backend Programming- Servlet.
9. Backend Programming- JSP.
10. Form Verification using PHP
Required Readings:
Textbooks:
TB1: Web Technologies, Uttam K Roy, Oxford University Press.
TB2: The Complete Reference PHP – Steven Holzner, Tata McGraw-Hill.
Reference Books:
RB1: Web Programming, building internet applications, Chris Bates 2nd edition, Wiley Dremtech.
RB2: Java Server Pages – Hans Bergsten, SPD O’Reilly
RB3: Internet and World Wide Web – How to program, Dietel and Nieto, Pearson.
134
BT–CS-PE601: INTRODUCTION TO RASPBERRY PI
Teaching Scheme
L T P Credit
0 0 2 1
Pre–requisites
Knowledge on python programming.
Course objective
This course enables the students to design any application by using Raspberry pi.
Course Outcomes
At the end of this course, the students will be able to:
CO1. Build a prototype using Raspberry Pi.
CO2. Analyze and choose requisite IoT data protocols for intended application.
CO3. Make use of various library packages.
CO4. Identify different sensors, actuators and communication protocols.
CO5. Understand Raspberry pi features and its various interfacings.
The following practical’s are supposed to be performed on Open Source platform/Trainer Kits or combination
of all as per the discretion of instructor
1. Familiarization with Raspberry Pi and perform necessary software installation.

2. Sense the Available Networks Using Raspberry pi
3. Measure the Distance Using Ultrasonic Sensor and Make Led Blink Using Raspberry pi.
4. Detect the Vibration of an Object Using Raspberry pi.
5. Connect with the Available Wi-Fi Using Raspberry pi.
6. Temperature Notification Using Raspberry pi.
7. LDR to Vary the Light Intensity of LED Using Raspberry pi
8. To interface LED/Buzzer with Raspberry pi and write a program to turn ON LEDfor 1 sec after
every 2 seconds.
9. To interface Push button/Digital sensor (IR/LDR) with Raspberry Pi and write a program to turn ON
LED when push button is pressed or at sensor detection.
10. To interface DHT11 sensor with Raspberry Pi and write a program to print temperature and
humidity readings.
11. To interface motor using relay with Raspberry Pi and write a program to turn ON motor when push
button is pressed.
12. To interface OLED with Raspberry Pi and write a program to print temperature and humidity
readings on it.
13. Write a program on Raspberry Pi to publish temperature data to MQTT broker.
14. Write a program on Raspberry Pi to subscribe to MQTT broker for temperature data and print it.
15. Write a program to create TCP server on Raspberry Pi and respond with humidity data to TCP
client when requested.
16. Write a program to create UDP server on Raspberry Pi and respond with humidity data to UDP
client when requested.
135
BT-CS-PE602 | Software testing Lab / Web testing Lab
Teaching Scheme
L T P Credit
0 0 2 1
Pre-requisites:
Basic knowledge of software development.
Objectives:
This course emphasises the role of testing for the purpose of better software quality and acceptance.
Various testing techniques are involved at multiple stage of software development and this course introduces
them.
Course Outcomes:
CO1: Create Test Case Criteria.
CO2: Design Test Suits.
CO3: Understand various Testing Techniques.
CO4: Apply the Testing Techniques and Metrics.
CO5: Develop and validate a test plan.
List of Experiments:
Black Box Testing:
1. Experiments on Boundary Value Analysis.
2. Experiments on Equivalence Class Partitioning.
3. Experiments on Decision table testing.
4. Experiments on Cause-effect graphing.
White Box Testing:
1. Experiments on Control flow testing.

2. Experiments on Data flow testing.
3. Experiments on Branch testing.
4. Experiments on Statement coverage.
5. Experiments on Decision coverage.
6. Experiments on Path testing.
Required Readings:
Textbooks:
TB1: Yogesh Singh, Software Testing , Cambridge University Press, 2011
TB2: Srinivasan Desikan and Gopalaswamy Ramesh, Software Testing – Principles and Practices, Pearson
Education, 2006.
Reference Books:
RB1: Effective methods for Software Testing William Perry, Wiley
RB2: Ilene Burnstein, Practical Software Testing, Springer International Edition, 2003.
RB3: Aditya P. Mathur, ―Foundation of Software Testing, Pearson Education.
RB4: Milind Limaye, Software Quality Assurance, McGraw-Hill publication

BT-CS-PE603 | Introduction to Scripting Languages
Teaching Scheme
L T P Credit
0 0 2 1
Pre-requisites:
Basic knowledge of command line or terminal and programming.
Objectives:
This course explores the nature of scripting, the role of scripting languages, introduces some of the popular
scripting languages and their applications, and provides skills in scripting language design.
Course Outcomes:
CO1: Understand the benefits and challenges of scripting.

CO2: Demonstrate basic scripting in the Linux/Unix environment.
CO3: Comprehend the differences between typical scripting languages and typical system and
application programming languages.
CO4: Apply scripting techniques to automate routine system administration and workflow tasks.
CO5: Solve the real-world problem using the scripting techniques.
1. Experiment on basic Unix commands.

2. Experiment on concepts of Pipes and filters.
3. Experiment on Unix specific editors.
4. Experiment on Shell Scripting fundamentals.
5. Experiment on decision making in Shell scripts.
6. Experiment on complex Shell scripts.
7. Experiment on Awk Scripting.
8. Experiment on solving problems with Shell and Awk scripts.
Required Readings:
Textbooks:
TB1: Chris F.A. Johnson, Pro Bash Programming: Scripting the GNU/Linux Shell, Apress.
TB2: Arnold Robbins, Effective AWK Programming, 4e: Universal Text Processing and Pattern Matching.
O’Reilly.
Reference Books:
RB1: Blum Richard, Linux Command Line and Shell Scripting Bible, Wiley.
BT-CS-PE604| NETWORK SIMULATION LAB
Teaching Scheme
L T P Credit
0 0 2 1
Pre-requisites:
All the experiments carried out in the lab aim in knowing the basic principles relating to network and solving
network problems.
Objectives:
The aim is to teach students how to evaluate a network situation, and to help students to identify the most
important network aspects that need to be monitored and analysed. Modelling and simulation techniques to
describe the current network situation are covered.
Course Outcomes:

CO1: Describe and develop a network model using analysis and simulation
CO2: Design a new network model to meet requirements for new and existing networks.
CO3: Use quantitative and qualitative techniques to design or upgrade a network
CO4: Making decisions on the proper network technologies, routing protocols, network topologies, node
placement, etc.
CO5: Troubleshoot and diagnose network problems
Note: Following experiments shall be conducted using either NS228/OPNET or any other
simulators.
1. Simulate a three nodes point-to-point network with duplex links between them. Set the queue size
vary the bandwidth and find the number of packets dropped.
2. Simulate a four node point-to-point network, and connect the links as follows: n0-n2, n1-n2 and n2-
n3. Apply TCP agent between n0-n3 and UDP n1-n3. Apply relevant applications over TCP and
UDP agents changing the parameter and determine the number of packets by TCP/UDP.
3. Simulate the transmission of ping messaged over a network topology consisting of 6 nodes and find
the number of packets dropped due to congestion.
4. Simulate an Ethernet LAN using N-nodes(6-10), change error rate and data rate and compare the
throughput.
5. Simulate an Ethernet LAN using N nodes and set multiple traffic nodes and plot congestion window
for different source/destination.
6. Simulate simple ESS and with transmitting nodes in wire-less LAN by simulation and determine the
performance with respect to transmission of packets.
7. Ethernet LAN protocol. To create Scenario and study the performance of CSMA/CD protocol through
simulation
8. Token Bus and Token Ring protocols. To create scenario and study the performance of token bus
and token ring protocols through simulation
9. Wireless LAN protocols. To create scenario and study the performance of network with CSMA/CA
protocol and compare with CSMA/CD protocols
10. Implementation and study of Stop and Wait protocol
11. Implementation and study of Go back N and Selective Repeat protocols
12. Implementation of Distance Vector Routing algorithm
13. Implementation of Link state routing algorithm
14. Implementation of data encryption and decryption
15. Transfer of files from PC to PC using Windows/ UNIX socket processing
Required Readings:
Textbooks:
TB: J. McCabe(1998). "Practical Computer Network -- Analysis and Design," Morgan Kaufmann Publishers,
Inc.
Reference Books:
RB: Sadiku, Matthew N. O. and Musa, Sarhan M.(2013). Performance Analysis of Computer Networks.
Springer, ISBN: 978-3-319-01645-0.
BT–CS– PE605|MATLAB
Teaching Scheme
L T P Credit
0 0 2 1
16. To display the images of different types along with the information about the images
17. To smoothen the given image using different spatial filters and study the effects
18. To sharpen the given image using different spatial filters and study the effects
19. To detect the edges in the given image using different operators
20. To achieve the lossless compression of the given image with any one method
21. To show the effect on the output of neuron with the change in activation function
22. To show the effect of Perceptron Learning Rule for the linearly separable problems
23. To implement the artificial neural networks with back-propagation algorithm.
24. To implement union, intersection, complement and difference operations on fuzzy sets and to perform
max-min composition on any two fuzzy relations
25. To implement SVM classification with fuzzy concepts
26. To implement the various kinds of logic gates
27. To implement linear regression and multi-regression for a set of data points
BT-CS-PE606| Web Development and Tools
Teaching Scheme
L T P Credit
0 0 2 1
Pre-requisites:
Knowledge of basic web technologies and debugging.
Objectives:
This course provides a roadmap to students for the development of web applications which enhances user
experience (UX). This course also incorporates uses of various tools which are used for a full stack web
development.
Course Outcomes:

CO1: Create responsive web applications.
CO2: Identify the difference between frontend and backend technologies.
CO3: Understand the UI/UX requirement in web development.
CO4: Apply the knowledge of web development tools for efficient web applications.
CO5: Develop a static and dynamic web application using various web development tools available.
Syllabus:
Unit 1: Frontend Technologies:
1. Experiment on HTML document creation using basic tags.

2. Experiment on Design structured web document with the help of web technologies such as CSS.
3. Experiment on Dynamic web document creation with the help of front-end JavaScript.
4. Experiment on Front end web development with the help of HTML, CSS and JavaScript.
Unit 2: Introduction to XML, JSON, JavaScript Libraries:
1. Experiment on Basic XML document creation.

2. Experiment on Standardization of XML document with the help pf DTD and Schemas.
3. Experiment on JSON document creation.
4. Experiment on Web Development with the help of JavaScript libraries like JQuery.
Unit 3: Backend Technologies:
1. Experiment on Setting up the server.

2. Experiment on Handling client request using JSP, Servlets and preparing response.
3. Experiment on PHP file handling. Handling request and preparing response. Database connectivity.
Handling Sessions and data sharing.
4. Experiment on Web Development using PHP.
Unit 4: Utility tools for Web Development:
1. Experiment on Explore web debugger, Code and text Editors.

2. Experiment on Explore version control.
3. Experiment on Bootstrap Techniques.
Required Readings:
Textbooks:
TB1: Web Technologies, Uttam K Roy, Oxford University Press.
TB2: The Complete Reference PHP – Steven Holzner, Tata McGraw-Hill.
Reference Books:
RB1: Web Programming, building internet applications, Chris Bates 2nd edition, Wiley Dremtech.
RB3: Internet and World Wide Web – How to program, Dietel and Nieto, Pearson.
RB4: Programming world wide web, R.W. Sebesta. Fourth Edition, Pearson.
RB6: Java Script, D.Flanagan, O’Reilly, SPD.

B.Tech (Computer Science & Engineering )
SEMESTER VII
Credit scheme
Semester VII
S. Hours/week Total
1. BT-HS701 Augmenting Writing Skills 0 0 2 2 1
Information Security and

2. BT-CS-ES701 3 0 2 5 4
Cyber Laws
Wireless and Mobile
3. BT-EC-ES711 3 0 2 5 4
Communication
Program Elective-IV
4. BT-CS-PE7XX 3 0 0 3 3
5. BT-OE7XX Open Elective-II 3 0 2 5 4
6. BT-OE7XX Open Elective-III 3 0 0 3 3
7. BT-PR701 Project-I** 0 0 8 8 4
Total 15 0 16 31 23
BT-CS-ES701| Information Security and Cyber Laws
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Knowledge of basic cryptography
Objectives:
The objective of this course is to introduce with the basic concepts of web threats, legal ethical and
professional issues of information security
Course Outcomes:

CO1: Understand the information system architecture and the involved components.
CO2: Know the basic principles of Information Security, Online payment systems and related
security issues along with the rules of E Governance.
CO3: Apply and regulate Cyber Laws dealing with Cyber Ethics by implementation of Intellectual
Property Right in the areas of Copyright, Patent, Piracy and Plagiarism.
CO4: Analyze the security of Cryptographic System and design and implementation issues
related with Firewalls, Virtual Private Networks and Intrusion Detection Systems.
CO5: Identify the need of physical security in Information System, need of Biometric Security
System and related challenges.
Syllabus:
Unit 1:
Need of Information Security, Introduction to information Security, Types of information security
controls and purposes of Information Security Management, Allocation of information security
responsibilities. Attributes of Information Security, Authentication, Confidentiality, Integrity, Availability,
Non Repudiation. Telecommunications Security Objectives, Threats and Countermeasures,
Identification of Security threats and development of countermeasures, Technologies and Security
policies.
[No. Of Hours: 10]
Unit 2: Design Access Control, Threats and Vulnerabilities, Security Attacks, Unauthorized Access,
Impersonation, Denial of Service, Malicious Software, Viruses, Worms, Trojan Horses. Definitions,
Types of authentication, Password Authentication, Password Vulnerabilities &Attacks: Brute Force &
Dictionary Attacks. Password Policy & Discipline, Single Sign on – Kerberos. Biometrics: Types of
Biometric Techniques: False Rejection, False Acceptance, Cross over Error Rates.
[No. of Hours: 11]
Unit 3:
Physical Security: Needs, Disaster and Controls, Basic Tenets of Physical Security and physical Entry
Controls. Access Control- Biometrics, Factors in Biometrics Systems, Benefits, and Criteria for
selection of Biometrics, Design Issues in Biometric Systems, Interoperability Issues, Economic and
Social Aspects, Legal Challenges. Overview of IT Security, Hacking and Intrusion Attacks, Denial of
Service Attacks (DoS), Viruses, Firewalls, Prevention and Detection Systems. Email Security: PGP,
MIME, IP Security: IP security overview.
[No. Of Hours: 10]
Unit 4:
Introduction to IT laws, Laws, Investigation and Ethics: Cyber Crime, Information Security and Law,
Types & Overview of Cyber Crimes, Cyber Law, Issues in E-Business Management, Overview of Indian
IT Act, Ethical Issues in Intellectual property rights, Copy Right, Patents, Data privacy and Protection,
Domain Name, Software piracy, Plagiarism, Ethical hacking.
[No. Of Hours: 10]
1. Analyse anyone simulation tool based on parameters of information security.

2. Write a program to make study of different security protocols like WEP/WPA2 ,PSK, 802.1x
EAP security protocol.
3. Implement firewall through App to login into bank-site,; to implement E-commerce, debit card
transaction through payment gateway.
4. Implement bio-metric system to have physical security through different access control
permissions.
5. Implement the Brute Force and Dictionary Attacks.
6. Use the Nessus tool to scan the network for vulnerabilities.
7. Study of the features of firewall in providing network security and to set Firewall Security in
windows.
8. Demonstrate intrusion detection system (ids) using any tool eg. Snort or any other s/w.
9. Implement RSA algorithm using HTML.
10. Implement VPN through Packet-Tracer or any other network simulator tool.
11. Defeating Malware
(a) Building Trojans
(b) Rootkit Hunter
Required Readings:
Textbooks:
 TB1: Godbole,“ Information Systems Security”, Willey
 TB2: Merkov, Breithaupt,“ Information Security”, Pearson Education
Reference Books:
 RB1: Yadav, “Foundations of Information Technology”, New Age, Delhi
 RB2: Schou, Shoemaker, “ Information Assurance for the Enterprise”, Tata McGraw Hill
 RB3: Sood,“Cyber Laws Simplified”, McGraw Hill
BT-EC-ES-711|WIRELESS AND MOBILE COMMUNICATION

Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Basic Knowledge of Communication and Modulation Concepts.

Objectives:
The objective of this course is to impart the various principles of Wireless Communications like cellular
and wireless system, modulation and access techniques, advanced techniques, cell-site and mobile
antennas and various types of mobile networks.
Course Outcomes:

CO1: Gain the knowledge of a basic cellular system with various important terms
CO2: Study the various cell-site antennas and mobile antennas
CO3: Analyse the important modulation techniques and multiple access techniques useful for the
wireless communication
CO4: Understand the various mobile networks from 2G to 3G with introduction to 4G and 5G
CO5: Analyse the various wireless systems along with a few equalization techniques and
advanced techniques used in wireless communication
Syllabus:
UNIT-1
Introduction: Introduction to Wireless Communication, Examples of Wireless Communication
Systems, Overview of Generation of Cellular Systems.
Cellular System: Cellular Concept, Frequency Reuse, Channel Assignment Strategies, Handoff
Strategies, Interference and system Capacity, Trunking and Grade of Service, Improving Coverage
and Capacity, Cell Splitting and Cell Sectoring.
[No. of Hours: 10]
UNIT-II
Cell-Site Antennas and Mobile Antennas: Equivalent Circuits of Antennas, Gain and pattern
relationship, Antennas at Cell Site, Mobile antennas.
Modulation and Multiple Access Techniques: MSK, GMSK, Spread Spectrum Modulation
Techniques: Direct Sequence Spread Spectrum and Frequency Hopping Spread Spectrum; Multiple
Access Techniques: FDMA, TDMA, SDMA, Cellular CDMA with Power Control.
[No. of Hours: 10]
UNIT-III
2G Networks: GSM: Architecture, Protocols, Interfaces, Logical Channels, Frame Structure,
Authentication, Security; CDMA: Specifications, Introduction to IS-95 and IS-136
3G Mobile Services: UMTS: Architecture, Air interface specifications, Channels, Security; Introduction
to IMT-2000, CDMA-2000 and W-CDMA, Quality of Services in 3G, Introduction to 4G and 5G.
[No. of Hours: 10]
UNIT-IV
Equalization: Basics, Linear Equalization, Non-Linear Equalization, Adaptive Equalization, Diversity
Techniques, Rake Receiver
Wireless Systems: Introduction to WLL, Its Architecture and Technologies, Bluetooth, Wi-Max,
Introduction to WLAN.
Advanced Techniques: Introduction to OFDM and MIMO Technologies
1. To set up a wireless network with and without infrastructure support

2. To configure security in wireless network with and without infrastructure support
3. To configure the routing between wired and wireless networks
4. To establish seamless wireless connectivity using multiple access point
5. To perform the process of call connection and call release in cellular mobile system
6. To configure Wi-Fi setting in mobile devices using mobile tethering to connect two devices
7. To transfer the image, audio and video files using Bluetooth protocol with varying distance
between two devices and analyze the performance
8. To understand AT commands for the working of 3G network using 3G mobile phone trainer kit
9. To simulate the direct sequence spread spectrum using MATLAB and Simulink
10. To study and perform infrared communication
11. To set up call using GSM software and manual commands
12. To study DTMF tones and application using GSM module
13. To study CDMA trainer and PC interfacing using serial port
.
Required Readings:
Textbooks:
TB1: Rappaport, T. S. (2008). Wireless Communication- Principles and Practices (2nd Ed.). Pearson
Education Pvt. Ltd.
TB 2:Dalal, U. (2016). Wireless and Mobile Communications. Oxford University Press.
TB 3:Lee, W. C. (1990). Mobile cellular telecommunications systems. McGraw-Hill Education.
Reference Books:
RB 1:Garg, V., & Wilkes, J. (1999). Principles & Applications Of GSM. Prentice Hall of India.
RB 2:Schiller, J. H. (2003). Mobile communications. Pearson Education.
BT-CS-PE701| DISTRIBUTED COMPUTING

Teaching Scheme
L T P Credit
3 0 0 3
Pre-requisites:
Data Structure and Algorithm, Operating System, Computer Network.
Objectives:
The purpose of this course is to learn foundations of distributed systems, idea of peer to peer
services and file system, security issues in distributed system.
Course Outcome

CO1: Understand architecture and communication systems in Distributed Systems.
CO2: Understand synchronization and various election algorithms in Distributed
Systems.
CO3: Analyse various consistency and replication protocols and methods.
CO4: Recognize security threats and apply cryptography methods for security in
Distributed Systems.
CO5: Create an awareness of the major technical challenges in distributed systems
design and implementation.
Syllabus:
Unit 1:
Characterization of Distributed Systems: Introduction, Examples of Distributed Systems, Resource Sharing and
the Web, Challenges. System Models: Introduction, Architectural Models, Fundamental Models. Time and Global
States: Introduction, Clocks Events and Process States, Synchronizing Physical Clocks, Logical Time and Logical
Clocks, Global States, Distributed Debugging.
[No. Of Hours: 08]
Unit 2:
Coordination and Agreement: Introduction, Distributed Mutual Exclusion, Elections, Multicast Communication,
Consensus and Related Problems. Inter Process Communication: Introduction, The API for the Internet Protocols,
External Data Representation and Marshalling, Client-Server Communication, Group Communication, Case
Study:
IPC in UNIX.
[No. Of Hours: 10]
Unit 3:
Name Services: Introduction, Name Services and the Domain Name System, Directory Services, Case Study of
the Global Name Services. Distributed Shared Memory: Introduction, Design and Implementation Issues,
Sequential Consistency and IVY case study, Release Consistency, Munin Case Study, Other Consistency Models.
[No. Of Hours:10]
Unit 4:
Transactions and Concurrency Control: Introduction, Transactions, Nested Transactions, Locks, Optimistic
Concurrency Control, Timestamp Ordering, Comparison of Methods for Concurrency Control. Distributed
Transactions: Introduction, Flat and Nested Distributed Transactions, Atomic Commit Protocols, Concurrency
Control in Distributed Transactions, Distributed Deadlocks, Transaction Recovery.
[No. Of Hours:10]
Required Readings:
Text Book:
TB1: George Coulouris, J Dollimore and Tim Kindberg (2009). Distributed Systems,
Concepts and Design, 5th Edition, Pearson Education.
Reference Books:
RB1: Andrew S. Tanenbaum, Maarten Van Steen(2007). Distributed Systems, Principles and
Paradigms, 2nd Edition, PHI.
RB2: Ghosh, S. (2006). Distributed Systems: An Algorithmic Approach ,1st Edition, Chapman
and Hall/CRC.
BT-CS-PE702|OPTIMIZATION TECHNIQUES
Teaching Scheme
L T P Credit
3 0 0 3
Pre-requisites:
Fundamentals of Computing and Programming
Objectives:
The course aims at building capabilities in the students for analyzing different situations in the industrial/
business scenario involving limited resources and finding the optimal solution within constraints by
using advanced optimization tools.
Course Outcome

CO1: Recall the theoretical foundations of various issues related to linear programming modeling
to formulate real-world problems as a L P model.
CO2: Identify appropriate optimization method to solve complex problems involved in various
industries.
CO3: Find the appropriate algorithm for allocation of resources to optimize the process of
assignment.
CO4: Understand variety of real industrial problems such as resource allocation, production
planning, assignment, transportation, travelling salesman etc. and solve these problems
using linear programming approach using software.
CO5: Formulate optimization problems.
Syllabus:
Unit 1:
Introduction: Engineering application of optimization, statement of an optimization problem with
example for minimum weight and optimum cost consideration, design vector, design constraints,
constraint surface, objective function surfaces, classification of optimization problems and techniques,
Single variable optimization, multi-variable optimization with equality and inequality constraints and
without constraints.
[No. Of Hours: 10]

Unit 2:
Linear Programming: Introduction, standard form of the problem, Geometry, basic terminology
Techniques of linear programming: Simplex method, Revised simplex method: Duality in linear
programming, decomposition principle, post-optimality analysis, applications to engineering design.
Non Linear Programming: Introduction, elimination methods: various search methods-Fibonacci

method and golden section method Interpolation method-Quadratic and cubic interpolation methods,
Direct root method.
[No. Of Hours: 10]

Unit 3:
Unconstrained optimization problems: Maximization and minimization of convex functions, Gradient
based method: Cauchy’s steepest descent method, Newton’s method, Conjugate gradient method.
Constrained optimization problems: Standard form of the problem and basic terminology; Direct
method: Sequential Linear Programming; Generalized reduced gradient method, Methods of feasible
direction Indirect method: Penalty function method Interior and exterior penalty function method,
Convex programming problem, Check for convergence Application to engineering problems.
[No. Of Hours: 10]

Unit 4:
Modern methods of Optimization: Genetic Algorithms, Simulated Annealing, Ant colony optimization,
Tabu search,Neural-Network based Optimization, Fuzzy optimization techniques, Applications. Use of
Matlab to solve optimization problems.
[No. Of Hours: 10]
Required Readings:
Textbooks:
TB1: Singiresu S. Rao (2019). Engineering Optimization: Theory and Practice. John Wiley and
Sons
TB2: Deb K. (2012) Optimisation for Engineering Design-Algorithms and Example. Prentice Hall.
Reference Books:
RB1: George Bernard Dantzig, Mukund Narain Thapa (2003). Linear programming. Springer
series in operations research.
RB2: Hadley G. (1970). Nonlinear and – dynamic programming. Addison Wesley Publishing Co.
RB3: Goldberg, D.E. (1989). Genetic algorithms in search, optimization and machine. Addison-
Wesley, NewYork.
BT-CS-PE703|BIG DATA ANALYTICS
Teaching Scheme
L T P Credit
3 0 0 3
Pre-requisites:
Fundamental of computer science
Objectives:
This course will help students to understand the concept and challenge of big data and why traditional
technology is inadequate to analyze the big data. Also to study the impact of big data analysis for
societal and business decisions.
Course Outcome

CO1: Understand big data challenges in different domains including social media,
transportation, finance and medicine
CO2: Design efficient algorithms for mining the data databases.
CO3: Model a framework for visualization of big data analytics for business user.
CO4: Build secure big data systems
CO5: Analyze Map-Reduce programming model for better optimization
Syllabus:
Unit 1:
Introduction to Big Data: Databases and their evolution, convergence of key trends, Types of Digital
Data (Structured, Semi-Structured, Unstructured), Nuances of big data, Issues,Case for Big data, Big
data options Team challenge, Big data sources.Acquisition,Features of Big Data, Security,
Compliance, auditing and protection, Best Practices for Big data Analytics, Big data characteristics -
Volume, Veracity, Velocity, Variety, Big Data Architecture.
[No of Hours: CO1:0]
Unit 2:
HDFS (Hadoop Distributed File System): History of Hadoop, Design of HDFS, HDFS concepts, benefits
and challenges, file sizes, block sizes and block abstraction in HDFS, data replication, analyzing data
with Hadoop, scaling out, Hadoop streaming, Hadoop pipes, Hadoop Echo System, how does HDFS
store, read, and write files, Java interfaces to HDFS, command line interface,
Hadoop file system interfaces, data flow, data ingest with Flume and Scoop, Hadoop archives, Hadoop
I/O: compression, serialization, Avro and file-based data structures. Hadoop Environment: Setting up
a Hadoop cluster, cluster specification, cluster setup and installation, Hadoop configuration, security in
Hadoop, administering Hadoop, HDFS monitoring & maintenance, Hadoop benchmarks, Hadoop in
the cloud
[No of Hours: 12]

Unit 3.
NoSql Data Management: Introduction to NoSQL, Types of NoSQL, aggregate data models,
aggregates, key-value, document data models, relationships, graph databases, schema less
databases, materialized views. Overview of MongoDB.
Map Reduce: Map Reduce framework and basics, how Map Reduce works, developing a Map Reduce
application, partitioning and combining, composing map-reduce calculations, MapReduce examples
such as matrix multiplication.
[No of Hours: 10]
Unit 4.
Hadoop Eco System Frameworks: Applications on Big Data using Pig, Hive and HBase
Pig - Introduction to PIG, Execution Modes of Pig, Comparison of Pig with Databases, Grunt, Pig Latin,
User Defined Functions, Data Processing operators,
Hive - Apache Hive architecture and installation, Hive shell, Hive services, Hive metastore, comparison
with traditional databases, HiveQL, tables, querying data and user defined functions, sorting and
aggregating, Map Reduce scripts, joins & subqueries.
HBase – Hbase concepts, clients, example, Hbase vs RDBMS, advanced usage, schema design,
advance indexing, Zookeeper – how it helps in monitoring a cluster, how to build applications with
Zookeeper.Introduction to Big SQL.
[No of Hours: 12]
Required Readings:
Textbooks:
TB1: Bill Franks (2012). Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data
Streams with Advanced Analytics. John Wiley & sons.
TB2: Tom White (2012). Hadoop: The Definitive Guide. O’reily Media.
TB3: Judith Hurwitz, Alan Nugent, Dr. Fern Halper, Marcia Kaufman (2013). Big Data for
Dummies. John Wiley & Sons.
Reference Books:
RB1: Seema Acharya, Subhasini Chellappan (2015). Big Data Analytics. Wiley.
RB2: Kyle Banker (2012). Mongo DB in Action. Manning Publications Company.
RB3: Thomas Erl, Wajid Khattak, Paul Buhler (2015). Big Data Fundamentals: Concepts, Drivers
and Techniques. Prentice Hall
BT-CS-PE704|CRYPTOGRAPHY
Teaching Scheme
L T P Credit
3 0 0 3
Pre-requisites:
Fundamentals of computer network
Objectives:
To make the student learn different encryption techniques along with hash functions, digital signatures
and their use in various protocols for network security and system security.
Course Outcome
CO1: Understand Mathematical foundations of Cryptography theory.

CO2: Analyze the robustness of Cryptosystems.
CO3: Design robust cryptosystem for real time applications.
CO4: Develop prototype Cryptosystems and demonstrate their performance.
CO5: Analyze and design hash and MAC algorithms, and digital signatures.
Syllabus:
Unit 1:
Foundations of Cryptography and Security: Ciphers and Secret Messages, Security Attacks and
Services. Mathematical Tools for Cryptography: Substitutions and Permutations, Modular Arithmetic,
Euclid’s Algorithm, Finite Fields, Polynomial Arithmetic, Discrete Logarithms.
Conventional Symmetric Encryption Algorithms: Theory of Block Cipher Design, Feistel Cipher Network
Structures, DES and Triple DES, Modes of Operation (ECB, CBC, OFB,CFB), Strength (or Not) of
DES.
Modern Symmetric Encryption Algorithms: IDEA, CAST, Blowfish, Twofish, RC2, RC5, Rijndael (AES),
Key Distribution.
[No of Hours: 10]
Unit 2:
Stream Ciphers and Pseudo Random Numbers: Pseudo random sequences, Linear Congruential
Generators, Cryptographic Generators, Design of Stream Cipher, One Time Pad.
Public Key Cryptography: Prime Numbers and Testing for Primality, Factoring Large Numbers, RSA,
DiffieHellman, ElGamal, Key Exchange Algorithms, Public-Key Cryptography Standards.
[No of Hours: 12]

Unit 3.
HMAC, Digital Signatures, Certificates, User Authentication: Digital Signature Standard (DSS and
DSA), Security Handshake Pitfalls, Elliptic Curve Cryptosystems.
Authentication of Systems: Kerberos V4 and V5, X.509 Authentication Service.
[No of Hours: 10]
Unit 4.
Electronic Mail Security: Pretty Good Privacy (PGP), S/MIME, X.400, IP and Web Security, IPSec and
Virtual Private Networks, Secure Sockets and Transport Layer (SSL and TLS).
Electronic Commerce Security: Electronic Payment Systems, Secure Electronic Transaction (SET),
Protocols, Steganography
[No of Hours: 10]
Required Readings:
Textbooks:
TB1: W. Stallings(2010). “Cryptography and Network Security Principles and Practice”,5th Edition
Prentice Hall.
TB2: Charlie Kaufman, Radia Perlman(2002). “Network Security: Private Communication in a
Public World”,2nd Edition, Prentice Hall.
Reference Books:
RB1: C.Y. Hsiung (1992). “Elementary Theory of Numbers”, World Scientific Pub Co Inc, .
RB2: Wenbo Mao(2004). “Modern Cryptography: Theory and Practice”, Prentice Hall.
RB3: Richard A. Mollin(2006). “An Introduction to Cryptography”,2nd Edition Chapman and
Hall/CRC.
BT-EC-PE715| DIGITAL IMAGE PROCESSING

Teaching Scheme
L T P Credit
3 0 0 3
Pre-requisites:
Elementary knowledge of Digital Signal Processing
Objectives:
The objective of this course is to make students familiar with digital image fundamentals and to
exposed to simple image enhancement techniques in Spatial and Frequency domain.
Course Outcome
At the end of the course, the students should be able to:

CO1: Know the basics and fundamentals of digital image processing, such asdigitization,
sampling, quantization, and 2D-transforms.
CO2: Operate on images using the techniques of smoothing, sharpening and enhancement.
CO3: Understand the restoration concepts and filtering techniques.
CO4: Learn the basics of segmentation, features extraction, compression and recognition
methods for color models.
CO5: Apply image processing in real life examples.
Syllabus:
Unit 1: Digital Image Fundamentals
Steps in Digital Image Processing – Components – Elements of Visual Perception – Image

Sensing and Acquisition – Image Sampling and Quantization – Relationships between pixels -
Color image fundamentals - RGB, HSI models, Two-dimensional mathematical preliminaries, 2D
transforms - DFT, DCT.
[No. Of Hours: 08]
Unit 2: Image Enhancement & Image Restoration
Gray level transformations – Histogram processing – Basics of Spatial Filtering– Smoothing and
Sharpening Spatial Filtering :Smoothing and Sharpening frequency domain filters – Ideal,
Butterworth and Gaussian filters; Homomorphic filtering; Color image enhancement.
Image Restoration: degradation model,, Noise models – Mean Filters – Order Statistics – Adaptive
filters – Band reject Filters – Band pass Filters – Notch Filters – Optimum Notch Filtering
No. Of Hours: 12]
Unit 3: Image Segmentation
Edge detection, Edge linking via Hough transform – Thresholding - Region based
segmentation – Region growing – Region splitting and merging – Morphological processing-
erosion and dilation, Segmentation by morphological watersheds – basic concepts – Dam
construction – Watershed segmentation algorithm.
[No. Of Hours: 08 ]
Unit 4 : Image Compression And Recognition

Need for data compression, Huffman, Run Length Encoding, Shift codes, Arithmetic coding,
JPEG standard, MPEG. Boundary representation, Boundary description, Fourier Descriptor,
Regional Descriptors – Topological feature, Texture - Patterns and Pattern classes -
Recognition based on matching.
[No. Of Hours: 08]
Required Readings:
Text Books:
1. Rafael C. Gonzalez, Richard E. Woods, ‘Digital Image Processing’, Pearson, Third
Edition,
2010.
2. Anil K. Jain, ‘Fundamentals of Digital Image Processing’, Pearson, 2002.
Reference Books:
1. Kenneth R. Castleman, ‘Digital Image Processing’, Pearson, 2006.
2. Rafael C. Gonzalez, Richard E. Woods, Steven Eddins, ‘Digital Image Processing using
MATLAB’, Pearson Education, Inc., 2011.
3. William K. Pratt, ‘Digital Image Processing’, John Wiley, New York, 2002
4. Milan Sonka et al ‘Image processing, analysis and machine vision’, Brookes/Cole, Vikas
Publishing House, 2nd edition, 1999.
BT-CS-PE706| CLOUD COMPUTING
Teaching Scheme
L T P Credit
3 0 0 3
Pre-requisites:
Computer Network, Operating Systems
Objectives:
The objective of this course is to give an overview of the field of Cloud Computing, and an in-depth
study into its enabling technologies and main building blocks.
Course Outcomes:

CO1: Articulate the main concepts, key technologies, strengths and limitations of cloud
computing.
CO2: Learn the key and enabling technologies that help in the development of cloud.
CO3: Develop the ability to understand and use the architecture.
CO4: Explain the core issues of cloud computing such as resource management.
CO5: Appreciate the emergence of cloud as the next generation computing paradigm.
Syllabus:
Unit 1:
Introduction: Introduction to Cloud Computing, Definition of Cloud, Evolution of Cloud Computing
Underlying Principles of Parallel and Distributed Computing, Cloud Characteristics, Elasticity in Cloud,
On-demand Provisioning.
Cloud Enabling Technologies: Service Oriented Architecture, REST and Systems of Systems, Web
Services, Publish-Subscribe Model.
Basics of Virtualization: Types of Virtualizations, Implementation Levels of Virtualization,
Virtualization Structures, Tools and Mechanisms, Virtualization of CPU, Memory, I/O Devices,
Virtualization Support and Disaster Recovery.
[No. Of Hours: 10]
Unit 2:
Cloud Architecture, Services And Storage: Layered Cloud Architecture Design, NIST Cloud
Computing Reference Architecture, Public, Private and Hybrid Clouds, laaS, PaaS, SaaS, Architectural
Design Challenges, Cloud Storage, Storage-as-a-Service, Advantages of Cloud Storage, Cloud
Storage Providers.
[No. Of Hours: 08]
Unit 3:
Resource Management And Security In Cloud: Inter Cloud Resource Management, Resource
Provisioning and Resource Provisioning Methods, Global Exchange of Cloud Resources, Security
Overview, Cloud Security Challenges, Software-as-a-Service, Security, Security Governance, Virtual

Machine Security, IAM Security Standards
[No. Of Hours: 08]
Unit 4:
Cloud Technologies And Advancements: Hadoop, MapReduce , Virtual Box ,Google App Engine ,
Programming Environment for Google App Engine , Open Stack, Federation in the Cloud, Four Levels
of Federation, Federated Services and Applications, Future of Federation.
[No. Of Hours: 08]
Required Readings:
Textbooks:
TB 1: Kai Hwang, Geoffrey C. Fox, Jack G. Dongarra(2012). “Distributed and Cloud Computing, From
Parallel Processing to the Internet of Things”, Morgan Kaufmann Publishers.
TB 2: Rittinghouse, John W., and James F. Ransome (2017).” Cloud Computing: Implementation,
Management and Security”, CRC Press.
Reference Books:
RB 1: Rajkumar Buyya, Christian Vecchiola, S. ThamaraiSelvi(2013).”Mastering Cloud Computing”,
Tata Mcgraw Hill..
Rb 2: Toby Velte, Anthony Velte, Robert Elsenpeter (2009).“Cloud Computing – A Practical Approach”,
Tata Mcgraw Hill.
RB 3 George Reese(2009). “Cloud Application Architectures: Building Applications and Infrastructure
in the Cloud: Transactional Systems for EC2 and Beyond (Theory in Practice)”, O’Reilly.
BT-EC-PE706| INFORMATION THEORY & CODING

Teaching Scheme
L T P Credit
3 0 0 3
Pre-requisites:
Basic knowledge of probability theory and digital communication
Objectives:
1. To learn the concept of Information contained by the digital data and types of channels
2. To learn about the different types of error detection and correction code.
3. To learn about the different types of coding and decoding techniques and its efficiency.
Course
Outcomes:
CO 1: Explain concept of measure of information, Entropy, Rate information
CO 2: Represent the information using Shannon Encoding, Shannon Fano, and Huffman
Encoding Algorithms
CO 3: Determine a codeword comprising of the check bits computed using Linear Block codes,
cyclic codes & convolutional codes
CO 4: Design the encoding and decoding circuits for Linear Block codes, cyclic codes,
convolutional codes
Syllabus:
Unit 1: Information Theory and Source Coding: Unit of information, Rate of information, Mutual
information, Discrete memoryless channel, Binary symmetric channel, Channel capacity, Shannon
Fano Encoding, Average length of Encoded message, Huffman coding
[No. Of Hours: 6]
Unit 2 Linear Block coded: Introduction to error control coding, Hamming code (code vector, code
word, code rate, block length, Minimum distance, Hamming distance, code efficiency, weight of the
code) Repetition code, Syndrome, Hamming distance of a block code, syndrome decoding, Dual code.
[No. Of Hours: 12]
Unit 3: Cyclic Code: Generator Polynomial, Systematic cyclic code, Parity check polynomial,
Generator and Parity check matrices, Encoder for cyclic code, Calculation of syndrome, Syndrome as
polynomial, Decoding of cyclic code.
[No. Of Hours: 10]
Unit 4: Convolutional Coded: Convolutional coder circuit, Representation of codes using Polynomial,
State diagram, Tree diagram, and Trellis diagram – Decoding techniques using Maximum likelihood,
Viterbi algorithm, Turbo Coding.
[No. of Hours: 6 ]
Required Readings:
Text Books:
TB1: J. H. Van Lint.. “Introduction to Coding Theory”, Springer -Verlag
TB2: T M Gover, J M Thomos, “Elements of Information Theory”, Wiley,
TB3: Arijit Saha, Nilotpal Manna, Surajit Mandal, “Information Theory, Coding and Cryptography”,
Pearson Education, 2013
Reference Books:
RB1: J G Proakis, “Digital Communications”, Mc Graw Hill, 2001. .
RB2: Amitabha Bhattacharya, “Digital Communication”, TMH 2006.
BT-CS-PE707| Human Computer Interaction
Teaching Scheme
L T P Credit
3 0 0 3
Pre-requisites:
NIL
Objectives:
To Provide an overview of the concepts related to the design of human-computer interfaces in ways
making computer-based systems comprehensive, friendly and usable.
Course Outcome

CO1: Understand the theoretical dimensions of human factors involved in the acceptance of
computer interfaces.
CO2: Identify the various tools and techniques for interface analysis, design, and evaluation.
CO3: Evaluate and create interfaces by applying HCI theories, terms, principles, and
methods including user experience, user-centred, and interaction design
theories and practices.
CO4: Analyse Human-Computer Interaction principle and designs in Information Systems.
CO5: Apply psychological and cognitive principles and theories to human factors and user
experience design.
Syllabus:
Unit I
Introduction: Importance of user Interface – definition, importance of good design, Benefits of good
design, A brief history of Screen design, The Human, The Computer, The interaction, Paradigms,
Usability of Interactive Systems, Guidelines, Principles and Theories.
Design process – Human interaction with computers, importance of human characteristics, human
consideration, Design Rules, Human interaction speeds, understanding business junctions.
[No. Of Hours: 10]
Unit II
Models and Theories: Cognitive models, Socio-organizational issues and stakeholder requirements,
Communication and collaboration models, Task analysis, Dialogue notations and design, Models of
the system, Modelling rich interaction.
[No. Of Hours: 10]
Unit III
Screen Designing: Design goals, Screen planning and purpose, organizing screen elements, ordering
of screen data and content, screen navigation and flow, Visually pleasing composition, amount of
information, focus and emphasis, presentation information simply and meaningfully, information
retrieval on web statistical graphics, Technological consideration in interface design.
Windows – New and Navigation schemes selection of window, selection of devices based and screen
based controls. Components, text and messages, Icons and increases, Multimedia, colors, uses
problems, choosing colors.
[No. Of Hours: 10]
Unit IV
Software tools, Specification methods, interface ,Building Tools. Interaction Devices, Keyboard and
function keys, pointing devices, speech recognition digitization and generation, image and video
Displays, drivers.
Group ware, Ubiquitous computing and augmented realities, Hypertext, Multimedia and the World Wide
Web.
[No. Of Hours: 10]
Required Readings:
TEXT BOOKS:
TB1: A. Dix, J. Finlay, G. Abowd and R. Beale (2004), Human Computer Interaction, 3rd Edition
Prentice Hall.
TB2: Galitz (2002), The Essential Guide to User Interface Design: An Introduction to GUI Design
Principles and Techniques, Wiley.
REFERENCE BOOKS:
RB1: J. Lazar, J. H. Feng, H. Hochheiser (2010), Research Methods in Human Computer
Interaction, Wiley.
RB2: Preece, J., Sharp, H. and Rogers (2019), Interaction Design: Beyond Human Computer
Interaction, Wiley.
BT-OE701| ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Objectives:
The objective of the paper is to facilitate the student to develop the computational systems that can
simulation the human intelligence processes.
Course Outcomes:

CO1: Solve the computational problem using AI techniques
CO2: Represent and reasoning of logical problems using knowledge representation techniques.
CO3: Explain the biological computational models in Artificial Intelligence.
CO4: Interpret the applications of Artificial Intelligence.
CO5: Describe the computational models used in AI applications.
Syllabus:
Unit 1:
Introduction: Definition, Foundation, History, Intelligent Agent-Agent and Environment,
Rationality, Environment, Structure.
Problem Solving- Problems, Solution Searching, Uninformed Search Strategies, Informed
(Heuristic) Strategies, Heuristic Functions, Local Search Algorithms and Optimization Problems,
Local Search in Continuous Spaces.
[No. Of Hours: 09]

Unit 2:
Logical Reasoning: Logical agents, propositional logic, inferences, first-order logic, inferences in
first order logic, forward chaining, backward chaining, unification, resolution
Knowledge Representation: Ontological Engineering, Categories and Object, Events.
[No. Of Hours: 08]

Unit 3:
Learning: Learning by Example- Forms, Supervised Learning, Decision Trees, Linear Model, Artificial
Neural Network, Nonparametric Models, Support Vector Machine. Knowledge in Learning,
Reinforcement Learning.
[No. Of Hours:08]
Unit 4:
Natural Language Processing-Models, Text Classification, Structure Grammars, Parsing. Perception-
Image Formation, Operations. Robotics-Hardware, Perception and Moment of Robot.
[No. Of Hours: 07]
1. Write a Program to implement Uninformal search – Breadth First search or Depth First Search
2. Write a Program to implement Informal search – Best First Search or A*.
3. Write a Program to computes the truth table of a statement in propositional logic.
4. Explore and use the Pylog to implement the first order logic expression.
5. Write a program to implement perceptron using python libraries.
6. Write a program to implement SVM using python.
7. Write a Program to implement to POS in NLP.
8. Write a Program to convert a colour image into black and white image
Required Readings:
Textbooks:
Text Book:
TB1: Russel, J., Norvig, P., (2019) Artificial Intelligence – A Modern Approach, Third Edition, Pearson Edu.
TB 2:Rich, E., Knight, K., (2017) Artificial Intelligence, Third Edition, Tata McGraw Hill.
Reference Books:
RB1 :KM Fu, (1994) Neural Networks in Computer Intelligence, McGraw Hill
RB2 : Dan Jurafsky and James Martin. Speech and Language Processing: An Introduction to Natural
Language Processing, Computational Linguistics and Speech Recognition. Prentice Hall,
BT-OE702| INTERNET OF THINGS

Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Microprocessors and controllers, Knowledge of sensors, interfacing, and other similar peripherals,
networking concepts and OSI reference model...
Objectives:
The objective of this course is to study about IoT fundamentals, architectures, hardware and protocols
required for implementation of IoT networks.
Course Outcomes:
At the end of this course, a learner should be able:

CO1: Analyze compare various architectures of IoT Networks.
CO2: Compare various architectures of IoT Networks.
CO3: Understand Design issues and challenges in IoT.
CO4: Understand the various application protocols for IoT.
CO5: Design applications of IoT and demonstrate protocols for IoT.
Syllabus:
Unit 1:
Introduction to IOT – IOT network Architecture and Design, Applications of IOT, Engineering
IOT Networks, IOT Design Methodology-Smart Objects: “Things” in IOT, Connecting smart
objects, IP as the IOT network layer, Data and Analytics of IOT, IOT in industry-examples.
[No. Of Hours: 08]
Unit 2:
Sensors and Actuators, Micro Electrical Mechanical Systems (MEMS), trends in smart objects,
Sensor Networks, IOT access Technologies: IEEE 802.15.4, Standardization and Alliances,
Physical Layer, MAC layer and Topology.
[No. Of Hours: 08]

Unit 3:
IOT Reference Architecture- Architecture, Functional, Information, Deployment and Operational
views: SOA based architecture, API based architecture, OPENIoT architecture for IOT/ Cloud
Convergence, Emergency response IOT architecture.
[No. Of Hours:08]
Unit 4:
Application Protocols for IOT: UPnP, CoAP,, MQTT, XMPP, SCADA Websocket; IP based
protocols: 6LoWPAN, RPL; Authentication Protocols. Security aspects in IOT.
[No. Of Hours: 08]
Experiments may be conducted using Aurdino/ Raspberry Pi.
1. Sense the Available Networks Using Arduino.

2. Measure the Distance Using Ultrasonic Sensor and Make Led Blink Using Arduino.
3. Detect the Vibration of an Object Using Arduino.
4. Connect with the Available Wi-Fi Using Arduino.
5. Sense a Finger When it is placed on Board Using Arduino.
6. Temperature Notification Using Arduino.
7. LDR to Vary the Light Intensity of LED Using Arduino
8. Traffic signal control
9. Railway gate control by stepper motors
10. Direction and Speed control of DC motor.
11. Measurement of power and energy
12. Measurement of phase shift and power factor
Required Readings:
Text Book:
TB1: Bassi, Alessandro, et.al (2016).“Enabling Things to Talk”, Springer-Verlag Berlin An, .
TB2: David Hanes, Gonzalo Salgueiro,(2017). “IoT Fundamentals: Networking Technologies, Protocols,
and Use Cases for the Internet of Things”, CISCO press, 2017
Reference Books:
RB1: David Boswarthick, Omar Elloumi, Olivier Hersent(2011) “The Internet of Things: Key Applications
and Protocols”, John Wiley and Sons, 2011.
RB1: Buyya, Raj Kumar, Amit Vahid Dastjedri eds,(2016). “Internet of Things: Principles and Paradigms”,
Elsevier.
BT-OE703| BLOCKCHAIN
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Objectives:
This course provides a broad overview of the essential concepts of blockchain technology – by
initially exploring the Bitcoin protocol followed by the Ethereum protocol – to lay the foundation
necessary for developing applications and programming.
Course Outcomes:

CO1: Describe the basic understanding of Blockchain architecture along with its primitives.
CO2: Explain the requirements for basic protocol along with scalability aspects.
CO3: Design and deploy the consensus process using frontend and backend.
CO4: Apply Blockchain techniques for different use cases like Finance, Trade/Supply and
Government activities.
CO5:Design blockchain based application with Swarm and IPFS.
Syllabus:
Unit 1:
Introduction to Blockchain: Digital Money to Distributed Ledgers , Design Primitives: Protocols,
Security, Consensus, Permissions, Privacy. Blockchain Architecture and Design: Basic crypto
primitives: Hash, Signature,) Hashchain to Blockchain, Basic consensus mechanisms
[No. Of Hours: 08]
Unit 2:
Consensus: Requirements for the consensus protocols, Proof of Work (PoW), Scalability aspects of
Blockchain consensus protocols Permissioned Blockchains: Design goals, Consensus protocols for
Permissioned Blockchains.
[No. Of Hours: 08]
Unit 3:
Hyperledger Fabric (A): Decomposing the consensus process , Hyperledger fabric components,
Chaincode Design and Implementation Hyperledger Fabric (B): Beyond Chaincode: fabric SDK and
Front End (b) Hyperledger composer tool.
[No. Of Hours:08]
Unit 4:
Use case 1 : Blockchain in Financial Software and Systems (FSS): (i) Settlements, (ii) KYC, (iii) Capital
markets, (iv) Insurance
Use case 2: Blockchain in trade/supply chain: (i) Provenance of goods, visibility, trade/supply chain
finance, invoice management discounting, etc.
[No. Of Hours: 08]
Any ten practicals based on the concept learnt in the theory classes may ne performed as a lab work.
Required Readings:
Text Book:
TB1: Imran Bashir, (2018). “Mastering Blockchain: Distributed Ledger Technology, ecentralization,
and smart contracts explained”, 2nd Edition, Packet Publishing Ltd,.
TB2: Bellaj Badr, Richard Horrocks, Xun (Brian) Wu,(2018). “Blockchain By Example: A developer's
guide creating decentralised applications using Bitcoin, Ethereum, and Hyperledger”, Packt
Publishing Limited.
Reference Books:
RB1: Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and Steven Goldfeder,(2016)
“Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction”, Princeton University
Press.
BT-OE704| ROBOTICS
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Kinematics and Dynamics
Course Objective:
The course should enable the students to:
To introduce to the standard terminologies, applications and mechanical design aspects both
kinematics, dynamics and work cell control of industrial robotic manipulator.
Course Outcomes:

CO1: Apply the concepts of coordinate transformations for the development of arm equation and
subsequently the inverse kinematics model for given serial manipulator.
CO2: Apply the concepts of robotic workspace analysis for design of robotic manipulator and end
effector for required work cell applications.
CO3: Design and analyze the workcell environment for given robotic manipulator configuration
and workcell devices for required integrated industrial application.
CO4: Create a working prototype using the concept of robotics.
CO5: Analyze the applications of robotics in manufacturing.
Syllabus:
UNIT 1:
Fundamentals of Robot Technology: Robot definition, automation and robotics, Robot anatomy,
Work volume, Drive systems. Control systems and dynamic performance. Accuracy and repeatability.
Sensors and actuators used in robotics. Robot configurations, Path control. Introduction to robot
languages. Applications; Types (Mobile, Parallel); Serial: Cartesian, Cylindrical, etc.
[No. of Hrs: 8]
UNIT 2:
Robot Kinematics: Mapping, Homogeneous transformations, Rotation matrix, Forward Kinematics
(DH Notation) and inverse kinematics. Numericals
Robot Differential Motion: Linear and Angular velocity of rigid link, Velocity along link, Maipulator
Jacobian, Statics: Use of Jacobian. Numericals
[No. of Hrs: 8]
UNIT 3:
Robot Dynamics: Lagrangian Mechanics, Lagrangian Formulation and numericals. Dynamics,
Newton-Euler Formulation and numerical.
End effectors: Mechanical and other types of grippers. Tools as end effectors. Robot and effector
interface. Gripper selection and design.
[No. of Hrs: 7]
UNIT 4:
Applications for Manufacturing: Flexible automation. Robot cell layouts. Machine interference. Other
considerations in work cell design. Work cell control, interlocks. Robot cycle time analysis. Mechanical
design of robot links. Typical applications of robots in material transfer, machine loading/unloading;
processing operations; assembly and inspection.
[No. of Hrs: 7]
Any ten Practical can be performed on the basis of the content covered in theory classes.
Required Readings:
Textbooks:
TB 1: Niku, S. B. (2001). Introduction to robotics: analysis, systems, applications (Vol. 7). New Jersey:
Prentice hall.
TB 2: Groover, M. P., Weiss, M., & Nagel, R. N. (1986). Industrial robotics: technology, programming
and application. McGraw-Hill Higher Education.
TB 3: Craig, J. J. (2005). Introduction to robotics: mechanics and control. Pearson Education.
Reference Books:
RB 1: Mittal, R. K., & Nagrath, I. J. (2003). Robotics and control. Tata McGraw-Hill.
RB 2: Ghosal, A. (2006). Robotics: fundamental concepts and analysis. Oxford university press.
RB3: Schilling, R. J. (1996). Fundamentals of robotics: analysis and control. Simon & Schuster Trade.
BT-OE706 | DATA SCIENCE
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Basics of Computer science and Mathematics.
Objectives:
To understand the underlying fundamental principles and cutting-edge technology in data science and
the application areas associated to it.
Course Outcomes:

CO1: Explore the fundamental concepts of data science.
CO2: Learn about types of data and data pre processing.
CO3: Understand the techniques for data analytics.
CO4: Learn the statistical fundamentals related to Data Science.
CO5: Understand the concepts of Machine Learning for Data Science
Syllabus:
Unit 1:
Defining data science and big data, How Does Data Science Relate to Other Fields, Recognizing the
different types of data, Gaining insight into the data science process, Data Science Process: Overview,
Different steps, The Relationship between Data Science and Information Science, Information vs. Data,
Skills for Data Science, Tools for Data Science, Issues of Ethics, Bias, and Privacy in Data Science
[No. Of Hours: 10]
Unit 2:
Data: Introduction, Data Types, Structured Data, Unstructured Data, Challenges with Unstructured
Data, Data Collections, Open Data, Social Media Data, Multimodal Data, Data Storage and
Presentation, Data Pre-processing, Data Cleaning, Data Integration, Data Transformation , Data
Reduction, Data Discretization
Evaluation of classification methods – Confusion matrix, Students T-tests and ROC curves-Exploratory
Data Analysis – Basic tools (plots, graphs and summary statistics) of EDA, Philosophy of EDA – The
Data Science Process.
[No. Of Hours: 12]
Unit 3:
Basic Machine Learning Algorithms: Association Rule mining – Linear Regression- Logistic Regression
– Classifiers – k-Nearest Neighbors (k-NN), k-means -Decision tree – Naive Bayes- Ensemble Methods
– Random Forest. Feature Generation and Feature Selection – Feature Selection algorithms – Filters;
Wrappers; Decision Trees; Random Forests.
Clustering: Choosing distance metrics – Different clustering approaches – hierarchical agglomerative

clustering, k-means (Lloyd’s algorithm), – DBSCAN – Relative merits of each method – clustering
tendency and quality.
[No. Of Hours: 12]
Unit 4:
Techniques: Introduction, Data Analysis and Data Analytics, Descriptive Analysis, Variables,
Frequency
Distribution, Measures of Centrality, Dispersion of a Distribution, Diagnostic Analytics, Correlations,
Predictive Analytics, Prescriptive Analytics, Exploratory Analysis, Mechanistic Analysis, Regression.
Statistical Data Analysis: Role of statistics in data science, Kinds of statistics, Descriptive statistics,
Inferential statistics, Probability theory , Random variables, Independence, Four perspectives on
probability, Bayesian probability, Probability distribution .
[No. Of Hours: 12]
1. Write an R script, to create R objects for calculator application and save in a specified location in
disk.
2. a. Write an R script to find basic descriptive statistics using summary.
b. Write an R script to find subset of dataset by using subset ().
3. Reading different types of data sets (.txt, .csv) from web and disk and writing in file in specific
disk location.
4. a. Find the data distributions using box and scatter plot.
b. Find the outliers using plot.
c. Plot the histogram, bar chart and pie chart on sample data.
5. a. Find the correlation matrix.
b. Plot the correlation plot on dataset and visualize giving an overview of relationships among
data on iris data.
c. Analysis of covariance: variance (ANOVA), if data have categorical variables on iris data.
6. Import a data from web storage. Name the dataset and now do Logistic Regression to find out relation
between variables that are affecting the admission of a student in a institute based on his or her GRE
score, GPA obtained and rank of the student. Also check the model is fit or not. require (foreign),
require(MASS).
7. Apply multiple regressions, if data have a continuous independent variable. Apply on above dataset.
8. Apply regression Model techniques to predict the data on above dataset.
9. a. Install relevant package for classification.
b. Choose classifier for classification problem.
c. Evaluate the performance of classifier.
10. a. Clustering algorithms for unsupervised classification.
b. Plot the cluster data using R visualizations.
Required Readings:
Textbooks:
TB1: Chirag Shah (2020), A Hands-On Introduction To Data Science, Cambridge University Press.
TB2: Dr. Gypsy Nandi, Dr. Rupa Kumar Sharma (2020), Data Science Fundamentals and Practical
Approaches, BPB Publications.
TB3: Jiawei Han, Micheline Kamber and Jian Pei (2011), Data Mining: Concepts and Techniques, (3rd
Edition) Elsevier .
Reference Books:
RB1: Cathy O’Neil and Rachel Schutt (2013), Doing Data Science, Straight Talk from The Frontline,
O’Reilly.
RB2: Jake VanderPlas (2016), Python Data science Handbook, Orielly publication.
BT-OE707 | CYBER SECURITY
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Basis of Computer Networks
Objectives:
The objective of this course is to teach the students about different types of security attacks and how
to handle them.
Course Outcomes:
CO1: Understand how to protect a Microsoft word document.
CO2: Be familiar with how to password protect Microsoft word document in different type of operating
system.
CO3: Understand the steps of operation how to remove password from Microsoft Word 2007.
CO4: Know how to hack a simple or a strong password.
CO5: Know the different types of hacking process and type of applications
Syllabus:
UNIT 1:
Introduction to information systems, Types of information Systems, Development of Information
Systems, Introduction to information security, Need for Information security, Threats to Information
Systems, Information Assurance, Cyber Security, and Security Risk Analysis..
[No. of Hours: 8]
UNIT 2:
Application security (Database, E-mail and Internet), Data Security Considerations-Backups, Archival
Storage and Disposal of Data, Security Technology-Firewall and VPNs, Intrusion Detection, Access
Control.
Security Threats -Viruses, Worms, Trojan Horse, Bombs, Trapdoors, Spoofs, E-mail viruses, Macro
viruses, Malicious Software, Network and Denial of Services Attack, Security Threats to E-Commerce-
Electronic Payment System, e- Cash, Credit/Debit Cards. Digital Signature, public Key Cryptography.
[No. of Hours: 12]
UNIT 3:
Developing Secure Information Systems, Application Development Security, Information Security
Governance & Risk Management, Security Architecture & Design Security Issues in Hardware, Data
Storage & Downloadable Devices, Physical Security of IT Assets, Access Control,CCTV and intrusion
Detection Systems, Backup Security Measures.
[No. of Hours: 10]
UNIT 4:
Security Policies, Why Policies should be developed, WWW policies, Email Security policies, Policy
Review Process-Corporate policies-Sample Security Policies, Publishing and Notification Requirement
of the Policies.
Information Security Standards-ISO, IT Act, Copyright Act, Patent Law, IPR. Cyber Laws in India; IT
Act 2000 Provisions,Intellectual Property Law: Copy Right Law, Software License, Semiconductor Law
and Patent Law. [No. of Hours: 12]
Required Readings:
Textbooks:
TB 1 : Charles P. Pfleeger, Shari Lawerance Pfleeger, “Analysing Computer Security ”, Pearson
Education India.
TB2: 1. V.K. Pachghare, “Cryptography and information Security”, PHI Learning Private Limited, Delhi
India.
Reference Books:
RB 1: Dr. Surya Prakash Tripathi, Ritendra Goyal, Praveen kumar Shukla ,”Introduction to Information
Security and Cyber Law” Willey Dreamtech Press.
RB 2: Schou, Shoemaker, “ Information Assurance for the Enterprise”, Tata McGraw Hill.
RB 3. CHANDER, HARISH,” Cyber Laws And It Protection ” , PHI Learning Private Limited ,Delhi ,India
1. Introduction to necessary tools.

2. Analyse Certificates and MiTM attacks.
3. Hashing, password cracking, and biometrics
4. Study of different wireless network components and features of any one of the Mobile Security
Apps.
5. Study of the features of firewall in providing network security and to set Firewall Security in
windows.
6. Steps to ensure Security of any one web browser (Mozilla Firefox/Google Chrome).
7. Study of different types of vulnerabilities for hacking a websites /Web Applications.
8. Analysis the Security Vulnerabilities of E-commerce services.
9. Analysis the security vulnerabilities of E-Mail Application
BT-OE708 | 3D PRINTING & DESIGN
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Machining processes
Objectives:
The objective of this course is to teach the students about the applications of 3D Printing in Automobile,
Aerospace, Bio-medical etc..
Course Outcomes:
CO1: Understand the importance of 3D printing in Manufacturing
CO2: Understand different 3D Printing Technologies
CO3: Select suitable materials for 3D Printing
CO4: Apply different methods for Post-processing of 3D Printing parts
CO5: Apply of 3D Printing in Automobile, Aerospace, Bio-medical etc.
Syllabus:
UNIT 1:
Introduction and basic principles:
3D Printing, Generic 3D Printing Process, Benefits of 3D Printing, Distinction Between 3D Printing and
CNC Machining, Other Related Technologies Development of 3D Printing Technology: Introduction,
Computers, Computer-Aided Design Technology, Other Associated Technologies, The Use of Layers,
Classification of 3D Printing Processes, Metal Systems, Hybrid Systems, Milestones in 3D Printing
Development, 3D Printing around the World.
[No. of Hours: 8]
UNIT 2:
3d Printing process chain & Photopolymerization processes
Eight Steps in Additive Manufacture, Variations from One 3D Printing Machine to Another, Metal
Systems, Maintenance of Equipment, Materials Handling Issues, Design for 3D PRINTING.
Introduction to Photopolymerization Processes: Photopolymerization Materials, Reaction Rates, Vector
Scan SL, SL Resin Curing Process, SL Scan Patterns, Vector Scan Micro stereolithography, Mask
Projection Photopolymerization Technologies and Processes, Two-Photon SL.
[No. of Hours: 8]
UNIT 3:
Powder bed fusion processes & extrusion-based systems:
Powder Bed Fusion Processes: Introduction, SLS Process Description, Powder Handling, Approaches
to Metal and Ceric Part Creation, Variants of Powder Bed Fusion Processes, Process Par3D
Printingeters, Applied Energy Correlations and Scan Patterns, Typical Materials and Applications,
Materials - Capabilities and Limitations. Extrusion-Based Systems: Introduction, Basic Principles,

Plotting and Path Control, Materials, Limitations of FDM, Bio extrusion, Other Systems.
[No. of Hours: 8]
UNIT 4:
Design, guidelines for process selection & software issues
Design for 3D Printing - Design for Manufacturing and Assembly, Core DFM for 3D Printing Concepts
and Objectives, 3D Printing Unique Capabilities, Exploring Design Freedoms, Design Tools for 3D
Printing. Guidelines for Process Selection - Selection Methods for a Part, Challenges of Selection,
Preliminary Selection, Production Planning and Control. Software Issues for 3D Printing - Preparation
of CAD Models – the STL File, Problems with STL Files, STL File Manipulation, Beyond the STL File,
Additional Software to Assist 3D Printing. [No. of Hours: 8]
Any ten Practical can be performed on the basis of the content covered in theory classes.
Required Readings:
Textbooks:
TB 1: Ian Gibson, David W Rosen, Brent Stucker., “Additive Manufacturing Technologies: Rapid
Prototyping to Direct Digital Manufacturing”, Springer, 2010
Reference Books:
RB 1: Chua Chee Kai, Leong Kah Fai, “Rapid Prototyping: Principles & Applications”, World Scientific,
2003.
RB 2: Ali K. Kamrani, Emand Abouel Nasr, “Rapid Prototyping: Theory & Practice”, Springer, 2006.
RB 3. D.T. Pham, S.S. Dimov, Rapid Manufacturing: TGeoffrey Boothroyd, “Fundamentals of Metal
Machining & Machine Tools”, TMH.
BT-OE709| Virtual Reality and Augmented Reality
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Intermediate programming ability in C# or other object-oriented languages. Familiarity with 3D game

engines.
Objectives:
This course is designed to give historical and modern overviews and perspectives on virtual reality. It
describes the fundamentals of sensation, perception, technical and engineering aspects of virtual
reality systems.
Course Outcomes:
CO1: Describe how VR systems work and list the applications of VR.
CO2: Implement the Augmented Reality software.
CO3: Understand the system of human vision and its implication on perception and rendering.
CO4: Explain the concepts of motion and tracking in VR systems.
CO5: Describe the principles and features of VR and AR.
Syllabus:
Unit 1:
Defining Virtual Reality, History of VR, Human Physiology and Perception, Key Elements of Virtual
Reality Experience, Virtual Reality System, Interface to the Virtual World-Input & output- Visual, Aural
& Haptic Displays, Applications of Virtual Reality.
I/O INTERFACE & TECHNIQUES IN VR
Multiple Modals of Input and Output Interface in Virtual Reality: Input -- Tracker, Sensor, Digital Glove,
Movement Capture, Video-based Input, 3D Menus & 3DScanner etc. Output -- Visual / Auditory / Haptic
Devices. Interactive Techniques in Virtual Reality: Body Track, Hand Gesture, 3D Manus, Object
Grasp.
[No. Of Hours: 12]
Unit 2:
Fundamentals of Computer Graphics-Software and Hardware Technology on Stereoscopic Display-

Advanced Techniques in CG: Management of Large Scale Environments & Real Time Rendering -
Development Tools and Frameworks in Virtual Reality: Frameworks of Software Development Tools in
VR. X3D Standard; Vega, MultiGen, Virtoolsetc.
VR Technology in Film & TV Production.VR Technology in Physical Exercises and Games.
Demonstration of Digital Entertainment by VR.3D user interfaces - Why 3D user interfaces. Major user
tasks in VE.Interaction techniques for selection, manipulation and navigation.3DUI evaluation.
[No. Of Hours: 12]
Unit 3:
What Is Augmented Reality - Defining augmented reality, history of augmented reality, The Relationship
Between Augmented Reality and Other Technologies-Media, Technologies, Other Ideas Related to the
Spectrum Between Real and Virtual Worlds, applications of augmented reality Augmented Reality
Concepts- How Does Augmented Reality Work? Concepts Related to Augmented Reality, Ingredients
of an Augmented Reality Experience.
[No. Of Hours: 12]
Unit 4:
Augmented Reality Hardware – Displays – Audio Displays, Haptic Displays, Visual Displays, Other
sensory displays, Visual Perception, Requirements and Characteristics, Spatial Display Model.
Processors – Role of Processors, Processor System Architecture, Processor Specifications. Tracking
& Sensors - Tracking, Calibration, and Registration, Characteristics of Tracking Technology, Stationary
Tracking Systems, Mobile Sensors, Optical Tracking, Sensor Fusion
[No. Of Hours:
12]
Required Readings:
Textbooks:
TB1: Sherman, William R. and Alan B. Craig (2002), Understanding Virtual Reality – Interface,
Application, and Design, Morgan Kaufmann publisher.
TB2: Steven M. LaValle (2016), Virtual Reality, Cambridge University Press.
TB3: Schmalstieg D, and Hollerer T. (2016). Augmented Reality: Principles & Practice, Pearson
Education India
Reference Books:
RB1: Burdea, Grigore C and Philippe Coiffet (2003), Virtual Reality Technology, Wiley Interscience.
RB2: Oliver Bimber and Ramesh Raskar (2005), Spatial Augmented Reality: Meging Real and Virtual
Worlds, A K Peters/CRC Press.
1. Installation of Unity and Visual Studio, setting up Unity for VR development, understanding
documentation of the same.
2. Demonstration of the working of HTC Vive, Google Cardboard, Google Daydream and Samsung
gear VR.
3. Develop a scene in Unity that includes:
i. a cube, plane and sphere, apply transformations on the 3 game objects.
ii. add a video and audio source.
4. Develop a scene in Unity that includes a cube, plane and sphere. Create a new material and texture
separately for three Game objects. Change the colour, material and texture of each Game object
separately in the scene. Write a C# program in visual studio to change the colour and material/texture
of the game objects dynamically on button click.
5. Develop a scene in Unity that includes a sphere and plane. Apply Rigid body component, material
and Box collider to the game Objects. Write a C# program to grab and throw the sphere using vr
controller.
6. Develop a simple UI(User interface ) menu with images, canvas, sprites and button.
Write a C# program to interact with UI menu through VR trigger button such that on each successful
trigger interaction display a score on scene.
7. Create an immersive environment (living room/ battlefield/ tennis court) with only static game objects.
3D game objects can be created using Blender or use available 3D models.
8. Include animation and interaction in the immersive environment created in
9. Create a virtual environment for any use case. The application must include at least 4 scenes which
can be changed dynamically, a good UI, animation and interaction with game objects. (e.g VR
application to visit a zoo)
BT-OE712 | POLYMER CHEMISTRY
Teaching Scheme
L T P Credit
3 0 2 4
Pre-requisites:
Knowledge of Engineering Chemistry syllabus
Objectives:
The objective of the paper is an introduction to polymer science that explores synthesis, physical
properties and kinetics of polymers/macromolecules, which are required for better learning in the field
of various industries.
Course Outcomes:
CO1: Acquire Knowledge about the interdisciplinary nature of polymer science
CO2: Understand polymer properties to their structure and conformation
CO3: Analyse different mechanisms of polymer formation and use this information in the
synthesis of different polymers.
CO4: Differentiate between eco-friendly and synthetic polymers.
CO5: Apply the knowledge in various manufacturing industries as production engineers or
technologists, quality control inspectors, polymer specialists, marketing executives
Syllabus:
Unit 1: Definitions, origin, nomenclature, classification and types of macromolecules; molecular weight
(MW) and its distribution; Determination of molecular weight - methods for measuring number average,
weight average, viscosity average MW; chromatography; spectroscopic techniques to determine
chemical composition and molecular microstructure, melting temperature and glass transition
temperature. Colligative properties, osmotic pressure, viscosity
[No.Of Hours: 6]
Unit 2:A) Step-Growth Polymerization: Reactivity of functional groups; kinetics; molecular weight in
open and closed system cyclization vs. linear polymerization, cross-linking and gel point; process
condition; step-copolymerization, examples of step polymers
B) Free radical Polymerization: Nature of chain polymerization and its comparison with step
polymerization; radical vs. ionic polymerizations; structural arrangements of monomer units; kinetics of
chain polymerization; molecular weight and its distribution
[No.Of Hours:
4+4]
Unit 3: A) Ionic Polymerization: Propagation and termination of cationic polymerization, anionic and
ring opening polymerization, active poly carbanions
B) Copolymerization: types of copolymers, copolymer compositions, reactivity ratio; radical and ionic
co-polymerizations; Block and Graft copolymer synthesis, examples
C) Naturally occurring polymers, biodegradability, biosynthesis, polymers from bio/renewable

resources, biopolymers and bioplastics
[No.Of Hours:3+3+3]
Unit 4:A)Conducting polymers, types, properties and applications, electroluminescence, molecular
basis of electrical conductivity, Photonic applications and non-linear optics, optical information storage
B) Fibers: Polyesters, mechanical requirements for fibers, drawing, orientation and crystallinity,
Carbon fibers and nanotubes, Polymer blends and composites: characteristics, types and
applications; Polymer films in sensor applications
[No Of Hours: 3+4]
Required Readings:
Textbooks:
TB 1: Hiemenz, P. C., & Lodge, T. P. (2007). Polymer Chemistry. CRC Press.

TB 2: Sperling, L. H. (2006). introduction to physical polymer science. a john wiley & sons, inc.
publication.
Reference books:
RB 1: Allcock, H. R. (1981). Contemporary polymer chemistry. Pearson.

RB 2: Flory, P. J. (1953). Principles of Polymer Chemistry. Cornell University Press.
RB 3: Hamley, I. W. (2007). Introduction to Soft Matter. John Wiley & Sons, Ltd.
Practical /Laboratory Content:

1. Determination of molecular weight of polymer using viscometric method
2. Determination of viscosity of dilute polymeric solutions
3. Preparation of nylon films by condensation polymerization
4. Preparation of epoxy resins
5. Identification of polymer using forth floatation method based on their density and Determination
of melting point using simple setup,
6. Bulk polymerization of styrene
7. Synthesis of Phenol –Urea – Formaldehyde polymer
8. Designing of polymer laminate
SEMESTER VIII
Semester VIII
S. Hours/week Total
1. BT-SI801 Industrial Internship** 0 0 0 0 10
OR
2. BT-OE8XX Open Elective - IV 2 0 0 2 2
3. BT-PR801 Project – II** 0 0 16 16 8
Total 0/2 0 0/16 0/18 10

Creative Art Basket

S. Hours/week Total
1. BT-AU301 Photography 0 0 2 2 0
2. BT-AU302 Dance 0 0 2 2 0
3. BT-AU304 Music 0 0 2 2 0
4. BT-AU304 Drama 0 0 2 2 0
5. BT-AU305 Fine Arts 0 0 2 2 0
Total 0 0 10 10 0
List of Program Electives

S. Hours/week Total
Course Code Course Titles
No. L T P Total Credits
Program Elective-I (Choose any one from the following subjects)
1. BT-CS-PE401 Compiler Design 3 0 0 3 3
2. BT-CS-PE402 Computer Graphics 3 0 0 3 3
3. BT-CS-PE403 Multimedia Technologies 3 0 0 3 3
4. BT-CS-PE404 Graph Theory 3 0 0 3 3
5 BT-CS-PE405 System Software 3 0 0 3 3
Principles of programming
6 BT-CS-PE406 3 0 0 3 3
Languages
Program Elective-II (Choose any one from the following subjects)
1. BT-CS-PE501 Soft Computing 3 0 2 5 4
Advanced Database
2. BT-CS-PE502 3 0 2 5 4
Management Systems
Natural Language
3. BT-CS-PE503 3 0 2 5 4
Processing
Data Mining and
4. BT-CS-PE504 3 0 2 5 4
Warehousing
5 BT-CS-PE505 Advanced Data Structures 3 0 2 5 4
6 BT-CS-PE506 Software testing 3 0 2 5 4

Program Elective-III (Choose any one from the following subjects)
Introduction to
1. BT-CS-PE601 0 0 2 2 1
Raspberry Pi and Arduino
2. BT-CS-PE602 Web testing Lab 0 0 2 2 1
Introduction to Scripting
3. BT-CS-PE603 0 0 2 2 1
Languages
Network Simulation
4. BT-CS-PE604 0 0 2 2 1
Lab
5 BT-CS-PE605 MATLAB 0 0 2 2 1
Web Development
6 BT-CS-PE606 0 0 2 2 1
and Tools Lab
Program Elective-IV (Choose any one from the following subjects)
1. BT-CS-PE701 Distributed Computing 3 0 0 3 3
Optimization
2. BT-CS-PE702 3 0 0 3 3
Techniques
3. BT-CS-PE703 Big Data Analytics 3 0 0 3 3
4. BT-CS-PE704 Cryptography 3 0 0 3 3
5 BT-EC-PE715 Digital Image Processing 3 0 0 3 3
6 BT-CS-PE706 Cloud Computing 3 0 0 3 3
7 BT-CS-PE716 Information Theory and Coding 3 0 0 3 3
8 BT-CS-PE707 Human Computer Interaction 3 0 0 3 3
Open Elective-I: Language Competency Basket (Choose anyone from the following subjects)
1. BT-OE601 Sanskrit 3 0 0 3 3
2. BT-OE602 French 3 0 0 3 3
3. BT-OE603 German 3 0 0 3 3
4. BT-OE604 Spanish 3 0 0 3 3
5 BT-OE605 Japanese 3 0 0 3 3
Open Elective-II: Emerging Areas Basket (Choose anyone from the following subjects)
Artificial Intelligence and Machine

1. BT-OE701 3 0 2 5 4
Learning
2. BT-OE702 Internet of things 3 0 2 5 4

3. BT-OE703 Block Chain 3 0 2 5 4
4. BT-OE704 Robotics 3 0 2 5 4
5 BT-OE705 Quantum Computing 3 0 2 5 4
6 BT-OE706 Data Sciences 3 0 2 5 4
7 BT-OE707 Cyber Security 3 0 2 5 4
8 BT-OE708 3 D Printing and Design 3 0 2 5 4
Virtual Reality and Augmented

9 BT-OE709 3 0 2 5 4
Reality
10 BT-OE710 Design Thinking 3 0 2 5 4
11 BT-OE711 Electric Vehicles 3 0 2 5 4
12 BT-OE712 Polymer Chemistry 3 0 2 5 4
Open Elective-III: Managerial Competency Basket (Choose anyone from the following subjects)
1. BT-OE713 Principles of Economics 3 0 0 3 3
2. BT-OE714 Organisational Behaviour 3 0 0 3 3
Managerial Thinking and

3. BT-OE715 3 0 0 3 3
Decision Making
Human Behaviour and Cognitive
4. BT-OE716 3 0 0 3 3
Science
5. BT-OE717 Financial Management 3 0 0 3 3
6. BT-OE718 Industrial Management 3 0 0 3 3
7. BT-OE719 Essentials of Entrepreneurship 3 0 0 3 3
8 BT-OE720 Psychology 3 0 0 3 3
9. BT-OE721 Sociology 3 0 0 3 3
Open Elective-IV: Employability Skills Basket (Choose any one from the following subjects)
1. BT-OE801 Soft Skills 2 0 0 2 2
2. BT-OE802 Reverse Engineering 2 0 0 2 2
3. BT-OE803 Emotional Intelligence 2 0 0 2 2
4. BT-OE804 Leading Edge Technology+ 2 0 0 2 2

Note:
1)*Workshop of two hours per two weeks will be conducted.
2)#Students will go for summer training/internship of 4-6 weeks during summer break. The evaluation of the same
will be conducted in V Semester.
3) +Expert from industry may be engaged to teach this course.
4) It is mandatory to qualify the Audit course.
5) Program Elective/Open Elective may be offered through MOOC after prior approval from department level
committee.
**Project / Industrial Internship

A student needs to select a topic related to Computer Science & Engineering to carry out their
dissertation/Industrial project. The dissertation can be research oriented, model design based, analytical work,
simulation, or a combination in the emerging areas/applications of Computer Science & Engineering under the
supervision of a CSE faculty (single or jointly). One needs to submit a synopsis in prescribed format with the
consultation of his/her supervisor(s) at the beginning of the semester for the approval by the Department level
committee meant for the same. S/he would need to present progress report in front of the committee from time to
time. The end semester evaluation shall be on the basis of viva-voce and project report.

B.Tech.: Delhi Skill and Entrepreneurship University

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

B.Tech.: Delhi Skill and Entrepreneurship University

Uploaded by

Copyright:

Available Formats

Delhi Skill and

Effective from Academic Year 2022-26

Pedagogy and Teaching Methodology

1. BT-HS101 Professional Communication Skills 3 0 0 3 3

2. BT-BS101 Applied Mathematics –I 3 1 0 4 4

3. BT-BS102 Engineering Chemistry 2 0 2 4 3

4. BT-BS103 Engineering Physics 2 0 2 4 3

5. BT-ES101 Problem Solving Using Python 3 0 2 5 4

6. BT-ES102 Engineering Mechanics 2 1 2 5 4

7. BT-ES103 Basics of Electrical Technology 3 0 2 5 4

Time spent on developing professional communicative competencies in Semester 1:

1.1 Learning Outcomes:

Students are able to:

1. listen actively with comprehension and respond.

2. follow specific instructions.

3. take notes from presentations, lectures, and reports.

4. listen to narratives and reports, and paraphrase.

5. express feelings, describe, and give explanations.

6. participate productively in peer activities.

7. produce oral reports and narratives.

8. participate in literary/ general discussions.

9. Participate in group discussions.

10. engage meaningfully with texts and people.

12. build on existing vocabulary repertoire.

14. write book reports/reviews on texts read.

15. write formal letters.

16. write a memo.

17. write minutes of a meeting.

20. portray more confidence and less hesitation in communicating in English.

Theory of English Communication

2. Big Brother by Munshi Premchand

3. The Necklace by Guy de Maupassant

4. The Happy Prince by Oscar Wilde

5. The Wolf by Guy De Maupassant,

Knowledge on basic mathematics for B.Tech.

Basic knowledge of Intermediate class Physics

1. D.J. Griffith, “Introduction to Electrodynamics”, 4th Edition, Pearson Education, 2015.

Fundamentals of computer programming, Fundamentals of Object Oriented Approach.

At the end of this course, students should be able to:

Development of mini project on the basis of the knowledge gained

1. Learning about installation of python and various IDE.

9. Functions - Problem Solving

10. Multi-D Lists

14. A mini-course project

Mathematics and Physics

At the end of this course, the student should be able to:

[No. Of Hours: 11]

1. To verify the law of Force Polygon.

CO 1: Recall basic concepts of Electrical Engineering and Illustrate basics of AC circuits

CO 5: Summarize the basic concepts and principles of AC and DC machines

1. To study different types of electrical symbols.

2. BT-BS202 Applied Physics 2 0 2 4 3

3. BT-BS203 Environmental Studies 2 0 2 4 3

4. BT-ES201 Problem Solving using C 3 0 2 5 4

5. BT-ES202 Basics of Electronics Engineering 2 0 2 4 3

6. BT-ES203 Engineering Graphics & CAD 1 0 3 4 2.5

7. BT-ES204 Workshop Practice 1 0 3 4 2.5

8. BT-AU201 Constitution of India 1 0 0 1 0

At the end of this course, the student should be able to:

[No. Of Hours: 12]

TB 1: H.K.Dass(2014), Higher Engineering Mathematics,S.Chand publication.

At the end of this course, a learner should be able to:

CO1: Apply their learned knowledge to develop Nanomaterial’s.