Computerscienceandengineerings1 S8

SEMESTER I
LINEAR ALGEBRA AND CALCULUS CATEGORY L T P CREDIT Year of

MAT Introduction
101 BSC 3 1 0 4 2019
Preamble: This course introduces students to some basic mathematical ideas and tools which are at
the core of any engineering course. A brief course in Linear Algebra familiarises students with some
basic techniques in matrix theory which are essential for analysing linear systems. The calculus of
functions of one or more variables taught in this course are useful in modelling and analysing
physical phenomena involving continuous change of variables or parameters and have applications
across all branches of engineering.
Prerequisite: A basic course in one-variable calculus and matrix theory.
Course Outcomes: After the completion of the course the student will be able to
CO 1 solve systems of linear equations, diagonalize matrices and characterise quadratic forms
CO 2 compute the partial and total derivatives and maxima and minima of multivariable functions
CO 3 compute multiple integrals and apply them to find areas and volumes of geometrical shapes,
mass and centre of gravity of plane laminas
CO 4 perform various tests to determine whether a given series is convergent, absolutely
convergent or conditionally convergent
CO 5 determine the Taylor and Fourier series expansion of functions and learn their applications.
Mapping of course outcomes with program outcomes
PO PO 2 PO 3 PO 4 PO 5 PO 6 PO PO 8 PO 9 PO 10 PO 11 PO 12
1 7
CO 1 3 3 3 3 2 1 1 2 2
CO 2 3 3 3 3 2 1 1 2 2
CO 3 3 3 3 3 2 1 1 2 2
CO 4 3 2 3 2 1 1 1 2 2
CO 5 3 3 3 3 2 1 1 2 2
Assessment Pattern
Bloom’s Category Continuous Assessment Tests End Semester

Test 1 Test 2 Examination
(Marks) (Marks) (Marks)
Remember 10 10 20
Understand 20 20 40
Apply 20 20 40
Analyse
Evaluate
Create
Mark distribution
Total Marks CIE ESE ESE Duration

marks marks
150 50 100 3 hours
Continuous Internal Evaluation Pattern:
Attendance : 10 marks
Continuous Assessment Test (2 numbers) : 25 marks
Assignment/Quiz/Course project : 15 marks
Assignments: Assignment should include specific problems highlighting the applications of the
methods introduced in this course in science and engineering.
End Semester Examination Pattern: There will be two parts; Part A and Part B. Part A contain 10
questions with 2 questions from each module, having 3 marks for each question. Students should
answer all questions. Part B contains 2 questions from each module of which student should answer
any one. Each question can have maximum 2 sub-divisions and carry 14 marks.
Course Level Assessment Questions
Course Outcome 1 (CO1): Solve systems of linear equations, diagonalize matrices and characterise
quadratic forms
𝑥
1. A is a real matrix of order 3 × 3and 𝑋 = 𝑦 . What can you say about the solution of 𝐴𝑋 =
𝑧
0if rank of A is 1? 2 ?3?
3 0 2
2. Given𝐴 = 0 2 0 , find an orthogonal matrix 𝑃that diagonalizes A.
−2 0 0
3. Find out what type of conic section the following quadratic form represents
17𝑥 − 30𝑥 𝑥 + 17𝑥 = 128
−2 2 −3
4. The matrix 𝐴 = 2 1 −6 has an eigen value5 with corresponding Eigen vector𝑋 =
−1 −2 0
1
2 . Find 𝐴 𝑋
−1
Course Outcome 2 (CO2): compute the partial and total derivatives and maxima and minima of
multivariable functions
1. Find the slope of the surface 𝑧 = 𝑥 𝑦 + 5𝑦 in the x-direction at the point (1,-2)
2. Given the function 𝑤 = 𝑥𝑦 + 𝑧, use chain rule to find the instantaneous rate of change of
𝑤at each point along the curve 𝑥 = 𝑐𝑜𝑠𝑡, 𝑦 = 𝑠𝑖𝑛𝑡, 𝑧 = 𝑡
3. Determine the dimension of rectangular box open at the top , having a volume 32 cubic ft
and requiring the least amount of material for it’s construction.
Course Outcome 3(CO3): compute multiple integrals and apply them to find areas and volumes of
geometrical shapes, mass and centre of gravity of plane laminas.
1. Evaluate ∬ (𝑥 + 2𝑦) 𝐷𝐴where D is the region bounded by the parabolas 𝑦 = 2𝑥 and

𝑦 = 1+𝑥
2. Explain how you would find the volume under the surface 𝑧 = 𝑓(𝑥, 𝑦)and over a specific
region 𝐷in the 𝑥𝑦plane using (i) double integral (ii) triple integral?
3. Find the mass and centre of gravity of a triangular lamina with vertices (0,0), (2,1), (0,3) if
the density function is 𝑓(𝑥, 𝑦) = 𝑥 + 𝑦
4. Use spherical coordinates to evaluate ∭ (𝑥 + 𝑦 + 𝑧 ) 𝑑𝑉where B is the unit ball

defined by 𝐵 = {(𝑥, 𝑦, 𝑧): 𝑥 + 𝑦 + 𝑧 ≤ 1}
Course Outcome 4 (CO4): perform various tests to determine whether a given series is convergent,
absolutely convergent or conditionally convergent.
1. What is the difference between a sequence and a series and when do you say that they are
convergent? Divergent?
∞
2. Determine whether the series ∑ converges or diverges.
∞( )
3. Is the series ∑ convergent? Absolutely convergent? Conditionally convergent?
Course Outcome 5 (CO5): determine the Taylor and Fourier series expansion of functions and learn
their applications.
1. Assuming the possibility of expansion find the Maclaurin series expansion of
𝑓(𝑥) = (1 + 𝑥) for|𝑥| < 1where 𝑘is any real number. What happens if 𝑘is a positive
integer?
2. Use Maclaurin series of 𝑙𝑛(1 + 𝑥), −1 < 𝑥 ≤ 1to find an approximate value of𝑙𝑛2.
3. Find the Fourier series of the function𝑓(𝑥) = 𝑥 , −2 ≤ 𝑥 < 2, 𝑓(𝑥 + 4) = 𝑓(𝑥). Hence
using Parseval’s identity prove that 1 + + + … =
4. Expand the function 𝑓(𝑥) = 𝑥 (0 < 𝑥 < 1⁄2) into a (i) Fourier sine series (ii) Fourier cosine
series.
Model Question paper
QP CODE: PAGES:3
Reg No:______________
Name :______________
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY FIRST SEMESTER B.TECH DEGREE EXAMINATION,
MONTH & YEAR
Course Code: MAT 101
Max. Marks: 100 Duration: 3 Hours
LINEAR ALGEBRA AND CALCULUs
(2019-Scheme)
(Common to all branches)
PART A
(Answer all questions, each question carries 3 marks)
1 2 −1
1. Determine the rank of the matrix 𝐴 = −2 −4 2 .
3 6 −3
2 0
2. Write down the eigen values of = . What are the eigen values of 𝑃 𝐴𝑃 where
0 −1
−4 2
𝑃= ?
3 −1
3. Find 𝑓 (1,3) and 𝑓 (1,3) for the function 𝑓(𝑥, 𝑦) = 2𝑥 𝑦 + 2𝑦 + 4𝑥.
4. Show that the function 𝑢(𝑥, 𝑡) = sin (𝑥 − 𝑐𝑡) is a solution of the equation =𝑐
.
5. Use double integral to find the area of the region enclosed between the parabolas 𝑦 = 𝑥
and the line 𝑦 = 2𝑥.
6. Use polar coordinates to evaluate the area of the region bounded by 𝑥 + 𝑦 = 4, the line
𝑦 = 𝑥 and the y axis in the first quadrant
7. Test the convergence of the series ∑∞ .
8. Test the convergence of the alternating series ∑∞ (−1) using Leibnitz test.
9. Find the Taylor series expansion of 𝑠𝑖𝑛𝜋𝑥about𝑥 = .
10. Find the values to which the Fourier series of
𝑓(𝑥) = 𝑥for−𝜋 < 𝑥 < 𝜋, with 𝑓(𝑥 + 2𝜋) = 𝑓(𝑥) converges (10x3=30)
PART B
(Answer one full question from each module, each question carries 14 marks)
Module -I
11. (a) Solve the following system of equations
𝑦 + 𝑧 − 2𝑤 = 0
2𝑥 − 3𝑦 − 3𝑧 + 6𝑤 = 2
4𝑥 + 𝑦 + 𝑧 − 2𝑤 = 4
−2 2 −3
(b) Find the eigen values and eigen vectors of the matrix 2 1 −6
−1 −2 0
−1 2 −2
12. (a) Diagonalize the matrix 2 4 1
2 1 4
(b) What kind of conic section the quadratic form3𝑥 + 22𝑥 𝑥 + 3𝑥 = 0 represents?
Transform it to principal axes.
Module - II
13. (a) Find the local linear approximation to 𝑓(𝑥, 𝑦) = 𝑥 + 𝑦 at the point (3, 4).Use it to
approximate 𝑓(3.04,3.98)
(b) Let 𝑤 = 𝑥 + 𝑦 + 𝑧 , 𝑥 = 𝑐𝑜𝑠𝜃, 𝑦 = 𝑠𝑖𝑛𝜃, 𝑧 = 𝑡𝑎𝑛𝜃. Use chain rule to find when
𝜃= .
14. (a) Let 𝑧 = 𝑓(𝑥, 𝑦) where 𝑥 = 𝑟𝑐𝑜𝑠𝜃, 𝑦 = 𝑟𝑠𝑖𝑛𝜃, prove that
+ = + .
(b) Locate all relative maxima, relative minima and saddle points
𝑓(𝑥, 𝑦) = 𝑥𝑦 + + (𝑎 ≠ 0, 𝑏 ≠ 0).
Module - III
15. (a) Evaluate∬ (2𝑥 𝑦 + 9𝑦 ) 𝑑𝑥𝑑𝑦 where D is the region bounded by 𝑦 = 𝑥 and 𝑦 = 2√𝑥
(b) Evaluate ∫ ∫ 𝑒 𝑑𝑥𝑑𝑦 changing the order of integration.
√
16. (a) Find the volume of the solid bounded by the cylinder 𝑥 + 𝑦 = 4 and the planes
𝑦 + 𝑧 = 4 and 𝑧 = 0..
(b) Evaluate ∭ 1 − 𝑥 − 𝑦 − 𝑧 𝑑𝑥𝑑𝑦𝑑𝑧, taken throughout the volume of
the sphere 𝑥 + 𝑦 + 𝑧 = 1, by transforming to spherical polar coordinates
Module - IV
17. (a) Test the convergence of the series
(i) ∑∞ (ii) ∑∞
!
( )!
(b) Determine the convergence or divergence of the series ∑∞ (−1)
( )!
18. (a) Check whether the series ∑∞ (−1) ( )!
is absolutely convergent, conditionally
convergent or divergent.
. . . . . .
(b) Test the convergence of the series 1 + .
+ . .
+ . . .
+⋯
Module - V
19. (a) Obtain the Fourier series of for𝑓(𝑥) = 𝑒 , in the interval 0 < 𝑥 < 2𝜋.with 𝑓 𝑥 +
( )
2𝜋 = 𝑓(𝑥). Hence deduce the value of∑∞ .
𝑖𝑓 0 < 𝑥 <
(b) Find the half range sine series of 𝑓(𝑥) = ( )
𝑖𝑓 <𝑥<𝐿
20. (a)Expand (1 + 𝑥) .as a Taylor series about 𝑥 = 0and state the region of convergence of
the series.
(b) Find the Fourier series for 𝑓(𝑥) = 𝑥 in the interval −𝜋 < 𝑥 < 𝜋
with 𝑓(𝑥 + 2𝜋) = 𝑓(𝑥).Hence show that + + +⋯ = . (14X5=70)
Syllabus
Module 1 (Linear algebra)
(Text 2: Relevant topics from sections 7.3, 7.4, 7.5, 8.1,8.3,8.4)
Systems of linear equations, Solution by Gauss elimination, row echelon form and rank of a matrix,
fundamental theorem for linear systems (homogeneous and non-homogeneous, without proof),
Eigen values and eigen vectors. Diagonaliztion of matrices, orthogonal transformation, quadratic
forms and their canonical forms.
Module 2 (multivariable calculus-Differentiation)
(Text 1: Relevant topics from sections 13.3, 13.4, 13.5, 13.8)
Concept of limit and continuity of functions of two variables, partial derivatives, Differentials, Local
Linear approximations, chain rule, total derivative, Relative maxima and minima, Absolute maxima
and minima on closed and bounded set.
Module 3(multivariable calculus-Integration)
(Text 1: Relevant topics from sections 14.1, 14.2, 14.3, 14.5, 14.6, 14.8)
Double integrals (Cartesian), reversing the order of integration, Change of coordinates (Cartesian to
polar), finding areas and volume using double integrals, mass and centre of gravity of
inhomogeneous laminas using double integral. Triple integrals, volume calculated as triple integral,
triple integral in cylindrical and spherical coordinates (computations involving spheres, cylinders).
Module 4 (sequences and series)
(Text 1: Relevant topics from sections 9.1, 9.3, 9.4, 9.5, 9.6)
Convergence of sequences and series, convergence of geometric series and p-series(without proof),
test of convergence (comparison, ratio and root tests without proof); Alternating series and Leibnitz
test, absolute and conditional convergence.
Module 5 (Series representation of functions)
(Text 1: Relevant topics from sections 9.8, 9.9. Text 2: Relevant topics from sections 11.1, 11.2,
11.6 )
Taylor series (without proof, assuming the possibility of power series expansion in appropriate
domains), Binomial series and series representation of exponential, trigonometric, logarithmic
functions (without proofs of convergence); Fourier series, Euler formulas, Convergence of Fourier
series (without proof), half range sine and cosine series, Parseval’s theorem (without proof).
Text Books
1. H. Anton, I. Biven,S.Davis, “Calculus”, Wiley, 10th edition, 2015.
2. Erwin Kreyszig, Advanced Engineering Mathematics, 10 thEdition, John Wiley & Sons, 2016.
Reference Books
1. J. Stewart, Essential Calculus, Cengage, 2nd edition, 2017
2. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9 th Edition, Pearson, Reprint,
2002.
3. Peter V. O'Neil, Advanced Engineering Mathematics , Cengage, 7th Edition, 2012
4. Veerarajan T., Engineering Mathematics for first year, Tata McGraw-Hill, New Delhi, 2008.
5. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36 Edition, 2010.
Course Contents and Lecture Schedule
No Topic No. of Lectures
1 Linear Algebra (10 hours)
1.1 Systems of linear equations, Solution by Gauss elimination 1
1.2 Row echelon form, finding rank from row echelon form, fundamental 3
theorem for linear systems
1.3 Eigen values and eigen vectors 2
1.4 Diagonaliztion of matrices, orthogonal transformation, quadratic forms 4

and their canonical forms.
2 Multivariable calculus-Differentiation (8 hours)
2.1 Concept of limit and continuity of functions of two variables, partial 2

derivatives
2.2 Differentials, Local Linear approximations 2
2.3 Chain rule, total derivative 2
2.4 Maxima and minima 2
3 Multivariable calculus-Integration (10 hours)
3.1 Double integrals (Cartesian)-evaluation 2
3.2 Change of order of integration in double integrals, change of coordinates 2

(Cartesian to polar),
3.3 Finding areas and volumes, mass and centre of gravity of plane laminas 3
3.4 Triple integrals 3
4 Sequences and series (8 hours)
4.1 Convergence of sequences and series, geometric and p-series 2
4.2 Test of convergence( comparison, ratio and root ) 4
4.3 Alternating series and Leibnitz test, absolute and conditional convergence 2
5 Series representation of functions (9 hours)
5.1 Taylor series, Binomial series and series representation of exponential, 3

trigonometric, logarithmic functions;
5.2 Fourier series, Euler formulas, Convergence of Fourier series(Dirichlet’s 3

conditions)
5.3 Half range sine and cosine series, Parseval’s theorem. 3

PHT ENGINEERING PHYSICS A CATEGORY L T P CREDIT YEAR OF
100 (FOR CIRCUIT BRANCHES) INTRODUCTION
BSC 3 1 0 4 2019
Preamble: The aim of the Engineering Physics Program is to offer students a solid background in the
fundamentals of Physics and to impart that knowledge in engineering disciplines. The
program is designed to develop scientific attitudes and enable the students to correlate
the concepts of Physics with the core programmes
Prerequisite: Higher secondary level Physics, Mathematical course on vector calculus,

differential equations and linear algebra
CO 1 Compute the quantitative aspects of waves and oscillations in engineering systems.
CO 2 Apply the interaction of light with matter through interference, diffraction and identify
these phenomena in different natural optical processes and optical instruments.
CO 3 Analyze the behaviour of matter in the atomic and subatomic level through the principles of
quantum mechanics to perceive the microscopic processes in electronic devices.
CO 4 Classify the properties of magnetic materials and apply vector calculus to static magnetic
fields and use Maxwell’s equations to diverse engineering problems
CO 5 Analyze the principles behind various superconducting applications, explain the working of
solid state lighting devices and fibre optic communication system
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10 PO 11 PO 12
CO 1 3 2 1 2 1
CO 2 3 2 1 2 1
CO 3 3 2 1 2 1
CO 4 3 1 1 2 1
CO 5 3 1 1 2 1
Assessment Pattern
Continuous Assessment Tests

Bloom’s Category Test 1 Test 2 End Semester Examination
Remember 15 15 30
Understand 25 25 50
Apply 10 10 20
Analyse
Evaluate
Create
Mark distribution

marks marks
150 50 100 3 hours
Course Outcome 1 (CO1):
1. Explain the effect of damping force on oscillators.
2. Distinguish between transverse and longitudinal waves.
3. (a) Derive an expression for the fundamental frequency of transverse vibration in a

stretched string.
(b) Calculate the fundamental frequency of a string of length 2 m weighing 6 g kept

stretched by a load of 600 kg.
1. Explain colours in thin films.
2. Distinguish between Fresnel and Fraunhofer diffraction.
3. (a) Explain the formation of Newton’s rings and obtain the expression for radii of bright and
dark rings in reflected system. Also explain how it is used to determine the wavelength of
a monochromatic source of light.
(b) A liquid of refractive index µ is introduced between the lens and glass plate.
What happens to the fringe system? Justify your answer.
1. Give the physical significance of wave function ?
2. What are excitons ?
3. (a) Solve Schrodinger equation for a particle in a one dimensional box and obtain its
energy eigen values and normalised wave functions.
(b) Calculate the first three energy values of an electron in a one dimensional box of width
1 A0 in electron volt.
1. Compare displacement current and conduction current.
2. Mention any four properties of ferro magnetic materials.
3. (a) Starting from Maxwell’s equations, derive the free space electromagnetic wave
equation and show that velocity of electromagnetic wave is 1/ (µo εo) ½
(b) An electromagnetic wave is described by E = 100 exp 8πi [10 14 t – (10 6 z / 3)] V/m.
Find the direction of propagation of the wave,speed of the wave and magnetic flux
density in the wave.
1. Explain the working of a solar cell.
2. Distinguish between Type I and Type II super conductors.
3. (a) Define numerical aperture and derive an expression for it.
(b) Explain the working of intensity modulated fibre optic sensor.

QP CODE: PAGES:3
Reg No:______________
Name :______________
MONTH & YEAR
Course Code: PHT 100
Course Name: Engineering Physics A
PART A
Answer all Questions. Each question carries 3 Marks
1. Compare electrical and mechanical oscillators
2. Distinguish between longitudinal and transverse waves
3. Write a short note on antireflection coating.
4. Diffraction of light is not as evident in daily experience as that of sound waves. Give reason.
5. State and explain Heisenberg’s Uncertainty principle. With the help of it explain natural
line broadening.
6. Explain surface to volume ratio of nanomaterials.
7. State Faraday’s laws of electromagnetic induction.
8. Compare displacement current and conduction current
9. List four important applications of superconductors.
10. Give the working principle of LED. (10x3=30)
PART B
Answer any one full question from each module. Each question carries 14 Marks
Module 1
11. (a) Derive the differential equation of damped harmonic oscillator and deduce its
solution.Discuss the cases of over damped, critically damped and under damped cases. (10)
(b) The frequency of a tuning fork is 500 Hz and its Q factor is 7×10 4. Find the relaxation time.
Also calculate the time after which its energy becomes 1/10 of its initial undamped value.(4)
12. (a) Derive an expression for the velocity of propagation of a transverse wave in a stretched
string. Deduce laws of transverse vibrations. (10)
(b) The equation of transverse vibration of a stretched string is given by y =0.00327 sin (72.1x-
2.72t)m, in which the numerical constants are in S.I units. Evaluate (i) Amplitude (ii) Wavelength
(iii) Frequency and (iv)Velocity of the wave. (4)
Module 2
13.(a)Explain the formation of Newton’s rings and show that the radius of dark ring is
proportional to the square root of natural numbers. How can we use Newton’s rings
experiment to determine the refractive index of a liquid. (10)
(b) Two pieces of plane glass are placed together with a piece of paper between two at one
end. Find the angle of the wedge in seconds if the film is viewed with a monochromatic light of
wavelength 4800Å. Given β = 0.0555 cm. (4)
14. (a) Explain the diffraction due to a plane transmission grating. Obtain the grating equation. (10)
(b) A grating has 6000 lines per cm. Find the angular separation of the two yellow lines
of mercury of wavelengths 577 nm and 579 nm in the second order. (4)
Module 3
15.(a) Derive time dependent and independent Schrodinger equations. (10)
(b) An electron is confined to one dimensional potential box of length 2Å. Calculate the energies
corresponding to the first and second quantum states in eV. (4)
16.(a) Classify nanomaterials based on dimensionality of quantum confinement and explain the
following nanostructures. (i) nano sheets (ii) nano wires (iii) quantum dots. (10)
(b) Find the de Broglie wavelength of electron whose kinetic energy is 15 eV. (4)
Module 4
17.(a) State Poynting’s Theorem. Calculate the value of Poynting vector at the surface of the sun if
the power radiated by the sun is 3.8 x 10 26 W and its radius is 7 X 10 8 m. (5)
(b) Distinguish between paramagnetic, diamagnetic and ferromagnetic materials. (9)
18.(a) Starting from Maxwell’s Equations, derive electromagnetic wave equations in free space. (10)
(b) If the magnitude of H in a plane wave is 1 A/m, find the magnitude of E in free space. (4)
Module 5
19.(a) Show that superconductors are perfect diamagnets. Distinguish between Type I and
Type II superconductors with suitable examples. (10)
(b) Write a short note on high temperature superconductors. (4)
20.(a) Define numerical aperture of an optic fibre and derive an expression for the NA of a step
index fibre with a neat diagram. (10)
(b) Calculate the numerical aperture and acceptance angle of a fibre with a core refractive index
of 1.54 and a cladding refractive index of 1.50 when the fibre is inside water of refractive
index 1.33. (4) (14x5=70)
Syllabus
ENGINEERING PHYSICS A
(FOR CIRCUIT BRANCHES)
Module 1
Oscillations and Waves
Harmonic oscillations, Damped harmonic motion-Derivation of differential equation and its solution,
Over damped, Critically damped and Under damped Cases, Quality factor-Expression, Forced
oscillations-Differential Equation-Derivation of expressions for amplitude and phase of forced
oscillations, Amplitude Resonance-Expression for Resonant frequency, Quality factor and Sharpness
of Resonance, Electrical analogy of mechanical oscillators
Wave motion- Derivation of one dimensional wave equation and its solution, Three dimensional
wave equation and its solution (no derivation), Distinction between transverse and longitudinal
waves, Transverse vibration in a stretched string, Statement of laws of vibration
Module 2
Wave Optics
Interference of light-Principle of superposition of waves, Theory of thin films - Cosine law (Reflected
system), Derivation of the conditions of constructive and destructive Interference, Interference due
to wedge shaped films -Determination of thickness and test for optical planeness, Newton’s rings -
Measurement of wavelength and refractive index, Antireflection coatings
Diffraction of light, Fresnel and Fraunhofer classes of diffraction, Diffraction grating-Grating

equation, Rayleigh criterion for limit of resolution, Resolving and Dispersive power of a grating with
expression (no derivation)
Module 3
Quantum Mechanics & Nanotechnology
Introduction for the need of Quantum mechanics, Wave nature of Particles, Uncertainty principle,
Applications-Absence of electrons inside a nucleus and Natural line broadening mechanism,
Formulation of time dependent and independent Schrodinger wave equations-Physical meaning of
wave function, Particle in a one dimensional box- Derivation for normalised wave function and
energy eigen values, Quantum Mechanical Tunnelling (Qualitative)
Introduction to nanoscience and technology, Increase in surface to volume ratio for nanomaterials,
Quantum confinement in one dimension, two dimension and three dimension-Nano sheets, Nano
wires and Quantum dots, Properties of nanomaterials-mechanical, electrical and optical,
Applications of nanotechnology (qualitative ideas)
Module 4
Magnetism & Electro Magnetic Theory
Magnetic field and Magnetic flux density, Gauss’s law for Magnetic flux density, Ampere’s Circuital
law, Faraday’s law in terms of EMF produced by changing magnetic flux, Magnetic permeability and
susceptibility, Classification of magnetic materials-para, dia and ferromagnetic materials
Fundamentals of vector calculus, concept of divergence, gradient and curl along with physical
significance, Line, Surface and Volume integrals, Gauss divergence theorem & Stokes’ theorem,
Equation of continuity, Derivation of Maxwell’s equations in vacuum, Comparison of displacement
current with conduction current. Electromagnetic waves, Velocity of Electromagnetic waves in free
space, Flow of energy and Poynting’s vector (no derivation)
Module 5
Superconductivity & Photonics
Superconducting phenomena, Meissner effect and perfect diamagnetism, Types of superconductors-
Type I and Type II, BCS Theory (Qualitative), High temperature superconductors-Applications of
super conductivity
Introduction to photonics-Photonic devices-Light Emitting Diode, Photo detectors -Junction and PIN
photodiodes, Solar cells-I-V Characteristics, Optic fibre-Principle of propagation of light, Types of
fibres-Step index and Graded index fibres, Numerical aperture –Derivation, Fibre optic
communication system (block diagram), Industrial, Medical and Technological applications of optical
fibre, Fibre optic sensors-Intensity Modulated and Phase modulated sensors.
Text Books
1. M.N.Avadhanulu, P.G.Kshirsagar,TVS Arun Murthy “A Text book of Engineering Physics”, S.Chand

&Co., Revised Edition 2019
2. H.K.Malik , A.K. Singh, “Engineering Physics” McGraw Hill Education, Second Edition 2017
Reference Books
1. Arthur Beiser, “Concepts of Modern Physics ", Tata McGraw Hill Publications, 6th Edition
2003
2. D.K. Bhattacharya, Poonam Tandon, “Engineering Physics”, Oxford University Press, 2015
3. Md.N.Khan & S.Panigrahi “Principles of Engineering Physics 1&2”, Cambridge University

Press, 2016
4. Aruldhas G., “Engineering Physics”, PHI Pvt. Ltd., 2015
5. Ajoy Ghatak, “Optics”, Mc Graw Hill Education, Sixth Edition, 2017
6. T. Pradeep, “Nano:The Essentials’’, McGraw Hill India Ltd, 2007
7. Halliday, Resnick, Walker, “Fundamentals of Physics’’, John Wiley & Sons.Inc, 2001
8. David J Griffiths, “Introduction to Electrodynamics’’, Addison-Wesley publishing, 3rd Edition,

1999
9. Premlet B., “Advanced Engineering Physics”, Phasor Books,10th edition,2017
10. I. Dominic and. A. Nahari, “A Text Book of Engineering physics”, Owl Books Publishers,
Revised edition, 2016
1 Oscillations and Waves (9 hours)
1.1 Harmonic oscillations, Damped harmonic motion-Derivation of 2 hrs

differential equation and its solution, Over damped, Critically damped
and Under damped Cases, Quality factor-Expression
1.2 Forced oscillations-Differential Equation-Derivation of expressions for
amplitude and phase of forced oscillations, Amplitude Resonance- 3hrs
Expression for Resonant frequency, Quality factor and Sharpness of
Resonance, Electrical analogy of mechanical oscillators
1.3 Wave motion- Derivation of one dimensional wave equation and its
solution, Three dimensional wave equation and its solution (no
derivation) 2 hrs
1.4 Distinction between transverse and longitudinal waves. Transverse 2 hrs
vibration in a stretched string, Statement of laws of vibration
2 Wave Optics (9 hours)
2.1 Interference of light-Principle of superposition of waves, Theory of thin 2 hrs

films - Cosine law (Reflected system), Derivation of the conditions of
constructive and destructive Interference
2.2 Interference due to wedge shaped films -Determination of thickness 4 hr
and test for optical planeness, Newton’s rings - Measurement of
wavelength and refractive index, Antireflection coatings
2.3 Diffraction of light, Fresnel and Fraunhofer classes of diffraction, 2 hrs
Diffraction grating-Grating equation
2.4 Rayleigh criterion for limit of resolution, Resolving and Dispersive 1 hr
power of a grating with expression (no derivation)
3 Quantum Mechanics &Nanotechnology (9hours)
3.1 Introduction for the need of Quantum mechanics, Wave nature of 2 hrs
Particles, Uncertainty principle, Applications-Absence of electrons
inside a nucleus and Natural line broadening mechanism
3.2 Formulation of time dependent and independent Schrodinger wave 4 hrs
equations-Physical Meaning of wave function, Particle in a one
dimensional box- Derivation for normalised wave function and energy
eigen values, Quantum Mechanical Tunnelling (Qualitative)
3.3 Introduction to nanoscience and technology, Increase in surface to 2 hrs
volume ratio for nanomaterials, Quantum confinement in one
dimension, two dimension and three dimension-Nano sheets, Nano
wires and Quantum dots
3.4 Properties of nanomaterials-mechanical, electrical and optical 1 hr
4 Magnetism & Electro Magnetic Theory (9 hours)
4.1 Magnetic field and Magnetic flux density, Gauss’s law for Magnetic flux 2 hrs
density, Ampere’s Circuital law, Faraday’s law in terms of EMF
produced by changing magnetic flux
4.2 Explanation for Magnetic permeability and susceptibility Classification 1 hr
of magnetic materials- para, dia and ferromagnetic materials
4.3 Fundamentals of vector calculus, concept of divergence, gradient and 2 hrs
curl along with physical significance, Line, Surface and Volume integrals,
Gauss divergence theorem & Stokes’ theorem
4.4 Equation of continuity, Derivation of Maxwell’s equations in vacuum, 4 hrs
Comparison of displacement current with conduction current.
Electromagnetic waves, Velocity of Electromagnetic waves in free
5 Superconductivity &Photonics (9hours)
5.1 Super conducting Phenomena, Meissner effect and perfect 2 hrs
diamagnetism, Types of superconductors-Type I and Type II
5.2 BCS Theory (Qualitative), High temperature superconductors, 2 hrs
Applications of super conductivity
5.3 Introduction to photonics-Photonic devices-Light Emitting Diode, Photo 2 hrs
detectors -Junction and PIN photodiodes, Solar cells-I-V Characteristics
5.4 Optic fibre-Principle of propagation of light, Types of fibres-Step index 3 hrs
and Graded index fibres, Numerical aperture –Derivation, Fibre optic
communication system (block diagram), Industrial, Medical and
Technological applications of optical fibre, Fibre optic sensors-Intensity
Modulated and Phase modulated sensors
PHT ENGINEERING PHYSICS B Category L T P CREDIT Year of
110 (FOR NON-CIRCUIT BRANCHES) Introduction
BSC 3 1 0 4 2019
Preamble: The aim of the Engineering Physics program is to offer students a solid background in the
program is designed to develop scientific attitudes and enable the students to
correlate the concepts of Physics with the core programmes

CO 3 Analyze the behaviour of matter in the atomic and subatomic level through the principles
of quantum mechanics to perceive the microscopic processes in electronic devices.
CO 4 Apply the knowledge of ultrasonics in non-destructive testing and use the principles of
acoustics to explain the nature and characterization of acoustic design and to provide a safe
and healthy environment
CO 5 Apply the comprehended knowledge about laser and fibre optic communication systems in
various engineering applications
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO PO PO
10 11 12
CO 1 3 2 1 2 1
CO 2 3 2 1 2 1
CO 3 3 2 1 2 1
CO 4 3 1 2 1
CO 5 3 2 1 2 1
Assessment Pattern

Remember 15 15 30
Understand 25 25 50
Apply 10 10 20
Analyse
Evaluate
Create
Mark distribution

MARKS MARKS
150 50 100 3 hours


stretched string.

3. (a) Explain the formation of Newton’s rings and obtain the expression for radii of bright
and dark rings in reflected system. Also explain how it is used to determine the
wavelength of a monochromatic source of light.
(b) A liquid of refractive index µ is introduced between the lens and glass plate. What
happens to the fringe system? Justify your answer.
1. Give the physical significance of wave function?

3. (a) Solve Schrodinger equation for a particle in a one dimensional box and obtain its energy
eigen values and normalised wave functions.

1. Explain reverberation and reverberation time.
2. How ultrasonic waves are used in non-destructive testing.
3. (a) With a neat diagram explain how ultrasonic waves are produced by a piezoelectric
oscillator.
(b) Calculate frequency of ultrasonic waves that can be produced by a nickel rod of length 4
cm. (Young’s Modulus = 207 G Pa, Density = 8900 Kg /m3)
Course Outcome 5 (CO 5):

1. Distinguish between spontaneous emission and stimulated emission.
2. Explain optical resonators.
3. (a) Explain the construction and working of Ruby Laser.
(b) Calculate the numerical aperture and acceptance angle of a fibre with a core refractive
index of 1.54 and a cladding refractive index of 1.50 when the fibre is inside water of
refractive index 1.33.
.
QP CODE: PAGES:3
Reg No:______________
Name :______________
MONTH & YEAR
Course Name: Engineering Physics B
Max.Marks: 100 Duration: 3 Hours
PART A
1. Compare electrical and mechanical oscillators.
2. Distinguish between longitudinal and transverse waves.
line broadening.
7. Define sound intensity level. Give the values of threshold of hearing and threshold of pain.
8. Describe the method of non-destructive testing using ultra sonic waves
9. Explain the condition of population inversion
10. Distinguish between step index and graded index fibre. (10x3=30)
PART B
Module 1
solution. Discuss the cases of over damped, critically damped and under damped
cases. (10)
(b) The frequency of a tuning fork is 500 Hz and its Q factor is 7×104. Find the relaxation
time. Also calculate the time after which its energy becomes 1/10 of its initial
undamped value. (4)
(b) The equation of transverse vibration of a stretched string is given by y =0.00327 sin
(72.1x-2.72t ) m, in which the numerical constants are in S.I units. Evaluate (i)
Amplitude (ii) Wavelength (iii) Frequency and (iv) Velocity of the wave. (4)
Module 2
13. (a) Explain the formation of Newton’s rings and show that the radius of dark ring is
experiment to determine the refractive index of a liquid? (10)
(b) Two pieces of plane glass are placed together with a piece of paper between two at
one end. Find the angle of the wedge in seconds if the film is viewed with a
monochromatic light of wavelength 4800Å. Given β = 0.0555 cm. (4)
14. (a) Explain the diffraction due to a plane transmission grating. Obtain the grating equation.
(10)
Module 3
15. (a) Derive time dependent and independent Schrodinger equations. (10)
(b) An electron is confined to one dimensional potential box of length 2Å. Calculate the
energies corresponding to the first and second quantum states in eV. (4)
16. (a) Classify nanomaterials based on dimensionality of quantum confinement and explain the
Module 4
17. (a) Explain reverberation and reverberation time? What is the significance of
Reverberation time. Explain the factors affecting the acoustics of a building and their
corrective measures? (10)
(b) The volume of a hall is 3000 m3. It has a total absorption of 100m2 sabine. If the hall is filled
with audience who add another 80 m2sabine, then find the difference in reverberation time. (4)
18. (a) With a neat diagram explain how ultrasonic waves are produced by piezoelectric
oscillator. Also discuss the piezoelectric method of detection of ultrasonic waves. (10)
(b) An ultrasonic source of 0.09 MHz sends down a pulse towards the sea bed which
returns after 0.55 sec. The velocity of sound in sea water is 1800 m/s. Calculate the
depth of the sea and the wavelength of the pulse. (4)
Module 5
19. (a) Outline the construction and working of Ruby laser. (8)
(b) What is the principle of holography? How is a hologram recorded? (6)
20. (a) Define numerical aperture of an optic fibre and derive an expression for the NA of a step
(b) An optical fibre made with core of refractive index 1.5 and cladding with a fractional
index difference of 0.0006. Find refractive index of cladding and numerical aperture. (4)
(14x5=70)
SYLLABUS
ENGINEERING PHYSICS B (FOR NON-CIRCUIT BRANCHES)
Module 1
Module 2
Wave Optics

Module 3
Applications-Absence of electrons inside a nucleus and Natural line broadening Mechanism,
Formulation of time dependent and independent Schrodinger wave equations-Physical Meaning of
Module 4
Acoustics & Ultrasonics
Acoustics, Classification of sound-Musical sound-Noise, Characteristics of Musical Sounds-Pitch or
frequency-Loudness or Intensity-Measurement of Intensity level-Decibel-Quality or timbre,
Absorption coefficient, Reverberation-Reverberation time-Significance- Sabine’s formula (no
derivation), Factors affecting architectural acoustics and their remedies
Ultrasonics-Production- Magnetostriction effect and Piezoelectric effect, Magnetostriction oscillator

and Piezoelectric oscillator –Working, Detection of ultrasonic waves - Thermal and Piezoelectric
methods, Ultrasonic diffractometer- Expression for the velocity of ultrasonic waves in a liquid ,
Applications of ultrasonic waves -SONAR,NDT and Medical
Module 5
Laser and Fibre optics
Properties of laser, Absorption and emission of radiation, Spontaneous and stimulated emission,
Einstein’s coefficients (no derivation), Population inversion, Metastable states, basic components of
laser, Active medium, Pumping mechanism, Optical resonant cavity, working principle, Construction
and working of Ruby laser and Helium neon laser ,Construction and working of semiconductor
laser(Qualitative) ,Applications of laser, Holography, Difference between hologram and photograph,
Recording of hologram and reconstruction of image, Applications
Optic fibre-Principle of propagation of light, Types of fibres-Step index and Graded index fibres,
Numerical aperture –Derivation, Fibre optic communication system (block diagram), Industrial,
Medical and Technological applications, Fibre optic sensors-Intensity Modulated and Phase
modulated sensors
Text Books
&Co., Revised Edition, 2019.
2. H.K.Malik , A.K. Singh, “Engineering Physics” McGraw Hill Education, Second Edition, 2017.
Reference Books
1. Arthur Beiser, “Concepts of Modern Physics ", Tata McGraw Hill Publications, 6th Edition 2003
3. Md.N.Khan & S.Panigrahi “Principles of Engineering Physics 1&2”, Cambridge University Press,
2016
7. B. B. Laud, “Lasers and Non linear optics”, New age International Publishers, 2nd Edition ,2005
8. Premlet B., “Advanced Engineering Physics”, Phasor Books,10th edition ,2017
9. I. Dominic and. A. Nahari, “A Text Book of Engineering physics”, Owl Books Publishers, Revised
edition, 2016
1 Oscillations and Waves ( 9 hours)

derivation) 2 hrs
1.4 Distinction between transverse and longitudinal waves, Transverse 2 hrs

2.2 Interference due to wedge shaped films -Determination of thickness 4 hrs
4 Acoustics & Ultrasonics (9hrs)
4.1 Acoustics, Classification of sound-Musical sound-Noise, Characteristics 3 hrs

of Musical Sounds-Pitch or frequency-Loudness or Intensity-
Measurement of Intensity level-Decibel-Quality or timbre, Absorption
coefficient, Reverberation-Reverberation time-Significance- Sabine’s
formula (no derivation)
4.2 Factors affecting architectural acoustics and their remedies 1 hr
4.3 Ultrasonics-Production- Magnetostriction effect and Piezoelectric 3hrs

effect, Magnetostriction oscillator and Piezoelectric oscillator –
Working, Detection of ultrasonic waves - Thermal and Piezoelectric
methods
4.4 Ultrasonic diffractometer- Expression for the velocity of ultrasonic 2 hr
waves in a liquid ,Applications of ultrasonic waves -SONAR,NDT and
Medical.
5 Laser and Fibre optics ( 9hours)
5.1 Properties of laser, Absorption and emission of radiation, Spontaneous 2 hrs

and stimulated emission, Einstein’s coefficients (no derivation),
Population inversion, Metastable states, basic components of laser,
Active medium, Pumping mechanism, Optical resonant cavity, working
principle
5.2 Construction and working of Ruby laser and Helium neon laser 3 hrs
,Construction and working of semiconductor laser(Qualitative)
Applications of laser
5.3 Holography, Difference between hologram and photograph, Recording 1 hr
of hologram and reconstruction of image, Applications
Technological applications, Fibre optic sensors-Intensity Modulated and
Phase modulated sensors
CYT ENGINEERING CHEMISTRY CATEGORY L T P CREDIT YEAR OF
100 INTRODUCTION
BSC 3 1 0 4 2019
Preamble: To enable the students to acquire knowledge in the concepts of chemistry for engineering
applications and to familiarize the students with different application oriented topics like
spectroscopy, electrochemistry, instrumental methods etc. Also familiarize the students with topics
like mechanism of corrosion, corrosion prevention methods, SEM, stereochemistry, polymers,
desalination etc., which enable them to develop abilities and skills that are relevant to the study and
practice of chemistry.
Prerequisite: Concepts of chemistry introduced at the plus two levels in schools
Course outcomes: After the completion of the course the students will be able to
CO 1 Apply the basic concepts of electrochemistry and corrosion to explore its possible
applications in various engineering fields.
CO 2 Understand various spectroscopic techniques like UV-Visible, IR, NMR and its
applications.
CO 3 Apply the knowledge of analytical method for characterizing a chemical mixture or a
compound. Understand the basic concept of SEM for surface characterisation of
nanomaterials.
CO 4 Learn about the basics of stereochemistry and its application. Apply the knowledge of
conducting polymers and advanced polymers in engineering.
CO 5 Study various types of water treatment methods to develop skills for treating
wastewater.
10 11 12
CO 1 1 2 1
CO 2 1 1 1 2
CO 3 1 1 1 2
CO 4 2 1
CO 5 1 1 3
Assessment Pattern
Bloom’s Category Continuous Assessment Tests End Semester Examination

1 2
Remember 15 15 30
Understand 25 25 50
Apply 10 10 20
Analyse
Evaluate
Create
End Semester Examination Pattern: There will be two parts- Part A and Part B. Part A contains 10
questions (2 questions from each module), having 3 marks for each question. Students should
answer all questions. Part B contains 2 questions from each module, of which student should
answer any one. Each question can have maximum 2 subdivisions and carries 14 marks.
1. What is calomel electrode? Give the reduction reaction (3 Marks)
2. List three important advantages of potentiometric titration (3 Marks)
3. (a) Explain how electroless plating copper and nickel are carried out (10 Marks)
(b) Calculate the emf of the following cell at 30oC, Z n / Zn 2+ (0.1M) // Ag+ (0.01M) // Ag.
Given E0 Zn2+/Zn = -0.76 V, E0 Ag+/Ag = 0.8 V. (4 Marks)
Course Outcome 2 (CO 2)
1. State Beer Lambert’s law (3 Marks)
2. List the important applications of IR spectroscopy (3 Marks)
3. (a) What is Chemical shift? What are factors affecting Chemical shift? How 1H NMR spectrum of
CH3COCH2Cl interpreted using the concept of chemical shift. (10 Marks)
(b) Calculate the force constant of HF molecule, if it shows IR absorption at 4138 cm -1. Given that
atomic masses of hydrogen and fluorine are 1u and 19u respectively. (4 Marks)
1. Distinguish between TGA and DTA (3 Marks)
2. Give two differences between GSC and GLC (3 Marks)

3. (a) Explain the principle, instrumentation and procedure of HPLC (10 Marks)
(b) Interpret TGA of CaC2O4. H2O (4 Marks)
1. Explain the geometrical isomerism in double bonds (3 Marks)
2. What are the rules of assigning R-S notation? (3 Marks)
3. (a) What are conducting polymers? How it is classified? Give the preparation of polyaniline
(10 Marks)
(b) Draw the stereoisomers possible for CH3-(CHOH)2-COOH (4 Marks)
1. What is degree of hardness? (3 Marks)
2. Define BOD and COD (3 Marks)
3. (a) Explain the EDTA estimation of hardness (10 Marks)
(b) Standard hard water contains 20 g of CaCO3 per liter,50 mL of this required 30mL of EDTA
solution, 50mL of sample water required 20mL of EDTA solution. 50mL sample water after boiling
required 14 mL EDTA solution. Calculate the temporary hardness of the given sample of water, in
terms of ppm. (4 Marks)
MODEL QUESTION PAPER
Total Pages:
Reg No.:_______________ Name:__________________________
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FIRST SEMESTER B.TECH DEGREE EXAMINATION
Course Code: CYT100,
Course Name: ENGINEERING CHEMISTRY
PART A
Answer all questions, each carries 3 marks Marks
1 What is potentiometric titration? How the end point is determined graphically? (3)
2 What is Galvanic series? How is it different from electrochemical series? (3)
3 Which of the following molecules can give IR absorption? Give reason? (3)
(a) O2 (b) H2O (c) N2 (d) HCl
4 Which of the following molecules show UV-Visible absorption? Give reason. (3)
(a) Ethane (b) Butadiene (c) Benzene
5 What are the visualization techniques used in TLC? (3)
6 Write the three important applications of nanomaterials. (3)
7 Draw the Fischer projection formula and find R-S notation of (3)
8 Write the structure of a) Polypyrroleb) Kevlar. (3

9 What is break point chlorination? (3)
10 What is reverse osmosis? (3)
PART B
Answer any one full question from each module, each question carries 14 marks
Module 1
11 a) Give the construction of Li-ion cell. Give the reactions that take place at the (10)
electrodes during charging and discharging. What happens to anodic material when
the cell is 100% charged.
b) Calculate the standard electrode potential of Cu, if its electrode potential at 25 °C (4)
2+
is 0.296 V and the concentration of Cu is 0.015 M.
OR
12 a) Explain the mechanism of electrochemical corrosion of iron in oxygen rich and oxygen (10)
deficient acidic and basic environments.
b) Given below are reduction potentials of some species (4)
MnO4- + 8H+ + 5e → Mn2+ + 4H2O; E0 = +1.51 V
Cl2 + 2e → 2Cl- ; E0 = +1.36 V
S2O82- + 2e → 2SO42- ; E0 = +1.98 V
Use the above data to examine whether the acids, dil. HCl and dil. H2SO4 , can be used
to provide acid medium in redox titrations involving KMnO4.
Module 2
13 a) What is spin-spin splitting? Draw the NMR spectrum of (i) CH3 CH2CH2 Br (ii) (10)
CH3CH(Br)CH3 Explain how NMR spectrum can be used to identify the two isomers.
b) A dye solution of concentration 0.08M shows absorbance of 0.012 at 600 nm; while a (4)
test solution of same dye shows absorbance of 0.084 under same conditions. Find the
concentration of the test solution.
OR
14 a) Explain the basic principle of UV-Visible spectroscopy. What are the possible (10)
electronic transitions? Explain with examples.
b) Sketch the vibrational modes of CO2 and H2O. Which of them are IR active? (4)
Module 3
15 a) Explain the principle, instrumentation and procedure involved in gas chromatography. (10)
b) Explain the DTA of CaC2O4.H2O with a neat sketch. (4)
OR
16 a) Explain the various chemical methods used for the synthesis of nanomaterial (10)
b) How TGA is used to analyse the thermal stability of polymers? (4)
Module 4
17 a) What are conformers? Draw thecis and transisomers of 1, 3-dimethylcylohexane. (10)

Which conformer (chair form) is more stable in each case?
b) What is ABS? Give properties and applications. (4)
OR
18 a) Explain the various structural isomers with suitable example. (10)
b) What is OLED? Draw a labelled diagram. (4)
Module 5
19 a) What are ion exchange resins? Explain ion exchange process for removal of hardness (10)
of water? How exhausted resins are regenerated?
b) 50 mL sewage water is diluted to 2000 mL with dilution water; the initial dissolved (4)
oxygen was 7.7 ppm. The dissolved oxygen level after 5 days of incubation was 2.4
ppm. Find the BOD of the sewage.
OR
20 a) What are the different steps in sewage treatment? Give the flow diagram. Explain the (10)
working of trickling filter.
b) Calculate the temporary and permanent hardness of a water sample which contains (4)
[Ca2+] = 160 mg/L, [Mg2+] = 192 mg/L and [HCO3-] = 122 mg/L.
Syllabus
Module 1
Electrochemistry and Corrosion
Introduction - Differences between electrolytic and electrochemical cells - Daniel cell - redox
reactions - cell representation. Different types of electrodes (brief) - Reference electrodes - SHE -
Calomel electrode - Glass Electrode - Construction and Working. Single electrode potential -
definition - Helmholtz electrical double layer -Determination of E0 using calomel
electrode.Determination of pH using glass electrode.Electrochemical series and its applications. Free
energy and EMF - Nernst Equation - Derivation - single electrode and cell (Numericals) -Application -
Variation of emf with temperature. Potentiometric titration - Introduction -Redox titration
only.Lithiumion cell - construction and working.Conductivity- Measurement of conductivity of a
solution (Numericals).
Corrosion-Electrochemicalcorrosion – mechanism. Galvanic series- cathodic protection - electroless

plating –Copper and Nickel plating.
Module 2
Spectroscopic Techniques and Applications
Introduction- Types of spectrum - electromagnetic spectrum - molecular energy levels - Beer

Lambert’s law (Numericals). UV-Visible Spectroscopy – Principle - Types of electronic transitions -
Energy level diagram of ethane, butadiene, benzene and hexatriene. Instrumentation of UV-Visible
spectrometer and applications.IR-Spectroscopy – Principle - Number of vibrational modes -
Vibrational energy states of a diatomic molecule and -Determination of force constant of diatomic
molecule (Numericals) –Applications. 1H NMR spectroscopy – Principle - Relation between field
strength and frequency - chemical shift - spin-spin splitting (spectral problems ) - coupling constant
(definition) - applications of NMR- including MRI (brief).
Module 3
Instrumental Methods and Nanomaterials
Thermal analysis –TGA- Principle, instrumentation (block diagram) and applications – TGA of
CaC2O4.H2O and polymers. DTA-Principle, instrumentation (block diagram) and applications - DTA of
CaC2O4.H2O. Chromatographic methods - Basic principles and applications of column and TLC-
Retention factor. GC and HPLC-Principle, instrumentation (block diagram) - retention time and
applications.
Nanomaterials - Definition - Classification - Chemical methods of preparation - Hydrolysis and

Reduction - Applications of nanomaterials - Surface characterisation -SEM – Principle and
instrumentation (block diagram).
Module 4
Stereochemistry and Polymer Chemistry
Isomerism-Structural, chain, position, functional, tautomerism and matamerism - Definition with

examples - Representation of 3D structures-Newman, Sawhorse, Wedge and Fischer projection of
substituted methane and ethane. Stereoisomerism - Geometrical isomerism in double bonds and
cycloalkanes (cis-trans and E-Z notations). R-S Notation – Rules and examples - Optical isomerism,
Chirality, Enantiomers and Diastereoisomers-Definition with examples.Conformational analysis of
ethane, butane, cyclohexane, mono and di methyl substituted cyclohexane.
Copolymers - Definition - Types - Random, Alternating, Block and Graft copolymers - ABS -
preparation, properties and applications.Kevlar-preparation, properties and applications.Conducting
polymers - Doping -Polyaniline and Polypyrrole - preparation properties and applications. OLED -
Principle, construction and advantages.
Module 5
Water Chemistry and Sewage Water Treatment
Water characteristics - Hardness - Types of hardness- Temporary and Permanent - Disadvantages of

hard water -Units of hardness- ppm and mg/L -Degree of hardness (Numericals) - Estimation of
hardness-EDTA method (Numericals). Water softening methods-Ion exchange process-Principle,
procedure and advantages. Reverse osmosis – principle, process and advantages. Municipal water
treatment (brief) - Disinfection methods - chlorination, ozone andUV irradiation.
Dissolved oxygen (DO) -Estimation (only brief procedure-Winkler’s method), BOD and COD-
definition, estimation (only brief procedure) and significance (Numericals). Sewage water treatment
- Primary, Secondary and Tertiary - Flow diagram -Trickling filter and UASB process.
Text Books
1. B. L. Tembe, Kamaluddin, M. S. Krishnan, “Engineering Chemistry (NPTEL Web-book)”,

2018.
2. P. W. Atkins, “Physical Chemistry”, Oxford University Press, 10th edn., 2014.
Reference Books
1. C. N. Banwell, “Fundamentals of Molecular Spectroscopy”, McGraw-Hill, 4thedn., 1995.
2. Donald L. Pavia, “Introduction to Spectroscopy”, Cengage Learning India Pvt. Ltd., 2015.
3. B. R. Puri, L. R. Sharma, M. S. Pathania, “Principles of Physical Chemistry”, Vishal Publishing

Co., 47th Edition, 2017.
4. H. H. Willard, L. L. Merritt, “Instrumental Methods of Analysis”, CBS Publishers, 7th Edition,

2005.
5. Ernest L. Eliel, Samuel H. Wilen, “Stereo-chemistry of Organic Compounds”, WILEY, 2008.
6. Raymond B. Seymour, Charles E. Carraher, “Polymer Chemistry: An Introduction”, Marcel

Dekker Inc; 4th Revised Edition, 1996.
7. MuhammedArif, Annette Fernandez, Kavitha P. Nair “Engineering Chemistry”, Owl Books,
2019.
8. Ahad J., “Engineering Chemistry”, Jai Publication, 2019.
9. Roy K. Varghese, “Engineering Chemistry”, Crownplus Publishers, 2019.
10. Soney C. George,RinoLaly Jose, “Text Book of Engineering Chemistry”, S. Chand & Company
Pvt Ltd, 2019.
No Topic No. of
Lectures
(hrs)
1 Electrochemistry and Corrosion 9
1.1 Introduction - Differences between electrolytic and electrochemical cells- Daniel 2

cell - redox reactions - cell representation. Different types of electrodes (brief) -
Reference electrodes- SHE - Calomel electrode - Glass Electrode - Construction
and Working.
1.2 Single electrode potential – definition - Helmholtz electrical double layer - 3

Determination of E0 using calomel electrode. Determination of pH using glass
electrode. Electrochemical series and its applications. Free energy and EMF -
Nernst Equation – Derivation - single electrode and cell (Numericals) -Application
-Variation of emf with temperature.
1.3 Potentiometric titration - Introduction -Redox titration only. Lithiumion cell - 2

construction and working. Conductivity- Measurement of conductivity of a
1.4 Corrosion-Electrochemicalcorrosion – mechanism. Galvanic series- cathodic 2

protection - electroless plating –Copper and Nickel plating.
2 Spectroscopic Techniques and Applications 9
2.1 Introduction- Types of spectrum - electromagnetic spectrum - molecular energy 2

levels - Beer Lambert’s law (Numericals).
2.2 UV-Visible Spectroscopy – Principle - Types of electronic transitions - Energy 2

level diagram of ethane, butadiene, benzene and hexatriene. Instrumentation of
UV-Visible spectrometer and applications.
2.3 IR-Spectroscopy – Principle - Number of vibrational modes -Vibrational energy 2

states of a diatomic molecule and -Determination of force constant of diatomic
molecule (Numericals) –Applications.
1
2.4 H NMR spectroscopy – Principle - Relation between field strength and frequency 3
- chemical shift - spin-spin splitting (spectral problems ) - coupling constant
3 Instrumental Methods and Nanomaterials 9
3.1 Thermal analysis –TGA- Principle, instrumentation (block diagram) and 2

applications – TGA of CaC2O4.H2O and polymers. DTA-Principle, instrumentation
(block diagram) and applications - DTA of CaC2O4.H2O.
3.2 Chromatographic methods - Basic principles and applications of column and TLC- 2
Retention factor.
3.3 GC and HPLC-Principle, instrumentation (block diagram) - retention time and 2

applications.
3.4 Nanomaterials - Definition - Classification - Chemical methods of preparation - 3

Hydrolysis and Reduction - Applications of nanomaterials - Surface
characterisation -SEM – Principle and instrumentation (block diagram).
4 Stereochemistry and Polymer Chemistry 9
4.1 Isomerism-Structural, chain, position, functional, tautomerism and matamerism 2

- Definition with examples - Representation of 3D structures-Newman, Sawhorse,
Wedge and Fischer projection of substituted methane and ethane.
Stereoisomerism - Geometrical isomerism in double bonds and cycloalkanes (cis-
trans and E-Z notations).
4.2 R-S Notation – Rules and examples - Optical isomerism, Chirality, Enantiomers 1
and Diastereoisomers-Definition with examples.
4.3 Conformational analysis of ethane, butane, cyclohexane, mono and di methyl 2

substituted cyclohexane.
4.4 Copolymers - Definition - Types - Random, Alternating, Block and Graft 4

copolymers - ABS - preparation, properties and applications. Kevlar-preparation,
properties and applications. Conducting polymers - Doping -Polyaniline and
Polypyrrole - preparation properties and applications. OLED - Principle,
construction and advantages.
5 Water Chemistry and Sewage Water Treatment 9
5.1 Water characteristics - Hardness - Types of hardness- Temporary and Permanent 3

- Disadvantages of hard water -Units of hardness- ppm and mg/L -Degree of
hardness (Numericals) - Estimation of hardness-EDTA method (Numericals).
Water softening methods-Ion exchange process-Principle, procedure and
advantages. Reverse osmosis – principle, process and advantages.
5.2 Municipal water treatment (brief) - Disinfection methods - chlorination, ozone 2

andUV irradiation.
5.3 Dissolved oxygen (DO) -Estimation (only brief procedure-Winkler’s method), BOD 2
and COD-definition, estimation (only brief procedure) and significance
(Numericals).
5.4 Sewage water treatment - Primary, Secondary and Tertiary - Flow diagram - 2
Trickling filter and UASB process.
EST ENGINEERING CATEGORY L T P CREDIT Year of Introduction
100 MECHANICS ESC 2 1 0 3 2019
Preamble: Goal of this course is to expose the students to the fundamental concepts of mechanics
and enhance their problem-solving skills. It introduces students to the influence of applied force
system and the geometrical properties of the rigid bodies while stationary or in motion. After this
course students will be able to recognize similar problems in real-world situations and respond
accordingly.
Prerequisite: Nil
Course Outcomes: After completion of the course the student will be able to:
CO 1 Recall principles and theorems related to rigid body mechanics
CO 2 Identify and describe the components of system of forces acting on the rigid body
Apply the conditions of equilibrium to various practical problems involving different force
CO 3 system.
CO 4 Choose appropriate theorems, principles or formulae to solve problems of mechanics.
CO 5 Solve problems involving rigid bodies, applying the properties of distributed areas and masses
Mapping of course outcomes with program outcomes (Minimum requirement)
CO 1 2 2 - - - - - - - - - -
CO 2 3 3 - - - - - - - - - -
CO 3 3 3 - - - - - - - - - -
CO 4 3 3 - - - - - - - - - -
CO 5 3 3 - - - - - - - - - -
Assessment Pattern

Bloom’s Category Test 1 (Marks) Test 2 (Marks) End Semester Examination (Marks)
Remember 10 10 15
Understand 10 10 15
Apply 30 30 70
Analyse
Evaluate
Create
Mark distribution

marks marks
150 50 100 3 hours

Course Level Assessment Questions:
Part A
Course Outcome 1 (CO1): (One question from each module to meet the course objective 1: To
recall principles and theorems related to rigid body mechanics)
1. Explain D’Alembert’s principle
2. Distinguish static and dynamic friction
3. State and explain perpendicular axis theorem
Course Outcome 2 (CO2) (One question from each module to meet the course objective 2: To
identify and describe the components of system of forces acting on the rigid body)
1. A simply supported beam AB of span 5 m is carrying point loads 5 kN, 3 kN and 2 kN at 1m, 3m
and 4m respectively from support A. Calculate the support reaction at B.
2. A gymnast holding onto a bar, is suspended motionless in mid-air. The bar is supported by two
ropes that attach to the ceiling. Diagram the forces acting on the combination of gymnast and bar
3. While you are riding your bike, you turn a corner following a circular arc. Illustrate the forces that
act on your bike to keep you along the circular path ?
Part B
All the questions under this section shall assess the learning levels corresponding to the course
outcomes listed below.
To apply the conditions of equilibrium to variou
variouss practical problems involving different force
CO 3
system.
CO 4 To choose appropriate theorems, principles or formulae to solve problems of mechanics.
To solve problems involving rigid bodies, applying the properties of distributed areas and
CO 5 masses
1. Two rollers each of weight 100 N are supported by an inclined plane and a vertical wall. Find the
reaction at the points of contact A, B, C. Assume all the surfaces to be smooth.
Course
Description of course outcome Marks
outcome Learning level assessed
allocated
identifier
To apply the conditions of equilibrium Applying – (Sketch the free
CO 3 to various practical problems involving body diagram that represent 4
different force system. equilibrium state of the body )
To choose appropriate theorems, Applying (Choose the equations

CO 4 principles or formulae to solve and formulae required for 4
problems of mechanics. calculation)
To solve problems involving rigid Applying ( Solve the problem

CO 5 bodies, applying the properties of based on the descriptions given 6
distributed areas and masses in CO3 and CO4)
Total 14
2. A cylindrical disc, 50 cm diameter and cm thickness, is in contact with a horizontal conveyor belts
running at uniform speeds of 5 m/s. Assuming there is no slip at points of contact determine (i)
angular velocity of disc (ii) Angular acceleration of disc if velocity of conveyor changes to 8 m/s. Also
compute the moment acting about the axis of the disc in both cases.
Course
allocated
identifier
To apply the conditions of equilibrium to Applying – (Sketch the
CO 3 various practical problems involving different free body diagram that 4
force system. represent state of the
body )
Applying (Choose the
To choose appropriate theorems, principles or
CO 4 equations and formulae 4
formulae to solve problems of mechanics.
required for calculation)
Applying ( Solve the

To solve problems involving rigid bodies,
problem based on the
CO 5 applying the properties of distributed areas 6
descriptions given in CO3
and masses
and CO4)
Total 14
3. Determine the centroid of the given section
Course Marks
outcome Description of course outcome Learning level assessed allocat
identifier ed
To apply the conditions of equilibrium to Applying – (Illustrate the
CO 3 various practical problems involving computation of centroid for 4
different force system. the given geometrical shape)
To choose appropriate theorems, Applying (Choose the
CO 4 principles or formulae to solve problems equations and formulae 4
of mechanics. required for calculation)
To solve problems involving rigid bodies, Applying ( Solve the problem 6

CO 5
applying the properties of distributed based on the descriptions
areas and masses given in CO3 and CO4)
Total 14
4. A rectangular hole is made in a triangular section as shown. Find moment of inertia about the
section x-x passing through the CG of the section and parallel to BC.
Course
allocated
identifier
To apply the conditions of equilibrium to Applying – (Illustrate the 4
CO 3 various practical problems involving different computation of moment

force system. of inertia for the given
geometrical shape)
To choose appropriate theorems, principles
or formulae to solve problems of mechanics.

descriptions given in
and masses
CO3 and CO4)
Total 14
Model Question Paper
QP CODE:
Reg No.:_______________
Name:__________________________ ___
MONTH & YEAR
Course Code: EST 100
ENGINEERING MECHANICS
Max. Marks: 100 Duration: 3 hours
Part A
(Answer all questions; each question carries 3 marks)
2. Distinguish static and dynamic frictioni.
3. State and explain perpendicular axis theorem.
7. Compare damped and undamped free vibrations.
8. State the equation of motion of a rotating rigid body, rotating about its fixed axis.
9. Illustrate the significance of instantaneous centre in the analysis of rigid body undergoing
rotational motion.
10. Highlight the principles of mechanics applied in the evaluation of elastic collusion of rigid bodies.
PART B
Module -I
11. Two identical rollers each of weight 100 N are supported by an inclined plane, making an angle
of 30o with the vertical, and a vertical wall. Find the reaction at the points of contact A, B, C. Assume
all the surfaces to be smooth. (14 marks)
C
A
B
12. A string tied to a wall is made to pass over a pulley placed 2m away from it. A weight P is
attached to the string such that the string stretches by 2m from the support on the wall to the
location of attachment of weight. Determine the force P required to maintain 200 kg body in
position for  = 30o, The diameter of pulley B is negligible. (14 marks)
Module – 2
13. Two blocks A & B are resting against a wall and the floor as shown in figure below. Find the
value of horizontal force P applied to the lower block that will hold the system in equilibrium.
Coefficient of friction are : 0.25 at the floor, 0.3 at the wall and 0.2 between the blocks.
(14 marks)
14. A beam is hinged at A and roller supported at B. It is acted upon by loads as shown below.
Find the reactions at A & B. (14 marks)
Module – 3
section x-x passing through the CG of the section and parallel to BC. (14 marks)
16. Support A has ball and socket connection. Roller support at B prevents motion in the —z
direction. Corner C is tied to D by a rope. The triangle is weightless. Determine the unknown force
components acting at A, B, and C. (14 marks)
Module - 4
17. A cricket ball is thrown by a fielder from a height of 2m at an angle of 300 to the horizontal with
an initial velocity of 20 m/s , hits the wickets at a height of 0.5 m from the ground. How far was the
fielder from the wicket? (14 marks)
18. An engine of weight 500 kN pull a train weighing 1500 kN up an incline of 1 in 100. The train
starts from rest and moves with constant acceleration against a resistance of 5 N/kN. It attains a
maximum speed of 36 kmph in 1 km distance. Determine the tension in the coupling between train
and engine and the traction force developed by the engine. (14marks)
Module – 5
19. A cylindrical disc, 50 cm diameter and 10 cm thickness having mass of 10 kg, is in contact with a
horizontal conveyor belt running at uniform speeds of 5 m/s. Assuming there is no slip at points of
contact determine (i) angular velocity of disc (ii) Angular acceleration of disc if velocity of conveyor
changes to 8 m/s in 10 seconds. Also compute the moment acting about the axis of the disc in both
cases. (14 marks)
20. A wheel rotating about fixed axis at 20 rpm is uniformly accelerated for 70 seconds during which
time it makes 50 revolutions. Find the (i) angular velocity at the end of this interval and (ii) time
required for the velocity to reach 100 revolutions per minute. (14 marks)
SYLLABUS
Module 1
Introduction to Engineering Mechanics-statics-basic principles of statics-Parallelogram law,
equilibrium law, principles of superposition and transmissibility, law of action and reaction(review)
free body diagrams.
Concurrent coplanar forces-composition and resolution of forces-resultant and equilibrium
equations – methods of projections – methods of moments – Varignon’s Theorem of moments.
Module 2
Friction – sliding friction - Coulomb’s laws of friction – analysis of single bodies –wedges, ladder-
analysis of connected bodies .
Parallel coplanar forces – couple - resultant of parallel forces – centre of parallel forces – equilibrium
of parallel forces – Simple beam subject to concentrated vertical loads. General coplanar force
system - resultant and equilibrium equations.
Module 3
Centroid of composite areas- – moment of inertia-parallel axis and perpendicular axis theorems.
Polar moment of inertia,radius of gyration,mass moment of inertia-ring,cylinder and disc.
Theorem of Pappus Guldinus(demonstration only)
Forces in space - vectorial representation of forces, moments and couples –resultant and equilibrium
equations – concurrent forces in space (simple problems only)
Module 4
Dynamics – rectilinear translation - equations of kinematics(review)
kinetics – equation of motion – D’Alembert’s principle. – motion on horizontal and inclined
surfaces, motion of connected bodies. Impulse momentum equation and work energy equation
(concepts only).
Curvilinear translation - equations of kinematics –projectile motion(review), kinetics – equation of
motion. Moment of momentum and work energy equation (concepts only).
Module 5
Rotation – kinematics of rotation- equation of motion for a rigid body rotating about a fixed axis –
rotation under a constant moment.
Plane motion of rigid body – instantaneous centre of rotation (concept only).
Simple harmonic motion – free vibration –degree of freedom- undamped free vibration of spring
mass system-effect of damping(concept only)
Text Books
1. Timoshenko and Young, Engineering Mechanics, McGraw Hill Publishers
2. Shames, I. H., Engineering Mechanics - Statics and Dynamics, Prentice Hall of India.
3. R. C. Hibbeler and Ashok Gupta, Engineering Mechanics, Vol. I statics, Vol II Dynamics, Pearson
Education.
References
1. Merriam J. L and Kraige L. G., Engineering Mechanics - Vols. 1 and 2, John Wiley.
2. Tayal A K, Engineering Mechanics – Statics and Dynamics, Umesh Publications
3. Bhavikkatti, S.S., Engineering Mechanics, New Age International Publishers
4. F.P.Beer abd E.R.Johnston (2011), Vector Mechanics for Engineers, Vol.I-Statics, Vol.II-Dynamics,
9th Ed, Tata McGraw Hill
5. Rajasekaran S and Sankarasubramanian G, Engineering Mechanics - Statics and Dynamics, Vikas
Publishing House Pvt Ltd.
Course Contents and Lecture Schedule:
Course
No. of
Module Topic outcomes
Hours
addressed
1 Module 1 Total: 7
Introduction to engineering mechanics – introduction on statics and

dynamics - Basic principles of statics – Parellogram law, equilibrium CO1 and
1.1 1
law – Superposition and transmissibility, law of action and reaction CO2
(review the topics)
Free body diagrams.

Degree of freedom-types of supports and nature of reactions -
1.2 CO1 and 1
exercises for free body diagram preparation – composition and
CO2
resolution of forces, resultant and equilibrium equations (review the
topics) - numerical exercises for illustration.
Concurrent coplanar forces - analysis of concurrent forces -methods CO1 and
1.3 of projections – illustrative numerical exercise – teacher assisted 1
CO2
problem solving.
Analysis of concurrent forces -methods of moment-Varignon’s CO1 and
1.4 Theorem of Moments - illustrative numerical exercise– teacher 1
CO2
assisted problem solving.
Analysis of concurrent force systems – extended problem solving - CO3,CO4
1.5 1
Session I. and CO5
Analysis of concurrent force systems – extended problem solving - CO3,CO4 1

1.6 and CO5
Session II – learning review quiz.

1.7 and CO5 1
Session III.
2 Module 2 Total: 7
2.1 Friction – sliding friction - Coulomb’s laws of friction – analysis of CO1 and 1
single bodies –illustrative examples on wedges and ladder-teacher CO2
assisted problem solving tutorials using problems from wedges and
ladder.
2.2 Problems on friction - analysis of connected bodies. illustrative CO3, CO4 1
numerical exercise– teacher assisted problem solving. and CO5
2.3 Problems on friction-extended problem solving CO3,C04 1

and CO5
2.4 Parallel coplanar forces – couple - resultant of parallel forces – centre CO1 and 1
of parallel forces – equilibrium of parallel forces – Simple beam CO2
subject to concentrated vertical loads.
2.5 General coplanar force system - resultant and equilibrium equations - CO1 and 1
illustrative examples- teacher assisted problem solving. CO2
2.6 General coplanar force system-resultant and equilibrium equations - CO3, CO4 1
illustrative examples and CO5
2.7 General coplanar force system - Extended problem solving - Quiz to CO3, CO4 1
evaluate learning level. and CO5
3 Module 3 Total: 7
3.1 Centroid of simple and regular geometrical shapes – centroid of CO1 and
figures in combination - composite areas- examples for illustration – CO2 1
problems for practice to be done by self.
3.2 Moment of inertia- parallel axis theorem –examples for illustration - CO1 and
1
problems for practice to be done by self. CO2
3.3 Moment of inertia - perpendicular axis theorem - example for CO1 and
illustration to be given as hand out and discussion on the solved CO2 1
example.
3.4 Solutions to practice problems – problems related to centroid and CO3, CO4 1
moment of inertia - problems for practice to be done by self. and CO5
3.5 Polar moment of inertia, Radius of gyration. CO1 and
1
Mass moment of inertia of ring, cylinder and uniform disc. CO2
Theorem of Pappus Guldinus - Demonstration
3.6 Introduction to forces in space – vectorial representation of forces, CO1,and
moments and couples – simple problems to illustrate vector CO2 1
representations of forces, moments and couples to be done in class.
3.7 Solution to practice problems - resultant and equilibrium equations
for concurrent forces in space – concurrent forces in space - 2 simple CO3,CO4 1
problems to illustrate the application of resultant and equilibrium and CO5
equations for concurrent forces in space.
4 Module 4 Total: 7
Introduction to dynamics – review of rectilinear translation - CO1 and
4.1 equations of kinematics – problems to review the concepts – CO2 1
additional problems involving extended application as exercises .
Solutions to exercises with necessary explanation given as hand out –

introduction to kinetics – equation of motion – D’Alembert’s principle CO1 and
4.2 1
– illustration of the concepts using one numerical exercise from CO2
motion on horizontal and inclined surfaces.
Motion of connected bodies - example for illustration to be given as CO3, CO4 1
4.3 hand out and discussion on the solved example – problems for and CO5
practice to be done by self.
4.4 Motion of connected bodies-extended problem solving. CO3, CO4 1
& CO5
Curvilinear translation - Review of kinematics –projectile motion – 1
simple problems to review the concepts – introduction to kinetics – CO3, CO4
4.5
equation of motion – illustration of the concepts using numerical & CO5
exercises.
4.6 Extended problem solving – rectilinear and curvilinear translation. CO3, CO4 1
& CO5
Concepts on Impulse momentum equation and work energy equation 1
(rectilinear translation – discussions to bring out difference between
4.7 CO1 and
elastic and inelastic collusions).
CO2
Concepts on Moment of momentum and work energy equation
(curvilinear translation).
5 Module 5 Total: 7
Rotation – kinematics of rotation- equation of motion for a rigid body CO1 and 1
5.1 rotating about a fixed axis – simple problems for illustration. CO2
Rotation under a constant moment – teacher assisted problem 1
5.2 solving. CO3,CO4
and CO5
5.3 Rotation under a constant moment - extended problem solving. CO3, CO4 1
and CO5
Plane motion of rigid body- instantaneous centre of rotation (concept CO1 and 1
5.4
only). CO2
Introduction to harmonic oscillation –free vibrations - simple 1

harmonic motion – differential equation and solution.
CO1 and
5.5 Degree of freedom – examples of single degree of freedom (SDOF) CO2
systems – Idealisation of mechanical systems as spring-mass systems
(concept only).
SDOF spring mass system –equation of motion – undamped free 1
vibration response - concept of natural frequency. CO1 and
5.6 Free vibration response due to initial conditions. CO2
Simple problems on determination of natural frequency and free
vibration response to test the understanding level.
Free vibration analysis of SDOF spring-mass systems – Problem solving CO1and 1
5.7
Effect of damping on free vibration response (concept only). CO2
110 GRAPHICS ESC 2 0 2 3 2019
Preamble: To enable the student to effectively perform technical communication through graphical
representation as per global standards.
Prerequisite: NIL
CO 1 Draw the projection of points and lines located in different quadrants

CO 2 Prepare multiview orthographic projections of objects by visualizing them in different
positions
CO 3 Draw sectional views and develop surfaces of a given object
CO 4 Prepare pictorial drawings using the principles of isometric and perspective projections to
visualize objects in three dimensions.
CO 5 Convert 3D views to orthographic views
CO 6 Obtain multiview projections and solid models of objects using CAD tools
PO PO PO PO PO PO PO PO PO PO PO PO
1 2 3 4 5 6 7 8 9 10 11 12
CO 1 3
CO 2 3
CO 3 3 1
CO 4 3 1
CO 5 3 2
CO 6 3 3 3
Assessment Pattern

( 15 Marks) (15 Marks) (100 Marks)
Remember
Understand 5 20
Apply 10 10 80
Analyse
Evaluate
Create
Mark distribution
Total Marks CIE (Marks) ESE (Marks) ESE Duration
150 50 100 3 hours

CIA for section A carries 25 marks (15 marks for 1 test and Class work 10 marks)
CIA for section B carries 15 marks (10 marks for 1 test and Class work 5 marks)
End Semester Examination Pattern:

ESE will be of 3 hour duration on A4 size answer booklet and will be for 100 marks. The question
paper shall contain two questions from each module of Section A only. Student has to answer any
one question from each module. Each question carries 20 marks.

(Questions may be framed based on the outline given under each course outcome)

1. Locate points in different quadrants as per given conditions.
2. Problems on lines inclined to both planes .
3. Find True length, Inclinations and Traces of lines.
Course Outcome 2 (CO2)
1. Draw orthographic views of solids and combination solids
2. Draw views of solids inclined to any one reference plane.
3. Draw views of solids inclined to both reference planes.
1. Draw views of solids sectioned by a cutting plane
2. Find location and inclination of cutting plane given true shape of the section
3. Draw development of lateral surface of solids and also its sectioned views
1. Draw Isometric views/projections of soilds
2. Draw Isometric views/projections of combination of soilds
3. Draw Perspective views of Soilds
1. Draw Orthographic views of solids from given three dimensional view
1. Draw the given figure including dimensions using 2D software
2. Create 3D model using modelling software from the given orthographic views or 3D figure or
from real 3D objects
QP CODE: PAGES:3
Reg No:______________
Name :______________
MONTH & YEAR
ENGINEERING GRAPHICS
Max.Marks:100 Duration: 3 Hours
PART A
Instructions: Retain necessary Construction lines

Show necessary dimensions
Answer any ONE question from each module
Each question carries 20 marks
MODULE I
1. The end point A of a line is 20mm above HP and 10mm in front of VP. The other end of the line is
50mm above HP and 15mm behind VP. The distance between the end projectors is 70mm. Draw
the projections of the line. Find the true length and true inclinations of the line with the principal
planes. Also locate the traces of the line.
2. One end of a line is 20mm from both the principal planes of projection. The other end of the line
is 50mm above HP and 40mm in front of VP. The true length of the line is 70mm. Draw the
projections of the line. Find its apparent inclinations, elevation length and plan length. Also
locate its traces.
MODULE II
3. A pentagonal pyramid of base side 25mm and height 40mm, is resting on the ground on one of
its triangular faces. The base edge of that face is inclined 30o to VP. Draw the projections of the
solid.
4. A hexagonal prism has side 25mm and height 50mm has a corner of its base on the ground and
the long edge containing that corner inclined at 30o to HP and 45o to VP. Draw the projections of
the solid.
MODULE III
5. A triangular prism of base side 40mm and height 70mm is resting with its base on the ground
and having an edge of the base perpendicular to VP. Section the solid such that the true shape of
the section is a trapezium of parallel sides 30mm and 10mm. Draw the projections showing the
true shape. Find the inclination of the cutting plane with the ground plane.
6. Draw the development of a pentagonal pyramid of base side 30mm and height 50mm. A string is
wound from a corner of the base round the pyramid and back to the same point through the
shortest distance. Show the position of the string in the elevation and plan.
MODULE IV
7. The frustum of a cone has base diameter 50mm and top diameter 40mm has a height of 60mm.
It is paced centrally on top of a rectangular slab of size 80x60mm and of thickness 20mm. Draw
the isometric view of the combination.
8. A hexagonal prism has base side 35mm and height 60mm. A sphere of diameter 40mm is
placed centrally on top of it. Draw the isometric projection of the combination.
MODULE V
9. Draw the perspective view of a pentagonal prism, 20mm side and 45mm long lying on one of its
rectangular faces on the ground and having its axis perpendicular to picture plane. One of its
pentagonal faces touches the picture plane and the station point is 50mm in front of PP, 25mm
above the ground plane and lies in a central plane, which is 70mm to the left of the center of the
prism.
10. Draw three orthographic views with dimensions of the object shown in figure below.
(20X5=100)
Time : 3 hours EST110 ENGINEERING GRAPHICS Max. Marks: 100
SCHEME OF VALUATION
1. Locating the points and drawing the projections of the line – 4 marks
Finding true length by any one method – 6 marks
Finding true inclination with VP – 2 marks
Finding true inclination with HP – 2 marks
Locating horizontal trace – 2 marks
Locating vertical trace – 2 marks
Dimensioning and neatness – 2 marks
Total = 20 marks
2. Locating the points and drawing true length of the line – 4 marks
Finding projections by any method – 6 marks
Finding length of elevation and plan – 2 marks
Finding apparent inclinations – 2 marks
Total = 20 marks
3. Drawing initial position plan and elevation – 4 marks
First inclination views – 4 marks
Second inclination views -8 marks
Marking invisible edges – 2 marks
Total = 20 marks
(Any one method or combination of methods for solving can be used.
If initial position is wrong then maximum 50% marks may be allotted for the answer)

Total = 20 marks
(Any one method or combination of methods for solving can be used

Locating section plane as per given condition – 5 marks
Drawing true shape -5 marks
Finding inclination of cutting plane – 2 marks
Total = 20 marks
Development of the pyramid – 6 marks
Locating string in development -2 marks
Locating string in elevation – 3 marks
Locating string in plan – 3 marks
Total = 20 marks
7. Drawing initial positions – 4 marks
Isometric View of Slab -6 marks
Isometric View of Frustum – 10 marks
Total = 20 marks
(Initial position is optional, hence redistribute if needed.
Reduce 4 marks if Isometric scale is taken)

Isometric scale – 4 marks
Isometric projection of prism -5 marks
Isometric projection of sphere – 5 marks
Total = 20 marks
9. Drawing the planes and locating the station point – 4 marks

Locating elevation points – 2 marks
Locating plan points – 2 marks
Drawing the perspective view – 10 marks
Total = 20 marks
10. Drawing the elevation – 8marks
Drawing the plan – 4 marks
Drawing the side view – 4 marks
Total = 20 marks
SYLLABUS
General Instructions:
 First angle projection to be followed
 Section A practice problems to be performed on A4 size sheets
 Section B classes to be conducted on CAD lab
SECTION A
Module 1
Introduction : Relevance of technical drawing in engineering field. Types of lines, Dimensioning, BIS
code of practice for technical drawing.
Orthographic projection of Points and Lines: Projection of points in different quadrants, Projection of
straight lines inclined to one plane and inclined to both planes. Trace of line. Inclination of lines with
reference planes True length of line inclined to both the reference planes.
Module 2
Orthographic projection of Solids: Projection of Simple solids such as Triangular, Rectangle, Square,
Pentagonal and Hexagonal Prisms, Pyramids, Cone and Cylinder. Projection of solids in simple
position including profile view. Projection of solids with axis inclined to one of the reference planes
and with axis inclined to both reference planes.
Module 3
Sections of Solids: Sections of Prisms, Pyramids, Cone, Cylinder with axis in vertical position and cut
by different section planes. True shape of the sections. Also locating the section plane when the
true shape of the section is given.
Development of Surfaces: Development of surfaces of the above solids and solids cut by different
section planes. Also finding the shortest distance between two points on the surface.
Module 4
Isometric Projection: Isometric View and Projections of Prisms, Pyramids, Cone , Cylinder, Frustum of
Pyramid, Frustum of Cone, Sphere, Hemisphere and their combinations.
Module 5
Perspective Projection: Perspective projection of Prisms and Pyramids with axis perpendicular to the
ground plane, axis perpendicular to picture plane.
Conversion of Pictorial Views: Conversion of pictorial views into orthographic views.
SECTION B
(To be conducted in CAD Lab)
Introduction to Computer Aided Drawing: Role of CAD in design and development of new products,
Advantages of CAD. Creating two dimensional drawing with dimensions using suitable software.
(Minimum 2 exercises mandatory)
Introduction to Solid Modelling: Creating 3D models of various components using suitable modelling
software. (Minimum 2 exercises mandatory)
Text Books
1. Bhatt, N.D., Engineering Drawing, Charotar Publishing House Pvt. Ltd.
2. John, K.C. Engineering Graphics, Prentice Hall India Publishers.
Reference Books
1. Anilkumar, K.N., Engineering Graphics, Adhyuth narayan Publishers
2. Agrawal, B. And Agrawal, C.M., Engineering Darwing, Tata McGraw Hill Publishers.
3. Benjamin, J., Engineering Graphics, Pentex Publishers- 3 rd Edition, 2017
4. Duff, J.M. and Ross, W.A., Engineering Design and Visualisation, Cengage Learning.
5. Kulkarni, D.M., Rastogi, A.P. and Sarkar, A.K., Engineering Graphics with AutoCAD, PHI.
6. Luzaddff, W.J. and Duff, J.M., Fundamentals of Engineering Drawing, PHI.
7. Varghese, P.I., Engineering Graphics, V I P Publishers
8. Venugopal, K., Engineering Drawing and Graphics, New Age International Publishers.
No SECTION A No. of
Hours
1 MODULE I
1.1 Introduction to graphics, types of lines, Dimensioning 1
1.2 Concept of principle planes of projection, different quadrants, locating points 2

on different quadrants
1.3 Projection of lines, inclined to one plane. Lines inclined to both planes, 2
trapezoid method of solving problems on lines.
1.4 Problems on lines using trapezoid method 2
1.5 Line rotation method of solving, problems on line rotation method 2
2 MODULE II
2.1 Introduction of different solids, Simple position plan and elevation of solids 2
2.2 Problems on views of solids inclined to one plane 2
2.3 Problems on views of solids inclined to both planes 2
2.4 Practice problems on solids inclined to both planes 2

3 MODULE III
3.1 Introduction to section planes. AIP and AVP. Principle of locating cutting 2
points and finding true shape
3.2 Problems on sections of different solids 2
3.3 Problems when the true shape is given 2
3.4 Principle of development of solids, sectioned solids 2
4 MODULE IV
4.1 Principle of Isometric View and Projection, Isometric Scale. Problems on 2

simple solids
4.2 Isometric problems on Frustum of solids, Sphere and Hemisphere 2
4.3 Problems on combination of different solids 2
5 MODULE V
5.1 Introduction to perspective projection, different planes, station point etc. 2

Perspective problems on pyramids
5.2 Perspective problems on prisms 2
5.3 Practice on conversion of pictorial views into orthographic views 2
SECTION B (To be conducted in CAD lab)
1 Introduction to CAD and software. Familiarising features of 2D software. 2

Practice on making 2D drawings
2 Practice session on 2D drafting 2
3 Introduction to solid modelling and software 2
4 Practice session on 3D modelling 2

EST BASICS OF CIVIL & MECHANICAL CATEGORY L T P CREDIT YEAR OF
120 ENGINEERING INTRODUCTION
ESC 4 0 0 4 2019
Preamble:
Objective of this course is to provide an insight and inculcate the essentials of Civil Engineering
discipline to the students of all branches of Engineering and to provide the students an
illustration of the significance of the Civil Engineering Profession in satisfying the societal needs.
To introduce the students to the basic principles of mechanical engineering
Prerequisite: NIL
Course Outcomes: After completion of the course, the student will be able to
Recall the role of civil engineer in society and to relate the various disciplines of Civil
CO 1 Engineering.
Explain different types of buildings, building components, building materials and

CO 2 building construction
CO 3 Describe the importance, objectives and principles of surveying.
Summarise the basic infrastructure services MEP, HVAC, elevators, escalators and
CO 4
ramps
Discuss the Materials, energy systems, water management and environment for green
CO 5 buildings.
CO 6 Analyse thermodynamic cycles and calculate its efficiency
CO 7 Illustrate the working and features of IC Engines
CO 8 Explain the basic principles of Refrigeration and Air Conditioning
CO 9 Describe the working of hydraulic machines
CO 10 Explain the working of power transmission elements
CO 11 Describe the basic manufacturing, metal joining and machining processes

10 11 12
CO1 3 - - - - 3 2 2 - - - -
CO2 3 2 - 1 3 - - 3 - - - -
CO3 3 2 - - 3 - - - 2 - - -
CO4 3 2 - - 3 - - - 2 - - -
CO5 3 2 - - 3 2 3 - 2 - - -
CO6 3 2
CO7 3 1
CO8 3 1
CO9 3 2
CO10 3 1
CO11 3
Assessment Pattern
Basic Civil Engineering Basic Mechanical Engineering

End End Semester
Bloom’s Category Semester Continuous Examination
Continuous Assessment
Examination Assessment (marks)
Test 1 Test 2 (marks) Test 1 Test 2
marks marks marks marks
Remember 5 5 10 7.5 7.5 15
Understand 20 20 40 12.5 12.5 25
Apply 5 5 10
Analyse
Evaluate
Create
Mark distribution
150 50 100 3 hours
There will be two parts; Part I – Basic Civil Engineering and Part II – Basic Mechanical Engineering.
Part I and PART II carries 50 marks each. For the end semester examination, part I contain 2 parts -
Part A and Part B. Part A contain 5 questions carrying 4 marks each (not exceeding 2 questions from
each module). Part B contains 2 questions from each module out of which one to be answered. Each
question carries 10 mark and can have maximum 2 sub-divisions. The pattern for end semester
examination for part II is same as that of part I. However, student should answer both part I and
part 2 in separate answer booklets.
Course Outcome CO1: To recall the role of civil engineer in society and to relate the various
disciplines of Civil Engineering.
1.Explain relevance of Civil engineering in the overall infrastructural development of the country.
Course outcome 2 (CO2) (One question from each module and not more than two)
Explain different types of buildings, building components, building materials and building
construction
1. Discuss the difference between plinth area and carpet area.
Describe the importance, objectives and principles of surveying.
1. Explain the importance of surveying in Civil Engineering
Summarise the basic infrastructure services MEP, HVAC, elevators, escalators and ramps
1. Explain the civil engineering aspects of elevators, escalators and ramps in buildings
Discuss the Materials, energy systems, water management and environment for green buildings.
1. Discuss the relevance of Green building in society
Section II Answer any 1 full question from each module. Each full question carries 10 marks
Course Outcome 1 (CO1) (Two full question from each module and each question can have
maximum 2 sub-divisions)
To recall the role of civil engineer in society and to relate the various disciplines of Civil Engineering
CO Questions
1. a List out the types of building as per occupancy. Explain any two, each in about five sentences.
b. Discuss the components of a building with a neat figure.
2. a.What are the major disciplines of civil engineering and explain their role in the infrastructural
framework.
b. Explain the role of NBC, KBR & CRZ norms in building rules and regulations prevailing in our
country.
Course Outcome 2 (CO2) & Course Outcome 3 (CO3) (Two full question from each module and
each question can have maximum 2 sub-divisions)
construction & Describe the importance, objectives and principles of surveying.
CO Questions
1. a. What are the different kinds of cement available and what is their use.
b. List the properties of good building bricks. Explain any five.
2. a. List and explain any five modern construction materials used for construction.
b. Explain the objectives and principles of surveying
Course outcome 4 (CO4) & Course outcome 5 (CO5) (Two full question from each module and
Summarise the basic infrastructure services MEP, HVAC, elevators, escalators and ramps & Discuss
the Materials, energy systems, water management and environment for green buildings.
CO Questions
1. a. Draw the elevation and plan of one brick thick wall with English bond
b. Explain the energy systems and water management in Green buildings
2. a. Draw neat sketch of the following foundations: (i) Isolated stepped footing;
(ii) Cantilever footing; and (iii) Continuous footing.
b. Discuss the civil engineering aspect of MEP and HVAC in a commercial building

1. In an air standard Otto cycle the compression ratio is 7 and compression begins at 35 oC, 0.1
MPa. The maximum temperature of the cycle is 1100oC. Find
i) Heat supplied per kg of air,
ii) Work done per kg of air,
iii) Cycle efficiency
Take Cp = 1.005 kJ/kgK and Cv=0.718 kJ/kgK
2. A Carnot cycle works with adiabatic compression ratio of 5 and isothermal expansion ratio of 2.
The volume of air at the beginning of isothermal expansion is 0.3 m3. If the maximum
temperature and pressure is limited to 550K and 21 bar, determine the minimum temperature
in the cycle and efficiency of the cycle.
3. In an ideal diesel cycle, the temperature at the beginning and end of compression is 65oC and
620oC respectively. The temperature at the beginning and end of the expansion is 1850oC and
850 oC. Determine the ideal efficiency of the cycle.
4. Explain the concepts of CRDI and MPFI in IC Engines.
1. With the help of a neat sketch explain the working of a 4 stroke SI engine
2. Compare the working of 2 stroke and 4 stroke IC engines
3. Explain the classification of IC Engines.
Course Outcome 8(CO8):
1. Explain the working of vapour compression refrigeration system.
2. With the help of suitable sketch explain the working of a split air conditioner.
3. Define: COP, specific humidity, relative humidity and dew point temperature.
1. Explain the working of a single stage centrifugal pump with sketches.
2. With the help of a neat sketch, explain the working of a reciprocating pump.
3. A turbine is to operate under a head of 25 m at 200 rpm. The discharge is 9 m3/s. If the overall
efficiency of the turbine is 90%. Determine the power developed by the turbine.
1. Explain the working of belt drive and gear drive with the help of neat sketches
2. Explain a single plate clutch.
3. Sketch different types of gear trains and explain.

1. Describe the operations which can be performed using drilling machine.
2. Explain the functions of runners and risers used in casting.
3. With a neat sketch, explain the working and parts of a lathe.
QP CODE: EST120 page:3
Reg No:__________________
Name:____________________________
MONTH & YEAR
Course Name: BASICS OF CIVIL AND MECHANICAL ENGINEERING
Answer both part I and part 2 in separate answer booklets

PART I: BASIC CIVIL ENGINEERING
PART A
(Answer all questions. Each question carries 4 marks)
1. Explain relevance of Civil engineering in the overall infrastructural development of the

country.
3. Explain different types of steel with their properties.
4. What are the different kinds of cement available and what is their use?
5. Define bearing capacity of soil.
(5 x 4 = 20)
Part B
Answer one full question from each module.
MODULE I
6a. List out the types of building as per occupancy. Explain any two, each in about five
sentences. (5)
b. Discuss the components of a building with a neat figure. (5)
OR
7a. What are the major disciplines of civil engineering and explain their role in the
infrastructural framework. (5)
country. (5)
MODULE II
8a. What are the different kinds of cement available and what is their use. (5)
b. List the properties of good building bricks. Explain any five. (5)
OR
9a. List and explain any five modern construction materials used for construction. (5)
b. Explain the objectives and principles of surveying (5)
MODULE III
10a. Draw the elevation and plan of one brick thick wall with English bond (5)
b. Explain the energy systems and water management in Green buildings (5)
OR
11a. Draw neat sketch of the following foundations: (i) Isolated stepped footing;
(ii) Cantilever footing; and (iii) Continuous footing. (5)
b. Discuss the civil engineering aspect of MEP and HVAC in a commercial building (5)
[10 x 3 = 30]
PART II: BASIC MECHANICAL ENGINEERING
PART A
Answer all questions. Each question carries 4 marks
1. Sketch the P-v and T-s diagram of a Carnot cycle and List the processes.
2. Illustrate the working of an epicyclic gear train.
3. Explain cooling and dehumidification processes.
4. Differentiate between soldering and brazing.
5. Explain the principle of Additive manufacturing.
4 x 5 = 20 marks
Part B
MODULE I
6. In an air standard Otto cycle the compression ratio is 7 and compression begins at 35oC,
0.1MPa. The maximum temperature of the cycle is 1100oC. Find
iii)Cycle efficiency
Take Cp = 1.005 kJ/kgK and Cv=0.718 kJ/kgK 10 marks
OR
7. a) Explain the working of a 4 stroke SI engine with neat sketches. 7 marks

b) Explain the fuel system of a petrol engine. 3 marks
MODULE II
8. a) Explain the working of a vapour compression system with help of a block

diagram. 7 marks
b) Define: Specific humidity, relative humidity and dew point temperature. 3 marks
OR
9. With the help of a neat sketch, explain the working of a centrifugal pump. 10 marks
MODULE III
10. Explain the two high, three high, four high and cluster rolling mills with neat
sketches. 10 marks
OR
11. a) Describe the arc welding process with a neat sketch. 6 marks
b) Differentiate between up-milling and down-milling operations. 4 marks
SYLLABUS
Module 1
General Introduction to Civil Engineering: Relevance of Civil Engineering in the overall
infrastructural development of the country. Responsibility of an engineer in ensuring the safety of
built environment. Brief introduction to major disciplines of Civil Engineering like Transportation
Engineering, Structural Engineering, Geo-technical Engineering, Water Resources Engineering and
Environmental Engineering.
Introduction to buildings: Types of buildings, selection of site for buildings, components of a
residential building and their functions.
Building rules and regulations: Relevance of NBC, KBR & CRZ norms (brief discussion only).
Building area: Plinth area, built up area, floor area, carpet area and floor area ratio for a building as
per KBR.
Module 2
Surveying: Importance, objectives and principles.

Construction materials, Conventional construction materials: types, properties and uses of building
materials: bricks, stones, cement, sand and timber
Cement concrete: Constituent materials, properties and types.
Steel: Steel sections and steel reinforcements, types and uses.
Modern construction materials:- Architectural glass, ceramics, Plastics, composite materials,
thermal and acoustic insulating materials, decorative panels, waterproofing materials. Modern uses
of gypsum, pre-fabricated building components (brief discussion only).
Module 3
Building Construction: Foundations: Bearing capacity of soil (definition only), functions of
foundations, types – shallow and deep (brief discussion only). Load bearing and framed structures
(concept only).
Brick masonry: - Header and stretcher bond, English bond & Flemish bond random rubble masonry.
Roofs and floors: - Functions, types; flooring materials (brief discussion only).
Basic infrastructure services: MEP, HVAC, elevators, escalators and ramps (Civil Engineering aspects
only), fire safety for buildings.
Green buildings:- Materials, energy systems, water management and environment for green
buildings. (brief discussion only).
Module 4
Analysis of thermodynamic cycles: Carnot, Otto, Diesel cycles, Derivation of efficiency of these
cycles, Problems to calculate heat added, heat rejected, net work and efficiency. IC Engines: CI, SI, 2-
Stroke, 4-Stroke engines. Listing the parts of different types of IC Engines. Efficiencies of IC
Engines(Definitions only), Air, Fuel, cooling and lubricating systems in SI and CI Engines, CRDI, MPFI.
Concept of hybrid engines.
Module 5
Refrigeration: Unit of refrigeration, reversed Carnot cycle,COP, vapour compression cycle (only
description and no problems); Definitions of dry, wet & dew point temperatures, specific humidity
and relative humidity, Cooling and dehumidification, Layout of unit and central air conditioners.
Description about working with sketches of: Reciprocating pump, Centrifugal pump, Pelton turbine,
Francis turbine and Kaplan turbine. Overall efficiency, Problems on calculation of input and output
power of pumps and turbines (No velocity triangles)
Description about working with sketches of: Belt and Chain drives, Gear and Gear trains, Single plate
clutches.
Module 6
Manufacturing Process: Basic description of the manufacturing processes – Sand Casting, Forging,
Rolling, Extrusion and their applications.
Metal Joining Processes: List types of welding, Description with sketches of Arc Welding, Soldering
and Brazing and their applications
Basic Machining operations: Turning, Drilling, Milling and Grinding.
Description about working with block diagram of: Lathe, Drilling machine, Milling machine, CNC
Machine. Principle of CAD/CAM, Rapid and Additive manufacturing.
Text Books:
1. Rangwala, S. C., Essentials of Civil Engineering, Charotar Publishing House

2. Mckay, W.B. and Mckay, J. K., Building Construction, Volumes 1 to 4, Pearson India
Education Services
References Books:
1. Chen W.F and Liew J Y R (Eds), The Civil Engineering Handbook. II Edition CRC Press (Taylor
and Francis)
2. Chudley, R and Greeno R, Building construction handbook, Addison Wesley, Longman group,
England
3. Chudley, R, Construction Technology, Vol. I to IV, Longman group, England Course Plan
4. Kandya A A, Elements of Civil Engineering, Charotar Publishing house
5. Mamlouk, M. S., and Zaniewski, J. P., Materials for Civil and Construction Engineering, Pearson
Publishers
6. Rangwala S.C and Dalal K B Building Construction Charotar Publishing house
7. Clifford, M., Simmons, K. and Shipway, P., An Introduction to Mechanical Engineering Part I -
CRC Press
8. Roy and Choudhary, Elements of Mechanical Engineering, Media Promoters &Publishers Pvt.
Ltd., Mumbai.
9. Sawhney, G. S., Fundamentals of Mechanical Engineering, PHI
10. G Shanmugam, M S Palanichamy, Basic Civil and Mechanical Engineering, McGraw Hill
Education; First edition, 2018
11. Benjamin,J.,Basic Mechanical Engineering,Pentex Books,9th Edition,2018
12. Balachandran, P.Basic Mechanical Engineering,Owl Books
Course
No. of
No Topic outcomes
Lectures
addressed
1 Module I Total: 7
General Introduction to Civil Engineering: Relevance of Civil

Engineering in the overall infrastructural development of the
1.1 CO1 1
country. Responsibility of an engineer in ensuring the safety of
built environment.
Brief introduction to major disciplines of Civil Engineering like

Transportation Engineering, Structural Engineering, Geo-technical
1.2 CO1 2
Engineering, Water Resources Engineering and Environmental
Engineering.
Introduction to buildings: Types of buildings, selection of site for

1.3 CO2 2
buildings, components of a residential building and their functions.
Building rules and regulations: Relevance of NBC, KBR & CRZ norms
1.4 (brief discussion only) CO2 1
Building area: Plinth area, built up area, floor area, carpet area and
1.5 CO2 1
floor area ratio for a building as per KBR.
2 Module 2 Total: 7
2.1 Surveying: Importance, objectives and principles. CO3 1
2.2 Bricks: - Classification, properties of good bricks, and tests on CO2 1

bricks
Stones: - Qualities of good stones, types of stones and their uses.

2.3 Cement: - Good qualities of cement, types of cement and their CO2 1
uses.
Sand: - Classification, qualities of good sand and sieve analysis

2.4 (basics only). CO2 1
Timber: - Characteristics, properties and uses.
2.5 Cement concrete: - Constituent materials, properties and types, CO2 1

Steel: - Steel sections and steel reinforcements, types and uses.
Modern construction materials: - Architectural glass, ceramics,
plastics, composite materials, thermal and acoustic insulating
2.6 materials, decorative panels, waterproofing materials, modern CO2 2
uses of gypsum, pre-fabricated building components (brief
discussion only)
3 Module 3 Total: 7
Foundations: - Bearing capacity of soil (definition only), functions

of foundations, types – shallow and deep (brief discussion only).
3.1 Brick masonry: - Header and stretcher bond, English bond & CO2 2
Flemish bond– elevation and plan (one & one and a half brick wall
only).
Random rubble masonry.
3.2 Roofs: Functions, types; roofing materials (brief discussion only) CO2 2
Floors: Functions, types; flooring materials (brief discussion only)
3.3 Basic infrastructure services: MEP, HVAC, Elevators, escalators and CO4 2
ramps (Civil Engineering aspects only) fire safety for buildings
3.4 Green buildings:- Materials, energy systems, water management CO5 1

and environment for green buildings. (brief discussion only)
4 MODULE 4
Analysis of thermodynamic cycles: Carnot, Otto, and Diesel cycle- 4

4.1 Derivation of efficiency of these cycles, Problems to calculate heat
added, heat rejected, net work and efficiency
IC Engines: CI, SI, 2-Stroke, 4-Stroke engines. Listing the parts of 2

4.2 different types of IC Engines, efficiencies of IC Engines(Description
only)
Air, Fuel, cooling and lubricating systems in SI and CI Engines, CRDI, 2

4.3
MPFI. Concept of hybrid engines
5 MODULE 5
Refrigeration: Unit of refrigeration, reversed Carnot cycle, COP, vapour 1

5.1
compression cycle (only description and no problems)
Definitions of dry, wet & dew point temperatures, specific humidity and 1
5.2 relative humidity, Cooling and dehumidification, Layout of unit and
central air conditioners.
Description about working with sketches : Reciprocating pump, 4
Centrifugal pump, Pelton turbine, Francis turbine and Kaplan turbine.
5.3
Overall efficiency, Problems on calculation of input and output power
of pumps and turbines (No velocity triangles)
Description about working with sketches of: Belt and Chain drives, Gear 3
5.4
and Gear trains, Single plate clutches
6 MODULE 6
Manufacturing Process: Basic description of the manufacturing 2

6.1 processes – Sand Casting, Forging, Rolling, Extrusion and their
applications.
Metal Joining Processes :List types of welding, Description with 1

6.2
sketches of Arc Welding, Soldering and Brazing, and their applications
Basic Machining operations: Turning, Drilling, Milling and Grinding 3

6.3 Description about working with block diagrams of: Lathe, Drilling
machine, Milling machine, CNC Machine
6.4 Principle of CAD/CAM, Rapid and Additive manufacturing 1

EST BASICS OF ELECTRICAL AND CATEGORY L T P CREDIT YEAR OF
130 ELECTRONICS ENGINEERING INTRODUCTION
ESC 4 0 0 4 2019
Preamble:
This course aims to (1) equip the students with an understanding of the fundamental principles of
electrical engineering(2) provide an overview of evolution of electronics, and introduce the working
principle and examples of fundamental electronic devices and circuits (3) provide an overview of
evolution of communication systems, and introduce the basic concepts in radio communication.
Prerequisite: Physics and Mathematics (Pre-university level)

CO 1 Apply fundamental concepts and circuit laws to solve simple DC electric circuits
CO 2 Develop and solve models of magnetic circuits
CO 3 Apply the fundamental laws of electrical engineering to solve simple ac circuits in steady
state
CO 4 Describe working of a voltage amplifier
CO 5 Outline the principle of an electronic instrumentation system
CO 6 Explain the principle of radio and cellular communication
10 11 12
CO 1 3 1 - - - - - - - - - 2
CO 2 3 1 - - - - - - - - - 2
CO 3 3 1 - - - - - - - - - 2
CO 4 2 - - - - - - - - - - -
CO 5 2 - - - - - - - - - - 2
CO 6 2 - - - - - - - - - - 2
Assessment Pattern
Basic Electrical Engineering Basic Electronics Engineering

Bloom’s Category Continuous End Semester Continuous End Semester
Assessment Tests Examination Assessment Tests Examination
Test 1 Test 2 (Marks) Test 1 Test 2 (Marks)
(Marks) (Marks) (Marks) (Marks)
Remember 0 0 10 10 10 20
Understand 12.5 12.5 20 15 15 30
Apply 12.5 12.5 20
Analyse
Evaluate
Create
Mark distribution
Total Marks CIE marks ESE marks ESE Duration
150 50 100 3 hours

End Semester Examination Pattern: There will be two parts; Part I – Basic Electrical Engineering and
Part II – Basic Electronics Engineering. Part I and PART II carries 50 marks each. For the end semester
examination, part I contain 2 parts - Part A and Part B. Part A contain 5 questions carrying 4 marks
each (not exceeding 2 questions from each module). Part B contains 2 questions from each module
out of which one to be answered. Each question carries 10 mark and can have maximum 2 sub-
divisions. The pattern for end semester examination for part II is same as that of part I. However,
student should answer both part I and part 2 in separate answer booklets.
1. Solve problems based on current division rule.
2. Solve problems with Mesh/node analysis.
3. Solve problems on Wye-Delta Transformation.
1. Problems on series magnetic circuits
2. Problems on parallel magnetic circuits
3. Problems on composite magnetic ciruits
4. Course Outcome 3 (CO3):
1. problems on self inductance, mutual inductance and coefficient of coupling
2. problems on rms and average values of periodic waveforms
3. problems on series ac circuits
4. Compare star and Delta connected 3 phase AC systems.
Course Outcome 4 (CO4): Describe working of a voltage amplifier
1.What is the need of voltage divider biasing in an RC coupled amplifier?

2. Define operating point in the context of a BJT amplifier.
3. Why is it required to have a voltage amplifier in a public address system?
Course Outcome 5 (CO5): Outline the principle of an electronic instrumentation system
1. Draw the block diagram of an electronic instrumentation system.
2. What is a transducer?
3. Explain the working principle of operation of digital multimeter.
Course Outcome 6 (CO6): Explain the principle of radio and cellular communication
1. What is the working principle of an antenna when used in a radio transmitter?
2. What is the need of two separate sections RF section and IF section in a super heterodyne
receiver?
3. What is meant by a cell in a cellular communication?
QP CODE: Pages: 3
Reg No.:_______________
Name:_________________
MONTH & YEAR
Course Name: BASICS OF ELECTRICAL AND ELECTRONICS ENGINEERING
PART I
BASIC ELECTRICAL ENGINEERING
PART A
Answer all questions; each question carries 4 marks.
1. Calculate the current through the 4  resistor in the circuit shown, applying current
division rule:
2. Calculate the RMS and average values of a purely sinusoidal current having peak value
15A.
3. An alternating voltage of (80+j60)V is applied to an RX circuit and the current flowing

through the circuit is (-4+j10)A. Calculate the impedance of the circuit in rectangular and
polar forms. Also determine if X is inductive or capacitive.
4. Derive the relation between line and phase values of voltage in a three phase star
connected system.
5. Compare electric and magnetic circuits. (5x4=20)
PART B
Answer one question from each module; each question carries 10 marks.
Module 1
6. . Calculate the node voltages in the circuit shown, applying node analysis:
7. (a) State and explain Kirchhoff’s laws. (4 marks)
(b) Calculate the current through the galvanometer (G) in the circuit shown:
(6 marks)
Module 2
8. (a) State and explain Faraday’s laws of electromagnetic induction with examples. (4 marks)
(b) Differentiate between statically and dynamically induced emf. A conductor of length
0.5m moves in a uniform magnetic field of flux density 1.1T at a velocity of 30m/s.
Calculate the emf induced in the conductor if the direction of motion of the conductor is
inclined at 600 to the direction of field. (6 marks)
9. (a) Derive the amplitude factor and form factor of a purely sinusoidal waveform. (5 marks)
(b) A current wave is made up of two components-a 5A dc component and a 50Hz ac

component, which is a sinusoidal wave with a peak value of 5A. Sketch the resultant
waveform and determine its RMS and average values. (5 marks)
Module 3
10. Draw the power triangle and define active, reactive and apparent powers in ac circuits.
Two coils A and B are connected in series across a 240V, 50Hz supply. The resistance of
A is 5  and the inductance of B is 0.015H. If the input from the supply is 3kW and
2kVAR, find the inductance of A and the resistance of B. Also calculate the voltage across
each coil.
11. A balanced three phase load consists of three coils each having resistance of 4Ω and
inductance 0.02H. It is connected to a 415V, 50Hz, 3-phase ac supply. Determine the
phase voltage, phase current, power factor and active power when the loads are connected
in (i) star (ii) delta.
(3x10=30)
PART II
BASIC ELECTRONICS ENGINEERING
PART A
1. Give the specifications of a resistor. The colour bands marked on a resistor are Blue, Grey,
Yellow and Gold. What are the minimum and maximum resistance values expected from that
resistance?
2. What is meant by avalanche breakdown?
3. Explain the working of a full-wave bridge rectifier.
4. Discuss the role of coupling and bypass capacitors in a single stage RC coupled amplifier.
5. Differentiate AM and FM communication systems.
(5x4=20)
PART B
Module 4
6. a) Explain with diagram the principle of operation of an NPN transistor. (5)
b) Sketch and explain the typical input-output characteristics of a BJT when connected in
common emitter configuration. (5)
OR
7. a) Explain the formation of a potential barrier in a P-N junction diode. (5)
b) What do you understand by Avalanche breakdown? Draw and explain the V-I characteristics
of a P-N junction and Zener diode. (5)
Module 5
8. a) With a neat circuit diagram, explain the working of an RC coupled amplifier. (6)
b) Draw the frequency response characteristics of an RC coupled amplifier and state the reasons
for the reduction of gain at lower and higher frequencies. (4)
OR
9. a) With the help of block diagram, explain how an electronic instrumentation system. (6)
b) Explain the principle of an antenna. (4)
Module 6
10. a) With the help of a block diagram, explain the working of Super hetrodyne receiver. (6)
b) Explain the importance of antenna in a communication system. (4)
OR
11. a) With neat sketches explain a cellular communication system. (5)
b) Explain GSM communication with the help of a block diagram. (5)
(3x10=30)
SYLLABUS
MODULE 1: Elementary Concepts of Electric Circuits
Elementary concepts of DC electric circuits: Basic Terminology including voltage, current, power,
resistance, emf; Resistances in series and parallel; Current and Voltage Division Rules; Capacitors &
Inductors: V-I relations and energy stored. Ohms Law and Kirchhoff's laws-Problems; Star-delta
conversion (resistive networks only-derivation not required)-problems.
Analysis of DC electric circuits: Mesh current method - Matrix representation - Solution of network
equations. Node voltage methods-matrix representation-solution of network equations by matrix
methods. Numerical problems.
MODULE 2: Elementary Concepts of Magnetic circuits, Electromagnetic Induction and AC

fundamentals
Magnetic Circuits: Basic Terminology: MMF, field strength, flux density, reluctance - comparison
between electric and magnetic circuits- Series and parallel magnetic circuits with composite
materials, numerical problems.
Electromagnetic Induction: Faraday's laws, problems, Lenz's law- statically induced and dynamically
induced emfs - Self-inductance and mutual inductance, coefficient of coupling
Alternating Current fundamentals: Generation of alternating voltages-Representation of sinusoidal

waveforms: frequency, period, Average, RMS values and form factor of waveforms-Numerical
Problems.
MODULE 3: AC Circuits
AC Circuits: Phasor representation of sinusoidal quantities. Trignometric, Rectangular, Polar and

complex forms. Analysis of simple AC circuits: Purely resistive, inductive & capacitive circuits;
Inductive and capacitive reactance, concept of impedance. Average Power Power factor. Analysis of
RL, RC and RLC series circuits-active, reactive and apparent power. Simple numerical problems.
Three phase AC systems: Generation of three phase voltages; advantages of three phase systems,
star and delta connections (balanced only), relation between line and phase voltages, line and phase
currents- Numerical problems
MODULE 4
Introduction to Semiconductor devices: Evolution of electronics – Vacuum tubes to nano
electronics. Resistors, Capacitors and Inductors (constructional features not required): types,
specifications. Standard values, color coding. PN Junction diode: Principle of operation, V-I
characteristics, principle of avalanche breakdown. Bipolar Junction Transistors: PNP and NPN
structures, Principle of operation, relation between current gains in CE, CB and CC, input and
output characteristics of common emitter configuration.
MODULE 5
Basic electronic circuits and instrumentation: Rectifiers and power supplies: Block diagram
description of a dc power supply, Working of a full wave bridge rectifier, capacitor filter (no
analysis), working of simple zener voltage regulator. Amplifiers: Block diagram of Public Address
system, Circuit diagram and working of common emitter (RC coupled) amplifier with its frequency
response, Concept of voltage divider biasing. Electronic Instrumentation: Block diagram of an
electronic instrumentation system.
MODULE 6
Introduction to Communication Systems: Evolution of communication systems – Telegraphy to 5G.
Radio communication: principle of AM & FM, frequency bands used for various communication
systems, block diagram of super heterodyne receiver, Principle of antenna – radiation from
accelerated charge. Mobile communication: basic principles of cellular communications, principle
and block diagram of GSM.
Text Books
1. D P Kothari and I J Nagrath, “Basic Electrical Engineering”, Tata McGraw Hill, 2010.
2. D C Kulshreshtha, “Basic Electrical Engineering”, Tata McGraw Hill, 2010.
3. ChinmoySaha, Arindham Halder and Debarati Ganguly, Basic Electronics - Principles and
Applications, Cambridge University Press, 2018.
4. M.S.Sukhija and T.K.Nagsarkar, Basic Electrical and Electronics Engineering, Oxford University
Press, 2012.
5. Wayne Tomasi and Neil Storey, A Textbook On Basic Communication and Information
Engineering, Pearson, 2010.
Reference Books
1. Del Toro V, “Electrical Engineering Fundamentals”, Pearson Education.
2. T. K. Nagsarkar, M. S. Sukhija, “Basic Electrical Engineering”, Oxford Higher Education.
3. Hayt W H, Kemmerly J E, and Durbin S M, “Engineering Circuit Analysis”, Tata McGraw-Hill
4. Hughes, “Electrical and Electronic Technology”, Pearson Education.
5. V. N. Mittle and Arvind Mittal, “Basic Electrical Engineering,” Second Edition, McGraw Hill.
6. Parker and Smith, “Problems in Electrical Engineering”, CBS Publishers and Distributors.
7. S. B. Lal Seksena and Kaustuv Dasgupta, “Fundamentals of Electrical Engineering”, Cambridge
University Press.
8. Anant Agarwal, Jeffrey Lang, Foundations of Analog and Digital Electronic Circuits, Morgan
Kaufmann Publishers, 2005.
9. Bernard Grob, Ba sic Electronics, McGraw Hill.
10. A. Bruce Carlson, Paul B. Crilly, Communication Systems: An Introduction to Signals and
Noise in Electrical Communication, Tata McGraw Hill, 5 th Edition.
COURSE CONTENTS AND LECTURE SCHEDULE
1 Elementary Concepts of Electric Circuits
1.1 Elementary concepts of DC electric circuits:
Basic Terminology including voltage, current, power, resistance, emf; 1

Resistances in series and parallel; Current and Voltage Division Rules;
Capacitors & Inductors: V-I relations and energy stored.
Ohms Law and Kirchhoff's laws-Problems; 2
Star-delta conversion (resistive networks only-derivation not required)- 1

problems.
1.2 Analysis of DC electric circuits: Mesh current method - Matrix 1

representation - Solution of network equations.
Node voltage methods-matrix representation-solution of network

equations by matrix methods. 1
Numerical problems. 2
2 Elementary Concepts of Magnetic circuits, Electromagnetic Induction and AC

fundamentals
2.1 Magnetic Circuits: Basic Terminology: MMF, field strength, flux density,
reluctance - comparison between electric and magnetic circuits-
1
Series and parallel magnetic circuits with composite materials,
numerical problems. 2
2.2 Electromagnetic Induction: Faraday's laws, problems, Lenz's law- 1

statically induced and dynamically induced emfs -
Self-inductance and mutual inductance, coefficient of coupling 2
2.3 Alternating Current fundamentals: Generation of alternating voltages- 2

Representation of sinusoidal waveforms: frequency, period, Average,
RMS values and form factor of waveforms-Numerical Problems.
3 AC Circuits
3.1 AC Circuits: Phasor representation of sinusoidal quantities. 1
Trigonometric, Rectangular, Polar and complex forms.
Analysis of simple AC circuits: Purely resistive, inductive & capacitive

circuits; Inductive and capacitive reactance, concept of impedance. 2
Average Power, Power factor.
Analysis of RL, RC and RLC series circuits-active, reactive and apparent 1

power.
2
Simple numerical problems.
3.2 Three phase AC systems: Generation of three phase voltages;

advantages of three phase systems, star and delta connections
(balanced only), relation between line and phase voltages, line and 2
phase currents- Numerical problems.
4 Introduction to Semiconductor devices
4.1 Evolution of electronics – Vacuum tubes to nano electronics (In 1

evolutional perspective only)
4.2 Resistors, Capacitors and Inductors: types, specifications. Standard 2

values, color coding (No constructional features)
4.3 PN Junction diode: Principle of operation, V-I characteristics, principle 2

of avalanche breakdown
4.4 Bipolar Junction Transistors: PNP and NPN structures, Principle of 3

operation, relation between current gains in CE, CB and CC, input and
output characteristics of common emitter configuration
5 Basic electronic circuits and instrumentation
5.1 Rectifiers and power supplies: Block diagram description of a dc power 3

supply, Working of a full wave bridge rectifier, capacitor filter (no
analysis), working of simple zener voltage regulator
5.2 Amplifiers: Block diagram of Public Address system, Circuit diagram and 4
working of common emitter (RC coupled) amplifier with its frequency
response, Concept of voltage divider biasing
5.3 Electronic Instrumentation: Block diagram of an electronic 2

instrumentation system
6 Introduction to Communication Systems
6.1 Evolution of communication systems – Telegraphy to 5G 1

6.2 Radio communication: principle of AM & FM, frequency bands used for 4
various communication systems, block diagram of super heterodyne
receiver, Principle of antenna – radiation from accelerated charge
6.3 Mobile communication: basic principles of cellular communications, 2

principle and block diagram of GSM.
Suggested Simulation Assignments for Basic Electronics Engineering
1. Plot V-I characteristics of Si and Ge diodes on a simulator

2. Plot Input and Output characteristics of BJT on a simulator
3. Implementation of half wave and full wave rectifiers
4. Simulation of RC coupled amplifier with the design supplied
5. Generation of AM signal
Note: The simulations can be done on open tools such as QUCS, KiCad, GNURadio or similar software
to augment the understanding.
CATEGORY L T P CREDIT YEAR OF
HUN LIFE SKILLS INTRODUCTION
101 MNC 2 0 2 --- 2019
Preamble: Life skills are those competencies that provide the means for an individual to be
resourceful and positive while taking on life's vicissitudes. Development of one's personality by being
aware of the self, connecting with others, reflecting on the abstract and the concrete, leading and
generating change, and staying rooted in time-tested values and principles is being aimed at. This
course is designed to enhance the employability and maximize the potential of the students by
introducing them to the principles that underly personal and professional success, and help them
acquire the skills needed to apply these principles in their lives and careers.
Prerequisite: None
CO 1 Define and Identify different life skills required in personal and professional life
CO 2 Develop an awareness of the self and apply well-defined techniques to cope with emotions
and stress.
CO 3 Explain the basic mechanics of effective communication and demonstrate these through
presentations.
CO 4 Take part in group discussions
CO 5 Use appropriate thinking and problem solving techniques to solve new problems
CO 6 Understand the basics of teamwork and leadership
10 11 12
CO 1 2 1 2 2 1 3
CO 2 3 2
CO 3 1 1 3
CO 4 3 1
CO 5 3 2 1
CO 6 1 3
Mark distribution
100 50 50 2 hours
Continuous Internal Evaluation
Total Marks: 50
Regular assessment : 15 marks
Series test (one test only, should include first three modules) : 25 marks
Regular assessment
 Group Discussion (Marks: 9)

Create groups of about 6 students each and engage them on a GD on a suitable topic
for about 20 minutes. Parameters to be used for evaluation are as follows:
 Communication Skills : 3 marks

 Subject Clarity : 2 marks
 Group Dynamics : 2 marks
 Behaviours & Mannerisms : 2 marks
 Presentation Skills (Marks: 6)

Identify a suitable topic and ask the students to prepare a presentation (preferably a
power point presentation) for about 10 minutes. Parameters to be used for
evaluation are as follows:
 Communication Skills : 2 marks

 Platform Skills : 2 marks
 Subject Clarity/Knowledge : 2 marks
End Semester Examination

Total Marks: 50 Time: 2 hrs.
Part A: Short answer question (25 marks)

There will be one question from each MODULE (five questions in total, five marks each). Each
question should be written in about maximum of 400 words. Parameters to be used for evaluation
are as follows:
(i) Content Clarity/Subject Knowledge
(ii) Presentation style
(iii) Organization of content
Part B: Case Study (25 marks)

The students will be given a case study with questions at the end. The students have to analyze the
case and answer the question at the end. Parameters to be used for evaluation are as follows:
(i) Analyze the case situation
(ii) Key players/characters of the case
(iii) Identification of the problem (both major & minor if exists)
(iv) Bring out alternatives
(v) Analyze each alternative against the problem
(vi) Choose the best alternative
(vii) Implement as solution
(viii) Conclusion
(ix) Answer the question at the end of the case
1. List 'life skills' as identified by WHO
2. What do you mean by effective communication?
3. What are the essential life skills required by a professional?
1. Identify an effective means to deal with workplace stress.
2. How can a student apply journaling to stress management?
3. What is the PATH method? Describe a situation where this method can be used effectively.
1. Identify the communication network structure that can be observed in the given situations.
Describe them.
(a) A group discussion on development.
(b) An address from the Principal regarding punctuality.
(c) A reporter interviewing a movie star.
(d) Discussing the answers of a test with a group of friends.
2. Elucidate the importance of non-verbal communication in making a presentation
3. Differentiate between kinesics, proxemics, and chronemics with examples.
1. How can a participant conclude a group discussion effectively?
2. 'Listening skills are essential for effectively participating in a group discussion.' Do you
agree? Substantiate your answer.
1. Illustrate the creative thinking process with the help of a suitable example
2. Translate the following problem from verbal to graphic form and find the solution : In a quiz,
Ananth has 50 points more than Bimal, Chinmay has 60 points less than Ananth, and Dharini
is 20 points ahead of Chinmay. What is the difference in points between Bimal and Dharini?
3. List at least five ways in which the problem "How to increase profit?" can be redefined
1. A group of engineers decided to brainstorm a design issue on a new product. Since no one
wanted to disagree with the senior members, new ideas were not flowing freely. What
group dynamics technique would you suggest to avoid this 'groupthink'? Explain the
procedure.
2. “A group focuses on individual contribution, while a team must focus on synergy.” Explain.
3. Identify the type of group formed / constituted in each of the given situations
a) A Police Inspector with subordinates reporting to him
b) An enquiry committee constituted to investigate a specific incident
c) The Accounts Department of a company
d) A group of book lovers who meet to talk about reading
Syllabus
Module 1
Overview of Life Skills: Meaning and significance of life skills, Life skills identified by WHO: Self-
awareness, Empathy, Critical thinking, Creative thinking, Decision making, problem solving, Effective
communication, interpersonal relationship, coping with stress, coping with emotion.
Life skills for professionals: positive thinking, right attitude, attention to detail, having the big
picture, learning skills, research skills, perseverance, setting goals and achieving them, helping
others, leadership, motivation, self-motivation, and motivating others, personality development, IQ,
EQ, and SQ
Module 2
Self-awareness: definition, need for self-awareness; Coping With Stress and Emotions, Human
Values, tools and techniques of SA: questionnaires, journaling, reflective questions, meditation,
mindfulness, psychometric tests, feedback.
Stress Management: Stress, reasons and effects, identifying stress, stress diaries, the four A's of
stress management, techniques, Approaches: action-oriented, emotion-oriented, acceptance-
oriented, resilience, Gratitude Training,
Coping with emotions: Identifying and managing emotions, harmful ways of dealing with emotions,
PATH method and relaxation techniques.
Morals, Values and Ethics: Integrity, Civic Virtue, Respect for Others, Living Peacefully. Caring,
Sharing, Honesty, Courage, Valuing Time, Time management, Co operation, Commitment, Empathy,
Self-Confidence, Character, Spirituality, Avoiding Procrastination, Sense of Engineering Ethics.
Module 3
21st century skills: Creativity, Critical Thinking, Collaboration, Problem Solving, Decision Making,
Need for Creativity in the 21st century, Imagination, Intuition, Experience, Sources of Creativity,
Lateral Thinking, Myths of creativity, Critical thinking Vs Creative thinking, Functions of Left Brain &
Right brain, Convergent & Divergent Thinking, Critical reading & Multiple Intelligence.
Steps in problem solving: Problem Solving Techniques, Six Thinking Hats, Mind Mapping, Forced
Connections. Analytical Thinking, Numeric, symbolic, and graphic reasoning. Scientific temperament
and Logical thinking.
Module 4
Group and Team Dynamics: Introduction to Groups: Composition, formation, Cycle, thinking,
Clarifying expectations, Problem Solving, Consensus, Dynamics techniques, Group vs Team, Team
Dynamics, Virtual Teams. Managing team performance and managing conflicts, Intrapreneurship.
Module 5
Leadership: Leadership framework, entrepreneurial and moral leadership, vision, cultural

dimensions. Growing as a leader, turnaround leadership, managing diverse stakeholders, crisis
management. Types of Leadership, Traits, Styles, VUCA Leadership, Levels of Leadership,
Transactional vs Transformational Leaders, Leadership Grid, Effective Leaders.
Lab Activities
Verbal
Effective communication and Presentation skills.

Different kinds of communication; Flow of communication; Communication networks, Types of
barriers; Miscommunication
Introduction to presentations and group discussions.
Learning styles: visual, aural, verbal, kinaesthetic, logical, social, solitary; Previewing, KWL table,
active listening, REAP method
Note-taking skills: outlining, non-linear note-taking methods, Cornell notes, three column note
taking.
Memory techniques: mnemonics, association, flashcards, keywords, outlines, spider diagrams and
mind maps, spaced repetition.
Time management: auditing, identifying time wasters, managing distractions, calendars and
checklists; Prioritizing - Goal setting, SMART goals; Productivity tools and apps, Pomodoro technique.
Non Verbal:
Non-verbal Communication and Body Language: Forms of non-verbal communication; Interpreting
body-language cues; Kinesics; Proxemics; Chronemics; Effective use of body language,
Communication in a multi cultural environment.
Reference Books
1. Shiv Khera, You Can Win, Macmillan Books, New York, 2003.
2. Barun K. Mitra, “Personality Development & Soft Skills”, Oxford Publishers, Third impression,
2017.
3. ICT Academy of Kerala, "Life Skills for Engineers", McGraw Hill Education (India) Private Ltd.,
2016.
4. Caruso, D. R. and Salovey P, “The Emotionally Intelligent Manager: How to Develop and Use
the Four Key Emotional Skills of Leadership”, John Wiley & Sons, 2004.
5. Kalyana, “Soft Skill for Managers”; First Edition; Wiley Publishing Ltd, 2015.
6. Larry James, “The First Book of Life Skills”; First Edition, Embassy Books, 2016.
7. Shalini Verma, “Development of Life Skills and Professional Practice”; First Edition; Sultan
Chand (G/L) & Company, 2014.
8. Daniel Goleman, "Emotional Intelligence"; Bantam, 2006.
9. Remesh S., Vishnu R.G., "Life Skills for Engineers", Ridhima Publications, First Edition, 2016.
10. Butterfield Jeff, “Soft Skills for Everyone”, Cengage Learning India Pvt Ltd; 1 edition, 2011.
11. Training in Interpersonal Skills: Tips for Managing People at Work, Pearson Education, India;
6 edition, 2015.
12. The Ace of Soft Skills: Attitude, Communication and Etiquette for Success, Pearson
Education; 1 edition, 2013.
PHL ENGINEERING CATEGORY L T P CREDIT YEAR OF
120 PHYSICS LAB INTRODUCTION
BSC 0 0 2 1 2019
Preamble: The aim of this course is to make the students gain practical knowledge to co-relate with
the theoretical studies and to develop practical applications of engineering materials
and use the principle in the right way to implement the modern technology.
Prerequisite: Higher secondary level Physics
CO 1 Develop analytical/experimental skills and impart prerequisite hands on experience for

engineering laboratories
CO 2 Understand the need for precise measurement practices for data recording
CO 3 Understand the principle, concept, working and applications of relevant technologies and
comparison of results with theoretical calculations
CO 4 Analyze the techniques and skills associated with modern scientific tools such as lasers and
fiber optics
CO 5 Develop basic communication skills through working in groups in performing the laboratory
experiments and by interpreting the results
CO 1 3 3 1 2 1
CO 2 3 3 1 2 1
CO 3 3 3 1 2 1
CO 4 3 3 1 2 1
CO 5 3 3 1 2 1
Mark distribution
Total Marks CIE ESE ESE

Duration(Internal)
Marks Marks
100 100 - 1 hour

Class work/ Assessment /Viva-voce : 50 marks
End semester examination (Internally by college) : 30 marks
End Semester Examination Pattern: Written Objective Examination of one hour
SYLLABUS
LIST OF EXPERIMENTS
(Minimum 8 experiments should be completed)
1. CRO-Measurement of frequency and amplitude of wave forms

2. Measurement of strain using strain gauge and wheatstone bridge
3. LCR Circuit – Forced and damped harmonic oscillations
4. Melde’s string apparatus- Measurement of frequency in the transverse and longitudinal mode
5. Wave length measurement of a monochromatic source of light using Newton’s Rings method.
6. Determination of diameter of a thin wire or thickness of a thin strip of paper using air wedge
method.
7. To measure the wavelength using a millimeter scale as a grating.
8. Measurement of wavelength of a source of light using grating.
9. Determination of dispersive power and resolving power of a plane transmission grating
10.Determination of the particle size of lycopodium powder
11.Determination of the wavelength of He-Ne laser or any standard laser using diffraction grating
12.Calculate the numerical aperture and study the losses that occur in optical fiber cable.
13.I-V characteristics of solar cell.
14.LED Characteristics.
15.Ultrasonic Diffractometer- Wavelength and velocity measurement of ultrasonic waves in a liquid
16.Deflection magnetometer-Moment of a magnet- Tan A position.
Reference books
1. S.L.Gupta and Dr.V.Kumar, “Practical physics with viva voice”, Pragati PrakashanPublishers, Revised
Edition, 2009
2. M.N.Avadhanulu, A.A.Dani and Pokely P.M, “Experiments in Engineering Physics”, S.Chand&Co,2008
3. S. K. Gupta, “Engineering physics practicals”, Krishna Prakashan Pvt. Ltd., 2014
4. P. R. Sasikumar “Practical Physics”, PHI Ltd., 2011.

CYL ENGINEERING CHEMISTRY LAB CATEGORY L T P CREDIT
120 BSC 0 0 2 1
Preamble: To impart scientific approach and to familiarize with the experiments in chemistry relevant
for research projects in higher semesters
Prerequisite: Experiments in chemistry introduced at the plus two levels in schools
CO 1 Understand and practice different techniques of quantitative chemical analysis to

generate experimental skills and apply these skills to various analyses
CO 2 Develop skills relevant to synthesize organic polymers and acquire the practical skill to
use TLC for the identification of drugs
CO 3 Develop the ability to understand and explain the use of modern spectroscopic
techniques for analysing and interpreting the IR spectra and NMR spectra of some
organic compounds
CO 4 Acquire the ability to understand, explain and use instrumental techniques for chemical
analysis
CO 5 Learn to design and carry out scientific experiments as well as accurately record and
analyze the results of such experiments
CO 6 Function as a member of a team, communicate effectively and engage in further

learning. Also understand how chemistry addresses social, economical and
environmental problems and why it is an integral part of curriculum
10 11 12
CO 1 3 2 3
CO 2 3 3 3
CO 3 3 3 3
CO 4 3 3 3
CO 5 3 1 3
CO 6 3 1 3
Mark distribution

marks marks Duration(Internal)
100 100 - 1 hour

SYLLABUS
LIST OF EXPERIMENTS (MINIMUM 8 MANDATORY)
1. Estimation of total hardness of water-EDTA method

2. Potentiometric titration
3. Determination of cell constant and conductance of solutions.
4. Calibration of pH meter and determination of pH of a solution
5. Estimation of chloride in water
6. Identification of drugs using TLC
7. Determination of wavelength of absorption maximum and colorimetric estimation of Fe3+ in
solution
8. Determination of molar absorptivity of a compound (KMnO4 or any water soluble food
colorant)
9. Synthesis of polymers (a) Urea-formaldehyde resin (b) Phenol-formaldehyde resin
10. Estimation of iron in iron ore
11. Estimation of copper in brass
12. Estimation of dissolved oxygen by Winkler’s method
13. (a) Analysis of IR spectra (minimum 3 spectra) (b) Analysis of 1H NMR spectra (
minimum 3 spectra)
14. Flame photometric estimation of Na+ to find out the salinity in sand
15. Determination of acid value of a vegetable oil
16. Determination of saponification of a vegetable oil
Reference Books
1. G. Svehla, B. Sivasankar, “Vogel's Qualitative Inorganic Analysis”, Pearson, 2012.
2. R. K. Mohapatra, “Engineering Chemistry with Laboratory Experiments”, PHI Learning, 2017.
3. Muhammed Arif, “Engineering Chemistry Lab Manual”, Owl publishers, 2019.
4. Ahad J., “Engineering Chemistry Lab manual”, Jai Publications, 2019.
5. Roy K Varghese, “Engineering Chemistry Laboratory Manual”, Crownplus Publishers, 2019.
6. Soney C George, Rino Laly Jose, “Lab Manual of Engineering Chemistry”, S. Chand &
Company Pvt Ltd, New Delhi, 2019.
ESL YEAR OF
CIVIL & MECHANICAL CATEGORY L T P CREDIT
120 INTRODUCTION
WORKSHOP
0 0 2 1 2019
Preamble: The course is designed to train the students to identify and manage the tools, materials
and methods required to execute an engineering project. Students will be introduced to a team
working environment where they develop the necessary skills for planning, preparing and executing
an engineering project.
To enable the student to familiarize various tools, measuring devices, practices and different
methods of manufacturing processes employed in industry for fabricating components.
Prerequisite: None
Course Outcomes: After the completion of the course the student will be able to:
Course
Course Outcome Description
Outcome
CO 1 Name different devices and tools used for civil engineering measurements
CO 2 Explain the use of various tools and devices for various field measurements
Demonstrate the steps involved in basic civil engineering activities like plot
CO 3 measurement, setting out operation, evaluating the natural profile of land, plumbing
and undertaking simple construction work.
Choose materials and methods required for basic civil engineering activities like field
CO 4
measurements, masonry work and plumbing.
CO 5 Compare different techniques and devices used in civil engineering measurements
Identify Basic Mechanical workshop operations in accordance with the material and
CO 6
objects
Apply appropriate Tools and Instruments with respect to the mechanical workshop
CO 7
trades
CO 8 Apply appropriate safety measures with respect to the mechanical workshop trades
Mapping of course outcomes with program outcomes:
PO
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10 PO 11
12
CO 1 1 - - - 1 1 - - 2 2 - -
CO 2 1 - - - 1 1 - - 2 2 - -
CO 3 1 - - - 1 1 - 2 2 2 1 -
CO 4 1 - - - 1 1 - 2 2 2 1 1
CO 5 1 - - - 1 1 - - 2 2 1
CO 6 2
CO 7 2
CO 8 2
Mark distribution
100 70 30 1 hour
Assessment Procedure: Total marks allotted for the course is 100 marks. CIE shall be conducted for
70 marks and ESE for 30 marks. CIE should be done for the work done by the student and also
viva voce based on the work done on each practical session. ESE shall be evaluated by written
examination of one hour duration conducted internally by the institute.
SYLLABUS
PART 1
CIVIL WORKSHOP
Exercise 1. Calculate the area of a built-up space and a small parcel of land- Use standard
measuring tape and digital distance measuring devices
Exercise 2. (a) Use screw gauge and vernier calliper to measure the diameter of a steel rod and
thickness of a flat bar
(b) Transfer the level from one point to another using a water level
(c) Set out a one room building with a given plan and measuring tape
Exercise 3. Find the level difference between any two points using dumpy level
Exercise 4. (a) Construct a 1 thick brick wall of 50 cm height and 60 cm length using English
bond. Use spirit level to assess the tilt of walls.
(b) Estimate the number of different types of building blocks to construct this wall.
Exercise 5. (a) Introduce the students to plumbing tools, different types of pipes, type of
connections, traps, valves ,fixtures and sanitary fittings.
(b) Install a small rainwater harvesting installation in the campus
Reference Books:
1. Khanna P.N, “Indian Practical Civil Engineering Handbook”, Engineers Publishers.

2. Bhavikatti. S, "Surveying and Levelling (Volume 1)", I.K. International Publishing House
3. Arora S.P and Bindra S.P, " Building Construction", Dhanpat Rai Publications
4. S. C. Rangwala, “Engineering Materials,” Charotar Publishing House.
PART II
MECHANICAL WORKSHOP
LIST OF EXERCISES
(Minimum EIGHT units mandatory and FIVE models from Units 2 to 8 mandatory)
UNIT 1:- General : Introduction to workshop practice, Safety precautions, Shop floor ethics, Basic
First Aid knowledge.
Study of mechanical tools, components and their applications: (a) Tools: screw drivers,
spanners, Allen keys, cutting pliers etc and accessories (b) bearings, seals, O-rings, circlips,
keys etc.
UNIT 2:- Carpentry : Understanding of carpentry tools
Minimum any one model
1. T –Lap joint 2. Cross lap joint 3. Dovetail joint 4. Mortise joints
UNIT 3:- Foundry : Understanding of foundry tools
1.Bench Molding 2. Floor Molding 3. Core making 4. Pattern making
UNIT 4: - Sheet Metal : Understanding of sheet metal working tools
1. Cylindrical shape
2. Conical shape
3. Prismatic shaped job from sheet metal
UNIT 5: - Fitting : Understanding of tools used for fitting
1. Square Joint
2. V- Joint
3. Male and female fitting
UNIT 6: - Plumbing : Understanding of plumbing tools, pipe joints
Any one exercise on joining of pipes making use of minimum three types of pipe joints
UNIT 7: - Smithy: Understanding of tools used for smithy.

Demonstrating the forge-ability of different materials (MS, Al, alloy steel and cast steels)
in cold and hot states.
Observing the qualitative difference in the hardness of these materials
Minimum any one exercise on smithy
1. Square prism
2. Hexagonal headed bolt
3. Hexagonal prism
4. Octagonal prism
UNIT 8: -Welding: Understanding of welding equipments

Minimum any one welding practice
Making Joints using electric arc welding. bead formation in horizontal, vertical
and over head positions
UNIT 9: - Assembly: Demonstration only

Dissembling and assembling of
1. Cylinder and piston assembly
2. Tail stock assembly
3. Bicycle
4. Pump or any other machine
UNIT 10: - Machines: Demonstration and applications of the following machines

Shaping and slotting machine; Milling machine; Grinding Machine; Lathe; Drilling
Machine.
UNIT 11: - Modern manufacturing methods: Power tools, CNC machine tools, 3D printing, Glass
cutting.
No Topic No of Sessions
1 INTRODUCTION
Workshop practice, shop floor precautions, ethics and First Aid

knowledge.
1.1 Studies of mechanical tools, components and their applications: (a) 1
Tools: screw drivers, spanners, Allen keys, cutting pliers etc and
accessories (b) bearings, seals, O-rings, circlips, keys etc
2 CARPENTRY
2.1 Understanding of carpentry tools and making minimum one model 2

3 FOUNDRY
3.1 Understanding of foundry tools and making minimum one model 2
4 SHEET METAL
Understanding of sheet metal working tools and making minimum

4.1 2
one model
5 FITTING
5.1 Understanding of fitting tools and making minimum one model 2
6 PLUMBING
Understanding of pipe joints and plumbing tools and making

6.1
minimum one model 2
7 SMITHY
7.1 Understanding of smithy tools and making minimum one model 2
8 WELDING
Understanding of welding equipments and making minimum one

8.1
model 2
9 ASSEMBLY
Demonstration of assembly and dissembling of multiple parts

9.1
components 1
10 MACHINES
10.1 Demonstration of various machines 1
11 MODERN MANUFACTURING METHODS
Demonstrations of: power tools, CNC Machine tools, 3D printing,

11.1
Glass cutting 1
ESL 130 ELECTRICAL & CATEGORY L T P CREDIT YEAR OF
ELECTRONICS WORKSHOP INTRODUCTION
ESC 0 0 2 1 2019
Preamble: Electrical Workshop is intended to impart skills to plan and carry out simple
electrical wiring. It is essential for the practicing engineers to identify the basic practices and
safety measures in electrical wiring.
Prerequisite: NIL
CO 1 Demonstrate safety measures against electric shocks.

CO 2 Identify the tools used for electrical wiring, electrical accessories, wires, cables, batteries
and standard symbols
CO 3 Develop the connection diagram, identify the suitable accessories and materials necessary
for wiring simple lighting circuits for domestic buildings
CO 4 Identify and test various electronic components
CO 5 Draw circuit schematics with EDA tools
CO 6 Assemble and test electronic circuits on boards
CO 7 Work in a team with good interpersonal skills
10 11 12
CO 1 - - - - - 3 - - - - - 1
CO 2 2 - - - - - - - - 1 - -
CO 3 2 - - 1 - 1 - 1 2 2 - 2
CO 4 3 - - - - - - - - - - 2
CO 5 3 - - - 2 - - - - - - 2
CO 6 3 - - - 2 - - - - - - 1
CO 7 - - - - - - - - 3 2 - 2
Mark distribution

Duration(Internal)
100 100 - 1 hour

Syllabus
PART 1
ELECTRICAL
List of Exercises / Experiments
1. a) Demonstrate the precautionary steps adopted in case of Electrical shocks.

b)Identify different types of cables, wires, switches, fuses, fuse carriers, MCB, ELCB
and MCCB with ratings.
2. Wiring of simple light circuit for controlling light/ fan point (PVC conduit wiring)
3. Wiring of light/fan circuit using Two way switches . (Staircase wiring)
4. Wiring of Fluorescent lamps and light sockets (6A) with a power circuit for controlling power
device. (16A socket)
5. Wiring of power distribution arrangement using single phase MCB distribution board with
ELCB, main switch and Energy meter.
6. a)Identify different types of batteries with their specifications.
b)Demonstrate the Pipe and Plate Earthing Schemes using Charts/Site Visit.
PART II
ELECTRONICS
List of Exercises / Experiments (Minimum of 7 mandatory)
1. Familiarization/Identification of electronic components with specification

(Functionality, type, size, colour coding, package, symbol, cost etc. [Active, Passive,
Electrical, Electronic, Electro-mechanical, Wires, Cables, Connectors, Fuses, Switches,
Relays, Crystals, Displays, Fasteners, Heat sink etc.)
2. Drawing of electronic circuit diagrams using BIS/IEEE symbols and introduction to EDA
tools (such as Dia or XCircuit), Interpret data sheets of discrete components and IC’s,
Estimation and costing.
3. Familiarization/Application of testing instruments and commonly used tools.

[Multimeter, Function generator, Power supply, DSO etc.] [Soldering iron, De-
soldering pump, Pliers, Cutters, Wire strippers, Screw drivers, Tweezers, Crimping
tool, Hot air soldering and de- soldering station etc.]
4. Testing of electronic components [Resistor, Capacitor, Diode, Transistor and JFET

using multimeter.]
5. Inter-connection methods and soldering practice. [Bread board, Wrapping, Crimping,

Soldering - types - selection of materials and safety precautions, soldering practice in
connectors and general purpose PCB, Crimping.]
6. Printed circuit boards (PCB) [Types, Single sided, Double sided, PTH, Processing
methods, Design and fabrication of a single sided PCB for a simple circuit with manual
etching (Ferric chloride) and drilling.]
7. Assembling of electronic circuits using SMT (Surface Mount Technology) stations.
8. Assembling of electronic circuit/system on general purpose PCB, test and show the
functioning (Any Two circuits).
1. Fixed voltage power supply with transformer, rectifier diode, capacitor filter,
zener/IC regulator.
2. Square wave generation using IC 555 timer in IC base.

3. Sine wave generation using IC 741 OP-AMP in IC base.
4. RC coupled amplifier with transistor BC107.
SEMESTER II
MAT VECTOR CALCULUS, CATEGORY L T P CREDIT Year of
102 DIFFERENTIAL EQUATIONS AND Introduction
TRANSFORMS BSC 3 1 0 4 2019
Preamble: This course introduces the concepts and applications of differentiation and integration of
vector valued functions, differential equations, Laplace and Fourier Transforms. The objective of this
course is to familiarize the prospective engineers with some advanced concepts and methods in
Mathematics which include the Calculus of vector valued functions, ordinary differential equations
and basic transforms such as Laplace and Fourier Transforms which are invaluable for any engineer’s
mathematical tool box. The topics treated in this course have applications in all branches of
engineering.
Prerequisite: Calculus of single and multi variable functions.
CO 1 Compute the derivatives and line integrals of vector functions and learn their applications
CO 2 Evaluate surface and volume integrals and learn their inter-relations and applications.
CO 3 Solve homogeneous and non-homogeneous linear differential equation with constant
coefficients
CO 4 Compute Laplace transform and apply them to solve ODEs arising in engineering
CO 5 Determine the Fourier transforms of functions and apply them to solve problems arising in
engineering
PO 1 PO PO 3 PO 4 PO 5 PO 6 PO 7 PO PO 9 PO 10 PO 11 PO 12
2 8
CO 1 3 3 3 3 2 1 1 2 2
CO 2 3 3 3 3 2 1 1 2 2
CO 3 3 3 3 3 2 1 1 2 2
CO 4 3 3 3 3 2 1 1 2 2
CO 5 3 3 3 3 2 1 1 2 2
Assessment Pattern

Test 1 Test 2 (Marks)
(Marks (Marks)
Remember 10 10 20
Understand 20 20 40
Apply 20 20 40
Analyse
Evaluate
Create
Mark distribution
150 50 100 3 hours
Assignments: Assignment should include specific problems highlighting the applications of the
methods introduced in this course in science and engineering.
Course Outcome 1 (CO1): Compute the derivatives and line integrals of vector functions and learn
their applications
1. How would you calculate the speed, velocity and acceleration at any instant of a particle moving
in space whose position vector at time 𝑡is 𝒓(𝑡)?
2. Find the work done by the force field 𝐹 = (𝑒 − 𝑦 )𝒊 + (cos 𝑦 + 𝑥 )on a particle that travels
once around the unit circle centred at origin having radius 1.
3. When do you say that a vector field is conservative? What are the implications if a vector field is
conservative?
Course Outcome 2 (CO2): Evaluate surface and volume integrals and learn their inter-relations and
applications
1. Write any one application each of line integral, double integral and surface integral.
2. Use the divergence theorem to find the outward flux of the vector field 𝐹(𝑥, 𝑦 , 𝑧) = 𝑧𝒌across the
𝑥 +𝑦 +𝑧 =𝑎
3. State Greens theorem. Use Green’s theorem to express the area of a plane region bounded by a
curve as a line integral.
Course Outcome 3 (CO3): Solve homogeneous and non-homogeneous linear differential equation
with constant coefficients
1. If 𝑦 (𝑥) and 𝑦 (𝑥) are solutions of𝑦 + 𝑝𝑦 + 𝑞𝑦 = 0, where 𝑝, 𝑞 are constants, show that
𝑦 (𝑥) + 𝑦 (𝑥) is also a solution.
2. Solve the differential equation 𝑦 + 𝑦 = 0.001𝑥 using method of undetermined coefficient.
3. Solve the differential equation of𝑦 − 3𝑦 + 3𝑦 − 𝑦 = 𝑒 − 𝑥 − 1.
Course Outcome 4 (CO4): Compute Laplace transform and apply them to solve ODEs arising in
engineering
1. What is the inverse Laplace Transformof (𝑠) = ?
2. Find Laplace Transform of Unit step function.
3. Solve the differential equation of 𝑦 + 9𝑦 = 𝛿 𝑡 − ? Given 𝑦(0) = 2, 𝑦 (0) = 0
Course Outcome 5(CO5): Determine the Fourier transforms of functions and apply them to solve
problems arising in engineering
1. Find the Fourier integral representation of function defined by

𝑓(𝑥) = 𝑒 for𝑥 > 0 and 𝑓(𝑥) = 0for𝑥 < 0.
2. What are the conditions for the existence of Fourier Transform of a function 𝑓(𝑥)?
3. Find the Fourier transform of 𝑓(𝑥) = 1 for |𝑥| < 1 and 𝑓(𝑥) = 0 otherwise.
QP CODE: PAGES:3
Reg No:______________
Name :______________
MONTH & YEAR
VECTOR CALCULUS, DIFFERENTIAL EQUATIONS AND TRANSFORMS
(2019-Scheme)
(Common to all branches)

PART A
1. Is the vector 𝒓 where 𝒓 = 𝑥𝒊 + 𝑦𝒋 + 𝑧𝒌 conservative. Justify your answer.

2. State Greens theorem including all the required hypotheses
3. What is the outward flux of 𝑭(𝒙, 𝒚, 𝒛) = 𝑥𝒊 + 𝑦𝒋 + 𝑧𝒌 across any unit cube.
4. What is the relationship between Green’s theorem and Stokes theorem?
5. Solve 𝑦 + 4𝑦 + 2.5𝑦 = 0
6. Does the function 𝑦 = 𝐶 cos 𝑥 + 𝐶 𝑠𝑖𝑛𝑥form a solution of𝑦 + 𝑦 = 0?. Is it the general
solution? Justify your answer.
7. Find the Laplace transform of 𝑒 sinh 4𝑡
8. Find the Laplace inverse transform of ( )
.
9. Given the Fourier transform 𝑒 of 𝑓(𝑥) = 𝑒 , find the Fourier transform of 𝑥𝑒

√
10. State the convolution theorem for Fourier transform
PART B
(Answer one full question from each module. Each full question carries 14 marks)
MODULE 1
11a) Prove that the force field 𝑭 = 𝑒 𝒊 + 𝑥𝑒 𝒋is conservative in the entire xy-plane
b) Use Greens theorem to find the area enclosed by the ellipse + =1
12 a) Find the divergence of the vector field𝑭 = (𝒙𝟐 𝒚𝟐 𝒛𝟐 )𝟑/𝟐

(𝑥𝒊 + 𝑦𝒋 + 𝑧𝒌)
b) Find the work done by the force field𝑭(𝑥, 𝑦, 𝑧) = 𝑥𝑦𝒊 + 𝑦𝑧𝒋 + 𝑥𝑧𝒌along C where
C is the curve𝒓(𝑡) = 𝑡𝒊 + 𝑡 𝒋 + 𝑡 𝒌
MODULE II
13 a) Use divergence theorem to find the outward flux of the vector field
𝑭 = 2𝑥𝒊 + 3𝑦𝒋 + 𝑧 𝒌acrossthe unit cube bounded by or 𝑥 = 0, 𝑦 = 0,𝑧 = 0, 𝑥 =

1,𝑦 = 1,𝑧 = 1
b) Find the circulation of 𝑭 = (𝑥 − 𝑧)𝒊 + (𝑦 − 𝑥)𝒋 + (𝒛 − 𝒙𝒚)𝒌 using Stokes theorem

around the triangle with vertices 𝐴(1,0,0), 𝐵(0,2,0)and 𝐶(0,0,1)
14 a) Use divergence theorem to find the volume of the cylindrical solid bounded
by 𝑥 + 4𝑥 + 𝑦 = 7, 𝑧 = −1, 𝑧 = 4, given the vector field 𝑭 = 𝒙𝑖 + 𝒚𝑗 + 𝒛𝑘
across surfaceof the cylinder
b) Use Stokes theorem to evaluate∫𝑪 𝑭. 𝒅𝒓where𝑭 = 𝑥 𝒊 + 3𝑥𝒋 − 𝑦 𝒌where Cis

the circle 𝑥 + 𝑦 = 1 in the xy- plane with counterclockwise orientation looking
down the positive z-axis
MODULE III
15 a) Solve 𝑦 + 4𝑦 + 4𝑦 = 𝑥 + 𝑒 cos 𝑥
b) Solve 𝑦 − 3𝑦 + 3𝑦 − 𝑦 = 𝑒 − 𝑥 − 1
16 a) Solve𝒚 + 𝟑𝑦 + 3𝑦 + 𝑦 = 30𝑒 given𝑦(0) = 3,𝑦 (0) = −3 , 𝑦 (0) = −47
b) Using method of variation of parameters, solve𝑦 + 𝑦 = 𝑠𝑒𝑐 𝑥
MODULE IV
17 a) Find the inverse Laplace transform of 𝐹(𝑠) =
b) Solve the differential equation𝑦 + 16𝑦 = 4𝛿(𝑡 − 3𝜋); 𝑦(0) = 2,𝑦 (0) = 0 using Laplace
transform
18 a) Solve𝑦 + 3𝑦 + 2𝑦 = 𝑓(𝑡) where 𝑓(𝑡) = 1 for 0 < 𝑡 < 1 and 𝑓(𝑡) = 1for 𝑡 > 1
using Laplace transform
b) Apply convolution theorem to find the Laplace inverse transform of ( )
MODULE V
19 a) Find the Fourier cosine integral representation for 𝑓(𝑥) = 𝑒 for 𝑥 > 0and
∞
𝑘 > 0 and hence evaluate ∫ the function
b) Does the Fourier sine transform 𝑓(𝑥) = 𝑥 sin 𝑥for 0 < 𝑥 < ∞ exist? Justify your
answer
20 a) Find the Fourier transform of 𝑓(𝑥) = |𝑥 |for |𝑥| < 1 and 𝑓(𝑥) = 0 otherwise
b) Find the Fourier cosine transform of 𝑓(𝑥) = 𝑒 for a> 0

Syllabus
Module 1 (Calculus of vector functions)
(Text 1: Relevant topics from sections 12.1, 12.2, 12.6, 13.6, 15.1, 15.2, 15.3)
Vector valued function of single variable, derivative of vector function and geometrical
interpretation, motion along a curve-velocity, speed and acceleration. Concept of scalar and vector
fields , Gradient and its properties, directional derivative , divergence and curl, Line integrals of
vector fields, work as line integral, Conservative vector fields , independence of path and potential
function(results without proof).
Module 2 ( Vector integral theorems)
(Text 1: Relevant topics from sections 15.4, 15.5, 15.6, 15.7, 15.8)
Green’s theorem (for simply connected domains, without proof) and applications to evaluating line
integrals and finding areas. Surface integrals over surfaces of the form z = g(x, y), y = g(x, z) or x =
g(y, z) , Flux integrals over surfaces of the form z = g(x, y), y = g(x, z) or x = g(y, z), divergence
theorem (without proof) and its applications to finding flux integrals, Stokes’ theorem (without
proof) and its applications to finding line integrals of vector fields and work done.
Module- 3 ( Ordinary differential equations)
(Text 2: Relevant topics from sections 2.1, 2.2, 2.5, 2.6, 2.7, 2.10, 3.1, 3.2, 3.3)
Homogenous linear differential equation of second order, superposition principle,general solution,

homogenous linear ODEs with constant coefficients-general solution. Solution of Euler-Cauchy
equations (second order only).Existence and uniqueness (without proof). Non homogenous linear
ODEs-general solution, solution by the method of undetermined coefficients (for the right hand side
of the form 𝑥 ,𝑒 ,𝑠𝑖𝑛𝑎𝑥,𝑐𝑜𝑠𝑎𝑥,𝑒 𝑠𝑖𝑛𝑎𝑥𝑒 𝑐𝑜𝑠𝑎𝑥and their linear combinations), methods of
variation of parameters. Solution of higher order equations-homogeneous and non-homogeneous
with constant coefficient using method of undetermined coefficient.
Module- 4 (Laplace transforms)
(Text 2: Relevant topics from sections 6.1,6.2,6.3,6.4,6.5)
Laplace Transform and its inverse ,Existence theorem ( without proof) , linearity,Laplace transform
of basic functions, first shifting theorem, Laplace transform of derivatives and integrals, solution of
differential equations using Laplace transform, Unit step function, Second shifting theorems. Dirac
delta function and its Laplace transform, Solution of ordinary differential equation involving unit
step function and Dirac delta functions. Convolution theorem(without proof)and its application to
finding inverse Laplace transform of products of functions.
Module-5 (Fourier Tranforms)
(Text 2: Relevant topics from sections 11.7,11.8, 11.9)
Fourier integral representation, Fourier sine and cosine integrals. Fourier sine and cosine transforms,
inverse sine and cosine transform. Fourier transform and inverse Fourier transform, basic properties.
The Fourier transform of derivatives. Convolution theorem (without proof)
Text Books
1. H. Anton, I. Biven S.Davis, “Calculus”, Wiley, 10th edition, 2015.
2. Erwin Kreyszig, “Advanced Engineering Mathematics”, Wiley, 10 th edition, 2015.
Reference Books
1. J. Stewart, Essential Calculus, Cengage, 2nd edition, 2017
2. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9 th Edition, Pearson,Reprint,
2002.
3. Peter O Neil, Advanced Engineering Mathematics, 7th Edition, Thomson, 2007.
4. Louis C Barret, C Ray Wylie, “Advanced Engineering Mathematics”, Tata McGraw Hill, 6 th
edition, 2003.
5. VeerarajanT.”Engineering Mathematics for first year”, Tata McGraw - Hill, 2008.
6. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36 th edition , 2010.
7. Srimanta Pal, Subodh C. Bhunia, “Engineering Mathematics”, Oxford University Press, 2015.
8. Ronald N. Bracewell, “The Fourier Transform and its Applications”, McGraw – Hill
International Editions, 2000.
1 Calculus of vector functions (9 hours)
1.1 Vector valued function of a scalar variable - derivative of vector valued 2

function of scalar variable t-geometrical meaning
1.2 Motion along a curve-speed , velocity, acceleration 1
1.3 Gradient and its properties, directional derivative , divergent and curl 3
1.4 Line integrals with respect to arc length, line integrals of vector fields. 2
Work done as line integral
1.5 Conservative vector field, independence of path, potential function 1

2 Vector integral theorems( 9 hours)
2.1 Green’s theorem and it’s applications 2
2.2 Surface integrals , flux integral and their evaluation 3
2.3 Divergence theorem and applications 2
2.4 Stokes theorem and applications 2
3 Ordinary Differential Equations (9 hours)
3.1 Homogenous linear equation of second order, Superposition principle, 1

general solution
3.2 Homogenous linear ODEs of second order with constant coefficients 2
3.3 Second order Euler-Cauchy equation 1
3.4 Non homogenous linear differential equations of second order with 3

constant coefficient-solution by undetermined coefficients, variation of
parameters.
3.5 Higher order equations with constant coefficients 2
4 Laplace Transform (10 hours)
4.1 Laplace Transform , inverse Transform, Linearity, First shifting theorem, 2

transform of basic functions
4.2 Transform of derivatives and integrals 1
4.3 Solution of Differential equations, Initial value problems by Laplace 2

transform method.
4.4 Unit step function --- Second shifting theorem 2
4.5 Dirac Delta function and solution of ODE involving Dirac delta function 2
4.6 Convolution and related problems. 1
5 Fourier Transform (8 hours)
5.1 Fourier integral representation 1
5.2 Fourier Cosine and Sine integrals and transforms 2
5.3 Complex Fourier integral representation, Fourier transform and its 3

inverse transforms, basic properties
5.4 Fourier transform of derivatives, Convolution theorem 2

PHT ENGINEERING PHYSICS A CATEGORY L T P CREDIT YEAR OF
100 (FOR CIRCUIT BRANCHES) INTRODUCTION
BSC 3 1 0 4 2019
Preamble: The aim of the Engineering Physics Program is to offer students a solid background in the
program is designed to develop scientific attitudes and enable the students to correlate
the concepts of Physics with the core programmes

CO 3 Analyze the behaviour of matter in the atomic and subatomic level through the principles of
quantum mechanics to perceive the microscopic processes in electronic devices.
CO 4 Classify the properties of magnetic materials and apply vector calculus to static magnetic
fields and use Maxwell’s equations to diverse engineering problems
CO 5 Analyze the principles behind various superconducting applications, explain the working of
solid state lighting devices and fibre optic communication system
CO 1 3 2 1 2 1
CO 2 3 2 1 2 1
CO 3 3 2 1 2 1
CO 4 3 1 1 2 1
CO 5 3 1 1 2 1
Assessment Pattern

Remember 15 15 30
Understand 25 25 50
Apply 10 10 20
Analyse
Evaluate
Create
Mark distribution

marks marks
150 50 100 3 hours

stretched string.

3. (a) Explain the formation of Newton’s rings and obtain the expression for radii of bright and
dark rings in reflected system. Also explain how it is used to determine the wavelength of
a monochromatic source of light.
(b) A liquid of refractive index µ is introduced between the lens and glass plate.
What happens to the fringe system? Justify your answer.
1. Give the physical significance of wave function ?
3. (a) Solve Schrodinger equation for a particle in a one dimensional box and obtain its
energy eigen values and normalised wave functions.
1. Compare displacement current and conduction current.
2. Mention any four properties of ferro magnetic materials.
3. (a) Starting from Maxwell’s equations, derive the free space electromagnetic wave
equation and show that velocity of electromagnetic wave is 1/ (µo εo) ½
(b) An electromagnetic wave is described by E = 100 exp 8πi [10 14 t – (10 6 z / 3)] V/m.
Find the direction of propagation of the wave,speed of the wave and magnetic flux
density in the wave.
1. Explain the working of a solar cell.
2. Distinguish between Type I and Type II super conductors.
3. (a) Define numerical aperture and derive an expression for it.
(b) Explain the working of intensity modulated fibre optic sensor.

QP CODE: PAGES:3
Reg No:______________
Name :______________
MONTH & YEAR
Course Name: Engineering Physics A
PART A
1. Compare electrical and mechanical oscillators
2. Distinguish between longitudinal and transverse waves
line broadening.
7. State Faraday’s laws of electromagnetic induction.
8. Compare displacement current and conduction current
9. List four important applications of superconductors.
10. Give the working principle of LED. (10x3=30)
PART B
Module 1
solution.Discuss the cases of over damped, critically damped and under damped cases. (10)
(b) The frequency of a tuning fork is 500 Hz and its Q factor is 7×10 4. Find the relaxation time.
Also calculate the time after which its energy becomes 1/10 of its initial undamped value.(4)
(b) The equation of transverse vibration of a stretched string is given by y =0.00327 sin (72.1x-
2.72t)m, in which the numerical constants are in S.I units. Evaluate (i) Amplitude (ii) Wavelength
(iii) Frequency and (iv)Velocity of the wave. (4)
Module 2
13.(a)Explain the formation of Newton’s rings and show that the radius of dark ring is
experiment to determine the refractive index of a liquid. (10)
(b) Two pieces of plane glass are placed together with a piece of paper between two at one
end. Find the angle of the wedge in seconds if the film is viewed with a monochromatic light of
wavelength 4800Å. Given β = 0.0555 cm. (4)
14. (a) Explain the diffraction due to a plane transmission grating. Obtain the grating equation. (10)
Module 3
15.(a) Derive time dependent and independent Schrodinger equations. (10)
(b) An electron is confined to one dimensional potential box of length 2Å. Calculate the energies
corresponding to the first and second quantum states in eV. (4)
16.(a) Classify nanomaterials based on dimensionality of quantum confinement and explain the
Module 4
17.(a) State Poynting’s Theorem. Calculate the value of Poynting vector at the surface of the sun if
the power radiated by the sun is 3.8 x 10 26 W and its radius is 7 X 10 8 m. (5)
(b) Distinguish between paramagnetic, diamagnetic and ferromagnetic materials. (9)
18.(a) Starting from Maxwell’s Equations, derive electromagnetic wave equations in free space. (10)
(b) If the magnitude of H in a plane wave is 1 A/m, find the magnitude of E in free space. (4)
Module 5
19.(a) Show that superconductors are perfect diamagnets. Distinguish between Type I and
Type II superconductors with suitable examples. (10)
(b) Write a short note on high temperature superconductors. (4)
20.(a) Define numerical aperture of an optic fibre and derive an expression for the NA of a step
(b) Calculate the numerical aperture and acceptance angle of a fibre with a core refractive index
of 1.54 and a cladding refractive index of 1.50 when the fibre is inside water of refractive
index 1.33. (4) (14x5=70)
Syllabus
ENGINEERING PHYSICS A
(FOR CIRCUIT BRANCHES)
Module 1
Module 2
Wave Optics

Module 3
Applications-Absence of electrons inside a nucleus and Natural line broadening mechanism,
Formulation of time dependent and independent Schrodinger wave equations-Physical meaning of
Module 4
Magnetism & Electro Magnetic Theory
Magnetic field and Magnetic flux density, Gauss’s law for Magnetic flux density, Ampere’s Circuital
law, Faraday’s law in terms of EMF produced by changing magnetic flux, Magnetic permeability and
susceptibility, Classification of magnetic materials-para, dia and ferromagnetic materials
Fundamentals of vector calculus, concept of divergence, gradient and curl along with physical
significance, Line, Surface and Volume integrals, Gauss divergence theorem & Stokes’ theorem,
Equation of continuity, Derivation of Maxwell’s equations in vacuum, Comparison of displacement
current with conduction current. Electromagnetic waves, Velocity of Electromagnetic waves in free
Module 5
Superconductivity & Photonics
Superconducting phenomena, Meissner effect and perfect diamagnetism, Types of superconductors-
Type I and Type II, BCS Theory (Qualitative), High temperature superconductors-Applications of
super conductivity
Introduction to photonics-Photonic devices-Light Emitting Diode, Photo detectors -Junction and PIN
photodiodes, Solar cells-I-V Characteristics, Optic fibre-Principle of propagation of light, Types of
fibres-Step index and Graded index fibres, Numerical aperture –Derivation, Fibre optic
communication system (block diagram), Industrial, Medical and Technological applications of optical
fibre, Fibre optic sensors-Intensity Modulated and Phase modulated sensors.
Text Books

&Co., Revised Edition 2019
2. H.K.Malik , A.K. Singh, “Engineering Physics” McGraw Hill Education, Second Edition 2017
Reference Books
1. Arthur Beiser, “Concepts of Modern Physics ", Tata McGraw Hill Publications, 6th Edition
2003
3. Md.N.Khan & S.Panigrahi “Principles of Engineering Physics 1&2”, Cambridge University

Press, 2016
7. Halliday, Resnick, Walker, “Fundamentals of Physics’’, John Wiley & Sons.Inc, 2001
8. David J Griffiths, “Introduction to Electrodynamics’’, Addison-Wesley publishing, 3rd Edition,

1999
9. Premlet B., “Advanced Engineering Physics”, Phasor Books,10th edition,2017
10. I. Dominic and. A. Nahari, “A Text Book of Engineering physics”, Owl Books Publishers,
Revised edition, 2016
1 Oscillations and Waves (9 hours)

derivation) 2 hrs
1.4 Distinction between transverse and longitudinal waves. Transverse 2 hrs

2.2 Interference due to wedge shaped films -Determination of thickness 4 hr
4 Magnetism & Electro Magnetic Theory (9 hours)
4.1 Magnetic field and Magnetic flux density, Gauss’s law for Magnetic flux 2 hrs
density, Ampere’s Circuital law, Faraday’s law in terms of EMF
produced by changing magnetic flux
4.2 Explanation for Magnetic permeability and susceptibility Classification 1 hr
of magnetic materials- para, dia and ferromagnetic materials
4.3 Fundamentals of vector calculus, concept of divergence, gradient and 2 hrs
curl along with physical significance, Line, Surface and Volume integrals,
Gauss divergence theorem & Stokes’ theorem
4.4 Equation of continuity, Derivation of Maxwell’s equations in vacuum, 4 hrs
Comparison of displacement current with conduction current.
Electromagnetic waves, Velocity of Electromagnetic waves in free
5 Superconductivity &Photonics (9hours)
5.1 Super conducting Phenomena, Meissner effect and perfect 2 hrs
diamagnetism, Types of superconductors-Type I and Type II
5.2 BCS Theory (Qualitative), High temperature superconductors, 2 hrs
Applications of super conductivity
5.3 Introduction to photonics-Photonic devices-Light Emitting Diode, Photo 2 hrs
detectors -Junction and PIN photodiodes, Solar cells-I-V Characteristics
Technological applications of optical fibre, Fibre optic sensors-Intensity
Modulated and Phase modulated sensors
PHT ENGINEERING PHYSICS B Category L T P CREDIT Year of
110 (FOR NON-CIRCUIT BRANCHES) Introduction
BSC 3 1 0 4 2019
Preamble: The aim of the Engineering Physics program is to offer students a solid background in the
program is designed to develop scientific attitudes and enable the students to
correlate the concepts of Physics with the core programmes

CO 3 Analyze the behaviour of matter in the atomic and subatomic level through the principles
of quantum mechanics to perceive the microscopic processes in electronic devices.
CO 4 Apply the knowledge of ultrasonics in non-destructive testing and use the principles of
acoustics to explain the nature and characterization of acoustic design and to provide a safe
and healthy environment
CO 5 Apply the comprehended knowledge about laser and fibre optic communication systems in
various engineering applications
10 11 12
CO 1 3 2 1 2 1
CO 2 3 2 1 2 1
CO 3 3 2 1 2 1
CO 4 3 1 2 1
CO 5 3 2 1 2 1
Assessment Pattern

Remember 15 15 30
Understand 25 25 50
Apply 10 10 20
Analyse
Evaluate
Create
Mark distribution

MARKS MARKS
150 50 100 3 hours


stretched string.

3. (a) Explain the formation of Newton’s rings and obtain the expression for radii of bright
and dark rings in reflected system. Also explain how it is used to determine the
wavelength of a monochromatic source of light.
(b) A liquid of refractive index µ is introduced between the lens and glass plate. What
happens to the fringe system? Justify your answer.
1. Give the physical significance of wave function?

3. (a) Solve Schrodinger equation for a particle in a one dimensional box and obtain its energy
eigen values and normalised wave functions.

1. Explain reverberation and reverberation time.
2. How ultrasonic waves are used in non-destructive testing.
3. (a) With a neat diagram explain how ultrasonic waves are produced by a piezoelectric
oscillator.
(b) Calculate frequency of ultrasonic waves that can be produced by a nickel rod of length 4
cm. (Young’s Modulus = 207 G Pa, Density = 8900 Kg /m3)

1. Distinguish between spontaneous emission and stimulated emission.
2. Explain optical resonators.
3. (a) Explain the construction and working of Ruby Laser.
(b) Calculate the numerical aperture and acceptance angle of a fibre with a core refractive
index of 1.54 and a cladding refractive index of 1.50 when the fibre is inside water of
refractive index 1.33.
.
QP CODE: PAGES:3
Reg No:______________
Name :______________
MONTH & YEAR
Course Name: Engineering Physics B
Max.Marks: 100 Duration: 3 Hours
PART A
1. Compare electrical and mechanical oscillators.
2. Distinguish between longitudinal and transverse waves.
line broadening.
7. Define sound intensity level. Give the values of threshold of hearing and threshold of pain.
8. Describe the method of non-destructive testing using ultra sonic waves
9. Explain the condition of population inversion
10. Distinguish between step index and graded index fibre. (10x3=30)
PART B
Module 1
solution. Discuss the cases of over damped, critically damped and under damped
cases. (10)
(b) The frequency of a tuning fork is 500 Hz and its Q factor is 7×104. Find the relaxation
time. Also calculate the time after which its energy becomes 1/10 of its initial
undamped value. (4)
(b) The equation of transverse vibration of a stretched string is given by y =0.00327 sin
(72.1x-2.72t ) m, in which the numerical constants are in S.I units. Evaluate (i)
Amplitude (ii) Wavelength (iii) Frequency and (iv) Velocity of the wave. (4)
Module 2
13. (a) Explain the formation of Newton’s rings and show that the radius of dark ring is
experiment to determine the refractive index of a liquid? (10)
(b) Two pieces of plane glass are placed together with a piece of paper between two at
one end. Find the angle of the wedge in seconds if the film is viewed with a
monochromatic light of wavelength 4800Å. Given β = 0.0555 cm. (4)
14. (a) Explain the diffraction due to a plane transmission grating. Obtain the grating equation.
(10)
Module 3
15. (a) Derive time dependent and independent Schrodinger equations. (10)
(b) An electron is confined to one dimensional potential box of length 2Å. Calculate the
energies corresponding to the first and second quantum states in eV. (4)
16. (a) Classify nanomaterials based on dimensionality of quantum confinement and explain the
Module 4
17. (a) Explain reverberation and reverberation time? What is the significance of
Reverberation time. Explain the factors affecting the acoustics of a building and their
corrective measures? (10)
(b) The volume of a hall is 3000 m3. It has a total absorption of 100m2 sabine. If the hall is filled
with audience who add another 80 m2sabine, then find the difference in reverberation time. (4)
18. (a) With a neat diagram explain how ultrasonic waves are produced by piezoelectric
oscillator. Also discuss the piezoelectric method of detection of ultrasonic waves. (10)
(b) An ultrasonic source of 0.09 MHz sends down a pulse towards the sea bed which
returns after 0.55 sec. The velocity of sound in sea water is 1800 m/s. Calculate the
depth of the sea and the wavelength of the pulse. (4)
Module 5
19. (a) Outline the construction and working of Ruby laser. (8)
(b) What is the principle of holography? How is a hologram recorded? (6)
20. (a) Define numerical aperture of an optic fibre and derive an expression for the NA of a step
(b) An optical fibre made with core of refractive index 1.5 and cladding with a fractional
index difference of 0.0006. Find refractive index of cladding and numerical aperture. (4)
(14x5=70)
SYLLABUS
ENGINEERING PHYSICS B (FOR NON-CIRCUIT BRANCHES)
Module 1
Module 2
Wave Optics

Module 3
Applications-Absence of electrons inside a nucleus and Natural line broadening Mechanism,
Formulation of time dependent and independent Schrodinger wave equations-Physical Meaning of
Module 4
Acoustics & Ultrasonics
Acoustics, Classification of sound-Musical sound-Noise, Characteristics of Musical Sounds-Pitch or
frequency-Loudness or Intensity-Measurement of Intensity level-Decibel-Quality or timbre,
Absorption coefficient, Reverberation-Reverberation time-Significance- Sabine’s formula (no
derivation), Factors affecting architectural acoustics and their remedies
Ultrasonics-Production- Magnetostriction effect and Piezoelectric effect, Magnetostriction oscillator

and Piezoelectric oscillator –Working, Detection of ultrasonic waves - Thermal and Piezoelectric
methods, Ultrasonic diffractometer- Expression for the velocity of ultrasonic waves in a liquid ,
Applications of ultrasonic waves -SONAR,NDT and Medical
Module 5
Laser and Fibre optics
Properties of laser, Absorption and emission of radiation, Spontaneous and stimulated emission,
Einstein’s coefficients (no derivation), Population inversion, Metastable states, basic components of
laser, Active medium, Pumping mechanism, Optical resonant cavity, working principle, Construction
and working of Ruby laser and Helium neon laser ,Construction and working of semiconductor
laser(Qualitative) ,Applications of laser, Holography, Difference between hologram and photograph,
Recording of hologram and reconstruction of image, Applications
Optic fibre-Principle of propagation of light, Types of fibres-Step index and Graded index fibres,
Numerical aperture –Derivation, Fibre optic communication system (block diagram), Industrial,
Medical and Technological applications, Fibre optic sensors-Intensity Modulated and Phase
modulated sensors
Text Books
&Co., Revised Edition, 2019.
2. H.K.Malik , A.K. Singh, “Engineering Physics” McGraw Hill Education, Second Edition, 2017.
Reference Books
1. Arthur Beiser, “Concepts of Modern Physics ", Tata McGraw Hill Publications, 6th Edition 2003
3. Md.N.Khan & S.Panigrahi “Principles of Engineering Physics 1&2”, Cambridge University Press,
2016
7. B. B. Laud, “Lasers and Non linear optics”, New age International Publishers, 2nd Edition ,2005
8. Premlet B., “Advanced Engineering Physics”, Phasor Books,10th edition ,2017
9. I. Dominic and. A. Nahari, “A Text Book of Engineering physics”, Owl Books Publishers, Revised
edition, 2016
1 Oscillations and Waves ( 9 hours)

derivation) 2 hrs
1.4 Distinction between transverse and longitudinal waves, Transverse 2 hrs

2.2 Interference due to wedge shaped films -Determination of thickness 4 hrs
4 Acoustics & Ultrasonics (9hrs)
4.1 Acoustics, Classification of sound-Musical sound-Noise, Characteristics 3 hrs

of Musical Sounds-Pitch or frequency-Loudness or Intensity-
Measurement of Intensity level-Decibel-Quality or timbre, Absorption
coefficient, Reverberation-Reverberation time-Significance- Sabine’s
formula (no derivation)
4.2 Factors affecting architectural acoustics and their remedies 1 hr
4.3 Ultrasonics-Production- Magnetostriction effect and Piezoelectric 3hrs

effect, Magnetostriction oscillator and Piezoelectric oscillator –
Working, Detection of ultrasonic waves - Thermal and Piezoelectric
methods
4.4 Ultrasonic diffractometer- Expression for the velocity of ultrasonic 2 hr
waves in a liquid ,Applications of ultrasonic waves -SONAR,NDT and
Medical.
5 Laser and Fibre optics ( 9hours)
5.1 Properties of laser, Absorption and emission of radiation, Spontaneous 2 hrs

and stimulated emission, Einstein’s coefficients (no derivation),
Population inversion, Metastable states, basic components of laser,
Active medium, Pumping mechanism, Optical resonant cavity, working
principle
5.2 Construction and working of Ruby laser and Helium neon laser 3 hrs
,Construction and working of semiconductor laser(Qualitative)
Applications of laser
5.3 Holography, Difference between hologram and photograph, Recording 1 hr
of hologram and reconstruction of image, Applications
Technological applications, Fibre optic sensors-Intensity Modulated and
Phase modulated sensors
CYT ENGINEERING CHEMISTRY CATEGORY L T P CREDIT YEAR OF
100 INTRODUCTION
BSC 3 1 0 4 2019
Preamble: To enable the students to acquire knowledge in the concepts of chemistry for engineering
applications and to familiarize the students with different application oriented topics like
spectroscopy, electrochemistry, instrumental methods etc. Also familiarize the students with topics
like mechanism of corrosion, corrosion prevention methods, SEM, stereochemistry, polymers,
desalination etc., which enable them to develop abilities and skills that are relevant to the study and
practice of chemistry.
Prerequisite: Concepts of chemistry introduced at the plus two levels in schools
CO 1 Apply the basic concepts of electrochemistry and corrosion to explore its possible
applications in various engineering fields.
CO 2 Understand various spectroscopic techniques like UV-Visible, IR, NMR and its
applications.
CO 3 Apply the knowledge of analytical method for characterizing a chemical mixture or a
compound. Understand the basic concept of SEM for surface characterisation of
nanomaterials.
CO 4 Learn about the basics of stereochemistry and its application. Apply the knowledge of
conducting polymers and advanced polymers in engineering.
CO 5 Study various types of water treatment methods to develop skills for treating
wastewater.
10 11 12
CO 1 1 2 1
CO 2 1 1 1 2
CO 3 1 1 1 2
CO 4 2 1
CO 5 1 1 3
Assessment Pattern

1 2
Remember 15 15 30
Understand 25 25 50
Apply 10 10 20
Analyse
Evaluate
Create
End Semester Examination Pattern: There will be two parts- Part A and Part B. Part A contains 10
questions (2 questions from each module), having 3 marks for each question. Students should
answer all questions. Part B contains 2 questions from each module, of which student should
answer any one. Each question can have maximum 2 subdivisions and carries 14 marks.
1. What is calomel electrode? Give the reduction reaction (3 Marks)
2. List three important advantages of potentiometric titration (3 Marks)
3. (a) Explain how electroless plating copper and nickel are carried out (10 Marks)
(b) Calculate the emf of the following cell at 30oC, Z n / Zn 2+ (0.1M) // Ag+ (0.01M) // Ag.
Given E0 Zn2+/Zn = -0.76 V, E0 Ag+/Ag = 0.8 V. (4 Marks)
Course Outcome 2 (CO 2)
1. State Beer Lambert’s law (3 Marks)
2. List the important applications of IR spectroscopy (3 Marks)
3. (a) What is Chemical shift? What are factors affecting Chemical shift? How 1H NMR spectrum of
CH3COCH2Cl interpreted using the concept of chemical shift. (10 Marks)
(b) Calculate the force constant of HF molecule, if it shows IR absorption at 4138 cm -1. Given that
atomic masses of hydrogen and fluorine are 1u and 19u respectively. (4 Marks)
1. Distinguish between TGA and DTA (3 Marks)
2. Give two differences between GSC and GLC (3 Marks)

3. (a) Explain the principle, instrumentation and procedure of HPLC (10 Marks)
(b) Interpret TGA of CaC2O4. H2O (4 Marks)
1. Explain the geometrical isomerism in double bonds (3 Marks)
2. What are the rules of assigning R-S notation? (3 Marks)
3. (a) What are conducting polymers? How it is classified? Give the preparation of polyaniline
(10 Marks)
(b) Draw the stereoisomers possible for CH3-(CHOH)2-COOH (4 Marks)
1. What is degree of hardness? (3 Marks)
2. Define BOD and COD (3 Marks)
3. (a) Explain the EDTA estimation of hardness (10 Marks)
(b) Standard hard water contains 20 g of CaCO3 per liter,50 mL of this required 30mL of EDTA
solution, 50mL of sample water required 20mL of EDTA solution. 50mL sample water after boiling
required 14 mL EDTA solution. Calculate the temporary hardness of the given sample of water, in
terms of ppm. (4 Marks)
MODEL QUESTION PAPER
Total Pages:
Reg No.:_______________ Name:__________________________

FIRST SEMESTER B.TECH DEGREE EXAMINATION
Course Code: CYT100,
Course Name: ENGINEERING CHEMISTRY
PART A
Answer all questions, each carries 3 marks Marks
1 What is potentiometric titration? How the end point is determined graphically? (3)
2 What is Galvanic series? How is it different from electrochemical series? (3)
3 Which of the following molecules can give IR absorption? Give reason? (3)
(a) O2 (b) H2O (c) N2 (d) HCl
4 Which of the following molecules show UV-Visible absorption? Give reason. (3)
(a) Ethane (b) Butadiene (c) Benzene
5 What are the visualization techniques used in TLC? (3)
6 Write the three important applications of nanomaterials. (3)
7 Draw the Fischer projection formula and find R-S notation of (3)
8 Write the structure of a) Polypyrroleb) Kevlar. (3

9 What is break point chlorination? (3)
10 What is reverse osmosis? (3)
PART B
Answer any one full question from each module, each question carries 14 marks
Module 1
11 a) Give the construction of Li-ion cell. Give the reactions that take place at the (10)
electrodes during charging and discharging. What happens to anodic material when
the cell is 100% charged.
b) Calculate the standard electrode potential of Cu, if its electrode potential at 25 °C (4)
2+
is 0.296 V and the concentration of Cu is 0.015 M.
OR
12 a) Explain the mechanism of electrochemical corrosion of iron in oxygen rich and oxygen (10)
deficient acidic and basic environments.
b) Given below are reduction potentials of some species (4)
MnO4- + 8H+ + 5e → Mn2+ + 4H2O; E0 = +1.51 V
Cl2 + 2e → 2Cl- ; E0 = +1.36 V
S2O82- + 2e → 2SO42- ; E0 = +1.98 V
Use the above data to examine whether the acids, dil. HCl and dil. H2SO4 , can be used
to provide acid medium in redox titrations involving KMnO4.
Module 2
13 a) What is spin-spin splitting? Draw the NMR spectrum of (i) CH3 CH2CH2 Br (ii) (10)
CH3CH(Br)CH3 Explain how NMR spectrum can be used to identify the two isomers.
b) A dye solution of concentration 0.08M shows absorbance of 0.012 at 600 nm; while a (4)
test solution of same dye shows absorbance of 0.084 under same conditions. Find the
concentration of the test solution.
OR
14 a) Explain the basic principle of UV-Visible spectroscopy. What are the possible (10)
electronic transitions? Explain with examples.
b) Sketch the vibrational modes of CO2 and H2O. Which of them are IR active? (4)
Module 3
15 a) Explain the principle, instrumentation and procedure involved in gas chromatography. (10)
b) Explain the DTA of CaC2O4.H2O with a neat sketch. (4)
OR
16 a) Explain the various chemical methods used for the synthesis of nanomaterial (10)
b) How TGA is used to analyse the thermal stability of polymers? (4)
Module 4
17 a) What are conformers? Draw thecis and transisomers of 1, 3-dimethylcylohexane. (10)

Which conformer (chair form) is more stable in each case?
b) What is ABS? Give properties and applications. (4)
OR
18 a) Explain the various structural isomers with suitable example. (10)
b) What is OLED? Draw a labelled diagram. (4)
Module 5
19 a) What are ion exchange resins? Explain ion exchange process for removal of hardness (10)
of water? How exhausted resins are regenerated?
b) 50 mL sewage water is diluted to 2000 mL with dilution water; the initial dissolved (4)
oxygen was 7.7 ppm. The dissolved oxygen level after 5 days of incubation was 2.4
ppm. Find the BOD of the sewage.
OR
20 a) What are the different steps in sewage treatment? Give the flow diagram. Explain the (10)
working of trickling filter.
b) Calculate the temporary and permanent hardness of a water sample which contains (4)
[Ca2+] = 160 mg/L, [Mg2+] = 192 mg/L and [HCO3-] = 122 mg/L.
Syllabus
Module 1
Electrochemistry and Corrosion
Introduction - Differences between electrolytic and electrochemical cells - Daniel cell - redox
reactions - cell representation. Different types of electrodes (brief) - Reference electrodes - SHE -
Calomel electrode - Glass Electrode - Construction and Working. Single electrode potential -
definition - Helmholtz electrical double layer -Determination of E0 using calomel
electrode.Determination of pH using glass electrode.Electrochemical series and its applications. Free
energy and EMF - Nernst Equation - Derivation - single electrode and cell (Numericals) -Application -
Variation of emf with temperature. Potentiometric titration - Introduction -Redox titration
only.Lithiumion cell - construction and working.Conductivity- Measurement of conductivity of a
Corrosion-Electrochemicalcorrosion – mechanism. Galvanic series- cathodic protection - electroless

plating –Copper and Nickel plating.
Module 2
Spectroscopic Techniques and Applications
Introduction- Types of spectrum - electromagnetic spectrum - molecular energy levels - Beer

Lambert’s law (Numericals). UV-Visible Spectroscopy – Principle - Types of electronic transitions -
Energy level diagram of ethane, butadiene, benzene and hexatriene. Instrumentation of UV-Visible
spectrometer and applications.IR-Spectroscopy – Principle - Number of vibrational modes -
Vibrational energy states of a diatomic molecule and -Determination of force constant of diatomic
molecule (Numericals) –Applications. 1H NMR spectroscopy – Principle - Relation between field
strength and frequency - chemical shift - spin-spin splitting (spectral problems ) - coupling constant
Module 3
Instrumental Methods and Nanomaterials
Thermal analysis –TGA- Principle, instrumentation (block diagram) and applications – TGA of
CaC2O4.H2O and polymers. DTA-Principle, instrumentation (block diagram) and applications - DTA of
CaC2O4.H2O. Chromatographic methods - Basic principles and applications of column and TLC-
Retention factor. GC and HPLC-Principle, instrumentation (block diagram) - retention time and
applications.
Nanomaterials - Definition - Classification - Chemical methods of preparation - Hydrolysis and

Reduction - Applications of nanomaterials - Surface characterisation -SEM – Principle and
instrumentation (block diagram).
Module 4
Stereochemistry and Polymer Chemistry
Isomerism-Structural, chain, position, functional, tautomerism and matamerism - Definition with

examples - Representation of 3D structures-Newman, Sawhorse, Wedge and Fischer projection of
substituted methane and ethane. Stereoisomerism - Geometrical isomerism in double bonds and
cycloalkanes (cis-trans and E-Z notations). R-S Notation – Rules and examples - Optical isomerism,
Chirality, Enantiomers and Diastereoisomers-Definition with examples.Conformational analysis of
ethane, butane, cyclohexane, mono and di methyl substituted cyclohexane.
Copolymers - Definition - Types - Random, Alternating, Block and Graft copolymers - ABS -
preparation, properties and applications.Kevlar-preparation, properties and applications.Conducting
polymers - Doping -Polyaniline and Polypyrrole - preparation properties and applications. OLED -
Principle, construction and advantages.
Module 5
Water Chemistry and Sewage Water Treatment
Water characteristics - Hardness - Types of hardness- Temporary and Permanent - Disadvantages of

hard water -Units of hardness- ppm and mg/L -Degree of hardness (Numericals) - Estimation of
hardness-EDTA method (Numericals). Water softening methods-Ion exchange process-Principle,
procedure and advantages. Reverse osmosis – principle, process and advantages. Municipal water
treatment (brief) - Disinfection methods - chlorination, ozone andUV irradiation.
Dissolved oxygen (DO) -Estimation (only brief procedure-Winkler’s method), BOD and COD-
definition, estimation (only brief procedure) and significance (Numericals). Sewage water treatment
- Primary, Secondary and Tertiary - Flow diagram -Trickling filter and UASB process.
Text Books
1. B. L. Tembe, Kamaluddin, M. S. Krishnan, “Engineering Chemistry (NPTEL Web-book)”,

2018.
2. P. W. Atkins, “Physical Chemistry”, Oxford University Press, 10th edn., 2014.
Reference Books
1. C. N. Banwell, “Fundamentals of Molecular Spectroscopy”, McGraw-Hill, 4thedn., 1995.
2. Donald L. Pavia, “Introduction to Spectroscopy”, Cengage Learning India Pvt. Ltd., 2015.
3. B. R. Puri, L. R. Sharma, M. S. Pathania, “Principles of Physical Chemistry”, Vishal Publishing

Co., 47th Edition, 2017.
4. H. H. Willard, L. L. Merritt, “Instrumental Methods of Analysis”, CBS Publishers, 7th Edition,

2005.
5. Ernest L. Eliel, Samuel H. Wilen, “Stereo-chemistry of Organic Compounds”, WILEY, 2008.
6. Raymond B. Seymour, Charles E. Carraher, “Polymer Chemistry: An Introduction”, Marcel

Dekker Inc; 4th Revised Edition, 1996.
7. MuhammedArif, Annette Fernandez, Kavitha P. Nair “Engineering Chemistry”, Owl Books,
2019.
8. Ahad J., “Engineering Chemistry”, Jai Publication, 2019.
9. Roy K. Varghese, “Engineering Chemistry”, Crownplus Publishers, 2019.
10. Soney C. George,RinoLaly Jose, “Text Book of Engineering Chemistry”, S. Chand & Company
Pvt Ltd, 2019.
No Topic No. of
Lectures
(hrs)
1 Electrochemistry and Corrosion 9
1.1 Introduction - Differences between electrolytic and electrochemical cells- Daniel 2

cell - redox reactions - cell representation. Different types of electrodes (brief) -
Reference electrodes- SHE - Calomel electrode - Glass Electrode - Construction
and Working.
1.2 Single electrode potential – definition - Helmholtz electrical double layer - 3

Determination of E0 using calomel electrode. Determination of pH using glass
electrode. Electrochemical series and its applications. Free energy and EMF -
Nernst Equation – Derivation - single electrode and cell (Numericals) -Application
-Variation of emf with temperature.
1.3 Potentiometric titration - Introduction -Redox titration only. Lithiumion cell - 2

construction and working. Conductivity- Measurement of conductivity of a
1.4 Corrosion-Electrochemicalcorrosion – mechanism. Galvanic series- cathodic 2

protection - electroless plating –Copper and Nickel plating.
2 Spectroscopic Techniques and Applications 9
2.1 Introduction- Types of spectrum - electromagnetic spectrum - molecular energy 2

levels - Beer Lambert’s law (Numericals).
2.2 UV-Visible Spectroscopy – Principle - Types of electronic transitions - Energy 2

level diagram of ethane, butadiene, benzene and hexatriene. Instrumentation of
UV-Visible spectrometer and applications.
2.3 IR-Spectroscopy – Principle - Number of vibrational modes -Vibrational energy 2

states of a diatomic molecule and -Determination of force constant of diatomic
molecule (Numericals) –Applications.
1
2.4 H NMR spectroscopy – Principle - Relation between field strength and frequency 3
- chemical shift - spin-spin splitting (spectral problems ) - coupling constant
3 Instrumental Methods and Nanomaterials 9
3.1 Thermal analysis –TGA- Principle, instrumentation (block diagram) and 2

applications – TGA of CaC2O4.H2O and polymers. DTA-Principle, instrumentation
(block diagram) and applications - DTA of CaC2O4.H2O.
3.2 Chromatographic methods - Basic principles and applications of column and TLC- 2
Retention factor.
3.3 GC and HPLC-Principle, instrumentation (block diagram) - retention time and 2

applications.
3.4 Nanomaterials - Definition - Classification - Chemical methods of preparation - 3

Hydrolysis and Reduction - Applications of nanomaterials - Surface
characterisation -SEM – Principle and instrumentation (block diagram).
4 Stereochemistry and Polymer Chemistry 9
4.1 Isomerism-Structural, chain, position, functional, tautomerism and matamerism 2

- Definition with examples - Representation of 3D structures-Newman, Sawhorse,
Wedge and Fischer projection of substituted methane and ethane.
Stereoisomerism - Geometrical isomerism in double bonds and cycloalkanes (cis-
trans and E-Z notations).
4.2 R-S Notation – Rules and examples - Optical isomerism, Chirality, Enantiomers 1
and Diastereoisomers-Definition with examples.
4.3 Conformational analysis of ethane, butane, cyclohexane, mono and di methyl 2

substituted cyclohexane.
4.4 Copolymers - Definition - Types - Random, Alternating, Block and Graft 4

copolymers - ABS - preparation, properties and applications. Kevlar-preparation,
properties and applications. Conducting polymers - Doping -Polyaniline and
Polypyrrole - preparation properties and applications. OLED - Principle,
construction and advantages.
5 Water Chemistry and Sewage Water Treatment 9
5.1 Water characteristics - Hardness - Types of hardness- Temporary and Permanent 3

- Disadvantages of hard water -Units of hardness- ppm and mg/L -Degree of
hardness (Numericals) - Estimation of hardness-EDTA method (Numericals).
Water softening methods-Ion exchange process-Principle, procedure and
advantages. Reverse osmosis – principle, process and advantages.
5.2 Municipal water treatment (brief) - Disinfection methods - chlorination, ozone 2

andUV irradiation.
5.3 Dissolved oxygen (DO) -Estimation (only brief procedure-Winkler’s method), BOD 2
and COD-definition, estimation (only brief procedure) and significance
(Numericals).
5.4 Sewage water treatment - Primary, Secondary and Tertiary - Flow diagram - 2
Trickling filter and UASB process.
100 MECHANICS ESC 2 1 0 3 2019
Preamble: Goal of this course is to expose the students to the fundamental concepts of mechanics
and enhance their problem-solving skills. It introduces students to the influence of applied force
system and the geometrical properties of the rigid bodies while stationary or in motion. After this
course students will be able to recognize similar problems in real-world situations and respond
accordingly.
Prerequisite: Nil
Course Outcomes: After completion of the course the student will be able to:
CO 1 Recall principles and theorems related to rigid body mechanics
CO 2 Identify and describe the components of system of forces acting on the rigid body
Apply the conditions of equilibrium to various practical problems involving different force
CO 3 system.
CO 4 Choose appropriate theorems, principles or formulae to solve problems of mechanics.
CO 5 Solve problems involving rigid bodies, applying the properties of distributed areas and masses
Mapping of course outcomes with program outcomes (Minimum requirement)
CO 1 2 2 - - - - - - - - - -
CO 2 3 3 - - - - - - - - - -
CO 3 3 3 - - - - - - - - - -
CO 4 3 3 - - - - - - - - - -
CO 5 3 3 - - - - - - - - - -
Assessment Pattern

Bloom’s Category Test 1 (Marks) Test 2 (Marks) End Semester Examination (Marks)
Remember 10 10 15
Understand 10 10 15
Apply 30 30 70
Analyse
Evaluate
Create
Mark distribution

marks marks
150 50 100 3 hours

Part A
Course Outcome 1 (CO1): (One question from each module to meet the course objective 1: To
recall principles and theorems related to rigid body mechanics)
2. Distinguish static and dynamic friction
3. State and explain perpendicular axis theorem
Course Outcome 2 (CO2) (One question from each module to meet the course objective 2: To
identify and describe the components of system of forces acting on the rigid body)
Part B
All the questions under this section shall assess the learning levels corresponding to the course
outcomes listed below.
To apply the conditions of equilibrium to variou
variouss practical problems involving different force
CO 3
system.
CO 4 To choose appropriate theorems, principles or formulae to solve problems of mechanics.
To solve problems involving rigid bodies, applying the properties of distributed areas and
CO 5 masses
1. Two rollers each of weight 100 N are supported by an inclined plane and a vertical wall. Find the
reaction at the points of contact A, B, C. Assume all the surfaces to be smooth.
Course
allocated
identifier
To apply the conditions of equilibrium Applying – (Sketch the free
CO 3 to various practical problems involving body diagram that represent 4
different force system. equilibrium state of the body )
To choose appropriate theorems, Applying (Choose the equations

CO 4 principles or formulae to solve and formulae required for 4
problems of mechanics. calculation)
To solve problems involving rigid Applying ( Solve the problem

CO 5 bodies, applying the properties of based on the descriptions given 6
distributed areas and masses in CO3 and CO4)
Total 14
2. A cylindrical disc, 50 cm diameter and cm thickness, is in contact with a horizontal conveyor belts
running at uniform speeds of 5 m/s. Assuming there is no slip at points of contact determine (i)
angular velocity of disc (ii) Angular acceleration of disc if velocity of conveyor changes to 8 m/s. Also
compute the moment acting about the axis of the disc in both cases.
Course
allocated
identifier
To apply the conditions of equilibrium to Applying – (Sketch the
CO 3 various practical problems involving different free body diagram that 4
force system. represent state of the
body )
To choose appropriate theorems, principles or
formulae to solve problems of mechanics.

descriptions given in CO3
and masses
and CO4)
Total 14
3. Determine the centroid of the given section
Course Marks
outcome Description of course outcome Learning level assessed allocat
identifier ed
To apply the conditions of equilibrium to Applying – (Illustrate the
CO 3 various practical problems involving computation of centroid for 4
different force system. the given geometrical shape)
To choose appropriate theorems, Applying (Choose the
CO 4 principles or formulae to solve problems equations and formulae 4
of mechanics. required for calculation)
To solve problems involving rigid bodies, Applying ( Solve the problem 6

CO 5
applying the properties of distributed based on the descriptions
areas and masses given in CO3 and CO4)
Total 14
section x-x passing through the CG of the section and parallel to BC.
Course
allocated
identifier
To apply the conditions of equilibrium to Applying – (Illustrate the 4
CO 3 various practical problems involving different computation of moment

force system. of inertia for the given
geometrical shape)
To choose appropriate theorems, principles
or formulae to solve problems of mechanics.

descriptions given in
and masses
CO3 and CO4)
Total 14
QP CODE:
Reg No.:_______________
Name:__________________________ ___
MONTH & YEAR
ENGINEERING MECHANICS
Part A
(Answer all questions; each question carries 3 marks)
2. Distinguish static and dynamic frictioni.
3. State and explain perpendicular axis theorem.
7. Compare damped and undamped free vibrations.
8. State the equation of motion of a rotating rigid body, rotating about its fixed axis.
9. Illustrate the significance of instantaneous centre in the analysis of rigid body undergoing
rotational motion.
10. Highlight the principles of mechanics applied in the evaluation of elastic collusion of rigid bodies.
PART B
Module -I
11. Two identical rollers each of weight 100 N are supported by an inclined plane, making an angle
of 30o with the vertical, and a vertical wall. Find the reaction at the points of contact A, B, C. Assume
all the surfaces to be smooth. (14 marks)
C
A
B
12. A string tied to a wall is made to pass over a pulley placed 2m away from it. A weight P is
attached to the string such that the string stretches by 2m from the support on the wall to the
location of attachment of weight. Determine the force P required to maintain 200 kg body in
position for  = 30o, The diameter of pulley B is negligible. (14 marks)
Module – 2
13. Two blocks A & B are resting against a wall and the floor as shown in figure below. Find the
value of horizontal force P applied to the lower block that will hold the system in equilibrium.
Coefficient of friction are : 0.25 at the floor, 0.3 at the wall and 0.2 between the blocks.
(14 marks)
14. A beam is hinged at A and roller supported at B. It is acted upon by loads as shown below.
Find the reactions at A & B. (14 marks)
Module – 3
section x-x passing through the CG of the section and parallel to BC. (14 marks)
16. Support A has ball and socket connection. Roller support at B prevents motion in the —z
direction. Corner C is tied to D by a rope. The triangle is weightless. Determine the unknown force
components acting at A, B, and C. (14 marks)
Module - 4
17. A cricket ball is thrown by a fielder from a height of 2m at an angle of 300 to the horizontal with
an initial velocity of 20 m/s , hits the wickets at a height of 0.5 m from the ground. How far was the
fielder from the wicket? (14 marks)
18. An engine of weight 500 kN pull a train weighing 1500 kN up an incline of 1 in 100. The train
starts from rest and moves with constant acceleration against a resistance of 5 N/kN. It attains a
maximum speed of 36 kmph in 1 km distance. Determine the tension in the coupling between train
and engine and the traction force developed by the engine. (14marks)
Module – 5
19. A cylindrical disc, 50 cm diameter and 10 cm thickness having mass of 10 kg, is in contact with a
horizontal conveyor belt running at uniform speeds of 5 m/s. Assuming there is no slip at points of
contact determine (i) angular velocity of disc (ii) Angular acceleration of disc if velocity of conveyor
changes to 8 m/s in 10 seconds. Also compute the moment acting about the axis of the disc in both
cases. (14 marks)
20. A wheel rotating about fixed axis at 20 rpm is uniformly accelerated for 70 seconds during which
time it makes 50 revolutions. Find the (i) angular velocity at the end of this interval and (ii) time
required for the velocity to reach 100 revolutions per minute. (14 marks)
SYLLABUS
Module 1
Introduction to Engineering Mechanics-statics-basic principles of statics-Parallelogram law,
equilibrium law, principles of superposition and transmissibility, law of action and reaction(review)
free body diagrams.
Concurrent coplanar forces-composition and resolution of forces-resultant and equilibrium
equations – methods of projections – methods of moments – Varignon’s Theorem of moments.
Module 2
Friction – sliding friction - Coulomb’s laws of friction – analysis of single bodies –wedges, ladder-
analysis of connected bodies .
Parallel coplanar forces – couple - resultant of parallel forces – centre of parallel forces – equilibrium
of parallel forces – Simple beam subject to concentrated vertical loads. General coplanar force
system - resultant and equilibrium equations.
Module 3
Centroid of composite areas- – moment of inertia-parallel axis and perpendicular axis theorems.
Polar moment of inertia,radius of gyration,mass moment of inertia-ring,cylinder and disc.
Theorem of Pappus Guldinus(demonstration only)
Forces in space - vectorial representation of forces, moments and couples –resultant and equilibrium
equations – concurrent forces in space (simple problems only)
Module 4
Dynamics – rectilinear translation - equations of kinematics(review)
kinetics – equation of motion – D’Alembert’s principle. – motion on horizontal and inclined
surfaces, motion of connected bodies. Impulse momentum equation and work energy equation
(concepts only).
Curvilinear translation - equations of kinematics –projectile motion(review), kinetics – equation of
motion. Moment of momentum and work energy equation (concepts only).
Module 5
Rotation – kinematics of rotation- equation of motion for a rigid body rotating about a fixed axis –
rotation under a constant moment.
Plane motion of rigid body – instantaneous centre of rotation (concept only).
Simple harmonic motion – free vibration –degree of freedom- undamped free vibration of spring
mass system-effect of damping(concept only)
Text Books
1. Timoshenko and Young, Engineering Mechanics, McGraw Hill Publishers
2. Shames, I. H., Engineering Mechanics - Statics and Dynamics, Prentice Hall of India.
3. R. C. Hibbeler and Ashok Gupta, Engineering Mechanics, Vol. I statics, Vol II Dynamics, Pearson
Education.
References
1. Merriam J. L and Kraige L. G., Engineering Mechanics - Vols. 1 and 2, John Wiley.
2. Tayal A K, Engineering Mechanics – Statics and Dynamics, Umesh Publications
3. Bhavikkatti, S.S., Engineering Mechanics, New Age International Publishers
4. F.P.Beer abd E.R.Johnston (2011), Vector Mechanics for Engineers, Vol.I-Statics, Vol.II-Dynamics,
9th Ed, Tata McGraw Hill
5. Rajasekaran S and Sankarasubramanian G, Engineering Mechanics - Statics and Dynamics, Vikas
Publishing House Pvt Ltd.
Course
No. of
Module Topic outcomes
Hours
addressed
1 Module 1 Total: 7
Introduction to engineering mechanics – introduction on statics and

dynamics - Basic principles of statics – Parellogram law, equilibrium CO1 and
1.1 1
law – Superposition and transmissibility, law of action and reaction CO2
(review the topics)
Free body diagrams.

Degree of freedom-types of supports and nature of reactions -
1.2 CO1 and 1
exercises for free body diagram preparation – composition and
CO2
resolution of forces, resultant and equilibrium equations (review the
topics) - numerical exercises for illustration.
Concurrent coplanar forces - analysis of concurrent forces -methods CO1 and
1.3 of projections – illustrative numerical exercise – teacher assisted 1
CO2
problem solving.
Analysis of concurrent forces -methods of moment-Varignon’s CO1 and
1.4 Theorem of Moments - illustrative numerical exercise– teacher 1
CO2
assisted problem solving.
1.5 1
Session I. and CO5
Analysis of concurrent force systems – extended problem solving - CO3,CO4 1

1.6 and CO5
Session II – learning review quiz.

1.7 and CO5 1
Session III.
2 Module 2 Total: 7
2.1 Friction – sliding friction - Coulomb’s laws of friction – analysis of CO1 and 1
single bodies –illustrative examples on wedges and ladder-teacher CO2
assisted problem solving tutorials using problems from wedges and
ladder.
2.2 Problems on friction - analysis of connected bodies. illustrative CO3, CO4 1
numerical exercise– teacher assisted problem solving. and CO5
2.3 Problems on friction-extended problem solving CO3,C04 1

and CO5
2.4 Parallel coplanar forces – couple - resultant of parallel forces – centre CO1 and 1
of parallel forces – equilibrium of parallel forces – Simple beam CO2
subject to concentrated vertical loads.
2.5 General coplanar force system - resultant and equilibrium equations - CO1 and 1
illustrative examples- teacher assisted problem solving. CO2
2.6 General coplanar force system-resultant and equilibrium equations - CO3, CO4 1
illustrative examples and CO5
2.7 General coplanar force system - Extended problem solving - Quiz to CO3, CO4 1
evaluate learning level. and CO5
3 Module 3 Total: 7
3.1 Centroid of simple and regular geometrical shapes – centroid of CO1 and
figures in combination - composite areas- examples for illustration – CO2 1
problems for practice to be done by self.
3.2 Moment of inertia- parallel axis theorem –examples for illustration - CO1 and
1
problems for practice to be done by self. CO2
3.3 Moment of inertia - perpendicular axis theorem - example for CO1 and
illustration to be given as hand out and discussion on the solved CO2 1
example.
3.4 Solutions to practice problems – problems related to centroid and CO3, CO4 1
moment of inertia - problems for practice to be done by self. and CO5
3.5 Polar moment of inertia, Radius of gyration. CO1 and
1
Mass moment of inertia of ring, cylinder and uniform disc. CO2
Theorem of Pappus Guldinus - Demonstration
3.6 Introduction to forces in space – vectorial representation of forces, CO1,and
moments and couples – simple problems to illustrate vector CO2 1
representations of forces, moments and couples to be done in class.
3.7 Solution to practice problems - resultant and equilibrium equations
for concurrent forces in space – concurrent forces in space - 2 simple CO3,CO4 1
problems to illustrate the application of resultant and equilibrium and CO5
equations for concurrent forces in space.
4 Module 4 Total: 7
Introduction to dynamics – review of rectilinear translation - CO1 and
4.1 equations of kinematics – problems to review the concepts – CO2 1
additional problems involving extended application as exercises .
Solutions to exercises with necessary explanation given as hand out –

introduction to kinetics – equation of motion – D’Alembert’s principle CO1 and
4.2 1
– illustration of the concepts using one numerical exercise from CO2
motion on horizontal and inclined surfaces.
Motion of connected bodies - example for illustration to be given as CO3, CO4 1
4.3 hand out and discussion on the solved example – problems for and CO5
practice to be done by self.
4.4 Motion of connected bodies-extended problem solving. CO3, CO4 1
& CO5
Curvilinear translation - Review of kinematics –projectile motion – 1
simple problems to review the concepts – introduction to kinetics – CO3, CO4
4.5
equation of motion – illustration of the concepts using numerical & CO5
exercises.
4.6 Extended problem solving – rectilinear and curvilinear translation. CO3, CO4 1
& CO5
Concepts on Impulse momentum equation and work energy equation 1
(rectilinear translation – discussions to bring out difference between
4.7 CO1 and
elastic and inelastic collusions).
CO2
Concepts on Moment of momentum and work energy equation
(curvilinear translation).
5 Module 5 Total: 7
Rotation – kinematics of rotation- equation of motion for a rigid body CO1 and 1
5.1 rotating about a fixed axis – simple problems for illustration. CO2
Rotation under a constant moment – teacher assisted problem 1
5.2 solving. CO3,CO4
and CO5
5.3 Rotation under a constant moment - extended problem solving. CO3, CO4 1
and CO5
Plane motion of rigid body- instantaneous centre of rotation (concept CO1 and 1
5.4
only). CO2
Introduction to harmonic oscillation –free vibrations - simple 1

harmonic motion – differential equation and solution.
CO1 and
5.5 Degree of freedom – examples of single degree of freedom (SDOF) CO2
systems – Idealisation of mechanical systems as spring-mass systems
(concept only).
SDOF spring mass system –equation of motion – undamped free 1
vibration response - concept of natural frequency. CO1 and
5.6 Free vibration response due to initial conditions. CO2
Simple problems on determination of natural frequency and free
vibration response to test the understanding level.
Free vibration analysis of SDOF spring-mass systems – Problem solving CO1and 1
5.7
Effect of damping on free vibration response (concept only). CO2
110 GRAPHICS ESC 2 0 2 3 2019
Preamble: To enable the student to effectively perform technical communication through graphical
representation as per global standards.
Prerequisite: NIL
CO 1 Draw the projection of points and lines located in different quadrants

CO 2 Prepare multiview orthographic projections of objects by visualizing them in different
positions
CO 3 Draw sectional views and develop surfaces of a given object
CO 4 Prepare pictorial drawings using the principles of isometric and perspective projections to
visualize objects in three dimensions.
CO 5 Convert 3D views to orthographic views
CO 6 Obtain multiview projections and solid models of objects using CAD tools
PO PO PO PO PO PO PO PO PO PO PO PO
1 2 3 4 5 6 7 8 9 10 11 12
CO 1 3
CO 2 3
CO 3 3 1
CO 4 3 1
CO 5 3 2
CO 6 3 3 3
Assessment Pattern

( 15 Marks) (15 Marks) (100 Marks)
Remember
Understand 5 20
Apply 10 10 80
Analyse
Evaluate
Create
Mark distribution
150 50 100 3 hours

CIA for section A carries 25 marks (15 marks for 1 test and Class work 10 marks)
CIA for section B carries 15 marks (10 marks for 1 test and Class work 5 marks)

ESE will be of 3 hour duration on A4 size answer booklet and will be for 100 marks. The question
paper shall contain two questions from each module of Section A only. Student has to answer any
one question from each module. Each question carries 20 marks.

(Questions may be framed based on the outline given under each course outcome)

1. Locate points in different quadrants as per given conditions.
2. Problems on lines inclined to both planes .
3. Find True length, Inclinations and Traces of lines.
1. Draw orthographic views of solids and combination solids
2. Draw views of solids inclined to any one reference plane.
3. Draw views of solids inclined to both reference planes.
1. Draw views of solids sectioned by a cutting plane
2. Find location and inclination of cutting plane given true shape of the section
3. Draw development of lateral surface of solids and also its sectioned views
1. Draw Isometric views/projections of soilds
2. Draw Isometric views/projections of combination of soilds
3. Draw Perspective views of Soilds
1. Draw Orthographic views of solids from given three dimensional view
1. Draw the given figure including dimensions using 2D software
2. Create 3D model using modelling software from the given orthographic views or 3D figure or
from real 3D objects
QP CODE: PAGES:3
Reg No:______________
Name :______________
MONTH & YEAR
ENGINEERING GRAPHICS
PART A
Instructions: Retain necessary Construction lines

Show necessary dimensions
Answer any ONE question from each module
Each question carries 20 marks
MODULE I
1. The end point A of a line is 20mm above HP and 10mm in front of VP. The other end of the line is
50mm above HP and 15mm behind VP. The distance between the end projectors is 70mm. Draw
the projections of the line. Find the true length and true inclinations of the line with the principal
planes. Also locate the traces of the line.
2. One end of a line is 20mm from both the principal planes of projection. The other end of the line
is 50mm above HP and 40mm in front of VP. The true length of the line is 70mm. Draw the
projections of the line. Find its apparent inclinations, elevation length and plan length. Also
locate its traces.
MODULE II
3. A pentagonal pyramid of base side 25mm and height 40mm, is resting on the ground on one of
its triangular faces. The base edge of that face is inclined 30o to VP. Draw the projections of the
solid.
4. A hexagonal prism has side 25mm and height 50mm has a corner of its base on the ground and
the long edge containing that corner inclined at 30o to HP and 45o to VP. Draw the projections of
the solid.
MODULE III
5. A triangular prism of base side 40mm and height 70mm is resting with its base on the ground
and having an edge of the base perpendicular to VP. Section the solid such that the true shape of
the section is a trapezium of parallel sides 30mm and 10mm. Draw the projections showing the
true shape. Find the inclination of the cutting plane with the ground plane.
6. Draw the development of a pentagonal pyramid of base side 30mm and height 50mm. A string is
wound from a corner of the base round the pyramid and back to the same point through the
shortest distance. Show the position of the string in the elevation and plan.
MODULE IV
7. The frustum of a cone has base diameter 50mm and top diameter 40mm has a height of 60mm.
It is paced centrally on top of a rectangular slab of size 80x60mm and of thickness 20mm. Draw
the isometric view of the combination.
8. A hexagonal prism has base side 35mm and height 60mm. A sphere of diameter 40mm is
placed centrally on top of it. Draw the isometric projection of the combination.
MODULE V
9. Draw the perspective view of a pentagonal prism, 20mm side and 45mm long lying on one of its
rectangular faces on the ground and having its axis perpendicular to picture plane. One of its
pentagonal faces touches the picture plane and the station point is 50mm in front of PP, 25mm
above the ground plane and lies in a central plane, which is 70mm to the left of the center of the
prism.
10. Draw three orthographic views with dimensions of the object shown in figure below.
(20X5=100)
Time : 3 hours EST110 ENGINEERING GRAPHICS Max. Marks: 100
SCHEME OF VALUATION
1. Locating the points and drawing the projections of the line – 4 marks
Finding true length by any one method – 6 marks
Finding true inclination with VP – 2 marks
Finding true inclination with HP – 2 marks
Total = 20 marks
2. Locating the points and drawing true length of the line – 4 marks
Finding projections by any method – 6 marks
Finding length of elevation and plan – 2 marks
Finding apparent inclinations – 2 marks
Total = 20 marks
Total = 20 marks
(Any one method or combination of methods for solving can be used.

Total = 20 marks
(Any one method or combination of methods for solving can be used

Locating section plane as per given condition – 5 marks
Drawing true shape -5 marks
Finding inclination of cutting plane – 2 marks
Total = 20 marks
Development of the pyramid – 6 marks
Locating string in development -2 marks
Locating string in elevation – 3 marks
Locating string in plan – 3 marks
Total = 20 marks
Isometric View of Slab -6 marks
Isometric View of Frustum – 10 marks
Total = 20 marks
Reduce 4 marks if Isometric scale is taken)

Isometric scale – 4 marks
Isometric projection of prism -5 marks
Isometric projection of sphere – 5 marks
Total = 20 marks
9. Drawing the planes and locating the station point – 4 marks

Locating elevation points – 2 marks
Locating plan points – 2 marks
Drawing the perspective view – 10 marks
Total = 20 marks
10. Drawing the elevation – 8marks
Drawing the plan – 4 marks
Drawing the side view – 4 marks
Total = 20 marks
SYLLABUS
General Instructions:
 First angle projection to be followed
 Section A practice problems to be performed on A4 size sheets
 Section B classes to be conducted on CAD lab
SECTION A
Module 1
Introduction : Relevance of technical drawing in engineering field. Types of lines, Dimensioning, BIS
code of practice for technical drawing.
Orthographic projection of Points and Lines: Projection of points in different quadrants, Projection of
straight lines inclined to one plane and inclined to both planes. Trace of line. Inclination of lines with
reference planes True length of line inclined to both the reference planes.
Module 2
Orthographic projection of Solids: Projection of Simple solids such as Triangular, Rectangle, Square,
Pentagonal and Hexagonal Prisms, Pyramids, Cone and Cylinder. Projection of solids in simple
position including profile view. Projection of solids with axis inclined to one of the reference planes
and with axis inclined to both reference planes.
Module 3
Sections of Solids: Sections of Prisms, Pyramids, Cone, Cylinder with axis in vertical position and cut
by different section planes. True shape of the sections. Also locating the section plane when the
true shape of the section is given.
Development of Surfaces: Development of surfaces of the above solids and solids cut by different
section planes. Also finding the shortest distance between two points on the surface.
Module 4
Isometric Projection: Isometric View and Projections of Prisms, Pyramids, Cone , Cylinder, Frustum of
Pyramid, Frustum of Cone, Sphere, Hemisphere and their combinations.
Module 5
Perspective Projection: Perspective projection of Prisms and Pyramids with axis perpendicular to the
ground plane, axis perpendicular to picture plane.
Conversion of Pictorial Views: Conversion of pictorial views into orthographic views.
SECTION B
(To be conducted in CAD Lab)
Introduction to Computer Aided Drawing: Role of CAD in design and development of new products,
Advantages of CAD. Creating two dimensional drawing with dimensions using suitable software.
(Minimum 2 exercises mandatory)
Introduction to Solid Modelling: Creating 3D models of various components using suitable modelling
software. (Minimum 2 exercises mandatory)
Text Books
1. Bhatt, N.D., Engineering Drawing, Charotar Publishing House Pvt. Ltd.
2. John, K.C. Engineering Graphics, Prentice Hall India Publishers.
Reference Books
1. Anilkumar, K.N., Engineering Graphics, Adhyuth narayan Publishers
2. Agrawal, B. And Agrawal, C.M., Engineering Darwing, Tata McGraw Hill Publishers.
3. Benjamin, J., Engineering Graphics, Pentex Publishers- 3 rd Edition, 2017
4. Duff, J.M. and Ross, W.A., Engineering Design and Visualisation, Cengage Learning.
5. Kulkarni, D.M., Rastogi, A.P. and Sarkar, A.K., Engineering Graphics with AutoCAD, PHI.
6. Luzaddff, W.J. and Duff, J.M., Fundamentals of Engineering Drawing, PHI.
7. Varghese, P.I., Engineering Graphics, V I P Publishers
8. Venugopal, K., Engineering Drawing and Graphics, New Age International Publishers.
No SECTION A No. of
Hours
1 MODULE I
1.1 Introduction to graphics, types of lines, Dimensioning 1
1.2 Concept of principle planes of projection, different quadrants, locating points 2

on different quadrants
1.3 Projection of lines, inclined to one plane. Lines inclined to both planes, 2
trapezoid method of solving problems on lines.
1.4 Problems on lines using trapezoid method 2
1.5 Line rotation method of solving, problems on line rotation method 2
2 MODULE II
2.1 Introduction of different solids, Simple position plan and elevation of solids 2
2.2 Problems on views of solids inclined to one plane 2
2.3 Problems on views of solids inclined to both planes 2
2.4 Practice problems on solids inclined to both planes 2

3 MODULE III
3.1 Introduction to section planes. AIP and AVP. Principle of locating cutting 2
points and finding true shape
3.2 Problems on sections of different solids 2
3.3 Problems when the true shape is given 2
3.4 Principle of development of solids, sectioned solids 2
4 MODULE IV
4.1 Principle of Isometric View and Projection, Isometric Scale. Problems on 2

simple solids
4.2 Isometric problems on Frustum of solids, Sphere and Hemisphere 2
4.3 Problems on combination of different solids 2
5 MODULE V
5.1 Introduction to perspective projection, different planes, station point etc. 2

Perspective problems on pyramids
5.2 Perspective problems on prisms 2
5.3 Practice on conversion of pictorial views into orthographic views 2
SECTION B (To be conducted in CAD lab)
1 Introduction to CAD and software. Familiarising features of 2D software. 2

Practice on making 2D drawings
2 Practice session on 2D drafting 2
3 Introduction to solid modelling and software 2
4 Practice session on 3D modelling 2

EST BASICS OF CIVIL & MECHANICAL CATEGORY L T P CREDIT YEAR OF
120 ENGINEERING INTRODUCTION
ESC 4 0 0 4 2019
Preamble:
Objective of this course is to provide an insight and inculcate the essentials of Civil Engineering
discipline to the students of all branches of Engineering and to provide the students an
illustration of the significance of the Civil Engineering Profession in satisfying the societal needs.
To introduce the students to the basic principles of mechanical engineering
Prerequisite: NIL
Course Outcomes: After completion of the course, the student will be able to
Recall the role of civil engineer in society and to relate the various disciplines of Civil
CO 1 Engineering.
Explain different types of buildings, building components, building materials and

CO 2 building construction
CO 3 Describe the importance, objectives and principles of surveying.
Summarise the basic infrastructure services MEP, HVAC, elevators, escalators and
CO 4
ramps
Discuss the Materials, energy systems, water management and environment for green
CO 5 buildings.
CO 6 Analyse thermodynamic cycles and calculate its efficiency
CO 7 Illustrate the working and features of IC Engines
CO 8 Explain the basic principles of Refrigeration and Air Conditioning
CO 9 Describe the working of hydraulic machines
CO 10 Explain the working of power transmission elements
CO 11 Describe the basic manufacturing, metal joining and machining processes

10 11 12
CO1 3 - - - - 3 2 2 - - - -
CO2 3 2 - 1 3 - - 3 - - - -
CO3 3 2 - - 3 - - - 2 - - -
CO4 3 2 - - 3 - - - 2 - - -
CO5 3 2 - - 3 2 3 - 2 - - -
CO6 3 2
CO7 3 1
CO8 3 1
CO9 3 2
CO10 3 1
CO11 3
Assessment Pattern
Basic Civil Engineering Basic Mechanical Engineering

End End Semester
Bloom’s Category Semester Continuous Examination
Examination Assessment (marks)
Test 1 Test 2 (marks) Test 1 Test 2
marks marks marks marks
Remember 5 5 10 7.5 7.5 15
Understand 20 20 40 12.5 12.5 25
Apply 5 5 10
Analyse
Evaluate
Create
Mark distribution
150 50 100 3 hours
There will be two parts; Part I – Basic Civil Engineering and Part II – Basic Mechanical Engineering.
Part I and PART II carries 50 marks each. For the end semester examination, part I contain 2 parts -
Part A and Part B. Part A contain 5 questions carrying 4 marks each (not exceeding 2 questions from
each module). Part B contains 2 questions from each module out of which one to be answered. Each
question carries 10 mark and can have maximum 2 sub-divisions. The pattern for end semester
examination for part II is same as that of part I. However, student should answer both part I and
part 2 in separate answer booklets.
Course Outcome CO1: To recall the role of civil engineer in society and to relate the various
disciplines of Civil Engineering.
1.Explain relevance of Civil engineering in the overall infrastructural development of the country.
construction
Describe the importance, objectives and principles of surveying.
1. Explain the importance of surveying in Civil Engineering
Summarise the basic infrastructure services MEP, HVAC, elevators, escalators and ramps
1. Explain the civil engineering aspects of elevators, escalators and ramps in buildings
Discuss the Materials, energy systems, water management and environment for green buildings.
1. Discuss the relevance of Green building in society
Section II Answer any 1 full question from each module. Each full question carries 10 marks
Course Outcome 1 (CO1) (Two full question from each module and each question can have
maximum 2 sub-divisions)
To recall the role of civil engineer in society and to relate the various disciplines of Civil Engineering
CO Questions
1. a List out the types of building as per occupancy. Explain any two, each in about five sentences.
b. Discuss the components of a building with a neat figure.
2. a.What are the major disciplines of civil engineering and explain their role in the infrastructural
framework.
country.
Course Outcome 2 (CO2) & Course Outcome 3 (CO3) (Two full question from each module and
construction & Describe the importance, objectives and principles of surveying.
CO Questions
1. a. What are the different kinds of cement available and what is their use.
b. List the properties of good building bricks. Explain any five.
2. a. List and explain any five modern construction materials used for construction.
b. Explain the objectives and principles of surveying
Course outcome 4 (CO4) & Course outcome 5 (CO5) (Two full question from each module and
Summarise the basic infrastructure services MEP, HVAC, elevators, escalators and ramps & Discuss
the Materials, energy systems, water management and environment for green buildings.
CO Questions
1. a. Draw the elevation and plan of one brick thick wall with English bond
b. Explain the energy systems and water management in Green buildings
2. a. Draw neat sketch of the following foundations: (i) Isolated stepped footing;
(ii) Cantilever footing; and (iii) Continuous footing.
b. Discuss the civil engineering aspect of MEP and HVAC in a commercial building

1. In an air standard Otto cycle the compression ratio is 7 and compression begins at 35 oC, 0.1
MPa. The maximum temperature of the cycle is 1100oC. Find
iii) Cycle efficiency
Take Cp = 1.005 kJ/kgK and Cv=0.718 kJ/kgK
2. A Carnot cycle works with adiabatic compression ratio of 5 and isothermal expansion ratio of 2.
The volume of air at the beginning of isothermal expansion is 0.3 m3. If the maximum
temperature and pressure is limited to 550K and 21 bar, determine the minimum temperature
in the cycle and efficiency of the cycle.
3. In an ideal diesel cycle, the temperature at the beginning and end of compression is 65oC and
620oC respectively. The temperature at the beginning and end of the expansion is 1850oC and
850 oC. Determine the ideal efficiency of the cycle.
4. Explain the concepts of CRDI and MPFI in IC Engines.
1. With the help of a neat sketch explain the working of a 4 stroke SI engine
2. Compare the working of 2 stroke and 4 stroke IC engines
3. Explain the classification of IC Engines.
1. Explain the working of vapour compression refrigeration system.
2. With the help of suitable sketch explain the working of a split air conditioner.
3. Define: COP, specific humidity, relative humidity and dew point temperature.
1. Explain the working of a single stage centrifugal pump with sketches.
2. With the help of a neat sketch, explain the working of a reciprocating pump.
3. A turbine is to operate under a head of 25 m at 200 rpm. The discharge is 9 m3/s. If the overall
efficiency of the turbine is 90%. Determine the power developed by the turbine.
1. Explain the working of belt drive and gear drive with the help of neat sketches
2. Explain a single plate clutch.
3. Sketch different types of gear trains and explain.

1. Describe the operations which can be performed using drilling machine.
2. Explain the functions of runners and risers used in casting.
3. With a neat sketch, explain the working and parts of a lathe.
QP CODE: EST120 page:3
Reg No:__________________
Name:____________________________
MONTH & YEAR
Course Name: BASICS OF CIVIL AND MECHANICAL ENGINEERING

PART I: BASIC CIVIL ENGINEERING
PART A
1. Explain relevance of Civil engineering in the overall infrastructural development of the

country.
3. Explain different types of steel with their properties.
4. What are the different kinds of cement available and what is their use?
5. Define bearing capacity of soil.
(5 x 4 = 20)
Part B
MODULE I
6a. List out the types of building as per occupancy. Explain any two, each in about five
sentences. (5)
b. Discuss the components of a building with a neat figure. (5)
OR
7a. What are the major disciplines of civil engineering and explain their role in the
infrastructural framework. (5)
country. (5)
MODULE II
8a. What are the different kinds of cement available and what is their use. (5)
b. List the properties of good building bricks. Explain any five. (5)
OR
9a. List and explain any five modern construction materials used for construction. (5)
b. Explain the objectives and principles of surveying (5)
MODULE III
10a. Draw the elevation and plan of one brick thick wall with English bond (5)
b. Explain the energy systems and water management in Green buildings (5)
OR
11a. Draw neat sketch of the following foundations: (i) Isolated stepped footing;
(ii) Cantilever footing; and (iii) Continuous footing. (5)
b. Discuss the civil engineering aspect of MEP and HVAC in a commercial building (5)
[10 x 3 = 30]
PART II: BASIC MECHANICAL ENGINEERING
PART A
Answer all questions. Each question carries 4 marks
1. Sketch the P-v and T-s diagram of a Carnot cycle and List the processes.
2. Illustrate the working of an epicyclic gear train.
3. Explain cooling and dehumidification processes.
4. Differentiate between soldering and brazing.
5. Explain the principle of Additive manufacturing.
4 x 5 = 20 marks
Part B
MODULE I
6. In an air standard Otto cycle the compression ratio is 7 and compression begins at 35oC,
0.1MPa. The maximum temperature of the cycle is 1100oC. Find
iii)Cycle efficiency
Take Cp = 1.005 kJ/kgK and Cv=0.718 kJ/kgK 10 marks
OR
7. a) Explain the working of a 4 stroke SI engine with neat sketches. 7 marks

b) Explain the fuel system of a petrol engine. 3 marks
MODULE II
8. a) Explain the working of a vapour compression system with help of a block

diagram. 7 marks
b) Define: Specific humidity, relative humidity and dew point temperature. 3 marks
OR
9. With the help of a neat sketch, explain the working of a centrifugal pump. 10 marks
MODULE III
10. Explain the two high, three high, four high and cluster rolling mills with neat
sketches. 10 marks
OR
11. a) Describe the arc welding process with a neat sketch. 6 marks
b) Differentiate between up-milling and down-milling operations. 4 marks
SYLLABUS
Module 1
General Introduction to Civil Engineering: Relevance of Civil Engineering in the overall
infrastructural development of the country. Responsibility of an engineer in ensuring the safety of
built environment. Brief introduction to major disciplines of Civil Engineering like Transportation
Engineering, Structural Engineering, Geo-technical Engineering, Water Resources Engineering and
Environmental Engineering.
Introduction to buildings: Types of buildings, selection of site for buildings, components of a
residential building and their functions.
Building rules and regulations: Relevance of NBC, KBR & CRZ norms (brief discussion only).
Building area: Plinth area, built up area, floor area, carpet area and floor area ratio for a building as
per KBR.
Module 2
Surveying: Importance, objectives and principles.

Construction materials, Conventional construction materials: types, properties and uses of building
materials: bricks, stones, cement, sand and timber
Cement concrete: Constituent materials, properties and types.
Steel: Steel sections and steel reinforcements, types and uses.
Modern construction materials:- Architectural glass, ceramics, Plastics, composite materials,
thermal and acoustic insulating materials, decorative panels, waterproofing materials. Modern uses
of gypsum, pre-fabricated building components (brief discussion only).
Module 3
Building Construction: Foundations: Bearing capacity of soil (definition only), functions of
foundations, types – shallow and deep (brief discussion only). Load bearing and framed structures
(concept only).
Brick masonry: - Header and stretcher bond, English bond & Flemish bond random rubble masonry.
Roofs and floors: - Functions, types; flooring materials (brief discussion only).
Basic infrastructure services: MEP, HVAC, elevators, escalators and ramps (Civil Engineering aspects
only), fire safety for buildings.
Green buildings:- Materials, energy systems, water management and environment for green
buildings. (brief discussion only).
Module 4
Analysis of thermodynamic cycles: Carnot, Otto, Diesel cycles, Derivation of efficiency of these
cycles, Problems to calculate heat added, heat rejected, net work and efficiency. IC Engines: CI, SI, 2-
Stroke, 4-Stroke engines. Listing the parts of different types of IC Engines. Efficiencies of IC
Engines(Definitions only), Air, Fuel, cooling and lubricating systems in SI and CI Engines, CRDI, MPFI.
Concept of hybrid engines.
Module 5
Refrigeration: Unit of refrigeration, reversed Carnot cycle,COP, vapour compression cycle (only
description and no problems); Definitions of dry, wet & dew point temperatures, specific humidity
and relative humidity, Cooling and dehumidification, Layout of unit and central air conditioners.
Description about working with sketches of: Reciprocating pump, Centrifugal pump, Pelton turbine,
Francis turbine and Kaplan turbine. Overall efficiency, Problems on calculation of input and output
power of pumps and turbines (No velocity triangles)
Description about working with sketches of: Belt and Chain drives, Gear and Gear trains, Single plate
clutches.
Module 6
Manufacturing Process: Basic description of the manufacturing processes – Sand Casting, Forging,
Rolling, Extrusion and their applications.
Metal Joining Processes: List types of welding, Description with sketches of Arc Welding, Soldering
and Brazing and their applications
Basic Machining operations: Turning, Drilling, Milling and Grinding.
Description about working with block diagram of: Lathe, Drilling machine, Milling machine, CNC
Machine. Principle of CAD/CAM, Rapid and Additive manufacturing.
Text Books:
1. Rangwala, S. C., Essentials of Civil Engineering, Charotar Publishing House

2. Mckay, W.B. and Mckay, J. K., Building Construction, Volumes 1 to 4, Pearson India
Education Services
References Books:
1. Chen W.F and Liew J Y R (Eds), The Civil Engineering Handbook. II Edition CRC Press (Taylor
and Francis)
2. Chudley, R and Greeno R, Building construction handbook, Addison Wesley, Longman group,
England
3. Chudley, R, Construction Technology, Vol. I to IV, Longman group, England Course Plan
4. Kandya A A, Elements of Civil Engineering, Charotar Publishing house
5. Mamlouk, M. S., and Zaniewski, J. P., Materials for Civil and Construction Engineering, Pearson
Publishers
6. Rangwala S.C and Dalal K B Building Construction Charotar Publishing house
7. Clifford, M., Simmons, K. and Shipway, P., An Introduction to Mechanical Engineering Part I -
CRC Press
8. Roy and Choudhary, Elements of Mechanical Engineering, Media Promoters &Publishers Pvt.
Ltd., Mumbai.
9. Sawhney, G. S., Fundamentals of Mechanical Engineering, PHI
10. G Shanmugam, M S Palanichamy, Basic Civil and Mechanical Engineering, McGraw Hill
Education; First edition, 2018
11. Benjamin,J.,Basic Mechanical Engineering,Pentex Books,9th Edition,2018
12. Balachandran, P.Basic Mechanical Engineering,Owl Books
Course
No. of
No Topic outcomes
Lectures
addressed
1 Module I Total: 7
General Introduction to Civil Engineering: Relevance of Civil

Engineering in the overall infrastructural development of the
1.1 CO1 1
country. Responsibility of an engineer in ensuring the safety of
built environment.
Brief introduction to major disciplines of Civil Engineering like

Transportation Engineering, Structural Engineering, Geo-technical
1.2 CO1 2
Engineering, Water Resources Engineering and Environmental
Engineering.
Introduction to buildings: Types of buildings, selection of site for

1.3 CO2 2
buildings, components of a residential building and their functions.
Building rules and regulations: Relevance of NBC, KBR & CRZ norms
1.4 (brief discussion only) CO2 1
Building area: Plinth area, built up area, floor area, carpet area and
1.5 CO2 1
floor area ratio for a building as per KBR.
2 Module 2 Total: 7
2.1 Surveying: Importance, objectives and principles. CO3 1
2.2 Bricks: - Classification, properties of good bricks, and tests on CO2 1

bricks
Stones: - Qualities of good stones, types of stones and their uses.

2.3 Cement: - Good qualities of cement, types of cement and their CO2 1
uses.
Sand: - Classification, qualities of good sand and sieve analysis

2.4 (basics only). CO2 1
Timber: - Characteristics, properties and uses.
2.5 Cement concrete: - Constituent materials, properties and types, CO2 1

Steel: - Steel sections and steel reinforcements, types and uses.
Modern construction materials: - Architectural glass, ceramics,
plastics, composite materials, thermal and acoustic insulating
2.6 materials, decorative panels, waterproofing materials, modern CO2 2
uses of gypsum, pre-fabricated building components (brief
discussion only)
3 Module 3 Total: 7
Foundations: - Bearing capacity of soil (definition only), functions

of foundations, types – shallow and deep (brief discussion only).
3.1 Brick masonry: - Header and stretcher bond, English bond & CO2 2
Flemish bond– elevation and plan (one & one and a half brick wall
only).
Random rubble masonry.
3.2 Roofs: Functions, types; roofing materials (brief discussion only) CO2 2
Floors: Functions, types; flooring materials (brief discussion only)
3.3 Basic infrastructure services: MEP, HVAC, Elevators, escalators and CO4 2
ramps (Civil Engineering aspects only) fire safety for buildings
3.4 Green buildings:- Materials, energy systems, water management CO5 1

and environment for green buildings. (brief discussion only)
4 MODULE 4
Analysis of thermodynamic cycles: Carnot, Otto, and Diesel cycle- 4

4.1 Derivation of efficiency of these cycles, Problems to calculate heat
added, heat rejected, net work and efficiency
IC Engines: CI, SI, 2-Stroke, 4-Stroke engines. Listing the parts of 2

4.2 different types of IC Engines, efficiencies of IC Engines(Description
only)
Air, Fuel, cooling and lubricating systems in SI and CI Engines, CRDI, 2

4.3
MPFI. Concept of hybrid engines
5 MODULE 5
Refrigeration: Unit of refrigeration, reversed Carnot cycle, COP, vapour 1

5.1
compression cycle (only description and no problems)
Definitions of dry, wet & dew point temperatures, specific humidity and 1
5.2 relative humidity, Cooling and dehumidification, Layout of unit and
central air conditioners.
Description about working with sketches : Reciprocating pump, 4
Centrifugal pump, Pelton turbine, Francis turbine and Kaplan turbine.
5.3
Overall efficiency, Problems on calculation of input and output power
of pumps and turbines (No velocity triangles)
Description about working with sketches of: Belt and Chain drives, Gear 3
5.4
and Gear trains, Single plate clutches
6 MODULE 6
Manufacturing Process: Basic description of the manufacturing 2

6.1 processes – Sand Casting, Forging, Rolling, Extrusion and their
applications.
Metal Joining Processes :List types of welding, Description with 1

6.2
sketches of Arc Welding, Soldering and Brazing, and their applications
Basic Machining operations: Turning, Drilling, Milling and Grinding 3

6.3 Description about working with block diagrams of: Lathe, Drilling
machine, Milling machine, CNC Machine
6.4 Principle of CAD/CAM, Rapid and Additive manufacturing 1

EST BASICS OF ELECTRICAL AND CATEGORY L T P CREDIT YEAR OF
130 ELECTRONICS ENGINEERING INTRODUCTION
ESC 4 0 0 4 2019
Preamble:
This course aims to (1) equip the students with an understanding of the fundamental principles of
electrical engineering(2) provide an overview of evolution of electronics, and introduce the working
principle and examples of fundamental electronic devices and circuits (3) provide an overview of
evolution of communication systems, and introduce the basic concepts in radio communication.
Prerequisite: Physics and Mathematics (Pre-university level)

CO 1 Apply fundamental concepts and circuit laws to solve simple DC electric circuits
CO 2 Develop and solve models of magnetic circuits
CO 3 Apply the fundamental laws of electrical engineering to solve simple ac circuits in steady
state
CO 4 Describe working of a voltage amplifier
CO 5 Outline the principle of an electronic instrumentation system
CO 6 Explain the principle of radio and cellular communication
10 11 12
CO 1 3 1 - - - - - - - - - 2
CO 2 3 1 - - - - - - - - - 2
CO 3 3 1 - - - - - - - - - 2
CO 4 2 - - - - - - - - - - -
CO 5 2 - - - - - - - - - - 2
CO 6 2 - - - - - - - - - - 2
Assessment Pattern
Basic Electrical Engineering Basic Electronics Engineering

Bloom’s Category Continuous End Semester Continuous End Semester
Assessment Tests Examination Assessment Tests Examination
Test 1 Test 2 (Marks) Test 1 Test 2 (Marks)
(Marks) (Marks) (Marks) (Marks)
Remember 0 0 10 10 10 20
Understand 12.5 12.5 20 15 15 30
Apply 12.5 12.5 20
Analyse
Evaluate
Create
Mark distribution
Total Marks CIE marks ESE marks ESE Duration
150 50 100 3 hours

End Semester Examination Pattern: There will be two parts; Part I – Basic Electrical Engineering and
Part II – Basic Electronics Engineering. Part I and PART II carries 50 marks each. For the end semester
examination, part I contain 2 parts - Part A and Part B. Part A contain 5 questions carrying 4 marks
each (not exceeding 2 questions from each module). Part B contains 2 questions from each module
out of which one to be answered. Each question carries 10 mark and can have maximum 2 sub-
divisions. The pattern for end semester examination for part II is same as that of part I. However,
student should answer both part I and part 2 in separate answer booklets.
1. Solve problems based on current division rule.
2. Solve problems with Mesh/node analysis.
3. Solve problems on Wye-Delta Transformation.
1. Problems on series magnetic circuits
2. Problems on parallel magnetic circuits
3. Problems on composite magnetic ciruits
4. Course Outcome 3 (CO3):
1. problems on self inductance, mutual inductance and coefficient of coupling
2. problems on rms and average values of periodic waveforms
3. problems on series ac circuits
4. Compare star and Delta connected 3 phase AC systems.
Course Outcome 4 (CO4): Describe working of a voltage amplifier
1.What is the need of voltage divider biasing in an RC coupled amplifier?

2. Define operating point in the context of a BJT amplifier.
3. Why is it required to have a voltage amplifier in a public address system?
Course Outcome 5 (CO5): Outline the principle of an electronic instrumentation system
1. Draw the block diagram of an electronic instrumentation system.
2. What is a transducer?
3. Explain the working principle of operation of digital multimeter.
Course Outcome 6 (CO6): Explain the principle of radio and cellular communication
1. What is the working principle of an antenna when used in a radio transmitter?
2. What is the need of two separate sections RF section and IF section in a super heterodyne
receiver?
3. What is meant by a cell in a cellular communication?
QP CODE: Pages: 3
Reg No.:_______________
Name:_________________
MONTH & YEAR
Course Name: BASICS OF ELECTRICAL AND ELECTRONICS ENGINEERING
PART I
BASIC ELECTRICAL ENGINEERING
PART A
1. Calculate the current through the 4  resistor in the circuit shown, applying current
division rule:
2. Calculate the RMS and average values of a purely sinusoidal current having peak value
15A.
3. An alternating voltage of (80+j60)V is applied to an RX circuit and the current flowing

through the circuit is (-4+j10)A. Calculate the impedance of the circuit in rectangular and
polar forms. Also determine if X is inductive or capacitive.
4. Derive the relation between line and phase values of voltage in a three phase star
connected system.
5. Compare electric and magnetic circuits. (5x4=20)
PART B
Module 1
6. . Calculate the node voltages in the circuit shown, applying node analysis:
7. (a) State and explain Kirchhoff’s laws. (4 marks)
(b) Calculate the current through the galvanometer (G) in the circuit shown:
(6 marks)
Module 2
8. (a) State and explain Faraday’s laws of electromagnetic induction with examples. (4 marks)
(b) Differentiate between statically and dynamically induced emf. A conductor of length
0.5m moves in a uniform magnetic field of flux density 1.1T at a velocity of 30m/s.
Calculate the emf induced in the conductor if the direction of motion of the conductor is
inclined at 600 to the direction of field. (6 marks)
9. (a) Derive the amplitude factor and form factor of a purely sinusoidal waveform. (5 marks)
(b) A current wave is made up of two components-a 5A dc component and a 50Hz ac

component, which is a sinusoidal wave with a peak value of 5A. Sketch the resultant
waveform and determine its RMS and average values. (5 marks)
Module 3
10. Draw the power triangle and define active, reactive and apparent powers in ac circuits.
Two coils A and B are connected in series across a 240V, 50Hz supply. The resistance of
A is 5  and the inductance of B is 0.015H. If the input from the supply is 3kW and
2kVAR, find the inductance of A and the resistance of B. Also calculate the voltage across
each coil.
11. A balanced three phase load consists of three coils each having resistance of 4Ω and
inductance 0.02H. It is connected to a 415V, 50Hz, 3-phase ac supply. Determine the
phase voltage, phase current, power factor and active power when the loads are connected
in (i) star (ii) delta.
(3x10=30)
PART II
BASIC ELECTRONICS ENGINEERING
PART A
1. Give the specifications of a resistor. The colour bands marked on a resistor are Blue, Grey,
Yellow and Gold. What are the minimum and maximum resistance values expected from that
resistance?
2. What is meant by avalanche breakdown?
3. Explain the working of a full-wave bridge rectifier.
4. Discuss the role of coupling and bypass capacitors in a single stage RC coupled amplifier.
5. Differentiate AM and FM communication systems.
(5x4=20)
PART B
Module 4
6. a) Explain with diagram the principle of operation of an NPN transistor. (5)
b) Sketch and explain the typical input-output characteristics of a BJT when connected in
common emitter configuration. (5)
OR
7. a) Explain the formation of a potential barrier in a P-N junction diode. (5)
b) What do you understand by Avalanche breakdown? Draw and explain the V-I characteristics
of a P-N junction and Zener diode. (5)
Module 5
8. a) With a neat circuit diagram, explain the working of an RC coupled amplifier. (6)
b) Draw the frequency response characteristics of an RC coupled amplifier and state the reasons
for the reduction of gain at lower and higher frequencies. (4)
OR
9. a) With the help of block diagram, explain how an electronic instrumentation system. (6)
b) Explain the principle of an antenna. (4)
Module 6
10. a) With the help of a block diagram, explain the working of Super hetrodyne receiver. (6)
b) Explain the importance of antenna in a communication system. (4)
OR
11. a) With neat sketches explain a cellular communication system. (5)
b) Explain GSM communication with the help of a block diagram. (5)
(3x10=30)
SYLLABUS
MODULE 1: Elementary Concepts of Electric Circuits
Elementary concepts of DC electric circuits: Basic Terminology including voltage, current, power,
resistance, emf; Resistances in series and parallel; Current and Voltage Division Rules; Capacitors &
Inductors: V-I relations and energy stored. Ohms Law and Kirchhoff's laws-Problems; Star-delta
conversion (resistive networks only-derivation not required)-problems.
Analysis of DC electric circuits: Mesh current method - Matrix representation - Solution of network
equations. Node voltage methods-matrix representation-solution of network equations by matrix
methods. Numerical problems.
MODULE 2: Elementary Concepts of Magnetic circuits, Electromagnetic Induction and AC

fundamentals
Magnetic Circuits: Basic Terminology: MMF, field strength, flux density, reluctance - comparison
between electric and magnetic circuits- Series and parallel magnetic circuits with composite
materials, numerical problems.
Electromagnetic Induction: Faraday's laws, problems, Lenz's law- statically induced and dynamically
induced emfs - Self-inductance and mutual inductance, coefficient of coupling
Alternating Current fundamentals: Generation of alternating voltages-Representation of sinusoidal

waveforms: frequency, period, Average, RMS values and form factor of waveforms-Numerical
Problems.
MODULE 3: AC Circuits
AC Circuits: Phasor representation of sinusoidal quantities. Trignometric, Rectangular, Polar and

complex forms. Analysis of simple AC circuits: Purely resistive, inductive & capacitive circuits;
Inductive and capacitive reactance, concept of impedance. Average Power Power factor. Analysis of
RL, RC and RLC series circuits-active, reactive and apparent power. Simple numerical problems.
Three phase AC systems: Generation of three phase voltages; advantages of three phase systems,
star and delta connections (balanced only), relation between line and phase voltages, line and phase
currents- Numerical problems
MODULE 4
Introduction to Semiconductor devices: Evolution of electronics – Vacuum tubes to nano
electronics. Resistors, Capacitors and Inductors (constructional features not required): types,
specifications. Standard values, color coding. PN Junction diode: Principle of operation, V-I
characteristics, principle of avalanche breakdown. Bipolar Junction Transistors: PNP and NPN
structures, Principle of operation, relation between current gains in CE, CB and CC, input and
output characteristics of common emitter configuration.
MODULE 5
Basic electronic circuits and instrumentation: Rectifiers and power supplies: Block diagram
description of a dc power supply, Working of a full wave bridge rectifier, capacitor filter (no
analysis), working of simple zener voltage regulator. Amplifiers: Block diagram of Public Address
system, Circuit diagram and working of common emitter (RC coupled) amplifier with its frequency
response, Concept of voltage divider biasing. Electronic Instrumentation: Block diagram of an
electronic instrumentation system.
MODULE 6
Introduction to Communication Systems: Evolution of communication systems – Telegraphy to 5G.
Radio communication: principle of AM & FM, frequency bands used for various communication
systems, block diagram of super heterodyne receiver, Principle of antenna – radiation from
accelerated charge. Mobile communication: basic principles of cellular communications, principle
and block diagram of GSM.
Text Books
1. D P Kothari and I J Nagrath, “Basic Electrical Engineering”, Tata McGraw Hill, 2010.
2. D C Kulshreshtha, “Basic Electrical Engineering”, Tata McGraw Hill, 2010.
3. ChinmoySaha, Arindham Halder and Debarati Ganguly, Basic Electronics - Principles and
Applications, Cambridge University Press, 2018.
4. M.S.Sukhija and T.K.Nagsarkar, Basic Electrical and Electronics Engineering, Oxford University
Press, 2012.
5. Wayne Tomasi and Neil Storey, A Textbook On Basic Communication and Information
Engineering, Pearson, 2010.
Reference Books
1. Del Toro V, “Electrical Engineering Fundamentals”, Pearson Education.
2. T. K. Nagsarkar, M. S. Sukhija, “Basic Electrical Engineering”, Oxford Higher Education.
3. Hayt W H, Kemmerly J E, and Durbin S M, “Engineering Circuit Analysis”, Tata McGraw-Hill
4. Hughes, “Electrical and Electronic Technology”, Pearson Education.
5. V. N. Mittle and Arvind Mittal, “Basic Electrical Engineering,” Second Edition, McGraw Hill.
6. Parker and Smith, “Problems in Electrical Engineering”, CBS Publishers and Distributors.
7. S. B. Lal Seksena and Kaustuv Dasgupta, “Fundamentals of Electrical Engineering”, Cambridge
University Press.
8. Anant Agarwal, Jeffrey Lang, Foundations of Analog and Digital Electronic Circuits, Morgan
9. Bernard Grob, Ba sic Electronics, McGraw Hill.
10. A. Bruce Carlson, Paul B. Crilly, Communication Systems: An Introduction to Signals and
Noise in Electrical Communication, Tata McGraw Hill, 5 th Edition.
COURSE CONTENTS AND LECTURE SCHEDULE
1 Elementary Concepts of Electric Circuits
1.1 Elementary concepts of DC electric circuits:
Basic Terminology including voltage, current, power, resistance, emf; 1

Resistances in series and parallel; Current and Voltage Division Rules;
Capacitors & Inductors: V-I relations and energy stored.
Ohms Law and Kirchhoff's laws-Problems; 2
Star-delta conversion (resistive networks only-derivation not required)- 1

problems.
1.2 Analysis of DC electric circuits: Mesh current method - Matrix 1

representation - Solution of network equations.
Node voltage methods-matrix representation-solution of network

equations by matrix methods. 1
Numerical problems. 2
2 Elementary Concepts of Magnetic circuits, Electromagnetic Induction and AC

fundamentals
2.1 Magnetic Circuits: Basic Terminology: MMF, field strength, flux density,
reluctance - comparison between electric and magnetic circuits-
1
Series and parallel magnetic circuits with composite materials,
numerical problems. 2
2.2 Electromagnetic Induction: Faraday's laws, problems, Lenz's law- 1

statically induced and dynamically induced emfs -
Self-inductance and mutual inductance, coefficient of coupling 2
2.3 Alternating Current fundamentals: Generation of alternating voltages- 2

Representation of sinusoidal waveforms: frequency, period, Average,
RMS values and form factor of waveforms-Numerical Problems.
3 AC Circuits
3.1 AC Circuits: Phasor representation of sinusoidal quantities. 1
Trigonometric, Rectangular, Polar and complex forms.
Analysis of simple AC circuits: Purely resistive, inductive & capacitive

circuits; Inductive and capacitive reactance, concept of impedance. 2
Average Power, Power factor.
Analysis of RL, RC and RLC series circuits-active, reactive and apparent 1

power.
2
Simple numerical problems.
3.2 Three phase AC systems: Generation of three phase voltages;

advantages of three phase systems, star and delta connections
(balanced only), relation between line and phase voltages, line and 2
phase currents- Numerical problems.
4 Introduction to Semiconductor devices
4.1 Evolution of electronics – Vacuum tubes to nano electronics (In 1

evolutional perspective only)
4.2 Resistors, Capacitors and Inductors: types, specifications. Standard 2

values, color coding (No constructional features)
4.3 PN Junction diode: Principle of operation, V-I characteristics, principle 2

of avalanche breakdown
4.4 Bipolar Junction Transistors: PNP and NPN structures, Principle of 3

operation, relation between current gains in CE, CB and CC, input and
output characteristics of common emitter configuration
5 Basic electronic circuits and instrumentation
5.1 Rectifiers and power supplies: Block diagram description of a dc power 3

supply, Working of a full wave bridge rectifier, capacitor filter (no
analysis), working of simple zener voltage regulator
5.2 Amplifiers: Block diagram of Public Address system, Circuit diagram and 4
working of common emitter (RC coupled) amplifier with its frequency
response, Concept of voltage divider biasing
5.3 Electronic Instrumentation: Block diagram of an electronic 2

instrumentation system
6 Introduction to Communication Systems
6.1 Evolution of communication systems – Telegraphy to 5G 1

6.2 Radio communication: principle of AM & FM, frequency bands used for 4
various communication systems, block diagram of super heterodyne
receiver, Principle of antenna – radiation from accelerated charge
6.3 Mobile communication: basic principles of cellular communications, 2

principle and block diagram of GSM.
Suggested Simulation Assignments for Basic Electronics Engineering
1. Plot V-I characteristics of Si and Ge diodes on a simulator

2. Plot Input and Output characteristics of BJT on a simulator
3. Implementation of half wave and full wave rectifiers
4. Simulation of RC coupled amplifier with the design supplied
5. Generation of AM signal
Note: The simulations can be done on open tools such as QUCS, KiCad, GNURadio or similar software
to augment the understanding.
HUN PROFESSIONAL COMMUNICATION CATEGORY L T P CREDIT
102 MNC 2 0 2 --
Preamble: Clear, precise, and effective communication has become a sine qua non in today's
information-driven world given its interdependencies and seamless connectivity. Any aspiring
professional cannot but master the key elements of such communication. The objective of this
course is to equip students with the necessary skills to listen, read, write, and speak so as to
comprehend and successfully convey any idea, technical or otherwise, as well as give them the
necessary polish to become persuasive communicators.
Prerequisite: None
CO 1 Develop vocabulary and language skills relevant to engineering as a profession

CO 2 Analyze, interpret and effectively summarize a variety of textual content
CO 3 Create effective technical presentations
CO 4 Discuss a given technical/non-technical topic in a group setting and arrive at
generalizations/consensus
CO 5 Identify drawbacks in listening patterns and apply listening techniques for specific needs
CO 6 Create professional and technical documents that are clear and adhering to all the
necessary conventions
10 11 12
CO 1 3 2
CO 2 1 3
CO 3 1 1 3
CO 4 3 1
CO 5 1 2 3
CO 6 1 1 1 3
Mark distribution
100 50 50 2 hours
Continuous Internal Evaluation
Total Marks: 50
Regular assessment : 25 marks
Series test (one test only, should include verbal aptitude for placement and higher studies, this test
will be conducted for 50 marks and reduced to 15) : 15 marks
Regular assessment
Project report presentation and Technical presentation through PPT : 7.5 marks
Listening Test : 5 marks
Group discussion/mock job interview : 7.5 marks
Resume submission : 5 marks

Total Marks: 50, Time: 2 hrs.

1. List down the ways in which gestures affect verbal communication.
2. Match the words and meanings
Ambiguous promotion
Bona fide referring to whole
Holistic not clear
Exaltation genuine
3. Expand the following Compound Nouns - a. Water supply. b. Object recognition. c. Steam
turbine
1. Read the passage below and prepare notes:
Mathematics, rightly viewed, possesses not only truth, but supreme beauty—a beauty cold and
austere, like that of sculpture, without appeal to any part of our weaker nature, without the
gorgeous trappings of painting or music, yet sublimely pure, and capable of a stern perfection such
as only the greatest art can show. The true spirit of delight, the exaltation, the sense of being more
than man, which is the touchstone of the highest excellence, is to be found in mathematics as surely
as in poetry. What is best in mathematics deserves not merely to be learnt as a task, but to be
assimilated as a part of daily thought, and brought again and again before the mind with ever-
renewed encouragement. Real life is, to most men, a long second-best, a perpetual compromise
between the ideal and the possible; but the world of pure reason knows no compromise, no
practical limitations, no barrier to the creative activity embodying in splendid edifices the passionate
aspiration after the perfect from which all great work springs. Remote from human passions, remote
even from the pitiful facts of nature, the generations have gradually created an ordered cosmos,
where pure thought can dwell as in its natural home, and where one, at least, of our nobler impulses
can escape from the dreary exile of the actual world.
So little, however, have mathematicians aimed at beauty, that hardly anything in their work has had
this conscious purpose. Much, owing to irrepressible instincts, which were better than avowed
beliefs, has been moulded by an unconscious taste; but much also has been spoilt by false notions of
what was fitting. The characteristic excellence of mathematics is only to be found where the
reasoning is rigidly logical: the rules of logic are to mathematics what those of structure are to
architecture. In the most beautiful work, a chain of argument is presented in which every link is
important on its own account, in which there is an air of ease and lucidity throughout, and the
premises achieve more than would have been thought possible, by means which appear natural and
inevitable. Literature embodies what is general in particular circumstances whose universal
significance shines through their individual dress; but mathematics endeavours to present whatever
is most general in its purity, without any irrelevant trappings.
How should the teaching of mathematics be conducted so as to communicate to the learner as much
as possible of this high ideal? Here experience must, in a great measure, be our guide; but some
maxims may result from our consideration of the ultimate purpose to be achieved.
- From "On the teaching of mathematics" – Bertrand Russell
2. Enumerate the advantages and disadvantages of speed reading. Discuss how it can impact
comprehension.
1. What are the key elements of a successful presentation?

2. Elucidate the importance of non-verbal communication in making a presentation
3. List out the key components in a technical presentation.
1. Discuss: 'In today's world, being a good listener is more important than being a good
Speaker.'
2. Listen to a video/live group discussion on a particular topic, and prepare a brief summary of
the proceedings.
3. List the do's and don'ts in a group discussion.
1. Watch a movie clip and write the subtitles for the dialogue.
2. What do you mean by barriers to effective listening? List ways to overcome each of these.
3. What are the different types of interviews? How are listening skills particularly important in
Skype/telephonic interviews?
1. Explain the basic structure of a technical report.
2. You have been offered an internship in a much sought-after aerospace company and are
very excited about it. However, the dates clash with your series tests. Write a letter to the
Manager – University Relations of the company asking them if they can change the dates to
coincide with your vacation.
3. You work in a well-reputed aerospace company as Manager – University Relations. You are
in charge of offering internships. A student has sent you a letter requesting you to change
the dates allotted to him since he has series exams at that time. But there are no vacancies
available during the period he has requested for. Compose an e-mail informing him of this
and suggest that he try to arrange the matter with his college.
Syllabus
Module 1
Use of language in communication: Significance of technical communication Vocabulary

Development: technical vocabulary, vocabulary used in formal letters/emails and reports, sequence
words, misspelled words, compound words, finding suitable synonyms, paraphrasing, verbal
analogies. Language Development: subject-verb agreement, personal passive voice, numerical
adjectives, embedded sentences, clauses, conditionals, reported speech, active/passive voice.
Technology-based communication: Effective email messages, slide presentations, editing skills using
software. Modern day research and study skills: search engines, repositories, forums such as Git
Hub, Stack Exchange, OSS communities (MOOC, SWAYAM, NPTEL), and Quora; Plagiarism
Module 2
Reading, Comprehension, and Summarizing: Reading styles, speed, valuation, critical reading,
reading and comprehending shorter and longer technical articles from journals, newspapers,
identifying the various transitions in a text, SQ3R method, PQRST method, speed reading.
Comprehension: techniques, understanding textbooks, marking and underlining, Note-taking:
recognizing non-verbal cues.
Module 3
Oral Presentation: Voice modulation, tone, describing a process, Presentation Skills: Oral
presentation and public speaking skills, business presentations, Preparation: organizing the material,
self-Introduction, introducing the topic, answering questions, individual presentation practice,
presenting visuals effectively.
Debate and Group Discussions: introduction to Group Discussion (GD), differences between GD and
debate; participating GD, understanding GD, brainstorming the topic, questioning and clarifying, GD
strategies, activities to improve GD skills
Module 4
Listening and Interview Skills Listening: Active and Passive listening, listening: for general content, to
fill up information, intensive listening, for specific information, to answer, and to understand.
Developing effective listening skills, barriers to effective listening, listening to longer technical talks,
listening to classroom lectures, talks on engineering /technology, listening to documentaries and
making notes, TED talks.
Interview Skills: types of interviews, successful interviews, interview etiquette, dress code, body
language, telephone/online (skype) interviews, one-to-one interview & panel interview, FAQs
related to job interviews
Module 5
Formal writing: Technical Writing: differences between technical and literary style. Letter Writing
(formal, informal and semi formal), Job applications, Minute preparation, CV preparation
(differences between Bio-Data, CV and Resume), and Reports. Elements of style, Common Errors in
Writing: describing a process, use of sequence words, Statements of Purpose, Instructions,
Checklists.
Analytical and issue-based Essays and Report Writing: basics of report writing; Referencing Style
(IEEE Format), structure of a report; types of reports, references, bibliography.
Lab Activities
Written: Letter writing, CV writing, Attending a meeting and Minute Preparation, Vocabulary
Building
Spoken: Phonetics, MMFS (Multimedia Feedback System), Mirroring, Elevator Pitch, telephone
etiquette, qualities of a good presentation with emphasis on body language and use of visual aids.
Listening: Exercises based on audio materials like radio and podcasts. Listening to Song. practice and
exercises.
Reading: Speed Reading, Reading with the help of Audio Visual Aids, Reading Comprehension Skills
Mock interview and Debate/Group Discussion: concepts, types, Do’s and don’ts- intensive practice
Reference Books
1. English for Engineers and Technologists (Combined edition, Vol. 1 and 2), Orient Blackswan 2010.
2. Meenakshi Raman and Sangeetha Sharma,”Technical Communication: Principles and Practice”, 2nd
Edition, Oxford University Press, 2011
th
3. Stephen E. Lucas, "The Art of Public Speaking", 10 Edition; McGraw Hill Education, 2012.
nd
4. Ashraf Rizvi, "Effective Technical Communication", 2 Edition, McGraw Hill Education, 2017.
th
5. William Strunk Jr. & E.B. White, "The Elements of Style", 4 Edition, Pearson, 1999.
6. David F. Beer and David McMurrey, Guide to writing as an Engineer, John Willey. New York, 2004.
7. Goodheart-Willcox, "Professional Communication", First Edition , 2017.
8. Training in Interpersonal Skills: Tips for Managing People at Work, Pearson Education, India, 6 edition,
2015.
9. The Ace of Soft Skills: Attitude, Communication and Etiquette for Success, Pearson Education; 1
edition, 2013.
10. Anand Ganguly, “Success in Interview”, RPH, 5th Edition, 2016.
11. Raman Sharma, “Technical Communications”, Oxford Publication, London, 2004.
YEAR OF
CATEGORY L T P CREDIT
EST PROGRAMING IN C INTRODUCTION
102
ESC 2 1 2 4 2019
Preamble: The syllabus is prepared with the view of preparing the Engineering Graduates capable of writing
readable C programs to solve computational problems that they may have to solve in their professional life.
The course content is decided to cover the essential programming fundamentals which can be taught
within the given slots in the curriculum. This course has got 2 Hours per week for practicing programming in
C. A list showing 24 mandatory programming problems are given at the end. The instructor is supposed to
give homework/assignments to write the listed programs in the rough record as and when the required
theory part is covered in the class. The students are expected to come prepared with the required program
written in the rough record for the lab classes.
Prerequisite: NIL
CO 1 Analyze a computational problem and develop an algorithm/flowchart to find its solution
Develop readable* C programs with branching and looping statements, which uses
CO 2
Arithmetic, Logical, Relational or Bitwise operators.
Write readable C programs with arrays, structure or union for storing the data to be
CO 3
processed
Divide a given computational problem into a number of modules and develop a readable
CO 4 multi-function C program by using recursion if required, to find the solution to the
computational problem
CO 5 Write readable C programs which use pointers for array processing and parameter passing
CO 6 Develop readable C programs with files for reading input and storing output
readable* - readability of a program means the following:

1. Logic used is easy to follow
2. Standards to be followed for indentation and formatting
3. Meaningful names are given to variables
4. Concise comments are provided wherever needed
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1
CO2
CO3
CO4
CO5
CO6
Assessment Pattern

End Semester
Bloom’s Category Test 1 Test 2 Examination Marks
(Marks) (Marks)
Remember 15 10 25
Understand 10 15 25
Apply 20 20 40
Analyse 5 5 10
Evaluate
Create
Mark distribution
Marks Marks
150 50 100 3 hours

Continuous Assessment Test 1 (for theory, for 2 hrs) : 20 marks
Continuous Assessment Test 2 (for lab, internal examination, for 2 hrs) : 20 marks
Internal Examination Pattern: There will be two parts; Part A and Part B. Part A contains 5 questions
with 2 questions from each module (2.5 modules x 2 = 5), having 3 marks for each question. Students
should answer all questions. Part B also contains 5 questions with 2 questions from each module (2.5
modules x 2 = 5), of which a student should answer any one. The questions should not have sub-
divisions and each one carries 7 marks.
End Semester Examination Pattern: There will be two parts; Part A and Part B. Part A contains 10
answer all questions. Part B contains 2 questions from each module of which a student should answer
Sample Course Level Assessment Questions
Course Outcome 1 (CO1): Write an algorithm to check whether largest of 3 natural numbers is prime or
not. Also, draw a flowchart for solving the same problem.
Course Outcome 2 (CO2): Write an easy to read C program to process a set of n natural numbers and to
find the largest even number and smallest odd number from the given set of numbers. The program
should not use division and modulus operators.
Course Outcome 3(CO3):Write an easy to read C program to process the marks obtained by n students
of a class and prepare their rank list based on the sum of the marks obtained. There are 3 subjects for
which examinations are conducted and the third subject is an elective where a student is allowed to
take any one of the two courses offered.
Course Outcome 4 (CO4): Write an easy to read C program to find the value of a mathematical function
f which is defined as follows. f(n) = n! / (sum of factors of n), if n is not prime and f(n) = n! / (sum of
digits of n), if n is prime.
Course Outcome 5 (CO5): Write an easy to read C program to sort a set of n integers and to find the
number of unique numbers and the number of repeated numbers in the given set of numbers. Use a
function which takes an integer array of n elements, sorts the array using the Bubble Sorting Technique
and returns the number of unique numbers and the number of repeated numbers in the given array.
Course Outcome 6 (CO6): Write an easy to read C program to process a text file and to print the
Palindrome words into an output file.
QP CODE: PAGES:3
Reg No:______________
Name :______________
MONTH & YEAR
Course Name: Programming in C (Common to all programs)
PART A
1. Write short note on processor and memory in a computer.

2. What are the differences between compiled and interpreted languages? Give example for
each.
3. Write a C program to read a Natural Number through keyboard and to display the reverse
of the given number. For example, if “3214567” is given as input, the output to be shown is
“7654123”.
4. Is it advisable to use goto statements in a C program? Justify your answer.
5. Explain the different ways in which you can declare & initialize a single dimensional array.
6. Write a C program to read a sentence through keyboard and to display the count of white
spaces in the given sentence.
7. What are the advantages of using functions in a program?
8. With a simple example program, explain scope and life time of variables in C.
9. Write a function in C which takes the address of a single dimensional array (containing a
finite sequence of numbers) and the number of numbers stored in the array as arguments
and stores the numbers in the same array in reverse order. Use pointers to access the
elements of the array.
10. With an example, explain the different modes of opening a file. (10x3=30)
Part B
Answer any one Question from each module. Each question carries 14 Marks
11. (a) Draw a flow chart to find the position of an element in a given sequence, using linear
searching technique. With an example explain how the flowchart finds the position of a
given element. (10)
(b) Write a pseudo code representing the flowchart for linear searching. (4)
OR
12. (a) With the help of a flow chart, explain the bubble sort operation. Illustrate with an
example. (10)
(b) Write an algorithm representing the flowchart for bubble sort. (4)
13. (a) Write a C program to read an English Alphabet through keyboard and display whether
the given Alphabet is in upper case or lower case. (6)
(b) Explain how one can use the builtin function in C, scanfto read values of different data
types. Also explain using examples how one can use the builtin function in C, printffor text
formatting. (8)
OR
14. (a) With suitable examples, explain various operators in C. (10)

(b) Explain how characters are stored and processed in C. (4)
15. (a) Write a function in C which takes a 2-Dimensional array storing a matrix of numbers and
the order of the matrix (number of rows and columns) as arguments and displays the sum
of the elements stored in each row. (6 )
(b) Write a C program to check whether a given matrix is a diagonal matrix. (8)
OR
16. (a) Without using any builtin string processing function like strlen, strcat etc., write a
program to concatenate two strings. (8)
(b) Write a C program to perform bubble sort. (6)
17. (a) Write a function namely myFact in C to find the factorial of a given number. Also, write
another function in C namelynCr which accepts two positive integer parameters n and r and
returns the value of the mathematical functionC(n,r)( n! / ( r! x (n - r)!) ). The function nCr is
expected to make use of the factorial function myFact. (10)
(b) What is recursion? Give an example. (4)
OR
18. (a) With a suitable example, explain the differences between a structure and a union in C.
(6)
(b) Declare a structure namely Student to store the details (roll number, name, mark_for_C)
of a student. Then, write a program in C to find the average mark obtained by the students
in a class for the subject Programming in C (using the field mark_for_C). Use array of
structures to store the required data (8)
19. (a) With a suitable example, explain the concept of pass by reference. (6)
(b) With a suitable example, explain how pointers can help in changing the content of a
single dimensionally array passed as an argument to a function in C.
(8)
OR
20. (a) Differentiate between sequential files and random access files? (4)
(b) Using the prototypes explain the functionality provided by the following functions. (10)
rewind()
i. fseek()
ii. ftell()
iii. fread()
iv. fwrite() (14X5=70)
SYLLABUS
Programming in C (Common to all disciplines)
Module 1
Basics of Computer Hardware and Software
Basics of Computer Architecture: processor, Memory, Input& Output devices
Application Software & System software: Compilers, interpreters, High level and low level languages
Introduction to structured approach to programming, Flow chart Algorithms, Pseudo code (bubble
sort, linear search - algorithms and pseudocode)
Module 2
Program Basics
Basic structure of C program: Character set, Tokens, Identifiers in C, Variables and Data Types ,
Constants, Console IO Operations, printf and scanf
Operators and Expressions: Expressions and Arithmetic Operators, Relational and Logical Operators,
Conditional operator, size of operator, Assignment operators and Bitwise Operators. Operators
Precedence
Control Flow Statements: If Statement, Switch Statement, Unconditional Branching using goto
statement, While Loop, Do While Loop, For Loop, Break and Continue statements.(Simple programs
covering control flow)
Module 3
Arrays and strings
Arrays Declaration and Initialization, 1-Dimensional Array, 2-Dimensional Array
String processing: In built String handling functions (strlen, strcpy, strcat and strcmp, puts, gets)
Linear search program, bubble sort program, simple programs covering arrays and strings
Module 4
Working with functions
Introduction to modular programming, writing functions, formal parameters, actual parameters
Pass by Value, Recursion, Arrays as Function Parameters structure, union, Storage Classes, Scope
and life time of variables, simple programs using functions
Module 5
Pointers and Files
Basics of Pointer: declaring pointers, accessing data though pointers, NULL pointer,array access
using pointers, pass by reference effect
File Operations: open, close, read, write, append
Sequential access and random access to files: In built file handlingfunctions (rewind() ,fseek(), ftell(),
feof(), fread(), fwrite()), simple programs covering pointers and files.
Text Books
1. Schaum Series, Gottfried B.S.,Tata McGraw Hill,Programming with C
2. E. Balagurusamy, Mcgraw Hill,Programming in ANSI C
3. Asok N Kamthane, Pearson,Programming in C
4. Anita Goel, Pearson, Computer Fundamentals
Reference Books
1. Anita Goel and Ajay Mittal, Pearson, Computer fundamentals and Programming in C
2. Brian W. Kernighan and Dennis M. Ritchie, Pearson, C Programming Language
3. Rajaraman V, PHI, Computer Basics and Programming in C
4. Yashavant P, Kanetkar, BPB Publications, Let us C

Module 1: Basics of Computer Hardware and Software (7 hours)
1.1 Basics of Computer Architecture: Processor, Memory, Input& Output devices 2 hours
Application Software & System software: Compilers, interpreters, High level

1.2 2 hours
and low level languages
1.3 Introduction to structured approach to programming, Flow chart 1 hours
Algorithms, Pseudo code (bubble sort, linear search - algorithms and

1.4 2 hours
pseudocode)
Module 2: Program Basics (8 hours)
Basic structure of C program: Character set, Tokens, Identifiers in C, Variables

2.1 2 hours
and Data Types , Constants, Console IO Operations, printf and scanf
Operators and Expressions: Expressions and Arithmetic Operators, Relational

2.2 and Logical Operators, Conditional operator, sizeof operator, Assignment 2 hours
operators and Bitwise Operators. Operators Precedence
Control Flow Statements: If Statement, Switch Statement, Unconditional
2.3 Branching using goto statement, While Loop, Do While Loop, For Loop, Break 4 hours
and Continue statements.(Simple programs covering control flow)
Module 3: Arrays and strings: (6 hours)
Arrays Declaration and Initialization, 1-Dimensional Array, 2-Dimensional Array 2 hours

3.1
String processing: In built String handling functions(strlen, strcpy, strcat and

3.2 2 hours
strcmp, puts, gets)
Linear search program, bubble sort program, simple programs covering arrays
3.3 3 hours
and strings
Module 4: Working with functions (7 hours)
4.1 Introduction to modular programming, writing functions, formal parameters, 2 hours

actual parameters
4.2 Pass by Value, Recursion, Arrays as Function Parameters 2 hours
4.3 structure, union, Storage Classes,Scope and life time of variables, simple 3 hours
programs using functions
Module 5: Pointers and Files (7 hours)
5.1 Basics of Pointer: declaring pointers, accessing data though pointers, NULL 3 hours
pointer,array access using pointers, pass by reference effect
5.2 File Operations: open, close, read, write, append 1 hours
Sequential access and random access to files: In built file handlingfunctions

5.3 (rewind() ,fseek(), ftell(), feof(), fread(), fwrite()), simple programs covering 2 hours
pointers and files.
C PROGRAMMING LAB (Practical part of EST 102, Programming in C)

Assessment Method: The Academic Assessment for the Programming lab should be done internally
by the College. The assessment shall be made on 50 marks and the mark is divided as follows:
Practical Records/Outputs - 20 marks (internal by the College), Regular Lab Viva - 5 marks (internal
by the College), Final Practical Exam – 25 marks (internal by the College).
The mark obtained out of 50 will be converted into equivalent proportion out of 20 for CIE
computation.
LIST OF LAB EXPERIMENTS
1. Familiarization of Hardware Components of a Computer
2. Familiarization of Linux environment – How to do Programming in C with Linux
3. Familiarization of console I/O and operators in C
i) Display “Hello World”
ii) Read two numbers, add them and display theirsum
iii) Read the radius of a circle, calculate its area and display it
iv)Evaluate the arithmetic expression ((a -b / c * d + e) * (f +g)) and display its solution.Read
the values of the variables from the user through console.
4. Read 3 integer values and find the largest amoung them.

5. Read a Natural Number and check whether the number is prime or not
6. Read a Natural Number and check whether the number is Armstrong or not
7. Read n integers, store them in an array and find their sum and average
8. Read n integers, store them in an array and search for an element in the
array using an algorithm for Linear Search
9. Read n integers, store them in an array and sort the elements in the array using Bubble Sort
algorithm
10. Read a string (word), store it in an array and check whether it is a palindrome word or not.
11.Read two strings (each one ending with a $ symbol), store them in
arrays and concatenate them without using library functions.
12. Read a string (ending with a $ symbol), store it in an array and count the number of vowels,
consonants and spaces in it.
13. Read two input each representing the distances between two points in the Euclidean space,
store these in structure variables and add the two distance values.
14. Using structure, read and print data of n employees (Name, Employee Id and Salary)
15. Declare a union containing 5 string variables (Name, House Name, City Name, State and Pin
code) each with a length of C_SIZE (user defined constant). Then, read and display the address of a
person using a variable of the union.
16. Find the factorial of a given Natural Number n usingrecursive and non recursive functions
17. Read a string (word), store it in an array and obtain its reverse by using a user defined function.
18. Write a menu driven program for performing matrix addition, multiplication and finding the
transpose. Use functions to (i) read a matrix, (ii) find the sum of two matrices, (iii) find the product
of two matrices, (i) find the transpose of a matrix and (v) display a matrix.
19. Do the following using pointers
i) add two numbers
ii) swap two numbers using a user defined function
20. Input and Print the elements of an array using pointers
21. Compute sum of the elements stored in an array using pointers and user defined function.
22. Create a file and perform the following
iii) Write data to the file
iv) Read the data in a given file & display the file content on console
v) append new data and display on console
23. Open a text input file and count number of characters, words and lines in it; and store the results
in an output file.
PHL ENGINEERING CATEGORY L T P CREDIT YEAR OF
120 PHYSICS LAB INTRODUCTION
BSC 0 0 2 1 2019
Preamble: The aim of this course is to make the students gain practical knowledge to co-relate with
the theoretical studies and to develop practical applications of engineering materials
and use the principle in the right way to implement the modern technology.
Prerequisite: Higher secondary level Physics
CO 1 Develop analytical/experimental skills and impart prerequisite hands on experience for

engineering laboratories
CO 2 Understand the need for precise measurement practices for data recording
CO 3 Understand the principle, concept, working and applications of relevant technologies and
comparison of results with theoretical calculations
CO 4 Analyze the techniques and skills associated with modern scientific tools such as lasers and
fiber optics
CO 5 Develop basic communication skills through working in groups in performing the laboratory
experiments and by interpreting the results
CO 1 3 3 1 2 1
CO 2 3 3 1 2 1
CO 3 3 3 1 2 1
CO 4 3 3 1 2 1
CO 5 3 3 1 2 1
Mark distribution

Duration(Internal)
Marks Marks
100 100 - 1 hour

SYLLABUS
LIST OF EXPERIMENTS
(Minimum 8 experiments should be completed)
1. CRO-Measurement of frequency and amplitude of wave forms

2. Measurement of strain using strain gauge and wheatstone bridge
3. LCR Circuit – Forced and damped harmonic oscillations
4. Melde’s string apparatus- Measurement of frequency in the transverse and longitudinal mode
5. Wave length measurement of a monochromatic source of light using Newton’s Rings method.
6. Determination of diameter of a thin wire or thickness of a thin strip of paper using air wedge
method.
7. To measure the wavelength using a millimeter scale as a grating.
8. Measurement of wavelength of a source of light using grating.
9. Determination of dispersive power and resolving power of a plane transmission grating
10.Determination of the particle size of lycopodium powder
11.Determination of the wavelength of He-Ne laser or any standard laser using diffraction grating
12.Calculate the numerical aperture and study the losses that occur in optical fiber cable.
13.I-V characteristics of solar cell.
14.LED Characteristics.
15.Ultrasonic Diffractometer- Wavelength and velocity measurement of ultrasonic waves in a liquid
16.Deflection magnetometer-Moment of a magnet- Tan A position.
Reference books
1. S.L.Gupta and Dr.V.Kumar, “Practical physics with viva voice”, Pragati PrakashanPublishers, Revised
Edition, 2009
2. M.N.Avadhanulu, A.A.Dani and Pokely P.M, “Experiments in Engineering Physics”, S.Chand&Co,2008
3. S. K. Gupta, “Engineering physics practicals”, Krishna Prakashan Pvt. Ltd., 2014
4. P. R. Sasikumar “Practical Physics”, PHI Ltd., 2011.

CYL ENGINEERING CHEMISTRY LAB CATEGORY L T P CREDIT
120 BSC 0 0 2 1
Preamble: To impart scientific approach and to familiarize with the experiments in chemistry relevant
for research projects in higher semesters
Prerequisite: Experiments in chemistry introduced at the plus two levels in schools
CO 1 Understand and practice different techniques of quantitative chemical analysis to

generate experimental skills and apply these skills to various analyses
CO 2 Develop skills relevant to synthesize organic polymers and acquire the practical skill to
use TLC for the identification of drugs
CO 3 Develop the ability to understand and explain the use of modern spectroscopic
techniques for analysing and interpreting the IR spectra and NMR spectra of some
organic compounds
CO 4 Acquire the ability to understand, explain and use instrumental techniques for chemical
analysis
CO 5 Learn to design and carry out scientific experiments as well as accurately record and
analyze the results of such experiments
CO 6 Function as a member of a team, communicate effectively and engage in further

learning. Also understand how chemistry addresses social, economical and
environmental problems and why it is an integral part of curriculum
10 11 12
CO 1 3 2 3
CO 2 3 3 3
CO 3 3 3 3
CO 4 3 3 3
CO 5 3 1 3
CO 6 3 1 3
Mark distribution

marks marks Duration(Internal)
100 100 - 1 hour

SYLLABUS
LIST OF EXPERIMENTS (MINIMUM 8 MANDATORY)
1. Estimation of total hardness of water-EDTA method

2. Potentiometric titration
3. Determination of cell constant and conductance of solutions.
4. Calibration of pH meter and determination of pH of a solution
5. Estimation of chloride in water
6. Identification of drugs using TLC
7. Determination of wavelength of absorption maximum and colorimetric estimation of Fe3+ in
solution
8. Determination of molar absorptivity of a compound (KMnO4 or any water soluble food
colorant)
9. Synthesis of polymers (a) Urea-formaldehyde resin (b) Phenol-formaldehyde resin
10. Estimation of iron in iron ore
11. Estimation of copper in brass
12. Estimation of dissolved oxygen by Winkler’s method
13. (a) Analysis of IR spectra (minimum 3 spectra) (b) Analysis of 1H NMR spectra (
minimum 3 spectra)
14. Flame photometric estimation of Na+ to find out the salinity in sand
15. Determination of acid value of a vegetable oil
16. Determination of saponification of a vegetable oil
Reference Books
1. G. Svehla, B. Sivasankar, “Vogel's Qualitative Inorganic Analysis”, Pearson, 2012.
2. R. K. Mohapatra, “Engineering Chemistry with Laboratory Experiments”, PHI Learning, 2017.
3. Muhammed Arif, “Engineering Chemistry Lab Manual”, Owl publishers, 2019.
4. Ahad J., “Engineering Chemistry Lab manual”, Jai Publications, 2019.
5. Roy K Varghese, “Engineering Chemistry Laboratory Manual”, Crownplus Publishers, 2019.
6. Soney C George, Rino Laly Jose, “Lab Manual of Engineering Chemistry”, S. Chand &
Company Pvt Ltd, New Delhi, 2019.
ESL YEAR OF
CIVIL & MECHANICAL CATEGORY L T P CREDIT
120 INTRODUCTION
WORKSHOP
0 0 2 1 2019
Preamble: The course is designed to train the students to identify and manage the tools, materials
and methods required to execute an engineering project. Students will be introduced to a team
working environment where they develop the necessary skills for planning, preparing and executing
an engineering project.
To enable the student to familiarize various tools, measuring devices, practices and different
methods of manufacturing processes employed in industry for fabricating components.
Prerequisite: None
Course Outcomes: After the completion of the course the student will be able to:
Course
Course Outcome Description
Outcome
CO 1 Name different devices and tools used for civil engineering measurements
CO 2 Explain the use of various tools and devices for various field measurements
Demonstrate the steps involved in basic civil engineering activities like plot
CO 3 measurement, setting out operation, evaluating the natural profile of land, plumbing
and undertaking simple construction work.
Choose materials and methods required for basic civil engineering activities like field
CO 4
measurements, masonry work and plumbing.
CO 5 Compare different techniques and devices used in civil engineering measurements
Identify Basic Mechanical workshop operations in accordance with the material and
CO 6
objects
Apply appropriate Tools and Instruments with respect to the mechanical workshop
CO 7
trades
CO 8 Apply appropriate safety measures with respect to the mechanical workshop trades
PO
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10 PO 11
12
CO 1 1 - - - 1 1 - - 2 2 - -
CO 2 1 - - - 1 1 - - 2 2 - -
CO 3 1 - - - 1 1 - 2 2 2 1 -
CO 4 1 - - - 1 1 - 2 2 2 1 1
CO 5 1 - - - 1 1 - - 2 2 1
CO 6 2
CO 7 2
CO 8 2
Mark distribution
100 70 30 1 hour
Assessment Procedure: Total marks allotted for the course is 100 marks. CIE shall be conducted for
70 marks and ESE for 30 marks. CIE should be done for the work done by the student and also
viva voce based on the work done on each practical session. ESE shall be evaluated by written
examination of one hour duration conducted internally by the institute.
SYLLABUS
PART 1
CIVIL WORKSHOP
Exercise 1. Calculate the area of a built-up space and a small parcel of land- Use standard
measuring tape and digital distance measuring devices
Exercise 2. (a) Use screw gauge and vernier calliper to measure the diameter of a steel rod and
thickness of a flat bar
(b) Transfer the level from one point to another using a water level
(c) Set out a one room building with a given plan and measuring tape
Exercise 3. Find the level difference between any two points using dumpy level
Exercise 4. (a) Construct a 1 thick brick wall of 50 cm height and 60 cm length using English
bond. Use spirit level to assess the tilt of walls.
(b) Estimate the number of different types of building blocks to construct this wall.
Exercise 5. (a) Introduce the students to plumbing tools, different types of pipes, type of
connections, traps, valves ,fixtures and sanitary fittings.
(b) Install a small rainwater harvesting installation in the campus
Reference Books:
1. Khanna P.N, “Indian Practical Civil Engineering Handbook”, Engineers Publishers.

2. Bhavikatti. S, "Surveying and Levelling (Volume 1)", I.K. International Publishing House
3. Arora S.P and Bindra S.P, " Building Construction", Dhanpat Rai Publications
4. S. C. Rangwala, “Engineering Materials,” Charotar Publishing House.
PART II
MECHANICAL WORKSHOP
LIST OF EXERCISES
(Minimum EIGHT units mandatory and FIVE models from Units 2 to 8 mandatory)
UNIT 1:- General : Introduction to workshop practice, Safety precautions, Shop floor ethics, Basic
First Aid knowledge.
Study of mechanical tools, components and their applications: (a) Tools: screw drivers,
spanners, Allen keys, cutting pliers etc and accessories (b) bearings, seals, O-rings, circlips,
keys etc.
UNIT 2:- Carpentry : Understanding of carpentry tools
1. T –Lap joint 2. Cross lap joint 3. Dovetail joint 4. Mortise joints
UNIT 3:- Foundry : Understanding of foundry tools
1.Bench Molding 2. Floor Molding 3. Core making 4. Pattern making
UNIT 4: - Sheet Metal : Understanding of sheet metal working tools
1. Cylindrical shape
2. Conical shape
3. Prismatic shaped job from sheet metal
UNIT 5: - Fitting : Understanding of tools used for fitting
1. Square Joint
2. V- Joint
3. Male and female fitting
UNIT 6: - Plumbing : Understanding of plumbing tools, pipe joints
Any one exercise on joining of pipes making use of minimum three types of pipe joints
UNIT 7: - Smithy: Understanding of tools used for smithy.

Demonstrating the forge-ability of different materials (MS, Al, alloy steel and cast steels)
in cold and hot states.
Observing the qualitative difference in the hardness of these materials
Minimum any one exercise on smithy
1. Square prism
2. Hexagonal headed bolt
3. Hexagonal prism
4. Octagonal prism
UNIT 8: -Welding: Understanding of welding equipments

Minimum any one welding practice
Making Joints using electric arc welding. bead formation in horizontal, vertical
and over head positions
UNIT 9: - Assembly: Demonstration only

Dissembling and assembling of
1. Cylinder and piston assembly
2. Tail stock assembly
3. Bicycle
4. Pump or any other machine
UNIT 10: - Machines: Demonstration and applications of the following machines

Shaping and slotting machine; Milling machine; Grinding Machine; Lathe; Drilling
Machine.
UNIT 11: - Modern manufacturing methods: Power tools, CNC machine tools, 3D printing, Glass
cutting.
No Topic No of Sessions
1 INTRODUCTION
Workshop practice, shop floor precautions, ethics and First Aid

knowledge.
1.1 Studies of mechanical tools, components and their applications: (a) 1
Tools: screw drivers, spanners, Allen keys, cutting pliers etc and
accessories (b) bearings, seals, O-rings, circlips, keys etc
2 CARPENTRY
2.1 Understanding of carpentry tools and making minimum one model 2

3 FOUNDRY
3.1 Understanding of foundry tools and making minimum one model 2
4 SHEET METAL
Understanding of sheet metal working tools and making minimum

4.1 2
one model
5 FITTING
5.1 Understanding of fitting tools and making minimum one model 2
6 PLUMBING
Understanding of pipe joints and plumbing tools and making

6.1
minimum one model 2
7 SMITHY
7.1 Understanding of smithy tools and making minimum one model 2
8 WELDING
Understanding of welding equipments and making minimum one

8.1
model 2
9 ASSEMBLY
Demonstration of assembly and dissembling of multiple parts

9.1
components 1
10 MACHINES
10.1 Demonstration of various machines 1
11 MODERN MANUFACTURING METHODS
Demonstrations of: power tools, CNC Machine tools, 3D printing,

11.1
Glass cutting 1
ESL 130 ELECTRICAL & CATEGORY L T P CREDIT YEAR OF
ELECTRONICS WORKSHOP INTRODUCTION
ESC 0 0 2 1 2019
Preamble: Electrical Workshop is intended to impart skills to plan and carry out simple
electrical wiring. It is essential for the practicing engineers to identify the basic practices and
safety measures in electrical wiring.
Prerequisite: NIL
CO 1 Demonstrate safety measures against electric shocks.

CO 2 Identify the tools used for electrical wiring, electrical accessories, wires, cables, batteries
and standard symbols
CO 3 Develop the connection diagram, identify the suitable accessories and materials necessary
for wiring simple lighting circuits for domestic buildings
CO 4 Identify and test various electronic components
CO 5 Draw circuit schematics with EDA tools
CO 6 Assemble and test electronic circuits on boards
CO 7 Work in a team with good interpersonal skills
10 11 12
CO 1 - - - - - 3 - - - - - 1
CO 2 2 - - - - - - - - 1 - -
CO 3 2 - - 1 - 1 - 1 2 2 - 2
CO 4 3 - - - - - - - - - - 2
CO 5 3 - - - 2 - - - - - - 2
CO 6 3 - - - 2 - - - - - - 1
CO 7 - - - - - - - - 3 2 - 2
Mark distribution

Duration(Internal)
100 100 - 1 hour

Syllabus
PART 1
ELECTRICAL
List of Exercises / Experiments
1. a) Demonstrate the precautionary steps adopted in case of Electrical shocks.

b)Identify different types of cables, wires, switches, fuses, fuse carriers, MCB, ELCB
and MCCB with ratings.
2. Wiring of simple light circuit for controlling light/ fan point (PVC conduit wiring)
3. Wiring of light/fan circuit using Two way switches . (Staircase wiring)
4. Wiring of Fluorescent lamps and light sockets (6A) with a power circuit for controlling power
device. (16A socket)
5. Wiring of power distribution arrangement using single phase MCB distribution board with
ELCB, main switch and Energy meter.
6. a)Identify different types of batteries with their specifications.
b)Demonstrate the Pipe and Plate Earthing Schemes using Charts/Site Visit.
PART II
ELECTRONICS
List of Exercises / Experiments (Minimum of 7 mandatory)
1. Familiarization/Identification of electronic components with specification

(Functionality, type, size, colour coding, package, symbol, cost etc. [Active, Passive,
Electrical, Electronic, Electro-mechanical, Wires, Cables, Connectors, Fuses, Switches,
Relays, Crystals, Displays, Fasteners, Heat sink etc.)
2. Drawing of electronic circuit diagrams using BIS/IEEE symbols and introduction to EDA
tools (such as Dia or XCircuit), Interpret data sheets of discrete components and IC’s,
Estimation and costing.
3. Familiarization/Application of testing instruments and commonly used tools.

[Multimeter, Function generator, Power supply, DSO etc.] [Soldering iron, De-
soldering pump, Pliers, Cutters, Wire strippers, Screw drivers, Tweezers, Crimping
tool, Hot air soldering and de- soldering station etc.]
4. Testing of electronic components [Resistor, Capacitor, Diode, Transistor and JFET

using multimeter.]
5. Inter-connection methods and soldering practice. [Bread board, Wrapping, Crimping,

Soldering - types - selection of materials and safety precautions, soldering practice in
connectors and general purpose PCB, Crimping.]
6. Printed circuit boards (PCB) [Types, Single sided, Double sided, PTH, Processing
methods, Design and fabrication of a single sided PCB for a simple circuit with manual
etching (Ferric chloride) and drilling.]
7. Assembling of electronic circuits using SMT (Surface Mount Technology) stations.
8. Assembling of electronic circuit/system on general purpose PCB, test and show the
functioning (Any Two circuits).
1. Fixed voltage power supply with transformer, rectifier diode, capacitor filter,
zener/IC regulator.
2. Square wave generation using IC 555 timer in IC base.

3. Sine wave generation using IC 741 OP-AMP in IC base.
4. RC coupled amplifier with transistor BC107.
COMPUTER SCIENCE AND ENGINEERING
SEMESTER -3
DISCRETE MATHEMATICAL STRUCTURES
MAT CATEGORY L T P CREDITS

DISCRETE MATHEMATICAL
203 STRUCTURES
BSC 3 1 0 4
Preamble:
The purpose of this course is to create awareness in students about the basic terminologies used
in advanced courses in Computer Science and develop rigorous logical thinking for solving
different kinds of problems in Computer Science. This course helps the learner to apply the
theory and applications of elementary Counting Principles, Propositional Logic, Predicate Logic,
Lattices, Generating Functions, Recurrence Relations and Algebraic Structures eventually in
practical applications.
Prerequisite: A sound background in higher secondary school Mathematics
CO# CO
Check the validity of predicates in Propositional and Quantified Propositional Logic
CO1 using truth tables, deductive reasoning and inference theory on Propositional Logic
(Cognitive Knowledge Level: Apply)
Solve counting problems by applying the elementary counting techniques - Rule of
Sum, Rule of Product, Permutation, Combination, Binomial Theorem, Pigeonhole
CO2
Principle and Principle of Inclusion and Exclusion (Cognitive Knowledge Level:
Apply)
Classify binary relations into various types and illustrate an application for each type
CO3 of binary relation, in Computer Science (Cognitive Knowledge Level:
Understand)
Illustrate an application for Partially Ordered Sets and Complete Lattices, in
CO4
Computer Science (Cognitive Knowledge Level: Apply)
Explain Generating Functions and solve First Order and Second Order Linear
CO5 Recurrence Relations with Constant Coefficients (Cognitive Knowledge Level:
Apply)
Illustrate the abstract algebraic systems - Semigroups, Monoids, Groups,
CO6 Homomorphism and Isomorphism of Monoids and Groups (Cognitive Knowledge
Level: Understand)
CO1
CO2
CO3
CO4
CO5
CO6
Abstract POs defined by National Board of Accreditation
PO# Broad PO PO# Broad PO

PO1 Engineering Knowledge PO7 Environment and Sustainability
PO2 Problem Analysis PO8 Ethics

PO3 Design/Development of solutions PO9 Individual and team work
Conduct investigations of complex

PO4 PO10 Communication
problems
PO5 Modern tool usage PO11 Project Management and Finance
PO6 The Engineer and Society PO12 Life long learning
Assessment Pattern
Bloom’s End Semester Examination
Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution
Total Marks CIE Marks ESE Marks ESE Duration

150 50 100 3

Attendance 10 marks
Continuous Assessment Tests (Average of Series Tests 1 & 2) 25 marks
Continuous Assessment Assignment 15 marks
Internal Examination Pattern:

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall
be preferably conducted after completing the first half of the syllabus and the second series test
shall be preferably conducted after completing remaining part of the syllabus. There will be two
parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
completed modules and 1 question from the partly completed module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A.
Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1
question from the partly completed module), each with 7 marks. Out of the 7 questions, a student
should answer any 5.
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from
each module, having 3 marks for each question. Students should answer all questions. Part B
contains 2 full questions from each module of which student should answer any one. Each
question can have maximum 2 sub-divisions and carries 14 marks.
Syllabus
Module – 1 (Fundamentals of Logic)
Mathematical logic - Basic connectives and truth table, Statements, Logical Connectives,
Tautology, Contradiction. Logical Equivalence - The Laws of Logic, The Principle of duality,
Substitution Rules . The implication - The Contrapositive, The Converse,The Inverse.
Logical Implication - Rules of Inference. The use COMPUTER
of Quantifiers SCIENCE ANDQuantifier.
- Open Statement, ENGINEERING
Logically Equivalent – Contrapositive, Converse , Inverse , Logical equivalences and
implications for quantified statement, Implications , Negation .
Module - 2 (Fundamentals of Counting Theory)

The Rule of Sum – Extension of Sum Rule . The Rule of Product - Extension of Product Rule .
Permutations. Combinations. The Binomial Theorem (without proof). Combination with
Repetition. The Pigeon hole Principle. The Principle of Inclusion and Exclusion Theorem
(Without Proof) - Generalization of the Principle. Derangements.
Module - 3 ( Relations and Functions )

Cartesian Product - Binary Relation. Function – domain , range-one to one function, Image-
restriction. Properties of Relations- Reachability Relations, Reflexive Relations, Symmetric
Relations, Transitive relations, Anti-symmetric Relations, Partial Order relations, Equivalence
Relations, Irreflexive relations.
Partially ordered Set – Hasse Diagram, Maximal-Minimal Element, Least upper bound (lub),
Greatest Lower bound(glb) ( Topological sorting Algorithm- excluded). Equivalence Relations
and Partitions - Equivalence Class.
Lattice - Dual Lattice , Sub lattice , Properties of glb and lub , Properties of Lattice , Special
Lattice , Complete Lattice, Bounded Lattice, Completed Lattice , Distributive Lattice.
Module - 4 (Generating Functions and Recurrence Relations)

Generating Function - Definition and Examples , Calculation techniques, Exponential
generating function. First order linear recurrence relations with constant coefficients –
homogeneous, non-homogeneous Solution. Second order linear recurrence relations with
constant coefficients, homogeneous, non-homogeneous Solution.
Module - 5 (Algebraic Structures )

Algebraic system-properties- Homomorphism and Isomorphism. Semi group and monoid –
cyclic monoid , sub semi group and sub monoid, Homomorphism and Isomorphism of Semi
group and monoids. Group- Elementary properties, subgroup, symmetric group on three
symbols ,The direct product of two groups, Group Homomorphism, Isomorphism of groups,
Cyclicgroup. R i g h t c o s e t s - L e f t c o s e t s . L a g r a n g e ’s T h e o r e m
Text Book
1. Discrete and Combinatorial Mathematics (An Applied Introduction), Ralph P Grimaldi, B
V Ramana , 5th Edition, Pearson

Reference Books COMPUTER SCIENCE AND ENGINEERING
1) Kenneth H. Rosen, Discrete Mathematics and Its Applications with Combinatorics and
Graph Theory, Seventh Edition, MGH, 2011
2) Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to
Computer Science”, Tata Mc Graw Hill Pub. Co. Ltd., New Delhi, 2003.
3) Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete Mathematical
Structures”, Pearson Education Pvt Ltd., New Delhi, 2003
4) Kenneth H .Rosen, “Discrete Mathematics and its Applications”, 5/e, Tata Mc Graw Hill
Pub. Co. Ltd, New Delhi 2003
5) Richard Johnsonbaugh, “Discrete Mathematics”, 5/e, Pearson Education Asia, NewDelhi,
2002.
6) Joe L Mott, Abraham Kandel, Theodore P Baker,“Discrete Mathematics for Computer
Scientists and Mathematicians”, 2/e, Prentice-Hall India, 2009.

1. Show that R⋁M , R⋁S , M, S cannot exist simultaneously (without using truth
table)
2. Represent the following statement in symbolic form “Not every city in Canada is clean”.
1. How many possible arrangements are there for the letters in MASSASAUGA in which 4
A’ s are together?
2. Find the number of integers between 1 and 1000 inclusive, which are not divisible by 5,
6 or 8
1. If A = {1, 2, 3, 4}, give an example of a relation R that is reflexive and symmetric but not
transitive.
2. Let Z be the set of integers. R is a relation called “Congruence Modulo 3 “ defined by R
= { (x,y) /x ɛ Z,y ɛ Z, x - y is divisible by 3 } . Show that R is an equivalence relation.
1. Assume A ={ a, b, c}. Let P(A) be its power set and ‘≤ ‘ be the subset relation on the
power set. Draw the Hasse diagram of (P(A), ≤).
2. What is meant by Bounded Lattice ? Give an example.
1. Solve ar- 3ar-1- 4ar-2 = 3r using Generating function method; Given a0 = 1, a1 = 2.
2. Find the generating function for the sequence 1, 3, 32, 33 …….
1. Prove that the group { 1,-1, i, -i } is cyclic with generators i and –i.
2. State and prove Lagrange’s Theorem.
COMPUTER
Model Question Paper SCIENCE AND ENGINEERING
QP CODE:
Reg No:______________
Name :______________ PAGES : 3
THIRD SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Name: Discrete Mathematical Structures
Max.Marks :100 Duration: 3 Hrs
PART A
1. Show the following implication without constructing the truth table: (P ^ Q) => P→Q
2. Write the negation of the following statement. “ If I drive, then I will not walk”
3. What is pigeon hole principle? Explain. If you select any five numbers from 1 to 8 then
prove that at least two of them will add up to 9 .
4. In how many ways can the letters of the word ALLAHABAD be arranged ?
5. Show that the divisibility relation ' / ' is a partial ordering on the set Z+.
6. Consider the functions given by f(x) = 2x+3 and g(x) = x2. Find (g o f ) and ( f o g).
7. What is meant by exponential generating function? Explain.
8. Provide one example of linear homogeneous recurrence relation. Mention the degree
also.
9. What is a monoid ? Explain.
10. Let (A, .) be a group. Show that (ab)-1 = b-1a-1
(10 x 3 = 30 Marks)
PART B
(Answer any one Question from each Module. Each question carries 14 Marks)
11.
(a) Show that S ⋁ R is tautologically implied by (PVQ) ⋀ (P→R) ⋀ (Q→S)
(6 marks)
(b) Show that from COMPUTER SCIENCE AND ENGINEERING
(ii) (∃x)(F(x) ⋀ S(x)) → (y) (M(y) → W(y)).
(iii)(∃y) (M(y) ⋀ W(y)) the conclusion (x)(F(x) → S(x)) follows.
(8 marks)
OR
12.
(a) Show that (x) (P(x) ⋁ Q(x)) ⇒ ((x)P(x) ⋁ (∃x) Q(x)) using indirect method of
proof .
(6 marks)
(b) Discuss indirect method of proof . Show that the following premises are inconsistent
(i) If Jack misses many classes through illness, then he fails high school.
(ii) If Jack fails high school, then he is uneducated.
(iii)If Jack reads a lot of books, then he is not uneducated.
(iv) Jack misses many classes through illness and reads a lot of books.
(8 marks)
13.
(a) Explain binomial theorem. Determine the coefficient of x9y3 in the expansion of
(x+y)12, (x+2y)12 and (2x- 3y)12 using binomial theorem.
(6 marks)
(b) How many 5 digit numbers can be formed from the digits 1,2,3,4,5 using the digits without
repetition ?
(i) How many of them are even?
(ii) How many are even and greater than 30,000?
(8 marks)
OR
14.
(a) There are 8 guests in a party. Each guest brings a gift and receives another gift in
return. No one is allowed to receive the gift they bought. How many ways are there to
distribute the gifts?
(6 marks)
(b) Six papers are set in an examination of which two are mathematical. Only one
examination will be conducted in a day. In how many different orders ,can the papers
be arranged so that
(i) Two mathematical papers are consecutive?
(ii) Two mathematical papers are not consecutive?
(8 marks)
15.
COMPUTER
(a) Let A = { 1,2,3,4,...11,12} and let R be the equivalenceSCIENCE
relation on AAND ENGINEERING
x A defined by
(a,b) R (c,d) iff a+d = b+c. Prove that R is an equivalence relation and find the
equivalence class of (2 ,5)
(8 marks)
(b) What is a chain lattice ? Explain. Also show that every chain is a distributive lattice.
(6 marks)
OR
16.
(a) Suppose f(x) = x+2 , g(x) = x-2, and h(x) = 3x for x ɛ R , where R is the set of real
numbers. Find (g o f ) , ( f o g ) , (f o f) and ( g o g)
(8 marks)
(b) Let R and S be two relations on a set A . If R and S are symmetric, Prove that (R∩S)
is also symmetric.
(6 marks)
17.
(a) Solve the recurrence relation ar - 7ar-1+ 10ar-2 = 0 for r ≥ 2 ; Given a0 = 0; a1 = 41
using generating functions
(8 marks)
(b) Solve the recurrence relation ar - 4ar-1 + 4ar-2 = (r+1)2 using generating function.
(6 marks)
OR
18.
(a) Solve an - 3an-1 + 2 ; a0 = 1 n ≥ 1, using generating functions.
(8 marks)
(b) Use generating function to solve the following recurrence relation an = 2an-1+ 2n ;
with a0 = 2.
(6 marks)
19.
(a) Prove that the set 'Q' of rational numbers other than 1 forms an abelian group with
respect to the operation ' * ' defined by a * b = a+b -ab.
(8 Marks)
(b) Show that the direct product of two group is a group.
(6 Marks)
OR
20.
(a) Show that the subgroup of a cyclic group is cyclic.
(8 Marks)
(b) Let (A,*) be a group. Show that (A,*) is an abelian group if and only if a2* b2=(a*b)2 for all
‘a’ and ‘b’ in A
(6 Marks)
COMPUTER
TEACHING PLAN SCIENCE AND ENGINEERING
No of Lecture
No Contents
Hrs
Module – 1 (Fundamentals of Logic) (9 hrs)
1.1 1
Mathematical logic, Basic Connectives and Truth Table
1.2 Statements, Logical Connectives, Tautology, Contradiction 1

1.3 Logical Equivalence, The Laws of Logic 1
1.4 The Principle of duality, Substitution Rules 1
1.5 The implication, The Contrapositive, the Converse , the Inverse 1
1.6 Logical Implication,Rules of Inference, Logical Implication 1
1.7 The use of Quantifiers, Open Statement, Quantifier, Negation 1
Logically Equivalent, Contrapositive, The Converse, The
1.8 Inverse 1
1.9 Logical Implications 1

Module - 2 (Fundamentals of Counting Theory) (9 hrs)
2.1 The Pigeon-hole Principle 1
2.2 The Rule of Sum 1
2.3 Extension of Sum Rule 1
2.4 The Rule of Product 1
2.5 Extension of Product Rule , Permutations 1
2.6 Combinations, Combination with repetition 1
2.7 The Binomial Theorem 1
The Principle of Inclusion and Exclusion Theorem ( Without
2.8 1
Proof) Generalization of the Principle
2.9 Derangements 1
Module - 3 ( Relations and Functions) (9 hrs)
Cartesian Product, Binary Relation, Function, Domain, Range ,

3.1 1
One to One Function Image - Restriction
Properties, Reachability Relations, Reflexive

3.2 Relations,Symmetric Relations,Transitive relations, 1
Antisymmetric Relations.
3.3 Partial Order relations 1
3.4 Equivalence Relation, Irreflexive Relations. 1
3.5 Partially ordered Set, Hasse Diagram.

1
Maximal-Minimal Element, Least Upper bound, Greatest
3.6 1
Lower Bound
3.7 Equivalence Relations and Partitions ,Equivalence Class 1
3.8 Lattice- Dual Lattice,sub lattice , Properties of glb and lub 1
Properties of Lattice , Special Lattice , Complete Lattice,

3.9 Bounded Lattice, Completed Lattice, Distributive Lattice 1
Module - 4 (Generating Functions and Recurrence Relations) (9 hrs)

4.1 Generating Function , Definition and Examples 1
Exponential Generating Function.

4.2 1
First Order Linear Recurrence Relations with Constant

4.3 Coefficients (Lecture I) 1
First Order Linear Recurrence Relations with Constant

4.4 1
Coefficients (Lecture II)
4.5 Homogeneous Solution 1
4.6 Non homogeneous Solution 1
Second order linear recurrence relations with constant

4.7 1
coefficients
4.8 Homogeneous Solution 1
4.9 Non homogeneous Solution 1
Module - 5 (Algebraic Structures )( 9 hrs)

Algebraic System-Properties, Homomorphism and
5.1 1
Isomorphism
5.2 Semi group , Monoid, Cyclic monoid 1

5.3 Sub semigroup and sub monoid 1
5.4 Homomorphism and Isomorphism of Semigroup, Monoids and

1
Groups
Elementary Properties, Subgroup, Symmetric group on three
5.5 symbols 1
5.6 The direct Product of two Groups 1
5.7 Group Homomorphism, Isomorphism, Cyclic group 1
5.8 Right coset, Left coset 1
5.9 Lagrange’s Theorem 1

YEAR OF
CST DATA CATEGORY L T P CREDIT
INTRODUCTION
201 STRUCTURES
PCC 3 1 0 4 2019
Preamble: This course aims at moulding the learner to understand the various data structures,
their organization and operations. The course helps the learners to assess the applicability of
different data structures and associated algorithms for solving real world problem which requires
to compare and select appropriate data structures to solve the problem efficiently. This course
introduces abstract concepts for data organization and manipulation using data structures such as
stacks, queues, linked lists, binary trees, heaps and graphs for designing their own data structures
to solve practical application problems in various fields of Computer Science.
Prerequisite: Topics covered under the course Programming in C (EST 102)
Design an algorithm for a computational task and calculate the time/space

CO1
complexities of that algorithm (Cognitive Knowledge Level: Apply)
Identify the suitable data structure (array or linked list) to represent a data item
required to be processed to solve a given computational problem and write an
CO2
algorithm to find the solution of the computational problem (Cognitive Knowledge
Level: Apply)
Write an algorithm to find the solution of a computational problem by selecting an

CO3 appropriate data structure (binary tree/graph) to represent a data item to be processed
Store a given dataset using an appropriate Hash Function to enable efficient access of
CO4
data in the given set (Cognitive Knowledge Level: Apply)
Select appropriate sorting algorithms to be used in specific circumstances (Cognitive
CO5
Knowledge Level: Analyze)
Design and implement Data Structures for solving real world problems efficiently
CO6
CO1
CO2
CO3
CO4
CO5
CO6

PO4 Conduct investigations of complex PO10 Communication
problems
Assessment Pattern
Continuous Assessment Tests End Semester

Bloom’s Category
Test1 (Percentage) Test2 (Percentage) Examination Marks
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyse
Evaluate
Create
Mark Distribution
150 50 100 3 hours
Continuous Assessment Tests : 25 marks
Continuous Assessment Assignment : 15 marks
Each of the two internal examinations has to be conducted out of 50 marks
First Internal Examination shall be preferably conducted after completing the first half of the
syllabus and the Second Internal Examination shall be preferably conducted after completing
remaining part of the syllabus.
There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions
each from the completed modules and 1 question from the partly covered module), having 3
marks for each question adding up to 15 marks for part A. Students should answer all questions
from Part A. Part B contains 7 questions (preferably, 3 questions each from the completed
modules and 1 question from the partly covered module), each with 7 marks. Out of the 7
questions in Part B, a student should answer any 5.
contains 2 questions from each module of which a student should answer any one. Each question
can have maximum 2 sub-divisions and carries 14 marks.
SYLLABUS
Module 1
Basic Concepts of Data Structures

System Life Cycle, Algorithms, Performance Analysis, Space Complexity, Time Complexity,
Asymptotic Notation, Complexity Calculation of Simple Algorithms
Module 2
Arrays and Searching

Polynomial representation using Arrays, Sparse matrix, Stacks, Queues-Circular Queues, Priority
Queues, Double Ended Queues, Evaluation of Expressions
Linear Search and Binary Search
Module 3
Linked List and Memory Management

Self Referential Structures, Dynamic Memory Allocation, Singly Linked List-Operations on
Linked List. Doubly Linked List, Circular Linked List, Stacks and Queues using Linked List,
Polynomial representation using Linked List
Memory allocation and de-allocation-First-fit, Best-fit and Worst-fit allocation schemes
Module 4
Trees and Graphs
Trees, Binary Trees-Tree Operations, Binary Tree Representation, Tree Traversals, Binary Search
Trees- Binary Search Tree Operations
Graphs, Representation of Graphs, Depth First Search and Breadth First Search on Graphs,
Applications of Graphs
Module 5
Sorting and Hashing

Sorting Techniques – Selection Sort, Insertion Sort, Quick Sort, Merge Sort and Heap Sort
Hashing- Hashing Techniques, Collision Resolution, Overflow handling, Hashing functions –
Mid square, Division, Folding, Digit Analysis
Text Book
1. Ellis Horowitz, Sartaj Sahni and Susan Anderson-Freed, Universities Press,

Fundamentals of Data Structures in C
Reference Books
1. Samanta D., Classic Data Structures, Prentice Hall India.

2. Richard F. Gilberg, Behrouz A. Forouzan, Data Structures: A Pseudocode Approach with
C, 2/e, Cengage Learning.
3. Aho A. V., J. E. Hopcroft and J. D. Ullman, Data Structures and Algorithms, Pearson
Publication.
4. Tremblay J. P. and P. G. Sorenson, Introduction to Data Structures with Applications, Tata

McGraw Hill.
5. Peter Brass, Advanced Data Structures, Cambridge University Press.
6. Lipschuts S., Theory and Problems of Data Structures, Schaum’s Series.
7. Wirth N., Algorithms + Data Structures = Programs, Prentice Hall.
8. Hugges J. K. and J. I. Michtm, A Structured Approach to Programming, PHI.
9. Martin Barrett, Clifford Wagner, C And Unix: Tools For Software Design, John Wiley.
Course Outcome1(CO1): Write an algorithm for matrix multiplication and calculate its
time complexity.
Course Outcome 2(CO2): How a linked list can be used to represent the polynomial
5x4y6+24x3y4-17x2y3+15xy2+45.Write an algorithm to add two Bivariate polynomials
represented using linked list.
Course Outcome 3(CO3): Create a Binary search Tree with node representing the
following sequence 14, 15, 4, 18, 9, 16, 20, 17, 3, 7, 5, 2 and perform inorder, preorder
and postorder traversals on the above tree and print the output.
Course Outcome 4(CO4): The size of a hash table is 7. The index of the hash table
varies from 0 to 6. Consider the keys 89, 18, 49, 58, 25 in the order. Show how the keys
are stored in the hash table using Linear probing.
Course Outcome 5(CO5): In what circumstances does Quick Sort perform over Merge
sort.
Course Outcome 6(CO6): Design a reservation system for railways that include
waiting list. If the reservation is full “Display reservation full” and put the passenger in
in waiting list and give a waiting list number. If a passenger cancels the ticket, then the
seat should be automatically allocated to the first passenger in the waiting list.
QP CODE: PAGES:3
Reg No:_______________
Name:_________________
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH

DEGREE EXAMINATION, MONTH & YEAR
Course Code: CST 201
Course Name: DATA STRUCTURES
PART A
1. Calculate the frequency count of the statement x = x+1; in the following code segment
for (i = 0; i< n; i++)
for (j = 0; j< n; j*=2)
x = x + 1;
2. What is the relevance of verification in System Life Cycle?
3. Write an algorithm to insert a new element in a particular position of an array.

4. Convert the expression ((A/(B-D+E))*(F-G)*H) to postfix form. Show each step in the
conversion including the stack contents
5. Write an algorithm to count the number of occurrences of a character in a linked list (each
node contains only one character)
6. Write an algorithm for best-fit method of memory allocation
7. Draw the binary tree whose sequential representation is given below
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
A B C - D E - - - - F G - - -
8. Find the Depth First Search of the following Graph
B C D
E F G
9. Write an algorithm to arrange n numbers in nonincreasing order.
10. Let the size of a hash table is 10. The index of the hash table varies from 0 to 9. Assume
the keys 73, 54, 15, 48, 89, 66, 37, 18, 41, 22, 62 are mapped using modulo operator.
Show how the keys are distributed using chaining method.
Part B
11. a) Explain the System Life Cycle in detail (10)
b) How the performance of an algorithm is evaluated? (4)
OR
12. a) Write algorithms for Linear Search and Binary Search and Compare their time
complexities (10)
b) Between O(nlogn) and O(logn) which one is better and why? (4)
13. a) Write algorithms to insert and delete elements from a double ended queue.
Demonstrate with examples (10)
b) Compare and contrast Circular Queue with a Normal Queue (4)
OR
14. a) Write an algorithm to insert and delete elements from a Priority Queue (8)
b) Discuss an algorithm to convert an infix expression to a prefix expression (6)
15. a) Write an algorithm to multiply two polynomials represented using linked list (10)
b) How doubly linked list can be used to find palindromes ? (4)
OR
16. a) How is memory compaction (de-allocation) done in memory management ? (8)
b) Discuss the advantages and disadvantages of First-fit, Best-fit and Worst-fit allocation
schemes (6)
17. a) List the properties of Binary Search Tree. Write an algorithm to search an element
from a Binary Search Tree (10)
b) Write an iterative algorithm for in-order traversal of a Binary Tree (4)
OR
18. a) Give algorithms for DFS and BFS of a graph and explain with examples (8)
b) How graphs can be represented in a Computer? (6)
19. a) Write algorithms for Merge sort and Quick Sort. (10)
b) Illustrate the working of Quick sort on the following input 38, 8, 0, 28, 45, -12, 89, 66,
42 (4)
OR
20. a) With examples discuss the different hash functions used for hashing (10)
b) Apply the hash function h(x) = x mod 7 for linear probing on the data 2341, 4234,
2839, 430, 22, 397, 3920 and show the resulting hash table (4)
Teaching Plan
Module 1 :Basic Concepts of Data Structures (5 hours)
1.1 System Life Cycle, 1 hour
1.2 Algorithms , Performance Analysis 1 hour

1.3 Space Complexity, Time Complexity 1 hour
1.4 Asymptotic Notation (Big O Notation) 1 hour

1.5 Complexity Calculation of Simple Algorithms 1hour
Module 2 :Arrays and Searching (10 hours)

2.1 Polynomial representation using Arrays 1 hour
2.2 Sparse matrix (Lecture 1) 1 hour

2.3 Sparse matrix (Lecture 2) 1 hour
2.4 Stacks 1 hour

2.5 Queues, Circular Queues 1 hour
2.6 Priority Queues, 1 hour

2.7 Double Ended Queues, 1 hour
2.8 Conversion and Evaluation of Expressions (Lecture 1) 1 hour

2.9 Conversion and Evaluation of Expressions (Lecture 2) 1 hour
2.10 Linear Search and Binary Search 1 hour

Module 3 : Linked List and Memory Management (12 hours)
3.1 Self Referential Structures 1 hour

3.2 Dynamic Memory Allocation 1 hour
3.3 Singly Linked List-Operations on Linked List, 1 hour

3.4 Doubly Linked List 1 hour
3.5 Circular Linked List 1 hour

3.6 Stacks using Linked List 1 hour
3.7 Queues using Linked List 1 hour

3.8 Polynomial representation using Linked List (Lecture 1) 1 hour
3.9 Polynomial representation using Linked List (Lecture2) 1 hour

3.10 Memory de-allocation 1 hour
3.11 Memory allocation-First-fit 1 hour

3.12 Best-fit and Worst-fit allocation schemes 1hour
Module 4 :Trees and Graphs (8 hours)

4.1 Trees, Binary Trees 1hour
4.2 Tree Operations, Binary Tree Representation, 1hour

4.3 Tree Traversals 1hour
4.4 Binary Search Trees 1hour

4.5 Binary Search Tree Operations 1hour
4.6 Graphs, Representation of Graphs 1hour

4.7 Depth First Search and Breadth First Search on Graphs 1hour
4.8 Applications of Graphs 1hour
Module 5 : Sorting and Hashing (10 hours)

5.1 Sorting Techniques – Selection Sort 1hour
5.2 Insertion Sort 1hour

5.3 Quick Sort 1hour
5.4 Merge Sort 1hour

5.5 Heap Sort 1hour
5.6 Hashing- Hashing Techniques 1hour

5.7 Collision Resolution 1hour
5.8 Overflow handling 1hour

5.9 Hashing functions – Mid square and Division methods 1hour
5.10 Folding and Digit Analysis methods 1hour

CST Category L T P Credit Year of Introduction

Logic System Design
203 PCC 3 1 0 4 2019
Preamble: The objective of the course is to familiarize learners with the basic concepts of
Boolean algebra and digital systems. This course covers the design of simple combinational and
sequential logic circuits, representation and arithmetic algorithms for Binary, BCD (Binary
Coded Decimal) and Floating point numbers which in turn are helpful in understanding
organization & design of a computer system and understanding how patterns of ones and zeros
can be used to store information on computers, including multimedia data.
Prerequisite: Nil
CO# CO
Illustrate decimal, binary, octal, hexadecimal and BCD number systems, perform
conversions among them and do the operations - complementation, addition,
CO1
subtraction, multiplication and division on binary numbers (Cognitive Knowledge
level: Understand)
Simplify a given Boolean Function and design a combinational circuit to implement
CO2 the simplified function using Digital Logic Gates (Cognitive Knowledge level:
Apply)
Design combinational circuits - Adders, Code Convertors, Decoders, Magnitude
CO3 Comparators, Parity Generator/Checker and design the Programmable Logic Devices -
ROM and PLA. (Cognitive Knowledge level: Apply)
Design sequential circuits - Registers, Counters and Shift Registers. (Cognitive
CO4
Knowledge level: Apply)
Use algorithms to perform addition and subtraction on binary, BCD and floating point
CO5
numbers (Cognitive Knowledge level: Understand)
CO1
CO2
CO3
CO4
CO5



problems
Assessment Pattern:
End Semester
Bloom’s Category Test 1 (%) Test 2 (%)
Examination Marks (%)
Remember 20 20 20
Understand 35 35 35
Apply 45 45 45
Analyse
Evaluate
Create
Mark Distribution: COMPUTER SCIENCE AND ENGINEERING
150 50 100 3

Continuous Assessment Test : 25 marks


SYLLABUS
Module I
Number systems, Operations & Codes
Decimal, Binary, Octal and Hexadecimal Number Systems- Number Base Conversions.
Addition, Subtraction, Multiplication and Division of binary numbers. Representation of
negative numbers- Complements, Subtraction with complements. Addition and subtraction of
BCD, Octal and Hexadecimal numbers. Binary codes- Decimal codes, Error detection codes,
Reflected code, Character coding schemes – ASCII, EBCDIC.
Module II
Boolean Algebra
Postulates of Boolean Algebra. Basic theorems and Properties of Boolean Algebra. Boolean
Functions - Canonical and Standard forms. Simplification of Boolean Functions- Using
Karnaugh- Map Method (upto five variables), Don’t care conditions, Product of sums
COMPUTER
simplification, Tabulation Method. Digital Logic SCIENCE
Gates- Implementation AND ENGINEERING
of Boolean functions
using basic and universal gates.
Module III
Combinational Logic Circuits
Design Procedure & Implementation of combinational logic circuits- Binary adders and
subtractors, Binary Parallel adder, Carry look ahead adder, BCD adder, Code converter,
Magnitude comparator, Decoder, Demultiplexer, Encoder, Multiplexer, Parity generator/
Checker.
Module IV
Sequential logic circuits:
Flip-flops- SR, JK, T and D. Triggering of flip-flops- Master slave flip- flops, Edge- triggered
flip- flops. Excitation table and characteristic equation. Registers- register with parallel load.
Counter design: Asynchronous counters- Binary and BCD counters, timing sequences and state
diagrams. Synchronous counters- Binary Up- down counter, BCD counter.
Module V
Shift registers
Shift registers – Serial In Serial Out, Serial In Parallel Out, Bidirectional Shift Register with
Parallel load. Ring counter. Johnson counter- timing sequences and state diagrams.
Arithmetic algorithms
Algorithms for addition and subtraction of binary numbers in signed magnitude and 2’s
complement representations. Algorithm for addition and subtraction of BCD numbers.
Representation of floating point numbers, Algorithm for addition and subtraction of floating
point numbers.
Programmable Logic devices

ROM. Programmable Logic Array(PLA)- Implementation of simple circuits using PLA.
Text Books:
1. M. Morris Mano, Digital Logic & Computer Design, 4/e, Pearson Education, 2013
2. Thomas L Floyd, Digital Fundamentals, 10/e, Pearson Education, 2009.
3. M. Morris Mano, Computer System Architecture, 3/e, Pearson Education, 2007.
Reference Books:
1. M. Morris Mano, Michael D Ciletti , Digital Design With An Introduction to the Verilog
HDL, 5/e, Pearson Education, 2013.
2. Donald D Givone, Digital Principles and Design, Tata McGraw Hill, 2003
Sample Course Level Assessment Questions COMPUTER SCIENCE AND ENGINEERING
Course Outcome1(CO1): Perform the following number base conversions:

a) (250.55)
! 10 to Hexadecimal b) (357)
! 8 to Decimal
Course Outcome 2(CO2): Given a Boolean function F and don’t care conditions D, using
Karnaugh map obtain the simplified expression in (i) SOP and (ii) POS:
! F(A, B, C, D) = A′B′D′ + A′CD + A′BC
! D(A, B, C, D) = A′BC′D + ACD + A B′D
Course Outcome 3(CO3): Design a BCD to Excess-3 Code Convertor.
Course Outcome 4(CO4): Design a 4- bit binary ripple counter.
Course Outcome 5(CO5): Demonstrate floating-point addition algorithm.

COMPUTER
Model Question Paper SCIENCE AND ENGINEERING
QP CODE: PAGES: 2
Reg No:_______________
Name:_________________
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH

Course name : LOGIC SYSTEM DESIGN
Max Marks: 100 Duration: 3 Hours
PART-A
(Answer All Questions. Each question carries 3 marks)
1. Represent the decimal numbers (459)10 and (859)10 in hexadecimal and perform
addition of these hexadecimal numbers.
2. Subtract (1101)
! 2 from !(11010)2 using: i) !2′s complement and ii) 1′
! s complement
arithmetic.
3. Find the dual and complement of the boolean function F

! = A B′ + B(A + B′).
4. Using K-map, reduce the expression: A

! B + A BC + A BC + BC.
5. Design a half subtractor with NAND gates only.
6. Design a combinational circuit that multiplies an input decimal digit by 5 represented in

BCD. The output is also in BCD. Show that the outputs can be obtained from the input
lines without using any logic gates.
7. Differentiate between ripple counter and synchronous counter.
8. Construct D flipflop using NAND gates. Also give its truth table.
9. Explain how a shift register is used for serial data transfer?
10. Write short notes on ROM.
PART-B
(Answer any one full question from each module) (14X5=70)
11. (a) Perform the following operations using 2’s complement arithmetic: (8)
(i) !8810 + (−37)10 (ii) !(−20)10 + (−12)10
(b) Perform the following base conversions: (i) (101011.11)

! 2 to octal (6)
(ii) (3F 9B)16 to binary (iii) (121)10 to binary (iv) (3077)8 to binary
OR
12. (a) Find the 12 bit 2′

! s complement representation of the following decimal (6)
numbers.
(i) – 97 (ii) – 224 (iii) - 197.5
(b) Perform the following operations (8)

(i) (520)8 + (488)8 (ii) (520)16 − (488)16
13. (a) Prove that (i) A! B + A(B + C ) + B(B + C ) = B + AC (4)

(ii) A
! B + A(B + C ) + B(B + D) = A
(b) Using K-map, simplify the Boolean function F in sum of products form, (10
using the don’t care conditions d:
!F(w, x, y, z) = w′(x′y + x′y′ + x yz) + x′z′(y + w)
!d(w, x, y, z) = w′ x (y′z + yz′) + w yz
OR
14. (a) Simplify the following expressions using Karnaugh- map method. (8)
(i) !F = Σ(0,2,4,6,9,11,13,15,17,21,25,27,29,31)
(ii) F
! = Π(0,2,5,7)
(b) Convert the following to the other canonical form: (6)
∑
(i) !F(x, y, z, a) = (1,3,7)
(ii) F(x,
! y, z) = Π(0,3,6,7)
(iii) F(A,
! B, C, D) = Π(0,1,2,3,4,6,12)
15. (a) Implement Full adder circuit using NAND gate only. (4)
(b) Design a code converter for converting BCD to Excess 3 code (10)
OR
16. (a) With a neat diagram explain 4-bit carry look-ahead adder. (6)
(b) Design a Gray to binary code converter using a 4x1 MUX. Draw the (8)
circuit diagram and explain.
17. (a) Design a counter that count the states 0,3,5,6,0… using T flip- flops. (10)
(b) Write the characteristics equation, excitation table of JK, T and D flipflop. (4)
OR
18. (a) Explain race around condition and how it can be avoided. (6)
(b) Design a synchronous Binary Up-Down Counter. (8)
19. (a) With a neat diagram explain universal shift register. (8)
(b) Explain Johnson Counter with timing diagram. (6)

OR
20. (a) Write algorithm for floating point addition and subtraction. (8)
(b) Implement the functions Y
! 1 = A B′C′ + A B′C + A BC and Y
! 2 = BC + AC (6)
using minimum gates Programmable Logic Array.
Teaching Plan
(7
Module 1: Number systems, Operations & Codes (No algorithms)
hours)
Number Systems: Decimal, Binary, Octal and Hexadecimal number systems,
1.1 1 hour
Number Base Conversions.
Binary Arithmetic: Addition, Subtraction, Multiplication & Division of

1.2 1 hour
Binary Numbers. (Lecture 1)
Addition, Subtraction, Multiplication & Division of Binary Numbers. (Lecture

1.3 1 hour
2)
Representation of Negative Numbers- Complements, subtraction with 1 hour
1.4
complements.
1.5 BCD Arithmetic: Addition and Subtraction of BCD Numbers 1 hour
Octal and Hexadecimal Arithmetic: Addition & Subtraction of Octal and

1.6 1 hour
Hexadecimal Numbers.
Binary Codes: Decimal Codes, Error detection codes, Reflected code,
1.7 1 hour
Character Coding Schemes-ASCII, EBCDIC
(9
Module 2: Boolean Algebra
hours)
2.1 Introduction to Boolean Algebra: Postulates of Boolean Algebra 1 hour
2.2 Basic theorems and Properties of Boolean Algebra 1 hour
2.3 Boolean Functions: Canonical and Standard Forms 1 hour
2.4 Simplification of Boolean Functions: Karnaugh -Map Method (upto five 1 hour
variables), Don’t care conditions (Lecture 1)
Simplification of Boolean Functions: Karnaugh -Map Method (upto five
2.5 1 hour
variables), Don’t care conditions (Lecture 2)
2.6 Product of sums simplification 1 hour
2.7 Tabulation method 1 hour
Digital Logic Gates: AND, OR, NOT, NAND, NOR, XOR, XNOR,
2.8 Implementation of Boolean functions using basic and universal gates. (Lecture 1 hour
1)
Digital Logic Gates: AND, OR, NOT, NAND, NOR, XOR, XNOR,
2.9 Implementation of Boolean functions using basic and universal gates. (Lecture 1 hour
2)
(9
Module 3: Combinational Logic Circuits
hours)
3.1 Design Procedure & Implementation of Combinational Circuits 1 hour
Binary Adders:
3.2 1 hour
Implementation of Half Adder, Full Adder
Binary Subtractors:
3.3 1 hour
Implementation of Half Subtractor, Full Subtractor
Implementation of Binary Parallel Adder ,Carry look ahead Adder, BCD Adder
3.4 1 hour
(Lecture 1)
Implementation of Binary Parallel Adder ,Carry look ahead Adder, BCD Adder
3.5 1 hour
(Lecture 2)
Implementation of Various Combinational Circuits:
3.6 1 hour
Code Converters, Magnitude Comparator
3.7 Implementation of Decoder, Demultiplexer 1 hour
3.8 Implementation of Encoder, Multiplexer 1 hour
3.9 Implementation of Parity Generator/Checker 1 hour
(9
Module 4: Sequential logic circuits:
hours)
Flip flops:
4.1 1 hour
SR, JK, T and D flip- flops (Lecture 1)
4.2 SR, JK, T and D flip- flops (Lecture 2) 1 hour
Triggering of flip-flops- Master slave flipflop, Edge- triggered flip-flops

4.3 1 hour
(Lecture 1)
Triggering of flip-flops- Master slave flipflop, Edge- triggered flip-flops

4.4 1 hour
(Lecture 2)
4.5 Excitation table and characteristic equations of flip- flops 1 hour
4.6 Registers- Register with parallel load 1 hour
Counter Design:
4.7 Asynchronous counters- Binary and BCD counters- timing sequences and state 1 hour
diagrams. (Lecture 1)
Asynchronous counters- Binary and BCD counters- timing sequences and state
4.8 1 hour
diagrams. (Lecture 2)
4.9 Synchronous counters- Binary Up- down counter, BCD counter 1 hour
(11
Module 5: Shift registers, Arithmetic algorithms & PLD’s
hours)
5.1 Shift Registers - Serial In Serial Out, Serial In Parallel Out. 1 hour
5.2 Bidirectional Shift Register with Parallel load 1 hour

Shift register counters - Ring Counter, Johnson Counter- timing sequences
5.3 1 hour
and state diagrams
Arithmetic Algorithms: Algorithm for addition and subtraction of binary

5.4 1 hour
numbers in Signed magnitude and 2’s complement representations (Lecture 1)
Algorithm for addition and subtraction of binary numbers in Signed magnitude

5.5 1 hour
and 2’s complement representations (Lecture 2)
5.6 Algorithm for addition and subtraction of BCD numbers 1 hour
5.7 Representation of floating point numbers (IEEE Standard representations). 1 hour
5.8 Algorithms for floating point addition and subtraction 1 hour
5.9 Programmable Logic devices - ROM 1 hour
5.10 PLA, Implementation of simple circuits using PLA(Lecture 1) 1 hour
5.11 PLA, Implementation of simple circuits using PLA(Lecture 2) 1 hour

OBJECT ORIENTED YEAR OF

CST CATEGORY L T P CREDIT
PROGRAMMING INTRODUCTION
205
USING JAVA
PCC 3 1 0 4 2019
Preamble: The purpose of this course is to enable learners to solve problems by breaking it
down to object level while designing software and to implement it using Java. This course covers
Object Oriented Principles, Object Oriented Programming in Java, Inheritance, Exception
handling, Event handling, multithreaded programming and working with window-based
graphics. This course helps the learners to develop Desktop GUI Applications, Mobile
applications, Enterprise Applications, Scientific Applications and Web based Applications.
Prerequisite: Topics covered under the course PROGRAMMING IN C (EST 102)
Write Java programs using the object oriented concepts - classes, objects,
CO1 constructors, data hiding, inheritance and polymorphism (Cognitive Knowledge
Level: Apply)
Utilise datatypes, operators, control statements, built in packages & interfaces, Input/
CO2 Output Streams and Files in Java to develop programs (Cognitive Knowledge Level:
Apply)
Illustrate how robust programs can be written in Java using exception handling
CO3
mechanism (Cognitive Knowledge Level: Understand)
Write application programs in Java using multithreading and database connectivity

CO4
Write Graphical User Interface based application programs by utilising event
CO5
handling features and Swing in Java (Cognitive Knowledge Level: Apply)
CO1
CO2
CO3
CO4
CO5

problems
Assessment Pattern
Continuous Assessment Tests End Semester Examination

Bloom’s Category
Test1 (Marks %) Test2 (Marks %) Marks (% )
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyse
Evaluate
Create
Mark Distribution
150 50 100 3 hours
First series test shall be preferably conducted after completing the first half of the syllabus and
the second series test shall be preferably conducted after completing remaining part of the
syllabus.
End Semester Examination Pattern: There will be two parts; Part A and Part B. Part A contains
10 questions with 2 questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 questions from each module of which a student
should answer any one. Each question can have maximum 2 sub-divisions and carry 14 marks.
SYLLABUS
Object Oriented Programming Using Java
Module 1
Introduction:
Approaches to Software Design - Functional Oriented Design, Object Oriented Design, Case
Study of Automated Fire Alarm System.
Object Modeling Using Unified Modeling Language (UML) – Basic Object Oriented concepts,
UML diagrams, Use case model, Class diagram, Interaction diagram, Activity diagram, State
chart diagram.
Introduction to Java - Java programming Environment and Runtime Environment, Development
Platforms -Standard, Enterprise. Java Virtual Machine (JVM), Java compiler, Bytecode, Java
applet, Java Buzzwords, Java program structure, Comments, Garbage Collection, Lexical Issues.
Module 2
Core Java Fundamentals:

Primitive Data types - Integers, Floating Point Types, Characters, Boolean. Literals, Type
Conversion and Casting, Variables, Arrays, Strings, Vector class.
Operators - Arithmetic Operators, Bitwise Operators, Relational Operators, Boolean Logical
Operators, Assignment Operator, Conditional (Ternary) Operator, Operator Precedence.
Control Statements - Selection Statements, Iteration Statements and Jump Statements.
Object Oriented Programming in Java - Class Fundamentals, Declaring Objects, Object
Reference, Introduction to Methods, Constructors, this Keyword, Method Overloading, Using
Objects as Parameters, Returning Objects, Recursion, Access Control, Static Members, Final
Variables, Inner Classes, Command Line Arguments, Variable Length Arguments.
Inheritance - Super Class, Sub Class, The Keyword super, protected Members, Calling Order of
Constructors, Method Overriding, the Object class, Abstract Classes and Methods, using final
with Inheritance.
Module 3
More features of Java:

Packages and Interfaces - Defining Package, CLASSPATH, Access Protection, Importing
Packages, Interfaces.
Exception Handling - Checked Exceptions, Unchecked Exceptions, try Block and catch Clause,
Multiple catch Clauses, Nested try Statements, throw, throws and finally.
Input/Output - I/O Basics, Reading Console Input, Writing Console Output, PrintWriter Class,
Object Streams and Serialization, Working with Files.
Module 4
Advanced features of Java:
Java Library - String Handling – String Constructors, String Length, Special String Operations -
Character Extraction, String Comparison, Searching Strings, Modifying Strings, using valueOf(),
Comparison of StringBuffer and String.
Collections framework - Collections overview, Collections Interfaces- Collection Interface, List
Interface.
Collections Class – ArrayList class. Accessing a Collection via an Iterator.
Event handling - Event Handling Mechanisms, Delegation Event Model, Event Classes, Sources
of Events, Event Listener Interfaces, Using the Delegation Model.
Multithreaded Programming - The Java Thread Model, The Main Thread, Creating Thread,
Creating Multiple Threads, Synchronization, Suspending, Resuming and Stopping Threads.
Module 5
Graphical User Interface and Database support of Java:

Swings fundamentals - Swing Key Features, Model View Controller (MVC), Swing Controls,
Components and Containers, Swing Packages, Event Handling in Swings, Swing Layout
Managers, Exploring Swings –JFrame, JLabel, The Swing Buttons, JTextField.
Java DataBase Connectivity (JDBC) - JDBC overview, Creating and Executing Queries – create
table, delete, insert, select.
Text Books:
1. Herbert Schildt, Java: The Complete Reference, 8/e, Tata McGraw Hill, 2011.
2. Rajib Mall, Fundamentals of Software Engineering, 4th edition, PHI, 2014.
3. Paul Deitel, Harvey Deitel, Java How to Program, Early Objects 11th Edition, Pearson,
2018.
Reference Books:
1. Y. Daniel Liang, Introduction to Java Programming, 7/e, Pearson, 2013.

2. Nageswararao R., Core Java: An Integrated Approach, Dreamtech Press, 2008.
3. Flanagan D., Java in A Nutshell, 5/e, O'Reilly, 2005.
4. Barclay K., J. Savage, Object Oriented Design with UML and Java, Elsevier, 2004.
5. Sierra K., Head First Java, 2/e, O'Reilly, 2005.
6. Balagurusamy E., Programming JAVA a Primer, 5/e, McGraw Hill, 2014.
Course Outcome1(CO1): For the following passage develop UML diagrams and then
implement it as a Java program in accordance with your UML design.
Passage: College Office collects semester fee and college bus fee for each student. A
clerk at the college office collects the fees from each student. The bus fee is calculated
depending on the distance of the corresponding bus stop from the college. The semester
fee varies depending upon the semester as well as branch of each student. Students are
supposed to pay the fees in full. Economically backward students are eligible for 50%
discount in semester fee. The consolidated fees receipt is issued to each student by the
clerk, which contains the student name, admission number, semester and branch of
student along with details of fees collected. Students can log in and view the details of
fees remitted and dues if any. The system allows students and clerk level login to the
system. Clerk is able to view reports of each class showing status of fees payment of
each student.
Course Outcome 2(CO2): Write a Java program to evaluate a post fix expression
containing two operands and a single operator using stack. Stack should be implemented
as a separate entity so as to reflect OOP concepts.
Course Outcome 3(CO3): Write a program to demonstrate the start, run, sleep and join
methods in Thread class.
Course Outcome 4(CO4): Write a GUI based program with separate buttons to add,
delete and display student details i.e. name, student ID, current semester and branch of
study based on student ID.
Course Outcome 5(CO5): Using Swing create a JFrame with a JLabel and two
JButtons. Set the texts of JButtons as “Yes” and “No” respectively. Set the JLabel’s text
to the text of the button currently being pressed. Initially the JLabel’s text is blank.
QP CODE: PAGES:3
Reg No:_______________
Name:_________________
Course Name: Object Oriented Programming using Java
PART A

1. Briefly explain the portable, secure and robust features of Java.
2. Describe the concepts of object and class with a suitable Java program.
3. Explain the concept of method overriding with an example.
4. What is the use of the keyword final in Java?
5. Explain the concept of streams.
6. Explain any two applications of Serialization.
7. Distinguish the usage of “==” and equals() method when comparing String type?
8. What are Collections in Java? Explain any one Collection interface in Java.
9. Explain any two properties of Swing components in Java.
10. Explain JLabel component. With suitable examples explain any two of its constructors.
Part B
Answer any one question completely from each module
11.
(a) Describe in detail any three Object Oriented Programming principles. Illustrate with
suitable examples.
(9)
(b) What is Java Runtime Environment? What is the role of Java Virtual Machine in it?
(5)
OR
12.
(a) Compare and contrast Java standard edition and Java enterprise edition.
(5)
(b) Why is Java considered to be platform independent? What is the role of Bytecode in
making Java platform independent?
(9)
13.
(a) Explain in detail the primitive data types in Java.
(8)
(b) Explain automatic type conversion in Java with an example. What are the two
conditions required for it?
(6)
OR
14.
(a) Using a suitable Java program explain the difference between private and public
members in the context of inheritance.
(8)
(b) Is it possible to use the keyword super within a static method? Give justification for
your answer.
(6)
15.
(a) Explain in detail about byte streams and character streams with suitable code
samples.
(6)
(b) Describe in detail about exception handling, try block and catch clause with the help
of a suitable Java program.
(8)
OR
16.
(a) Explain object streams in Java. Explain the role of Serializable interface with a
suitable code sample.
(8)
(b) Explain throw, throws and finally constructs with the help of a Java program.
(6)
17.
(a) Describe in detail the creation of a thread using the Runnable interface and the
Thread class with suitable examples.
(10)
(b) Explain List Interface. Mention any two exceptions thrown by its methods.
(4)
OR
18.
(a) Explain in detail the Delegation Event model for event handling in Java.
(7)
(b) Write a simple program by extending appropriate class to demonstrate the working of
threads in java.
(7)
19.
(a) Write a Java program to demonstrate the use of JLabel and JButton by adding them
to JFrame.
(7)
(b) Explain step-by-step procedure of using Java DataBase Connectivity in Java
programs.
(7)
OR
20.
(a) Explain the class hierarchy of Java Swing components.
(7)
(b) Write a Java Program to create a student table and to add student details to it using
JDBC.
(7)
Teaching Plan
Module 1 : Introduction (8 hours)
Approaches to Software Design- Functional Oriented Design, Object-

1.1 1 hour
Oriented Design, Case Study of Automated Fire Alarm System.
1.2 Object Modeling Using UML – Basic object oriented concepts 1 hour
1.3 Basic object oriented concepts 1 hour
1.4 UML diagrams, Use case model 1hour
1.5 Class diagram, Interaction diagram 1hour

1.6 Activity diagram, State chart diagram 1hour
Java programming Environment and Runtime Environment,

1.7 Development Platforms -Standard, Enterprise. JVM, Java compiler, 1hour
Bytecode
Java applet, Java Buzzwords, Java program structure, Comments,
1.8 1hour
Garbage Collection, Lexical Issues
Module 2: Core Java Fundamentals (11 hours)

Core Java Fundamentals: Primitive Data types, Integers, Floating
2.1 1 hour
Point Types, Characters, Boolean
Literals, Type Conversion and Casting, Variables, Arrays, Strings,

2.2 1 hour
Vector class.
Operators: Arithmetic Operators, Bitwise Operators, Relational
2.3 Operators, Boolean Logical Operators, Assignment Operator, 1 hour
Conditional (Ternary) Operator, Operator Precedence.
Control Statements: Selection Statements, Iteration Statements and

2.4 1 hour
Jump Statements.
Object Oriented Programming in Java: Class Fundamentals, Declaring
2.5 1 hour
Objects, Object Reference, Introduction to Methods
Constructors, this Keyword, Method Overloading, Using Objects as

2.6 1 hour
Parameters
2.7 Returning Objects, Recursion, Access Control, static Members 1 hour
Final Variables, Inner Classes, Command-Line Arguments, Variable

2.8 1 hour
Length Arguments
Inheritance : Super class, Sub class, the keywords super, protected
2.9 1 hour
Members,
2.10 Calling Order of Constructors, Method Overriding, the Object class, 1 hour
2.11 Abstract Classes and Methods, Using final with Inheritance 1 hour
Module 3: More features of Java (8 hours)

Packages and Interfaces: Defining Package, CLASSPATH, Access
3.1 1 hour
Protection, Importing Packages
3.2 Interfaces 1 hour

Input / Output: I/O Basics, Reading Console Input, Writing Console
3.3 1 hour
Output, PrintWriter Class
3.4 Object Streams and Serialization 1 hour
3.5 Working with Files 1 hour
Exception Handling: Checked Exceptions, Unchecked Exceptions, try

3.6 1 hour
Block and catch Clause
3.7 Multiple catch Clauses, Nested try Statements 1 hour
3.8 throw, throws and finally 1 hour
Module 4:Advanced features of Java (10 hours)
Java Library: String Handling – String Constructors, String Length,

4.1 1hour
Special String Operations
Character Extraction, String Comparison, Searching Strings,
4.2 Modifying Strings Using valueOf( ), Comparison of String Buffer 1hour
and String.
Collections framework – Collections overview, Collections Interfaces-

4.3 1hour
Collection Interface
4.4 List Interface, Collections Class – ArrayList Class 1hour
4.5 Accessing Collections via an Iterator. 1hour

Event handling: Event Handling Mechanisms, Delegation Event
4.6 1hour
Model
4.7 Delegation Event Model, Event Classes 1hour

Sources of Events, Event Listener Interfaces, Using the Delegation

4.8 1hour
Model
Multithreaded Programming: The Java Thread Model, The Main
4.9 1hour
Thread, Creating Thread
Creating Multiple Threads, Synchronization, Suspending, Resuming

4.10 1hour
and Stopping Threads.
Module 5: Graphical User Interface and Database support of Java (8 hours)
5.1 Swings fundamentals, Swing Key Features 1hour

5.2 MVC, Swing Controls, Components and Containers 1hour
5.3 Swing Packages, Event Handling in Swings. 1 hour

5.4 Swing Layout Managers 1hour
5.5 Exploring Swings –JFrame, JLabel, The Swing Buttons, JTextField. 1 hour
JDBC overview, Creating and Executing Queries – create table,
5.6 1hour
delete, insert, select (Basics only, DBMS course is not a prerequisite).
5.7 Creating and Executing Queries – create table, delete, insert, select. 1 hour
5.8 Creating and Executing Queries – create table, delete, insert, select. 1 hour
YEAR OF
DATA STRUCTURES CATEGORY L T P CREDIT INTRODUCTION
CSL 201
LAB
PCC 0 0 3 2 2019
Preamble: The aim of the Course is to give hands-on experience for Learners on creating and
using different Data Structures. Data Structures are used to process data and arrange data in
different formats for many applications. The most commonly performed operations on data
structures are traversing, searching, inserting, deleting and few special operations like merging
and sorting.
Write a time/space efficient program using arrays/linked lists/trees/graphs to provide

CO1 necessary functionalities meeting a given set of user requirements (Cognitive
Knowledge Level: Analyse)
Write a time/space efficient program to sort a list of records based on a given key in
CO2
the record (Cognitive Knowledge Level: Apply)
Examine a given Data Structure to determine its space complexity and time
CO3
complexities of operations on it (Cognitive Knowledge Level: Apply)
CO4 Design and implement an efficient data structure to represent given data (Cognitive
Knowledge Level: Apply)
Write a time/space efficient program to convert an arithmetic expression from one

CO5
notation to another (Cognitive Knowledge Level: Apply)
Write a program using linked lists to simulate Memory Allocation and Garbage
CO6
Collection (Cognitive Knowledge Level: Apply)
CO1
CO2
CO3
CO4
CO5
CO6

problems

Assessment Pattern
Continuous Assessment Test End Semester

Bloom’s Category
(Internal Exam)Percentage Examination Percentage
Remember 20 20
Understand 20 20
Apply 60 60
Analyse
Evaluate
Create
Mark Distribution

150 75 75 3 hours
Continuous Evaluation in Lab : 30 marks
Viva-voce : 15 marks
Internal Examination Pattern: The marks will be distributed as Algorithm 30 marks, Program
20 marks, Output 20 marks and Viva 30 marks. Total 100 marks which will be converted out of
15 while calculating Internal Evaluation marks.
End Semester Examination Pattern: The marks will be distributed as Algorithm 30 marks,
Program 20 marks, Output 20 marks and Viva 30 marks. Total 100 marks will be converted out
of 75 for End Semester Examination.
Operating System to Use in Lab : Linux
Compiler/Software to Use in Lab : gcc
Programming Language to Use in Lab : Ansi C
Fair Lab Record:

All Students attending the Data Structures Lab should have a Fair Record. The fair record should
be produced in the University Lab Examination. Every experiment conducted in the lab should
be noted in the fair record. For every experiment in the fair record the right hand page should
contain Experiment Heading, Experiment Number, Date of Experiment, Aim of Experiment,
Data Structure used and the operations performed on them, Details of Experiment including
algorithm and Result of Experiment. The left hand page should contain a print out of the code
used for the experiment and sample output obtained for a set of input.
SYLLABUS
1. Implementation of Polynomials and Sparse matrices using arrays**

2. Implementation of Stack , Queues, Priority Queues, DEQUEUE and Circular Queues
using arrays**
3. Application problems using stacks: Conversion of expression from one notation to

another notation . **
4. Implementation of various linked list operations. **
5. Implementation of stack, queue and their applications using linked list.pression
6. Implementation of trees using linked list
7. Representation of polynomials using linked list, addition and multiplication of

polynomials. **
8. Implementation of binary trees using linked lists and arrays- creations, insertion, deletion
and traversal. **
9. Implementation of binary search trees – creation, insertion, deletion, search
10. Any application programs using trees
11. Implementation of sorting algorithms – bubble, insertion, selection, quick, merge sort
and heap sort.**
12. Implementation of searching algorithms – linear search, binary search.**
13. Representation of graphs and computing various parameters (in degree, out degree etc.) -
adjacency list, adjacency matrix.
14. Implementation of BFS and DFS for each graph representations.**
15. Implementation of hash table using your own mapping functions and observe collisions
and overflow resolving schemes.**
16. Simulation of first-fit, best-fit and worst-fit allocations.
17. Simulation of a basic memory allocator and garbage collector using doubly linked list.
** mandatory.
DATA STRUCTURES LAB - PRACTICE QUESTIONS
1. Write a program to read two polynomials and store them in an array. Calculate the sum of the
two polynomials and display the first polynomial, second polynomial and the resultant
polynomial.
2. C Write a program to enter two matrices in normal form . Write a function to convert two
matrices to tuple form and display it. Also find the transpose of the two matrices represented
in tuple form and display it. Find the sum of the two matrices in tuple form and display the
sum in tuple form.
3. Write a program to enter two matrices in normal form . Write a function to convert two
matrices to tuple form and display it. Also find the transpose of the two matrices represented
in tuple form and display it. Find the sum of the two matrices in tuple form and display the
sum in tuple form.
4. Implement a circular queue using arrays with the operations:

4.1.Insert an element to the queue.
4.2.Delete an elements from the queue.
4.3.Display the contents of the queue after each operation.
5. Implement a Queue using arrays with the operations:

5.1.Insert elements to the Queue.

5.2.Delete elements from the Queue.
5.3.Display the contents of the Queue after each operation.
6. Implement a Stack using arrays with the operations:

6.1.Pushing elements to the Stack.
6.2.Popping elements from the Stack
6.3.Display the contents of the Stack after each operation.
7. Implement a Priority Queue using arrays with the operations:

7.1.Insert elements to the Priority Queue.
7.2.Delete elements from the Priority Queue.
7.3.Display the contents of the Priority Queue after each operation.
8. Implement a Double-Ended Queue (DEQUEUE) with the operations:

8.1.Insert elements to the Front of the queue.
8.2.Insert elements to the Rear of the queue
8.3.Delete elements from the Front of the queue.
8.4.Delete elements from the Rear of the queue.
8.5.Display the queue after each operation.
9. Using stack convert an infix expression to a postfix expression and evaluate the postfix
expression.
10. Write a program to convert an infix expression to a prefix expression using stacks.
11. Convert an infix expression to a postfix expression without using a stack
12. Write a menu driven program for performing the following operations on a Linked List:
12.1.Display
12.2.Insert at Beginning
12.3.Insert at End
12.4.Insert at a specified Position
12.5.Delete from Beginning
12.6.Delete from End
12.7.Delete from a specified Position
13. Implement a stack using linked list with the operations:

13.1.Push elements to the queue.
13.2.Pop elements from the queue.
14. Implement a Queue using linked list with the operations:

14.1.Insert an elements to the queue.

14.2.Delete an elements from the queue.
15. Write a program to reverse the content of queue using stack
16. Write a program to read two polynomials and store them using linked list. Calculate the sum
of the two polynomials and display the first polynomial, second polynomial and the resultant
polynomial.
17. Write a program to read two polynomials and store them using linked list. Find the product
of two polynomials and store the result using linked list. Display the resultant polynomial.
18. Write a program for addition of polynomials containing two variables using linked list.
19. The details of students(number, name, total-mark) are to be stored in a linked list. Write
functions for the following operations:
19.1.Insert
19.2.Delete
19.3.Search
19.4.Sort on the basis of number
19.5.Display the resultant list after every operation
20. Create a Doubly Linked List from a string taking each character from the string. Check if the
given string is palindrome in an efficient method.
21. Create a binary tree with the following operations

21.1.Insert a new node
21.2.Inorder traversal.
21.3.Preorder traversal.
21.4.Postorder traversal.
21.5.Delete a node.
22. Write a program to create a binary search tree and find the number of leaf nodes
23. Create a binary search tree with the following operations:

23.1.Insert a new node .
23.2.Inorder traversal.
23.3.Preorder traversal.
23.4.Postorder traversal.
23.5.Delete a node.
24. Write a program to sort a set of numbers using a binary tree.
25. Represent any given graph and

25.1.Perform a depth first search .
25.2.Perform a breadth first search
26. Create a text file containing the name, height, weight of the students in a class. Perform
Quick sort and Merge sort on this data and store the resultant data in two separate files. Also
write the time taken by the two sorting methods into the respective files.
Eg. Sony Mathew 5.5 60
Arun Sajeev 5.7 58
Rajesh Kumar 6.1 70
27. Write a program to sort a set of numbers using Heap sort and find a particular number from
the sorted set using Binary Search.
28. Implement a Hash table using Chaining method. Let the size of hash table be 10 so that the
index varies from 0 to 9.
29. Implement a Hash table that uses Linear Probing for collision resolution
OBJECT ORIENTED YEAR OF

CSL CATEGORY L T P CREDIT
PROGRAMMING INTRODUCTION
203
LAB (IN JAVA)
PCC 0 0 3 2 2019
Preamble: The aim of the course is to provide hands-on experience to the learners on various
object oriented concepts in Java Programming. This course helps the learners to enhance the ca-
pability to design and implement various Java applications for real world problems.
Course Outcomes:
At the end of the course, the student should be able to
Implement the Object Oriented concepts - constructors, inheritance, method

CO1 overloading & overriding and polymorphism in Java (Cognitive Knowledge Level:
Apply)
Implement programs in Java which use datatypes, operators, control statements,
CO2 built in packages & interfaces, Input/Output streams and Files (Cognitive
Implement robust application programs in Java using exception handling
CO3
Implement application programs in Java using multithreading and database
CO4
connectivity (Cognitive Knowledge Level: Apply)
Implement Graphical User Interface based application programs by utilizing event

CO5
CO1 ! ! ! ! ! ! ! !
CO2 ! ! ! ! ! ! ! !
CO3 ! ! ! ! ! ! ! !
CO4 ! ! ! ! ! ! ! !
CO5 ! ! ! ! ! ! ! !


problems
Assessment Pattern
Bloom’s Category Test - Internal Exam
(Percentage)
(Percentage)
Remember 20 20
Understand 20 20
Apply 60 60
Analyse
Evaluate
Create
Mark Distribution
150 75 75 3 hours
Internal Examination Pattern: The marks will be distributed as Algorithm 30 marks, Pro-
gram 20 marks, Output 20 marks and Viva 30 marks. Total 100 marks which will be con-
verted out of 15 while calculating Internal Evaluation marks.
End Semester Examination Pattern: The marks will be distributed as Algorithm 30

marks, Program 20 marks, Output 20 marks and Viva 30 marks. Total 100 marks will be
converted out of 75 for End Semester Examination.
Compiler/Software to Use in Lab : gcc, javac, jdk, jre, Eclipse, NetBeans,

MySQL / PostgreSQL.
Programming Language to Use in Lab : Java
Fair Lab Record:

All Students attending the Object Oriented Programming Lab (in Java) should have a Fair
Record. The fair record should be produced in the University Lab Examination. Every experi-
ment conducted in the lab should be noted in the fair record. For every experiment in the fair
record the right hand page should contain Experiment Heading, Experiment Number, Date of
Experiment, Aim of Experiment, Operations Performed, Details of Experiment including algo-
rithm and Result of Experiment. The left hand page should contain a print out of the code used
for the experiment and sample output obtained for a set of input.
SYLLABUS
The syllabus contains six sessions (A, B, C, D, E, F). Each session consists of three concrete
Java exercises, out of which at least two questions are mandatory.
(A) Basic programs using datatypes, operators, and control statements in Java.
1) Write a Java program that checks whether a given string is a palindrome or not.
Ex: MALAYALAM is palindrome.
2) Write a Java Program to find the frequency of a given character in a string. **
3) Write a Java program to multiply two given matrices. **
(B) Object Oriented Programming Concepts: Problem on the use of constructors, inheritance,
method overloading & overriding, polymorphism and garbage collection:
4) Write a Java program which creates a class named 'Employee' having the following
members: Name, Age, Phone number, Address, Salary. It also has a method named 'print-
Salary( )' which prints the salary of the Employee. Two classes 'Officer' and 'Manager'
inherits the 'Employee' class. The 'Officer' and 'Manager' classes have data members 'spe-
cialization' and 'department' respectively. Now, assign name, age, phone number, address
and salary to an officer and a manager by making an object of both of these classes and
print the same. (Exercise to understand inheritance). **
5) Write a java program to create an abstract class named Shape that contains an empty
method named numberOfSides( ). Provide three classes named Rectangle, Triangle and
Hexagon such that each one of the classes extends the class Shape. Each one of the class-
es contains only the method numberOfSides( ) that shows the number of sides in the giv-
en geometrical structures. (Exercise to understand polymorphism). **
6) Write a Java program to demonstrate the use of garbage collector.
(C) Handling different types of files as well as input and output management methods:
7) Write a file handling program in Java with reader/writer.

8) Write a Java program that read from a file and write to file by handling all file related ex-
ceptions. **
9) Write a Java program that reads a line of integers, and then displays each integer, and the
sum of all the integers (Use String Tokenizer class of java.util). **
(D) Exception handling and multi-threading applications:

10) Write a Java program that shows the usage of try, catch, throws and finally. **
11) Write a Java program that implements a multi-threaded program which has three threads.
First thread generates a random integer every 1 second. If the value is even, second
thread computes the square of the number and prints. If the value is odd the third thread
will print the value of cube of the number.
12) Write a Java program that shows thread synchronization. **
(E) Graphics Programming:
13) Write a Java program that works as a simple calculator. Arrange Buttons for digits and
the + - * % operations properly. Add a text field to display the result. Handle any possible
exceptions like divide by zero. Use Java Swing. **
14) Write a Java program that simulates a traffic light. The program lets the user select one of
three lights: red, yellow, or green. When a radio button is selected, the light is turned on,
and only one light can be on at a time. No light is on when the program starts. **
15) Write a Java program to display all records from a table using Java Database Connectivi-
ty (JDBC).
(F) Standard Searching and Sorting Algorithms using data structures and algorithms learned
from course Data Structures (CST 201):
16) Write a Java program for the following: **

1) Create a doubly linked list of elements.
2) Delete a given element from the above list.
3) Display the contents of the list after deletion.
17) Write a Java program that implements Quick sort algorithm for sorting a list of names in
ascending order. **
18) Write a Java program that implements the binary search algorithm.
** Mandatory
PRACTICE QUESTIONS
1) Write a Java program to reverse an given string.

2) Write a Java program to display the transpose of a given matrix.
3) Write a Java program to find the second smallest element in an array.
4) Write a Java program to check whether a given number is prime or not.
5) Write a Java program to calculate the area of different shapes namely circle, rectangle,
and triangle using the concept of method overloading.
6) Write two Java classes Employee and Engineer. Engineer should inherit from Employee
class. Employee class to have two methods display() and calcSalary(). Write a program to
display the engineer salary and to display from Employee class using a single object in-
stantiation (i.e., only one object creation is allowed).
● display() only prints the name of the class and does not return any value. Ex. “ Name
of class is Employee.”
● calcSalary() in Employee displays “Salary of employee is 10000” and calcSalary() in
Engineer displays “Salary of employee is 20000.”
7) Write a Java program to illustrate Interface inheritance.
8) Write a Java program that shows how to create a user-defined exception.
9) Write a Java program to create two threads: One for displaying all odd number between 1
and 100 and second thread for displaying all even numbers between 1 and 100.
10) Write a Java program that shows thread priorities.
11) Write a Java program that reads a file and displays the file on the screen, with a line
number before each line.
12) Write a Java program that displays the number of characters, lines and words in a text
file.
13) Write a Java program for handling mouse events.
14) Write a Java program for handling key events using Adapter classes (general).
15) Write a Java program that allows the user to draw lines, rectangles and ovals.
16) Write a Java Swing program to print a wave form on the output screen.
17) Write a program to accept rollno, name, CGPA of “n” students and store the data to a
database using JDBC connectivity. Display the list of students having CGPA greater than
7. (Use MySQL /PostgreSQL).
18) Write a Java program to implement Heap sort algorithm using array.
SEMESTER -3
MINOR
YEAR OF
CST OBJECT ORIENTED CATEGORY L T P CREDIT
INTRODUCTION
281 PROGRAMMING
MINOR 3 1 0 4 2019
Preamble: This is the programming course for awarding B.Tech. Minor in Computer Science
and Engineering with specialization in Software Engineering. The purpose of this course is to
enable learners to solve problems by breaking it down to object level while designing software
and to implement it using Java. This course covers Object Oriented Principles, Object Oriented
Programming in Java, Inheritance, Exception handling, Event handling, multithreaded
programming and working with window-based graphics. This course helps the learners to
develop Mobile applications, Enterprise Applications, Scientific Applications and Web based
Applications.
Prerequisite: Topics covered under the course PROGRAMMING IN C (EST 102)
Write Java programs using the object oriented concepts - classes, objects,
Level: Apply)
Utilise datatypes, operators, control statements, built in packages & interfaces, Input/
CO2 Output Streams and Files in Java to develop programs (Cognitive Knowledge Level:
Apply)
CO3
mechanism (Cognitive Knowledge Level: Understand)
Write application programs in Java using multithreading (Cognitive Knowledge
CO4
Level: Apply)
Write Graphical User Interface based application programs by utilising event

CO5
Mapping of course outcomes with program outcome
CO1
CO2
CO3
CO4
CO5


problems
Assessment Pattern

Bloom’s Category
Test1 (Marks %) Test2 (Marks %) Marks (% )
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyse
Evaluate
Create
Mark Distribution
150 50 100 3 hours
the second series test shall be preferably conducted after completing remaining part of the
syllabus.
End Semester Examination Pattern: There will be two parts; Part A and Part B. Part A contains
should answer all questions. Part B contains 2 questions from each module of which a student
should answer any one. Each question can have maximum 2 sub-divisions and carry 14 marks.
SYLLABUS
Object Oriented Programming Using Java
Module 1
Introduction:
Approaches to Software Design - Functional Oriented Design, Object Oriented Design, Case
Study of Automated Fire Alarm System.
Object Modeling Using UML – Basic Object Oriented concepts, UML (Unified Modeling
Language) diagrams, Use case model, Class diagram, Interaction diagram, Activity diagram,
State chart diagram.
Module 2
Core Java Fundamentals:

Objects as Parameters, Returning Objects, Recursion, Access Control, Static Members, Final
Variables, Inner Classes, Command-Line Arguments, Variable Length Arguments.
Module 3
More features of Java:

Constructors, Method Overriding, the Object class, Abstract Classes and Methods, Using final
with Inheritance.

Module 4
Advanced features of Java:
Object Streams and Serialization, Reading and Writing Files.
Character Extraction, String Comparison, Searching Strings, Modifying Strings, Using
valueOf(), Comparison of StringBuffer and String.
Collections framework – Collections overview, Collections Class – ArrayList. Accessing
Collections via an Iterator.
Module 5
GUI Programming, Event Handling and Multithreaded Programming:

Swing fundamentals - Swing Key Features, Model View Controller (MVC), Swing Controls,
Components and Containers, Exploring Swing - JFrame, JLabel, JButton, JTextField.
Event handling - Event Handling Mechanisms, Delegation Event Model, Event Classes, Sources
Creating Multiple Threads, Suspending, Resuming and Stopping Threads.
Text Books:
2. Rajib Mall, Fundamentals of Software Engineering, 4th edition, PHI, 2014.
3. Paul Deitel, Harvey Deitel, Java How to Program, Early Objects 11th Edition, Pearson,
2018.
Reference Books:

4. Barclay K., J. Savage, Object Oriented Design with UML and Java, Elsevier, 2004.
Course Outcome1(CO1): For the following passage develop UML diagrams and then
implement it as a Java program in accordance with your UML design.
Passage: College Office collects semester fee and college bus fee for each student. A
clerk at the college office collects the fees from each student. The bus fee is calculated
depending on the distance of the corresponding bus stop from the college. The semester
fee varies depending upon the semester as well as branch of each student. Students are
supposed to pay the fees in full. Economically backward students are eligible for 50%
discount in semester fee. The consolidated fees receipt is issued to each student by the
clerk, which contains the student name, admission number, semester and branch of
student along with details of fees collected. Students can log in and view the details of
fees remitted and dues if any. The system allows students and clerk level login to the
system. Clerk is able to view reports of each class showing status of fees payment of
each student.
Course Outcome 2 (CO2): Write a Java program to prepare the rank list of students
based one their performance in the first Semester B.Tech. Degree examination at APJ
Abdul Kalam Technological University. The output should be stored in a file.
Course Outcome 3 (CO3): Write a program to demonstrate how event handling and
exception handling are supported in Java..
Course Outcome 4 (CO4): Write a program to demonstrate the start, run, sleep and join
methods in Thread class..
QP CODE: PAGES:3
Reg No:_______________
Name:_________________
THIRD SEMESTER B.TECH (MINOR) DEGREE EXAMINATION, MONTH & YEAR
Course Name: Object Oriented Programming using Java
PART A

1. Briefly explain why Java is considered to be secure and portable.
2. Describe the concept of association among classes with an example.
3. Explain the different arithmetic operators in Java.
4. Explain the use for command line arguments with a suitable Java program
5. Explain the use of CLASSPATH with an example.
6. What are the different types of exceptions?
7. Explain file handling features available in Java.
8. Write a simple program to read and print an integer value in Java.
9. Explain the concept of main thread in multi-threading.
10. Explain any two Event classes in Java.
Part B
Answer any one question completely from each module
11.
(a) Describe in detail polymorphism, abstraction and inheritance with suitable examples.
(9)
(b) What is Java Virtual Machine?
(5)
OR
12.
(a) Compare and contrast Functional Oriented and Object Oriented approach by
considering a simple bus ticket reservation system.
(5)
(b) What is a class diagram? Explain with an example.
(9)
13.
(a) Explain primitive data types in Java. How are they different from other data types?
(8)
(b) Explain variables and arrays in Java.
(6)
OR
14.s
(a) Using a suitable Java program explain the concept of methods and constructors.
(8)
(b) Explain the keyword super and its usage in Java.
(6)
15.
(a) Using a table, explain the effect of access specifiers in inheritance.
(6)
(b) Describe in detail about exception handling using try block and catch clause in Java
with the help of a suitable Java program.
(8)
OR
16.
(a) What is an interface in Java? Explain with a suitable example.
(8)
(b) Explain throw, throws and finally constructs with the help of a Java program.
(6)
17.
(a) Explain ArrayList collections framework. Also explain the use of iterator in
accessing collections.
(8)
(b) Bring out difference between “==” and equals() method with the help of a sample
program
(6)
OR
18.
(a) Compare Byte Streams and Character Streams. Write a program to demonstrate the
usage of the PrintWriter class.
(8)
(b) Explain any three String constructors with the help of sample code for each.
(6)
19.
(a) Explain in detail the Delegation Event model for event handling in Java.
(7)
(b) Describe in detail the creation of a thread using the Runnable interface.
(7)
OR
20.
(a) What are the differences between a process and a thread?
(4)
(b) Write a Graphical User Interface (GUI) based Java program to implement a simple
calculator supporting the operations addition, subtraction, multiplication and
division. Use Swing controls to implement GUI. There may be three text boxes, the
first two for operands and the last for result. Add four buttons for the above
operations. Write neat comments in your program to show how you handle events.
(10)
Teaching Plan
Module 1 (Introduction) (8 hours)
Approaches to Software Design- Functional Oriented Design,

1.1 Object-Oriented Design, Case Study of Automated Fire Alarm 1 hour
System.
1.2 Object Modeling Using UML – Basic object oriented concepts 1 hour
1.3 Basic object oriented concepts 1 hour
1.4 UML diagrams, Use case model 1hour
1.5 Class diagram, Interaction diagram 1hour

1.6 Activity diagram, State chart diagram 1hour

1.7 Development Platforms -Standard, Enterprise. JVM, Java compiler, 1hour
Bytecode
Java applet, Java Buzzwords, Java program structure, Comments,
1.8 1hour
Garbage Collection, Lexical Issues
Module 2 (Core Java Fundamentals) (12 hours)

Primitive Data types - Integers, Floating Point Types, Characters,
2.1 1 hour
Boolean
Literals, Type Conversion and Casting, Variables, Arrays, Strings,

2.2 1 hour
Vector class.
Operators - Arithmetic Operators, Bitwise Operators, Relational
Control Statements - Selection Statements, Iteration Statements and

2.4 1 hour
Jump Statements.
Object Oriented Programming in Java - Class Fundamentals,
2.5 1 hour
Declaring Objects
2.6 Object Reference, Introduction to Methods 1 hour

2.7 Constructors, this Keyword 1 hour
2.8 Method Overloading, Using Objects as Parameters 1 hour

2.9 Returning Objects, Recursion 1 hour

2.10 Access Control, static Members 1 hour
2.11 Final Variables, Inner Classes 1 hour

2.12 Command-Line Arguments, Variable Length Arguments 1 hour
Module 3 (More features of Java) (8 hours)

Inheritance - Super class, Sub class, the keyword super, protected
3.1 1 hour
Members,
3.2 Calling Order of Constructors, Method Overriding, the Object class, 1 hour
Packages and Interfaces - Defining Package, CLASSPATH, Access

3.4 1 hour
Protection, Importing Packages
Exception Handling - Checked Exceptions, Unchecked Exceptions,

3.6 1 hour
try Block and catch Clause

Module 4 (Advanced features of Java) (8 hours)
4.1 Input/Output - I/O Basics, Reading Console Input 1hour

4.2 Writing Console Output, PrintWriter Class 1hour
4.3 Object Streams and Serialization 1hour

4.4 Serialization, Working with Files 1hour
4.5 Working with Files 1hour

Java Library - String Handling – String Constructors, String Length,
4.6 1hour
Special String Operations
Character Extraction, String Comparison, Searching Strings,

4.7 Modifying Strings Using valueOf( ), Comparison of StringBuffer 1hour
and String.
Collections framework – Collections overview, Collections Class –
4.8 1hour
ArrayList. Accessing Collections via an Iterator.
Module 5 (GUI Programming, Event Handling and Multithreaded

(9 hours)
Programming)
5.1 Swings fundamentals, Swing Key Features
5.2 MVC, Swing Controls, Components and Containers

5.3 Exploring Swing –JFrame, JLabel, JButton, JTextField.
Event handling - Event Handling Mechanisms, Delegation Event

5.4 1hour
Model
5.5 Delegation Event Model, Event Classes 1hour
Sources of Events, Event Listener Interfaces, Using the Delegation

5.6 1hour
Model
Multithreaded Programming - The Java Thread Model, The Main
5.7 1hour
Thread, Creating Thread
5.8 Creating Multiple Threads 1hour

5.9 Suspending, Resuming and Stopping Threads. 1hour
Year of
CST Python for Machine Category L T P Credit
Introduction
283 Learning
MINOR 3 1 0 4 2019
Preamble: This is a programming course for awarding B. Tech. Minor in Computer Science and
Engineering with specialization in Machine Learning. The objective of the course is to provide
learners an insight into Python programming, and develop programming skills to manage the
development of software systems. It covers programming environment, important instructions,
data representations, intermediate level features, Object Oriented Programming and file data
processing of Python. This course lays the foundation to develop web applications, Machine
Learning, and Artificial Intelligence-based applications and tools, Data Science and Data
Visualization applications.
Prerequisite: Nil
CO1 Write, test and debug Python programs (Cognitive Knowledge level: Apply)
Illustrate uses of conditional (if, if-else, if-elif-else and switch-case) and iterative
CO2
(while and for) statements in Python programs (Cognitive Knowledge level: Apply)
Develop programs by utilizing the modules Lists, Tuples, Sets and Dictionaries in
CO3
Python (Cognitive Knowledge level: Apply)
Implement Object Oriented programs with exception handling (Cognitive Knowledge

CO4
level: Apply)
Write programs in Python to process data stored in files by utilizing the modules
CO5
Numpy, Matplotlib, and Pandas (Cognitive Knowledge level: Apply)
CO1 ✔ ✔ ✔ ✔ ✔ ✔
CO2 ✔ ✔ ✔ ✔ ✔ ✔
CO3 ✔ ✔ ✔ ✔ ✔ ✔ ✔
CO4 ✔ ✔ ✔ ✔ ✔ ✔
CO5 ✔ ✔ ✔ ✔ ✔ ✔ ✔
#PO Broad PO #PO Broad PO


problems

Assessment Pattern
End Semester
Test 1 (Marks in Test 2 (Marks
Bloom’s Category Examination (Marks in
percentage) in percentage)
percentage)
Remember 20 20 20
Understand 35 35 35
Apply 45 45 45
Analyse
Evaluate
Create
Mark Distribution

150 50 100 3

Each of the two internal examinations has to beCOMPUTER
conducted out ofSCIENCE AND
50 marks. The firstENGINEERING
series test
shall be preferably conducted after completing the first half of the syllabus and the second series
test shall be preferably conducted after completing the remaining part of the syllabus. There will
be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from
the completed modules and 1 question from the partly completed module), having 3 marks for
each question adding up to 15 marks for part A. Students should answer all questions from Part
A. Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1

can have a maximum of 2 sub-divisions and carries 14 marks.
SYLLABUS
Module I
Programming Environment and Python Basics:
Getting Started with Python Programming - Running code in the interactive shell, Editing,
Saving, and Running a script. Using editors - IDLE, Jupyter. The software development process
- Case Study.
Basic coding skills - Working with data types, Numeric data types and Character sets, Keywords,
Variables and Assignment statement, Operators, Expressions, Working with numeric data, Type
conversions, Comments in the program. Input, Processing, and Output. Formatting output. How
Python works. Detecting and correcting syntax errors. Using built in functions and modules in
math module.
Module II
Building Python Programs:
Control statements - Selection structure (if-else, switch-case), Iteration structure(for, while),
Testing the control statements, Lazy evaluation. Functions - Hiding redundancy and complexity,
Arguments and return values, Variable scopes and parameter passing, Named arguments, Main
function, Working with recursion, Lambda functions. Strings and number systems - String
function, Handling numbers in various formats.
Module III
Data Representation:
Lists - Basic list Operations and functions, List of lists, Slicing, Searching and sorting list, List
comprehension. Work with tuples. Sets. Work with dates and times. Dictionaries - Dictionary
COMPUTER
functions, dictionary literals, adding and removing SCIENCE
keys, accessing and AND ENGINEERING
replacing values,
traversing dictionaries, reverse lookup. Case Study - Data Structure Selection.
Module IV
Object Oriented Programming:
Design with classes - Objects and Classes, Methods, Instance Variables, Constructor, Accessors
and Mutators. Structuring classes with Inheritance and Polymorphism. Abstract Classes.
Exceptions - Handle a single exception, handle multiple exceptions.
Module V
Data Processing:
The os and sys modules. Introduction to file I/O - Reading and writing text files, Manipulating
binary files. NumPy - Basics, Creating arrays, Arithmetic, Slicing, Matrix Operations, Random
numbers. Plotting and visualization. Matplotlib - Basic plot, Ticks, Labels, and Legends.
Working with CSV files. – Pandas - Reading, Manipulating, and Processing Data.
Text Books:
1. Kenneth A Lambert., Fundamentals of Python : First Programs, 2/e, Cengage Publishing,
2016
2. Wes McKinney, Python for Data Analysis, 2/e, Shroff / O’Reilly Publishers, 2017
Reference Books:
1. Allen B. Downey, Think Python: How to Think Like a Computer Scientist, 2/e, Schroff,
2016
2. Michael Urban and Joel Murach, Python Programming, Shroff/Murach, 2016
3. David M.Baezly, Python Essential Reference. Addison-Wesley Professional; 4/e, 2009.
4. Charles Severance. Python for Informatics: Exploring Information,
5. http://swcarpentry.github.io/python-novice-gapminder/
Course Outcome1(CO1): What is type conversion? How is it done in Python?
Course Outcome 2(CO2): Write a Python program which takes a positive integer n as input
and finds the sum of cubes all positive even numbers less than or equal to the number.
Course Outcome 3(CO3): Given is a list of of words, wordlist, and a string, name. Write a
Python function which takes wordlist and name as input and returns a tuple. The first element of
COMPUTER
the output tuple is the number of words in the wordlist SCIENCE
which have AND ENGINEERING
name as a substring in it. The
second element of the tuple is a list showing the index at which the name occurs in each of the
words of the wordlist and a 0 if it doesn’t occur.
Course Outcome 4(CO4): Write a Python program to implement the addition, subtraction, and
multiplication of complex numbers using classes. Use constructors to create objects. The input to
the program consist of real and imaginary parts of the complex numbers.
Course Outcome 5(CO5): Given a file “auto.csv” of automobile data with the fields index,
company, body-style, wheel-base, length, engine-type, num-of-cylinders, horsepower, average-
mileage, and price, write python code to
1) Clean and Update the CSV file
2) Print total cars of all companies
3) Find the average mileage of all companies
4) Find the highest priced car of all companies.
QP CODE: PAGES:
Reg No:_______________
Name:_________________

THIRD SEMESTER B.TECH (MINOR) DEGREE EXAMINATION, MONTH & YEAR

Course name : PYTHON FOR MACHINE LEARNING
PART-A
1. Explain the basic data types available in Python, with examples.

Write a Python program to reverse a number and also find the sum of digits of the
2.
number. Prompt the user for input.
Explain the concept of scope and lifetime of variables in Python programming language,
3.
with a suitable example.
4. Discuss format specifiers and escape sequences with examples.
5. Discuss the relation between tuples, lists, and dictionaries in detail.
Discuss the following dictionary methods with an example.
6.
i. get( ) ii. Keys( ) iii. pop( ) iv. update( ) v. values( ) vi. items( )
7. What is polymorphism? Give an example in the context of OOP in Python.
8. How is exception handling accomplished in Python programs?
Write a note on the os and os.path modules in Python. Also, discuss the walk( ) and
9.
getcwd( ) methods of the os module.
10. Describe the characteristics of the CSV format.
PART-B
(Answer any one full question from each module)
11. (a) Compare and contrast interpreted languages and compiled languages. (6)
How does it affect the quality of program development and execution
of the program?
(b) What are the possible errors in a Python program. Write a Python (8)
program to print the value of 22n+n+5 for n provided by the user.
OR
12. (a) Describe Arithmetic operators, Assignment operators, Comparison (6)
operators, Logical operators, and Bitwise operators in detail with examples.
(b) Explain the software development process in detail. (8)
13. (a) Write a Python code to check whether a given year is a leap year or not [An (5)
year is a leap year if it’s divisible by 4 but not divisible by 100 except for
those divisible by 400].
(b) Input 4 integers (+ve and −ve). Write a Python code to find the sum of (9)
negative numbers, positive numbers, and print them. Also, find the
averages of these two groups of numbers and print.
OR
14. (a) Write a Python program to find the value for sin(x) up to n terms using the (8)
series
where x is in degrees
(b) Write a Python code to determine whether the given string is a Palindrome (6)
or not using slicing. Do not use any string function.
15. (a) Write a Python code to create a function called list_of_frequency that takes (5)
a string and prints the letters in non-increasing order of the frequency of
their occurrences. Use dictionaries.
(b) Write a Python program to read a list of numbers and sort the list in a non- (9)
decreasing order without using any built in functions. Separate function
should be written to sort the list wherein the name of the list is passed as
the parameter.
OR
16.
(a) Illustrate the following Set methods with an example. (6)
i. intersection( ) ii. Union( ) iii. Issubset( ) iv. Difference( ) v. update( ) vi.
discard( )
(b) Write a Python program to check the validity of a password given by the (8)
user.
The Password should satisfy the following criteria:
1. Contains at least one letter between a and z
2. Contains at least one number between 0 and 9
3. Contains at least one letter between A and Z
4. Contains at least one special character from $, #, @
5. Minimum length of password: 6
17. (a) How can a class be instantiated in Python? Write a Python program to (10)
express the instances as return values to define a class RECTANGLE with
parameters height, width, corner_x, and corner_y and member functions to
find center, area, and perimeter of an instance.
(b) Explain inheritance in Python. Give examples for each type of inheritance. (4)
OR
18. (a) Write a Python class named Circle constructed by a radius and two (6)
methods which will compute the area and the perimeter of a given circle
(b) Write Python program to create a class called as Complex and implement (8)
__add__( ) method to add two complex numbers. Display the result by
overloading the + Operator.
19. (a) Write a Python program to add two matrices and also find the transpose of (8)
the resultant matrix.
(b) Given a file “auto.csv” of automobile data with the fields index, company, (6)
body-style, wheel-base, length, engine-type, num-of-cylinders, horsepower,
average-mileage, and price, write Python codes using Pandas to
OR
20.
(a) Write Python program to write the data given below to a CSV file.
(5)
SN Name Country Contribution Year
1 Linus Torvalds Finland Linux Kernel 1991
2 Tim Berners-Lee England World Wide Web 1990
3 Guido van Rossum Netherlands Python 1991
(b) Given the sales information of a company as CSV file with the following (9)
fields month_number, facecream, facewash, toothpaste, bathingsoap,
shampoo, moisturizer, total_units, total_profit. Write Python codes to
visualize the data as follows
1) Toothpaste sales data of each month and show it using a scatter plot
2) Face cream and face wash product sales data and show it using the
bar chart
3) Calculate total sale data for last year for each product and show it
using a Pie chart.
(14X5=70)
Teaching Plan
(10
Module 1: Programming Environment and Python Basics
hours)
Getting Started with Python Programming: Running code in the interactive
1.1 1 hour
shell Editing, Saving, and Running a script
1.2 Using editors: IDLE 1 hour

1.3 Jupyter 1 hour
1.4 The software development process: Case Study. 1 hour

Basic coding skills: Working with data types, Numeric data types and
1.5 Character sets, Keywords, Variables and Assignment statement, 1 hour
Operators, Expressions,
1.6 Working with numeric data, Type conversions, Comments in the program 1 hour
1.7 Input, Processing, and Output, Formatting output – How Python works 1 hour
1.8 How Python works – Detecting and correcting syntax errors 1 hour
1.9 Using built in functions and modules: Case – Using math module 1 hour
Using built in functions and modules: Case – Using math module

1.10 1 hour
(Examples)
Module 2: Building Python Programs (8 hours)
2.1 Control statements: Selection structure (if-else, switch-case), 1 hour

Iteration structure(for, while), Testing the control statements, Lazy
2.2 1 hour
evaluation
Functions: Hiding redundancy and complexity, Arguments and return

2.3 1 hour
values,
2.4 Variable scopes and parameter passing 1 hour
2.5 Named arguments, Main function, 1 hour

2.6 Working with recursion, Lambda functions 1 hour
2.7 Strings and number systems: String function 1 hour

2.8 Handling numbers in various format 1 hour
Module 3: Data Representation (9 hours)

3.1 Lists: Basic list Operations and functions, List of lists 1 hour
3.2 Slicing, Searching and sorting list 1 hour

3.3 List comprehension 1 hour
3.4 Work with tuples, Sets 1 hour

3.5 Work with dates and times 1 hour
3.6 Dictionaries: Dictionary functions, 1 hour

Dictionary literals, adding and removing keys, accessing & replacing
3.7 1 hour
values
3.8 Traversing dictionaries, reverse lookup 1 hour

3.9 Case Study: Data Structure Selection 1 hour
Module 4: Object Oriented Programming (8 hours)

4.1 Design with classes : Objects and Classes, Methods, Instance Variables 1 hour
4.2 Constructor, Accessors and Mutators 1 hour

4.3 Structuring classes with Inheritance 1 hour
4.4 Polymorphism 1 hour

4.5 Abstract Classes 1 hour

4.7 Exceptions : Handle a single exception 1 hour
4.8 handle multiple exceptions 1 hour
Module 5: Data Processing (10 hours)

5.1 The os and sys modules 1 hour
5.2 Introduction to file I/O: Reading and writing text files 1 hour
5.3 Manipulating binary files 1 hour
5.4 NumPy : Basics, Creating arrays, Arithmetic, Slicing 1 hour

5.5 Matrix Operations, Random numbers. 1 hour
5.6 Matplotlib : Basic plot 1 hour

5.7 Matplotlib - Ticks, Labels, and Legends 1 hour
5.8 Working with CSV files 1 hour

5.9 Pandas : Reading, Manipulating 1 hour
5.10 Pandas : Processing Data and Visualize. 1 hour

Year of
CST DATA Category L T P Credit
Introduction
285 COMMUNICATION
MINOR 3 1 0 4 2019
Preamble: This is a basic course in communication for awarding B. Tech. Minor in Computer
Science and Engineering with specialization in Networing. The purpose of this course is to
prepare learners to understand the communication entities and the associated issues in the
field of Computer Science. This course covers fundamental concepts of data transmission &
media, digital & analog transmissions, multiplexing & spread spectrum, error detection &
correction and switching. Concepts in data communication help the learner to understand the
concepts in networking and mobile communication.
Prerequisite: NIL
Describe the characteristics of signals used for Analog and Digital

CO1
transmissions (Cognitive knowledge: Understand)
Discuss the features and issues in data transmission (Cognitive knowledge:
CO2
Understand)
Select transmission media based on characteristics and propagation modes

CO3
(Cognitive knowledge: Apply)
Use appropriate signal encoding techniques for a given scenario (Cognitive
CO4
knowledge: Apply)
Illustrate multiplexing and spread spectrum technologies (Cognitive

CO5
knowledge: Understand)
Explain error detection & correction techniques and switching techniques

CO6
used in data communication (Cognitive knowledge: Understand)

PO1 PO1
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO11
0 2
CO1 ! ! ! !
CO2 ! ! ! !
CO3 ! !
CO4 ! ! ! ! !
CO5 ! ! ! ! ! !
CO6 ! ! ! ! ! !
Conduct investigations of
complex problems
Assessment Pattern
End Semester
Test 1 (Marks Test 2 (Marks
in percentage) in percentage)
percentage)
Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
Analyse
Evaluate
Create
Mark Distribution
150 50 100 3


Each of the two internal examinations has to be conducted out of 50 marks. First series test
shall be preferably conducted after completing the first half of the syllabus and the second
series test shall be preferably conducted after completing remaining part of the syllabus. There
will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each
from the completed modules and 1 question from the partly completed module), having 3
marks for each question adding up to 15 marks for part A. Students should answer all
questions from Part A. Part B contains 7 questions (preferably, 3 questions each from the
completed modules and 1 question from the partly completed module), each with 7 marks. Out
of the 7 questions, a student should answer any 5.

contains 2 questions from each module of which a student should answer any one. Each
Syllabus
Module 1
Data Transmission Basics
Communication model - Simplex, Half duplex, Full duplex transmission. Periodic Analog
signals - Sine wave, Amplitude, Phase, Wavelength, Time and frequency domain, Bandwidth.
Analog & digital data and signals. Transmission impairments - Attenuation, Delay distortion,
Noise. Data rate limits - Noiseless channel, Nyquist bandwidth, Noisy channel, Shannon's
capacity formula.
Module 2
Transmission Media
Guided Transmission Media - Twisted pair, Coaxial cable, Optical fiber. Unguided media -
Radio waves, Terrestrial microwave, Satellite microwave, Infrared. Wireless Propagation -
Ground wave propagation, Sky Wave propagation, Line-of-Sight (LoS) Propagation.
Module 3
Digital Transmission and Analog Transmission
Digital data to Digital signal – Non-Return-to-Zero (NRZ), Return-to-Zero (RZ), Multilevel
binary, Biphase. Analog data to Digital signal - Sampling theorem, Pulse Code Modulation
(PCM), Delta Modulation (DM). Digital data to Analog signal: Amplitude Shift Keying
(ASK), Frequency Shift Keying (FSK), Phase Shift Keying (PSK). Analog data to Analog
signal: Amplitude Modulation (AM), Frequency Modulation (FM), Phase Modulation (PM).
Module 4
Multiplexing and Spread Spectrum
Multiplexing - Frequency Division Multiplexing (FDM), Wave length Division Multiplexing
(WDM), Time Division Multiplexing (TDM), Characteristics, Synchronous TDM, Statistical
TDM. Spread Spectrum Techniques - Direct Sequence Spread Spectrum (DSSS), Frequency
Hopping Spread Spectrum (FHSS), Code Division Multiplexing, Code Division Multiple
Access (CDMA).
Module 5
Error Detection, Correction and Switching
Digital data communication techniques - Asynchronous transmission, Synchronous
transmission. Detecting and correcting errors - Types of Errors, Parity check, Checksum,
Cyclic Redundancy Check (CRC), Forward Error Correction (FEC), Hamming Distance,
Hamming Code. Basic principles of Switching - Circuit Switching, Packet Switching,
Message Switching.
Text Books
1. Forouzan B. A., Data Communications and Networking, 5/e, McGraw Hill, 2013.
2. William Stallings, Data and Computer Communication 9/e, Pearson Education, Inc.
Reference Books
1. Schiller J., Mobile Communications, 2/e, Pearson Education, 2009.
2. Curt M. White, Fundamentals of Networking and Communication 7/e, Cengage learning.

Course Outcome 1 (CO1): What is a periodic analog signal? List the main properties of
a periodic analog signal.
Course Outcome 2 (CO2): What is attenuation? How can it be handled?
Course Outcome 3 (CO3): How can interference be reduced using optical fiber?
Course Outcome 4(CO4): Encode the data sequence 101011100 using Multilevel binary
and Biphase schemes.
Course Outcome 5(CO5): Explain direct sequence spread spectrum with a neat diagram.
Course Outcome 6(CO6): Using Cyclic Redundancy Check (CRC), given the data-word
11110000 and the divisor 10011, show the generation of the codeword at the sender and
the checking of the codeword at the receiver.
QP CODE: PAGES: ___
Reg No:_______________
Name:_________________

FOURTH SEMESTER B.TECH DEGREE (MINOR) EXAMINATION, MONTH &
YEAR

Course name : DATA COMMUNICATION
PART-A
1. What is bandwidth? Find the lowest frequency, if a periodic signal has a bandwidth of 20
Hz and the highest frequency is 60 Hz. Draw the Spectrum if the signal contains all
frequencies of same amplitude.
2. Assume that a TV picture is to be transmitted over a channel with 4.5 MHz bandwidth and
a 35 dB Signal-to-Noise-Ratio. Find the capacity of the channel.
3. What is the purpose of cladding in optical fibres?
4. Which wireless propagation is suitable for satellite communication? Justify your answer.
5. Explain the working of Delta Modulation with an example.
6. Illustrate the equivalent square wave pattern of the bit string 01001101 using Non-Return-
to-Zero(NRZ) - Level and NRZ-Invert encoding schemes.
7. Distinguish between synchronous and statistical Time Division Multiplexing.
8. Apply Direct Sequence Spread Spectrum to the data 101 using the Barker sequence
10110111000. Show the encoding and decoding steps.
9. Find the minimum hamming distance for the following cases:
a) Detection of two errors
b) Correction of two errors
c) Detection of 3 errors or correction of 2 errors
d) Detection of 6 errors or correction of 2 errors
10. Find the parity bit for simple even parity check for the following.
a) 1001010
b) 0001100
c) 1000000
d) 1110111
PART-B
(Answer ANY one full question from each module. Each question carries 14 marks)
11. a) With the help of suitable figures, distinguish between time domain and frequency
domain. (4)
b) Describe the different types of transmission impairments.

(10)
OR
12. a) Calculate the bandwidth, if a periodic signal is decomposed into 4 sine waves with
frequencies 50 Hz, 100 Hz, 150 Hz and 200Hz. Draw the spectrum, assuming all
components having amplitude in the range 6-12 V and all are multiple of two in the
increasing order.
(6)
b) Distinguish between Nyquist bandwidth and Shannon capacity. Consider a noiseless

channel with a bandwidth of 3000 Hz transmitting a signal with (i) Two signal levels and
(ii) Four signal levels. Determine the maximum bit rate in both these cases.
(8)
13. a) Fora parabolic reflective antenna operating at 12 GHz with a diameter of 2 m, calculate
the effective area and the antenna gain.
(6)
b) List any four advantages and disadvantages of twisted pair, coaxial cable and fiber optic
cable.
(8)
OR
14. a) Compare the features of terrestrial microwave and satellite microwave.
(6)
b) With the help of suitable diagrams, differentiate Multi-mode and Single-mode optical
fibres. How the rays are propagated in Step-index and Graded-index Multi-mode fibres.
(8)
15. a) Distinguish between data rate and signal rate.
(4)
b) What is polar encoding? Encode the pattern 010011001110 using the two Biphase
schemes.
(10)
OR
16. a) Show the equivalent analog sine wave pattern of the bit string 010011010 using
Amplitude Shift Keying, Frequency Shift Keying and Phase Shift Keying.
(4)
b) State Sampling theorem. Explain Pulse Code Modulation with suitable figures.
(10)
17. a) Four channels are multiplexed using Time Division Multiplexing. If each channel sends
100 bytes/sec and we multiplex one byte per channel, determine the frame size, duration of
a frame, frame rate and bit rate of the link.
(6)
b) With the help of an example, explain the working of Frequency Hopping Spread
Spectrum.
(8)
OR
18. a)Explain the different techniques by which the disparity in input data rate is handled by
Time Division Multiplexing.
(4)
b) Suppose Alice and Bob are communicating using Code Division Multiple Access. Alice
uses the code [+1 +1] and Bob uses the code [+1 -1]. Alice sends the data bit 0 and Bob
sends the data bit 1. Show the data in the channel and how they can detect what the other
person has sent.
(10)
19. a) Explain parity check with examples.

(4)
b) Describe the need for a switch. What are the different phases in circuit switching?
(10)
OR
20. a) With the help of a suitable example, explain the virtual circuit approach of packet
switching.
(6)
b) Find the Hamming code for the data-word 1011001. Assume odd parity.
(8)
Teaching Plan
Module 1 : Data Transmission Basics (8 Hours)
Introduction, Communication model - Simplex, Half duplex, Full

1.1 1
duplex transmission
Periodic Analog signals - Sine wave, Amplitude, Phase,

1.2 1
Wavelength
1.3 Time and frequency domain, Bandwidth 1

1.4 Analog data and signals 1
1.5 Digital data and signals 1

1.6 Transmission impairments - Attenuation, Delay distortion, Noise 1
1.7 Data rate limits - Noiseless channel, Nyquist bandwidth 1

1.8 Noisy channel, Shannon's capacity formula 1
Module 2: Transmission media (7 Hours)

2.1 Guided Transmission Media - Twisted pair, Coaxial cable 1
2.2 Optical fiber 1

2.3 Unguided media - Radio waves 1
2.4 Terrestrial microwave, Satellite microwave 1

2.5 Infrared 1
2.6 Wireless Propagation - Ground wave propagation 1

2.7 Wave propagation, Line-of-Sight (LoS) Propagation 1
(10
Module 3: Digital Transmission and Analog Transmission
Hours)
3.1 Digital data to Digital signal – Non-Return-to-Zero (NRZ) 1
3.2 Return-to-Zero (RZ), Multilevel binary 1

3.3 Biphase 1
3.4 Analog data to Digital signal - Sampling theorem 1
3.5 Pulse Code Modulation (PCM) 1

3.6 Delta Modulation (DM) 1
3.7 Digital data to Analog signal: Amplitude Shift Keying (ASK) 1

3.8 Frequency Shift Keying (FSK), Phase Shift Keying (PSK) 1
3.9 Analog data to Analog signal: Amplitude Modulation (AM) 1

3.10 Frequency Modulation (FM), Phase Modulation (PM) 1
Module 4: Multiplexing and Spread Spectrum (9 Hours)
4.1 Multiplexing - Frequency Division Multiplexing (FDM) 1

Wave length Division Multiplexing (WDM), Time Division
4.2 1
Multiplexing (TDM)
4.3 Synchronous TDM, Statistical TDM 1

4.4 Spread Spectrum Techniques 1
4.5 Direct Sequence Spread Spectrum (DSSS) 1

4.6 Frequency Hopping Spread Spectrum (FHSS) 1
4.7 Code Division Multiplexing 1

4.8 Code Division Multiple Access (CDMA) 1
4.9 CDMA 1
Module 5: Error Detection, Correction and Switching (11 Hours)
Digital data communication techniques - Asynchronous &

5.1 1
Synchronous transmission
5.2 Detecting and correcting errors - Types of Errors 1
5.3 Parity check, Checksum 1

5.4 Cyclic Redundancy Check (CRC) 1
5.5 CRC 1
5.6 Forward Error Correction (FEC) 1
5.7 Hamming Distance, Hamming Code 1

5.8 Hamming Code 1
5.9 Basic principles of Switching - Circuit Switching 1

5.10 Packet Switching 1

5.11 Message Switching 1
SEMESTER -4
CODE COURSE NAME CATEGORY L T P CREDIT
MAT 206 GRAPH THEORY BSC 3 1 0 4
Preamble: This course introduces fundamental concepts in Graph Theory, including

properties and characterisation of graph/trees and graph theoretic algorithms, which are
widely used in Mathematical modelling and has got applications across Computer Science
and other branches in Engineering.
Prerequisite: The topics covered under the course Discrete Mathematical Structures (MAT
203 )
Explain vertices and their properties, types of paths, classification of graphs and
CO 1
trees & their properties. (Cognitive Knowledge Level: Understand)
Demonstrate the fundamental theorems on Eulerian and Hamiltonian graphs.
CO 2
(Cognitive Knowledge Level: Understand)
Illustrate the working of Prim’s and Kruskal’s algorithms for finding minimum cost
CO 3 spanning tree and Dijkstra’s and Floyd-Warshall algorithms for finding shortest
paths. (Cognitive Knowledge Level: Apply)
Explain planar graphs, their properties and an application for planar graphs.
CO 4
Illustrate how one can represent a graph in a computer. (Cognitive Knowledge

CO 5
Level: Apply)
Explain the Vertex Color problem in graphs and illustrate an example application
CO 6
for vertex coloring. (Cognitive Knowledge Level: Apply)
PO PO PO PO PO
PO 2 PO 3 PO 4 PO 7 PO 10 PO 11 PO 12
1 5 6 8 9
CO 1 √ √ √ √ √
CO 2 √ √ √ √ √ √
CO 3 √ √ √ √ √ √
CO 4 √ √ √ √ √ √
CO 5 √ √ √ √ √
CO 6 √ √ √ √ √ √



problems
Assessment Pattern
Continuous Assessment Tests (%) End Semester

Bloom’s Category
Examination (%)
1 2
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyse
Evaluate
Create
Mark Distribution
150 50 100 3 hours
There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2
questions each from the completed modules and 1 question from the partly covered module),
having 3 marks for each question adding up to 15 marks for part A. Students should answer
all questions from Part A. Part B contains 7 questions (preferably, 3 questions each from the
completed modules and 1 question from the partly covered module), each with 7 marks. Out
of the 7 questions in Part B, a student should answer any 5.
End Semester Examination Pattern: There will be two parts; Part A and Part B. Part A
contain 10 questions with 2 questions from each module, having 3 marks for each question.
Students should answer all questions. Part B contains 2 questions from each module of which
student should answer anyone. Each question can have maximum 2 sub-divisions and carries
14 marks.
Syllabus
Module 1
Introduction to Graphs : Introduction- Basic definition – Application of graphs – finite,

infinite and bipartite graphs – Incidence and Degree – Isolated vertex, pendant
vertex and Null graph. Paths and circuits – Isomorphism, sub graphs, walks, paths
and circuits, connected graphs, disconnected graphs and components.
Module 2
Eulerian and Hamiltonian graphs : Euler graphs, Operations on graphs, Hamiltonian paths
and circuits, Travelling salesman problem. Directed graphs – types of digraphs, Digraphs and
binary relation, Directed paths, Fleury’s algorithm.
Module 3
Trees and Graph Algorithms : Trees – properties, pendant vertex, Distance and centres in a
tree - Rooted and binary trees, counting trees, spanning trees, Prim’s algorithm and Kruskal’s
algorithm, Dijkstra’s shortest path algorithm, Floyd-Warshall shortest path algorithm.
Module 4
Connectivity and Planar Graphs : Vertex Connectivity, Edge Connectivity, Cut set and Cut
Vertices, Fundamental circuits, Planar graphs, Kuratowski’s theorem (proof not required),
Different representations of planar graphs, Euler's theorem, Geometric dual.
Module 5
Graph Representations and Vertex Colouring : Matrix representation of graphs-

Adjacency matrix, Incidence Matrix, Circuit Matrix, Path Matrix. Coloring- Chromatic
number, Chromatic polynomial, Matchings, Coverings, Four color problem and Five color
problem. Greedy colouring algorithm.
Text book:
1. Narsingh Deo, Graph theory, PHI,1979
Reference Books:
1. R. Diestel, Graph Theory, free online edition, 2016: diestel-graph-theory.com/

basic.html.
2. Douglas B. West, Introduction to Graph Theory, Prentice Hall India Ltd.,2001
3. Robin J. Wilson, Introduction to Graph Theory, Longman Group Ltd.,2010
4. J.A. Bondy and U.S.R. Murty. Graph theory with Applications
Sample Course Level Assessment Questions.
1. Differentiate a walk, path and circuit in a graph.
2. Is it possible to construct a graph with 12 vertices such that two of the vertices have
degree 3 and the remaining vertices have degree 4? Justify
3. Prove that a simple graph with n vertices must be connected, if it has more than
(n − 1)(n − 2)
edges.
2
4. Prove the statement: If a graph (connected or disconnected) has exactly two odd degree,
then there must be a path joining these two vertices.
1. Define Hamiltonian circuit and Euler graph. Give one example for each.
2. Define directed graphs. Differentiate between symmetric digraphs and asymmetric

digraphs.
3. Prove that a connected graph G is an Euler graph if all vertices of G are of even degree.
4. Prove that a graph G of n vertices always has a Hamiltonian path if the sum of the degrees
of every pair of vertices Vi, Vj in G satisfies the condition d(Vi) + d(Vj) =n−1
1. Discuss the centre of a tree with suitable example.

(n + 1)
2. Define binary tree. Then prove that number of pendant vertices in a binary tree is
2
3. Prove that a tree with n vertices has n − 1 edges.
4. Explain Floyd Warshall algorithm.
5. Run Dijkstra’s algorithm on the following directed graph, starting at vertex S.

1. Define edge connectivity, vertex connectivity and separable graphs. Give an example for
each.
2. Prove that a connected graph with n vertices and e edges has e − n + 2 edges.
3. Prove the statement: Every cut set in a connected graph G must also contain at least one
branch of every spanning tree of G.
4. Draw the geometrical dual (G*) of the graph given below, also check whether G and G*
are self-duals or not, substantiate your answer clearly.
1. Show that if A(G) is an incidence matrix of a connected graph G with n vertices, then
rank of A(G) is n−1.
2. Show that if B is a cycle matrix of a connected graph G with n vertices and m edges, then
rank B = m−n+1.
3. Derive the relations between the reduced incidence matrix, the fundamental cycle matrix,
and the fundamental cut-set matrix of a graph G.
4. Characterize simple, self-dual graphs in terms of their cycle and cut-set matrices.
1. Show that an n vertex graph is a tree iff its chromatic polynomial is P n(λ) = λ(λ − 1)n−1
2. Prove the statement: “A covering g of a graph is minimal if g contains no path of length

three or more.”
3. Find the chromatic polynomial of the graph

QP
Code : Total Pages: 4
Reg No.:_______________ Name:__________________________

IV SEMESTER B.TECH DEGREE EXAMINATION, MONTH and YEAR
Course Name: GRAPH THEORY
PART A
Answer all questions, each carries3 marks. Mark
s
1 Construct a simple graph of 12 vertices with two of them having degree 1, (3)
three having degree 3 and the remaining seven having degree 10.
2 What is the largest number of vertices in a graph with 35 edges, if all (3)
vertices are of degree at least 3 ?
3 Define a Euler graph. Give an example of Eulerian graph which is not (3)
Hamiltonian
4 Give an example of a strongly connected simple digraph without a directed (3)
Hamiltonian path.
5 What is the sum of the degrees of any tree of n vertices? (3)
6 How many spanning trees are there for the following graph (3)
7 Show that in a simple connected planar graph G having V-vertices, E-edges, (3)
and no triangles E <= 3V - 6.
8 Let G be the following disconnected planar graph. Draw its dual G*, and the (3)
dual of the dual (G*)*.
9 Consider the circuit matrix B and incidence matrix A of a simple connected (3)
graph whose columns are arranged using the same order of edges. Prove that
every row of B is orthogonal to every row of A?
10 A graph is critical if the removal of any one of its vertices (and the edges (3)
adjacent to that vertex) results in a graph with a lower chromatic number.
Show that Kn is critical for all n > 1.
PART B
11 a) Prove that for any simple graph with at least two vertices has two vertices of (6)
the same degree.
b) Prove that in a complete graph with n vertices there are (n-1)/2 edge disjoint (8)
Hamiltonian circuits and n >= 3
OR
OR
etermine whether the following graphs G1 = (V1, E1) and G2 = (V2, E2) are isomorphic
12. a) D
12 a) Determine whether the following graphs G1 = (V1, E1) and G2 = (V2, E2) are (6)
or not. Give justification. (6)
isomorphic or not. Give justification.
b) P b) that
rove Prove that a graph
a simple simplewith n vertices
graph with nand k components
vertices and k components
can have atcan have
most at (n-(8)
(n-k)
k+1)/2 edges.
most (n-k) (n-k+1)/2 edges (8)
13Leta)S bLet
13. a) e a Ssetbeofa 5set
elements. Construct
of 5 elements. Construct whose
a graphaGgraph G vertices are subsets
whose vertices of S of size
are subsets (8)
2 and twoofsuch
S ofsubsets are two
size 2 and adjacent
such in G if they
subsets are disjoint.
are adjacent in G if they are disjoint. (8)
i. Drawi.theDraw G.graph G.
graphthe
ii. How ii.
many edges
How manymust musttobeG added
be added
edges to order
in ordertoforGGin have afor
Hamiltonian
G to havecycle?
a
b) Let G be a graph with exactly
Hamiltonian two connected components, both being Eulerian. What is
cycle?
theb)
minimum
Let G number of edges
be a graph withthat need totwo
exactly be added to G to
connected obtain an Eulerian
components, graph? (6)
both being
Eulerian. What is the minimum number of edges that need to be added to G (6)
to obtain an Eulerian graph?
OR
14. a) Show that a k-connected graph with no hamiltonian
OR cycle has an independent set of size
14k +a)1. Show that a k-connected graph with no hamiltonian cycle has an (8)
(8)
b) independent set of size k + 1. (6)
i.b) Let Gi.beLet
a graph
G bethat has exactly
a graph twoexactly
that has connected
two components, both being both
connected components,
Hamiltonian
beinggraphs. Find thegraphs.
Hamiltonian minimumFindnumber of edgesnumber
the minimum that oneofneeds to that
edges add to
G to obtain
oneaneeds
Hamiltonian
to add tograph.
G to obtain a Hamiltonian graph. (6)
ii. For which
ii. Forvalues
which n the graph
of values n (hyper-cube
of n Qthe on n vertices)onis nEulerian.
graph Qn (hyper-cube vertices) is
Eulerian.
15 a) A tree T has at least one vertex v of degree 4, and at least one vertex w of (5)
degree 3. Prove that T has at least 5 leaves.
b) Write Dijkstra’s shortest path algorithm. (9)
Consider the following weighted directed graph G.
Find the shortest path between a and every other vertices in G using
Dijkstra’s shortest path algorithm.
OR
16 a) Define pendent vertices in a binary tree? Prove that the number of pendent (5)
vertices in a binary tree with n vertices is (n+1)/2.
b) (9)
Write Prim’s algorithm for finding minimum spanning tree.
Find a minimum spanning tree in the following weighted graph, using
Prim's algorithm.
Determine the number of minimum spanning trees for the given graph.
17 a) i. State and prove Euler's Theorem relating the number of faces, edges and (9)
vertices for a planar graph.
ii. If G is a 5-regular simple graph and |V| = 10, prove that G is non-planar.
b) Let G be a connected graph and e an edge of G. Show that e is a cut-edge if (5)
and only if e belongs to every spanning tree.
OR OR
18 a) 18. a) State
State Kuratowski's
Kuratowski's theorem,
theorem, andituse
and use it to show
to show thatgraph
that the the graph G below
G below is notis not
(9)planar.
Draw
planar. G on
Draw the the
G on plane without
plane edges
without crossing.
edges YourYour
crossing. drawing should
drawing use the labelling of
should
thelabelling
use the vertices of
given.
the vertices given. (9)
b) Let G
b) be
LetaGconnected graph graph
be a connected and e and
an edge of G.ofShow
e an edge that that
G. Show e belongs to ato a(5)
e belongs loop if and
loop if only
and only if e belongs
if e belongs to notospanning
no spanning
tree.tree. (5)
19 a) 19.
Define the circuit
a) Define matrix
the circuit B(G)Bof
matrix a connected
(G) graphgraph
of a connected G with n vertices
G with and and
n vertices e (7)
e edges with
edgesanwith an example.
example. Prove Prove that
that the theofrank
rank of is
B(G) B(G) is .e-n+1
e-n+1
b) Give
(7) the definition of the chromatic polynomial PG(k). Directly from the (7)
definition, prove
b) Give the that theofchromatic
definition polynomials
the chromatic of P
polynomial
and
WGn(k) Cn satisfy
. Directly fromthe
the definition,
identity PWnthat
prove (k) =the
k Pchromatic polynomials of Wn and Cn satisfy the identity PWn(k) = k PCn-1
Cn-1 (k – 1).
(k – 1). (7)
OR
OR
20 a) Define the incidence matrix of a graph G with an example. Prove that the (4)
20. a) of
rank Define the incidence
an incidence matrixmatrix
of a connected G with
of a graphgraph an nexample.
with Prove
vertices is n-1. that the rank of an
incidence matrix of a connected graph with n vertices is n-1. (4)
b) (10)
i. A graph G has chromatic polynomial PG(k)
= k4 -4k3 +5k2 -2k. How many vertices
and edges does G have? Is G bipartite? Justify your answers.
b) i. A graph G has chromatic polynomial PG(k) = k4-4k3+5k2-2k. How
many vertices and edges does G have? Is G bipartite? Justify your
answers.
ii. Find a maximum matching in the graph below and use Hall's theorem
to show that it is indeed maximum.
(10)
****
Assignments
Assignment must include applications of the above theory in Computer Science.

Teaching Plan
No. of
No Topic
Lectures
1 Module-I (Introduction to Graphs) (8)
1. Introduction- Basic definition – Application of graphs – finite and 1

infinite graphs, bipartite graphs,
2. Incidence and Degree – Isolated vertex, pendent vertex and Null graph 1
3. Paths and circuits 1
4. Isomorphism 1
5. Sub graphs, walks 1
6. Paths and circuits 1
7. Connected graphs. 1
8. Disconnected graphs and components 1
2 Module-II (Eulerian and Hamiltonian graphs) (8)
1. Euler graphs 1
2. Operations on graphs 1
3. Hamiltonian paths and circuits 1
4. Hamiltonian paths circuits 1
5. Travelling salesman problem 1
6. Directed graphs – types of digraphs, 1
7. Digraphs and binary relation, Directed paths 1
8. Fleury’s algorithm 1
3 Module-III (Trees and Graph Algorithms) (11)
1. Trees – properties 1
2. Trees – properties 1
3. Trees – properties, pendent vertex 1
4. Distance and centres in a tree 1

5. Rooted and binary tree 1
6. Counting trees 1
7. Spanning trees, Fundamental circuits 1
8. Prim’s algorithm 1
9. Kruskal’s algorithm 1
10. Dijkstra’s shortest path algorithm 1
11. Floyd-Warshall shortest path algorithm 1
4 Module-IV (Connectivity and Planar Graphs) (9)
1. Vertex Connectivity, Edge Connectivity 1
2. Cut set and Cut Vertices 1
3. Fundamental circuits 1
4. Fundamental circuits 1
5. Planar graphs 1
6. Kuratowski’s theorem 1
7. Different representations of planar graphs 1
8. Euler's theorem 1
9. Geometric dual 1
5 Module-V (Graph Representations and Vertex Colouring) (9)
1. Matrix representation of graphs- Adjacency matrix, Incidence Matrix 1
2. Circuit Matrix, Path Matrix 1
3. Colouring- chromatic number, 1
4. Chromatic polynomial 1
5. Matching 1
6. Covering 1
7. Four colour problem and five colour problem 1

8. Four colour problem and five colour problem 1
9. Greedy colouring algorithm. 1

Computer YEAR OF
CST 202 Organization INTRODUCTION
and Architecture PCC 3 1 0 4 2019
Preamble:
The course is prepared with the view of enabling the learners capable of understanding the
fundamental architecture of a digital computer. Study of Computer Organization and
Architecture is essential to understand the hardware behind the code and its execution at
physical level by interacting with existing memory and I/O structure. It helps the learners
to understand the fundamentals about computer system design so that they can extend the
features of computer organization to detect and solve problems occurring in computer
architecture.
Prerequisite : Topics covered under the course Logic System Design (CST 203)
CO# CO
Recognize and express the relevance of basic components, I/O organization and
CO1
pipelining schemes in a digital computer (Cognitive knowledge: Understand)
Explain the types of memory systems and mapping functions used in memory systems
CO2
Demonstrate the control signals required for the execution of a given instruction
CO3
(Cognitive Knowledge Level: Apply) )
Illustrate the design of Arithmetic Logic Unit and explain the usage of registers in it
CO4
Explain the implementation aspects of arithmetic algorithms in a digital computer

CO5
(Cognitive Knowledge Level:Apply)
Develop the control logic for a given arithmetic problem (Cognitive Knowledge
CO6
Level: Apply)
CO1
CO2
CO3
CO4
CO5
CO6


problems
Assessment Pattern

Bloom’s Category
Test1 (%) Test2 (%) Examination Marks (%)
Remember 20 20 30
Understand 40 40 30
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3 hours
Syllabus
Module 1
Basic Structure of computers – functional units - basic operational concepts - bus structures.
Memory locations and addresses - memory operations,Instructions and instruction sequencing ,
addressing modes.
Basic processing unit – fundamental concepts – instruction cycle – execution of a complete

instruction - single bus and multiple bus organization
Module 2
Register transfer logic: inter register transfer – arithmetic, logic and shift micro operations.
Processor logic design: - processor organization – Arithmetic logic unit - design of
arithmetic circuit - design of logic circuit - Design of arithmetic logic unit - status register –
design of shifter - processor unit – design of accumulator.
Module 3
Arithmetic algorithms: Algorithms for multiplication and division (restoring method) of binary
numbers. Array multiplier , Booth’s multiplication algorithm.
Pipelining: Basic principles, classification of pipeline processors, instruction and arithmetic
pipelines (Design examples not required), hazard detection and resolution.
Module 4
Control Logic Design: Control organization – Hard_wired control-microprogram control –
control of processor unit - Microprogram sequencer,micro programmed CPU organization -
horizontal and vertical micro instructions.
Module 5
I/O organization: accessing of I/O devices – interrupts, interrupt hardware -Direct memory
access.
Memory system: basic concepts – semiconductor RAMs. memory system considerations –

ROMs, Content addressable memory, cache memories - mapping functions.
Text Books
1. Hamacher C., Z. Vranesic and S. Zaky, Computer Organization ,5/e, McGraw Hill, 2011
2. Mano M. M., Digital Logic & Computer Design, PHI, 2004
3. KaiHwang, Faye Alye Briggs, Computer architecture and parallel processing McGraw-
Hill, 1984
Reference Books
1. Mano M. M., Digital Logic & Computer Design, 3/e, Pearson Education, 2013.
2. Patterson D.A. and J. L. Hennessy, Computer Organization and Design, 5/e, Morgan
3. William Stallings, Computer Organization and Architecture: Designing for Performance,

Pearson, 9/e, 2013.
4. Chaudhuri P., Computer Organization and Design, 2/e, Prentice Hall, 2008.
5. Rajaraman V. and T. Radhakrishnan, Computer Organization and Architecture, Prentice

Hall, 2011
Course Outcome1(CO1): Which are the registers involved in a memory access

operation and how are they involved in it?
Course Outcome 2(CO2): Explain the steps taken by the system to handle a write miss
condition inside the cache memory.
Course Outcome 3(CO3): Generate the sequence of control signals required for the
execution of the instruction MOV [R1],R2 in a threebus organization.
Course Outcome 4(CO4): Design a 4-bit combinational logic shifter with 2 control
signals H0 and H1 that perform the following operations :
H1 H0 Operation
0 0 Transfer 1's to all output line
0 1 No shift operation
1 0 Shift left
1 1 Shift right
Course Outcome 5(CO5): Explain the restoring algorithm for binary division. Also
trace the algorithm to divide (1001)2 by (11)2
Course Outcome 6(CO6): Design a software control logic based on microprogramed

control to perform the addition of 2 signed numbers represented in sign magnitude form.
QP CODE: PAGES:2
Reg No:_______________
Name:_________________
Course Name: Computer organization and architecture
PART A
1. Give the significance of instruction cycle.
2. Distinguish between big endian and little endian notations. Also give the significance of
these notations.
3. Compare I/O mapped I/O and memory mapped I/O.
4. Give the importance of interrupts in I/O interconnection.
5. Justify the significance of status register.
6. How does the arithmetic circuitry perform logical operations in an ALU.
7. Illustrate divide overflow with an example.
8. Write notes on arithmetic pipeline.
9. Briefly explain the role of micro program sequence.
10. Differentiate between horizontal and vertical micro instructions.
Part B
11.
11.(a) What is the significance of addressing modes in computer architecture.
(4)
11.(b) Write the control sequence for the instruction DIV R1,[R2] in a three bus structure.
(10)
OR
12. Explain the concept of a single bus organization with help of a diagram. Write the control
sequence for the instruction ADD [R1],[R2].
(14)
13. Explain various register transfer logics.
(14)
OR
14.
14.(a) Design a 4 bit combinational logic shifter with 2 control signals H1 and H2 that
perform the following operations (bit values given in parenthesis are the values of
control variable H1 and H2 respectively.) : Transfer of 0’s to S (00), shift right (01),
shift left (10), no shift (11).
(5)
14.(b) Design an ALU unit which will perform arithmetic and logic operation with a given
binary adder.
(9)
15.
15.(a) Give the logic used behind Booth’s multiplication algorithm.
(4)
15.(b) Identify the appropriate algorithm available inside the system to perform the
multiplication between -14 and -9. Also trace the algorithm for the above input.
(10)
OR
16.
16.(a) List and explain the different pipeline hazards and their possible solutions
(10)
16.(b) Design a combinational circuit for 3x2 multiplication.

(4)
17. Design a hardwared control unit used to perform addition/subtraction of 2 numbers
represented in sign magnitude form.
(14)
OR
18. Give the structure of the micro program sequencer and its role in sequencing the micro
instructions.
(14)
19.
19.(a) Explain the different ways in which interrupt priority schemes can be implemented
(10)
19.(b) Give the structure of SRAM cell.
(4)
OR
20.
20.(a) Explain the various mapping functions available in cache memory.

(9)
20.(b) Briefly explain content addressable memory.

(5)
TEACHING PLAN
No of
No Contents Lecture
Hrs
Module 1 : (Basic Structure of computers) (9 hours)
Functional units,basic operational concepts,bus structures
1.1 1
(introduction)
1.2 Memory locations and addresses , memory operations 1
1.3 Instructions and instruction sequencing 1
1.4 Addressing modes 1
1.5 Fundamental concepts of instruction execution, instruction cycle 1

1.6 Execution of a complete instruction - single bus organization (Lecture 1) 1
1.7 Execution of a complete instruction - single bus organization (Lecture 2) 1

1.8 Execution of a complete instruction - multiple bus organization (Lecture 1) 1
1.9 Execution of a complete instruction - multiple bus organization (Lecture 2) 1
Module 2 :(Register transfer logic and Processor logic design) (10 hours)
2.1 Inter register transfer – arithmetic micro operations 1
2.2 Inter register transfer – logic and shift micro operations 1
2.3 Processor organization 1
2.4 Design of arithmetic circuit 1
2.5 Design of logic circuit 1
2.6 Design of arithmetic logic unit 1
2.7 Design of status register 1

2.8 Design of shifter - processor unit 1
2.9 Design of accumulator (Lecture 1) 1
2.10 Design of accumulator (Lecture 2) 1
Module 3 : (Arithmetic algorithms and Pipelining) (9 hours)
3.1 Algorithm for multiplication of binary numbers 1
3.2 Algorithm for division (restoring method) of binary numbers 1
3.3 Array multiplier 1

3.4 Booth’s multiplication algorithm 1
3.5 Pipelining: Basic principles 1
3.6 Classification of pipeline processors (Lecture 1) 1
3.7 Classification of pipeline processors (Lecture 2) 1
3.8 Instruction and arithmetic pipelines (Design examples not required) 1
3.9 Hazard detection and resolution 1
Module 4 :( Control Logic Design) (9 hours)
4.1 Control organization –design of hardwired control logic (Lecture 1) 1

4.4 Design of microprogram control logic–control of processor unit (Lecture1) 1
4.7 Microprogram sequencer 1
4.8 Micro programmed CPU organization 1
4.9 Microinstructions –horizontal and vertical micro instructions 1
Module 5 : (Basic processing units, I/O and memory) (8 hours)
5.1 Accessing of I/O devices –interrupts 1

5.2 Interrupt hardware 1
5.3 Direct memory access 1

5.4 Memory system: basic concepts –semiconductor RAMs 1
5.5 Memory system considerations – ROMs 1
5.6 Content addressable memory 1
5.7 Cache memories -mapping functions (Lecture 1) 1
5.8 Cache memories -mapping functions (Lecture 2) 1
YEAR OF
CST Database Management CATEGORY L T P CREDIT
INTRODUCTION
204 Systems
PCC 3 1 0 4 2019
Preamble: This course provides a clear understanding of fundamental principles of Database

Management Systems (DBMS) with special focus on relational databases to the learners. The
topics covered in this course are basic concepts of DBMS, Entity Relationship (ER) model,
Relational Database principles, Relational Algebra, Structured Query Language (SQL), Physical
Data Organization, Normalization and Transaction Processing Concepts. The course also gives a
glimpse of the alternative data management model, NoSQL. This course helps the learners to
manage data efficiently by identifying suitable structures to maintain data assets of
organizations and to develop applications that utilize database technologies.
Prerequisite: Topics covered under the course Data Structures (CST 201), Exposure to a High
Level Language like C/python.
Summarize and exemplify fundamental nature and characteristics of database systems

CO1
Model real word scenarios given as informal descriptions, using Entity Relationship
CO2
diagrams. (Cognitive Knowledge Level: Apply)
Model and design solutions for efficiently representing and querying data using
CO3
relational model (Cognitive Knowledge Level: Analyze)
Demonstrate the features of indexing and hashing in database applications (Cognitive

CO4
Discuss and compare the aspects of Concurrency Control and Recovery in Database
CO5
systems (Cognitive Knowledge Level: Apply)
Explain various types of NoSQL databases (Cognitive Knowledge Level:

CO6
Understand)
CO1
CO2
CO3
CO4
CO5
CO6

problems
Assessment Pattern

Bloom’s Category Examination Marks
Test1 (%) Test2 (%)
(%)
Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
Analyze
Evaluate
Create
Mark Distribution

150 50 100 3 hours
Syllabus
Module 1: Introduction & Entity Relationship (ER) Model
Concept & Overview of Database Management Systems (DBMS) - Characteristics of Database

system, Database Users, structured, semi-structured and unstructured data. Data Models and
Schema - Three Schema architecture. Database Languages, Database architectures and
classification.
ER model - Basic concepts, entity set & attributes, notations, Relationships and constraints,
cardinality, participation, notations, weak entities, relationships of degree 3.
Module 2: Relational Model
Structure of Relational Databases - Integrity Constraints, Synthesizing ER diagram to relational

schema
Introduction to Relational Algebra - select, project, cartesian product operations, join - Equi-join,
natural join. query examples, introduction to Structured Query Language (SQL), Data Definition
Language (DDL), Table definitions and operations – CREATE, DROP, ALTER, INSERT,
DELETE, UPDATE.
Module 3: SQL DML (Data Manipulation Language), Physical Data Organization
SQL DML (Data Manipulation Language) - SQL queries on single and multiple tables, Nested
queries (correlated and non-correlated), Aggregation and grouping, Views, assertions, Triggers,
SQL data types.
Physical Data Organization - Review of terms: physical and logical records, blocking factor,
pinned and unpinned organization. Heap files, Indexing, Singe level indices, numerical examples,
Multi-level-indices, numerical examples, B-Trees & B+-Trees (structure only, algorithms not
required), Extendible Hashing, Indexing on multiple keys – grid files.
Module 4: Normalization
Different anomalies in designing a database, The idea of normalization, Functional dependency,
Armstrong’s Axioms (proofs not required), Closures and their computation, Equivalence of
Functional Dependencies (FD), Minimal Cover (proofs not required). First Normal Form (1NF),
Second Normal Form (2NF), Third Normal Form (3NF), Boyce Codd Normal Form (BCNF),
Lossless join and dependency preserving decomposition, Algorithms for checking Lossless Join
(LJ) and Dependency Preserving (DP) properties.
Module 5: Transactions, Concurrency and Recovery, Recent Topics
Transaction Processing Concepts - overview of concurrency control, Transaction Model,

Significance of concurrency Control & Recovery, Transaction States, System Log, Desirable
Properties of transactions.
Serial schedules, Concurrent and Serializable Schedules, Conflict equivalence and conflict
serializability, Recoverable and cascade-less schedules, Locking, Two-phase locking and its
variations. Log-based recovery, Deferred database modification, check-pointing.
Introduction to NoSQL Databases, Main characteristics of Key-value DB (examples from:

Redis), Document DB (examples from: MongoDB)
Main characteristics of Column - Family DB (examples from: Cassandra) and Graph DB

(examples from : ArangoDB)
Text Books
1. Elmasri R. and S. Navathe, Database Systems: Models, Languages, Design and

Application Programming, Pearson Education, 2013.
2. Sliberschatz A., H. F. Korth and S. Sudarshan, Database System Concepts, 6/e, McGraw
Hill, 2011.
Reference Books:
1. Adam Fowler, NoSQL for Dummies, John Wiley & Sons, 2015
2. NoSQL Data Models: Trends and Challenges (Computer Engineering: Databases and Big
Data), Wiley, 2018
3. Web Resource: https://www.w3resource.com/redis/
4. web Resource: https://www.w3schools.in/category/mongodb/
5. Web Resource: https://www.tutorialspoint.com/cassandra/cassandra_introduction.htm
6. Web Resource : https://www.tutorialspoint.com/arangodb/index.htm
Course Outcome1 (CO1):

1. List out any three salient features of database systems, which distinguish it from a file
system.
2. Give one example each for logical and physical data independence.

1. What facts about the relationships between entities EMPLOYEE and PROJECT are
conveyed by the following ER diagram?
1. Design an ER diagram for the following scenario:

There is a set of teams, each team has an ID (unique identifier), name, main stadium, and to
which city this team belongs. Each team has many players, and each player belongs to one
team. Each player has a number (unique identifier), name, DoB, start year, and shirt
number that he uses. Teams play matches, in each match there is a host team and a guest
team.
1. For the SQL query, SELECT A, B FROM R WHERE B=’apple’ AND C = ‘orange’ on the
table R(A, B, C, D), where A is a key, write any three equivalent relational algebra
expressions.
2. Given the FDs P→Q, P→R, QR→S, Q→T, QR→U, PR→U, write the sequence of
Armstrong’s Axioms needed to arrive at the following FDs: (a) P → T (b) PR → S (c)
QR → SU
3. Consider a relation PLAYER (PLAYER-NO, PLAYER-NAME, PLAYER-POSN,
TEAM, TEAM-COLOR, COACH-NO, COACH-NAME, TEAM-CAPTAIN). Assume
that PLAYER-NO is the only key of the relation and that the following dependencies
hold:
TEAM→{TEAM-COLOR, COACH-NO, TEAM-CAPTAIN}
COACH-NO→COACH-NAME.
i. Is the relation in 2NF? If not, decompose to 2NF.
ii. Is the relation in 3NF? If not, decompose to 3NF.
4. In the following tables foreign keys have the same name as primary keys except
DIRECTED-BY, which refers to the primary key ARTIST-ID. Consider only single-
director movies.
MOVIES(MOVIE-ID, MNAME, GENRE, LENGTH, DIRECTED-BY)
ARTIST(ARTIST-ID, ANAME)
ACTING(ARTIST-ID, MOVIE-ID)
Write SQL expressions for the following queries:
(a) Name(s) and director name(s) of movie(s) acted by ‘Jenny’.
(b) Names of actors who have never acted with ‘Rony’
(c) Count of movies genre-wise.
(d) Name(s) of movies with maximum length.

1. Consider an EMPLOYEE file with 10000 records where each record is of size 80 bytes.
The file is sorted on employee number (15 bytes long), which is the primary key.
Assuming un-spanned organization, block size of 512 bytes and block pointer size of 5
bytes. Compute the number of block accesses needed for retrieving an employee record
based on employee number if (i) No index is used (ii) Multi-level primary index is used.

1. Determine if the following schedule is recoverable. Is the schedule cascade-less? Justify
your answer. r1(X), r2(Z), r1(Z), r3(X), r3(Y), w1(X), c1, w3(Y), c3, r2(Y), w2(Z), w2(Y),
c2. (Note: ri(X)/wi(X) means transaction Ti issues read/write on item X; ci means
transaction Ti commits.)
2. Two-phase locking protocol ensures serializability. Justify.

1. List out any three salient features of NoSQL databases. Give example of a document in
MongoDB.

QPCODE
Reg No:__________________
Name:___________________
FOURTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR

Course Name: Database Management Systems
PART A
1 List out any three salient features of a database systems.
2 When is multi-valued composite attribute used in ER modelling?
3 For the SQL query, SELECT A, B FROM R WHERE B=’apple’ AND C = ‘orange’
on the table R(A, B, C, D), where A is a key, write any two equivalent relational
algebra expressions.
4 Outline the concept of theta-join.
5 How is the purpose of where clause is different from that of having clause?
6 What is the use of a trigger?
7 When do you say that a relation is not in 1NF?
8 Given the FDs P→Q, P→R, QR→S, Q→T, QR→U, PR→U, write the sequence of
Armstrong’s Axioms needed to arrive at a. P → T b. PR → S
9 What is meant by the lost update problem?
10 What is meant by check pointing?
PART B
11 a. Design an ER diagram for the following scenario: There is a set of teams, each (14)
team has an ID (unique identifier), name, main stadium, and to which city this
team belongs. Each team has many players, and each player belongs to one
team. Each player has a number (unique identifier), name, DoB, start year, and
shirt number that he uses. Teams play matches, in each match there is a host
team and a guest team. The match takes place in the stadium of the host team.
For each match we need to keep track of the following: The date on which the
game is played The final result of the match. The players participated in the
match. For each player, how many goals he scored, whether or not he took
yellow card, and whether or not he took red card. During the match, one player
may substitute another player. We want to capture this substitution and the time
at which it took place. Each match has exactly three referees. For each referee
we have an ID (unique identifier), name, DoB, years of experience. One referee
is the main referee and the other two are assistant referee.
OR
12 a. Interpret the the following ER diagram.
(8)
"
b. Distinguish between physical data independence and logical data independence (6)
with suitable examples.
13 EMPLOYEE(ENO, NAME, ADDRESS, DOB, AGE, GENDER, SALARY, (14)

DNUM, SUPERENO)
DEPARTMENT(DNO, DNAME, DLOCATION, DPHONE, MGRENO)
PROJECT(PNO, PNAME, PLOCATION, PCOST, CDNO)
DNUM is a foreign key that identifies the department to which an employee

belongs. MGRENO is a foreign key identifying the employee who manages the
department. CDNO is a foreign key identifying the department that controls the
project. SUPERENO is a foreign key identifying the supervisor of each employee.
Write relational algebra expressions for the following queries:-
(a) Names of female employees whose salary is more than 20000.

(b) Salaries of employee from ‘Accounts’ department
(c) Names of employees along with his/her superviser’s name
(d) For each employee return name of the employee along with his department
name and the names of projects in which he/she works
(e) Names of employees working in all the departments
OR
14 a.Write SQL DDL statements for the the following (Assume suitable domain (10)
types):
i. Create the tables STUDENT(ROLLNO, NAME, CLASS, SEM,
ADVISER), FACULTY(FID, NAME, SALARY, DEPT). Assume that
ADVISER is a foreign key referring FACUTY table.
ii. Delete department with name ‘CS’ and all employees of the
department.
iii. Increment salary of every faculty by 10%.
b.Illustrate foreign key constraint with a typical example. (4)
15 For the relation schema below, give an expression in SQL for each of the queries (14)
that follows:
employee(employee-name, street, city)

works(employee-name, company-name, salary)
company(company-name, city)
manages(employee-name, manager-name)
a) Find the names, street address, and cities of residence for all employees
who work for the Company ‘RIL Inc.' and earn more than $10,000.
b) Find the names of all employees who live in the same cities as the
companies for which they work.
c) Find the names of all employees who do not work for ‘KYS Inc.’. Assume
that all people work for exactly one company.
d) Find the names of all employees who earn more than every employee of
‘SB Corporation'. Assume that all people work for at most one company.
e) List out number of employees company-wise in the decreasing order of
number of employees.
OR
16 a. Consider an EMPLOYEE file with 10000 records where each record is of (9)
size 80 bytes. The file is sorted on employee number (15 bytes long), which
is the primary key. Assuming un-spanned organization and block size of
512 bytes compute the number of block accesses needed for selecting
records based on employee number if,
i. No index is used
ii. Single level primary index is used
iii. Multi-level primary index is used
Assume a block pointer size of 6 bytes.
b. Illustrate correlated and non-correlated nested queries with real examples. (5)
17 a. Illstrate3NF and BCNF with suitable real examples. (6)
b. Given a relation R(A1,A2,A3,A4,A5) with functional dependencies (8)

A1→A2A4 and A4→A5, check if the decomposition R1(A1,A2,A3),
R2(A1,A4), R3(A2,A4,A5) is lossless.
OR
18 a. Consider the un-normalized relation R(A, B, C, D, E, F, G) with the FDs (7)
A→B , AC→G, AD→EF, EF→G, CDE→AB. Trace the normalization
process to reach 3NF relations.
b. Illustrate Lossless Join Decomposition and Dependency Preserving (7)

Decomposition with typical examples.
19 a. Discuss the four ACID properties and their importance. (7)
b. Determine if the following schedule is conflict serializable. Is the schedule (7)

recoverable? Is the schedule cascade-less? Justify your answers.
r1(X), r2(Z), r1(Z), r3(X), r3(Y ), w1(X), c1, w3(Y), c3, r2(Y), w2(Z),
w2(Y), c2
(Note: ri(X)/wi(X) means transaction Ti issues read/write on item X; ci

means transaction Ti commits.)
OR
20 a. Discuss the main characteristics of Key-value DB and Graph DB. (7)
b. Illustrate two-phase locking with a schedule containing three transactions. (7)

Argue that 2PL ensures serializability. Also argue that 2Pl can lead to
deadlock.
Teaching Plan
Hours
Course Name
(48)
Module 1: Introduction & ER Model 8
Concept & Overview of DBMS, Characteristics of DB system,
1.1 1
Database Users.
Structured, semi-structured and unstructured data. Data Models and
1.2 1
Schema
1.3 Three-Schema-architecture. Database Languages 1
1.4 Database architectures and classification 1
1.5 ER model: basic concepts, entity set & attributes, notations 1

1.6 Relationships and constraints – cardinality, participation, notations 1
1.7 Weak entities, relationships of degree 3 1
1.8 ER diagram – exercises 1
Module 2: Relational Model 7
2.1 Structure of relational Databases, Integrity Constraints 1
Synthesizing ER diagram to relational schema, Introduction to
2.2 1
relational algebra.
2.3 Relational algebra: select, project, Cartesian product operations 1
2.4 Relational Algebra: join - Equi-join, Natural join 1
2.5 Query examples 1
2.6 Introduction to SQL, important data types 1
DDL, Table definitions and operations – CREATE, DROP, ALTER,
2.7 1
INSERT, DELETE, UPDATE
Module 3: SQL DML, Physical Data Organization 11
3.1 SQL DML, SQL queries on single and multiple tables 1
3.2 Nested queries (correlated and non-correlated) 1
3.3 Aggregation and grouping 1
Hours
Course Name
(48)
3.4 Views, assertions (with examples) 1
3.5 Triggers (with examples), SQL data types 1
Review of terms: physical and logical records, blocking factor,
3.6 1
pinned and unpinned organization. Heap files, Indexing
3.7 Singe level indices, numerical examples 1
3.8 Multi-level-indices, numerical examples 1
3.9 B-Trees and B+Trees (structure only, algorithms not required) 1
3.10 Extendible Hashing 1

3.11 Indexing on multiple keys – grid files 1
Module 4: Normalization 8
Different anomalies in designing a database, The idea of
4.1 1
normalization
4.2 Functional dependency, Armstrong’s Axioms (proofs not required) 1
Closures and their computation, Equivalence of FDs, minimal
4.3 1
Cover (proofs not required).
4.4 1NF, 2NF 1
4.5 3NF, BCNF 1
4.6 Lossless join and dependency preserving decomposition 1
Algorithms for checking Lossless Join and Dependency preserving
4.7 1
properties (Lecture 1)
Algorithms for checking Lossless Join and Dependency preserving
4.8 1
properties (Lecture 2)
Module 5: Transactions, Concurrency and Recovery, Recent
14
Topics
5.1 Transaction Processing Concepts: Transaction Model 1
Overview of concurrency control, Significance of concurrency
5.2 1
Control & Recovery
5.3 Transaction States, System Log 1
Hours
Course Name
(48)
5.4 Desirable Properties of transactions, Serial schedules 1
5.5 Concurrent and Serializable Schedules 1
5.6 Conflict equivalence and conflict serializability 1
5.7 Recoverable and cascade-less schedules 1
5.8 Locking, Two-phase locking, strict 2PL. 1
5.9 Log-based recovery 1

5.10 Deferred database modification (serial schedule), example 1
Deferred database modification (concurrent schedule) example,
5.11 1
check-pointing
5.12 Introduction to NoSQL Databases 1
Main characteristics of Key-value DB (examples from: Redis),
5.13 Document DB (examples from: MongoDB) [detailed study not 1
expected]
Main characteristics of Column-Family DB (examples from:

5.14 Cassandra) and Graph DB (examples from : ArangoDB) [detailed 1
study not expected]
Year of
CST OPERATING Category L T P Credit
Introduction
206 SYSTEMS
PCC 3 1 0 4 2019
Preamble: Study of operating system is an essential to understand the overall working of

computer system, tradeoffs between performance and functionality and the division of jobs
between hardware and software. This course introduces the concepts of memory management,
device management, process management, file management and security & protection
mechanisms available in an operating system. The course helps the learner to understand the
fundamentals about any operating system design so that they can extend the features of operating
system to detect and solve many problems occurring in operating system and to manage the
computer resources appropriately.
Prerequisite: Topics covered in the courses are Data Structures (CST 201) and Programming
in C (EST 102)
Explain the relevance, structure and functions of Operating Systems in computing

CO1
devices. (Cognitive knowledge: Understand)
Illustrate the concepts of process management and process scheduling mechanisms

CO2
employed in Operating Systems. (Cognitive knowledge: Understand)
Explain process synchronization in Operating Systems and illustrate process
CO3 synchronization mechanisms using Mutex Locks, Semaphores and Monitors
(Cognitive knowledge: Understand)
Explain any one method for detection, prevention, avoidance and recovery for
CO4
managing deadlocks in Operating Systems. (Cognitive knowledge: Understand)
Explain the memory management algorithms in Operating Systems. (Cognitive

CO5
Explain the security aspects and algorithms for file and storage management in
CO6
Operating Systems. (Cognitive knowledge: Understand)
CO1
CO2
CO3
CO4
CO5
CO6

problems
Assessment Pattern
Test 1 (Marks Test 2 (Marks End Semester Examination

Bloom’s Category
in percentage) in percentage) (Marks in percentage)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyse
Evaluate
Create
Mark Distribution

150 50 100 3


Syllabus
Module I
Introduction: Operating system overview – Operations, Functions, Service – System calls,

Types – Operating System structure - Simple structure, Layered approach, Microkernel, Modules
– System boot process.
Module II
Processes - Process states, Process control block, threads, scheduling, Operations on processes -
process creation and termination – Inter-process communication - shared memory systems,
Message passing systems.
Process Scheduling – Basic concepts- Scheduling COMPUTER SCIENCE
criteria -scheduling AND ENGINEERING
algorithms- First come
First Served, Shortest Job Firs, Priority scheduling, Round robin scheduling
Module III
Process synchronization- Race conditions – Critical section problem – Peterson’s solution,

Synchronization hardware, Mutex Locks, Semaphores, Monitors – Synchronization problems -
Producer Consumer, Dining Philosophers and Readers-Writers.
Deadlocks: Necessary conditions, Resource allocation graphs, Deadlock prevention, Deadlock

avoidance – Banker’s algorithms, Deadlock detection, Recovery from deadlock.
Module IV
Memory Management: Concept of address spaces, Swapping, Contiguous memory allocation,

fixed and variable partitions, Segmentation, Paging. Virtual memory, Demand paging, Page
replacement algorithms.
Module V
File System: File concept - Attributes, Operations, types, structure – Access methods, Protection.
File-system implementation, Directory implementation. Allocation methods.
Storage Management: Magnetic disks, Solid-state disks, Disk Structure, Disk scheduling,
Disk formatting.
Text Book
Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, ' Operating System Concepts' 9th
Edition, Wiley India 2015.
Reference Books:
1. Andrew S Tanenbaum, “Modern Operating Systems” , 4th Edition, Prentice Hall, 2015.
2. William Stallings, “Operating systems”, 6th Edition, Pearson, Global Edition, 2015.
3. Garry Nutt, Nabendu Chaki, Sarmistha Neogy, “Operating Systems”, 3rd Edition, Pearson
Education.
4. D.M.Dhamdhere, “Operating Systems”, 2nd Edition, Tata McGraw Hill, 2011.
5. Sibsankar Haldar, Alex A Aravind, “Operating Systems”, Pearson Education.
Sample Course Level Assessment Questions COMPUTER SCIENCE AND ENGINEERING
Course Outcome1 (CO1): What is the main advantage of the micro kernel approach to system
design? How do user program and system program interact in a microkernel architecture?
Course Outcome 2 (CO2): Define process. With the help of a neat diagram explain different
states of process.
Course Outcome 3 (CO3): What do you mean by binary semaphore and counting semaphore?
With C, explain implementation of wait () and signal().
Course Outcome 4 (CO4): Describe resource allocation graph for the following. a) with a
deadlock b) with a cycle but no deadlock.
Course Outcome 5 (CO5): Consider the following page reference string 1, 2, 3, 4, 2, 1, 5, 6, 2,

1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. Find out the number of page faults if there are 4 page frames, using
the following page replacement algorithms. i) LRU ii) FIFO iii) Optimal
Course Outcome 6 (CO6): Explain the different file allocation methods with advantages and
disadvantages.
QP CODE: PAGES: ___
Reg No:_______________
Name:_________________

Course name : OPERATING SYSTEMS
PART-A
1. How does hardware find the Operating System kernel after system switch-on?
2. What is the purpose of system call in operating system?
3. Why is context switching considered as an overhead to the system?

COMPUTER
4. How is inter process communication implement SCIENCE
using shared memory? AND ENGINEERING
5. Describe resource allocation graph for the following.
a) with a deadlock b)with a cycle but no deadlock.
6. What is critical section? What requirement should be satisfied by a solution to the critical
section problem?
7. Consider the reference string 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How

many page faults occur while using FCFS for the following cases.
a) frame=2 b)frame=3
8. Differentiate between internal and external fragmentations.
9. Compare sequential access and direct access methods of storage devices.
10. Define the terms (i) Disk bandwidth (ii) Seek time.
PART-B(Answer any one question from each module)
11. a) Explain the following structures of operating system (i) Monolithic systems
(ii) Layered Systems (iii) Micro Kernel (iv) Modular approach. (12)
b) Under what circumstances would a user be better of using a time sharing system than a
PC or a single user workstation? (2)
OR
12. a) What is the main advantage of the micro kernel approach to system design? How do user
program and system program interact in a microkernel architecture? (8)
b) Describe the differences between symmetric and asymmetric multiprocessing? What are
the advantages and disadvantages of multiprocessor systems? (6)
13. a) Define process. With the help of a neat diagram explain different states of process. (8)
b) Explain how a new process can be created in Unix using fork system call. (6)
OR
14 a) Find the average waiting time and average turnaround time for the processes given in the
table below using:- i) SRT scheduling algorithm ii) Priority scheduling algorithm (9)
Process Arrival Time (ms)COMPUTER SCIENCE
CPU Burst Time (ms) AND ENGINEERING
Priority
P1 0 5 3
P2 2 4 1
P3 3 1 2
P4 5 2 4
b) What is a Process Control Block? Explain the fields used in a Process Control Block. (5)
15. Consider a system with five processes P0 through P4 and three resources of type A, B, C.
Resource type A has 10 instances, B has 5 instances and C has 7 instances. Suppose at time
t0 following snapshot of the system has been taken:
i) What will be the content of the Need matrix? Is the system in a safe state? If Yes, then what is
the safe sequence? (8)
iii)What will happen if process P1 requests one additional instance of resource type A and two
instances of resource type C? (6)
OR
16. a) State dining philosopher’s problem and give a solution using semaphores. (7)
b) What do you mean by binary semaphore and counting semaphore? With C struct, explain
implementation of wait () and signal() (7)
COMPUTER
17. a) Consider the following page reference string SCIENCE
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2,AND
3, 7, 6,ENGINEERING
3, 2, 1, 2,
3, 6. Find out the number of page faults if there are 4 page frames, using the following
page replacement algorithms i) LRU ii) FIFO iii) Optimal (9)
b) Explain the steps involved in handling a page fault. (5)
OR
18. a) With a diagram, explain how paging is done with TLB. (5)
b) Memory partitions of sizes 100 kb, 500 kb, 200 kb, 300 kb, 600 kb are available, how
would best ,worst and first fit algorithms place processes of size 212 kb, 417 kb, 112 kb,
426 kb in order. Rank the algorithms in terms of how efficiently they uses memory. (9)
19. a) Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. the drive currently
services a request at cylinder 143, and the previous request was at cylinder 125. the queue
of pending request in FIFO order is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130.
Starting from the current position, what is the total distance (in cylinders) that the disk arm
moves to satisfy all pending requests for each of the following algorithms
i) FCFS ii) SSFT iii) SCAN iv) LOOK v) C-SCAN (10)
b) What is the use of access matrix in protection mechanism? (4)
OR
20. a) Explain the different file allocation operations with advantages and disadvantages. (8)
b) Explain the following i) file types ii) file operation iii) file attributes (6)
Teaching Plan
Module 1 - Introduction 5 Hours

1.1 Introduction to Operating System 1
1.2 Operating System operations, functions, service 1

1.3 System calls, Types 1
1.4 Operating System Structure: Simple, Layered, Microkernel, Modules 1

1.5 System Boot Process 1
Module 2 – Processes and Process Scheduling 9 Hours

2.1 Processes, Process states 1
2.2 Process Control Block, Threads 1

2.3 Scheduling 1
2.4 Operations on processes: process creation and termination 1

2.5 Inter-process communication: Shared memory systems, Message Passing 1
2.6 Process Scheduling – Basic concepts, Scheduling Criteria 1

2.7 Scheduling algorithms - Basics 1
2.8 First come First Served, Shortest Job First 1

2.9 Priority scheduling, Round Robin Scheduling 1
Module 3 - Process synchronization and Dead locks 13 Hours

3.1 Process synchronization, Race conditions 1
3.2 Critical Section problem, Peterson’s solution 1

3.3 Synchronization hardware, Mutex Locks 1
3.4 Semaphores 1
3.5 Monitors 1
3.6 Synchronization problem examples (Lecture 1) 1

3.7 Synchronization problem examples (Lecture 2) 1
3.8 Deadlocks: Necessary conditions, Resource Allocation Graphs 1

3.9 Deadlock prevention 1
3.10 Deadlock avoidance 1

3.11 Banker’s algorithm 1
3.12 Deadlock detection 1

3.13 Deadlock recovery 1
Module 4 - Memory Management 9 Hours

4.1 Memory Management: Concept of Address spaces 1
4.2 Swapping 1
4.3 Contiguous memory allocation, fixed and variable partitions 1
4.4 Segmentation. 1
4.5 Paging (Lecture 1) 1
4.6 Paging (Lecture 2) 1

4.7 Virtual memory, Demand Paging 1
4.8 Page replacement algorithms (Lecture 1) 1
4.9 Page replacement algorithms (Lecture 2) 1

Module 5 - File and Disk management 9 Hours
5.1 File concept, Attributes, Operations, types, structure 1

5.2 Access methods 1
5.3 Protection 1
5.4 File-System implementation 1
5.5 Directory implementation 1

5.6 Allocation methods 1
5.7 Magnetic disks, Solid-state disks, Disk structure 1

5.8 Disk scheduling 1
5.9 Disk formatting 1

CSL 202 DIGITAL LAB
PCC 0 0 3 2
Preamble: This course helps the learners to get familiarized with (i) Digital Logic Design
through the implementation of Logic Circuits using ICs of basic logic gates & flip-
flops and (ii) Hardware Description Language based Digital Design. This course helps the
learners to design and implement hardware systems in areas such as games, music, digital
filters, wireless communications and graphical displays.
Prerequisite:Topics covered under the course Logic System Design (CST 203)
Design and implement combinational logic circuits using Logic Gates (Cognitive
CO 1
Design and implement sequential logic circuits using Integrated Circuits

CO 2
Simulate functioning of digital circuits using programs written in a Hardware
CO 3
Description Language (Cognitive Knowledge Level: Apply)
Function effectively as an individual and in a team to accomplish a given task of

CO 4
designing and implementing digital circuits (Cognitive Knowledge Level: Apply)
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO10 PO11 PO12
CO 1
CO 2
CO 3
CO 4
Assessment Pattern
End Semester
Bloom’s Category Test (Internal Exam)
Examination (Percentage)
(Percentage)
Remember 20 20
Understand 20 20
Apply 60 60
Analyse
Evaluate
Create
Mark Distribution
150 75 75 3 hours
Internal Examination Pattern: The marks will be distributed as Design/Algorithm 30

marks, Implementation/Program 20 marks, Output 20 marks and Viva 30 marks. Total 100
marks which will be converted out of 15 while calculating Internal Evaluation marks.
End Semester Examination Pattern:The marks will be distributed as Design/Algorithm 30

marks, Implementation/Program 20 marks, Output 20 marks and Viva 30 marks. Total 100
marks will be converted out of 75 for End Semester Examination.
Fair Lab Record:
All Students attending the Digital Lab should have a Fair Record. The fair record should be
produced in the University Lab Examination. Every experiment conducted in the lab should
be noted in the fair record. For every experiment in the fair record, the right hand page should
contain Experiment Heading, Experiment Number, Date of Experiment, and Aim of
Experiment. The left hand page should contain components used, circuit design or a print out
of the code used for the experiment and sample output obtained.
SYLLABUS
Conduct a minimum of 8 experiments from Part A and a minimum of 4 experiments from

Part B. The starred experiments in Part A are mandatory. The lab work should be conducted
in groups (maximum group size being 4). The performance of a student in the group should
be assessed based on teamwork, integrity and cooperation.
Part A (Any 8 Experiments)
• A 2 hour session should be spent to make the students comfortable with the use of
trainer kit/breadboard and ICs.
• The following experiments can be conducted on breadboard or trainer kits.
• Out of the 15 experiments listed below, a minimum of 8 experiments should be
completed by a student, including the mandatory experiments (5).
1. Realization of functions using basic and universal gates (SOP and POS forms).
2. Design and realization of half adder, full adder, half subtractor and full subtractor using:
a) basic gates (b) universal gates. *
3. Code converters: Design and implement BCD to Excess 3 and Binary to Gray code
converters.
4. Design and implement 4 bit adder/subtractor circuit and BCD adder using IC7483.
5. Implementation of Flip Flops: SR, D, T, JK and Master Slave JK Flip Flops using basic
gates.*
6. Asynchronous Counter: Design and implement 3 bit up/down counter.
7. Asynchronous Counter: Realization of Mod N counters (At least one up counter and one
down counter to be implemented). *
8. Synchronous Counter: Realization of 4-bit up/down counter.
9. Synchronous Counter: Realization of Mod-N counters and sequence generators. (At least
one mod N counter and one sequence generator to be implemented) *
10. Realization of Shift Register (Serial input left/right shift register), Ring counter and
Johnson Counter using flipflops. *
11. Realization of counters using IC’s (7490, 7492, 7493).
12. Design and implement BCD to Seven Segment Decoder.
13. Realization of Multiplexers and De-multiplexers using gates.
14. Realization of combinational circuits using MUX & DEMUX ICs (74150, 74154).
15. To design and set up a 2-bit magnitude comparator using basic gates.
PART B (Any 4 Experiments)
• The following experiments aim at training the students in digital circuit design with
Verilog. The experiments will lay a foundation for digital design with Hardware
Description Languages.
• A 3 hour introductory session shall be spent to make the students aware of the
fundamentals of development using Verilog
• Out of the 8 experiments listed below, a minimum of 4 experiments should be
completed by a student
Experiment 1. Realization of Logic Gates and Familiarization of Verilog
(a) Familiarization of the basic syntax of Verilog
(b) Development of Verilog modules for basic gates and to verify truth tables.
(c) Design and simulate the HDL code to realize three and four variable Boolean
functions
Experiment 2: Half adder and full adder

(a) Development of Verilog modules for half adder in 3 modeling styles (dataflow/
structural/behavioural).
(b) Development of Verilog modules for full adder in structural modeling using half
adder.
Experiment 3: Design of code converters
Design and simulate the HDL code for
(a) 4- bit binary to gray code converter

(b) 4- bit gray to binary code converter
Experiment 4: Mux and Demux in Verilog

(a) Development of Verilog modules for a 4x1 MUX.
(b) Development of Verilog modules for a 1x4 DEMUX.
Experiment 5: Adder/Subtractor
(a) Write the Verilog modules for a 4-bit adder/subtractor
(b) Development of Verilog modules for a BCD adder
Experiment 6: Magnitude Comparator
Development of Verilog modules for a 4 bit magnitude comparator
Experiment 7: Flipflops and shiftregisters

(a) Development of Verilog modules for SR, JK, T and D flip flops.
(b) Development of Verilog modules for a Johnson/Ring counter
Experiment 8: Counters
(a) Development of Verilog modules for an asynchronous decade counter.
(b) Development of Verilog modules for a 3 bit synchronous up-down counter.
Practice Questions
PART A
1. Design a two bit parallel adder using gates and implement it using ICs of basic gates
2. A combinatorial circuit has 4 inputs and one output. The output is equal to 1 when (a)
all inputs are 1, (b) none of the inputs are 1, (c) an odd number of inputs are equal to
1. Obtain the truth table and output function for this circuit and implement the same.
3. Design and implement a parallel subtractor.
4. Design and implement a digital circuit that converts Gray code to Binary.
5. Design a combinational logic circuit that will output the 1’s compliment of a 4-bit
input number.
∑
6. Implement and test the logic function f! (A, B, C ) = m(0,1,3,6) using an 8:1 MUX
IC
7. Design a circuit that will work as a ring counter or a Johnson counter based on a mode
bit, M.
8. Design a 4-bit synchronous down counter.
9. Design a Counter to generate the binary sequence 0,1,3,7,6,4
10. Design an asynchronous mod 10 down counter
11. Design and implement a synchronous counter using JK flip flop ICs to generate the
sequence: 0 - 1 -3 - 5 - 7 - 0.
PART B
1. Develop Verilog modules for a full subtractor in structural modeling using half
subtractors.
2. Design a 4 bit parallel adder using Verilog.
3. Develop Verilog modules for a 4 bit synchronous down counter.
4. Write Verilog code for implementing a 8:1 multiplexer.
5. Develop Verilog modules for a circuit that converts Excess 3 code to binary.
6. Write the Verilog code for a JK Flip flop, and its test-bench. Use all possible
combinations of inputs to test its working
7. Write the hardware description in Verilog of a 8-bit register with shift left and shift
right modes of operations and test its functioning.
8. Write the hardware description in Verilog of a mod-N (N > 9) counter and test it.
YEAR OF
OPERATING CATEGORY L T P CREDIT
CSL204 INTRODUCTION
SYSTEMS LAB
PCC 0 0 3 2 2019
Preamble: The course aims to offer students a hands-on experience on Operating System
concepts using a constructivist approach and problem-oriented learning. Operating systems are
the fundamental part of every computing device to run any type of software.
Prerequisite: Topics covered in the courses are Data Structures (CST 201) and Programming
in C (EST 102)
Course Outcomes:
At the end of the course, the student should be able to
Illustrate the use of systems calls in Operating Systems. (Cognitive knowledge:

CO1
Understand)
Implement Process Creation and Inter Process Communication in Operating

CO2
Systems. (Cognitive knowledge: Apply)
Implement Fist Come First Served, Shortest Job First, Round Robin and Priority-
CO3
based CPU Scheduling Algorithms. (Cognitive knowledge: Apply)
Illustrate the performance of First In First Out, Least Recently Used and Least
CO4
Frequently Used Page Replacement Algorithms. (Cognitive knowledge: Apply)
Implement modules for Deadlock Detection and Deadlock Avoidance in Operating
CO5
Implement modules for Storage Management and Disk Scheduling in Operating
CO6
CO1
CO2
CO3
CO4
CO5
CO6

problems
Assessment Pattern:
Continuous Assessment Test

Bloom’s Category (Internal Exam) Marks in
Marks in percentage
percentage
Remember 20 20
Understand 20 20
Apply 60 60
Analyse
Evaluate
Create
Mark Distribution
ESE
Total Marks CIE Marks ESE Duration
Marks
150 75 75 3 hours
Viva Voce : 15 marks
Internal Examination Pattern: The marks will be distributed as Algorithm 30 marks,

Program 20 marks, Output 20 marks and Viva 30 marks. Total 100 marks which will be
converted out of 15 while calculating Internal Evaluation marks.
End Semester Examination Pattern: The percentage of marks will be distributed as

Algorithm 30 marks, Program 20 marks, Output 20 marks and Viva 30 marks. Total 75 marks.
Progamming Language to Use in Lab : Ansi C
Fair Lab Record:
All Students attending the Operating System Lab should have a Fair Record. The fair record
should be produced in the University Lab Examination. Every experiment conducted in the
lab should be noted in the fair record. For every experiment in the fair record, the right hand
page should contain Experiment Heading, Experiment Number, Date of experiment, Aim of
the Experiment and the operations performed on them, Details of experiment including
algorithm and result of Experiment. The left hand page should contain a print out of the code
used for experiment and sample output obtained for a set of input.
SYLLABUS
OPERATING SYSTEMS LAB
* mandatory
1. Basic Linux commands

2. Shell programming
-Command syntax
-Write simple functions with basic tests, loops, patterns
3. System calls of Linux operating system:*
fork, exec, getpid, exit, wait, close, stat, opendir, readdir
4. Write programs using the I/O system calls of Linux operating system (open, read, write)
5. Implement programs for Inter Process Communication using Shared Memory *
6. Implement Semaphores*
7. Implementation of CPU scheduling algorithms. a) Round Robin b) SJF c) FCFS d)
Priority *
8. Implementation of the Memory Allocation Methods for fixed partition*
a) First Fit b) Worst Fit c) Best Fit
9. Implement l page replacement algorithms a) FIFO b) LRU c) LFU*
10. Implement the banker’s algorithm for deadlock avoidance. *
11. Implementation of Deadlock detection algorithm
12. Simulate file allocation strategies.
b) Sequential b) Indexed c) Linked
13. Simulate disk scheduling algorithms. *
c) FCFS b)SCAN c) C-SCAN
OPERATING SYSTEMS LAB - PRACTICE QUESTIONS
1. Write a program to create a process in linux.

2. Write programs using the following system calls of Linux operating system:
fork, exec, getpid, exit, wait, close, stat, opendir, readdir
3. Write programs using the I/O system calls of Linux operating system (open, read, write)
4. Given the list of processes, their CPU burst times and arrival times, display/print the
Gantt chart for FCFS and SJF. For each of the scheduling policies, compute and print the
average waiting time and average turnaround time
5. Write a C program to simulate following non-preemptive CPU scheduling algorithms to
find turnaround time and waiting time.
a)FCFS b) SJF c) Round Robin (pre-emptive) d) Priority
6. Write a C program to simulate following contiguous memory allocation techniques
a) Worst-fit b) Best-fit c) First-fit
7. Write a C program to simulate paging technique of memory management.
8. Write a C program to simulate Bankers algorithm for the purpose of deadlock avoidance.
9. Write a C program to simulate disk scheduling algorithms a) FCFS b) SCAN c) C-SCAN
10. Write a C program to simulate page replacement algorithms a) FIFO b) LRU c) LFU
11. Write a C program to simulate producer-consumer problem using semaphores.
12. Write a program for file manipulation for display a file and directory in memory.
13. Write a program to simulate algorithm for deadlock prevention.
14. Write a C program to simulate following file allocation strategies.
a)Sequential b) Indexed c) Linked
SEMESTER -4
MINOR
CST Programming Category L T P CREDIT YEAR OF INTRODUCTION

282 Methodologies MINOR 3 1 0 4 2019
Preamble: This is the second course for awarding B.Tech Minor in Computer Science and
Engineering with specialization in Software Engineering. The course provides the learners a
clear understanding of the main constructs of contemporary programming languages and the
various systems of ideas that have been used to guide the design of programming languages.
This course covers the concepts of Names, Bindings & Scope, Statement-Level Control
Structures, Sub Programs, support for Object Oriented Programming, Exception Handling, Event
Handling, Concurrency Control, Functional Programming and Logic Programming. This course
helps the learners to equip with the knowledge necessary for the critical evaluation of existing
and upcoming programming languages. It also enables the learner to choose the most appropriate
language for a given programming task, apply that language's approach to structure or organize
the code and classify programming languages based on their features.
Prerequisite:
1. Topics covered under the course Programming in C (EST 102)
2. Object Oriented Programming (CST 251)
Explain the criteria for evaluating programming languages and compare Imperative,
CO1 Functional and Logic programming languages (Cognitive Knowledge Level:
Understand)
Explain the characteristics of data types and variables (Cognitive Knowledge Level:
CO2
Understand)
Illustrate how control flow structures and subprograms help in developing the
CO3 structure of a program to solve a computational problem (Cognitive Knowledge Level:
Apply)
Explain the characteristics of Object Oriented Programming Languages (Cognitive
CO4
Knowledge Level: Understand)
Compare concurrency constructs in different programming languages (Cognitive
CO5
1
CO1
CO2
CO3
CO4
CO5

problems
Assessment Pattern

Bloom’s Category
Test 1 (Marks%) Test 2 (Marks%) (Marks%)
Remember 30 30 30
Understand 50 50 50
Apply 20 20 20
Analyze
Evaluate
Create
2
Mark Distribution

150 50 100 3 hours
3
SYLLABUS
Module 1
Introduction – Role of Programming Languages, Programming Domains, Language Evaluation

Criteria, Influence on Language Design, Language Design Trade-offs, Implementation Methods.
Names, Bindings & Scope – Names, Variables, Concept of Binding, Scope and Lifetime,
Referencing Environments.
Module 2
Data Types – Primitive Data Types, Character String Types, User-Defined Ordinal Types, Array
Types, Record Types, List Types, Pointer & Reference Types, Type Checking, Strong Typing,
Type Equivalence. Expressions – Arithmetic Expressions, Overloaded Operators, Type
Conversions, Relational and Boolean Expressions, Short-Circuit Evaluation. Assignment -
Assignment Statements, Mixed-mode Assignment.
Module 3
Statement-Level Control Structures – Selection Statements, Iterative Statements,

Unconditional Branching, Guarded Commands. Subprograms – Design Issues of Subprograms,
Local Referencing Environments, Parameter Passing Methods, Subprograms as Parameters,
Overloaded Subprograms, Closures, Co-routines.
Module 4
Support for Object Oriented Programming – Inheritance, Dynamic Binding, Design Issues for Object
Oriented Languages, Support for Object Oriented Programming in C++, Implementation of Object-
Oriented Constructs. Exception Handling – Basic Concepts, Design Issues. Event Handling - Introduction
to Event Handling.
Module 5
Concurrency – Subprogram Level Concurrency, Semaphores, Monitors, Message Passing.

Functional Programming Languages – Introduction to LISP and Scheme, Comparison of
Functional and Imperative Languages. Logic Programming Languages – Basic Elements of
Prolog, Applications of Logic Programming.
Text Books
1. Robert W. Sebesta, Concepts of Programming Languages, 10th Edition, Pearson.
2. Scott M. L., Programming Language Pragmatics, 3rd Edn., Morgan Kaufmann Publishers.
4
Reference Books:
1. Kenneth C. Louden, Programming Languages: Principles and Practice, 2nd Edn., Cengage
Learning.
2. Tucker A. B. and R. E. Noonan, Programming Languages: Principles and Paradigms, 2nd

Edn. –TMH.
3. Ravi Sethi, Programming Languages: Concepts & Constructs, 2nd Edn., Pearson
Education.
4. David A. Watt, Programming Language Design Concepts, Wiley Dreamtech
Course Outcome 1 (CO1): Compare any three programming languages based on the language
evaluation criteria. Prepare a list of characteristics that affect the language evaluation criteria.
Identify the advantages and disadvantages of imperative, functional and logic programming
languages.
Course Outcome 2 (CO2): Two most important design issues that are specific to character
string types are (1) whether a string is simply a special kind of character array or a primitive type
(2) whether strings have static or dynamic length. Justify your answer.
1. Describe three situations where a combined counting and logical looping statement is
needed.
2. Describe the ways that aliases can occur with pass-by-reference parameters.
3. Identify the two fundamental design considerations for parameter-passing methods.
1. Describe the role of a virtual method table in implementing dynamic method binding.
2. Identify one disadvantage of inheritance.
Course Outcome 5 (CO5): Evaluate the use of semaphores and monitors for providing
competition synchronization and cooperation synchronization.
5
QP CODE: PAGES:3
Reg No:______________ Name :______________
FOURTH SEMESTER B.TECH (MINOR) DEGREE EXAMINATION, MONTH &
YEAR Course Code: CST 282
Course Name: Programming Methodologies
PART A
1. Differentiate between readability and writability.

2. Define binding and binding time
3. What are the advantages of user-defined enumeration types?
4. Define narrowing and widening conversions.
5. Why for statement in C language is more flexible than that of older languages?
6. What are the advantages and disadvantages of dynamic local variables in subprograms?
7. Explain the concept of dynamic method binding with an example.
8. Is it mandatory to use constructors in object oriented languages? Justify your answer.
9. What are the applications of logical programming languages?
10. Explain the working of let and let-rec constructs in Scheme.
Part B
11.
(a) Explain different criteria used for evaluating languages.
(7 marks)
(b) Explain the major methods of implementing programming languages.
(7 marks)
OR
12.
(a) Explain the meanings, purposes, advantages and disadvantages of four categories of
scalar variables according to their storage bindings.
(7 marks)
6
(b) What is referencing environment of a statement? Show the referencing

environment at the indicated program points (1), (2), (3) & (4) for the following
program segment. Assume that the programming language used is statically scoped.
program example;
var a, b : integer;
procedure sub1;
var x, y: integer;
begin { sub1 }
……….. (1)
end { sub1 }
procedure sub2;
var x : integer;
……..
procedure sub3;
var x: integer;
begin { sub3 }
……….. (2)
end { sub3 }
begin { sub2 }
……….. (3)
end { sub2}
begin {example}
……….. (4)
end {example } (7 Marks)
13.
(a) Explain any two problems associated with the pointer data types and also indicate
how dangling pointer problem can be solved.
(7 marks)
(b) Describe the lazy and eager approaches for reclaiming garbage.
(7 marks)
OR
14.
(a) What is meant by side effect and illustrate the advantages of referential
transparency?
(8 marks)
(b) Explain the terms: compound assignment operator, coercion and short circuit
evaluation. (6 marks)
7
15.
(a) Explain different categories of iteration control statements.
(8 marks)
(b) Explain techniques used for identifying correct referencing environment for a
subprogram that was sent as a parameter.
(6 marks)
OR
16.
(a) Describe the implementation models of Parameter passing.
(10 Marks)
(b) Differentiate coroutines from conventional subprograms.
(4 marks)
17.
(a) What is an exception handler? Explain how exceptions are handled in object
oriented language?
(7 Marks)
(b) What are the design issues in object oriented languages? (7 Marks)
OR
18. Explain the following object oriented features:

(i) Encapsulation
(ii) Inheritance
(iii) Constructors and Destructors
(iv) Operator Overloading
(v) Polymorphism
(14 Marks)
19.
(a) Compare functional and imperative programming languages.
(7 Marks)
(b) Explain the role of monitors in concurrency.
(7 Marks)
OR
20.
(a) Explain the searching strategies used in Prolog. Why backward chaining is preferred
over forward chaining in Prolog?
(10 Marks)
(b) How does a binary semaphore differ from an ordinary semaphore?
(4 Marks)
8
Teaching Plan
Module 1 (Introduction) 9 Hours
Introduction : Reasons for studying Concepts of programming

1.1 1 Hour
languages, Programming Domains
1.2 Language Evaluation Criteria (Lecture 1) 1 Hour
1.3 Language Evaluation Criteria (Lecture 2) 1 Hour
1.4 Influence on Language Design, Language Design Trade-offs 1 Hour
1.5 Implementation Methods 1 Hour
1.6 Names, Variables 1 Hour
1.7 Concept of Binding 1 Hour
1.8 Scope and Lifetime 1 Hour
1.9 Referencing Environments 1 Hour
Module 2 (Data Types, Expressions and Assignment Statements) 8 Hours
2.1 Primitive Data Types, Character String Types 1 Hour
2.2 User-Defined Ordinal Types, Array Types 1 Hour
2.3 Record Types, List Types, Pointer and Reference Types 1 Hour
Implementation of pointer and reference types, Type Checking,

2.4 1 Hour
Strong Typing, Type Equivalence
Expressions and Assignment Statements, Arithmetic
2.5 1 Hour
Expressions
2.6 Overloaded Operators, Type Conversions 1 Hour
2.7 Relational and Boolean Expressions, Short-Circuit Evaluation 1 Hour
2.8 Assignment Statements, Mixed-mode Assignment 1 Hour
Module 3 (Statement Level Control Structures, Subprograms) 8 Hours

3.1 Selection Statements, Iterative Statements 1 Hour
3.2 Unconditional Branching 1 Hour
9
3.3 Guarded Commands 1 Hour
3.4 Subprograms: Design Issues of Subprograms 1 Hour
3.5 Local Referencing Environments 1 Hour
3.6 Parameter Passing Methods 1 Hour
3.7 Subprograms as Parameters, Overloaded Subprograms 1 Hour
3.8 Closures, Co-routines 1 Hour
Module 4 (Support for Object Oriented Programming, Exception

10 Hours
Handling, Event handling)
4.1 Inheritance 1 Hour
4.2 Dynamic Binding 1 Hour
4.3 Design Issues for Object Oriented Languages 1 Hour
4.4 Support for Object Oriented Programming in C++ 1 Hour
4.5 Implementation of Object-Oriented Constructs (Lecture 1) 1 Hour
4.8 Basic Concepts 1 Hour
4.9 Exception Handling - Design Issues 1 Hour
4.10 Introduction to Event Handling 1 Hour
Module 5 (Concurrency, Functional Programming Languages, Logic

10 Hours
Programming languages)
5.1 Subprogram Level Concurrency 1 Hour
5.2 Semaphores 1 Hour
5.3 Monitors 1 Hour
5.4 Message Passing 1 Hour
5.5 Introduction to LISP and Scheme (Lecture 1) 1 Hour
5.6 Introduction to LISP and Scheme (Lecture 2) 1 Hour
5.7 Comparison of Functional and Imperative Languages 1 Hour
5.8 Basic Elements of Prolog (Lecture 1) 1 Hour
10
5.9 Basic Elements of Prolog (Lecture 2) 1 Hour
5.10 Applications of Logic Programming 1 Hour
11
CODE MATHEMATICS FOR CATEGORY L T P CREDIT
CST284 MACHINE LEARNING VAC 3 1 0 4
Preamble: This is the foundational course for awarding B. Tech. Honours in Computer
Science and Engineering with specialization in Machine Learning. The purpose of this
course is to introduce mathematical foundations of basic Machine Learning concepts among
learners, on which Machine Learning systems are built. This course covers Linear
Algebra, Vector Calculus, Probability and Distributions, Optimization and Machine Learning
problems. Concepts in this course help the learners to understand the mathematical principles
in Machine Learning and aid in the creation of new Machine Learning solutions, understand
& debug existing ones, and learn about the inherent assumptions & limitations of the current
methodologies.
Prerequisite: A sound background in higher secondary school Mathematics.
Make use of the concepts, rules and results about linear equations, matrix algebra,
CO 1 vector spaces, eigenvalues & eigenvectors and orthogonality & diagonalization to
solve computational problems (Cognitive Knowledge Level: Apply)
Perform calculus operations on functions of several variables and matrices,
CO 2 including partial derivatives and gradients (Cognitive Knowledge Level: Apply)
Utilize the concepts, rules and results about probability, random variables, additive
& multiplicative rules, conditional probability, probability distributions and Bayes’
CO 3
theorem to find solutions of computational problems (Cognitive Knowledge Level:
Apply)
Train Machine Learning Models using unconstrained and constrained optimization
CO 4 methods (Cognitive Knowledge Level: Apply)
PO PO PO PO 4 PO 5 PO PO 7 PO 8 PO 9 PO PO 11 PO
1 2 3 6 10 12
CO 1 √ √ √ √ √
CO 2 √ √ √ √
CO 3 √ √ √ √ √
CO 4 √ √ √ √ √ √
Abstract POs defined by National Board of

Accreditation
PO# Broad PO# Broad
PO PO
PO4 problems PO10 Communication

Assessment Pattern

Bloom’s Category
1 2 Examination
Remember 20% 20% 20%
Understand 40% 40% 40%

Apply 40% 40% 40%
Analyse
Evaluate
Create
Mark Distribution

150 50 100 3 hours
contains 10 questions with 2 questions from each module, having 3 marks for each question.
14 marks.
Syllabus
Module 1
LINEAR ALGEBRA: Systems of Linear Equations – Matrices, Solving Systems of Linear

Equations. Vector Spaces –Vector Spaces, Linear Independence, Basis and Rank. Linear
Mappings – Matrix Representation of Linear Mappings, Basis Change, Image and Kernel.
Module 2
ANALYTIC GEOMETRY, MATRIX DECOMPOSITIONS: Norms, Inner Products,

Lengths and Distances, Angles and Orthogonality, Orthonormal Basis, Orthogonal
Complement, Orthogonal Projections – Projection into One Dimensional Subspaces,
Projection onto General Subspaces, Gram-Schmidt Orthogonalization.
Determinant and Trace, Eigenvalues and Eigenvectors, Cholesky Decomposition, Eigen

decomposition and Diagonalization, Singular Value Decomposition, Matrix Approximation.
Module 3
VECTOR CALCULUS : Differentiation of Univariate Functions - Partial Differentiation

and Gradients, Gradients of Vector Valued Functions, Gradients of Matrices, Useful
Identities for Computing Gradients. Back propagation and Automatic Differentiation –
Gradients in Deep Network, Automatic Differentiation.Higher Order Derivatives-
Linearization and Multivariate TaylorSeries.
Module 4
PROBABILITY AND DISTRIBUTIONS : Construction of a Probability Space - Discrete

and Continuous Probabilities, Sum Rule, Product Rule, and Bayes’ Theorem. Summary
Statistics and Independence – Gaussian Distribution - Conjugacy and the Exponential Family
- Change of Variables/Inverse Transform.
Module 5
OPTIMIZATION : Optimization Using Gradient Descent - Gradient Descent With

Momentum, Stochastic Gradient Descent. Constrained Optimization and Lagrange
Multipliers - Convex Optimization - Linear Programming - Quadratic Programming.
Text book:
1.Mathematics for Machine Learning by Marc Peter Deisenroth, A. Aldo Faisal, and
Cheng Soon Ong published by Cambridge University Press (freely available at https://
mml - book.github.io)
Reference books:
1. Linear Algebra and Its Applications, 4th Edition by Gilbert Strang
2. Linear Algebra Done Right by Axler, Sheldon, 2015 published bySpringer
3. Introduction to Applied Linear Algebra by Stephen Boyd and Lieven Vandenberghe,

2018 published by Cambridge UniversityPress
4. Convex Optimization by Stephen Boyd and Lieven Vandenberghe, 2004 published by

Cambridge UniversityPress
5. Pattern Recognition and Machine Learning by Christopher M Bishop, 2006, published

bySpringer
6. Learning with Kernels – Support Vector Machines, Regularization, Optimization, and

Beyond by Bernhard Scholkopf and Smola, Alexander J Smola, 2002, published by
MIT Press
7. Information Theory, Inference, and Learning Algorithms by David J. C MacKay, 2003

published by Cambridge UniversityPress
8. Machine Learning: A Probabilistic Perspective by Kevin P Murphy, 2012 published by

MITPress.
9. The Nature of Statistical Learning Theory by Vladimir N Vapnik, 2000, published by

Springer
1. Find the set S of all solution sinx of the following in homogeneous linear systems Ax
= b, where A and b are defined as follows:
2. Determine the inverses of the following matrix if possible
3. Find the characteristic equation, eigenvalues, and eigenspaces corresponding to each

eigenvalue of the following matrix
4. Diagonalize the following matrix, if possible
5. Find the singular value decomposition (SVD) of the following matrix

1. For a scalar function f(x, y, z ) = x2 +3y2 +2z2, find the gradient and its magnitude at
the point (1, 2, -1).
2. Find the maximum and minimum values of the function f(x,y)=4x+4y-x2-y2
subject to the condition x2 + y2 <= 2.
3. Suppose you were trying to minimize f(x, y) = x2+ 2y + 2y2. Along what vector
should you travel from (5,12)?
4. Find the second order Taylor series expansion for f(x, y) = (x + y)2about (0 ,0).
5. Find the critical points of f(x, y) = x2 –3xy+5x-2y+6y2+8.
6. Compute the gradient of the Rectified Linear Unit (ReLU) function ReLU(z) =
max(0 , z).
7. Let L = ||Ax - b||22, where A is a matrix and x and b are vectors. Derive dL in terms of
dx.
1. Let J and T be independent events, where P(J)=0.4 andP(T)=0.7.
i. Find P(J∩T)
ii. Find P(JT)
iii. Find P(J∩T′)

2. Let A and B be events such that P(A)=0.45 , P(B)=0.35 and P(A ∪ B)=0.5. Find
P(A∣B).
3. A random variable R has the probability distribution as shown in the followingtable:
i. Given that E(R)=2.85, find a andb.
ii. Find P(R>2).

4. A biased coin (with probability of obtaining a head equal to p> 0) is tossed repeatedly
and independently until the first head is observed. Compute the probability that the
first head appears at an even numbered toss.
5. Two players A and B are competing at a trivia quiz game involving a series of
questions. On any individual question, the probabilities that A and B give the correct
answer are p and q respectively, for all questions, with outcomes for different
questions being independent. The game finishes when a player wins by answering a
question correctly. Compute the probability that A winsif
i. A answers the firstquestion,
ii. B answers the first question.

6. A coin for which P(heads) = p is tossed until two successive tails are obtained. Find
the probability that the experiment is completed on the nth toss.
1. Find the extrema of f(x, y) = x subject to g(x, y) = x2 + 2y2 =3.
2. Maximize the function f(x, y, z) = xy + yz + xz on the unit sphere g(x, y, z) = x2 + y2 +

z2 =1.
3. Provide necessary and sufficient conditions under which a quadratic optimization
problem be written as a linear least squaresproblem.
4. Consider the univariate function f(x) = x3 + 6x2 - 3x - 5. Find its stationary points and
indicate whether they are maximum, minimum, or saddlepoints.
5. Consider the update equation for stochastic gradient descent. Write down the update
when we use a mini-batch size ofone.
6. Consider the function
i. Is f(x) a convex function? Justify youranswer.
ii. Is (1 , -1) a local/global minimum? Justify youranswer.
7. Is the function f(x, y) = 2x2 + y2 + 6xy - x + 3y - 7 convex, concave, or neither?

Justify youranswer.
8. Consider the following convex optimization problem
Subject to the constraint x + y >= 4, x, y >= 1.
Derive an explicit form of the Lagrangian dual problem.

9. Solve the following LP problem with the simplexmethod.
subject to the constraints

QP Code : Total Pages : 5

Reg No.:_______________ Name:__________________________
IV SEMESTER B.TECH (HONOURS) DEGREE EXAMINATION, MONTH and YEAR
Course Name: MATHEMATICS FOR FOR MACHINE LEARNING
PART A
Answer all questions, each carries3 marks. Marks
1 Show that with the usual operation of scalar multiplication but with addition
on reals given by x # y = 2(x + y) is not a vector space.
2 Are the following sets of vectors linearly independent? Explain your
answer.
3 1 1
Find the angle between the vectors 𝑥𝑥 = � �and 𝑦𝑦 = � �.
1 2
4 Find the eigen values of the following matrix in terms of k. Can you find an
eigen vector corresponding to each of the eigen values?
5 Let f(x, y, z) = xyer, where r = x2+z2-5. Calculate the gradient of f at the

point (1, 3, -2).
6 Compute the Taylor polynomials Tn, n =0 , ... , 5 of f(x) = sin(x) +
cos(x) at x0 = 0.
7 Let X be a continuous random variable with probability density function on
0 <= x <= 1 defined by f(x) = 3x2. Find the pdf of Y =X2.
8 Show that if two events A and B are independent, then A and B' are
independent.
9 Explain the principle of the gradient descent algorithm.
10 Briefly explain the difference between (batch) gradient descent and
stochastic gradient descent. Give an example of when you might prefer one
over the other.
PART B
11 a) i.Find all solutions to the system of linearequations (4)
ii. Prove that all vectors orthogonal to [2,−3,1]T forms a subspace (4)
W of R3. What is dim (W) and why?
b) A set of n linearly independent vectors in Rn forms a basis. Does the set of (6)
vectors (2, 4,−3),(0, 1, 1),(0, 1,−1) form a basis for R3? Explain
yourreasons.
OR
𝑥𝑥1
12 a) Find all solutions in 𝑥𝑥 = �𝑥𝑥2� ∈ 𝑅𝑅 3 of the equation system 𝐴𝐴𝐴𝐴 = 12𝑥𝑥 , (7)
𝑥𝑥3
6 4 3
where 𝐴𝐴 = �6 0 9� and ∑3𝑖𝑖=1 xi = 1.
0 8 0
b) Consider the transformation T (x, y) = (x + y, x + 2y, 2x + 3y). Obtain ker T (7)
and use this to calculate the nullity. Also find the transformation matrix
forT.
13 a) Use the Gramm-Schmidt process to find an orthogonal basis for the column (7)
space of the following matrix.
b) Find the SVD of the matrix. (7)

2 2
� �
−1 −1
OR
14 a) i. Let L be the line through the origin in R2 that is parallel to the vector (6)
[3, 4]T. Find the standard matrix of the orthogonal projection onto L.
Also find the point on L which is closest to the point (7, 1) and find the
point on L which is closest to the point (-3 , 5).
ii. Find the rank-1 approximation of
b) i. Find an orthonormal basis of R3 consisting of eigenvectors for the (8)

following matrix.
ii. Finda3×3orthogonalmatrixSanda3×3diagonalmatrixD
such that A = SDST
15 a) Askierisonamountainwithequationz=100–0.4x2–0.3y2,wherez (8)
denotes height.
i. The skier is located at the point with xy-coordinates (1, 1), and wants
to ski downhill along the steepest possible path. In which direction
(indicated by a vector (a, b) in the xy-plane) should the skier
beginskiing.
ii. The skier begins skiing in the direction given by the xy-vector (a, b)
you found in part (i), so the skier heads in a direction in space given
by the vector (a, b, c). Find the value of c.
b) Find the linear approximation to the function f(x,y) = 2 - sin(-x - 3y) at the (6)
point (0 , π), and then use your answer to estimate f(0.001 , π).
OR
16 a) Let g be the function given by (8)
i. Calculate the partial derivatives of g at (0,0).

ii. Show that g is not differentiable at (0,0).
b) Find the second order Taylor series expansion for f(x,y) =e-(x2+y2) cos(xy) (6)
about (0 , 0).
17 a) There are two bags. The first bag contains four mangos and two apples; the (6)
second bag contains four mangos and four apples. We also have a biased
coin, which shows “heads” with probability 0.6 and “tails” with probability
0.4. If the coin shows “heads”. we pick a fruitat random from bag 1;
otherwise we pick a fruit at random from bag 2. Your friend flips the coin
(you cannot see the result), picks a fruit at random from the corresponding
bag, and presents you a mango.
What is the probability that the mango was picked from bag 2?
b) Suppose that one has written a computer program that sometimes compiles (8)
and sometimes not (code does not change). You decide to model the
apparent stochasticity (success vs. no success) x of the compiler using a
Bernoulli distribution with parameter μ:
Choose a conjugate prior for the Bernoulli likelihood and compute the
posterior distribution p( μ | x1 , ... ,xN).
OR
18 a) Two dice are rolled. (6)
A = ‘sum of two dice equals 3’
B = ‘sum of two dice equals 7’
C = ‘at least one of the dice shows a 1’
i. What is P(A|C)?
ii. What is P(B|C)?
iii. Are A and C independent? What about B and C?
b) Consider the following bivariate distribution p(x,y) of two discrete random (8)
variables X and Y .
Compute:
i. The marginal distributions p(x) and p(y).
ii. The conditional distributions p(x|Y = y1) and p(y|X = x3).
19 a) Find the extrema of f(x,y,z) = x - y + z subject to g(x,y,z) = x2 + y2 + z2 (8)

=2.
b) Let
Show that x* = (1, 1/2, -1) is optimal for the optimization problem
(6)
OR
20 a) Derive the gradient descent training rule assuming that the target function is (8)
represented as od = w0 + w1x1 + ... + wnxn. Define explicitly the cost/ error
function E, assuming that a set of training examples D is provided, where
each training example d D is associated with the target output td.
b) Find the maximum value of f(x,y,z) = xyz given that g(x,y,z) = x + y + z = 3 (6)
and x,y,z>=0.
***
Teaching Plan
No. of
No Topic Lectures
(49)
Module-I (LINEAR ALGEBRA) 8
1.1 Matrices, Solving Systems of Linear Equations
1
1.2 Vector Spaces 1
1.3 Linear Independence 1
1.4 Basis and Rank (Lecture – 1) 1
1.6 Linear Mappings 1
1.7 Matrix Representation of Linear Mappings 1
1.8 Images and Kernel 1
Module-II (ANALYTIC GEOMETRY, MATRIX 11

DECOMPOSITIONS)
2.1 Norms, Inner Products 1
2.2 Lengths and Distances, Angles and Orthogonality

1
2.3 Orthonormal Basis, Orthogonal Complement 1
2.4 1
Orthogonal Projections – Projection into One Dimensional
Subspaces
2.5 Projection onto General Subspaces. 1
2.6 Gram-Schmidt Orthogonalization 1
2.7 Determinant and Trace, Eigen values and Eigenvectors. 1

2.8 Cholesky Decomposition 1
2.9 Eigen decomposition and Diagonalization 1
2.10 Singular Value Decomposition 1
2.11 Matrix Approximation 1
Module-III (VECTOR CALCULUS) 9
3.1 Differentiation of Univariate Functions, Partial Differentiation and 1
Gradients
3.2 Gradients of Vector Valued Functions (Lecture 1) 1

3.4 Gradients of Matrices 1
3.5 Useful Identities for Computing Gradients 1
3.6 Backpropagation and Automatic Differentiation – Gradients in deep 1
Netwok
3.7 Automatic Differentiation 1
3.8 Higher Order Derivatives 1
3.9 Linearization and Multivariate Taylor Series 1
Module-IV (PROBABILITY AND DISTRIBUTIONS) 10

4.1 Construction of a Probability Space 1
4.2 Discrete and Continuous Probabilities (Probability Density 1

Function, Cumulative Distribution Function)
4.3 Sum Rule, Product Rule 1
4.4 Bayes’ Theorem 1
4.5 Summary Statistics and Independence (Lecture 1) 1

4.7 Bernoulli, Binomial, Uniform (Discrete) Distributions 1
4.8 Uniform (Continuous), Poisson Distributions 1
4.9 Gaussian Distribution 1
4.10 Conjugacy and the Exponential Family (Beta – Bernoulli, Beta – 1
Binomial Conjugacies)
Module-V (OPTIMIZATION) 7
5.1 Optimization Using Gradient Descent. 1
5.2 Gradient Descent With Momentum, Stochastic Gradient Descent 1

5.3 Constrained Optimization and Lagrange Multipliers (Lecture 1) 1
5.5 Convex Optimization 1
5.6 Linear Programming 1

5.7 Quadratic Programming 1
INTRODUCTION TO Year of
CST Category L T P Credit
COMPUTER Introduction
286
NETWORKS MINOR 3 1 0 4 2019
Preamble: This is the second course for awarding B. Tech. Minor in Computer Science and
Engineering with specialization in Networking. Study of this course provides the learners a
clear understanding of how computer networks from local area networks to the massive and
global Internet are built and how they allow the usage of computers to share information and
communicate with one another. This course covers the layers of OSI Reference models and
inter-networking. This course helps the learners to compare and analyze the existing network
technologies and to choose a suitable network design for a given system.
Prerequisite: Data Communication (CST 255)
Explain the features of computer networks, protocols and network design

CO 1 models (Cognitive Knowledge : Understand)
Discuss the design issues of data link layer, data link layer protocols, bridges
CO 2 and switches (Cognitive Knowledge : Understand)
Illustrate wired LAN protocols (IEEE 802.3/4/5) and wireless LAN protocols
CO 3 (IEEE 802.11a/b/g/n, 802.15) (Cognitive Knowledge : Understand)
Select appropriate routing algorithms, congestion control techniques and

CO 4 Quality of Service requirements for a network (Cognitive Knowledge :
Apply)
Illustrate the functions and protocols of network layer, transport layer and
CO 5 application layer in inter-networking (Cognitive Knowledge : Understand)

CO1 ! ! ! !
CO2 ! ! ! ! !
CO3 ! ! ! ! !
CO4 ! ! ! !
CO5 ! ! ! ! ! !

problems
Assessment Pattern
End Semester
Test 1 (Marks Test 2 (Marks
in percentage) in percentage)
percentage)
Remember 40 30 30
Understand 60 50 50
Apply 20 20
Analyse
Evaluate
Create
Mark Distribution
150 50 100 3

question from the partly completed module), each with 7 marks. Out of the 7 questions, a
student should answer any 5.

Syllabus
Module 1
Introduction – Uses of Computer Networks, Network Hardware, Network Software, Reference

Models – The OSI Reference Model, The TCP/IP Reference Model, Comparison of OSI and
TCP/IP Reference models.
Module 2
The Data Link Layer - Data Link layer Design Issues, Error Detection and Correction,
Elementary Data Link Protocols, Sliding Window Protocols, HDLC (High-Level Data Link
Control) Protocol. The Medium Access Control (MAC) Sub layer – The Channel Allocation
Problem, Multiple Access Protocols, Ethernet, Wireless LANs - 802.11 a/b/g/n, Bridges &
Switches.
Module 3
Network Layer Design Issues. Routing Algorithms - The Optimality Principle, Shortest path
routing, Flooding, Distance Vector Routing, Link State Routing, Multicast Routing, Routing for
Mobile Hosts. Congestion Control Algorithms, Quality of Service (QoS) - Requirements,
Techniques for Achieving Good QoS.
Module 4
Network Layer in Internet – The IP Protocol, IP Addresses, Internet Control Message Protocol
(ICMP), Address Resolution Protocol (ARP), Reverse Address Resolution Protocol (RARP),
Bootstrap Protocol (BOOTP), Dynamic Host Configuration Protocol (DHCP). Open Shortest
Path First (OSPF) Protocol, Border Gateway Protocol (BGP), Internet Multicasting, IPv6,
ICMPv6.
Module 5
Transport Layer – The Transport Service – Services Provided to the Upper Layers, Transport
Service Primitives. The User Datagram Protocol (UDP), Transmission Control Protocol (TCP) –
Overview of TCP, TCP Segment Header, Connection Establishment & Release, Connection
Management Modeling, TCP Retransmission Policy, TCP Congestion Control.
Application Layer – File Transfer Protocol (FTP), Domain Name System (DNS), Electronic
mail, MIME, Simple Network Management Protocol (SNMP), World Wide Web – Architectural
Overview.
Text Book
Andrew S. Tanenbaum, Computer Networks, 4/e, PHI (Prentice Hall India).
Reference Books
1. Behrouz A Forouzan, Data Communication and Networking, 4/e, Tata McGraw Hill
2. Larry L Peterson and Bruce S Dave, Computer Networks – A Systems Approach, 5/e,
Morgan Kaufmann.
3. Fred Halsall, Computer Networking and the Internet, 5/e.
4. James F. Kurose, Keith W. Ross, Computer Networking: A Top-Down Approach, 6/e.
5. Keshav, An Engineering Approach to Computer Networks, Addison Wesley, 1998.
6. W. Richard Stevens. TCP/IP Illustrated volume 1, Addison-Wesley, 2005.
7. William Stallings, Computer Networking with Internet Protocols, Prentice-Hall, 2004.
8. Request for Comments (RFC) Pages - IETF -https://www.ietf.org/rfc.html
CourseOutcome1 (CO1): Compare TCP/IP Reference model and OSI Reference model.
CourseOutcome2 (CO2): Distinguish between switches and bridges.
CourseOutcome3 (CO3): Draw and explain the frame format for Ethernet.
CourseOutcome5 (CO4): Discuss remedies for count to infinity problem in routing.
CourseOutcome4 (CO5): Subnet the Class C IP Address 206.16.2.0 so that you have 30
subnets. What is the subnet mask for the maximum number of hosts? How many hosts can
each subnet have?
QP CODE: PAGES: ___
Reg No:_______________
Name:_________________

FOURTH SEMESTER B.TECH DEGREE (MINOR) EXAMINATION, MONTH &
YEAR
Course name : INTRODUCTION TO COMPUTER NETWORKS
PART-A
1. Why Layered Architecture is used in Computer Networks? Define the terms protocol and
interface?
2. What are the different service primitives in Computer Networks?
3. Draw and explain Ethernet frame format.
4. What is the output string when the bit string 0111101111101111110 is subjected to bit
stuffing?
5. Discuss the count to infinity problem in routing.
6. What is flooding? Describe any two situations where flooding is advantageous.
7. What is IP (Internet Protocol) subnetting? Illustrate with example.
8. How many octets does the smallest possible IPv6 (IP version 6) datagram contain?
9. Can TCP (Transmission Control Protocol) be used directly over a network (e.g. an
Ethernet) without using IP? Justify your answer
10. What is the role of SNMP (Simple Network Management Protocol)?
(10x3=30)
Part B
(Answer any one Question from each module. Each question carries 14 Marks)
Module I
11. (a) With a neat diagram, explain the OSI (Open Systems Interconnection) reference
Model. (8)
(b) Compare OSI Reference model and the TCP/IP model (6)
OR
12. (a) Consider two networks providing reliable connection-oriented service. One of them
offers a reliable byte stream and the other offers a reliable message stream. Are they
identical? Justify your answer. (8)
(b) Compare LAN (Local Area Networks), MAN (Metropolitan Area Networks) and
WAN (Wide Area Networks). (6)
Module II
13. (a) Discuss the different strategies used to avoid collisions in CSMA/CA (Carrier Sense
Multiple Access/Collision Avoidance) . (8)
(b) Briefly explain the working of HDLC (High-Level Data Link Control). (6)
OR
14. (a) Explain the working of IEEE 802.11. (10)

(b) Distinguish between Bridges and Switches. (4)
Module III
15. (a) Illustrate Distance Vector Routing Algorithm with an example. (8)
(b) Explain the characteristics of RIP (Routing Information Protocol). (6)
OR
16. (a) Explain an Interior Gateway protocol that uses a link state algorithm to propagate
routing information. (6)
(b) Explain how routing is performed in a Mobile network. (8)
Module IV
17. (a) Explain address resolution problem and RARP (Reverse Address Resolution Protocol)
with an example network. (10)
(b) How IGMP (Internet Group Management Protocol) supports internet multicasting?
Explain. (4)
OR
18. (a) Subnet the class C IP address 195.1.1.0 so that you have 10 subnets with a maximum
of 12 hosts in each subnet. (6)
(b) Draw IPv6 Datagram format and explain its features (8)
Module V
19. (a) Distinguish between TCP and UDP (User Datagram Protocol) header formats. (8)
(b) Explain the principal DNS (Domain Name System) resource record types for IPv4. (6)
OR
20. (a) What is the role of SMTP (Simple Mail Transfer Protocol) in E-mail? (6)
(b) With the help of a basic model explain the working of WWW (World Wide Web). (8)
Teaching Plan
Module 1 (8 Hours)
1.1 Introduction – Uses of Computer Networks. 1
1.2 Network Hardware – Local Area Networks (LAN), 1

Metropolitan Area Networks (MAN), Wide Area Networks
(WAN).
1.3 Network Hardware – Wireless Networks, Home Networks, 1
Internetworks
1.4 Network Software –– Protocol Hierarchies. 1
1.5 Network Software –– Design issues for the layers. 1
1.6 Network Software – Connection Oriented and Connectionless 1

Services, Service Primitives, Relationship of Services to
Protocols.
1.7 Reference Models – The OSI Reference Model 1
1.8 Reference Models – The TCP/IP Reference Model, Comparison 1

of OSI and TCP/IP Reference models
Module 2 (11 Hours)
2.1 Data Link layer Design Issues. 1
2.2 Error Detection and Correction - Error Correcting Codes 1
2.3 Error Detection and Correction - Error Detecting Codes 1
2.4 Elementary Data link Protocols. 1
2.5 Sliding Window Protocols. 1
2.6 HDLC (High-Level Data Link Control) Protocol 1
2.7 The Medium Access Control (MAC) Sub layer – The Channel 1
Allocation Problem, Multiple Access Protocols.
2.8 Ethernet - Ethernet Cabling, Manchester Encoding, The 1
Ethernet MAC Sub layer Protocol, The Binary Exponential
Backoff Algorithm.
2.9 Ethernet - Ethernet Performance, Switched Ethernet, Fast 1
Ethernet, Gigabit Ethernet, IEEE 802.2: Logical Link Control.
2.10 Wireless LANs - 802.11 a/b/g/n. 1
2.11 Bridges & Switches. 1
Module 3 (9 Hours)
3.1 Network Layer Design Issues. 1
3.2 Routing Algorithms - The Optimality Principle, Shortest path 1

routing, Flooding.
3.3 Distance Vector Routing, Link State Routing. 1
3.4 Link State Routing. 1
3.5 Multicast Routing, Routing for Mobile Hosts 1
3.6 Distance Vector Routing, Link State Routing 1

3.7 Congestion control algorithms - General Principles of 1

Congestion Control, Congestion Prevention Policies,
Congestion Control in Virtual-Circuit Subnets
3.8 Congestion control algorithms - Congestion Control in 1
Datagram Subnets, Load Shedding, Jitter Control
3.9 Quality of Service – Requirements, Techniques for Achieving 1
Good Quality of Service.
Module 4 (9 Hours)
4.1 Network layer in internet, IP Protocol 1
4.2 IP Addresses – Subnets, Classless Inter Domain Routing 1

(CIDR)
4.3 IP Addresses - Network Address Translation (NAT) 1
4.4 Internet Control Message Protocol (ICMP), Address Resolution 1

Protocol (ARP), Reverse Address Resolution Protocol (RARP),
4.5 Bootstrap Protocol (BOOTP), Dynamic Host Configuration 1
Protocol (DHCP)
4.6 Open Shortest Path First (OSPF) Protocol 1
4.7 Border Gateway Protocol (BGP) 1
4.8 Internet Multicasing. 1
4.9 IPv6, Internet Control Message Protocol version 6 (ICMPv6). 1
Module 5 (8 Hours)
5.1 The Transport Service – Services Provided to the Upper Layers, 1

Transport Service Primitives. The User Datagram Protocol
(UDP)
5.2 Transmission Control Protocol (TCP) – Overview of TCP, TCP 1

Segment Header, Connection Establishment & Release,
Connection Management Modeling.
5.3 TCP Retransmission Policy, TCP Congestion Control. 1
5.4 Application Layer – File Transfer Protocol (FTP). 1
5.5 Domain Name System (DNS). 1

5.6 Electronic Mail. 1
5.7 Simple Network Management Protocol (SNMP) 1
5.8 World Wide Web – Architectural Overview 1

SEMESTER -4
HONOURS
Year of
Introduction
CST 292 Number Theory Honours 4 0 0 4 2019
Preamble: This is the foundational course for awarding B. Tech. Honours in Computer Science and
Engineering with specialization in Security in Computing. The purpose of this course is to create
awareness among learners about the important areas of number theory used in computer science. This
course covers Divisibility & Modular Arithmetic, Primes & Congruences, Euler's Function, Quadratic
Residues and Arithmetic Functions, Sum of Squares and Continued fractions. Concepts in Number
Theory help the learner to apply them eventually in practical applications in Computer organization &
Security, Coding & Cryptography, Random number generation, Hash functions and Graphics.
Prerequisite: A sound background in Higher Secondary School Mathematics
Illustrate modular arithmetic operations, methods and techniques (Cognitive Knowledge

CO1
Level:Understand)
Use the methods - Induction, Contraposition or Contradiction to verify the correctness of
CO2
mathematical assertions (Cognitive Knowledge Level: Apply)
Utilize theorems and results about prime numbers, congruences, quadratic residues and
CO3 integer factorization for ensuring security in computing systems (Cognitive Knowledge
Level: Analyse)
Illustrate uses of Chinese Remainder Theorem & Euclidean algorithm in Cryptography and
CO4
Security (Cognitive Knowledge Level: Apply)
Explain applications of arithmetic functions in Computer Science (Cognitive Knowledge
CO5
Level:Understand)
Implement Number Theoretic Algorithms using a programming language (Cognitive
CO6
CO1 ! ! ! ! ! !
CO2 ! ! ! ! !
CO3 ! ! ! ! ! !
CO4 ! ! ! ! ! !
CO5 ! ! ! ! ! !
CO6
! ! ! ! ! ! !

problems

Assessment Pattern

Test1 (Percentage) Test2 (Percentage) (Percentage)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyse
Evaluate
Create
Mark Distribution
150 50 100 3 hours

First Internal Examination shall be preferably conducted after completing the first half of the syllabus
and the Second Internal Examination shall be preferably conducted after completing remaining part of
the syllabus.
There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each
from the completed modules and 1 question from the partly covered module), having 3 marks for each
question adding up to 15 marks for part A. Students should answer all questions from Part A. Part B
contains 7 questions (preferably, 3 questions each from the completed modules and 1 question from
the partly covered module), each with 7 marks. Out of the 7 questions in Part B, a student should
answer any 5.
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from each
module, having 3 marks for each question. Students should answer all questions. Part B contains 2
questions from each module of which a student should answer any one. Each question can have
maximum 2 sub-divisions and carries 14 marks.
SYLLABUS
Module 1
Divisibility and Modular Arithmetic:
Finite Fields – Groups, Rings and Fields.
Divisibility - Divisibility and Division Algorithms, Well ordering Principle,Bezout’s Identity.
Modular Arithmetic- Properties, Euclid's algorithm for the greatest common divisor, Extended Euclid’s
Algorithm, Least Common multiple, Solving Linear Diophantine Equations, Modular Division.
Module 2
Primes and Congruences:
Prime Numbers-Prime Numbers andprime-powerfactorization, Fermat and Mersenne primes.,

Primality testing and factorization.
Congruences-Linear congruences, Simultaneous linear congruences, Chinese Remainder Theorem,

Fermat’s little theorem, Wilson's theorem.
Module 3
Congruences with a Prime-Power Modulus&Euler's Function:
Congruences with a Prime-Power Modulus-Arithmetic modulo p, Pseudoprimes and Carmichael

numbers, Solving congruences modulo prime powers.
Euler's Function-Euler’s Totient function, Applications of Euler’s Totient function, Traditional

Cryptosystem, Limitations.
The Group of units- The group Un,Primitive roots, Existence of primitive roots, Applications of
primitive roots.
Module 4
Quadratic Residues & Arithmetic Functions :
Quadratic Residues- Quadratic Congruences, The group of Quadratic residues, Legendre symbol,
Jacobi Symbol, Quadratic reciprocity.
Arithmetic Functions- Definition and examples, Perfect numbers, Mobius function and its properties,
Mobius inversion formula, The Dirichlet Products.
Module 5
Sum of Squares and Continued Fractions:
Sum of Squares- Sum of two squares, The Gaussian Integers, Sum of three squares, Sum of four
squares.
Continued Fractions -Finite continued fractions, Infinite continued fractions, Pell's Equation, Solution
of Pell’s equation by continued fractions.
Text Books
1. G.A. Jones & J.M. Jones, Elementary Number Theory, Springer UTM, 2007.
2. Joseph Silverman, A Friendly introduction to Number Theory, Pearson Ed. 2009.

Reference Books
1. William Stallings, Cryptography and Network Security Principles and Practice, Pearson Ed.
2. Tom M.Apostol, ‘Introduction to Analytic Number Theory’, Narosa Publishing House Pvt. Ltd,
New Delhi, (1996).
3. Neal Koblitz, A course in Number Theory and Cryptography, 2nd Edition, Springer ,2004.
Course Outcome 1 (CO1): Describe the properties of modular arithmetic and modulo operator.
Course Outcome 2 (CO2): Prove that the equation y2 = x3 - 2 has only the integer solution (3, ±5).
Course Outcome 3 (CO3): State the law of reciprocity for Jacobi symbols and use it to determine
whether 888 is a quadratic residue or non residue of the prime 1999.
Course Outcome 4 (CO4): Using Chinese remainder theorem, solve the system of congruence x
≡2(mod 3), x ≡3(mod 5), x ≡2(mod 7)
Course Outcome 5(CO5): State and prove Dirichlet product.
Course Outcome 6 (CO6):Use extended Euclid's algorithm to solve Diophantine equations

efficiently. Given three numbers a>0, b>0, and c, the algorithm should return some x and y such that
a x + b y = c.

QP CODE: PAGES: 03
RegNo : …............................... Name :………..……………

FOURTH SEMESTER BTECH (HONOURS) DEGREE EXAMINATION, MONTH &YEAR
Course Code:CST 292 Course

Name: Number Theory
PART A
Answer all Questions. Each question carries 3 Marks (10x3=30)

1. State and prove well ordering principle.
2. Find gcd d of x=525 and y=231 and express d as ax + by where a and b are integers.
3. Solve the congruence equation 103 x≡ 57 (mod 211).
4. Use Fermat’s Little theorem to show that 91 is not a prime.
5. If m is relatively prime to n , show that Φ(mn) = Φ(m) Φ(n).
6. Explain how public key cryptography can be used for digital signatures.
7. Define Mobius function and prove Mobius function is a multiplicative.
8. State and prove Dirichlet product.
9. Show that every prime of the form 4k+1 canbe represented uniquely as the sum of two
squares.
10. Find the continued fraction representation of the rational number 55/89.
Part B
Answer any one Question from each module.

Each question carries 14 Marks
11. (a) State the Euclidean algorithm and its extension with an example. (7)
(b) Find all the solutions of 24x + 34 y = 6. (7)
OR
12. (a) Describe the properties of modular arithmetic and modulo operator. (7)
(b) Explain Extended Euclidean algorithm. Using the algorithm find the
multiplicative inverse of 135 mod 61 (7)
13. (a) State and prove Wilson’s theorem . (7)

(b) Explain Fermat’s factorization method and use it to factor 809009 (7)
OR
14. (a) Using Chinese remainder theorem, solve the system of congruences,
x ≡2(mod 3), x ≡3(mod 5), x ≡2(mod 7) (7)
(b) Define Fermat primes. Show that any two distinct Fermat numbers are
Relatively prime. (7)
15. (a) Distinguish between public key and private key encryption techniques.
Also point out the merits and demerits of both. (7)
(b) Define Carmichael number and show that a Carmichael number must
be the product of at least three distinct primes. (7)
OR
16. (a)Define a pseudo prime to a base and find all non trivial bases for which
15 is a pseudo prime. (6)
(b) Find an element of
i) order 5 modulo 11 ii) order 4 modulo 13
iii) order 8 modulo 17 iv) order 6 modulo 19 (8)
17. (a) Determine the quadratic residues and non residues modulo 17. Also
determine whether 219 is a quadratic residue or non residue of the prime 383.
(8)
(b) State the law of quadratic reciprocity. Determine those odd primes p for
which 3 is a quadratic residue and those for which it is a non residue. (6)
OR
18. (a) State and prove properties of Legendre’s symbol. (7)
(b) State the law of reciprocity for Jacobi symbols and using it determine
whether 888 is a quadratic residue or non residue of the prime 1999. (7)
19. (a) Prove that the equation y2 = x3 - 2 has only the integer solution (3 , ±5). (7)
(b) Define a Gaussian integer. Factorize the Gaussian integer 440 − 55i. (7)
OR
20. (a) If m, and n can be expressed as sum of four squares, then show that mn can
also be expressed the sum of four squares. (7)
(b) Find all the solutions of the Diophantine equation x2 – 6 y 2 =1. (7)
Teaching Plan
Module 1: Divisibility and Euclidean Algorithm 9 hours
1.1 Finite Fields – Groups and Rings. 1 hour
1.2 Finite Fields – Fields. 1 hour
1.3 Divisibility and Division Algorithms, Well ordering Principle. 1 hour
Decimal Expansion of a positive Integer, Greatest Common Divisor,

1.4 1 hour
Bezout’s Theorem.
Modular Arithmetic- Properties of congruences, Modular Arithmetic
1.5 1 hour
Operations, Properties of Modular Arithmetic.
Euclid's algorithm for the greatest common divisor, Extended Euclid’s
1.6 1 hour
Algorithm.
1.7 Solving Linear Diophantine Equations. 1 hour
1.8 Least Common multiple and Modular Division. 1 hour
Implementation of Euclid’s algorithm, Extended Euclid’s Algorithm and

1.9 1 hour
solution of Linear Diophantine Equations.
Module 2: Primes and Congruences 9 hours
2.1 Prime Numbersand prime-powerFactorization. 1 hour
2.2 Fermat and Mersenne primes. 1 hour
2.3 Primality testing and factorization, Miller -Rabin Test for Primality. 1 hour
2.4 Pollard's Rho Method for Factorization, Fermat’s Factorization. 1 hour

2.5 Linear congruences, Simultaneous linear congruences. 1 hour
2.6 Chinese Remainder Theorem. 1 hour
2.7 Implementation of Chinese Remainder Theorem. 1 hour
2.8 Fermat's little theorem. 1 hour
2.9 Wilson's theorem. 1 hour
Module 3: Congruences with a Prime-Power Modulus &Euler's Function 9 hours
3.1 Congruences with a Prime-Power Modulus, Arithmetic modulo p. 1 hour
3.2 Pseudo-primes and Carmichael numbers. 1 hour
3.3 Solving congruences modulo prime powers. 1 hour
3.4 Definition of Euler Totient function, Examples and properties. 1 hour
3.5 Multiplicativity of Euler's Totient function. 1 hour
3.6 Applications of Euler’s function, Euler’s Theorem. 1 hour
3.7 Traditional Cryptosystem, Limitations, Public Key Cryptography. 1 hour
3.8 The Group of Units, Primitive Roots. 1 hour
3.9 Existence of primitive roots for Primes, Applications of primitive roots. 1 hour
Module 4: Quadratic Residues and Arithmetic Functions 9 hours
4.1 Quadratic congruences, The group of Quadratic Residues. 1 hour
4.2 Legendre symbol, Jacobi Symbol. 1 hour
4.3 Quadratic reciprocity. 1 hour
4.4 Quadratic residues for prime-power moduli. 1 hour
4.5 Arithmetic Functions: Definition and examples. 1 hour

4.6 Perfect numbers, Definition and proposition. 1 hour
4.7 Mobius inversion formula., application of the Mobius inversion formula. 1 hour
4.8 Mobius function and its properties. 1 hour
4.9 The Dirichlet Product, Definition and proof. 1 hour
Module 5: Sum of Squares and Continued Fractions 9 hours
5.1 Sum of Squares, Sum of two squares. 1 hour
5.2 The Gaussian Integers. 1 hour
5.3 Sum of three squares. 1 hour
5.4 Sum of four squares. 1 hour
5.5 Continued Fractions, Finite continued fractions. 1 hour
5.6 Continued Fractions, Finite continued fractions. 1 hour
5.7 Infinite continued fractions. 1 hour
5.8 Pell's Equation, Definition. 1 hour
5.9 Solution of Pell's equation by continued fractions. 1 hour

CODE COMPUTATIONAL CATEGORY L T P CREDIT

CST294 FUNDAMENTALS FOR VAC 3 1 0 4
MACHINE LEARNING
Preamble: This is the foundational course for awarding B. Tech. Honours in Computer
Science and Engineering with specialization in Machine Learning. The purpose of this
course is to introduce mathematical foundations of basic Machine Learning concepts among
learners, on which Machine Learning systems are built. This course covers Linear
Algebra, Vector Calculus, Probability and Distributions, Optimization and Machine Learning
problems. Concepts in this course help the learners to understand the mathematical principles
in Machine Learning and aid in the creation of new Machine Learning solutions, understand
& debug existing ones, and learn about the inherent assumptions & limitations of the current
methodologies.
Make use of the concepts, rules and results about linear equations, matrix algebra,
CO 1 vector spaces, eigenvalues & eigenvectors and orthogonality & diagonalization to
solve computational problems (Cognitive Knowledge Level: Apply)
Perform calculus operations on functions of several variables and matrices,
CO 2 including partial derivatives and gradients (Cognitive Knowledge Level: Apply)
Utilize the concepts, rules and results about probability, random variables, additive
CO 3 & multiplicative rules, conditional probability, probability distributions and Bayes’
theorem to find solutions of computational problems (Cognitive Knowledge Level:
Apply)
Train Machine Learning Models using unconstrained and constrained optimization
CO 4
methods (Cognitive Knowledge Level: Apply)
CO 1 √ √ √ √ √
CO 2 √ √ √ √
CO 3 √ √ √ √ √
CO 4 √ √ √ √ √ √

Accreditation
PO# Broad PO# Broad
PO PO
problems

Assessment Pattern

Bloom’s Category
1 2 Examination
Remember 20% 20% 20%
Understand 40% 40% 40%

Apply 40% 40% 40%
Analyse
Evaluate
Create
Mark Distribution
150 50 100 3 hours
contains 10 questions with 2 questions from each module, having 3 marks for each question.
14 marks.
Syllabus
Module 1
LINEAR ALGEBRA: Systems of Linear Equations – Matrices, Solving Systems of Linear

Equations. Vector Spaces –Vector Spaces, Linear Independence, Basis and Rank. Linear
Mappings – Matrix Representation of Linear Mappings, Basis Change, Image and Kernel.
Module 2
ANALYTIC GEOMETRY, MATRIX DECOMPOSITIONS: Norms, Inner Products,

Lengths and Distances, Angles and Orthogonality, Orthonormal Basis, Orthogonal
Complement, Orthogonal Projections – Projection into One Dimensional Subspaces,
Projection onto General Subspaces, Gram-Schmidt Orthogonalization.
Determinant and Trace, Eigenvalues and Eigenvectors, Cholesky Decomposition, Eigen

decomposition and Diagonalization, Singular Value Decomposition, Matrix Approximation.
Module 3
VECTOR CALCULUS : Differentiation of Univariate Functions - Partial Differentiation

and Gradients, Gradients of Vector Valued Functions, Gradients of Matrices, Useful
Identities for Computing Gradients. Back propagation and Automatic Differentiation –
Gradients in Deep Network, Automatic Differentiation.Higher Order Derivatives-
Linearization and Multivariate TaylorSeries.
Module 4
Probability and Distributions : Construction of a Probability Space - Discrete and

Continuous Probabilities, Sum Rule, Product Rule, and Bayes’ Theorem. Summary Statistics
and Independence – Gaussian Distribution - Conjugacy and the Exponential Family - Change
of Variables/Inverse Transform.
Module 5
Optimization : Optimization Using Gradient Descent - Gradient Descent With Momentum,

Stochastic Gradient Descent. Constrained Optimization and Lagrange Multipliers - Convex
Optimization - Linear Programming - Quadratic Programming.
Text book:
1.Mathematics for Machine Learning by Marc Peter Deisenroth, A. Aldo Faisal, and
Cheng Soon Ong published by Cambridge University Press (freely available at https://
mml - book.github.io)
Reference books:
1. Linear Algebra and Its Applications, 4th Edition by Gilbert Strang
2. Linear Algebra Done Right by Axler, Sheldon, 2015 published bySpringer
3. Introduction to Applied Linear Algebra by Stephen Boyd and Lieven Vandenberghe,

2018 published by Cambridge UniversityPress
4. Convex Optimization by Stephen Boyd and Lieven Vandenberghe, 2004 published by

Cambridge UniversityPress
5. Pattern Recognition and Machine Learning by Christopher M Bishop, 2006, published

bySpringer
6. Learning with Kernels – Support Vector Machines, Regularization, Optimization, and

Beyond by Bernhard Scholkopf and Smola, Alexander J Smola, 2002, published by
MIT Press
7. Information Theory, Inference, and Learning Algorithms by David J. C MacKay, 2003

published by Cambridge UniversityPress
8. Machine Learning: A Probabilistic Perspective by Kevin P Murphy, 2012 published by

MITPress.
9. The Nature of Statistical Learning Theory by Vladimir N Vapnik, 2000, published by

Springer
1. FindthesetSofallsolutionsinxofthefollowinginhomogeneouslinearsystemsAx
= b, where A and b are defined as follows:
2. Determine the inverses of the following matrix ifpossible

eigenvalue of the following matrix
5. Find the singular value decomposition (SVD) of the following matrix

1. For a scalar function f(x, y, z ) = x2 +3y2 +2z2, find the gradient and its magnitude at
the point (1, 2, -1).
2. Find the maximum and minimum values of the function f(x,y)=4x+4y-x2-y2
subject to the condition x2 + y2 <= 2.
3. Suppose you were trying to minimize f(x, y) = x2+ 2y + 2y2. Along what vector
should you travel from (5,12)?
4. Find the second order Taylor series expansion for f(x, y) = (x + y)2about (0 ,0).
5. Find the critical points of f(x, y) = x2 –3xy+5x-2y+6y2+8.
6. Compute the gradient of the Rectified Linear Unit (ReLU) function ReLU(z) =
max(0 , z).
7. Let L = ||Ax - b||22, where A is a matrix and x and b are vectors. Derive dL in terms of
dx.
1. Let J and T be independent events, where P(J)=0.4 andP(T)=0.7.
i. Find P(J∩T)
ii. Find P(JT)

2. Let A and B be events such that P(A)=0.45 , P(B)=0.35 and P(A ∪ B)=0.5. Find
P(A∣B).
3. A random variable R has the probability distribution as shown in the following table:
i. Given that E(R)=2.85, find a andb.

ii. Find P(R>2).

4. A biased coin (with probability of obtaining a head equal to p> 0) is tossed repeatedly
and independently until the first head is observed. Compute the probability that the
first head appears at an even numbered toss.
5. Two players A and B are competing at a trivia quiz game involving a series of
questions. On any individual question, the probabilities that A and B give the correct
answer are p and q respectively, for all questions, with outcomes for different
questions being independent. The game finishes when a player wins by answering a
question correctly. Compute the probability that A winsif
i. A answers the firstquestion,

6. A coin for which P(heads) = p is tossed until two successive tails are obtained. Find
the probability that the experiment is completed on the nth toss.
1. Find the extrema of f(x, y) = x subject to g(x, y) = x2 + 2y2 =3.

2. Maximize the function f(x, y, z) = xy + yz + xz on the unit sphere g(x, y, z) = x2 + y2 +
z2 =1.
3. Provide necessary and sufficient conditions under which a quadratic optimization
problem be written as a linear least squaresproblem.
4. Consider the univariate function f(x) = x3 + 6x2 - 3x - 5. Find its stationary points and
indicate whether they are maximum, minimum, or saddlepoints.
5. Consider the update equation for stochastic gradient descent. Write down the update
when we use a mini-batch size ofone.
6. Consider the function
i. Is f(x) a convex function? Justify youranswer.
ii. Is (1 , -1) a local/global minimum? Justify youranswer.

7. Is the function f(x, y) = 2x2 + y2 + 6xy - x + 3y - 7 convex, concave, or neither?
Justify youranswer.
8. Consider the following convex optimization problem
Subject to the constraint x + y >= 4, x, y >= 1.
Derive an explicit form of the Lagrangian dual problem.

9. Solve the following LP problem with the simplexmethod.
subject to the constraints

QP Code : Total Pages : 5

Reg No.:_______________ Name:__________________________
IV SEMESTER B.TECH (HONOURS) DEGREE EXAMINATION, MONTH and YEAR
Course Name: COMPUTATIONAL FUNDAMENTALS FOR MACHINE LEARNING
PART A
Answer all questions, each carries3 marks. Marks
1 Show that with the usual operation of scalar multiplication but with addition
on reals given by x # y = 2(x + y) is not a vector space.
2 Are the following sets of vectors linearly independent? Explain your
answer.
3 1 1
Find the angle between the vectors 𝑥𝑥 = � �and 𝑦𝑦 = � �.
1 2
4 Find the eigen values of the following matrix in terms of k. Can you find an
eigen vector corresponding to each of the eigen values?
5 Let f(x, y, z) = xyer, where r = x2+z2-5. Calculate the gradient of f at the

point (1, 3, -2).
6 Compute the Taylor polynomials Tn, n =0 , ... , 5 of f(x) = sin(x) +
cos(x) at x0 = 0.
7 Let X be a continuous random variable with probability density function on
0 <= x <= 1 defined by f(x) = 3x2. Find the pdf of Y =X2.
8 Show that if two events A and B are independent, then A and B' are
independent.
9 Explain the principle of the gradient descent algorithm.
10 Briefly explain the difference between (batch) gradient descent and
stochastic gradient descent. Give an example of when you might prefer one
over the other.
PART B
11 a) i.Find all solutions to the system of linearequations (4)
ii. Prove that all vectors orthogonal to [2,−3,1]T forms a subspace (4)
W of R3. What is dim (W) and why?

b) A set of n linearly independent vectors in Rn forms a basis. Does the set of (6)
vectors (2, 4,−3),(0, 1, 1),(0, 1,−1) form a basis for R3? Explain
yourreasons.
OR
𝑥𝑥1
12 a) Find all solutions in 𝑥𝑥 = �𝑥𝑥2� ∈ 𝑅𝑅 3 of the equation system 𝐴𝐴𝐴𝐴 = 12𝑥𝑥 , (7)
𝑥𝑥3
6 4 3
where 𝐴𝐴 = �6 0 9� and ∑3𝑖𝑖=1 xi = 1.
0 8 0
b) Consider the transformation T (x, y) = (x + y, x + 2y, 2x + 3y). Obtain ker T (7)
and use this to calculate the nullity. Also find the transformation matrix
forT.
13 a) Use the Gramm-Schmidt process to find an orthogonal basis for the column (7)
space of the following matrix.
b) Find the SVD of the matrix. (7)

2 2
� �
−1 −1
OR
14 a) i. Let L be the line through the origin in R2 that is parallel to the vector (6)
[3, 4]T. Find the standard matrix of the orthogonal projection onto L.
Also find the point on L which is closest to the point (7, 1) and find the
point on L which is closest to the point (-3 , 5).
ii. Find the rank-1 approximation of
b) i. Find an orthonormal basis of R3 consisting of eigenvectors for the (8)

following matrix.
ii. Finda3×3orthogonalmatrixSanda3×3diagonalmatrixD
such that A = SDST
15 a) Askierisonamountainwithequationz=100–0.4x2–0.3y2,wherez (8)
denotes height.
i. The skier is located at the point with xy-coordinates (1, 1), and wants
to ski downhill along the steepest possible path. In which direction
(indicated by a vector (a, b) in the xy-plane) should the skier
beginskiing.
ii. The skier begins skiing in the direction given by the xy-vector (a, b)
you found in part (i), so the skier heads in a direction in space given
by the vector (a, b, c). Find the value of c.
b) Find the linear approximation to the function f(x,y) = 2 - sin(-x - 3y) at the (6)
point (0 , π), and then use your answer to estimate f(0.001 , π).
OR
16 a) Let g be the function given by (8)
i. Calculate the partial derivatives of g at (0,0).

ii. Show that g is not differentiable at (0,0).
b) Find the second order Taylor series expansion for f(x,y) =e-(x2+y2) cos(xy) (6)
about (0 , 0).
17 a) There are two bags. The first bag contains four mangos and two apples; the (6)
second bag contains four mangos and four apples. We also have a biased
coin, which shows “heads” with probability 0.6 and “tails” with probability
0.4. If the coin shows “heads”. we pick a fruitat random from bag 1;
otherwise we pick a fruit at random from bag 2. Your friend flips the coin
(you cannot see the result), picks a fruit at random from the corresponding
bag, and presents you a mango.
What is the probability that the mango was picked from bag 2?
b) Suppose that one has written a computer program that sometimes compiles (8)
and sometimes not (code does not change). You decide to model the
apparent stochasticity (success vs. no success) x of the compiler using a
Bernoulli distribution with parameter μ:
Choose a conjugate prior for the Bernoulli likelihood and compute the
posterior distribution p( μ | x1 , ... ,xN).
OR
18 a) Two dice are rolled. (6)
A = ‘sum of two dice equals 3’
B = ‘sum of two dice equals 7’
C = ‘at least one of the dice shows a 1’
i. What is P(A|C)?
ii. What is P(B|C)?
iii. Are A and C independent? What about B and C?
b) Consider the following bivariate distribution p(x,y) of two discrete random (8)
variables X and Y .
Compute:
i. The marginal distributions p(x) and p(y).
ii. The conditional distributions p(x|Y = y1) and p(y|X = x3).
19 a) Find the extrema of f(x,y,z) = x - y + z subject to g(x,y,z) = x2 + y2 + z2 (8)

=2.
b) Let
Show that x* = (1, 1/2, -1) is optimal for the optimization problem
(6)
OR
20 a) Derive the gradient descent training rule assuming that the target function is (8)
represented as od = w0 + w1x1 + ... + wnxn. Define explicitly the cost/ error
function E, assuming that a set of training examples D is provided, where
each training example d D is associated with the target output td.
b) Find the maximum value of f(x,y,z) = xyz given that g(x,y,z) = x + y + z = 3 (6)
and x,y,z>=0.
***
Teaching Plan
No. of
No Topic Lectures
(49)
Module-I (LINEAR ALGEBRA) 8
1.1 Matrices, Solving Systems of Linear Equations
1
1.2 Vector Spaces 1
1.3 Linear Independence 1
1.6 Linear Mappings 1
1.7 Matrix Representation of Linear Mappings 1
1.8 Images and Kernel 1
Module-II (ANALYTIC GEOMETRY, MATRIX 11

DECOMPOSITIONS)
2.1 Norms, Inner Products 1
2.2 Lengths and Distances, Angles and Orthogonality

1
2.3 Orthonormal Basis, Orthogonal Complement 1
2.4 1
Orthogonal Projections – Projection into One Dimensional
Subspaces
2.5 Projection onto General Subspaces. 1
2.6 Gram-Schmidt Orthogonalization 1
2.7 Determinant and Trace, Eigen values and Eigenvectors. 1
2.8 Cholesky Decomposition 1
2.9 Eigen decomposition and Diagonalization 1
2.10 Singular Value Decomposition 1
2.11 Matrix Approximation 1
Module-III (VECTOR CALCULUS) 9

3.1 Differentiation of Univariate Functions, Partial Differentiation and 1
Gradients
3.4 Gradients of Matrices 1

3.5 Useful Identities for Computing Gradients 1
3.6 Backpropagation and Automatic Differentiation – Gradients in deep 1
Netwok
3.7 Automatic Differentiation 1
3.8 Higher Order Derivatives 1
3.9 Linearization and Multivariate Taylor Series 1
Module-IV (PROBABILITY AND DISTRIBUTIONS) 10

4.1 Construction of a Probability Space 1
4.2 Discrete and Continuous Probabilities (Probability Density 1
Function, Cumulative Distribution Function)
4.3 Sum Rule, Product Rule 1
4.4 Bayes’ Theorem 1
4.7 Bernoulli, Binomial, Uniform (Discrete) Distributions 1
4.8 Uniform (Continuous), Poisson Distributions 1
4.9 Gaussian Distribution 1

4.10 Conjugacy and the Exponential Family (Beta – Bernoulli, Beta – 1
Binomial Conjugacies)
Module-V (OPTIMIZATION) 7
5.1 Optimization Using Gradient Descent. 1
5.2 Gradient Descent With Momentum, Stochastic Gradient Descent 1

5.5 Convex Optimization 1
5.6 Linear Programming 1
5.7 Quadratic Programming 1

YEAR OF
Category L T P CREDIT
CST Principles of Program INTRODUCTION
296 Analysis and Verification
HONOURS 3 1 0 4 2019
Preamble: This is the foundational course for awarding B. Tech. Honours in Computer Science
and Engineering with specialization in Formal Methods. Program Analysis and Program
Verification are two important areas of study, discussing Methods, Technologies and Tools to
ensure reliability and correctness of software systems. The syllabus for this course is prepared
with the view of introducing the Foundational Concepts, Methods and Tools in Program Analysis
and Program Verification.
Prerequisite: Topics covered in the course Discrete Mathematical Structures (MAT 203).
Explain the concepts and results about Lattices, Chains, Fixed Points, Galois
Connections, Monotone and Distributive Frameworks, Hoare Triples, Weakest
CO1
Preconditions, Loop Invariants and Verification Conditions to perform Analysis and
Verification of programs (Cognitive knowledge level: Understand)
Illustrate methods for doing intraprocedural/interprocedural Data flow Analysis for a

CO2
given Program Analysis problem (Cognitive knowledge level: Analyse)
Formulate an Abstract Interpretation framework for a given Data flow Analysis
CO3 problem and perform the analysis using the tool WALA (Cognitive knowledge level:
Analyse)
Use Kildall’s Algorithm to perform Abstract Interpretation of Programs and compare

CO4 the results obtained by the Algorithm on Monotone and Distributive Frameworks
(Cognitive knowledge level: Apply)
Explain the concept of Loop Invariants and use them in Hoare Triple based Weakest
CO5 Precondition analysis to verify the total correctness of a code segment (Cognitive
knowledge level: Apply)
Use the tool VCC to specify and verify the correctness of a C Program with respect to
CO6
a given set of properties (Cognitive knowledge level: Analyse)
1
CO1
CO2
CO3
CO4
CO5
CO6

problems

2
Assessment Pattern:

End Semester
Bloom’s Category Test 1 Test 2 Examination Marks
(Percentage) (Percentage)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3 hours
Attendance : 10 Marks
Continuous Assessment Tests : 25 Marks
Assignment : 15 Marks
the second series test shall be preferably conducted after completing the remaining part of the
syllabus.
3
each module, having 3 marks for each question. Students should answer all questions from Part
A. Part B contains 2 questions from each module of which a student should answer any one, each
question carries 14 marks. Each question in part B can have a maximum 2 sub-divisions.
SYLLABUS
Module 1
Mathematical Foundations – Partially Ordered Set, Complete Lattice, Construction of

Complete Lattices, Chains, Fixed Points, Knaster-Tarski Fixed Point Theorem.
Module 2
Introduction to Program Analysis – The WHILE language, Reaching Definition Analysis, Data
Flow Analysis, Abstract Interpretation, Algorithm to find the least solutions for the Data Flow
Analysis problem.
Module 3
Intraprocedural DataFlow Analysis – Available Expressions Analysis, Reaching Definitions

Analysis, Very Busy Expressions Analysis, Live Variable Analysis, Derived Data Flow
Information, Monotone and Distributive Frameworks, Equation Solving - Maximal Fixed Point
(MFP) and Meet Over all Paths (MOP) solutions.
Interprocedural Data Flow Analysis - Structural Operational Semantics, Intraprocedural versus

Interprocedural Analysis, Making Context Explicit, Call Strings as Context, Flow Sensitivity
versus Flow Insensitivity, Implementing Interprocedural Data-flow Analysis using the Tool
WALA.
4
Module 4
Abstract Interpretation - A Mundane Approach to Correctness, Approximations of Fixed

Points, Galois Connections, Systematic Design of Galois Connections, Induced Operations,
Kildall’s Algorithm for Abstract Interpretation.
Module 5
Program Verification - Why should we Specify and Verify Code, A framework for software
verification - A core programming Language, Hoare Triples, Partial and Total Correctness,
Program Variables and Logical Variables, Proof Calculus for Partial Correctness, Loop
Invariants, Verifying code using the tool VCC (Verifier for Concurrent C).
Text Books
1. Flemming Nielson, Henne Nielson and Chris Kankin, Principles of Program Analysis,
Springer (1998).
2. Michael Hutch and Mark Ryan, Logic in Computer Science - Modeling and Reasoning
about Systems, Cambridge University Press, Second Edition.
References
1. Julian Dolby and Manu Sridharan, Core WALA Tutorial (PLDI 2010), available online at
http://wala.sourceforge.net/files/PLDI_WALA_Tutorial.pdf
2. Ernie & Hillebrand, Mark & Tobies, Stephan (2012), Verifying C Programs: A VCC
Tutorial.
5
1. Find a lattice to represent the data states of a given program and propose a sound abstract
interpretation framework to do a given analysis on the program.
2. When is an abstract interpretation framework said to be sound? Illustrate with an
example.
3. When is an abstract interpretation framework said to be precise? Illustrate with an
example.
1. Illustrate how one can do Intraprocedural Available Expression Analysis on a program.

2. Illustrate how one can do Intraprocedural Reaching Definition Analysis on a program.
3. Illustrate how one can do Intraprocedural Live Variable Analysis on a program.
1. Illustrate how one can do Interprocedural Data Flow Analysis using the tool WALA.
1. Illustrate the working of Kildall’s algorithm to do Intraprocedural Available Expression

Analysis on a program.
2. Compare the results obtained by applying Kildall’s algorithms for Abstract Interpretation
in Monotone and Distributive Frameworks.
1. Illustrate the process of obtaining verification conditions (VCs) using weakest

precondition analysis.
2. Explain the concepts of partials and total correctness of programs.
3. Explain the necessity of obtaining loop invariants in verifying the total correctness of a
program.
1. Using the tool VCC prove that a given code segment satisfies a given property.
6
QP CODE: PAGES:3
Reg No:______________ Name :______________
4th SEMESTER B.TECH DEGREE (HONOURS) EXAMINATION, MONTH & YEAR
Course Name: Principles of Program Analysis and Verification
PART A
1. What is a complete lattice? Give an example of a complete lattice.

2. Show that every chain is a lattice.
3. Write a program in while language to find the factorial of a number. Explain the
statements of your program.
4. Consider a program that calculates x! y through repeated multiplications. Draw the flow
graph of the program.
5. What is Available Expression (AE) analysis? Give an application for AE analysis.
6. What is Live variable (LV) analysis? Give an application for LV analysis.
7. Let P be a program analysis problem (like LV, AE etc.) and (A,
! FA, γAC ) and (B,
! FB, γBC )
be two abstract interpretations such that B ! is more abstract than A! . Let α
! and γ! be the
abstraction and concretization functions between A ! and B
! . Then, what are the conditions
required for !α and !γ to form a Galois Connection?
8. When is Kildall’s algorithm for abstract interpretation guaranteed to terminate? Justify
your answer.
9. Is it possible to verify total correctness of a program using Hoare Logic? If yes, how is it
possible?
10. Define loop invariant. Show a simple loop with a loop invariant.
7
PART B
11.
a. What is an infinite ascending chain in a lattice? Show an example lattice with an
infinite ascending chain. Is it possible for a complete lattice to contain an infinite
ascending chain? (7 marks)
b. State and prove Knaster-Tarski fixed point theorem. (7 marks)
OR
12.
a. Consider the lattice (ℕ,! ≤ ) . Let f! : ℕ → ℕ , be a function defined as follows:
when x! < 100 , f! (x) = x + 1 , when x! > 100 , f! (x) = x − 1 , otherwise f! (x) = x .
Then, show the following for f! : (i) the set of all fixpoints, (ii) the set of all pre-
fixpoints and (iii) the set of all post-fixpoints. (7 marks)
b. Let (D,
! ≤ ) be a lattice with a least upper bound for each subset of D ! . Then, prove
that every subset of D! has a greatest lower bound. (7 marks)
13.
a. With a suitable example, explain the equational approach in Data Flow Analysis.
(7 marks)
b. With a suitable example, explain how you obtain the collecting semantics of a
program point. (7 marks)
OR
14.
a. With an example, explain the Constrained Based Approach in Data Flow
Analysis. (7 marks)
b. Discuss the properties of an algorithm to solve the problem of computing the least
solution to the program analysis problems in Data Flow Analysis. (7 marks)
15.
a. Using Intraprocedural Reaching Definition Analysis, find the assignments killed
and generated by each of the blocks in the program
[x:=5]1;
[y:=1]2 ;
while [x>1]3 do
([y:=x*y]4 ; [x:=x-1]5)
(7 marks)
b. Analyse the following program using Intraprocedural Very Busy Expression
analysis
8
if [a>b]1 then
([x: =b-a]2 ; [y: =a-b]3)
else
([y: =b-a]4; [x: =a-b]5)
(7 marks)
OR
16.
a. Find Maximal Fixed Point (MFP) solution for the program
[x: =a+b]1;
[y: =a*b]2 ;
while [y>a+b]3 do
([a: =a+l]4; [x: =a+b]5)
(7 marks)
b. With examples, explain the difference between flow sensitive and flow insensitive
analysis. (7 marks)
17.
a. Prove that (L,
! α, γ, M ) is an adjunction if and only if (L,
! α, γ, M ) is a Galois
connection. (7 marks)
b. Prove that if α
! : L → M is completely additive then there exists γ! : M → L such
that (L,
! α, γ, M ) is a Galois connection. Similarly, if γ! : M → L is completely
multiplicative then there exists α! : L → M such that (L,! α, γ, M ) is a Galois
connection. (7 marks)
OR
18.
a. Show that if (Li, αi, γi, Mi) are Galois connections and βi : Vi ➝ Li are
representation functions then
((α1 o β1) ↠ (α2 o β2)) (↝) = α2 o ((β1 ↠ β2) (↝)) o γ1
(7 marks)
b. Briefly explain Kildall’s algorithm for abstract interpretation (7 marks)
19.
a. Briefly explain the need of specification and verification of code. (7 marks)
b. Argue that Hoare Logic is sound. When Hoare Logic is complete? Let {A}P{B}
be a Hoare triple such that Hoare Logic is complete for the program P. Then, is it
always possible to check the validity of the Hoare Triple? If not, what is the
difficulty? (7 marks)
OR
20.
a. With suitable examples, show the difference between partial and total correctness.
(7 marks)
b. With a suitable example, show how a basic program segment can be verified
using the tool VCC. (7 marks)
9
Teaching Plan
Module 1 (Mathematical Foundations) 6 Hours
1.1 Partially Ordered Set 1 Hour
1.2 Complete Lattice, Construction of Complete Lattices 1 Hour
1.3 Chains 1 Hour
1.4 Fixed Points 1 Hour

1.5 Knaster-Tarski Fixed Point Theorem 1 Hour
1.6 Proof of Knaster-Tarski Fixed Point Theorem 1 Hour

Module 2 (Introduction to Program Analysis) 5 Hours
2.1 The WHILE language 1 Hour
2.2 Data Flow Analysis 1 Hour
2.3 Reaching Definition Analysis 1 Hour
2.4 Abstract Interpretation 1 Hour
2.5 Algorithm to find the least solutions for the Data Flow Analysis problem 1 Hour
Module 3 (Data flow Analysis) 15 Hours
3.1 Available Expressions Analysis, Reaching Definitions Analysis 1 Hour
3.2 Very Busy Expressions Analysis 1 Hour
3.3 Live Variable Analysis 1 Hour
3.4 Derived Data Flow Information 1 Hour
3.5 Monotone and Distributive Frameworks 1 Hour
3.6 Equation Solving - MFP Solution 1 Hour
10
3.7 Equation Solving - MOP Solution 1 Hour
3.8 Structural Operational Semantics (Lecture 1) 1 Hour
3.9 Structural Operational Semantics (Lecture 2) 1 Hour
3.10 Intraprocedural versus Interprocedural Analysis 1 Hour
3.11 Making Context Explicit 1 Hour

3.12 Call Strings as Context 1 Hour
3.13 Flow Sensitivity versus Flow Insensitivity 1 Hour
Implementing Interprocedural Dataflow Analysis using the Tool WALA

3.14 1 Hour
(Lecture 1)
Implementing Interprocedural Dataflow Analysis using the Tool WALA
3.15 1 Hour
(Lecture 2)
Module 4 (Abstract Interpretation) 8 Hours
4.1 A Mundane Approach to Correctness 1 Hour
4.2 Approximations of Fixed Points 1 Hour
4.3 Galois Connections, 1 Hour
4.4 Systematic Design of Galois Connections (Lecture 1) 1 Hour
4.5 Systematic Design of Galois Connections (Lecture 2) 1 Hour
4.6 Induced Operations 1 Hour
4.7 Kildall’s Algorithm for Abstract Interpretation (Lecture 1) 1 Hour
4.8 Kildall’s Algorithm for Abstract Interpretation (Lecture 2) 1 Hour
Module 5 (Program Verification) 11 Hours
5.1 Why should we Specify and Verify Code 1 Hour
5.2 A framework for software verification - A core programming Language 1 Hour
11
5.3 Hoare Triples (Lecture 1) 1 Hour
5.4 Hoare Triples (Lecture 2) 1 Hour
5.5 Partial and Total Correctness 1 Hour
5.6 Program Variables and Logical Variables 1 Hour
5.7 Proof Calculus for Partial Correctness 1 Hour
5.8 Loop Invariants 1 Hour
5.9 Verifying C programs using the tool VCC (Lecture 1) 1 Hour

12
HUMANITIES
COMMON COURSES S3 & S4
SEMESTER -3
HUMANITIES
CODE CATEGORY L T P CREDIT
MCN201 SUSTAINABLE ENGINEERING 2 0 0 NIL
Preamble: Objective of this course is to inculcate in students an awareness of environmental issues and the
global initiatives towards attaining sustainability. The student should realize the potential of technology in
bringing in sustainable practices.
Prerequisite: NIL
CO 1 Understand the relevance and the concept of sustainability and the global initiatives in this
direction
CO 2 Explain the different types of environmental pollution problems and their sustainable
solutions
CO 3 Discuss the environmental regulations and standards
CO 4 Outline the concepts related to conventional and non-conventional energy
CO 5 Demonstrate the broad perspective of sustainable practices by utilizing engineering
knowledge and principles
10 11 12
CO 1 2 3 2
CO 2 2 3 2
CO 3 2 3 2
CO 4 2 3 2
CO 5 2 3 2
Assessment Pattern
Mark distribution

1 2
Remember 20 20 40
Understand 20 20 40
Apply 10 10 20
Analyse
Evaluate
Create
End Semester Examination Pattern: There will be two parts; Part A and Part B. Part A contain 10 questions with 2
questions from each module, having 3 marks for each question. Students should answer all questions. Part B contains 2
questions from each module of which student should answer any one. Each question can have maximum 2 sub-divisions
and carry 14 marks.
1
HUMANITIES
150 50 100 3 hours
Course Outcome 1 (CO1): Understand the relevance and the concept of sustainability and the global initiatives in this
direction
1. Explain with an example a technology that has contributed positively to sustainable development.
2. Write a note on Millennium Development Goals.
Course Outcome 2 (CO2): Explain the different types of environmental pollution problems and their sustainable
solutions
1. Explain the 3R concept in solid waste management?
2. Write a note on any one environmental pollution problem and suggest a sustainable solution.
3. In the absence of green house effect the surface temperature of earth would not have been suitable for survival
of life on earth. Comment on this statement.
Course Outcome 3(CO3): Discuss the environmental regulations and standards

1. Illustrate Life Cycle Analysis with an example of your choice.
2. “Nature is the most successful designer and the most brilliant engineer that has ever evolved”. Discuss.
Course Outcome 4 (CO4): Outline the concepts related to conventional and non-conventional energy
1. Suggest a sustainable system to generate hot water in a residential building in tropical climate.
2. Enumerate the impacts of biomass energy on the environment.
Course Outcome 5 (CO5): Demonstrate the broad perspective of sustainable practices by utilizing engineering
knowledge and principles
1. Suggest suitable measures to make the conveyance facilities used by your institution sustainable.
Part A
(Answer all questions. Each question carries 3 marks each)
1. Define sustainable development.
2. Write a short note on Millennium Development Goals.
3. Describe carbon credit.
4. Give an account of climate change and its effect on environment.
5. Describe biomimicry? Give two examples.
6. Explain the basic concept of Life Cycle Assessment.
7. Name three renewable energy sources.

2
HUMANITIES
8. Mention some of the disadvantages of wind energy.
9. Enlist some of the features of sustainable habitat.
10. Explain green engineering.
Part B
(Answer one question from each module. Each question carries 14 marks)
11. Discuss the evolution of the concept of sustainability. Comment on its relevance in the modern world.
OR
12. Explain Clean Development Mechanism.
13. Explain the common sources of water pollution and its harmful effects.
OR
14. Give an account of solid waste management in cities.
15. Explain the different steps involved in the conduct of Environmental Impact Assessment.
OR
16. Suggest some methods to create public awareness on environmental issues.
17. Comment on the statement, “Almost all energy that man uses comes from the Sun”.
OR
18. Write notes on:
a. Land degradation due to water logging.
b. Over exploitation of water.
19. Discuss the elements related to sustainable urbanisation.
OR
20. Discuss any three methods by which you can increase energy efficiency in buildings.
3
HUMANITIES
Syllabus
Sustainability- need and concept, technology and sustainable development-Natural resources and their pollution, Carbon
credits, Zero waste concept. Life Cycle Analysis, Environmental Impact Assessment studies, Sustainable habitat, Green
buildings, green materials, Energy, Conventional and renewable sources, Sustainable urbanization, Industrial Ecology.
Module 1
Sustainability: Introduction, concept, evolution of the concept; Social, environmental and economic sustainability
concepts; Sustainable development, Nexus between Technology and Sustainable development; Millennium Development
Goals (MDGs) and Sustainable Development Goals (SDGs), Clean Development Mechanism (CDM).
Module 2
Environmental Pollution: Air Pollution and its effects, Water pollution and its sources, Zero waste concept and 3 R
concepts in solid waste management; Greenhouse effect, Global warming, Climate change, Ozone layer depletion,
Carbon credits, carbon trading and carbon foot print, legal provisions for environmental protection.
Module 3
Environmental management standards: ISO 14001:2015 frame work and benefits, Scope and goal of Life Cycle Analysis
(LCA), Circular economy, Bio-mimicking, Environment Impact Assessment (EIA), Industrial ecology and industrial
symbiosis.
Module 4
Resources and its utilisation: Basic concepts of Conventional and non-conventional energy, General idea about solar
energy, Fuel cells, Wind energy, Small hydro plants, bio-fuels, Energy derived from oceans and Geothermal energy.
Module 5
Sustainability practices: Basic concept of sustainable habitat, Methods for increasing energy efficiency in buildings,
Green Engineering, Sustainable Urbanisation, Sustainable cities, Sustainable transport.
Reference Books
1. Allen, D. T. and Shonnard, D. R., Sustainability Engineering: Concepts, Design and Case Studies, Prentice Hall.
2. Bradley. A.S; Adebayo,A.O., Maria, P. Engineering applications in sustainable design and development,
Cengage learning
3. Environment Impact Assessment Guidelines, Notification of Government of India, 2006
4. Mackenthun, K.M., Basic Concepts in Environmental Management, Lewis Publication, London, 1998
5. ECBC Code 2007, Bureau of Energy Efficiency, New Delhi Bureau of Energy Efficiency Publications-Rating
System, TERI Publications - GRIHA Rating System
6. Ni bin Chang, Systems Analysis for Sustainable Engineering: Theory and Applications, McGraw-Hill
Professional.
7. Twidell, J. W. and Weir, A. D., Renewable Energy Resources, English Language Book Society (ELBS).
8. Purohit, S. S., Green Technology - An approach for sustainable environment, Agrobios Publication
4
HUMANITIES

1 Sustainability
1.1 Introduction, concept, evolution of the concept 1
1.2 Social, environmental and economic sustainability concepts 1
1.3 Sustainable development, Nexus between Technology and Sustainable 1
development
1.4 Millennium Development Goals (MDGs) and Sustainable Development Goals 1
(SDGs)
1.5 Clean Development Mechanism (CDM) 1
2 Environmental Pollution
2.1 Air Pollution and its effects 1

2.2 Water pollution and its sources 1
2.3 Zero waste concept and 3 R concepts in solid waste management 1
2.4 Greenhouse effect, Global warming, Climate change, Ozone layer depletion 1
2.5 Carbon credits, carbon trading and carbon foot print. 1
2.6 Legal provisions for environmental protection. 1
3 Environmental management standards
3.1 Environmental management standards 1

3.2 ISO 14001:2015 frame work and benefits 1
3.3 Scope and Goal of Life Cycle Analysis (LCA) 1
3.4 Circular economy, Bio-mimicking 1
3.5 Environment Impact Assessment (EIA) 1
3.6 Industrial Ecology, Industrial Symbiosis 1
4 Resources and its utilisation
4.1 Basic concepts of Conventional and non-conventional energy 1

4.2 General idea about solar energy, Fuel cells 1
4.3 Wind energy, Small hydro plants, bio-fuels 1
4.4 Energy derived from oceans and Geothermal energy 1
5 Sustainability Practices
5.1 Basic concept of sustainable habitat 1

5.2 Methods for increasing energy efficiency of buildings 1
5.3 Green Engineering 1
5.4 Sustainable Urbanisation, Sustainable cities, Sustainable transport 1
5
HUMANITIES
2 0 0 2
EST 200 DESIGN AND ENGINEERING
Preamble:
The purpose of this course is to
i) introduce the undergraduate engineering studentsthe fundamental principles of
design engineering,
ii) make them understand the steps involved in the design process and
iii) familiarize them with the basic tools used and approaches in design.
Students are expected to apply design thinking in learning as well as while practicing
engineering, which is very important and relevant for today. Case studies from various
practical situations will help the students realize that design is not only concerned about the
function but also many other factors like customer requirements, economics, reliability, etc.
along with a variety of life cycle issues.
The course will help students to consider aesthetics, ergonomics and sustainability factors in
designs and also to practice professional ethics while designing.
Prerequisite:
Nil.The course will be generic to all engineering disciplines and will not require specialized
preparation or prerequisites in any of the individual engineering disciplines.
Course Outcomes:
After the completion of the course the student will be able to
CO 1 Explain the different concepts and principles involved in design engineering.

CO 2 Apply design thinking while learning and practicing engineering.
CO 3 Develop innovative, reliable, sustainable and economically viable designs
incorporating knowledge in engineering.
10 11 12
CO 1 2 1 1 1
CO 2 2 1 1 2
CO 3 2 1 1 2 2 1
HUMANITIES
Assessment Pattern
Continuous Internal Evaluation (CIE) Pattern:
End Semester Examination (ESE) Pattern: There will be two parts; Part A and Part B.
Part A : 30 marks
part B : 70 marks
Part A contains 10 questions with 2 questions from each module, having 3 marks for each question.
Students should answer all questions.
Part B contains 2 case study questions from each module of which student should answer any one.
Each question carry 14 marks and can have maximum 2 sub questions.
Mark distribution
150 50 100 3 hours

1 2 Examination
Remember 5 5 10
Understand 10 10 20
Apply 35 35 70
Analyse - - -
Evaluate - - -
Create - - -
HUMANITIES
Course Outcome 1 (CO1): Appreciate the different concepts and principles involved in design
engineering.
1. State how engineering design is different from other kinds of design
2. List the different stages in a design process.
3. Describedesign thinking.
4. State the function of prototyping and proofing in engineering design.
5. Write notes on the following concepts in connection with design engineering 1) Modular Design,
2) Life Cycle Design , 3) Value Engineering, 4) Concurrent Engineering, and 5) Reverse Engineering
6. State design rights.
Course Outcome 2 (CO2) Apply design thinking while learning and practicing engineering.
1. Construct the iterative process for design thinking in developing simple products like a pen,
umbrella, bag, etc.
2. Show with an example how divergent-convergent thinking helps in generating alternative designs
and then how to narrow down to the best design.
3. Describe how a problem-based learning helps in creating better design engineering solutions.
4. Discuss as an engineer, how ethics play a decisive role in your designs
Course Outcome 3(CO3): Develop innovative, reliable, sustainable and economically viable designs
incorporating different segments of knowledge in engineering.
1. Illustratethe development of any simple product by passing through the different stages of design
process
2. Show thegraphical design communication with the help of detailed 2D or 3D drawings for any
simple product.
3. Describe how to develop new designs for simple products through bio-mimicry.
HUMANITIES
Page 1 of 2
Reg No.: Name:
THIRD/FOURTH SEMESTER B.TECH DEGREE EXAMINATION
Course Name: DESIGN AND ENGINEERING
Max. Marks: 100Duration: 3 Hours
PART A
Answer all questions, each question carries 3 marks
Use only hand sketches
(1) Write aboutthe basic design process.

(2) Describe how to finalize the design objectives.
(3) State the role of divergent-convergent questioning in design thinking.
(4) Discuss how to perform design thinking in a team managing the conflicts.
(5) Show how engineering sketches and drawings convey designs.
(6) Explain the role of mathematics and physics in design engineering process.
(7) Distinguish between project-based learning and problem-based learning in design
engineering.
(8) Describe how concepts like value engineering , concurrent engineering and reverse
engineering influence engineering designs?
(9) Show how designs are varied based on the aspects of production methods, life span,
reliability and environment?
(10) Explain how economics influence the engineering designs?
(10x3 marks =30 marks)
Part B
Answer any ONE question from each module. Each question carry 14 marks
Module 1
(11) Show the designing of a wrist watch going through the various stages of the design
process. Use hand sketches to illustrate the processes.
or
(12) Find the customer requirements for designing a new car showroom. Show how the
design objectives were finalized considering the design constraints?
HUMANITIES
Module 2
(13) Illustrate the design thinking approach for designing a bag for college students within a
limited budget. Describe each stage of the process and the iterative procedure
involved. Use hand sketches to support your arguments.
or
(14) Construct a number of possible designs and then refine them to narrow down to the
best design for a drug trolley used in hospitals. Show how the divergent-convergent
thinking helps in the process. Provide your rationale for each step by using hand
sketches only.
Module 3
(15) Graphically communicate the design of a thermo flask used to keep hot coffee. Draw
the detailed 2D drawings of the same with design detailing, material selection, scale
drawings, dimensions, tolerances, etc. Use only hand sketches.
or
(16) Describe the role of mathematical modelling in design engineering. Show how
mathematics and physics play a role in designing a lifting mechanism to raise 100 kg of
weight to a floor at a height of 10 meters in a construction site.
Module 4
(17) Show the development of a nature inspired design for a solar poweredbus waiting shed
beside a highway. Relate between natural and man-made designs. Use hand sketches
to support your arguments.
or
(18) Show the design of a simple sofa and then depict how the design changes when
considering 1) aesthetics and 2) ergonomics into consideration. Give hand sketches and
explanations to justify the changes in designs.
Module 5
(19) Examine the changes in the design of a foot wear with constraints of 1) production
methods, 2) life span requirement, 3) reliability issues and 4) environmental factors.
Use hand sketches and give proper rationalization for the changes in design.
or
(20) Describe the how to estimate the cost of a particular design using ANY of the following:
i) a website, ii) the layout of a plant, iii) the elevation of a building, iv) anelectrical or
electronic system or device and v) a car.
Show how economics will influence the engineering designs. Use hand sketches to support
your arguments.
Page 2 of 2
HUMANITIES
Syllabus
Module 1
Design Process:- Introduction to Design and Engineering Design, Defining a Design
Process-:Detailing Customer Requirements, Setting Design Objectives, Identifying
Constraints, Establishing Functions, Generating Design Alternatives and Choosing a
Design.
Module 2
Design Thinking Approach:-Introduction to Design Thinking, Iterative Design
Thinking Process Stages: Empathize, Define, Ideate, Prototype and Test. Design
Thinking as Divergent-Convergent Questioning. Design Thinking in a Team
Environment.
Module 3
Design Communication (Languages of Engineering Design):-Communicating
Designs Graphically, Communicating Designs Orally and in Writing. Mathematical
Modeling In Design, Prototyping and Proofing the Design.
Module 4
Design Engineering Concepts:-Project-based Learning and Problem-based Learning
in Design.Modular Design and Life Cycle Design Approaches. Application of Bio-
mimicry,Aesthetics and Ergonomics in Design. Value Engineering, Concurrent
Engineering, and Reverse Engineering in Design.
Module 5
Expediency, Economics and Environment in Design Engineering:-Design for
Production, Use, and Sustainability. Engineering Economics in Design. Design
Rights. Ethics in Design
Text Books
1) YousefHaik, SangarappillaiSivaloganathan, Tamer M. Shahin, Engineering Design Process,
Cengage Learning 2003, Third Edition, ISBN-10: 9781305253285,
2) Voland, G., Engineering by Design, Pearson India 2014, Second Edition, ISBN 9332535051
Reference Books
1. Philip Kosky, Robert Balmer, William Keat, George Wise, Exploring Engineering, Fourth
Edition: An Introduction to Engineering and Design, Academic Press 2015, 4th Edition,
ISBN: 9780128012420.
2. Clive L. Dym, Engineering Design: A Project-Based Introduction, John Wiley & Sons,
New York 2009, Fourth Edition, ISBN: 978-1-118-32458-5
3. Nigel Cross, Design Thinking: Understanding How Designers Think and Work, Berg
Publishers 2011, First Edition, ISBN: 978-1847886361
4. Pahl, G., Beitz, W., Feldhusen, J., Grote, K.-H., Engineering Design: A Systematic
Approach, Springer 2007, Third Edition, ISBN 978-1-84628-319-2
HUMANITIES
1 Module 1: Design Process
1.1 Introduction to Design and Engineering Design.
What does it mean to design something? How Is
engineering design different from other kinds of design? 1
Where and when do engineers design? What are the basic
vocabularyin engineering design? How to learn and do
engineering design.
1.2 Defining a Design Process-: Detailing Customer
Requirements.
How to do engineering design? Illustrate the process with 1
an example. How to identify the customer requirements of
design?
1.3 Defining a Design Process-: Setting Design Objectives,
Identifying Constraints, Establishing Functions.
How to finalize the design objectives? How to identify the 1
design constraints? How to express the functions a design
in engineering terms?
1.4 Defining a Design Process-: Generating Design
Alternatives and Choosing a Design.
1
How to generate or create feasible design alternatives?
How to identify the "best possible design”?
1.5 Case Studies:- Stages of Design Process.
Conduct exercises for designing simple products going 1
through the different stages of design process.
2 Module 2: Design Thinking Approach
2.1 Introduction to Design Thinking
How does the design thinking approach help engineers in 1
creating innovative and efficient designs?
2.2 Iterative Design Thinking Process Stages: Empathize,
Define, Ideate, Prototype and Test.
How can the engineers arrive at better designs utilizing 1
the iterative design thinking process (in which knowledge
acquired in the later stages can be applied back to the
earlier stages)?
2.3 Design Thinking as Divergent-Convergent Questioning.
Describe how to create a number of possible designs and 1
then how to refine and narrow down to the 'best design'.
2.4 Design Thinking in a Team Environment.
How to perform design thinking as a team managing the 1
conflicts ?
2.5 Case Studies: Design Thinking Approach.
1
Conduct exercises using the design thinking approach for
HUMANITIES
designing any simple products within a limited time and
budget
3 Module 3: Design Communication (Languages of Engineering Design)
3.1 Communicating Designs Graphically.
1
How do engineering sketches and drawings convey designs?
3.2 Communicating Designs Orally and in Writing.
How can a design be communicated through oral 1
presentation or technical reports efficiently?
First Series Examination
3.3 Mathematical Modelling in Design.
How do mathematics and physics become a part of the 1
design process?
3.4 Prototyping and Proofing the Design.
1
How to predict whether the design will function well or not?
3.5 Case Studies: Communicating Designs Graphically.
Conduct exercises for design communication through
detailed 2D or 3D drawings of simple products with 1
design detailing, material selection, scale drawings,
dimensions, tolerances, etc.
4 Module 4: Design Engineering Concepts
4.1 Project-based Learning and Problem-based Learning in 1
Design.
How engineering students can learn design engineering
through projects?
How students can take up problems to learn design
engineering?
4.2 Modular Design and Life Cycle Design Approaches. 1
What is modular approach in design engineering? How it
helps?
How the life cycle design approach influences design
decisions?
4.3 Application of Bio-mimicry, Aesthetics and Ergonomics 1
in Design.
How do aesthetics and ergonomics change engineering
designs?
How do the intelligence in nature inspire engineering
designs? What are the common examples of bio-mimicry
in engineering?
4.4 Value Engineering, Concurrent Engineering, and Reverse 1
Engineering in Design.
How do concepts like value engineering , concurrent
engineering and reverse engineering influence
engineering designs?
4.5 Case Studies: Bio-mimicry based Designs. 1
Conduct exercises to develop new designs for simple
HUMANITIES
products using bio-mimicry and train students to bring out
new nature inspired designs.
5 Module 5: Expediency, Economics and Environment in Design
Engineering
5.1 Design for Production, Use, and Sustainability. 1
How designs are finalized based on the aspects of
production methods, life span, reliability and
environment?
5.2 Engineering Economics in Design. 1
How to estimate the cost of a particular design and how
will economics influence the engineering designs?
5.3 Design Rights. 1
What are design rights and how can an engineer put it
into practice?
5.4 Ethics in Design. 1
How do ethics play a decisive role in engineering design?
5.5 Case Studies: Design for Production, Use, and 1
Sustainability.
Conduct exercises using simple products to show how designs
change with constraints of production methods, life span
requirement, reliability issues and environmental factors.
Second Series Examination
HUMANITIES
Code. Course Name L T P Hrs Credit
HUT 200 Professional Ethics 2 0 0 2 2
Preamble:To enable students to create awareness on ethics and human values.

Prerequisite: Nil
CO 1 Understand the core values that shape the ethical behaviour of a professional.
CO 2 Adopt a good character and follow an ethical life.
Explain the role and responsibility in technological development by keeping personal ethics
CO 3 and legal ethics.
Solve moral and ethical problems through exploration and assessment by established
CO 4 experiments.
Apply the knowledge of human values and social values to contemporary ethical values and
CO 5 global issues.
PO PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO1 PO1 PO1

1 0 1 2
CO 1 2 2
CO 2 2 2
CO 3 3 2
CO 4 3 2
CO 5 3 2
Assessment Pattern
Bloom’s category End Semester Exam
1 2
Remember 15 15 30
Understood 20 20 40
Apply 15 15 30
Mark distribution
Total
CIE ESE ESE Duration
Marks
150 50 100 3 hours

HUMANITIES
Continuous Assessment Tests (2 Nos) : 25 marks
Assignments/Quiz : 15 marks
End Semester Examination Pattern: There will be two parts; Part A and Part B. Part A contains 10 questions
with 2 questions from each module, having 3 marks for each question. Students should answer all questions.
Part B contains 2 questions from each module of which student should answer any one. Each question can have
maximum 2 sub-divisions and carry 14 marks.

1. Define integrity and point out ethical values.
2. Describe the qualities required to live a peaceful life.
3. Explain the role of engineers in modern society.

1. Derive the codes of ethics.
2. Differentiate consensus and controversy.
3. Discuss in detail about character and confidence.

1. Explain the role of professional’s ethics in technological development.
2. Distinguish between self interest and conflicts of interest.
3. Review on industrial standards and legal ethics.

1. Illustrate the role of engineers as experimenters.
2. Interpret the terms safety and risk.
3. Show how the occupational crimes are resolved by keeping the rights of employees.

1. Exemplify the engineers as managers.
2. Investigate the causes and effects of acid rain with a case study.
3. Explorate the need of environmental ethics in technological development.
HUMANITIES
QP CODE: Reg No: _
PAGES:3 Name : _
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD/FOURTH SEMESTER

B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Code: HUT 200

Course Name: PROFESSIONAL ETHICS
(2019-Scheme)
PART A
1. Define empathy and honesty.
2. Briefly explain about morals, values and ethics.
3. Interpret the two forms of self-respect.
4. List out the models of professional roles.
5. Indicate the advantages of using standards.
6. Point out the conditions required to define a valid consent?
7. Identify the conflicts of interests with an example?
8. Recall confidentiality.
9. Conclude the features of biometric ethics.
10. Name any three professional societies and their role relevant to engineers.
(10x3 = 30 marks)
PART B
MODULE I
11. a) Classify the relationship between ethical values and law?
b) Compare between caring and sharing. (10+4 = 14 marks)
Or
12. a) Exemplify a comprehensive review about integrity and respect for others.
HUMANITIES
b) Discuss about co-operation and commitment. (8+6 = 14 marks)
MODULE II
13.a) Explain the three main levels of moral developments, deviced by Kohlberg.
b) Differentiate moral codes and optimal codes. (10+4 = 14 marks)
Or
14. a) Extrapolate the duty ethics and right ethics.
b) Discuss in detail the three types of inquiries in engineering ethics (8+6 = 14 marks)
MODULE III
Summarize the following features of morally responsible engineers.
(i) Moral autonomy (ii) Accountability
b)Explain the rights of employees (8+6 = 14 marks)
Or
16. a) Explain the reasons for Chernobyl mishap ?
b) Describe the methods to improve collegiality and loyalty. (8+6 = 14 marks)
MODULE IV
17.a) Execute collegiality with respect to commitment, respect and connectedness.
b) Identify conflicts of interests with an example. (8+6 = 14 marks)

Or
18. a) Explain in detail about professional rights and employee rights.

b) Exemplify engineers as managers.
MODULE V
19.a) Evaluate the technology transfer and appropriate technology.

b) Explain about computer and internet ethics. (8+6 = 14 marks)
Or
20. a) Investigate the causes and effects of acid rain with a case study.
b) Conclude the features of ecocentric and biocentric ethics. (8+6 = 14 marks)
HUMANITIES
Syllabus
Module 1 – Human Values.
Morals, values and Ethics – Integrity- Academic integrity-Work Ethics- Service Learning- Civic Virtue-
Respect for others- Living peacefully- Caring and Sharing- Honestly- courage-Cooperation commitment-
Empathy-Self Confidence -Social Expectations.
Module 2 - Engineering Ethics & Professionalism.
Senses of Engineering Ethics - Variety of moral issues- Types of inquiry- Moral dilemmas –Moral Autonomy –
Kohlberg’s theory- Gilligan’s theory- Consensus and Controversy-Profession and Professionalism- Models of
professional roles-Theories about right action –Self interest-Customs and Religion- Uses of Ethical Theories.
Module 3- Engineering as social Experimentation.
Engineering as Experimentation – Engineers as responsible Experimenters- Codes of Ethics- Plagiarism-

A balanced outlook on law - Challenges case study- Bhopal gas tragedy.
Module 4- Responsibilities and Rights.
Collegiality and loyalty – Managing conflict- Respect for authority- Collective bargaining- Confidentiality-
Role of confidentiality in moral integrity-Conflicts of interest- Occupational crime- Professional rights-
Employee right- IPR Discrimination.
Module 5- Global Ethical Issues.
Multinational Corporations- Environmental Ethics- Business Ethics- Computer Ethics -Role in Technological
Development-Engineers as Managers- Consulting Engineers- Engineers as Expert witnesses and advisors-Moral
leadership.
Text Book
1. M Govindarajan, S Natarajan and V S Senthil Kumar, Engineering Ethics, PHI Learning

Private Ltd, New Delhi,2012.
2. R S Naagarazan, A text book on professional ethics and human values, New age international
(P) limited ,New Delhi,2006.
Reference Books
1. Mike W Martin and Roland Schinzinger, Ethics in Engineering,4th edition, Tata McGraw Hill
Publishing Company Pvt Ltd, New Delhi,2014.
2. Charles D Fleddermann, Engineering Ethics, Pearson Education/ Prentice Hall of India, New
Jersey,2004.
3. Charles E Harris, Michael S Protchard and Michael J Rabins, Engineering Ethics- Concepts and
cases, Wadsworth Thompson Learning, United states,2005.
4. http://www.slideword.org/slidestag.aspx/human-values-and-Professional-ethics.
HUMANITIES
SL.N Topic No. of Lectures

o 25
1 Module 1 – Human Values.
1.1 Morals, values and Ethics, Integrity, Academic Integrity,Work Ethics 1

1.2 Service Learning, Civic Virtue, Respect for others, Living peacefully 1
1.3 Caring and Sharing, Honesty, Courage, Co-operation commitment 2
1.4 Empathy, Self Confidence, Social Expectations 1
2 Module 2- Engineering Ethics & Professionalism.
2.1 Senses of Engineering Ethics, Variety of moral issues, Types of inquiry 1

2.2 Moral dilemmas, Moral Autonomy, Kohlberg’s theory 1
Gilligan’s theory, Consensus and Controversy,Profession&
2.3 2
Professionalism, Models of professional roles, Theories about right action
2.4 Self interest-Customs and Religion, Uses of Ethical Theories 1
3 Module 3- Engineering as social Experimentation.
3.1 Engineering as Experimentation, Engineers as responsible Experimenters 1

3.2 Codes of Ethics,Plagiarism, A balanced outlook on law 2
3.3 Challenger case study, Bhopal gas tragedy 2
4 Module 4- Responsibilities and Rights.
4.1 Collegiality and loyalty, Managing conflict, Respect for authority 1

Collective bargaining, Confidentiality, Role of confidentiality in moral
4.2 2
integrity, Conflicts of interest
Occupational crime, Professional rights, Employee right, IPR
4.3 2
Discrimination
5 Module 5- Global Ethical Issues.
Multinational Corporations, Environmental Ethics, Business Ethics,

5.1 2
Computer Ethics
5.2 Role in Technological Development, Moral leadership 1
Engineers as Managers, Consulting Engineers, Engineers as Expert
5.3 2
witnesses and advisors
HUMANITIES
SEMESTER -4
HUMANITIES
MCN202 CONSTITUTION OF INDIA 2 0 0 NIL
Preamble:
The study of their own country constitution and studying the importance environment as
well as understanding their own human rights help the students to concentrate on their day
to day discipline. It also gives the knowledge and strength to face the society and people.
Prerequisite: Nil
CO 1 Explain the background of the present constitution of India and features.
CO 2 Utilize the fundamental rights and duties.

CO 3 Understand the working of the union executive, parliament and judiciary.
CO 4 Understand the working of the state executive, legislature and judiciary.
CO 5 Utilize the special provisions and statutory institutions.
CO 6 Show national and patriotic spirit as responsible citizens of the country
10 11 12
CO 1 2 2 2 2
CO 2 3 3 3 3
CO 3 3 2 3 3
CO 4 3 2 3 3
CO 5 3 2 3 3
CO 6 3 3 3 2
Assessment Pattern
Bloom’s Category Continuous Assessment End Semester Examination

Tests
1 2
Remember 20 20 40
Understand 20 20 40
Apply 10 10 20
Analyse
HUMANITIES
Evaluate
Create
Mark distribution
Total CIE ESE ESE Duration

Marks
150 50 100 3 hours
contain 10 questions with 2 questions from each module, having 3 marks for each question.
Students should answer all questions. Part B contains 2 questions from each module of
which student should answer any one. Each question can have maximum 2 sub-divisions
and carry 14 marks.
1 Discuss the historical background of the Indian constitution.
2 Explain the salient features of the Indian constitution.
3 Discuss the importance of preamble in the implementation of constitution.
1 What are fundamental rights ? Examine each of them.
2 Examine the scope of freedom of speech and expression underlying the constitution.
3 The thumb impression of an accused is taken by the police against his will. He contends
that this is a violation of his rights under Art 20(3) of the constitution. Decide.
1 Explain the powers of the President to suspend the fundamental rights during emergency.
HUMANITIES
2 Explain the salient features of appeal by special leave.
3. List the constitutional powers of President.
1 Discuss the constitutional powers of Governor.
2 Examine the writ jurisdiction of High court.
3 Discuss the qualification and disqualification of membership of state legislature.
1 Discuss the duties and powers of comptroller of auditor general.
2 Discuss the proclamation of emergency.
3 A state levies tax on motor vehicles used in the state, for the purpose of maintaining roads
in the state. X challenges the levy of the tax on the ground that it violates the freedom of
interstate commerce guaranteed under Art 301. Decide.
1 Explain the advantages of citizenship.
2 List the important principles contained in the directive principles of state policy.
3 Discuss the various aspects contained in the preamble of the constitution
PART A
1 Define and explain the term constitution.
2 Explain the need and importance of Preamble.
3 What is directive principle of state policy?
4 Define the State.
5 List the functions of Attorney general of India.

HUMANITIES
6 Explain the review power of Supreme court.
7 List the qualifications of Governor.
8 Explain the term and removal of Judges in High court.
9 Explain the powers of public service commission.
10 List three types of emergency under Indian constitution.
(10X3=30marks)
PART B
(Answer on question from each module. Each question carries 14 marks)
Module 1
11 Discuss the various methods of acquiring Indian citizenship.
12 Examine the salient features of the Indian constitution.
Module 2
13 A high court passes a judgement against X. X desires to file a writ petition in the supreme
court under Art32, on the ground that the judgement violates his fundamental rights.
Advise him whether he can do so.
14 What is meant by directive principles of State policy? List the directives.
Module3
15 Describe the procedure of election and removal of the President of India.
16 Supreme court may in its discretion grant special leave to appeal. Examine the situation.
Module 4
17 Discuss the powers of Governor.
18 X filed a writ petition under Art 226 which was dismissed. Subsequently, he filed a writ
petition under Art 32 of the constitution, seeking the same remedy. The Government
argued that the writ petition should be dismissed, on the ground of res judicata. Decide.
Module 5
HUMANITIES
19 Examine the scope of the financial relations between the union and the states.
20 Discuss the effects of proclamation of emergency.

(14X5=70marks)
Syllabus
Module 1 Definition, historical back ground, features, preamble, territory, citizenship.
Module 2 State, fundamental rights, directive principles, duties.
Module 3 The machinery of the union government.
Module 4 Government machinery in the states
Module 5 The federal system, Statutory Institutions, miscellaneous provisions.
Text Books
1 D D Basu, Introduction to the constitution of India, Lexis Nexis, New Delhi, 24e, 2019
2 PM Bhakshi, The constitution of India, Universal Law, 14e, 2017
Reference Books
1 Ministry of law and justice, The constitution of India, Govt of India, New Delhi, 2019.
2 JN Pandey, The constitutional law of India, Central Law agency, Allahabad, 51e, 2019
3 MV Pylee, India’s Constitution, S Chand and company, New Delhi, 16e, 2016

1 Module 1
1.1 Definition of constitution, historical back ground, salient features 1
of the constitution.
1.2 Preamble of the constitution, union and its territory. 1
1.3 Meaning of citizenship, types, termination of citizenship. 2
2 Module 2
2.1 Definition of state, fundamental rights, general nature, 2
classification, right to equality ,right to freedom , right against
exploitation
HUMANITIES
2.2 Right to freedom of religion, cultural and educational rights, right 2
to constitutional remedies. Protection in respect of conviction for
offences.
2.3 Directive principles of state policy, classification of directives, 2
fundamental duties.
3 Module 3
3.1 The Union executive, the President, the vice President, the 2
council of ministers, the Prime minister, Attorney-General,
functions.
3.2 The parliament, composition, Rajya sabha, Lok sabha, 2
qualification and disqualification of membership, functions of
parliament.
3.3 Union judiciary, the supreme court, jurisdiction, appeal by special 1

leave.
4 Module 4
4.1 The State executive, the Governor, the council of ministers, the 2
Chief minister, advocate general, union Territories.
4.2 The State Legislature, composition, qualification and 2
disqualification of membership, functions.
4.3 The state judiciary, the high court, jurisdiction, writs jurisdiction. 1
5 Module 5
5.1 Relations between the Union and the States, legislative relation, 1
administrative relation, financial Relations, Inter State council,
finance commission.
5.2 Emergency provision, freedom of trade commerce and inter 2
course, comptroller and auditor general of India, public Services,
public service commission, administrative Tribunals.
5.3 Official language, elections, special provisions relating to certain 2
classes, amendment of the Constitution.
HUMANITIES
2 0 0 2
EST 200 DESIGN AND ENGINEERING
Preamble:
The purpose of this course is to
i) introduce the undergraduate engineering studentsthe fundamental principles of
design engineering,
ii) make them understand the steps involved in the design process and
iii) familiarize them with the basic tools used and approaches in design.
Students are expected to apply design thinking in learning as well as while practicing
engineering, which is very important and relevant for today. Case studies from various
practical situations will help the students realize that design is not only concerned about the
function but also many other factors like customer requirements, economics, reliability, etc.
along with a variety of life cycle issues.
The course will help students to consider aesthetics, ergonomics and sustainability factors in
designs and also to practice professional ethics while designing.
Prerequisite:
Nil.The course will be generic to all engineering disciplines and will not require specialized
preparation or prerequisites in any of the individual engineering disciplines.
Course Outcomes:
After the completion of the course the student will be able to
CO 1 Explain the different concepts and principles involved in design engineering.

CO 2 Apply design thinking while learning and practicing engineering.
CO 3 Develop innovative, reliable, sustainable and economically viable designs
incorporating knowledge in engineering.
10 11 12
CO 1 2 1 1 1
CO 2 2 1 1 2
CO 3 2 1 1 2 2 1
HUMANITIES
Assessment Pattern
Continuous Internal Evaluation (CIE) Pattern:
End Semester Examination (ESE) Pattern: There will be two parts; Part A and Part B.
Part A : 30 marks
part B : 70 marks
Part A contains 10 questions with 2 questions from each module, having 3 marks for each question.
Students should answer all questions.
Part B contains 2 case study questions from each module of which student should answer any one.
Each question carry 14 marks and can have maximum 2 sub questions.
Mark distribution
150 50 100 3 hours

1 2 Examination
Remember 5 5 10
Understand 10 10 20
Apply 35 35 70
Analyse - - -
Evaluate - - -
Create - - -
HUMANITIES
Course Outcome 1 (CO1): Appreciate the different concepts and principles involved in design
engineering.
1. State how engineering design is different from other kinds of design
2. List the different stages in a design process.
3. Describedesign thinking.
4. State the function of prototyping and proofing in engineering design.
5. Write notes on the following concepts in connection with design engineering 1) Modular Design,
2) Life Cycle Design , 3) Value Engineering, 4) Concurrent Engineering, and 5) Reverse Engineering
6. State design rights.
Course Outcome 2 (CO2) Apply design thinking while learning and practicing engineering.
1. Construct the iterative process for design thinking in developing simple products like a pen,
umbrella, bag, etc.
2. Show with an example how divergent-convergent thinking helps in generating alternative designs
and then how to narrow down to the best design.
3. Describe how a problem-based learning helps in creating better design engineering solutions.
4. Discuss as an engineer, how ethics play a decisive role in your designs
Course Outcome 3(CO3): Develop innovative, reliable, sustainable and economically viable designs
incorporating different segments of knowledge in engineering.
1. Illustratethe development of any simple product by passing through the different stages of design
process
2. Show thegraphical design communication with the help of detailed 2D or 3D drawings for any
simple product.
3. Describe how to develop new designs for simple products through bio-mimicry.
HUMANITIES
Page 1 of 2
Reg No.: Name:
THIRD/FOURTH SEMESTER B.TECH DEGREE EXAMINATION
Course Name: DESIGN AND ENGINEERING
Max. Marks: 100Duration: 3 Hours
PART A
Answer all questions, each question carries 3 marks
Use only hand sketches
(1) Write aboutthe basic design process.

(2) Describe how to finalize the design objectives.
(3) State the role of divergent-convergent questioning in design thinking.
(4) Discuss how to perform design thinking in a team managing the conflicts.
(5) Show how engineering sketches and drawings convey designs.
(6) Explain the role of mathematics and physics in design engineering process.
(7) Distinguish between project-based learning and problem-based learning in design
engineering.
(8) Describe how concepts like value engineering , concurrent engineering and reverse
engineering influence engineering designs?
(9) Show how designs are varied based on the aspects of production methods, life span,
reliability and environment?
(10) Explain how economics influence the engineering designs?
Part B
Answer any ONE question from each module. Each question carry 14 marks
Module 1
(11) Show the designing of a wrist watch going through the various stages of the design
process. Use hand sketches to illustrate the processes.
or
(12) Find the customer requirements for designing a new car showroom. Show how the
design objectives were finalized considering the design constraints?
HUMANITIES
Module 2
(13) Illustrate the design thinking approach for designing a bag for college students within a
limited budget. Describe each stage of the process and the iterative procedure
involved. Use hand sketches to support your arguments.
or
(14) Construct a number of possible designs and then refine them to narrow down to the
best design for a drug trolley used in hospitals. Show how the divergent-convergent
thinking helps in the process. Provide your rationale for each step by using hand
sketches only.
Module 3
(15) Graphically communicate the design of a thermo flask used to keep hot coffee. Draw
the detailed 2D drawings of the same with design detailing, material selection, scale
drawings, dimensions, tolerances, etc. Use only hand sketches.
or
(16) Describe the role of mathematical modelling in design engineering. Show how
mathematics and physics play a role in designing a lifting mechanism to raise 100 kg of
weight to a floor at a height of 10 meters in a construction site.
Module 4
(17) Show the development of a nature inspired design for a solar poweredbus waiting shed
beside a highway. Relate between natural and man-made designs. Use hand sketches
to support your arguments.
or
(18) Show the design of a simple sofa and then depict how the design changes when
considering 1) aesthetics and 2) ergonomics into consideration. Give hand sketches and
explanations to justify the changes in designs.
Module 5
(19) Examine the changes in the design of a foot wear with constraints of 1) production
methods, 2) life span requirement, 3) reliability issues and 4) environmental factors.
Use hand sketches and give proper rationalization for the changes in design.
or
(20) Describe the how to estimate the cost of a particular design using ANY of the following:
i) a website, ii) the layout of a plant, iii) the elevation of a building, iv) anelectrical or
electronic system or device and v) a car.
Show how economics will influence the engineering designs. Use hand sketches to support
your arguments.
Page 2 of 2
HUMANITIES
Syllabus
Module 1
Design Process:- Introduction to Design and Engineering Design, Defining a Design
Process-:Detailing Customer Requirements, Setting Design Objectives, Identifying
Constraints, Establishing Functions, Generating Design Alternatives and Choosing a
Design.
Module 2
Design Thinking Approach:-Introduction to Design Thinking, Iterative Design
Thinking Process Stages: Empathize, Define, Ideate, Prototype and Test. Design
Thinking as Divergent-Convergent Questioning. Design Thinking in a Team
Environment.
Module 3
Design Communication (Languages of Engineering Design):-Communicating
Designs Graphically, Communicating Designs Orally and in Writing. Mathematical
Modeling In Design, Prototyping and Proofing the Design.
Module 4
Design Engineering Concepts:-Project-based Learning and Problem-based Learning
in Design.Modular Design and Life Cycle Design Approaches. Application of Bio-
mimicry,Aesthetics and Ergonomics in Design. Value Engineering, Concurrent
Engineering, and Reverse Engineering in Design.
Module 5
Expediency, Economics and Environment in Design Engineering:-Design for
Production, Use, and Sustainability. Engineering Economics in Design. Design
Rights. Ethics in Design
Text Books
1) YousefHaik, SangarappillaiSivaloganathan, Tamer M. Shahin, Engineering Design Process,
Cengage Learning 2003, Third Edition, ISBN-10: 9781305253285,
2) Voland, G., Engineering by Design, Pearson India 2014, Second Edition, ISBN 9332535051
Reference Books
1. Philip Kosky, Robert Balmer, William Keat, George Wise, Exploring Engineering, Fourth
Edition: An Introduction to Engineering and Design, Academic Press 2015, 4th Edition,
ISBN: 9780128012420.
2. Clive L. Dym, Engineering Design: A Project-Based Introduction, John Wiley & Sons,
New York 2009, Fourth Edition, ISBN: 978-1-118-32458-5
3. Nigel Cross, Design Thinking: Understanding How Designers Think and Work, Berg
Publishers 2011, First Edition, ISBN: 978-1847886361
4. Pahl, G., Beitz, W., Feldhusen, J., Grote, K.-H., Engineering Design: A Systematic
Approach, Springer 2007, Third Edition, ISBN 978-1-84628-319-2
HUMANITIES
1 Module 1: Design Process
1.1 Introduction to Design and Engineering Design.
What does it mean to design something? How Is
engineering design different from other kinds of design? 1
Where and when do engineers design? What are the basic
vocabularyin engineering design? How to learn and do
engineering design.
1.2 Defining a Design Process-: Detailing Customer
Requirements.
How to do engineering design? Illustrate the process with 1
an example. How to identify the customer requirements of
design?
1.3 Defining a Design Process-: Setting Design Objectives,
Identifying Constraints, Establishing Functions.
How to finalize the design objectives? How to identify the 1
design constraints? How to express the functions a design
in engineering terms?
1.4 Defining a Design Process-: Generating Design
Alternatives and Choosing a Design.
1
How to generate or create feasible design alternatives?
How to identify the "best possible design”?
1.5 Case Studies:- Stages of Design Process.
Conduct exercises for designing simple products going 1
through the different stages of design process.
2 Module 2: Design Thinking Approach
2.1 Introduction to Design Thinking
How does the design thinking approach help engineers in 1
creating innovative and efficient designs?
2.2 Iterative Design Thinking Process Stages: Empathize,
Define, Ideate, Prototype and Test.
How can the engineers arrive at better designs utilizing 1
the iterative design thinking process (in which knowledge
acquired in the later stages can be applied back to the
earlier stages)?
2.3 Design Thinking as Divergent-Convergent Questioning.
Describe how to create a number of possible designs and 1
then how to refine and narrow down to the 'best design'.
2.4 Design Thinking in a Team Environment.
How to perform design thinking as a team managing the 1
conflicts ?
2.5 Case Studies: Design Thinking Approach.
1
Conduct exercises using the design thinking approach for
HUMANITIES
designing any simple products within a limited time and
budget
3 Module 3: Design Communication (Languages of Engineering Design)
3.1 Communicating Designs Graphically.
1
How do engineering sketches and drawings convey designs?
3.2 Communicating Designs Orally and in Writing.
How can a design be communicated through oral 1
presentation or technical reports efficiently?
First Series Examination
3.3 Mathematical Modelling in Design.
How do mathematics and physics become a part of the 1
design process?
3.4 Prototyping and Proofing the Design.
1
How to predict whether the design will function well or not?
3.5 Case Studies: Communicating Designs Graphically.
Conduct exercises for design communication through
detailed 2D or 3D drawings of simple products with 1
design detailing, material selection, scale drawings,
dimensions, tolerances, etc.
4 Module 4: Design Engineering Concepts
4.1 Project-based Learning and Problem-based Learning in 1
Design.
How engineering students can learn design engineering
through projects?
How students can take up problems to learn design
engineering?
4.2 Modular Design and Life Cycle Design Approaches. 1
What is modular approach in design engineering? How it
helps?
How the life cycle design approach influences design
decisions?
4.3 Application of Bio-mimicry, Aesthetics and Ergonomics 1
in Design.
How do aesthetics and ergonomics change engineering
designs?
How do the intelligence in nature inspire engineering
designs? What are the common examples of bio-mimicry
in engineering?
4.4 Value Engineering, Concurrent Engineering, and Reverse 1
Engineering in Design.
How do concepts like value engineering , concurrent
engineering and reverse engineering influence
engineering designs?
4.5 Case Studies: Bio-mimicry based Designs. 1
Conduct exercises to develop new designs for simple
HUMANITIES
products using bio-mimicry and train students to bring out
new nature inspired designs.
5 Module 5: Expediency, Economics and Environment in Design
Engineering
5.1 Design for Production, Use, and Sustainability. 1
How designs are finalized based on the aspects of
production methods, life span, reliability and
environment?
5.2 Engineering Economics in Design. 1
How to estimate the cost of a particular design and how
will economics influence the engineering designs?
5.3 Design Rights. 1
What are design rights and how can an engineer put it
into practice?
5.4 Ethics in Design. 1
How do ethics play a decisive role in engineering design?
5.5 Case Studies: Design for Production, Use, and 1
Sustainability.
Conduct exercises using simple products to show how designs
change with constraints of production methods, life span
requirement, reliability issues and environmental factors.
Second Series Examination
HUMANITIES
Code. Course Name L T P Hrs Credit
HUT 200 Professional Ethics 2 0 0 2 2
Preamble:To enable students to create awareness on ethics and human values.

Prerequisite: Nil
CO 1 Understand the core values that shape the ethical behaviour of a professional.
CO 2 Adopt a good character and follow an ethical life.
Explain the role and responsibility in technological development by keeping personal ethics
CO 3 and legal ethics.
Solve moral and ethical problems through exploration and assessment by established
CO 4 experiments.
Apply the knowledge of human values and social values to contemporary ethical values and
CO 5 global issues.
PO PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO1 PO1 PO1

1 0 1 2
CO 1 2 2
CO 2 2 2
CO 3 3 2
CO 4 3 2
CO 5 3 2
Assessment Pattern
Bloom’s category End Semester Exam
1 2
Remember 15 15 30
Understood 20 20 40
Apply 15 15 30
Mark distribution
Total
CIE ESE ESE Duration
Marks
150 50 100 3 hours

HUMANITIES
Continuous Assessment Tests (2 Nos) : 25 marks
Assignments/Quiz : 15 marks
End Semester Examination Pattern: There will be two parts; Part A and Part B. Part A contains 10 questions
with 2 questions from each module, having 3 marks for each question. Students should answer all questions.
Part B contains 2 questions from each module of which student should answer any one. Each question can have

1. Define integrity and point out ethical values.
2. Describe the qualities required to live a peaceful life.
3. Explain the role of engineers in modern society.

1. Derive the codes of ethics.
2. Differentiate consensus and controversy.
3. Discuss in detail about character and confidence.

1. Explain the role of professional’s ethics in technological development.
2. Distinguish between self interest and conflicts of interest.
3. Review on industrial standards and legal ethics.

1. Illustrate the role of engineers as experimenters.
2. Interpret the terms safety and risk.
3. Show how the occupational crimes are resolved by keeping the rights of employees.

1. Exemplify the engineers as managers.
2. Investigate the causes and effects of acid rain with a case study.
3. Explorate the need of environmental ethics in technological development.
HUMANITIES
QP CODE: Reg No: _
PAGES:3 Name : _
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD/FOURTH SEMESTER


Course Name: PROFESSIONAL ETHICS
(2019-Scheme)
PART A
1. Define empathy and honesty.
2. Briefly explain about morals, values and ethics.
3. Interpret the two forms of self-respect.
4. List out the models of professional roles.
5. Indicate the advantages of using standards.
6. Point out the conditions required to define a valid consent?
7. Identify the conflicts of interests with an example?
8. Recall confidentiality.
9. Conclude the features of biometric ethics.
10. Name any three professional societies and their role relevant to engineers.
(10x3 = 30 marks)
PART B
MODULE I
11. a) Classify the relationship between ethical values and law?
b) Compare between caring and sharing. (10+4 = 14 marks)
Or
12. a) Exemplify a comprehensive review about integrity and respect for others.
HUMANITIES
b) Discuss about co-operation and commitment. (8+6 = 14 marks)
MODULE II
13.a) Explain the three main levels of moral developments, deviced by Kohlberg.
b) Differentiate moral codes and optimal codes. (10+4 = 14 marks)
Or
14. a) Extrapolate the duty ethics and right ethics.
b) Discuss in detail the three types of inquiries in engineering ethics (8+6 = 14 marks)
MODULE III
Summarize the following features of morally responsible engineers.
(i) Moral autonomy (ii) Accountability
b)Explain the rights of employees (8+6 = 14 marks)
Or
16. a) Explain the reasons for Chernobyl mishap ?
b) Describe the methods to improve collegiality and loyalty. (8+6 = 14 marks)
MODULE IV
17.a) Execute collegiality with respect to commitment, respect and connectedness.
b) Identify conflicts of interests with an example. (8+6 = 14 marks)

Or
18. a) Explain in detail about professional rights and employee rights.

b) Exemplify engineers as managers.
MODULE V
19.a) Evaluate the technology transfer and appropriate technology.

b) Explain about computer and internet ethics. (8+6 = 14 marks)
Or
20. a) Investigate the causes and effects of acid rain with a case study.
b) Conclude the features of ecocentric and biocentric ethics. (8+6 = 14 marks)
HUMANITIES
Syllabus
Module 1 – Human Values.
Morals, values and Ethics – Integrity- Academic integrity-Work Ethics- Service Learning- Civic Virtue-
Respect for others- Living peacefully- Caring and Sharing- Honestly- courage-Cooperation commitment-
Empathy-Self Confidence -Social Expectations.
Module 2 - Engineering Ethics & Professionalism.
Senses of Engineering Ethics - Variety of moral issues- Types of inquiry- Moral dilemmas –Moral Autonomy –
Kohlberg’s theory- Gilligan’s theory- Consensus and Controversy-Profession and Professionalism- Models of
professional roles-Theories about right action –Self interest-Customs and Religion- Uses of Ethical Theories.
Module 3- Engineering as social Experimentation.
Engineering as Experimentation – Engineers as responsible Experimenters- Codes of Ethics- Plagiarism-

A balanced outlook on law - Challenges case study- Bhopal gas tragedy.
Module 4- Responsibilities and Rights.
Collegiality and loyalty – Managing conflict- Respect for authority- Collective bargaining- Confidentiality-
Role of confidentiality in moral integrity-Conflicts of interest- Occupational crime- Professional rights-
Employee right- IPR Discrimination.
Module 5- Global Ethical Issues.
Multinational Corporations- Environmental Ethics- Business Ethics- Computer Ethics -Role in Technological
Development-Engineers as Managers- Consulting Engineers- Engineers as Expert witnesses and advisors-Moral
leadership.
Text Book
1. M Govindarajan, S Natarajan and V S Senthil Kumar, Engineering Ethics, PHI Learning

Private Ltd, New Delhi,2012.
2. R S Naagarazan, A text book on professional ethics and human values, New age international
(P) limited ,New Delhi,2006.
Reference Books
1. Mike W Martin and Roland Schinzinger, Ethics in Engineering,4th edition, Tata McGraw Hill
Publishing Company Pvt Ltd, New Delhi,2014.
2. Charles D Fleddermann, Engineering Ethics, Pearson Education/ Prentice Hall of India, New
Jersey,2004.
3. Charles E Harris, Michael S Protchard and Michael J Rabins, Engineering Ethics- Concepts and
cases, Wadsworth Thompson Learning, United states,2005.
4. http://www.slideword.org/slidestag.aspx/human-values-and-Professional-ethics.
HUMANITIES
SL.N Topic No. of Lectures

o 25
1 Module 1 – Human Values.
1.1 Morals, values and Ethics, Integrity, Academic Integrity,Work Ethics 1

1.2 Service Learning, Civic Virtue, Respect for others, Living peacefully 1
1.3 Caring and Sharing, Honesty, Courage, Co-operation commitment 2
1.4 Empathy, Self Confidence, Social Expectations 1
2 Module 2- Engineering Ethics & Professionalism.
2.1 Senses of Engineering Ethics, Variety of moral issues, Types of inquiry 1

2.2 Moral dilemmas, Moral Autonomy, Kohlberg’s theory 1
Gilligan’s theory, Consensus and Controversy,Profession&
2.3 2
Professionalism, Models of professional roles, Theories about right action
2.4 Self interest-Customs and Religion, Uses of Ethical Theories 1
3 Module 3- Engineering as social Experimentation.
3.1 Engineering as Experimentation, Engineers as responsible Experimenters 1

3.2 Codes of Ethics,Plagiarism, A balanced outlook on law 2
3.3 Challenger case study, Bhopal gas tragedy 2
4 Module 4- Responsibilities and Rights.
4.1 Collegiality and loyalty, Managing conflict, Respect for authority 1

Collective bargaining, Confidentiality, Role of confidentiality in moral
4.2 2
integrity, Conflicts of interest
Occupational crime, Professional rights, Employee right, IPR
4.3 2
Discrimination
5 Module 5- Global Ethical Issues.
Multinational Corporations, Environmental Ethics, Business Ethics,

5.1 2
Computer Ethics
5.2 Role in Technological Development, Moral leadership 1
Engineers as Managers, Consulting Engineers, Engineers as Expert
5.3 2
witnesses and advisors
B. Tech Computer Science and Engineering
SEMESTER V
Course
Sl. No Course L-T-P Category Page No
Code
FORMAL LANGUAGES AND
1 CST 301 3-1-0 PCC 4
AUTOMATA THEORY
2 CST 303 COMPUTER NETWORKS 3-1-0 PCC 16
3 CST 305 SYSTEM SOFTWARE 3-1-0 PCC 28
MICROPROCESSORS AND
4 CST 307 3-1-0 PCC 39
MICROCONTROLLERS
MANAGEMENTOF
5 CST 309 3-0-0 PCC 49
SOFTWARE SYSTEMS
SYSTEM SOFTWARE AND
7 CSL 331 0-0-4 PCC 61
MICROPROCESSORS LAB
DATABASE MANAGEMENT
8 CSL 333 0-0-4 PCC 66
SYSTEMS LAB
CONCEPTS IN SOFTWARE
9 CST 381 3-1-0 Minor 74
ENGINEERING
CONCEPTS IN MACHINE
10 CST 383 3-1-0 Minor 85
LEARNING
11 CST 385 CLIENT SERVER SYSTEMS 3-1-0 Minor 99
CRYPTOGRAPHIC
12 CST 393 3-1-0 Honours 110
ALGORITHMS
NEURAL NETWORKS AND
13 CST 395 3-1-0 Honours 122
DEEP LEARNING
PRINCIPLES OF MODEL
14 CST 397 3-1-0 Honours 135
CHECKING
1
COMPUTER
SEMESTER SCIENCE
VI AND ENGINEERING
Course
Sl. No Course L-T-P Category Page No
Code
1 CST 302 COMPILER DESIGN 3-1-0 PCC 147
COMPUTER GRAPHICS AND
2 CST 304 3-1-0 PCC 158
IMAGE PROCESSING
ALGORITHM ANALYSIS AND
3 CST 306 3-1-0 PCC 170
DESIGN
COMPREHENSIVE COURSE
4 CST 308 1-0-0 PCC 184
WORK
5 CSL 332 NETWORKING LAB 0-0-3 PCC 197
6 CSD 334 MINI PROJECT 0-0-3 PCC 203
FOUNDATIONSOF
7 CST 312 2-1-0 PEC 209
MACHINE LEARNING
8 CST 322 DATA ANALYTICS 2-1-0 PEC 225
FOUNDATIONS OF SECURITY
9 CST 332 2-1-0 PEC 238
IN COMPUTING
AUTOMATED
10 CST 342 2-1-0 PEC 248
VERIFICATION
11 CSL 362 PROGRAMMING IN PYTHON 2-1-0 PEC 258
DATA AND COMPUTER
12 CST 372 2-1-0 PEC 270
COMMUNICATION
INTRODUCTION TO
13 CST 382 3-1-0 Minor 184
SOFTWARE TESTING
CONCEPTS IN DEEP
14 CST 384 3-1-0 Minor 295
LEARNING
WIRELESS NETWORKS AND
15 CST 386 3-1-0 Minor 309
IOT APPLICATIONS
16 CST 394 NETWORK SECURITY 3-1-0 Honours 321
ADVANCED TOPICS IN
17 CST 396 3-1-0 Honours 333
MACHINE LEARNING
THEORY OF COMPUTABILITY
18 CST 398 3-1-0 Honours 349
AND COMPLEXITY
2
SEMESTER V
3
FORMAL Year of
Category L T P Credit
CST LANGUAGES AND Introduction
301 AUTOMATA
THEORY PCC 3 1 0 4 2019
Preamble: This is a core course in theoretical computer science. It covers automata and
grammar representations for languages in Chomsky Hierarchy. For regular languages, it also
covers representations using regular expression and Myhill-Nerode Relation. The topics
covered in this course have applications in various domains including compiler design,
decidability and complexity theory, software testing, formal modelling and verification of
hardware and software.
Prerequisite: Basic knowledge about the following topic is assumed: sets, relations -
equivalence relations, functions, proof by Principle of Mathematical Induction.
Classify a given formal language into Regular, Context-Free, Context

CO1 Sensitive, Recursive or Recursively Enumerable. [Cognitive knowledge
level: Understand]
Explain a formal representation of a given regular language as a finite state

CO2 automaton, regular grammar, regular expression and Myhill-Nerode
relation. [Cognitive knowledge level: Understand]
Design a Pushdown Automaton and a Context-Free Grammar for a given

CO3
context-free language. [Cognitive knowledge level : Apply]
Design Turing machines as language acceptors or transducers. [Cognitive

CO4
knowledge level: Apply]
Explain the notion of decidability. [Cognitive knowledge level:

CO5
Understand]
0 2
CO1
4
CO2
CO3
CO4
CO5

problems
Assessment Pattern
Bloom’s Continuous Assessment Tests End Semester

Category Examination
Test 1 (Marks) Test 2 (Marks)
Marks
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create
5
Mark Distribution
Total Marks CIE ESE Marks ESE Duration

Marks
150 50 100 3 hours

Continuous Assessment - Test : 25 marks
Continuous Assessment - Assignment : 15 marks
Each of the two internal examinations has to be conducted out of 50 marks. The first series test
series test shall be preferably conducted after completing the remaining part of the syllabus.
each from the completed modules and 1 question from the partly completed module), having 3
modules and 1 question from the partly completed module), each with 7 marks. Out of the 7
questions, a student should answer any 5.
6
Syllabus
CST 301 Formal Languages and Automata Theory
Module - 1 (Introduction to Formal Language Theory and Regular Languages)
Introduction to formal language theory– Alphabets, Strings, Concatenation of strings,

Languages.
Regular Languages - Deterministic Finite State Automata (DFA) (Proof of correctness of

construction not required), Nondeterministic Finite State Automata (NFA), Equivalence of
DFA and NFA, Regular Grammar (RG), Equivalence of RGs and DFA.
Module - 2 (More on Regular Languages)
Regular Expression (RE), Equivalence of REs and DFA, Homomorphisms, Necessary

conditions for regular languages, Closure Properties of Regular Languages, DFA state
minimization (No proof required).
Module - 3 (Myhill-Nerode Relations and Context Free Grammars)
Myhill-Nerode Relations (MNR)- MNR for regular languages, Myhill-Nerode Theorem (MNT)
(No proof required), Applications of MNT.
Context Free Grammar (CFG)- CFG representation of Context Free Languages (proof of
correctness is required), derivation trees and ambiguity, Normal forms for CFGs.
Module - 4 (More on Context-Free Languages)
Nondeterministic Pushdown Automata (PDA), Deterministic Pushdown Automata (DPDA),

Equivalence of PDAs and CFGs (Proof not required), Pumping Lemma for Context-Free
Languages (Proof not required), Closure Properties of Context Free Languages.
Module - 5 (Context Sensitive Languages, Turing Machines)
Context Sensitive Languages - Context Sensitive Grammar (CSG), Linear Bounded Automata.
Turing Machines - Standard Turing Machine, Robustness of Turing Machine, Universal Turing
Machine, Halting Problem, Recursive and Recursively Enumerable Languages.
Chomsky classification of formal languages.
Text Book
1. Dexter C. Kozen, Automata and Computability, Springer (1999)
7
Reference Materials
1. John E Hopcroft, Rajeev Motwani and Jeffrey D Ullman, Introduction to Automata Theory,
Languages, and Computation, 3/e, Pearson Education, 2007
2. Michael Sipser, Introduction To Theory of Computation, Cengage Publishers, 2013.
Course Outcome 1 (CO1): Identify the class of the following languages in Chomsky
Hierarchy:
• 𝐿𝐿1 = {𝑎𝑎𝑝𝑝 |𝑝𝑝𝑝𝑝𝑝𝑝 𝑎𝑎 𝑝𝑝𝑝𝑝𝑝𝑝𝑝𝑝𝑝𝑝 𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛}
• 𝐿𝐿2 =
{𝑥𝑥{0,1}∗ |𝑥𝑥𝑥𝑥𝑥𝑥 𝑡𝑡ℎ𝑒𝑒 𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏 𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟 𝑜𝑜𝑜𝑜 𝑎𝑎 𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑 𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛 𝑤𝑤ℎ𝑖𝑖𝑖𝑖ℎ 𝑖𝑖𝑖𝑖 𝑎𝑎 𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚 𝑜𝑜𝑜𝑜5}
• 𝐿𝐿3 = {𝑎𝑎𝑛𝑛 𝑏𝑏 𝑛𝑛 𝑐𝑐 𝑛𝑛 |𝑛𝑛 ≥ 0}
• 𝐿𝐿4 = {𝑎𝑎𝑚𝑚 𝑏𝑏 𝑛𝑛 𝑐𝑐 𝑚𝑚 +𝑛𝑛 |𝑚𝑚 > 0, 𝑛𝑛 ≥ 0}
• 𝐿𝐿5 = {𝑀𝑀#𝑥𝑥|𝑀𝑀ℎ𝑎𝑎𝑎𝑎𝑎𝑎𝑎𝑎 𝑜𝑜𝑜𝑜𝑜𝑜}. Here, 𝑀𝑀 is a binary encoding of a Turing Machine and 𝑥𝑥 is a
binary input to the Turing Machine.
(i) Design a DFA for the language 𝐿𝐿 = {𝑎𝑎𝑎𝑎𝑎𝑎|𝑥𝑥 ∈ {𝑎𝑎, 𝑏𝑏}∗ }
(ii) Write a Regular Expression for the
language:𝐿𝐿 = {𝑥𝑥 ∈ {𝑎𝑎, 𝑏𝑏}∗ |𝑡𝑡ℎ𝑖𝑖𝑖𝑖𝑖𝑖 𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙 𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠 𝑖𝑖𝑖𝑖 𝑥𝑥 𝑖𝑖𝑖𝑖 𝑏𝑏}
(iii) Write a Regular Grammar for the
language:𝐿𝐿 = {𝑥𝑥 ∈ {0,1}∗ |𝑡𝑡ℎ𝑒𝑒𝑒𝑒𝑒𝑒 𝑎𝑎𝑎𝑎𝑎𝑎 𝑛𝑛𝑛𝑛 𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑣𝑣𝑣𝑣 𝑧𝑧𝑧𝑧𝑧𝑧𝑧𝑧𝑧𝑧 𝑖𝑖𝑖𝑖𝑖𝑖}
(iv) Show the equivalence classes of the canonical Myhill-Nerode relation induced by the
language: 𝐿𝐿 = {𝑥𝑥 ∈ {𝑎𝑎, 𝑏𝑏}∗ |𝑥𝑥𝑥𝑥𝑥𝑥𝑥𝑥𝑥𝑥𝑥𝑥𝑥𝑥𝑥𝑥𝑥𝑥 𝑒𝑒𝑒𝑒𝑒𝑒𝑒𝑒 𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛 𝑜𝑜𝑜𝑜𝑜𝑜′𝑠𝑠 𝑎𝑎𝑎𝑎𝑎𝑎 𝑜𝑜𝑜𝑜𝑜𝑜 𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛 𝑜𝑜𝑜𝑜𝑜𝑜′𝑠𝑠}.
(i) Design a PDA for the language𝐿𝐿 = {𝑤𝑤𝑤𝑤 𝑅𝑅 |𝑤𝑤 ∈ {𝑎𝑎, 𝑏𝑏}∗ }. Here, the notation 𝑤𝑤 𝑅𝑅
represents the reverse of the string 𝑤𝑤.
(ii) Write a Context-Free Grammar for the language 𝐿𝐿 = {𝑎𝑎𝑛𝑛 𝑏𝑏 2𝑛𝑛 |𝑛𝑛 ≥ 0}.
(i) Design a Turing Machine for the language 𝐿𝐿 = {𝑎𝑎𝑛𝑛 𝑏𝑏 𝑛𝑛 𝑐𝑐 𝑛𝑛 |𝑛𝑛 ≥ 0}
(ii) Design a Turing Machine to compute the square of a natural number. Assume that the
input is provided in unary representation.
Course Outcome 5 (CO5): Argue that it is undecidable to check whether a Turing
Machine 𝑀𝑀enters a given state during the computation of a given input 𝑥𝑥.
8

QP CODE: PAGES:3
Reg No:______________ Name :______________
FIFTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Code: CST301
Course Name: Formal Languages and Automata Theory
PART A
1. Design a DFA for the language 𝐿𝐿 = {𝑥𝑥 ∈ {𝑎𝑎, 𝑏𝑏}∗ |𝑎𝑎𝑎𝑎𝑎𝑎 𝑖𝑖𝑖𝑖 𝑛𝑛𝑛𝑛𝑛𝑛 𝑎𝑎 𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠 𝑖𝑖𝑖𝑖 𝑥𝑥}.
2. Write a Regular Grammar for the language: 𝐿𝐿 = {𝑎𝑎𝑎𝑎𝑎𝑎|𝑥𝑥 ∈ {𝑎𝑎, 𝑏𝑏}∗ }
3. Write a Regular Expression for the language:

𝐿𝐿 = {𝑥𝑥 ∈ {0,1}∗ |𝑡𝑡ℎ𝑒𝑒𝑒𝑒𝑒𝑒 𝑎𝑎𝑎𝑎𝑎𝑎 𝑛𝑛𝑛𝑛 𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐 1′𝑠𝑠 𝑖𝑖𝑖𝑖 𝑥𝑥}
4. Prove that the language 𝐿𝐿1 = {𝑎𝑎𝑛𝑛! |𝑛𝑛 ∈ 𝑁𝑁} is not regular.
5. List out the applications of Myhill-Nerode Theorem.
6. Write a Context-Free Grammar for the language: 𝐿𝐿 = {𝑥𝑥 ∈ {𝑎𝑎, 𝑏𝑏}∗ |#𝑎𝑎 (𝑥𝑥) =
#𝑏𝑏 (𝑥𝑥)}. Here, the notation #1 (𝑤𝑤) represents the number of occurrences of the
symbol 1 in the string 𝑤𝑤.
7. Design a PDA for the language of odd length binary palindromes (no explanation
is required, just list the transitions in the PDA).
8. Prove that Context Free Languages are closed under set union.
9. Write a Context Sensitive Grammar for the language 𝐿𝐿 = {𝑎𝑎𝑛𝑛 𝑏𝑏 𝑛𝑛 𝑐𝑐 𝑛𝑛 |𝑛𝑛 ≥ 0} (no
explanation is required, just write the set of productions in the grammar).
9
10. Differentiate between Recursive and Recursively Enumerable Languages.

(10x3=30)
Part B
(Answer any one question from each module. Each question carries 14
Marks)
11. (a) Draw the state-transition diagram showing an NFA 𝑁𝑁 for the following
language 𝐿𝐿. Obtain the DFA𝐷𝐷 equivalent to 𝑁𝑁 by applying the subset (7)
construction algorithm.
𝐿𝐿 = {𝑥𝑥 ∈ {𝑎𝑎, 𝑏𝑏}∗ |𝑡𝑡ℎ𝑒𝑒 𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠 𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙 𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠𝑠 𝑖𝑖𝑖𝑖 𝑥𝑥 𝑖𝑖𝑖𝑖 𝑏𝑏}
(b) Draw the state-transition diagram showing a DFA for recognizing the
following language: (7)
𝐿𝐿 = {𝑥𝑥 ∈ {0,1}∗ |𝑥𝑥 𝑖𝑖𝑖𝑖 𝑎𝑎 𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏 𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟𝑟 𝑜𝑜𝑜𝑜 𝑎𝑎 𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛

𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛𝑛 𝑤𝑤ℎ𝑖𝑖𝑖𝑖ℎ 𝑖𝑖𝑖𝑖 𝑎𝑎multiple of 5}
OR
12. (a) Write a Regular grammar 𝐺𝐺 for the following language 𝐿𝐿defined as: 𝐿𝐿 =
{𝑥𝑥 ∈ {𝑎𝑎, 𝑏𝑏}∗ |𝑥𝑥𝑥𝑥𝑥𝑥𝑥𝑥𝑥𝑥 𝑛𝑛𝑛𝑛𝑛𝑛 𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐 𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐𝑐′𝑠𝑠}. (7)
(b) Obtain the DFA 𝐴𝐴𝐺𝐺 over the alphabet set 𝛴𝛴 = {𝑎𝑎, 𝑏𝑏}, equivalent to the regular (7)
grammar 𝐺𝐺 with start symbol 𝑆𝑆 and productions: 𝑆𝑆 → 𝑎𝑎𝑎𝑎 and 𝐴𝐴 → 𝑎𝑎𝑎𝑎|𝑏𝑏𝑏𝑏|𝑏𝑏.
13. (a) Using Kleen’s construction, obtain the regular expression for the language
represented by the following NFA
(8)
(b) Using pumping lemma for regular languages, prove that the language
𝐿𝐿 = {𝑎𝑎𝑛𝑛 𝑏𝑏 𝑛𝑛 |𝑛𝑛 ≥ 0} is not regular. (7)
OR
10
14. (a) Obtain (8)

the
minimum
-state
DFA
from the
following
DFA.
(b) Using ultimate periodicity for regular languages, prove that the language (6)
𝑛𝑛 2
𝐿𝐿 = {𝑎𝑎 |𝑛𝑛 ≥ 0} is not regular.
15. (a) Show the equivalence classes of the canonical Myhill-Nerode relation for the (7)
language of binary strings with odd number of 1′s and even number of 0s.
(b) With an example, explain ambiguity in Context Free Grammar (7)
OR
16. (a) Convert the Context-Free Grammar with productions: {𝑆𝑆 → 𝑎𝑎𝑎𝑎𝑎𝑎|𝜖𝜖} into
Greibach Normal form. (8)
(b) Convert the Context-Free Grammar with productions: {𝑆𝑆 → 𝑎𝑎𝑎𝑎𝑎𝑎|𝑏𝑏𝑏𝑏𝑏𝑏|𝑆𝑆𝑆𝑆|𝜖𝜖} (6)
into Chomsky Normal form.
17. (a) Design a PDA for the language 𝐿𝐿 = {𝑎𝑎𝑚𝑚 𝑏𝑏 𝑛𝑛 𝑐𝑐 𝑚𝑚 +𝑛𝑛 |𝑛𝑛 ≥ 0, 𝑚𝑚 ≥ 0}. Also (7)
illustrate the computation of the PDA on a string in the language
(b) With an example illustrate how a multi-state PDA can be transformed into an (7)
equivalent single-state PDA.
OR
11
18. (a) Using pumping lemma for context-free languages, prove that the language: (6)
𝐿𝐿 = {𝑤𝑤𝑤𝑤|𝑤𝑤 ∈ {𝑎𝑎, 𝑏𝑏}∗ } is not a context-free language.
(b) With an example illustrate how a CFG can be converted to a single-state PDA (8)
19. (a) Design a Turing machine to obtain the sum of two natural numbers 𝑎𝑎 and 𝑏𝑏, (7)
both represented in unary on the alphabet set {1}. Assume that initially the
𝜔𝜔 𝜔𝜔
tape contains ⊢ 1𝑎𝑎 01𝑏𝑏 ♭ . The Turing Machine should halt with ⊢ 1𝑎𝑎+𝑏𝑏 ♭
as the tape content. Also, illustrate the computation of your Turing Machine
on the input 𝑎𝑎 = 3and 𝑏𝑏 = 2.
(b) With an example illustrate how a CFG can be converted to a single-state (7)
PDA.
OR
20. (a) Design a Turing machine to obtain the sum of two natural numbers 𝑎𝑎and 𝑏𝑏, (7)
both represented in unary on the alphabet set {1}. Assume that initially the
𝜔𝜔 𝜔𝜔
tape contains ⊢ 1𝑎𝑎 01𝑏𝑏 ♭ . The Turing Machine should halt with ⊢ 1𝑎𝑎+𝑏𝑏 ♭
as the tape content. Also, illustrate the computation of your Turing Machine
on the input 𝑎𝑎 = 3and 𝑏𝑏 = 2.
(b) Write a context sensitive grammar for the language 𝐿𝐿 = {𝑎𝑎𝑛𝑛 𝑏𝑏 𝑛𝑛 𝑐𝑐 𝑛𝑛 |𝑛𝑛 ≥ 0}. (7 )
Also illustrate how the the string 𝑎𝑎2 𝑏𝑏 2 𝑐𝑐 2 can be derived from the start symbol
of the proposed grammar.
12
Teaching Plan
Sl. Topic No. of

No Hours
(45 hrs)
Module - 1 (Introduction to Formal Language Theory and Regular

Languages) 9 Hours
Introduction to formal language theory – Alphabets, strings, concatenation

1.1 1 Hour
of strings, Languages
Deterministic Finite State Automata (DFA) – Example DFA (Proof of

1.2 1 Hour
correctness of construction not required)
1.3 Formal definition of DFA, Language accepted by the class of DFA 1 Hour
1.4 Nondeterministic Finite State Automata (NFA) – Example NFA 1 Hour
Formal definition of NFA, NFA with 𝜖𝜖 transitions - examples, formal

1.5 1 Hour
definition
Equivalence of DFA and NFA with and without 𝜖𝜖 transitions - Subset

1.6 1 Hour
construction
1.7 Regular Grammar (RG) – Example RGs, derivation of sentences 1 Hour
1.8 Formal definition of RG, Language represented by a RG 1 Hour
1.9 Equivalence of RG and DFA 1 Hour
Module - 2 (More on Regular Languages) 9 Hours
2.1 Regular Expression (RE) - Example REs and formal definition 1 Hour
2.2 Conversion of RE to NFA with 𝜖𝜖 transition 1 Hour
2.3 Conversion of NFA with 𝜖𝜖 transition to RE (Kleen’s construction) 1 Hour
2.4 Homomorphisms 1 Hour
2.5 Pumping Lemma for regular languages 1 Hour
2.6 Ultimate periodicity 1 Hour
2.7 Closure Properties of Regular Languages (proof not required) 1 Hour
13
2.8 DFA state minimization - Quotient construction 1 Hour
2.9 State Minimization Algorithm - Example 1 Hour
Module - 3 (Myhill-Nerode Relations and Context Free Grammars) 10

Hours
Myhill-Nerode Relations (MNR) - Example, Properties of MyhillNerode

3.1 1 Hour
Relation
3.2 Conversion of DFA to MNR (Proof of correctness not required) 1 Hour
3.3 Conversion of MNR to DFA(Proof of correctness not required) 1 Hour
3.4 Myhill-Nerode Theorem (MNT) 1 Hour
3.5 Applications of MNT 1 Hour
3.6 Context Free Grammar (CFG) - Example CFGs and formal definition 1 Hour
3.7 Proving correctness of CFGs 1 Hour
3.8 Derivation Trees and ambiguity 1 Hour
3.9 Chomsky Normal Form 1 Hour
3.10 Greibach Normal Form 1 Hour
Module - 4 (More on Context-Free Languages) 8 Hours
Nondeterministic Pushdown Automata (PDA) – Example PDAs, formal

4.1 1 Hour
definition
4.2 Acceptance criteria - equivalence 1 Hour
4.3 Deterministic PDA 1 Hour
4.4 Conversion of CFG to PDA (No proof required) 1 Hour
4.5 Conversion of PDA to CGF - Part I (No proof required) 1 Hour
4.6 Conversion of PDA to CGF - Part II (No proof required) 1 Hour
4.7 Pumping Lemma for context-free languages (No proof required) 1 Hour
4.8 Closure Properties of Context Free Languages 1 Hour
14
Module - 5 (Context Sensitive Languages, Turing Machines ) 9 Hours
5.1 Context Sensitive Grammar (CSG) - Examples, formal definition 1 Hour
5.2 Linear Bounded Automata (LBA) - Example LBA, formal definition 1 Hour
Turing Machine (TM) - TM as language acceptors - examples, formal

5.3 1 Hour
definition
5.4 TM as transducers - examples 1 Hour
Robustness of the standard TM model - Multi-tape TMs, Nondeterministic

5.5 1 Hour
TM
5.6 Universal Turing Machine 1 Hour
5.7 Halting Problem of TM - proof of its undecidability 1 Hour
5.8 Recursive and Recursively Enumerable Languages 1 Hour
5.9 Chomsky classification of formal languages 1 Hour
15
Year of
CST COMPUTER Category L T P Credit
Introduction
303 NETWORKS
PCC 3 1 0 4 2019
Preamble: Study of this course provides the learners a clear understanding of how computer
networks from local area networks to the massive and global Internet are built, how they allow
computers to share information and communicate with one another. This course covers the
physical aspects of computer networks, layers of OSI Reference model, and inter-networking.
The course helps the learners to compare and analyze the existing network technologies and
choose a suitable network design for a given system.
Prerequisite: Nil
Course Outcomes: After the completion of the course, the student will be able to
CO# Course Outcomes
Explain the features of computer networks, protocols, and network design

CO1 models (Cognitive Knowledge: Understand)
Describe the fundamental characteristics of the physical layer and identify the
CO2 usage in network communication (Cognitive Knowledge: Apply)
Explain the design issues of data link layer, link layer protocols, bridges and
CO3 switches (Cognitive Knowledge: Understand)
Illustrate wired LAN protocols (IEEE 802.3) and wireless LAN protocols (IEEE
CO4 802.11) (Cognitive Knowledge: Understand)
Select appropriate routing algorithms, congestion control techniques, and

CO5 Quality of Service requirements for a network (Cognitive Knowledge: Apply)
CO6 Illustrate the functions and protocols of the network layer, transport layer, and
application layer in inter-networking (Cognitive Knowledge: Understand)
16
PO1
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO12
1
CO1
CO2
CO3
CO4
CO5
CO6
PO3 Design/Development of solutions PO9 Individual and teamwork

problems
PO6 The Engineer and Society PO12 Lifelong learning
Assessment Pattern
End Semester
percentage)
Remember 40 30 30
17
Understand 50 50 50
Apply 10 20 20
Analyze
Evaluate
Create
Mark Distribution
ESE
Total Marks CIE Marks ESE Marks
Duration
150 50 100 3
shall be preferably conducted after completing the first half of the syllabus. The second series
test shall be preferably conducted after completing the remaining part of the syllabus. There
modules and 1 question from the partly completed module), each with 7 marks. Out of the 7
questions, a student should answer any 5.
contains 2 questions from each module of which a student should answer anyone. Each
18
Syllabus
Module - 1 (Introduction and Physical Layer)
Introduction – Uses of computer networks, Network hardware, Network software. Reference

models – The OSI reference model, The TCP/IP reference model, Comparison of OSI and
TCP/IP reference models.
Physical Layer – Modes of communication, Physical topologies, Signal encoding, Repeaters and
hub, Transmission media overview. Performance indicators – Bandwidth, Throughput, Latency,
Queuing time, Bandwidth–Delay product.
Module - 2 (Data Link Layer)
Data link layer - Data link layer design issues, Error detection and correction, Sliding window
protocols, High-Level Data Link Control(HDLC)protocol. Medium Access Control (MAC)
sublayer –Channel allocation problem, Multiple access protocols, Ethernet, Wireless LANs -
802.11, Bridges & switches - Bridges from 802.x to 802.y, Repeaters, Hubs, Bridges, Switches,
Routers and Gateways.
Module - 3 (Network Layer)
Network layer design issues. Routing algorithms - The Optimality Principle, Shortest path
routing, Flooding, Distance Vector Routing, Link State Routing, Multicast routing, Routing for
mobile hosts. Congestion control algorithms. Quality of Service (QoS) - requirements,
Techniques for achieving good QoS.
Module - 4 (Network Layer in the Internet)
IP protocol, IP addresses, Internet Control Message Protocol (ICMP), Address Resolution

Protocol (ARP), Reverse Address Resolution Protocol (RARP), Bootstrap Protocol (BOOTP),
Dynamic Host Configuration Protocol (DHCP). Open Shortest Path First(OSPF) Protocol,
Border Gateway Protocol (BGP), Internet multicasting, IPv6, ICMPv6.
Module – 5 (Transport Layer and Application Layer)
Transport service – Services provided to the upper layers, Transport service primitives. User
Datagram Protocol (UDP). Transmission Control Protocol (TCP) – Overview of TCP, TCP
segment header, Connection establishment &release, Connection management modeling, TCP
retransmission policy, TCP congestion control.
Application Layer –File Transfer Protocol (FTP), Domain Name System (DNS), Electronic
mail, Multipurpose Internet Mail Extension (MIME), Simple Network Management Protocol
19
(SNMP), World Wide Web(WWW) – Architectural overview.
Text Books
1. Andrew S. Tanenbaum, Computer Networks, 4/e, PHI (Prentice Hall India).

2. Behrouz A Forouzan, Data Communication and Networking, 4/e, Tata McGraw Hill
Reference Books
1. Larry L Peterson and Bruce S Dave, Computer Networks – A Systems Approach, 5/e,
Morgan Kaufmann.
2. Fred Halsall, Computer Networking and the Internet, 5/e.
3. James F. Kurose, Keith W. Ross, Computer Networking: A Top-Down Approach, 6/e.
4. Keshav, An Engineering Approach to Computer Networks, Addison Wesley, 1998.
5. W. Richard Stevens. TCP/IP Illustrated Volume 1, Addison-Wesley, 2005.
6. William Stallings, Computer Networking with Internet Protocols, Prentice-Hall, 2004.
7. Request for Comments (RFC) Pages - IETF -https://www.ietf.org/rfc.html
Course Outcome1 (CO1)

1. Compare TCP/IP and OSI reference model.
2. The purpose of physical layer is to transport a raw bit stream from one machine to
another. Justify.
1. Write the physical and transmission characteristics of Optical Fibre Cable guided
transmission media.
2. The distance between the sender and receiver systems is about 200 KM. The speed of
transmission is 2GB/s. Find out the propagation time?
1. Ethernet frames must be at least 64 bytes long to ensure that the transmitter is still going
in the event of a collision at the far end of the cable. Fast Ethernet has the same 64-byte
minimum frame size but can get the bits out ten times faster. How is it possible to
maintain the same minimum frame size?
2. What do you mean by bit stuffing?
1. Draw and explain the frame format for Ethernet.
2. Give the differences between CSMA/CD and CSMA/CA protocol.
1. Consider the given subnet in which distance vector routing is used, and the vectors just
come in to router C as follows: from B: (5, 0, 8, 12, 6, 2); from D: (16, 12, 6, 0, 9, 10);
20
and from E: (7, 6, 3, 9, 0, 4). The measured delays from C to B, D, and E, are 6, 3, and
5, respectively. What is C’s new routing table? Give both the outgoing line to use and
the expected delay.
2. Illustrate the leaky bucket congestion control technique.

1. How do you subnet the Class C IP Address 206.16.2.0 so as to have 30 subnets. What
is the subnet mask for the maximum number of hosts? How many hosts can each
subnet have?
2. Give the architecture of World Wide Web.

QP CODE: PAGES:
___
Reg No:_______________
Name:_________________
Course Name : Computer Networks
PART-A
1. What does “negotiation" mean when discussing network protocols in a

layered architecture? Give an example.
21
2. Define simplex, half-duplex, and full-duplex transmission modes. Give one

example for each.
3. Data link protocols almost always put the CRC in a trailer rather than in a header.
Why?
4. An 8-bit byte with binary value 10101111 is to be encoded using an even-parity

Hamming code. What is the binary value after encoding?
5. Illustrate the Count to Infinity problem in routing.
6. Describe two major differences between the warning bit method and the
Random Early Detection (RED) method.
7. The Protocol field used in the IPv4 header is not present in the fixed IPv6 header.
Why?
8. How many octets does the smallest possible IPv6 (IP version 6) datagram contain?
9. Can Transmission Control Protocol(TCP) be used directly over a network

(e. g. an Ethernet) without using IP? Justify your answer.
10. When Web pages are sent out, they are prefixed by MIME headers. Why?
(10x3=30)
Part B
Marks)
11. (a) With a neat diagram, explain Open Systems Interconnection (OSI) Reference
Model. (8)
(b) Compare Twisted Pair, Coaxial Cable and Optical Fibre guided transmission
media. (6)
OR
12. (a) Consider two networks providing reliable connection-oriented service. One
of them offers a reliable byte stream and the other offers a reliable message (8)
stream. Are they identical? Justify your answer.
(b) Sketch the waveform in Manchester and Differential Manchester Encoding (6)
for the bitstream 11000110010.
22
13. (a) A bit stream 10011101 is transmitted using the standard CRC method. The
generator polynomial is 𝑥𝑥3 + 1. Show the actual bit string transmitted.
Suppose the third bit from the left is inverted during transmission. Show that
this error is detected at the receiver's end.
(8)
(b) Explain the working of High-Level Data Link Control (HDLC) protocol.
(6)
OR
14. (a) Explain the working of IEEE 802.11 MAC sublayer. (10)
(b) Distinguish between Bridges and Switches. (4)
15. (a) Illustrate Distance Vector Routing algorithm with an example. (8)
(b) Explain the characteristics of Routing Information Protocol (RIP). (6)
OR
16. (a) A computer on a 6-Mbps network is regulated by a token bucket. The token
bucket is filled at a rate of 1 Mbps. It is initially filled to capacity with 8 (8)
megabits. How long can the computer transmit at the full 6 Mbps?
(b) Explain how routing is performed for mobile hosts. (6)
17. (a) Explain the address resolution problem using Address Resolution Protocol (10)
(ARP) and Reverse Address Resolution Protocol (RARP)with an example
network.
(b) A network on the Internet has a subnet mask of 255.255.240.0. What is the (4)
maximum number of hosts it can handle?
OR
18. (a) How do you subnet the Class C IP address 195.1.1.0 so as to have 10 subnets (6)
with a maximum of 12 hosts in each subnet.
(b) Draw IPv6 Datagram format and explain its features. (8)
19. (a) Distinguish the header formats of Transmission Control protocol (TCP) and (8)
User Datagram Protocol (UDP).
(b) Explain the principal Domain Name System (DNS) resource record types for (6)
23
IPv4.
OR
20. (a) What is the role of Simple Mail Transfer Protocol (SMTP) in E- mail? (6)
(b) With the help of a basic model, explain the working of World Wide Web (8 )
(WWW).
Teaching Plan
No Contents No of
Lecture
Hrs
Module – 1 (Introduction and Physical Layer) (10 hrs)
1.1 Introduction, Uses of computer networks. 1 hour
1.2 Network Hardware, Local Area Networks (LAN), Metropolitan Area 1 hour
Networks (MAN), Wide Area Networks (WAN), Wireless networks, Home
networks, Internetworks.
1.3 Network Software, Protocol hierarchies, Design issues for the layers. 1 hour
1.4 Connection-oriented and Connectionless services, Service primitives, 1 hour

Relationship of services to protocols.
1.5 Reference models, The OSI reference model. 1 hour
1.6 The TCP/IP reference model, Comparisonof OSI and TCP/IP reference 1 hour
models.
1.7 Physical layer, Modes of communication, Simplex, Half-duplex, and Full- 1 hour
duplex, Physical topologies, Mesh, Star, Bus, Ring, Hybrid.
1.8 Signal encoding, Manchester, Differential Manchester. 1 hour
1.9 Transmission media overview, Guided media (twisted pair, coaxial and 1 hour
fiber optic media), Unguided/wireless media (radio, microwave, and
infrared).
1.10 Performance indicators, Bandwidth (in Hertz and in Bits per Seconds), 1 hour
24
Throughput, Latency (Delay), Queuing time, Bandwidth-Delay product.
Module 2 – (Data Link Layer) (10 hrs)
2.1 Data link layer design issues. 1 hour
2.2 Error detection and correction, Error correcting codes 1 hour
2.3 Error detecting codes. 1 hour
2.4 Sliding window protocols. 1 hour
2.5 High-Level Data Link Control(HDLC) protocol. 1 hour
2.6 Medium Access Control (MAC) sublayer, Channel allocation problem, 1 hour
Multiple access protocols.
2.7 Ethernet, Ethernet cabling, Manchester encoding, Ethernet MAC sublayer 1 hour
protocol, Binary Exponential Backoff algorithm.
2.8 Ethernet performance, Switched Ethernet, Fast Ethernet, Gigabit Ethernet, 1 hour
IEEE 802.2: Logical Link Control.
2.9 Wireless LANs, 802.11 protocol stack, Physical layer, MAC Sublayer 1 hour
protocol, Frame structure.
2.10 Bridges &switches, Bridges from 802.x to 802.y, Repeaters, Hubs, 1 hour
Bridges, Switches, Routers, and Gateways.
Module 3 - (Network Layer) (8 hrs)
3.1 Network layer design issues. 1 hour
3.2 Routing algorithms, The Optimality Principle, Shortest path routing, 1 hour
Flooding.
3.3 Distance Vector Routing. 1 hour
3.4 Link State Routing. 1 hour
3.5 Multicast routing, Routing for mobile hosts. 1 hour
25
3.6 General principles of congestion control, Congestion prevention policies, 1 hour

Congestion control in virtual circuit subnets.
3.7 Congestion control algorithms, Congestion control in Datagram subnets, 1 hour

Load shedding, Jitter control.
3.8 Quality of Service, Requirements, Techniques for achieving good Quality 1 hour
of Service.
Module 4 – (Network Layer in the Internet) (9 hrs)
4.1 Network layer in the Internet, Internet Protocol (IP). 1 hour
4.2 IP Addresses, Subnets, Classless Inter-Domain Routing (CIDR). 1 hour
4.3 IP Addresses, Network Address Translation (NAT). 1 hour
4.4 Internet Control Message Protocol (ICMP), Address Resolution Protocol 1 hour
(ARP), Reverse Address Resolution Protocol (RARP).
4.5 Bootstrap Protocol (BOOTP), Dynamic Host Configuration Protocol 1 hour

(DHCP).
4.6 Open Shortest Path First (OSPF) protocol. 1 hour
4.7 Border Gateway Protocol (BGP). 1 hour
4.8 Internet multicasting. 1 hour
4.9 IPv6, Header format, Extension headers, Internet Control Message Protocol 1 hour
version 6 (ICMPv6).
Module 5 - ( Transport Layer and Application Layer) (8 hrs)
5.1 Transport Service, Services provided to the upper layers, Transport service 1 hour
primitives. User Datagram Protocol (UDP).
5.2 Transmission Control Protocol (TCP), TCP segment header, Connection 1 hour
establishment &release, Connection management modeling.
5.3 TCP retransmission policy, TCP congestion control. 1 hour
5.4 Application layer, File Transfer Protocol (FTP). 1 hour
26
5.5 Domain Name System (DNS). 1 hour
5.6 Electronic Mail, Multipurpose Internet Mail Extension (MIME). 1 hour
5.7 Simple Network Management Protocol (SNMP). 1 hour
5.8 World Wide Web, Architectural overview. 1 hour
27
Year of
CST SYSTEM Category L T P Credit
Introduction
305 SOFTWARE
PCC 3 1 0 4 2019
Preamble:
The purpose of this course is to create awareness about the low-level codes which are very close
to the hardware and about the environment where programs can be developed and executed. This
course helps the learner to understand the machine dependent and machine independent system
software features and to design/implement system software like assembler, loader, linker,
macroprocessor and device drivers. Study of system software develops ability to design
interfaces between software applications and computer hardware.
Prerequisite: A sound knowledge in Data Structures, and Computer Organization
CO# Course Outcomes
CO1 Distinguish softwares into system and application software categories.

CO2 Identify standard and extended architectural features of machines.

CO3 Identify machine dependent features of system software

CO4 Identify machine independent features of system software.

CO5 Design algorithms for system softwares and analyze the effect of data structures.
CO6 Understand the features of device drivers and editing & debugging tools.(Cognitive
28
CO1
CO2
CO3
CO4
CO5
CO6
Design/Development of
PO3 PO9 Individual and team work
solutions
complex problems
29
Assessment Pattern
Continuous Assessment End Semester
Tests Examinati
Bloom’s Category
Test 1 ( Test 2 on
%) (%) Marks(% )
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution
ESE
Total Marks CIE Marks ESE Marks Durat
ion
150 50 100 3
Continuous Assessment Test (Average of series Tests 1&2) : 25 marks
30
can have maximum 2 sub-divisions and carry 14 marks.
Syllabus
Module-1 ( Introduction)
System Software vs Application Software, Different System Software– Assembler, Linker,

Loader, Macro Processor, Text Editor, Debugger, Device Driver, Compiler, Interpreter,
Operating System (Basic Concepts only). SIC & SIC/XE Architecture, Addressing modes, SIC &
SIC/XE Instruction set , Assembler Directives.
Module-2 (Assembly language programming and Assemblers)
SIC/XE Programming, Basic Functions of Assembler, Assembler Output Format – Header, Text
and End Records. Assembler Data Structures, Two Pass Assembler Algorithm, Hand Assembly
of SIC/XE Programs.
Module-3 ( Assembler Features and Design Options)
Machine Dependent Assembler Features-Instruction Format and Addressing Modes, Program

Relocation. Machine Independent Assembler Features –Literals, Symbol Defining Statements,
Expressions, Program Blocks, Control Sections and Program Linking. Assembler Design
Options- One Pass Assembler, Multi Pass Assembler. Implementation Example-MASM
Assembler.
Module-4 ( Loader and Linker)
Basic Loader Functions - Design of Absolute Loader, Simple Bootstrap Loader. Machine
Dependent Loader Features- Relocation, Program Linking, Algorithm and Data Structures of
Two Pass Linking Loader. Machine Independent Loader Features -Automatic Library Search,
Loader Options. Loader Design Options.
Module-5 (Macro Preprocessor ,Device driver, Text Editor and Debuggers )
Macro Preprocessor - Macro Instruction Definition and Expansion, One pass Macro processor
Algorithm and data structures, Machine Independent Macro Processor Features, Macro processor
design options. Device drivers - Anatomy of a device driver, Character and block device drivers,
General design of device drivers. Text Editors- Overview of Editing, User Interface, Editor
31
Structure. Debuggers - Debugging Functions and Capabilities, Relationship with other parts of
the system, Debugging Methods- By Induction, Deduction and Backtracking.
Text book
1. Leland L. Beck, System Software: An Introduction to Systems Programming, 3/E,
Pearson Education Asia
References
1. D.M. Dhamdhere, Systems Programming and Operating Systems, Second Revised
Edition, Tata McGraw Hill.
2. John J. Donovan, Systems Programming, Tata McGraw Hill Edition 1991.
3. George Pajari, Writing UNIX Device Drivers, Addison Wesley Publications

(Ebook : http://tocs.ulb.tu-darmstadt.de/197262074.pdf ).
4. Peter Abel, IBM PC Assembly Language and Programming, Third Edition,

Prentice Hall of India.
5. Jonathan Corbet, Alessandro Rubini, Greg Kroah-Hartman, Linux Device Drivers,
Third Edition, O.Reilly Books
6. M. Beck, H. Bohme, M. Dziadzka, et al., Linux Kernel Internals, Second Edition,

Addison Wesley Publications,
7. J Nithyashri, System Software, Second Edition, Tata McGraw Hill.
8. The C Preprocessor http://gcc.gnu.org/onlinedocs/gcc-2.95.3/cpp_1.html -
Course Outcome 1 ( CO1):

1. List out two system software and two application software.

1. How is upward compatibility between SIC and SIC/XE machines maintained?
2. Write a sequence of instructions for SIC/XE to divide BETA by GAMMA, setting

ALPHA to the integer portion of the quotient and DELTA to the remainder. Use register-
to-register instructions to make the calculation as efficient as possible.
1. How do control sections and program blocks differ?
2. Can an assembler incorporating program blocks function using the same data
structures as that of a normal two pass assembler? Justify your answer
32

1. What are literals used for? Does the use of literals change the design of an
assembler?

1. Design an assembler that can assemble a source program with different control
sections.

1. Describe any one commonly used debugging method.
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 3
FIFTH SEMESTER B.TECH. DEGREE EXAMINATION, MONTH & YEAR
Course Name: System Software
PART A
Answer All Questions. Each Question Carries 3 Marks
1. Differentiate between system software and application software.
2. What are assembler directives? List out any five assembler directives in SIC.
3. Explain the different data structures used in the implementation of Assemblers.
4. List out the functions performed by an assembler.
33
5. What is a Literal? How is a literal handled by an assembler.
6. What are control sections? What is the advantage of using them?
7. Differentiate between linking loader and linkage editor? Which of these is

preferable in a program development environment?
8. What is Automatic Library Search?
9. How should a programmer decide whether to use a macro or a subroutine to

accomplish a given logical function?
10. Differentiate between character and block device drivers

(10x3=30)
Part B
(Answer any one question from each module. Each question carries 14 Marks)
11. (a) Differentiate between compilers and Interpreters. . (4)
(b) Explain the architecture and addressing modes of SIC machine. (10)
OR
12. (a) Explain the addressing modes supported by SIC/ XE machine with suitable (8)
illustrations.
(b) Explain the difference between (6)

i) A1 RESW 3 and A1 WORD 3
ii) B BYTE C’23’ and B BYTE X’23’
iii) END and END LABEL
13. (a) Let NUMBERS be an array of 100 words. Write a sequence of SIC/XE (6)
instructions to find the maximum of these numbers.
(b) Perform hand assembly of the above written program using two pass (8)
assembler and show the status of various data structures and object
program create.
34
OR
14. (a) Write down and explain the second pass of a two pass assembler algorithm. (8)
(b) What is a Program Block. What is its advantage? With suitable example, (6)
explain how Program Blocks are handled by SIC assembler.
15. (a) What is a Program Block. What is its advantage? With suitable example, (7)
explain how Program Blocks are handled by SIC assembler.
(b) What is a forward reference? With example, illustrate how forward (7)
references are handled by a single pass assembler?
OR
16. (a) With suitable examples explain machine dependent assembler features. (8)
(b) Explain with examples, the need and working of multipass assembler. (6)
17. (a) With the data structures used, state and explain two pass algorithm for a (10)
linking loader.
(b) Explain about bootstrap loader. (4)
OR
18. (a) Explain about machine independent loader features (9)
(b) What is Dynamic Linking? With example, illustrate how dynamic linking (5)
is performed.
19. (a) Write down the single pass macro processor algorithm and with suitable (10)
example illustrate its working.
(b) How are unique labels generated during Macro Expansion? (4)
OR
20. (a) (7)

Explain Text Editor structure in detail with a neat diagram.
35
(b) Explain the different debugging methods in detail. (7)
Teaching Plan
No Contents No: of
Lecture
Hours
Module -1 ( Introduction) (9 hours)
1.1 System Software Vs. Application Software , Different System Software– 1 hour
Assembler, Linker, Loader, Macro Processor
1.2 Text Editor, Debugger, Device Driver, Compiler, Interpreter, Operating 1 hour
System(Basic Concepts only)
1.3 SIC Architecture 1 hour

1.4 SIC Addressing modes 1 hour
1.5 SIC Instruction set & Assembler directives 1 hour
1.6 SIC/XE Architecture 1 hour
1.7 SIC/XE Instruction format 1 hour
1.8 SIC/XE Addressing modes 1 hour
1.9 SIC/XE Instruction set 1 hour
Module -2 (Assembly language programming and Assemblers) (8 hours)
2.1 SIC Programming 1 hour

2.2 SIC/XE Programming 1 hour
2.3 Basic Functions of Assembler 1 hour
2.4 Assembler output format – Header, Text and End Records 1 hour
2.5 Assembler data structures 1 hour
2.6 Pass 1 of two pass SIC assembler algorithm 1 hour
2.7 Pass 2 of two pass SIC assembler algorithm 1 hour
2.8 Hand assembly of SIC Program 1 Hour
Module-3 (Assembler design options)(11 hours)
36
3.1 Machine dependent assembler features-Instruction format and addressing 1 hour

modes, program relocation
3.2 Hand assembly of SIC/XE program 1 Hour
3.3 Machine Independent assembler features – Literals 1 hour
3.4 Machine Independent assembler features – Symbol defining statements, 1 hour
expression
3.5 Machine Independent assembler features – program blocks 1 hour
3.6 Machine Independent assembler features – program blocks illustration 1 hour
with examples
3.7 Machine Independent assembler features – Control sections and program 1 hour
linking.
3.8 Machine Independent assembler features – Control sections and program 1 hour
linking. Illustration with example
3.9 Assembler design options- One Pass assembler 1 hour
3.10 Multi pass assembler 1 hour
3.11 Implementation example: MASM Assembler 1 hour
Module-4 (Linker and Loader) (8 hours)
4.1 Basic Loader functions - Design of absolute loader 1 hour
4.2 Simple bootstrap Loader 1 hour

4.3 Machine dependent loader features- Relocation 1 hour
4.4 Machine dependent loader features- Program Linking algorithm and 1 hour
data structures of First pass of two pass Linking Loader
4.5 Machine dependent loader features- Program Linking algorithm and 1 hour
data structures of Second pass of two pass Linking Loader
4.6 Machine independent loader feature - Automatic library search 1 hour
4.7 Machine independent loader features - Loader options 1 hour
4.8 Loader Design Option- Linking Loader, Linkage Editor, Dynamic 1 hour
Linking
Module –5 (Macro Preprocessor, Device drivers, Text Editors, Debuggers) (9 hours)
5.1 Macro Preprocessor- Macro Instruction Definition and Expansion 1 hour
37
5.2 One pass Macro processor algorithm and data structures 1 hour
5.3 One pass Macro processor Algorithm and data structures illustration with 1 hour
example
5.4 Machine Independent Macro Processor Features- generation of unique 1 hour
labels, Concatenation of macro parameter, Keyword macro parameters
5.5 Machine Independent Macro Processor Features- Conditional Macro 1 hour
Expansion
5.6 Macro processor design options 1 hour
5.7 Device drivers- Anatomy of a device driver, Character and block device 1 hour
drivers, General design of device drivers
5.8 Text Editors- Overview of Editing, User Interface , Editor Structure 1 hour
5.9 Debuggers :- Debugging Functions and Capabilities, Debugging 1 hour
Methods- By Induction, Deduction and Backtracking.
38
Year of
CST MICROPROCESSORS AND Category L T P Credit
Introduction
307 MICROCONTROLLERS
PCC 3 1 0 4 2019
Preamble: The course enables the learners capable of understanding the fundamental architecture
of microprocessors and micro controllers. This course focuses on the architecture, assembly
language programming, interrupts, interfacing of microprocessors with peripheral devices and
microcontrollers and its programming. It helps the learners to extend the study of latest
processors and develop hardware based solutions.
Prerequisite : Sound knowledge in Logic System Design and Computer organization &
architecture.
CO# Course Outcomes
CO1 Illustrate the architecture, modes of operation and addressing modes of

microprocessors (Cognitive knowledge: Understand)
CO2 Develop 8086 assembly language programs. (Cognitive Knowledge Level: Apply)
CO3 Demonstrate interrupts, its handling and programming in 8086. (Cognitive Knowledge
Level: Apply))
CO4 Illustrate how different peripherals (8255,8254,8257) and memory are interfaced with
microprocessors. (Cognitive Knowledge Level: Understand)
CO5 Outline features of microcontrollers and develop low level programs. (Cognitive
CO1
CO2
CO3
CO4
CO5
39

PO3 Design/Development of PO9 Individual and team work
solutions
PO4 Conduct investigations of PO10 Communication
complex problems
PO5 Modern tool usage PO11 Project Management and
Finance
Assessment Pattern

Test1 (%) Test2 (%) Marks (%)
Remember 20 20 20
Understand 40 40 40
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution
Total Marks CIE Marks ESE Marks ESE

Duration
150 50 100 3 hours
40

Syllabus
Module-1(Evolution of microprocessors):
8085 microprocessor (-Basic Architecture only). 8086 microprocessor – Architecture and
signals, Physical Memory organization, Minimum and maximum mode of 8086 system
and timings. Comparison of 8086 and 8088.Machine language Instruction format.
Module-2 (Addressing modes and instructions):
Addressing Modes of 8086. Instruction set – data copy /transfer instructions, arithmetic
instructions, logical instructions, string manipulation instructions, branch instructions,
unconditional and conditional branch instruction, flag manipulation and processor control
instructions. Assembler Directives and operators. Assembly Language Programming with
8086.
Module- 3 (Stack and interrupts):
Stack structure of 8086, programming using stack- Interrupts - Types of Interrupts and
Interrupt Service Routine- Handling Interrupts in 8086- Interrupt programming. -
41
Programmable Interrupt Controller - 8259, Architecture (Just mention the control word, no
need to memorize the control word)- Interfacing Memory with 8086.
Module- 4 (Interfacing chips):
Programmable Peripheral Input/output port 8255 - Architecture and modes of operation-
Programmable interval timer 8254-Architecture and modes of operation- DMA controller
8257 Architecture (Just mention the control word, no need to memorize the control word
of 8254 and 8257)
Module- 5 (Microcontrollers):
8051 Architecture- Register Organization- Memory and I/O addressing- Interrupts and
Stack- 8051 Addressing Modes- Instruction Set- data transfer instructions, arithmetic
instructions, logical instructions, Boolean instructions, control transfer instructions-
Simple programs.
Text Books
1. Bhurchandi and Ray, Advanced Microprocessors and Peripherals, Third Edition
McGraw Hill.
2. Raj Kamal, Microcontrollers: Architecture, Programming, Interfacing and System
Design, Pearson Education.
3. Ramesh Gaonkar, Microprocessor Architecture, Programming, and Applications with
the 8085, Penram International Publishing Pvt. Ltd.
Reference Books
1. Barry B. Brey, The Intel Microprocessors – Architecture, Programming and
Interfacing, Eighth Edition, Pearson Education.
2. A. NagoorKani, Microprocessors and Microcontrollers, Second Edition, Tata
McGraw Hill
3. Douglas V. Hall, SSSP Rao, Microprocessors and Interfacing, Third Edition,
McGrawHill Education.

1) Describe how pipelining is implemented in 8086 microprocessor
2) Illustrate maximum mode signals in 8086.
1) Write an 8086 assembly language program for sorting a sequence of N, 8 bit
numbers. Describe the modifications that can be done on the above program so
that it will sort N, 16 bit numbers. Rewrite the program with those
modifications also.
42

1) Design an interface between 8086 CPU and two chips of 16 x 8 EPROM
and
two chips of 32K x 8 RAM. Select the starting address of EPROM suitably.
The RAM address must start at 00000H.
2) Give the sequence of instructions for setting the IVT for interrupt type 23H.
Assume the Interrupt Service Routine, is present in the code segment
named CODE.
3) Describe the role of Interrupt Request register and In service register in
8259.
1) Show how to interface an 8255 with 8086 to work as an I/O port with the
following specifications. Initialize port A as output, port B as input and port
C as output. Port A address should be 05A0H. Write a program to sense
switch positions SW 0 -SW 7 connected to port B. The sensed pattern is to
be displayed on port A, to which 8 LED’s are attached, while port C lower
displays number of off switches out of total 8 switches.
2) Specify the importance of the DMA address register and Terminal count
register in 8257.
1) Write an 8051 assembly language program to count the number of 1’s and
0’s in a given 8 bit number
2) Write an 8051 assembly language program for computing the square root of an 8
bit number.
43
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
SIXTH SEMESTER B.TECH. DEGREE EXAMINATION, MONTH & YEAR

Course Name: Microprocessors and Microcontrollers
PART A
1. Describe the functions of following signals in 8086

a)NMI b)ALE
2. List any three differences between 8085 and 8086 microprocessors.
3. Assume AL register is having the value 7FH. What will be the content of AL
after the following instructions are executed
a)ROR AL,01 b)SAR AL,01
4. Specify the use of following assembler directives - EQU , EVEN
5. Differentiate between maskable and non maskable interrupts?
6. Define Interrupt Service Routine? How to find the address of the ISR
corresponding to a given interrupt in 8086?
7. Give the purposes of the signals DRQ, TC and MARK in 8257?
8. How 8254 is used as a square wave generator?
9. Differentiate between indirect and indexed addressing modes in 8051.
44
10. Write the sequence of 8051 instructions to store any two numbers at two
consecutive locations 70H and 71H, multiply them and store the result in (10x3=30)
location 72H.
Part B
11. (a) Specify the significance of segmentation and how it is implemented in 8086 (5)
(b) Explain the maximum mode signals in 8086. (9)
OR
12. (a) Write down the differences between 8086 and 8088 processors (4)
(b) Explain the physical memory organization of 8086 with a neat diagram. (10)
How does the 8086 processor accesses a word from an odd memory
location? How many memory cycles does it take?
13. (a) Write an 8086 assembly language program for finding the sum of the (10)
squares of first N natural numbers. Calculate the squares of each number
using a subroutine SQUARE.
(b) Describe any four control transfer instructions in 8086. (4)
OR
14. (a) Write an 8086 assembly language program for printing the reverse of a (5)
given input string.
(b) Explain the addressing modes for sequential control flow instructions in (9)
8086.
15. (a) Give the stack structure of 8086. (5)
(b) Explain the architecture of 8259 with diagram (9)
OR
16. (a) Interface 32Kx8 RAM using four numbers of 8Kx8 memory chips and (10)
16Kx8 ROM using two numbers of 8Kx8 EPROM chips. The address
map is given as RAM starts at 00000H and ROM ends at FFFFFH
(b) Describe the predefined interrupts in 8086 (4)
45
17. (a) Explain the architecture of 8255 with a neat diagram (10)
(b) Identify the mode and I/O configuration for ports A, B and C of an 8255 (4)
after its control register is loaded with 86 H?
OR
18. (a) Define Direct Memory Access (DMA)and illustrate the role of a DMA (8)
controller? Explain the register organization of 8257 and state how these
registers are used during DMA transfer operations.
(b) Explain the architecture of 8254 timer chip (6)
19. (a) Explain the architecture of 8051 microcontroller. (9)
(b) Write an 8051 assembly language program for adding two matrices whose (5)
elements are stored sequentially in some memory location. Assume suitable
locations.
OR
20. (a) Explain the internal data memory organization of 8051. (9)
(b) Describe the control transfer instructions of 8051microcontroller. (5 )
46
Teaching Plan
No of
No Contents Lecture
Hrs
Module 1 : (Evolution of microprocessors) (9 hours)
1.1 Overview of 8085 microprocessor 1 hour
1.2 Architecture of8085 1 hour
1.3 Architecture of 8086 1hour

1.4 Signals in 8086 1hour
1.5 Physical Memory organization 1hour

1.6 Minimum and maximum mode 8086 system and timings(Lecture 1) 1hour
1.7 Minimum and maximum mode 8086 system and timings(Lecture 2) 1hour
1.8 Comparison of 8086 and 8088 1hour
1.9 Machine language Instruction format 1hour
Module 2 :(programming of 8086) (9 hours)
2.1 Addressing Modes of 8086 1 hour
2.2 Instruction set – data copy/transfer instructions 1hour
2.3 arithmetic instructions, logical instructions 1hour
2.4 string manipulation instructions, branch instructions 1hour
2.4 unconditional and conditional branch instruction 1hour
2.5 flag manipulation and processor control instructions 1hour
2.6 Assembler Directives and operators 1hour
2.7 Assembly Language Programming with 8086(Lecture 1) 1hour
Module 3 : (stack and Interrupts) (9 hours)
3.1 Stack structure of 8086, programming using stack. 1hour
3.2 Types of Interrupts and Interrupt Service Routine. 1hour
3.3 Handling Interrupts in 8086(Lecture 1) 1hour
3.4 Handling Interrupts in 8086(Lecture 2) 1hour
47
3.5 Interrupt programming. 1hour

3.6 Programmable Interrupt Controller -8259 (Lecture 1) 1hour
3.7 Programmable Interrupt Controller -8259 (Lecture 2) 1hour
3.8 Interfacing Memory with 8086 (Lecture 1) 1hour
3.9 Interfacing Memory with 8086 (Lecture 2) 1hour
Module 4 :( Interfacing chips) (7 hours)
4.1 Programmable Peripheral Input/output port- 8255 (Lecture 1) 1hour
4.4 Programmable interval timer 8254 (Lecture 1) 1hour
4.5 Programmable interval timer 8254 (Lecture 2) 1hour
4.6 DMA controller 8257 Architecture (Lecture 1) 1hour
4.7 DMA controller 8257 Architecture (Lecture 2) 1hour
Module 5 : (Microcontrollers) (11 hours)
5.1 8051 Architecture (Lecture 1) 1hour
5.2 8051 Architecture (Lecture 2) 1hour
5.3 Register Organization, Memory and I/O addressing 1hour
5.4 Interrupts and Stack 1hour
5.5 Addressing Modes 1hour
5.6 Data transfer instructions, Arithmetic instructions 1hour
5.7 Logical instructions, 1hour
5.8 Boolean instructions 1hour
5.9 Control transfer instructions 1hour
5.10 Programming of 8051 (Lecture 1) 1hour
5.11 Programming of 8051(Lecture 2) 1hour
48
Year of
CST MANAGEMENT OF Category L T P Credit
Introduction
309 SOFTWARE SYSTEMS
PCC 3 0 0 3 2019
Preamble: This course provides fundamental knowledge in the Software Development Process.
It covers Software Development, Quality Assurance, Project Management concepts and
technology trends. This course enables the learners to apply state of the art industry practices in
Software development.
Prerequisite: Basic understanding of Object Oriented Design and Development.
Demonstrate Traditional and Agile Software Development approaches (Cognitive
CO1
Prepare Software Requirement Specification and Software Design for a given

CO2
problem. (Cognitive Knowledge Level: Apply)
Justify the significance of design patterns and licensing terms in software

CO3 development, prepare testing, maintenance and DevOps strategies for a project.
Make use of software project management concepts while planning, estimation,

CO4 scheduling, tracking and change management of a project, with a traditional/agile
framework. (Cognitive Knowledge Level: Apply)
Utilize SQA practices, Process Improvement techniques and Technology

CO5 advancements in cloud based software models and containers & microservices.
49
CO1
CO2
CO3
CO4
CO5
PO1 Engineering Knowledge PO7 Environment and

Sustainability

solutions

complex problems

Finance
50
Assessment Pattern

Bloom’s Category
Remember 30 30 30
Understand 40 40 50
Apply 30 30 20
Analyse
Evaluate
Create
Mark Distribution

Duration
150 50 100 3 hours
Continuous Assessment Assignment : 15 marks ( Each student shall identify a software

development problem and prepare Requirements Specification, Design Document, Project Plan
and Test case documents for the identified problem as the assignment. )
Each of the two internal examinations has to be conducted out of 50 marks.
syllabus and the Second Internal Examination shall be preferably conducted after completing the
51
can have a maximum of 2 subdivisions and carries 14 marks.
Syllabus
Module 1 : Introduction to Software Engineering (7 hours)
Introduction to Software Engineering - Professional software development, Software engineering

ethics. Software process models - The waterfall model, Incremental development. Process
activities - Software specification, Software design and implementation, Software validation,
Software evolution. Coping with change - Prototyping, Incremental delivery, Boehm's Spiral
Model. Agile software development - Agile methods, agile manifesto - values and principles.
Agile development techniques, Agile Project Management. Case studies : An insulin pump
control system. Mentcare - a patient information system for mental health care.
Module 2 : Requirement Analysis and Design (8 hours)
Functional and non-functional requirements, Requirements engineering processes. Requirements

elicitation, Requirements validation, Requirements change, Traceability Matrix. Developing use
cases, Software Requirements Specification Template, Personas, Scenarios, User stories, Feature
identification. Design concepts - Design within the context of software engineering, Design
Process, Design concepts, Design Model. Architectural Design - Software Architecture,
Architectural Styles, Architectural considerations, Architectural Design Component level design
- What is a component?, Designing Class-Based Components, Conducting Component level
design, Component level design for web-apps. Template of a Design Document as per “IEEE Std
1016-2009 IEEE Standard for Information Technology Systems Design Software Design
Descriptions”. Case study: The Ariane 5 launcher failure.
52
Module 3 : Implementation and Testing (9 hours)
Object-oriented design using the UML, Design patterns, Implementation issues, Open-source
development - Open-source licensing - GPL, LGPL, BSD. Review Techniques - Cost impact of
Software Defects, Code review and statistical analysis. Informal Review, Formal Technical
Reviews, Post-mortem evaluations. Software testing strategies - Unit Testing, Integration
Testing, Validation testing, System testing, Debugging, White box testing, Path testing, Control
Structure testing, Black box testing, Testing Documentation and Help facilities. Test automation,
Test-driven development, Security testing. Overview of DevOps and Code Management - Code
management, DevOps automation, Continuous Integration, Delivery, and Deployment
(CI/CD/CD). Software Evolution - Evolution processes, Software maintenance.
Module 4 : Software Project Management (6 hours)
Software Project Management - Risk management, Managing people, Teamwork. Project

Planning, Software pricing, Plan-driven development, Project scheduling, Agile planning.
Estimation techniques, COCOMO cost modeling. Configuration management, Version
management, System building, Change management, Release management, Agile software
management - SCRUM framework. Kanban methodology and lean approaches.
Module 5 : Software Quality, Process Improvement and Technology trends (6 hours)
Software Quality, Software Quality Dilemma, Achieving Software Quality Elements of

Software Quality Assurance, SQA Tasks , Software measurement and metrics. Software Process
Improvement(SPI), SPI Process CMMI process improvement framework, ISO 9001:2000 for
Software. Cloud-based Software - Virtualisation and containers, Everything as a service(IaaS,
PaaS), Software as a service. Microservices Architecture - Microservices, Microservices
architecture, Microservice deployment.
Text Books
1. Book 1 - Ian Sommerville, Software Engineering, Pearson Education, Tenth edition, 2015.
2. Book 2 - Roger S. Pressman, Software Engineering : A practitioner’s approach, McGraw
Hill publication, Eighth edition, 2014
3. Book 3 - Ian Sommerville, Engineering Software Products: An Introduction to
Modern Software Engineering, Pearson Education, First Edition, 2020.
References
1. IEEE Std 830-1998 - IEEE Recommended Practice for Software Requirements

SpeciÞcations
2. IEEE Std 1016-2009 IEEE Standard for Information Technology—Systems Design—
Software Design Descriptions
53
3. David J. Anderson, Kanban, Blue Hole Press 2010

4. David J. Anderson, Agile Management for Software Engineering, Pearson, 2003
5. Walker Royce, Software Project Management : A unified framework, Pearson Education,
1998
6. Steve. Denning, The age of agile, how smart companies are transforming the way work gets
done. New York, Amacom, 2018.
7. Satya Nadella, Hit Refresh: The Quest to Rediscover Microsoft’s Soul and Imagine a Better
Future for Everyone, Harper Business, 2017
8. Henrico Dolfing, Project Failure Case Studies: Lessons learned from other people’s
mistakes, Kindle edition
9. Mary Poppendieck, Implementing Lean Software Development: From Concept to Cash,
Addison-Wesley Signature Series, 2006
10. StarUML documentation - https://docs.staruml.io/
11. OpenProject documentation - https://docs.openproject.org/
12. BugZilla documentation - https://www.bugzilla.org/docs/
13. GitHub documentation - https://guides.github.com/
14. Jira documentation - https://www.atlassian.com/software/jira

1. What are the advantages of an incremental development model over a waterfall
model?
2. Illustrate how the process differs in agile software development and traditional
software development with a socially relevant case study. (Assignment question)

1. How to prepare a software requirement specification?
2. Differentiate between Architectural design and Component level design.
3. How does agile approaches help software developers to capture and define the user
requirements effectively?
4. What is the relevance of the SRS specification in software development?
5. Prepare a use case diagram for a library management system.

1. Differentiate between the different types of software testing strategies.
2. Justify the need for DevOps practices?
3. How do design patterns help software architects communicate the design of a complex
system effectively?
54
4. What are the proactive approaches one can take to optimise efforts in the testing phase?

1. Illustrate the activities involved in software project management for a socially relevant
problem?
2. How do SCRUM, Kanban and Lean methodologies help software project
management?
3. Is rolling level planning in software project management beneficial? Justify your
answer.
4. How would you assess the risks in your software development project? Explain
how you can manage identified risks?

1. Justify the importance of Software Process improvement?
2. Explain the benefits of cloud based software development, containers and
microservices.
3. Give the role of retrospectives in improving the software development process.
4. Illustrate the use of project history data as a prediction tool to plan future socially
relevant projects.
55
QP CODE:
Reg No:______________
Name :______________ PAGES : 3
Course Name: Management of Software Systems
Duration: 3 Hrs Max. Marks :100

PART A
Answer all Questions. Each question carries 3 marks
1. Why professional software that is developed for a customer is not simply the
programs that have been developed and delivered.
2. Incremental software development could be very effectively used for customers

who do not have a clear idea about the systems needed for their operations.
Justify.
3. Identify any four types of requirements that may be defined for a software system
4. Describe software architecture
5. Differentiate between GPL and LGPL?
6. Compare white box testing and black box testing.
7. Specify the importance of risk management in software project management?
8. Describe COCOMO cost estimation model.
9. Discuss the software quality dilemma
10. List the levels of the CMMI model? (10x3=30)
Part B
Marks)
11. (a) Compare waterfall model and spiral model

(8)
56
(b) Explain Agile ceremonies and Agile manifesto

(6)
12. (a) Illustrate software process activities with an example.

(8)
(b) Explain Agile Development techniques and Agile Project Management (6)
13. (a) What are functional and nonfunctional requirements? Imagine that you are
developing a library management software for your college, list eight (10)
functional requirements and four nonfunctional requirements.
(b) List the components of a software requirement specification?

(4)
OR
14. (a) Explain Personas, Scenarios, User stories and Feature identification? (8)
(b) Compare Software Architecture design and Component level design (6)
15. (a) Explain software testing strategies. (8)
(b) Describe the formal and informal review techniques. (6)
OR
16. (a) Explain Continuous Integration, Delivery, and Deployment CI/CD/CD)

(8)
(b) Explain test driven development (6)
17. (a) What is a critical path and demonstrate its significance in a project schedule (8)
with the help of a sample project schedule.
(b) Explain plan driven development and project scheduling. (6)
OR
18. (a) Explain elements of Software Quality Assurance and SQA Tasks. (6)
(b) What is algorithmic cost modeling? What problems does it suffer from when (8)
57
compared with other approaches to cost estimation?
(b) Illustrate SPI process with an example. (6)
OR
20. (a) Compare CMMI and ISO 9001:2000. (8)
(b) How can Software projects benefit from Container deployment and Micro (6 )
service deployment?
Teaching Plan
No of
No Contents Lecture
Hrs
1.1 Introduction to Software Engineering.[ Book 1, Chapter 1] 1 hour
1.2 Software process models [Book 1 - Chapter 2] 1 hour
1.3 Process activities [Book 1 - Chapter 2] 1 hour
1.4 Coping with change [Book 1 - Chapter 2, Book 2 - Chapter 4] 1 hour

1.5 Case studies : An insulin pump control system. Mentcare - a patient 1 hour
information system for mental health care. [Book 1 - Chapter 1]
1.6 Agile software development [Book 1 - Chapter 3] 1 hour

1.7 Agile development techniques, Agile Project Management.[Book 1 - Chapter 1 hour
3]
2.1 Functional and non-functional requirements, Requirements engineering 1 hour
processes [Book 1 - Chapter 4]
2.2 Requirements elicitation, Requirements validation, Requirements change, 1 hour
Traceability Matrix [Book 1 - Chapter 4]
2.3 Developing use cases, Software Requirements Specification Template [Book 1 hour
2 - Chapter 8]
58
2.4 Personas, Scenarios, User stories, Feature identification [Book 3 - Chapter 3] 1 hour
2.5 Design concepts [Book 2 - Chapter 12] 1 hour
2.6 Architectural Design [Book 2 - Chapter 13] 1 hour
2.7 Component level design [Book 2 - Chapter 14] 1 hour
2.8 Design Document Template. Case study: The Ariane 5 launcher failure. [Ref 1 hour
- 2, Book 2 - Chapter 16]
3.1 Object-oriented design using the UML, Design patterns [Book 1 - Chapter 7] 1 hour
3.2 Implementation issues, Open-source development - Open-source licensing - 1 hour
GPL, LGPL, BSD [Book 1 - Chapter 7]
3.3 Review Techniques - Cost impact of Software Defects, Code review and 1 hour
statistical analysis. [Book 2 - Chapter 20]
34 Informal Review, Formal Technical Reviews, Post-mortem evaluations. 1 hour
[Book 2 - Chapter 20]
3.5 Software testing strategies - Unit Testing, Integration Testing, Validation 1 hour
testing, System testing and Debugging (basic concepts only). [Book 2 -
Chapter 22]
3.6 White box testing, Path testing, Control Structure testing, Black box testing. 1 hour
Test documentation [Book 2 - Chapter 23]
3.7 Test automation, Test-driven development, Security testing. [Book 3 - 1 hour
Chapter 9]
3.8 DevOps and Code Management - Code management, DevOps automation, 1 hour
CI/CD/CD. [Book 3 - Chapter 10]
3.9 Software Evolution - Evolution processes, Software maintenance. [Book 1 - 1 hour
Chapter 9]
4.1 Software Project Management - Risk management, Managing people, 1 hour
Teamwork [Book 1 - Chapter 22]
4.2 Project Planning - Software pricing, Plan-driven development, Project 1 hour
scheduling, Agile planning [Book 1 - Chapter 23]
4.3 Estimation techniques [Book 1 - Chapter 23] 1 hour
4.4 Configuration management [Book 1 - Chapter 25] 1 hour
59
4.5 Agile software management - SCRUM framework [Book 2 - Chapter 5] 1 hour

4.6 Kanban methodology and lean approaches.[Ref 9 - Chapter 2] 1 hour
Module 5 : Software Quality, Process Improvement and Technology trends (6
hours)
5.1 Software Quality, Software Quality Dilemma, Achieving Software Quality. 1 hour
5.2 Elements of Software Quality Assurance, SQA Tasks , Software 1 hour
measurement and metrics. [Book 3 - Chapter 21]
5.3 Software Process Improvement (SPI), SPI Process [Book 2 - Chapter 37] 1 hour
5.4 CMMI process improvement framework, ISO 9001:2000 for Software. 1 hour
5.5 Cloud-based Software - Virtualisation and containers, IaaS, PaaS, 1 hour
SaaS.[Book 3 - Chapter 5]
5.6 Microservices Architecture - Microservices, Microservices architecture, 1 hour
Microservice deployment [Book 3 - Chapter 6]
60
Year of
CSL SYSTEM SOFTWARE AND Introduction
331 MICROPROCESSORS LAB
PCC 0 0 4 2 2019
Preamble: The aim of this course is to give hands-on experience in how microcontrollers, and
microprocessors can be programmed. The course also aims to enable students to design and
implement system software. The student should get familiar with assembly level programming of
microprocessors and microcontrollers, interfacing of devices to microcontrollers, resource
allocation algorithms in operating systems and design and implementation of system software.
Prerequisite: Sound knowledge in Operating systems
Develop 8086 programs and execute it using a microprocessor kit. (Cognitive

CO1
Knowledge Level: Apply) .
Develop 8086 programs and, debug and execute it using MASM assemblers
CO2
Develop and execute programs to interface stepper motor, 8255, 8279 and
CO3 digital to analog converters with 8086 trainer kit (Cognitive Knowledge Level:
Apply)
Implement and execute different scheduling and paging algorithms in OS
CO4
Design and implement assemblers, Loaders and macroprocessors. (Cognitive
CO5
PO1 PO2 PO3 PO4 PO PO PO7 PO8 PO9 PO10 PO11 PO12
5 6
CO1
CO2
CO3
CO4
CO5
61


problems
Assessment Pattern
Continuous
End Semester
Assessment Test
Bloom’s Category Examination
(Internal Exam)
Percentage
Percentage
Remember 20 20
Understand 20 20
Apply 60 60
Analyse
Evaluate
Create
Mark Distribution
Total ESE
CIE Marks ESE Marks
Marks Duration
150 75 75 3 hours
62

Internal Examination Pattern: The marks will be distributed as Algorithm 30 marks, Program
20 marks, Output 20 marks and Viva 30 marks. Total 100 marks which will be converted out of
15 while calculating Internal Evaluation marks.
Program 20 marks, Output 20 marks and Viva 30 marks. Total 100 marks will be converted out
of 75 for End Semester Examination.

Any compatible assembler can be used for implementation of 8086 programs
Fair Lab Record:
All Students attending the System Software and Microprocessors Lab should have a Fair Record.
The fair record should be produced in the University Lab Examination. Every experiment
conducted in the lab should be noted in the fair record. For every experiment in the fair record
the right hand page should contain Experiment Heading, Experiment Number, Date of
Experiment, Aim of Experiment, Details of Experiment including algorithm and Result of
Experiment. The left hand page should contain a print out of the code used for the experiment
and sample output obtained for a set of input.
Syllabus
MICROPROCESSOR LAB
I. Assembly Language Programming Exercises/Experiments using 8086 Trainer kit
II. Exercises/Experiments using MASM (PC required)
III. Interfacing Exercises/Experiments with 8086 trainer kit through Assembly Language
programming
IV. Exercises/Experiments using 8051 trainer kit
SYSTEM SOFTWARE LAB:
I. Experiments related to the operating system.

II. Exercises/Experiments related to the assemblers, loaders and macroprocessors
63
Text Books
1. Bhurchandi and Ray, Advanced Microprocessors and Peripherals, Third Edition
McGraw Hill.
2. Andrew S Tanenbaum, “Modern Operating Systems” , 4th Edition, Prentice Hall, 2015.
3. Leland L. Beck, System Software: An Introduction to Systems Programming, 3/E,
Pearson Education Asia, 1997.
Reference Books
1. A. NagoorKani, Microprocessors and Microcontrollers, Second Edition, Tata
McGraw Hill
2. Douglas V. Hall, SSSP Rao, Microprocessors and Interfacing, Third Edition,
McGrawHill Education.
3. William Stallings, “Operating systems”, 6th Edition, Pearson, Global Edition,
2015.
4. Garry Nutt, Nabendu Chaki, Sarmistha Neogy, “Operating Systems”, 3rd
Edition, Pearson Education.
5. D.M. Dhamdhere, Systems Programming and Operating Systems,
Second Revised Edition, Tata McGraw Hill.
Practice Questions
MICROPROCESSORS LAB : List of Exercises/ Experiments

(Minimum 10 Exercises (at least 2 questions from each part I, II, III & IV) ) : 2 Hrs/week
I. Assembly Language Programming Exercises/Experiments using 8086 Trainer kit
1. Implementation of simple decimal arithmetic and bit manipulation operations.
2. Implementation of code conversion between BCD, Binary, Hexadecimal and
ASCII.
3. Implementation of searching and sorting of 16-bit numbers.
II. Exercises/Experiments using MASM (PC Required)
4. Study of Assembler and Debugging commands.
5. Implementation of decimal arithmetic (16 and 32 bit) operations.
6. Implementation of String manipulations.
7. Implementation of searching and sorting of 16-bit numbers.
III. Interfacing Exercises/Experiments with 8086 trainer kit through Assembly Language
Programming
8. Interfacing with stepper motor - Rotate through any given sequence.
9. Interfacing with 8255 (mode0 and mode1 only).
10. Interfacing with 8279 (Rolling message, 2 key lockout and N-key rollover
implementation).
64
11. Interfacing with Digital-to-Analog Converter.
IV. Exercises/Experiments using 8051 trainer kit

12. Familiarization of 8051 trainer kit by executing simple Assembly Language programs
such as decimal arithmetic and bit manipulation.
13. Implementation of Timer programming (in mode1).
SYSTEM SOFTWARE LAB: List of Exercises/ Experiments

(Minimum 8 Exercises (at least 3 and 5 questions from each part V and VI)) : 2
Hrs/week
V. Exercises/Experiments from operating system
1. Simulate the following non-preemptive CPU scheduling algorithms to find turnaround

time and waiting time.
a) FCFS b) SJF c) Round Robin (pre-emptive) d) Priority
2. Simulate the following file allocation strategies.
a) Sequential b) Indexed c) Linked
3. Implement the different paging techniques of memory management.
4. Simulate the following file organization techniques
a) Single level directory b) Two level directory c) Hierarchical
5. Implement the banker’s algorithm for deadlock avoidance.
6. Simulate the following disk scheduling algorithms.
a) FCFS b) SCAN c) C-SCAN
7. Simulate the following page replacement algorithms:
a)FIFO b)LRU c) LFU
VI. Exercises/Experiments from assemblers, loaders and macroprocessor
1. Implement pass one of a two pass assembler.

2. Implement pass two of a two pass assembler.
3. Implement a single pass assembler.
4. Implement a two pass macro processor
5. Implement a single pass macro processor.
6. Implement an absolute loader.
7. Implement a relocating loader
65
DATABASE Year of
CSL Category L T P Credits
MANAGEMENT introduction
333
SYSTEMS LAB PCC 0 0 4 2 2019
Preamble:
The Database Management Systems course is intended to impart the elementary concepts of a
database management system to students and equip them to design and implement a database
application based on those concepts. This course helps the learners to get practical exposure on
database creation, SQL queries creation, transaction processing and NoSQL & MongoDB based
operations. The course enables the students to create, manage and administer the databases,
develop necessary tools for the design and development of the databases, and to understand
emerging technologies to handle Big Data.
Prerequisite: A sound knowledge of the basics of relational DBMS.
CO# Course Outcomes
CO1 Design database schema for a given real world problem-domain using standard
design and modeling approaches. (Cognitive Knowledge Level: Apply)
CO2 Construct queries using SQL for database creation, interaction, modification, and
updation. (Cognitive Knowledge Level: Apply)
C03 Design and implement triggers and cursors. (Cognitive Knowledge Level: Apply)
C04 Implement procedures, functions, and control structures using PL/SQL. (Cognitive
CO5 Perform CRUD operations in NoSQL Databases. (Cognitive Knowledge Level:

Apply)
C06 Develop database applications using front-end tools and back-end DBMS.
(Cognitive Knowledge Level: Create)
66
CO1
CO2
CO3
CO4
CO5
CO6

complex problems
Assessment Pattern:
Bloom’s Category Continuous Assessment Test End Semester

(Internal Exam)Percentage Examination Percentage
Remember 20 20
Understand 20 20
Apply 60 60
Analyse
Evaluate
Create
67
Mark Distribution
150 75 75 3 hours

Internal Examination Pattern : The marks will be distributed as Schema/Logic: 30

marks, Program/Queries: 20 marks, Output: 20 marks, and Viva: 30 marks. Total 100
marks which will be converted out of 15 while calculating Internal Evaluation marks.

The marks will be distributed as Schema/Logic: 30 marks,
Program/Queries: 20 marks, Output: 20 marks, and Viva: 30 marks. Total 100 marks will
be converted out of 75 for the End Semester Examination.
DBMS software: Oracle, MySQL, SQL Server, PostgreSQL, MongoDB.

Front end Tool: Java
Fair Lab Record:

All Students attending the DBMS Lab should have a Fair Record. The fair record should be
produced in the University Lab Examination. Every experiment conducted in the lab should be
noted in the fair record. For every experiment in the fair record, the right hand page should
Schemas/Menu & Form Design, and Query questions. The left hand page should contain Queries
and sample output(relations created, Form, and Menu Output) obtained for a set of input.
Syllabus
1. Design a database schema for an application with ER diagram from a problem description
**.
2. Creation, modification, configuration, and deletion of databases using UI and SQL
Commands **.
3. Creation of database schema - DDL (create tables, set constraints, enforce relationships,
create indices, delete and modify tables). Export ER diagram from the database and verify
relationships** (with the ER diagram designed in step 1).
68
4. Database initialization - Data insert, Data import to a database (bulk import using UI and
SQL Commands)**.
5. Practice SQL commands for DML (insertion, updating, altering, deletion of data, and
viewing/querying records based on condition in databases)**.
6. Implementation of built-in functions in RDBMS**.
7. Implementation of various aggregate functions in SQL**.
8. Implementation of Order By, Group By & Having clause **.
9. Implementation of set operators nested queries, and join queries **.
10. Implementation of queries using temp tables.
11. Practice of SQL TCL commands like Rollback, Commit, Savepoint **.
12. Practice of SQL DCL commands for granting and revoking user privileges **.
13. Practice of SQL commands for creation of views and assertions ** .
14. Implementation of various control structures like IF-THEN, IF-THEN-ELSE, IF-THEN-
ELSIF, CASE, WHILE using PL/SQL **.
15. Creation of Procedures, Triggers and Functions**.
16. Creation of Packages **.
17. Creation of Cursors **.
18. Creation of PL/SQL blocks for exception handling **.
19. Database backup and restore using commands.
20. Query analysis using Query Plan/Show Plan.
21. Familiarization of NoSQL Databases and CRUD operations**.
22. Design a database application using any front end tool for any problem selected. The
application constructed should have five or more tables**.
** mandatory
Text Books
1. Elmasri R. and S. Navathe, Database Systems: Models, Languages, Design and Application
Programming, Pearson Education, 2013.
2. Sliberschatz A., H. F. Korth and S. Sudarshan, Database System Concepts, 6/e, McGraw
Hill, 2011.
References
1. Adam Fowler, NoSQL for Dummies, John Wiley & Sons, 2015
2. NoSQL Data Models: Trends and Challenges (Computer Engineering: Databases and Big
Data), Wiley, 2018
69
Practice Questions
Design a normalized database schema for the following requirement.

The requirement: A library wants to maintain the record of books, members, book issue, book
return, and fines collected for late returns, in a database. The database can be loaded with book
information. Students can register with the library to be a member. Books can be issued to
students with a valid library membership. A student can keep an issued book with him/her for a
maximum period of two weeks from the date of issue, beyond which a fine will be charged. Fine
is calculated based on the delay in days of return. For 0-7 days: Rs 10, For 7 – 30 days: Rs 100,
and for days above 30 days: Rs 10 will be charged per day.
Sample Database Design

BOOK (Book_Id, Title, Language_Id, MRP, Publisher_Id, Published_Date, Volume, Status) //
Language_Id, Publisher_Id are FK (Foreign Key)
AUTHOR(Author_Id, Name, Email, Phone_Number, Status)
BOOK_AUTHOR(Book_Id, Author_Id) // many-to-many relationship, both columns are PKFK

(Primary Key and Foreign Key)
PUBLISHER(Publisher_id, Name, Address)
MEMBER(Member_Id, Name, Branch_Code, Roll_Number, Phone_Number, Email_Id,

Date_of_Join, Status)
BOOK_ISSUE(Issue_Id, Date_Of_Issue, Book_Id, Member_Id, Expected_Date_Of_Return,

Status) // Book+Id and Member_Id are FKs
BOOK_RETURN(Issue_Id, Actual_Date_Of_Return, LateDays, LateFee) // Issue_Id is PK and

FK
LANGUAGE(Language_id, Name) //Static Table for storing permanent data
LATE_FEE_RULE(FromDays, ToDays, Amount) // Composite Key
EXERCISES
1. Create a normalized database design with proper tables, columns, column types, and
constraints
2. Create an ER diagram for the above database design.
3. Write SQL commands to
a. Create a database by name Library. Drop the database and re-create it.
b. Create DDL statements and create the tables and constraints (from the design) in the
database created in step-a (Library)
70
Notes: [ Create a script file and execute it. Create the script file in such a way that,,if the
table exists, drop the tables and recreate )]
c. Create and execute DROP TABLE command in tables with and without FOREIGN
KEY constraints.
d. Create and execute ALTER TABLE command in tables with data and without data.
e. Create and execute SQL commands to build indices on Member_Id and Book_Id on
table Book_Issue.
f. Create and execute GRANT/REVOKE commands on tables.
g. Create and execute SQL commands to insert data into each of the tables designed
h. Learn and execute bulk import of data to tables from CSV files (insert 1000 records of
books into the BOOK table from a CSV file).
i. Create and execute UPDATE/DELETE commands on tables. Try to update/delete
rows with Primary and Foreign Keys. Try bulk updates or deletes using SQL
UPDATE statement
4. Write SQLQuery to retrieve the following information
a. Get the number of books written by a given author
b. Get the list of publishers and the number of books published by each publisher
c. Get the names of authors who jointly wrote more than one book.
d. Get the list of books that are issued but not returned
e. Get the list of students who reads only ‘Malayalam’ books
f. Get the total fine collected for the current month and current quarter
g. Get the list of students who have overdue (not returned the books even on due date)
h. Calculate the fine (as of today) to be collected from each overdue book.
i. Members who joined after Jan 1 2021 but has not taken any books
5. Book return should insert an entry into the Book_Return table and also update the status in
Book_Issue table as ‘Returned’. Create a database TRANSACTION to do this operation
(stored procedure).
6. Create a database view ‘Available_Books’, which will list out books that are currently
available in the library
7. Create a database procedure to add, update and delete a book to the Library database (use
parameters).
8. Use cursors and create a procedure to print Books Issue Register (page wise – 20 rows in a
page)
9. Create a history table (you may use the same structure without any keys) for the MEMBER
table and copy the original values of the row being updated to the history table using a
TRIGGER.
10. NoSQL Exercise
a. Practice Mongo DB CRUD operations. Refer:
https://docs.mongodb.com/manual/crud/
71
b. You may use a MongoDB local installation or cloud MongoDB services like
MongoDB Atlas for this exercise
c. For documentation: Refer: https://docs.mongodb.com/manual/introduction/
11.Application Development Problem examples:

1) Inventory Control System.
2) Material Requirement Processing.
3) Hospital Management System.
4) Railway Reservation System.
5) Personal Information System.
6) Web Based User Identification System.
7) Timetable Management System.
8) Hotel Management System.
72
SEMESTER V
MINOR
73
Year of
CONCEPTS IN Category L T P Credit
CST Introduction
SOFTWARE
381
ENGINEERING
VAC 3 1 0 4 2019
Preamble: This course provides fundamental knowledge in the Software Development Process.
It covers Software Development, Quality Assurance and Project Management concepts. This
course enables the learners to apply state of the art industry practices in Software development.
Prerequisite: Basic understanding of Object Oriented Design and Development.
Differentiate Traditional and Agile Software Development approaches (Cognitive

CO1
Prepare Software Requirement Specification and Software Design for a given

CO2
problem. (Cognitive Knowledge Level: Apply)
Justify the significance of design patterns and licensing terms in software

CO3 development, prepare testing, maintenance and DevOps strategies for a project.
Make use of software project management concepts while planning, estimation,

CO4 scheduling, tracking and change management of a project, with proper application of
SCRUM, Kanban and Lean frameworks. (Cognitive Knowledge Level: Apply)
Utilize SQA practices, Process Improvement techniques and Technology

CO5 improvements namely cloud based software model and containers & microservices
in a Software Development Process. (Cognitive Knowledge Level: Apply)
0 1
CO1
CO2
74
CO3
CO4
CO5

solutions

complex problems
Assessment Pattern

End Semester
Bloom’s Category
Examination Marks
Test1 (Percentage) Test2 (Percentage)
Remember 30 30 30
Understand 30 30 30
75
Apply 40 40 40
Analyse
Evaluate
Create
Mark Distribution
150 50 100 3 hours
Continuous Assessment Assignment : 15 marks ( Each student shall identify a software

development problem and prepare Requirements Specification, Design Document, Project Plan
and Test case documents for the identified problem as the assignment. )
76
Syllabus

Introduction to Software Engineering - Professional software development, Software engineering
ethics. Software process models - The waterfall model, Incremental development. Process
activities - Software specification, Software design and implementation, Software validation,
Software evolution. Coping with change - Prototyping, Incremental delivery, Boehm's Spiral
Model. Agile software development - Agile methods, agile manifesto - values and principles.
Agile development techniques, Agile Project Management. Case studies : An insulin pump
control system. Mentcare - a patient information system for mental health care.
Functional and non-functional requirements, Requirements engineering processes. Requirements

elicitation, Requirements validation, Requirements change, Traceability Matrix. Developing use
cases, Software Requirements Specification Template, Personas, Scenarios, User stories, Feature
identification. Design concepts - Design within the context of software engineering, Design
Process, Design concepts, Design Model. Architectural Design - Software Architecture,
Architectural Styles, Architectural considerations, Architectural Design Component level design
- What is a component?, Designing Class-Based Components, Conducting Component level
design, Component level design for web-apps. Template of a Design Document as per “IEEE Std
1016-2009 IEEE Standard for Information Technology Systems Design Software Design
Descriptions”. Case study: The Ariane 5 launcher failure.
Object-oriented design using the UML, Design patterns, Implementation issues, Open-source
development - Open-source licensing - GPL, LGPL, BSD. Review Techniques - Cost impact of
Software Defects, Code review and statistical analysis. Informal Review, Formal Technical
Reviews, Post-mortem evaluations. Software testing strategies - Unit Testing, Integration
Testing, Validation testing, System testing, Debugging, White box testing, Path testing, Control
Structure testing, Black box testing, Testing Documentation and Help facilities. Test automation,
Test-driven development, Security testing. Overview of DevOps and Code Management - Code
management, DevOps automation, CI/CD/CD. Software Evolution - Evolution processes,
Software maintenance.
77
Software Project Management - Risk management, Managing people, Teamwork. Project

Planning, Software pricing, Plan-driven development, Project scheduling, Agile planning.
Estimation techniques, COCOMO cost modeling. Configuration management, Version
management, System building, Change management, Release management, Agile software
management - SCRUM framework. Kanban methodology and lean approaches.
Module 5 : Software Quality and Process Improvement (6 hours)
Software Quality, Software Quality Dilemma, Achieving Software Quality Elements of

Software Quality Assurance, SQA Tasks , Software measurement and metrics. Software Process
Improvement(SPI), SPI Process CMMI process improvement framework, ISO 9001:2000 for
Software.
Text Books
1. Book 1 - Ian Sommerville, Software Engineering, Pearson Education, Tenth edition, 2015.
2. Book 2 - Roger S. Pressman, Software Engineering : A practitioner’s approach, McGraw
Hill publication, Eighth edition, 2014
3. Book 3 - Ian Sommerville, Engineering Software Products: An Introduction to Modern
Software Engineering, Pearson Education, First Edition, 2020.
References
1. IEEE Std 830-1998 - IEEE Recommended Practice for Software Requirements

Specifications
2. IEEE Std 1016-2009 IEEE Standard for Information Technology—Systems Design—
Software Design Descriptions
3. David J. Anderson, Kanban, Blue Hole Press 2010
4. David J. Anderson, Agile Management for Software Engineering, Pearson, 2003
5. Walker Royce, Software Project Management : A unified framework, Pearson Education,
1998
6. Steve. Denning, The age of agile, how smart companies are transforming the way work gets
done. New York, Amacom, 2018.
7. Satya Nadella, Hit Refresh: The Quest to Rediscover Microsoft’s Soul and Imagine a Better
Future for Everyone, Harper Business, 2017
8. Henrico Dolfing, Project Failure Case Studies: Lessons learned from other people’s
mistakes, Kindle edition
9. Mary Poppendieck, Implementing Lean Software Development: From Concept to Cash,
Addison-Wesley Signature Series, 2006
10. StarUML documentation - https://docs.staruml.io/
11. OpenProject documentation - https://docs.openproject.org/
78
12. BugZilla documentation - https://www.bugzilla.org/docs/

13. GitHub documentation - https://guides.github.com/
14. Jira documentation - https://www.atlassian.com/software/jira

1. What are the advantages of an incremental development model over a waterfall model?
2. Compare agile software development with traditional software development?

1. How to prepare a software requirement specification?
2. Differentiate between Architectural design and Component level design.
3. How do agile approaches help software developers to capture and define the user
requirements effectively?
4. What is the relevance of the SRS specification in software development?
5. Prepare a use case diagram for a library management system.

1. Differentiate between the different types of software testing strategies.
2. What are the benefits of DevOps?
3. How do design patterns help software architects communicate the design of a complex
system effectively?
4. What are the proactive approaches one can take to optimise efforts in the testing phase?

1. What are the activities involved in software project management?
2. What is the need for SCRUM, Kanban and Lean methodologies?
3. What are the benefits of rolling level planning in software project management and how
would you implement it?
4. How would you assess the risks in your software development project? How would you
plan for risk mitigation and contingency?

1. What is the importance of Software Process improvement?
2. How will retrospectives help in improving the software development process?
3. What are the important skills required for the SQA role?
4. How would you use project history data as a prediction tool to plan future projects?
79
QP CODE:
Reg No:______________
Name :______________
PAGES : 3
FIFTH SEMESTER B.TECH DEGREE EXAMINATION(MINOR), MONTH & YEAR
Course Name: Concepts in Software Engineering
Duration: 3 Hrs Max. Marks : 100
PART A
1. Explain why professional software that is developed for a customer is not simply
the programs that have been developed and delivered
2. Incremental software development could be very effectively used for customers

who do not have a clear idea about the systems needed for their operations.
Discuss.
3. Identify and briefly describe four types of requirements that may be defined for a
computer based system.
4. Describe software architecture in your own words.
5. What are the major differences between GPL and LGPL?
6. Compare between white box testing and black box testing.
7. What is the importance of risk management in software project management?
8. Explain COCOMO cost estimation model
9. Describe the software quality dilemma in your own words
10. Which are the levels of the CMMI model?

(10x3=30)
80
Part B
(Answer any one question from each module. Each question carries 14 marks)
11. (a) Compare between waterfall model and spiral model (8)
(b) Explain Agile methods and Agile manifesto (6)
OR
12. (a) Explain software process activities (7)
(b) Explain Agile Development techniques and Agile Project Management. (7)
13. (a) What are functional and nonfunctional requirements? Imagine that you are
developing a library management software for your college, identify at least (10)
8 functional requirements and 4 nonfunctional requirements.
(b) What are the contents of a software requirement specification?

(4)
OR
14. (a) Explain Personas, Scenarios, User stories and Feature identification? (8)
(b) Compare between Software Architecture design and Component level (6)
design
15. (a) Describe the formal and informal review techniques in detail. (6)
(b) Explain various software testing strategies. (8)
OR
16. (a) Explain DevOps CI/CD/CD in detail.

(8)
(b) Explain test driven development. (6)
17. (a) What is a critical path and demonstrate its significance in a project schedule (6)
with the help of a sample project schedule.
(b) Explain plan driven development and project scheduling (6)
81
OR
18. (a) Explain the SCRUM framework. (8)
(b) What is algorithmic cost modeling? What problems does it suffer from when (6)
compared with other approaches to cost estimation?
(b) Explain the SPI process. (6)
OR
20. (a) Compare between CMMI and ISO 9001:2000 (8)
(b) Compare Quality Control and Quality Assurance. (6)
Teaching Plan [44 hours]
Module 1 : Introduction to Software Engineering (8 hours) Hours
1.1 Introduction to Software Engineering. [ Book 1, Chapter 1] 1 hour
1.2 Software process models [Book 1 - Chapter 2] 1 hour
1.3 Process activities [Book 1 - Chapter 2] 1 hour
1.4 Coping with change [Book 1 - Chapter 2, Book 2 - Chapter 4] 1 hour
1.5 Agile software development [Book 1 - Chapter 3] 1 hour
1.6 Agile development techniques [Book 1 - Chapter 3] 1 hour
1.7 Agile Project Management.[Book 1 - Chapter 3] 1 hour
1.8 Case studies : An insulin pump control system. Mentcare - a patient 1 hour
information system for mental health care. [Book 1 - Chapter 1]
2.1 Functional and non-functional requirements, Requirements engineering 1 hour

processes [Book 1 - Chapter 4]
82
2.2 Requirements elicitation, Requirements validation, Requirements 1 hour

change, Traceability Matrix [Book 1 - Chapter 4]
2.3 Developing use cases, Software Requirements Specification Template [Book 2 1 hour
- Chapter 8]
2.4 Personas, Scenarios [Book 3 - Chapter 3] 1 hour
2.5 User stories, Feature identification [Book 3 - Chapter 3] 1 hour
2.6 Design concepts [Book 2 - Chapter 12] 1 hour
2.7 Architectural Design [Book 2 - Chapter 13] 1 hour
2.8 Component level design [Book 2 - Chapter 14] 1 hour
2.9 Component level design, Design Document Template. [Book 2 - Chapter 14, 1 hour
Ref - 2]
2.10 Case study: The Ariane 5 launcher failure. [ Book 2 - Chapter 16] 1 hour
3.1 Object-oriented design using the UML, Design patterns [Book 1 - Chapter 7] 1 hour
3.2 Implementation issues, Open-source development - Open-source licensing - 1 hour

GPL, LGPL, BSD [Book 1 - Chapter 7]
3.3 Review Techniques - Cost impact of Software Defects, Code review. [Book 2 - 1 hour
Chapter 20]
34 Informal Review, Formal Technical Reviews, Post-mortem evaluations. [Book 1 hour

2 - Chapter 20]
3.5 Software testing strategies [Book 2 - Chapter 22] 1 hour
3.6 Software testing strategies [Book 2 - Chapter 22] 1 hour
3.7 White box testing, Path testing, Control Structure testing [Book 2 - Chapter 1 hour
23]
3.8 Black box testing. Test documentation [Book 2 - Chapter 23] 1 hour
3.9 Test automation, Test-driven development [Book 3 - Chapter 9] 1 hour
3.10 Security testing. DevOps and Code Management [Book 3 - Chapter 9, Chapter 1 hour
10]
3.11 DevOps and Code Management - Code management, DevOps automation, 1 hour
CI/CD/CD. [Book 3 - Chapter 10]
83
3.12 Software Evolution - Evolution processes, Software maintenance. [Book 1 - 1 hour

Chapter 9]
4.1 Software Project Management - Risk management, Managing people, 1 hour

Teamwork [Book 1 - Chapter 22]
4.2 Project Planning - Software pricing, Plan-driven development, Project 1 hour

scheduling, Agile planning [Book 1 - Chapter 23]
4.3 Estimation techniques [Book 1 - Chapter 23] 1 hour
4.4 Configuration management [Book 1 - Chapter 25] 1 hour
4.7 Kanban methodology and lean approaches. [Ref 9 - Chapter 2] 1 hour
4.8 Kanban methodology and lean approaches.[Ref 9 - Chapter 2] 1 hour
Module 5 : Software Quality, Process Improvement and Technology trends (6 hours)
5.1 Software Quality, Software Quality Dilemma, Achieving Software Quality. 1 hour
5.2 Elements of Software Quality Assurance, SQA Tasks [Book 3 - Chapter 21] 1 hour
5.3 Software measurement and metrics. [Book 3 - Chapter 21] 1 hour
5.4 Software Process Improvement(SPI), SPI Process[Book 2 - Chapter 37] 1 hour
5.5 Software Process Improvement(SPI), SPI Process[Book 2 - Chapter 37] 1 hour
5.6 CMMI process improvement framework, ISO 9001:2000 for Software. [Book 1 hour
2 - Chapter 37]
84
CONCEPTS IN Year of
MACHINE introduction
383
LEARNING VAC 3 1 0 4 2019
Preamble: This course enables the learners to understand the fundamental concepts and
algorithms in machine learning. The course covers the standard and most popular supervised
learning algorithms such as linear regression, logistic regression, decision trees, Bayesian
learning & the naive Bayes algorithm, support vector machines& kernels, basic clustering
algorithms and dimensionality reduction methods. This course helps the students to provide
machine learning based solutions to real world problems.
Prerequisite: Familiarity with basics in linear algebra, probability and Python

programming.
Course Outcomes
CO1 Illustrate Machine Learning concepts and basic parameter estimation

methods.(Cognitive Knowledge Level: Apply)
CO2 Demonstrate supervised learning concepts (regression, linear classification).

CO3 Illustrate the concepts of Multilayer neural network and Support Vector Machine
CO4 Describe unsupervised learning concepts and dimensionality reduction techniques.

CO5 Solve real life problems using appropriate machine learning models and evaluate the
performance measures (Cognitive Knowledge Level: Apply)
PO1 PO2 PO3 PO4 PO5 PO6 PO PO8 PO9 PO10 PO11 PO1
7 2
CO1
CO2
CO3
85
CO4
CO5


problems
Assessment Pattern

Test1 (Percentage) Test2 (Percentage) Examination
Marks
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyse
Evaluate
Create
Mark Distribution
150 50 100 3 hours

86

Syllabus
Module-1 (Overview of machine learning)
Machine learning paradigms-supervised, semi-supervised, unsupervised, reinforcement learning.

Basics of parameter estimation - maximum likelihood estimation(MLE) and maximum a
posteriori estimation(MAP). Introduction to Bayesian formulation.
Module-2 (Supervised Learning)
Regression - Linear regression with one variable, Linear regression with multiple variables,
solution using gradient descent algorithm and matrix method, basic idea of overfitting in
regression. Linear Methods for Classification- Logistic regression, Perceptron, Naive Bayes,
Decision tree algorithm ID3.
Module-3 (Neural Networks (NN) and Support Vector Machines (SVM))
NN - Multilayer feed forward network, Activation functions (Sigmoid, ReLU, Tanh),

Backpropagation algorithm.
87
SVM - Introduction, Maximum Margin Classification, Mathematics behind Maximum Margin

Classification, Maximum Margin linear separators, soft margin SVM classifier, non-linear SVM,
Kernels for learning non-linear functions, polynomial kernel, Radial Basis Function(RBF).
Module-4 (Unsupervised Learning)
Clustering - Similarity measures, Hierarchical Agglomerative Clustering, K-means partitional

clustering, Expectation maximization (EM) for soft clustering. Dimensionality reduction –
Principal Component Analysis, factor Analysis, Multidimensional scaling, Linear Discriminant
Analysis.
Module-5 (Classification Assessment)
Classification Performance measures - Precision, Recall, Accuracy, F-Measure, Receiver

Operating Characteristic Curve(ROC), Area Under Curve(AUC. Bootstrapping, Cross
Validation, Ensemble methods, Bias-Variance decomposition. Case Study: Develop a
classifier for face detection.
Text Book
1. Ethem Alpaydin, Introduction to Machine Learning, 2nd edition, MIT Press 2010.
2. Mohammed J. Zaki and Wagner Meira, Data Mining and Analysis: Fundamental
Concepts and Algorithms, Cambridge University Press, First South Asia edition,
2016.
3. Jake VanderPlas, Python Data Science Handbook, O'Reilly Media, 2016
4. Tom Mitchell, Machine Learning, McGraw-Hill, 1997.
Reference Books
1. Christopher Bishop. Neural Networks for Pattern Recognition, Oxford University
Press, 1995.
2. Kevin P. Murphy. Machine Learning: A Probabilistic Perspective, MIT Press
2012.
3. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements Of Statistical
Learning, Second edition Springer 2007.
4. P. Langley, Elements of Machine Learning, Morgan Kaufmann, 1995.
5. Richert and Coelho, Building Machine Learning Systems with Python.
6. Davy Cielen, Arno DB Meysman and Mohamed Ali. Introducing Data Science:
Big Data, Machine Learning, and More, Using Python Tools, Dreamtech Press
2016.
88
Course Outcome1(CO1):
1. A coin is tossed 100 times and lands heads 62 times. What is the maximum likelihood
estimate for θ, the probability of heads.
2. Suppose data x1, ..., xnare independent and identically distributed drawn from an
exponential distribution exp(λ). Find the maximum likelihood for λ.
3. Suppose x1, ..., xn are independent and identically distributed(iid) samples from a
distribution with density
Find the maximum likelihood estimate(MLE) for θ.

4. Find the maximum likelihood estimator (MLE) and maximum a posteriori (MAP)
estimator for the mean of a univariate normal distribution. Assume that we have N
samples, x1,..., xN independently drawn from a normal distribution with known variance σ2
and unknown mean µ and the prior distribution for the mean is itself a normal distribution
with mean ν and variance β2. What happens to the MLE and MAP estimators as the
number of samples goes to infinity.

1. Explain the difference between (batch) gradient descent and stochastic gradient descent.
Give an example of when you might prefer one over the other.
2. Suppose that you are asked to perform linear regression to learn the function that outputs
y, given the D-dimensional input x. You are given N independent data points, and that all
the D attributes are linearly independent. Assuming that D is around 100, would you
prefer the closed form solution or gradient descent to estimate the regressor?
3. Suppose you have a three class problem where class label y ∈ 0, 1, 2 and each training
example X has 3 binary attributes X1, X2, X3∈ 0, 1. How many parameters (probability
distribution) do you need to know to classify an example using the Naive Bayes
classifier?

1. What are support vectors and list any three properties of the support vector classifier
solution?
2. Why do you use kernels to model a projection from attributes into a feature space, instead
of simply projecting the dataset directly?
3. Describe how Support Vector Machines can be extended to make use of kernels. Illustrate
with reference to the Gaussian kernel K(x, y) = e−z,where z = (x−y)2 .
89
4. Briefly explain one way in which using tanh instead of logistic activations makes
optimization easier.
5. ReLU activation functions are most used in neural networks instead of the tanh activation
function. Draw both activation functions and give a) an advantage of the ReLU function
compared to the tanh function. b) a disadvantage of the ReLU function compared to the
tanh function.

1. Describe cluster analysis? Identify two applications where cluster analysis can be applied
to multimedia data?
2. Given two objects represented by the tuples (22, 1, 42, 10) and (20, 0, 36, 8):
(i) Compute the Euclidean distance between the two objects.
(ii) Compute the Manhattan distance between the two objects.

3. Use PCA to reduce the dimension from 2 to 1 for the design matrix X.
4. What is Principal Component Analysis (PCA)? Which eigen value indicates the direction
of largest variance?
5. Suppose that one runs a principal component analysis on a data set and tells that the
percentage of variance explained by the first 3 components is 80%. How is this
percentage of variance explained?

1. Suppose that you are contacted by a food processing company that wants you to develop a
classifier that detects whether a rat is present in an image. You collect a large dataset of
images by crawling the web, and have annotators determine which images contain rats.
This set of images can then be used as the training set for your classifier.
a. Suggest a machine learning method to use for this classification task and evaluate
its performance.
b. After you have delivered your solution to the company, they get back to you and
complain that when they evaluate on a new test set, they get precision and recall
values that are much lower than what you reported to them. Explain what might
have gone wrong and propose remedial measures .
2. A real estate firm would like to build a system that predicts the sale prices of a house.
They create a spreadsheet containing information about 1,500 house sales in the Kochi
90
area. In addition to the price, there are 10 features describing the house, such as number
of bedrooms, total indoor area, lot area, a swimming pool, location, etc. Explain how you
would implement a machine learning model that would solve this prediction task. Give all
steps you would carry out when developing it. Explain why the model you built is
probably useless in the long run.
3. For a classifier, the confusion matrix is given by:
What is the precision, recall and accuracy of that classifier?

QP CODE: PAGES:3
Reg No:_______________
Name:_________________
FIFTH SEMESTER B.TECH DEGREE EXAMINATION(MINOR), MONTH &
YEAR
Course Name: CONCEPTS IN MACHINE LEARNING

Max.Marks:100 Duration: 3
Hours
PART A
1. Define supervised learning? Name special cases of supervised learning depending on whether
the inputs/outputs are categorical, or continuous.
2. Differentiate between Maximum Likelihood estimation (MLE) and Maximum a Posteriori
(MAP) estimation?
3. What is overfitting and why is it a problem? Give an example of a method to reduce the risk
of overfitting.
4. Specify the basic principle of gradient descent algorithm.
5. Suppose that you have a linear support vector machine(SVM) binary classifier. Consider a
point that is currently classified correctly, and is far away from the decision boundary. If you
91
remove the point from the training set, and re-train the classifier, will the decision boundary
change or stay the same? Justify your answer.
6. Mention the primary motivation for using the kernel trick in machine learning algorithms?
7. Expectation maximization (EM) is designed to find a maximum likelihood setting of the
parameters of a model when some of the data is missing. Does the algorithm converge? If so,
do you obtain a locally or globally optimal set of parameters?
8. Illustrate the strength and weakness of k-means algorithm.
9. Classifier A attains 100% accuracy on the training set and 70% accuracy on the test set.
Classifier B attains 70% accuracy on the training set and 75% accuracy on the test set. Which
one is a better classifier. Justify your answer.
10. How does bias and variance trade-off affect machine learning algorithms?
(10x3=30)
Part B
11. a) Suppose that X is a discrete random variable with the following probability mass
function: where 0 ≤ θ ≤ 1 is a parameter. The following 10 independent observations
were taken from such a distribution: (3, 0, 2, 1, 3, 2, 1, 0, 2, 1). What is the maximum
likelihood estimate of θ. (6)
b) A gamma distribution with parameters α, β has the following density function, where Γ(t) is
the gamma function.
If the posterior distribution is in the same family as the prior distribution, then we say that
the prior distribution is the conjugate prior for the likelihood function. Using the Gamma
distribution as a prior, show that the Exponential distribution is a conjugate prior of the
Gamma distribution. Also, find the maximum a posteriori estimator for the parameter of the
Exponential distribution as a function of α and β. (8)
OR
12. a) Traffic between 8AM and 9AM at a certain place was measured by counting the number
of vehicles that passed at that time. Suppose the counts follow a Poisson process. A random
sample of 9 observations was collected, having observed the following number of vehicles:
(95, 100, 80, 70, 110, 98, 97, 90, 70). Derive the maximum likelihood estimator for the
92
average number of vehicles that pass by that place between 8 AM and 9 AM, and compute
the corresponding estimate using the given sample. (7)
b) Find the maximum a posteriori (MAP) estimator for the mean of a univariate normal
distribution. Assume that we have N samples, x1,..., xN independently drawn from a normal
distribution with known variance σ2 and unknown mean µ and the prior distribution for the
mean is itself a normal distribution with mean ν and variance β2. (7)
13.a) Derive the gradient descent training rule assuming for the target functionod = w0 + w1x1 + ...
+ wnxn. Define explicitly the squared cost/error function E, assuming that a set of training
examples D is provided, where each training example d ∈ D is associated with the target
output td. (10)
b) How can we interpret the output of a two-class logistic regression classifier as a probability?
(4)
OR
14. a) In a two-class logistic regression model, the weight vector w = [4, 3, 2, 1, 0]. We apply it
to some object that we would like to classify; the vectorized feature representation of this
object is x = [−2, 0,−3, 0.5, 3]. What is the probability, according to the model, that this
instance belongs to the positive class? (6)
b) The following dataset can be used to train a classifier that determines whether a given person
is likely to own a car or not. There are three features: education level (primary, secondary, or
university); residence (city or country); gender (female, male).
93
Find the root attribute and justify your answer (8)
15. a) Consider a support vector machine whose input space is 2-D, and the inner products are
computed by means of the kernel K(x, y) = (x.y + 1)2-1, where x.ydenotes the ordinary inner
product. Show that the mapping to feature space that is implicitly defined by this kernel is the
mapping to 5-D given by (10)
b) What is the basic idea of a Support Vector Machine? (4)

OR
16. a) Explain how back propagation can be used to solve XOR problem which is not linearly
separable. (8)
b) Consider the following one dimensional training data set, ’x’ denotes negative examples and
’o’ positive examples. The exact data points and their labels are given in the table. Suppose
a SVM is used to classify this data. Indicate which are the support vectors and mark the
decision boundary. Find the equation of the hyperplane. (6)
17. a)Suppose that we have the following data (one variable). Use single linkage
Agglomerative clustering to identify the clusters.
Daa: (2, 5, 9, 15, 16, 18, 25, 33, 33, 45). (8)
b) Given two objects represented by the tuples (22, 1, 42, 10) and (20, 0, 36, 8):
94
(iii) Compute the Minkowski distance between the two objects, using p = 3 (6)
OR
18. a) Suppose that we have the following data:
Identify the cluster by applying the k-means algorithm, with k = 2. Try using initial
cluster centers as far apart as possible. (10)
b) List the steps involved in Principal Component Analysis. (4)
19. a) Suppose the dataset had 9700 cancer-free images from 10000 images from cancer
patients. Find precision, recall and accuracy ? Is it a good classifier? Justify. (8)
Actual Class\ cancer = yes cancer = no Total

Predicted class
cancer = yes 90 210 300
cancer = no 140 9560 9700
Total 230 9770 10000
b) Suppose that you have a classification problem where our feature representation contains
about 10,000,000 features. We would like to develop a classifier that can be deployed in a
mobile phone, so preferably it should have a small memory footprint. Discuss one solution
for how this can be done. (6)
OR
20. a) What are ROC space and ROC curve in machine learning? In ROC space, which points
correspond to perfect prediction, always positive prediction and always negative prediction?
Why? (6)
b)Suppose there are three classifiers A,B and C. The (FPR, TPR) measures of the three
classifiers are as follows – A (0, 1), B (1, 1) , C (1,0.5). Which can be considered as a
perfect classifier? Justify your answer. (4)
95
c) Given the following ROC Curve? Find the AUC? (4)
Teaching Plan
No of
No Contents Lecture
Hrs
Module 1 :Overview of machine learning (7 hours)
1.1 Supervised, semi-supervised, unsupervised learning, reinforcement learning 1hour

(Text Book (TB) 1: Chapter 1)
1.2 Maximum likelihood estimation(MLE) (TB 1: Section 4.2) 1hour
1.3 Maximum likelihood estimation (MLE)- example (TB 1: Section 4.2) 1hour
1.4 Maximum a posteriori estimation(MAP) (TB 4: Section 6.2) 1hour
1.5 Maximum a posteriori estimation(MAP)-example (TB 4: Section 6.2) 1hour

1.6 Bayesian formulation (TB 1: Section 14.1, 14.2) 1hour
1.7 Bayesian formulation -example (TB 1: Section 14.1, 14.2) 1hour
Module 2 : Supervised Learning (8 hours)
96
2.1 Linear regression with one variable (TB 1: Section 2.6) 1hour
2.2 Multiple variables, Solution using gradient descent algorithm and matrix 1hour
method (No derivation required) (TB 1: Section 5.8)
2.3 Overfitting in regression, Lasso and Ridge regularization 1hour
2.4 Logistic regression 1hour
2.5 Perceptron 1hour
2.6 Naive Bayes (TB 2: Section 18.2) 1hour
2.7 Decision trees (TB 2: Chapter 19) 1hour
2.8 Decision trees- ID3 algorithm (TB 2: Chapter 19) 1hour
Module 3 : Neural Networks and Support Vector Machines (TB 2: Chapter 21)
(11 hours)
3.1 Multilayer Feed forward Network, Activation Functions (Sigmoid, ReLU, 1hour
Tanh)
3.2 Back Propagation Algorithm 1hour
3.3 Illustrative Example for Back Propagation 1hour
3.4 Introduction, Maximum Margin Hyperplane, 1hour
3.5 Mathematics behind Maximum Margin Classification 1hour
3.6 Formulation of maximum margin hyperplane and solution 1hour
3.7 Soft margin SVM 1hour
3.8 Solution of Soft margin SVM 1hour
3.9 Non-linear SVM 1hour
3.10 Kernels for learning non-linear functions and properties of kernel functions. 1hour
3.11 Example Kernels functions- Linear, RBF, Polynomial. 1hour
Module 4 : Unsupervised Learning (10 hours)
4.1 Similarity measures- Minkowski distance measures( Manhattan, Euclidean), 1hour
Cosine Similarity
4.2 Clustering - Hierarchical Clustering (TB 2: Chapter 14) 1hour
4.3 K-means partitional clustering (TB 2: Chapter 13) 1hour
4.4 Expectation maximization (EM) for soft clustering (TB 2: Chapter 13) 1hour
4.5 Expectation maximization (EM) for soft clustering (TB 2: Chapter 13) 1hour
97
4.6 Dimensionality reduction – Principal Component Analysis (TB 1: Section 1hour

6.3)
4.7 Dimensionality reduction – Principal Component Analysis (TB 1: Section 1hour
6.3)
4.8 Factor Analysis (TB 1: Section 6.4) 1hour
4.9 Multidimensional scaling (TB 1: Section 6.5) 1hour
4.10 Linear Discriminant Analysis (TB 1: Section 6.6) 1hour
Module 5 : Classification Assessment (8 hours)
Performance measures - Precision, Recall, Accuracy, F-Measure, ROC, 1hour
5.1
AUC. (TB 2: Chapter 22.1)
5.2 Boot strapping, Cross validation 1hour
5.3 Ensemble methods- bagging 1hour
5.4 Ensemble methods- boosting 1hour
5.5 Bias-Variance decomposition (TB 2: Chapter 22.3) 1hour
5.6 Bias-Variance decomposition (TB 2: Chapter 22.3) 1hour
Face detection (TB 3: Chapter 5 Section Application: A Face Detection 1hour
5.7
Pipeline)
Face detection (TB 3: Chapter 5 Section Application: A Face Detection 1hour
5.8
Pipeline)
98
Year of
CST CLIENT SERVER Introduction
385 SYSTEMS
VAC 3 1 0 4 2019
Preamble:
The syllabus is prepared with the view of preparing the Engineering Graduates to build effective
Client/Server applications. This course aims at providing a foundation in decentralized computer
systems, using the client/server model. The course content is decided to cover the essential
fundamentals which can be taught within the given slots in the curriculum.
Prerequisite: Basic knowledge in Computer
Course Outcomes
Identify the basics of client/server systems and the driving force behind the
CO 1
development of client/server systems(Cognitive Knowledge Level: Understand)
Outline the architecture and classifications of client/server systems(Cognitive

CO 2
Summarize the client/server network services for an application(Cognitive

CO 3
Identify management services and issues in network (Cognitive Knowledge Level:

CO 4
Understand)
Outline the Client/Server technology in respect of databases and Client/Server

CO 5
database architecture (Cognitive Knowledge Level: Understand)
99

CO1
CO2
CO3
CO4
CO5


problems
100
Assessment Pattern

Category Examination Marks
Test 1 (Percentage) Test 2
(Percentage)
Remember 40 40 40
Understand 40 40 40
Apply 20 20 20
Analyse
Evaluate
Create
Mark distribution
Total CIE ESE ESE Duration

Marks Marks Marks
150 50 100 3 hours
Continuous Assessment Test 2 (for lab, internal examination, for 2hrs) : 20 marks
each module (2.5 modules x 2 = 5), having 3 marks for each question. Students should answer
all questions. Part B also contains 5 questions with 2 questions from each module (2.5 modules
101
x 2 = 5), of which a student should answer any one. The questions should not have sub-
divisions and each one carries 7 marks.
question can have maximum 2 sub-divisions and carry 14 marks.

1. Computing in client server architecture over Mainframe architecture has certain

advantages and disadvantages. Describe at least three advantages and disadvantages
for each architecture.
1. Explain the role of mainframe-centric model in Client/Server computing?
1. Describe the client server system development methodology? Explain different phases of
System Integration Life-Cycle.
1. Explain about network management and remote system management. How can security be
provided to the network?
1. Explain various types of Client/Server Database Architecture
Syllabus
Module – 1 (Introduction)
Introduction to Client/Server computing - Basic Client/Server Computing Model, Server for

Every Client- File Server, Print Server, Application Server, Mail Server, Directory Services
Server, Web Server, Database Server, Transaction Servers. Client/Server-Fat or Thin, Stateless
102
or Stateful, Servers and Mainframes, Client/Server Functions. Driving Forces behind

Client/Server Computing- Business Perspective, Technology Perspective.
Module -2 (Client/Server Classification)
Client/Server Types-Single Client/Single Server, Multiple Clients/Single Server, Multiple

Clients/Multiple Servers, Integration With Distributed Computing, Alternatives To
Client/Server Systems. Classification of Client/Server Systems- Two-Tier Computing,
Middleware, Three-Tier Computing- Model View Controller (MVC), Principles behind
Client/Server Systems.Client/Server Topologies. Existing Client/Server Architecture.
Architecture for Business Information System.
Module -3 (Client/Server Application Components)
Client- Services, Request for services, RPC, Windows services, Print services, Remote boot
services, other remote services, Utility Services. Server- Detailed server functionality, Network
operating system, Available platforms, Server operating system. Organizational Expectations,
Improving performance of client/server applications, Single system image, Downsizing and
Rightsizing, Advantages and disadvantages of Client/Server computing, Applications of
Client/Server.
Module -4 (Client/ Server Systems Services and Support)
Services and Support- System administration, Availability, Reliability, Scalability,

Observability, Agility, Serviceability. Software Distribution, Performance, Network
management. Remote Systems Management- RDP, Telnet, SSH, Security. LAN and Network
Management issues.
Module -5(Client/Server Technology and Databases)
Client/Server Technology and Databases - Storing Data, Database System Architectures.

Client/Server In Respect Of Databases- Client/Server Databases, Client/Server Database
Computing, Database Computing Vs. Mainframe, PC/File Server Computing. Client/Server
Database Architecture - Process-Per-Client Architecture, Multi-Threaded Architecture, Hybrid
Architecture. Database Middleware Component - Application Programming Interface, Database
Translator, Network Translator.
Text Book
1. Patrick Smith &Steve Guengerich, Client / Server Computing, PHI
2. Subhash Chandra Yadav, Sanjay Kumar Singh, An Introduction to Client/Server Computing,

New Age International Publishers
103
Reference Books
1. Jeffrey D.Schank, “Novell’s Guide to Client-Server Application & Architecture” Novell Press
2. Robert Orfali, Dan Harkey, Jeri Edwards, Client/Server Survival Guide, Wiley-India
Edition, Third Edition
3. Dawna Travis Dewire, Client Server Computing ― McGraw Hill
4. W.H.Inman, Developing Client Server Applications, BPB

QP CODE: PAGES: ___
Reg No:_______________
Name:_________________
FIFTH SEMESTER B.TECH DEGREE EXAMINATION(MINOR), MONTH & YEAR
Course Name : Client Server Systems
PART-A
1. Differentiate between Stateful and Stateless servers
2. List the different phases and activities of client/server system development

methodology.
3. How does transmission protocol work in client/server applications?
4. List any six services in single system image environment.
5. Specify the role of the client in Client/Server computing and also list any six
services provided by the client.
6. Why do most RPC system support call by value semantics for parameter passing?
7. What do you mean by a thin client network? List three advantages of the Thin
104
Client Network system.
8. How are connectivity and interoperability between .client/server achieved?
9. One disadvantage of the Client/Server system is lack of control in a Database

Management environment. Justify.
10. Explain the DBMS concept in client/server architecture.

(10x3=30)
Part B
Marks)
11. (a) Differentiate between Transaction server and Data server system with
examples. (7)
(b) Computing in client server architecture over Mainframe architecture has

certain advantages and disadvantages. Describe at least three advantages (7)
and disadvantages for each architecture.
OR
12. (a) Explain various Clients/Server system development tools.

(6)
(b) Classify and describe the driving forces that drive the move to Client/Server (8)
computing.
13. (a) Explain the role of mainframe-centric model in Client/Server computing? (5)
(b) Describe the three types of Client/Server systems in existence (9)
OR
14. (a) List and explain the general forces behind the architecture for business (7)
information systems
(b) Explain the different distribution styles. (7)
15. (a) Illustrate the concept of rightsizing and downsizing in Client/Server (7)
Computing
(b) What is client server system development methodology? Explain the (7)
105
different phases of System Integration Life-Cycle.
OR
16. (a) In Client/Server computing, explain the following with examples (10)
i. Dynamic Data Exchange
ii. RPC, Remote Procedure Call
iii. Remote Boot Service
iv. Diskless Computer
v. Object-linking and embedding
(b) Explain the functions and features of Network Operating System (4)
17. (a) Explain about network management and remote system management. How (10)
can security be provided to the network ?
(b) In client server architecture, what do you mean by Availability, Reliability, (4)
Serviceability and Security? Explain with examples.
OR
18. (a) Client server is modular infrastructure, this is intended to improve Usability, (7)
Flexibility, Interoperability and Scalability. Explain each term with an
example, in each case how it helps to improve the functionality of client
server architecture.
(b) Explain about network management and remote system management. How (7)
can security be provided to network?
19. (a) Explain the different types of Client/Server Database Architecture (9)
(b) List and explain the main components of Database middleware (5)
OR
20. (a) Discuss types of database utilities, tools and their functions (7)
(b) Discuss about the role of traditional and web databases in handling (7 )
client/server based applications.
106
Teaching Plan
Module- 1( Introduction) (10 hours)
1.1 Basic Client/Server Computing Model 1 hour

1.2 Server for Every Client- File Server, Print Server 1 hour
1.3 Application Server, Mail Server, Directory Services Server 1 hour
1.4 Web Server, Database Server 1 hour
1.5 Transaction Servers 1 hour

1.6 Client/Server-Fat or Thin 1 hour
1.7 Stateless or Stateful 1 hour
1.8 Servers and Mainframes 1 hour
1.9 Client/Server Functions 1 hour
1.1 Driving Forces behind Client/Server Computing- Business Perspective, 1 hour
0 Technology Perspective
Module- 2 (Client/Server Classification) (10 hours)
2.1 Client/Server Types-Single Client/Single Server 1 hour
2.2 Multiple Clients/Single Server, Multiple Clients/Multiple Servers 1 hour
2.3 Integration With Distributed Computing 1 hour
2.4 Alternatives To Client/Server Systems 1 hour
2.5 Classification of Client/Server Systems- Two-Tier Computing, 1 hour
Middleware
2.6 Three-Tier Computing- Model View Controller (MVC) 1 hour
2.7 Principles behind Client/Server Systems. 1 hour
2.8 Client/Server Topologies 1 hour

2.9 Existing Client/Server Architecture 1 hour
2.10 Architecture for Business Information System 1 hour
Module -3 (Client/Server Application Components) (9 hours)
3.1 The client: Services, Request for services, RPC 1 hour

3.2 Windows services, Print services, Remote boot services 1 hour
107
3.3 Utility Services & Other Services 1 hour

3.4 Server- Detailed server functionality, Network operating system 1 hour
3.5 Available platforms, Server operating system 1 hour
3.6 Organizational Expectations, Improving performance of client/server 1 hour
applications
3.7 Single system image, Downsizing and Rightsizing 1 hour
3.8 Advantages and disadvantages of Client/Server computing 1 hour
3.9 Applications of Client/Server 1 hour
Module -4 (Client/ Server Systems Services and Support) (8 hours)
4.1 Services and Support, System administration 1 hour

4.2 Availability, Reliability 1 hour
4.3 Scalability, Observability, Agility 1 hour
4.4 Serviceability, Software Distribution 1 hour
4.5 Performance 1 hour
4.6 Network management 1 hour
4.7 Remote Systems Management- RDP, Telnet, SSH 1 hour
4.8 Security, LAN and Network Management issues 1 hour
Module -5(Client/Server Technology and Databases) (8 hours)
5.1 Client/Server Technology and Databases - Storing Data 1 hour
5.2 Database System Architectures 1 hour

5.3 Client/Server In Respect Of Databases- Client/Server Databases 1 hour
5.4 Client/Server Database Computing 1 hour
5.5 Database Computing Vs. Mainframe, PC/File Server Computing 1 hour
5. Client/Server Database Architecture - Process-Per-Client Architecture 1 hour
5.7 Multi-Threaded Architecture, Hybrid Architecture 1 hour
5.8 Database Middleware Component - Application Programming Interface,

1 hour
Database Translator, Network Translator
108
SEMESTER V
HONOURS
109
Year of
CST CRYPTOGRAPHIC Introduction
393 ALGORITHMS
VAC 3 1 0 4 2019
Preamble:
The course on Cryptographic Algorithms aims at exploring various algorithms deployed in

offering confidentiality, integrity, authentication and non-repudiation services. This course
covers classical encryption techniques, symmetric and public key crypto-system, key exchange
and management, and authentication functions. The concepts covered in this course enable the
learners in effective use of cryptographic algorithms for real life applications.
Prerequisite: A sound background in Number Theory.
Identify the security services provided for different types of security attacks.
CO1
(Cognitive Knowledge Level : Understand)
Summarize the classical encryption techniques for information hiding. (Cognitive

CO2
Illustrate symmetric / asymmetric key cryptographic algorithms for secure

CO3
communication.(Cognitive Knowledge Level: Apply)
Interpret key management techniques for secure communication.(Cognitive

CO4
Summarize message authentication functions in a secure communication

CO5
scenario.(Cognitive Knowledge Level: Understand)
PO PO1 PO1
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO11
9 0 2
CO1
110
CO2
CO3
CO4
CO5

problems
Assessment Pattern
Continuous Assessment Tests End

Bloom’s Semester
Category Test1 (Percentage) Test2 Examinati
(Percent on Marks
111
age)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution
Total CIE Marks ESE Marks ESE

Marks Duration
150 50 100 3 hours
112
Syllabus
Module-1 (Introduction to the Concepts of Security)
Need for security, Security approaches, Principles of security, Types of attacks, OSI Security
Architecture, Classical encryption techniques - Substitution techniques, Transposition
techniques. Stream cipher, Block cipher, Public key cryptosystems vs. Symmetric key
cryptosystems, Encrypting communication channels.
Module-2 (Symmetric Key Cryptosystems)
Overview of symmetric key cryptography, Block cipher principles, Data Encryption Standard
(DES), Differential and Linear cryptanalysis, Double DES, Triple DES, International Data
Encryption Algorithm (IDEA), Advanced Encryption Algorithm (AES),Block cipher modes of
operation, Stream cipher, RC4.
Module-3 (Public Key Cryptosystems)
Principles of public key cryptosystems, RSA algorithm, RSA illustration, Attacks, ElGamal
cryptographic system, Knapsack algorithm, Diffie-Hellman key exchange algorithm, Elliptical
curve cryptosystems.
Module-4 (Key Management)
Symmetric key distribution using symmetric encryption, Symmetric key distribution using
asymmetric encryption, Distribution of public keys, Generating keys, transferring keys,
Verifying keys, Updating keys, Storing keys, Backup keys, Compromised keys, Public key
infrastructure.
113
Module – 5 (Authentication)
Authentication requirements, Authentication functions, Message authentication codes (MAC),

Hash functions, Security of Hash functions and MAC, Message Digest 5 (MD5), Secure Hash
Algorithm (SHA)-512, Hash-based Message Authentication Code (HMAC), Cipher-based
Message Authentication Code (CMAC), X.509 Authentication services.
Text Books
1. William Stallings, Cryptography and Network Security Principles and Practice, Pearson
Edu, 6e.
2. Bruice Schneier, Applied Cryptography Protocols, Algorithms and source code in C,
Wiley,2e.
References
1. Behrouz A. Forouzan, Cryptography and Network Security, McGraw Hill, 2e.
2. Johannes A. Buchmann, Introduction to Cryptography, Springer, 2e.
3. DouglasR. Stinson, Cryptography Theory and Practice, 3e,Chapman & Hall/CRC,

2006.
4. Bernard Menezes, Network Security and Cryptography, Cengage Learning, 2011.

1. Consider an automated teller machine (ATM) in which users provide a personal
identification number (PIN) and a card for account access. Give examples of
confidentiality, integrity, and availability requirements associated with the system and, in
each case, indicate the degree of importance of the requirement.
2. Discuss the different security services provided for preventing security attacks.

1. The encryption key in a transposition cipher is (3,2,6,1,5,4). Find the decryption key
2.Discuss the process of encryption in Vernam cipher

1. Devise a meet-in-the-middle attack for a triple DES.
114
2. Write an algorithm for the InvSubBytes transformation and implement using python
(Assignment)
3. Consider the following elliptic curve signature scheme. We have a global elliptic curve,
prime p, and “generator” G. Alice picks a private signing key XA and forms the public
verifying YA = XAG. To sign a message M:
• Alice picks a value k
• Alice sends Bob M, k and the signature S = M - kXAG.
• Bob verifies that M=S+kYA.
Show that the verification process produces an equality if the signature is valid.
4. Write an algorithm to add two points on an elliptic curve over GF(p) and implement using
Python. (Assignment)
5. Write an algorithm for encryption using knapsack cryptosystem and implement using Java.
(Assignment)
1. List four general categories of schemes for the distribution of public keys.
2. What are the essential ingredients of a public-key directory?
1. State the value of the length field in SHA-512 if the length of the message is 1919 bits and
1920 bits.
2. Write an algorithm in pseudo code for HMAC and implement using Python (Assignment)
115

QP CODE:
Reg No:______________
Name :______________ PAGES : 3
FIFTH SEMESTER B.TECH DEGREE EXAMINATION(HONORS), MONTH &

YEAR
Course Name: Cryptographic Algorithms

PART A

1. State the two approaches in attacking a cipher.
2. Define Substitution Cipher. Encrypt using one time pad M = HONORS and K =
CIPHER.
3. Specify the purpose of S-Boxes in Data Encryption Standard (DES).
4. Differentiate between diffusion and confusion.
5. Perform encryption using RSA Algorithm for the following p=7; q=11; e=13;
M=5.
6. Is Diffie-Hellman key exchange protocol vulnerable? Justify.
7. List the techniques for distribution of public keys.
8. Define a certificate authority and its relation to public key cryptography.
9. Distinguish between integrity and message authentication.
10. What types of attacks are addressed by message authentication?
116
(10x3=30)
Part B
Marks)
11. (a)
With a neat sketch, Explain OSI Security architecture model.
(8)
(b)
How does link encryption differ from end-to-end encryption? Explain.
(6)
OR
12. (a)
Encrypt the text “cryptography” using the Hill Cipher with the key
9 4
  (8)
 5 7  . Show the calculations.
(b) Illustrate the steps involved in encrypting a plain text using playfair cipher
(6)
with an example.
13. (a)
With a neat sketch, explain a single round in DES.
10
(b)
Explain encryption and decryption using 2 keys and 3 keys of triple DES.
(4)
OR
14. (a) Explain the block cipher modes i) Cipher feedback mode ii) Output
(8)
feedback mode.
(b) Describe the four types of transformations in AES. (6)
15. (a) Write an algorithm for generating public and private key using Elliptical
(10)
curve cryptography.
117
(b) The equation y2=x3 +x+1, the calculation is done modulo 13. Add two
(4)
points R= P+Q, where P= (4,2) and Q= (10,6).
OR
16. User A and B use the Diffie-Hellman key exchange technique with a
common prime q=71 and primitive root alpha=7.
(a) If user A has private key XA =3, What is A’s public key YA? (7)
(b) If user B has private key XB =6, What is A’s public key YB? (7)
17. (a) Define a session key and show how a KDC can create can create a session
(7)
key between Alice and Bob.
(b) What are the requirements for the use of a public-key certificate scheme? (7)
OR
18. (a) What are the core components of a PKI? Briefly describe each component. (8)
(b) Describe the following (i) Updating keys (ii) Compromised Keys. (6)
19. (a) Describe how SHA-512 logic produce message digest (10)
(b) Distinguish between HMAC and CMAC (4)
OR
20. (a) Specify the format for X.509 certificate. Explain the steps required to obtain
(7)
user’s certificate.
(b) With suitable block diagrams, explain the types of functions that may be
(8 )
used to produce an authenticator.
118
Teaching Plan
No of Lecture
No Contents
Hrs
Module - 1 (Introduction to the Concepts of Security) (9 hrs)
1.1 Need for security, Security approaches 1 hour
1.2 Principles of security, Types of attacks 1 hour
1.3 OSI Security Architecture 1 hour
Classical encryption techniques: Substitution techniques(Caesar cipher,

1.4 1 hour
Monoalphabetic cipher, Playfair cipher)
Classical encryption techniques: Substitution techniques (Hill cipher,

1.5 1 hour
Polyalphabetic cipher, One-time pad)
1.6 Classical encryption techniques: Transposition techniques 1 hour
1.7 Stream cipher, Block cipher 1 hour
1.8 Public- key cryptosystems vs. Symmetric key cryptosystems 1 hour
1.9 Encrypting communication channels 1 hour
Module - 2 (Symmetric key cryptosystems) (11 hrs)
2.1 Overview of symmetric key cryptography 1 hour
2.2 Block cipher principles 1 hour
2.3 Data Encryption Standard (DES) 1 hour
2.4 DES design criteria 1 hour
2.5 Differential and Linear cryptanalysis 1 hour
2.6 Double DES, Triple DES 1 hour
119
2.7 IDEA 1 hour
2.8 Advanced Encryption Algorithm (AES structure) 1 hour
2.9 Advanced Encryption Algorithm (Transformations) 1 hour
2.10 Block cipher modes of operation 1 hour
2.11 Stream cipher, RC4 1 hour
Module - 3 (Public key cryptosystems) (8 hrs)
3.1 Principles of public key cryptosystems 1 hour
3.2 RSA algorithm 1 hour
3.3 RSA illustration, Attacks 1 hour
3.4 ElGamal cryptographic system 1 hour
3.5 Knapsack algorithm 1 hour
3.6 Diffie-Hellman key exchange algorithm 1 hour
3.7 Elliptical curve cryptosystems(Elliptical curve arithmetic) 1 hour
3.8 Elliptical curve cryptosystems (Elliptical curve algorithm) 1 hour
Module - 4 (Key Management) (8 hrs) [Text book-2]
4.1 Symmetric key distribution using symmetric encryption 1 hour
4.2 Symmetric key distribution using asymmetric encryption 1 hour
4.3 Distribution of public keys 1 hour
4.4 Generating keys, Transferring keys 1 hour
120
4.5 Verifying keys, Updating keys 1 hour
4.6 Storing keys, Backup keys 1 hour
4.7 Compromised keys 1 hour
4.8 Public key infrastructure 1 hour
Module - 5 (Authentication) (9 hrs)
5.1 Authentication requirements 1 hour
5.2 Authentication functions 1 hour
5.3 Message Authentication Codes (MAC) 1 hour
5.4 Hash functions 1 hour
5.5 Security of Hash functions and MAC 1 hour
5.6 MD5 1 hour
5.7 SHA-512 1 hour
5.8 HMAC, CMAC 1 hour
5.9 X.509 Authentication services 1 hour
121
Year of
CST NEURAL NETWORKS Introduction
395 AND DEEP LEARNING
VAC 3 1 0 4 2019
Preamble:
Neural networks is a biologically inspired programming paradigm which enables a computer to

learn from observational data and deep learning is a powerful set of techniques for training
neural networks. This course introduces the key concepts in neural networks, its architecture and
learning paradigms, optimization techniques, basic concepts in deep learning, Convolutional
Neural Networks and Recurrent Neural Networks. The students will be able to provide best
solutions to real world problems in domains such as computer vision and natural language
processing.
Prerequisite: A Sound knowledge in Computational fundamentals of machine learning
Demonstrate the basic concepts of machine learning models and performance

CO1 measures. (Cognitive Knowledge Level : Understand)
Illustrate the basic concepts of neural networks and its practical issues(Cognitive
CO2 Knowledge Level : Apply)
Outline the standard regularization and optimization techniques for deep neural
CO3 networks (Cognitive Knowledge Level : Understand)
Build CNN and RNN models for different use cases.

CO4 (Cognitive Knowledge Level : Apply)
Explain the concepts of modern RNNs like LSTM, GRU (Cognitive Knowledge
Level : Understand)
CO5
122
CO1
CO2
CO3
CO4
CO5

problems
123
Assessment Pattern
Bloom’s Continuous Assessment Tests End

Category Test1 (%) Test2 (%) Semester
Examinati
on Marks
Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
Analyse
Evaluate
Create
Mark Distribution
Duration
150 50 100 3 hours
Continuous Internal Evaluation Pattern

Attendance 10 marks
Continuous Assessment Tests 25 marks
Each of the two internal examinations has to be conducted out of 50 marks. First Internal
Examination shall be preferably conducted after completing the first half of the syllabus and the
Second Internal Examination shall be preferably conducted after completing the remaining part
of the syllabus. There will be two parts: Part A and Part B. Part A contains 5 questions
(preferably, 2 questions each from the completed modules and 1 question from the partly
covered module), having 3 marks for each question adding up to 15 marks for part A. Students
should answer all questions from Part A. Part B contains 7 questions (preferably, 3 questions
each from the completed modules and 1 question from the partly covered module), each with 7
marks. Out of the 7 questions in Part B, a student should answer any 5.
124
can have a maximum 2 subdivisions and carry 14 marks.
Syllabus
Module - 1 (Basics of Machine Learning )
Machine Learning basics - Learning algorithms - Supervised, Unsupervised, Reinforcement,

Overfitting, Underfitting, Hyper parameters and Validation sets, Estimators -Bias and Variance.
Challenges in machine learning. Simple Linear Regression, Logistic Regression, Performance
measures - Confusion matrix, Accuracy, Precision, Recall, Sensitivity, Specificity, Receiver
Operating Characteristic curve( ROC), Area Under Curve(AUC).
Module -2 (Neural Networks )
Introduction to neural networks -Single layer perceptrons, Multi Layer Perceptrons (MLPs),
Representation Power of MLPs, Activation functions - Sigmoid, Tanh, ReLU, Softmax. Risk
minimization, Loss function, Training MLPs with backpropagation, Practical issues in neural
network training - The Problem of Overfitting, Vanishing and exploding gradient problems,
Difficulties in convergence, Local and spurious Optima, Computational Challenges.
Applications of neural networks.
Module 3 (Deep learning)
Introduction to deep learning, Deep feed forward network, Training deep models, Optimization
techniques - Gradient Descent (GD), GD with momentum, Nesterov accelerated GD,
Stochastic GD, AdaGrad, RMSProp, Adam. Regularization Techniques - L1 and L2
regularization, Early stopping, Dataset augmentation, Parameter sharing and tying, Injecting
noise at input, Ensemble methods, Dropout, Parameter initialization.
Module -4 (Convolutional Neural Network)
Convolutional Neural Networks – Convolution operation, Motivation, Pooling, Convolution and

Pooling as an infinitely strong prior, Variants of convolution functions, Structured outputs, Data
types, Efficient convolution algorithms. Practical use cases for CNNs, Case study - Building
CNN model AlexNet with handwritten digit dataset MNIST.
Module- 5 (Recurrent Neural Network)
Recurrent neural networks – Computational graphs, RNN design, encoder – decoder sequence
to sequence architectures, deep recurrent networks, recursive neural networks, modern RNNs
LSTM and GRU, Practical use cases for RNNs. Case study - Natural Language Processing.
125
Text Book
1. Goodfellow, I., Bengio,Y., and Courville, A., Deep Learning, MIT Press, 2016.
2. Neural Networks and Deep Learning, Aggarwal, Charu C., c Springer International
Publishing AG, part of Springer Nature 2018
3. Fundamentals of Deep Learning: Designing Next-Generation Machine Intelligence
Algorithms (1st. ed.). Nikhil Buduma and Nicholas Locascio. 2017. O'Reilly Media, Inc.
Reference Books
1. Satish Kumar, Neural Networks: A Classroom Approach, Tata McGraw-Hill Education,
2004.
2. Yegnanarayana, B., Artificial Neural Networks PHI Learning Pvt. Ltd, 2009.
3. Michael Nielsen, Neural Networks and Deep Learning, 2018

1. Predict the price of a 1000 square feet house using the regression model generated from
the following data.
No. Square feet Price(Lakhs)

1 500 5
2 900 10
3 1200 13
4 1500 18
5 2000 25
6 2500 32
7 2700 35
2. Consider a two-class classification problem of predicting whether a photograph contains a

man or a woman. Suppose we have a test dataset of 10 records with expected outcomes
and a set of predictions from our classification algorithm. Compute the confusion matrix,
accuracy, precision, recall, sensitivity and specificity on the following data.
Sl.No. Actual Predicted
1 man woman
2 man man
3 woman woman
4 man man
126
5 man woman
6 woman woman
7 woman man
8 man man
9 man woman
10 woman woman

1. Suppose you have a 3-dimensional input x = (x1, x2, x3) = (2, 2, 1) fully connected with
weights (0.5, 0.3, 0.2) to one neuron which is in the hidden layer with sigmoid
activation function. Calculate the output of the hidden layer neuron.
2. Consider the case of the XOR function in which the two points {(0, 0),(1, 1)} belong to
one class, and the other two points {(1, 0),(0, 1)} belong to the other class. Design a
multilayer perceptron for this binary classification problem.

1. Derive a mathematical expression to show L2 regularization as weight decay.
2. Explain how L2 regularization improves the performance of deep feed forward neural
networks.
3. Explain how L1 regularization method leads to weight sparsity.

1. Draw and explain the architecture of convolutional neural networks.
2. You are given a classification problem to classify the handwritten digits. Suggest a
learning and/or inference machine with its architecture, an objective function, and an
optimization routine, along with how input and output will be prepared for the
classifier.
3. In a Deep CNN architecture the feature map L1 was processed by the following
operations as shown in the figure. First down sampled using max pool operation of size
2 and stride 2, and three convolution operations and finally max unpool operation and
followed by an element wise sum. The feature map L1 and L4 are given below. Compute
the matrix L6.
L1 = 10 20 15 22 L4 = 10 20
20 16 28 30 20 30
30 12 20 16
20 20 40 12
127
4. Illustrate the workings of the RNN with an example of a single sequence defined on
a vocabulary of four words.

1. Draw and explain the architecture of LSTM.
2. List the differences between LSTM and GRU
QP CODE: PAGES:4
Reg No:_______________
Name:_________________
FIFTH SEMESTER B.TECH DEGREE EXAMINATION(HONORS), MONTH &
YEAR
Course Name: Neural Networks and Deep Learning
Max.Marks:100 Duration:3 Hours
PART A
1. List and compare the types of machine learning algorithms
2. Suppose 10000 patients get tested for flu; out of them, 9000 are actually healthy
and 1000 are actually sick. For the sick people, a test was positive for 620 and
negative for 380. For healthy people, the same test was positive for 180 and
negative for 8820. Construct a confusion matrix for the data and compute the
128
accuracy, precision and recall for the data
3. Illustrate the limitation of a single layer perceptron with an example
4. Specify the advantages of ReLU over sigmoid activation function.
5. Derive weight updating rule in gradient descent when the error function is a)
mean squared error b) cross entropy
6. List any three methods to prevent overfitting in neural networks
7. What happens if the stride of the convolutional layer increases? What can be the
maximum stride? Justify your answer.
8. Consider an activation volume of size 13×13×64 and a filter of size 3×3×64.

Discuss whether it is possible to perform convolutions with strides 2, 3 and 5.
Justify your answer in each case.
9. How does a recursive neural network work?
10. List down three differences between LSTM and RNN

(10x3=30
)
Part B
Marks)
11. (a)
Prove that the decision boundary of binary logistic regression is linear
(9)
(b) Given the following data, construct the ROC curve of the data. Compute
the AUC.
Threshold TP TN FP FN
1 0 25 0 29
2 7 25 0 22 (5)
3 18 24 1 11
4 26 20 5 3
5 29 11 14 0
129
6 29 0 25 0
7 29 0 25 0
OR
12. (a) With an example classification problem, explain the following terms:
a) Hyper parameters b) Training set c) Validation sets d) Bias e) Variance (8)
(b) Determine the regression equation by finding the regression slope

coefficient and the intercept value using the following data.
x 55 60 65 70 80 (6)
y 52 54 56 58 62
13. (a) Update the parameters V11 in the given MLP using back propagation with
learning rate as 0.5 and activation function as sigmoid. Initial weights are
given as V11= 0.2, V12=0.1, V21=0.1, V22=0.3, V11=0.2, W11=0.5,
W21=0.2
V
1 1 W
0.6
(10)
T=0.9
1
0.8
2 2
(b)
Explain the importance of choosing the right step size in neural networks
(4)
OR
14. (a) Explain in detail any four practical issues in neural network training (8)
130
(b) Calculate the output of the following neuron Y with the activation function
as a) binary sigmoid b) tanh c)ReLU
(6)
15. (a) Explain, what might happen in ADAGRAD, where momentum is

expressed as ∆𝑤𝑤𝑡𝑡 = −𝜂𝜂𝑔𝑔𝑡𝑡 /√(∑𝑡𝑡 𝜏𝜏=1 𝑔𝑔2𝜏𝜏 ) where the denominator
(6)
computes the L2 norm of all previous gradients on a per-dimension basis
and is a global learning rate shared by all dimensions.
(b) Differentiate gradient descent with and without momentum. Give equations
for weight updation in GD with and without momentum. Illustrate (8)
plateaus, saddle points and slowly varying gradients.
OR
16. (a) Suppose a supervised learning problem is given to model a deep feed
forward neural network. Suggest solutions for the following a) small sized
dataset for training b) dataset with both labelled and unlabeled data c) (9)
large data set but data from different distribution
(b) Describe the effect in bias and variance when a neural network is modified
(5)
with more number of hidden units followed with dropout regularization.
17. (a) Draw and explain the architecture of Convolutional Neural Networks (8)
(b) Suppose that a CNN was trained to classify images into different
categories. It performed well on a validation set that was taken from the
same source as the training set but not on a testing set. What could be the (6)
problem with the training of such a CNN? How will you ascertain the
problem? How can those problems be solved?
OR
18. (a) Explain the following convolution functions a)tensors b) kernel flipping c)
(10)
down sampling d) strides e) zero padding.
131
(b) What is the motivation behind convolution neural networks? (4)
19. (a) Describe how an LSTM takes care of the vanishing gradient problem. Use
some hypothetical numbers for input and output signals to explain the (8)
concept
(b) Explain the architecture of Recurrent Neural Networks (6)
OR
20. (a) Explain LSTM based solution for anyone of the problems in the Natural
(8)
Language Processing domain.
(b) Discuss the architecture of GRU (6 )
Teaching Plan
Module 1 : [Text book 1: Chapter 5, Textbook 2: Chapter 2](9 hours)
1.1 Introduction, Learning algorithms - Supervised, Unsupervised, 1 hour

Reinforcement
1.2 Overfitting, Underfitting, Hyperparameters 1 hour
1.3 Validation sets, Estimators -Bias and Variance. Challenges in machine 1 hour
learning.
1.4 Simple Linear Regression 1 hour
1.5 Illustration of Linear Regression 1 hour
1.6 Logistic Regression 1 hour
1.7 Illustration of Logistic Regression 1 hour
1.8 Performance measures - Confusion matrix, Accuracy, Precision, Recall, 1 hour
Sensitivity, Specificity, ROC, AUC.
1.9 Illustrative Examples for performance measures 1 hour
Module 2 : Text book 2, Chapter 1 (8 hours)
2.1 Introduction to neural networks -Single layer perceptrons 1 hour
2.2 Multi Layer Perceptrons (MLPs), Representation Power of MLPs 1 hour
2.3 Activation functions - Sigmoid, Tanh, ReLU, Softmax. Risk 1 hour
minimization, Loss function
132
2.4 Training MLPs with backpropagation 1 hour

2.5 Illustration of back propagation algorithm 1 hour
2.6 Practical issues in neural network training - The Problem of Overfitting, 1 hour
Vanishing and exploding gradient problems
2.7 Difficulties in convergence, Local and spurious Optima, Computational 1 hour

Challenges.
2.8 Applications of neural networks 1 hour
Module 3 : Text book 1: Chapter 7, 8, Text book 2, Chapter 3, 4 (10 hours)
3.1 Introduction to deep learning, Deep feed forward network 1 hour
3.2 Training deep models - Introduction, setup and initialization issues 1 hour
3.3 Solving vanishing and exploding gradient problems 1 hour
3.4 Concepts of optimization, Gradient Descent (GD), GD with momentum. 1 hour

3.5 Nesterov accelerated GD, Stochastic GD. 1 hour
3.6 AdaGrad, RMSProp, Adam. 1 hour
3.7 Concepts of Regularization, L1 and L2 regularization. 1 hour
3.8 Early stopping, Dataset augmentation 1 hour
3.9 Parameter sharing and tying, Injecting noise at input, Ensemble methods 1 hour
3.10 Dropout, Parameter initialization. 1 hour
Module 4 : Text book 1, Chapter 9, Text book 2: Chapter 8 (8 hours)
4.1 Convolutional Neural Networks, architecture 1 hour
4.2 Convolution and Pooling operation with example 1 hour
4.3 Convolution and Pooling as an infinitely strong prior 1 hour
4.4 Variants of convolution functions, structured outputs, data types 1 hour
4.5 Efficient convolution algorithms. 1 hour
4.6 Practical use cases for CNNs 1 hour
4.7 Case study - Building CNN with MNIST and AlexNet. 1 hour
4.8 Case study - Building CNN with MNIST and AlexNet 1 hour
Module 5 : Text book 1 :Chapter 10, 11, Text book 2:Chapter 7 (10 hours)
133
5.1 Recurrent neural networks – Computational graphs, RNN design 1 hour

5.2 Encoder – decoder sequence to sequence architectures 1 hour
5.3 Deep recurrent networks- Architecture 1 hour
5.4 Recursive neural networks 1 hour
5.5 Modern RNNs - LSTM 1 hour
5.6 Modern RNNs - LSTM 1 hour
5.7 GRU 1 hour
5.8 Practical use cases for RNNs. 1 hour
5.9 Case study - Natural Language Processing. 1 hour
5.10 Case study - Natural Language Processing. 1 hour
134
PRINCIPLES OF Year of
MODEL Introduction
397
CHECKING VAC 3 1 0 4 2019
Preamble:
This course covers the basic theory and algorithm for an automatic verification process namely,
model checking. Model checking is a formal process for proving the correctness of a
hardware/software which can be modelled as a finite-state transition system. This course
introduces the topics - finite-state modelling of hardware/software, linear-time properties,
classification of linear-time properties, Linear Temporal Logic (LTL), a formal language for
property specification, LTL model checking algorithm and model checking case studies. Proving
correctness of a hardware/software is essential in safety critical systems in domains such as
avionics, health care and automotive.
Prerequisite: Nil
CO# Course Outcomes
Illustrate an application for model checking. (Cognitive Knowledge Level:

CO1 Understand)
Describe finite-state modelling of hardware and software. (Cognitive

CO2 Knowledge Level: Understand)
Identify the linear-time properties required to represent the requirements

CO3 of a system. (Cognitive Knowledge Level: Apply)
Specify a given linear-time property in Linear Temporal Logic (LTL).

CO4 (Cognitive Knowledge Level: Apply)
Perform LTL model checking with the tool SAL (Symbolic Analysis
CO5 Laboratory). (Cognitive Knowledge Level: Apply)
135
PO1
1
CO1
CO2
CO3
CO4
CO5
CO6

136
Assessment Pattern
End Semester
percentage)
Remember 30 30 30
Understand 40 40 40
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution
ESE
Total Marks CIE Marks ESE Marks
Duration
150 50 100 3
shall be preferably conducted after completing the first half of the syllabus. The second series
137
contains 2 questions from each module of which a student should answer anyone. Each
Syllabus
Module 1 (Introduction to Model Checking)
System Verification– Hardware and Software Verification, Model Checking, Characteristics of

Model Checking. Transition Systems – Transition System, Direct Predecessors and Successors,
Terminal State, Deterministic Transition System.
Executions - Execution Fragment, Maximal and Initial Execution Fragment, Execution,
Reachable States. Modeling Hardware and Software Systems- Sequential Hardware Circuits,
data Dependent Systems.
Module - 2 (Linear Time Properties)
Linear-Time (LT) Properties - Deadlock. Linear-Time Behavior - Paths and State Graph, Path
Fragment, Maximal and Initial Path Fragment, Path. Traces - Trace and Trace Fragment, LT
Properties - LT Property, Satisfaction Relation for LT Properties, Trace Equivalence and LT
Properties. Safety Properties and Invariants - Invariants, Safety Properties, Trace Equivalence
and Safety properties. Liveness Properties - Liveness Property, Safety vs. Liveness Properties.
Fairness - Fairness, Unconditional, Weak and Strong Fairness, Fairness Strategies, Fairness
and Safety. (Definition and examples only for all topics - no proof required).
Module - 3 (Regular Properties)
Regular Properties - Model Checking Regular Safety properties - Regular Safety property,
Verifying Regular Safety Properties. Automata on Infinite Words - ⍵ -Regular Languages and
Properties, Nondeterministic Buchi Automata (NBA), Deterministic Buchi Automata (DBA),
Generalised Buchi Automata (Definitions only). Model Checking ⍵ -Regular Properties -
Persistence Properties and Product, Nested Depth-First Search (Only algorithms required).
Module - 4 (Linear Time Logic)
Linear Temporal Logic (LTL) - Syntax, Semantics, Equivalence of LTL Formulae, Weak
Until, Release and Positive Normal Form, Fairness, Safety and Liveness in LTL (Definitions
only). Automata Based LTL Model Checking (Algorithms and examples only).
138
Module - 5 (Model Checking in SAL)
Introduction - Introduction to the tool Symbolic Analysis Laboratory (SAL). The Language of
SAL - The expression language, The transition Language, The module language, SAL
Contexts. SAL Examples - Mutual Exclusion, Peterson’s Protocol, Synchronous Bus Arbiter,
Bounded Bakery protocol, Bakery Protocol, Simpson’s Protocol, Stack.
Text Books
1. Christel Baier and Joost-Pieter Katoen, Principles of Model Checking, The MIT Press.
(Modules 1 - 4)
2. Leonardo de Moura, Sam Owre and N. Shankar, The SAL Language Manual, SRI
International (http://sal.csl.sri.com/doc/language-report.pdf, Chapters 1, 3, 4, 5, 6, 7)
(Module 5)
Reference Materials
1. SAL Examples (http://sal.csl.sri.com/examples.shtml) (Module 5)

1. Explain how model checking can be effective in developing a nuclear power plant.
1. Consider a message delivery system. The sender s is trying to send a series of
messages to the receiver r in such a way that the (i+1)st message is sent only after
the ith message is delivered. There is a possibility of error in sending a message
and in that case, s keeps on trying until it is able to send the message. Express this
process as a transition system.
1. Consider a shared memory segment s protected using a mutex lock variable m.
Two processes p1 and p2 are trying to access s. Find the Linear Time properties of
the system which will ensure safety, liveness and fairness.
1. Express the Linear Time properties found in the above system using LTL.
1. Model the above system using SAL and verify that the system avoids deadlock
under all conditions.
2.
139

QP CODE: PAGES: ___
Reg No:_______________
Name:_________________
FIFTH SEMESTER B.TECH DEGREE EXAMINATION(HONORS), MONTH & YEAR
Course Name : Principles of Model Checking
PART-A
1. What is model checking? Give the schematic view of the model checking
approach.
2. Give the transition system of a beverage vending machine.
3. What is an invariant in Linear Time (LT) properties? Give an example.
4. Give 3 Liveness properties in the Mutual Exclusion problem of processes.
5. Find the product automaton for the following Transition System and Non-
Deterministic Finite Automaton (NFA).
6. Differentiate between Deterministic Buchi Automaton and Non-deterministic
140
Buchi Automaton. Give examples of each.
7. Express the following statements about traffic lights in Linear Temporal Logic
(LTL).
a. Once red, the light can not become green immediately.
b. Once red, the light always becomes green eventually after being
yellow for some time.
8. What is Positive Normal Form (PNF) in LTL? Give an example.
9. Write notes on Symbolic Analysis Laboratory (SAL).
10. What is a SAL context? Give an example.

(10x3=30)
Part B
Marks)
11. (a) Explain in detail the various phases of the model checking process.
(7)
(b) Explain the strengths and weaknesses of model checking. (7)
OR
12. (a) Explain the following terms in association with execution of a transition
system. (14)
a. Execution Fragment
b. Maximal and Initial Execution Fragment
c. Execution
d. Reachable States
13. (a) With an example, explain the satisfaction relation for LT properties. (7)
(b) What is trace equivalence in Transition Systems? Give an example to

show that if two transition systems have the same trace equivalence, they (7)
satisfy the same LT properties.
141
14. (a) Give the transition system for the fault tolerant variant of the dining (4)
philosophers problem.
(b) With a suitable example, explain the algorithms to check whether a (10)
Transition System satisfies an invariant or not.
15. (a) Give the algorithm for verifying Regular Safety Properties. Explain with (7)
an appropriate example.
(b) With a suitable example, explain Regular Safety Properties. (7)
OR
16. (a) Explain ⍵ -Regular Properties. (4)
(b) Illustrate how ⍵ -Regular Properties are verified. (10)
17. (a) Explain the syntax of Linear Temporal Logic (LTL). (7)
(b) Explain the semantics of LTL. (7)
OR
18. (a) With an example, give the difference between until and weak until in LTL. (4)
(b) With a suitable example, explain automata based LTL model checking. (10)
19. (a) Explain Peterson’s protocol. What are the LTL properties to be verified to (8)
ensure its correctness?
(b) Write a SAL script for the verification of Peterson’s protocol. (6)
OR
20. (a) Show the SAL model corresponding to Bakery protocol. (8)
(b) List any three Linear Time properties of this model and show their LTL (6 )
specifications.
142
Teaching plan
Module 1 (Introduction to Model Checking) 8 Hours

System Verification – Hard- and Software Verification, Model Checking,
1.1 1 Hour
Characteristics of Model Checking
Transition Systems – Transition System, Direct Predecessors and
1.2 1 Hour
Successors,
1.3 Terminal State, Deterministic Transition System, 1 Hour
Executions - Execution Fragment, Maximal and Initial Execution
1.4 1 Hour
Fragment
1.5 Execution, Reachable States 1 Hour
1.6 Modeling Hardware and Software Systems - Sequential Hardware Circuits 1 Hours
1.7 Data Dependent Systems (Lecture 1) 1 Hour
1.8 Data Dependent Systems (Lecture 2) 1 Hour
Module 2 (Linear Time Properties) 10 Hours
2.1 Linear-Time (LT) Properties - Deadlock 1 Hour
2.2 Linear-Time Behavior - Paths and State Graph, Path Fragment 1 Hour
2.3 Maximal and Initial Path Fragment, Path
2.4 Traces - Trace and Trace Fragment 1 Hour
LT Property, Satisfaction Relation for LT Properties, Trace Equivalence
2.5 1 Hour
and LT Properties
2.6 Invariants 1 Hour
2.7 Safety Properties, Trace Equivalence and Safety properties 1 Hour
2.8 Liveness Property, Safety vs. Liveness Properties 1 Hour
2.9 Fairness, Unconditional, Weak and Strong Fairness 1 Hour
2.10 Fairness Strategies, Fairness and Safety 1 Hour
Module 3 (Regular Properties) 8 Hours
Regular Properties - Model Checking Regular Safety properties -
3.1 1 Hour
Regular Safety property
3.2 Verifying Regular Safety Properties 1 Hour
143
3.3 Automata on Infinite Words - ω-Regular Languages and Properties 1 Hour

Nondeterministic Buchi Automata (NBA), Deterministic Buchi
3.4 1 Hour
Automata (DBA), Generalised Buchi Automata
Model Checking ω-Regular Properties - Persistence Properties and
3.5 1 Hour
Product - Lecture 1
3.6 Persistence Properties and Product - Lecture 2 1 Hour
3.7 Nested Depth-First Search (Lecture 1) 1 Hour
Module 4 (Linear Time Logic) 9 Hours
4.1 Linear Temporal Logic – Linear Temporal Logic (LTL) - Syntax 1 Hour
4.2 Semantics - Lecture 1 1 Hour
4.4 Equivalence of LTL Formulae, Weak Until 1 Hour
4.5 Release and Positive Normal Form 1 Hour
4.6 Fairness, Safety and Liveness in LTL 1 Hour
4.7 Automata Based LTL Model Checking - Lecture 1 1 Hour
Module 5 (Model Checking in SAL) 10 Hours
Introduction - Introduction to the tool Symbolic Analysis Laboratory
5.1 1 Hour
(SAL).
The Language of SAL - The expression language, The transition
5.2 1 Hour
Language
5.3 The module language, SAL Contexts. 1 Hour
5.4 SAL Examples - Mutual Exclusion 1 Hour

5.5 Peterson’s Protocol 1 Hour
5.6 Synchronous Bus Arbiter 1 Hour
5.7 Bounded Bakery protocol, 1 Hour
5.8 Bakery Protocol 1 Hour
144
5.9 Simpson’s Protocol 1 Hour

5.10 Stack 1 Hour
145
SEMESTER VI
146
CST COMPILER Category L T P Credit Year of Introduction

302 DESIGN PCC 3 1 0 4 2019
Preamble:
The purpose of this course is to create awareness among students about the phases of a compiler
and the techniques for designing a compiler. This course covers the fundamental concepts of
different phases of compilation such as lexical analysis, syntax analysis, semantic analysis,
intermediate code generation, code optimization and code generation. Students can apply this
knowledge in design and development of compilers.
Prerequisite: Sound knowledge in Data Structures, Formal Languages & Automata Theory.
Explain the phases in compilation process(lexical analysis, syntax analysis, semantic

CO1 analysis, intermediate code generation, code optimization and code generation) and
model a lexical analyzer (Cognitive Knowledge Level: Apply)
Model language syntax using Context Free Grammar and develop parse tree
CO2 representation using leftmost and rightmost derivations (Cognitive Knowledge
Level: Apply)
Compare different types of parsers(Bottom-up and Top-down) and construct parser

CO3
for a given grammar (Cognitive Knowledge Level: Apply)
Build Syntax Directed Translation for a context free grammar, compare various
CO4 storage allocation strategies and classify intermediate representations (Cognitive
Illustrate code optimization and code generation techniques in compilation

CO5
147
CO1
CO2
CO3
CO4
CO5

problems
Assessment Pattern

Examination Marks
Remember 20 20 20
Understand 40 40 40
Apply 40 40 40
Analyze
148
Evaluate
Create
Mark Distribution
Total Marks CIE ESE Marks ESE Duration

Marks
150 50 100 3 hours


shall be preferably conducted after completing the remaining part of the syllabus. There will be
two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
question adding up to 15 marks for part A. Students should answer all questions from Part A. Part
B contains 7 questions (preferably, 3 questions each from the completed modules and 1 question
from the partly completed module), each with 7 marks. Out of the 7 questions, a student should
answer any 5.

149
Syllabus
Module - 1 (Introduction to compilers and lexical analysis)
Analysis of the source program - Analysis and synthesis phases, Phases of a compiler. Compiler
writing tools. Bootstrapping. Lexical Analysis - Role of Lexical Analyser, Input Buffering,
Specification of Tokens, Recognition of Tokens.
Module - 2 (Introduction to Syntax Analysis)
Role of the Syntax Analyser – Syntax error handling. Review of Context Free Grammars -
Derivation and Parse Trees, Eliminating Ambiguity. Basic parsing approaches - Eliminating left
recursion, left factoring. Top-Down Parsing - Recursive Descent parsing, Predictive Parsing,
LL(1) Grammars.
Module - 3 (Bottom-Up Parsing)
Handle Pruning. Shift Reduce parsing. Operator precedence parsing (Concept only). LR parsing -
Constructing SLR, LALR and canonical LR parsing tables.
Module - 4 (Syntax directed translation and Intermediate code generation)
Syntax directed translation - Syntax directed definitions, S-attributed definitions, L-attributed

definitions, Bottom-up evaluation of S-attributed definitions. Run-Time Environments - Source
Language issues, Storage organization, Storage-allocation strategies. Intermediate Code
Generation - Intermediate languages, Graphical representations, Three-Address code, Quadruples,
Triples.
Module 5 – (Code Optimization and Generation)
Code Optimization - Principal sources of optimization, Machine dependent and machine

independent optimizations, Local and global optimizations. Code generation - Issues in the design
of a code generator, Target Language, A simple code generator.
Text Books
1. Aho A.V., Ravi Sethi and D. Ullman. Compilers – Principles Techniques and Tools,
Addison Wesley, 2006.
Reference Books
1. D.M.Dhamdhere, System Programming and Operating Systems, Tata McGraw Hill &
Company, 1996.
2. Kenneth C. Louden, Compiler Construction – Principles and Practice, Cengage Learning
Indian Edition, 2006.
150
3. Tremblay and Sorenson, The Theory and Practice of Compiler Writing, Tata McGraw Hill
& Company,1984.

1) Explain the phases of a compiler with a neat diagram.
2) Define a token. Identify the tokens in the expression a := b + 10.

1) Illustrate the process of eliminating ambiguity, left recursion and left factoring the grammar.
2) Is the following grammar ambiguous? If so eliminate ambiguity.
E→E + E | E*E |(E) | id

1. What are the different parsing conflicts in the SLR parsing table?
2. Design a recursive descent parser for the grammar
E→E + T | T
T→T*F | F
F→(E) | id
3. Construct canonical LR(0) collection of items for the grammar below.
S→L=R
S→ R
L→*R
L → id
R→L
Also identify a shift reduce conflict in the LR(0) collection constructed above.

1. Write the quadruple and triple representation of the following intermediate code
R1 = C * D
R2 = B + R1
A = R2
B[0] = A
151
2. Differentiate S-attributed Syntax Directed Translation(SDT) and L-attributed SDT. Write

S - attributed SDT for a simple desktop calculator
1. List out the examples of function preserving transformations.
2. What are the actions performed by a simple code generator for a typical three-address
statement of the form x: = y op z.

QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4

SIXTH SEMESTER B.TECH DEGREE EXAMINATION , MONTH & YEAR
Course Name: Compiler Design
Max.Marks:100 Duration: 3
Hours
PART A
1. Specify the analysis and synthesis parts of compilation.
2. Define the terms token, lexemes and patterns with examples.
3. Is the grammar S --> S | (S) S / Ɛ ambiguous? Justify your answer.
4. What is left recursive grammar? Give an example. What are the steps in removing
left recursion?
5. Compare different bottom-up parsing techniques.
6. What are the possible actions of a shift reduce parser.
152
7. Differentiate synthesized and inherited attributes with examples.
8. Translate a[i] = b * c – b * d, to quadruple.
9. What is the role of peephole optimization in the compilation process
10. What are the issues in the design of a code generator

(10x3=30)
Part B
11. (a) Explain the different phases of a compiler with a running example.
(9)
(b) List and explain any three compiler construction tools.

(5)
OR
12. (a) What is a regular definition? Give the regular definition of an unsigned integer
(7)
(b) Express the role of transition diagrams in recognition of tokens. (7)
13. (a) What is Recursive Descent parsing? List the challenges in designing such a
parser? (4)
(b) Consider the following grammar

E-→E or T | T (10)
T→ T and F |F
F→not F | (E) | true | false
(i) Remove left recursion from the grammar.
(ii) Construct a predictive parsing table.
(iii) Justify the statement “The grammar is LL (1)”.
OR
153
14. (a) What is Recursive Descent parsing? List the problems in designing such a (4)
parser
(b) Design a recursive descent parser for the grammar S→cAd, A→ab/ b (5)
Find the FIRST and FOLLOW of the non-terminals S, A and B in the (5)
grammar
S→aABe
A→Abc | b
B→d
15. (a) Construct the LR(0) set of items and their GOTO function for the grammar (10)
S→S S + | S S * | a
(b) Is the grammar SLR? Justify your answer (4)
OR
16. (a) Identify LR(1) items for the grammar

S→ CC (7)
C→ cC | d
(b) Construct LALR table for the above grammar (7)
17. (a) Design a Syntax Directed Translator(SDT) for the arithmetic expression (4 * (8)
7 + 19) * 2 and draw an annotated parse tree for the same.
(b) Consider the grammar with following translation rules and E as the start (6)
symbol
E → E1 # T {E.value=E1.value x T.value ;}
| T{E.value=T.value ;}
T → T1 & F{ T.value=T1.value + F.value ;}
| F{T.value= F.value ; }
F → num { F.value=num. lvalue ;}
Compute E.value for the root of the parse tree for the expression
2#3 & 5# 6 &7
154
OR
18. (a) Write Syntax Directed Translator ( SDT) and parse tree for infix to postfix (8)
translation of an expression.
(b) Explain the storage allocation strategies. (6)
19. (a) Describe the principal sources of optimization (7)
(b) Illustrate the optimization of basic blocks with examples. (7)
OR
20. (a) Write the Code Generation Algorithm and explain the getreg function (6)
(b) Generate target code sequence for the following statement (8 )

d := (a-b)+(a-c)+(a-c).
Teaching Plan
No. of
No Contents Lecture
Hours
Module - 1(Introduction to Compilers and lexical analyzer) (8 hours)
1.1 Introduction to compilers, Analysis of the source program 1 hour

1.2 Phases of the compiler – Analysis Phases 1 hour
1.3 Phases of the Compiler - Synthesis Phases 1 hour
1.4 Symbol Table Manager and Error Handler 1 hour
1.5 Compiler writing tools, bootstrapping 1 hour
1.6 The role of Lexical Analyzer , Input Buffering 1 hour
1.7 Specification of Tokens 1 hour
1.8 Recognition of Tokens 1 hour
155
Module – 2 (Introduction to Syntax Analysis) (10 hours)

2.1 Role of the Syntax Analyser, Syntax error handling 1 hour
2.2 Review of Context Free Grammars 1 hour
2.3 Parse Trees and Derivations 1 hour
2.4 Grammar transformations, Eliminating ambiguity 1 hour
2.5 Eliminating left recursion 1 hour
2.6 Left factoring the grammar 1 hour
2.7 Recursive Descent parsing 1 hour
2.8 First and Follow 1 hour
2.9 Predictive Parsing table constructor 1 hour
2.10 LL(1) Grammars 1 hour
Module - 3 (Bottom up parsing) (9 hours)
3.1 Bottom-up parsing - Handle Pruning 1 hour
3.2 Shift Reduce parsing 1 hour
3.3 Operator precedence parsing (Concept only) 1 hour
3.4 LR parsing , SLR Grammar, items 1 hour
3.5 Augmented Grammar, Canonical collection of LR(0) items 1 hour
3.6 SLR Parser Table Construction 1 hour
3.7 Constructing Canonical LR Parsing Tables 1 hour
3.8 Constructing LALR Parsing Tables 1 hour
3.9 LALR parser 1 hour
Module - 4 (Syntax Directed Translation and Intermediate code Generation) (9 hours)
4.1 Syntax directed definitions 1 hour
4.2 S- attributed definitions, L- attributed definitions 1 hour
4.3 Bottom- up evaluation of S- attributed definitions. 1 hour
4.4 Source Language issues 1 hour
4.5 Storage organization 1 hour
156
4.6 Storage- allocation strategies 1 hour

4.7 Intermediate languages , Graphical representations 1 hour
4.8 Three-Address code 1 hour
4.9 Quadruples, Triples 1 hour

Module - 5 (Code Optimization and Generation) (9 hours)
5.1 Principal sources of optimization 1 hour
5.2 Machine dependent optimizations 1 hour
5.3 Machine independent optimizations 1 hour
5.4 Local optimizations 1 hour
5.5 Global optimizations 1 hour
5.6 Issues in the design of a code generator – Lecture 1 1 hour
5.7 Issues in the design of a code generator – Lecture 2 1 hour
5.8 Target Language 1 hour
5.9 Design of a simple code generator. 1 hour
157
Year of
Category L T P Credit Introduction
CST COMPUTER GRAPHICS
304 AND IMAGE
PCC 3 1 0 4 2019
PROCESSING
Preamble:
The purpose of this course is to make awareness about strong theoretical relationships between
computer graphics and image processing. This course helps the learner to understand three-
dimensional environment representation in a computer, transformation of 2D/3D objects, basic
mathematical techniques and algorithms used to build useful applications, imaging, and image
processing techniques. The study of computer graphics and image processing develops the ability
to create image processing frameworks for different domains and develops algorithms for
emerging display technologies.
Prerequisite: A sound knowledge of Mathematics and a programming language.

CO# CO
Describe the working principles of graphics devices(Cognitive Knowledge level:
CO1 Understand)
Illustrate line drawing, circle drawing and polygon filling algorithms(Cognitive

CO2 Knowledge level: Apply)
Demonstrate geometric representations, transformations on 2D & 3D objects,

CO3 clipping algorithms and projection algorithms(Cognitive Knowledge level: Apply)
Summarize visible surface detection methods(Cognitive Knowledge level:

CO4 Understand)
Summarize the concepts of digital image representation, processing and

CO5 demonstrate pixel relationships(Cognitive Knowledge level: Apply)
Solve image enhancement and segmentation problems using spatial domain

CO6 techniques(Cognitive Knowledge level: Apply)
158
0 2
CO1
CO2
CO3
CO4
CO5
CO6


Assessment Pattern
Bloom’s End Semester
Category Test 1 (%) Test 2 (%) Examination
Marks (%)
Remember 30 30 30
Understand 30 30 30
159
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution

150 50 100 3

Attendance 10 marks
Continuous Assessment Tests (Average of SeriesTests1& 2) 25 marks

student should answer any5.

contains 2 full questions from each module of which student should answer any one full question.
Each question can have maximum 2 sub-divisions and carries 14 marks.
160
Syllabus
Module – 1(Basics of Computer graphics and Algorithms)
Basics of Computer Graphics and its applications. Video Display devices- Refresh Cathode Ray
Tubes, Random Scan Displays and systems, Raster scan displays and systems. Line drawing
algorithms- DDA, Bresenham’s algorithm. Circle drawing algorithms- Midpoint Circle generation
algorithm, Bresenham’s algorithm.
Module - 2(Filled Area Primitives and transformations)
Filled Area Primitives- Scan line polygon filling, Boundary filling and flood filling. Two
dimensional transformations-Translation, Rotation, Scaling, Reflection and Shearing, Composite
transformations, Matrix representations and homogeneous coordinates. Basic 3D transformations.
Module - 3 (Clipping and Projections)
Window to viewport transformation. Cohen Sutherland Line clipping algorithm. Sutherland
Hodgeman Polygon clipping algorithm. Three dimensional viewing pipeline. Projections- Parallel
and Perspective projections. Visible surface detection algorithms- Depth buffer algorithm, Scan
line algorithm.
Module - 4 (Fundamentals of Digital Image Processing)
Introduction to Image processing and applications. Image as 2D data. Image representation in
Gray scale, Binary and Colour images. Fundamental steps in image processing. Components of
image processing system. Coordinate conventions. Sampling and quantization. Spatial and Gray
Level Resolution. Basic relationship between pixels– neighbourhood, adjacency, connectivity.
Fundamentals of spatial domain-convolution operation.
Module - 5 (Image Enhancement in Spatial Domain and Image Segmentation)
Basic gray level transformation functions - Log transformations, Power-Law transformations,
Contrast stretching. Histogram equalization. Basics of spatial filtering - Smoothing spatial filter-
Linear and nonlinear filters, and Sharpening spatial filters-Gradient and Laplacian.
Fundamentals of Image Segmentation. Thresholding - Basics of Intensity thresholding and Global
Thresholding. Region based Approach - Region Growing, Region Splitting and Merging. Edge
Detection - Edge Operators- Sobel and Prewitt.
Text Book
1. Donald Hearn and M. Pauline Baker, Computer Graphics, PHI, 2e, 1996
2. Rafael C. Gonzalez and Richard E. Woods, Digital Image Processing. Pearson, 4e, 2017
References
1) William M. Newman and Robert F. Sproull, Principles of Interactive Computer Graphics.
McGraw Hill, 2001
161
2) Zhigang Xiang and Roy Plastock, Computer Graphics (Schaum’s outline Series), McGraw
Hill, 2019.
3) David F. Rogers , Procedural Elements for Computer Graphics, Tata McGraw Hill,2001.
4) M. Sonka, V. Hlavac, and R. Boyle, Image Processing, Analysis, and Machine Vision,
Thomson India Edition, 4e, 2017.

1. Compare the working principle of raster scan systems and random scan systems.
2. How much time is spent scanning across each row of pixels during screen refresh on a
raster system with resolution of 1280*1024 and a refresh rate of 60 frames per second?
1. Rasterize the line with end points(2,3) and (5,8) using Bresenham’s line drawing
algorithm.
2. Explain how the 4-connected area filling approach differs from 8- connected area filling in
boundary filling algorithm
1. Rotate a triangle ABC 45 degree counter clockwise about the pivot point (10,3), where the
position vector of the coordinate ABC is given as A(4,1), B(5,2) and C(4,3).
2. Given a clipping window A(20,20), B(60,20), C(60,40) and D(20,40). Using Cohen
Sutherland algorithm, find the visible portion of the line segment joining the points
P(40,80) and Q(120,30)
1. Explain scan line algorithm for detecting visible surfaces in an object.
1. Give an image representation model and describe how the representation changes in
grayscale, binary and colour images.
2. Consider an image segment shown below.
3 1 2 1 (q)
2 2 0 2
1 2 1 1
(p) 1 0 1 2
(a) Let V={0,1} and compute the length of the shortest 4-,8- and m- path between p and
q. If a particular path does not exist between these two points , explain why?
(b) Repeat for V={1,2}.
162
3. The spatial resolution of an image is given by 128 X 128.What is its storage requirements if
it is represented by 64 gray levels?
1. A skilled medical technician is charged with the job of inspecting a certain class of
monochrome images generated by electronic microscope. To facilitate the inspection, the
technician uses image processing aids. However when he examines the images he finds the
following problems.
(a) Presence of bright isolated dots that are not of interest.
(b) Lack of sharpness
(c) Poor contrast
Identify the sequence of preprocessing steps that the technician may use to overcome the
above mentioned problems and explain it.
2. A 4x4, 4 bits/pixel original image is given by

10 12 8 9
10 12 12 14
12 13 10 9
14 12 10 12
(a) Apply histogram equalisation to the image by rounding the resulting image pixels to
integers
(b) Sketch the histogram of the original image and the histogram-equalised image.
3. You have Sobel operator and Laplacian operator for edge detection. Which operator will
you select for edge detection in the case of noisy image? Explain.(Assignment)
163
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
SIXTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Name: Computer Graphics and Image Processing
Max. Marks : 100 Duration: 3 Hours
PART A
1. Justify the approach of using integer arithmetic in Bresenham’s line drawing

algorithm.
2. Consider a raster system with a resolution of 1024*1024. What is the size of the
raster needed to store 4 bits per pixel? How much storage is needed if 8 bits per
pixel are to be stored?
3. Show that two successive reflections about either of the coordinate axes is
equivalent to a single rotation about the coordinate origin.
4. Determine a sequence of basic transformations that are equivalent to the x-

direction shearing matrix.
5. Find the window to viewport normalization transformation with window lower

left corner at (1,1) and upper right corner at (2,6).
6. Find the orthographic projection of a unit cube onto the x=0, y=0 and z=0 plane.
7. Define Sampling and Quantization of an image.
164
8. Give any three applications of digital image processing.
9. A captured image appears very dark because of wrong lens aperture setting.
Describe an enhancement technique which is appropriate to enhance such an
image.
10. Suggest an approach of thresholding that should be used in case of uniform

illumination. (10x3=30)
Part B
11. (a) Write Midpoint circle drawing algorithm and use it to plot a circle with (10)
radius=20 and center is (50,30).
(b) Draw the architecture of raster scan display systems and explain its working (4)
principle.
OR
12. (a) Derive the initial decision parameter of Bresenham’s line drawing algorithm (10)
and use the algorithm to rasterize a line with endpoints (2,2) and (10,10).
(b) Explain the working principle of color CRT monitors with suitable (4)
illustrations.
13. (a) Compare boundary fill algorithm and flood fill algorithm. (5)
(b) Reflect a triangle ABC about the line 3x-4y+8=0. The position vector of the (9)
coordinate ABC is given as A(4,1), B(5,2) and C(4,3).
OR
14. (a) Explain the need of using vanishing points in projections. (4)
(b) Explain Cohen-Sutherland line clipping algorithm. Use the algorithm to clip (10)
line P1(70, 20) and P2(100,10) against a window lower left hand corner
(50,10) and upper right hand corner (80,40).
15. (a) Describe Sutherland Hodegman polygon clipping algorithm and what are its (7)
165
limitations.
(b) Explain how visible surfaces can be detected using depth buffer algorithm. (7)
OR
16. (a) Describe Sutherland Hodegman polygon clipping algorithm and what are its (7)
limitations.
(b) Explain how visible surfaces can be detected using depth buffer algorithm. (7)
17. (a) Explain the components of an image processing system with suitable diagram (9)
(b) Define Resolution of an image. Explain the spatial and gray level resolution (5)
of an image with an example.
OR
18. (a) Define 4-adjacency, 8 adjacency and m-adjacency. Consider the image (7)
segment shown.
4 2 3 2 (q)
3 3 1 3
2 3 2 2
(p) 2 1 2 3
Let V={1,2} and compute the length of the shortest 4- ,8- and m- path
between p and q. If a particular path does not exist between these two points,
explain why?
(b) Using any one application, explain the steps involved in image processing. (7)
19. (a) A 5x5 image patch is shown below. Compute the value of the marked pixel if (4)
it is smoothened by a 3x3 average filter and median filter.
(b) Define Image segmentation and describe in detail method of edge and region (10)
based segmentation technique.
166
OR
20. (a) Distinguish between smoothing and sharpening filters in terms of (10)
(i) Functionality
(ii) Types
(iii) Applications
(iv) Mask Coefficients
(b) Describe how an image is segmented using split and merge technique in (8 )
association with the region adjacency graph.
Teaching Plan
No Contents No of Lecture
Hrs (45 hrs)
Module – 1 (Basics of Computer Graphics and Algorithms) (9 hrs)
1.1 Basics of Computer Graphics and applications 1 hour
1.2 Refresh Cathode Ray Tubes 1 hour
1.3 Random Scan Displays and systems 1 hour
1.4 Raster scan displays and systems 1 hour
1.5 DDA Line drawing Algorithm 1 hour
1.6 Bresenham’s line drawing algorithm 1 hour
1.7 Midpoint Circle generation algorithm 1 hour
1.8 Bresenham’s Circle generation algorithm 1 hour
1.9 Illustration of line drawing and circle drawing algorithms 1 hour
Module - 2 (Filled Area Primitives and transformations) (9 hrs)
2.1 Scan line polygon filling 1 hour
2.2 Boundary filling and flood filling 1 hour
2.3 Basic 2D transformations-Translation 1 hour
167
2.4 Basic 2D transformations- Rotation and Scaling 1 hour
2.5 Reflection and Shearing 1 hour
2.6 Composite transformations 1 hour
2.7 Matrix representations and homogeneous coordinates 1 hour
2.8 Basic 3D transformation-Translation and scaling 1 hour
2.9 Basic 3D transformation-Rotation 1 hour
Module - 3 (Clipping and Projections) (8 hrs)
3.1 Window to viewport transformation 1 hour
3.2 Cohen Sutherland Line clipping algorithm 1 hour
3.3 Sutherland Hodgeman Polygon clipping algorithm 1 hour
3.4 Practice problems on Clipping algorithms 1 hour
3.5 Three dimensional viewing pipeline, Projections-Parallel projections 1 hour
3.6 Projections- Perspective projections 1 hour
3.7 Visible surface detection algorithms- Depth buffer algorithm 1 hour
3.8 Scan line visible surface detection algorithm 1 hour
Module - 4 (Fundamentals of Digital Image Processing) (8 hrs)
4.1 Introduction to Image processing-Image as a 2D data, Image 1 hour

representation-Gray scale, Binary and Colour images.
4.2 Fundamental steps in image processing and applications 1 hour
4.3 Components of image processing system 1 hour
4.4 Coordinate conventions, Sampling and quantization, Spatial and Gray 1 hour
Level Resolution
4.5 Basic relationship between pixels – neighbourhood, adjacency, 1 hour

connectivity
4.6 Illustration of basic relationship between pixels– neighbourhood, 1 hour
168
adjacency, connectivity
4.7 Fundamentals of spatial domain - Convolution operation 1 hour
4.8 Illustration of Convolution operation 1 hour
Module - 5 (Image Enhancement in spatial domain and Image Segmentation) ( 11 hrs)
5.1 Basic gray level transformation functions- Log transformations. 1 hour
5.2 Power-Law transformations, Contrast stretching 1 hour
5.3 Histogram equalization 1 hour
5.4 Illustration of Histogram equalization 1 hour
5.5 Basics of spatial filtering, Smoothing spatial filter- Linear and 1 hour
nonlinear filters
5.6 Sharpening spatial filtering-Gradient filter mask 1 hour
5.7 Sharpening spatial filtering-Laplacian filter mask 1 hour
5.8 Fundamentals of Image Segmentation, Basics of Intensity thresholding, 1 hour

Basic Global Thresholding
5.9 Region Based Approach- Region Growing, Region Splitting and 1 hour1
Merging
5.10 Basics of Edge Detection 1 hour
5.11 Sobel and Prewitt edge detection masks 1 hour
169
ALGORITHM Year of
CST Introduction
ANALYSIS AND
306 DESIGN PCC 3 1 0 4 2019
Preamble:
The course introduces students to the design of computer algorithms, as well as analysis of
algorithms. Algorithm design and analysis provide the theoretical backbone of computer science
and are a must in the daily work of the successful programmer. The goal of this course is to
provide a solid background in the design and analysis of the major classes of algorithms. At the
end of the course students will be able to develop their own versions for a given computational
task and to compare and contrast their performance.
Prerequisite:
Strong Foundation in Mathematics, Programming in C, Data Structures and Graph Theory.
CO# CO
Analyze any given algorithm and express its time and space complexities in
CO1
asymptotic notations. (Cognitive Level: Apply)
Derive recurrence equations and solve it using Iteration, Recurrence Tree,
CO2 Substitution and Master’s Method to compute time complexity of algorithms.
(Cognitive Level: Apply)
Illustrate Graph traversal algorithms & applications and Advanced Data
CO3 structures like AVL trees and Disjoint set operations. (Cognitive Level:
Apply)
Demonstrate Divide-and-conquer, Greedy Strategy, Dynamic programming,
CO4 Branch-and Bound and Backtracking algorithm design techniques
(Cognitive Level: Apply)
Classify a problem as computationally tractable or intractable, and discuss
CO5
strategies to address intractability (Cognitive Level: Understand)
Identify the suitable design strategy to solve a given problem. (Cognitive
CO6
Level: Analyze)
170
CO1
CO2
CO3
CO4
CO5 √
CO6


problems
Assessment Pattern
Category Test 1 (%) Test 2 (%) Marks (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
171
Analyze
Evaluate
Create
Mark Distribution

150 50 100 3

Attendance 10 marks


172
Syllabus
Module-1 (Introduction to Algorithm Analysis)
Characteristics of Algorithms, Criteria for Analysing Algorithms, Time and Space Complexity -
Best, Worst and Average Case Complexities, Asymptotic Notations - Big-Oh (O), Big- Omega
(Ω), Big-Theta (Θ), Little-oh (o) and Little- Omega (ω) and their properties. Classifying functions
by their asymptotic growth rate, Time and Space Complexity Calculation of simple algorithms.
Analysis of Recursive Algorithms: Recurrence Equations, Solving Recurrence Equations –
Iteration Method, Recursion Tree Method, Substitution method and Master’s Theorem (Proof not
required).
Module–2 (Advanced Data Structures and Graph Algorithms)
Self Balancing Tree - AVL Trees (Insertion and deletion operations with all rotations in detail,
algorithms not expected); Disjoint Sets- Disjoint set operations, Union and find algorithms.
DFS and BFS traversals - Analysis, Strongly Connected Components of a Directed graph,
Topological Sorting.
Module–3 (Divide & Conquer and Greedy Strategy)
The Control Abstraction of Divide and Conquer- 2-way Merge sort, Strassen’s Algorithm for
Matrix Multiplication-Analysis. The Control Abstraction of Greedy Strategy- Fractional Knapsack
Problem, Minimum Cost Spanning Tree Computation- Kruskal’s Algorithms - Analysis, Single
Source Shortest Path Algorithm - Dijkstra’s Algorithm-Analysis.
Module-4 (Dynamic Programming, Back Tracking and Branch & Bound))
The Control Abstraction- The Optimality Principle- Matrix Chain Multiplication-Analysis, All
Pairs Shortest Path Algorithm - Floyd-Warshall Algorithm-Analysis. The Control Abstraction of
Back Tracking – The N Queen’s Problem. Branch and Bound Algorithm for Travelling Salesman
Problem.
Module-5 (Introduction to Complexity Theory)
Tractable and Intractable Problems, Complexity Classes – P, NP, NP- Hard and NP-Complete
Classes- NP Completeness proof of Clique Problem and Vertex Cover Problem- Approximation
algorithms- Bin Packing, Graph Coloring. Randomized Algorithms (Definitions of Monte Carlo
and Las Vegas algorithms), Randomized version of Quick Sort algorithm with analysis.
Text Books
1. T.H.Cormen, C.E.Leiserson, R.L.Rivest, C. Stein, Introduction to Algorithms, 2nd Edition,
Prentice-Hall India (2001)
2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, “Fundamentals of Computer
Algorithms”, 2nd Edition, Orient Longman Universities Press (2008)
173
3. Sara Baase and Allen Van Gelder ―Computer Algorithms, Introduction to Design and
Analysis, 3rd Edition, Pearson Education (2009)
Reference Books
1. Jon Kleinberg, Eva Tardos, “Algorithm Design”, First Edition, Pearson (2005)
2. Robert Sedgewick, Kevin Wayne, “Algorithms”,4th Edition Pearson (2011)
3. GIlles Brassard, Paul Brately, “Fundamentals of Algorithmics”, Pearson (1996)
4. Steven S. Skiena, “The Algorithm Design Manual”, 2nd Edition, Springer(2008)

1. Is 2n+1 = O(2n) ? Is 22n = O(2n)? Justify your answer.
2. What is the need of asymptotic analysis in calculating time complexity? What are the
notations
used for asymptotic analysis?
3. Calculate the time complexity for addition of two matrices.
4. Define time complexity and space complexity. Write an algorithm for adding n natural
numbers and analyse the time and space requirements of the algorithm.

1. State Master’s theorem for solving recurrences.
2. Solve the recurrence T(n) = 3T(n-2), using iteration method
3. State the conditions in recurrences where Master Theorem is not applicable.
4. Solve the following recurrence equations using Master’s theorem.
a) T (n) = 8T(n/2) + 100 n2
b) T (n) = 2T(n/2) + 10 n
5. Using Recursion Tree method, Solve T(n)= 2T(n/10)+ T(9n/10)+n. Assume constant time for
small values of n.

1. Explain the rotations performed for insertion in AVL tree with example.
2. Write down BFS algorithm and analyse the time complexity. Perform BFS traversal on the
given graph starting from node A. If multiple node choices are available for next travel,
choose the next node in alphabetical order.
174
3. Find the minimum and maximum height of any AVL-tree with 7 nodes? Assume that the
height of a tree with a single node is 0. (3)
4. Find any three topological orderings of the given graph.

1. Give the control abstraction for Divide and Conquer method.
2. Construct the minimum spanning tree for the given graph using Kruskal’s algorithm. Analyse
the complexity of the algorithm.
3. Compare Divide and Conquer and Dynamic programming methodologies

4. What is Principle of Optimality?
5. Define Travelling Salesman Problem (TSP). Apply branch and bound algorithm to solve TSP
for the following graph, assuming the start city as ‘a’. Draw the state space tree.

1. Compare Tractable and Intractable Problems
2. With the help of suitable code sequence convince Vertex Cover Problem is an example of
NP-Complete Problem
175
3. Explain Vertex Cover problem using an example. Suggest an algorithm for finding Vertex
Cover of a graph.
4. Write short notes on approximation algorithms.
5. Compare Conventional quick sort algorithm and Randomized quicksort with the help of a
suitable example?
Course Outcome 6 (CO6): (CO attainment through assignment only, not meant for
examinations)
Choosing the best algorithm design strategy for a given problem after applying applicable design
strategies – Sample Problems Given.
1. Finding the Smallest and Largest elements in an array of ‘n’ numbers
2. Fibonacci Sequence Generation.
3. Merge Sort
4. Travelling Sales Man Problem
5. 0/1 Knapsack Problem

QP CODE:
Reg No: _______________

Name: _________________ PAGES : 4

Course Name: Algorithm Analysis and Design
PART A
1. Define asymptotic notation? Arrange the following functions in increasing order

of asymptotic growth rate.
n3, 2n, log n3, 2100, n2 log n, nn, log n, n0.3, 2logn
176
2. State Master’s Theorem. Find the solution to the following recurrence equations
using Master’s theorem.
a) T (n) = 8T(n/2) + 100 n2
b) T (n) = 2T(n/2) + 10 n
3. Find any two topological ordering of the DAG given below.
4. Show the UNION operation using linked list representation of disjoint sets.
5. Write the control abstraction of greedy strategy to solve a problem.
6. Write an algorithm based on divide-and-conquer strategy to search an element in a

given list. Assume that the elements of list are in sorted order.
7. List the sequence of steps to be followed in Dynamic Programming approach.
8. Illustrate how optimal substructure property could be maintained in Floyd-

Warshall algorithm.
9. Differentiate between P and NP problems.
10. Specify the relevance of approximation algorithms.

(10x3=30)
Part B
11. (a) Define Big O, Big Ω and Big Ɵ Notation and illustrate them graphically. (7)
(b) Solve the following recurrence equation using recursion tree method (7)
T(n) = T(n/3) + T(2n/3) + n , where n>1
T(n) = 1, Otherwise
OR
177
12. (a) Explain the iteration method for solving recurrences and solve the following (7)
recurrence equation using iteration method.
T(n) = 3T(n/3) + n; T(1) = 1
(b) Determine the time complexities of the following two functions fun1( ) and (7)
fun2( ).
i) int fun1(int n)
{
if (n <= 1) return n;
return 2*fun1(n-1);
}
ii) int fun2 (int n)
{
if (n <= 1) return n;
return fun2 (n-1) + fun2 (n-1)
}
13. (a) Write DFS algorithm and analyse its time complexity. Illustrate the (7)
classification of edges in DFS traversal.
(b) Find the strongly connected components of the digraph given below: (7)
OR
14. (a) Illustrate the advantage of height balanced binary search trees over binary (7)
search trees? Explain various rotations in AVL trees with example.
(b) Perform the following operations in the given AVL trees. (7)
i) Insert 70 ii) Delete 55
178
15. (a) State Fractional Knapsack Problem and write Greedy Algorithm for (7)
Fractional Knapsack Problem.
(b) Find the optimal solution for the following Fractional Knapsack problem. (7)
Given the number of items(n) = 7, capacity of sack(m) = 15,
W={2,3,5,7,1,4,1} and P = {10,5,15,7,6,18,3}
OR
16. (a) Write and explain merge sort algorithm using divide and conquer strategy (7)
using the data {30, 19, 35, 3, 9, 46, 10}. Also analyse the time complexity.
(b) Write the pseudo code for Dijkstra’s algorithm. Compute the shortest distance (7)
from vertex 1 to all other vertices using Dijkstra’s algorithm.
17. (a) Write Floyd-Warshall algorithm and analyse its complexity. (5)
(b) Write and explain the algorithm to find the optimal parenthesization of matrix (9)
chain product whose sequence of dimension is 4x10,10x3, 3x12,12x20.
OR
18. (a) Explain the concept of Backtracking method using 4 Queens problem. (7)
179
(b) Define Travelling Salesman Problem (TSP). Apply branch and bound (7)
algorithm to solve TSP for the following graph, assuming the start city as ‘a’.
Draw the state space tree.
19. (a) State bin packing problem? Explain the first fit decreasing strategy (7)
(b) Prove that the Clique problem is NP-Complete. (7)
OR
20. (a) Explain the need for randomized algorithms. Differentiate Las Vegas and (6)
Monte Carlo algorithms.
(b) Explain randomized quicksort and analyse the expected running time of (9 )
randomized quicksort with the help of a suitable example?
Teaching Plan
No. of Hours
No Topic
(45 hrs)
Module -1 (Introduction to Algorithm Analysis) 9 hrs.
1.1 Introduction to Algorithm Analysis: Characteristics of Algorithms. 1 hour
1.2 Criteria for Analysing Algorithms, Time and Space Complexity - Best, 1 hour
Worst and Average Case Complexities.
1.3 Asymptotic Notations - Properties of Big-Oh (O), Big- Omega (Ω), Big- 1 hour
Theta (Θ), Little-Oh (o) and Little- Omega (ω).
1.4 Illustration of Asymptotic Notations 1 hour
180
1.5 Classifying functions by their asymptotic growth rate 1 hour
1.6 Time and Space Complexity Calculation of algorithms/code segments. 1 hour
1.7 Analysis of Recursive Algorithms: Recurrence Equations, 1 hour

Solving Recurrence Equations – Iteration Method.
1.8 Recursion Tree Method 1 hour
1.9 Substitution method and Master’s Theorem and its Illustration. 1 hour
Module-2 (Advanced Data Structures and Graph Algorithms) 10 Hrs.
2.1 Self Balancing Trees - Properties of AVL Trees, Rotations of AVL Trees 1 hour
2.2 AVL Trees Insertion and Illustration 1 hour
2.3 AVL Trees Deletion and Illustration 1 hour
2.4 Disjoint set operations. 1 hour
2.5 Union and find algorithms. 1 hour
2.6 Illustration of Union and find algorithms 1 hour
2.7 Graph Algorithms: BFS traversal, Analysis. 1 hour
2.8 DFS traversal, Analysis. 1 hour
2.9 Strongly connected components of a Directed graph. 1 hour
2.10 Topological Sorting. 1 hour
Module-3 (Divide & Conquer and Greedy Method) 8 Hrs
3.1 Divide and Conquer: The Control Abstraction. 1 hour
3.2 2-way Merge Sort, Analysis. 1 hour
3.3 Strassen’s Algorithm for Matrix Multiplication, Analysis 1 hour
181
3.4 Greedy Strategy: The Control Abstraction. 1 hour
3.5 Fractional Knapsack Problem. 1 hour
3.6 Minimum Cost Spanning Tree Computation- Kruskal’s Algorithm, 1 hour

Analysis.
3.7 Single Source Shortest Path Algorithm - Dijkstra’s Algorithm 1 hour
3.8 Illustration of Dijkstra’s Algorithm-Analysis. 1 hour
Module-4 (Dynamic Programming, Back Tracking and Branch and Bound) 8 Hrs.
4.1 Dynamic Programming: The Control Abstraction, The Optimality 1 hour

Principle.
4.2 Matrix Chain Multiplication-Analysis. 1 hour
4.3 Illustration of Matrix Chain Multiplication-Analysis. 1 hour
4.4 All Pairs Shortest Path Algorithm- Analysis and Illustration of Floyd- 1 hour
Warshall Algorithm.
4.5 Back Tracking: The Control Abstraction . 1 hour
4.6 Back Tracking: The Control Abstraction – The N Queen’s Problem. 1 hour
4.7 Branch and Bound:- Travelling salesman problem. 1 hour
4.8 Branch and Bound:- Travelling salesman problem. 1 hour
Module-5 (Introduction to Complexity Theory) 10 Hrs
5.1 Introduction to Complexity Theory: Tractable and Intractable Problems. 1 hour
5.2 Complexity Classes – P, NP. 1 hour
5.3 NP- Hard and NP-Complete Problems. 1 hour
5.4 NP Completeness Proof of Clique Problem. 1 hour
182
5.5 NP Completeness Proof of Vertex Cover Problem. 1 hour
5.6 Approximation algorithms- Bin Packing Algorithm and Illustration. 1 hour
5.7 Graph Colouring Algorithm and Illustration. 1 hour
5.8 Randomized Algorithms (definitions of Monte Carlo and Las Vegas 1 hour
algorithms).
5.9 Randomized Version of Quick Sort Algorithm with Analysis. 1 hour
5.10 Illustration of Randomized Version of Quick Sort Algorithm with 1 hour

Analysis.
183
Category L T P Credit Year of

CST 308 COMPREHENSIVE Introduction
COURSE WORK PCC 1 0 0 1 2019
Preamble:
The objective of this Course work is to ensure the comprehensive knowledge of each student in
the most fundamental core courses in the curriculum. Six core courses credited from
Semesters 3, 4 and 5 are chosen for the detailed study in this course work. This course helps
the learner to become competent in cracking GATE, placement tests and other competitive
examinations
Prerequisite:
1. Discrete Mathematical Structures
2. Data Structures
3. Operating Systems
4. Computer Organization And Architecture
5. Database Management Systems
6. Formal Languages And Automata Theory
CO1 Comprehend the concepts of discrete mathematical structures (Cognitive Knowledge

Level: Understand)
CO2 : Comprehend the concepts and applications of data structures (Cognitive Knowledge
Level: Understand)
CO3 : Comprehend the concepts, functions and algorithms in Operating System (Cognitive
Knowledge Level: Understand))
CO4 : Comprehend the organization and architecture of computer systems (Cognitive
CO5 : Comprehend the fundamental principles of database design and manipulation

CO6 : Comprehend the concepts in formal languages and automata theory Cognitive
184
0 2
CO1
CO2
CO3
CO4
CO5
Assessment Pattern
Bloom’s Category End Semester Examination
Remember 10
Understand 20
Apply 20
Analyse
Evaluate
Create
Mark distribution
50 0 50 1 hour
End Semester Examination Pattern: Objective Questions with multiple choice (Four). Question paper
include fifty questions of one mark each covering the five identified courses.
185
Syllabus
Full Syllabus of all six selected Courses.
1. Discrete Mathematical Structures

2. Data Structures
3. Operating Systems
4. Computer Organization And Architecture
5. Database Management Systems
6. Formal Languages And Automata Theory
No Topic No. of
Lectures
1 DISCRETE MATHEMATICAL STRUCTURES (14 hours)
1.1 Mock Test on Module 1 and Module 2 1 hour
1.2 Mock Test on Module 3, Module 4 and Module 5 1 hour
2 DATA STRUCTURES
3 OPERATING SYSTEMS
3.3 Feedback and Remedial 1 hour
4 COMPUTER ORGANIZATION AND ARCHITECTURE
5 DATABASE MANAGEMENT SYSTEMS
186
6 FORMAL LANGUAGES AND AUTOMATA THEORY
6.3 Feedback and Remedial 1 hour

QP CODE:
Reg No: _______________
Name: _________________ PAGES : 10

Course Name: Comprehensive Course Work
Max. Marks: 50 Duration: 1 Hour
Objective type questions with multiple choices. Mark one correct answer for each question.
Each Question Carries 1 Mark
1. What is the maximum possible number of relations from a set with 5 elements to another set
with 4 elements?
(A) 2^10 (B)2^16 (C)2^20 (D)2^25
2. The set {1,2,4,7,8,11,13,14} is a group under multiplication modulo 15. Find the inverse of
element 13
(A) 7 (B) 13 (C) 1 (D) 8
3. Consider the recurrence relation a1 = 2, an = 3n+an-1 Then a72 is
187
(A) 7882 (B) 7883 (C) 7884 (D) 7885
4. Which among the following is a contradiction?

(A) (𝑝𝑝 ∧ 𝑞𝑞) ∨ ¬(𝑝𝑝 ∨ 𝑞𝑞) (B) (𝑝𝑝 ∨ 𝑞𝑞) ∧ ¬(𝑝𝑝 ∧ 𝑞𝑞)
(C) (𝑝𝑝 ∧ 𝑞𝑞) ∧ ¬(𝑝𝑝 ∨ 𝑞𝑞) (D) (𝑝𝑝 ∧ 𝑞𝑞) ∨ (𝑝𝑝 ∧ ¬𝑞𝑞)
5. The number of non-negative solutions to 𝑥𝑥 + 𝑦𝑦 + 𝑧𝑧 = 18, with conditions 𝑥𝑥 ≥ 3, 𝑦𝑦 ≥ 2, 𝑧𝑧 ≥

1𝑖𝑖𝑖𝑖
(A) 84 (B) 91 (C) 105 (D) 121
6. The solution of the recurrence relation 𝑎𝑎𝑛𝑛 = 𝑎𝑎𝑛𝑛−1 + 2𝑎𝑎𝑛𝑛−2 with initial conditions 𝑎𝑎0 =
2, 𝑎𝑎1 = 7, is
(A) 3(2)𝑛𝑛 − (−1)𝑛𝑛 (B) 3(2)𝑛𝑛 + (−1)𝑛𝑛
(C) -3(2)𝑛𝑛 − (−1)𝑛𝑛 (D) -3(2)𝑛𝑛 + (−1)𝑛𝑛
7. Which among the following is not a subgroup of the set of Complex numbers under
addition?
(A) 𝑅𝑅, the set of all Real numbers.
(B) Q+, the set of positive rational numbers.
(C) 𝑍𝑍, the set of all integers.
(D) The set 𝑖𝑖𝑖𝑖 of purely imaginary numbers including 0
8. Minimum number 𝑛𝑛 of integers to be selected from 𝑆𝑆 = {1,2, . . . . ,9} to guarantee that the
difference of two of the n integers is 5 is
(A) 3 (B) 4 (C) 6 (D) 9
9. Find the contrapositive the of statement “If it is a sunday, then I will wake up late”
(A) If I am not waking up late, then it is a suniday
(B) If I am not waking up late, then it is not a suniday
(C) If it is not a sunday, then I will not wake up late.
(D) It is not a sunday or I will wake up late
10. In the poset (Z+, |) (where Z+ is the set of all positive integers and | is the divides relation),
which of the following are false?
I. 3 and 9 is comparable
II. 7 and 10 is comparable
III. The poset (Z+, |) is a total order
(A) I and III (B) II only (C) II and III (D) III only
11. Consider the following sequence of operations on an empty stack.

push(22); push(43); pop(); push(55); push(12); s=pop();
188
Consider the following sequence of operations on an empty queue.

enqueue(32);enqueue(27); dequeue(); enqueue(38); enqueue(12); q=dequeue();
The value of s+q is ___________
(A) 44 (B) 54 (C) 39 (D) 70
12. The following postfix expression with single digit operands is evaluated using a stack:
822^/43*+51*-
Note that ^ is the exponentiation operator. The top two elements of the stack after the first *
is evaluated are:
(A) 12,2 (B) 12,5 (C) 2,12 (D) 2,5
13. Construct a binary search tree by inserting 8, 6, 12, 3, 10, 9 one after another. To make the
resulting tree as AVL tree which of the following is required?
(A) One right rotation only
(B) One left rotation followed by two right rotations
(C) One left rotation and one right rotation
(D) The resulting tree itself is AVL
14. In a complete 4-ary tree, every internal node has exactly 4 children or no child. The number
of leaves in such a tree with 6 internal nodes is:
(A) 20 (B) 18 (C) 19 (D) 17
15. Consider the following graph with the following sequences

I. a b c f d e
II. a b e d f c
III. a b f c d e
IV. a f c b e d
a
e
b
c
f
Which are Depth First Traversals of the above graph?
189
(A) I, II and IV only (B) I and IV only

(C) II, III and IV only (D) I, III and IV only
16. Consider a hash table of size seven, with starting index zero, and a hash function (2x + 5)
mod7. Assuming the hash table is initially empty, which of the following is the contents of
the table when the sequence 1, 4, 9, 6 is inserted into the table using closed hashing? Note
that ‘_’ denotes an empty location in the table.
(A) 9, _, 1, 6, _, _, 4 (B) 1, _, 6, 9, _, _, 4
(C) 4, _, 9, 6, _, _, 1 (D) 1, _, 9, 6, _, _, 4
17. Consider the following C program where TreeNode represents a node in a binary tree
struct TreeNode{
struct TreeNode *leftChild;
struct TreeNode *rightChild;
int element;
};
int CountNodes(struct TreeNode *t)
{
if((t==NULL)||((t->leftChild==NULL) && (t->rightChild==NULL)))
return 0;
else
{
return 1+CountNodes(t->leftChild)+CountNodes(t->rightChild)
}
}
The value returned by CountNodes when a pointer to the root of a binary tree is passed as its
argument is
(A) number of nodes
(B) number of leaf nodes
(C) number of non leaf nodes
(D) number of leaf nodes-number of non leaf nodes
18. How many distinct binary search trees can be created out of 6 distinct keys?
(A) 7 (B) 36 (C) 140 (D) 132
19. Suppose a disk has 400 cylinders, numbered from 0 to 399. At some time the disk arm is at
cylinder 58, and there is a queue of disk access requests for cylinder 66, 349, 201, 110, 38,
84, 226, 70, 86. If Shortest-Seek Time First (SSTF) is being used for scheduling the disk
access, the request for cylinder 86 is serviced after servicing ____________ number of
190
requests.
(A) 1 (B) 2 (C)3 (D)4
20. If frame size is 4KB then a paging system with page table entry of 2 bytes can address
_______ bytes of physical memory.
(A) 2^12 (B) 2^16 (C) 2^18 (D) 2^28
21. Calculate the internal fragmentation if page size is 4KB and process size is 103KB.
(A) 3KB (B) 4KB (C) 1KB (D) 2KB
22. Which of the following scheduling policy is likely to improve interactiveness?

(A) FCFS (B) Round Robin
(C) Shortest Process Next (D) Priority Based Scgeduling
23. Consider the following program

Semaphore X=1, Y=0
Void A ( ) Void B ( )
{ {
While (1) While (1)
{ {
P(X); P(Y);
Print’1’; P(X);
V(Y); Print’0’;
} V(X);
} }
}
The possible output of the program:
(A) Any number of 0’s followed by any number of 1’s.
(B) Any number of 1’s followed by any number of 0’s.
(C) 0 followed by deadlock
(D) 1 followed by deadlock
24. In a system using single processor, a new process arrives at the rate of 12 processes per
minute and each such process requires 5 seconds of service time. What is the percentage of
CPU utilization?
(A) 41.66 (B) 100.00 (C) 240.00 (D) 60.00
25. A system has two processes and three identical resources. Each process needs a maximum of
two resources. This could cause
(A) Deadlock is possible (B) Deadlock is not possible
191
(C) Starvation may be present (D) Thrashing

26. Which of the following is true with regard to Round Robin scheduling technique?
(A) Responds poorly to short process with small time quantum.
(B) Works like SJF for larger time quantum
(C) Does not use a prior knowledge of burst times of processes.
(D) Ensure that the ready queue is always of the same size.
27. The size of the physical address space of a 32-bit processor is 2^W words. The capacity of
cache memory is 2^N words. The size of each cache block is 2^K words. For a M-way set-
associative cache memory, the length (in number of bits) of the tag field is
(A) W – N + log2M (B) W – N – log2M
(C) W − N − K − log2M (D) W − N − K + log2M
28. A 64-bit processor can support a maximum memory of 8 GB, where the memory is word-
addressable (one word is of 64 bits). The size of the address bus of the processor is atleast
____ bits.
(A) 30 (B) 31 (C) 32 (D) None
29. The stage delays in a 4-stage pipeline are 900, 450, 400 and 350 picoseconds. The first stage
(with delay 900 picoseconds) is replaced with a functionally equivalent design involving two
stages with respective delays 600 and 550 picoseconds. The throughput increase of the
pipeline is _______ percent.
(A) 38 (B) 30 (C) 58 (D) 50
30. Consider a direct mapped cache of size 256 Kilo words with block size 512 words. There are
6 bits in the tag. The number of bits in block (index) and word (offset) fields of physical
address are is:
(A) block (index) field = 6 bits, word (offset) field = 9 bits
(B) block (index) field = 7 bits, word (offset) field = 8 bits
(C) block (index) field = 9 bits, word (offset) field = 9 bits
(D) block (index) field = 8 bits, word (offset) field = 8 bits
31. The memory unit of a computer has 1 Giga words of 64 bits each. The computer has
instruction format, with 4 fields: an opcode field; a mode field to specify one of 12
addressing modes; a register address field to specify one of 48 registers; and a memory
address field. If an instruction is 64 bits long, how large is the opcode field?
(A) 34 bits (B) 24 bits (C) 20 bits (D) 14 bits
32. A computer has 64-bit instructions and 28-bit address. Suppose there are 252 two-address
instructions. How many 1-address instructions can be formulated?
192
(A) 2^24 (B) 2^26 (C) 2^28 (D) 2^30
33. Determine the number of clock cycles required to process 200 tasks in a six-segment
pipeline.(Assume there were no stalls),each segment takes 1 cycle.
(A) 1200 cycles (B) 206 cycles (C) 207 cycles (D) 205 cycles
34. Match the following Lists:

P.DMA 1.Priority Interrupt
Q. Processor status Word 2.I/O Transfer
R. Daisy chaining 3.CPU
S. Handshaking 4.Asynchronous Data Transfer
(A) P-1, Q-3, R-4, S-2 (B) P-2, Q-3, R-1, S-4
(C) P-2, Q-1, R-3, S-4 (D) P-4, Q-3, R-1, S-2
35. Let E1, E2 and E3 be three entities in an E/R diagram with simple single-valued attributes.
R1 and R2 are two relationships between E1 and E2, where R1 is one-to-many, R2 is many-
to-many. R3 is another relationship between E2 and E3 which is many-to-many. R1, R2 and
R3 do not have any attributes of their own. What is the minimum number of tables required
to represent this situation in the relational model?
(A) 3 (B) 4 (C) 5 (D) 6
36. Identify the minimal key for relational scheme R(U, V, W, X, Y, Z) with functional
dependencies F = {U → V, V → W, W → X, VX → Z}
(A) UV (B) UW (C) UX (D) UY
37. It is given that: “Every student need to register one course and each course registered by
many students”, what is the cardinality of the relation say “Register” from the “Student”
entity to the “Course” entity in the ER diagram to implement the given requirement.
(A) M:1 relationship (B) M:N relationship
(C) 1:1 relationship (D) option (B) or(C)
38. Consider the relation branch( branch_name, assets, branch_city)

SELECT DISTINCT T.branch_name FROM branch T, branch S WHERE T.assets > L.assets
AND S.branch_city = "TVM" .
Finds the names of
(A) All branches that have greater assets than all branches located in TVM.
(B) All branches that have greater assets than some branch located in TVM.
(C) The branch that has the greatest asset in TVM.
(D) Any branch that has greater asset than any branch located in TVM.
193
39. Consider the following relation instance, where “A” is primary Key.
A1 A2 A3 A4
1 1 1 Null
5 2 5 1
9 5 13 5
13 13 9 15
Which one of the following can be a foreign key that refers to the same relation?
(A) A2 (B) A3 (C) A4 (D) ALL
40. A relation R(ABC) is having the tuples(1,2,1),(1,2,2),(1,3,1) and (2,3,2). Which of the
following functional dependencies holds well?
(A) A → BC (B) AC → B (C) AB → C (D) BC → A
41. Consider a relation R with attributes A, B, C, D and E and functional dependencies A → BC,
BC → E, E →DA. What is the highest normal form that the relation satisfies?
(A) BCNF (B) 3 NF (C) 2 NF (D) 1 NF
42. For the given schedule S, find out the conflict equivalent schedule.
S : r1(x); r2(Z) ; r3(X); r1(Z); r2(Y); r3(Y);W1(X); W2(Z); W3(Y); W2(Y)
(A) T1→T2→T3 (B) T2->T1->T3
(C) T3→T1→T2 (D) Not conflict serializable
43. Which of the following strings is in the language defined by the grammar:
S → aX
X → aX | bX | b
(A) aaaba (B) babab (C) aaaaa (D) ababb
44. Consider the regular expression (x+y)*xyx(x+y)* where Σ = (x,y). If L is the language
represented by this regular expression, then what will be the minimum number of states in a
DFA recognizing L ?
(A) 2 (B) 3 (C) 4 (D) 5
45. Which of the following cannot handle the same set of languages?
(A) Deterministic Finite Automata and Non-Deterministic Finite Automata
(B) Deterministic Push Down Automata and Non-Deterministic Push Down Automata
(C) All of these
(D) None of these
46. Consider L be a context-free language and M be a non-context-free language. Which among

the following is TRUE?
194
(I) L will definitely pass the pumping lemma test for CFLs.
(II) M will definitely pass the pumping lemma test for CFLs.
(III) L will not definitely pass the pumping lemma test for CFLs.
(IV) M will not definitely pass the pumping lemma test for CFLs.
(V) L may or maynot pass the pumping lemma test for CFLs.
(VI) M may or maynot pass the pumping lemma test for CFLs.
(A) I, II (B) II, V (C) I, VI (D) IV, V
47. Which of the following problem(s) is/are decidable?

(I) Whether a CFG is empty or not.
(II) Whether a CFG generates all possible strings.
(III) Whether the language generated by a Turing Machine is regular.
(IV) Whether the language generated by DFA and NFA are same.
(A) I and II (B) II and III (C) II and IV (D) I and IV
48. Which of the following is/are TRUE?

(I) Regular languages are closed under complementation.
(II) Recursive languages are closed under complementation.
(III) Context free languages are closed under complementation.
(IV) Context free languages are not closed under complementation.
(A) I, II and III (B) I, II and IV (C) II and III (D) III only
49. Which of the following regular expressions defined over the alphabet Σ = {0,1} defines the
language of all strings of length l where l is a multiple of 3?
(A) (0 + 1 + 00 + 11 + 000 +111)* (B) (000 + 111)*
(C) ((0 + 1)(0 + 1)(0 + 1))* (D) ((000 + 01 + 1)(111 + 10 + 0))*
50. Determine the minimum number of states of a DFA that recognizes the language over the
alphabet {a,b} consisting of all the strings that contain at least three a's and at least four b's.
(A) 6 (B) 12 (C) 15 (D) 20
ANSWER KEY:-
QNo Ans. QNo Ans. QNo Ans. QNo Ans. QNo Ans.
Key Key Key Key Key
1 (C) 11 (C) 21 (C) 31 (B) 41 (A)
195
2 (A) 12 (A) 22 (B) 32 (D) 42 (D)
3 (B) 13 (A) 23 (D) 33 (D) 43 (D)
4 (C) 14 (C) 24 (B) 34 (B) 44 (C)
5 (B) 15 (A) 25 (B) 35 (C) 45 (B)
6 (A) 16 (D) 26 (C) 36 (D) 46 (C)
7 (B) 17 (C) 27 (A) 37 (A) 47 (D)
8 (C) 18 (D) 28 (A) 38 (B) 48 (B)
9 (B) 19 (C) 29 (D) 39 (B) 49 (C)
10 (C) 20 (D) 30 (C) 40 (D) 50 (D)
196
NETWORKING CATEGORY L T P Credit Year of Introduction

CSL332
LAB
PCC 0 0 3 2 2
Preamble:
The course enables the learners to get hands-on experience in network programming using Linux
System calls and network monitoring tools. It covers implementation of network protocols and
algorithms, configuration of network services and familiarization of network simulators. This
helps the learners to develop, implement protocols and evaluate its performance for real world
networks.
Prerequisite: Sound knowledge in Programming in C, Data Structures and Computer Networks
CO# Course Outcomes
Use network related commands and configuration files in Linux Operating System.
CO1
(Cognitive Knowledge Level: Understand).
Develop network application programs and protocols.

CO2
Analyze network traffic using network monitoring tools.

CO3
Design and setup a network and configure different network protocols.

CO4
Develop simulation of fundamental network concepts using a network simulator.

CO5
CO1
CO2
CO3
197
CO4
CO5

problems
Assessment Pattern
Bloom’s Category Continuous Assessment Test End Semester

(Internal Exam) Marks in Examination
percentage Marks in percentage
Remember 20 20
Understand 20 20
Apply 60 60
Analyze
Evaluate
Create
Mark Distribution
150 75 75 3 hours
198
Viva voce : 15 marks

The Internal examination shall be conducted for 100 marks, which will be converted to out
of 15, while calculating Internal Evaluation marks. The marks will be distributed as,
Algorithm - 30 marks, Program - 20 marks, Output - 20 marks and Viva - 30 marks.

The End Semester Examination will be conducted for a total of 75 marks and shall be
distributed as, Algorithm - 30 marks, Program - 20 marks, Output - 20 marks and Viva- 30
marks.

Compiler/Software to Use in Lab : gcc, NS2
Fair Lab Record:
All the students attending the Networking Lab should have a Fair Record. Every experiment
conducted in the lab should be noted in the fair record. For every experiment, in the fair
record, the right hand page should contain experiment heading, experiment number, date of
experiment, aim of the experiment, procedure/algorithm followed, other such details of the
experiment and final result. The left hand page should contain a print out of the respective
code with sample input and corresponding output obtained. All the experiments noted in the
fair record should be verified by the faculty regularly. The fair record, properly certified by
the faculty, should be produced during the time of End Semester Examination for the
verification by the examiners.
199
Syllabus
*Mandatory
(Note: At least one program from each topic in the syllabus should be completed in the Lab)
1. Getting started with the basics of network configuration files and networking
commands in Linux.*
2. To familiarize and understand the use and functioning of system calls used for
network programming in Linux.*
3. Implement client-server communication using socket programming and TCP as
transport layer protocol*
4. Implement client-server communication using socket programming and UDP as
transport layer protocol*
5. Simulate sliding window flow control protocols.* (Stop and Wait, Go back N,
Selective Repeat ARQ protocols)
6. Implement and simulate algorithm for Distance Vector Routing protocol or Link
State Routing protocol.*
7. Implement Simple Mail Transfer Protocol.
8. Implement File Transfer Protocol.*
9. Implement congestion control using a leaky bucket algorithm.*
10. Understanding the Wireshark tool.*
11. Design and configure a network with multiple subnets with wired and wireless LANs
using required network devices. Configure commonly used services in the network.*
12. Study of NS2 simulator*
Networking Lab-Practice Questions
1. a) View the configuration, including addresses of your computers network interfaces.

b) Test the network connectivity between your computer and several other computers.
c) View the active TCP connections in the computer after visiting a website.
d) Find the hardware/MAC address of another computer in the network using ARP.
2. Write the system calls used for creating sockets and transferring data between two
nodes.
3. a) Implement a multi-user chat server using TCP as transport layer protocol.
b) Implement a simple web proxy server that accepts HTTP requests and forwarding
to remote servers and returning data to the client using TCP
200
4. Implement a Concurrent Time Server application using UDP to execute the program
at a remote server. Client sends a time request to the server, server sends its system
time back to the client. Client displays the result.
5. a) Implement Stop-and-Wait ARQ flow control protocol.
b) Implement Go-Back--N ARQ flow control protocol.
c) Implement Selective Repeat ARQ flow control protocol.
6. Implement Distance Vector Routing algorithm or Link State Routing algorithm..
7. Implement Simple Mail Transfer Protocol.
8. Develop a concurrent file server which will provide the file requested by a client if it
exists. If not, the server sends appropriate message to the client. Server should also
send its process ID (PID) to clients for display along with the file or the message.
9. Implement leaky bucket algorithm for congestion control.
10. a) Using Wireshark, Capture packets transferred while browsing a selected website.
Investigate the protocols used in each packet, the values of the header fields and the
size
of the packet.
b) Using Wireshark, observe three way handshaking connection establishment, three
way handshaking connection termination and Data transfer in client server
communication using TCP.
c) Explore at least the following features of Wireshark: filters, Flow graphs (TCP),
statistics, and protocol hierarchies.
11. Design and configure a network (wired and wireless LANs) with multiple subnets
using required network devices. Configure at least three of the following services in
the network- TELNET, SSH, FTP server, Web server, File server, DHCP server and
DNS server.
12. a) The network consists of TCP source node (n0) and destination node (n1) over an
area size of 500m x 500m. Node (n0) uses Agent/TCP/Reno as the sending TCP
agent and FTP traffic source. Node (n1) is the receiver of FTP transfers, and it uses
Agent/TCP sink as its TCP-agent for the connection establishment. Run the
simulation for 150 seconds and show the TCP window size in two static nodes
scenario with any dynamic routing protocol. Run the script and analyze the output
graph for the given scenario.
b) Simulate the transmission of ping messages over a star network topology consisting
of ‘n’ nodes and find the number of packets dropped due to congestion using
NS2simulator.
c) Simulate Link State Protocol or Distance Vector Routing protocol in NS2.
201
Reference Books:
1. W. Richard Stevens, Bill Fenner, Andy Rudoff, UNIX Network Programming:

Volume 1, The Sockets Networking API, 3rd Edition, Pearson, 2015
2. Lisa Bock, Learn Wireshark: Confidently navigate the Wireshark interface and solve
real-world networking problems, Packt Publishing, 2019
3. Teerawat Issariyakul, Ekram Hossain, Introduction to Network Simulator NS2,2nd
Edition, Springer,2019
202
Year of
CSD Category L T P Credit
MINI PROJECT Introduction
334
PCC 0 0 3 2 2019
Preamble:
The objective of this course is to apply the fundamental concepts of Software Engineering
principles for the effective development of an application/research project. This course helps the
learners to practice the different steps to be followed in the software development process such as
literature review and problem identification, preparation of Software Requirement Specification
&Software Design Document (SDD), testing, development and deployment. Mini project
enables the students to boost their skills, widen the horizon of thinking and their ability to resolve
real life problems.
Prerequisite:
A sound knowledge in any programming language and fundamental concepts of Software
Engineering.
CO# CO
Identify technically and economically feasible problems (Cognitive Knowledge
CO1
Level: Apply)
Identify and survey the relevant literature for getting exposed to related
CO2
solutions and get familiarized with software development processes
Perform requirement analysis, identify design methodologies and develop
CO3 adaptable & reusable solutions of minimal complexity by using modern tools &
advanced programming techniques (Cognitive Knowledge Level: Apply)
Prepare technical report and deliver presentation (Cognitive Knowledge Level:
CO4 Apply)
Apply engineering and management principles to achieve the goal of the project
203
0 2
CO1
CO2
CO3
CO4
CO5

Assessment Pattern
Mark Distribution

150 75 75

Attendance 10 marks
Project Guide 15 marks
Project Report 10 marks
204
Evaluation by the Committee (will be evaluating the level of completion
and demonstration of functionality/specifications, presentation,
oral examination, work knowledge and involvement) : 40 marks
Student Groups with 3 or 4 members should identify a topic of interest in consultation with a
Faculty/Advisor. Review the literature and gather information pertaining to the chosen topic.
State the objectives and develop a methodology to achieve the objectives. Carryout the
design/fabrication or develop codes/programs to achieve the objectives by strictly following
steps specified in the teaching plan. Innovative design concepts, performance, scalability,
reliability considerations, aesthetics/ergonomic, user experience and security aspects taken care
of in the project shall be given due weight.
The progress of the mini project is evaluated based on a minimum of two reviews. The review
committee may be constituted by the Head of the Department comprising HoD or a senior
faculty member, Mini Project coordinator and project guide. The internal evaluation shall be
made based on the progress/outcome of the project, reports and a viva-voce examination,
conducted internally by a 3-member committee. A project report is required at the end of the
semester. The project has to be demonstrated for its full design specifications.
The marks will be distributed as

Presentation : 30 marks
Demo : 20 marks
Viva : 25 marks.
Total : 75 marks.
205
TEACHING PLAN
Students are expected to follow the following steps.
1. Review of Literature and Identification of a problem
2. Create an abstract with a problem statement, solution approach, technology stack, team,
etc. and get department approval. Register Online course/ Collect study materials.
3. Create Software Requirements Specification (SRS Document)
4. Create Software Design Document (SDD). This may include designs like,
a. System Architecture Design
b. Application Architecture Design
c. GUI Design (Mockups)
d. API Design
e. Database Design
f. Technology Stack
5. Create Test Plan, Test Scenarios and Test Cases (Test Case Document) & Traceability
Matrix
6. Create a Project Plan (with Modules, Tasks, Resources, Time schedule) [May use any
project management tool or excel for this] – Choose and follow agile or waterfall
models.
7. Development
a. Set coding standards
b. Environment Setup
c. Source Code Control Setup (Like Subversion(SVN), Git)
d. Development
e. Unit Testing
f. Integration Testing
g. Testing /Quality Assurance(QA)
i. Functional Testing
ii. Load Testing
iii. Report Bugs
h. Resolve Bugs & Retest
206
8. Deployment (of software from local development environment to a production
environment)
9. Test Run & Get Results
10. Prepare Project Report
Guidelines for the Report preparation

A bonafide report on the mini project shall be submitted within one week after the final
presentation. Minimum number of pages should be 40.
● Use Times New Roman font for the entire report – Chapter/Section Title – Times New
Roman18, Bold; Heading 2 – Times New Roman16, Bold; Heading 3 – Times New
Roman14, Bold; Body- Times New Roman 12, Normal.
● Line Spacing – Between Heading 2 – 3 lines, between lines in paragraph 1.5 lines.
● Alignments – Chapter/Section Title – Center, Heading 2 & 3 should be Left Aligned.
Ensure that all body text is paragraph justified.
● Figures & Tables – Ensure that all Figures and Tables are suitably numbered and given
proper names/headings. Write figuretitle under the figure and table title above the table.
● Suggestive order of documentation:

i. Top Cover
ii. Title page
iii. Certification page
iv. Acknowledgement
v. Abstract
vi. Table of Contents
vii. List of Figures and Tables
viii. Chapters
ix. Appendices, if any
x. References/Bibliography
207
SEMESTER VI
PROGRAM ELECTIVE I
208
Category L T P Credit Year of Introduction

CST FOUNDATIONS OF
312 MACHINE LEARNING
PEC 2 1 0 3 2019
Preamble:
This course enables the learners to understand the mathematical foundations of Machine
Learning concepts. This course covers Linear Algebra, Probability and Distributions. Concepts in
this course help the learners to identify the inherent assumptions & limitations of the current
methodologies and develop new Machine Learning solutions.
CO 1 Illustrate operations and applications of linear equations, matrix algebra, vector

spaces, eigen values & eigenvectors (Cognitive Knowledge Level: Apply)
CO 2 Illustrate the concepts of orthogonality & diagonalization. (Cognitive Knowledge
Level: Apply)
CO 3 Solve computational problems using probability and random variables. (Cognitive
CO 4 Identify an appropriate probability distribution for a given discrete or continuous
random variable and use its properties. (Cognitive Knowledge Level: Apply)
CO 5 Illustrate moment generating function, law of large numbers and central limit
theorems (Cognitive Knowledge Level: Apply)
PO PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO PO 11 PO
1 10 12
CO
1
CO
2
CO
3
CO
4
209
CO 5


problems
Assessment Pattern

Examination
1 2
Remember
30% 30% 30%
Understand
30% 30% 30%
Apply
40% 40% 40%
Analyse
Evaluate
Create
210
Mark Distribution
150 50 100 3 hours
from the completed modules and 1 question from the partly covered module), having 3 marks for
each question adding up to 15 marks for part A. Students should answer all questions from Part A.
question from the partly covered module), each with 7 marks. Out of the 7 questions in Part B, a
There will be two parts; Part A and Part B. Part A contain 10 questions with 2 questions from each
questions from each module of which student should answer anyone. Each question can have
211
Syllabus
Module 1 (LINEAR ALGEBRA )

Systems of Linear Equations – Matrices, Solving Systems of Linear Equations. Vector Spaces
- Linear Independence, Basis and Rank, Linear Mappings.
Module 2 (LINEAR ALGEBRA )
Norms - Inner Products, Lengths and Distances, Angles and Orthogonality. Orthonormal
Basis, Orthogonal Complement, Orthogonal Projections. Matrix Decompositions -
Eigenvalues and Eigenvectors, Eigen decomposition and Diagonalization.
Module 3 (PROBABILITY AND DISTRIBUTIONS)
Probability Space - Sample Spaces, Probability Measures, Computing Probabilities,
Conditional Probability, Baye’s Rule, Independence. Random Variables - Discrete Random
Variables (Bernoulli Random Variables, Binomial Distribution, Geometric and Poisson
Distribution, Continuous Random Variables (Exponential Density, Gamma Density, Normal
Distribution, Beta Density)
Module 4 (RANDOM VARIABLES)
Functions of a Random Variable. Joint Distributions - Independent Random Variables,
Conditional Distributions, Functions of Jointly Distributed Random Variables.
Expected Values - Expected Value of a Random Variable, Expectations of Functions of
Random Variables, Expectations of Linear Combinations of Random Variables, Variance and
Standard Deviation, Covariance and Correlation, Conditional Expectation
Module 5 (LIMIT THEOREMS)
Moment-Generating Function. Limit Theorems(Proof not expected) - Law of Large Numbers,
Convergence in Distribution and the Central Limit Theorem. Distributions derived from the
Normal Distribution - Chi-square, t, and F Distributions, Sample Mean and the Sample
Variance.
Text book:
1. Marc Peter Deisenroth, A. Aldo Faisal, Cheng Soon Ong, Mathematics for Machine
Learning, Cambridge University Press (freely available at https://mml – book.github.io)
2. John A. Rice, Mathematical Statistics and Data Analysis, University of California,
Berkeley, Third edition, published by Cengage.
212
Reference books:
1. Gilbert Strang, Linear Algebra and Its Applications, 4th Edition,
2. Axler, Sheldon, Linear Algebra Done Right, 2015 Springer
3. Stephen Boyd and Lieven Vandenberghe, Introduction to Applied Linear Algebra, 2018
published by Cambridge University Press
1. Find the set S of all solutions in x of the following inhomogeneous linear systems Ax = b,
where A and b are defined as follows:
2. Determine the inverses of the following matrix if possible
3. Are the following sets of vectors linearly

independent?
4. A set of n linearly independent vectors in Rn forms a basis. Does the set of vectors (2, 4,−3)
(0, 1, 1) , (0, 1,−1) form a basis for R3? Explain your reasons.
213
1. Determine which of the following sets are orthogonal sets.

eigenvalue of the following matrix.
1. Let J and T be independent events, where P(J)=0.4 and P(T)=0.7.

i. Find P(J∩T)
ii. Find P(J∪T)
2. Let A and B be events such that P(A)=0.45 , P(B)=0.35 and P(A∪B)=0.5. Find P(A∣B).
3. A random variable R has the probability distribution as shown in the following table:
214
i. Given that E(R)=2.85, find a and b.

ii. Find P(R>2).
4. A biased coin (with probability of obtaining a head equal to p > 0) is tossed repeatedly and
independently until the first head is observed. Compute the probability that the first head
appears at an even numbered toss.
5. Two players A and B are competing at a quiz game involving a series of questions. On any
individual question, the probabilities that A and B give the correct answer are p and q
respectively, for all questions, with outcomes for different questions being independent.
The game finishes when a player wins by answering a question correctly. Compute the
probability that A wins if
i. A answers the first question,
6. A coin for which P(heads) = p is tossed until two successive tails are obtained. Find the
probability that the experiment is completed on the nth toss.
Course Outcome- 3 (CO4):
1. An urn contains p black balls, q white balls, and r red balls; and n balls are chosen
without replacement.
a. Find the joint distribution of the numbers of black, white, and red balls in the
sample.
b. Find the joint distribution of the numbers of black and white balls in the
sample.
c. Find the marginal distribution of the number of white balls in the sample.
2. Suppose that two components have independent exponentially distributed lifetimes, T1
and T2, with parameters α and β, respectively. Find (a) P( T1 > T2 ) and (b) P( T1 > 2 T2).
3. Let Z1 and Z2 be independent random variables each having the standard normal
distribution. Define the random variables X and Y by X = Z1 + 3Z2 and Y = Z1 + Z2.
Argue that the joint distribution of (X, Y) is a bivariate normal distribution. What are the
parameters of this distribution?
215
4. Given a continuous random variable x, with cumulative distribution function Fx(x), show
that the random variable y = Fx(x) is uniformly distributed.
5. You roll a fair dice twice. Let the random variable X be the product of the outcomes of
the two rolls. What is the probability mass function of X? What are the expected values
and the standard deviation of X?
6. Let X be a continuous random variable with the density function f (x) = 2x, 0 ≤ x ≤ 1
a. Find E(X).
b. Find E(X2) and Var(X).
1. Find the moment-generating function of a Bernoulli random variable, and use it to find
the mean, variance, and third moment.
2. Use moment-generating functions to show that if X and Y are independent, then Var(aX
+ bY ) = a2Var(X) + b2Var(Y ).
3. Suppose that you bet Rs 5 on each of a sequence of 50 independent fair games. Use the
central limit theorem to approximate the probability that you will lose more than Rs 75.
4. Suppose that the number of insurance claims, N, filed in a year is Poisson distributed
with E(N) = 10,000. Use the normal approximation to the Poisson to approximate P(N >
10,200).
216
QP Code : Total Pages: 4

Reg No.:_______________ Name:__________________________
SIXTH SEMESTER B.TECH DEGREE EXAMINATION (ELECTIVE), MONTH and YEAR
Course Name: FOUNDATIONS OF MACHINE LEARNING
PART A
Answer all questions, each carries 3 marks.
1 Show that with the usual operation of scalar multiplication but with addition on
reals given by x # y = 2(x + y) is not a vector space.
2 Are the following vectors linearly independent? Justify your answer.
3 Find the eigenvalues of the following matrix in terms of k. Can you find an
eigenvector corresponding to each of the eigenvalues?
4 Find a unit vector in R2 that is orthogonal to (-1 , 2).
5 The first three digits of a telephone number are 452. If all the sequences of the
remaining four digits are equally likely, what is the probability that a randomly
selected telephone number contains seven distinct digits?
217
6 Show that if two events A and B are independent, then A and B' are independent.
7 Prove that X and Y are independent if and only if fX|Y (x|y) = fX (x) for all x and y.
8 If X is a discrete uniform random variable, i.e., P(X = k) = 1/n for k = 1, 2, ... , n,

find E(X) and Var(X).
9 Compare the Poisson cdf and the normal approximation for (a) λ = 10, (b) λ =
20, and (c) λ = 40.
10 x 3 = 30
10 State law of large numbers.
PART B
11 a) Find all solutions to the system of linear equations (8)
Consider the transformation T (x, y) = (x + y, x + 2y, 2x + 3y). Obtain ker T and (6)
b) use this to calculate the nullity. Also find the transformation matrix for T.
OR
12 a) Consider the following linear mapping (8)
i. Find the transformation matrix T.

ii. Determine rank(T).
218
iii. Compute the kernel and image of the mapping and find their dimension
b) Prove that all vectors orthogonal to [2, −3, 1]T forms a subspace W of R3. What (6)
is dim (W) and why?
13 a) Find an orthonormal basis of R3 consisting of eigenvectors for the following (8)
matrix
b) Find a 3 × 3 orthogonal matrix S and a 3 × 3 diagonal matrix D such that (6)

A = SDST
OR
14 a) Find an orthogonal basis for the subspace of R4 spanned by { w1 = (1, 1, 3, 2), w2 (8)
= (1, −2, 0, −1), w3 = (0, 2, 1, 2) }.
b) Find the characteristic equation, eigenvalues, and eigenspaces corresponding to (6)
each eigenvalue of the following matrix
15 a) Three players play 10 independent rounds of a game, and each player has (7)
probability 1/3 of winning each round. Find the joint distribution of the numbers
of games won by each of the three players.
b) An experiment consists of throwing a fair coin four times. Find the probability (7)
mass function and the cumulative distribution function of the following random
variables:
219
i. the number of heads before the first tail

ii. the number of heads following the first tail
iii. the number of heads minus the number of tails
iv. the number of tails times the number of heads.
OR
16 a) A factory runs three shifts. On a given day, 1% of the items produced by the first (8)
shift are defective, 2% of the second shift’s items are defective, and 5% of the
third shift’s items are defective. If the shifts all have the same productivity, what
percentage of the items produced in a day are defective? If an item is defective,
what is the probability that it was produced by the third shift?
b) Show that if A and B are two independent events, then P(A ∪ B) = P(A) + P(B) (6)
− P(A)P(B)
17 a) Find the joint density of X + Y and X/Y, where X and Y are independent (8)
exponential random variables with parameter λ. Show that X + Y and X/Y are
independent.
b) Let X be a discrete random variable that takes on values 0, 1, 2 with probabilities
(6)
1/2 , 3/8 , 1/8 , respectively.
i. Find E(X) and Var(X).
ii. Let Y = X2. Find the probability mass function of Y and use it to find E(Y).
18 a) A random square has a side length that is a uniform [0, 1] random variable. Find (7)
the expected area of the square.
b) Let X be a continuous random variable with probability density function on (7)
2 2
0 <= x <= 1 defined by f(x) = 3x . Find the pdf of Y = X .
19 a) Using the fact that the mean of the chi-squared distribution is (n-1), prove that (7)
2 2
E(S ) = σ .
b) i. Random samples of size 36 are taken from an infinite population whose mean (7)
is 80 and standard deviation is 18. Find the mean and standard error of the
220
sampling distribution.
ii. Why is the Central Limit Theorem so important to statistical analysis?
OR
20 a) A six-sided die is rolled 100 times. Using the normal approximation, find the (8)
probability that the face showing a six turns up between 15 and 20 times. Find
the probability that the sum of the face values of the 100 trials is less than 300.
b) Determine an interval (a, b) such that P[a ≤ t ≤ b ] = 0.80, and that 10% of the
area is on each side of a and b, assuming that the sample is of size 21. (6)
221
Teaching Plan
No Topic No. of
Lectures
(35)
1 Module-1 (LINEAR ALGEBRA) TB-1(Ch 2,3,4) (6 hours)
1.1 Systems of Linear Equations – Matrices, Solving Systems of Linear

1 hour
Equations.
1.2 Vector Spaces, sub space 1 hour
1.3 Linear Independence, 1 hour
1.4 Basis and Rank 1 hour
1.5. Linear Mappings- Kernel, Range 1 hour
1.6. Linear Mappings- Rank, Nullity
2 Module-2 (LINEAR ALGEBRA) (6 hours)
2.1. Norms, Inner Products, Lengths and Distances, Angles and Orthogonality,
1 hour
2.2 Orthonormal Basis, Orthogonal Complement, 1 hour
2.3 Orthogonal Projections 1 hour
2.4. Eigenvalues and Eigenvectors 1 hour
2.5. Eigen decomposition 1 hour
2.6. Eigen Diagonalization 1 hour
3. Module-3 (PROBABILITY AND DISTRIBUTIONS) TB-2(Ch 1,2) (9 hours)
222
3.1 Sample Spaces, Probability Measures, Computing Probabilities 1 hour
3.2 Conditional Probability, 1 hour
3.3 Baye’s Rule 1 hour
3.4 Independence of events 1 hour
3.5 Discrete Random Variables -Bernoulli Random Variables, Binomial 1 hour

Distribution
3.6 Discrete Random Variables -Geometric Distribution 1 hour
3.7 Discrete Random Variables -Poisson Distribution 1 hour
3.8 Continuous Random Variables - Exponential Density, Gamma Density, 1 hour
3.9 Continuous Random Variables - Normal Distribution, Beta Density 1 hour
4. Module-4 (RANDOM VARIABLES) TB-2 (Ch 3, 4, 5, 6) (9 hours)
4.1 Functions of a Random Variable 1 hour
4.2 Joint Distributions - Independent Random Variables 1 hour
4.3 Conditional Distributions 1 hour
4.4 Functions of Jointly Distributed Random Variables 1 hour
4.5 Expected Value of a Random Variable, 1 hour
4.6 Expectations of Functions of Random Variables, 1 hour
4.7 Expectations of Linear Combinations of Random Variables 1 hour
4.6 Variance and Standard Deviation 1 hour
4.9 Covariance and Correlation 1 hour
223
5 Module-5 (LIMIT THEOREMS) ( 6 hours)
5.1 Conditional Expectation, 1 hour
5.2 Moment-Generating Function 1 hour
5.3 Limit Theorems(Proof not expected) - Law of Large Numbers, 1 hour
5.4 Convergence in Distribution and the Central Limit Theorem. 1 hour
5.5 Distributions derived from the Normal Distribution - Chi-square and, and F 1 hour
Distributions,
5.6 Distributions derived from the Normal Distribution - Sample Mean and the 1 hour
Sample Variance.
224
Category L T P Credits Year of Introduction

CST DATA
322 ANALYTICS
PEC 2 1 0 3 2019
Preamble:
This course helps the learner to understand the basic concepts of data analytics. This course covers
mathematics for data analytics, predictive and descriptive analytics of data, Big data and its
applications, techniques for managing big data and data analysis & visualization using R
programming tool. It enables the learners to perform data analysis on a real world scenario using
appropriate tools.
Prerequisite: NIL
CO# Course Outcomes
CO1 Illustrate the mathematical concepts for data analytics (Cognitive Knowledge
Level: Apply)
CO2 Explain the basic concepts of data analytics (Cognitive Knowledge Level:
Understand)
CO3 Illustrate various predictive and descriptive analytics algorithms (Cognitive

CO4 Describe the key concepts and applications of Big Data Analytics (Cognitive
CO5 Demonstrate the usage of Map Reduce paradigm for Big Data Analytics
CO6 Use R programming tool to perform data analysis and visualization (Cognitive
225
CO1
CO2
CO3
CO4
CO5
CO6
Abstract POs Defined by National Board of Accreditation

complex problems
226
Assessment Pattern

Category Examination Marks (%)
Test 1 Test 2
(%) (%)
Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
Mark Distribution
Total CIE ESE ESE

Marks Marks Marks Duration
150 50 100 3

Attendance 10 marks
Continuous Assessment Tests (Average of Series Tests 1& 2) 25 marks

be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the
227
answer any5.
full questions from each module of which students should answer any one. Each question can have
a maximum 2 sub-divisions and carries 14 marks.
Syllabus
Module – 1 (Mathematics for Data Analytics)
Descriptive statistics - Measures of central tendency and dispersion, Association of two variables -
Discrete variables, Ordinal and Continuous variable, Probability calculus - probability distributions,
Inductive statistics - Point estimation, Interval estimation, Hypothesis Testing - Basic definitions, t-
test
Module - 2 (Introduction to Data Analytics)
Introduction to Data Analysis - Analytics, Analytics Process Model, Analytical Model

Requirements. Data Analytics Life Cycle overview. Basics of data collection, sampling,
preprocessing and dimensionality reduction
Module - 3 (Predictive and Descriptive Analytics)
Supervised Learning - Classification, Naive Bayes, KNN, Linear Regression. Unsupervised

Learning - Clustering, Hierarchical algorithms – Agglomerative algorithm, Partitional algorithms -
K- Means. Association Rule Mining - Apriori algorithm
Module - 4 (Big Data Analytics)
Big Data Overview – State of the practice in analytics, Example Applications - Credit Risk
Modeling, Business Process Analytics.Big Data Analytics using Map Reduce and Apache Hadoop,
Developing and Executing a HadoopMapReduce Program.
Module - 5 (R programming for Data Analysis)
Overview of modern data analytic tools.Data Analysis Using R - Introduction to R - R Graphical

User Interfaces, Data Import and Export, Attribute and Data Types, Descriptive Statistics,
Exploratory Data Analysis - Visualization Before Analysis, Dirty Data, Visualizing a Single
Variable, Examining Multiple Variables, Data Exploration Versus Presentation, Statistical Methods
for Evaluation
228
Text Book
1. Bart Baesens," Analytics in a Big Data World: The Essential Guide to Data Science and
its Business Intelligence and Analytic Trends”, John Wiley & Sons, 2013.
2. David Dietrich, “EMC Education Services, Data Science and Big Data Analytics:
Discovering, Analyzing, Visualizing and Presenting Data”, John Wiley & Sons, 2015.
3. Jaiwei Han, MichelineKamber, “Data Mining Concepts and Techniques'', Elsevier, 2006.
4. Christian Heumann and Michael Schomaker, “Introduction to Statistics and
DataAnalysis”, Springer, 2016
References
1. Margaret H. Dunham, Data Mining: Introductory and Advanced Topics. Pearson, 2012.
2. Michael Berthold, David J. Hand, Intelligent Data Analysis, Springer, 2007.

1. Explain the measures of central tendency.
2. Drive the mean and variance of normal distribution.
3. Collect sample data associated with a real world scenario, and identify central tendency
and dispersion measures. Explain your inferences.
1. Explain the life cycle of Data Analytics.

2. Discuss in detail the relevance of data sampling.

1. The following table shows the midterm and final exam marks obtained for students in a
database course.
X (Midterm exam) Y (Final exam)
72 84
50 63
229
81 77
74 78
94 90
86 75
59 49
83 79
65 77
33 52
88 74
81 90
a) Use the method of least squares to find an equation for the prediction of a
student’s final exam marks based on the student’s midterm grade in the
course.
b) Predict the final exam marks of a student who received an 86 on the
midterm exam.
2. Perform knn classification on the following dataset and predict the class for the data
point X (P1 = 3, P2 =7), assuming the value of k as 3.
P1 P2 Class
7 7 False
7 4 False
3 4 True
1 4 True

1. List down the characteristics of Big Data.
2. Illustrate process discovery task in business analytics using the scenario of
insurance claim handling process. Draw the annotated process map.
230
1. Explain how fault tolerance is achieved in HDFS.

2. Write down the pseudocode for Map and Reduce functions to solve any one data
analytic problem.
1. Illustrate any three R functions used in data analytics.

2. Explain the different categories of attributes and data types in R.

QP CODE:
Reg No:______________
Name :______________ PAGES : 4
Course Name: Data Analytics
Max.Marks :100 Duration: 3 Hrs
PART A
(Answer all Questions. Each question carries 3 Marks)
1. Outline the errors that arise in hypothesis testing.
2. The number of members of a millionaires’ club were as follows:
Year 2011 2012 2013 2014 2015 2016
Members 23 24 27 25 30 28
(a)What is the average growth rate of the membership?

(b)Based on the results of (a), how many members would one expect in 2018?
231
3. List and explain any two methods for dealing with missing values in a dataset.
4. Consider the following data (in increasing order) for the attribute age: 13, 15, 16, 16, 19, 20,
20, 21, 22, 22, 25, 25, 25, 25, 30, 33, 33, 35, 35, 35, 35, 36, 40, 45, 46, 52, 70. Sketch an
example for stratified sampling using samples of size 5 and the strata “youth,” “middle-aged,”
and “senior.”
5. Why is k nearest neighbor classifier called a lazy learner?
6. Find the absolute support, relative support and confidence of the rule (bread => jam) in the
following set of transactions
T1 {bread, butter}, T2{bread, jam, milk}
T3{Milk, curd}, T4{bread, jam}
7. Explain the 3 Vs of Big Data.
8. Discuss the application of big data analytics in credit risk modeling.
9. Why is Exploratory Data Analysis important in business application ?
10. Explain how box plots be used for data summarization.

(10x3=30)
Part B
11. (a) Illustrate the Maximum Likelihood Estimation of Bernoulli distribution.

(8)
(b) A hiking enthusiast has a new app for his smartphone which summarizes his hikes by
using a GPS device. Let us look at the distance hiked (in km) and maximum altitude (in (6)
m) for the last 10 hikes:
Distance 12.5 29.9 14.8 18.7 7.6 16.2 16.5 27.4 12.1 17.5
Altitude 342 1245 502 555 398 670 796 912 238 466
Calculate the arithmetic mean and median for both distance and altitude.
OR
232
12. (a) Explain the steps in conducting a hypothesis test.

(8)
(b) A total of 150 customers of a petrol station are asked about their satisfaction with their (6)
car and motorbike insurance. The results are summarized below: Determine and
interpret Pearson’s χ2 statistic and Cramer’s V.
Satisfied Unsatisfied Total
Car 33 25 58
Car (Diesel engine) 29 31 60
Motor bike 12 20 32
Total 74 76 150
13. (a) Explain the data analytical process model. (8)
(b) Discuss the methods for handling noisy data. Consider the following sorted data for (6)
price (in dollars) 4, 8, 15, 21, 21, 24, 25, 28, 34.
Illustrate smoothing by bin means and bin boundaries
OR
14. (a) a) What is the need for sampling in data analytics? Discuss the different sampling (8)
techniques.
(b) Use these methods to normalize the following group of data: (6)
200, 300, 400, 600, 1000
(i) min-max normalization by setting min = 0 and max = 1
(ii) z-score normalization
(iii) normalization by decimal scaling .
15. (a) A database has five transactions. Let min_sup be 60% and min_conf be 80%.
.
TID items_bought
T100 {M, O, N, K, E, Y}
T200 {D, O, N, K, E, Y}
T300 {M, A, K, E}
T400 {M, U, C, K, Y}
T500 {C, O, O, K, I, E}
233
(a) Find all frequent itemsets using Apriori algorithm (10)
(b) Generate strong association rules from any one 3 itemset. (4)
OR
16. (a) Explain agglomerative hierarchical clustering with an example. (8)
(b) Suppose that the data mining task is to cluster points (with (x, y) representing location) (6)
into three clusters, where the points areA1(2,10), A2 (2,5), A3 (8,4), B1 (5,8), B2 (7,5),
B3 (6,4), C1(1,2), C2 (4,9). The distance function is Euclidean distance. Suppose
initially we assign A1, B1, and C1as the center of each cluster, respectively. Use the k-
means algorithm to show only
(a) The three cluster centers after the first round of execution.
(b) The final three clusters.
17. (a) Illustrate the working of a Map Reduce program with example.
(8)
(b) Explain the data analytic architecture with a diagram. (6)
OR
18. (a) Discuss the architecture of HDFS and its features. (8)
(b) Illustrate the use of big data analytics in credit risk modeling. (6)
19. (a) List and explain the R functions used in descriptive statistics. (8)
(b) Explain hypothesis testing using ANOVA. (6)
OR
20. (a) Discuss the data visualization for multiple variables in R (8)
(b) Describe the R functions used for cleaning dirty data. (6)
(5 x 14 = 70)
234
Teaching Plan
No Contents No of
Lecture
Hrs
Module – 1(Mathematics for Data Analytics ) (7 hrs)
1.1 Descriptive statistics - Measures of central tendency 1
1.2 Measures of dispersion 1
1.3 Association of two variables - Discrete Variables 1
1.4 Association of two variables - Ordinal and Continuous variable 1
1.5 Probability calculus - Probability distributions 1
1.6 Inductive statistics - Point estimation, Interval estimation 1
1.7 Hypothesis Testing - Basic definitions, t-test 1
Module – 2 (Introduction to Data Analytics) (6 hrs)
2.1 Introduction to Data Analysis –Analytics, Analytics process model 1
2.3 Analytical model requirements 1
2.4 Data Analytics Life Cycle overview 1
2.5 Basics of data collection 1
2.6 Basics of sampling and preprocessing 1
2.7 Dimensionality reduction 1
Module - 3 (Predictive and Descriptive Analytics) (8 hrs)
3.1 Supervised Learning, Naive Bayes classification 1
3.2 KNN algorithm 1
235
3.3 Linear Regression 1
3.4 Unsupervised Learning- Clustering 1
3.5 Hierarchical algorithms Agglomerative algorithm 1
3.6 Partitional algorithms -K- Means 1
3.7 Association Rule Mining 1
3.8 Apriori algorithm 1
Module - 4 (Big Data Analytics) (7 hrs)
4.1 Big Data Overview – State of the practice in analytics. 1
4.2 Example Applications - Credit Risk Modeling 1
4.3 Business Process Analytics. 1
4.4 Big Data Analytics using Map Reduce and Apache Hadoop 1
4.5 Big Data Analytics using Map Reduce and Apache Hadoop 1
4.6 Developing and Executing a Hadoop MapReduce Program 1
4.7 Developing and Executing a Hadoop MapReduce Program 1
Module - 5 (R programming for Data Analysis) (8 hrs)
5.1 Overview of modern data analytic tools, Introduction to R, R 1

Graphical User Interfaces
5.2 Data Import and Export, Attribute and Data Types 1
236
5.3 Descriptive Statistics 1
5.4 Exploratory Data Analysis, Visualization Before Analysis 1
5.5 Dirty Data, Visualizing a Single Variable 1
5.6 Examining Multiple Variable 1
5.7 Data Exploration Versus Presentation 1
5.8 Statistical Methods for Evaluation 1
237
Year Of
FOUNDATIONS Category L T P Credit
CST Introduction
OF SECURITY IN
332
COMPUTING PEC 2 1 0 3 2019
Preamble: The purpose of this course is to create awareness among learners about the
fundamentals of security and number theory. This course covers Integer & Modular Arithmetic,
Primes & Congruences, Discrete Logarithms & Elliptic Curve Arithmetic and an overview of
computer security. The concepts covered in this course enable the learners in effective use of
cryptographic algorithms and to identify the security threats in computing.
Prerequisite: A sound knowledge in Mathematics, Discrete Computational Structures,

Operating Systems and Database Systems.
CO1 Illustrate the operations and properties of algebraic structures, integer

arithmetic and modular arithmetic. (Cognitive Knowledge Level:
Understand)
Use the concepts of prime numbers and factorization for ensuring security in
CO2 computing systems (Cognitive Knowledge Level: Apply)
Illustrate the concepts of Linear Congruence, Primitive Roots, Discrete

CO3 Logarithms and Elliptic Curve Arithmetic (Cognitive Knowledge Level:
Apply)
CO4 Summarize the threats and attacks related to computer and program security
CO5 Outline the key aspects of operating system and database security (Cognitive
238
PO1 PO1 PO1

0 1 2
CO1
CO2
CO3
CO4
CO5

problems
Assessment Pattern
End Semester
Examination (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyse
239
Evaluate
Create
Mark Distribution
150 50 100 3

Syllabus
Module-1 (Modular Arithmetic)
Integer arithmetic - Integer division, Divisibility, Greatest Common Divisor (GCD), Euclid's
algorithm for GCD, Extended Euclid’s algorithm, Linear Diophantine Equations. Modular
240
arithmetic - Operations, Properties. Algebraic structures - Groups, Rings, Fields, Finite fields,
GF(p), GF (2n).
Module-2 (Prime Numbers and Factorization)

Prime numbers - Prime numbers and prime-power factorization, Fermat and Mersenne primes,
Fermat’s theorem, Applications, Euler’s theorem, Euler’s totient function, Applications.
Primality testing – Deterministic algorithms and Probabilistic algorithms. Factorization -
Fermat’s factorization, Pollard p-1 method.
Module-3 (Linear Congruence, Primitive Roots and Elliptic Curve Arithmetic)

Linear congruence - Simultaneous linear congruence, Chinese Remainder Theorem (CRT).
Congruence with a prime - Power modulus, Arithmetic modulo p, Pseudoprimes and Carmichael
numbers, Solving congruence modulo prime powers. Primitive roots - Existence of primitive
roots for primes, Discrete logarithms. Elliptic curve arithmetic – Prime curves, Binary curves,
Addition of two points, Multiplication of a point by a constant.
Module-4 (Computer and Program Security)

Introduction to computer security – Threats, Vulnerabilities, Controls. Browser attack types, Web
attacks targeting users, Email attack types. Introduction to program security - Non-malicious
programming oversights, Malware.
Module-5 (Operating System and Database Security)

Operating system security – Security in operating system, Security in design of operating system.
Database security – Security requirements of databases, Reliability and integrity, Database
disclosure.
Text Books
1. Behrouz A Forouzan, Cryptography and Network Security, 3/e, Tata McGraw-Hill.
2. Charles P Pfleeger, Shari Lawrence Pfleeger, Jonathan Margulies, Security in
Computing, 5/e, Prentice Hall.
3. G.A. Jones & J.M. Jones, Elementary Number Theory, Springer UTM, 2007
241
References
1. William Stallings, Cryptography and Network Security Principles and Practices, 4/e,
Pearson Ed.

1. Find the n- bit word that is represented by the polynomial x2 +1 in GF(25).
2. Solve the linear Diophantine equation 21x + 14y=35.
1. Prove that a Carmichael number cannot be the product of two distinct primes.
2. Use the Pollard p-1 method to find a factor of 57247159 with the bound B=8.
1. Find an integer that has a remainder of 3 when divided by 7 and 13, but is divisible
by 12.
2. In the elliptic curve E(1,2) over the field GF(11), find the equation of the curve and
all the points on the curve.
1. List three controls that could be applied to detect or prevent off-by-one errors.
2. How does fake email messages act as spam?
1. Discuss the importance of auditability and access control in database security.
2. Explain the various factors which can make data sensitive.
242

QP CODE: PAGES: ___
Reg No:_______________
Name:_________________

Course Name : FOUNDATIONS OF SECURITY IN COMPUTING

PART A
1. List the four properties of divisibility with examples.
2. Find gcd (401,700) using Euclid’s algorithm.
3. Use Fermat’s Little theorem to show that 91 is not a prime.
4. If m is relatively prime to n , show that Φ(mn) = Φ(m) Φ(n).
5. Solve the congruence relation 103x ≡ 57 (mod 211).
6. Find a solution for the congruence 3x ≡ 5 mod 73
7. What are the problems created by an off-by-one error?
8. How does a clickjacking attack succeed?
9. Explain the significance of correctness and completeness in the design of operating

systems.
10. How does the two-phase update technique help the database manager in handling
failures? (10x3=30)
Part B
Marks)
243
11. (a) For the group G = < Z6*, x>, prove that it is an Abelian group. Also show the
result of 5 x 1 and 1 ÷ 5. (6)
(b) Find a particular and the general solution to the following linear Diophantine
equations. (8)
i) 19 x+13y = 20 ii) 40 x + 16 y =88
OR
12. (a) Describe the properties of modular arithmetic and modulo operator.
(6)
(b) Using Extended Euclidean algorithm, find the multiplicative inverse of (i) (8)
131 in Z180 and (ii) 23 in Z100.
13. (a) State and prove Fermat’s theorem. (6)
(b) Explain Fermat’s factorization method and use it to factor 809009. (8)
OR
14. (a) Define Euler’s totient function. Prove that, Ø(pq)=(p-1)(q-1) where p and q (7)
are prime numbers.
(b) Define Fermat primes. Show that any two distinct Fermat numbers are (7)
relatively prime.
15. (a) Using Chinese Remainder Theorem, solve the system of congruence, x (7)
≡2(mod 3), x ≡3(mod 5), x ≡2(mod 7).
(b) Define Carmichael number and show that a Carmichael number must be the (7)
product of at least three distinct primes.
OR
16. (a) For the group G = <Z19*, x>, find the primitive roots in the group. (6)
(b) Consider the elliptic curve y2 = x3+ x + 1 defined over Z23. If P = (3, 10) and (8)
Q = (9,7) are two points on the elliptic curve, find 2P and P + Q.
17. (a) Distinguish the terms vulnerability, threat and control. (4)
(b) With the help of suitable examples, explain the security problems created by (10)
incomplete mediation and time-of-check to time-of use.
OR
18. (a) Differentiate between man-in-the-browser attack and page-in-the-middle (4)
attack.
244
(b) Explain the four aspects of malicious code infection. (10)
19. (a) List any six computer security related functions addressed by operating (6)
systems.
(b) How does a kernelized design support in enforcing security mechanisms? (8)
OR
20. (a) Explain any four security requirements of databases. (4)
(b) How can database disclosure be prevented? With the help of suitable (10)
examples, explain any six types of disclosure.
Teaching Plan
No Contents No.of
Lecture
Hrs
Module-1 (Modular Arithmetic) (6 hrs)
1.1 Integer arithmetic, Integer division, Divisibility, Greatest Common 1

Divisor (GCD)
1.2 Euclid's algorithm for GCD, Extended Euclid’s algorithm 1
1.3 Linear Diophantine Equations 1
1.4 Modular arithmetic operations, Properties of modular arithmetic 1
1.5 Groups, Rings and Fields 1

1.6 Finite fields – GF(p), GF(2n) 1
Module-2 (Prime Numbers and Factorization) (7 hrs)
Prime numbers and prime-power factorization

2.1 1
Fermat and Mersenne primes 1
2.2
2.3 Fermat’s theorem, Applications – Exponentiation, Multiplicative 1
inverse
2.4 Euler’s theorem, Euler’s totient function, Applications 1
2.5 Primality testing – Deterministic algorithms – Divisibility algorithm 1
245
2.6 Primality testing – Probabilistic algorithms-Fermat test, Square root 1

test, Miller - Rabin test
2.7 Factorization - Fermat’s factorization, Pollard p-1 method 1
Module-3 (Linear Congruence, Primitive Roots and Elliptic Curve Arithmetic) (7 hrs)
3.1 Linear congruence, Simultaneous linear congruence 1
3.2 Chinese Remainder Theorem (CRT) 1
3.3 Congruence with a Prime-Power Modulus, Arithmetic modulo p 1
3.4 Pseudo-primes and Carmichael numbers 1
3.5 Solving congruence modulo prime powers 1
3.6 Primitive roots, Existence of primitive roots for primes, Discrete 1

logarithms
3.7 Elliptic curve arithmetic – Prime curves, Binary curves, Addition of 1

two points, Multiplication of a point by a constant
Module-4 (Computer and Program Security) (7 hrs) (Text book2: Chapters 1, 3, 4)
Threats, Vulnerabilities, Controls

4.1 1
4.2 Browser attack types 1

Web attacks targeting users
4.3 1
4.4 Email attack types 1
4.5 Non-malicious programming oversights (Lecture 1) 1
4.6 Non-malicious programming oversights (Lecture 2) 1
4.7 Malware – Four aspects of infection 1
Module-5 (Operating System and Database Security) (8 hrs)(Text book2: Chapters 5, 7)
Security in operating system (Lecture 1)

5.1 1
5.2 Security in operating system (Lecture 2) 1

5.3 Security in design of operating system (Lecture 1) 1
246
5.4 Security in design of operating system (Lecture 2) 1
5.5 Security requirements of databases 1
5.6 Reliability & integrity 1
5.7 Database disclosure (Lecture 1) 1
5.8 Database disclosure (Lecture 2) 1
247
YEAR OF
CST AUTOMATED Category L T P CREDIT
INTRODUCTION
342 VERIFICATION
PEC 2 1 0 3 2019
Preamble: This course is intended to impart the basic theory and algorithm for an automatic
verification process namely model checking. This course covers finite-state modelling of
hardware/software, linear-time properties, classification of linear-time properties, Linear
Temporal Logic (LTL) - a formal language for property specification, LTL model checking
algorithm and model checking case studies. This course enables the learners to prove correctness
of a hardware/software used in safety critical systems in domains such as avionics, health care
and automotive.
Prerequisite: NIL
CO1 Illustrate an application for model checking. (Cognitive Knowledge Level:

Understand)
CO2 Describe finite-state modelling for hardware and software. (Cognitive Knowledge
Level: Understand)
CO3 Identify linear-time properties required to represent the requirements of a system.

CO4 Specify a given linear-time property in Linear Temporal Logic (LTL). (Cognitive
CO5 Perform LTL model checking using the tool Symbolic Analysis Laboratory (SAL).
248
0 1 2
CO1
CO2
CO3
CO4
CO5

problems
249
Assessment Pattern

Examination Marks
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3 hours
Continuous Assessment Assignment : 15 marks (Out 15, 10 marks shall be given for a model
checking project to be implemented in SAL.)
250
Syllabus
Module - 1 (Introduction to Model Checking)
System Verification – Hardware and Software Verification, Model Checking, Characteristics of

Model Checking.
Transition Systems – Transition System, Direct Predecessors and Successors, Terminal State,
Deterministic Transition System.
Executions - Execution Fragment, Maximal and Initial Execution Fragment, Execution,
Reachable States.
Module - 2 (Linear Time Properties)
Linear-Time (LT) Properties - Deadlock. Linear-Time Behavior - Paths and State Graph, Path
Fragment, Maximal and Initial Path Fragment, Path. Traces - Trace and Trace Fragment, LT
Properties - LT Property, Satisfaction Relation for LT Properties, Trace Equivalence and LT
Properties. Safety Properties and Invariants - Invariants, Safety Properties, Trace Equivalence
and Safety properties. Liveness Properties - Liveness Property, Safety vs. Liveness Properties.
Fairness - Fairness, Unconditional, Weak and Strong Fairness, Fairness Strategies, Fairness and
Safety. (Definition and examples only for all topics - no proof required).
Module - 3 (Regular Properties)
Regular Properties - Model Checking Regular Safety properties - Regular Safety property,
Verifying Regular Safety Properties. Automata on Infinite Words - ⍵ -Regular Languages and
Properties, Nondeterministic Buchi Automata (NBA), Deterministic Buchi Automata (DBA),
251
Generalised Buchi Automata (Definitions only). Model Checking ⍵ -Regular Properties -

Persistence Properties and Product, Nested Depth-First Search (Only algorithms required).
Module - 4 (Linear Time Logic)
Linear Temporal Logic (LTL) - Syntax, Semantics, Equivalence of LTL Formulae, Weak Until,
Release and Positive Normal Form, Fairness, Safety and Liveness in LTL (Definitions only).
Automata Based LTL Model Checking (Algorithms and examples only).
Module - 5 (Model Checking in SAL)
Introduction - Introduction to the tool Symbolic Analysis Laboratory (SAL).
The Language of SAL - The expression language, The transition Language, The module
language, SAL Contexts.
SAL Examples - Mutual Exclusion, Peterson’s Protocol, Synchronous Bus Arbiter, Bounded
Bakery protocol, Bakery Protocol, Traffic Signalling System.
Text Books
1. Christel Baier and Joost-Pieter Katoen, Principles of Model Checking, The MIT Press.
(Modules 1 - 4)
2. Leonardo de Moura, Sam Owre and N. Shankar, The SAL Language Manual, SRI
International (http://sal.csl.sri.com/doc/language-report.pdf, Chapters 1, 3, 4, 5, 6, 7)
(Module 5)
Reference Materials
1. SAL Examples (http://sal.csl.sri.com/examples.shtml) (Module 5)

1. Illustrate how model checking can make a system design reliable, based on a required set
of properties/constraints.
1. Consider a message delivery system. The sender s is trying to send a series of messages
to the receiver r in such a way that the (i+1)st message is sent only after the ith message is
delivered. There is a possibility of error in sending a message and in that case, s keeps on
252
trying until it is able to send the message. Show a finite state transition system modeling
this system.
1. Consider a shared memory segment s protected using a mutex lock variable m. Two
processes p1 and p2 are trying to access s. List the Linear Time properties of the system
which will ensure safety, liveness and fairness.
1. Show the LTL specifications of the safety, liveness and fairness properties listed for the
assessment question given in CO3.
1. Model the system mentioned in the question given in CO3 in SAL and verify that the
system is correct with respect to the LTL properties shown as the answer for CO4.
QP CODE: PAGES: 3
Reg No:______________ Name :______________
Course Code: CST342
Course Name: Automated Verification
PART A
Answer all questions. Each question carries 3 marks.
1. Define model checking. Show the schematic diagram of the model checking
approach.
2. Show a transition system modeling a coffee/Tea vending machine.
253
3. Define invariant as a Linear Time (LT) property. Give an example
4. List any three Linear Time properties in the Mutual Exclusion problem of
processes.
5. Illustrate the construction of a product automaton from two automata.
6. Differentiate between Deterministic Buchi Automaton and Non-deterministic

Buchi Automaton.
7. Specify the following statements about traffic lights in Linear Temporal Logic
(LTL).
a. Once red, the light can not become green immediately.
b. Once red, the light always becomes green eventually after being yellow
for some time.
8. What is Positive Normal Form (PNF) in LTL? Give an example.
9. List any three applications of the tool Symbolic Analysis Laboratory (SAL).
10. What is a SAL context? Give an example.

(10x3=30)
Part B
11. (a) Explain in detail the various phases of the model checking process.
(8)
(b) Explain the strengths and weaknesses of model checking. (6)
OR
12. (a) Define and illustrate the following terms of a transition system.
a. Execution Fragment (14)
b. Maximal and Initial Execution Fragment
c. Execution
d. Reachable States
254
13. (a) With an example, explain the satisfaction relation for LT properties.
(7)
(b) What is trace equivalence in Transition Systems? Give an example to show that if
two transition systems satisfy the trace equivalence property, then they satisfy the (7)
same set of LT properties.
OR
14. (a) Give the transition system for the fault tolerant variant of the dining (4)
philosophers problem.
(b) With a suitable example, explain the algorithms to check whether a (10)
Transition System satisfies an invariant or not.
15. (a) Explain Regular Safety Properties with a suitable example. (7)
(b) Illustrate an algorithm for verifying Regular Safety Properties. (7)
OR
16. (a) Explain ⍵-Regular Properties.

(4)
(b) Illustrate how ⍵-Regular Properties are verified. (10)
17. (a) Explain the syntax of Linear Temporal Logic (LTL). (7)
(b) Explain the semantics of LTL. (7)
OR
18. (a) With an example, give the difference between until and weak until in LTL. (4)
(b) With a suitable example, explain automata based LTL model checking. (10)
19. (a) Explain Peterson’s protocol. What are the LTL properties to be verified to (8)
ensure its correctness?
(b) Write a SAL script for the verification of Peterson’s protocol. (6)
255
OR
20. (a) Show the SAL model corresponding to Bakery protocol. (8)
(b) List any three Linear Time properties of this model and show their LTL (6 )
Teaching Plan
Module 1 (Introduction to Model Checking) 4 Hours

1.1 System Verification – Hardware and Software Verification, Model 1 Hour
Checking, Model Checking
1.2 Transition Systems – Transition System, Direct Predecessors and 1 Hour
Successors, Terminal State, Deterministic Transition System
1.3 Executions - Execution Fragment, Maximal and Initial Execution 1 Hour
Fragment
1.4 Execution, Reachable States 1 Hour
Module 2 (Linear Time Properties) 8 Hours
2.1 Linear-Time (LT) Properties - Deadlock 1 Hour
2.2 Linear-Time Behavior - Paths and State Graph, Path Fragment, Maximal 1 Hour
and Initial Path Fragment, Path
2.3 Traces - Trace and Trace Fragment 1 Hour
2.4 LT Property, Satisfaction Relation for LT Properties, Trace Equivalence 1 Hour
and LT Properties
2.5 Invariants 1 Hour
2.6 Safety Properties, Trace Equivalence and Safety properties 1 Hour
2.7 Liveness Property, Safety vs. Liveness Properties 1 Hour
2.8 Fairness, Unconditional, Weak and Strong Fairness, Fairness Strategies, 1 Hour
Fairness and Safety
Module 3 (Regular Properties)
9 Hours
3.1 Regular Properties - Model Checking Regular Safety properties - 1 Hour
Regular Safety property
3.2 Verifying Regular Safety Properties 1 Hour
3.3 Automata on Infinite Words - ⍵ -Regular Languages and Properties 2 Hour
256
3.4 Nondeterministic Buchi Automata (NBA), Deterministic Buchi Automata 1 Hour

(DBA), Generalised Buchi Automata
3.5 Model Checking ω-Regular Properties - Persistence Properties and 1 Hour
Product - Lecture 1
3.6 Persistence Properties and Product - Lecture 2 1 Hour
Module 4 (Linear Time Logic)
7 Hours
4.1 Linear Temporal Logic – Linear Temporal Logic (LTL) - Syntax 1 Hour
4.3 Equivalence of LTL Formulae, Weak Until 1 Hour
4.4 Release and Positive Normal Form 1 Hour
4.5 Fairness, Safety and Liveness in LTL 1 Hour
4.6 Automata Based LTL Model Checking (Lecture 1) 1 Hour
4.7 Automata Based LTL Model Checking (Lecture 2) 1 Hour
Module 5 (Model Checking in SAL) 7 Hours
5.1 Introduction - Introduction to the tool Symbolic Analysis Laboratory
(SAL). 1 Hour
5.2 The Language of SAL - The expression language, The transition 1 Hour
Language
5.3 The module language, SAL Contexts. 1 Hour
5.4 SAL Examples - Mutual Exclusion 1 Hour

5.5 Peterson’s Protocol, Synchronous Bus Arbiter 1 Hour
5.6 Bounded Bakery protocol, Bakery Protocol 1 Hour
5.7 Traffic Signalling System 1 Hour
257
Year of
CST PROGRAMMING IN Category L T P Credit
Introduction
362 PYTHON
PEC 2 1 0 3 2019
Preamble: The objective of the course is to equip the learners to develop multi-module software
solutions for real world computational problems using Python. It encompasses the Python
programming environment, syntax, data representations, intermediate level features, GUI
programming, Object Oriented Programming and data processing. This course lays the
foundation to develop modular software solutions including complex interactive applications,
network applications, and data-driven intelligent applications.
Prerequisite: Basic knowledge in Computational Problem Solving, A course in any

programming language.
Write, test and debug Python programs (Cognitive Knowledge level:
CO1
Apply)
Illustrate uses of conditional (if, if-else and if-elif-else ) and
CO2 iterative (while and for) statements in Python programs. (Cognitive
Develop programs by utilizing the Python programming constructs such as Lists,
CO3
Tuples, Sets and Dictionaries. (Cognitive Knowledge level: Apply)
Develop graphical user interface for solutions using Python libraries. (Cognitive
CO4
Implement Object Oriented programs with exception handling. (Cognitive
CO5
Write programs in Python to process data stored in files by utilizing
CO6
Numpy, Matplotlib, and Pandas. (Cognitive Knowledge level: Apply)
258
PO1
0
CO1 ✔ ✔ ✔ ✔ ✔
CO2 ✔ ✔ ✔ ✔
CO3 ✔ ✔ ✔ ✔ ✔ ✔
CO4 ✔ ✔ ✔ ✔ ✔ ✔
CO5 ✔ ✔ ✔ ✔ ✔ ✔
CO6 ✔ ✔ ✔ ✔ ✔ ✔ ✔
PO4 Conduct investigations of complex problems PO10 Communication
Assessment Pattern
Test 1 (Marks in Test 2 (Marks in End Semester

Bloom’s Category
percentage) percentage) Examination Marks
Remember 20 20 20
259
Understand 35 35 35
Apply 45 45 45
Analyse
Evaluate
Create
Mark Distribution
150 50 100 3



260
SYLLABUS
Module -1 (Programming Environment and Python Basics) (6 hours)
Getting started with Python programming – Interactive shell, IDLE, iPython Notebooks,
Detecting and correcting syntax errors, How Python works. The software development process –
A case study. Basic coding skills – strings, assignment, and comments, Numeric data types and
character sets, Expressions, Using inbuilt functions and modules. Control statements – Iteration
with for/while loop, Formatting text for output, A case study, Selection structure (if-else, switch-
case), Conditional iteration with while, A case study, Testing control statements, Lazy evaluation.
Module -2 (Building Python Programs) (8 hours)
Strings and text files – Accessing characters, substrings, Data encryption, Strings and number
system, String methods, Text files, A case study on text analysis. Design with Functions –
Functions as Abstraction Mechanisms, Problem solving with top-down design, Design with
recursive functions, Managing a program’s namespace, Higher-Order Functions. Lists - Basic list
Operations and functions, List of lists, Slicing, Searching and sorting list, List comprehension.
Work with tuples. Sets. Work with dates and times, A case study with lists. Dictionaries -
Dictionary functions, dictionary literals, adding and removing keys, accessing and replacing
values, traversing dictionaries, reverse lookup. Case Study – Data Structure Selection.
Module -3 (Graphics) (7 hours)
Graphics – Terminal-based programs, Simple Graphics using Turtle, Operations, 2D Shapes,
Colors and RGB Systems, A case study. Image Processing – Basic image processing with inbuilt
functions. Graphical User Interfaces – Event-driven programming, Coding simple GUI-based
programs : Windows, Labels, Displaying images, Input text entry, Popup dialog boxes,
Command buttons, A case study.
Module -4 (Object Oriented Programming) (7 hours)
Design with classes - Objects and Classes, Methods, Instance variables, Constructor, Accessor
and Mutator, Data-Modeling Examples, Structuring classes with inheritance and polymorphism.
Abstract classes, Interfaces, Exceptions - Handle a single exception, handle multiple exceptions.
Module -5 (Data Processing) (9 hours)
The os and sys modules, NumPy - Basics, Creating arrays, Arithmetic, Slicing, Matrix
Operations, Random numbers. Plotting and visualization. Matplotlib - Basic plot, Ticks, Labels,
and Legends. Working with CSV files. – Pandas - Reading, Manipulating, and Processing Data.
Introduction to Micro services using Flask.
261
Text Books:
1. Kenneth A Lambert., Fundamentals of Python : First Programs, 2/e, Cengage Publishing, 2016
3. Flask: Building Python web services, Jack Stouffer, Shalabh Aggarwal, Gareth Dwyer,
PACKT Publishing Limited, 2018
Reference Books:
1. Zed A Shaw, Learn Python 3 The Hard Way, Addison-Wesley, 2017
2. Allen B. Downey, Think Python: How to Think Like a Computer Scientist, 2/e, Schroff, 2016

1. What is type conversion? How is it done in Python?
2. Write a note on the Python editors.

1. Write a Python program which takes a positive integer n as input and finds the sum of cubes
all positive even numbers less than or equal to the number.
2. What is printed when the below code is executed?
mysum = 0
for i in range(5, 11, 2):
mysum += i
if mysum == 5:
break
mysum += 1
print(mysum)
What would be the output if ‘break’ is replaced with ‘continue’ in the above code fragment?
1. Given is a list of of words, wordlist, and a string, name. Write a Python function which takes
wordlist and name as input and returns a tuple. The first element of the output tuple is the
number of words in the wordlist which have name as a substring in it. The second element of
262
the tuple is a list showing the index at which the name occurs in each of the words of the
wordlist and a 0 if it doesn’t occur.
2. What is the value of L after you run the code below?
L = ["life", "answer", 42, 0]
for thing in L:
if thing == 0:
L[thing] = "universe"
elif thing == 42:
L[1] = "everything"

1. A bouncy program is defined as follows – The program computes and displays the total
distance traveled by a ball, given three inputs—the initial height from which it is dropped, its
bounciness index, and the number of bounces. Given the inputs write a GUI-based program
to compute the total distance traveled.
2. Write a Python program to find the quadrant of a point, say (x,y).

1. Write a Python program to implement the addition, subtraction, and multiplication of
complex numbers using classes. Use constructors to create objects. The input to the program
consist of real and imaginary parts of the complex numbers.
2. Explain inheritance in Python using suitable examples.

1. Given a file “auto.csv” of automobile data with the fields index, company, body-style, wheel-
base, length, engine-type, num-of-cylinders, horsepower, average-mileage, and price, write
python code to
1. Clean and Update the CSV file
2. Print total cars of all companies
3. Find the average mileage of all companies
4. Find the highest priced car of all companies.
2. Given two matrices A and B, write a program to find the product of A and BT.
263
QP CODE: PAGES:
Reg No:_______________
Name:_________________
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY SIXTH SEMESTER B.TECH


Course name : PROGRAMMING IN PYTHON
PART-A
Write a Python program to reverse a number and also find the sum of digits of the number.
1.
Prompt the user for input.
2.
3. Illustrate format specifiers and escape sequences with examples.
4. Compare tuples, lists, and dictionaries with examples.
Describe the following dictionary methods with an example.
5.
i. get( ) ii. Keys( ) iii. pop( ) iv. update( ) v. values( ) vi. items( )
6. Differentiate the terminal-based and GUI-based programming in Python.
Explain the os and os.path modules in Python with examples. Also, discuss the walk( )
9.
and getcwd( ) methods of the os module.
10. What are the important characteristics of CSV file format.
PART-B
264
11. (a) Write a Python code to check whether a given year is a leap year or not (6)
[An year is a leap year if it’s divisible by 4 but not divisible by 100
except for those divisible by 400].
OR
12. (a) Write a Python program to find the value for sin(x) up to n terms using the (6)
series
where x is in degrees
(b) Write a Python code to determine whether the given string is a Palindrome (8)
or not using slicing. Do not use any string function.
13. (a) Write a Python code to create a function called list_of_frequency that takes a (5)
string and prints the letters in non-increasing order of the frequency of their
occurrences. Use dictionaries.
should be written to sort the list wherein the name of the list is passed as the
parameter.
OR
14. (a) Illustrate the following Set methods with an example. (6)
discard( )
user.
265
15. (a) Write a program to draw a hexagon using turtle. (5)

(b) Write a note on the image processing function in Python. (9)
OR
16. (a) Describe the features of event driven programming. (4)
(b) Write a GUI-based program that allows the user to convert temperature (10)
values between degrees Fahrenheit and degrees Celsius. The interface
should have labeled entry fields for these two values. These components
should be arranged in a grid where the labels occupy the first row and the
corresponding fields occupy the second row. At start-up, the Fahrenheit field
should contain 32.0, and the Celsius field should contain 0.0. The third row
in the window contains two command buttons, labeled >>>> and <<<<.
When the user presses the first button, the program should use the data in
the Fahrenheit field to compute the Celsius value, which should then be
output to the Celsius field. The second button should perform the inverse
function.
OR
18. (a) Write a Python class named Circle constructed by a radius and two methods (6)
which will compute the area and the perimeter of a given circle
(b) Write Python program to create a class called as Complex and implement (8)
__add__( ) method to add two complex numbers. Display the result by
overloading the + Operator.
19. (a) Write a Python program to add two matrices and also find the transpose of (8)
the resultant matrix.
266

OR
20. (a) Write Python program to write the data given below to a CSV file. (5)
bar chart
Calculate total sale data for last year for each product and show it using a
Pie chart.
(14X5=70)
Teaching Plan
Module 1: Programming Environment and Python Basics (6 hours)
Getting started with Python programming – Interactive shell, IDLE, iPython

1.1 1 hour
Notebooks, Detecting and correcting syntax errors, How Python works.
1.2 The software development process – A case study. 1 hour
Basic coding skills – strings, assignment, and comments, Numeric data

1.3 1 hour
types and character sets
1.4 Expressions, Using inbuilt functions and modules. 1 hour
1.5 Control statements – Definite Iteration with for loop, Formatting text for 1 hour
output, Selection structure (if-else, switch-case), Conditional iteration with
267
while loop, A case study
1.6 Testing the control statements, Lazy evaluation. 1 hour
Module 2: Building Python Programs (8 hours)
Strings – Accessing characters, substrings, Data encryption, Strings and

2.1 1 hour
number system, String methods,
2.2 Text files, A case study on text analysis. 1 hour
Design with Functions – Functions as Abstraction Mechanisms, Problem

2.3 1 hour
solving with top-down design,
Design with recursive functions, Managing a program’s namespace, Higher-

2.4 1 hour
Order Functions.
Lists - Basic list Operations and functions, List of lists, Slicing, Searching
2.5 1 hour
and sorting list, List comprehension.
2.6 Work with tuples. Sets. Work with dates and times, A case study with lists. 1 hour
Dictionaries - Dictionary functions, dictionary literals, adding and removing

2.7 keys, accessing and replacing values, traversing dictionaries, reverse 1 hour
lookup.
2.8 Case Study - Data Structure Selection. 1 hour
Module 3: Graphics (7 hours)
3.1 Graphics – Simple Graphics using Turtle, Operations, 2D Shapes, 1 hour
3.2 Colors and RGB Systems, A case study. 1 hour
3.3 Image Processing – Basic image processing with inbuilt functions. 1 hour
3.4 Graphical User Interfaces – Event-driven programming 1 hour
3.5 Coding simple GUI-based programs : Windows, Labels, Displaying images, 1 hour
Coding simple GUI-based programs : Input text entry, Popup dialog boxes,
3.6 1 hour
Command buttons
3.7 A case study - GUI 1 hour
268
4.2 Constructor, Accessors, and Mutators 1 hour
4.7 Exceptions : Handle a single exception, handle multiple exceptions 1 hour
Module 5: Data Processing (9 hours)
The os and sys modules, NumPy : Basics, Creating arrays, Arithmetic,

5.1 1 hour
Slicing
5.2 Matrix Operations, Random numbers. 1 hour
5.3 Matplotlib : Basic plot, Ticks, Labels, and Legends 1 hour
5.5 Pandas : Reading, Manipulating 1 hour
5.6 Pandas : Processing Data and Visualize. 1 hour
5.7 Introduction to Microservices using Flask 1 hour
269
Year of
DATA AND Category L T P Credits
CST Introduction
COMPUTER
372
COMMUNICATION PEC 2 1 0 3 2019
Preamble:
The purpose of this course is to prepare learners to understand the communication entities and
the associated issues in data transmission. This course covers fundamental concepts of data
transmission in digital and analog form, transmission media, concepts of encoding, multiplexing,
spread spectrum and switching methods. This course helps the learner to gain insight into the
important aspects of data communication and computer networking systems and enables to apply
in practical applications.
Prerequisite: NIL
CO# Course Outcomes
CO1 Identify the characteristics of signals for analog and digital transmissions
CO2 Identify the issues in data transmission (Cognitive knowledge: Apply)
CO3 Select transmission media based on characteristics and propagation modes

CO4 Choose appropriate signal encoding techniques for a given scenario (Cognitive
knowledge: Apply)
CO5 Illustrate multiplexing and spread spectrum technologies (Cognitive

knowledge: Apply)
CO6 Use error detection, correction and switching techniques in data communication
270
PO1 PO1 PO1

0 1 2
CO1
CO2
CO3
CO4
CO5
CO6

problems
Assessment Pattern

Bloom’s Category
Test 1 (%) Test 2 (%) (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
271
Analyze
Evaluate
Create
Mark Distribution

150 50 100 3



272
Syllabus
Module-1 (Data Transmission Basics)
Communication model - Simplex, Half duplex, Full duplex transmission. Periodic analog signals
- Sine wave, Amplitude, Phase, Wavelength, Time and frequency domain, Bandwidth. Analog &
digital data and signals. Transmission impairments - Attenuation, Delay distortion, Noise. Data
rate limits - Noiseless channel, Nyquist bandwidth, Noisy channel, Shannon's capacity formula.
Module-2 (Transmission Media)
Guided transmission media - Twisted pair, Coaxial cable, Optical fiber. Unguided media - Radio
waves, Terrestrial microwave, Satellite microwave, Infrared. Wireless propagation - Ground
wave propagation, Sky wave propagation, Line-of-Sight (LoS) propagation.
Module-3 (Digital Transmission and Analog Transmission)
Digital data to digital signal – Non-Return-to-Zero (NRZ), Return-to-Zero (RZ), Multilevel

binary, Biphase. Analog data to digital signal - Sampling theorem, Pulse Code Modulation
(PCM), Delta Modulation (DM). Digital data to analog signal - Amplitude Shift Keying (ASK),
Frequency Shift Keying (FSK), Phase Shift Keying (PSK). Analog data to analog signal -
Amplitude Modulation (AM), Frequency Modulation (FM), Phase Modulation (PM).
Module-4 (Multiplexing and Spread Spectrum)
Multiplexing - Frequency Division Multiplexing (FDM), Wavelength Division Multiplexing

(WDM), Time Division Multiplexing (TDM), Characteristics, Synchronous TDM, Statistical
TDM. Spread spectrum techniques - Direct Sequence Spread Spectrum (DSSS), Frequency
Hopping Spread Spectrum (FHSS), Code Division Multiplexing, Code Division Multiple Access
(CDMA).
Module-5 (Error Detection, Correction and Switching)
Digital data communication techniques - Asynchronous transmission, Synchronous transmission.

Detecting and correcting errors - Types of errors, Parity check, Checksum, Cyclic Redundancy
Check (CRC), Forward Error Correction (FEC), Hamming distance, Hamming code. Basic
principles of switching - Circuit switching, Packet switching, Message switching.
Text Books
1. Forouzan B. A., Data Communications and Networking, 5/e, McGraw Hill, 2013.
2. William Stallings, Data and Computer Communication 9/e, Pearson Education, Inc.
273
References

1. If the spectrum of a channel is between 3 MHz and 4 MHz and SNRdB = 24 dB,
calculate the Shannon capacity.
2. Assume that a periodic signal is composed of five sine waves with frequencies 200,
400, 600, 800 and 1000 Hz. Determine the bandwidth. Draw the spectrum assuming
all components have a maximum amplitude of 5 V.
1. Given a receiver with an effective noise temperature of 294 K and a bandwidth of 10
MHz. Find the thermal noise level at the receiver side in dBW.
2. The loss in a cable is usually defined in decibels per kilometer (dB/km). If the signal
at the beginning of a cable with -0.3 db/km has a power of 2 mW, determine the
power of the signal at 5 km.
1. Explain the reflective property of a parabolic antenna.
2. Two separate frequencies are used for uplink and downlink transmission in satellite
communication. Give reason.
1. Encode the data sequence 101011100 using Multilevel binary and Biphase schemes.
2. Encode the data bits 00101101110001 using 2B1Q encoding scheme. Assume
negative original level.
1. The frequency spectrum of input signals will move to high frequency bands by the
FDM process. Justify.
2. Four channels are multiplexed using TDM. If each channel sends 100 bytes/sec and
we multiplex one byte per channel, determine the frame size, duration of a frame,
frame rate and bit rate of link.
1. Using the divisor polynomial x4 + x + 1, determine the Cyclic Redundancy Check
(CRC) for the dataword 10110100. Also, perform the checking at the receiver side.
2. How many redundancy bits are required to generate the Hamming code for a 7-bit
data? Assuming even parity, generate the Hamming code for the 7-bit dataword
1001101. If the fifth bit from the left of the received codeword is changed to 0, can
274
this be detected? Give reasons for your answer.

QP CODE: PAGES: 3
Reg No:_______________
Name:_________________

Course Name : Data and Computer Communication
PART A
1. Define bandwidth. Find the lowest frequency, if a periodic signal has a bandwidth
of 20 Hz and the highest frequency is 60 Hz. Draw the spectrum if the signal
contains all frequencies of the same amplitude.
2. Assume that a TV picture is to be transmitted over a channel with 4.5 MHz

bandwidth and a 35 dB Signal-to-Noise-Ratio. Find the capacity of the channel.
3. How does twisting affect the performance in a twisted pair cable?
4. Which wireless propagation method is suitable for satellite communication?

Justify your answer.
5. Explain the two main distortions that can occur in a delta modulated waveform.
How can it be avoided?
6. Illustrate the equivalent square wave pattern of the bit string 01001101 using
Non-Return-to-Zero (NRZ) - Level and NRZ-Invert encoding schemes.
7. Apply Direct Sequence Spread Spectrum to the data 101 using the Barker
sequence 10110111000. Show the encoding and decoding steps.
8. Compare synchronous and statistical time division multiplexing.
9. Find the minimum hamming distance for the following cases:

a) Detection of two errors
275
b) Correction of two errors

c) Detection of three errors
10. Find the parity bit for simple even parity check for the following.
a) 1001010 (10x3=30)
b) 0001100
c) 1000000
Part B
Marks)
11. (a) With the help of suitable figures, distinguish between time and frequency
domain representations. (4)
(b) Describe the different types of transmission impairments.

(10)
OR
12. (a) Calculate the bandwidth, if a periodic signal is decomposed into 4 sine waves
with frequencies 50 Hz, 100 Hz, 150 Hz and 200 Hz. Draw the spectrum, (6)
assuming all components having an amplitude in the range 6-12 V and all are
multiples of two in the increasing order.
(b) Distinguish between Nyquist bandwidth and Shannon capacity. Consider a (8)
noiseless channel with a bandwidth of 3000 Hz transmitting a signal with (i)
Two signal levels (ii) Four signal levels. Determine the maximum bit rate in
both cases.
13. (a) For a parabolic reflective antenna operating at 12 GHz with a diameter of 2 (6)
m, calculate the effective area and the antenna gain.
(b) List any four advantages and disadvantages of twisted pair, coaxial cable and
fiber optic cable. (8)
OR
14. (a) Compare the features of terrestrial microwave and satellite microwave. (6)
(b) With the help of suitable diagrams, differentiate Multi-mode and Single- (8)
mode optical fibres. How are the rays propagated in Step-index and Graded-
index Multi-mode fibres?
276
15. (a) Distinguish between data rate and signal rate. (4)
(b) How is polar encoding done? Encode the pattern 010011001110 using the (10)
two Biphase schemes.
OR
16. (a) Show the equivalent analog sine wave pattern of the bit string 010011010
using Amplitude Shift Keying, Frequency Shift Keying and Phase Shift (4)
Keying.
(b) State Sampling theorem. Explain Pulse Code Modulation with suitable (10)
figures.
17. (a) Four channels are multiplexed using Time Division Multiplexing. If each (6)
channel sends 100 bytes/sec and we multiplex one byte per channel,
determine the frame size, duration of a frame, frame rate and bit rate of the
link.
(b) Explain the working of Frequency Hopping Spread Spectrum with an (8)
example.
OR
18. (a) Explain any three techniques by which the disparity in input data rate is (4)
handled by Time Division Multiplexing. Give examples.
(b) Suppose Alice and Bob are communicating using Code Division Multiple (10)
Access. Alice uses the code [+1 +1] and Bob uses the code [+1 -1]. Alice
sends a data bit 0 and Bob sends a data bit 1. Show the data in the channel
and how they can detect what the other person has sent.
19. (a) Explain two-dimensional parity check with examples. (4)
(b) Describe the need for a switch in a communication system. What are the (10)
different phases in circuit switching?
OR
20. (a) Explain the virtual circuit approach of packet switching with a suitable (6)
example.
(b) Find the Hamming code for the data word 1011001. Assume odd parity. (8)
277
Teaching Plan
No Contents No.of
Lecture
Hrs (35
hrs)
Module-1 (Data Transmission Basics) (6 hrs)
1.1 Introduction, Communication model, Simplex, Half duplex, Full duplex 1

transmission, Periodic analog signals, Sine wave, Amplitude, Phase,
Wavelength
1.2 Time and frequency domain, Bandwidth 1
1.3 Analog & digital data and signals 1
1.4 Transmission impairments, Attenuation, Delay distortion, Noise 1

1.5 Data rate limits, Noiseless channel, Nyquist bandwidth 1
1.6 Noisy channel, Shannon's capacity formula 1
Module-2 (Transmission Media) (6 hrs)

Guided transmission media, Twisted pair, Coaxial cable
2.1 1
Optical fiber 1
2.2
2.3 Unguided media, Radio waves 1
2.4 Terrestrial microwave, Satellite microwave 1
2.5 Infrared 1
2.6 Wireless Propagation, Ground wave, Sky wave, Line-of-Sight (LoS) 1

propagation
Module-3 (Digital Transmission and Analog Transmission) (8 hrs)
3.1 Digital data to digital signal, Non-Return-to-Zero (NRZ), Return-to- 1

Zero (RZ)
3.2 Multilevel binary and Biphase 1
3.3 Analog data to digital signal, Sampling theorem, Pulse Code 1

Modulation (PCM)
278
3.4 Delta Modulation (DM) 1
3.5 Digital data to analog signal, Amplitude Shift Keying (ASK) 1
3.6 Frequency Shift Keying (FSK), Phase Shift Keying (PSK) 1
3.7 Analog data to analog signal, Amplitude Modulation (AM) 1
3.8 Frequency Modulation (FM), Phase Modulation (PM) 1
Module-4 (Multiplexing and Spread Spectrum) (7 hrs)
Multiplexing, Frequency Division Multiplexing (FDM), Wavelength

4.1 1
Division Multiplexing (WDM)
4.2 Time Division Multiplexing (TDM), Characteristics, Synchronous 1

TDM, Statistical TDM
Spread spectrum techniques, Direct Sequence Spread Spectrum (DSSS)
4.3 1
4.4 Frequency Hopping Spread Spectrum (FHSS) 1
4.5 Code Division Multiplexing 1
4.6 Code Division Multiple Access (CDMA) (Lecture 1) 1
4.7 CDMA (Lecture 2) 1
Module-5 (Error Detection, Correction and Switching) (8 hrs)
Digital data communication techniques, Asynchronous & Synchronous

5.1 1
transmission
5.2 Detecting and correcting errors, Types of errors, Parity check, Checksum 1
5.3 Cyclic Redundancy Check (CRC) 1
5.4 Forward Error Correction (FEC), Hamming distance 1
5.5 Hamming code 1
5.6 Basic principles of switching, Circuit switching 1
5.7 Packet switching 1
5.8 Message switching 1
279
SEMESTER VI
MINOR
280
CST INTRODUCTION Category L T P Credits Year of

382 TO SOFTWARE Introduction
TESTING
VAC 3 1 0 4 2019
Preamble:
This is a course in theoretical computer science that includes test cases for white-box, black-
box, and grey-box approaches. This course describes the various techniques for test case design
used to test software artifacts, including requirements, design, and code. The course includes
different techniques for test case design based on graphs, programming language syntaxes and
inputs. The course also covers symbolic execution using PEX tool.
Course Outcomes: After the completion of the course the student will be able to:-
List a range of different software testing techniques and be able to apply specific unit
CO1 testing method to the projects using Junit. (Cognitive Knowledge Level:
Understand)
Explain mutation testing method for a given piece of code to identify hidden defects
CO2 that can’t be detected using other testing methods. (Cognitive Knowledge Level:
Understand)
Explain graph coverage criteria in terms of control flow graph and data flow graph
CO3
for a given program. (Cognitive Knowledge Level: Understand)
Demonstrate the importance of black-box approaches in terms of domain and

CO4
functional testing. (Cognitive Knowledge Level: Understand)
Illustrate the use of PEX tool with symbolic execution. (Cognitive Knowledge
CO5
Level: Apply)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO 9 PO10 PO11 PO12
CO1
CO2
281
CO3
CO4
CO5
Assessment Pattern

Marks
Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
Analyze
Evaluate
Create
282
Mark Distribution
Total CIE ESE ESE

150 50 100 3 hours



283
Syllabus
Module - 1 (Introduction to Software Testing)
Some Popular Errors – Ariane 5, Therac 25, Intel Pentium Bug. What is Software testing? Why should it
be tested? Software Quality, Role of Testing. Testing Process - Level 0 thinking, Level 1 thinking, Level 2
thinking, Level 3 thinking, Level 4 thinking. Software Testing Terminologies - Verification, Validation
and Testing, Faults, Error and Bug, Test cases, Coverage Criteria. Types of Testing- Unit testing,
integration testing, System testing, Acceptance testing, Beta testing, Functional testing, Stress testing,
Performance testing, Usability testing and Regression testing. Testing Methods - Black Box testing, White
Box testing, Grey Box testing.
Module - 2 (Unit Testing)

Concept of Unit testing. Static Unit testing. Dynamic Unit testing - Control Flow testing, Data Flow
testing, Domain testing, Functional Program testing. Mutation testing - Mutation and Mutants, Mutation
operators, Mutation score. Junit - Framework for Unit testing. Case Study - Mutation testing using Junit
and Muclipse.
Module - 3 (Unit Testing - White Box Approaches)
Overview of Graph Coverage Criteria. Structural Graph Coverage Criteria - Node/vertex coverage, Edge
coverage, Edge pair coverage, Path coverage, Complete path coverage, Prime path coverage, Complete
round trip coverage, Simple round trip coverage. Data Flow Criteria - du paths, du pairs. Subsumption
Relationships among Graph Coverage Criteria. Graph Coverage for Source Code - Control flow graphs for
code, CFG: If statement, CFG: If statement with return, CFG: Switch-case, CFG: Loops, CFG: Exceptions
(try-catch). Example program – Statistics. Graph Coverage for Design Elements - Call graphs and classes,
Class inheritance testing: Coverage criteria, Coverage criteria on inheritance graph, Data flow at the design
level, Inter-procedural DU pairs, Coupling du-pairs example. Example - Quadratic Root. Case Study -
Graph Based testing using JUnit Framework.
Module - 4 (Unit Testing - Black Box Approaches)

Domain Testing / Input Space Partitioning - Partitions of a set. Input domain modelling - Interface-based
approach, Functionality-based approach. Identifying values. Multiple partitions of the inputdomain - All
Combinations Coverage (ACoC), Each Choice Coverage (ECC), Pair-wise Coverage, T-wise Coverage,
Base Choice Coverage, Multiple Base Choices Coverage. TriTyp example. Functional Testing - Functional
Testing Concepts of Howden. Functional testing - Important Steps. Types of Functional testing -
Equivalence Class Partitioning, Boundary Value Analysis, Decision Tables, Random Testing. Case Study -
Black Box testing approaches using JUnit.
Module - 5 (Grey Box Testing Approaches)
284
Introduction to Grey Box testing - Why Grey Box testing, Gray Box Methodology, Advantages and
Disadvantages. Techniques of Grey Box Testing - Matrix Testing, Regression Testing, Orthogonal Array
Testing or OAT, Pattern Testing. An Introduction to PEX - Parameterized Unit Testing, The Testing
Problem. Symbolic Execution – Example, Symbolic execution tree. PEX application Case Study – PEX.
Text Books
1. Paul Ammann and JeffOffutt ,Introduction to Software Testing.
2. KshirasagarNaik and PriyadarshiTripathy, Software Testing And Quality Assurance: Theory And
Practice.
Reference Materials
1. https://www.csc.ncsu.edu/academics/undergrad/honors/thesis/muclipsebinder.pdf - Muclipse
tutorial.
2. King, James C, “Symbolic Execution and Program Testing”, Association for Computing
Machinery, July 1976.
3.
Course Outcome 1 (CO1): Explain the following types of testing methods with examples.
(i) Balck-box testing.
(ii) White-box testing.
(iii) Grey-box testing.
Course Outcome 2 (CO2): Define 12 mutants for the following method power() using effective mutation
operators. Try to use each mutation operator at least once. Approximately, how many mutants do you think
there would be, if all mutants for power() were created?
public static int power (int left, int right)
{
//**************************************
// Raises Left to the power of Right
// precondition : Right >= 0
// postcondition: Returns Left**Right
//**************************************
intrslt;
rslt = Left;
285
if (Right == 0)
{
rslt = 1;
}
else
{
for (int i = 2; i <= Right; i++)
rslt = rslt * Left;
}
return (rslt);
}
Course Outcome 3 (CO3): Draw the control flow graph and data flow graph of given piece of code.
public static double ReturnAverage(int value[],int AS, int MIN, int MAX){
/*
Function: ReturnAverageComputes the averageof all those numbers in the input array in
the positive range [MIN, MAX]. The maximumsize of the array is AS. But, the array size
could be smaller than AS in which case the endof input is represented by -999.
*/
int i, ti, tv, sum;
doubleav;
i = 0; ti = 0; tv = 0; sum = 0;
while (ti< AS && value[i] != -999) {
ti++;
if (value[i] >= MIN && value[i] <= MAX) {
tv++;
sum = sum + value[i];
}
i++;
}
if (tv> 0)
av = (double)sum/tv;
286
else
av = (double) -999;
return (av);
}
Course Outcome 4 (CO4): Explain the following with examples.
1. Input domain modelling.
2. All Combinations Coverage (ACoC)
3. Each Choice Coverage (ECC)
4. Pair-wise Coverage
5. T-wise Coverage
6. Base Choice Coverage
7. Multiple Base Choices Coverage.
Course Outcome 5 (CO5): Draw the symbolic execution tree for the following program code
and explain the symbolic execution of testme (α1, α2).
1. int twice (int v) {
2. return 2 ∗ v;
3. }
4. void testme (int x, int y ) {
5. z = twice ( y);
6. if ( z == x ){
7. if ( x > y + 10)
8. ERROR;
9. }
10. }
11. int main() {
12. x = sym input();
13. y = sym input();
14. testme ( x , y);
15. return(0);
16. }
287
QP CODE: PAGES: 4
Reg No: Name :
SIXTH SEMESTER B.TECH DEGREE EXAMINATION(MINOR), MONTH & YEAR
Course Name: Introduction to Software Testing
PART A
1. Explain the differences between Validation and Verification.
2. Explain the differences between Fault, Error, and Bug?
3. Define Ground string, Mutation score, and Mutants.
4. What are the functions of Test driver and Test stubs in dynamic unit testing?
5. Define Node coverage, Edge coverage and Prime path coverage in a control flow
graph.
6. What are du paths and du pairs in a data flow graph?
7. Explain the two approaches in input domain modelling.
8. Explain the difference between Equivalence Class Partitioning and Boundary

Value Analysis.
9. Briefly explain three techniques of Grey box testing.
10. Explain the concept of symbolic execution with the help of a toy example.
(10x3=30)
Part B
11. (a) Explain the following types of testing

(i) Black Box testing (ii) White Box testing (iii) Grey Box testing (14)
288
(iv) Unit testing (v) Integration testing (vi) System testing (vii) Acceptance
testing
OR
12. (a) Explain the following coverage criterias based on the code fragment given
below. (i) Functional coverage (ii) Statement coverage (iii)Conditional (8)
coverage (iv)Branch coverage
int foo (int x, int y){
int z = 0;
if ((x > 0) && (y > 0)){
z = x;}
return z;
}
(b) Write positive and negative test cases for an ATM Machine? (6)
13. (a) Explain Dynamic unit test environment with a neat figure.
(8)
(b) Explain the major difference between control flow testing and data flow
testing. (6)
OR
14. Explain seven types of mutation operators with neat examples. (14)
15. (a) Explain touring, side trips and detours with a neat example. (7)
(b) Explain simple path coverage and prime path coverage with the help of CFG (7)
given below. 1
2 3
OR
16. (a) Draw CFG fragment for
289
(i) Simple if (ii) Simple while loop (iii) Simple for loop (7)
(b) Explain the following concepts with examples. (7)

(i)Call graph (ii) Inheritance graph (iii) Coupling du-pairs
17. (a) What are the four important steps in functional testing? (7)
(b) Briefly explain input domain modelling approaches. (7)
OR
18. (a) Consider the triangle classification program with a specification: (6)
The program reads floating values from the standard input. The three values
A, B, and C are interpreted as representing the lengths of the sides of
triangle. The program then prints a message to the standard output that states
whether the triangle, if it can be formed, is scalene, isosceles, equilateral, or
right angled. Determine the following for the above program:
(i) For the boundary condition A +B > C case (scalene triangle),
identify test cases to verify the boundary.
(ii) For the boundary condition A = C case (isosceles triangle), identify
test cases to verify the boundary.
(iii) For the boundary condition A = B = C case (equilateral triangle),
(b) Develop a decision table to generate test cases for this specification. (8)
19. (a) Explain the importance of grey box testing, its advantages and disadvantages. (9)
(b) Explain the concept of symbolic execution tree. (5)
OR
20. (a) Consider the code fragment given below: - (7)
1. POWER: PROCEDURE(X, Y);

2. Z ← 1;
3. J ← 1;
4. LAB: IF Y ≥ J THEN
290
5. DO; Z← Z * X;
6. J ← J + 1;
7. GO TO LAB; END;
8. RETURN (Z) ;
9. END;
a) Explain Symbolic execution of POWER (αl, α2).
(b) Explain Execution tree for POWER (αl, α2) in the above code fragment. (7 )
TEACHING PLAN
No. of
Index Topics Hours
(45)
Module 1 (Introduction to Software Testing) 9 Hours
1.1 Some Popular Errors– Ariane 5, Therac 25, Intel Pentium Bug. 1 Hour
What is Software testing? Why should it be tested? Software Quality, Role

1.2 1 Hour
of Testing.
Testing Process - Level 0 thinking, Level 1 thinking, Level 2 thinking,
1.3 1 Hour
Level 3 thinking, Level 4 thinking.
Software Testing Terminologies- Verification, Validation and Testing,
1.4 1 Hour
Faults, Error and Bug, Test cases, Coverage Criteria.
Types of Testing- Unit testing, integration testing, System testing,
1.5 1 Hour
Acceptance testing, Beta testing
1.6 Functional testing, Stress testing 1 Hour
1.7 Performance testing, Usability testing and Regression testing. 1 Hour
1.8 Testing Methods - Black Box testing 1 Hour
1.9 Grey Box testing. 1 Hour
Module 2 (Unit testing) 8 Hours
291
2.1 Concept of Unit testing. 1 Hour
2.2 Static Unit testing. 1 Hour
2.3 Dynamic Unit testing - Control Flow testing, Data Flow testing 1 Hour
2.4 Domain testing, Functional Program testing.
Mutation testing - Mutation and Mutants, Mutation operators, Mutation

2.5 1 Hour
score.
2.6 Junit - Framework for Unit testing. 1 Hour
2.7 Case Study - Mutation testing using Junit 1 Hour
2.8 Case Study - Mutation testing using Muclipse 1 Hour
Module 3 (Unit Testing:- White Box Approaches) 10 Hours
3.1 Overview of Graph Coverage Criteria 1 Hour
Structural Graph Coverage Criteria - Node/vertex coverage, Edge coverage,

3.2 1 Hour
Edge pair coverage, Path coverage
Complete path coverage, Prime path coverage, Complete round trip
3.3 1 Hour
coverage, Simple round trip coverage.
3.4 Data Flow Criteria - du paths, du pairs 1 Hour
3.5 Subsumption Relationships among Graph Coverage Criteria. 1 Hour
Graph Coverage for Source Code - Control Flow Graphs (CFG) for code,
3.6 CFG: If statement, CFG: If statement with return, CFG: Switch-case, CFG: 1 Hour
Loops, CFG: Exceptions (try-catch). Example program - Statistics
Graph Coverage for Design Elements - Call graphs and classes, Class
3.7 inheritance testing: Coverage criteria, Coverage criteria on inheritance 1 Hour
graph,
292
Data flow at the design level, Inter-procedural DU pairs, Coupling du-pairs

3.8 1 Hour
example. Example - Quadratic Root
3.9 Case Study - Graph Based testing using JUnit Framework. (Lecture 1) 1 Hour
Module 4 (Unit Testing:- Black Box Approaches) 9 Hours
4.1 Domain Testing / Input Space Partitioning - Partitions of a set. 1 Hour
Input domain modelling - Interface-based approach, Functionality-based

4.2 1 Hour
approach.
4.3 Identifying values. 1 Hour
Multiple partitions of the input domain - All Combinations Coverage

4.4 (ACoC), Each Choice Coverage (ECC), Pair-wise Coverage, T-wise 1 Hour
Coverage, Base Choice Coverage, Multiple Base Choices Coverage.
4.5 TriTyp example. 1 Hour
Functional Testing - Functional Testing Concepts of Howden.

4.6 1 Hour
Important Steps.
Types of Functional testing - Equivalence Class Partitioning, Boundary
4.7 1 Hour
Value Analysis
4.8 Decision Tables, Random Testing. 1 Hour
4.9 Case Study - Black Box testing approaches using JUnit. 1 Hour
Module 5 (Grey Box Testing Approaches) 9 Hours
Introduction to Grey Box testing - Why Grey Box testing, Gray Box
5.1 1 Hour
Methodology, Advantages and Disadvantages.
5.2 Techniques of Grey Box Testing - Matrix Testing, Regression Testing, 1 Hour
293
5.3 Orthogonal Array Testing or OAT, Pattern Testing. 1 Hour
5.4 An Introduction to Pex - Parameterized Unit Testing, The Testing Problem. 1 Hour
5.5 Symbolic Execution – Example, Symbolic execution tree. 1 Hour
5.6 PEX application. 1 hour
5.7 Case Study – PEX (Lecture 1) 1 Hour
294
CST CONCEPTS IN Year of

Category L T P Credits
384 DEEP Introduction
LEARNING
VAC 3 1 0 4 2019
Preamble:
This course aims to introduce the learner to an overview of the concepts and algorithms involved in
deep learning. Deep learning is a subfield of machine learning, a subfield of artificial intelligence.
Basic concepts and application areas of machine learning, deep networks, convolutional neural
network and recurrent neural network are covered here. This is a foundational program that will
help students understand the capabilities, challenges, and consequences of deep learning and
prepare them to participate in the development of leading-edge AI technology. They will be able to
gain the knowledge needed to take a definitive step in the world of AI.
Prerequisite: Sound knowledge in Basics of linear algebra and probability theory.
CO1 Demonstrate basic concepts in machine learning.(Cognitive Knowledge Level:

Understand)
CO2 Illustrate the validation process of machine learning models using hyper-parameters
and validation sets. (Cognitive Knowledge Level: Understand)
CO3 Demonstrate the concept of the feed forward neural network and its training process.
CO4 Build CNN and Recurrent Neural Network (RNN) models for different use cases.
CO5 Use different neural network/deep learning models for practical applications.
295
CO1
CO2
CO3
CO4
CO5


problems
296
Assessment Pattern

Examination
Test1 (Percentage) Test2 (Percentage) Marks
Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
Analyse
Evaluate
Create
Mark Distribution
150 50 100 3 hours
Examination shall be preferably conducted after completing the first half of the syllabus and the
Second Internal Examination shall be preferably conducted after completing remaining part of the
syllabus.
297
each from the completed modules and 1 question from the partly covered module), having 3 marks
for each question adding up to 15 marks for part A. Students should answer all questions from Part
Syllabus
INTRODUCTION TO DEEP LEARNING
(General Instructions: Instructors are to introduce students to any one software platform and
demonstrate the working of the algorithms in the syllabus using suitable use cases and public
datasets to give a better understanding of the concepts discussed. Tutorial hour may be used for this
purpose)
Module-1 (Introduction)
Key components - Data, models, objective functions, optimization algorithms, Learning algorithm.
Supervised learning- regression, classification, tagging, web search, page ranking, recommender
systems, sequence learning, Unsupervised learning, Reinforcement learning, Historical Trends in
Deep Learning. Other Concepts - overfitting, underfitting, hyperparameters and validation sets,
estimators, bias and variance.
Module- 2 (Optimization and Neural Networks)
Neural Networks –Perceptron, Gradient Descent solution for Perceptron, Multilayer perceptron,
activation functions, architecture design, chain rule, back propagation, gradient based learning.
Introduction to optimization– Gradient based optimization, linear least squares. Stochastic gradient
descent, Building ML algorithms and challenges.
298
Convolutional Neural Networks – convolution operation, motivation, pooling, Structure of CNN,

Convolution and Pooling as an infinitely strong prior, variants of convolution functions, structured
outputs, data types, efficient convolution algorithms. Practical challenges of common deep learning
architectures- early stopping, parameter sharing, dropout. Case study: AlexNet, VGG, ResNet.
Recurrent neural networks – Computational graphs, RNN design, encoder – decoder sequence to
sequence architectures, deep recurrent networks, recursive neural networks, modern RNNs LSTM
and GRU, Practical use cases for RNNs.
Module-5 (Application Areas)
Applications – computer vision, speech recognition, natural language processing, common word
embedding: continuous Bag-of-Words, Word2Vec, global vectors for word representation (GloVe).
Research Areas – autoencoders, representation learning, boltzmann machines, deep belief
networks.
Text Book
1. Ian Goodfellow, YoshuaBengio, Aaron Courville, Deep Learning, MIT Press 2015 ed.
2. Aston Zhang, Zachary C. Lipton, Mu Li, and Alexander J. Smola, Dive into Deep Learning,
August 2019.
3. Neural Networks and Deep Learning, Aggarwal, Charu C., c Springer International
Publishing AG, part of Springer Nature 2018
Reference Books
1. Neural Smithing: Supervised Learning in Feedforward Artificial Neural Networks by
Russell Reed, Robert J MarksII, A Bradford Book,2014
2. Practical Convolutional Neural Networks by MohitSewak, Md. Rezaul Karim,
PradeepPujari,Packt Publishing 2018
3. Hands-On Deep Learning Algorithms with Python by SudharsanRavichandran,Packt
Publishing 2019
4. Deep Learning with Python by Francois Chollet,Manning Publications Co.,2018
299

1. Compare regression and classification.
2. Define supervised learning? Distinguish between regression and classification.
3. Discuss the different learning approaches used in machine learning.
1. What are hyperparameters? Why are they needed?
2. What issues are to be considered while selecting a model for applying machine
learning in a given problem?
1. Update the parameters V11 in the given MLP using back propagation with learning rate as
0.5 and activation function as sigmoid. Initial weights are given as V11= 0.2, V12=0.1,
V21=0.1, V22=0.3, V11=0.2, W11=0.5, W21=0.2
V
0.6 W
0.9
0.8
2. Draw the architecture of a multi-layer perceptron.

3. Derive update rules for parameters in the multi-layer neural network through the gradient
descent.

1. Give two benefits of using convolutional layers instead of fully connected ones for
visual tasks.
2. Suppose that a CNN was trained to classify images into different categories. It
performed well on a validation set that was taken from the same source as the
training set but not on a testing set. What could be the problem with the training of
such a CNN? How will you ascertain the problem? How can those problems be
solved?
3. Explain how the cell state is updated in the LSTM model from Ct-1 to Ct
4. Show the steps involved in an LSTM to predict stock prices.
300

3. Illustrate the workings of the RNN with an example of a single sequence defined
on a vocabulary of four words.
1. Development a deep learning solution for problems in the domain i) natural
language processing or ii Computer vision (Assignment
2. Illustrate the workings of the RNN with an example of a single sequence defined
on a vocabulary of four words.
QP CODE: PAGES:4
Reg No:_______________
Name:_________________


Course Name: CONCEPTS IN DEEP LEARNING
Max. Marks:100 Duration: 3 Hours
PART A
1. Distinguish between supervised learning and Reinforcement learning. Illustrate
with an example.
2. Differentiate classification and regression.
3. Compare overfitting and underfitting. How it can affect model generalization.
301
4. Why does a single perceptron cannot simulate simple XOR function? Explain
how this limitation is overcome?
5. Illustrate the strengths and weaknesses of convolutional neural networks.
6. Illustrate convolution and pooling operation with an example
7. How many parameters are there in AlexNet? Why the dataset size (1.2 million) is
important for the success of AlexNet?
8. Explain your understanding of unfolding a recursive or recurrent computation into

a computational graph.
9. Illustrate the use of deep learning concepts in Speech Recognition.
10. What is an autoencoder? Give one application of an autoencoder

(10x3=30
)
Part B
Marks)
11. (a) “A computer program is said to learn from experience E with respect to some
class of
(10)
tasks T and performance measure P, if its performance at tasks in T, as
measured by P, improves with experience E.” What is your understanding of
the terms task, performance and experience. Explain with two example
(b) “How does bias and variance trade-off affect machine learning algorithms?
(4)
OR
12. (a) Illustrate the concepts of Web search, Page Ranking, Recommender systems
(10)
(b) List and discuss the different hyper parameters used in fine tuning the (4)
302
traditional machine learning models
13. (a) How multilayer neural networks learn and encode higher level features from
input features. (7)
(b) Explain gradient decent and delta rule? Why stochastic approximation to
gradient descent is needed? (7)
OR
14. (a) Find the new weights for the network using backpropogation algorithm, the (7)
network is given with a input pattern[-1,1] and target output as +1, Use
learning rate of alpha=0.3 and bipolar sigmoid function.
(b) Write an algorithm for backpropgation which uses stochastic gradient descent (7)
method. Comment on the effect of adding momentum to the network.
15. (a) Input to CNN architecture is a color image of size 112x112x3. The first (5)
convolution layer comprises of 64 kernels of size 5x5 applied with a stride
of 2 and padding 0. What will be the number of parameters?
(b) Let X=[-1, 0, 3, 5] W=[.3 ,.5 .2,.1] be the the input of ith layer of a neural (4)
network and to apply softmax function. What should be the output of it?
(c) Draw and explain the architecture of convolutional network (5)
OR
16. (a) Explain the concept behind i) Early stopping ii) dropout iii) weight decay (9)
303
(b) How backpropagation is used to learn higher-order features in a convolutional (5)

Network?
17. (a) Explain the working of RNN and discuss how backpropagation through time
is used in recurrent networks. (8)
(b) Describe the working of a long short term memory in RNNs. (6)
OR
18. (a) What is the vanishing gradient problem and exploding gradient problem? (8)
(b) Why do RNNs have a tendency to suffer from exploding/vanishing gradient? (6)
How to overcome this challenge?
19. (a) Explain any two word embedding techniques (8)
(b) Explain the merits and demerits of using Auto encoders in Computer Vision. (6)
OR
20. (a) Illustrate the use of representation learning in object classification. (7)
(b) Compare Boltzmann Machine with Deep Belief Network. (7 )
Teaching Plan
CONCEPTS IN DEEP LEARNING (45 Hours)
1.1 Key components - Data, models, objective functions, optimization algorithms. 1 hour
(TB2: Section 1.1-1.2)
304
1.2 Learning algorithm (TB1: Section 5.1), Supervised learning- regression, 1 hour
classification (TB2: Section 1.3.1)
1.3 tagging, web search, page ranking (TB2: Section 1.3.1) 1 hour
1.4 Recommender systems, Sequence learning, Unsupervised learning, 1 hour

Reinforcement learning(TB2: Section 1.3.2-1.3.4)
1.5 Historical Trends in Deep Learning (TB1: Section 1.2). 1 hour
1.6 Concepts: over-fitting, under-fitting, hyperparameters and validation sets. 1 hour

1.7 Concepts: Estimators, bias and variance. (TB1: Section 5.4) 1 hour
1.8 Demonstrate the concepts of supervised learning algorithms using a suitable 1 hour
platform.
1.9 Demonstrate the concepts of unsupervised using a suitable platform. 1 hour
Module 2 : Optimization and Neural Networks (9 hours)
2.1 Perceptron, Stochastic Gradient descent, Gradient descent solution for 1 hour
perceptron (TB3: Section 1.1 - 1.2.1)
2.2 Multilayer perceptron (TB3: Section 1.2.2), (TB1: Section 6.1,6.3) 1 hour
2.3 Activation functions- Sigmoid, tanh, Softmax, ReLU, leaky ReLU (TB3: 1 hour
Section 1.2.1.3 - 1.2.1.5)
2.4 Architecture design (TB1: Section 6.4, TB3: Section 1.6) 1 hour
2.5 Chain rule, back propagation (TB3: Section 1.3) 1 hour
305
2.6 Gradient based learning (TB1: Section 6.2) 1 hour
2.7 Gradient based optimization (TB1: Section 4.3) 1 hour
2.8 Linear least squares using a suitable platform. (TB1: Section 4.5) 1 hour
2.9 Building ML Algorithms and Challenges (TB3: 1.4, TB1: 5.10-5.11) 1 hour
Module 3 :Convolution Neural Network (10 hours)
3.1 Convolution operation, Motivation, pooling (TB1:Section 9.1-9.3) 1 hour
3.2 Structure of CNN (TB3: Section 8.2) 1 hour
3.3 Convolution and Pooling as an infinitely strong prior (TB1: Section 9.4) 1 hour
3.4 Variants of convolution functions – multilayer convolutional network, tensors, 1 hour

kernel flipping, downsampling, strides and zero padding. (TB1: Section 9.5)
3.5 Variants of convolution functions - unshared convolutions, tiled convolution, 1 hour

training different networks. (TB1: Section 9.5)
3.6 Structured outputs, data types (TB1: Section 9.6-9.7) 1 hour
3.7 Efficient convolution algorithms. (TB1: Section 9.8,9.10) 1 hour
3.8 Practical challenges of common deep learning architectures- early Stopping 1 hour
(TB3: 4.6)
3.9 Practical challenges of common deep learning architectures- parameter 1 hour

sharing, drop-out (TB3: Section 4.9, 4.5.4)
3.10 Case Study: AlexNet,VGG, ResNet. (TB3: Section 8.4.1-8.4.3,8.4.5) 1 hour
306
Module 4 :Recurrent Neural Network (8 hours)
4.1 Computational graphs (TB1: Section 10.1) 1 hour
4.2 RNN (TB1: Section 10.2-10.3) 1 hour
4.3 Encoder – decoder sequence to sequence architectures. (TB1: Section 10.4) 1 hour
4.4 Deep recurrent networks (TB1: Section 10.5) 1 hour
4.5 Recursive neural networks , Modern RNNs, (TB1: Section 10.6, 10.10) 1 hour
4.6 LSTM and GRU (TB1: Section 10.10, TB3: Section 7.5-7.6) 1 hour
4.7 Practical use cases for RNNs. (TB1: Section 11.1-11.4) 1 hour
4.8 Demonstrate the concepts of RNN using a suitable platform. 1 hour
Module 5 : Applications and Research (9 hours)
5.1 Computer vision. (TB1: Section 12.2) 1 hour
5.2 Speech recognition. (TB1: Section 12.3) 1 hour
5.3 Natural language processing. (TB1: Section 12.4) 1 hour
5.4 Common Word Embedding -: Continuous Bag-of-Words, Word2Vec (TB3: 1 hour

Section 2.6)
5.5 Common Word Embedding -: Global Vectors for Word 1 hour

Representation(GloVe) (TB3: Section 2.9.1- Pennigton 2014)
5.6 Brief introduction on current research areas- Autoencoders, Representation 1 hour

learning. (TB3: Section 4.10)
307
5.7 Brief introduction on current research areas- representation learning. (TB3: 1 hour
Section 9.3)
5.8 Brief introduction on current research areas- Boltzmann Machines, Deep belief 1 hour
networks. (TB1: Section 20.1, TB3 Section 6.3)
5.9 Brief introduction on current research areas- Deep belief networks. (TB1: 1 hour
Section 20.3)
308
Year of
WIRELESS Category L T P Credit
CST Introduction
NETWORKS AND
386
IoT APPLICATIONS VAC 3 1 0 4 2019
Preamble:
This course equips the learners with fundamental wireless technologies for the Internet of
Things(IoT) and the IoT ecosystem. It covers the underlying concepts in wireless networks,
communication mechanisms, protocols, hardware, software, and the cloud platforms for IoT. The
students will be able to design smart IoT applications for real world problems..
Prerequisite: Sound knowledge in Data Communication, Computer Networks and

Programming in C
Course Outcomes: After the completion of the course the students will be able to
Recognize wireless technologies required for IoT ecosystem (Cognitive Knowledge

CO1
Level : Understand)
Perceive the concept of IoT and M2M architecture, IoT examples, and Data
CO2
Management in IoT (Cognitive Knowledge Level :Apply)
Outline the hardware components used in IoT including Sensors, Actuators and
CO3
development boards (Cognitive Knowledge Level : understand)
CO4 Explain the software components of IoT (Cognitive Knowledge Level :Understand)
Demonstrate the protocols used in IoT and build IoT Programs (Cognitive
CO5
Knowledge Level : Apply)
Build IoT-based smart real-time applications such as Smart Healthcare, Smart
CO6 Agriculture, Smart Environment and Smart Home (Cognitive Knowledge Level :
Apply)
0 2
CO1
CO2
309
CO3
CO4
CO5
CO6

complex problems
Assessment Pattern
Blooms Category Continuous Assessment Tests End Semester

Examination Marks
Test 1 (Percentage) Test 2 (Percentage)
Remember 30 30 30
Understand 50 40 40
Apply 20 30 30
310
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3 Hours
Attendance 10 marks

Examination shall be preferably conducted after completing the first half of the syllabus, and the
Second Internal Examination shall be preferably conducted after completing the remaining part of
the syllabus. There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2
having 3 marks for each question adding up to 15 marks for part A. Students should answer all
completed modules and 1 question from the partly covered module), each with 7 marks. Out of
the 7 questions in Part B, a student should answer any 5.
contains 2 questions from each module of which a student should answer anyone. Each question
can have a maximum 2 subdivisions and carries 14 marks.
311
Syllabus
Module- 1 ( Introduction to IoT and wireless technologies required for IoT )

Internet of Things, Role of Things and the Internet, Wireless IoT. Wireless Networks -
Network Topologies, Types of Networks. Role of Wireless Standards in IoT. Protocol Stack -
OSI Model, TCP/IP Model, IEEE 802 Reference Model, Protocols for Wireless IoT. Bluetooth
- Transceiver, Frequency Channels, Typical Range, Access and Spread Spectrum, Modulation
and Data Rate, Error Correction and Detection, Network Topology. ITU G.9959, Zwave, IEEE
802.15.4, Zigbee Specification, Thread, WiFi, 6LowPAN, IPv6, LoRaWAN.
Module- 2 (IoT architecture, Data and Device management)

Internet of Things - IoT Architectural View, Technology Behind IoT - Server End Technology,
Sources of Internet of Things, M2M Communication. IoT Application Areas. IoT Examples.
IoT Data Management - Device Management Gateways. Design Principles for Web
Connectivity - Web Communication Protocols for Connected Devices, Web Connectivity for
Connected Devices using Gateways. Internet Connectivity Principles – Internet Connectivity,
Internet based communication, IP addressing in the IoT.
Module- 3 (Data Acquiring and Enabling Technologies)
Data Acquiring and Storage for IoT Sevices- Organization of Data, Big data, Acquiring
Methods, Management Techniques, Analytics, Storage Technologies. Cloud Computing for Data
storage - IoT Cloud based Services using Xively, Nimbits, and Other Platforms. Sensor
Technologies for IoT Devices - Sensor Technology, Participatory Sensing, Industrial IoT and
Automotive IoT, Actuators for Various Devices, Sensor Data Communication Protocols,
Wireless Sensor network Technology
Module-4 (Prototyping the Embedded Devices for IoT)
Embedded Computing Basics, Embedded Hardware Unit. Embedded Platforms for Prototyping -
Arduino, Intel Galileo, Intel Edison, Raspberry Pi, BeagleBone, mBed. Prototyping and
Designing the Software for IoT Applications- Introduction, Prototyping Embedded
DeviceSoftware- Programming using Arduino, Programming for an Arduino Controlled Traffic
Control Lights at a Road Junction, Basic Arduino Programs to Blink LED, Find the Distance
using Ultrasonic Sensor, Estimate Room Temperature, Measuring Soil Moisture Level
Module 5 (Business Models and Case Studies)
Business Models and Processes using IoT. Value Creation in the Internet of Things. Cloud
PaaS- Xively, Nimbits, IBM Bluemix, CISCO IoT, AWS IoT, TCS Connected AWS Platform,
Case studies- Smart Home, Smart Environment, Smart healthcare, Smart agriculture
312
Text Books
1. Daniel Chew, “Wireless Internet of Things -A Guide to the lower layers”, IEEE Standards
and Association, IEEE Press, Wiley
2. Rajkamal, “Internet of Things : Architecture and Design Principles”, McGraw Hill (India)
Private Limited.
References
1. ArshadeepBahga, Vijay Madisetti, “Internet of Things: A hands-on approach”, University
Press, 2015 (First edition)
2. Dieter Uckelmann, Mark Harrison, Michahelles Florian (Ed.), Architecting the internet of
things, Springer, 2011
3. Dr. Ovidiu Vermesan, Dr. Peter Friess, Internet of Things: Converging Technologies for
Smart Environments and Integrated Ecosystems, River Publishers, 2013
4. Simon Monk, “Programming Arduino: Getting Started with Sketches”, McGraw Hill
Publications
1. Compare Bluetooth and Bluetooth LE power classes
2. Demonstrate Zigbee Specification Protocol Stack
1. What are the major components of IOT system? Briefly explain each
2. Correlate M2M architectural Levels with IOT architectural Levels
1. Describe the use of GPIO pins ?
2. What are actuators ? Mention the roles of actuators in IoT systems
1. Identify the role of HBase in Hadoop File System
2. Differentiate Edge computing and Distributed computing
3. Illustrate open protocols, tools and frameworks generally used in M2M

1. What do you mean by Arduino sketches?
2. Write an Arduino program to blink LED
313
1. How IoT technology helps TELEMEDICINE in India?

2. How soil moisture can be detected in Smart Agriculture?

QP CODE: PAGES :2
Reg No: _______________
Name: _________________
Course Name: WIRELESS NETWORKS AND IoT APPLICATIONS

PART A
1. Illustrate Role of things and internet in IoT
2. What is Bluetooth? Explain the range and frequency channels of Bluetooth?
3. List any three the features of Constrained Application Protocol (COAP).
4. Compare Raspberry Pi and BeagleBoard boards.
5. Identify the role of HBase in Hadoop File System.
6. Differentiate Edge computing and Distributed computing.
7. Give an example of Raspberry Pi applications for Industrial IoT.
8. What are the on-board functional units in Intel Galileo?
9. Interpret the concept of value creation in IoT.
314
10. Explain the use of PaaS in IoT Smart applications with any three examples.
(10x3=30)
Part B
11. (a) Compare various Network topologies used in Wireless Networks. (8)
(b) Describe the following wireless technologies on i) Zigbee ii)WiFi

iii) Thread. (6)
OR
12. (a) Explain protocol stacks used in wireless networks for IoT applications. (8)
(b) Illustrate the Architectural design of LoRaWAN. (6)
13. (a) Define M2M. Explain M2M architecture. Correlate M2M architectural levels (8)
with IoT architectural levels.
(b) Compare SOAP and REST protocols. (6)
OR
14. (a) Summarize different Online Transactions and Processing techniques. (8)
(b) Identify the functions of Device-Management Gateway . (6)
15. (a) Define actuators ? Describe the roles of actuators in IoT systems. (8)
(b) Explain the usage contexts of analog sensors and digital sensors. (6)
OR
16. (a) How data collection, storage & computing services done using Nimbits? (10)
(b) List any four features of Xively. (4)
315
17. (a) What do you mean by Arduino sketches? (4)
(b) Write an Arduino program to blink LED (10)
OR
18. (a) Demonstrate an example of Raspberry Pi applications for Industrial IoT. (10)
(b) Compare the features of Arduino-R3 and Arduino Yun boards. (4)
19. (a) Explain various tasks of a smart irrigation monitoring service. (8)
(b) Demonstrate the tasks of Soil-Moisture monitoring service. (6)
OR
20. (a) a) Mr. Kiran Mathew has been a chronic diabetic patient for the past few (10)
years. He was under regular check up at the hospital every two weeks. All of
a sudden the pandemic like COVID-19 arises in the country and the
government issues a lockdown for a period of two months. Illustrate how
Mr. Kiran can be monitored by the health care worker using intelligent
healthcare techniques.
(b) Mention any four sensors used in smart healthcare (4 )
TEACHING PLAN
No Contents No of
Lecture
Hrs(45)
Module – 1 ( Introduction to IoT and wireless technologies required for IoT) (8 hrs) (TB-
1, Chapter 1...)
1.1 Internet Of Things, Role of things and internet ,Wireless IoT 1
1.2 Wireless Networks- Network Topologies-Types of Networks,Role of 1
316
Wireless standards in IoT
1.3 Protocol Stack-OSI Model- TCP/IP Model-IEEE 802 reference model 1
Protocols for Wireless IoT-Bluetooth-Transceiver, Frequency Channels-

1.4 1
Typical Range, Access and Spread Spectrum, Modulation and Data Rate
1.5 Error Correction and Detection-Network Topology. 1
1.6 ITU G.9959, Zwave, IEEE 802.15.4, Zigbee Specification 1
1.7 Thread, Wifi, 6LowPAN, IPv6 1
1.8 LoRaWAN 1
Module- 2 (IOT architecture, Data and Device management) (9hrs)
2.1 Internet of Things -IoT Architectural view 1
Technology Behind IOT-Server End Technology,Sources of Internet of

2.2 1
Things
2.3 M2M Communication. 1
2.4 IoT Application Areas. IOT Examples. 1
2.5 IoT Data Management, Device Management Gateways. 1
2.6 Design Principles for Web Connectivity 1
2.7 Web communication protocols for connected devices, 1
2.8 Web connectivity for connected devices using Gateways. 1
Internet connectivity Principles – Internet Connectivity, Internet based

2.9 1
communication, IP addressing in the IoT.
Module- 3 (Data Acquiring and Enabling Technologies (8 hrs)
3.1 Data acquiring and storage for IoT devices- Organization of Data, Big data 1
Acquiring methods, management techniques, Analytics, Storage

3.2 1
technologies.
3.3 Cloud computing for Data storage-IoT Cloud based services using Xively, 1
317
Nimbits, and other platforms.
3.4 Cloud computing-Nimbits 1
Sensor Technologies for IoT Devices-Sensor Technology, Participatory

3.5 1
sensing
3.6 Industrial IoT and Automotive IoT 1
3.7 Actuators for various devices, Sensor data communication protocols 1
3.8 Wireless Sensor network Technology 1
Module 4(Prototyping the Embedded Devices for IoT )(9hrs)
4.1 Introduction, Embedded Computing Basics, Embedded Hardware Unit. 1
1
4.2 Embedded Platforms for Prototyping-Arduino, Intel Galileo
4.3 Intel Edison, Raspberry Pi, BeagleBone, mBed 1
4.4 Prototyping and designing the software for IoT applications-Introduction, 1

Prototyping embedded device software
4.5 Prototyping and designing the software for IoT applications-Introduction, 1

Prototyping embedded device software
4.6 Programming concepts in Arduino 1
4.7 Programming for an arduino controlled traffic control lights at a road junction 1
4.8 Basic Arduino programs to blink LED, Find the distance using ultrasonic 1
sensor
4.9 Estimate room temperature, Measuring soil moisture level 1
Module 5 (higher level protocols and case studies)(9 hrs)
5.1 Business Models and Processes using IOT, Value creation in the Internet of 1
Things.
318
5.2 Xively, Nimbits, IBM Bluemix 1
5.3 CISCO IoT, AWS IoT, TCS Connected AWS Platform 1
5.4 Case Study- Smart Environment 1
5.5 Case Study- Smart Environment 1
5.6 Case study Smart Home 1
5.7 Case study Smart Home 1
5.8 Case study Smart healthcare (Lecture I) 1
5.9 Case study Smart healthcare (Lecture II) 1
5.10 Case study -Smart agriculture (Lecture I) 1
5.11 Case study -Smart agriculture (Lecture II) 1
319
SEMESTER VI
HONOURS
320
CST NETWORK Year of Introduction

Category L T P Credits
394 SECURITY
VAC 3 1 0 4 2019
Preamble:
The purpose of this course is to create a better understanding of the network security concepts.
This course covers network security standards, email security services, web security mechanisms,
firewalls and wireless security mechanisms. This course helps the learner to gain insight into the
key aspects of secure network communication and enables to apply in real-life scenarios.
Prerequisite: A sound background in Number Theory and Cryptographic Algorithms.
CO# Course Outcomes
Identify the key aspects of security, intrusion detection systems and digital signature
CO1 schemes (Cognitive Knowledge Level: Apply)
Explain the security standards used in network communication (Cognitive Knowledge

CO2 Level:Understand)
Identify the mechanisms in email security services (Cognitive Knowledge Level:

CO3 Apply)
Summarize the protocols used to provide web security (Cognitive Knowledge Level:
CO4 Understand)
Explain the fundamental concepts of wireless network security and firewalls

CO5 (Cognitive Knowledge Level: Understand)
321
CO1
CO2
CO3
CO4
CO5
Assessment Pattern
Bloom’s Category
Test 1 (%) Test 2 (%) Examination (%)
Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
Analyze
Evaluate
Create
322
Mark Distribution

150 50 100 3
test shall be preferably conducted after completing remaining part of the syllabus. There will be
answer any 5.
323
Syllabus
Module – 1 (Network Security Basics)
Introduction to network security - Security requirements, Challenges of security, Network
security model. Malicious programs – Worms, Viruses, Trojans, Spyware, Adware. Intrusion
Detection Systems (IDS) - Uses, Techniques. Digital signatures - ElGamal, Schnorr, Digital
Signature Standard (DSS).
Module – 2 (Network Security Standards)

Kerberos v4 – Configuration, Authentication, Encryption, Message formats. Kerberos v5 –
Cryptographic algorithms, Message formats. Public Key Infrastructure (PKI) – Trust models,
Revocation. Real-time communication security – Perfect Forward Secrecy (PFS), Denial-of-
Service protection, Endpoint identifier hiding, Live partner reassurance. Internet Protocol Security
(IPSec) - Authentication Header (AH), Encapsulating Security Payload (ESP), Internet Key
Exchange (IKE) phases.
Module – 3 (Email Security)

Introduction to email security - Security services for email, Establishing keys, Privacy,
Authentication, Message integrity, Non-repudiation. Privacy Enhanced Mail (PEM) – Encryption,
Source authentication and integrity protection, Message formats. Secure/Multipurpose Internet
Mail Extensions (S/MIME) – Messages, Differences from PEM. Pretty Good Privacy (PGP) -
Encoding, Certificate and key revocation, Anomalies, Object formats.
Module – 4 (Web Security)

Introduction to web security - Web security considerations, Threats. Secure Sockets Layer (SSL)
– Architecture, Protocols, Transport Layer Security (TLS) – Differences from SSL. Hypertext
Transfer Protocol Secure (HTTPS) – Connection initiation, Closure. Secure Shell (SSH) –
Transport layer protocol, User authentication protocol, Connection protocol.
Module – 5 (Wireless Network Security and Firewalls)

IEEE 802.11 Wireless LAN - Network components, Architectural model, Services. IEEE 802.11i
wireless LAN security - Services, Phases of operation. Wired Equivalent Privacy (WEP), Wi-Fi
Protected Access (WPA), WPA2, Wireless Application Protocol (WAP) – Services, Protocol
architecture. Firewalls – Need for firewalls, Packet filters, Circuit-level firewalls, Application
layer firewalls.
Text Books
1. C. Kaufman, R. Perlman and M. Speciner, “Network Security: Private Communication in a
Public World”, 2/e, PHI.
2. William Stallings, “Cryptography and Network Security Principles and Practice”, 5/e,
Pearson
324
Education Asia.
References
1. Behrouz A. Forouzan, Debdeep Mukhopadhyay, “Cryptography and Network Security”, 3/e,
Tata McGraw Hill.
2. Tyler Wrightson, “Wireless Network Security A Beginner’s Guide”, 2012, Tata McGraw Hill.
3. William Stallings, “Network Security Essentials: Applications and Standards”, 4/e, Prentice
Hall.
4. Schiller J., Mobile Communications, 2/e, Pearson Education.
5. Roberta Bragg et. al., “Network Security: The Complete Reference”, Tata McGraw Hill.

1. Using the Schnorr digital signature scheme, let q = 83, p = 997 and d = 23. Find values for
e1 and e2.
2. The Digital Signature Algorithm (DSA) specifies that if the signature generation process
results in a value of zero, a new value of k should be generated and the signature should be
recalculated. Give reason.

1. In Kerberos v4, the authenticator field is not of security benefit when asking the Key
Distribution Center (KDC) for a ticket for Bob, but useful when logging in as Bob. Give
reasons for your answer.
2. How does the stateless cookie protocol provide clogging protection?

1. If Alice is sending an ENCRYPTED message, she first signs the message digest with her
private key and then encrypts the message digest with the pre-message secret key. Why
this last encryption was considered necessary for encrypted messages and not for MIC-
CLEAR or MIC-ONLY?
2. Which security services are considered desirable in the following cases? (i) Sending a
purchase order (ii) Sending a ransom note. (iii) Sending a mission description to security
officials.
3. Explain the security mechanism used in Gmail communication.
325

1. Is it possible in SSL for the receiver to reorder SSL record blocks that arrive out of order?
If so, how it can be done? If not, why?
2. Describe any five web security threats, their consequences and countermeasures.

1. Explain the security areas addressed by IEEE 802.11i.
2. Describe the advantages and disadvantages of application layer firewalls.
326

QP CODE:
Reg. No:______________
Name:________________ PAGES : 3

SIXTH SEMESTER B.TECH. DEGREE (HONORS) EXAMINATION, MONTH &YEAR
Course Name: Network Security

PART A
1.
Distinguish between signature-based and anomaly-based intrusion detection
techniques.
2.
A trusted third party is considered as a main component in a network security
model. Why?
3.
How is endpoint identifier hiding achieved in real-time communication?
4.
Show how encryption is used to provide privacy and integrity in Kerberos v5.
5.
End-to-end privacy is essential for e-mail security. How is this achieved?
6.
List the four steps for preparing an EnvelopedData MIME entity.
7.
Show the operation of a Secure Sockets Layer (SSL) Record protocol.
8.
For Secure Shell (SSH) packets, what is the advantage of not including the MAC
in the scope of packet encryption?
9.
List the three security services provided by IEEE 802.11i.
10.
Define the terms Access Point, Basic Service Set, Extended Service Set.
(10x3=30)
327
Part B
11. (a)
Using the ElGamal scheme, let p = 881 and d = 700, find values for e1 and
(8)
e2. Choose r = 17. Find the value of S1 and S2 if M = 400.
(b)
Explain the requirements and challenges of network security.
(6)
OR
12. (a) In ElGamal, Schnorr and DSS, what happens if an attacker can find the value
(8)
of random secret key used by the signer? Also, what happens if a user uses
the same value of random secret key to sign two messages? Explain your
answer for each scheme separately.
(b) (6)
Explain the network security model with the help of a neat diagram.
13. (a) Alice wishes to log into Bob’s workstation remotely. List the steps involved
(7)
in this communication if Kerberos v4 is used.
(b)
How does Diffie-Hellman technique provide perfect forward secrecy using
(7)
signature keys?
OR
14. (a) Explain the algorithm for Message Authentication Code (MAC) calculation (8)
and verification in Kerberos v5 rsa-md5-des.
(b) (6)
Compare the aggressive mode and main mode of Phase 1 Internet Key
Exchange (IKE).
15. (a) Describe the different methods by which authentication of source is (7)
performed in email communication.
(b) (7)
Explain the Signed data and Clear-signed data functions provided by
S/MIME.
OR
16. (a) Explain the advantages of Pretty Good Privacy (PGP) over Privacy (7)
Enhanced Mail (PEM).
328
(b) (7)
Define non-repudiation. Describe the different ways by which it is
implemented in email communication.
17. (a) Describe the significance of pseudo-random function of Transport Layer (7)
Security.
(b) (7)
Explain the four different phases of Secure Sockets Layer (SSL)
HandshakeProtocol.
OR
18. (a) Describe how connection initiation and connection closure is done in Hyper (7)
Text Transfer Protocol Secure (HTTPS).
(b) (7)
Illustrate the sequence of events in Secure Shell (SSH) transport layer
protocol packet exchanges.
19. (a) Explain the Discovery phase and Authentication phase of IEEE 802.11i (7)
operation.
(b) (7)
Why are firewalls needed? Compare the features of packet filters and circuit
level firewalls.
OR
20. (a) Explain the two authentication methods used in Wired Equivalent Privacy (7)
(WEP).
(b) (7)
Describe the three transaction classes provided by Wireless Transaction
Protocol.
329
Teaching Plan
No of
No Contents Lecture
Hrs
Module - 1 (Network Security Basics) (7 hrs)
1.1 Security requirements, Challenges of security 1
1.2 Network security model 1
1.3 Worms, Viruses, Trojans, Spyware, Adware 1
1.4 Intrusion Detection Systems (IDS) uses, Techniques 1

1.5 ElGamal digital signature 1
1.6 Schnorr digital signature 1
1.7 Digital Signature Standard (DSS) 1
Module - 2 (Network Security Standards) (12 hrs)
2.1 Kerberos v4 configuration, Authentication 1
2.2 Kerberos v4 encryption 1
2.3 Kerberos v4 message formats 1
2.4 Kerberos v5 cryptographic algorithms – rsa-md5-des, des-mac, des-mac-k 1
Kerberos v5 cryptographic algorithms - rsa-md4-des, rsa-md4-des-k, 1

2.5
Encryption for privacy and integrity
2.6 Kerberos v5 message formats 1
2.7 Public Key Infrastructure (PKI) trust models 1
2.8 PKI revocation 1
2.9 Perfect Forward Secrecy (PFS), Denial-of-Service protection 1
2.10 Endpoint identifier hiding, Live partner reassurance 1
Internet Protocol Security (IPSec) Authentication Header (AH), 1

2.11
Encapsulating Security Payload (ESP)
330
1
2.12 Internet Key Exchange (IKE) phases
Module - 3 (Email Security) (9 hrs)
3.1 Security services for email, Establishing keys, Privacy 1
3.2 Authentication, Message integrity, Non-repudiation 1
3.3 Privacy Enhanced Mail (PEM) encryption, Source authentication 1
3.4 PEM integrity protection, Message formats (Lecture 1) 1
3.5 PEM message formats (Lecture 2) 1
Secure/Multipurpose Internet Mail Extensions (S/MIME) – Messages, 1

3.6
Differences from PEM
Pretty Good Privacy (PGP) encoding, Certificate and key revocation, 1

3.7
Anomalies
3.8 PGP Object formats (Lecture 1) 1
3.9 PGP Object formats (Lecture 2) 1
Module – 4 (Web Security)(9 hrs)
Web security considerations, Threats, Secure Sockets Layer (SSL)

4.1 1
architecture
4.2 SSL protocols (Lecture 1) 1
4.3 SSL protocols (Lecture 2) 1
4.4 Transport Layer Security (TLS) differences from SSL (Lecture 1) 1
4.5 TLS differences from SSL (Lecture 2) 1
4.6 Hypertext Transfer Protocol Secure (HTTPS) connection initiation, Closure 1
4.7 Secure Shell (SSH) transport layer protocol 1
4.8 SSH user authentication protocol 1
4.9 SSH connection protocol 1
331
Module - 5 (Wireless Security and Firewalls) (8 hrs)
IEEE 802.11 Wireless LAN network components, Architectural model, 1

5.1
Services
IEEE 802.11i wireless LAN security services, Phases of operation (Lecture 1
5.2
1)
5.3 IEEE 802.11i phases of operation (Lecture 2) 1
5.4 Wired Equivalent Privacy (WEP), Wi-Fi Protected Access (WPA), WPA2 1
Wireless Application Protocol (WAP) services, Protocol architecture 1

5.5
(Lecture 1)
5.6 WAP protocol architecture (Lecture 2) 1
5.7 Need for firewalls, Packet filters 1
5.8 Circuit-level firewalls, Application layer firewalls 1
332
ADVANCED TOPICS Year of

IN MACHINE Introduction
396
LEARNING VAC 3 1 0 4 2019
Preamble:
This course enables the learners to understand the advanced concepts and algorithms in machine
learning. The course covers the standard and most popular supervised learning algorithms such as
linear regression, logistic regression, decision trees, Bayesian learning and the naive Bayes
algorithm, basic clustering algorithms, auto encoders, sampling methods and PAC learning. This
course helps the students to provide machine learning based solutions to real world problems.
Prerequisite: Basic understanding of probability theory, linear algebra, multivariate calculus and
multivariate probability theory.
CO1 Illustrate the concepts of regression and classification techniques (Cognitive

CO2 Demonstrate various unsupervised learning techniques (Cognitive Knowledge Level:

Apply)
CO3 Choose suitable model parameters for different machine learning techniques and to evaluate a
model performance (Cognitive Knowledge Level: Apply)
CO4 Explain the framework of PAC learning, basic concepts of VC dimension and non-
uniform learnability (Cognitive Knowledge Level: Understand)
CO5 Construct Bayesian models for data and apply computational techniques to draw inferences
CO6 Illustrate the concepts of sampling algorithms, auto encoder, generative adversarial networks
PO1 PO PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO1
2 2
CO1
CO2
CO3
CO4
CO5
CO6
333

problems
Assessment Pattern

Examination Marks
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyse
Evaluate
Create
Mark Distribution
150 50 100 3 hours
334
each from the completed modules and 1 question from the partly covered module), having 3 marks
for each question adding up to 15 marks for part A. Students should answer all questions from Part
can have a maximum 2 sub-divisions and carry 14 marks.
Syllabus
Module -1 (Supervised Learning)
Overview of machine learning - supervised, semi-supervised, unsupervised learning,

reinforcement learning Regression algorithms: least squares linear regression, gradient descent,
closed form, normal equations, regularization techniques (LASSO, RIDGE), polynomial
regression. Discriminative Methods - Logistic Regression, Decision Tree Learning. Generative
Methods - Naive Bayes Classifier, Gaussian Discriminant Analysis (GDA).
Module -2 (Unsupervised Learning)

clustering, K-medoids clustering, Gaussian mixture models: Expectation Maximization (EM)
algorithm for Gaussian mixture model.
335
Module -3 (Practical aspects in machine learning)
Classification Performance measures - Precision, Recall, Accuracy, F-Measure, ROC, AUC,

generalisation and overfitting, cross-validation, bias-variance tradeoff, error estimation, parameter
and model selection. Ensemble Methods - Bagging, Boosting, Adaboost, Random Forests.
Module -4 (Statistical Learning Theory)
Models of learnability- learning in the limit, probably approximately correct (PAC) learning.
Sample complexity- quantifying the number of examples needed to PAC learn, Computational
complexity of training, Sample complexity for finite hypothesis spaces, PAC results for learning
conjunctions, Sample complexity for infinite hypothesis spaces, Vapnik-Chervonenkis(VC)
dimension.
Module -5 (Advanced Machine Learning Topics)
Graphical models - Bayesian belief networks, Markov random fields(MRFs), Inference on chains
and factor graphs, inference on clique trees. Monte Carlo methods – Basic sampling algorithms,
rejection sampling, importance sampling, Markov chain Monte Carlo(MCMC), Gibbs sampling.
Variational methods. Auto Encoder, Variational AutoEncoder, Generative Adversarial Networks
Textbook
1. Christopher M. Bishop. Pattern recognition and machine learning. Springer 2006.
3. Mohammed J. Zaki and Wagner Meira, Data Mining and Analysis: Fundamental Concepts
and Algorithms, Cambridge University Press, First South Asia edition, 2016.
4. Ian Goodfellow, Yoshua Bengio and Aaron Courville. Deep Learning. MIT Press 2016.
5. Mehryar Mohri, Afshin Rostamizadeh and Ameet Talwalkar. Foundations of Machine
Learning. Second edition. MIT Press 2018.
6. Tom Mitchell. Machine Learning. McGraw Hill 1997.
7. Richard O. Duda, Peter E . Hart, David G. Stork. Pattern classification, Second Edition.
Wiley.
8. Jiawei Han, Micheline Kamber, Jian Pei. Data Mining Concepts and Techniques, Third
Edition. Morgan Kaufmann.
9. David Foster. Generative Deep Learning - Teaching Machines to Paint, Write, Compose,
and Play. O'Reilly Media, Inc., June 2019.
Reference Books
1. Kevin P. Murphy. Machine Learning: A Probabilistic Perspective. MIT Press 2012

2. Carl Edward Rasmussen and Christopher K. I. Williams. Gaussian Processes for Machine
Learning. MIT Press 2005.
336
1. Consider a naive Bayes classifier with 3 boolean input variables, X1, X2 and X3, and one
boolean output, Y. How many parameters must be estimated to train such a naive Bayes
classifier? How many parameters would have to be estimated to learn the above classifier
if we do not make the naive Bayes conditional independence assumption?
2. Describe the ID3 algorithm. Is the order of attributes identical in all branches of the
decision tree?
3. Explain the difference between (batch) gradient descent and stochastic gradient descent.
Give an example of when you might prefer one over the other.
4. Suppose that you are asked to perform linear regression to learn the function that outputs
y, given the D-dimensional input x. You are given N independent data points, and that all
the D attributes are linearly independent. Assuming that D is around 100, would you
prefer the closed form solution or gradient descent to estimate the regressor?
5. Suppose you have a three class problem where class label y ∈ 0, 1, 2 and each training
example X has 3 binary attributes X1, X2, X3 ∈ 0, 1. How many parameters (probability
distribution) do you need to know to classify an example using the Naive Bayes
classifier?
1. Which similarity measure could be used to compare feature vectors of two images? Justify
your answer.
3. Suppose you want to cluster the eight points shown below using k-means
337
Assume that k = 3 and that initially the points are assigned to clusters as follows:
C1 = {x1, x2, x3}, C2 = {x4, x5, x6}, C3 = {x7, x8}. Apply the k-means algorithm until
convergence, using the Manhattan distance.
4. Cluster the following eight points representing locations into three clusters: A1(2, 10),
A2(2, 5), A3(8, 4), A4(5, 8), A5(7, 5), A6(6, 4), A7(1, 2), A8(4, 9).
Initial cluster centers are: A1(2, 10), A4(5, 8) and A7(1, 2).
The distance function between two points a = (x1, y1) and b = (x2, y2) is defined as D(a, b)
= |x2 – x1| + |y2 – y1|
Use k-Means Algorithm to find the three cluster centers after the second iteration.
1. What is ensemble learning? Can ensemble learning using linear classifiers learn
classification of linearly non-separable sets?
2. Describe boosting. What is the relation between boosting and ensemble learning?
Classifier B attains 70% accuracy on the training set and 75% accuracy on the test set.
Which one is a better classifier. Justify your answer.
4. What are ROC space and ROC curve in machine learning? In ROC space, which points
correspond to perfect prediction, always positive prediction and always negative
prediction? Why?
5. Suppose there are three classifiers A,B and C. The (FPR, TPR) measures of the three
perfect classifier? Justify your answer.
Course Outcome 4(CO4): .
1. A monotone conjunction is a conjunction of the variables such that no variable is negated.

Show that the concept class of monotone conjunction is probably approximately correct
(PAC)-learnable.
2. Consider a Boolean classification problem with n binary variables and a hypothesis space
H, where each hypothesis is a decision tree of depth 2, using only two variables. How
many training examples, m suffice to assure that with probability at least 0.99, any
consistent learner using H will output a hypothesis with true error at most 0.05
3. Show that the concept class C containing the set of all boolean functions on n variable is
not PAC-learnable.
338
4. What is the Vapnik-Chervonenkis(VC)-dimension of a circle centered at the origin.

5. A hypothesis space that has a high VC dimension is good, bad, or neither? Explain
in terms of both (a) richness or expressive power of the hypotheses, and (b) sample
complexity.
1. Write down the factored conditional probability expression that corresponds to the
graphical Bayesian Network shown below.
2. How do we learn the conditional probability tables(CPT) in Bayesian networks if

information about some variables is missing? How are these variables called?
1. Derive an algorithm using the inverse transform method to generate a random sample from
the exponential distribution.
2. Explain the pros and cons of importance sampling versus rejection sampling.
3. Sketch the core idea of the Monte Carlo method. What is a sample? What is a direct
sampling method? Why can't it be used directly to do any inference? What is rejection
sampling? What is its major disadvantage?
4. Generative Adversarial Networks(GANs) include a generator and a discriminator. Sketch a
basic GAN using those elements, a source of real images, and a source of randomness.
5. The word “adversarial” in the acronym for GANs suggests a two-player game. What are
the two players, and what are their respective goals?
339

QP CODE:
Reg No: _______________
Name: _________________ PAGES : 5

SIXTH SEMESTER B.TECH DEGREE EXAMINATION (HONORS), MONTH & YEAR
Course Name: Advanced Topics in Machine Learning
PART A
1. Suppose you have a dataset with m = 1000000 examples and n = 200000 features
for each example. You want to use multivariate linear regression to fit the
parameters to our data. Should you prefer gradient descent or the normal equation?
2. Define Information gain? How is that different from Gain ratio? Give the
advantage of using Gain ratio measure?
3. What is cluster analysis? Identify two applications where cluster analysis can be
applied to multimedia data?
4. Given two objects represented by the tuples (22, 1, 42, 10) and (20, 0, 36, 8):
5. Suppose there are three classifiers A,B and C. The (FPR, TPR) measures of the
three classifiers are as follows – A (0, 1), B (1, 1) , C (1,0.5). Which can be
considered as a perfect classifier? Justify your answer.
6. How Bias-Variance Tradeoff affects machine learning algorithms?
7. For a particular learning task, if the requirement of error parameter ε changes from
0.1 to 0.01. How many more samples will be required for probably approximately
correct(PAC) learning?
340
8. Suppose we have a hypothesis set that labels all points inside an interval [a, b] as
class 1. Find its Vapnik-Chervonenkis(VC)- dimension?
9. Given a density function f(x), the rejection sampling is a method that can generate
data points from the density function f. List the three steps to generate a random
sample from f using rejection sampling.
10. How does the variational auto-encoder(VAE) architecture allow it to generate new
data points, compared to auto-encoder, which cannot generate new data points? (10x3=30)
Part B
11. (a) . Consider the hypothesis for the linear regression hθ (x) = θ0 + θ1x, and the
(5)
cost function J( θ0, θ1) = 1/2m Σ i= 1 to m ( hθ (x(i)) – y(i))2 where m is the
number of training examples. Given the following set of training examples.
. Answer the following questions :

. 1) Find the value of hθ (2) if θ0= 0 and θ1 = 1.5
. 2) Find the value of J(0,1)
. 3) Suppose the value of J( θ0, θ1) = 0. What can be inferred from this.
(b) . Write a gradient descent algorithm for multivariate regression? Compare the
gradient and analytical solution to the multivariate regression? (9)
OR
12. (a) Consider the collection of training samples (S) in the Figure given below. Drug
is the target attribute which describes the Drug suggested for each patient. Find (9)
the value of the following . i) Gain(S, Sex) ii) Gain (S, Cholesterol)
341
(b) Explain how LASSO regression helps to reduce the overfitting problem? (5)
13. (a) Suppose that we have the following data:

(9)
Identify the cluster by applying the k-means algorithm, with k = 2. Try using
initial cluster centers as far apart as possible.
(b) Describe EM algorithm for Gaussian mixtures. (5)
OR
14. (a) Illustrate the strength and weakness of k-means in comparison with the k- (4)
medoids algorithm.
(b) Suppose that we have the following data . Use single linkage Agglomerative (10)
clustering to identify the clusters. Draw the Dendogram. Use Euclidean
distance measure
342
X Y
P1 0.4 0.53
P2 0.22 0.38
P3 0.35 0.32
P4 0.26 0.19
P5 0.08 0.41
P6 0.45 0.30
15. (a) Define Precision, Recall, Accuracy and F-measure? (4)
(b) What does it mean for a classifier to have a high precision but low recall? (3)
(c) Fill in the missing values in the accompanying three class confusion matrix. (7)
Given that model accuracy is 72% and classification error for class 2 is 20%.
Find also the precision and recall for class1
Predicted
Class 1 Class 2 Class 3
Class 1 14 2 5
Actual Class 2 ?(X) 40 2
Class 3 1 ?(Y) 18
OR
343
16. (a) What are ROC space and ROC curve in machine learning? In ROC space,
which points correspond to perfect prediction, always positive prediction and (4)
always negative prediction? Why?
(b) Given the following ROC Curve? Find the AUC? (3)
(c) How does random forest classifier work? Why is a random forest better than (7)
a decision tree?
17. (a) Show that the concept class Cn of the conjunction of boolean literals up to n (8)
variables is probably approximately correct(PAC)-learnable.
(b) Explain the concept of Vapnik-Chervonenkis (VC) dimension using (6)

shattering. How the number of training examples required to train the model
is related to the VC dimension and what is its relation with training and
test errors.
OR
18. (a) Consider a Boolean classification problem with n binary variables and a (7)
hypothesis space H, where each hypothesis is a decision tree of depth 1. How
many training examples, m suffice to assure that with probability at least 0.99,
any consistent learner using H will output a hypothesis with true error at most
0.05?
(b) Prove that VC(H) ≤ log2 |H|, where H is a hypothesis space. (|H| denotes the (7)
344
cardinality of the hypothesis space)
19. (a) Shown below is the Bayesian network corresponding to the Burglar Alarm (7)
problem, P(J | A) P(M | A) P(A | B, E) P(B) P(E). The probability tables show
the probability that variable is True, e.g., P(M) means P(M = t). Find P( J = t ∧
M = f ∧ A = f ∧ B = f ∧ E = t).
(b) Derive an algorithm using the inverse transform method to generate a (7)
random sample from the distribution with density fX(x) = 3 x2, 0 < x < 1.
OR
20. (a) Draw the Bayesian Network that corresponds to this conditional probability: (6)
P(A | B,C,E) P(B | D,E) P(C | F,H) P(D | G) P(E| G,H) P(F | H) P(G) P(H)
(b) What is effective sample size (ESS)? Why is a large ESS necessary but not (3)
sufficient for good MCMC mixing?
(c) Describe the overall Gibbs sampling algorithm briefly (5)
345
Teaching Plan
Module 1 : (Supervised Learning)( 10 hours)
1.1 Supervised, semi-supervised, unsupervised learning, reinforcement 1 hour

learning (TB 2: Ch 1)
1.2 Least squares linear regression (TB 2: Section 2.6) 1 hour
1.3 Gradient descent, closed form, normal equations (TB 2: Section 5.8) 1 hour
1.4 Regularization techniques (LASSO, RIDGE) (TB 4: Section 7.1) 1 hour
1.5 Polynomial regression (TB 2: Section 2.6) 1 hour
1.6 Logistic Regression (TB 6: Section 3.3) 1 hour
1.7 Decision Tree Learning (ID3) (TB 8: Section 8.2) 1 hour
1.8 Decision Tree Learning ( C4.5) (TB 8: Section 8.2) 1 hour
1.9 Naive Bayes Classifier (TB 8: Section 8.3) 1 hour
1.10 Gaussian Discriminant Analysis (GDA) (TB 7: Section 5.2,5.3) 1 hour
Module 2 : (Unsupervised Learning)(8 hours)
2.1 Similarity measures (TB 8: Section 2.4) 1 hour
2.2 Hierarchical Agglomerative Clustering (TB 3: Chapter 14) 1 hour
2.3 Hierarchical Agglomerative Clustering (TB 3: Chapter 14)
2.4 K-means partitional clustering (TB 3: Chapter 13) 1 hour
2.5 K-medoids partitional clustering
2.6 Gaussian mixture models (TB 3: Chapter 13) 1 hour
2.7 Expectation Maximization (EM) algorithm for Gaussian mixture model 1 hour
Lecture-1 (TB 3: Chapter 13)
2.8 Expectation Maximization (EM) algorithm for Gaussian mixture model 1 hour
Lecture-2 (TB 3: Chapter 13)
Module 3 : (Practical aspects in machine learning) (6 hours)
346
3.1 Precision, Recall, Accuracy, F-Measure, ROC, AUC (TB8.5/TB 3: 1 hour

Chapter 22.1)
3.2 Generalisation and overfitting, cross-validation (TB 2: Section 2.7,4.8) 1 hour
3.3 Bias-variance tradeoff (TB 2: Chapter 22.3) 1 hour
3.4 Error estimation, parameter and model selection (TB 3: Chapter 8.5) 1 hour
3.5 Bagging, Boosting (TB 8: Chapter 8.6) 1 hour
3.6 Adaboost, Random Forests (TB 8: Chapter 8.6) 1 hour
Module 4 : (Statistical Learning Theory) (TB 5 – Chapter 2, 3.3)(7 hours)
4.1 Learning in the limit, probably approximately correct (PAC) learning 1 hour
4.2 Quantifying the number of examples needed to PAC learn 1 hour
4.3 Computational complexity of training 1 hour
4.4 Sample complexity for finite hypothesis spaces 1 hour
4.5 PAC results for learning conjunctions 1 hour
4.6 Sample complexity for infinite hypothesis spaces 1 hour
4.7 Vapnik-Chervonenkis(VC) dimension 1 hour
Module 5 : (Advanced Machine Learning Topics) (13 hours)
5.1 Bayesian belief networks (TB 1 – Chapter 8) 1 hour
5.2 Markov random fields (TB 1 – Chapter 8) 1 hour
5.3 Inference on chains and factor graphs (TB 1 – Chapter 8) 1 hour
5.4 Inference on clique trees (TB 1 – Chapter 8) 1 hour
5.5 Basic sampling algorithms (TB 1 – Chapter 11) 1 hour
5.6 Rejection sampling (TB 1 – Chapter 11) 1 hour
5.7 Importance sampling (TB 1 – Chapter 11) 1 hour
5.8 Markov chain Monte Carlo(MCMC) (TB 1 – Chapter 11) 1 hour
5.9 Gibbs sampling (TB 1 – Chapter 11) 1 hour
347
5.10 Variational method (TB 1 – Chapter 10) 1 hour
5.11 Auto Encoder (TB 4 – Chapter 14) 1 hour
5.12 Variational AutoEncoder (TB 9 – Chapter 3 ) 1 hour
5.13 Generative Adversarial Networks (TB 9 – Chapter 4) 1 hour
348
THEORY OF Year of
COMPUTABILITY Introduction
398
AND COMPLEXITY VAC 3 1 0 4 2019
Preamble:
This is a theoretical course in computer science to enable the learners to know the fundamentals of
computability and complexity theories. It covers the notions of computability/decidability, the
process of reduction to prove decidability/undecidability and the classification of problems into
class P, class NP and class NP Complete based on the time complexity of solving the problems.
This course helps the learner to identify whether a real life problem is decidable/undecidable and
also to classify a decidable problem into tractable or intractable, based on the time complexity
class it belongs.
Prerequisite: Sound knowledge in Data Structures and Formal Languages and Automata Theory.
CO1 Illustrate relative computing powers of Finite State Automata, Push Down Automata,
Linear Bounded Automata and Turing Machines.(Cognitive Knowledge Level:
Apply)
CO2 Prove that a given language is undecidable/not semi-decidable by using the reduction
process.(Cognitive Knowledge Level: Apply)
CO3 Describe the time complexity of a given problem as a function of the number of steps
required by a Turing machine to solve it. (Cognitive Knowledge Level: Understand)
CO4 Utilize polynomial time reduction to prove that a given problem is NP Complete.
PO PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO11 PO1
1 0 2
CO1
CO2
349
CO3
CO4
PO4 complex problems PO10 Communication
Assessment Pattern

Test 1 (%) Test 2 (%) Marks (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create
350
Mark Distribution
150 50 100 3

Attendance 10 marks
Continuous Assessment Tests(Average of Internal Tests1&2) 25 marks

Internal Examination Pattern
answer any 5.
Syllabus
Module - 1 (Introduction to Formal Language Theory and Regular Languages)
Finite State Automata, Push Down Automata, Linear Bounded Automata, Turing Machines,
Recursive Languages, Recursively Enumerable Languages, Universal Turing Machine,
Enumeration Machine, Two Counter Machine.
Module– 2 (Undecidability)
Halting Problem, Language representation of a problem, Reduction - applications, Rice’s First
and Second Theorem with proof.
351
Module - 3 (Overview of Complexity Classes)
Measuring time complexity, Asymptotic notations - Big O and small-o, Analysing algorithms,
Complexity relationship among models. Complexity classes- Class P, example problems in class
P, Class NP, Polynomial time verification, example problems in class NP.
Module- 4 (NP Completeness)

Satisfiability problem, Polynomial time reducibility, Overview of Graphs, NP Complete Problems,
Cook-Levin theorem (SAT is NP Complete).
Module- 5 (More NP Complete Problems)

CLIQUE, Vertex Cover and Hamiltonian path with proof of correctness of NP Completeness.
Text Books
1. Dexter C. Kozen, Automata and Computability, Springer (1999)
2. Michael Sipser, Introduction to the Theory of Computation, Second Edition
Reference Books
1. Douglas B. West, Introduction to Graph Theory, Second Edition

Identify the class of the following languages in Chomsky Hierarchy:
1. Design a Finite State Automaton for the language 𝐿𝐿 = {𝑎𝑎𝑎𝑎𝑎𝑎|𝑥𝑥 ∈ {𝑎𝑎, 𝑏𝑏}∗ }
2. Design a Push Down Automaton for the language 𝐿𝐿 = {𝑎𝑎𝑛𝑛 𝑏𝑏 𝑛𝑛 |𝑛𝑛 ≥ 0}
3. Design a Linear Bounded Automaton for the language 𝐿𝐿 = {𝑎𝑎𝑛𝑛 𝑏𝑏 𝑛𝑛 𝑐𝑐 𝑛𝑛 |𝑛𝑛 ≥ 0}
4. Design a Turing Machine for the language 𝐿𝐿 = {𝑤𝑤𝑤𝑤|𝑤𝑤 ∈ {𝑎𝑎, 𝑏𝑏}∗ }
Without using Rice’s Theorem prove that neither the set FIN (refer Text Book 1) nor its
complement is recursively enumerable.

Show that the language 𝐿𝐿 = {𝑎𝑎𝑛𝑛 𝑏𝑏 𝑛𝑛 |𝑛𝑛 ≥ 0} can be decided by a deterministic Turing
Machine in quadratic time.
Using polynomial time reduction, prove that SUBSET-SUM (refer Text Book 2) problem is NP
Complete.
352
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
SIXTH SEMESTER B.TECH. DEGREE EXAMINATION(HONORS), MONTH & YEAR
Course Name: Theory of Computability and Complexity
PART A
1. Design a Deterministic Finite state Automaton (DFA) for the language:𝐿𝐿 = {𝑥𝑥 ∈
{0,1}∗ |𝑥𝑥does not contain consecutive zeros}.
2. Design a Pushdown Automaton (PDA) for the language 𝐿𝐿 = {𝑎𝑎𝑚𝑚 𝑏𝑏 𝑛𝑛 |𝑚𝑚 ≥

0and𝑛𝑛 > 𝑚𝑚} (no explanation is required, just list the transitions in the PDA).
3. List any six undecidable problems.
4. Illustrate how a problem can be represented as a language.
5. Describe the term time complexity class.
6. Define the term polynomial time verification. Describe its usage.
7. Define the term polynomial time reduction. Describe its usage.
8. Define vertex cover. Illustrate with the help of a graph.
353
9. Illustrate CLIQUE problem with an example.
10. State Hamiltonian path problem. Show an example.

(10x3=30)
Part B
11. (a) Why the family of languages recognized by Turing machines is called (8)
Recursively Enumerable? Explain the working of an enumeration machine.
(b) Illustrate the functioning of a Universal Turing Machine. (6)
OR
12. (a) Illustrate the functioning of a two counter machine. (4)
(b) Prove that Turing Machines and Two Counter Machines are equivalent in (10)
power.
13. (a) Prove using Diagonalisation that halting problem is undecidable. (8)
(b) Prove Using reduction that state entry problem of Turing machines is (6)
undecidable.
OR
14. (a) State and prove Rice’s first theorem. (8)
(b) Prove Using reduction that whether a Turing Machine accepts empty string (6)
(or null string) is undecidable.
𝑛𝑛 𝑛𝑛
15. (a) Show that the language 𝐿𝐿 = {𝑎𝑎 𝑏𝑏 |𝑛𝑛 ≥ 0} can be decided by a deterministic (7)
Turing Machine in 𝑂𝑂(𝑛𝑛 ⋅ 𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙) time.
(b) Let 𝑡𝑡(𝑛𝑛) be a function, where 𝑛𝑛 ∈ ℕ and 𝑡𝑡(𝑛𝑛) ≥ 𝑛𝑛. Then, prove that every (7)
𝑡𝑡(𝑛𝑛) time nondeterministic single-tape Turing machine has an equivalent
2𝑂𝑂(𝑡𝑡(𝑛𝑛 )) time single-tape deterministic Turing machine.
354
OR
16. (a) Prove that every context free language is a member of class P. (8)
(b) When is a problem said to be in class NP? (6)

Prove that Hamiltonian path problem of a directed graph is in class NP.
17. (a) Define Independent set in a graph. Prove that a graph 𝐺𝐺 of 𝑛𝑛 vertices with an (8)
independent set of size 𝑘𝑘 contains a vertex cover of size 𝑛𝑛 − 𝑘𝑘.
(b) Define the complexity class NP Complete. Explain the significance of an NP (6)
Complete problem.
OR
18. (a) Define the complement of a graph. Prove that the complement of a graph 𝐺𝐺 of (7)
𝑛𝑛 vertices with a CLIQUE of size 𝑘𝑘 contains an independent set of size 𝑘𝑘.
(b) What is satisfiability problem. Prove that satisfiability problem is in class NP. (7)
19. (a) Illustrate Hamiltonian path in a Graph. (4)
(b) Prove that Hamiltonian path problem is in the class NP Complete. (10)
OR
20. (a) Prove that Vertex Cover problem is in the class NP Complete. (8)
(b) Why is it useful to identify that a problem is in the class NP Complete? (6 )
355
Teaching Plan
No. of
Lecture
No Contents Hours
(45 hrs)
Module-1(Overview of Automata Theory) (10 hours)
1.1 Finite State Automata 1 hour

1.2 Push Down Automata 1 hour
1.3 Linear Bounded Automata 1 hour
1.4 Turing Machines 1 hour
1.5 Recursive Languages 1 hour
1.6 Recursively Enumerable Languages 1 hour
1.7 Universal Turing Machine 1 hour
1.8 Enumeration Machine 1 hour
1.9 Two Counter Machines 1 hour
1.10 Proof that two Counter Machines and Turing machines are equivalent 1 hour
Module-2 (Undecidability) (10 hours)
2.1 Halting problem of Turing machine 1 hour
2.2 Proof of undecidability of Halting Problem 1 hour

2.3 Language representation of a problem 1 hour
2.4 Reduction 1 hour
2.5 Applications of reduction - Lecture 1 1 hour
356
2.6 Applications of reduction - Lecture 2 1 hour
2.7 Rice’s First Theorem 1 hour

2.8 Proof of Rice’s First Theorem 1 hour
2.9 Rice’s Second Theorem 1 hour
2.10 Proof of Rice’s Second Theorem 1 hour
Module-3 (Overview of Complexity Classes) (10 hours)
3.1 Measuring time complexity, Asymptotic notations - Big O and small-o 1 hour
3.2 Analysing algorithms - time complexity class 1 hour
3.3 Complexity relationship among models - Single tape Turing Machine 1 hour
3.4 Multi-tape Turing Machine, Nondeterministic Turing Machine 1 hour
3.5 Class P 1 hour
3.6 Example problems in Class P 1 hour
3.7 Class NP 1 hour
3.8 Polynomial time verification 1 hour
3.9 Example problems in Class NP - Lecture 1 1 hour
3.10 Example problems in Class NP - Lecture 2 1 hour
Module-4 (NP Completeness) (9 hours)
4.1 Satisfiability problem 1 hour
4.2 Polynomial time reducibility 1 hour
4.3 Overview of Graphs, CLIQUE, INDEPENDENT SET 1 hour
4.4 Vertex Cover 1 hour
4.5 Reducing 3SAT problem to CLIQUE - Lecture 1 1 hour
4.6 Reducing 3SAT problem to CLIQUE - Lecture 2 1 hour
4.7 NP Complete Problems 1 hour
4.8 Cook-Levin theorem, Proof - Lecture 1 1 hour
4.9 Proof - Lecture 2 1 hour

Module-5 (More NP Complete Problems) (6 hours)
357
5.1 CLIQUE 1 hour
5.2 Vertex Cover - Lecture 1 1 hour

5.3 Vertex Cover - Lecture 2 1 hour
5.4 Hamiltonian path - Lecture 1 1 hour
358
COMMON COURSES
(S5 & S6)
YEAR OF
MCN DISASTER INTRODUCTION
301 MANAGEMENT Non -
2 0 0 Nil 2019
Credit
Preamble: The objective of this course is to introduce the fundamental concepts of hazards and
disaster management.
Prerequisite: Nil
Define and use various terminologies in use in disaster management parlance and
CO1 organise each of these terms in relation to the disaster management cycle (Cognitive
knowledge level: Understand).
Distinguish between different hazard types and vulnerability types and do
CO2
vulnerability assessment (Cognitive knowledge level: Understand).
Identify the components and describe the process of risk assessment, and apply
CO3
appropriate methodologies to assess risk (Cognitive knowledge level: Understand).
Explain the core elements and phases of Disaster Risk Management and develop
CO4 possible measures to reduce disaster risks across sector and community (Cognitive
knowledge level: Apply)
Identify factors that determine the nature of disaster response and discuss the various
CO5
disaster response actions (Cognitive knowledge level: Understand).
Explain the various legislations and best practices for disaster management and risk
CO6 reduction at national and international level (Cognitive knowledge level:
Understand).
1
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO PO1 PO1 PO1
9 0 1 2
CO1 2 2 2 2
CO2 2 3 2 2 2 3 3 2
CO3 2 3 2 2 2 2 3 3 2
CO4 3 3 3 2 2 3 2
CO5 3 3 2 2 3 2
CO6 3 2 3 3 2

problems
2
Assessment Pattern

Examination Marks
Remember 10 10 20
Understand 25 25 50
Apply 15 15 30
Analyze
Evaluate
Create
Mark Distribution

150 50 100 3 hours
3
4
SYLLABUS
MCN 301 Disaster Management
Module 1
Systems of earth
Lithosphere- composition, rocks, soils; Atmosphere-layers, ozone layer, greenhouse effect,

weather, cyclones, atmospheric circulations, Indian Monsoon; hydrosphere- Oceans, inland water
bodies; biosphere
Definition and meaning of key terms in Disaster Risk Reduction and Management- disaster,
hazard, exposure, vulnerability, risk, risk assessment, risk mapping, capacity, resilience, disaster
risk reduction, disaster risk management, early warning systems, disaster preparedness, disaster
prevention, disaster mitigation, disaster response, damage assessment, crisis counselling, needs
assessment.
Module 2
Hazard types and hazard mapping; Vulnerability types and their assessment- physical, social,
economic and environmental vulnerability.
Disaster risk assessment –approaches, procedures
Module 3
Disaster risk management -Core elements and phases of Disaster Risk Management
Measures for Disaster Risk Reduction – prevention, mitigation, and preparedness.
Disaster response- objectives, requirements; response planning; types of responses.
Relief; international relief organizations.
Module 4
Participatory stakeholder engagement; Disaster communication- importance, methods, barriers;

Crisis counselling
Capacity Building: Concept – Structural and Non-structural Measures, Capacity Assessment;

Strengthening Capacity for Reducing Risk
5
Module 5
Common disaster types in India; Legislations in India on disaster management; National disaster
management policy; Institutional arrangements for disaster management in India.
The Sendai Framework for Disaster Risk Reduction- targets, priorities for action, guiding
principles
Reference Text Book
1. R. Subramanian, Disaster Management, Vikas Publishing House, 2018
2. M. M. Sulphey, Disaster Management, PHI Learning, 2016
3. UNDP, Disaster Risk Management Training Manual, 2016
4. United Nations Office for Disaster Risk Reduction, Sendai Framework for Disaster Risk
Reduction 2015-2030, 2015

1. What is the mechanism by which stratospheric ozone protects earth from harmful UV
rays?
2. What are disasters? What are their causes?
3. Explain the different types of cyclones and the mechanism of their formation
4. Explain with examples, the difference between hazard and risk in the context of disaster
management
5. Explain the following terms in the context of disaster management (a) exposure (b)
resilience (c) disaster risk management (d) early warning systems, (e) damage assessment
(f) crisis counselling (g) needs assessment

1. What is hazard mapping? What are its objectives?
2. What is participatory hazard mapping? How is it conducted? What are its advantages?
3. Explain the applications of hazard maps
4. Explain the types of vulnerabilities and the approaches to assess them

1. Explain briefly the concept of ‘disaster risk’
6
2. List the strategies for disaster risk management ‘before’, ‘during’ and ‘after’ a disaster
3. What is disaster preparedness? Explain the components of a comprehensive disaster
preparedness strategy

1. What is disaster prevention? Distinguish it from disaster mitigation giving examples
2. What are the steps to effective disaster communication? What are the barriers to
communication?
3. Explain capacity building in the context of disaster management
1. Briefly explain the levels of stakeholder participation in the context of disaster risk
reduction
2. Explain the importance of communication in disaster management
3. Explain the benefits and costs of stakeholder participation in disaster management
4. How are stakeholders in disaster management identified?

1. Explain the salient features of the National Policy on Disaster Management in India
2. Explain the guiding principles and priorities of action according to the Sendai Framework
for Disaster Risk Reduction
3. What are Tsunamis? How are they caused?
4. Explain the earthquake zonation of India
7
QP CODE: PAGES:3
Reg No:______________ Name :______________
Course Code: MCN 301
Course Name: Disaster Management
PART A
1. What is the mechanism by which stratospheric ozone protects earth from harmful UV
rays?
2. What are disasters? What are their causes?
3. What is hazard mapping? What are its objectives?
4. Explain briefly the concept of ‘disaster risk’
5. List the strategies for disaster risk management ‘before’, ‘during’ and ‘after’ a disaster
6. What is disaster prevention? Distinguish it from disaster mitigation giving examples
7. Briefly explain the levels of stakeholder participation in the context of disaster risk
reduction
8. Explain the importance of communication in disaster management
9. What are Tsunamis? How are they caused?
10. Explain the earthquake zonation of India

Part B
8
11. a. Explain the different types of cyclones and the mechanism of their formation [10]
b. Explain with examples, the difference between hazard and risk in the context of
disaster management
[4]
OR
12. Explain the following terms in the context of disaster management [14]
(a) exposure (b) resilience (c) disaster risk management (d) early warning systems, (e) damage
assessment (f) crisis counselling (g) needs assessment
13. a. What is participatory hazard mapping? How is it conducted? What are its advantages?
[8]
b. Explain the applications of hazard maps [6]
OR
14. Explain the types of vulnerabilities and the approaches to assess them [14]
15. a. Explain the core elements of disaster risk management [8]
b. Explain the factors that decide the nature of disaster response [6]
OR
16. a. What is disaster preparedness? Explain the components of a comprehensive disaster

preparedness strategy [6]
b. Explain the different disaster response actions [8]
17. a. Explain the benefits and costs of stakeholder participation in disaster management [10]
b. How are stakeholders in disaster management identified? [4]
OR
18. a. What are the steps to effective disaster communication? What are the barriers to
communication? [7]
b. Explain capacity building in the context of disaster management [7]
9
19. Explain the salient features of the National Policy on Disaster Management in India
[14]
OR
20. Explain the guiding principles and priorities of action according to the Sendai Framework
for Disaster Risk Reduction [14]
10
Teaching Plan
Module 1 5 Hours
1.1 Introduction about various Systems of earth, Lithosphere- 1 Hour
composition, rocks, Soils; Atmosphere-layers, ozone layer,
greenhouse effect, weather
1.2 Cyclones, atmospheric circulations, Indian Monsoon; hydrosphere- 1 Hour
Oceans, inland water bodies; biosphere
1.3 Definition and meaning of key terms in Disaster Risk Reduction 1 Hour
and Management- disaster, hazard,
1.4 Exposure, vulnerability, risk, risk assessment, risk mapping, 1 Hour
capacity, resilience, disaster risk reduction, Disaster risk
management, early warning systems
1.5 Disaster preparedness, disaster prevention, disaster, Mitigation, 1 Hour
disaster response, damage assessment, crisis counselling, needs
assessment.
Module 2 5 Hours
2.1 Various Hazard types, Hazard mapping; Different types of 1 Hour
Vulnerability types and their assessment
2.2 Vulnerability assessment and types, Physical and social 1 Hour
vulnerability
2.3 Economic and environmental vulnerability, Core elements of 1 Hour
disaster risk assessment
2.4 Components of a comprehensive disaster preparedness strategy 1 Hour
approaches, procedures
2.5 Different disaster response actions 1 Hour
Module 3 5 Hours
3.1 Introduction to Disaster risk management, Core elements of 1 Hour
Disaster Risk Management
3.2 Phases of Disaster Risk Management, Measures for Disaster Risk 1 Hour
Reduction
3.3 Measures for Disaster prevention, mitigation, and preparedness. 1 Hour
11
3.4 Disaster response- objectives, requirements. Disaster response 1 Hour
planning; types of responses.
3.5 Introduction- Disaster Relief, Relief; international relief 1 Hour
organizations.
Module 4 5 Hours
4.1 Participatory stakeholder engagement 1 Hour
4.2 Importance of disaster communication. 1 Hour
4.3 Disaster communication- methods, barriers. Crisis counselling 1 Hour
4.4 Introduction to Capacity Building. Concept – Structural Measures, 1 Hour
Non-structural Measures.
4.5 Introduction to Capacity Assessment, Capacity Assessment; 1 Hour
Strengthening, Capacity for Reducing Risk
Module 5 5 Hours
5.1 Introduction-Common disaster types in India. 1 Hour
5.2 Common disaster legislations in India on disaster management 1 Hour
5.3 National disaster management policy, Institutional arrangements 1 Hour
for disaster management in India.
5.4 The Sendai Framework for Disaster Risk Reduction and targets 1 Hour
5.5 The Sendai Framework for Disaster Risk Reduction-priorities for 1 Hour
action, guiding principles
12
Industrial Economics &
HUT 300
Foreign Trade HSMC 3 0 0 3
Preamble: To equip the students to take industrial decisions and to create awareness of economic
environment.
Prerequisite: Nil
Explain the problem of scarcity of resources and consumer behaviour, and to evaluate
CO1 the impact of government policies on the general economic welfare. (Cognitive
knowledge level: Understand)
Take appropriate decisions regarding volume of output and to evaluate the social cost
CO2
of production. (Cognitive knowledge level: Apply)
Determine the functional requirement of a firm under various competitive conditions.

CO3
(Cognitive knowledge level: Analyse)
Examine the overall performance of the economy, and the regulation of economic
CO4 fluctuations and its impact on various sections in the society. (Cognitive knowledge
level: Analyse)
Determine the impact of changes in global economic policies on the business
CO5
opportunities of a firm. (Cognitive knowledge level: Analyse)
CO1 2 3
CO2 2 2 2 2 3 3
CO3 2 2 1 3
CO4 2 2 1 1 3
CO5 2 2 1 3
1

problems
Assessment Pattern

Examination Marks
Remember 15 15 30
Understand 20 20 40
Apply 15 15 30
Mark Distribution

150 50 100 3 hours
2
Continuous Assessment - Test (2 numbers) : 25 marks
There will be two parts; Part A and Part B.

Part A : 30 marks
Part B : 70 marks
Part A contains 10 questions with 2 questions from each module, having 3 marks for each
question. Students should answer all questions. Part B contains 2 questions from each module of
which a student should answer any one. Each question can have maximum 3 sub-divisions and
carries 14 marks.
3
SYLLABUS
HUT 300 Industrial Economics & Foreign Trade
Module 1 (Basic Concepts and Demand and Supply Analysis)
Scarcity and choice - Basic economic problems- PPC – Firms and its objectives – types of firms
– Utility – Law of diminishing marginal utility – Demand and its determinants – law of demand
– elasticity of demand – measurement of elasticity and its applications – Supply, law of supply
and determinants of supply – Equilibrium – Changes in demand and supply and its effects –
Consumer surplus and producer surplus (Concepts) – Taxation and deadweight loss.
Module 2 (Production and cost)
Production function – law of variable proportion – economies of scale – internal and external
economies – Isoquants, isocost line and producer’s equilibrium – Expansion path – Technical
progress and its implications – Cobb-Douglas production function - Cost concepts – Social cost:
private cost and external cost – Explicit and implicit cost – sunk cost - Short run cost curves -
long run cost curves – Revenue (concepts) – Shutdown point – Break-even point.
Module 3 (Market Structure)
Perfect and imperfect competition – monopoly, regulation of monopoly, monopolistic completion

(features and equilibrium of a firm) – oligopoly – Kinked demand curve – Collusive oligopoly
(meaning) – Non-price competition – Product pricing – Cost plus pricing – Target return pricing
– Penetration pricing – Predatory pricing – Going rate pricing – Price skimming.
Module 4 (Macroeconomic concepts)
Circular flow of economic activities – Stock and flow – Final goods and intermediate goods -
Gross Domestic Product - National Income – Three sectors of an economy- Methods of
measuring national income – Inflation- causes and effects – Measures to control inflation-
Monetary and fiscal policies – Business financing- Bonds and shares -Money market and Capital
market – Stock market – Demat account and Trading account - SENSEX and NIFTY.
Module 5 (International Trade)
Advantages and disadvantages of international trade - Absolute and Comparative advantage

theory - Heckscher - Ohlin theory - Balance of payments – Components – Balance of Payments
4
deficit and devaluation – Trade policy – Free trade versus protection – Tariff and non-tariff
barriers.
Reference Materials
1. Gregory N Mankiw, ‘Principles of Micro Economics’, Cengage Publications
2. Gregory N Mankiw, ‘Principles of Macro Economics’, Cengage Publications
3. Dwivedi D N, ‘Macro Economics’, Tata McGraw Hill, New Delhi.
4. Mithani D M, ‘Managerial Economics’, Himalaya Publishing House, Mumbai.
5. Francis Cherunilam, ‘International Economics’, McGraw Hill, New Delhi.

1. Why does the problem of choice arise?
2. What are the central problems?
3. How do we solve the basic economic problems?
4. What is the relation between price and demand?
5. Explain deadweight loss due to the imposition of a tax.
1. What is shutdown point?

2. What do you mean by producer equilibrium?
3. Explain break-even point;
4. Suppose a chemical factory is functioning in a residential area. What are the external costs?
1. Explain the equilibrium of a firm under monopolistic competition.

2. Why is a monopolist called price maker?
3. What are the methods of non-price competition under oligopoly?
5
4. What is collusive oligopoly?
1. What is the significance of national income estimation?

2. How is GDP estimated?
3. What are the measures to control inflation?
4. How does inflation affect fixed income group and wage earners?
1. What is devaluation?
2. Suppose a foreign country imposes a tariff on Indian goods. How does it affect India’s
exports?
3. What is free trade?
4. What are the arguments in favour of protection?
6
QP CODE: PAGES:3
Reg No:______________ Name :______________
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY FIFTH /SIXTH SEMESTER

Course Name: Industrial Economics & Foreign Trade
PART A
1. Why does an economic problem arise?
2. What should be the percentage change in price of a product if the sale is to be increased by 50
percent and its price elasticity of demand is 2?
3. In the production function Q= 2L 1/2K 1/2 if L=36 how many units of capital are needed to
produce 60 units of output?
4. Suppose in the short run AVC 4. Suppose in the short run AVC<P<AC. Will this firm produce
or shut down? Give reason.
5. What is predatory pricing?
6. What do you mean by non- price competition under oligopoly?
7. What are the important economic activities under primary sector?
8. Distinguish between a bond and share?
9. What are the major components of balance of payments?
7
10. What is devaluation? (10 x 3 = 30 marks)
PART B
MODULE I
11. a) Prepare a utility schedule showing units of consumption, total utility and marginal
utility, and explain the law of diminishing marginal utility. Point out any three
limitations of the law.
b) How is elasticity of demand measured according to the percentage method? How is
the measurement of elasticity of demand useful for the government?
Or
12. a) Explain the concepts consumer surplus and producer surplus.
b) Suppose the government imposes a tax on a commodity where the tax burden met
by the consumers. Draw a diagram and explain dead weight loss. Mark consumer
surplus, producer surplus, tax revenue and dead weight loss in the diagram.
MODULE II
13. a) What are the advantages of large-scale production?
b) Explain Producer equilibrium with the help of isoquants and isocost line. What is
expansion path?
Or
14. a) Explain break-even analysis with the help of a diagram.
b) Suppose the monthly fixed cost of a firm is Rs. 40000 and its monthly total variable
cost is Rs. 60000.
i. If the monthly sales is Rs. 120000 estimate contribution and break-even sales.
ii. If the firm wants to get a monthly profit of Rs.40000, what should be the sales?
c) The total cost function of a firm is given as TC=100+50Q - 11Q2+Q3. Find

marginal cost when output equals 5 units.
MODULE III
8
15. a) What are the features of monopolistic competition?
b) Explain the equilibrium of a firm earning supernormal profit under monopolistic
competition.
Or
16.a) Make comparison between perfect competition and monopoly.
b) Explain price rigidity under oligopoly with the help of a kinked demand curve.
MODULE IV
17. a) How is national income estimated under product method and expenditure method?
b) Estimate GDPmp, GNPmp and National income
Private consumption = 2000 (in 000 cores)

expenditure
= 500
Government Consumption
NFIA = -(300)
Investment = 800
Net=exports =700
Depreciation = 400
Net-indirect tax = 300
Or
18. a) What are the monetary and fiscal policy measures to control inflation?
b) What is SENSEX?
MODULE V
19. a) What are the advantages of disadvantages of foreign trade?
b) Explain the comparative cost advantage.
Or
20. a) What are the arguments in favour protection?
b) Examine the tariff and non-tariff barriers to international trade.
(5 × 14 = 70 marks)
9
Teaching Plan
Module 1 (Basic concepts and Demand and Supply Analysis) 7 Hours
1.1 Scarcity and choice – Basic economic problems - PPC 1 Hour
1.2 Firms and its objectives – types of firms 1 Hour
1.3 Utility – Law of diminishing marginal utility – Demand – law of demand 1 Hour
1.4 Measurement of elasticity and its applications 1 Hour
1.5 Supply, law of supply and determinants of supply 1 Hour
1.6 Equilibrium – changes in demand and supply and its effects 1 Hour
Consumer surplus and producer surplus (Concepts) – Taxation and
1.7 1 Hour
deadweight loss.
Module 2 (Production and cost) 7 Hours
2.1 Productions function – law of variable proportion 1 Hour
2.2 Economies of scale – internal and external economies 1 Hour
2.3 producers equilibrium – Expansion path 1 Hour
2.4 Technical progress and its implications – cob Douglas Production function 1 Hour
Cost concepts – social cost: private cost and external cost – Explicit and
2.5 1 Hour
implicit cost – sunk cost
2.6 Short run cost curves & Long run cost curves 1 Hour
2.7 Revenue (concepts) – shutdown point – Break-even point. 1 Hour

Module 3 (Market Structure) 6 hours
3.1 Equilibrium of a firm, MC – MR approach and TC – TR approach 1 Hour
3.2 Perfect competition & Imperfect competition 1 Hour
3.3 Monopoly – Regulation of monopoly – Monopolistic competition 1 Hour
3.4 Oligopoly – kinked demand curve 1 Hour
3.5 Collusive oligopoly (meaning) – Non price competition 1 Hour

Cost plus pricing – Target return pricing – Penetration, Predatory pricing –
3.6 1 Hour
Going rate pricing – price skimming
10
Module 4 (Macroeconomic concepts) 7 Hours
4.1 Circular flow of economic activities 1 Hour
Stock and flow – Final goods and intermediate goods – Gross Domestic
4.2 1 Hour
Product - National income – Three sectors of an economy
4.3 Methods of measuring national income 1 Hour
4.4 Inflation – Demand pull and cost push – Causes and effects 1 Hour
4.5 Measures to control inflation – Monetary and fiscal policies 1 Hour

Business financing – Bonds and shares – Money market and capital
4.6 1 Hour
market
Stock market – Demat account and Trading account – SENSEX and
4.7 1 Hour
NIFTY
Module 5 (International Trade) 8 Hours
5.1 Advantages and disadvantages of international trade 1 Hour
5.2 Absolute and comparative advantage theory 2 Hour
5.3 Heckscher – Ohlin theory 1 Hour
5.4 Balance of payments - components 1 Hour
5.5 Balance of payments deficit and devaluation 1 Hour
5.6 Trade policy – Free trade versus protection 1 Hour
5.7 Tariff and non tariff barriers. 1 Hour
11
HUT
Management for Engineers
310 HMC 3 0 0 3
Preamble: This course is intended to help the students to learn the basic concepts and functions
of management and its role in the performance of an organization and to understand various
decision-making approaches available for managers to achieve excellence. Learners shall have a
broad view of different functional areas of management like operations, human resource, finance
and marketing.
Prerequisite: Nil
Course Outcomes After the completion of the course the student will be able to
Explain the characteristics of management in the contemporary context (Cognitive

CO1
Knowledge level: Understand).
CO2 Describe the functions of management (Cognitive Knowledge level: Understand).
Demonstrate ability in decision making process and productivity analysis (Cognitive
CO3
Illustrate project management technique and develop a project schedule (Cognitive
CO4
Knowledge level: Apply).
Summarize the functional areas of management (Cognitive Knowledge level:
CO5
Understand).
Comprehend the concept of entrepreneurship and create business plans (Cognitive
CO6
1
CO1 2 1 2 2 2 2 1 1
CO2 2 1 1 2 1 2 1 1
CO3 2 2 2 2 1
CO4 2 2 2 2 1 2 1
CO5 2 1 1 1 2 1
CO6 2 2 2 1 1 1 1 1 1 1 1

Assessment Pattern
Bloom’s Test 1 (Marks in Test 2 (Marks in End Semester Examination

Category percentage) percentage) (Marks in percentage)
Remember 15 15 30
Understand 15 15 30
Apply 20 20 40
Analyse
Evaluate
Create
2
Mark Distribution

150 50 100 3 Hours
3
SYLLABUS
HUT 310 Management for Engineers (35 hrs)
Module 1 (Introduction to management Theory- 7 Hours)
Introduction to management theory, Management Defined, Characteristic of Management,

Management as an art-profession, System approaches to Management, Task and Responsibilities
of a professional Manager, Levels of Manager and Skill required.
Module 2 (management and organization- 5 hours)
Management Process, Planning types , Mission, Goals, Strategy, Programmes, Procedures,

Organising, Principles of Organisation, Delegation, Span of Control, Organisation Structures,
Directing, Leadership, Motivation, Controlling..
Module 3 (productivity and decision making- 7 hours)
Concept of productivity and its measurement; Competitiveness; Decision making process;

decision making under certainty, risk and uncertainty; Decision trees; Models of decision
making.
. Module 4 (project management- 8 hours)
Project Management, Network construction, Arrow diagram, Redundancy. CPM and PERT
Networks, Scheduling computations, PERT time estimates, Probability of completion of project,
Introduction to crashing.
Module 5 (functional areas of management- 8 hours)
Introduction to functional areas of management, Operations management, Human resources

management, Marketing management, Financial management, Entrepreneurship, Business plans,
Corporate social responsibility, Patents and Intellectual property rights.
References:
4
1. H. Koontz, and H. Weihrich, Essentials of Management: An International Perspective. 8th
ed., McGraw-Hill, 2009.
2. P C Tripathi and P N Reddy, Principles of management, TMH, 4th edition, 2008.
3. P. Kotler, K. L. Keller, A. Koshy, and M. Jha, Marketing Management: A South Asian

Perspective. 14th ed., Pearson, 2012.
4. M. Y. Khan, and P. K. Jain, Financial Management, Tata-McGraw Hill, 2008.
5. R. D. Hisrich, and M. P. Peters, Entrepreneurship: Strategy, Developing, and Managing a

New Enterprise, 4th ed., McGraw-Hill Education, 1997.
6. D. J. Sumanth, Productivity Engineering and Management, McGraw-Hill Education,

1985.
7. K.Ashwathappa, ‘Human Resources and Personnel Management’, TMH, 3 rd edition,

2005.
8. R. B. Chase, Ravi Shankar and F. R. Jacobs, Operations and Supply Chain Management,
14th ed. McGraw Hill Education (India), 2015.
Course Outcome1 (CO1): Explain the systems approach to management?
Course Outcome 2 (CO2): Explain the following terms with a suitable example Goal,
Objective, and Strategy.
Course Outcome 3 (CO3): Mr. Shyam is the author of what promises to be a successful novel.
He has the option to either publish the novel himself or through a publisher. The publisher is
offering Mr. Shyam Rs. 20,000 for signing the contract. If the novel is successful, it will sell
200,000 copies. Else, it will sell 10,000 copies only. The publisher pays a Re. 1 royalty per copy.
A market survey indicates that there is a 70% chance that the novel will be successful. If Mr.
Shyam undertakes publishing, he will incur an initial cost of Rs. 90,000 for printing and
marketing., but each copy sold will net him Rs. 2. Based on the given information and the
5
decision analysis method, determine whether Mr. Shyam should accept the publisher’s offer or
publish the novel himself.
Course Outcome 4 (CO4): Explain the concepts of crashing and dummy activity in project
management.
Course Outcome 5 (CO5): Derive the expression for the Economic order quantity (EOQ)?
Course Outcome 6 (CO6): Briefly explain the theories of Entrepreneurial motivation.?
6
QP CODE: PAGES: 4
Reg No:_______________ Name:_________________

Course name: Management for Engineers
PART-A (Answer All Questions. Each question carries 3 marks)
1. “Management is getting things done through other.” Elaborate.
2. Comment on the true nature of management. Is it a science or an art?
3. Planning is looking ahead and controlling is looking back. Comment with suitable examples
4. Explain the process of communication?
5. Explain the hierarchy of objectives?
6. Explain the types of decisions?
7. Describe the Economic man model?
8. Explain the concepts of crashing and dummy activity in project management.
9. Differentiate the quantitative and qualitative methods in forecasting.
10. What are the key metrics for sustainability measurement? What makes the measurement and
reporting of sustainability challenging?
PART-B (Answer any one question from each module)
11. a) Explain the systems approach to management. (10)
b) Describe the roles of a manager (4)
OR
7
12. a) Explain the 14 principles of administrative management? (10)
b) Explain the different managerial skills (4)
13. a) What are planning premises, explain the classification of planning premises. (10)
b) Distinguish between strategy and policy. How can policies be made effective. (4)
OR
14 a) Explain three motivational theories. (9)
b) Describe the managerial grid. (5)
15. a) Modern forest management uses controlled fires to reduce fire hazards and to stimulate
new forest growth. Management has the option to postpone or plan a burning. In a specific forest
tract, if burning is postponed, a general administrative cost of Rs. 300 is incurred. If a controlled
burning is planned, there is a 50% chance that good weather will prevail and burning will cost
Rs. 3200. The results of the burning may be either successful with probability 0.6 or marginal
with probability 0.4. Successful execution will result in an estimated benefit of Rs. 6000, and
marginal execution will provide only Rs. 3000 in benefits. If the weather is poor, burning will be
cancelled incurring a cost of Rs. 1200 and no benefit. i) Develop a decision tree for the problem.
(ii) Analyse the decision tree and determine the optimal course of action. (8)
b) Student tuition at ABC University is $100 per semester credit hour. The Education department
supplements the university revenue by matching student tuition, dollars per dollars. Average
class size for typical three credit course is 50 students. Labour costs are $4000 per class, material
costs are $20 per student, and overhead cost are $25,000 per class. (a) Determine the total factor
productivity. (b) If instructors deliver lecture 14 hours per week and the semester lasts for 16
weeks, what is the labour productivity? (6)
OR
16. a) An ice-cream retailer buys ice cream at a cost of Rs. 13 per cup and sells it for Rs. 20 per
cup; any remaining unsold at the end of the day, can be disposed at a salvage price of Rs. 2.5 per
cup. Past sales have ranged between 13 and 17 cups per day; there is no reason to believe that
8
sales volume will take on any other magnitude in future. Find the expected monetary value and
EOL, if the sales history has the following probabilities:
(9)
Market Size 13 14 15 16 17
Probability 0.10 0.15 0.15 0.25 0.35
b) At Modem Lumber Company, Kishore the president and a producer of an apple crates sold to
growers, has been able, with his current equipment, to produce 240 crates per 100 logs. He
currently purchases 100 logs per day, and each log required 3 labour hours to process. He
believes that he can hire a professional buyer who can buy a better quality log at the same cost. If
this is the case, he increases his production to 260 crates per 100 logs. His labour hours will
increase by 8 hours per day. What will be the impact on productivity (measured in crates per
labour-hour) if the buyer is hired? What is the growth in productivity in this case?
(5)
17. a) A project has the following list of activities and time estimates:
Activity Time (Days) Immediate Predecessors

A 1 -
B 4 A
C 3 A
D 7 A
E 6 B
F 2 C, D
G 7 E, F
H 9 D
I 4 G, H
(a) Draw the network. (b) Show the early start and early finish times. (c) Show the
critical path. (10)
9
b) An opinion survey involves designing and printing questionnaires, hiring and training
personnel, selecting participants, mailing questionnaires and analysing data. Develop the
precedence relationships and construct the project network. (4)
OR
18. a) The following table shows the precedence requirements, normal and crash times, and
normal and crash costs for a construction project:
Immediate Required Time (Weeks) Cost (Rs.)

Activity
Predecessors Normal Crash Normal Crash
A - 4 2 10,000 11,000
B A 3 2 6,000 9,000
C A 2 1 4,000 6,000
D B 5 3 14,000 18,000
E B, C 1 1 9,000 9,000
F C 3 2 7,000 8,000
G E, F 4 2 13,000 25,000
H D, E 4 1 11,000 18,000
I H, G 6 5 20,000 29,000
Draw the network. (b) Determine the critical path. (c) Determine the optimal duration and the
associated cost. (10)
b) Differentiate between CPM and PERT. (4)
19. a) What is meant by market segmentation and explain the process of market segmentation (8)
b) The Honda Co. in India has a division that manufactures two-wheel motorcycles. Its budgeted
sales for Model G in 2019 are 80,00,000 units. Honda’s target ending inventory is 10,00, 000
units and its beginning inventory is 12, 00, 000 units. The company’s budgeted selling price to its
distributors and dealers is Rs. 40, 000 per motorcycle. Honda procures all its wheels from an
10
outside supplier. No defective wheels are accepted. Honda’s needs for extra wheels for
replacement parts are ordered by a separate division of the company. The company’s target
ending inventory is 3,00,000 wheels and its beginning inventory is 2,00,000 wheels. The
budgeted purchase price is Rs. 1,600 per wheel.
(a) Compute the budgeted revenue in rupees.
(b) Compute the number of motorcycles to be produced.
Compute the budgeted purchases of wheels in units and in rupees.? (6)
OR
20. a) a) “Human Resource Management policies and principles contribute to effectiveness,

continuity and stability of the organization”. Discuss. (b) What is a budget? Explain how sales
budget and production budgets are prepared? (10)
b) Distinguish between the following: (a) Assets and Liabilities (b) Production concept and
Marketing concept (c) Needs and Wants (d) Design functions and Operational control functions
in operations (4)
11
Teaching Plan
Sl.No TOPIC SESSION

Module I
1.1 Introduction to management 1
1.2 Levels of managers and skill required 2
1.3 Classical management theories 3
1.4 neo-classical management theories 4
1.5 modern management theories 5
1.6 System approaches to Management, 6

1.7 Task and Responsibilities of a professional Manager 7
Module 2
2.1 Management process – planning 8
Mission – objectives – goals – strategy – policies – programmes
2.2 9
– procedures
2.3 Organizing, principles of organizing, organization structures 10
2.4 Directing, Leadership 11
2.5 Motivation, Controlling 12
Module III
3.1 Concept of productivity and its measurement Competitiveness 13
3.2 Decision making process; 14
3.3 Models in decision making 15
3.4 Decision making under certainty and risk 16

3.5 Decision making under uncertainty 17
3.6 Decision trees 18
3.7 Models of decision making. 19
Module IV
4.1 Project Management 20
12
Sl.No TOPIC SESSION
Module I
4.2 Network construction 21
4.3 Arrow diagram, Redundancy 22

4.4 CPM and PERT Networks 23
4.5 Scheduling computations 24
4.6 PERT time estimates 25
4.7 Probability of completion of project 26
4.8 Introduction to crashing
Module V
5.1 Introduction to functional areas of management, 28
5.2 Operations management 29
5.3 Human resources management , 30

5.4 Marketing management 31
5.5 Financial management 32

5.6 Entrepreneurship, 33
5.7 Business plans 34
Corporate social responsibility, Patents and Intellectual property

5.8 35
rights
13
SEMESTER VII
ARTIFICIAL CATEGORY L T P CREDIT

CST401
INTELLIGENCE PCC 2 1 0 3
Preamble: The course aims to introduce the fundamental principles of intelligent systems to
students. This involves ideas about the characteristics of intelligent systems, knowledge
representation schemes, logic and inference mechanisms. The course helps the learner to
understand the design of self learning systems along with some of their typical applications in the
emerging scenario where the business world is being transformed by the progress made in
machine learning.
Prerequisite : NIL
CO# CO
Explain the fundamental concepts of intelligent systems and their architecture.
CO1 (Cognitive Knowledge Level: Understanding)
Illustrate uninformed and informed search techniques for problem solving in

CO2
intelligent systems. (Cognitive Knowledge Level: Understanding )
Solve Constraint Satisfaction Problems using search techniques.

CO3 (Cognitive Knowledge Level: Apply )
Represent AI domain knowledge using logic systems and use inference techniques
CO4 for reasoning in intelligent systems. (Cognitive Knowledge Level: Apply )
Illustrate different types of learning techniques used in intelligent systems

CO1
CO2
CO3
CO4
CO5


Assessment Pattern

Bloom’s Examination Marks (%)
Category
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 60 30 40
Apply 20 40 30
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3

Attendance 10 marks
Continuous Assessment Tests(Average of SeriesTests1& 2) 25 marks


Syllabus
Introduction – What is Artificial Intelligence(AI) ? The Foundations of AI, History of AI,
Applications of AI. Intelligent Agents – Agents and Environments, Good behavior: The concept
of rationality, nature of Environments, Structure of Agents.
Module – 2 (Problem Solving)

Solving Problems by searching-Problem solving Agents, Example problems, Searching for
solutions, Uninformed search strategies, Informed search strategies, Heuristic functions.
Module - 3 (Search in Complex environments)

Adversarial search - Games, Optimal decisions in games, The Minimax algorithm, Alpha-Beta
pruning. Constraint Satisfaction Problems – Defining CSP, Constraint Propagation- inference in
CSPs, Backtracking search for CSPs, Structure of CSP problems.
Module - 4 (Knowledge Representation and Reasoning)

Logical Agents – Knowledge based agents, Logic, Propositional Logic, Propositional Theorem
proving, Agents based on Propositional Logic. First Order Predicate Logic – Syntax and
Semantics of First Order Logic, Using First Order Logic, Knowledge representation in First
Order Logic. Inference in First Order Logic – Propositional Vs First Order inference, Unification
and Lifting, Forward chaining, Backward chaining, Resolution.
Module - 5 (Machine Learning)

Learning from Examples – Forms of Learning, Supervised Learning, Learning Decision Trees,
Evaluating and choosing the best hypothesis, Regression and classification with Linear
models.
Text Book
1. Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach, 3rd Edition.
Prentice Hall.
References
1. Nilsson N.J., Artificial Intelligence - A New Synthesis, Harcourt Asia Pvt. Ltd.

1. Explain about the basic types of agent programs in intelligent systems.
2. For the following activities, give a PEAS description of the task environment and characterize
it in terms of the task environment properties.
a) Playing soccer.
b) Bidding on an item at an auction.

1. Differentiate between uninformed and informed search strategies in intelligent systems.
2. Illustrate the working of Minimax search procedure.

1. Solve the following crypt arithmetic problem by hand, using the strategy of backtracking
with forward checking and the MRV & least-constraining-value
heuristics.

1. Prove, or find a counter example to, the following assertion:
If α |= γ or β |= γ (or both) then (α ∧β) |= γ
2. For each pair of atomic sentences, find the most general unifier if it exists:
a) P (A, B, B), P (x, y, z).
b) Q(y, G(A, B)), Q(G(x, x), y).

1. Consider the following data set comprised of three binary input attributes (A1 , A2 , and
A3 ) and one binary output.
Use the DECISION-TREE-LEARNING algorithm to learn a decision tree for these data.
Show the computations made to determine the attribute to split at each node.
2. What is multivariate linear regression? Explain.
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
SEVENTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Code: CST401
Course Name: Artificial Intelligence
PART A
1 What is a rational agent? Explain.
2 Describe any two ways to represent states and the transitions between them in
agent programs.
3 Differentiate between informed search and uninformed search.
4 Define heuristic function? Give two examples.

5 What are the components of a Constraint Satisfaction Problem? Illustrate with an

example.
6 Formulate the following problem as a CSP. Class scheduling: There is a fixed

number of professors and classrooms, a list of classes to be offered, and a list of
possible time slots for classes. Each professor has a set of classes that he or she can
teach.
7 What is a knowledge based agent? How does it work?
8. Represent the following assertion in propositional logic:

“A person who is radical (R) is electable (E) if he/she is conservative (C), but
otherwise is not electable.”
9 Describe the various forms of learning?
10 State and explain Ockham’s razor principle (10x3=30)
Part B
11 (a) Explain the structure Goal-based agents and Utility-based agents with the (8)
. help of diagrams.
(b) For the following activities, give a PEAS description of the task environment (6)
and characterize it in terms of the task environment properties.
a) Playing soccer
b) Bidding on an item at an auction.
OR
12 (a) Explain the structure Simple reflex agents and Model-based reflex agents (8)
. with the help of diagrams.
(b) Discuss about any five applications of AI. (6)
13 (a) Explain Best First Search algorithm. How does it implement heuristic search? (6)
.
(b) Describe any four uninformed search strategies. (8)
OR
14 (a) Write and explain A* search algorithm. (6)

.
(b) Explain the components of a well defined AI problem? Write the standard (8)
formulation of 8-puzzle problem.
15 (a) (a) Solve the following crypt arithmetic problem by hand, using the strategy (8)
. of backtracking with forward checking and the MRV and least-constraining-
value heuristics.
(b) What is local consistency in CSP constraint propagation? Explain different (6)
types local consistencies.
OR
16 (a) Illustrate the use of alpha-beta pruning in games. (6)

.
(b) Consider the following game tree in which static evaluation score are all from (8)
the players point of view: static evaluation score range is (+10 to -10)
Suppose the first player is the maximizing player. What move should be
chosen? Justify your answer.
17 (a) Convert the following sentences into first order logic: (6)
. Everyone who loves all animals is loved by someone.
Anyone who kills an animal is loved by no one.
Jack loves all animals.
Either Jack or Curiosity killed the cat, who is named Tuna.
Did Curiosity kill the cat?
(b) Give a resolution proof to answer the question “Did Curiosity kill the cat? “ (8)
OR
18 (a) Prove or find a counter example to the following assertion in propositional (6)
. logic:
If α |= (β ∧ γ) then α |= β and α |= γ.
(b) For each pair of atomic sentences, give the most general unifier if it exists: (8)
Older (Father (y), y), Older (Father (x), John).
19 (a) How is best hypothesis selected from alternatives? (8)

.
(b) Explain Univariate Linear Regression. (6)
OR
20 (a) Consider the following data set comprised of two binary input attributes (A1 (8)
. and A2) and one binary output.
Use the DECISION-TREE-LEARNING algorithm to learn a decision tree for

these data. Show the computations made to determine the attribute to split at
each node.
(b) Explain Linear classification with logistic regression (6 )

Teaching Plan
No Contents No of
Lecture
Hrs (36)
Module – 1 (Introduction) (7 hrs)
1.1 Introduction, What is Artificial Intelligence(AI)? 1
1.2 The foundations of AI, The history of AI 1
1.3 Applications of AI 1
1.4 Intelligent Agents – Agents and Environments 1
1.5 Good behavior: The concept of rationality 1
1.6 The nature of Environments 1
1.7 The structure of Agents 1
Module - 2 (Problem Solving by searching) (7 hrs)
2.1 Solving Problems by searching-Problem solving Agents 1
2.2 Illustration of the problem solving process by agents 1
2.3 Searching for solutions 1
2.4 Uninformed search strategies:BFS, Uniform-cost search, DFS, Depth- 1
limited search, Iterative deepening depth-first search
2.5 Informed search strategies: Best First search 1
2.6 Informed search strategies: A* Search 1
2.7 Heuristic functions 1
Module - 3 (Problem Solving in complex environments ) (7 hrs)
3.1 Adversarial search - Games 1
3.2 Optimal decisions in games, The Minimax algorithm 1
3.3 Alpha-Beta pruning 1
3.4 Constraint Satisfaction Problems – Defining CSP 1
3.5 Constraint Propagation- inference in CSPs 1
3.6 Backtracking search for CSPs 1
3.7 The structure of problems 1
Module - 4 (Knowledge Representation and Reasoning) (9 hrs)

4.1 Logical Agents – Knowledge based agents and logic 1
4.2 Propositional Logic 1

4.3 Propositional Theorem proving 1
4.4 Agents based on Propositional Logic 1
4.5 First Order Predicate Logic – Syntax and Semantics of First Order 1
Logic
4.6 Using First Order Logic, Knowledge representation in First Order Logic 1
4.7 Inference in First Order Logic – Propositional Vs First Order inference, 1
Unification and Lifting
4.8 Forward chaining, Backward chaining 1
4.9 Resolution 1
Module - 5 ( Machine Learning)( 6 hrs)
5.1 Learning from Examples – Forms of Learning 1
5.2 Supervised Learning 1
5.3 Learning Decision Trees 1
5.4 Generaliztion and overfitting 1
5.5 Evaluating and choosing the best hypothesis 1
5.6 Regression and classification with Linear models. 1
CSL411 COMPILER LAB
PCC 0 0 3 2
Preamble: This course aims to offer students hands-on experience on compiler design
concepts. Students will be able to familiarize with tools such as LEX and YACC and
automate different phases of a compiler. This course helps the learners to enhance the
capability to design and implement a compiler.
Prerequisite: A sound knowledge in C programming, Data Structures, Formal languages and

Automata Theory and Compiler design.
CO 1 Implement lexical analyzer using the tool LEX. (Cognitive Knowledge Level:
Apply)
CO 2 Implement Syntax analyzer using the tool YACC. (Cognitive Knowledge Level:
Apply)
CO 3 Design NFA and DFA for a problem and write programs to perform operations on it.
CO 4 Design and Implement Top-Down parsers. (Cognitive Knowledge Level: Apply)
CO 5 Design and Implement Bottom-Up parsers. (Cognitive Knowledge Level: Apply)
CO 6 Implement intermediate code for expressions. (Cognitive Knowledge Level: Apply)
CO 1
CO 2
CO 3
CO 4
CO 5
CO 6
Assessment Pattern
Bloom’s Category End Semester Examination %
Test %
Remember 20 20
Understand 20 20
Apply 60 60
Analyze
Evaluate
Create
Mark distribution
Total CIE ESE ESE

Marks Duration
150 75 75 3 hours
Internal Examination Pattern: The marks will be distributed as Algorithm 30 marks,

Program 20 marks, Output 20 marks and Viva 30 marks. Total 100 marks which will be
converted out of 15 while calculating Internal Evaluation marks.
Program 20 marks, Output 20 marks and Viva 30 marks. Total 100 marks will be converted
out of 75 for End Semester Examination.

Compiler/Software to Use in Lab : gcc, lex, yacc
Fair Lab Record: COMPUTER SCIENCE AND ENGINEERING
All Students attending the Compiler Lab should have a Fair Record. The fair record should be
produced in the University Lab Examination. Every experiment conducted in the lab should
be noted in the fair record. For every experiment in the fair record the right hand page should
Details of Experiment including algorithm and Result of Experiment. The left hand page
should contain a print out of the code used for the experiment and sample output obtained for
a set of input.
SYLLABUS
1. Implementation of lexical analyzer using the tool LEX.
2. Implementation of Syntax analyzer using the tool YACC.
3. Application problems using NFA and DFA.
4. Implement Top-Down Parser.
5. Implement Bottom-up parser.
6. Simulation of code optimization Techniques.
7. Implement Intermediate code generation for simple expressions.
8. Implement the back end of the compiler.
PRACTICE QUESTIONS
List of Exercises/Experiments:
1. Design and implement a lexical analyzer using C language to recognize all valid tokens
in the input program. The lexical analyzer should ignore redundant spaces, tabs and
newlines. It should also ignore comments.
2. Implement a Lexical Analyzer for a given program using Lex Tool.
3. Write a lex program to display the number of lines, words and characters in an input text.
4. Write a LEX Program to convert the substring abc to ABC from the given input string.
5. Write a lex program to find out total number of vowels and consonants from the given
input sting.
6. Generate a YACC specification to recognize a valid arithmetic expression that uses
operators +, – , *,/ and parenthesis.

7. Generate a YACC specification to recognize aCOMPUTER SCIENCE
valid identifier ANDwith
which starts ENGINEERING
a letter
followed by any number of letters or digits.
8. Implementation of Calculator using LEX and YACC
9. Convert the BNF rules into YACC form and write code to generate abstract
syntax tree.
10. Write a program to find ε – closure of all states of any given NFA with ε transition.
11. Write a program to convert NFA with ε transition to NFA without ε transition.
12. Write a program to convert NFA to DFA.
13. Write a program to minimize any given DFA.
14. Write a program to find First and Follow of any given grammar.
15. Design and implement a recursive descent parser for a given grammar.
16. Construct a Shift Reduce Parser for a given language.
17. Write a program to perform constant propagation.
18. Implement Intermediate code generation for simple expressions.
19. Implement the back end of the compiler which takes the three address code and
produces the 8086 assembly language instructions that can be assembled and run
using an 8086 assembler. The target assembly instructions can be simple move,
add, sub, jump etc.
CSQ413 SEMINAR
PWS 0 0 3 2
Preamble: The course ‘Seminar’ is intended to enable a B.Tech graduate to read, understand,
present and prepare report about an academic document. The learner shall search in the
literature including peer reviewed journals, conference, books, project reports etc., and
identify an appropriate paper/thesis/report in her/his area of interest, in consultation with
her/his seminar guide. This course can help the learner to experience how a presentation can
be made about a selected academic document and also empower her/him to prepare a
technical report.
Course Objectives:
 To do literature survey in a selected area of study.

 To understand an academic document from the literate and to give a presentation
about it.
 To prepare a technical report.
Course Outcomes [COs] : After successful completion of the course, the students will be able
to:
Identify academic documents from the literature which are related to her/his areas of
CO1
interest (Cognitive knowledge level: Apply).
Read and apprehend an academic document from the literature which is related to
CO2
her/ his areas of interest (Cognitive knowledge level: Analyze).
Prepare a presentation about an academic document (Cognitive knowledge
CO3
level: Create).
Give a presentation about an academic document (Cognitive knowledge level:
CO4
Apply).
CO5 Prepare a technical report (Cognitive knowledge level: Create).
CO1 2 2 1 1 2 1 3
CO2 3 3 2 3 2 1 3
CO3 3 2 3 1 2 3
CO4 3 2 1 3 3
CO5 3 3 3 3 2 2 2 3 3

Design/Development of
PO3 PO9 Individual and team work
solutions
Conduct investigations of complex PO10 Communication
PO4 problems
General Guidelines
 The Department shall form an Internal Evaluation Committee (IEC) for the seminar
with academic coordinator for that program as the Chairperson/Chairman and seminar
coordinator & seminar guide as members. During the seminar presentation of a
student, all members of IEC shall be present.
 Formation of IEC and guide allotment shall be completed within a week after the
University examination (or last working day) of the previous semester.
 Guide shall provide required input to their students regarding the selection of topic/
paper.
 Choosing a seminar topic: The topic for a UG seminar should be current and broad
based rather than a very specific research work. It's advisable to choose a topic for the
Seminar to be closely linked to the final year project area. Every member of the project
team could choose or be assigned Seminar topics that covers various aspects linked to
the Project area.
 A topic/paper relevant to the discipline shall be selected by the student during the
semester break.
 Topic/Paper shall be finalized in the first week of the semester and shall be submitted
to the IEC.
 The IEC shall approve the selected topic/paper by the second week of the semester.
 Accurate references from genuine peer reviewed published material to be given in the
report and to be verified.
Evaluation pattern
Total marks: 100, only CIE, minimum required to pass 50
Seminar Guide: 20 marks (Background Knowledge – 10 (The guide shall give deserving
marks for a candidate based on the candidate's background knowledge about the topic
selected), Relevance of the paper/topic selected – 10).
Seminar Coordinator: 20 marks (Seminar Diary – 10 (Each student shall maintain a

seminar diary and the guide shall monitor the progress of the seminar work on a weekly
basis and shall approve the entries in the seminar diary during the weekly meeting with the
student), Attendance – 10).
Presentation: 40 marks to be awarded by the IEC (Clarity of presentation – 10,

Interactions – 10 (to be based on the candidate's ability to answer questions during the
interactive session of her/his presentation), Overall participation – 10 (to be given based on
her/his involvement during interactive sessions of presentations by other students), Quality
of the slides – 10).
Report: 20 marks to be awarded by the IEC (check for technical content, overall quality,
templates followed, adequacy of references etc.).
CSD415 PROJECT PHASE I
PWS 0 0 6 2
Preamble: The course ‘Project Work’ is mainly intended to evoke the innovation and invention
skills in a student. The course will provide an opportunity to synthesize and apply the knowledge
and analytical skills learned, to be developed as a prototype or simulation. The project extends to
2 semesters and will be evaluated in the 7th and 8th semester separately, based on the achieved
objectives. One third of the project credits shall be completed in 7th semester and two third in 8th
semester. It is recommended that the projects may be finalized in the thrust areas of the respective
engineering stream or as interdisciplinary projects. Importance should be given to address societal
problems and developing indigenous technologies.
Course Objectives
 To apply engineering knowledge in practical problem solving.
 To foster innovation in design of products, processes or systems.
 To develop creative thinking in finding viable solutions to engineering problems.
Course Outcomes [COs] :After successful completion of the course, the students will be able to:
Model and solve real world problems by applying knowledge across domains
CO1
(Cognitive knowledge level: Apply).
Develop products, processes or technologies for sustainable and socially relevant
CO2
applications (Cognitive knowledge level: Apply).
Function effectively as an individual and as a leader in diverse teams and to
CO3
comprehend and execute designated tasks (Cognitive knowledge level: Apply).
Plan and execute tasks utilizing available resources within timelines, following
CO4
ethical and professional norms (Cognitive knowledge level: Apply).
Identify technology/research gaps and propose innovative/creative solutions
CO5
(Cognitive knowledge level: Analyze).
Organize and communicate technical and scientific findings effectively in written
CO6
and oral forms (Cognitive knowledge level: Apply).
CO1 2 2 2 1 2 2 2 1 1 1 1 2
CO2 2 2 2 1 3 3 1 1 1 1
CO3 3 2 2 1
CO4 2 3 2 2 3 2
CO5 2 3 3 1 2 1
CO6 2 2 2 3 1 1

Conduct investigations of PO10 Communication
PO4
complex problems
PROJECT PHASE I
Phase 1 Target
 Literature study/survey of published literature on the assigned topic

 Formulation of objectives
 Formulation of hypothesis/ design/ methodology
 Formulation of work plan and task allocation.
 Block level design documentation
 Seeking project funds from various agencies
 Preliminary Analysis/Modeling/Simulation/Experiment/Design/Feasibility study
 Preparation of Phase 1 report
Evaluation Guidelines & Rubrics
Total: 100 marks (Minimum required to pass: 50 marks).
 Project progress evaluation by guide: 30 Marks.

 Interim evaluation by the Evaluation Committee: 20 Marks.
 Final Evaluation by the Evaluation Committee: 30 Marks.
 Project Phase - I Report (By Evaluation Committee): 20 Marks.
(The evaluation committee comprises HoD or a senior faculty member, Project coordinator
and project supervisor).
Evaluation by the Guide
The guide/supervisor shall monitor the progress being carried out by the project groups on a
regular basis. In case it is found that progress is unsatisfactory it shall be reported to the
Department Evaluation Committee for necessary action. The presence of each student in the group
and their involvement in all stages of execution of the project shall be ensured by the guide.
Project evaluation by the guide: 30 Marks. This mark shall be awarded to the students in his/her
group by considering the following aspects:
Topic Selection: innovativeness, social relevance etc. (2)
Problem definition: Identification of the social, environmental and ethical issues of the project
problem. (2)
Purpose and need of the project: Detailed and extensive explanation of the purpose and need of
the project. (3)
Project Objectives: All objectives of the proposed work are well defined; Steps to be followed to
solve the defined problem are clearly specified. (2)
Project Scheduling & Distribution of Work among Team members: Detailed and extensive
Scheduling with timelines provided for each phase of project. Work breakdown structure well
defined. (3)
Literature survey: Outstanding investigation in all aspects. (4)
Student’s Diary/ Daily Log: The main purpose of writing daily diary is to cultivate the habit of
documenting and to encourage the students to search for details. It develops the students’ thought
process and reasoning abilities. The students should record in the daily/weekly activity diary the
day to day account of the observations, impressions, information gathered and suggestions given,
if any. It should contain the sketches & drawings related to the observations made by the students.
The daily/weekly activity diary shall be signed after every day/week by the guide. (7)
Individual Contribution: The contribution of each student at various stages. (7)
EVALUATION RUBRICS for PROJECT Phase I: Interim Evaluation
No. Parameters Marks Poor Fair Very Good Outstanding

The team has identified a topic.
Topic The team has failed to come Good evidence of the group The group has brainstormed in an
The originally selected topic
identification, with a relevant topic in time. thinking and brainstorming on excellent manner on what they were
lacks substance and needs to
selection, Needed full assistance to find what they are going to build. The going to build. The topic selected is
be revised. There were
formulation of a topic from the guide. They results of the brainstorming are highly relevant, real world problem
suggestions given to improve
objectives do not respond to documented and the selection of and is potentially innovative. The
1-a 10 the relevance and quality of the
and/or suggestions from the topic is relevant. The review of group shows extreme interest in the
project topic. Only a few
literature evaluation committee and/or related references was good, but topic and has conducted extensive
relevant references were
survey. the guide. No literature there is scope of improvement. literature survey in connection with
consulted/ studied and there is
(Group review was conducted. The Objectives formed with good the topic. The team has come up
no clear evidence to show the
assessment) team tried to gather easy clarity, however some objectives with clear objectives which are
team's understanding on the
information without verifying are not realistic enough. feasible.
same. Some objectives
[CO1] the authenticity. No
identified, but not clear enough.
objectives formed yet.
(0 – 3 Marks) (4 – 6 Marks) (7 - 9 Marks) (10 Marks)

Excellent evidence of enterprising
and extensive project planning.
Gantt charts were used to depict
Project detailed project scheduling. A
Good evidence of planning
Planning, No evidence of planning or Some evidence of a primary project management/version
done. Materials were listed and
Scheduling scheduling of the project. plan. There were some ideas on control tool is used to track the
thought out, but the plan
and The students did not plan the materials /resources project, which shows familiarity
wasn't quite complete.
Resource/ what they were going to required, but not really thought with modern tools. All materials /
Schedules were prepared, but
Tasks build or plan on what out. The students have some resources were identified and listed
not detailed, and needs
Identification materials / resources to use idea on the finances required, and anticipation of procuring time
1-b 10 improvement. Project journal is
and in the project. The students but they have not formalized a is done. Detailed budgeting is done.
presented but it is not complete
allocation. do not have any idea on the budget plan. Schedules were All tasks were identified and
in all respect / detailed. There
(Group budget required. The team not prepared. The project incorporated in the schedule. A
is better task allocation and
assessment) has not yet decided on who journal has no details. Some well-kept project journal shows
individual members understand
does what. No project journal evidence on task allocation evidence for all the above, in
[CO4] about their tasks. There is
kept. among the team members. addition to the interaction with the
room for improvement.
project guide. Each member knows
well about their individual tasks.

Phase 1 Interim Evaluation Total Marks: 20
EVALUATION RUBRICS for PROJECT Phase I: Final Evaluation
Sl.
Formulation
None of the team members The students have some The students are comfortable Shows clear evidence of having a
of Design
show any evidence of knowledge on the design with design methods adopted, well- defined design methodology and
and/or
knowledge about the design procedure to be adopted, and and they have made some adherence to it. Excellent knowledge
Methodology
and and the methodology adopted the methodologies. However, the progress as per the plan. The in design procedure and its
1-c 5 till now/ to be adopted in the team has not made much methodologies are understood adaptation. Adherence to project
Progress.
(Group later stages. The team has progress in the design, and yet to a large extent. plan is commendable.
assessment) not progressed from the to catch up with the project
[CO1] previous stage of evaluation. plan.
(0 – 1 Marks) (2 – 3 Marks) (4 Marks) (5 Marks)
The student show some interest The student shows very good
Individual and The student does not show interest in project, and takes up The student takes a leadership
and participates in some of the
any interest in the project tasks and attempts to complete position and supports the other
Teamwork activities. However, the activities
1-d activities, and is a passive them. Shows excellent team members and leads the project.
Leadership are mostly easy and superficial
10 member. responsibility and team skills. Shows clear evidence of leadership.
( Individual in nature.
assessment) Supports the other members
[CO3] well.
Preliminary The team has not done any The team has started doing There is some evidence to show Strong evidence for excellent
Analysis/ preliminary work with respect some preliminary work with that the team has done good progress in the project. The team
Modeling / to the analysis/modeling/ respect to the project. The amount of preliminary has completed the required
1-e
Simulation/ simulation/experiment/desig students however are not investigation and design/ preliminary work already and are
10
Experiment / n/feasibility study/ algorithm prepared enough for the work analysis/ modeling etc. poised to finish the phase I in an
Design/ development. and they need to improve a lot. They can improve further. excellent manner. They have shown
Feasibility results to prove their progress.
study
[CO1]
The project stages are extensively
documented in the report.
Professional documentation tools
The team did not document
Some documentation is done, like LaTeX were used to document
Documentatio the work at all. The project
but not extensive. Interaction Most of the project details were the progress of the project along
n and journal/diary is not
1-f with the guide is minimal. documented well enough. with the project journal. The
presentation. 5 presented. The presentation
Presentation include some There is scope for documentation structure is well-
(Individual & was shallow in content and
points of interest, but overall improvement. The presentation planned and can easily grow into the
group dull in appearance.
quality needs to be improved. is satisfactory. Individual project report.
assessment). The individual student has no
Individual performance to be performance is good.
idea on the presentation of
improved. The presentation is done
[CO6] his/her part.
professionally and with great clarity.
The individual’s performance is
excellent.
Total 30 Phase - I Final Evaluation Marks: 30

EVALUATION RUBRICS for PROJECT Phase I: Report Evaluation
Sl.
Project report shows

The prepared report is Project report follows the
evidence of systematic
shallow and not as per standard format to some The report is exceptionally good. Neatly
documentation. Report is
standard format. It does not extent. However, its organized. All references cited
1-g Report [CO6] 20 following the standard
follow proper organization. organization is not very good. properly. Diagrams/Figures, Tables and
format and there are only a
Contains mostly Language needs to be equations are properly numbered, and
few issues. Organization of
Unacknowledged content. improved. All references are listed and clearly shown. Language is
the report is good. Most
Lack of effort in preparation not cited properly in the excellent and follows standard styles.
of references are cited
is evident. report.
properly.
(0 - 7 Marks) (8 - 12 Marks) (13 - 19 Marks) (20 Marks)
Phase - I Project Report Marks: 20
SEMESTER VII
PROGRAM ELECTIVE II
YEAR OF
CATEGORY L T P CREDIT INTRODUCTION
CST413 MACHINE LEARNING
PEC 2 1 0 3 2019
Preamble: This course enables the learners to understand the advanced concepts and algorithms
in machine learning. The course covers the standard and most popular supervised learning
algorithms such as linear regression, logistic regression, decision trees, Bayesian learning and the
Naive Bayes algorithm, basic clustering algorithms and classifier performance measures. This
course helps the students to provide machine learning based solutions to real world problems.
Prerequisite: Basic understanding of probability theory, linear algebra and Python Programming
CO1 Illustrate Machine Learning concepts and basic parameter estimation methods.
CO2 Demonstrate supervised learning concepts (regression, linear classification).
CO3 Illustrate the concepts of Multilayer neural network and Support Vector Machine
CO4 Describe unsupervised learning concepts and dimensionality reduction techniques.
CO5 Solve real life problems using appropriate machine learning models and evaluate the
performance measures (Cognitive Knowledge Level: Apply)
CO1
CO2
CO3
CO4
CO5
Assessment Pattern

Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3

Attendance 10 marks
Continuous Assessment Tests(Average of Internal Tests 1 & 2) 25 marks

answer any 5.
Syllabus
Module-1 (Overview of machine learning)
Machine learning paradigms-supervised, semi-supervised, unsupervised, reinforcement learning.
Basics of parameter estimation - maximum likelihood estimation(MLE) and maximum a posteriori
estimation(MAP). Introduction to Bayesian formulation.
Module-2 (Supervised Learning)
Regression - Linear regression with one variable, Linear regression with multiple variables,
solution using gradient descent algorithm and matrix method, basic idea of overfitting in
regression. Linear Methods for Classification- Logistic regression, Naive Bayes, Decision tree
algorithm ID3.
Module-3 (Neural Networks (NN) and Support Vector Machines (SVM))
Perceptron, Neural Network - Multilayer feed forward network, Activation functions (Sigmoid,
ReLU, Tanh), Backpropagation algorithm.
SVM - Introduction, Maximum Margin Classification, Mathematics behind Maximum Margin

Classification, Maximum Margin linear separators, soft margin SVM classifier, non-linear SVM,
Kernels for learning non-linear functions, polynomial kernel, Radial Basis Function(RBF).
Module-4 (Unsupervised Learning)
clustering, Expectation maximization (EM) for soft clustering. Dimensionality reduction –
Principal Component Analysis.
Module-5 (Classification Assessment)
Classification Performance measures - Precision, Recall, Accuracy, F-Measure, Receiver
Operating Characteristic Curve(ROC), Area Under Curve(AUC. Bootstrapping, Cross Validation,
Ensemble methods, Bias-Variance decomposition. Case Study: Develop a classifier for face
detection.
Text Book
2. Mohammed J. Zaki and Wagner Meira, Data Mining and Analysis: Fundamental Concepts
and Algorithms, Cambridge University Press, First South Asia edition, 2016.
3. Jake VanderPlas, Python Data Science Handbook, O'Reilly Media, 2016
4. Tom Mitchell, Machine Learning, McGraw-Hill, 1997.
Reference Books
1. Christopher Bishop. Neural Networks for Pattern Recognition,Oxford University Press,
1995.
2. Kevin P. Murphy. Machine Learning: A Probabilistic Perspective, MIT Press 2012.
3. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements Of Statistical Learning,
Second edition Springer 2007.
4. P. Langley, Elements of Machine Learning, Morgan Kaufmann, 1995.
5. Richert and Coelho, Building Machine Learning Systems with Python.
6. Davy Cielen, Arno DB Meysman and Mohamed Ali.Introducing Data Science: Big Data,
Machine Learning, and More, Using Python Tools, Dreamtech Press 2016.

1. A coin is tossed 100 times and lands heads 62 times. What is the maximum
likelihood estimate for θ, the probability of heads.
2. Suppose data x1, ..., xn are independent and identically distributed drawn from an
exponential distribution exp(λ). Find the maximum likelihood for λ.
3. Suppose x1, ..., xn are independent and identically distributed(iid) samples from a
distribution with density
Find the maximum likelihood

estimate(MLE) for θ.
4. Find the maximum likelihood
estimator (MLE) and maximum a posteriori (MAP) estimator for the mean of a univariate
normal distribution. Assume that we have N samples, x1,..., xN independently drawn from a
normal distribution with known variance σ2 and unknown mean µ and the prior
distribution for the mean is itself a normal distribution with mean ν and variance β2. What
happens to the MLE and MAP estimators as the number of samples goes to infinity.

1. Suppose that you are asked to perform linear regression to learn the function that
outputs y, given the D-dimensional input x. You are given N independent data
points, and that all the D attributes are linearly independent. Assuming that D is
around 100, would you prefer the closed form solution or gradient descent to
estimate the regressor?
2. Suppose you have a three class problem where class label y ∈ 0, 1, 2 and each
training example X has 3 binary attributes X1, X2, X3 ∈ 0, 1. How many parameters
(probability distribution) do you need to know to classify an example using the

Naive Bayes classifier?

1. What are support vectors and list any three properties of the support vector
classifier solution?
2. Why do you use kernels to model a projection from attributes into a feature space,
instead of simply projecting the dataset directly?
3. Describe how Support Vector Machines can be extended to make use of kernels.
Illustrate with reference to the Gaussian kernel K(x, y) = e−z, where z = (x−y)2 .
4. Briefly explain one way in which using tanh instead of logistic activations makes
optimization easier.
5. ReLU activation functions are most used in neural networks instead of the tanh
activation function. Draw both activation functions and give a) an advantage of the
ReLU function compared to the tanh function. b) a disadvantage of the ReLU
function compared to the tanh function.

1. Which similarity measure could be used to compare feature vectors of two images? Justify
your answer.
3. Suppose you want to cluster the eight points shown below using k-means
Assume that k = 3 and that initially the points are assigned to clusters as follows:
C1 = {x1, x2, x3}, C2 = {x4, x5, x6}, C3 = {x7, x8}. Apply the k-means algorithm until
convergence, using the Manhattan distance.
4. Cluster the following eight points representing locations into three clusters: A1(2, 10),
A2(2, 5), A3(8, 4), A4(5, 8), A5(7, 5), A6(6, 4), A7(1, 2), A8(4, 9).
Initial cluster centers are: A1(2, 10), A4(5, 8) and A7(1, 2).
The distance function between two points a = (x1, y1) and b = (x2, y2) is defined as D(a, b)
= |x2 – x1| + |y2 – y1|
Use k-Means Algorithm to find the three cluster centers after the second iteration.

1. What is ensemble learning? Can ensemble learning using linear classifiers learn
classification of linearly non-separable sets?
2. Describe boosting. What is the relation between boosting and ensemble learning?
Classifier B attains 70% accuracy on the training set and 75% accuracy on the test set.
Which one is a better classifier. Justify your answer.
4. What are ROC space and ROC curve in machine learning? In ROC space, which points
correspond to perfect prediction, always positive prediction and always negative
prediction? Why?
5. Suppose there are three classifiers A,B and C. The (FPR, TPR) measures of the three
perfect classifier? Justify your answer.
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
Course Code: CST413
Course Name: Machine Learning
PART A
1. Define supervised learning? Name special cases of supervised learning depending

on whether the inputs/outputs are categorical, or continuous.
2. Differentiate between Maximum Likelihood estimation (MLE) and Maximum a

Posteriori (MAP) estimation?
3. What is overfitting and why is it a problem?
4. Specify the basic principle of gradient descent algorithm.
5. Suppose that you have a linear support vector machine(SVM) binary classifier.
Consider a point that is currently classified correctly, and is far away from the
decision boundary. If you remove the point from the training set, and re-train the
classifier, will the decision boundary change or stay the same? Justify your answer.
6. Mention the primary motivation for using the kernel trick in machine learning
algorithms?
7. Expectation maximization (EM) is designed to find a maximum likelihood setting

of the parameters of a model when some of the data is missing. Does the algorithm
converge? If so, do you obtain a locally or globally optimal set of parameters?
9. Classifier A attains 100% accuracy on the training set and 70% accuracy on the
test set. Classifier B attains 70% accuracy on the training set and 75% accuracy on
the test set. Which one is a better classifier. Justify your answer.
10. How does bias and variance trade-off affect machine learning algorithms?
(10x3=30)
Part B
11. (a) Suppose that X is a discrete random variable with the following probability (7)
mass function: where 0 ≤ θ ≤ 1 is a parameter. The following 10 independent
observations
were taken from such a distribution: (3, 0, 2, 1, 3, 2, 1, 0, 2, 1). What is the

maximum likelihood estimate of θ.
(b) Suppose you have a three class problem where class label y ∈ 0, 1, 2 (7)
and each training example X has 3 binary attributes X1, X2, X3 ∈ 0, 1.

How many parameters (probability distribution) do you need to know
to classify an example using the Naive Bayes classifier?
OR
12. (a) Consider the geometric distribution, which has p.m.f P(X = k) = (1 −θ)k−1θ. (7)
Assume that n i.i.d data are drawn from that distribution.
i. Write an expression for the log-likelihood of the data as a function of the
parameter θ.
ii. Find the maximum likelihood estimate for θ?
ii. Let θ has a beta prior distribution. What is the posterior distribution of θ?
(b) Find the maximum a posteriori (MAP) estimator for the mean of a univariate (7)
normal distribution. Assume that we have N samples, x1,..., xN independently
drawn from a normal distribution with known variance σ2 and unknown mean
µ and the prior distribution for the mean is itself a normal distribution with
mean ν and variance β2.
13. (a) Consider the hypothesis for the linear regression hθ(x) = θ0 + θ1x, and the cost (7)
function J( θ0, θ1) = 1/2m Σ1m( hθ(x(i)) – y(i))2where m is the number of training
examples. Given the following set of training examples.
Answer the following questions :

1) Find the value of hθ (2) if θ0= 0 and θ1 = 1.5
2) Find the value of J(0,1)
3) Suppose the value of J( θ0, θ1) = 0. What can be inferred from this.
(b) Assume we have a classification problem involving 3 classes: professors, (3)

students, and staff members. There are 750 students, 150 staff members
and 100 professors. All professors have blond hair, 50 staff members have
blond hair, and 250 students have blond hair. Compute the information
gain of the test ”hair color = blond” that returns true or false.
(c) Explain the significance of regularization. How do Ridge differs from Lasso (4)
regularization?
OR
14. (a) The following dataset can be used to train a classifier that determines whether (7)
a given person is likely to own a car or not. There are three features: education
level (primary, secondary, or university); residence (city or country); gender
(female, male).
Use ID3 Algorithm and find the best attribute at the root level of the tree
(b) Consider a linear regression problem y = w1x + w0, with a training set having (7)
m examples (x1, y1), . . .(xm, ym). Suppose that we wish to minimize the mean
5th degree error (loss function) given by 1/m Σ1m(yi −w1xi − w0)5.
1. Calculate the gradient with respect to the parameter w1.
2. Write down pseudo-code for on-line gradient descent on w1.
3. Give one reason in favor of on-line gradient descent compared to batch-
gradient descent, and one reason in favor of batch over on-line.
15. (a) Consider a support vector machine whose input space is 2-D, and the inner (8)
products are computed by means of the kernel K(x, y) = (x.y + 1)2-1, where
x.y denotes the ordinary inner product. Show that the mapping to feature
space that is implicitly defined by this kernel is the mapping to 5-D given by
(b) Consider a neuron with four inputs, and weight of edge connecting the inputs (3)
are 1, 2, 3 and 4. Let the bias of the node is zero and inputs are 2, 3, 1, 4. If
the activation function is linear f(x)=2x, compute the output of the neuron.
(c) Compare ReLU with Sigmoid function (3)
OR
16. (a) State the mathematical formulation to express Soft Margin as a constraint (10)
optimization problem.
(b) What is the basic idea of back propagation algorithm (4)
17. (a) Suppose that we have the following data (one variable). Use single linkage (8)
Agglomerative clustering to identify the clusters.
Data: (2, 5, 9, 15, 16, 18, 25, 33, 33, 45).
(b) Given two objects represented by the tuples (22, 1, 42, 10) and (20, 0, 36, 8): (6)
(iii) Compute the Minkowski distance between the two objects, using p = 3
OR
18. (a) Suppose that we have the following data: (8)

(2, 0), (1, 2), (2, 2), (3, 2), (2, 3), (3, 3), (2, 4), (3, 4), (4, 4), (3, 5)
Identify the cluster by applying the k-means algorithm, with k = 2. Try using
initial cluster centers as far apart as possible
(b) Describe EM algorithm for Gaussian Mixtures (8)
19. (a) Suppose the dataset had 9700 cancer-free images from 10000 images from (7)
cancer patients. Find precision, recall and accuracy ? Is it a good classifier?
Justify.
Actual cancer = yes cancer = no Total
Class\Predicted
class
cancer = yes 90 210 300
cancer = no 140 9560 9700
Total 230 9770 10000
(b) What is Principal Component Analysis (PCA)? Which eigen value indicates (7)
the direction of largest variance?
OR
20. (a) Assume you have a model with a high bias and a low variance. What (6)
are the characteristics of such a model?
(b) What are ROC space and ROC curve in machine learning? In ROC space, (8 )
which points correspond to perfect prediction, always positive prediction and
always negative prediction? Why?
Teaching Plan
No. of
Lecture
No Contents Hours
(37 hrs)
Module -1 (Overview of machine learning) (7 hours)
1.1 Supervised, semi-supervised, unsupervised learning, reinforcement learning 1 hour
(Text Book (TB) 1: Chapter 1)
1.2 Maximum likelihood estimation(MLE) (TB 1: Section 4.2) 1 hour
1.3 Maximum likelihood estimation (MLE)- example (TB 1: Section 4.2) 1 hour
1.4 Maximum a posteriori estimation(MAP) (TB 4: Section 6.2) 1 hour
1.5 Maximum a posteriori estimation(MAP)-example (TB 4: Section 6.2) 1 hour
1.6 Bayesian formulation (TB 1: Section 14.1, 14.2) 1 hour
1.7 Bayesian formulation -example (TB 1: Section 14.1, 14.2) 1 hour
Module-2 (Supervised Learning) (7 hours)
2.1 Linear regression with one variable (TB 1: Section 2.6) 1 hour
2.2 Multiple variables, Solution using gradient descent algorithm and matrix 1 hour
method (No derivation required) (TB 1: Section 5.8)
2.3 Overfitting in regression, Lasso and Ridge regularization 1 hour
2.4 Logistic regression 1 hour
2.5 Naive Bayes (TB 2: Section 18.2) 1 hour
2.6 Decision trees (TB 2: Chapter 19) 1 hour
2.7 Decision trees- ID3 algorithm (TB 2: Chapter 19) 1 hour
Module-3 (Neural Networks and Support Vector Machines) (9 hours)
3.1 Perceptron, Perceptron Learning 1 hour
3.2 Multilayer Feed forward Network, Activation Functions (Sigmoid, ReLU, 1 hour
Tanh)
3.3 Back Propagation Algorithm 1 hour
3.4 Illustrative Example for Back Propagation 1 hour
3.5 Introduction, Maximum Margin Hyperplane, 1 hour
3.6 Mathematics behind Maximum Margin Classification 1 hour
3.7 Formulation of maximum margin hyperplane and solution 1 hour
3.8 Soft margin SVM, Solution of Soft margin SVM 1 hour
3.9 Non-linear SVM , Kernels for learning non-linear functions, Examples - 1 hour
Linear, RBF, Polynomial
Module-4 (Unsupervised Learning) (7 hours)
4.1 Similarity measures- Minkowski distance measures( Manhattan, Euclidean), 1 hour

Cosine Similarity
4.2 Clustering - Hierarchical Clustering (TB 2: Chapter 14) 1 hour
4.3 K-means partitional clustering (TB 2: Chapter 13) 1 hour
4.4 Expectation maximization (EM) for soft clustering (TB 2: Chapter 13) 1 hour
4.5 Expectation maximization (EM) for soft clustering (TB 2: Chapter 13) 1 hour
4.6 Dimensionality reduction – Principal Component Analysis (TB 1: Section 1 hour

6.3)
4.7 Dimensionality reduction – Principal Component Analysis (TB 1: Section 1 hour
6.3)
Module-5 (Classification Assessment) (7 hours)
5.1 Performance measures - Precision, Recall, Accuracy, F-Measure, ROC, 1 hour

AUC. (TB 2: Chapter 22.1)
5.2 Boot strapping, Cross validation 1 hour
5.3 Ensemble methods- bagging, boosting 1 hour
5.4 Bias-Variance decomposition (TB 2: Chapter 22.3) 1 hour
5.5 Bias-Variance decomposition (TB 2: Chapter 22.3) 1 hour
5.6 Face detection (TB 3: Chapter 5 Section Application: A Face Detection 1 hour
Pipeline)
5.7 Face detection (TB 3: Chapter 5 Section Application: A Face Detection 1 hour
Pipeline)
YEAR OF
CST423 CLOUD COMPUTING
PEC 2 1 0 3 2019
Preamble: This course helps the learners to understand cloud computing concepts. This course
includes basic understanding of virtualization, fundamentals of cloud security, cloud computing
based programming techniques and different industry popular cloud computing platforms. This
course enables the student to suggest cloud based solutions to real world problems.
Prerequisite: Basic understanding of computer networks and operating systems.
Explain the various cloud computing models and services. (Cognitive Knowledge
CO1
Level: Understand)
Demonstrate the significance of implementing virtualization techniques.

Explain different cloud enabling technologies and compare private cloud platforms
CO3
Apply appropriate cloud programming methods to solve big data problems. (Cognitive
CO4
Describe the need for security mechanisms in cloud (Cognitive Knowledge Level:
CO5
Understand)
Compare the different popular cloud computing platforms (Cognitive Knowledge

CO6
Level: Understand)
CO1
CO2
CO3
CO4
CO5
CO6

Accreditation
PO# Broad PO PO# Broa

d PO

solutions

Assessment Pattern

End Semester
Bloom’s Category
Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3 hours

Syllabus
Module 1: Fundamental Cloud Computing (7 Hours)
Traditional computing- Limitations. Overview of Computing Paradigms-Grid Computing,

Cluster Computing, Distributed Computing, Utility Computing, Cloud Computing. NIST
reference Model-Basic terminology and concepts. Cloud characteristics, benefits and challenges,
Roles and Boundaries. Cloud delivery (service) models-Infrastructure-as-a-Service (IaaS),
Platform-as-a-Service(PaaS),Software-as-a-Service (SaaS), XaaS (Anything-as-a-service)-Cloud
deployment models- Public cloud, Community cloud, Private cloud, Hybrid cloud.
Module 2: Virtualization (7 Hours)
Introduction to virtualization-Virtualizing physical computing resources, Virtual Machines

(Machine virtualization), non-virtualized v/s virtualized machine environments. Types of VMs-
process VM v/s system VM, Emulation, interpretation and binary translation. Hardware-level
virtualization- Hypervisors/VMM. Types of Hypervisors. Full Virtualization, Para-
Virtualization, Hardware-assisted virtualization, OS level virtualization. Basics of Network
Virtualization, Storage Virtualization and Desktop Virtualization, Pros and cons of
virtualization. Case Study- Xen: Para-virtualization, VMware: full virtualization.
Module 3: Cloud-Enabling Technologies, Private cloud platforms and programming (7

Hours)
Broadband networks and internet architecture- Internet Service Providers (ISPs), Data center
technology, Web technology, Multitenant technology, Service technology. Resource
provisioning techniques-static and dynamic provisioning.
Open-source software platforms for private cloud-OpenStack, CloudStack, Basics of Eucalyptus,
Open Nebula, Nimbus.
Cloud Programming- Parallel Computing and Programming Paradigms. Map Reduce – Hadoop
Library from Apache, HDFS, Pig Latin High Level Languages, Apache Spark.
Module 4: Fundamental Cloud Security (7 Hours)
Basic terms and concepts in security- Threat agents, Cloud security threats/risks, Trust.
Operating system security-Virtual machine security- Security of virtualization- Security Risks
Posed by Shared Images, Security Risks Posed by Management OS. Infrastructure security-
Network Level Security, Host Level Security, Application level security, Security of the Physical
Systems. Identity & Access Management- Access Control.
Module 5: Popular Cloud Platforms (9 Hours)
Amazon Web Services(AWS):- AWS ecosystem- Computing services, Amazon machine

images, Elastic Compute Cloud (EC2), Advanced compute services. Storage services-Simple
Storage System (Amazon S3), Elastic Block Store (Amazon EBS), Database Services, Amazon
CDN Services and Communication services.
Google Cloud Platform:- IaaS Offerings: Compute Engine (GCE), Cloud Storage, PaaS
Offerings: Google App Engine (GAE), Storage services, Application services, Compute services,
Database Services, SaaS Offerings: Gmail, Docs, Google Drive.
Microsoft Azure: Azure Platform Architecture, Hyper-V, Azure Virtual Machine, Compute
services, Storage services.
Text Books
1. Thomas, E., Zaigham M., Ricardo P "Cloud Computing Concepts, Technology &
Architecture.", (2013 Edition). Prentice Hall.
2. Buyya, R., Vecchiola, C., & Selvi, S. T. “Mastering cloud computing: foundations and
applications programming”, (2017 Edition), Morgan Kaufmann.
3. Bhowmik, S., “Cloud computing”, (2017 Edition). Cambridge University Press.
References
1. Marinescu, D. C., “Cloud computing: theory and practice.”, (2017 Edition). Morgan
Kaufmann.
2. Buyya, R., Broberg, J., & Goscinski, A. M., “Cloud computing: Principles and paradigms”
(2011 Edition). John Wiley & Sons.

1. “A hybrid cloud is a combination of two or more other cloud deployment models”. Justify
the statement with an example.
2. What are the main characteristics of a Platform-as-a-Service solution?
3. How does cloud computing help to reduce the time to market for applications and to cut
down capital expenses?
4. Differentiate public and private clouds in terms of flexibility.
1. Define virtualization. What is the role of VMM in virtualization?
2. Explain various implementation levels of Virtualization.
3. State the differences between a traditional computer and a virtual machine.
1. Differentiate between on-premise and cloud-based internetworking.
2. What are the benefits of Data Center Technologies?
3. What are the characteristics of Multi-tenant technology?
4. How can virtualization be implemented at the hardware level?
1. Write a Hadoop MapReduce program that counts the number of occurrences of each
character in a file.
2. Write a Hadoop MapReduce program to find the maximum temperature in the weather
dataset.
1. Why is it harder to establish security in the cloud?
2. Explain in detail about the security issues one should discuss with a cloud-computing
vendor.
3. List and Explain major cloud security challenges.

1. Explain the cloud based databases.
2. With a neat diagram, write about Google App Engine for PaaS applications.
3. Differentiate between amazon SimpleDB and Amazon RDS.
4. “Storage services in the cloud are offered in two different forms as IaaS and as SaaS”.
Explain.
QP Code: Total Pages : 3

Reg No:_________________ Name :____________________

Course Code: CST423

Course Name: Cloud Computing
Duration: 3 Hrs Max. Marks :100

PART A
Answer all Questions. Each question carries 3 Marks (10 x 3 = 30 Marks)
1. Is the IT outsourcing model of traditional computing similar to cloud computing?
Justify.
2. Why is grid computing considered as the predecessor of cloud computing? Explain.
3. What is virtualization and what are its benefits?
4. Explain why a hypervisor is also called a virtual machine monitor?
5. Differentiate between multi-tenancy and virtualization.
6. “The field of service technology is a keystone foundation of cloud computing”. Explain.
7. Discuss any two identity management techniques used in cloud computing.
8. Differentiate between mandatory access control (MAC) and discretionary Access

Control (DAC).
9. Differentiate between Amazon S3 and Amazon EBS.
10. Explain the database service offered by google cloud.

(10 x3 =30)
PART B
Answer any one Question from each Module. Each question carries 14 Marks
11. (a) Discuss the cloud computing reference model. (8)
(b) Which are the basic components of an IaaS-based solution for cloud (6)
computing? Also provide some examples of IaaS implementations.
OR
12. (a) List down the characteristics and challenges of cloud computing. (6)
(b) Classify the various types of clouds. (8)
13. (a) List and discuss various types of virtualization. (8)

(b) Differentiate between full virtualization and paravirtualization. (6)
OR
14. (a) What is Xen? Discuss its elements for virtualization. (8)
(b) Explain the design requirements for Virtual Machine Monitor (VMM). (6)
15. (a) Explain the broadband networks and internet architecture. (8)
(b) List and explain the technologies and components of data centers. (6)
OR
16. (a) What are the major functions of the MapReduce framework? Explain the (8)
logical data flow of MapReduce function using a suitable example .
(b) Write a Hadoop MapReduce program that counts the number of (6)
occurrences of each word in a file.
17. (a) Explain common threats and vulnerabilities in cloud-based environments (8)
(b) Discuss the security risks posed by shared images with suitable examples. (6)
OR
18. (a) Explain the operating system security in cloud computing. (8)
(b) What do you mean by threat agents?. Explain different types of threat (6)
agents.
19. (a) Describe Amazon EC2 and its basic features. (8)
(b) Illustrate the architecture of Amazon S3. (6)
OR
20. (a) Describe the core components of Google AppEngine. (8)
(b) Explain the architecture of Windows Azure. (6)
Teaching Plan
No Contents No. of
Lecture
Hours
(37 hrs)
Module 1 (Fundamental Cloud Computing) (6 hours)
1.1 Traditional computing: Limitations. 1
1.2 Overview of Computing Paradigms: Grid Computing, Cluster Computing, 1

Distributed Computing, Utility Computing, Cloud Computing.
1.3 NIST reference Model, Basic terminology and concepts. 1
1.4 Cloud characteristics and benefits, challenges. Roles and Boundaries. 1
1.5 Cloud delivery (service) models: Infrastructure-as-a-Service (IaaS), Platform-as- 1

a-Service (PaaS), Software-as-a-Service (SaaS), XaaS (Anything-as-a-service).
1.6 Cloud deployment models: Public cloud, Community cloud, Private cloud, 1
Hybrid cloud.
Module 2( Virtualization)(7 Hours)
2.1 Introduction to virtualization, Virtualizing physical computing resources Virtual 1

Machines (Machine virtualization):- non-virtualized v/s virtualized machine
environments.
2.2 Types of VMs: process VM v/s system VM, Emulation, interpretation and 1
binary translation.
2.3 Hardware-level virtualization: Hypervisors/VMM, Types of Hypervisors. 1
2.4 Full Virtualization, Para-Virtualization, Hardware-assisted virtualization, OS 1

level virtualization.
2.5 Basics of Network Virtualization, Storage Virtualization and Desktop 1

Virtualization, Pros and cons of virtualization.
2.6 Case Study: Xen: Para-virtualization. 1
2.7 Case Study: VMware: full virtualization. 1
Module 3 (Cloud-Enabling Technologies, Private cloud platforms and programming)

(9 Hours)
3.1 Broadband networks and internet architecture: Internet Service Providers (ISPs), 1
Data center technology, Web technology, Multitenant technology, Service
technology.
3.2 Resource provisioning techniques: static and dynamic provisioning. 1
3.3 Open-source software platforms for private cloud: OpenStack, CloudStack. 1
3.4 Basics of Eucalyptus, Open-Nebula, Nimbus. 1
3.5 Cloud Programming: Parallel Computing and Programming Paradigms. 1
3.6 Map Reduce. 1
3.7 Hadoop Library from Apache, HDFS. 1
3.8 Pig Latin High Level Languages 1
3.9 Apache Spark. 1

Module 4 (Fundamental Cloud Security) (7 Hours)
4.1 Basic terms and concepts in security, Threat agents. 1
4.2 Cloud security threats/risks, Trust. 1
4.3 Operating system security, Virtual machine security. 1
4.4 Security of virtualization. 1
4.5 Security Risks posed by Shared Images, Security Risks posed by Management 1
OS.
4.6 Infrastructure security: - Network Level Security, Host Level Security, 1

Application level security, Security of the Physical Systems.
4.7 Identity & Access Management, Access Control. 1
Module 5 (Popular Cloud Platforms) (8 Hours)
5.1 Amazon Web Services(AWS):- AWS ecosystem, Computing services: Amazon 1

machine images, Elastic Compute Cloud (EC2).
5.2 Advanced computing services, Storage services: Simple Storage System 1

(Amazon S3), Elastic Block Store (Amazon EBS).
5.3 Database Services, Amazon CDN Services and Communication services. 1
5.4 Google Cloud Platform:- IaaS Offerings: Compute Engine (GCE), Cloud 1
Storage.
5.5 PaaS Offerings: Google App Engine (GAE), Storage services, Application 1
services, Compute services.
5.6 Database Services, SaaS Offerings: Gmail, Docs, Google Drive. 1
5.7 Microsoft Azure: Azure Platform Architecture, Hyper-V, Azure Virtual 1

Machine.
5.8 Azure Compute services, Storage services. 1

YEAR OF
SECURITY IN CATEGORY L T P CREDIT INTRODUCTION
CST433
COMPUTING
PEC 2 1 0 3 2019
Preamble: This course helps the learners to explore various algorithms to offer confidentiality,
integrity, authentication &non-repudiation services and different attacks on system security with
their countermeasures. It covers classical encryption techniques, symmetric and public key
crypto-system, key distribution techniques, authentication functions, intruders, malicious
software, and DDoS attacks. The concepts covered in this course enable the learners in effective
use of cryptographic algorithms and appropriate countermeasures for securing real life
applications.
Prerequisite: A fundamental knowledge in mathematical foundations of security.
CO1 Identify the security services provided against different types of security
attacks. (Cognitive Knowledge Level: Understand)
CO2 Illustrate classical encryption techniques for information hiding. (Cognitive
CO3 Illustrate symmetric/asymmetric key cryptosystems for secure
communication. (Cognitive Knowledge Level: Apply)
CO4 Explain message integrity and authentication methods in a secure
communication scenario. (Cognitive Knowledge Level: Understand)
CO5 Interpret public/secret key distribution techniques for secure communication.
CO6 Identify the effects of intruders, malicious software and distributed denial of
service attacks on system security. (Cognitive Knowledge Level:
Understand)
CO1
CO2
CO3
CO4
CO5
CO6
PO# Broad PO PO# Broad

PO

solutions
Assessment Pattern
End Semester
Examination (%)
Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
Analyse
Evaluate
Create
Mark Distribution
150 50 100 3
Syllabus
Module-1 (Basics of Security and Traditional Cryptosystems)

OSI security architecture – Security attacks, Services, Mechanisms. Cryptography vs
Cryptanalysis. Classical encryption techniques – Symmetric cipher model. Substitution ciphers
– Monoalphabetic vs Polyalphabetic ciphers, Caesar cipher, Affine cipher, Playfair cipher,
Vigenere cipher, Hill cipher. Transposition ciphers – Keyless, Keyed, Double transposition.
Module-2 (Modern Symmetric Key Cryptosystems)

Symmetric key ciphers – Block vs Stream ciphers, Block cipher components, Product ciphers,
Feistel and Non-Feistel ciphers. Data Encryption Standard (DES) – Structure, Key generation,
Design criteria, Weaknesses, Double DES, Triple DES. Advanced Encryption Standard
(AES) – Structure, Key expansion. Block cipher modes of operation – Electronic Codebook
Mode (ECB), Cipher Block Chaining Mode (CBC), Cipher Feedback Mode (CFB), Output
Feedback Mode (OFB), Counter Mode (CTR). Stream ciphers – Structure, RC4.
Module-3 (Public Key Cryptosystems)

Introduction to public key cryptosystems – Principles, Applications, Requirements,
Conventional vs Public key cryptosystems. RSA cryptosystem – Algorithm, Security, Attacks.
ElGamal cryptosystem – Algorithm. Diffie-Hellman key exchange – Algorithm, Man-in-the-
middle attack. Elliptic Curve Cryptography (ECC) – ElGamal ECC, Key exchange using ECC.
Module-4 (Message Integrity and Authentication)

Hash functions – Security requirements, Secure Hash Algorithm (SHA-512). Message
Authentication Code (MAC) – Requirements, Uses, Hash-based MAC (HMAC), Cipher-based
MAC (CMAC). Digital signatures – Attacks, Forgeries, Requirements, Direct vs Arbitrated
digital signatures, RSA digital signature, ElGamal digital signature, Digital Signature Standard
(DSS).
Module-5 (Key Distribution and System Security)

Key management – Distribution of secret keys using symmetric and asymmetric encryption,
Distribution of public keys. System security – Intruders, Intrusion detection techniques,
Password management. Malicious software – Viruses, Related threats, Countermeasures.
Distributed Denial of Service (DDoS) attacks – Types, Countermeasures.
Text Books
1. William Stallings, Cryptography and Network Security Principles and Practice, 4/e,
Pearson Ed.
2. Behrouz A Forouzan, Cryptography and Network Security, 3/e, Tata McGraw-Hill.
References
1. Charles P Pfleeger, Shari Lawrence Pfleeger, Jonathan Margulies, Security in Computing,
5/e, Prentice Hall.
2. G.A. Jones & J.M. Jones, Elementary Number Theory, Springer UTM, 2007.
1. Define the type of security attack in the following case: A student breaks into a
teacher’s office to obtain a copy of the next day’s exam question paper.
2. Which security mechanism is provided in the following case: A bank requires the
customer’s signature for a withdrawal.
1. Alice wishes to send the message “COME BACK EARLY” to Bob, using Playfair
cipher. The key to be used is “SAFFRON”. Show the process of encryption.
2. Using Affine cipher, encrypt “HOT” and decrypt “JDG”. Key is (7, 3).
3. Implement the Vigenere cipher method in a suitable programming language.
(Assignment)
1. If the DES key with parity bit is 0123 ABCD 2562 1456, find the first round key.
2. In RSA, given p=19, q=23, public key(e)=3, find n, ɸ(n) and private key(d).
3. Implement any two symmetric/asymmetric encryption techniques in a suitable
programming language. (Assignment)
1. Describe the steps involved in generating a Hash-based MAC.

2. Using ElGamal scheme, generate the signatures for the message M=400 with p=881,
d=700 and r=17.
3. A company wishes to implement a secure authentication mechanism for
communication. As a system security admin suggest any two ways of implementing
such a mechanism. (Assignment)
1. List any two ways in which secret keys can be distributed to two communicating
parties.
2. Explain the significance of a public-key authority in the distribution of public keys.
1. What are false positives and negatives in the context of Intrusion Detection Systems?
How can we reduce these two?
2. Distinguish between a direct DDoS attack and a reflector DDoS attack.
3. Bob works as a network administrator in ABC & Co. On a day of his absence, he
shared his admin password with one of his colleagues, John, to manage a network
issue. Later John started misusing this privilege by launching DoS attacks in the
network. Describe the ethical issues in this scenario and how can this be avoided?
(Assignment)
QP CODE: PAGES: ___
Reg No:_______________
Name:_________________
Course Code: CST433

Course Name: SECURITY IN COMPUTING

PART A
1. Differentiate between passive attack and active attack.
2. Use an Affine cipher to encrypt the message “SECURITY” with the key pair(7,2)
in modulus 26.
3. Compare stream cipher and Block cipher with example.

4. Differentiate between diffusion and confusion.
5. Define the elliptic curve logarithm problem.
6. Consider an ElGamal scheme with a common prime q = 71 and a primitive root α

= 7. If B has a public key YB = 3 and A chose the random number k = 2, what is
the ciphertext of the message M = 30?
7. Give the requirements of MAC function.
8. Specify the different types of forgery in digital signature.
9. List three different classes of intruders.
10. Mention the phases of operation of a virus.

(10x3=30)
Part B
Marks)
11. (a) Illustrate the two approaches to attack a conventional encryption scheme. (4)
(b) A Hill cipher is setup with the key matrix 9 4 .

57 (10)
Encrypt the text “COMPUTER”. Show the calculations for the corresponding
decryption of the ciphertext to recover the original text back.
OR
12. (a) Encrypt the text “this is an exercise and complete it” using transposition
cipher with the key (3,2,1,4,5). Show decryption of the ciphertext to recover (6)
the original text back.
(b) Encrypt the message “the house is being sold tonight”using the following (8)
ciphers. Ignore the space between words.
i) Vigenere cipher with key = “largest”.
ii) Autokey system of Vigenere cipher with key =“largest”.
13. (a) How is round key generated in DES? (4)
(b) Illustrate AES encryption in detail. (10)
OR
14. (a) Explain the construction of S-box in AES. (5)
(b) Summarize the primitive operations in RC4 algorithm. (9)
15. (a) Compare the Cipher Block Chaining Mode (CBC) and Cipher Feedback (6)
Mode (CFB) of block ciphers.
(b) Explain RSA cryptosystem. In an RSA cryptosystem a participant A uses two (8)
prime numbers p=13 and q=17 to generate public key and private key. The
public key of A is 35. Find the private key of A.
OR
16. (a) Illustrate ElGamal cryptosystem. (6)
(b) Consider a Diffie–Hellman scheme with a common prime q=11 and a (8)
primitive root α=2.
i) Show that 2 is a primitive root of 11.
ii) If User A has public key YA= 9, what is A’s private key XA?
iii) If User A has public key YB= 3, what is the shared secret key K,
shared with A?
17. (a) Describe different types of arbitrated digital signature techniques. (6)
(b) Explain Cipher – Based Message Authentication Code. (8)
OR
18. (a) Explain the attacks on digital signature. (5)
(b) Describe the working of SHA-512 with diagrams. (9)
19. (a) Explain four techniques used to avoid guessable passwords. (6)
(b) Describe the different techniques for public key distribution. (8)
OR
20. (a) Explain different types of Simple DDoS attack and its countermeasures. (6)
(b) Differentiate between statistical anomaly detection and rule-based intrusion (8)
detection.
Teaching Plan
No.of
No Contents Lecture
Hours
(35Hrs)
Module-1 (Basics of Security and Traditional Cryptosystems) (6 hrs)
1.1 OSI security architecture – Security attacks, Services, Mechanisms 1

1.2 Cryptography vs Cryptanalysis. Classical encryption techniques – Symmetric 1
cipher model
1.3 Substitution ciphers – Monoalphabetic vs Polyalphabetic ciphers, Caesar cipher, 1
Affine cipher
1.4 Playfair cipher, Vigenere cipher 1
1.5 Hill cipher 1
1.6 Transposition ciphers – Keyless, Keyed, Double transposition 1
Module-2 (Modern Symmetric Key Cryptosystems) (9hrs)
Symmetric key ciphers – Block vs Stream ciphers, Block cipher components,

2.1 Product ciphers, Feistel and Non-Feistel ciphers 1
Data Encryption Standard (DES) – Structure, Key generation 1

2.2
2.3 Design criteria, Weaknesses 1
2.4 Double DES, Triple DES 1
2.5 Advanced Encryption Standard (AES) – Overall Structure 1
2.6 Stages of encryption/decryption 1
2.7 Key expansion 1
2.8 Block cipher modes of operation – Electronic Codebook Mode (ECB), Cipher 1
Block Chaining Mode (CBC), Cipher Feedback Mode (CFB), Output Feedback
Mode (OFB), Counter Mode (CTR).
2.9 Stream ciphers – Structure, RC4 1
Module-3 (Public Key Cryptosystems)(7hrs)
3.1 Public key cryptosystems – Principles, Applications, Requirements, 1

Conventional vs Public key cryptosystems
3.2 RSA cryptosystem – Algorithm 1

3.3 RSA Security, Attacks 1
3.4 ElGamal cryptosystem – Algorithm 1
3.5 Diffie-Hellman key exchange – Algorithm, Man-in-the-middle attack 1
3.6 Elliptic Curve Cryptography (ECC) – ElGamal ECC 1
3.7 Key exchange using ECC 1
Module-4 (Message Integrity and Authentication) (6 hrs)
4.1 Hash functions – Security requirements, Secure Hash Algorithm (SHA-512) 1
4.2 Message Authentication Code (MAC) – Requirements, Uses 1

Hash-based MAC (HMAC), Cipher-based MAC (CMAC)
4.3 1
4.4 Digital signatures – Attacks, Forgeries, Requirements, Direct Vs Arbitrated 1
digital signatures
4.5 RSA digital signature, ElGamal digital signature 1
4.6 Digital Signature Standard (DSS) 1
Module-5 (Key Distribution and System Security) (7hrs)
Key management – Distribution of secret keys using symmetric and asymmetric

5.1 1
encryption
5.2 Distribution of public keys 1

5.3 System security – Intruders, Intrusion detection techniques 1
5.4 Password management 1
5.5 Malicious software – Viruses, Related threats 1
5.6 Virus countermeasures 1
5.7 Distributed Denial of Service (DDoS) attacks – Types, Countermeasures 1

MODEL BASED CATEGORY L T P CREDIT

YEAR OF
INTRODUCTION
CST443 SOFTWARE
DEVELOPMENT PEC 2 1 0 3 2019
Preamble: The objective of the course is to familiarize learners about the concepts and advantages
of using model based software development. This course covers the methodologies in developing
the model of a software, perform analysis on the model and automatic generation of code from the
model. The OSATE framework and its plugins using the Architecture Analysis and Design
Language(AADL) language is used in the course to demonstrate the end-to-end concept of MBSD
which helps the learners to get a hands on experience.
Prerequisite: Software Engineering
CO1 Explain the relevance of model based software development in the software
development process. (Cognitive Knowledge level: Understand)
CO2 Explain Model Driven Architecture with Computation Independent Model (CIM),
Platform Independent Model(PIM), Platform Specific Model (PSM). (Cognitive
CO3 Illustrate software modeling with Architecture Analysis and Design Language
(AADL). (Cognitive Knowledge level: Apply)
CO4 Explain error annex using error modelling concepts and illustrate error modelling
in AADL. (Cognitive Knowledge level: Understand)
CO5 Illustrate the process of code generation from an AADL model. (Cognitive
Knowledge level: Understand)
0 2
CO1
CO2
CO3
CO4
CO5

Assessment Pattern
Test 1 (Marks in Test 2 (Marks End Semester
Bloom’s Category
percentage) in percentage) Examination Marks
Remember 30 30 30
Understand 50 50 50
Apply 20 20 20
Analyse
Evaluate
Create
Mark Distribution

150 50 100 3


Each of the two internal examinations has to be conducted out of 50 marks. The first series test shall
shall be preferably conducted after completing the remaining part of the syllabus. There will be two
the partly completed module), each with 7 marks. Out of the 7 questions, a student should answer
any 5.

questions from each module of which a student should answer any one. Each question can have a
maximum of 2 sub-divisions and carries 14 marks.
Syllabus
Module - 1 (Introduction to Model Based Software Development)
Software faults, Introduction to Model checking, Introduction to Automated Testing, Model Based
Software Development (MBSD) – Need, MBSD Approach, Learning MBSD from the perspective
of Architecture Analysis and Design Language (AADL).
Module - 2 (More on MBSD)
MBSD based software development – Requirements, Analysis, Design and Implementation.

Model-Driven Architecture - Definitions and Assumptions, Overview of MBSD methodology, The
modeling levels-Computation Independent Model (CIM), Platform Independent Model (PIM),
Platform Specific Model (PSM). Introduction to AADL, Basic Comparison of AADL with other
modeling languages - Comparison with UML.
Module -3 (Modeling using AADL)
Modeling: Developing a Simple Model - Define the components - Explain with example
(powerboat autopilot system), Develop a top-level model - Use example Powerboat Autopilot
(PBA) system.
AADL: Components - Software, Hardware, Composite, Runtime semantics, Language syntax,

AADL declarations, AADL classifiers, AADL system models and specifications
Case Study: Powerboat Autopilot System.
Module - 4 (Model Analysis)
Safety Analysis -Fault tree analysis, Minimal cutsets. Error Modeling in AADL-Error Model
Libraries and Subclause Annotations, Error Types and Common Type Ontology, Error Sources and
Their Impact, Component Error Behavior, Compositional Abstraction of Error Behavior, Use of
Properties in Architecture Fault Models, Error modeling example.
Module - 5 (Code Generation)
Need for code generation, Categorization, Code Generation Techniques, Code Generation in AADL
Model – Ocarina.
Text Books
1. Marco, Brambilla, Jordi Cabot, Manuel Wimmer, Model-Driven Software Engineering in

Practice, 2/e, Synthesis Lectures on Software Engineering, 2017.
2. Christel Baier and Joost-Pieter Katoen, Principles of model checking, The MIT Press.
3. Thomas Stahl and Markus Volter, Model-Driven Software Development, Wiley, 2006.
4. David P. Gluch, Peter H. Feiler, Model-Based Engineering with AADL: An Introduction to the
SAE Architecture Analysis & Design Language, Adison-Wesley, 2015.
References:
1. Automated software testing : http://www2.latech.edu

2. Peter H. Feiler, David P. Gluch, John J. Hudak.The Architecture Analysis & Design
Language(AADL): An Introduction.
3. de Niz, Dionisio, Diagrams and Languages for Model-Based Software Engineering of
EmbeddedSystems: UML and AADL
4. FAA System Safety Handbook, Chapter 8: Safety Analysis/Hazard Analysis Tasks
5. Enno Ruijters, Marielle Stoelinga, Fault tree analysis: A survey of the state-of-the-art in
modeling, analysis and tools.
6. Larson, Brian &Hatcliff, John & Fowler, Kim &Delange, Julien. (2013). Illustrating the AADL
error modeling annex (v.2) using a simple safety-critical medical device. ACM SIGAda Ada
Letters. 33. 65-84. 10.1145/2527269.2527271.
7. Delange, Julien&Feiler, Peter &Hudak, John &Gluch, Dave. (2016). Architecture Fault
Modeling and Analysis with the Error Model Annex, Version 2. 10.13140/RG.2.1.4224.7927.
1. Justify the need of model based software development?

2. Explain the advantages of model based software development?
1. Explain infrastructure of model driven architecture.
2. Describe about MDA modeling levels.
1. Illustrate the basic components of an AADL Model.

2. Assume we have a system to regulate the fuel valve of a boiler by monitoring the steam flow
and steam pressure. Identify the basic components of this system and design its AADL
model.
1. Suppose we have an isolette system which ensures the temperature is within a specified
temperature range with following components:
i) temperature sensor - detects air temperature.
iii) heat source - supply hot air to maintain temperature.
iv) operator interface - specify target temperature range(lower desired temperature, upper
desired temperature.)
iv) thermostat - takes as input an air temperature value from a temperature sensor and
controls a heat source to produce an air temperature within a target range.
Model the error flows, error propagations, component error behaviour and error properties
for the value error in the isolette system.
1. Illustrate code generation from an AADL model.
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
Course Code: CST443
Course Name: Model Based Software Development
PART A
1. List any three advantages of automated software testing.
2. Specify the steps and their purpose in the model checking process.
3. Compare Analysis And Design Language (AADL) with Unified modeling language
(UML).
4. Describe the design phase in the model based software development process.
5. Represent interface component with an out data port and an out event port in
AADL.
a) textual b)graphical
6. Give the textual top level model of a powerboat autopilot system in AADL.
7. What is an error type? Mention any two pre-declared timing and value errors in
AADL.
8. Define : (i) Fault Tree Analysis (ii) Minimal cutsets
9. Explain templates and filtering code generation technique.
10. How does automated code generation help to deal with faults in a software system?
(10x3=30)
Part B
11. (a) Explain model based software development approach. (12)
(b) Why is model based software development important? (2)
OR
12. (a) What are software faults? Mention any three software faults and its (5)
consequences.
(b) Explain two approaches for ensuring software reliability? (9)

(i) Model Checking
(ii) Automated Testing
13. (a) Illustrate model based software development process. (8)

(b) Explain infrastructure of model driven architecture. (6)
OR
14. (a) What is AADL? Compare AADL and UML. (6)
(b) Explain in detail about MDA modeling levels. (8)
15. (a) Illustrate the components of an AADL model. (12)
(b) What is the AADL language syntax? (2)
OR
16. (a) Explain the following:

i) AADL classifiers
ii) AADL declarations (2)
(2)
(b) Design an AADL model which controls the speed of a vehicle. Also describe (10)
the basic components of the designed model.
17. (a) Illustrate how value error can be modelled using AADL in the isolette system. (10)
(b) With a diagram explain error propagation, termination and transformation in (4)
AADL models.
OR
18. (a) Illustrate error state machines in AADL using proper textual representations. (8)
(b) Suppose we have a train door controller system with following components (6)
i) door_controller - ensures safe opening of the door.
ii) train_controller - sends train speed and transit status to the
door_controller.
iii) alarm - triggered when an emergency occurs in other components.
Model the error flows, error propagations, component error behaviour and
error properties for the value error in the component door_controller.
19. (a) Explain templates and meta model type code generation? (4)
(b) Illustrate how the code can be generated from an AADL model. (10)
OR
20. (a) Describe any four code generation techniques. (10)
(b) Explain the advantages of automatic code generation. (4)
Teaching Plan
Sl Contents Number of
No Lecture
Hours (35)
Module 1 (Introduction) (7 Hours)
1.1 Software faults 1
1.2 Introduction to Model Checking 1
1.3 Introduction to Automated Testing (Lecture 1) 1
1.4 Introduction to Automated Testing (Lecture 2) 1
1.5 Need for MBSD, MBSD Approach 1
1.6 Architecture centric model driven software development 1
1.7 AADL and architecture-centric model-based software systems 1
Module 2 ( Model Based Software Development) (7 Hours)
2.1 Model based software development process 1
2.2 Overview of MBSD methodology 1
2.3 Model Driven Architecture 1
2.4 MDA Definitions and Assumptions 1
2.5 The modeling levels 1
2.6 Introduction to AADL 1
2.7 Comparison of AADL with other modeling languages 1
Module 3 ( Modeling using AADL) (7 Hours)
3.1 Modeling in detail: AADL components 1
3.2 Modeling in detail: Developing a simple model 1

3.3 Modeling in detail: Define top level model with an example 1
3.4 AADL in detail: Explain AADL components, Language syntax 1
3.5 AADL declarations and classifiers 1
3.6 AADL system models and specifications 1
3.7 Case study: Power boat auto pilot system 1
Module 4 (Model Analysis )(7 Hours)
4.1 Introduction to safety analysis 1
4.2 Fault tree analysis, minimal cutsets 1
4.3 Error modeling with AADL - Error Model Libraries and Subclause 1
Annotations
4.4 Error modeling with AADL - Error Types and Common Type Ontology, 1
4.5 Error modeling with AADL - Error Sources and Their Impact, Component 1
Error Behavior
4.6 Error modelling with AADL - Compositional Abstraction of Error Behavior, 1

Use of Properties in Architecture Fault Models
4.7 Illustrate isolette error model 1
Module 5 (Code Generation) (7 Hours)
5.1 Code generation and its advantages 1
5.2 Categorization 1
5.3 Code generation techniques - Templates + filtering, Template + metamodel, 1

Frame processors
5.4 Code generation techniques - API-based generators, In-line generation, Code 1

attributes
5.5 Code generation techniques - Code weaving 1

Commonalities and Differences Between the Different Code generation
Approaches
5.6 Code generation in AADL - Ocarina 1
5.7 Illustration of code generation using AADL model 1

YEAR OF
CST463 WEB PROGRAMMING
PEC 2 1 0 3 2019
Preamble: This course helps the learners to understand the web programming concepts. It
includes the essential frontend and backend technologies needed for the development of web
applications. The learners will have an opportunity to gain necessary web development skills such
as HTML, CSS, JavaScript, PHP, MySQL integration, JSON and Laravel framework.
Prerequisite: Knowledge of Programming is required.
CO1 Use HyperText Markup Language (HTML) for authoring web pages and understand
the fundamentals of WWW. (Cognitive Knowledge Level: Understand)
CO2 Construct and visually format responsive, interactive web pages using CSS and
JavaScript (JS) (Cognitive Knowledge Level: Apply)
CO3 Construct websites using advanced sever side programming tool PHP (Cognitive
CO4 Develop dynamic web applications using PHP and perform MySQL database
operations. (Cognitive Knowledge Level: Apply)
CO5 Explain the importance of object exchange formats using JSON and the MVC based
web application development frameworks (Laravel) (Cognitive Knowledge Level:
Understand)
1
CO1
CO2
CO3
CO4
CO5

Assessment Pattern

Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 20 20 20
Understand 40 40 40
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3

Attendance 10 marks
Continuous Assessment Tests (Average of Internal Tests 1 & 2) 25 marks

First series test shall be preferably conducted after completing the first half of the syllabus and the
second series test shall be preferably conducted after completing the remaining part of the
syllabus. There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2
questions each from the completed modules and 1 question from the partly completed module),
completed modules and 1 question from the partly completed module), each with 7 marks. Out of
the 7 questions, a student should answer any 5.

question can have a maximum of 2 subdivisions and carries 14 marks.
Syllabus
Module – 1 (WWW, HTML)
Introduction to the Internet & WWW: Evolution of Internet & World Wide Web- Web Basics,
URI’s & URL-MIME.
Introduction to HTML5: Structuring & editing an HTML5 document, Fundamentals of HTML -

Headings-Hyper Links- Images - Special Characters & Horizontal Rules-Lists- Tables -Forms -
Internal Linking- Meta Elements-HTML5 Form input types -Input and Data List Elements and
autocomplete attribute- Page Structure Elements -Multimedia-HTML5 Audio & video elements..
Module -2 (CSS, JavaScript)
Introduction to Stylesheets : Introduction to CSS-Basic syntax and structure-Inline Styles,

Embedded Style Sheets, Conflict Resolution, Linking External Style Sheets-Exploring CSS
Selectors-Properties, values, Positioning Elements: Absolute Positioning, Relative Positioning -
Backgrounds-List Styles-Element Dimensions- Table Layouts-Box Model and Text Flow-div and
span -Basics of Responsive CSS, Media port & Media Queries.
Introduction to JavaScript : Introduction to Scripting- Programming fundamentals of JavaScript

-Obtaining User Input with prompt Dialogs-Arithmetic-Decision Making -Control Statements -
Functions -Arrays -Objects -Document Object Model (DOM) -Form processing
Module- 3 (PHP Basics)
PHP Language Structure: Introduction- Building blocks of PHP-Variables, Data Types -simple
PHP program-Converting between Data Types- Operators and Expressions -Flow Control
functions - Control statements- Working with Functions- Initialising and Manipulating Arrays--
Objects- String Comparisons-String processing with Regular Expression
Module -4 (PHP- MySQL, JSON)
Advanced PHP: Form processing and Business Logic-Cookies- Sessions & MySQL Integration-
Connecting to MySQL with PHP- Performing CREATE, DELETE, INSERT, SELECT and
UPDATE operations on MySQL table -Working with MySQL data-Reading from Database-
Dynamic Content.
Module- 5 (JSON, Laravel)
JSON Data Interchange Format: Syntax, Data Types, Object, JSON Schema, Manipulating
JSON data with PHP
Web Development Frameworks: Laravel Overview-Features of Laravel-Setting up a Laravel

Development Environment-Application structure of Laravel-Routing -Middleware-Controllers-
Route Model Binding-Views-Redirections-Request and Responses.
Text Books
1 Paul J. Deitel, Harvey M. Deitel, Abbey Deitel, Internet & World Wide Web
How to Program 5th Edition [Module 1,2,3,4]
2. Lindsay Bassett, Introduction to JavaScript Object Notation: A To-the-Point Guide to JSON
1st Edition, O’Reilly [Module 5]
3. Julie C. Meloni, Pearson -PHP, MySQL & JavaScript All in One, Sams Teach Yourself,5th Ed
[Module 4]
4. Matt Stauffer,” LARAVEL up and Running, A framework for building modern PHP apps”1st
Edition, O’REILLY [Module 5]
Reference Books
1. Robert W Sebesta, Programming the World Wide Web, 7/e, Pearson Education Inc,8th Edition
2. Larry Ullman, Pearson- PHP 6 and MySQL 5 for Dynamic Web Sites: Visual QuickPro Guide
3. Eric van der Vlist, Danny Ayers, Erik Bruchez, Joe Fawcett, Alessandro Vernet",Wrox-
Professional Web 2.0 Programming, Wiley-India edition
4. Web Technologies Black Book 2018(As per Mumbai University Syllabus) HTML, CSS3,
JavaScript, iQuery, AJAX,PHP,XML,MVC and Laravel DT Editorial Services (ISBN:
9789386052490)

1. Construct a valid HTML document for your personal Profile registration page for a Job
Site www.123Jobs.com. Add relevant HTML elements in a table, to accept a minimum of
10 different fields which includes your name, address, phone, email address, your picture,
your college; your branch, fields for your personal history (Minimum 3 fields), favourite
theory and practical subjects (Checkbox), Username, Password(password)
2. What is MIME? Give the expansion of MIME. List four examples for MIME types. State
the reason why MIME type specification is necessary in a request-response transaction
between a browser and server.
3. What is codec? Recognize the role of controls attribute in <video> & <audio> tag in
HTML. Use the COVID vaccination promotional video ‘MySafety.mp4’ in a web page
with suitable HTML code, ‘autoplay’ option enabled and displayed in a standard
dimension 750 X500.
1. Organize a sample web page for the event ‘Raagam2021’ at your campus and use
embedded Style sheets to apply a minimum 5 styles. State the Style Specification
format of embedded style sheets.
2. Write CSS style rules to implement the following in a web page:
a. to display the content of hyperlinks with yellow background color and in italics
b. to display the contents of unordered lists in bold and in Arial font
c. to display a background image titled “birds.jpg” with no tiling.
3. Write the code for an HTML document with embedded JavaScript scripts, which
initially displays a paragraph with text "Welcome" and a button titled "Click". When
the button is clicked, the message "Hello from JavaScript" in bold should replace the
paragraph text

1. Write a PHP program to store the name and roll no of 10 students in an Associative
Array and Use foreach loop to process the array and Perform asort, rsort and ksort in
the array. Illustrate with suitable output data
2. Design an HTML page which enters a given number, write a PHP program to display
a message indicating, whether the number is odd or even, when clicking on the submit
button.
3. Write a PHP program to compute the sum of the positive integers up to 100 using do
while.
1. Write a PHP form handling program to verify the user authentication credentials of a
web page using MySQL connection and store the userid value as a Session variable if
the userid is valid.
2. Create a valid HTML document for yourself, including your name, address, and email
address. Also add your college; your major and the course. Perform form handling in
PHP and process the output using POST method.
3. Write an embedded PHP script which displays the factorial of all numbers from 1 to 10 in a
table in the web page. The factorial should be calculated and returned from a function. The
table headings should be "Number" and "Factorial"
1. What is Route Model Binding in Laravel? Which types of route model binding are
supported in Laravel?
2. Explain how laravel performs route handling using routes calling controller methods?
3. List the data types used in JSON? Explain the use of parse () and stringify()
functions in JSON with examples.
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
Course Code: CST463
Course Name: Web Programming
PART A
1. Define WWW. List any two examples of web server & web browser. Differentiate
between URL and a domain?
2. Write the syntax of the URL? Rewrite the default URL of your university website
by adding a subdomain named ‘Research’ and a web page named ‘FAQ.html’.
Also link this URL through the logo of ‘kturesearch.png’ placed in a web page.
The FAQ page should be opened in a new window.
3. Illustrate the implementation of a JavaScript function greeting () using external .js

file, to display a welcome message, when you click on a Button in an HTML page.
4. What are different ways of adjusting spacing in a text with suitable example.
5. Discuss the various CSS style sheet levels with suitable examples. How are
conflicts resolved when multiple style rules apply to a single web page element?
6. Describe how input from an HTML form is retrieved in a PHP program, with an
example
7. Write a PHP program to check whether a number is prime number or not.
8. Discuss the various steps for establishing PHP-MySQL connection with a MySQL
database ?
9. Describe the schema of a document implemented in JSON with suitable examples
10. Explain the role of Resource controllers in Laravel.

(10x3=30)
Part B
11. (a) Design a webpage that displays the following table. (6)
(b) What is the difference between radio buttons and checkboxes when (8)
implemented using HTML? Write HTML code to implement a form which
has the following elements:
i. A textbox which can accept a maximum of 25 characters
ii. Three radio buttons with valid Label, Names and values
iii. Three check boxes buttons with valid Label, Names and values
iv. A selection list containing four items, two which are always visible
v. A submit button clicking on which will prompt the browser to send the
form data to the server “http://www..mysite.com/reg.php” using “POST”
method and reset button to clear its contents. You can use any text of
your choice to label the form elements.
OR
12. (a) Write the equivalent HTML code to implement the following in a web page: (6)
(i) An image titled “birds.jpg” with a height of 100 pixels and width of 200
pixels. If the image cannot be accessed, a message “No image available”
should be displayed (ii) A hyperlink to the URL
“www.mysite.com/birds.jpg”. The hyperlink should have the label “Click
Here”.
(b) Create a static HTML document for your portfolio, which includes the (8)
following contents: your name, address, Mobile Number and email address.
Also add the details about your college, university, your major and the batch
of study. Include a picture of yourself and at least one other image

(friend/pet/role model) to the document with a short description about that.
Add three paragraphs about your personal history, with links to your social
media profile. Also create an ordered list for describing your Skill Set & an
unordered list showing your Strengths & Weaknesses.
13. (a) Illustrate the usage of JavaScript DOM in event handling and explain any (8)
three methods with example.
(b) Write CSS and the corresponding HTML code for the following: (6)
i. Set the background color for the hover and active link states to "green"
ii. Set the list style for unordered lists to "square".
iii. Set "Flower.png" as the background image of the page and set 3%
margin for the pages
iv. Set dashed border for left and right and double border for top & bottom
of a table with 2 rows.
OR
14. (a) List the order of precedence of style levels. Organize a sample web page for (6)
providing ‘KTU BTech Honours Regulation 19’ for KTU and use embedded
Style sheet to apply minimum 5 styles for list, tables and pages.
(b) Illustrate the different ways of Array declaration in JavaScript. Describe the (8)
function of the following JavaScript Array object methods with examples.
(i) join (ii) slice
15. (a) Explain any six string handling functions used in PHP with example. (6)
(b) How does a PHP array differ from an array in C? List the different ways to (8)
create an array in PHP with an example. Explain any 4 functions that deals
with PHP array.
OR
16. (a) During the process of fetching a web page from a web server to a client (6)
browser, at what point does an embedded PHP script get executed. What are
the two modes that the PHP processor operates in? Explain
(b) Why is PHP considered to be dynamically typed? Distinguish between (8)

implode and explode function in PHP with suitable examples.
17. (a) Write equivalent PHP statements corresponding to the following: (8)
i. Declare an associative array named “ages” to store the key-value pairs
(“Alice”, 30), (“Bob”, 30), (“Harry”, 35), (“Mary”, 32).
ii. Modify the value associated with the key “Mary” to 28.
iii. Sort the array according to values maintaining the key-value
relationships and print the sorted key-value pairs.
iv. The entry identified by the key “Bob”
(b) What are the uses of cookies in web pages? Describe syntax for setting (6)
cookies in PHP. How can you access and delete the cookie using setcookie()
function?
OR
18. (a) Write a PHP form handling program to perform the user registration of any (8)
website with a minimum of 5 different fields and insert the data into a
MySQL table after establishing necessary connections with the DB,
(b) Design the HTML page which enters a given number and embed the PHP (6)
code to display a message indicating, whether the number is odd or even,
when clicking on the ‘CHECK NUMBER’ button.
19. (a) With a neat diagram, explain about Laravel MVC Framework. (6)
(b) Discuss in detail about Laravel’s Routing mechanisms. (8)
OR
20. (a) Enumerate the data types in JSON. Illustrate the document definition of a (8)
‘Student document ‘using JSON Schema.
(b) Discuss the following in Laravel Views (6)

i. Creating & Rendering Views
ii. Passing Data to Views
iii. Sharing Data with All Views
Teaching Plan
No of
Lecture
No Contents
Hrs (35
hrs)
Module 1 (7 hours)
Introduction to Internet and WWW
1.1 Evolution of Internet &World Wide Web- Web Basics URI’s & URL -MIME 1
Introduction to HTML5
1.2 Structuring & editing an HTML5 document- Fundamentals of HTML, Headings- 1

Images [Book 1 - Chapter 2]
1.3 Hyper Links, Internal Linking- Lists [Book 1 - Chapter 2] 1
1.4 Special Characters & Horizontal Rules- meta Elements- div and span 1
1.5 Tables- Forms [Book 1 - Chapter 2] 1
1.6 HTML5 Form input types, input and data list Elements and autocomplete 1
attributes-Page Structure Elements [Book 1 - Chapter 3]
1.7 Multimedia-HTML5 Audio & video elements [Book 1 - Chapter 9] 1
Module 2 (10 hours)
Introduction to Cascading Style Sheets(CSS)
2.1 Introduction to CSS3-Basic syntax and structure-Inline Styles [Book 1 - Chapter 4] 1
2.2 Embedded Style Sheets-Linking External Style Sheets [Book 1 - Chapter 4] 1
2.3 Exploring CSS Selectors-Properties-values [Book 1 - Chapter 4] 1
2.4 Positioning Elements: Absolute Positioning- Relative Positioning -Backgrounds- 1

List Styles- Table Layouts [Book 1 - Chapter 4]
2.5 Box Model and Text Flow, Basics of Responsive CSS-Media port & Media 1
Queries [Book 1 - Chapter 4]
Introduction to JavaScript
2.6 Introduction to Scripting- Programming fundamentals of JavaScript -Obtaining 1

User Input with prompt Dialogs [Book 1 - Chapter 6]
2.7 Arithmetic-Decision Making [Book 1 - Chapter 6] 1
2.8 Control Statements [Book 1 - Chapter 7]- Functions [Book 1 - Chapter 9] 1
2.9 Arrays [Book 1 - Chapter 10] - Objects [Book 1 - Chapter 11] 1
2.10 Document Object Model (DOM)- Form processing [Book 1 - Chapter 12,13] 1
Module 3 (6 hours)
Introduction to PHP
3.1 Building blocks of PHP-Variables, Data Types simple PHP program [Book 3- 1
Chapters 4]
3.2 Converting between Data Types, Operators and Expressions -Flow Control 1
functions [Book 1- Chapters 19]
3.3 Control Statements -Working with Functions [Book 3- Chapters 6] 1
3.4 Initialising and Manipulating Arrays- Objects [Book 1- Chapters 19] 1
3.5 Working with Strings-String processing with Regular expression, Pattern Matching 1
[Book 1- Chapters 19]
3.6 Form processing and Business Logic [Book 1- Chapters 19] 1
Module 4 (6 hours)
PHP -MYSQL
4.1 Cookies- Sessions [Book 1- Chapters 19] 1
4.2 PHP& MySQL Integration-Connecting to MySQL with PHP . 1

4.3 Working with MySQL data [Book 4- Chapters 18] 1
4.4 Performing CREATE, DELETE, INSERT operations on MySQL table from PHP 1
Program. [Book 4- Chapters 16]
4.5 Performing SELECT and UPDATE operations on MySQL table from PHP 1
Program. [Book 4- Chapters 16]
4.6 Building Dynamic Content in PHP application [Book1- Chapter19] 1
Module 5 (6 hours)
JSON
5.1 JSON Data Interchange Format -Syntax, Data Types, Object 1

[Book 2 - Chapters 1-2]
5.2 JSON Schema, Manipulating JSON data with PHP [Book 2 - Chapter 3,4] 1
LARAVEL
5.3 Laravel Overview- Design Pattern- Laravel Features [Book 4- Chapters 1] 1

Setting up a Laravel Development Environment-Application structure of Laravel
5.4 Laravel Basics Routing -middleware - Controllers [Book 4- Chapters 3] 1
5.5 Route Model Binding-Views-Redirections [Book 4- Chapters 3] 1
5.6 Blade Templating-echoing data, control structures [Book 4- Chapters 4] 1

YEAR OF
NATURAL LANGUAGE CATEGORY L T P CREDIT INTRODUCTION
CST473
PROCESSING
PEC 2 1 0 3 2019
Preamble: This course enables the learners to understand the concepts of Natural Language
Processing. The course covers basic pre-processing steps, language models, text classification
using machine learning algorithms, information and relation extraction methods, Information
Retrieval, Question Answer Systems and Machine Translation models. This course enables the
students to apply techniques and methods to solve challenging real-world problems in NLP.
Prerequisite: Nil.
CO1 Summarize basic concepts and learning methods for NLP (Cognitive Knowledge
Level: Understand)
CO2 Demonstrate the relevance of pre-processing methods on text data(Cognitive

CO3 Compare different language modelling techniques(Cognitive Knowledge Level:

Apply)
CO4 Make use of NLP techniques in Text Classification and Information

Retrieval(Cognitive Knowledge Level: Apply)
CO5 Explain Information Extraction, Relation Detection, QA Systems and Machine

Translation(Cognitive Knowledge Level: Understand)
CO1
CO2
CO3
CO4
CO5
Assessment Pattern

Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3

Attendance 10 marks

answer any 5.
Syllabus
Module – 1 (Introduction to NLP)
NLP Tasks and Applications, Language-Building Blocks, Challenges of NLP, Machine Learning
for NLP – Naïve Bayes Classifier, Logistic Regression, Support Vector Machines, Approaches to
NLP-- Heuristics-Based NLP, Machine Learning-based NLP.
Module – 2 (Pre-processing and Representation Models)
NLP System Pipeline--Steps--Data Acquisition, Text Extraction and Clean-up, Pre-processing,
Feature Engineering, Modelling, Evaluation, Post-Modelling Phases
Text Representation--Vector Space Models--Basic Vectorization Approaches--One-Hot

Encoding, Bag of Words, Bag of N-Grams TF-IDF; Distributed Representations-- Word
Embeddings, Doc2Vec.
Module - 3 ( Classification and Information Extraction)
Text Classification--Text classification applications – Pipeline for building text classification
systems, Naïve Bayes for Sentiment Classification – Naïve Bayes Classifier Training –
Optimizing for Sentiment Analysis, Logistic Regression, Support Vector Machine for Text
Classification
Information Extraction(IE)—IE Applications – The General Pipeline for IE - Named Entity

Recognition(NER), Ambiguity in Named Entity Recognition – NER as Sequence Labeling –
Evaluation of NER.
Module - 4 (Relation Detection and Information Retrieval)
Relation Detection and Classification – Supervised Learning Approaches to Relation Analysis –
Lightly Supervised Approaches to Relation Analysis – Evaluation of Relation Analysis systems
Information Retrieval – Term weighting and document scoring – Inverted Index – Evaluation of
Information Retrieval Systems.
Module - 5 (QA Systems and Machine Translation )
Question-Answering Systems – Factoid Question Answering – Question Processing – Passage
Retrieval – Answer Processing – Evaluation of Factoid Answers
Machine Translation – Why Machine Translation is Hard – Classical Machine Translation –

Direct Translation – Transfer – Statistical Machine Translation- The Phrase based Translation
model – Alignment in MT – Training Alignment Models – Symmetrizing Alignments for Phrase-
based MT – Decoding for Phrase-based Statistical MT
Text Books
1. Daniel Jurafsky, James H. Martin , “Speech and Language Processing”(2nd and 3rd editions),
Pearson Prentice Hall
2. Sowmya Vajjala, Bodhisattwa Majumder, Anuj Gupta, Harshit Surana,” Practical Natural
Language Processing: A Comprehensive Guide to Building Real-World NLP Systems “ June
2020 Publisher(s): O'Reilly Media, Inc. ISBN: 9781492054054.
Reference Books
1. James Allen, “Natural Language Understanding”, Second Edn , Pearson.
2. Christopher Manning and Hinrich Schutze, Statistical Natural Language Processing, MIT Press.

1. Explain the fundamental tasks that make up an NLP system.
2. Why is NLP considered a challenging problem domain?
3. The following table shows data about the profile of customers and whether they
purchase computers or not. Given this data, use Naïve Bayes Classifier to classify
the customer X (age = youth, income = medium, student = yes, credit rating = fair)
4. Illustrate how linearly inseparable data can be made linearly separable by suitable
mapping using kernel functions.
1. Mention two issues associated with sentence segmentation.
2. Show how is lemmatization done using Python Library.
3. Given a dataset of tweets, prepare the data for sentiment analysis by doing the
following operations: conversion to lower casing, removal of punctuations, removal
of stop-words, stemming, lemmatization, removal of emojis and removal of URLs.
(Assignment Question)

1. Compare Bag-of-Words model and Bag-of-n-gram model.
2. Illustrate how TF-IDF model is used to represent text. Mention the advantage of TF-
IDF over other models.
3. A corpus of data is given below :
Use one hot-encoding and Bag-of-words models to represent “dog bites man”.
Using the toy corpus given above, represent the sentence “Dog and Man eat meat” with
TF-IDF model. Use python code for implementation. (Assignment Question)

1. Given the following data about documents and contents, use tf-idf document scoring
method to retrieve the document for the query “best game”
The game was so exciting. The players excelled in every
Doc 1 department of the game.
Doc 2 It was an excellent game.
Doc 3 The game was not good. The moves were boring
2. A corpus of data is available from a social media platform that represents review of
books. How can Naïve Bayes Classifier be used for sentiment analysis of the
reviews? What changes can be made to this classifier to make it tuned for sentiment
analysis.
3. Use python library to implement sentiment analysis of review of a book, given a toy
corpus data set given below. (Assignment Question)
Document Category
just plain boring Negative
entirely predictable and lacks energy Negative
no surprises and very few laughs Negative
very powerful book Positive
the best book of the summer Positive

1. Explain lightly supervised approaches to relational analysis.
2. Explain a statistical algorithm for word alignment in Machine Translation.

QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
Course Code: CST473
Course Name: Natural Language Processing
PART A
1. Differentiate information extraction and information retrieval.
2. State Bayes’ Theorem.
3. List three preprocessing steps that are necessary for an HTML file.
4. Differentiate CBOW and Skipgram models
5. Explain the role of support vectors in SVM Classification.
6. Explain challenges in Name Entity Recognition.
7. How is a Relational Analysis System evaluated?
8. Explain the need for an inverted index in an information retrieval system. Are there
any more efficient data structures that serve the same purpose.
9. How do you extract answers to DEFINITION questions?
10. What are the components that make up a noisy channel model of statistical
Machine Translation? (10x3=30)
Part B
11. (a) How is classification done by SVM on linearly separable data? (8)
(b) What is a kernel function? What is the need for a kernel function? Can a (4)
kernel function be replaced by an ordinary mapping function?
(c) Explain Heuristic-based NLP. (2)
OR
12. (a) Illustrate the steps involved in classification in Naïve Bayes Classifier. (8)
(b) Explain the fundamental tasks that make up an NLP system. (6)
13. (a) Supposing that a set of social media posts’ dataset is available to do sentiment (8)
analysis. What pre-processing steps need to be done in order to use the data
for generating a language model? Illustrate.
(b) Illustrate Bag-of-ngrams model with an example. (6)
OR
14. (a) Explain the concept of word embeddings as a model for text representation. (6)
(b) Compare word embeddings model with vectorization approaches. (4)
(c) Explain the concept of feature engineering in NLP Systems. (4)
15. (a) 1. Given the following data about movie review and its classification, (10)
classify “predictable with no fun” to one of the classes using Naïve
Bayes Classifier.
Document Category
just plain boring Negative
entirely predictable and lacks energy Negative
no surprises and very few laughs Negative
very powerful Positive
the most fun film of the summer Positive
(b) Explain challenges in Name Entity Recognition. (4)

OR
16. (a) Explain Logistic Regression for Text Classification. (6)
(b) Explain Name Entity Recognition using Sequence Labeling. (8)
17. (a) Explain supervised approach to relation analysis. What are its limitations? (10)
(b) How is term selection done for indexing? (4)
OR
18. (a) Given the following data about documents and contents, use tf-idf document (10)
scoring method to retrieve the document for the query “sweet love”.
Doc 1 Sweet sweet nurse! Love

Doc 2 Sweet sorrow
Doc 3 How sweet is love?
Doc 4 Nurse!
(b) Explain the approaches to evaluate a relation analysis system. (4)
19. (a) Explain the phases of a factoid question-answering system. (8)
(b) Give an algorithm for word alignment in Machine Translation. (6)
OR
20. (a) How is decoding done in a Phrase-based Statistical Machine Translation (10)
System?
(b) Explain the concept of Mean Reciprocal Rank. (4)

Teaching Plan
No of
No Contents Lecture
Hrs: 35
Module 1 : Introduction to NLP (7 hours)
1.1 Introduction to NLP – Tasks and Applications 1
1.2 Language – Building Blocks, Challenges of NLP 1
Approaches to NLP - Heuristics-Based NLP, Machine Learning for

1.3 1
NLP
1.4 Machine Learning for NLP – Naïve Bayes Classifier 1
1.5 Logistic Regression 1
1.6 Support Vector Machines – Linearly Separable Data 1
1.7 Support Vector Machines – Linearly Inseparable Data 1
Module 2 : Pre-processing and Representation Models( 7 hours)
2.1 NLP System Pipeline – Stages – Overview, Data Acquisition 1
2.2 NLP System Pipeline – Text Extraction and Cleanup 1
NLP System Pipeline – Preprocessing - Sentence segmentation, Word

2.3 1
tokenization, Stemming and lemmatization
Feature Engineering, Model Building, Evaluation – Metrices, Post-

2.4 1
modeling phase
Text Representation – Vector Space Model, Vectorization

2.5 1
Approaches – One hot encoding, Bag of words
2.6 Bag of n-grams, TF-IDF 1
2.7 Word Embeddings – Word2Vec- CBOW, SkipGram models 1

Module 3: Classification and Information Extraction(7 hours)
Text Classification--Text classification applications – Pipeline for
3.1 1
building text classification systems
3.2 Sentiment Analysis using Naïve Bayes Classifier 1
3.3 Case Studies for Text Classification using Logistic Regression and 1
Support Vector Machines
Information Extraction (IE) and Applications, IE Tasks and the IE

3.4 1
Pipeline
3.5 Named Entity Recognition (NER) – Ambiguity in NER 1
3.6 NER as Sequence Labeling 1
3.7 Evaluation of NER, Practical NER Systems 1
Module 4 : Relation Detection and Information Retrieval(5 hours)
Relation Detection and Classification – Supervised Learning 1

4.1
Approaches to Relation Analysis
4.2 Relation Detection and Classification – Lightly Supervised 1

Approaches to Relation Analysis
Relation Detection and Classification -Evaluation of Relation
4.3 1
Analysis systems
4.4 Information Retrieval – Term weighting and document scoring 1
4.5 Inverted Index, Evaluation of Information-Retrieval Systems 1
Module 5 : QA Systems and Machine Translation (9 hours)
Question-Answering Systems – Factoid Question Answering,

5.1 1
Question Processing
5.2 Passage Retrieval 1
5.3 Answer Processing, Evaluation of Factoid Answers 1
5.4 Machine Translation – Why Machine Translation is Hard 1
5.5 Classical Machine Translation 1
5.6 Statistical Machine Translation 1
5.7 The Phrase based Translation model 1
5.8 Alignment in Machine Translation 1
5.9 Decoding for Phrase-based Statistical MT 1

SEMESTER VII
OPEN ELECTIVE
YEAR OF
INTRODUCTION TO CATEGORY L T P CREDIT INTRODUCTION
CST415
MOBILE COMPUTING
OEC 2 1 0 3 2019
Preamble: The purpose of this course is to prepare learners to understand the functionalities
and design considerations of mobile computing. The course content is designed to cover the
mobile computing architecture, features of different communication systems and major
elements of mobile security and next generation computer systems. This course enables the
learners to acquire advanced concepts on mobile and ad-hoc networks.
Prerequisite: A good knowledge of data communication and computer networks.
CO# Course Outcomes
CO1 Describe the mobile computing applications, services, design considerations

and architectures(Cognitive knowledge: Understand)
CO2 Identify the technology trends for cellular wireless networks(Cognitive
knowledge:Understand)
CO3 Summarize the Short Messaging Service and General Packet Radio Service
CO4 Outline the LAN technologies used in mobile communication (Cognitive
CO5 Describe the security protocols and apply suitable security algorithm to
secure the communication (Cognitive knowledge: Apply)
CO6 Explain the fundamental concepts of next generation mobile

networks(Cognitive knowledge: Understand)
CO1
CO2
CO3
CO4
CO5
CO6
Assessment Pattern

Bloom’s Category
Test 1 (%) Test 2 (%) (%)
Remember 30 30 30
Understand 50 50 50
Apply 20 20 20
Analyse
Evaluate
Create
Mark Distribution

150 50 100 3


Each of the two internal examinations shall be conducted for 50 marks. First series test shall
be conducted preferably after completing the first half of the syllabus and the second series
test shall be conducted preferably after completing the remaining part of the syllabus. There
shall be two parts for the question paper: Part A and Part B. Part A shall contain five questions
(preferably, two questions each from the fully completed modules and one question from the
partly covered module), having three marks for each question adding up to 15 marks for part
A. A student is expected to answer all questions from Part A. Part B shall contain seven
questions (preferably, three questions each from the fully completed modules and one question
from the partially completed module), each having seven marks. Out of the seven questions, a
student is expected to answer any five.

There shall be two parts; Part A and Part B. Part A shall contain 10 questions with 2 questions
from each module, having 3 marks for each question. A student is expected to answer all
questions from Part A. Part B shall contain 2 questions from each module, out of which a
student is expected to answer any one. Each question shall have a maximum of two sub-
divisions and shall carry 14 marks.
Syllabus
Module-1 (Mobile Computing Architecture)

Introduction to mobile computing – Functions, Devices, Middleware and gateways,
Applications and services, Limitations. Mobile computing architecture – Internet: The
ubiquitous network, Three-tier architecture, Design considerations for mobile computing.
Module-2 (Communication Systems)

Mobile computing through telephony - Evolution of telephony, Multiple access
procedures - Frequency Division Multiple Access (FDMA), Time Division Multiple
Access (TDMA), Code Division Multiple Access (CDMA), Space Division Multiple
Access (SDMA). Satellite communication systems – Basics, Applications, Geostationary
Earth Orbit (GEO), Low Earth Orbit (LEO), Medium Earth Orbit (MEO), Satellite
phones. Mobile computing through telephone – Interactive Voice Response (IVR)
architecture, Overview of voice software, Developing an IVR application. Global System
for Mobile Communication (GSM) - Introduction, Architecture, Entities, Call routing,
Mobility management, Frequency allocation, Authentication and security.
Module-3 (Short Messaging Service and General Packet Radio Service)

Short Message Service (SMS) – Strengths, Architecture, Value added services, Accessing
the SMS bearer. General Packet Radio Service (GPRS) – Architecture, Network
operations, Data services, Applications, Limitations, Billing and charging.
Module-4 (Wireless Local Area Networks)

Wireless Local Area Network (WLAN) - Advantages, Evolution, Applications,
Architecture, Mobility, Security, Deploying WLAN. Wireless Local Loop (WLL) –
Architecture. High Performance Radio Local Area Network (HIPERLAN). WiFi Vs 3G.
Module-5 (Mobile Security and Next Generation Networks)

Security issues in mobile computing - Information security, Security techniques and
algorithms, Security protocols. Next generation networks – The Converged Scenario,
Narrowband to broadband, Orthogonal Frequency Division Multiplexing (OFDM), Multi
Protocol Label Switching (MPLS), Wireless Asynchronous Transfer Mode (WATM),
Multimedia broadcast services.
Text Books
1. Asoke K. Talukder, Hasan Ahmad, Roopa R Yavagal, Mobile Computing
Technology- Application and Service Creation, 2nd Edition, McGraw Hill Education.
Reference Books
1. Andrew S. Tanenbaum, Computer Networks, 6/e, PHI.
2. Theodore S. Rappaport, Wireless Communications Principles and Practice, 2/e, PHI,
New Delhi, 2004.
Course Outcome 1 CO1):

1. Describe the design considerations in mobile computing.
2. Give five examples of mobile computing applications.
1. Draw a call flow diagram for a theatre ticket booking system.
2. Illustrate the GSM architecture with figure.
1. Illustrate the billing and charging services in GPRS.
2. Describe the SMS architecture.
1. Compare IEEE 802.11, HIPERLAN with respect to their ad-hoc capabilities.
2. Discuss the security mechanism used in WLAN.
1. With the help of a suitable example, show the working of Diffie-Hellman key
exchange algorithm.
2. Bob chooses 7 and 11 as two prime numbers and chooses e as 13. Find an
appropriate value for d and decrypt the plaintext 5 send by Alice to Bob.
3. Describe the security issues in mobile computing.
1. Describe WATM and Multimedia broadcast services.
2. Describe the significance of Orthogonal Frequency Division Multiplexing
(OFDM) in next generation networks.

QP CODE: PAGES: 3
Reg No:_______________
Name:_________________

Course Code: CST415
Course Name : INTRODUCTION TO MOBILE COMPUTING
PART-A
1. Explain the different types of middleware and gateways required in mobile

computing.
2. List any six limitations of mobile computing.
3. Compare and contrast the satellite systems – GEO, LEO and MEO.
4. How is frequency allocation done in GSM?
5. What are the various strengths of SMS?
6. How is billing and charging done in GPRS?
7. What are the different types of Wireless LANs?
8. Describe the architecture of a Wireless Local Loop.
9. Explain the key features of TLS protocol.
10. How are attacks classified?

(10x3=30)
Part B
11. (a) Describe any four mobile computing functions. (4)
(b) Explain the three-tier architecture of mobile computing with figure. (10)
OR
12. (a) Describe the significance and functions of core, edge and access network. (6)
(b) Explain the terms (i) Client Context Manager (ii) Policy Manager (iii) Security (8)
Manager (iv) Adaptability Manager
13. (a) Why is multiple access important? With the help of suitable examples, explain (7)
the various multiple access techniques.
(b) Describe the different algorithms used for security and authentication in GSM. (7)
OR
14. (a) Show how call routing is done in GSM. Give an example. (7)
(b) Explain the process of handover. How does handover differ from roaming? (7)
15. (a) With the help of neat sketches, explain the difference between Short Message (6)
Mobile Terminated (SM MT) and Short Message Mobile Originated (SM MO)
messages.
(b) Explain the network operations in GPRS. (8)
OR
16. (a) How does operator-centric pull differ from operator-independent push and pull? (7)
(b) Describe the data services and applications of GPRS. (7)
17. (a) Compare the HIPERLAN and OSI layered architecture. (4)
(b) Explain the 802.11 architecture. (10)
OR
18. (a) Compare 3G and WiFi. (7)
(b) Explain the HIPERLAN communication models with suitable diagrams. (7)
19. (a) Given p = 7, q = 17 and e = 5. Find the value of d and also encrypt the message (7)
P = 65 using RSA.
(b) Explain the role of MPLS in service provisioning. (7)
OR
20. (a) With the help of a suitable example, show the working of Diffie-Hellman key (7)
exchange algorithm.
(b) Explain the features of any three multimedia broadcast services. (7)
TEACHING PLAN
No Contents No.of
Lecture Hrs
(35 hrs)
Module-1 (Mobile Computing Architecture) (6 hrs)

1.1 Introduction to mobile computing – Functions, Devices, 1
Middleware and gateways
1.2 Applications, services, limitations, Internet: The ubiquitous 1
network
1.3 Three-tier architecture (Lecture 1) 1
1.4 Three-tier architecture (Lecture 2) 1

1.5 Design considerations for mobile computing (Lecture 1) 1
1.6 Design considerations for mobile computing (Lecture 2) 1
Module-2 (Communication Systems) (7hrs)

Evolution of telephony, Multiple access procedures –
2.1 1
FDMA, TDMA, CDMA, SDMA
Satellite communication systems – GEO, MEO, LEO, 1

2.2
Satellite phones
2.3 Interactive Voice Response (IVR) architecture, Overview of 1

voice software, Developing an IVR application (Call flow
diagram)
2.4 Introduction to GSM,Architecture 1
2.5 GSM entities, Call routing 1
2.6 Mobility management 1
2.7 Frequency allocation, Authentication and security 1

Module-3 (Short Messaging Service and General Packet Radio Service) (8hrs)
3.1 SMS Strengths, Architecture, Short Message Mobile 1

Terminated (SM MT) and Short Message Mobile Originated
(SM MO) messages
3.2 SMS Architecture - Operator-centric pull, operator- 1
independent push/pull, Value added services
3.3 Accessing the SMS bearer (Lecture 1) 1
3.4 Accessing the SMS bearer (Lecture 2) 1
3.5 GPRS architecture 1
3.6 Network operations 1
3.7 Data services, Applications 1
3.8 Limitations, Billing and charging 1
Module-4 (Wireless Local Area Networks) (7 hrs)
WLAN Advantages, Evolution, Applications

4.1 1
4.2 WLAN Architecture (Lecture 1) 1

WLAN Architecture (Lecture 2)
4.3 1
4.4 Mobility, Security 1
4.5 Deploying WLAN 1
4.6 WLL Architecture, HIPERLAN 1
4.7 WiFi Vs 3G 1
Module-5 (Mobile Security and Next Generation Networks) (7hrs)
Information security – Attacks, Components

5.1 1
5.2 Security techniques and algorithms – Stream Vs Block cipher, 1

Symmetric Vs Asymmetric cryptography
5.3 Security techniques and algorithms – RSA, Diffie Hellman 1
Key exchange
5.4 Security protocols – Secure Socket Layer, Transport Layer 1

Security, Wireless Transport Layer Security
5.5 The Converged Scenario, Narrowband to broadband 1
5.6 Orthogonal Frequency Division Multiplexing (OFDM) and 1

Multi Protocol Label Switching (MPLS)
5.7 Wireless Asynchronous Transfer Mode (WATM) and 1
Multimedia broadcast services
YEAR OF
INTRODUCTION TO CATEGORY L T P CREDIT
INTRODUCTION
CST425
DEEP LEARNING
OEC 2 1 0 3 2019
Preamble: This course aims to introduce the learner to an overview of the concepts and
algorithms involved in deep learning. Basic concepts and application areas of machine learning,
deep networks, convolutional neural network and recurrent neural network are covered in this
course. This is a foundational program that will help students understand the capabilities,
challenges, and consequences of deep learning and prepare them to participate in the
development of leading-edge AI technology. They will be able to gain the knowledge needed to
take a definitive step in the world of AI.
Prerequisite: Basics of linear algebra and probability.
CO1 Demonstrate basic concepts in machine learning.(Cognitive Knowledge Level:
Understand)
CO2 Illustrate the validation process of machine learning models using hyper-parameters
and validation sets. (Cognitive Knowledge Level: Understand)
CO3 Demonstrate the concept of the feed forward neural network and its training process.
CO4 Build CNN and Recurrent Neural Network (RNN) models for different use cases.
CO1
CO2
CO3
CO4
CO5
PO# Broad PO PO# Broad

PO
Assessment Pattern

Category Examination Marks (%)
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution

150 50 100 3 hours
Syllabus
Module-1 (Introduction)
Key components - Data, models, objective functions, optimization algorithms, Learning

algorithms. Supervised learning- regression, classification, tagging, web search, page ranking,
recommender systems, sequence learning, Unsupervised learning, Reinforcement learning,
Historical Trends in Deep Learning. Other Concepts - overfitting, underfitting , hyperparameters
and validation sets, estimators, bias and variance.
Module- 2 (Optimization and Neural Networks)
Neural Networks –Perceptron, Gradient Descent solution for Perceptron, Multilayer perceptron,
activation functions, architecture design, chain rule, back propagation, gradient based learning.
Introduction to optimization– Gradient based optimization, linear least squares. Stochastic
gradient descent, Building ML algorithms and challenges.
Convolutional Neural Networks – convolution operation, motivation, pooling, Convolution and

Pooling as an infinitely strong prior, variants of convolution functions, structured outputs, data
types, efficient convolution algorithms.

sequence architectures, deep recurrent networks, recursive neural networks, modern RNNs
LSTM and GRU, Practical use cases for RNNs.

Applications – computer vision, speech recognition, natural language processing. Research
Areas – Autoencoders, Representation learning, Boltzmann Machines, Deep belief networks.
Text Book
1. Ian Goodfellow, Yoshua Bengio, Aaron Courville, Deep Learning, MIT Press 2015 ed.
2. Aston Zhang, Zachary C. Lipton, Mu Li, and Alexander J. Smola, Dive into Deep Learning,
August 2019.
3. Neural Networks and Deep Learning: A Textbook by Charu C. Aggarwal. Springer.1st
edition, 2018.
Reference Books
1. Neural Smithing: Supervised Learning in Feed forward Artificial Neural Networks by

Russell Reed, Robert J MarksII, 1st edition, 1999, MIT Press.
2. Practical Convolutional Neural Networks by Mohit Sewak, Md. Rezaul Karim, Pradeep
Pujari, 1st edition, 2018, Packt Publishing Ltd.
3. Hands-On Deep Learning Algorithms with Python by Sudharsan Ravichandran, 1st edition,
2019, Packt Publishing Ltd.
4. Deep Learning with Python by Francois Chollet, 2nd edition, 2018, Manning Publications
Co.

1. Compare regression and classification.
2. Define supervised learning? Distinguish between regression and classification.
3. Discuss the different learning approaches used in machine learning.
4. You train an initial model that achieves a 90% accuracy on the training dataset. What
kind of problems your model is experiencing, and suggest a possible solution.
5. How does splitting a dataset into train, validation and test sets help identify
overfitting?
6. Consider solving a classification task. You first train your network on 20 samples.
Training converges, but the training loss is very high. You then decide to train this
network on 10,000 examples. Is your approach to fixing the problem correct? If yes,
explain the most likely results of training with 10,000 examples. If not, give a
solution to this problem.
7. Describe one advantage of using mini-batch gradient descent instead of full-batch

gradient descent.
8. Sketch the typical learning curves for the training and validation sets, for a setting
where overfitting occurs at some point. Assume that the training set and the validation
set are of the same size

1. What are hyperparameters? Why are they needed?
2. What issues are to be considered while selecting a model for applying machine
learning in a given problem?
3. Update the parameters V11 in the given MLP using back propagation with learning
rate as 0.5 and activation function as sigmoid. Initial weights are given as V11= 0.2,
V12=0.1, V21=0.1, V22=0.3, V11=0.2, W11=0.5, W21=0.2
4. Draw the architecture of a multi-layer perceptron.
5. Derive update rules for parameters in the multi-layer neural network through the
gradient descent.
6. Why is it important to place non-linearities between the layers of neural networks?
7. You design a fully connected neural network architecture where all activations are
sigmoids. You initialize the weights with large positive numbers. Is this a good idea?
Explain your answer.
8. You are doing full batch gradient descent using the entire training set (not stochastic
gradient descent). Is it necessary to shuffle the training data? Explain your answer.
9. Consider training a fully-connected neural network with 5 hidden layers, each with 10
hidden units. The input is 20-dimensional and the output is a scalar. What is the total
number of trainable parameters in your network?
10. Consider building a 10-class neural network classifier. Given a cat image, you want
to classify which of the 10 cat breeds it belongs to. What loss function do you use?
Introduce the appropriate notation and write down the formula of the loss function.
11. Why is the sigmoid activation function susceptible to the vanishing gradient
problem?

visual tasks.
2. Suppose that a CNN was trained to classify images into different categories. It
performed well on a validation set that was taken from the same source as the training
set but not on a testing set. What could be the problem with the training of such a
CNN? How will you ascertain the problem? How can those problems be solved?
3. You are given a dataset of 10 x 10 grayscale images. Your goal is to build a 5-class
classifier. You have to adopt one of the following two options: a) the input is
flattened into a 100-dimensional vector, followed by a fully-connected layer with 5
neurons, b) the input is directly given to a convolutional layer with five 10 x 10

filters. Explain which one you would choose and why.
4. Weight sharing allows CNNs to deal with image data without using too many
parameters. Does weight sharing increase the bias or the variance of a model?
5. Why do the layers in a deep architecture need to be non-linear?
6. A convolutional neural network has 4 consecutive layers as follows:
3 x 3 conv (stride 2) - 2 x 2 Pool - 3 x 3 conv (stride 2) - 2 x 2 Pool
How large is the set of image pixels which activate a neuron in the 4th non-image
layer of this network?
7. Consider a convolution layer. The input consists of 6 feature maps of size 20 x 20.
The output consists of 8 feature maps, and the filters are of size 5 x 5. The
convolution is done with a stride of 2 and zero padding, so the output feature maps
are of size 10 x 10. Determine the number of weights in this convolution layer

3. Illustrate the workings of the RNN with an example of a single sequence defined on a
vocabulary of four words.
4. If we have a recurrent neural network (RNN), we can view it as a different
type of network by "unrolling it through time". Briefly explain what that
means.
5. Briefly explain how “unrolling through time” is related to “weight sharing” in
convolutional networks.
7. Show the steps involved in an LSTM to predict stock prices.Give one advantage of
using an RNN rather than a convolutional network.

1. Development a deep learning solution for problems in the domain i) natural language
processing or ii Computer vision (Assignment)
2. Is an autoencoder for supervised learning or for unsupervised learning? Explain
briefly.
3. Sketch the architecture of an autoencoder network.
4. Describe how to train an autoencoder network.
5. Write down the formula for the energy function (E) of a Restricted Boltzmann
Machine (RBM).

QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, MONTH & YEAR
Course Code: CST425
Course Name: Introduction To Deep Learning
PART A
1. Distinguish between supervised learning and Reinforcement learning. Illustrate

with an example.
2. Differentiate classification and regression.
3. Compare overfitting and underfitting. How it can affect model generalization.
4. Why does a single perceptron cannot simulate simple XOR function? Explain
how this limitation is overcome?
5. Illustrate the strengths and weaknesses of convolutional neural networks.
6. Illustrate convolution and pooling operation with an example
7. How many parameters are there in AlexNet? Why the dataset size (1.2 million) is
important for the success of AlexNet?
8. Explain your understanding of unfolding a recursive or recurrent computation into
a computational graph.
(10x3=30)
Part B
11. (a) “A computer program is said to learn from experience E with respect to some
class oftasks T and performance measure P, if its performance at tasks in T,
(10)
as measured by P, improves with experience E.” What is your understanding
of the terms task, performance and experience. Explain with two example
(b) “How does bias and variance trade-off affect machine learning algorithms? (4)
OR
12. (a) Illustrate the concepts of Web search, Page Ranking, Recommender systems (10)
(b) List and discuss the different hyper parameters used in fine tuning the (4)
traditional machine learning models
13. (a) How multilayer neural networks learn and encode higher level features from
input features. (7)
(b) Explain gradient decent and delta rule? Why stochastic approximation to (7)
gradient descent is needed?
OR
14. (a) Find the new weights for the network using backpropogation algorithm, the (7)
network is given with a input pattern[-1,1] and target output as +1, Use
learning rate of alpha=0.3 and bipolar sigmoid function.
(b) Write an algorithm for backpropagation which uses stochastic gradient (7)
descent method. Comment on the effect of adding momentum to the
network.
15. (a) Input to CNN architecture is a color image of size 112x112x3. The first (5)
convolution layer comprises of 64 kernels of size 5x5 applied with a stride
of 2 and padding 0. What will be the number of parameters?
(b) Let X=[-1, 0, 3, 5] W=[.3 ,.5 .2,.1] be the the input of ith layer of a neural (4)
network and to apply softmax function. What should be the output of it?
(c) Draw and explain the architecture of convolutional network (5)
OR
16. (a) Explain the concept behind i) Early stopping ii) dropout iii) weight decay (9)
(b) How backpropagation is used to learn higher-order features in a convolutional (5)
Network?
17. (a) Explain the working of RNN and discuss how backpropagation through time
is used in recurrent networks. (8)
(b) Describe the working of a long short term memory in RNNs. (6)
OR
18. (a) What is the vanishing gradient problem and exploding gradient problem? (8)
(b) Why do RNNs have a tendency to suffer from exploding/vanishing gradient? (6)
How to overcome this challenge?
(b) Explain the merits and demerits of using Auto encoders in Computer Vision. (6)
OR
(b) Compare Boltzmann Machine with Deep Belief Network. (7 )
Teaching Plan
No. of
Lecture
No Contents Hours
(37 hrs)
1.1 Key components - Data, models, objective functions, optimization algorithms. 1
1.2 Learning algorithm (TB1: Section 5.1), Supervised learning- regression, 1
classification, tagging, web search, page ranking (TB2: Section 1.3.1)
1.3 Recommender systems, Sequence learning, Unsupervised learning, 1
Reinforcement learning(TB2: Section 1.3.2-1.3.4)
1.4 Historical Trends in Deep Learning (TB1: Section 1.2). 1
1.5 Concepts: overfit, underfit, hyperparameters and validation sets. (TB1: Section 1
5.2-5.3)
1.6 Concepts: Estimators, bias and variance. (TB1: Section 5.4) 1
1.7 Demonstrate the concepts of supervised learning algorithms using a suitable 1
platform.
1.8 Demonstrate the concepts of unsupervised using a suitable platform. 1
Module 2 : Optimization and Neural Networks (9 hours)
2.1 Perceptron, Stochastic Gradient descent, Gradient descent solution for 1

perceptron (TB3: Section 1.1 - 1.2.1)
2.2 Multilayer perceptron (TB3: Section 1.2.2), (TB1: Section 6.1,6.3) 1
2.3 Activation functions- Sigmoid, tanh, Softmax, ReLU, leaky ReLU (TB3: Section 1
1.2.1.3 - 1.2.1.5)
2.4 Architecture design (TB1: Section 6.4, TB3: Section 1.6) 1
2.5 Chain rule, back propagation (TB3: Section 1.3) 1
2.6 Gradient based learning (TB1: Section 6.2) 1
2.7 Gradient based optimization (TB1: Section 4.3) 1
2.8 Linear least squares using a suitable platform. (TB1: Section 4.5) 1
2.9 Building ML Algorithms and Challenges (TB3: 1.4, TB1: 5.10-5.11) 1
Module 3 :Convolution Neural Network (8 hours)
3.1 Convolution operation (TB1:Section 9.1) 1
3.2 Motivation, pooling (TB1:Section 9.2-9.3) 1
3.3 Convolution and Pooling as an infinitely strong prior (TB1: Section 9.4) 1
3.4 Variants of convolution functions – multilayer convolutional network, tensors, 1

kernel flipping, downsampling, strides and zero padding. (TB1: Section 9.5)
3.5 Variants of convolution functions - unshared convolutions, tiled convolution, 1
training different networks. (TB1: Section 9.5)
3.6 Structured outputs, data types (TB1: Section 9.6-9.7) 1
3.7 Efficient convolution algorithms. (TB1: Section 9.8,9.10) 1
3.8 Case Study: AlexNet, VGG, ResNet. (TB3: Section 8.4.1, 8.4.3, 8.4.5) 1
Module 4 :Recurrent Neural Network (7 hours)

4.1 Computational graphs (TB1: Section 10.1) 1
4.2 RNN (TB1: Section 10.2-10.3) 1
4.3 Encoder – decoder sequence to sequence architectures. (TB1: Section 10.4) 1
4.4 Deep recurrent networks (TB1: Section 10.5) 1
4.5 Recursive neural networks , Modern RNNs, LSTM and GRU (TB1: Section 1
10.6, 10.10)
4.6 Practical use cases for RNNs. (TB1: Section 11.1-11.4) 1
4.7 Demonstrate the concepts of RNN using a suitable platform. 1
Module 5 : Applications and Research (5 hours)
5.1 Computer vision. (TB1: Section 12.2) 1
5.2 Speech recognition. (TB1: Section 12.3) 1
5.3 Natural language processing. (TB1: Section 12.4) 1
5.4 Brief introduction on current research areas- Autoencoders, Representation 1
learning. (TB1: Section 14.1-14.2, TB3: 9.3)
5.5 Brief introduction on current research areas- Boltzmann Machines, Deep belief 1
networks. (TB1: Section 20.1, 20.3)
YEAR OF
CST435 COMPUTER GRAPHICS
OEC 2 1 0 3 2019
Preamble: This course helps the learners to make awareness about strong theoretical concept in
computer graphics. It covers the three-dimensional environment representation in a computer,
transformation of 2D/3D objects and basic mathematical techniques and algorithms used to build
applications. This course enables the learners to develop the ability to create image processing
frameworks for different domains and develop algorithms for emerging display technologies.
Prerequisite: A sound knowledge of Mathematics and concepts of any programming language.

CO# CO
Describe the working principles of graphics devices(Cognitive Knowledge
CO1 level: Understand)
Illustrate line drawing, circle drawing and polygon filling algorithms(Cognitive

CO2 Knowledge level: Apply)
CO3 Demonstrate geometric representations and transformations on 2D & 3D objects

(Cognitive Knowledge level: Apply)
CO4 Demonstrate the working of line and polygon clipping algorithms(Cognitive
CO5 Summarize visible surface detection methods and illustrate projection
algorithms. (Cognitive Knowledge level: Apply)
CO1
CO2
CO3
CO4
CO5



problems
Assessment Pattern

Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution

150 50 100 3

Attendance 10 marks


should answer any5.
contains 2 full questions from each module of which student should answer any one full
question. Each question can have maximum 2 sub-divisions and carries 14 marks.
Syllabus
Module – 1(Basics of Computer graphics)

S
Basics of Computer Graphics and its applications. Video Display devices- Refresh Cathode Ray
Tubes(CRT), Random Scan Displays and systems, Raster scan displays and systems, Color CRT
displays, Flat panel display and its categories.
Module – 2 (Line drawing, Circle drawing and Filled Area Primitives)
Line drawing algorithms- DDA, Bresenham’s algorithm. Circle drawing algorithms- Midpoint
Circle generation algorithm, Bresenham’s algorithm. Filled Area Primitives- Scan line polygon
filling, Boundary filling and flood filling.
Module - 3 (Geometric transformations)
Two dimensional transformations-Translation, Rotation, Scaling, Reflection and Shearing,
Composite transformations, Matrix representations and homogeneous coordinates. Basic 3D
transformations.
Module - 4 (Clipping)
Window to viewport transformation. Cohen Sutherland and Midpoint subdivision line clipping
algorithms, Sutherland Hodgeman and Weiler Atherton Polygon clipping algorithms.
Module - 5 (Three dimensional graphics)

Three dimensional viewing pipeline. Projections- Parallel and Perspective projections. Visible
surface detection algorithms- Back face detection, Depth buffer algorithm, Scan line algorithm, A
buffer algorithm
Text Book
1. Zhigang Xiang and Roy Plastock, Computer Graphics (Schaum’s outline Series), McGraw
Hill, 2019.
2. Donald Hearn and M. Pauline Baker, Computer Graphics, PHI, 2e, 1996
References
1. William M. Newman and Robert F. Sproull, Principles of Interactive Computer Graphics.
McGraw Hill, 2001
2. David F. Rogers , Procedural Elements for Computer Graphics, Tata McGraw Hill,2001.
3. Donald Hearn, M. Pauline Baker and Warren Carithers, Computer Graphics with
OpenGL, PHI, 4e, 2013

1. Compare the working principle of raster scan systems and random scan systems.
2. How much time is spent scanning across each row of pixels during screen refresh on a
raster system with resolution of 1280*1024 and a refresh rate of 60 frames per second?
1. Rasterize the line using Bresenham’s line drawing algorithm with end points (2,3) and
(5,8) accepted from the user and implement it using any appropriate programming
language. (Assignment)
2. Illustrate how the 4-connected boundary filling approach differs from 8-connected
boundary filling and implement it using any appropriate programming language.
(Assignment)
1. Rotate a triangle ABC 45 degree counter clockwise about the pivot point (10,3) , where
the
position vector of the coordinates is given as A(4,1), B(5,2) and C(4,3).
2. Implement the above transformation using any appropriate programming language with
user inputs. (Assignment)
3. Illustrate the steps required for a general 3D rotation if the rotation axis is not parallel to
any one of the principal axis. The rotation axis is defined by the points P1(x1,y1,z1) and
P2(x2,y2,z2). Give its composite matrix representation.
1. Given a clipping window A(20,20), B(60,20), C(60,40) and D(20,40). Using Cohen
Sutherland algorithm, find the visible portion of the line segment joining the points
P(40,80) and Q(120,30).
2. Implement Cohen Sutherland clipping algorithm using any appropriate programming

language with user inputs. (Assignment)
1. Explain scan line algorithm for detecting visible surfaces in an object.
2. Derive the matrix for performing perspective projection and parallel projection.
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 3
Course Code: CST435
Course Name: Computer Graphics
PART A
1. Describe Flat Panel display and its categories.
2. Consider a raster system with a resolution of 1024*1024. Compute the size of the
raster needed to store 4 bits per pixel? How much storage is needed if 8 bits per
pixel are to be stored?
3. Justify the usage of integer arithmetic in Bresenham’s line drawing algorithm.
4. How 8-way symmetry of circle can be used for developing circle drawing
algorithms?
5. Show that two successive reflections about either of the coordinate axes is
equivalent to a single rotation about the coordinate origin.
6. Determine a sequence of basic transformations that is equivalent to x-direction

shearing.
7. Find the window to viewport normalization transformation with window lower left
corner at (1,1) and upper right corner at (2,6).
8. How does Cohen Sutherland algorithm determine whether a line is visible, invisible or
a candidate for clipping based on the region codes assigned to the end points of the
line?
9. Define the terms (i) Centre of projection (ii) Principal vanishing point
10. Differentiate between the object space and image space method for the hidden surface
removal of an image. (10x3=30)
Part B
11. (a) Explain the working principle of beam penetration method and shadow mask (8)
method with suitable illustrations.
(b) Draw the architecture of raster scan display systems and explain its working (6)
principle.
OR
12. (a) Explain the working principle of a Refresh CRT monitor with suitable (8)
diagrams.
(b) Describe random graphics system with suitable illustrations. (6)
13. (a) Differentiate between boundary fill and flood fill algorithms. (5)
(b) Derive the initial decision parameter of Bresenham’s line drawing algorithm (9)
and rasterize a line with endpoints (2,2) and (10,10).
OR
14. (a) Write Midpoint circle drawing algorithm and identify the points in the circle (8)
with radius as 20 and center at (50,30) using the algorithm.
(b) Illustrate the working principle of scan line polygon filling algorithm. (6)
15. (a) Reflect a triangle ABC about the line 3x-4y+8=0, where the coordinates of the (8)
triangle are given as A(4,1), B(5,2) and C(4,3).
(b) A diamond shaped polygon is located at P(-1,0), Q(0,-2), R(1,0) and S(0,2). (6)
Find the transformation matrix which would rotate the triangle by 90 degree
counter clockwise about the point Q. Using the transformation matrix, find
the coordinates of the rotated polygon.
OR
16. (a) Describe the steps required for a general 3D rotation if the rotation axis is not (8)
parallel to any one of the principal axis. The rotation axis is defined by the
points P1(x1,y1,z1) and P2(x2,y2,z2). Give its composite matrix
representation.
(b) Consider a triangle at (2,2), (10,2), (2,10). Perform the following 2D (6)
transformations in succession and find the resultant vertices.
i) Scale with respect to (2,2) by scaling factors (2,2) along x
and y directions.
ii) Rotate by 90 degree counter clockwise direction.
iii) Reflection based on y=x
17. (a) Illustrate Weiler – Atherton polygon clipping algorithm. (6)
(b) Explain Cohen-Sutherland line clipping algorithm. Use the algorithm to clip (8)
line with end points P1 (70, 20) and P2(100,10) against a window with lower
left hand corner (50,10) and upper right hand corner (80,40).
OR
18. (a) Describe Sutherland Hodgeman polygon clipping algorithm and list out its (7)
limitations.
(b) Explain the steps involved in clipping a line using Mid point Subdivision (7)
algorithm.
19. (a) Explain how visible surfaces can be detected using depth buffer algorithm. (7)
(b) Define parallel projection. Describe orthographic and oblique parallel (7)
projection.
OR
20. (a) Illustrate the scan line method used in visible surface detection. (7)
(b) Derive the matrix needed for performing perspective projections. (7)
TEACHING PLAN
No of Lecture
No Contents
Hrs (35 hrs)
Module – 1 (Basics of Computer Graphics) (6 hrs)

1.1 Basics of Computer Graphics and applications 1
1.2 Refresh Cathode Ray Tubes 1
1.3 Random Scan Displays and systems 1
1.4 Raster scan displays and systems 1
1.5 Color CRT displays 1
1.6 Flat panel display and its categories. 1
Module - 2 (Line drawing, Circle drawing and Filled Area Primitives) (7 hrs)
2.1 DDA Line drawing Algorithm 1
2.2 Bresenham’s line drawing algorithm 1
2.3 Midpoint Circle generation algorithm 1
2.4 Bresenham’s Circle generation algorithm 1
2.5 Illustration of line drawing and circle drawing algorithms 1
2.6 Scan line polygon filling 1
2.7 Boundary filling and flood filling 1
Module - 3 (Geometric transformations) ( 8 hrs)
3.1 Basic 2D transformations-Translation and Rotation 1
3.2 Basic 2D transformations- Scaling 1
3.3 Reflection and Shearing 1
3.4 Illustration of 2D Transformations 1
3.5 Composite transformations 1
3.6 Matrix representations and homogeneous coordinates 1
3.7 Basic 3D transformations 1
3.8 Illustration of basic 3D transformations 1
Module - 4 (2D Clipping) (6 hrs)
4.1 Window to viewport transformation 1
4.2 Cohen Sutherland Line clipping algorithm 1
4.3 Midpoint subdivision Line clipping algorithm 1
4.4 Sutherland Hodgeman Polygon clipping algorithm 1
4.5 Weiler Atherton Polygon clipping algorithm 1
4.6 Practice problems on Clipping algorithms 1
Module - 5 (Three dimensional graphics)( 8 hrs)
5.1 Three dimensional viewing pipeline, Projections-Parallel 1

projections
5.2 Projections- Perspective projections 1

5.3 Visible surface detection algorithms- Back face detection. 1
5.4 Depth buffer algorithm 1
5.5 Depth buffer algorithm 1
5.6 Scan line visible surface detection algorithm 1
5.7 Scan line visible surface detection algorithm 1
5.8 A buffer algorithm 1
YEAR OF
PYTHON FOR CATEGORY L T P CREDIT INTRODUCTION
CST445 ENGINEERS
OEC 2 1 0 3 2019
Preamble: The objective of the course is to provide learners an insight into Python programming
in a scientific computation context and develop programming skills to solve engineering
problems. It covers programming environment, important instructions, data representations,
intermediate level features, Object Oriented Programming and file data processing of Python.
This course lays the foundation to scientific computing, develop web applications, Machine
Learning, and Artificial Intelligence-based applications and tools, Data Science and Data
Visualization applications.
Prerequisite: NIL
Note : Students who have successfully completed CST 283 - Python for Machine Learning
(Minor) are not eligible to opt this course.
Write, test and debug Python programs (Cognitive Knowledge level:

CO1
Apply)
Illustrate uses of conditional (if, if-else, if-elif-else and switch-case) and
CO2 iterative (while and for) statements in Python programs (Cognitive
Develop programs by utilizing the modules Lists, Tuples, Sets and
CO3
Dictionaries in Python (Cognitive Knowledge level: Apply)
Implement Object Oriented programs with exception handling (Cognitive
CO4
Analyze, Interpret, and Visualize data according to the target application (Cognitive
CO5
Develop programs in Python to process data stored in files by utilizing the modules
CO6
Numpy, Matplotlib, and Pandas (Cognitive Knowledge level: Apply)
CO1
CO2
CO3
CO4
CO5
CO6

Assessment Pattern
Test 1 (Marks in Test 2 (Marks End Semester
Bloom’s Category
percentage) in percentage) Examination Marks
Remember 20 20 20
Understand 30 30 30
Apply 50 50 50
Analyse
Evaluate
Create
Mark Distribution

150 50 100 3



Syllabus
Module 1 (Basics of Python)
Getting Started with Python Programming - Running code in the interactive shell, Editing,
Saving, and Running a script. Using editors - IDLE, Jupyter. Basic coding skills - Working with
data types, Numeric data types and Character sets, Keywords, Variables and Assignment
statement, Operators, Expressions, Working with numeric data, Type conversions, Comments in
the program, Input Processing, and Output, Formatting output. How Python works. Detecting
and correcting syntax errors. Using built in functions and modules in math module. Control
statements - Selection structure - if-else, if-elif-else. Iteration structure - for, while. Testing the
control statements. Lazy evaluation.
Module 2 (Functions and Python Data Structures)

Functions - Hiding redundancy and complexity, Arguments and return values, Variable scopes
and parameter passing, Named arguments, Main function, Working with recursion, Lambda
functions. Strings - String function. Lists - Basic list Operations and functions, List of lists,
Slicing, Searching and sorting list, List comprehension. Work with tuples. Sets. Dictionaries -
Dictionary functions, dictionary literals, adding and removing keys, accessing and replacing
values, traversing dictionaries, reverse lookup.
Module 3 (Object Oriented Programming)

Design with classes - Objects and Classes, Methods, Instance Variables, Constructor, Accessors
and Mutators. Structuring classes with Inheritance and Polymorphism. Abstract Classes.
Exceptions - Handle a single exception, Handle multiple exceptions.
Module 4 (Visualization and File handling)

Plotting - An Interactive Session with PyPlot, Basic Plotting, Logarithmic Plots, More Advanced
Graphical Output, Plots with multiple axes, Mathematics and Greek symbols, The Structure of
matplotlib, Contour and Vector Field Plots. File Processing - The os and sys modules,
Introduction to file I/O, Reading and writing text files, Working with CSV files.
Module 5 (Scientific Computing)

Numerical Routines. SciPy and NumPy - Basics, Creating arrays, Arithmetic, Slicing, Matrix
Operations, Special Functions, Random Numbers, Linear Algebra, Solving Nonlinear Equations,
Numerical Integration, Solving ODEs. Data Manipulation and Analysis – Pandas : Reading Data
from Files Using Pandas, Data Structures: Series and DataFrame, Extracting Information from a
DataFrame, Grouping and Aggregation.
Text Books:
1. Kenneth A Lambert., Fundamentals of Python : First Programs, 2/e, Cengage Publishing, 2016
2. David J. Pine, Introduction to Python for Science and Engineering, CRC Press, 2021
Reference Books:
2. Allen B. Downey, Think Python: How to Think Like a Computer Scientist, 2/e, Schroff, 2016
4. David M.Baezly, Python Essential Reference. Addison-Wesley Professional; 4/e, 2009.
6. http://swcarpentry.github.io/python-novice-gapminder/
1. What is type conversion? How is it done in Python?

1. Given is a list of of words, wordlist, and a string, name. Write a Python function which
takes wordlist and name as input and returns a tuple. The first element of the output
tuple is the number of words in the wordlist which have name as a substring in it. The
second element of the tuple is a list showing the index at which the name occurs in each
of the words of the wordlist and a 0 if it doesn’t occur.

1. Write a Python program to implement the addition, subtraction, and multiplication of
complex numbers using classes. Use constructors to create objects. The input to the
program consist of real and imaginary parts of the complex numbers.

1. Plot the function y = 3x2 for −1 ≤ x ≤ 3 as a continuous line. Include enough points so
that the curve you plot appears smooth. Label the axes x and y

1. Given a file “auto.csv” of automobile data with the fields index, company, body-style,
wheel-base, length, engine-type, num-of-cylinders, horsepower, average-mileage, and
price, write python code to
i. Clean and Update the CSV file
ii. Print total cars of all companies
iii. Find the average mileage of all companies
iv. Find the highest priced car of all companies.

QP CODE: PAGES:
Reg No:_______________
Name:_________________

Course Code: CST445
Course name : PYTHON FOR ENGINEERS
PART-A
1. Explain the basic data types available in Python, with examples.

Write a Python program to reverse a number and also find the sum of digits of the number.
2.
Prompt the user for input.
3. Compare tuples, lists, and dictionaries.
4.
7. Describe the characteristics of the CSV format.
Plot the function y = 3x2 for −1 ≤ x ≤ 3 as a continuous line. Include enough points so that
8.
the curve you plot appears smooth. Label the axes x and y
9. Describe random number generation using Python
10. How can a generalized eigen value problem can be solved using Python?
PART-B
Module -1
11. (a) Compare and contrast interpreted languages and compiled languages. (6)
How does it affect the quality of program development and execution of
the program?
OR
12. (a) Describe Arithmetic operators, Assignment operators, Comparison (6)
operators, Logical operators, and Bitwise operators in detail with examples.
(b) Input 4 integers (+ve and −ve). Write a Python code to find the sum of (8)
negative numbers, positive numbers, and print them. Also, find the averages
of these two groups of numbers and print
Module -2
13. (a) Write a Python code to create a function called list_of_frequency that takes a (5)
string and prints the letters in non-increasing order of the frequency of their
occurrences. Use dictionaries.
should be written to sort the list wherein the name of the list is passed as the
parameter.
OR
14. (a) Illustrate the following Set methods with an example. (8)
discard( )
user.

Module -3
OR
16. (a) Write a Python class named Circle constructed by a radius and two methods (6)
which will compute the area and the perimeter of a given circle
(b) Define a class in Python to store the details of a ship (name, (8)
source,destination) with the following methods:
i) get_details( ) - to assign values to class attributes
ii) print_details( ) - to display the attribute values
Create an object of the class and invoke the methods
Module -4
17. (a) Plot the functions sin x and cos x vs x on the same plot with x going from −π (10)
to π. Make sure the limits of the x-axis do not extend beyond the limits of
the data. Plot sin x in the color orange and cos x in the color green and
include a legend to label the two curves. Place the legend within the plot,
but such that it does not cover either of the sine or cosine traces. Draw thin
gray lines behind the curves, one horizontal at y = 0 and the other vertical at
x = 0.
(b) Explain semi-log plots and log-log plots along with the functions used in (4)
creating such plots.
OR
18. (a) Explain how matplotlib can be used to create dimensional contour plots and (6)
vector field plots.
Module -5
19. (a) Write python program to solve the following system of equations (4)
x1 − 2x2 + 9x3 + 13x4 = 1
−5x1 + x2 + 6x3 − 7x4 = −3
4x1 + 8x2 − 4x3 − 2x4 = −2
8x1 + 5x2 − 7x3 + x4 = 5
bar chart
Calculate total sale data for last year for each product and show it using a
Pie chart.
OR
20. (a) Write Python program to write the data given below to a CSV file. (9)
(b) Explain how integration is performed with SciPy. Illustrate the same with (5)
the two sample integrals using SciPy function.
Teaching Plan
Number of
Sl
Contents Hours (35
No
Hrs)
Module 1: Basics of Python (8 hours)
Getting Started with Python Programming: Running code in the interactive
1.1 1 hour
shell Editing, Saving, and Running a script
1.2 Using editors: IDLE, Jupyter 1 hour
Basic coding skills: Working with data types, Numeric data types and
1.3 Character sets, Keywords, Variables and Assignment statement, Operators, 1 hour
Expressions,
Working with numeric data, Type conversions, Comments in the program,
1.4 1 hour
Input Processing, and Output. Formatting output
How Python works. Detecting and correcting syntax errors. Using built in
1.5 1 hour
functions and modules in math module.
1.6 Control statements : Selection structure, if-else, if elifelse 1 hour
1.7 Iteration structure - for, while 1 hour
1.8 Testing the control statements, Lazy evaluation. 1 hour
Module 2: Functions and Python Data Structures (8 hours)
2.1 Functions: Hiding redundancy and complexity, Arguments and return values 1 hour
2.2 Variable scopes and parameter passing 1 hour
2.3 Named arguments, Main function, 1 hour
2.4 Working with recursion, Lambda functions 1 hour
2.5 Strings - String function 1 hour
Lists - Basic list Operations and functions, List of lists, Slicing, Searching
2.6 1 hour
and sorting list, List comprehension.
2.7 Work with tuples. Sets. 1 hour
Dictionaries - Dictionary functions, dictionary literals, adding and removing
2.8 1 hour
keys, Accessing and replacing values, traversing dictionaries, reverse lookup
3.2 Constructor, Accessors, and Mutators 1 hour
3.6 Exceptions: Handle a single exception, Handle multiple exception 1 hour
Module 4: Visualization and File handling (6 hours)
4.1 Plotting - An Interactive Session with PyPlot, Basic Plotting, 1 hour

4.2 Logarithmic Plots, More Advanced Graphical Output 1 hour
4.3 Plots with multiple axes, Mathematics and Greek symbols 1 hour
4.4 The Structure of matplotlib, Contour and Vector Field Plots 1 hour
File Processing -The os and sys modules, Introduction to file I/O, Reading
4.5 1 hour
and writing text files
Module 5: Scientific Computing (7 hours)

Numerical Routines: SciPy and NumPy - Basics, Creating arrays,
5.1 1 hour
Arithmetic, Slicing
5.2 Matrix Operations, Special Functions, Random Numbers 1 hour
5.3 Linear Algebra, Solving Nonlinear Equations 1 hour
5.4 Numerical Integration, Solving ODEs 1 hour
Data Manipulation and Analysis: Pandas - Reading Data from Files Using
5.5 1 hour
Pandas
5.6 Data Structures - Series and DataFrame 1 hour
5.7 Extracting Information from a DataFrame, Grouping and Aggregation 1 hour
YEAR OF
OBJECT ORIENTED CATEGORY L T P CREDIT
CST455 INTRODUCTION
CONCEPTS
OEC 2 1 0 3 2019
Preamble: The purpose of this course is to enable learners to solve problems by breaking it down
to object level while designing software and to implement it using Java. This course covers Object
Oriented Principles, Object Oriented Programming in Java, Exception handling, Event handling,
multithreaded programming and working with window-based graphics. This course provides
learners the basics to develop Mobile applications, Enterprise Applications, Scientific
Applications and Web based Applications.
Prerequisite: A sound background in any of the programming languages like C, C++, Python etc
is mandatory. Students who completed the minor stream course CST 281 Object Oriented
Programming are not allowed to choose this Open Elective Course.
Develop Java programs using the object-oriented concepts - classes, objects,

Level: Apply)
Utilise data types, operators, control statements, built in packages & interfaces,
CO2 Input/Output Streams and Files in Java to develop programs (Cognitive Knowledge
Level: Apply)
CO3
mechanism (Cognitive Knowledge Level: Apply)
Develop application programs in Java using multithreading (Cognitive Knowledge

CO4
Level: Apply)
Develop Graphical User Interface based application programs by utilising event

CO5
1 0 2
CO1
CO2
CO3
CO4
CO5

Assessment Pattern

Category Examination Marks
Test 1 (%) Test 2 (%) (%)
Remember 20 20 20
Understand 40 40 40
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3

Attendance 10 marks

answer any5.

Syllabus
Module – 1 (Object Orientation and Java basics)
Object Orientation Principles – Object and Class, Data abstraction and Encapsulation,
Inheritance, Polymorphism, Dynamic binding, Message communication, Benefits of using
Object orientation.
Module – 2 (Core Java Fundamentals)

Objects as Parameters, Returning Objects, Recursion, Access Control, Static Members,
Command-Line Arguments, Variable Length Arguments.
Module - 3 (More features of Java)

Constructors, Method Overriding, the Object class, Abstract Classes and Methods, Using final
with Inheritance.

Module - 4 (Advanced features of Java)

Reading and Writing Files.
Character Extraction, String Comparison, Searching Strings, Modifying Strings, Using
valueOf(), Comparison of String Buffer and String.
Module - 5 (GUI Programming, Event Handling and Multithreaded Programming)

Creating Multiple Threads, Suspending, Resuming and Stopping Threads.
Event Handling - Event Handling Mechanisms, Delegation Event Model, Event Classes, Sources
Swing Fundamentals - Swing Key Features, Model View Controller (MVC), Swing Controls,
Components and Containers, Exploring Swing - JFrame, JLabel, JButton, JTextField.
Text Books
Reference Books
1. Paul Deitel, Harvey Deitel, Java How to Program, Early Objects 11/e, Pearson, 2018.

1. Three types of employees work in an organization: Regular, Contract and Hourly.
Regular employees are permanent workers of the organization. Their salary is computed
as the sum of basic pay, DA (50% of basic pay) and HRA. Contract employees work for
the organization only for the contract period and earn a fixed salary. Hourly employees
work for a fixed number of hours each day. Their salary is computed based on the total
number of hours worked.
Using object oriented principles, write a Java program to prepare pay roll of the
organization.
2. Write a java program to create an abstract class named Shape that contains two integers
and an empty method named printArea(). Provide three classes named Rectangle, Square,
Triangle and Circle with proper class hierarchy. Each one of the classes contain only the
method printArea( ) that prints the area of the given shape.

1. Write a Java program that reads a file and displays the file on the screen, with a line
number before each line.
2. Write a Java program to prepare the rank list of computer science students based on
their performance in the first Semester B.Tech. Degree examination at APJ Abdul
Kalam Technological University. The output should be stored in a file.

1. Write a program to demonstrate the use of throws clause to handle an exception occurred
within a method.
2. Write a program to demonstrate how exception handling is supported in Java.

1. Write a program to compute the sum of elements in an array using two threads in a parallel
way. The first thread sums up the first half of the array and the second thread sums up the
second half of the array. Finally, the main thread adds these partial sums and prints the
result.
2. Write a java program that implements a multi-thread application that has three threads.
First thread generates random integer every 1 second and ifthe value is even, second
thread computes the square of the number and prints. If the value is odd, the third thread
will print the value of cube of the number.

1. Write a GUI based program to convert temperature from degree Celsius to Fahrenheit.
2. Write a java program that simulates a traffic light. The program lets the user select one of
three lights: red, yellow, or green with buttons. On selecting a button, an appropriate
message with “stop” or “ready” or “go” should appear above the buttons in a selected
color. Initially there is no message shown.

QP CODE:
Reg No: _______________
Name: _________________ PAGES :4
Course Code: CST455
Course Name: Object Oriented Concepts
PART A
1. Java is considered to be secure and portable. Justify this statement.
2. Describe the concept of dynamic binding.
3. Explain the different arithmetic operators in Java.
4. What does the following Java function compute? Justify your answer.
intgreater(int a, int b)
{
while(a!=b)
{
if(a>b)
a=a-b;
else
b=b-a;
}
return a;
}
5. Explain the use of CLASSPATH with an example.
6. What are the different types of exceptions?
7. Explain file handling features available in Java.
8. Write a simple program to read an integer value from console and print it.
9. Explain the concept of main thread in multi-threading.
10. Explain any two Event classes in Java. (10x3=30)
Part B
11. (a) Describe in detail polymorphism, abstraction and inheritance with suitable (9)
examples.
(b) What is Java Virtual Machine? (5)
OR
12. (a) Explain the salient features of Java language. How does Java Enterprise (9)
Edition (J2EE) differ from Java Standard Edition (Java SE)?
(b) Explain the declaration and use of multi-dimensional array variables in Java, (5)
with example.
13. (a) Explain iteration control statements in Java. Give examples. (8)
(b) Write a recursive program to compute the factorial of a number. (6)
OR
14. (a) Using a suitable Java program, explain the concept of methods and (6)
constructors.
(b) Write a Java program that prompts the user for an integer and then prints out (8)
all the prime numbers up to that number.
15. (a) In a table format, show the effect of access specifiers within and outside (6)
packages in Java.
(b) Describe exception handling using try block and catch clause in Java with the (8)
help of a suitable Java program.
OR
16. (a) What is an interface in Java? Explain with a suitable example. (6)
(b) Write a program that perform integer divisions. The user enters two input data (8)
(any data type) through console into variables Num1 and Num2. If Num1 or
Num2 were not an integer, the program would throw a Number Format
Exception. If Num2 were Zero, the program would throw an Arithmetic
Exception. Display the appropriate exception or result.
17. (a) Write a Java program that displays the number of characters, lines and words (8)
in a text file.
(b) Explain any three String constructors with the help of sample code for each. (6)
OR
18. (a) Write a program to demonstrate the usage of the PrintWriter class. (7)
(b) Write a Java program for sorting a given list of names in ascending order. (7)
19. (a) Explain Delegation Event model for event handling in Java. (7)
(b) Write a program to compute the sum of elements in an array using two (7)
threads in a parallel way. The first thread sums up the first half of the array
and the second thread sums up the second half of the array. Finally, the main
thread adds these partial sums and prints the result.Use Runnable interfacefor
the creation of a thread.
OR
20. (a) What are the differences between a process and a thread? (4)
(b) Write a Graphical User Interface (GUI) based Java program to implement a (10)
simple calculator supporting the operations addition, subtraction,
multiplication and division. Use Swing controls to implement GUI. There
may be three text boxes, the first two for accepting the operands and the last
for displaying the result. Add four buttons for the above operations. Write
neat comments in your program to show how you handle events.
Teaching Plan
No. of
Lecture
No Contents Hours
(36hrs)
Module – 1 (Object Orientation and Java basics) (7 hrs)
Object Orientation Principles – Object and Class, Data abstraction and

1.1 1 hour
Encapsulation
1.2 Inheritance, Polymorphism 1 hour
Dynamic binding, Message communication, Benefits of using Object

1.3 1 hour
orientation.
1.4 Development Platforms -Standard, Enterprise. JVM, Java compiler, 1 hour
Bytecode
Java applet, Java Buzzwords, Java program structure, Comments, Garbage

1.5 1 hour
Collection, Lexical Issues
1.6 Primitive Data types - Integers, Floating Point Types, Characters, Boolean 1 hour
1.7 Literals, Type Conversion and Casting, Variables, Arrays, Strings, Vector 1 hour
class.
Module - 2 (Core Java Fundamentals) (7 hrs)

Operators - Arithmetic Operators, Bitwise Operators, Relational
Control Statements - Selection Statements, Iteration Statements and Jump

2.2 1 hour
Statements.
Object Oriented Programming in Java - Class Fundamentals,
2.3 1 hour
Declaring Objects
2.4 Object Reference, Introduction to Methods, Constructors, this Keyword 1 hour
2.5 Method Overloading, Using Objects as Parameters, Returning Objects 1 hour
2.6 Recursion, Access Control, static Members 1 hour
2.7 Command-Line Arguments, Variable Length Arguments 1 hour
Module - 3 (More features of Java) (8 hrs)

3.1 Inheritance - Super class, Sub class, the keyword super, protected Members 1 hour
3.2 Calling Order of Constructors, Method Overriding, the Object class 1 hour
Packages and Interfaces - Defining Package, CLASSPATH, Access

3.4 1 hour
Protection
3.5 Importing Packages, Interfaces 1 hour
Exception Handling - Checked Exceptions, Unchecked Exceptions, try

3.6 1 hour
Block and catch Clause
Module - 4 (Advanced features of Java) (6 hrs)

4.1 Input/Output - I/O Basics, Reading Console Input 1 hour
4.2 Writing Console Output, PrintWriter Class 1 hour
4.3 Working with Files (Lecture-1) 1 hour

4.4 Working with Files (Lecture-2) 1 hour
4.5 Java Library - String Handling – String Constructors, String Length 1 hour
Special String Operations - Character Extraction, String Comparison,

4.6 Searching Strings, Modifying Strings, Using valueOf( ), Comparison of 1 hour
StringBuffer and String.
Module - 5 (GUI Programming, Event Handling and Multithreaded
Programming) ( 8hrs)
Multithreaded Programming - The Java Thread Model, The Main Thread,

5.1 1 hour
Creating Thread
5.2 Creating Multiple Threads 1 hour
5.3 Suspending, Resuming and Stopping Threads. 1 hour

Event handling - Event Handling Mechanisms, Delegation Event
5.4 1 hour
Model
5.5 Event Classes,Sources of Events, Event Listener Interfaces 1 hour
5.6 Using the Delegation Model, Swing fundamentals, Swing Key Features 1 hour
Model View Controller (MVC), Swing Controls, Components and

5.7 1 hour
Containers
5.8 Exploring Swing –JFrame, JLabel, JButton, JTextField 1 hour

SEMESTER VII
MINOR
YEAR OF
INTRODUCTION
CSD481 MINI PROJECT
PWS 0 0 3 4 2019
Preamble: The objective of this course is to apply the fundamental concepts of different courses
learned in respective Minor Streams: Software Engineering, Machine Learning and Networking.
This course helps the learners to get an exposure to the development of application
software/hardware solutions/ software simulations in the field of Computer Science and
Engineering. It enables the learners to understand the different steps to be followed such as
literature review and problem identification, preparation of requirement specification &design
document, testing, development and deployment. Mini project enables the students to boost their
skills, widen the horizon of thinking and their ability to resolve real life problems.
Prerequisite:
A sound knowledge in courses studied in respective minor stream.
CO# CO
Identify technically and economically feasible problems (Cognitive
CO1 Knowledge Level: Apply)
CO2 solutions. (Cognitive Knowledge Level: Apply)
CO3 adaptable & reusable solutions of minimal complexity by using modern tools
& advanced programming techniques (Cognitive Knowledge Level: Apply)
Prepare technical report and deliver presentation (Cognitive Knowledge
CO4 Level: Apply)
Apply engineering and management principles to achieve the goal of the
CO5 project (Cognitive Knowledge Level: Apply)

CO1
CO2
CO3
CO4
CO5
PO# Broad PO# Broad

PO PO

solutions
complex problems
Assessment Pattern
Mark Distribution
Total CIE ESE Marks

Marks Marks
150 75 75

Attendance 10 marks
Faculty Advisor/Project Coordinator/Guide. Review the literature and gather information
pertaining to the chosen topic. State the objectives and develop a methodology to achieve the
objectives. Carryout the design/fabrication or develop codes/programs to achieve the objectives
by strictly following steps specified in the teaching plan. Innovative design concepts,
performance, scalability, reliability considerations, aesthetics/ergonomic, user experience and
security aspects taken care of in the project shall be given due weight.
committee may be constituted by a senior faculty member, Mini Project coordinator and project
guide. The internal evaluation shall be made based on the progress/outcome of the project,
reports and a viva-voce examination, conducted internally by a 3-member committee. A project
report is required at the end of the semester. The project has to be demonstrated for its full design
specifications.

Demo : 20 marks
Viva : 25 marks.
Total : 75 marks.
TEACHING PLAN

etc.
3. Create Requirements Specification
4. Create Design Document . This may include designs like,
c. GUI Design
d. API Design
e. Database Design
f. Technology Stack
5. Deployment, Test Run & Get Results

proper names/headings. Write figure title under the figure and table title above the table.

i. Top Cover
ii. Title page
iv. Acknowledgement
v. Abstract
viii. Chapters
SEMESTER VII
HONOURS
YEAR OF
CST495 CYBER FORENSICS
VAC 3 1 0 4 2019
Preamble: The course on Cyber Forensics aims at exploring the basics of Cyber Forensics and Cyber
security, the forensic investigation process and principles and the different types of cybercrimes and
threats. This course also focuses on the forensic analysis of File systems, the Network, the Windows
and Linux Operating systems. The course gives a basic understanding of the forensics analysis tools
and a deep understanding of Anti forensics practices and methods. All the above aspects are dealt with
case studies of the respective areas.
Prerequisite: Knowledge in File Systems, Operating systems, Networks and a general awareness on
Cyber Technologies.
Explain thebasic concepts in Cyber Forensics, Forensics Investigation Process and

CO1 Cyber security(Cognitive Knowledge Level: Understand)
Infer the basic concepts of File Systems and its associated attribute definitions
Utilize the methodologies used in data analysis and memory analysis for detection of
CO3 artefacts(Cognitive Knowledge Level: Apply)
Identify web attacks and detect artefacts using OWASP and penetration testing.
Summarize anti-forensics practices and data hiding methods (Cognitive Knowledge

CO5 Level: Understand)
CO1
CO2
CO3
CO4
CO5

problems

Assessment Pattern

End Semester
Bloom’s Category
Examination Marks
Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3 hours

First Internal Examination shall be preferably conducted after completing the first half of the syllabus
and the Second Internal Examination shall be preferably conducted after completing remaining part of
the syllabus.
from the completed modules and 1 question from the partly covered module), having 3 marks for each
the partly covered module), each with 7 marks. Out of the 7 questions in Part B, a student should
answer any 5.
Syllabus
Module-1(Cyber Forensics and Cyber Security)
Computer Forensics: History of computer forensics, preparing for computer investigations,
understanding Public and private investigations- Forensics Investigation Principles - Forensic
Protocol for Evidence Acquisition - Digital Forensics -Standards and Guidelines - Digital Evidence –
Data Acquisition - storage formats for digital evidence, determining the best acquisition method,
contingency planning for image acquisitions, Cyber Forensics tools- Challenges in Cyber Forensics,
Skills Required to Become a Cyber Forensic Expert
Cyber Security: Cybercrimes, Types of Cybercrimes - Recent Data Breaches - Recent Cyber security
Trends - Case Study: Sim Swapping Fraud, ATM Card Cloning, Hacking email for money, Google
Nest Guard, Email Crimes, Phishing, Types of Phishing.
Module-2 (File System Forensics)
File system Analysis: FAT and NTFS concepts and analysis -File system category, Content category,
Metadata category, File name category, Application category,Application-level search techniques,
Specific file systems, File recovery, Consistency check. FAT data structure-Boot sector, FAT 32 FS
info, directory entries, Long file name directory entries
Module-3 (Operating System Forensics)

Windows Forensics: Live Response- Data Collection- Locard’s Exchange Principle, Order of
Volatility Volatile and Non Volatile Data Live-Response Methodologies: Data Analysis- Agile
Analysis, Windows Memory Analysis, Rootkits and Rootkit detection.
Linux Forensics: Live Response Data Collection- Prepare the Target Media, Format the Drive, Gather
Volatile Information, Acquiring the Image, Initial Triage, Data Analysis- Log Analysis, Keyword
Searches, User Activity, Network Connections, Running Processes, Open File Handlers, The Hacking
Top Ten, Reconnaissance Tools
Module-4 (Network Forensics)
The OSI Model, Forensic Footprints, Seizure of Networking Devices, Network Forensic Artifacts,
ICMP Attacks, Drive-By Downloads, Network Forensic Analysis Tools, Case Study: Wireshark. Web
Attack Forensics: OWASP Top 10, Web Attack Tests, Penetration Testing.
Module-5 (Anti-Forensics)
Anti-forensic Practices - Data Wiping and Shredding- Data Remanence,

Degaussing, Case Study: USB Oblivion, Eraser - Trail Obfuscation: Spoofing, Data Modification,
Case Study: Timestamp – Encryption, Case Study: VeraCrypt, Data Hiding: Steganography and
Cryptography, Case Study: SilentEye, Anti-forensics Detection Techniques, Case Study: Stegdetect
Text Books
1. Bill Nelson, Amelia Phillips and Christopher Steuart, Computer forensics - Guide to Computer
Forensics and Investigations, 4/e, Course Technology Inc.
2. Brian Carrier, File System Forensic Analysis, Addison Wesley, 2005.
3. Harlan Carvey, Windows Forensic Analysis DVD Toolkit, 2/e, Syngress.
4. Cory Altheide, Todd Haverkos, Chris Pogue,Unix and Linux Forensic Analysis DVD Toolkit,
1/e, Syngress.
5. William Stallings,Network Security Essentials Applications and Standards, 4/e, Prentice Hall
6. Eric Maiwald, Fundamentals of Network Security, McGraw-Hill, 2004.
References
1. Michael. E. Whitman, Herbert. J. Mattord, Principles of Information Security, Course

Technology, 2011.
2. William Stallings, Cryptography and Network Security Principles and Practice, 4/e, Prentice
Hall.
3. Niranjan Reddy, Practical Cyber Forensics: An Incident-Based Approach to Forensic
Investigations, Apress, 2019.
CourseOutcome1(CO1):Explain the Forensics principles and protocols for evidence acquisition.
Discuss the different cyber forensics tools used for image acquisition.
CourseOutcome2(CO2):Explain the pros and cons of NTFS and FAT File systems. Also give the
challenges the investigators would face in extracting evidences from these file systems.
CourseOutcome3 (CO3): Apply any memory forensics methodologies/tools to extract volatile and
nonvolatile data from a Windows based system.
CourseOutcome4 (CO4):Use web attacks test tools like netcraft to identify web application
vulnerabilities of a particular site say www.xyz.com
Course Outcome 5 (CO5): Explain the different anti-forensics practices used to destroy or conceal
data in order to prevent others from accessing it.
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 3
Course Code: CST495
Course Name: Cyber Forensics
PART A
1. Distinguish between public and private investigations.

2. What are the three computer forensics data acquisitions formats?
3. List any three features of NTFS which are not in FAT.
4. Define the terms file slack, RAM slack and drive slack.
5. What is Locard's exchange principle? Why is it important in forensic

investigations?
6. Why would you conduct a live response on a running system?
7. What are the different tools used in Network Forensics?
8. Explain how Risk Analysis and Penetration Testing are different.
9. Why we are using Steganography?
10. How is data wiping done in hard drive?

(10x3=30)
Part B
11. (a) Discuss the different types of Cybercrimes. List the tools used for (8)
identifying Cyber Crimes.
(b) Differentiate between Static acquisition and Live acquisition with example. (6)
OR
12. (a) Explain the principles of Digital Forensic Investigation? Why is it (8)
important? Comment.
(b) When you perform an acquisition at a remote location, what should you (6)
consider preparing this task?
13. (a) Discuss the FAT File Structure. (8)
(b) Does Windows NT use FAT or NTFS? Explain. (6)

14. (a) What is Metadata? Discuss the first 16 metadata records you would find in (6)
the MFT?
(b) Explain the different data categories in a File System. (8)
15. (a) What is Agile requirement analysis? (6)
(b) Explain the different types of volatile information in a live response system. (8)
List any two tools used for obtaining volatile information.
16. (a) What are the main live response methodologies? (6)
(b) What is Physical Memory Dump? Explain how a physical memory dump is (8)
analysed.
17. (a) What is OWASP? Also mention the Top 10 web application vulnerabilities (8)
in 2021.
(b) How would you setup Wireshark to monitor packets passing through (6)
aninternet router?
18. (a) What are the goals of conducting a pentesting exercise? (3)
(b) Discuss the types of penetration testing methodologies. (5)
(c) Define OSI Layers. (6)
19. (a) How is Steganography done? (7)
(b) Why does data need Cryptography? (4)
(c) What is the difference between a Cryptographer and a Crypter? (3)

OR
20. (a) Explain the different types of Anti-forensics Detection Techniques. (8)
(b) What is Spoofing? How to prevent spoofing attack? (6)
TEACHING PLAN
No of
Sl.No. Contents Lecture Hrs
(44hrs)
Module-1 (Cyber Forensics and Cyber Security) (11 Hrs)
1.1 History of computer forensics, preparing for computer investigations 1 hour
Understanding Public and private investigations- Forensics

1.2 1 hour
Investigation Principles
1.3 Forensic Protocol for Evidence Acquisition 1 hour
1.4 Digital Forensics -Standards and Guidelines - Digital Evidence 1 hour
Data Acquisition - storage formats for digital evidence, determining
1.5 1 hour
the best acquisition method
1.6 Contingency planning for image acquisitions, Cyber Forensics tools 1 hour
Challenges in Cyber Forensics, Skills Required to Become a Cyber

1.7 1 hour
Forensic Expert
Cybercrimes, Types of Cybercrimes - Recent Data Breaches - Recent

1.8 1 hour
Cyber security Trends
1.9 Case Study: Sim Swapping Fraud, ATM Card Cloning 1 hour
1.10 Case Study:Hacking email for money, Google Nest Guard 1 hour
1.11 Email Crimes, Phishing, Types of Phishing 1 hour
Module-2 (File System Forensics) (9 Hrs)

2.1 FAT and NTFS concepts and analysis 1 hour
2.2 File system category, Content category 1 hour
2.3 Metadata category 1 hour
2.4 File name category,Application category 1 hour
2.5 Application-level search techniques 1 hour
2.6 Specific file systems, File recovery, Consistency check 1 hour
2.7 FAT data structure-Boot sector 1 hour
2.8 FAT 32 FS info, directory entries 1 hour
2.9 Long file name directory entries 1 hour
Module-3 (Operating System Forensics) (11 Hrs)
3.1 Live Response- Data Collection- Locard’s Exchange Principle 1 hour
3.2 Order of Volatility, Volatile and Non Volatile Data 1 hour
3.3 Live-Response Methodologies: Data Analysis- Agile Analysis 1 hour
3.4 Windows Memory Analysis 1 hour
3.5 Rootkits and Rootkit detection 1 hour
3.6 Linux Forensics: Live Response Data Collection 1 hour
Prepare the Target Media, Format the Drive, Gather Volatile

3.7 1 hour
Information
3.8 Acquiring the Image, Initial Triage 1 hour
3.9 Data Analysis- Log Analysis, Keyword Searches, User Activity 1 hour
Data Analysis- Network Connections, Running Processes, Open File

3.10 1 hour
Handlers
3.11 The Hacking Top Ten, Reconnaissance Tools 1 hour
Module-4 (Network Forensics) ( 7 Hrs)
4.1 OSI Model 1 hour
Forensic Footprints, Seizure of Networking Devices, Network

4.2 1 hour
Forensic Artifacts
ICMP Attacks, Drive-By Downloads, Network Forensic Analysis
4.3 1 hour
Tools
4.4 Web Attack Forensics 1 hour
4.5 OWASP Top 10, Web Attack Tests 1 hour
4.6 Penetration Testing-1 1 hour
4.7 Penetration Testing.-2 1 hour
Module – 5 (Anti-Forensics) (6 Hrs)
5.1 Anti-forensic Practices - Data Wiping and Shredding 1 hour
5.2 Data Remanence, Degaussing 1 hour
5.3 Trail Obfuscation: Spoofing, Data Modification 1 hour
5.4 Role of Encryption in Forensics 1 hour
5.5 Data Hiding: Steganography and Cryptography 1 hour
5.6 Anti-forensics Detection Techniques 1 hour

YEAR OF
REINFORCEMENT INTRODUCTION
CST497
LEARNING
VAC 3 1 0 4 2019
Preamble: This course covers fundamental principles and techniques in reinforcement learning.
Reinforcement learning is concerned with building programs that learn how to predict and act in a
stochastic environment, based on past experience. Applications of reinforcement learning range
from classical control problems, such as power plant optimization or dynamical system control, to
game playing, inventory control, and many other fields. Topics include Markov decision process,
dynamic programming, Monte Carlo, temporal difference, function approximation reinforcement
learning algorithms, and applications of reinforcement learning. This course enables the leaners to
apply reinforcement learning on real world applications and research problems.
Prerequisite: A pass in CST 294(Computational Fundamentals for Machine Learning)
CO 1 Solve computational problems using probability and random variables. (Cognitive

CO 2 Apply policy iteration and value iteration reinforcement learning algorithms.
CO 3 Employ Monte Carlo reinforcement learning algorithms. (Cognitive Knowledge
Level: Apply)
CO 4 Apply temporal-difference reinforcement learning algorithms.(Cognitive Knowledge
Level: Apply)
CO 5 Apply on-policy and off-policy reinforcement learning algorithms with function
approximation. (Cognitive Knowledge Level: Apply)
PO PO PO 3 PO 4 PO PO 6 PO PO PO PO PO 11 PO
1 2 5 7 8 9 10 12
CO 1
CO 2
CO 3
CO 4
CO 5


problems
Assessment Pattern

1 2 Examination
Remember
30% 30% 30%
Understand
30% 30% 30%
Apply
40% 40% 40%
Analyse
Evaluate
Create
Mark Distribution
150 50 100 3 hours

End Semester Examination Pattern:There will be two parts; Part A and Part B. Part A contain
should answer all questions. Part B contains 2 questions from each module of which student
should answer anyone. Each question can have maximum 2 sub-divisions and carry 14 marks.
Syllabus
Module 1 (Review Of Probability Concepts)
Probability concepts review - Axioms of probability, concepts of random variables, probability

mass function, probability density function, cumulative density functions, Expectation.
Concepts of joint and multiple random variables, joint, conditional and marginal distributions.
Correlation and independence.
Module 2 (Markov Decision Process)

Introduction to Reinforcement Learning(RL) terminology - Examples of RL, Elements of RL,
Limitations and Scope of RL.
Finite Markov Decision Processes - The Agent–Environment Interface, Goals and Rewards,
Returns and Episodes, Policies and Value Functions, Optimal Policies and Optimal Value
Functions.
Module 3 (Prediction And Control)

Dynamic Programming - Policy Evaluation (Prediction), Policy Improvement, Policy
Iteration, Value Iteration.
Monte Carlo (MC) for model free prediction and control - Monte Carlo Prediction, Monte
Carlo Estimation of Action Values, Monte Carlo Control, Monte Carlo Control without
Exploring Starts, Off-policy Prediction via Importance Sampling, Incremental Implementation,
Off-policy Monte Carlo Control.
Module 4 (Temporal-Difference (TD) Methods For Model Free Prediction And Control)
TD Methods - TD Prediction, Advantages of TD Prediction Methods, Optimality of TD(0),
Sarsa: On-policy TD Control, Q-learning: Off-policy TD Control, Expected Sarsa.
n-step Bootstrapping- n-step TD Prediction, n-step Sarsa, step Off-policy Learning, Off-policy
Learning Without Importance Sampling: The n-step Tree Backup Algorithm.
Module 5 (Function Approximation Method)

On-policy Prediction with Approximation - Value-function Approximation, The Prediction
Objective, Stochastic-gradient Methods, Linear Methods.
Eligibility Traces - The λ-return, TD(λ), n-step Truncated λ-return Methods, Sarsa(λ).
Policy Gradient Methods - Policy Approximation and its Advantages, The Policy Gradient
Theorem, REINFORCE: Monte Carlo Policy Gradient, REINFORCE with Baseline, Actor–
Critic Methods.
Text book:
1 Richard S. Sutton and Andrew G. Barto, Reinforcement Learning: An Introduction, , 2nd
Edition
2 Alberto Leon-Garcia, Probability, Statistics, and Random Processes for Electrical
Engineering, 3rd Edition,
Reference books:
1 Reinforcement Learning: State-of-the-Art, Marco Wiering and Martijn van Otterlo, Eds
2 Algorithms for Reinforcement Learning, Szepesvari (2010), Morgan & Claypool.
3 Artificial Intelligence: A Modern Approach, Stuart J. Russell and Peter Norvig
4 Mathematical Statistics and Data Analysis by John A. Rice,University of California,
Berkeley, Third edition, published by Cengage.
5 Machine Learning: A Probabilistic Perspective, Kevin P. Murphy
1 Let Jand Tbe independent events, where P(J)=0.4and P(T)=0.7. Find P(J∩T), P(J∪T)
and P(J∩T′)
2 Let A and B be events such that P(A)=0.45 , P(B)=0.35 and P(A∪B)=0.5. Find P(A∣B ).
3 A random variable Rhas the probability distribution as shown in the following table:
Given that E(R)=2.85, find a and band P(R>2).

4 A biased coin (with probability of obtaining a head equal to p > 0) is tossed repeatedly
and independently until the first head is observed. Compute the probability that the first
head appears at an even numbered toss.
5 Two players A and B are competing at a quiz game involving a series of questions. On
any individual question, the probabilities that A and B give the correct answer are p and q
respectively, for all questions, with outcomes for different questions being independent.
The game finishes when a player wins by answering a question correctly. Compute the
probability that A wins if
(i) A answers the first question,
(ii) B answers the first question.
6 A coin for which P(heads) = pis tossed until two successive tails are obtained. Find the
probability that the experiment is completed on thenthtoss.
7 An urn contains p black balls, q white balls, and r red balls; and n balls are chosen
without replacement.
i. Find the joint distribution of the numbers of black, white, and red balls in the
sample.
ii. Find the joint distribution of the numbers of black and white balls in the
sample.
iii. Find the marginal distribution of the number of white balls in the sample.
8 Suppose that two components have independent exponentially distributed lifetimes,
T1and T2, with parameters αand β, respectively. Find (a) P( T1> T2)and (b) P( T1> 2
T2).
9 Let Z1 and Z2 be independent random variables each having the standard normal
distribution. Define the random variables X and Y by X = Z1 + 3Z2 and Y = Z1+ Z2.
Argue that the joint distribution of (X, Y) is a bivariate normal distribution. What are the
parameters of this distribution?
10 Given a continuous random variable x, with cumulative distribution function Fx(x),
show that the random variable y = Fx(x) is uniformly distributed.
11 ou roll a fair dice twice. Let the random variable X be the product of the outcomes of the
two rolls. What is the probability mass function of X? What are the expected values and
the standard deviation of X?
12 Show that if two events Aand Bare independent, then Aand B'are independent
13 Prove that Xand Yare independent if and only if fX|Y (x|y) = fX(x)for all xand y
14 A random square has a side length that is a uniform [0, 1] random variable. Find the
expected area of the square.Let X be a continuous random variable with the density
function f (x) = 2x, 0 ≤ x ≤ 1
i. Find E(X).
ii. Find E(X2)and Var(X).
1 What are the main differences between supervised learning and reinforcement learning?
2 Give examples of Markovian and non-Markovian environments?
3 What are the advantages and disadvantages of value methods vs policy methods?
4 Define the optimal state-value function V*(s) for an MDP.
5 Imagine that the rewards are at most 1 everywhere. What is the maximum value that the
discounted return can attain ? Why ?
6 Write down the Bellman optimality equation for state-value functions
7 Suppose that you are in a casino. You have Rs 20 and will play until you lose it all or as
soon as you double your money. You can choose to play two slot machines: 1) slot
machine A costs Rs 10 to play and will return Rs 20 with probability 0.05 and Rs 0
otherwise; and 2) slot machine B costs Rs 20 to play and will return Rs30 with probability
0.01 and Rs 0 otherwise. Until you are done, you will choose to play machine A or
machine B in each turn. Describe the state space, action space, rewards and transition
probabilities. Assume the discount factor γ = 1. Rewards should yield a higher reward
when terminating with Rs 40 than when terminating with Rs 0. Also, the reward for
terminating with Rs 40 should be the same regardless of how we got there (and
equivalently for Rs 0).
1 Explain policy iteration and value iteration? What are their similarities and differences?
2 Why Monte Carlo methods for learning value functions require episodic tasks? How is it
that n-step TD methods avoid this limitation and can work with continuing tasks?
3 List any three uses of the depth parameter in the Monte-Carlo tree search procedure.
4 Given that qπ(s, a) > vπ(s), can we conclude that π is not an optimal policy. Justify
1 Draw the backup diagram for 2-step Sarsa. Write the corresponding learning rule for 2-
step Sarsa.
2 Why is Sarsa an on-policy algorithm while Q-learning is an off-policy algorithm?
3 How would you differentiate between learning algorithms using on-policy from those
that use off-policy?
4 When using Temporal Difference learning, why is it better to learn action values (Q-
values) rather than state values (V-values)?
5 Supose that a Q-learning agent always chooses the action which maximizes the Q-value.
What is one potential problem with that approach?
6 Describe any two ways that will force a Q-learning agent to explore.
7 Why and when do we need importance sampling?
1 How do you deal with a large possible action space in reinforcement learning?
2 List any two benefits of policy gradient methods over value function based methods.
3 What is the relation between Q-learning and policy gradients methods?
4 Consider a five state random walk. There are five states, s1, s2, ..., s5, in a row with two
actions each, left and right. There are two terminal states at each end, with a reward of +1
for terminating on the right, after s5 and a reward of 0 for all other transitions, including
the one terminating on the left after s1. In designing a linear function approximator, what
is the least number of state features required to represent the value of the equi-probable
random policy?
QP Code : Total Pages: 4

Reg No.:_______________ Name:__________________________
SEVENTH SEMESTER B.TECH DEGREE EXAMINATION (HONOURS), MONTH and YEAR
Course Code: CST497
Course Name: REINFORCEMENT LEARNING
PART A
Answer all questions, each carries 3 marks.
1 The first three digits of a telephone number are 452. If all the sequences of the
remaining four digits are equally likely, what is the probability that a randomly
selected telephone number contains seven distinct digits?
2 If X is a discrete uniform random variable, i.e., P(X = k) = 1/n for k = 1, 2, ... ,
n, find E(X)and Var(X).
3 Define the discounted return Gt. Give an expression for Gtin terms of Gt+1.
4 Write down the Bellman expectation equation for state-value functions.
5 Suppose that we are doing value iteration with γ = 0. How many iterations will
it take for value iteration to converge to the optimal value function?
6 List any three advantages of Monte Carlo methods over dynamic programming
techniques?
7 Draw the backup diagram for 2-step Q-learning. Write the corresponding
learning rule for 2-step Q-learning.
8 Why Monte Carlo methods for learning value functions require episodic tasks.
How does n-step TD methods avoid this limitation and can work with
continuing tasks?
9 In using policy gradient methods, if we make use of the average reward
formulation rather than the discounted reward formulation, then is it necessary
to consider, for problems that do not have a unique start state, a designated start
state, s0? Justify.
10 Value function based methods are oriented towards finding deterministic
policies whereas policy search methods are geared towards finding stochastic
policies. True or false? Justify.
10 x 3 = 30
PART B
11 a) Three players play 10 independent rounds of a game, and each player has (7)
probability 1/3 of winning each round. Find the joint distribution of the numbers
of games won by each of the three players.
b) Find the joint density of X + Y and X/Y, where X and Y are independent (7)
exponential random variables with parameter λ. Show that X + Y and X/Yare
independent.
OR
12 a) An experiment consists of throwing a fair coin four times. Find the probability (7)
mass function and the cumulative distribution function of the following random
variables:
i the number of heads before the first tail
ii the number of heads following the first tail
iii the number of heads minus the number of tails
iv the number of tails times the number of heads.
b) Let X be a continuous random variable with probability density function on (7)
2 2
0 <= x <= 1 defined by f(x) = 3x . Find the pdf of Y = X .
13 a) What is the difference between a state value function V(s) and a state-action (4)
value function Q(s,a)?
b) Consider designing a recycling robot whose job is to collect empty bottles (10)
around the building. The robot has a sensor to detect when a bottle is in front of
it, and a gripper to pick up the bottle. It also senses the level of its battery. The
robot can navigate, as well as pick up a bottle and throw a bottle it is holding in
the trash. There is a battery charger in the building, and the robot should not run
out of battery.
i. Describe this problem as an MDP. What are the states and actions?
ii. Suppose that you want the robot to collect as many bottles as possible,
while not running out of battery. Describe what rewards would enable it
to achieve this task.
OR
14 a) Define the state-value function Vπ(s) for a discounted MDP. (5)
b) Consider a 4x4 gridworld where the agent starts in the top left, the bottom righ (10)
state is terminal, rewards are always -1, γ = 1, and state transitions ar
deterministic. Consider the policy that always chooses the action to move down
except when it is on the bottom row, at which point it chooses the action to mov
right. Starting with v0(s) = 0 for all s, compute v1, v2, ... , v7.
15 a) During a single iteration of the Value Iteration algorithm, we typically iterate (5)
over the states in S in some order to update Vt(s) to Vt+1(s) for all states s. Is it
possible to do this iterative process in parallel? Explain why or why not.
b) Consider an undiscounted Markov Reward Process with two states A and B. (9)
The transition matrix and reward function are unknown, but you have observed
two sample episodes:
A +3 --> A +2 --> B -4 --> A +4 --> B -3
B -2 --> A +3 --> B -3
i. Using first-visit Monte-Carlo evaluation, estimate the state-value
function V(A),V(B).
ii. Using every-visit Monte-Carlo evaluation, estimate the state-value
function V(A),V(B).
iii. Draw a diagram of the Markov Reward Process that best explains these
two episodes. Show rewards and transition probabilities on your
diagram.
OR
16 a) Suppose you are given a finite set of transition data. Assuming that the Markov (4)
model that can be formed with the given data is the actual MDP from which the
data is generated, will the value functions calculated by the MC and TD
methods necessarily agree? Justify.
b) With respect to the expected Sarsa algorithm, is exploration required as it is in (5)
the normal Sarsa and Q-learning algorithms? Justify.
c) For a specific MDP, suppose we have a policy that we want to evaluate through (5)
the use of actual experience in the environment alone and using Monte Carlo
methods. We decide to use the first-visit approach along with the technique of
always picking the start state at random from the available set of states. Will this
approach ensure complete evaluation of the action value function corresponding
to the policy?
17 a) Consider the following Q[S,A] table (9)
Assume the discount factor, γ= 0.5, and the step size, α = 0.1. After the
experience (s, a, r, s')=(1, 1, 5, 2), which value of the table gets updated and
what is its new value?
b) What is the difference between Q-learning and Sarsa? (5)
OR
18 a) Consider the following Q[S,A] table (9)
Assume the discount factor, γ= 0.5, and the step size, α = 0.1. After the
experience (s, a, r, s', a')=(1, 1, 5, 2, 1), which value of the table gets updated
and what is its new value?
b) For Q-learning to converge we need to correctly manage the exploration vs. (5)
exploitation tradeoff. What property needs to be hold for the exploration
strategy?
19 a) Given the following sequence of states observed from the beginning of an (8)
episode, s2, s1, s3, s2, s1, s2, s1, s6, what is the eligibility value, e7(s1), of state s1at
time step 7 given trace decay parameter λ, discount rate γ, and initial value,
e0(s1) = 0, when accumulating traces are used? What is the eligibility value if
replacing traces are used?
b) Suppose that we are using a policy gradient method to solve a reinforcement (6)
learning problem and the policy returned by the method is not optimal. Give
three plausible reasons for such an outcome?
OR
20 a) Suppose that we have a Q-value function represented as a sigmoid function of a (8)

set of features:
Write down the update rule that Sarsa would give for this function.
b) Suppose that in a particular problem, the agent keeps going back to the same
state in a loop. What is the maximum value that can be taken by the eligibility (6)
trace of such a state if we consider accumulating traces with λ = 0.25 and γ =
0.8?
Teaching Plan
No. of
No Topic Lectures
(42)
Module-1 (Review Of Probability Concepts) TB-2(Ch 2,3,4,5)
(8 hours)
1.1 Axioms of probability, concepts of random variables
1 hour
1.2 Probability mass function 1 hour

1.3 Probability density function 1 hour
1.4 Cumulative density functions 1 hour
1.5. Expectation of random variables 1 hour
1.6. Joint and multiple random variables 1 hour
1.7 Conditional and marginal distributions

1 hour
1.8 Correlation and independence

1 hour
Module-2 (Markov Decision Process) TB-1(Ch 1,3)(8 hours)
2.1. Introduction to Reinforcement Learning(RL) terminology - Examples of RL,

1 hour
Elements of RL, Limitations and Scope of RL
2.2 Finite Markov Decision Processes 1 hour
2.3 The Agent–Environment Interface 1 hour
2.4. Goals and Rewards 1 hour
2.5. Returns and Episodes 1 hour
2.6. Policies and Value Functions 1 hour
2.7 Optimal Policies and Optimal Value Functions 1 hour
2.8 Optimal Policies and Optimal Value Functions 1 hour
Module-3 (Prediction And Control) TB-1(Ch 4,5) (9 hours)

3.1 Policy Evaluation (Prediction) 1 hour
3.2 Policy Improvement 1 hour

3.3 Policy Iteration, Value Iteration 1 hour
3.4 Monte Carlo Prediction 1 hour
3.5 Monte Carlo Estimation of Action Values 1 hour
3.6 Monte Carlo Control, Monte Carlo Control without Exploring Starts 1 hour
3.7 Off-policy Prediction via Importance Sampling 1 hour
3.8 Incremental Implementation 1 hour
3.9 Off-policy Monte Carlo Control 1 hour
Module-4 (Temporal-Difference( Td) Methods) TB-1 (Ch 6,7) (8 hours)
4.1 TD Prediction, Advantages of TD Prediction Methods 1 hour
4.2 Optimality of TD(0) 1 hour
4.3 Sarsa: On-policy TD Control 1 hour
4.4 Q-learning: Off-policy TD Control 1 hour
4.5 Expected Sarsa 1 hour
4.6 n-step TD Prediction, n-step Sarsa 1 hour
4.7 n-step Off-policy Learning 1 hour
4.8 Off-policy Learning Without Importance Sampling: The n-step Tree Backup 1 hour
Algorithm
Module-5 (Function Approximation Method) TB-1 (Ch 9,12,13) (9 hours)
5.1 Value-function Approximation 1 hour
5.2 The Prediction Objective 1 hour
5.3 Stochastic-gradient Methods 1 hour
5.4 Linear Methods 1 hour
5.5 The Lambda-return , TD(Lambda) 1 hour
5.6 n-step Truncated Lambda-return Methods, Sarsa(Lambda) 1 hour
5.7 Policy Approximation and its Advantages 1 hour
5.8 The Policy Gradient Theorem, REINFORCE: Monte Carlo Policy Gradient 1 hour
5.9 REINFORCE with Baseline, Actor–Critic Methods 1 hour
YEAR OF
LOGIC FOR CATEGORY L T P CREDIT
CST499 INTRODUCTION
COMPUTER SCIENCE
VAC 3 1 0 4 2019
Preamble: This course enables the learners to understand the concepts of various logics used in
computer science. The course covers the standard and most popular logics such as propositional
logic, predicate logic, linear temporal logic, computation tree logic, Hoare logic and modal logic.
This course helps the students to develop solutions for specification and verification of real world
systems.
Prerequisite: Nil
CO1 Explain the concepts of Predicate Logic, Propositional Logic, Linear Temporal Logic,
Computation Tree Logic, Hoare Logic and Modal Logic as a formal language.
CO2 Develop proofs to show the satisfiability, validity and equivalence of logic
formulas.(Cognitive Knowledge Level: Apply)
CO3 Illustrate model checking and program verification to prove correctness of

systems.(Cognitive Knowledge Level: Apply)
CO4 Demonstrate Alloy Analyzer to model and analyze software systems. (Cognitive
CO5 Demonstrate New Symbolic Model Verifier (NuSMV) as a model checking tool to check
the validity of temporal logic formulas.(Cognitive Knowledge Level: Apply)

0 2
CO1
CO2
CO3
CO4
CO5
Assessment Pattern

Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3

Attendance 10 marks

answer any 5.
Syllabus
Module – 1 (Propositional Logic)
Declarative Sentences, Natural Deduction, Propositional Logic as a Formal Language, Semantics
of Propositional Logic, Normal Forms, SAT Solvers.
Module– 2(Predicate Logic)
The Need of a Richer Language, Predicate Logic as a Formal Language, Proof Theory of
Predicate Logic, Semantics of Predicate Logic, Undecidability of Predicate Logic,
Expressiveness of Predicate Logic.
Module - 3 (Verification by Model Checking)
Motivation for Verification, Linear Time Temporal Logic (LTL), Model Checking Systems, Tools,
Properties, Branching Time Logic, Computation Tree Logic (CTL) and the Expressive Powers of
LTL and CTL, Model Checking Algorithms, The Fixed Point Characterization of CTL.
Module–4 (Program Verification)

Why Should We Specify and Verify Code, A Framework for Software Verification, Proof
Calculus for Partial Correctness, Proof Calculus for Total Correctness, Programming by
Contract.
Module–5 (Modal Logics and Agents)
Modes of Truth, Basic Modal Logic, Logic Engineering, Natural Deduction, Reasoning about
Knowledge in a Multi-Agent System.
Text Books
1. Michael Huth and Mark Ryan, Logic in Computer Science, 2/e, Cambridge University Press,
2004.
Reference Books
1. Daniel Jackson, Software Abstractions, MIT Press, 2011.
2. Roberto Cavada, Alessandro Cimatti, Gavin Keighren, Emanuele Olivetti, Marco Pistore and
Marco Roveri, NuSMV 2.6 Tutorial (available at https://nusmv.fbk.eu).
3. Tutorial for Alloy Analyzer 4.0 (available at https://alloytools.org/tutorials/online/).
1. Express the following statements as appropriate logic formulas.
a. If the barometer falls, either it will rain or it will snow.
b. No student attended every lecture.
c. Once you are on the field, you keep on playing until the game is over.
d. There are eight planets in the solar system.
2. Explain Horn Clause and Horn Formula.
3. Explain modal logic.
1. Prove the validity of the following sequents.
2. Prove the validity of
3. Prove that for all paths 𝜋𝜋 of all models, 𝜋𝜋 ⊨ 𝜙𝜙 𝑊𝑊 𝜓𝜓 ⋀ 𝐹𝐹 𝜓𝜓 implies 𝜋𝜋 ⊨ 𝜙𝜙 𝑈𝑈 𝜓𝜓.


1. Consider an LTL formula 𝜙𝜙 ≡ (𝑎𝑎 𝑈𝑈 𝑏𝑏) ⟶ 𝐹𝐹 𝑏𝑏. Is 𝜙𝜙 valid? If yes, give an automata-
theoretic proof of validity (i.e., construct a suitable NBA and use nested DFS to check an
appropriate persistence condition). Otherwise, give a transition system that violates the
formula. Illustrate the constructions clearly.
2. A familiar command missing from the core language (described in the text book) is the for-
statement. It may be used to sum the elements in an array, for example, by programming
as follows:
s = 0;
for (i = 0; i <= max; i = i+1) {
s = s + a[i];
}
After performing the initial assignment s = 0, this executes i = 0 first, then executes the
body s = s + a[i] and the incrementation i = i + 1 continually untili<= max becomes false.
Explain how for(C1;B;C2) {C3} can be defined as a derived program in our core language.

1. Use Alloy Analyzer to model and solve the following problem.
A farmer is on one shore of a river and has with him a fox, a chicken, and a sack of grain.
He has a boat that fits one object besides himself. In the presence of the farmer nothing
gets eaten, but if left without the farmer, the fox will eat the chicken, and the chicken will
eat the grain. How can the farmer get all three possessions across the river safely?

1. Simulate the following system using NuSMV..
Verify that 𝐺𝐺 (𝑟𝑟𝑟𝑟𝑟𝑟 ⟶ 𝐹𝐹 𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏) holds in all initial states.


QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
Course Code: CST499
Course Name: Logic for Computer Science
PART A
1. Check the validity of the following sequents.

a. ~p ⟶ ~q ⊢ q ⟶ p
b. ~(~𝑝𝑝 ⋁ 𝑞𝑞 ) ⊢ 𝑝𝑝)
2. For the formula 𝜙𝜙 = 𝑝𝑝 ⋀ ~(𝑞𝑞 ⋁ ~𝑝𝑝), we compute the inductively defined

translation as 𝑇𝑇(𝜙𝜙) = 𝑝𝑝 ˄ ~~(~𝑞𝑞 ˄ ~~𝑝𝑝). Draw the parse tree of 𝑇𝑇(𝜙𝜙).
3. Translate the following into predicate logic.

a. All red things are in the box.
b. No animal is both a cat and a dog.
4. Let 𝜙𝜙 be ∃𝑥𝑥 (𝑃𝑃(𝑦𝑦, 𝑧𝑧) ⋀ (∀𝑦𝑦 (~𝑄𝑄(𝑦𝑦, 𝑥𝑥) ⋁ 𝑃𝑃(𝑦𝑦, 𝑧𝑧)))), where 𝑃𝑃 and 𝑄𝑄 are predicate
symbols with two arguments. Identify all bound and free variables in 𝜙𝜙.
5. Show the syntax of Computation Tree Logic (CTL).
6. Prove that the LTL equivalence between 𝜙𝜙 𝑈𝑈 𝜓𝜓and~ �~𝜓𝜓 𝑈𝑈 (~𝜙𝜙 ⋀ ~𝜓𝜓)� ⋀ 𝐹𝐹𝐹𝐹.
7. Explain the need of specification and verification of code.
8. In what circumstances would 𝑖𝑖𝑖𝑖 (𝐵𝐵){𝐶𝐶1} 𝑒𝑒𝑒𝑒𝑒𝑒𝑒𝑒 {𝐶𝐶2} fail to terminate?

9. Illustrate Kripke model.
10. With an example, explain the equivalences between modal formulas.

(10x3=30)
Part B
11. (a) Give the rules for Natural Deduction in propositional logic. (6)
(b) Use Natural Deduction to show the equivalence of the following formulas. (8)
a. (𝑝𝑝 ⋀ 𝑞𝑞) ⋀ 𝑟𝑟 , 𝑠𝑠 ⋀ 𝑡𝑡 ⊢ 𝑞𝑞 ⋀ 𝑠𝑠
b. (𝑞𝑞 ⟶ 𝑟𝑟) ⟶ ((~𝑞𝑞 ⟶ ~𝑝𝑝) ⟶ (𝑝𝑝 ⟶ 𝑟𝑟))
OR
12. (a) What is a Horn Formula? How do you decide the satisfiability of a Horn (6)
formula.
(b) Check the satisfiability of the following Horn Formulas. (8)

a. (𝑝𝑝 ⋀ 𝑞𝑞⋀𝑠𝑠 ⟶ 𝑝𝑝) ⋀ (𝑞𝑞⋀𝑟𝑟 ⟶ 𝑝𝑝)⋀(𝑝𝑝⋀𝑠𝑠 ⟶ 𝑠𝑠)
b. (𝑇𝑇 ⟶ 𝑞𝑞)⋀(𝑇𝑇 ⟶ 𝑠𝑠)⋀(𝑤𝑤 ⟶⊥)⋀(𝑝𝑝⋀𝑞𝑞⋀𝑠𝑠 ⟶ 𝑣𝑣)⋀(𝑣𝑣 ⟶ 𝑠𝑠)⋀(𝑇𝑇 ⟶
𝑟𝑟)⋀(𝑟𝑟 ⟶ 𝑝𝑝)
13. (a) Use Natural Deduction to prove the following equivalences. (8)
a. ∀𝑥𝑥�𝑄𝑄(𝑥𝑥) → 𝑅𝑅(𝑥𝑥)�, ∃𝑥𝑥(𝑃𝑃(𝑥𝑥)⋀ 𝑄𝑄(𝑥𝑥)) ⊢ ∃𝑥𝑥(𝑃𝑃(𝑥𝑥)⋀𝑅𝑅(𝑥𝑥))
b. ∃𝑥𝑥𝑥𝑥(𝑥𝑥), ∀𝑥𝑥�𝑃𝑃(𝑥𝑥) ⟶ 𝑄𝑄(𝑥𝑥)� ⊢ ∀𝑦𝑦𝑦𝑦(𝑦𝑦)
(b) Illustrate how Quantifier Equivalences can be used to check the equivalence (6)
of predicate logic formulas.
OR
14. (a) Model the following system in Alloy Analyzer. (7)
There is an entity named Person, Man and Woman are two specializations of
the entity Person. Every Person has a Father (a Man) and a Mother as
Parent. The Parents of a Person should be married. A Man’s spouse should
be a Woman and a Woman’s spouse should be a Man. The spouse relation
is symmetric.
Add a predicate to check whether marriage between siblings is possible in the

above system.
(b) Explain Existential Second Order Logic and Universal Second Order Logic. (7)
15. (a) Model the Ferryman problem using New Symbolic Model Verifier (7)
(NuSMV).
(b) Construct a Generalized Buchi Automaton for the LTL formula 𝒪𝒪𝒪𝒪. (7)
OR
16. (a) Show the closure of the LTL formula ~𝑝𝑝 𝑈𝑈 (𝐹𝐹 𝑟𝑟 ⋁ 𝐺𝐺 ~𝑞𝑞 ⟶ 𝑞𝑞 𝑊𝑊 ~𝑟𝑟). (7)
(b) Explain the Fixed Point Characterization of CTL. (7)
17. (a) Illustrate partial correctness and total correctness in program verification. (7)
(b) (7)
Consider the method named withdraw which attempts to withdraw amount

from an integer field balance of the class within which the method withdraw
lives. This method makes use of another method isGood which returns true iff
the value of balance is greater than or equal to the value of amount.
Write a contract for the method isGood. Use that contract to show the validity
of the contract for withdraw:
Method name: withdraw
Input: amount of type int
Assumes: 0 <= balance
Guarantees: 0 <= balanace
Output: of type boolean
Modifies only: balance

Upon validation, this contract establishes that all calls to withdraw leave
0<=balance invariant.
OR
18. (a) Consider the program for computing the factorial of a number as given below. (7)
Find a partial correctness proof for the above program.
(b) Explain the proof calculus for total correctness. (7)
19. (a) Let ℱ = (𝑊𝑊, 𝑅𝑅) be a frame. Prove the two claims given below. (7)
(b) Explain the modal logics K, KT45 and KT4. (7)
OR
20. (a) Prove the following using Natural Deduction. (8)
(b) Find a modal logic to formalize and solve The Wise-Men Puzzle. (6)
Teaching Plan
No. of
Lecture
No Contents Hours
(45 hrs)
Module-1(Propositional Logic) (8 hours)
1.1 Declarative Sentences, Natural Deduction 1 hour

1.2 Rule for Natural Deduction 1 hour
1.3 Derived Rules, Natural Deduction in Summary 1 hour
Provable Equivalence, Proof by Contradiction. Propositional Logic as a
1.4 1 hour
Formal language
Semantics of Propositional Logic – The Meaning of Logical Connectives,
1.5 Soundness of Propositional Logic, Completeness of Propositional Logic 1 hour
(Proof not required)
1.6 Semantic Equivalence, Satisfiability and Validity 1 hour
Normal Forms – Conjunctive Normal Forms and Validity, Horn Clauses and
1.7 1 hour
Satisfiability
1.8 SAT Solvers – A Linear Solver, A Cubic Solver 1 hour
Module-2(Predicate Logic) (7 hours)
The Need of a Richer language, Predicate Logic as a Formal Language –
2.1 1 hour
Terms, Formulas, Free and Bound Variables, Substitution
2.2 Proof Theory of Predicate Logic – Natural Deduction Rules 1 hour
2.3 Proof Theory of Predicate Logic – Quantifier Equivalences 1 hour
Semantics of Predicate Logic – Models, Semantic Entailment, The
2.4 1 hour
Semantics of Equality
Undecidabilty of Predicate Logic (no proof required), Expressiveness of
2.5 Predicate Logic – Existential Second Order Logic, Universal Second Order 1 hour
Logic
Micromodels of Software – State Machines, A Software Micromodel (Alloy)
2.6 1 hour
(Lecture 1)
2.7 A Software Micromodel (Alloy) (Lecture 2) 1 hour
Module-3(Verification by Model Checking) (13 hours)
3.1 Motivation for Verification, Linear Time Temporal Logic (LTL) - Syntax 1 hour
Semantics of LTL – Practical Patterns of Specifications, Important
3.2 Equivalences between LTL Formulas, Adequate Sets of Connectives for 1 hour
LTL
3.3 Introduction to model checking 1 hour
3.4 Model Checking Systems, Tools, Properties 1 hour
3.5 Model checking example: Mutual Exclusion 1 hour
The New Symbolic Model Verifier (NuSMV) Model Checker –
3.6 1 hour
Introduction, Mutual Exclusion Revisited
3.7 The NuSMV Model Checker – The Ferryman, The Alternating Bit Protocol 1 hour
Branching Time Logic – Syntax of Computation Tree Logic (CTL),
3.8 1 hour
Semantics of CTL
Practical Patterns of Specification, Important Equivalences between CTL
3.9 1 hour
Formulas, Adequate Sets of CTL Connectives
CTL and the Expressive Powers of LTL and CTL – Boolean Combinations
3.10 1 hour
of Temporal Formulas in CTL
3.11 Model-Checking Algorithms – The CTL Model Checking Algorithm 1 hour
3.12 CTL Model Checking with Fairness 1 hour
3.13 The LTL Model Checking Algorithm (Algorithm only) 1 hour
Module-4 (Program Verification) (8 hours)
Introduction to Program Verification, Need of Specification and Verification of
4.1 1 hour
Code
A Framework for Software Verification – A Core Programming Language, Hoare

4.2 1 hour
Triples
A Framework for Software Verification – Partial and Total Correctness, Program

4.3 1 hour
Variables and Logical Variables
4.4 Proof Calculus for partial Correctness – Proof Rules 1 hour

4.5 Proof Calculus for partial Correctness – Proof Tableaux 1 hour
4.6 Proof Calculus for partial Correctness – A Case Study: Minimal-Sum Section 1 hour
4.7 Proof Calculus for Total Correctness 1 hour
4.8 Programming by Contract 1 hour
Module-5 (Modal Logics and Agents) (9 hours)

5.1 Modes of Truth, basic Modal Logic - Syntax 1 hour

5.2 Basic Modal Logic - Semantics 1 hour
Logic Engineering – The Stock of Valid Formulas, Important Properties of the
5.3 1 hour
Accessibility Relation
5.4 Logic Engineering – Correspondence Theory, Some Modal Logics 1 hour

5.5 Natural Deduction 1 hour
Reasoning about Knowledge in a Multi-Agent System –Examples (The Wise - Man
5.6 Puzzle, The Muddy – Children Puzzle)
1 hour
5.7 The Modal Logic KT45n 1 hour

5.8 Natural Deduction for KT45n 1 hour
5.9 Formalizing the Examples (The Wise - Man Puzzle, The Muddy – Children Puzzle) 1 hour
SEMESTER VIII
YEAR OF
DISTRIBUTED CATEGORY L T P CREDIT INTRODUCTION
CST402
COMPUTING PCC 2 1 0 3 2019
Preamble: The purpose of this course is to understand the system models, algorithms and protocols
that allow computers to communicate and coordinate their actions to solve a problem. This course
helps the learner to understand the distributed computation model and various concepts like global
state, termination detection, mutual exclusion, deadlock detection, shared memory, failure recovery,
consensus, file system. It helps the learners to develop solutions to problems in distributed computing
environment.
Prerequisite: Basic knowledge in data structures and operating systems.
CO1 Summarize various aspects of distributed computation model and logical time.
CO2 Illustrate election algorithm, global snapshot algorithm and termination detection
algorithm. (Cognitive Knowledge Level: Apply)
CO3 Compare token based, non-token based and quorum based mutual exclusion
algorithms. (Cognitive Knowledge Level: Understand)
CO4 Recognize the significance of deadlock detection and shared memory in distributed
systems. (Cognitive Knowledge Level: Understand)
CO5 Explain the concepts of failure recovery and consensus. (Cognitive Knowledge Level:
Understand)
CO6 Illustrate distributed file system architectures. (Cognitive Knowledge Level:

Understand)
0 2
CO1
CO2
CO3
CO4
CO5
CO6

Assessment Pattern

Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 50 50 50
Apply 20 20 20
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3

Attendance 10 marks

Each of the two internal examinations has to be conducted out of 50 marks. First series test shall be
preferably conducted after completing the first half of the syllabus and the second series test shall be
preferably conducted after completing remaining part of the syllabus. There will be two parts: Part A
and Part B. Part A contains 5 questions (preferably, 2 questions each from the completed modules
and 1 question from the partly completed module), having 3 marks for each question adding up to
15 marks for part A. Students should answer all questions from Part A. Part B contains 7 questions
(preferably, 3 questions each from the completed modules and 1 question from the partly completed
module), each with 7 marks. Out of the 7 questions, a student should answer any 5.

full questions from each module of which student should answer any one. Each question can have
Syllabus
Module – 1 (Distributed systems basics and Computation model)
Distributed System – Definition, Relation to computer system components, Motivation, Primitives
for distributed communication, Design issues, Challenges and applications. A model of distributed
computations – Distributed program, Model of distributed executions, Models of communication
networks, Global state of a distributed system, Cuts of a distributed computation, Past and future
cones of an event, Models of process communications.
Module – 2 (Election algorithm, Global state and Termination detection)
Logical time – A framework for a system of logical clocks, Scalar time, Vector time. Leader election
algorithm – Bully algorithm, Ring algorithm. Global state and snapshot recording algorithms –
System model and definitions, Snapshot algorithm for FIFO channels – Chandy Lamport algorithm.
Termination detection – System model of a distributed computation, Termination detection using
distributed snapshots, Termination detection by weight throwing,Spanning-tree-based algorithm.
Module – 3 (Mutual exclusion and Deadlock detection)
Distributed mutual exclusion algorithms – System model, Requirements of mutual exclusion

algorithm. Lamport’s algorithm, Ricart–Agrawala algorithm, Quorum-based mutual exclusion
algorithms – Maekawa’s algorithm. Token-based algorithm – Suzuki–Kasami’s broadcast algorithm.
Deadlock detection in distributed systems – System model, Deadlock handling strategies, Issues in
deadlock detection, Models of deadlocks.
Module – 4 (Distributed shared memory and Failure recovery)
Distributed shared memory – Abstraction and advantages. Shared memory mutual exclusion –
Lamport’s bakery algorithm. Check pointing and rollback recovery – System model, consistent and
inconsistent states, different types of messages, Issues in failure recovery, checkpoint based
recovery, log based roll back recovery.
Module – 5 (Consensus and Distributed file system)
Consensus and agreement algorithms – Assumptions, The Byzantine agreement and other problems,
Agreement in (message-passing) synchronous systems with failures – Consensus algorithm for crash
failures. Distributed file system – File service architecture, Case studies: Sun Network File System,
Andrew File System, Google File System.
(Note: Proof of correctness and performance analysis are not expected for any of the algorithms
in the syllabus).
Text Books
1. Ajay D. Kshemkalyani and Mukesh Singhal, Distributed Computing: Principles, Algorithms, and
Systems, Cambridge University Press, 2011.
Reference Books
1. George Coulouris, Jean Dollimore, Tim Kindberg and Gordon Blair. Distributed Systems:
Concepts and Design, Addison Wesley, Fifth edition.
2. Kai Hwang, Geoffrey C Fox, Jack J Dongarra, Distributed and Cloud Computing – From
Parallel Processing to the Internet of Things, Morgan Kaufmann Publishers, 2012.
3. Sukumar Ghosh, Distributed Systems: An Algorithmic Approach, CRC Press, Second edition,
2015.
4. Maarten Van Steen, Andrew S. Tanenbaum, Distributed Systems, Prentice Hall of India,Third
edition, 2017.
5. Randy Chow and Theodore Johnson, Distributed Operating Systems and Algorithm Analysis,
Pearson Education India, First edition, 2009.
6. Valmir C. Barbosa, An Introduction to Distributed Algorithms, MIT Press, 2003.

1. Define logical clock and explain the implementation of the logical clock.
2. Explain different forms of load balancing.

1. Apply ring-based leader election algorithm with 10 processes in the worst-performing case.
Count the number of messages needed.
2. Apply spanning tree-based termination detection algorithm in the following scenario. The
nodes are processes 0 to 6. Leaf nodes 3, 4, 5, and 6 are each given tokens T3, T4, T5 and T6
respectively. Leaf nodes 3, 4, 5 and 6 terminate in the order, but before terminating node 5,it
sends a message to node 1.

1. What are the requirements of mutual exclusion algorithms?
2. Illustrate Suzuki- Kasami’s broadcast algorithm.
1. Compare different models of deadlocks.
2. Illustrate the detailed abstraction of distributed shared memory and interaction with
application processes.
1. Explain how consensus problem differs from the Byzantine agreement problem.
2. Classify different log based roll back recovery techniques.
1. Explain the directory service and its interface operations in a file service architecture.
2. Describe the architecture of Google file system.
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
Course Code: CST402
Course Name: Distributed Computing
PART A
1. Identify any three distributed applications and for each application, determine
which all motivating factors are important for building an application over a
distributed system.
2. Assume that the surface of the past cone form a consistent cut. Does it mean that
all events on the surface of the past cone are always concurrent? Demonstrate with
the help of an example.
3. Specify the issues in recording a global state.
4. Explain the rules used to update clocks in scalar time representation.
5. Describe how quorum-based mutual exclusion algorithms differ from the other
categories of mutual exclusion algorithms.
6. Explain with example, how wait-for-graphs can be used in deadlock detection.
7. List any three advantages of using distributed shared memory.
8. Define the no-orphans consistency condition.

9. Define Byzantine agreement problem.
10. Differentiate between whole file serving and whole file caching in Andrew file (10x3=30)
system
Part B
11. (a) Explain the three different models of the service provided by communication (6)
networks.
(b) Explain how the causal dependency between events in distributed execution is (8)
defined using Lamport’s happened before relationship.
OR
12. (a) Address the various strategies that can be adopted to satisfy the requirements (6)
of a reliable and fault tolerant distributed system.
(b) Which are the different versions of send and receive primitives for distributed (8)
communication? Explain.
13. (a) Illustrate bully algorithm for electing a new leader. Does the algorithm meet (7)
liveness and safety conditions?
(b) Clearly mentioning assumptions, explain the rules of termination detection (7)
using distributed snapshots.
OR
14. (a) In Chandy-Lamport algorithm for recording global snapshots, explain how the (6)
recorded local snapshots can be put together to create the global snapshot.
Can multiple processes initiate the algorithm concurrently?
(b) Illustrate the working of spanning tree based termination detection algorithm. (8)
15. (a) Explain and illustrate Lamport’s mutual exclusion algorithm. (8)
(b) Discuss the three types of messages required for deadlock handling in (6)
Maekawa’s algorithm. Explain how Maekawa’s algorithm handles deadlocks.
OR
16. (a) Explain and illustrate Ricart- Agrawala algorithm for achieving mutual (8)
exclusion.
(b) Explain any three different models of deadlock. (6)
17. (a) What are the issues in failure recovery? Illustrate with suitable examples. (7)
(b) Show that Lamport’s Bakery algorithm for shared memory mutual exclusion, (7)
satisfy the three requirements of critical section problem.
OR
18. (a) Differentiate consistent and inconsistent states with examples. (4)
(b) What is check point-based rollback-recovery? Explain the three (10)

classifications of check point-based rollback-recovery.
19. (a) Explain consensus algorithm for crash failures under synchronous systems. (6)
(b) Summarize distributed file system requirements. (8)
OR
20. (a) Differentiate Andrew file system and NFS. (4)
(b) Explain Sun NFS architecture with diagram. (10)

Teaching Plan
No. of
Lecture
No Contents Hours
(35
hours)
Module – 1(Distributed systems basics and Computation model) (7 hours)
1.1 Distributed System – Definition, Relation to computer system components 1 hour

1.2 Primitives for distributed communication. 1 hour
1.3 Design issues, challenges and applications. 1 hour
1.4 Design issues, challenges and applications. 1 hour
A model of distributed computations – Distributed program, Model of
1.5 1 hour
distributed executions
Models of communication networks, Global state of a distributed system,
1.6 1 hour
Cuts of a distributed computation
Cuts of a distributed computation, Past and future cones of an event, Models
1.7 1 hour
of process communications.
Module – 2 (Election algorithm, Global state and Termination detection) (8 hours)
2.1 Logical time – A framework for a system of logical clocks, Scalar time 1 hour
2.2 Vector time. 1 hour
2.3* Leader election algorithm – Bully Algorithm, Ring Algorithm 1 hour
Global state and snapshot recording algorithms – System model and
2.4 1 hour
definitions
2.5* Snapshot algorithm for FIFO channels – Chandy Lamport algorithm. 1 hour
2.6 Termination detection – System model of a distributed computation 1 hour
2.7* Termination detection using distributed snapshots 1 hour
2.8* Termination detection by weight throwing, Spanning tree-based algorithm 1 hour
Module – 3 (Mutual exclusion and Deadlock detection) (6 hours)
Distributed mutual exclusion algorithms – System model, Lamport’s
3.1* 1 hour
algorithm
3.2* Ricart–Agrawala algorithm 1 hour

3.3* Quorum-based mutual exclusion algorithms – Maekawa’s algorithm 1 hour
3.4* Token-based algorithm – Suzuki–Kasami’s broadcast algorithm. 1 hour
Deadlock detection in distributed systems – System model, Deadlock
3.5 1 hour
handling strategies, Issues in deadlock detection
3.6 Models of deadlocks 1 hour
Module – 4 (Distributed shared memory and Failure recovery) (7 hours)
4.1 Distributed shared memory – Abstraction and advantages. 1 hour
4.2* Shared memory mutual exclusion – Lamport’s bakery algorithm. 1 hour
Checkpointing and rollback recovery – System model, consistent and
4.3 1 hour
inconsistent states
4.4 different types of messages, Issues in failure recovery 1 hour
4.5 checkpoint based recovery 1 hour
4.6 log based roll back recovery. 1 hour
4.7 log based roll back recovery. 1 hour
Module – 5(Consensus and Distributedfile system) (7 hours)
Consensus and agreement algorithms – Assumptions, The Byzantine
5.1 1 hour
agreement and other problems
Agreement in (message-passing) synchronous systems with failures –
5.2 1 hour
Consensus algorithm for crash failures
Agreement in (message-passing) synchronous systems with failures –
5.3* 1 hour
Consensus algorithm for crash failures
5.4 Distributed File System – File Service Architecture 1 hour
5.5 Case Studies: Sun Network File System 1 hour
5.6 Andrew File System 1 hour
5.7 Google File System. 1 hour
* Proof of correctness and performance analysis are not expected for this algorithm.
CATEGORY L T P CREDIT YEAR OF

CST404 COMPREHENSIVE INTRODUCTION
COURSE VIVA PCC 1 0 0 1 2019
The objective of this Course viva is to ensure the basic knowledge of each student in the most
fundamental core courses in the curriculum. The viva voce shall be conducted based on the core
subjects studied from third to eighth semester. This course helps the learner to become competent in
placement tests and other competitive examinations.
Guidelines
1. The course should be mapped with a faculty and classes shall be arranged for practicing
questions based on the core courses listed in the curriculum.
2. The viva voce will be conducted by the same three member committee assigned for final
project phase II evaluation. It comprises of Project coordinator, expert from
Industry/research Institute and a senior faculty from a sister department.
3. The pass minimum for this course is 25.
4. The mark will be treated as internal and should be uploaded along with internal marks of
other courses.
5. Comprehensive Viva should be conducted along with final project evaluation by the three
member committee.
Mark Distribution
Total marks: 50, only CIE, minimum required to pass : 25
CSD416 PROJECT PHASE II
PWS 0 0 12 4
Preamble: The course ‘Project Work’ is mainly intended to evoke the innovation and invention
skills in a student. The course will provide an opportunity to synthesize and apply the knowledge
and analytical skills learned, to be developed as a prototype or simulation. The project extends to
2 semesters and will be evaluated in the 7th and 8th semester separately, based on the achieved
objectives. One third of the project credits shall be completed in 7th semester and two third in 8th
semester. It is recommended that the projects may be finalized in the thrust areas of the
respective engineering stream or as interdisciplinary projects. Importance should be given to
address societal problems and developing indigenous technologies.
Course Objectives
 To apply engineering knowledge in practical problem solving.
 To foster innovation in design of products, processes or systems.
 To develop creative thinking in finding viable solutions to engineering problems.
Course Outcomes [COs]: After successful completion of the course, the students will be able to:
Model and solve real world problems by applying knowledge across domains
CO1
(Cognitive knowledge level: Apply).
Develop products, processes or technologies for sustainable and socially relevant
CO2
applications (Cognitive knowledge level: Apply).
Function effectively as an individual and as a leader in diverse teams and to
CO3
comprehend and execute designated tasks (Cognitive knowledge level: Apply).
Plan and execute tasks utilizing available resources within timelines, following ethical
CO4
and professional norms (Cognitive knowledge level: Apply).
Identify technology/research gaps and propose innovative/creative solutions
CO5
(Cognitive knowledge level: Analyze).
Organize and communicate technical and scientific findings effectively in written and
CO6
oral forms (Cognitive knowledge level: Apply).
CO1 2 2 2 1 2 2 2 1 1 1 1 2
CO2 2 2 2 1 3 3 1 1 1 1
CO3 3 2 2 1
CO4 2 3 2 2 3 2
CO5 2 3 3 1 2 1
CO6 2 2 2 3 1 1
PO # Broad PO PO# Broad PO

PROJECT PHASE II
Phase 2 Targets
 In depth study of the topic assigned in the light of the report prepared under Phase - I;
 Review and finalization of the approach to the problem relating to the assigned topic.
 Preparing a detailed action plan for conducting the investigation, including teamwork.
 Detailed Analysis/ Modeling / Simulation/ Design/ Problem Solving/Experiment as
needed.
 Final development of product/ process, testing, results, conclusions and future
directions.
 Preparing a paper for Conference Presentation/ Publication in Journals, if possible.
 Presenting projects in Project Expos conducted by the University at the cluster level
and/ or state level as well as others conducted in India and abroad.
 Filing Intellectual Property Rights (IPR) if applicable.
 Preparing a report in the standard format for being evaluated by the Department
Assessment Board.
 Final project presentation and viva voce by the assessment board including the
external expert.
Evaluation Guidelines & Rubrics
Total: 150 marks (Minimum required to pass: 75 marks).

 Project progress evaluation by guide: 30 Marks.
 Two interim evaluations by the Evaluation Committee: 50 Marks (25 marks for each
evaluation).
 Final evaluation by the Final Evaluation committee: 40 Marks
 Quality of the report evaluated by the evaluation committee: 30 Marks
(The evaluation committee comprises HoD or a senior faculty member, Project coordinator
and project supervisor. The final evaluation committee comprises of Project coordinator,
expert from Industry/research/academic Institute and a senior faculty from a sister
department).
Evaluation by the Guide

The guide/supervisor must monitor the progress being carried out by the project groups on
regular basis. In case it is found that progress is unsatisfactory it should be reported to the
Department Evaluation Committee for necessary action. The presence of each student in the
group and their involvement in all stages of execution of the project shall be ensured by the
guide. Project evaluation by the guide: 30 Marks. This mark shall be awarded to the students in
his/her group by considering the following aspects:
Project Scheduling & Distribution of Work among Team members: Detailed and extensive
Scheduling with timelines provided for each phase of project. Work breakdown structure well
defined. (5)
Literature survey: Outstanding investigation in all aspects. (4)
Student’s Diary/ Daily Log: The main purpose of writing daily diary is to cultivate the habit of
documenting and to encourage the students to search for details. It develops the students’ thought
process and reasoning abilities. The students should record in the daily/weekly activity diary the
day to day account of the observations, impressions, information gathered and suggestions given,
if any. It should contain the sketches & drawings related to the observations made by the
students. The daily/weekly activity diary shall be signed after every day/week by the guide. (7)
Individual Contribution: The contribution of each student at various stages. (9)
Completion of the project: The students should demonstrate the project to their respective
guide. The guide shall verify the results and see that the objectives are met. (5)
EVALUATION RUBRICS for PROJECT Phase II: Interim Evaluation - 1
Good evidence of an implementable
Some of the aspects of the proposed
The project is not addressing any project. There is some evidence for The project has evolved into incorporating
idea can be implemented. There is
useful requirement. The idea is the originality of the work done by the an outstandingly novel idea. Original work
still lack of originality in the work
Novelty of idea, and evolved into a non-implementable team . There is fresh specifications/ which is not yet reported anywhere else.
done so far by the team. The project
Implementation scope one. The work presented so far is features/improvements suggested by Evidence for ingenious way of innovation
2-a 5 is a regularly done theme/topic
[CO5] lacking any amount of original work the team. The team is doing a design which is also Implementable. Could be a
without any freshness in terms of
[Group Evaluation] by the team. from fundamental principles, and patentable / publishable work.
specifications, features, and/or
there is some independent learning
improvements.
and engineering ingenuity.
Good evidence of task allocation Excellent display of task identification and

being done, supported by project distribution backed by documentary
No task distribution of any kind. Task allocation done, but not journal entries, identification of tasks evidence of team brainstorming, and
Effectiveness of task
Members are still having no clue on effectively, some members do not through discussion etc. However, the project journal entries. All members are
2-b distribution among 5 what to do. have any idea of the tasks assigned. task distribution seems to be skewed, allocated tasks according to their
team members. Some of the tasks were identified but and depends a few members heavily capabilities, and as much as possible in an
[CO3] not followed individually well. than others. Mostly the tasks are being equal manner. The individual members are
[Group Evaluation]
followed by the individual members. following the tasks in an excellent manner.
Little or no evidence of continued There is some improvement in the Good evidence of planning done and Excellent evidence of enterprising and
planning or scheduling of the primary plan prepared during phase I. being followed up to a good extent extensive project planning and follow-up
project. The students did not stick to There were some ideas on the since phase I. Continued use of project
after phase I. Materials were listed
Adherence to project the plan what they were going to materials /resources required, but not and thought out, but the plan wasn't management/version control tool to track
schedule. build nor plan on what materials / really thought out. The students have the project. Material procurement if
2-c 5 followed completely. Schedules were
[CO4] resources to use in the project. The some idea on the finances required, prepared, but not detailed, and needs applicable is progressing well. Tasks are
[Group Evaluation] students do not have any idea on the but they have not formalized a budget improvement. Project journal is updated and incorporated in the schedule.
budget required even after the end of plan. Schedules were not prepared. presented but it is neither complete A well-kept project journal showed
phase - I. No project journal kept or The project journal has no useful nor updated regularly. evidence for all the above, in addition to
the journal. details on the project. the interaction with the project guide.
(0 - 1 Marks) (2 - 3 Marks) (4 Marks) (5 Marks)

The team showed some interim The interim results showed were good
There were significant interim results
Interim Results. results, but they are not complete / and mostly consistent/correct with
There are no interim results to show. presented which clearly shows the progress.
2-d [CO6] 5 consistent to the current stage, Some respect to the current stage. There is
[Group assessment] corrections are needed. room for improvement.
Very poor presentation and there is Presentation is average, and the Good presentation. Student has good Exceptionally good presentation. Student
Presentation
no interim results. The student has student has only a feeble idea about idea about the team's project. The has excellent grasp of the project. The
2-e [Individual 5 no idea about the project proposal. the team work. overall presentation quality is good. quality of presentation is outstanding.
assessment]
Phase-II Interim Evaluation - 1 Total Marks: 25

EVALUATION RUBRICS for PROJECT Phase II: Interim Evaluation – 2
No Parameters Marks Poor Fair Very Good Outstanding
The student does not show any The student appears to apply some The student is able to show some Excellent knowledge in design procedure
Application of evidence of applying engineering basic knowledge, but not able to evidence of application of engineering and its adaptation. The student is able to
engineering knowledge on the design and the show the design procedure and the knowledge in the design and apply knowledge from engineering
knowledge methodology adopted. The student's methodologies adopted in a development of the project to good domains to the problem and develop
2-f [CO1] 10 contribution in application of comprehensive manner. extent. solutions.
[Individual engineering knowledge in the project
Assessment] is poor.
The individual contribution is evident.

Involvement of No evidence of any Individual There is evidence for some amount Evidence available for the student acting
The student has good amount of
individual participation in the project work. of individual contribution, but is as the core technical lead and has excellent
5 involvement in core activities of the
members limited to some of the superficial contribution to the project.
2-g [CO3] project.
tasks.
[Individual
Assessment] (0 - 1 Marks) (2 - 3 Marks) (4 Marks) (5 Marks)
None of the expected outcomes are Many of the expected outcomes are Most of the stated outcomes are met.
Only a few of the expected outcomes
Results and achieved yet. The team is unable to achieved. Many observations and Extensive studies are done and inferences
are achieved. A few inferences are
inferences upon derive any inferences on the failures/ inferences are made, and attempts to drawn. Most of the failures are addressed
5 made on the observed failures/issues.
execution [CO5] issues observed. Any kind o f identify the issues are done. Some and solutions suggested. Clear and valid
2-h No further work suggested.
[Group Assessment] observations or studies are not made. suggestions are made for further work. suggestions made for further work.
Documentatio n and The individual student has no idea on The individual's presentation is done
Presentation's overall quality needs The individual’s presentation
presentation. the presentation of his/her part. The professionally and with great clarity. The
5 to be improved. performance is satisfactory.
2-i .[CO6] presentation is of poor quality. individual’s performance is excellent.
[Individual assessment]
Phase-II Interim Evaluation - 2 Total Marks: 25

EVALUATION RUBRICS for PROJECT Phase II: Final Evaluation
No Parameters Marks Poor Fair Very Good Outstanding
The team is able to show evidence of Excellent knowledge in design procedure
Engineering The team does not show any evidence The team is able to show some of the
application of engineering knowledge and its adaptation. The team is able to
2-j knowledge. [CO1] of applying engineering knowledge design procedure and the
10 in the design and development of the apply knowledge from engineering
[Group Assessment] on the design and the methodology methodologies adopted, but not in a
project to good extent. There is scope domains to the problem and develop an
adopted. comprehensive manner.
for improvement. excellent solution.

Relevance of the The project has some relevance with The project is relevant to the society The project is exceptionally relevant to
project with respect to The project as a whole do not have respect to social and/or industrial and/or industry. The team is mostly society and/or industry. The team has
2-k societal and/or any societal / industrial relevance at application. The team has however successful in translating the problem made outstanding contribution while
5 all.
industrial needs. made not much effort to explore into an engineering specification and solving the problem in a professional and/
[Group Assessment] further and make it better. managed to solve much of it. or ethical manner.
[CO2]
Some of the aspects of the proposed Good evidence of an implementable
The project is not addressing any The project has evolved into incorporating
idea appears to be practical. There is project. There is some evidence for the
useful requirement. The idea is an outstandingly novel idea. Original work
still lack of originality in the work originality of the work done by the
evolved into a non-implementable which is not yet reported anywhere else.
done. The project is a regularly done team. There is fresh specifications/
Innovation / novelty / one. The work presented so far is Evidence for ingenious way of innovation
theme/topic without any freshness in features/improvements suggested by the
lacking any amount of original work which is also Implementable. Could be a
2-i Creativity 5 terms of specifications, features, and/ team. The team is doing a design from
[CO5] by the team. patentable publishable work.
or improvements. fundamental principles, and there is
[Group Assessment] some independent learning and
engineering ingenuity. Could be
translated into a product / process if
more work is done.

Only a few of the expected outcomes
None of the expected outcomes are are achieved. A few inferences are Many of the expected outcomes are Most of the stated outcomes are met.
Quality of results / achieved. The team is unable to made on the observed failures/issues. achieved. Many observations and Extensive studies are done and inferences
conclusions / 10 derive any inferences on the No further work suggested. inferences are made, and attempts to drawn. Most of the failures are addressed
2-m solutions. [CO1] failures/issues observed. Any kind of identify the issues are done. Some and solutions suggested. Clear and valid
[Group Assessment] observations or studies is not made. suggestions are made for further work. suggestions made for further work.

Presentation slides follow a good style
Presentation slides follow professional The presentation slides are exceptionally
The presentation slides are shallow style formats to some extent. However, format and there are only a few issues.
Organization of the slides is good. Most good. Neatly organized. All references
Presentation - Part I and in a clumsy format. It does not its organization is not very good.
of references are cited properly. The cited properly. Diagrams/Figures, Tables
Preparation of slides. 5 follow proper organization. Language needs to be improved. All and equations are properly numbered,
flow is good and team presentation is
[CO6] references are not cited properly, or and l i s ted. Results/ inferences clearly
neatly organized. Some of the results
[Group Assessment]. acknowledged. Presentation slides highlighted and readable.
are not clearly shown. There is room
needs to be more professional.
for improvement.
2-n (0 - 1 Marks) (2 - 3 Marks) (4 Marks) (5 Marks)

Good presentation/ communication by
Presentation - Part The student is able to explain some of Clear and concise communication
the student. The student is able to
II: Individual The student is not communicating the content. The student requires a lot exhibited by the student. The
explain most of the content very well.
Communication 5 properly. Poor response to of prompts to get to the idea. There are presentation is outstanding. Very
There are however, a few areas where
[CO6] questions. language issues. confident and tackles all the questions
the student shows lack of preparation.
[Individual without hesitation. Exceptional traits of
Language is better.
Assessment]. communicator.
Phase-II Final Evaluation, Marks: 40

EVALUATION RUBRICS for PROJECT Phase II: Report Evaluation
Sl.
The prepared report is shallow and not Project report shows evidence of
Project report follows the standard The report is exceptionally good. Neatly
as per standard format. It does not systematic documentation. Report is
format to some extent. However, its organized. All references cited properly.
follow proper organization. Contains mostly following the standard style
organization is not very good. Diagrams/Figures, Tables and equations
mostly unacknowledged content. Lack format and there are only a few issues.
2-o Report [CO6] 30 Language needs to be improved. All are properly numbered, and listed and
of effort in preparation is evident. Organization of the report is good.
references are not cited properly in the clearly shown. Language is excellent and
References are not cited. Mostly consistently formatted. Most of
report. There is lack of formatting follows professional styles. Consistent
Unprofessional and inconsistent references/sources are cited/
consistency. formatting and exceptional readability.
formatting. acknowledged properly.
(0 - 11 Marks) (12 - 18 Marks) (19 - 28 Marks) (29 - 30 Marks)
Phase - II Project Report Marks: 30

SEMESTER VIII
PROGRAM ELECTIVE III
YEAR OF
CST414 DEEP LEARNING
PEC 2 1 0 3 2019
Preamble: Deep Learning is the recently emerged branch of machine learning, particularly
designed to solve a wide range of problems in Computer Vision and Natural Language Processing.
In this course, the building blocks used in deep learning are introduced. Specifically, neural
networks, deep neural networks, convolutional neural networks and recurrent neural networks.
Learning and optimization strategies such as Gradient Descent, Nesterov Accelerated Gradient
Descent, Adam, AdaGrad and RMSProp are also discussed in this course. This course will helps
the students to attain sound knowledge of deep architectures used for solving various Vision and
NLP tasks. In future, learners can master modern techniques in deep learning such as attention
mechanisms, generative models and reinforcement learning.
Prerequisite: Basic understanding of probability theory, linear algebra and machine learning
CO1 Illustrate the basic concepts of neural networks and its practical issues
CO2 Outline the standard regularization and optimization techniques for deep neural
network (Cognitive Knowledge Level: understand)
CO3 Implement the foundation layers of CNN (pooling, convolutions)

CO4 Implement a sequence model using recurrent neural networks

CO1
CO2
CO3
CO4
CO5

Assessment Pattern

Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3

Attendance 10 marks

answer any 5.

Syllabus
Module-1 (Neural Networks )
Introduction to neural networks -Single layer perceptrons, Multi Layer Perceptrons (MLPs),
Representation Power of MLPs, Activation functions - Sigmoid, Tanh, ReLU, Softmax. , Risk
minimization, Loss function, Training MLPs with backpropagation, Practical issues in neural
network training - The Problem of Overfitting, Vanishing and exploding gradient problems,
Difficulties in convergence, Local and spurious Optima, Computational Challenges. Applications
of neural networks.
Module-2 (Deep learning)
Introduction to deep learning, Deep feed forward network, Training deep models, Optimization
techniques - Gradient Descent (GD), GD with momentum, Nesterov accelerated GD, Stochastic
GD, AdaGrad, RMSProp, Adam. Regularization Techniques - L1 and L2 regularization, Early
stopping, Dataset augmentation, Parameter sharing and tying, Injecting noise at input, Ensemble
methods, Dropout, Parameter initialization.
Module-3 (Convolutional Neural Network)
Convolutional Neural Networks – convolution operation, motivation, pooling, Convolution and

Pooling as an infinitely strong prior, variants of convolution functions, structured outputs, data
types, efficient convolution algorithms.
sequence architectures, deep recurrent networks, recursive neural networks, modern RNNs LSTM
and GRU.
Applications – computer vision, speech recognition, natural language processing, common word
embedding: continuous Bag-of-Words, Word2Vec, global vectors for word representation
(GloVe). Research Areas – autoencoders, representation learning, boltzmann machines, deep
belief networks.
Text Books
1. Goodfellow, I., Bengio,Y., and Courville, A., Deep Learning, MIT Press, 2016.
2. Neural Networks and Deep Learning, Aggarwal, Charu C.
3. Fundamentals of Deep Learning: Designing Next-Generation Machine Intelligence
Algorithms (1st. ed.). Nikhil Buduma and Nicholas Locascio. 2017. O'Reilly Media, Inc.
Reference Books
1. Satish Kumar, Neural Networks: A Classroom Approach, Tata McGraw-Hill Education,
2004.
2. Yegnanarayana, B., Artificial Neural Networks PHI Learning Pvt. Ltd, 2009.
3. Michael Nielsen, Neural Networks and Deep Learning, 2018

1. Suppose you have a 3-dimensional input x = (x1, x2, x3) = (2, 2, 1) fully connected
to 1 neuron which is in the hidden layer with activation function sigmoid. Calculate
the output of the hidden layer neuron.
2. Design a single layer perceptron to compute the NAND (not-AND) function. This
function receives two binary-valued inputs x1 and x2, and returns 0 if both inputs are
1, and returns 1 otherwise.
3. Suppose we have a fully connected, feed-forward network with no hidden layer, and
5 input units connected directly to 3 output units. Briefly explain why adding a
hidden layer with 8 linear units does not make the network any more powerful.
4. Briefly explain one thing you would use a validation set for, and why you can’t just
do it using the test set.
5. Give a method to fight vanishing gradients in fully-connected neural networks.

Assume we are using a network with Sigmoid activations trained using SGD.
6. You would like to train a fully-connected neural network with 5 hidden layers, each
with 10 hidden units. The input is 20-dimensional and the output is a scalar. What is
the total number of trainable parameters in your network?

1. Derive a mathematical expression to show L2 regularization as weight decay.
Explain how L2 regularization improves the performance of deep feed forward
neural networks.
2. In stochastic gradient descent, each pass over the dataset requires the same number
of arithmetic operations, whether we use minibatches of size 1 or size 1000. Why
can it nevertheless be more computationally efficient to use minibatches of size
1000?
3. State how to apply early stopping in the context of learning using Gradient Descent.
Why is it necessary to use a validation set (instead of simply using the test set) when
using early stopping?
4. Suppose that a model does well on the training set, but only achieves an accuracy of
85% on the validation set. You conclude that the model is overfitting, and plan to
use L1 or L2 regularization to fix the issue. However, you learn that some of the
examples in the data may be incorrectly labeled. Which form of regularisation
would you prefer to use and why?
5. Describe one advantage of using Adam optimizer instead of basic gradient descent.

1. Draw and explain the architecture of convolutional neural networks.
2. Consider a convolution layer. The input consists of 6 feature maps of size 20×20.
The output consists of 8 feature maps, and the filters are of size 5 x 5. The
convolution is done with a stride of 2 and zero padding, so the output feature maps
are of size 10 x 10.
a. Determine the number of weights in this convolution layer.
b. Determine the number of weights if we made this a fully connected layer,
but the number of input and output units are kept the same as in the network.
3. Suppose two people A and B have implemented two neural networks for
recognizing handwritten digits from 16 x 16 grayscale images. Each network has a
single hidden layer, and makes predictions using a softmax output layer with 10
units, one for each digit class.
a. A’s network is a convolutional net. The hidden layer consists of three 16 x
16 convolutional feature maps, each with filters of size 5 x 5, and uses the
logistic nonlinearity. All of the hidden units are connected to all of the
output units.
b. B’s network is a fully connected network with no weight sharing. The
hidden layer consists of 768 logistic units (the same number of units as in
A’s convolutional layer).
4. Briefly explain one advantage of A’s approach and one advantage of B’s approach.
5. Why do the layers in a deep architecture need to be non-linear?
visual tasks.
7. You have an input volume of 32 x 32 x 3. What are the dimensions of the resulting
volume after convolving a 5 x 5 kernel with zero padding, stride of 1, and 2 filters?

1. Draw and explain the architecture of LSTM.
2. Name at least one benefit of the LSTM model over the bag-of-vectors model.
3. Give one advantage of GloVe over Skipgram/CBOW models.
4. What are two ways practitioners deal with having two different sets of word vectors
U and V at the end of training both Glove and word2vec?
5. If we have a recurrent neural network (RNN), we can view it as a different
type of network by "unrolling it through time". Briefly explain what that
means.
6. Briefly explain how “unrolling through time” is related to “weight sharing” in
convolutional networks.

1. Development a deep learning solution for problems in the domain i) natural
language processing or ii) Computer vision
2. Illustrate the workings of the RNN with an example of a single sequence defined on
a vocabulary of four words.
3. Is an autoencoder for supervised learning or for unsupervised learning?
Explain briefly.
4. Sketch the architecture of an autoencoder network.
5. Describe how to train an autoencoder network.
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
Course Code: CST414
Course Name: Deep Learning
PART A
1. Discuss the limitation of a single layer perceptron with an example.
2. List the advantages and disadvantages of sigmoid and ReLU activation functions.
3. Derive weight updating rule in gradient descent when the error function is a)
mean squared error b) cross entropy.
4. Discuss methods to prevent overfitting in neural networks.
5. What happens if the stride of the convolutional layer increases? What can be the
maximum stride? Explain.
6. Draw the architecture of a simple CNN and write short notes on each block.
7. How does a recursive neural network work?
8. List down the differences between LSTM and RNN.


(10x3=30)
Part B
11. (a) Update the parameters in the given MLP using gradient descent with learning (10)
rate as 0.5 and activation function as ReLU. Initial weights are given as
𝑉𝑉 = 0.1 0.2 0 .1 0.1 W= 0.1 0.1
(b) Explain the importance of choosing the right step size in neural networks. (4)
OR
12. (a) Draw the architecture of a multi-layer perceptron. Derive update rules for (10)
parameters in the multi-layer neural network through the gradient descent
(b) Calculate the output of the following neuron Y if the activation function is a (4)
binary sigmoid.
13. (a) Explain, what might happen in ADAGRAD, where momentum is expressed (6)
as ∆𝑤𝑤𝑡𝑡 = −𝜂𝜂𝑔𝑔𝑡𝑡 /√(∑𝑡𝑡𝜏𝜏=1 𝑔𝑔𝜏𝜏2 ) where the denominator computes the L2
norm of all previous gradients on a per-dimension basis and is a global
learning rate shared by all dimensions.
(b) Differentiate gradient descent with and without momentum. Give equations (8)
for weight updation in GD with and without momentum. Illustrate plateaus,
saddle points and slowly varying gradient.
OR
14. (a) Suppose a supervised learning problem is given to model a deep feed forward (9)
neural network. Suggest solutions for the following a) small sized dataset for
training b) dataset with unlabeled data c) large data set but data from different
distribution.
(b) Describe the effect in bias and variance when a neural network is modified (5)
with more number of hidden units followed with dropout regularization
15. (a) Draw and explain the architecture of Convolutional Neural Networks (8)
(b) Suppose that a CNN was trained to classify images into different categories. (6)
It performed well on a validation set that was taken from the same source as
the training set but not on a testing set, which comes from another
distribution. What could be the problem with the training of such a CNN?
How will you ascertain the problem? How can those problems be solved?
OR
16. (a) What is the motivation behind convolution neural networks? (4)
(b) Discuss all the variants of the basic convolution function. (10)
17. (a) Describe how an LSTM takes care of the vanishing gradient problem. Use (8)
some hypothetical numbers for input and output signals to explain the
concept.
(b) Draw and explain the architecture of Recurrent Neural Networks (6)
OR
18. (a) Explain the application of LSTM in Natural Language Processing. (8)
(b) Discuss the architecture of GRU. (6)
(b) Explain the merits and demerits of using Autoencoders in Computer Vision. (6)
OR
(b) Compare Boltzmann Machine with Deep Belief Network. (7)
Teaching Plan
No. of
Lecture
No Contents Hours
(36 hrs)
Module-1 (Neural Networks ) (7 hours)
1.1 Introduction to neural networks -Single layer perceptrons 1

1.2 Multi Layer Perceptrons (MLPs), Representation Power of MLPs 1
1.3 Activation functions - Sigmoid, Tanh, ReLU, Softmax. , Risk minimization,
1
Loss function
1.4 Training MLPs with backpropagation 1
1.5 Illustration of back propagation algorithm 1
1.6 Practical issues in neural network training - The Problem of Overfitting,
1
Vanishing and exploding gradient problems
1.7 Difficulties in convergence, Local and spurious Optima, Computational
1
Challenges.
Module-2 (Deep learning) (9 hours)
2.1 Introduction to deep learning, Deep feed forward network 1

2.2 Training deep models, Concepts of Regularization and optimization, 1
2.3 Gradient Descent (GD), GD with momentum, 1

2.4 Nesterov accelerated GD, Stochastic GD, 1
2.5 AdaGrad, RMSProp, Adam, 1
2.6 L1 and L2 regularization, Early stopping, Dataset augmentation, 1
2.7 Parameter sharing and tying, Injecting noise at input, Ensemble methods 1
2.8 Parameter sharing and tying, Injecting noise at input, Ensemble methods 1
2.9 Dropout, Parameter initialization.
Module-3 (Convolutional Neural Network) (6 hours)
3.1 Convolutional Neural Networks – convolution operation 1

3.2 motivation, pooling 1
3.3 Convolution and Pooling as an infinitely strong prior 1
3.4 Variants of convolution functions 1
3.5 structured outputs, data types. 1
3.6 Efficient convolution algorithms. 1
Module- 4 (Recurrent Neural Network) (5 hours)
4.1 Recurrent neural networks – Computational graphs, RNN design 1

4.2 Encoder – decoder sequence to sequence architectures 1
4.3 Deep recurrent networks, recursive neural networks 1
4.4 Modern RNNs LSTM 1
4.5 GRU 1
Module-5 (Application Areas)( 9 hours)
5.1 Computer vision. (TB1: Section 12.2) 1

5.2 Speech recognition. (TB1: Section 12.3) 1
5.3 Natural language processing. (TB1: Section 12.4) 1
Common Word Embedding - Continuous Bag-of-Words, Word2Vec (TB3:
5.4 1
Section 2.6)
Common Word Embedding - Global Vectors for Word

5.5 1
Representation(GloVe) (TB3: Section 2.9.1- Pennigton 2014)
Brief introduction on current research areas - Autoencoders, Representation
5.6 1
learning. (TB3: Section 4.10)
Brief introduction on current research areas - representation learning. (TB3:
5.7 1
Section 9.3)
Brief introduction on current research areas - Boltzmann Machines, Deep
5.8 1
belief networks. (TB1: Section 20.1, TB3 Section 6.3)
Brief introduction on current research areas - Deep belief networks. (TB1:
5.9 1
Section 20.3)
YEAR OF
PROGRAMMING CATEGORY L T P CREDIT
CST424 INTRODUCTION
PARADIGMS
PEC 2 1 0 3 2019
Preamble: The course provides the learners a clear understanding of the main constructs of
contemporary programming languages and the various systems of ideas that have been used to
guide the design of programming languages. This course covers the concepts of Names, Bindings
& Scope, Statement-Level Control Structures, Sub Programs, Support for Object Oriented
Programming, Exception Handling, Concurrency Control, Functional Programming and Logic
Programming. This course helps the learners to equip with the knowledge necessary for the critical
evaluation of existing and upcoming programming languages. It also enables the learner to choose
the most appropriate language for a given programming task, apply that language's approach to
structure or organize the code, classify programming languages based on their features and to
design new generation languages.
Prerequisite: Sound knowledge in Programming in C and Object-Oriented Programming.
Explain the criteria for evaluating programming languages and compare Imperative,
CO1 Functional and Logic programming languages (Cognitive Knowledge Level:
Understand)
Illustrate the characteristics of data types and variables (Cognitive Knowledge Level:
CO2
Apply)
Comprehend how control flow structures and subprograms help in developing the
CO3 structure of a program to solve a computational problem (Cognitive Knowledge
Level: Apply)
Explain the characteristics of Object-Oriented Programming Languages (Cognitive

CO4
Compare concurrency constructs in different programming languages (Cognitive

CO5
CO1
CO2
CO3
CO4
CO5
Assessment Pattern

Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3

Attendance 10 marks

two completed modules and 1 question from the partly completed module), having 3 marks for
Part B contains 7 questions (preferably, 3 questions each from the completed two modules and 1


1. Compare any three programming languages based on the language evaluation criteria.
Prepare a list of characteristics that affect the language evaluation criteria.
2. Identify the advantages and disadvantages of imperative, functional and logic
programming languages.

1. Two most important design issues that are specific to character string types are
(1) whether a string is simply a special kind of character array or a primitive type.
(2) whether strings have static or dynamic length.
Identify the implementations options for the above two cases.
2. Consider the following records of a particular language. Let the size of each char variable
be 1 byte, int be 4 bytes and and Boolean be 1 bit.
Struct Student
{
int id;
char name[2];
int age;
boolean scholarship;
}
Draw and comment on the possible memory layouts for the record for a 32-bit aligned
machine

1. Explain three situations where a combined counting and logical looping statement is
needed.
2. Describe the ways that aliases can occur with pass-by-reference parameters.
3. Identify the two fundamental design considerations for parameter-passing methods.
4. What will be the output of the given program segment if it uses the following parameter
passing mechanisms:
a) call by reference
b) call by value
x : integer – – global
procedure foo(y : integer)
y := 3
print x
...
x := 2
foo(x)
print x

1. Describe the role of a virtual method table in implementing dynamic method binding.
2. Identify the merits and demerits of inheritance.
1. Evaluate the use of semaphores and monitors for providing competition synchronization
and cooperation synchronization.
Syllabus
Module – 1
Introduction – Role of Programming Languages, Programming Domains, Language Evaluation
Criteria, Influence on Language Design, Language Design Trade-offs, Implementation Methods.
Names, Bindings & Scope – Names, Variables, Concept of Binding, Scope and Lifetime,
Referencing Environments.
Module - 2
Data Types – Primitive Data Types, Character String Types, User-Defined Ordinal Types, Array
Types, Record Types, List Types, Pointer & Reference Types, Type Checking, Strong Typing,
Type Equivalence. Expressions – Arithmetic Expressions, Overloaded Operators, Type
Conversions, Relational and Boolean Expressions, Short-Circuit Evaluation. Assignment -
Assignment Statements, Mixed-mode Assignment.
Module - 3
Statement-Level Control Structures – Selection Statements, Iterative Statements, Unconditional
Branching, Guarded Commands. Subprograms – Design Issues of Subprograms, Local
Referencing Environments, Parameter Passing Methods, Subprograms as Parameters,
Overloaded Subprograms, Closures, Co-routines
Module - 4
Support for Object Oriented Programming – Inheritance, Dynamic Binding, Design Issues for
Object Oriented Languages, Support for Object Oriented Programming in C++, Implementation
of Object-oriented Constructs. Exception Handling – Basic Concepts, Design Issues.
Module - 5
Concurrency – Subprogram Level Concurrency, Semaphores, Monitors, Message Passing.
Functional Programming Languages – Introduction to LISP and Scheme, Comparison of
Functional and Imperative Languages. Logic Programming Languages – Basic Elements of

Prolog, Applications of Logic Programming.
Text Books
1. Robert W Sebesta, Concepts of Programming Languages, 10th Edition, Pearson.
2. Scott M L, Programming Language Pragmatics, 3rd Edition, Morgan Kauffman
Publishers.
ReferenceBooks
1. Kenneth C. Louden, Programming Languages: Principles and Practice, 2nd Edition,
Cengage Learning.
2. Tucker A. B. and R. E. Noonan, Programming Languages: Principles and Paradigms, 2nd
Edition. –TMH.
3. Ravi Sethi, Programming Languages: Concepts & Constructs, 2nd Edition., Pearson
Education.
4. David A. Watt, Programming Language Design Concepts, Wiley Dreamtech.

QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
Course Code: CST424
Course Name: Programming Paradigms
PART A
1. Differentiate between readability and writability.
2. Define binding and binding time.
3. What are the advantages of user-defined enumeration types?
4. Define narrowing and widening conversions.
5. Why for statement in C language is more flexible than that of older languages?
6. What are the advantages and disadvantages of dynamic local variables in

subprograms?
7. Illustrate the concept of dynamic method binding with an example.
8. Is it mandatory to use constructors in object-oriented languages? Justify your answer.
9. What are the applications of logic programming languages?
10. Explain the working of let and let-rec constructs in Scheme.

(10x3=30)
Part B
11. (a) Explain different criteria used for evaluating languages. (7)
(b) Consider the following pseudocode: (7)

x : integer := 3
y : integer := 4
procedure add
x := x + y
procedure second(P : procedure)
x : integer := 5
P()
procedure first
y : integer := 6
second(add)
first()
write integer(x)
(a) What does this program print if the language uses static scoping? Give
reasons.
(b) What does it print if the language uses dynamic scoping? Give reasons.
OR
12. (a) With respect to storage binding, explain the meanings, purposes, advantages and (7)
disadvantages of four categories of scalar variables.
(b) What is meant by referencing environment of a statement? Show the (7)

referencing environment at the indicated program points (1), (2), (3) & (4) for
the following program segment. Assume that the programming language is
statically scoped.
program example;
var a, b : integer;
procedure sub1;
var x, y: integer;
begin { sub1 }
……….. (1)
end { sub1 }
procedure sub2;
var x : integer;
……..
procedure sub3;
var x: integer;
begin { sub3 }
……….. (2)
end { sub3 }
begin { sub2 }
……….. (3)
end { sub2}
begin {example}
……….. (4)
end {example }
13. (a) Explain any two issues associated with the pointer data types and also indicate (7)
how dangling pointer problem can be solved.
(b) Describe the lazy and eager approaches for reclaiming garbage. (7)
OR
14. (a) What is meant by side effect and illustrate the advantages of referential (8)
transparency?
(b) Explain the terms: compound assignment operator, coercion and short circuit (6)
evaluation.
15. (a) Illustrate the different categories of iteration control statements. (8)
(b) Explain the techniques used for identifying the correct referencing environment (6)
for a subprogram that was sent as a parameter.
OR
16. (a) Describe the implementation models of Parameter passing. (10)
(b) Differentiate coroutines from conventional subprograms. (4)
17. (a) What is meant by an exception handler? Explain how exceptions are handled in (7)
object-oriented languages.
(b) Describe the design issues in object-oriented languages. (7)
OR
18. (a) Illustrate how a virtual method table can be used for implementing dynamic (7)
method binding.
(b) Explain the different categories, merits and demerits of inheritance. (7)
19. (a) Compare functional and imperative programming languages. (7)
(b) Explain the role of monitors in concurrency. (7)
OR
20. (a) Explain the searching strategies used in Prolog. Why backward chaining is (10)
preferred over forward chaining in Prolog?
(b) (let ((a 6) (4)
(b 8)
(square (lambda (x) (* x x)))
(plus +))
(sqrt (plus (square a) (square b))))
Write the output of the above code? Explain how let and lambda construct
works?
Teaching Plan
No. of
Lecture
No Contents Hours
(36 hrs.)
Module-1 (7 hours)
Introduction: Reasons for studying Concepts of programming languages,

1.1 1 hour
Programming Domains
1.2 Language Evaluation Criteria 1 hour
1.3 Influence on Language Design, Language Design Trade-offs 1 hour
1.4 Implementation Methods 1 hour
1.5 Names, Variables 1 hour
1.6 Concept of Binding 1 hour
1.7 Scope and Lifetime, Referencing Environments 1 hour
Module-2 (7 hours)
2.1 Primitive Data Types, Character String Types 1 hour
2.2 User-Defined Ordinal Types, Array Types 1 hour
2.3 Record Types, List Types, Pointer and Reference Types 1 hour
Implementation of pointer and reference types, Type Checking, Strong

2.4 1 hour
Typing, Type Equivalence
2.5 Expressions and Assignment Statements, Arithmetic Expressions 1 hour
2.6 Overloaded Operators, Type Conversions 1 hour
Relational and Boolean Expressions, Short-Circuit Evaluation, Assignment

2.7 1 hour
Statements, Mixed-mode Assignment
Module-3 (8 hours)
3.1 Selection Statements, Iterative Statements 1 hour
3.2 Unconditional Branching 1 hour

3.3 Guarded Commands 1 hour
3.4 Subprograms: Design Issues of Subprograms 1 hour
3.5 Local Referencing Environments 1 hour
3.6 Parameter Passing Methods 1 hour
3.7 Subprograms as Parameters, Overloaded Subprograms 1 hour
3.8 Closures, Co-routines 1 hour
Module-4 (7 hours)
4.1 Inheritance 1 hour
4.2 Dynamic Binding 1 hour
4.3 Design Issues for Object Oriented Languages 1 hour
4.4 Support for Object Oriented Programming in C++ 1 hour
4.5 Implementation of Object-Oriented Constructs 1 hour
4.6 Exception Handling – Basic Concepts 1 hour
4.7 Exception Handling - Design Issues 1 hour
Module-5 (7 hours)
5.1 Subprogram Level Concurrency 1 hour
5.2 Semaphores, Monitors 1 hour
5.3 Message Passing 1 hour
5.4 Introduction to LISP and Scheme 1 hour
5.5 Comparison of Functional and Imperative Languages 1 hour
5.6 Basic Elements of Prolog 1 hour
5.7 Applications of Logic Programming 1 hour

YEAR OF
NETWORK SECURITY CATEGORY L T P CREDIT INTRODUCTION
CST434
PROTOCOLS
PEC 2 1 0 3 2019
Preamble: This course helps the learners to explore various network and system security
protocols. This course covers authentication protocols, firewalls and security protocols from
different layers such as data link, network, transport and application. The concepts covered in
this course enable the learners in effective use of security protocols for securing network
applications.
Prerequisite: A fundamental knowledge in the concepts of Security in Computing.
CO1 Explain authentication protocols, X.509 authentication service and Public

Key Infrastructure (PKI).(Cognitive Knowledge Level: Understand)
CO2 Identify the security mechanisms in E mail security services. (Cognitive
CO3 Summarize the network and transport layer security services provided in a
secure communication scenario. (Cognitive Knowledge Level: Apply)
CO4 Describe real time communication security and application layer security
protocols. (Cognitive Knowledge Level: Apply)
CO5 Explain the concepts of firewalls and wireless network security. (Cognitive
CO1
CO2
CO3
CO4
CO5
Assessment Pattern
End Semester
Examination (%)
Remember 20 20 20
Understand 50 50 50
Apply 30 30 30
Analyse
Evaluate
Create
Mark Distribution

150 50 100 3
Syllabus
Module-1 (Authentication Protocols)

Authentication Protocols – Mutual authentication, One way authentication. Kerberos –
Kerberos Version 4, Kerberos Version 5. X.509 Authentication service. Public Key
Infrastructure (PKI) – Trust models, Revocation.
Module-2 (E-mail Security)

Pretty Good Privacy (PGP) – Operational Description, Cryptographic keys and key rings,
Message format, PGP message generation, PGP message reception, Public key management.
S/MIME – Functionality, Messages, Certificate processing, Enhanced security services.
Module-3 (Network Layer Security and Web Security)

Internet Protocol Security (IPSec) – Overview, IP security architecture, Authentication
Header (AH), Encapsulating Security Payload (ESP), Combining Security Associations, Key
management. Internet Key Exchange (IKE) - Phases. Web Security – Web security
considerations. Secure Socket Layer and Transport Layer Security (SSL/TLS) – SSL
Architecture, SSL protocols, Cryptographic computations, Transport layer security.
Module-4 (Real-time Security and Application Layer Security)

Real-time communication security – Perfect Forward Secrecy (PFS), Denial-of-Service
protection, Endpoint identifier hiding, Live partner reassurance. Hypertext Transfer Protocol
Secure (HTTPS) – Connection initiation, Closure. Secure Shell (SSH) – Transport layer
protocol, User authentication protocol, Connection protocol. Secure Electronic Transaction
(SET) – Overview, Features, Participants, Dual signature, Payment processing.
Module-5 (System Security and Wireless Security)

Firewalls – Firewall characteristics, Types of Firewalls, Firewall configurations, Encrypted
Tunnels, Trusted systems – Data access control, The concept of Trusted Systems, Trojan
horse defense. IEEE 802.11i wireless LAN security - Services, Phases of operation, Wired
Equivalent Privacy (WEP), Wi-Fi Protected Access (WPA), WPA2.
Text Books
1. William Stallings, Cryptography and Network Security Principles and Practice, 4/e,
Pearson Ed.
2. C. Kaufman, R. Perlman and M. Speciner, “Network Security: Private Communication in a
Public World”, 2/e, PHI.
References
1. Behrouz A. Forouzan, DebdeepMukhopadhyay, “Cryptography and Network Security”, 3/e,
Tata McGraw Hill.
2. Tyler Wrightson, “Wireless Network Security A Beginner’s Guide”, 2012, Tata McGraw Hill.
3. William Stallings, “Network Security Essentials: Applications and Standards”, 4/e, Prentice
Hall.
4. Schiller J., Mobile Communications, 2/e, Pearson Education.
5. Roberta Bragg et. al., “Network Security: The Complete Reference”, Tata McGraw Hill

1. Identify the threats associated with user authentication over a network or Internet.
2. In the context of Kerberos, mention the significance of a realm.
1. Mention the use of R64 conversion for an e-mail application.
2. Give the general structure of Private and Public Key rings in PGP.
1. In AH protocol, identify the fields in an IP header which are included in MAC
calculation. For each of the fields in the IP header, indicate whether the field is
immutable, mutable but predictable, or mutable. Justify your decision for each
field.
2. Is it possible for the receiver to reorder SSL record blocks that arrive out of order?
If so, explain how it can be done. If not, why?
1. Devise a protocol based on a pre-shared secret key that hides identities and gives
Perfect Forward Secrecy (PFS) for identity hiding. Make two variants, one in
which an active attacker can learn only the initiator’s identity, and one in which an
active attacker can learn only the target’s identity.
2. Explain the tasks performed by the payment gateway during Payment
Authorization in SET.
1. List the weaknesses of a packet-filtering router.
2. Give the relevance of pair wise keys and group keys in IEEE 802.11i.
3. State the design goals of firewalls.

QP CODE: PAGES: ___
Reg No:_______________
Name:_________________
Course Code: CST434

Course Name: NETWORK SECURITY PROTOCOLS

PART A
1. List any three requirements of Kerberos.
2. Specify the significance of key pair recovery. When is the key pair updated?
3. Why does PGP generate signature before applying compression?
4. List the four principal services provided by S/MIME.
5. Explain the significance of Alert protocol in SSL and list out any three Alert
messages with their uses.
6. Specify the purpose of MAC during the change cipher spec TLS exchange.
7. What is the advantage, if any, of not including the MAC in the scope of packet
encryption in SSH packets?
8. Givethe significance of dual signature in SET.
9. List the IEEE 802.11i services.
10. How is the concept of association related to that of mobility in wireless

networks? (10x3=30)
Part B
Marks)
11. (a) Describe the requirements for a public-key certificate scheme. (8)
(b) Explain the significance of chain of certificates. (6)
OR
12. (a) Specify the purpose of the X.509 standard. How is an X.509 certificate
revoked? (8)
(b) Describe the management functions of a PKI. What is a cross certificate? (6)
13. (a) List the services provided by PGP and explain how authentication and (8)
confidentiality are provided.
(b) Explain the functionalities provided by S/MIME. (6)
OR
14. (a) Give the format of a PGP message and specify the significance of each (8)
field in the message.
(b) Explain the enhanced security services provided in S/MIME. (6)
15. (a) Explain the parameters that identify an SSL session state. (8)
(b) Differentiate between transport mode and tunnel mode in IPSec. (6)
OR
16. (a) The IPsec architecture document states that when two transport mode SAs (8)
arebundled to allow both AH and ESP protocols on the same end-to-end
flow, only one ordering of security protocols seems appropriate: performing
the ESP protocol before performing the AH protocol. Why is this approach
recommended rather than authentication before encryption?
(b) List and explain the purpose each Alert Codes supported by SSL. (6)
17. (a) Illustrate the significance ofperfect forward secrecy. (6)
(b) Explain the key features provided by SET. (8)
OR
18. (a) List and explain the SSH protocols. (8)
(b) “The HTTPS capability is built into all modern web browsers”. Justify. (6)
19. (a) Explain the phases of operations in IEEE 802.11i. (8)
(b) Give the significances of Encrypted Tunnels (6)
OR
20. (a) Compare the features of three types of firewalls. (8)
(b) Compare the Wireless LAN protocols WEP, WPA and WPA2 (6)
TEACHING PLAN
No Contents No.of
Lecture
Hours
(35 Hrs)
Module-1 (Authentication Protocols)(7hrs)

1.1 Authentication Protocols – Mutual authentication, One way 1
authentication
1.2 Kerberos –Version 4 1
1.4 Differences between Kerberos Version 4 and Version 5, Kerberos 1
Version 5
1.5 X.509 Authentication service – Certificates, Authentication 1
Procedures, X.509 Version 3
1.6 Public Key Infrastructure (PKI) – Trust models 1
1.7 Public Key Infrastructure (PKI) – Revocation 1

Module-2 (E-mail Security) (6 hrs)
1
2.1 Pretty Good Privacy (PGP) – Operational Description
Cryptographic keys and key rings, Message format 1

2.2
2.3 PGP message generation, PGP message reception 1
2.4 PGP -Public key management 1
2.5 S/MIME – Overview of MIME, Functionality, Messages 1
2.6 S/MIME - Certificate processing, Enhanced security services 1
Module-3 (Network Layer Security and Web Security)(8 hrs)
3.1 Internet Protocol Security (IPSec) – Overview, IP security 1

architecture
3.2 Authentication Header (AH) 1
3.3 Encapsulating Security Payload (ESP) 1
3.4 Combining Security Associations, Key management 1
3.5 Internet Key Exchange (IKE) – Phases 1
3.6 Web Security – Web security considerations. Secure Socket 1
Layer and Transport Layer Security (SSL/TLS) – SSL
Architecture
3.7 SSL Protocols - Record Protocol, Change Cipher Spec Protocol, 1
Alert Protocol
3.8 SSL Handshake Protocol, Cryptographic computations, 1
Transport Layer Security
Module-4 (Real-time Security and Application Layer Security) (8hrs)
4.1 Real-time communication security – Perfect Forward Secrecy 1

(PFS)
4.2 Denial-of-Service protection, Endpoint identifier hiding, Live 1

partner reassurance
Hypertext Transfer Protocol Secure (HTTPS) – Connection 1
4.3
initiation, Closure
4.4 Secure Shell (SSH) – Transport layer protocol 1
4.5 User authentication protocol 1
4.6 Connection protocol 1

4.7 Secure Electronic Transaction (SET) – Overview, Features, 1
Participants
4.8 Dual signature, Payment processing 1
Module-5 (System Security and Wireless Security) (6 hrs)
Firewalls – Firewall characteristics, Types of Firewalls 1

5.1
5.2 Firewalls – Firewall configurations, Encrypted Tunnels 1
5.3 Trusted systems – Data Access Control, The Concept of Trusted 1

Systems, Trojan Horse Defense
5.4 IEEE 802.11i wireless LAN security - Services, Phases of 1
operation
5.5 Wired Equivalent Privacy (WEP) 1
5.6 Wi-Fi Protected Access (WPA), WPA2 1
YEAR OF
INTRODUCTION
CST444 SOFT COMPUTING
PEC 2 1 0 3 2019
Preamble: This course enables the learners to understand the concepts of Soft Computing
techniques and its applications. It covers Artificial Neural Networks, operations and models of
fuzzy logic, genetic algorithms and multi objective optimization techniques. This course helps the
students to develop algorithms and solutions for different real world applications.
Prerequisite: NIL.
CO1 Describe soft computing techniques and the basic models of Artificial Neural Network
CO2 Solve practical problems using neural networks (Cognitive Knowledge Level: Apply)
CO3 Illustrate the operations, model and applications of fuzzy logic (Cognitive Knowledge
Level: Apply)
CO4 Illustrate the concepts of Genetic Algorithm (Cognitive Knowledge Level: Apply)
CO5 Describe the concepts of multi-objective optimization models and the need for using
hybrid soft computing approaches(Cognitive Knowledge Level: Understand)
CO1
CO2
CO3
CO4
CO5
Assessment Pattern

Test 1 (%) Test 2 (%) Marks (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3

Attendance 10 marks

answer any 5.


1. Describe the necessity of Activation function? Examine the various aspects of sigmoidal
activation function. List the drawbacks. Calculate the net output of the following neural
network using the bipolar and binary sigmoidal activation function.
2. Explain the architecture of McCulloch-Pitts Neuron network model. Implement

NAND(NOT-AND) gate function using M-P Neuron Model(with binary input).

1. Find the weights required to perform classification of patterns shown below using
perceptron network. The patterns (1,1,-1) and ( 1, -1,-1) are belonging to the target class
-1. The patterns (-1,1,1) and (-1,-1,1) are belonging to the target class +1. Assume suitable
learning rate and initial weights.
2. Explain the architecture and training algorithm of Adaline network . Use Adaline nerwork
to train NOR logic function with bipolar inputs and targets. Perform 2 epochs of training.

1. There is an imprecise relationship between the ambient temperature for clay masonry
bricks and their compressive strengths. Let X be a fuzzy set of fracture strengths and Y be
a fuzzy set of temperatures with the following membership functions:
(a) Find the Cartesian Product of X and Y and represent it as relation R.

Suppose there is a second fuzzy set of masonry lengths given as
(b) Find S=ZoR using max-min composition (c) Find T=ZoR using max-product composition
2. Given two universes X={x1,x2,x3,x4,x5} and Y={y1,y2,y3,y4,y5},the fuzzy sets A

defined on X and fuzzy set B defined on Y are given below:
0.4 0.7 1 0.8 0.6 0.2 0.6 1 0.9 0.7
𝐴𝐴 = � 𝑥𝑥1 + 𝑥𝑥2 + 𝑥𝑥3 + 𝑥𝑥4 + 𝑥𝑥5 � 𝐵𝐵 = � 𝑦𝑦1 + 𝑦𝑦2 + 𝑦𝑦3 + 𝑦𝑦4 + 𝑦𝑦5 �
(i)Find the relation R = A × B

0.4 1 0.8
Consider another fuzzy set C defined on the universe V={v1,v2,v3}, 𝐶𝐶 = � 𝑣𝑣1 + 𝑣𝑣2 + 𝑣𝑣3 �
(ii) Find P = B × C. Using max-min composition, Find RoP.

1. Illustrate the various types of cross over with suitable examples.
2. Using Genetic algorithm with Roulette wheel selection method maximize the function
f(x)=x2 over {0, 1, 2, ..., 31} with initial x values of (13, 24, 8, 19). Show one crossover
and mutation.

1. Explain strong dominance and weak pareto-optimality.
2. What are the different classifications of neuro-fuzzy hybrid systems?
Syllabus
Module – 1 (Introduction to Soft Computing & Artificial Neural Network)
Introduction to Soft Computing. Difference between Hard Computing & Soft Computing.
Applications of Soft Computing. Artificial Neurons Vs Biological Neurons. Basic models of
artificial neural networks – Connections, Learning, Activation Functions. McCulloch and Pitts
Neuron. Hebb network.
Module – 2 (Supervised Learning Network)
Perceptron Networks– Learning rule, Training and testing algorithm. Adaptive Linear Neuron–
Architecture, Training and testing algorithm. Back propagation Network – Architecture, Training
and testing algorithm.
Module - 3 (Fuzzy Logic & Defuzzification)
Fuzzy sets – properties, operations on fuzzy set. Fuzzy membership functions, Methods of
membership value assignments – intuition, inference, Rank Ordering. Fuzzy relations– operations
on fuzzy relation. Fuzzy Propositions. Fuzzy implications. Defuzzification– Lamda cuts,
Defuzzification methods.
Module - 4 (Fuzzy Inference System & Genetic Algorithm)

Fuzzy Inference Systems - Mamdani and Sugeno types. Fuzzy Logic Controller. Concepts of
genetic algorithm. Operators in genetic algorithm - coding, selection, cross over, mutation.
Stopping condition for genetic algorithm.
Module - 5 (Multi Objective Optimization & Hybrid Systems)
Multi objective optimization problem. Principles of Multi- objective optimization, Dominance and
pareto-optimality. Optimality conditions. Neuro-fuzzy hybrid systems. Genetic – neuro hybrid
systems.
Text Books
1. S.N.Sivanandam and S.N. Deepa, Principles of Soft Computing , 2ndEdition, John Wiley &
Sons.
2. Kalyanmoy Deb, Multi-objective Optimization using Evolutionary Algorithms, 1st
Edition, John Wiley & Sons.
ReferenceBooks
1. Timothy J Ross, Fuzzy Logic with Engineering Applications, John Wiley & Sons, 2016.
2. T.S.Rajasekaran, G.A.Vijaylakshmi Pai “Neural Networks, Fuzzy Logic & Genetic
Algorithms Synthesis and Applications”, Prentice-Hall India.
3. Simon Haykin, “Neural Networks- A Comprehensive Foundation”, 2/e, Pearson Education.
4. Zimmermann H. J, “Fuzzy Set Theory & Its Applications”, Allied Publishers Ltd.
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
Course Name: Soft Computing
PART A
1. Explain the architecture of a simple Artificial Neural network? Compare it with a

biological neuron.
2. A 4-input neuron has weights 1, 2, 3 and 4. The transfer function is linear with the
constant of proportionality being equal to 2. The inputs are 4, 10, 5 and 20
respectively. Predict the output?
3. Explain the Widrow-Hoff learning rule for supervised learning in neural networks
with help of an example. Why is it sometimes called the LMS learning rule?
4. Implement one epoch of Adaline algorithm for AND logic function with binary
inputs and bipolar outputs. Initial weights are w1=0.2, w2=0.1 and learning rate
parameter η=0.2.
5. 0.2
Consider two fuzzy sets 𝐴𝐴 = � 0 +
0.3 1
+2+
0.1
+
0.5 0.1
� 𝐵𝐵 = � 0 +
0.25
+
0.9
+
0.7
+
1 3 4 1 2 3
0.3
4
� Find the following: (a) Algebraic sum (b) Algebraic product(c) Bounded sum.
6. Using your own intuition and definition of universe of discourse, plot membership
functions for liquid level (Empty, very less, less, full, very full) in a tank.
7. Explain Stochastic Universal Sampling with an example.
8. Explain any two mutation methods.
9. Differentiate between linear and nonlinear Multi Objective Optimization Problem.
10. What are the characteristics of neuro fuzzy hybrid systems?

(10x3=30)
Part B
11. (a) Implement XOR function using M-P Neuron Model (with binary input).Why (8)
M-P neuron is widely used in processing binary data?
(b) Using Hebb Network calculate the weight required to perform the following (6)
classification of given input pattern.
L belongs to the members of the class(+)target value +1
Udoes not belongs to members of class(.)target value -1
L U
OR
12. (a) Compare the three learning approaches in Artificial Neural Network. How is (8)
the critic information used in learning process.
(b) Define Hebb Law. Design a Hebb Network to implement logical AND (7)
function. Use bipolar input and targets.
13. (a) Discuss the training algorithm and explain the weight updates in back (10)
propagation networks.
(b) Implement one epoch of Perceptron training algorithm for OR logic function (4)
with binary input and bipolar output.
OR
14. (a) Explain how synaptic weights are adapted iteration by iteration using error (10)
correction rule in Perceptron convergence algorithm for an OR gate with
bipolar inputs and outputs. Initial weights are all zero and learning rate
parameter η=0.1.
(b) Explain Perceptron convergence theorem and discuss Perceptron algorithm (4)
based on XOR logic function.
15. (a) Three fuzzy sets are defined as follows: (10)

0.1 0.2 0.3 0.4 1 0.2 0.5 0.7 0.3 0
𝐴𝐴 = � 30 + 60 + 90 + 120 �,𝐵𝐵 = �1 + 2 + 3 + 4 + 5 + 6�,
0.33 0.65 0.92 0.21

𝐶𝐶 = � + + + �
100 200 300 400
Find: (i)𝑅𝑅 = 𝐴𝐴 × 𝐵𝐵 (ii)𝑆𝑆 = 𝐵𝐵 × 𝐶𝐶 (iii)𝑇𝑇 = 𝑅𝑅𝑅𝑅𝑅𝑅, using Max-Min composition

(iv)𝑇𝑇 = 𝑅𝑅𝑅𝑅𝑅𝑅, using Max-Product composition.
(b) For the fuzzy sets given 𝐴𝐴 = �0.5 + 0.2 + 0.9� and𝐵𝐵 = � 1 + 0.5 + 1 �. Find (4)
𝑥𝑥 1 𝑥𝑥 2 𝑥𝑥 3 𝑦𝑦 1 𝑦𝑦 2 𝑦𝑦 3
relation R by performing Cartesian product over the given fuzzy sets.
OR
16. (a) Using inference approach, find the membership values for each of the (8)
triangular shapes (I, R, IR, T) for a triangle with angles 120°, 50°, 10°.
(b) Using Zadeh’s notation, determine the ʎ - cut sets for the given fuzzy sets: (6)
0 0.5 0.65 0.85 1.0 1.0
𝑆𝑆1 = � + + + + + �
0 20 40 60 80 100
0 0.45 0.6 0.8 0.95 1.0
𝑆𝑆2 = � + + + + + �
0 20 40 60 80 100
Express the following for ʎ = 0.5: a) 𝑆𝑆1 ∪ 𝑆𝑆2 b) 𝑆𝑆´2 c) 𝑆𝑆1 ∩´ 𝑆𝑆2
17. (a) Differentiate between value encoding and permutation encoding. (8)
(b) Explain the stopping conditions for genetic algorithm. (6)
OR
18. (a) Apply Mamdani fuzzy model to design a controller to determine the wash (10)
time of a domestic washing machine. Assume input is dirt and grease of the
cloth. Use three descriptors for input variable and five descriptors for output
variables .Derive the set of rules for controller action and defuzzification.
Design should be supported by figure wherever possible.
(b) Explain Single-Point Crossover and Two-Point Crossover with example. (4)
19. (a) Explain convex and non convex MOOP? How to find a non dominated set. (10)
(b) What are the properties of dominance relation? (4)
OR
20. (a) Explain Genetic Neuro-Hybrid System with block diagram. Also write the (8)
advantages of Genetic- Neuro Hybrid systems.
(b) Discuss the classification of Neuro-Fuzzy Hybrid System. (6)

Teaching Plan
No. of
Lecture
No Contents Hours
(35 hrs)
Module-1 (Introduction to Soft Computing & Artificial Neural Network) (6 hours)
1.1 Introduction to Soft Computing 1 hour
Difference between Hard Computing & Soft Computing & Applications of

1.2 1 hour
Soft Computing
Artificial Neurons Vs Biological Neurons, Basic models of artificial neural

1.3 1 hour
networks
1.4 Activation Functions 1 hour
1.5 McCulloch and Pitts Neuron 1 hour
1.6 Hebb network 1 hour
Module-2 (Supervised Learning Network) (7 hours)
2.1 Perceptron networks – Learning rule, Training and testing algorithm 1 hour
2.2 Perceptron networks – Problems 1 hour
2.3 Adaptive Linear Neuron (Lecture I) 1 hour
2.4 Adaptive Linear Neuron (Lecture II) 1 hour
2.5 Adaptive Linear Neuron-Problems (Lecture III) 1 hour
2.6 Back propagation Network (Lecture I) 1 hour
2.7 Back propagation Network (Lecture II) 1 hour
Module-3 (Fuzzy Logic & Defuzzification) (8 hours)
3.1 Introduction to Fuzzy Set, Properties & operations on fuzzy sets 1 hour
3.2 Fuzzy membership functions, Fuzzification 1 hour
3.3 Methods of membership value assignments 1 hour
3.4 Fuzzy relations, Operations on Fuzzy Relation 1 hour

3.5 Fuzzy Propositions & Fuzzy Implications 1 hour
3.6 Lamda cuts for fuzzy sets 1 hour
3.7 Defuzzification methods(Lecture I) 1 hour
3.8 Defuzzification methods(Lecture II) 1 hour
Module-4 (Fuzzy Inference System & Genetic Algorithm) (6 hours)
4.1 Fuzzy Inference Systems - Mamdani type 1 hour
4.2 Fuzzy Inference Systems - Sugeno type 1 hour
4.3 Fuzzy Logic Controller 1 hour
4.4 Introduction to genetic algorithm, operators in genetic algorithm - coding 1 hour
4.5 Selection, Cross over 1 hour
4.6 Mutation, stopping condition for genetic algorithm 1 hour
Module-5 (Multi-Objective Optimization & Hybrid System) (8 hours)
5.1 MOOP-Linear &Non linear, Convex & Non Convex 1 hour
Principles of MOO-Illustrating Pareto Optimal Solutions, Objectives in

5.2 1 hour
MOO
5.3 Dominance & Pareto-Optimality-Concept of Domination 1 hour
5.4 Properties of Dominance Relation, Pareto Optimality 1 hour
5.5 Procedure for finding a non dominated set 1 hour
5.6 Optimality Conditions 1 hour
5.7 Neuro Fuzzy hybrid system-Classification& characteristics 1 hour
5.8 Genetic –neuro hybrid systems 1 hour

YEAR OF
FUZZY SET THEORY CATEGORY L T P CREDIT INTRODUCTION
CST454
AND APPLICATIONS
PEC 2 1 0 3 2019
Preamble: This course equips the students to understand the concepts of fuzziness and its use in
building better solutions to problems. The course covers basic concepts of fuzzy sets, fuzzy
relations, fuzzy logic and building of fuzzy approximation-based solutions. It helps students to
design and develop fuzzy based solutions to real world applications.
Prerequisite: Basic knowledge in set theory.
CO1 Explain fuzzy logic based problem solving (Cognitive Knowledge Level:
Understand)
CO2 Summarize the concepts of crisp sets, crisp relations, crisp logic with fuzzy sets, fuzzy
relations and fuzzy logic(Cognitive Knowledge Level: Apply)
CO3 Develop fuzzy systems by selecting appropriate membership functions, fuzzification

and defuzzification methods (Cognitive Knowledge Level: Apply)
CO4 Develop solutions using graphical and rule-based methods(Cognitive Knowledge

Level: Apply)
CO5 Make use of fuzzy logic inference to solve real world problems(Cognitive Knowledge
Level: Apply)
0 2
CO1
CO2
CO3
CO4
CO5
Assessment Pattern

Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 20 20 20
Understand 50 50 50
Apply 30 30 30
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3

Attendance 10 marks

answer any 5.
Syllabus
Module – 1 (Basic Fuzzy Set Theory)
The case for imprecision, Utility and Limitations of Fuzzy Systems, Fuzzy Sets and Membership,
Classical Sets – Properties, Operations, Fuzzy Sets – Properties and Operations, Classical
Relations – Cartesian Product, Operations and Properties of Crisp Relations, Composition, Fuzzy
Relations – Cardinality, Operations, Properties, Fuzzy Cartesian Product and Composition.
Module – 2 (Fuzzy Membership Functions)
Tolerance and Equivalence Relations – Crisp and Fuzzy, Similarity Methods – Cosine, Min-max,
Fuzzy Membership Functions – Features, Fuzzification, Defuzzification to Crisp Sets, λ-Cutsfor
Fuzzy Relations, Linguistic Hedges.
Module - 3 ( Fuzzification and Defuzzification Methods)
Development of Membership Functions –Intuition, Inference, Rank ordering, Inductive reasoning.
Defuzzification to Scalars - Max membership principle, Centroid method, Weighted average
method, Mean max membership, Center of sums, Center of largest area, First (or last) of maxima.
Module - 4 (Fuzzy Inference)

Classical Logic, Fuzzy Logic, Approximate Reasoning, Fuzzy (Rule-Based) Systems - Multiple
conjunctive antecedents, Multiple disjunctive antecedents, Aggregation of fuzzy rules, Graphical
Techniques of Inference.
Module - 5 (Fuzzy Applications)
Applications of Fuzzy Systems - Fuzzy Classification, Fuzzy Pattern Recognition, Fuzzy Control
Systems, Fuzzy Systems and Neural Networks, Fuzzy Clustering, Fuzzy Databases and
Information retrieval systems.
Text Books
1. Fuzzy Logic with Engineering Applications – Timothy J. Ross, Third Edition, John Wiley
and Sons, 2010
2. Fuzzy Sets and Fuzzy Logic: Theory and Applications - George J. Klir and Bo Yuan ,
Prentice Hall, 1995.
Reference Books
1. Kenneth H. Rosen, Discrete Mathematics and Its Applications with Combinatorics and
GraphTheory, Seventh Edition, MGH,2011
2. Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to
Computer Science”, TataMc Graw Hill Pub. Co. Ltd., New Delhi,2003.
3. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete Mathematical Structures”,
Pearson Education Pvt Ltd., New Delhi,2003
4. Kenneth H .Rosen, “Discrete Mathematics and its Applications”, 5/e, TataMc Graw Hill Pub.
Co. Ltd, New Delhi2003
1. What are the limitations of crisp systems?
2. Explain the difference between randomness and fuzziness.
3. Find some examples of prospective fuzzy variables in daily life.
1. The strength of two types of concrete needs to be compared. Four concrete masonry units
(CMUs) from each type of concrete are stressed until they fail. The lowest stress at failure
of a CMU is denoted 1, and the highest stress at failure is denoted 4,so the CMUs are rank
ordered by failure stress, that is, X = {1, 2, 3, 4}. Since “failure” of CMUs is fuzzy, the
membership value for a specific CMU represents the judgment that the CMU really failed.
The following fuzzy sets represent the failure estimates for the two different concrete
types:
0 ⋅ 15 0.25 0 ⋅ 6 0.9
𝐴𝐴 = � + + + �
1 2 3 4
0.2 0.3 0.5 0.8
𝐵𝐵 = � + =+ + �
1 2 3 4
Calculate the union, intersection and difference for the two concrete types.
2. An engineer is testing the properties, strength and weight of steel. Suppose he has two
fuzzy sets A , defined on a universe of three discrete strengths, {s1, s2, s3}, and B, defined
on a universe of three discrete weights, {w1,w2,w3}. Suppose A and B represent a “high-
strength steel” and a “near-optimum weight,” respectively, as shown below
1 0.5 0.2
𝐴𝐴 = � + + �
𝑠𝑠1 𝑠𝑠2 𝑠𝑠3
1 0.5 0.2
𝐵𝐵 = � + + �
𝑤𝑤1 𝑤𝑤2 𝑤𝑤3
a) Find the fuzzy relation for the Cartesian product, R, of A and B

b) Introducing another fuzzy set, C, which represents a set of “moderately good”
steel strengths
0.1 0.6 1
𝐶𝐶 = � + + �
Find C◦R using max–min composition

1. Using your own intuition and your own definitions of the universe of discourse,plot fuzzy
membership functions for “age of people” who are:
(i) very young
(ii) young
(iii) middle-aged
(iv) old
2. a) Define membership functions for approximately isosceles triangle, approximately
equilateral and approximately right-angled triangles.
b) Find the membership value for the triangle represented by the angles 80◦, 75◦, 25◦, in the
above triangles.
3. In metallurgy, materials are made with mixtures of various metals and other elements to
achieve certain desirable properties. In a particular preparation of steel, three elements,
namely, iron, manganese, and carbon, are mixed in two different proportions. The samples
obtained from these two different proportions are placed on a normalized scale and are
represented as fuzzy sets A1 and A2. Do a logical union of the membership functions A1 and
A2 and find the defuzzified value of the resulting membership function.

1. Consider the following two discrete fuzzy sets, which are defined on universeX = {−5, 5}:
0 0.5 1 0.5 0
𝐴𝐴 = "𝑧𝑧ⅇ𝑟𝑟𝑟𝑟" = � + + + + �
−2 −1 0 1 2
0 0.6 1 0.6 0
𝐵𝐵 = "𝑝𝑝𝑝𝑝𝑝𝑝𝑝𝑝𝑝𝑝𝑝𝑝𝑝𝑝𝑝𝑝 𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚" = � + + + + �
0 1 2 3 4
Construct the relation for IF x is “zero” THEN y is “positive medium”
2. A metro train system uses fuzzy logic in ensuring smooth ride on the train. The metro train
system has fixed stops and the distance between the stops are known. The system uses
fuzzy logic in deciding the pressure applied on the brakes. The amount of pressure applied
depends on the distance to the next stop and the speed of the train. Design appropriate
membership functions for the input and illustrate the use of Mamdani Inference in arriving
at the brake pressure.

1. A fuzzy systems needs to be designed to provide a rating for a web store as “excellent”,
“good” or “poor”. The web store can be rated based on the products available, the
customer service and the discount provided. Design appropriate membership functions and
fuzzy rules for generating the fuzzy based rating system.
2. Design a fuzzy control system for an air-conditioning application. Make appropriate
decisions regarding inputs and outputs.
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
Course Code: CST454
Course Name: Fuzzy Set Theory and Applications
PART A
1. Illustrate where a fuzzy logic based application is suitable.
2. Consider a LAN using Ethernet protocol with maximum bandwidth of 10 Mbps.

Traffic rates can be represented using two fuzzy variables, Quiet and Congested. If
the universal set X = {0,1,2,3,4,5,6,7,8,9,10} represents bandwidth usage in Mbps,
then draw possible membership functions for the fuzzy variables.
3. Define fuzzy tolerance and equivalence relations.
4. Given two data points, illustrate how a similarity measure between them can be
computed.
5. Define a convex normalized fuzzy set.
6. How does augmented query help in information retrieval.
7. Given the propositions

(i) C˅D
(ii) ~H => (A ˄ ~B)
(iii) (C ˅ D) => ~H
(iv) (A ˄ ~B) => (R ˅ S)

Infer (R ˅ S) from the above propositions and state the tautologies used.
8. Write a predicate logic statement for “Ram likes all kinds of food”.
9. Given the relation R below, find λ-cut for the relation using suitable λ value.
1 0.8 0 0.1 0.2

⎡0.8 1 0.4 0 0.9⎤
⎢ ⎥
⎢ 0 0.4 1 0 0⎥
⎢0.1 0 0 1 0.5⎥
⎣0.2 0.9 0 0.5 1 ⎦
10. Define maximum approaching degree.

(10x3=30)
Part B
11. (a) An engineer is testing the properties, strength and weight of steel. Suppose he (4)
has two fuzzy sets A, defined on the universe of three discrete strengths { s1,
s2, s3 } and B, defined on the universe of discrete weights { w1, w2, w3}.
Suppose A represents a “high-strength steel” and B a “near-optimum weight”.
1 0.5 0.2 1 0.5 0.3
A = �𝑠𝑠1 + 𝑠𝑠2
+ 𝑠𝑠3
�, B = �𝑤𝑤1 + 𝑤𝑤2
+ 𝑤𝑤3
�
Find fuzzy Cartesian product, R, of A and B.
(b) Let a fuzzy set C= �0.1 + 0.6 1

+ � be introduced, which represents a set of (5)
“moderately good” steel strength. Find the max-min composition of C and R.
(c) Define 5 operations associated with crisp relations. (5)
OR
12. (a) How is excluded middle axiom different for crisp and fuzzy sets? (4)
(b) Differentiate between crisp and fuzzy sets with respect to their membership (4)
functions.
(c) Illustrate any 4 operations associated with a fuzzy relation. (6)

13. (a) A structural designer is considering four different kinds of structural beams (10)
{ S1, S2, S3, S4} for a new building. Laboratory experiments on the
deflection resistance for these four kinds of beams have been performed, and
the engineer wants to determine their suitability in the new structure. The
following data have been observed based on the overall deflection capacity of
each beam type:
S1 S2 S3 S4
No deflection X1 0.3 0.6 0.5 0.8
Some X2 0.6 0.3 0.5 0.2
deflection
Excessive X3 0.1 0.1 0 0
deflection
Use cosine amplitude method to determine the similarity of the four beam
types.
(b) Given a fuzzy set “tall” = �0.1 + 0.6

+
1
�, illustrate how the fuzzy set “very (4)
tall” be defined?
OR
14. (a) Define tolerance and equivalence relations. Check whether the relation R (4)
given below is tolerance or equivalence relation.
1 0.8 0 0.1 0.2
⎡0.8 1 0.4 0 0.9⎤
⎢ ⎥
⎢ 0 0.4 1 0 0⎥
⎢0.1 0 0 1 0.5⎥
⎢0.2 0.9 0 0.5 1 ⎥
(b) Given the following data regarding three cities and the quality of their (10)
bridges, find the similarity between the cities using max-min method.
C1 C2 C3
Poor Q1 0.00 0.10 0.10
Fair Q2 0.04 0.04 0.08
Good Q3 0.02 0.04 0.06
15. (a) Explain the process of developing membership functions using the inference (6)
method.
(b) The following raw data were determined in a pair wise comparison of new (8)
premium car preferences in a poll of 100 people. When it was compared with
a Porsche (P), 79 of those polled preferred a BMW (B), 85 preferred a
Mercedes (M), 59 preferred a Lexus (L), and 67 preferred an Infinity (I).
When a BMW was compared, the preferences were 21 – P, 23 – M, 37 – L,
and 45 – I. When a Mercedes was compared, the preferences were 15 – P, 77
– B, 35 – L, and 48 – I. When a Lexus was compared, the preferences were 41
– P, 63 – B, 65 – M, and 51 – I. Finally, when an Infinity was compared, the
preferences were 33 – P, 55 – B, 52 – M, and 49 – L. Using rank ordering,
plot the membership function for “most preferred car.”
OR
16. (a) 1. Defuzzify the following region using centroid method. (9)
(b) 2. Defuzzify the region given in 16(a) using weighted average method. (5)
17. (a) For a distillation process, the objective is to separate components of a mixture (8)
in the input stream. The relationship between the input variable, temperature,
and the output variable, distillate fractions, is not precise but the human
operator of this process has developed an intuitive understanding of this
relationship. The universe for each of these variables is
X = universe of temperatures (degree fahrenheit) = {160, 165, 170, 175, 180,

185, 190, 195}.
Y = universe of distillate fractions (percentage) = {77, 80, 83, 86, 89, 92, 95,
98}.
Given two fuzzy sets
0 0.7 1 0.4
A = “temperature of input steam is hot”= �175 + 180 + 185 + 190 �
0 0.5 0.8 1
B = “separation of mixture is good” =�89 + 92
+ 95
+ 98
�.
Find the fuzzy relation corresponding to “ IF x is 𝐴𝐴̃, THEN y is 𝐵𝐵�
(b) Show how inference is done using Generalized Modus Ponens (6)
OR
18. (a) Illustrate how graphical inference is done using Mamdani method. (6)
(b) A restaurant uses a fuzzy inference system to calculate the tips given to its (8)
employees. The tips are based on the timeliness of service and quality of
service of the waiters. Design appropriate membership functions for the input
and illustrate the use of Sugeno Inference in arriving at the tip amount.
19. (a) Explain fuzzy pattern recognition using multiple features. (7)
(b) Describe how fuzziness in information retrieval can enhance the quality of (7)
search results.
OR
20. (a) Design a fuzzy control system for an air-conditioning system. (7)
(b) Illustrate how the join operation is performed in fuzzy databases. (7 )
Teaching Plan
No. of
Lecture
No Contents Hours
(36 hrs)
Module-1(Basic Fuzzy Set Theory) (6 hours)
Introduction to Fuzzy Concepts – Case for imprecision- utility and limitations

1.1 1 hour
of Fuzzy Systems
1.2 Classical Sets – Properties, Operations 1 hour
1.3 Fuzzy Sets – Properties, Operations 1 hour
1.4 Classical Relations – Properties, Operations – Cartesian Product, 1 hour
Composition
1.5 Fuzzy Relations – Properties, Operations, Cardinality 1 hour
1.6 Fuzzy Cartesian Product, Fuzzy Composition 1 hour
Module-2 (Fuzzy Membership Functions) (6 hours)
2.1 Tolerance and Equivalence Relations - Crisp 1 hour
2.2 Tolerance and Equivalence Relations - Fuzzy 1 hour
2.3 Similarity Methods – Cosine, Minmax 1 hour
2.4 Fuzzy Membership Functions- Features 1 hour
2.5 Fuzzification, Defuzzification to crisp sets – λ-cuts 1 hour
2.6 Linguistic Hedges 1 hour
Module-3 (Fuzzification and Defuzzification Methods) (7 hours)
3.1 Development of Membership Functions – Intuition, Inference 1 hour
3.2 Development of Membership Functions – Rank Ordering 1 hour
3.3 Development of Membership Functions – Inductive reasoning 1 hour
Defuzzification – Max membership principle, weighted average method,
3.4 1 hour
mean max membership
3.5 Defuzzification – Centroid method 1 hour
Defuzzification – Center of Sums, Center of Largest area, First/Last of
3.6 1 hour
maxima
3.7 Defuzzification - exercises 1 hour
Module-4 (Fuzzy Inference) (9 hours)
4.1 Classical Logic – Propositional Logic 1 hour
4.2 Classical Logic – Predicate Logic 1 hour
4.3 Fuzzy Logic 1 hour
4.4 Fuzzy Approximation based reasoning 1 hour
4.5 Fuzzy Rule based systems 1 hour
4.6 Multiple conjunctive and disjunctive antecedents, aggregation 1 hour
4.7 Graphical Techniques for Inference 1 hour
4.8 Illustration of Graphical Techniques for Inference 1 hour

4.9 Fuzzy Inference - Exercises 1 hour

Module-5 (Fuzzy Applications) (8 hours)
5.1 Fuzzy Control Systems 1 hour
5.2 Illustration of Fuzzy Control Systems 1 hour
5.3 Fuzzy Classification 1 hour
5.4 Fuzzy Pattern Recognition 1 hour
5.5 Fuzzy Systems and Neural Networks 1 hour
5.6 Fuzzy Clustering 1 hour
5.7 Fuzzy Databases 1 hour
5.8 Fuzzy Information Retrieval Systems 1 hour
YEAR OF
CST464 EMBEDDED SYSTEMS
PEC 2 1 0 3 2019
Preamble: The objective of this course is to familiarize learners with the technologies behind
embedded computing systems. This course introduces and explains the role of different hardware,
software, and firmware components involved in the design and development of embedded
systems. It discusses how real time operating systems incorporate specific features to ensure
timeliness of critical tasks. The course also aims to provide insights about the design followed in
several real-world embedded devices and expose the recent trends in embedded system design to
the students.
Prerequisite: Basic knowledge of Operating Systems, Computer Organization and Architecture.
CO1 Describe the characteristics of different hardware/software components of an

embedded system. (Cognitive Knowledge Level: Understand)
CO2 Map the design of an embedded system to an appropriate computational model.

CO3 Recommend appropriate process synchronization / communication / scheduling

mechanisms for specific system scenarios. (Cognitive Knowledge Level: Analyze)
CO4 Describe the role of real-time operating systems in embedded devices. (Cognitive
CO5 Make use of design strategies for developing real-world embedded systems.
0 2
CO1
CO2
CO3
CO4
CO5

Assessment Pattern

Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 20 20 20
Understand 50 50 50
Apply 30 30 30
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3

Attendance 10 marks

answer any 5.

question can have a maximum of 2 subdivisions and carries 14 marks.
Syllabus
Module – 1 ( Introduction to Embedded Systems )
Embedded Systems – Definitions, Embedded Systems vs. General Computing Systems, History,
Classification, Application Areas, Purpose. Building Blocks of a Typical Embedded System –
System Core (Microprocessors, Microcontrollers, DSP, ASICs, PLDs), Memory (Different
ROMs and RAMs), Sensors and Actuators, I/O Subsystem Interface, Communication Interface,
Embedded Firmware, Other System Components (Reset and Brown-out Protection Circuits,
Oscillator Unit, Real-Time Clock, Watchdog Timer), Printed Circuit Board. Embedded System
Design Process – Requirements, Specification, Architecture Design, Designing Hardware and
Software Components, System Integration.
Module - 2 ( System Modeling and Hardware Software Co-Design )
Computational Models in Embedded Design – Data Flow Graph, Control Data Flow Graph, State
Machine Model, Sequential Program Model, Concurrent Process Model, Object-Oriented Model.
Hardware Software Co-Design – Traditional Embedded Development Cycle, History,
Advantages of the Co-Design Methodology, The Co-Design Process, Fundamental Issues in
Hardware Software Co-Design. Hardware software trade-offs.
Module - 3 ( Real-Time Embedded System Design )
Prerequisite Topics: Operating System – Basics, Types. Basics of Tasks, Process and Threads.
Multiprocessing and Multitasking. Task Scheduling – Non-Preemptive (FIFO, LIFO, SJF) and
Preemptive (SRT, RR, Priority-based, Rate-based).
Task Communication – Shared Memory, Message Passing, Remote Procedure Call and Sockets.
Task Synchronization – Synchronization Issues – Race Condition, Deadlock, Priority Inversion,
Priority Inheritance, Priority Ceiling. Synchronization Techniques – Spin Lock, Sleep &
Wakeup, Semaphores. Selection of an RTOS for an Embedded Design – Functional and Non-
Functional Requirements.
Module 4 – ( Embedded Firmware Design and Development, and EDLC )
Embedded Firmware Design and Development – Firmware Design Approaches, Firmware

Development Languages. Integration of Embedded Hardware and Firmware.
Embedded Product Development Life Cycle – Objectives, Different Phases, Modeling Techniques
– Waterfall Model, Incremental Model, Evolutionary Model, Spiral Model.
Module 5 ( Embedded System Industry – Case Studies and Applications )
Design Case Studies – Battery Operated Smart Card Reader, Automated Meter Reading System,
Smart Watch.
Automotive and Aerospace Systems – Networked Control Systems in Cars and Airplanes,
Vehicular Networks – CAN bus, Time-triggered Architecture, FlexRay and LIN.
Internet of Things Systems – IoT System Architectures - Use Cases (Smart Appliance, Monitoring
and Control Systems). Networks for IoT – Networking concepts, Bluetooth, Bluetooth Low
Energy, 802.15.4, ZigBee and WiFi. Databases and Timewheels. Smart Home Example.
Text Books:
1. K. V. Shibu, Introduction to Embedded Systems, McGraw Hill Education, Second Edition,

2017.
2. James K. Peckol, Embedded Systems: A Contemporary Design Tool, John Wiley & Sons,
Second Edition, 2019.
3. Marilyn Wolf, Computers as Components-Principles of Embedded Computing System
Design, Morgan Kaufmann, Elsevier, Fourth Edition, 2016.
References:
1. Jorgen Staunstrup and Wayne Wolf, Hardware/Software Co-Design: Principles and

Practice, Springer Science & Business Media, 2013.
2. Raj Kamal, Embedded Systems: Architecture, Programming and Design. Tata McGraw-
Hill Education, 2011.
3. Daniel D. Gajski, Samar Abdi, Andreas Gerstlauer, and Gunar Schirner, Embedded
System Design: Modeling, Synthesis and Verification, Springer Science & Business
Media, 2009.
4. Peter Marwedel, Embedded System Design: Embedded Systems Foundations of Cyber-
Physical Systems, and the Internet of Things, Springer, 2017.

1. What are Sensors? Explain its role in Embedded System Design. Illustrate with an
example.
2. How do sensors communicate data with other computing devices in an embedded system?
3. What are the advantages and disadvantages of using a microprocessor as the compute
engine of an embedded device?
4. What is a watchdog timer? What can go wrong if your system does not have one?
5. Elaborate the steps involved in the design of an embedded system with appropriate
diagrams.
1. Draw a class diagram to represent a smart eyeglass that automatically changes the glass
shade according to the external light.
2. Design a Seat Belt Warning System and explain its working using a state machine model.
3. Represent the authentication process of an ATM machine using one of the following
computational models:
1. Control Data Flow Graph.
2. State Transition Diagram.
4. Draw the Finite State Machine diagram for an automated tea/coffee vending machine.
5. Draw a CDFG for the following program fragment.
fun0();
if (cond1) fun1();
else fun2();
fun3();
switch (test1) {
case 1 : fun4();
break;
case 2: fun5();
break;
case 3: fun6();
break;
}
fun7();

1. Explain the working of spin locks. When are spin locks preferred to sleep and wake up
mechanisms to synchronize process execution?
2. Assume 3 tasks with the following characteristics:
Task Arrival Time Execution Time

A 0 7
B 2 9
C 4 6
● A goes for I/O for 5 units after 4 units of execution time in CPU.
● B and C are CPU bound tasks.
● Find out if a First Come First Serve or Shortest Job First scheduling strategy will
offer the shortest average waiting time for the above scenario.
3. An organization maintains energy smart buildings with the help of different types of
computing devices spread across different levels of a building. What process
communication mechanism do you recommend? Why?
4. With an example, illustrate how priority inversion can cause high priority tasks to miss
deadlines.
5. Consider the following scenario:
◦ There are three tasks, H, M and L with high, medium, and low priority. Task L and
task H share a resource. Shortly after Task L takes the resource, Task H becomes ready to
run. However, Task H must wait for Task L to finish with the resource, so it pends. Before
Task L finishes with the resource, Task M becomes ready to run, preempting Task L.
While Task M runs, Task H, the highest-priority task in the system, remains in a pending
state.
How can you prevent the high priority task H, from missing any deadlines?
Course Outcome 4 (CO4): .
1. Differentiate General Purpose Operating System (GPOS) from Real-Time Operating

System (RTOS).
2. Explain briefly the functional and non-functional requirements that need to be addressed in
the selection of an RTOS.
3. What are the characteristics of a real-time system?
4. How does a hard real-time system differ from a soft-real time system? Explain with an
example.
5. Identify the reasons for choosing an operating system-based firmware to a super-loop
model-based firmware in an embedded device.
1. Prepare a requirement chart for a robotic vacuum cleaner. Fine tune the requirement chart to list
the product specifications (Assignment, preferably group work).
2. Suppose you want to make an old building energy smart. Analyze existing systems and prepare a
report on how this can be achieved following an Embedded product Development Life Cycle
(EDLC) model (Assignment, preferably group work). (Allow groups to make necessary
assumptions such as prevailing climatic conditions).
3. Design a baby monitoring system with suitable active devices and networking components.
Represent your system with a suitable diagram.
4. Identify the components required to build a battery-operated smart card reader and design
the system using these components.
5. Draw a sequential diagram representing the working of an automated energy metre reading
system.
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
Course Code: CST464
Course Name: Embedded Systems
PART A
1. Differentiate between PLD and ASIC.
2. List the factors that need to be considered in the selection of memory for embedded
systems.
3. How does building an embedded system become a hardware-software co-design

problem?
4. If the time to market of an embedded device is critical, would you prefer a high
level language or assembly language for developing the firmware? Justify.
5. Explain the various factors that need to be considered for the selection of a
scheduling algorithm.
6. What is the difference between ‘Hard’ and ‘Soft’ real-time systems? Give an
example for ‘Hard’ and ‘Soft’ real-time kernels.
7. When will you choose a concurrent process model for an embedded device?
8. What are the three primary objectives of EDLC? List the different phases of this
development life cycle.
9. Why are traditional databases not preferred in embedded devices?
10. Draw the functional block diagram of a fully automatic washing machine.
(10x3=30)
Part B
11. (a) What is embedded firmware? Which are the different approaches used for (6)
embedded firmware development?
(b) List out the requirements for a smartwatch that can show time as well as (8)
measure the user's vitals such as blood pressure, pulse rate and body
temperature. Think of the physical and functional aspects of the product and
also what extra features can be added over the basic functions.
OR
12. (a) Describe various on-board communication interfaces used in embedded (10)
systems.
(b) Explain the role of a watchdog timer in an embedded system. (4)
13. (a) Explain the object oriented program model for embedded system design. (6)
Under which circumstances is this model considered as the best?
(b) Design and draw a concurrent program model for the Seat Belt Warning (8)
System of an automobile. Clearly specify your assumptions in the design.
OR
14. (a) Suppose you are designing a digital motion camera. What are the tradeoffs in (6)
implementing the multimedia codec part of the camera in hardware and in
software?
(b) Draw the state machine diagram of an automatic dawn-dusk solar street light (8)
with a motion sensor.
● The light automatically turns on when the ambient light is below ‘x’
lumens.
● The streetlight operates at low power when no motion is detected for
30 secs.
15. (a) Identify the type of synchronization mechanism best suited for each of the (6)
following scenarios and explain why.
1. Updating a single byte memory location shared by different tasks,
some of which are time-critical.
2. Updating a block of memory that is shared between multiple low
priority tasks.
3. Multiple instances of a resource shared between tasks.
(b) Under what circumstances would you use the following task communication (8)
mechanisms?
1. Sockets.
2. Remote Procedure Call
3. Shared Memory
OR
16. (a) What is priority inversion? In case of priority inversion, what techniques can (7)
be adopted to ensure that the critical tasks are able to meet their deadlines?
(b) Three processes with process IDs P1, P2, P3 with estimated completion time (7)
6, 2, 4 milliseconds respectively, enters the ready queue together in the order
P1, P3, P2. Process P4 with estimated execution time 4 milliseconds entered
the ready queue 3 milliseconds later the start of execution of P1. Calculate the
waiting time and Turn Around Time (TAT) for each process and the Average
waiting time and Turn Around Time (Assuming there is no I/O waiting for
the processes) in RR algorithm with Time slice = 2 ms.
17. (a) An embedded product under consideration is very complex in nature and (8)
there is a possibility for change in requirements of the product. Also the risk
associated with the development of this product is very high. Which is the
best suited life cycle method to handle this product development? Justify
your answer.
(b) Explain the similarities and differences between iterative and incremental life (6)
cycle models.
OR
18. (a) When do you prefer a super-loop-based firmware design approach over an (8)
RTOS based approach? What are the limitations of the super-loop based
approach and how do you overcome them?
(b) Briefly explain the different approaches used for embedding firmware into (6)
the hardware of an embedded device.
19. (a) Identify the components required to build an automated energy metre reading (6)
system and design it with these components
(b) List any four wireless standards used for building IoT networks and compare (8)
their characteristics
OR
20. (a) Draw a sequential diagram representing the working of a battery-operated (6)
smart card reader.
(b) Explain the different communication buses used in automotive applications. (8 )
Teaching Plan
No. of
Lecture
No Contents Hours
(35 hrs)
Module-1 (Introduction to Embedded Systems) (8 hours)
Introduction–Embedded Systems, Characteristics and Quality Attributes of

1.1 1 hour
Embedded Systems
1.2 System Core (Microprocessors, Microcontrollers, DSP, ASICs, PLDs) 1 hour
1.3 System Core (Microprocessors, Microcontrollers, DSP, ASICs, PLDs) 1 hour
Memory (Different ROMs and RAMs), Sensors and Actuators, I/O
1.4 1 hour
Subsystem Interface
1.5 Communication Interface 1 hour
Embedded Firmware, Other System Components (Reset and Brown-out
1.6 Protection Circuits, Oscillator Unit, Real-Time Clock, Watchdog Timer), 1 hour
Printed Circuit Board.
Embedded System Design Process – Requirements, Specification,
1.7 1 hour
Architecture Design.
Embedded System Design Process–Designing Hardware and Software
1.8 1 hour
Components, System Integration.
Module-2 (System Modeling and Hardware Software Co-Design) (6 hours)
Computational Models in Embedded Design – Data Flow Graph, Control
2.1 1 hour
Data Flow Graph
Computational Models in Embedded Design – State Machine Model,
2.2 1 hour
Sequential Program Model
Computational Models in Embedded Design – Concurrent Process Model,

2.3 1 hour
Object-Oriented Model.
Hardware Software Co-Design – Traditional Embedded Development Cycle,
2.4 1 hour
History, Advantages of the Co-Design Methodology
2.5 The Co-Design Process 1 hour
Fundamental Issues in Hardware Software Co-Design. Hardware software
2.6 1 hour
trade-offs.
Module-3 (Real-Time Embedded System Design) (7 hours)
3.1 Task Communication–Shared Memory, Message Passing 1 hour
3.2 Task Communication–Remote Procedure Call and Sockets 1 hour
3.3 Task Synchronization–Synchronization Issues – Race Condition, Deadlock 1 hour
Task Synchronization–Synchronization Issues – Priority Inversion, Priority
3.4 1 hour
Inheritance, Priority Ceiling.
3.5 Synchronization Techniques – Spin Lock, Sleep & Wakeup, Semaphores 1 hour
3.6 Synchronization Techniques – Spin Lock, Sleep & Wakeup, Semaphores 1 hour
Selection of an RTOS for an Embedded Design – Functional and Non-
3.7 1 hour
Functional Requirements
Module-4 (Embedded Firmware Design and Development, and EDLC) (6 hours)
4.1 Firmware Design Approaches 1 hour
4.2 Firmware Development Languages 1 hour
4.3 Firmware Development Languages 1 hour
4.4 Integration of Embedded Hardware and Firmware 1 hour
4.5 Embedded Product Development Life Cycle–Objectives, Different Phases 1 hour
Embedded Product Development Life Cycle – Modeling Techniques –
4.6 Waterfall Model, Incremental Model, Evolutionary Model, Spiral Model 1 hour
(Review Only)
Module-5 (Embedded System Industry – Case Studies and Applications) (8 hours)
5.1 Design Case Studies–Battery Operated Smart Card Reader 1 hour
5.2 Design Case Studies–Automated Meter Reading System 1 hour
5.3 Design Case Studies–Smart Watch 1 hour
Automotive and Aerospace Systems – Networked Control Systems in Cars

5.4 1 hour
and Airplanes
Automotive and Aerospace Systems – Vehicular Networks – CAN bus,
5.5 1 hour
Time-triggered Architecture, FlexRay and LIN
Internet of Things Systems – IoT System Architectures – Use Cases (Smart
5.6 1 hour
Appliance, Monitoring and Control Systems)
Internet of Things Systems – Networks for IoT – Networking concepts,
5.7 1 hour
Bluetooth, Bluetooth Low Energy, 802.15.4, ZigBee and WiFi.
Internet of Things Systems – Databases and Timewheels, Smart Home
5.8 1 hour
Example
YEAR OF
CST474 COMPUTER VISION INTRODUCTION
PEC 2 1 0 3 2019
Preamble: Computer vision is a field of artificial intelligence (AI) that enables computers and
systems to derive meaningful information from digital images, videos and other visual inputs. The
curriculum covers the basics of image formation, key computer vision concepts, methods,
techniques, pattern recognition, various problems in designing computer vision and object
recognition systems. This course enables the learners to understand the fundamentals of computer
vision and develop applications in computer vision.
Prerequisite: Nil
Summarize basic concepts, terminology, theories, models and methods in the field of
CO1
computer vision.
Explain basic methods of computer vision related to multi-scale representation, edge
CO2
detection, detection of other primitives, stereo, motion and object recognition.
Describe principles of Segmentation, Motion Segmentation and Classification
CO3
Select appropriate object Tracking and detection methods for computer vision
CO4
applications (Cognitive Knowledge Level: Understand).
Implement a computer vision system for a specific problem (Cognitive Knowledge

CO5
Level: Apply)
CO1
CO2
CO3
CO4
CO5
Assessment Pattern

Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 50 50 50
Apply 20 20 20
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3

Attendance 10 marks

answer any5.
Syllabus
Module – 1 (Image Formation and Filtering)
Geometric Camera Models - Pinhole perspective, Intrinsic and Extrinsic Parameters, Geometric
Camera Calibration. Linear Filters- Linear Filters and Convolution, Shift Invariant Linear
Systems. Filters as Templates - Normalized Correlation and Finding Patterns.
Module - 2(Local Image Features and Stereo Vision)

Image Gradients - Computing the Image Gradient, Gradient Based Edge and Corner Detection.
Stereopsis- Binocular Camera Geometry, Epipolar Constraint, Binocular Reconstruction, Local
Methods for Binocular Fusion, Global Methods for Binocular Fusion.
Module - 3 (Segmentation)
Segmentation - Background subtraction, Interactive segmentation, Forming image regions.
Segmentation by clustering - Watershed Algorithm. Motion Segmentation by Parameter
Estimation- Optical Flow and Motion, Flow Models, Motion Segmentation with Layers.
Module- 4 (Classification and Tracking)
Classification - Classification Basics, Two-class and Multiclass classifiers, Error, Overfitting and
Regularization, Cross Validation, Classifying Images of Single Objects.
Tracking - Tracking Basics, Simple Tracking Strategies, Tracking by detection, Tracking Linear
Dynamical models with Kalman filters.
Module - 5 (Finding Objects and other Applications)
Object detection - The Sliding Window Method. Object Recognition -Goals of Object Recognition
System. Applications - Robot Navigation by stereo vision, Face detection, Face recognition,
Activity Recognition, Tracking people.
Text Books
1. Forsyth, David, and Jean Ponce. Computer vision: A modern approach. Prentice hall,
2011.
Reference Books
1. Szeliski, Richard, Computer vision: algorithms and applications. Springer Science &
Business Media, 2010.
2. Medioni, Gerard, Emerging topics in computer vision. and Sing Bing Kang. Prentice Hall
PTR, 2004.
3. Trucco, Emanuele, and Alessandro Verri, Introductory techniques for 3-D computer vision.
Vol. 201. Englewood Cliffs: Prentice Hall, 1998.
4. Faugeras, Olivier, and Olivier Autor Faugeras, Three-dimensional computer vision: a
geometric viewpoint. MIT press, 1993.
1. Explain the relationship between coordinates involved in a pinhole camera imaging setup.
2. Explain the basic principle behind geometric camera calibration.
3. Describe how linear filters can be used for smoothing digital images.
4. How does normalised correlation help in matching patterns in images?

1. Describe edge detection methods for computer vision.
2. List any five applications of object recognition.
3. Explain how the epipolar constraint simplifies the correspondence search between
two stereo images.
4. List and explain the different methods used for binocular fusion.
5. Explain the different corner detection methods.
1. Explain the principle of background subtraction.
2. Describe the watershed algorithm for image segmentation.
3. What is meant by optical flow? How can it be utilized for segmenting images?
4. Describe motion segmentation with layers.
5. What is overfitting in the context of classification?
6. Explain the principle behind classification of single images.
1. Explain ‘Mean Shift Algorithm’ to track an object using matching.
2. Describe an algorithm to track a moving object (dynamic object).
3. Explain the sliding window method for object detection.
4. Assume that we have the dynamics
𝑥𝑥𝑖𝑖 ~ 𝑁𝑁(𝑑𝑑𝑖𝑖 𝑥𝑥𝑖𝑖−1 , 𝜎𝜎𝑑𝑑2𝑖𝑖 )
𝑦𝑦𝑖𝑖 ~𝑁𝑁(𝑚𝑚𝑖𝑖 𝑥𝑥𝑖𝑖 , 𝜎𝜎𝑚𝑚2 𝑖𝑖 )
a. 𝑃𝑃(𝑥𝑥𝑖𝑖 |𝑥𝑥𝑖𝑖−1 ) is a normal density with mean 𝑑𝑑𝑖𝑖 𝑥𝑥𝑖𝑖−1 and variance 𝜎𝜎𝑑𝑑2𝑖𝑖 . Whatis(𝑥𝑥𝑖𝑖−1 |𝑥𝑥𝑖𝑖 ) ?
b. Show how to obtain a representation of 𝑃𝑃(𝑥𝑥𝑖𝑖 |𝑦𝑦𝑖𝑖+1 , . . . , 𝑦𝑦𝑁𝑁 ) usinga KalmanFilter.

1. Explain how to implement a computer vision system.
2. Illustrate a computer vision system with the help of a neat diagram.
3. Discuss the components of a computer vision system for object recognition.
4. Explain how activity recognition can be done using computer vision.
5. Illustrate a face recognition system with the help of a diagram.
Assignment Questions
6. Implement a voxel-based approach to visual hull construction.
7. Implement a computer vision system for object recognition.
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 3
Course Code: CST474
Course Name: COMPUTER VISION
PART A
1. State three properties of shift invariant linear systems.
2. Explain the term normalized correlation.
3. What is image rectification? Mention its significance?
4. Illustrate epipolar geometry and showepipolar lines and epipoles.
5. Explain the term flow model.
6. How does background subtraction help in segmenting an image?
7. What is a Kalman filter? Give its applications.
8. State any three simple tracking strategies.
9. State the goals of an object recognition system.
10. Explain the task of face recognition. (10x3=30)
Part B
11. (a) Demonstrate the relationship between a point in the world coordinate frame (9)
and its corresponding image point using camera parameters.
(b) Show that convolving a function with a δ function simply reproduces the (5)
original function.
OR
12. (a) What is linear filtering? Explain two applications of linear filtering to image (7)
processing.
(b) Explain an application of normalised correlation to find patterns. (7)
13. (a) Show that smoothing an image and then computing the gradient is same as (5)
convolving an image with the derivative of a smoothing function.
(b) State the epipolar constraint and derive its representations using the Essential (9)
matrix and the Fundamental matrix.
OR
14. (a) Explain the algorithm for computing edges using gradients. (9)
(b) Define binocular fusion. Explain two local methods for binocular fusion. (5)
15. (a) Discuss the different interactive segmentation approaches. (7)
(b) What is meant by optical flow? How can it be utilized for segmenting (7)
images?
OR
16. (a) Explain the Watershed algorithm. (7)
(b) How can we perform motion segmentation by parameter estimation? (7)
17. (a) Explain tracking algorithm using Kalman filtering. (7)
(b) Illustrate the tracking by detection algorithm. (7)
OR
18. (a) Explain the various kinds of errors in classification and the relationship (7)
between them.
(b) What is overfitting and how does regularization help to minimise it? (7)
19. (a) Explain human activity recognition with appearance features. (7)
(b) Describe the Sliding window method for detecting objects in images. (7)
OR
20. (a) Explain the principle of detecting faces in an image. (7)
(b) What are the various strategies for object recognition? (7)
Teaching Plan
No. of Lecture
No Contents Hours
(36hrs)
Module 1 Image Formation and Filtering (7)
1.1 Geometric Camera model - Pinhole perspective 1
1.2 Geometric Camera model - Intrinsic Parameters 1
1.3 Geometric Camera model - Extrinsic Parameters 1
1.4 Geometric Camera Calibration – Linear Approach 1
1.5 Linear Filters and Convolution 1
1.6 Shift Invariant Linear Systems - Discrete convolution 1
1.7 Normalized Correlation and Finding patterns 1
Module 2 Local Image Features and Stereo Vision (8)
2.1 Local Image Features - Computing the Image Gradient 1
2.2 Gradient Based Edge Detection 1
2.3 Gradient Based Corner Detection 1
2.4 Stereopsis - Binocular Camera Geometry and Epipolar 1
Constraint
2.5 Essential Matrix and Fundamental Matrix 1
2.6 Binocular Reconstruction 1
2.7 Local Methods for Binocular Fusion 1
2.8 Global Methods for Binocular Fusion 1
Module 3 Segmentation (6)
3.1 Segmentation basics 1

3.2 Applications - Background Subtraction, Interactive 1
Segmentation
3.3 Forming Image Regions 1
3.4 Segmentation by clustering - The Watershed Algorithm 1
3.5 Motion Segmentation by Parameter Estimation - Optical 1
Flow and Motion
3.6 Flow Models and Motion Segmentation with Layers 1
Module 4 Classification and Tracking (8)
4.1 Classification Basics, Two-class and Multiclass classifier 1
4.2 Error, Overfitting and Regularization 1
4.3 Cross Validation, Classifying Images of Single Objects 1
4.4 Tracking Basics, Simple Tracking Strategies 1
4.5 Tracking by detection 1
4.6 Linear Dynamical models 1
4.7 The Kalman Filter background 1
4.8 Kalman filter algorithm 1
Module 5 Finding Objects and other Applications (7)
5.1 Detecting Objects in Images- The Sliding Window Method 1
5.2 Object Recognition - Goals of Object Recognition System 1
5.3 Application of binocular stereo vision - Robot Navigation 1
5.4 Face detection 1
5.5 Face recognition 1
5.6 Activity recognition 1
5.7 Tracking people 1
SEMESTER VIII
PROGRAM ELECTIVE IV
FORMAL METHODS AND CATEGORY L T P CREDIT

YEAR OF
INTRODUCTION
CST416 TOOLS IN SOFTWARE
ENGINEERING PEC 2 1 0 3 2019
Preamble: The course enables the learners to apply formal methods for modelling, validation and
verification of software systems. It covers a series of advanced tools that address challenges faced
in design, coding and verification. This includes both an introduction to the theoretical
underpinnings of these tools, as well as hands-on exploration.
Pre-requisites: Fundamental knowledge in Formal Methods and Software Engineering
CO1 Explain the need and use of formal methods and tools in software engineering.
CO2 Demonstrate conceptual modelling of systems using Alloy.(Cognitive Knowledge

Level: Apply)
CO3 Illustrate the process of proving correctness of code using Hoare-Triple based weakest
precondition analysis.(Cognitive Knowledge Level: Apply)
CO4 Demonstrate program verification using VCC. (Cognitive Knowledge Level: Apply)
0 2
CO1
CO2
CO3
CO4
Assessment Pattern

Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3

Attendance 10 marks

answer any5.
Syllabus
Stages in software development; software defects –causes of software defects; techniques for
dealing with software defects-Testing and verification, formal methods and tools.
Module– 2 (Ensuring reliability in the design phase)
Conceptual modelling, the tool Alloy, conceptual modelling in Alloy, Analysing Alloy models,
Fixing bugs in modelling, How Alloy works? Show that the Konigsberg Bridge Problem has no
solution.
Module - 3 (Verification by Model Checking)
Verifier for Concurrent C (VCC): a Hoare-Triple- based tool for Verifying Concurrent C, intra-
procedure verification of programs, ghost statements.
Module–4 (Program Verification)
Inter-procedure verification of programs in VCC, function contracts, pure functions, loop-
invariants, proving total correctness of programs in VCC.
Module–5 (Ghost Language and Ownership in VCC)

Ghost Language of VCC, modelling programs in the ghost language, verification of a C program
with respect to a ghost model, ownerships in VCC, Refinement for proving correctness, Proving
refinements in VCC, Example problems
Text Books
1. Daniel Jackson, Software Abstractions, MIT Press, 2011.
Reference Materials
1. Tutorial for Alloy Analyzer 4.0
2. E. Cohen, M. A., Hillebrand, S. Tobies, M. Moskal, W. Schulte, Verifying C Programs: A
VCC Tutorial, Working draft, version 0.2, July 10, 2015.
3. The VCC Manual, Working draft, version 0.2, April 7, 2016.

1. Is the following code segment to increment a number safe? If not, provide the reason.
int increment(int x)
{
return ++x;
}
1. A farmer is on one shore of a river and has with him a fox, a chicken, and a sack of grain.
He has a boat that fits one object besides himself. In the presence of the farmer nothing
gets eaten, but if left without the farmer, the fox will eat the chicken, and the chicken will
eat the grain. How can the farmer get all three possessions across the river safely?Solve the
problem by modeling it in Alloy and using the analyzer to find a solution.
1. Find an inductive loop invariant and show the correctness proof for the statement
𝑤𝑤ℎ𝑖𝑖𝑖𝑖𝑖𝑖 𝑖𝑖 < 𝑛𝑛 𝑑𝑑𝑜𝑜 {𝑎𝑎[𝑖𝑖] ∶= 0; 𝑖𝑖 ∶= 𝑖𝑖 + 1; }
with the precondition 𝑖𝑖 = 0 ˄ 𝑛𝑛 > 0and the post condition ⩝ 𝑗𝑗, 0 ≤ 𝑗𝑗 < 𝑛𝑛 → 𝑎𝑎[𝑗𝑗] =
0.
1. Write and verify a program that sorts the elements of an array in non-decreasing order. Use
VCC for verification.
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
Course Code: CST416
Course Name: Formal Methods and Tools in Software Engineering
PART A
1. Give an example of a software defect.
2. Explain the benefits of formal models in software engineering.
3. Draw the architecture of Alloy.
4. With an example, explain a predicate in Alloy.
5. Define Loop Invariant. Give an example.
6. Describe the purpose of Hoare Logic.
7. State a sufficient condition required in the assert statement below to provide the
correctness of the function smallest.

int smallest(int x, int y)
{
int val;
if (x<=y)
val = x;
else
val = y;
assert(….);
return val;
}
8. Explain inter-procedure verification of programs in VCC.
9. Why do you need a specification language like Ghost for VCC?
10. Give the difference between \writable and \writes in VCC.

(10x3=30)
Part B
11. a Explain the stages in software development. (10)
b Differentiate between testing and verification. (4)
OR
12. (a) Explain the important causes of software defects. (7)
(b) Describe the terms Formal Methods and Formal Verification. (7)
13. (a) Model the following system in Alloy Analyzer. (7)
There is an entity named Person. Man and Woman are two specializations of
it. Every Person has a Father(a Man) and a Mother(a Woman) as Parent. The
Parents of a Person should be married. A Man’s spouse should be a Woman
and a Woman’s spouse should be a Man. The spouse relation is symmetric.
Add a predicate to check whether marriage between siblings is possible in the

above system.
(b) Model the stack data structure in Alloy with support (7)
for Push and Pop operations. Treat each operation that modifies the stack's
state as an event. The stack should begin empty, and you should not be able
to Pop from an empty stack.
Write three assertions verifying the behaviour of your stack in the following
cases:
• A Pop followed by a Push of the same element
• The number of Push events is exactly equal to the number
of Pop events
• A Pop from a stack with no elements
14. (a) Model an operating system as follows. (7)

// The following signature models the set of all tasks in the system
sig Task {}
// Following signature models the operating system
one sig OS {
free: set Task, // set of free tasks in the OS, which are ready to be created
ready: set Task, // set of ready tasks
deleted: set Task, // set of deleted tasks
running: one Task // the currently running task
}
Add the following properties

P1: The running task is also in the ready state.
P2: There is at least one free task (in order to enable task creation)
P3: Each task is in exactly one of the three states free, ready, deleted.
Create a predicate noP1 that looks for instances that do not satisfy property
P1, and a corresponding\run statement. Similarly, create predicates noP2 and
noP3.
(b) Show a model in Alloy to prove that the Konigsberg bridge problem has no (7)
solution.
15. (a) Use Hoare Logic to prove (6)

(i) {𝑧𝑧 = 2} 𝑦𝑦: = 𝑥𝑥 {𝑦𝑦 = 𝑥𝑥}
(ii) {𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡} 𝑥𝑥: = 2; 𝑦𝑦: = 𝑥𝑥 {𝑦𝑦 = 2 ˄ 𝑥𝑥 = 2}
(b) Differentiate between partial correctness and total correctness in Hoare Logic. (8)
16. (a) Use Hoare Logic with the help of loop invariant to prove (8)
(i) {𝑥𝑥 ≤ 𝑛𝑛} 𝑤𝑤ℎ𝑖𝑖𝑖𝑖𝑖𝑖 𝑥𝑥 < 𝑛𝑛 𝑑𝑑𝑑𝑑 𝑥𝑥: = 𝑥𝑥 + 1 {𝑥𝑥 ≥ 𝑛𝑛}
(ii) {𝑖𝑖 = 0 ˄ 𝑗𝑗 = 0 ˄ 𝑛𝑛 = 5} 𝑤𝑤ℎ𝑖𝑖𝑖𝑖𝑖𝑖 𝑖𝑖 < 𝑛𝑛 𝑑𝑑𝑑𝑑 𝑖𝑖 ≔ 𝑖𝑖 + 1; 𝑗𝑗 ∶= 𝑗𝑗 +
1 {𝑗𝑗 = 15}
(b) Illustrate assertions and assumptions in VCC. (6)
17. (a) Write a function to find the largest of three numbers and prove using function (10)
contract that your program is correct. Also write another function that calls
the former and assert that the latter returns the correct result.
(b) Write notes on inter-procedure verification of programs in VCC. (4)
OR
18. (a) Write and verify a non-recursive program that takes an array and checks (10)
whether it contains any duplicate elements.
(b) Distinguish between sequential and atomic memory access in VCC. (4)
19. (a) Explain how the refinement conditions can be phrased in VCC. (7)
(b) Illustrate how refinements are proved in VCC. (7)
OR
20. (a) Explain the Ghost language of VCC (7)
(b) Illustrate the verification of a C program with respect to its Ghost model. (7)
Teaching Plan
No. of
Lecture
No Contents Hours
(36 hrs)
Module-1(Introduction) (5 hours)
1.1 Stages in software development. 1 hour
1.2 Software defects and causes of software defects. 1 hour
1.3 Techniques for dealing with software defects. 1 hour
1.4 Testing and verification. 1 hour
1.5 Formal methods and formal verification. 1 hour
Module-2 (Conceptual Modelling in Alloy) (7 hours)

2.1 Introduction to Conceptual modelling. 1 hour
2.2 Overview of Alloy, Architecture of alloy. 1 hour
2.3 Conceptual modelling in Alloy. 1 hour
2.4 Analysing Alloy models. 1 hour
2.5 Fixing bugs in modelling. 1 hour
2.6 How Alloy works? 1 hour
2.7 Show that the Konigsberg Bridge Problem has no solution. 1 hour
Module-3 (Hoare Logic and Introduction to VCC) (11 hours)
3.1 Introduction to VCC. 1 hour
Verifying C programs in VCC- Assertions, Logical Operators and

3.2 1 hour
Quantifiers, Assumptions, Overflows and unchecked arithmetic.
Hoare Logic - Simple Imperative Programming Language, Partial
3.3 1 hour
Correctness Specification.
Meaning of Hoare Triples, Hoare-Triple- based tool for Verifying
3.4 1 hour
Concurrent C.
3.5 Partial vs. Total Correctness, Proving Partial Correctness. 1 hour

Inference Rules for the Simple Imperative Programming Language (Lecture
3.6 1 hour
1).
Inference Rules for the Simple Imperative Programming Language (Lecture

3.7 1 hour
2).
3.8 Weakest Precondition. 1 hour
3.9 Invariant vs. Inductive Invariant. 1 hour
3.10 Intra-procedure verification of programs. 1 hour
3.11 Verification of Hoare Triples. 1 hour
Module-4 (Program Verification) (6 hours)
4.1 Inter-procedure verification of programs in VCC. 1 hour
4.2 Function contracts. 1 hour
4.3 Pure functions. 1 hour
4.4 Quantifiers, loop-invariants and Object invariant. 1 hour
4.5 Triggers in VCC. 1 hour
4.6 Proving total correctness of programs in VCC. 1 hour
Module-5 (Ghost Language and Ownership in VCC) (7 hours)
5.1 Ghost Language of VCC. 1 hour
5.2 Modelling programs in the ghost language. 1 hour
5.3 Verification of a C program with respect to a ghost model. 1 hour
5.4 Ownerships in VCC. 1 hour
5.5 Phrasing refinement conditions in VCC. 1 hour
5.6 Proving refinements in VCC, Example problems (Lecture 1). 1 hour
5.7 Proving refinements in VCC, Example problems (Lecture 2). 1 hour
YEAR OF
CLIENT SERVER CATEGORY L T P CREDIT INTRODUCTION
CST426
ARCHITECTURE
PEC 2 1 0 3 2019
Preamble: The syllabus is prepared with the view of preparing the Engineering Graduates to
build effective Client/Server applications. This course aims at providing a foundation in
decentralized computer systems, using the client/server model. The course content is decided to
cover the essential fundamentals which can be taught within the given slots in the curriculum.
Prerequisite: Computer Networks
Explain the basics of client/server systems and the driving force behind the
development of client/server systems (Cognitive Knowledge Level:
CO 1 Understand)
Outline the architecture and classifications of client/server systems (Cognitive
CO 2 Knowledge Level: Understand)
Choose the appropriate client/server network services for a typical application
CO 3 (Cognitive Knowledge Level: Understand)
Describe management services and issues in network (Cognitive Knowledge
CO 4 Level: Understand)
Compare and summarize the web extensions and choose appropriate web services
CO 5
standards for an application (Cognitive Knowledge Level: Understand)
CO1
CO2
CO3
CO4
CO5

Accreditation
Assessment Pattern

Remember 30 30 30
Understand 70 70 50
Apply
Analyse
Evaluate
Create
Mark distribution
Total CIE ESE ESE

Marks Duration
Marks Marks
150 50 100 3 hours
Continuous Assessment Test 2 (for lab, internal examination, for 2hrs) : 20 marks
Internal Examination Pattern: There will be two parts; Part A and Part B. Part A
contains 5 questions with 2 questions from each module (2.5 modules x 2 = 5), having 3
marks for each question. Students should answer all questions. Part B also contains 5
questions with 2 questions from each module (2.5 modules x 2 = 5), of which a student
should answer any one. The questions should not have sub- divisions and each one carries
7 marks.
contain 10 questions with 2 questions from each module, having 3 marks for each
question. Students should answer all questions. Part B contains 2 questions from each
module of which a student should answer any one. Each question can have maximum 2
sub-divisions and carry 14 marks.

1. Explain the driving forces behind the development of Client/ Server system from
different perspectives.

1. How two-tier computing and three-tier computing improves the performance of
Client/Server system.

1. Explain the role of client in Client/Server computing and also explain the various
services provided by client.
2. What is the primary motivation behind the RPC facility ? How does a RC facility
makes the job of distributed application programmers simpler?
3. Implement RPC concept using suitable language/tool(Assignment)

1. Explain Connectivity and Communication Interface Technology in Client/Server
application. How does transmission protocol work in Client/Server application?

1.Discuss the role of web browser for providing web service in Client/Server
environment.
2. Identify and explain the social relevance of web services (Assignment)
Syllabus
Introduction to Client/Server computing - Driving forces behind Client/ Server, Client/

Server development tools, Development of client/server systems, Client/Server security,
Organizational Expectations, Improving performance of client/server applications, Single
system image, Downsizing and Rightsizing, Advantages of client server computing,
Applications of Client/Server.
Module -2 (Client/Server Application Components)
Classification of Client/Server Systems- Two-Tier Computing, Middleware, Three-Tier

Computing- Model View Controller (MVC), Principles behind Client/Server Systems.
Client/Server Topologies. Existing Client/Server Architecture. Architecture for Business
Information System.
Module -3 (Client/Server Network)
Client- Services, Request for services, RPC, Windows services, Print services, Remote
boot services, other remote services, Utility Services. Dynamic Data Exchange (DDE).
Object Linking and Embedding (OLE). Common Object Request Broker Architecture
(CORBA).
Server- Detailed server functionality, Network operating system, Available platforms,

Server operating system.
Module -4 (Client/ Server Systems Development)
Services and Support- System administration, Availability, Reliability, Scalability,

Observability, Agility, Serviceability. Software Distribution, Performance, Network
management. Remote Systems Management- RDP, Telnet, SSH, Security. LAN and
Network Management issues, Training, Connectivity, Communication interface
technology, Interprocess communication, Wide area network technologies, Network
Acquisition, PC-level processing unit, X-terminals, Server hardware.
Module -5 (Client/Server Technology and Web Services)
Web Services History. Web Server Technology- Web Server, Web Server Communication,
Role of Java for Client/Server on Web. Web Services- MicroServices, APIs, API
Gateway, Authentication of users/clients, Tokens/Keys for Authentication, Service Mesh,
Message Queues, SaaS, Web Sockets.
Client/Server/Browser – Server Technology, Client/Server Technology and Web
Applications, Balanced Computing and the Server’s Changing Role. Thin client computing
- Computing models-Comparison-Computing Environment.
Future of client/ server Computing Enabling Technologies, Transformational system.
Text Books
1. Patrick Smith & Steave Guengerich, “Client / Server Computing”, PHI

2. Dawna Travis Dewire, “Client/Server Computing”, TMH
Reference Books
1. Jeffrey D.Schank, “Novell’s Guide to Client-Server Application & Architecture” Novell

Press
2. Robert Orfali, Dan Harkey, Jeri Edwards, Client/Server Survival Guide, Wiley-
India Edition, Third Edition
3. W. H. Inman, Developing Client Server Applications, BPB
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
Course Code: CST426
Course Name : Client Server Architecture
PART A
1. How client/server computing environment is different from mainframe based

computing environment?
2. Write short notes on single system image and downsizing.
3. Discuss the topologies of Clients/Server system with suitable examples.
4. Discuss the relevance of Clients/Server system in adopting open system standards.

5. Enumerate the services provided in a client/server system.
6. List out the features of network operating system.
7. How interposes communication is established?.
8. Write short note on x-terminals.
9. Explain the history of web services.
10. With an example, explain the role of java for client/server on web (10x3=30)
Part B
11. (a) Explain the driving forces behind the development of Client/ Server system (10)
from different perspectives.
(b) Explain the various Clients/Server system development tools. (4)
OR
12. (a) Explain Client/Server System development methodology and explain various (10)
phases and their activities involved in System Integration Life Cycle.
(b) Write short notes on the following. (a) Single system image. (b) Downsizing (4)
and Client/Server computing.
13. (a) How two-tier computing and three-tier computing improves the performance (10)
of Client/Server system.
(b) List out the principles behind client/server systems . (4)
OR
14. (a) Explain the architecture of Business Information System. (10)
(b) Explain different ways to improve performance in Client/Server developed (4)

applications.
15. (a) In Client/Server computing, explain the following with example in detail (a) (10)
Dynamic Data Exchange (b) RPC (c) Remote Boot Service (d) Object-
linking and embedding.
(b) Explain the role of client in Client/Server computing and also explain the (4)
various services provide by client.
OR
16. (a) Explain the architecture of CORBA. (10)
(b) Explain the server functionality in detail, for Client/Server computing. (4)
17. (a) Explain Connectivity and Communication Interface Technology in (10)

Client/Server application. How does transmission protocol work in
Client/Server application?
(b) Comment on the network service acquisition mechanism for the client/service (4)
model.
OR
18. (a) In client server architecture, what do you mean by Availability, Reliability, (10)
Serviceability and Security? Explain with examples
(b) How remote systems management security is ensured in a Client/Server (4)

application.
19. (a) What is the future of Client/Server computing in the following technologies (10)
(i) Electronic Document Management. (ii) Full Text Retrieval. (iii)
Geographic Information System.
(b) Discuss the role of web browser for providing web service in Client/Server (4)
environment.
OR
20. (a) Explain end-to-end working of Client/Server web model. (10)
(b) Explain the architecture of Transformational system. (4 )

Teaching Plan
Sl Contents No. of
No Lecture
Hours (35)
Module- 1( Introduction) (7 hours)
Driving forces behind Client/ Server

1.1 1 hour
1.2 Client Server development tools 1 hour
1.3 Development of client/server systems
1 hour
1.4 Client/Server security, Organizational Expectations 1 hour
1.5 Improving performance of client/server applications 1 hour

1.6 Single system image, Downsizing and Rightsizing 1 hour
1.7 Advantages and Applications of client server computing 1 hour
Module- 2(Client/Server Application Components) (8 hours)
2.1 Classification of Client/Server Systems

1 hour
2.2 Open System Standards 1 hour
2.3 Two-Tier Computing 1 hour

2.4 Three-Tier Computing, Middleware 1 hour
2.5 Principles behind Client/Server Systems 1 hour
2.6 Client/Server Topologies 1 hour

2.7 Existing Client/Server Architecture 1 hour
2.8 Architecture for Business Information System 1 hour

Module- 3(Client/Server Network) (6 hours)
3.1 The client: Services, Request for services, RPC, Windows services, Print 1 hour
services
3.2 Remote boot services, Utility Services & Other Services 1 hour
3.3 Dynamic Data Exchange (DDE), Object Linking and Embedding (OLE) 1 hour
3.4 Common Object Request Broker Architecture (CORBA) 1 hour
3.5 The server: Detailed server functionality, the network operating system 1 hour
3.6 Available platforms, the server operating system 1 hour
Module- 4( Client Server Systems Development) (7 hours)
4.1 Services and Support, System administration 1 hour
4.2 Availability, Reliability, Scalability, Observability, Agility Serviceability, 1 hour

Software Distribution, Performance
4.3 Network management, Remote Systems Management, RDP,Telnet,SSH 1 hour

4.4 Security ,LAN and Network Management issues 1 hour
4.4 Training, Connectivity, Communication interface technology 1 hour
4.5 Interposes communication, wide area network technologies 1 hour
4.6 Network Acquisition, PC-level processing unit, x-terminals, server 1 hour

Hardware
Module -5(Client/Server Technology And Web Services) (7 hours)
5.1 Web Services History , Web Server Technology , Web Server 1 hour
5.2 Web Server Communication , Role of Java for Client/Server on Web 1 hour
5.3 Web Services , MicroServices, APIs, API Gateway, Authentication of 1 hour
users/clients
5.4 Tokens/Keys for Authentication ,Service Mesh, Message Queues 1 hour
5.5 SaaS, Web Sockets ,Client/Server Technology and Web Applications

1 hour
5.6 Balanced Computing and the Server’s Changing Role ,Thin client computing , 1 hour
Computing models, Computing Environment
5.7 Future of client/ server Computing Enabling Technologies, Transformational

system 1 hour
YEAR OF
PARALLEL CATEGORY L T P CREDIT INTRODUCTION
CST436
COMPUTING
PEC 2 1 0 3 2019
Preamble: This course helps the learners to understand basic and advanced concepts of parallel
computing. It covers Principles of Parallel Algorithm Design, Communication operations,
Programming Using the Message Passing Paradigm, Programming Shared Address Space
Platforms Thread Basics, and GPU Programming. This course enables a learner to design
solutions to complex real world problems using parallel computing paradigms including thread
parallelism, shared memory program, message passing interfaces, and vector processing.
Prerequisite: Knowledge in Computer Organization and Architecture.
Summarize the key parallel computational models (Cognitive Knowledge Level :

CO1
Understand)
Appreciate and apply parallel and distributed algorithms in problem Solving (Cognitive
CO2
Knowledge Level :Apply)
Appreciate the communication models for parallel algorithm development (Cognitive
CO3
Knowledge Level : Understand)
Develop parallel algorithms using message passing paradigm (Cognitive Knowledge
CO4
Level : Apply)
Formulate parallel algorithms for shared memory architectures. (Cognitive
CO5
Demonstrate the fundamental skills of heterogeneous computing with GPUs(Cognitive
CO6
CO1
CO2
CO3
CO4
CO5
CO6
complex problems
Assessment Pattern

Examination Marks
Remember 30 20 20
Understand 50 40 40
Apply 20 40 40
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3 Hours
Attendance 10 marks


Syllabus
Module- 1 (Principles of Parallel Algorithm Design)
Basic Introduction to Parallel Processing platforms. Preliminaries, Decomposition Techniques,

Characteristics of Tasks and Interactions, Mapping Techniques for Load Balancing, Methods for
Containing Interaction Overheads, Parallel Algorithm Models.
Module- 2 (Communication Operations)
Basic Communication Operations - One-to-All Broadcast and All-to-One Reduction, All-to-All

Broadcast and Reduction, All-Reduce and Prefix-Sum Operations, Scatter and Gather, All-to-All
Personalized Communication, Circular Shift, Improving the Speed of Some Communication
Operation
Module-3 (Programming Using the Message Passing Paradigm)
Principles of Message-Passing Programming, The Building Blocks: Send and Receive

Operations, MPI: The Message Passing Interface, Overlapping Communication with
Computation, Collective Communication and Computation Operations, Groups and
Communicators.
Module 4 (Programming Shared Address Space Platforms Thread Basics)
Thread Basics, Why Threads? The POSIX Thread Application Programme Interface,
Synchronization Primitives in POSIX, Controlling Thread and Synchronization Attributes,
Thread Cancellation, Composite Synchronization Constructs, OpenMP: a Standard for Directive
Based Parallel Programming, Specifying Concurrent Tasks in OpenMP, Synchronization
Constructs in OpenMP, Data Handling in OpenMP, OpenMP Library Functions, OpenMP
Applications: Parallel algorithm development for Matrix multiplication
Module 5 (GPU Programming)

Heterogeneous Parallel Computing, Architecture of a Modern GPU, Speeding up Real
Applications, Data parallel computing, CUDA C Program Structure, A Vector Addition Kernel,
Device Global Memory and Data Transfer, Kernel Functions and Threading, Kernel Launch,
CUDA Thread Organization, Mapping Threads to Multidimensional Data, Synchronization and
Transparent Scalability, Resource Assignment, Querying Device Properties, Thread Scheduling
and Latency Tolerance, Importance of Memory Access Efficiency, Cuda Memory Types, Tiling
for Reduced Memory Traffic, Tiled Matrix Multiplication Kernel, Boundary Checks
Text Books
1. Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar, Introduction to Parallel
Computing, 2nd Ed, Addison-Wesley, 2003
2. David B. Kirk, Wen-mei W. Hwu, Programming Massively Parallel Processors: A
Hands-on Approach, 3rd Ed., Morgan Kaufman, 2016.
References
1. Steven Brawer, Introduction to Parallel Computing, Academic Press, (1989)
2. Barbara Chapman, Gabriele Jost, Ruud van der Pas, Using OpenMP: Portable Shared
Memory Paralwlel Programming , MIT Press, 2008.
3. William Gropp, Ewing Lusk, Anthony Skjellum Using MPI: Portable Parallel
Programming with the Message-Passing Interface, 3rd Ed, MIT Press, 2014.
4. Thomas Rauber, Gudula Rünger, Parallel Programming for Multicore and Cluster
Systems, Springer, 2010

1. Differentiate between static and dynamic task mapping
2. Explain partitioning of data with an example
1. Explain the handshaking sequence of Blocking Non-Buffered Send/Receive operation
with a neat diagram.
2. In the algorithm, assume a decomposition such that each execution of Line 7 is a task.
Draw a task-dependency graph and a task-interaction graph.
1. procedure FFT_like_pattern(A, n)
2. begin
3. m := log2 n;
4. for j := 0 to m - 1 do
5. k := 2j;
6. for i := 0 to n - 1 do
7. A[i] := A[i] + A[i XOR 2j];
8. end // for
9. end // FFT_like_pattern

1. Write a procedure for performing all-to-all reduction on a mesh
2. Give a hypercube algorithm to compute prefix sums of n numbers if p is the number of
nodes and n/p is an integer greater than 1. Assuming that it takes time tadd to add two
numbers and time ts to send a message of unit length between two directly-connected
nodes, give an exact expression for the total time taken by the algorithm.
1. Show how the two-dimensional matrix-vector multiplication program needs to be changed
so that it will work correctly for a matrix of size n x m on a q x r process grid
2. One of the advantages of non-blocking communication operations is that they allow the
transmission of the data to be done concurrently with computations. Discuss the type of
restructuring that needs to be performed on a program to allow for the maximal overlap of
computation with communication. Is the sending process in a better position to benefit
from this overlap than the receiving process
1. Implement a multi-access threaded queue with multiple threads inserting and multiple
threads extracting from the queue. Use mutex-locks to synchronize access to the queue.
Document the time for 1000 insertions and 1000 extractions each by 64 insertion threads
(producers) and 64 extraction threads (consumers).
2. Implement a producer-consumer framework in OpenMP using sections to create a single
producer task and a single consumer task. Ensure appropriate synchronization using locks.
1. Consider a hypothetical block with 8 threads executing a section of code before reaching a
barrier. The threads require the following amount of time (in microseconds) to execute the
sections: 2.0, 2.3, 3.0, 2.8, 2.4, 1.9, 2.6, and 2.9 and to spend the rest of their time waiting
for the barrier. What percentage of the total execution time of the thread is spent waiting
for the barrier?
2. Write and explain the CUDA program for vector addition.

QP CODE: PAGES :3
Reg No: _______________
Name: _________________
Course Code: CST436
Course Name: PARALLEL COMPUTING
PART A
1. Explain partitioning of data with an example
2. Which are the characteristics of tasks influencing the selection of mapping scheme?
3. Describe the scatter - gather communication.
4. Explain the Circular Shift operation.
5. Explain the handshaking sequence of Blocking Non-Buffered Send/Receive

operation with a neat diagram.
6. Describe the six fundamental routines of MPI.
7. Explain thread cancellation.
8. Explain how concurrent tasks are specified in openMP
9. Explain the architecture of modern GPU with a diagram.
10. Describe how the data transfer between GPU device and the host memories are (10x3=30)
managed.
Part B
11. (a)
Describe recursive decomposition with an example.
(8)
(b)
Compare various parallel algorithm models
(6)
OR
12. (a) (8)

Differentiate between static and dynamic task mapping
(b) In the algorithm, assume a decomposition such that each execution of Line 7 is (6)
a task. Draw a task-dependency graph and a task-interaction graph.
1. procedure FFT_like_pattern(A, n)
2. begin
3. m := log2 n;
4. for j := 0 to m - 1 do
5. k := 2j;
6. for i := 0 to n - 1 do
7. A[i] := A[i] + A[i XOR 2j];
8. end // for
9. end // FFT_like_pattern
13. (a)
Illustrate the All-to-All Broadcast and Reduction with an example
(8)
(b) (6)
Explain any three techniques to improve the speed of communication
operations
OR
14. (a) (8)

Explain the One-to-All Broadcast and All-to-One Reduction with an example
(b) Explain the Ring and Mesh techniques of All-to-All Personalized (6)
communication.
15. (a) Explain Collective Communication and Computation Operations in MPI (9)
(b) Show the impact of finite buffers in message passing. (5)
OR
16. (a) Write algorithm for Collective Communication and Computation Operations
(9)
using MPI.
(b) How is deadlock avoided in MPI_Send and MPI_Recv (5)
17. (a) Explain how mutual exclusion for shared variables are accomplished in (6)
threads.
(b) Explain the nesting of parallel directives with a suitable example. (8)
OR
18. (a) Explain the compilation operations of an example openMP program along (4)
with its pThread translations.
(b) Explain the parallel matrix multiplication using openMP (10)
19. (a) (6)

Describe the CUDA Kernel functions.
(b) (8)
How is synchronization between CUDA threads achieved?
OR
20. (a) (10)

Explain the two-level hierarchical organization of CUDA threads.
(b) Write and explain the CUDA program for vector addition. (4 )
TEACHING PLAN
No Contents No of
Lecture
Hrs (37)
Module – 1 (Basic Introduction to Parallel Processing ) (TB-1, Ch. 3) (7 hrs)
1.1 Basic Introduction to Parallel Processing platforms. Preliminaries 1
1.2 Decomposition Techniques – Recursive, Data 1
1.3 Decomposition Techniques – Exploratory, Speculative, Hybrid 1
1.4 Characteristics of Tasks and Interactions 1
1.5 Mapping Techniques for Load Balancing -Static 1
1.6 Mapping Techniques for Load Balancing - Dynamic 1
1.7 Methods for Containing Interaction Overheads, Parallel Algorithm Models. 1
Module- 2 (Basic Communication Operations ) (TB-1, Ch. 4) (6hrs)
2.1 One-to-All Broadcast and All-to-One Reduction 1
2.2 All-to-All Broadcast and Reduction 1
2.3 All-Reduce and Prefix-Sum Operations, Scallter Gather 1
2.4 All-to-All Personalized Communication 1
2.5 Circular Shift 1
2.6 Improving the Speed of Some Communication Operation 1
Module- 3 ( Programming Using the Message Passing Paradigm) (TB-1, Ch. 6 ) (7 hrs)
Principles of Message-Passing Programming, The Building Blocks: Send and

3.1 1
Receive Operations
3.2 MPI: The Message Passing Interface 1
3.3 MPI: The Message Passing Interface : Illustration 1

3.4 Overlapping Communication with Computation 1
3.5 Overlapping Communication with Computation : Illustration 1
3.6 Collective Communication and Computation Operations 1
3.7 Collective Communication and Computation Operations : Illustration 1
Module 4 (Programming Shared Address Space Platforms) (TB-1, Ch. 7, 8 ) (8hrs)
4.1 Thread Basics, Why Threads? The POSIX Thread API 1
4.2 Synchronization Primitives in POSIX 1
4.3 Controlling Thread and Synchronization Attributes 1
4.4 Thread Cancellation, Composite Synchronization Constructs, 1
4.5 OpenMP: a Standard for Directive Based Parallel 1

Programming
4.6 Specifying Concurrent Tasks in OpenMP, Synchronization Constructs in 1

OpenMP
4.7 Data Handling in OpenMP, OpenMP Library Functions 1
4.8 OpenMP Applications: Parallel algorithm development for Matrix 1

multiplication
Module 5 (GPU Programming) (TB-2, Ch. 1, 2 ) (9 hrs)
5.1 Heterogeneous Parallel Computing, Architecture of a Modern GPU, Speeding 1

up Real Applications
5.2 Data parallel computing – CUDA C Program Structure 1
5.3 Vector Addition Kernel, Device Global Memory and Data Transfer 1
5.4 Kernel Functions and Threading, Kernel Launch 1

5.5 CUDA Thread Organization, Mapping Threads to Multidimensional Data 1
5.6 Synchronization and Transparent Scalability, Resource Assignment, 1

Querying Device Properties, Thread Scheduling and Latency Tolerance
5.7 Importance of Memory Access Efficiency, Cuda Memory Types 1
5.8 Tiling for Reduced Memory Traffic 1
5.9 Tiled Matrix Multiplication Kernel, Boundary Checks 1

YEAR OF
DATA COMPRESSION CATEGORY L T P CREDIT INTRODUCTION
CST446
TECHNIQUES
PEC 2 1 0 3 2019
Preamble: This course helps the learners to understand compression techniques on text, image,
audio and video data. It covers lossy &lossless compression, RLE, JPEG, MPEG and its variants.
This course enables the students to develop and implement compression algorithms on different
domains.
Prerequisite: Knowledge of probability theory, computation on matrices, basic topics in data

structures, storage and efficiency
CO# CO
Describe the fundamental principles of data compression(Cognitive Knowledge
CO1 level: Understand)
Make use of statistical and dictionary based compression techniques for various
CO2 applications (Cognitive Knowledge level: Apply)
Illustrate various image compression standards. (Cognitive Knowledge level:

CO3 Apply)
Summarize video compression mechanisms to reduce the redundancy in

CO4 video.(Cognitive Knowledge level: Understand)
Use the fundamental properties of digital audio to compress audio

CO5 data.(Cognitive Knowledge level: Understand)
CO1
CO2
CO3
CO4
CO5


Assessment Pattern
Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
Analyze
Evaluate
Create
Mark Distribution

150 50 100 3

Attendance 10 marks

should answer any5.

Syllabus
Module-1 (Modelling and types of compression)) 1
Introduction to Compression Techniques- Lossy compression & Lossless compression, Measures
of Performance, Modeling and coding. Mathematical modelling for Lossless and lossy compression
- Physical models and probability models.
Module – 2 (Basic Compression Methods)

Basic Compression Technique- Run length encoding, RLE Text compression. Statistical Methods-
Prefix Codes, Binary Huffman coding, non-binary Huffman Algorithms, Arithmetic Coding.
Module - 3 (Text & Image Compression)
Dictionary based Coding- LZ77, LZ78 and LZW compression.Image Compression- Image
standards, JPEG image Compression- Baseline JPEG, JPEG-LS.
Module - 4 (Video Compression)

Video Compression- Analog video, Digital Video, Motion Compensation. MPEG standards-
MPEG 1, MPEG 4
Module - 5 (Audio Compression)

Audio Compression- Basics of Digital Audio, Basic Audio Compression Techniques, MPEG
Audio Compression-Layer 1 coding, Layer 2 coding and Layer 3 coding.
Text Book
1. David Solomon, Data compression: the complete reference, 4/e, Springer, January 2007
2. Khalid Sayood, Introduction to data compression, Morgan Kaufmann Publishers,2003.
References
1) Stephen Welstead, Fractal and wavelet Image Compression techniques, PHI, 1999.
2) Sleinreitz, Multimedia System, Addison Wesley.
3) Mark Nelson and Jean-loup Gailly, The Data Compression Book, M&T Books.

1. Discuss different types of compression performance metrics

2. Explain mathematical model for lossless compression
1. Explain RLE based text compression and identify a example with compression ratio of 2.
2. Given the eight symbols A, B, C, D, E, F, G, and H with probabilities 1/30, 1/30, 1/30,
2/30, 3/30, 5/30, 5/30, and 12/30, draw three different Huffman trees with heights 5 and 6
for these symbols and calculate the average code size for each tree.
1. Differentiate the LZ77 and LZ78 performance with the input given as
‘sirsideastmaneasilyteasesseasickseals’
2. Explain why the continuous-tone images is required for JPEG and the main steps used in
image compression.
1. Briefly explain MPEG-4 video compression standard

2. How H.261 video compression is completed.
1. Explain critical bands, thresholding and masking related to audio compression

2. Explain the working of -law encoder and decoder with an example
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 2
Course Code: CST446
Course Name: Data Compression Techniques
PART A
1. Specify different quantities used to measure the performance of a data

compression technique
2. Explain mathematical model for lossless compression
3. State and prove Kraft-McMillan inequality
4. Compare Huffman and Arithmetic coding
5. Describe LZ77 approach of encoding a string with the help of an example
6. Compare and contrast JPEG and JPEG-LS differences in working.
7. Discuss different components of video
8. Identify the advantage of MPEG-4 over MPEG
9. Explain critical bands, thresholding and masking related to audio compression
10. Explain the working of -law encoder and decoder with an example
(10x3=30)
Part B
11. (a) Explain mathematical model for lossy compression and lossless compression (10)
(b) Define compression ratio with an example (4)
OR
12. (a) Discuss any probability model and identify the shortcoming of the solution. (7)
(b) Identify the mathematical preliminaries for Lossless Compression (7)
13. (a) With a help of flowchart discuss the RLE text compression for text data given (10)
below
‘ABBBBBBBBBCDEEEEF’
(b) calculate the compression ratio for the example while taking repetitions = 4 (4)
OR
14. (a) Illustrate with a example why Huffman coding is preferred than Shannon (10)
Fano Algorithm for compression
(b) How Huffman coding is handling the unpredictability of input data stream (4)
15. (a) Explain in detail the working of LZ78 with example and dictionary Tree (10)
(b) Illustrate with example, how the compression factor LZW differ from the (4)
LZ78
OR
16. (a) How quantization and coding helps in compression and their role in JPEG. (6)
(b) With the help of the given example illustrate the compression ratio of JPEG (8)
and JPEG-LS
17. (a) With the help of equations discuss Composite and Components Video (7)
(b) Differentiate the major changes in MPEG - 2 and MPEG-4 Video (7)
OR
18. (a) Describe in details about functionalities for MPEG-4 (8)
(b) How Motion Compensation help in video compression (6)
19. (a) How The Human Auditory System limitations can be taken in audio (7)
compressions
(b) Discuss the complexity of Layer III compared to others in MPEG Audio (7)
Coding
OR
20. (a) Discuss Format of Compressed Data and encoding in layer I and II (9)
(b) Differentiate Spectral and Temporal Masking (5)
TEACHING PLAN
No Contents No of
Lecture
Hrs (36
Hours)
Module – 1 (Modelling and types of compression) (7 hrs)
1.1 Introduction to Compression Techniques- Lossy compression & Lossless 2

compression, Measures of Performance
1.2 Modelling and coding. 1
1.3 Physical model for lossless compression 1
1.4 Physical model for lossy compression 1
1.5 Probability model for lossless compression 1
1.6 Probability model for lossly compression 1
Module - 2 (Basic Compression Methods) (8 hrs)
2.1 Run length encoding, RLE Text compression 1
2.2 Statistical methods-Prefix Codes 1
2.3 Binary Huffman coding 1
2.4 Illustration of Binary Huffman coding 1
2.5 Non-binary Huffman Algorithms 1
2.6 Arithmetic Coding algorithm 1
2.7 Illustration of Arithmetic Coding algorithm 2

Module - 3 (Text & Image Compression) (8 hrs)
3.1 LZ77 compression 2
3.2 LZ78 Compression 1
3.3 LZW Compression 1
3.4 Basics of Image compression and Image standards 1
3.5 Baseline JPEG Image compression 1
3.6 JPEG-LS Image compression 1
Module - 4 (Video Compression) (7 hrs)
4.1 Basics of Video Compression- Analog video and Digital Video. 2
4.2 Motion Compensation 1
4.3 MPEG-1 standard and Video Syntax 1
4.4 MPEG-1 Pel Reconstruction 1
4.5 MPEG-4 standard 1
4.6 Functionalities for MPEG-4 1
Module - 5 (Audio Compression) ( 6 hrs)
5.1 Basics of Audio Compression, Digital Audio 1
5.2 Basic Audio Compression Techniques 1
5.3 MPEG Audio Compression basics- Frequency Domain Coding 1
5.4 Encoding: Layers I and II 1
5.5 Encoding: Layer II -Psychoacoustic Models 1
5.6 Psychoacoustic Models - Encoding: Layer III 1

YEAR OF
CST466 DATA MINING
PEC 2 1 0 3 2019
Preamble: This course helps the learner to understand the concepts of data mining and data
warehousing. It covers the key processes of data mining, data preprocessing techniques,
fundamentals and advanced concepts of classification, clustering, association rule mining, web
mining and text mining. It enables the learners to develop new data mining algorithms and apply
the existing algorithms in real-world scenarios.
Prerequisite: NIL
CO# CO
CO1 Employ the key process of data mining and data warehousing concepts in application
domains. (Cognitive Knowledge Level: Understand)
CO2 Make use of appropriate preprocessing techniques to convert raw data into suitable
format for practical data mining tasks (Cognitive Knowledge Level: Apply)
CO3 Illustrate the use of classification and clustering algorithms in various application
domains (Cognitive Knowledge Level: Apply)
CO4 Comprehend the use of association rule mining techniques. (Cognitive Knowledge
Level: Apply)
CO5 Explain advanced data mining concepts and their applications in emerging domains
1 0 2
CO1
CO2
CO3
CO4
CO5

Assessment Pattern

Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 20 20 20
Understand 30 30 30
Apply 50 50 50
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3

Attendance 10 marks
Continuous Assessment Test(Average of Internal Test1&2) 25 marks

from the partly completed module), each with 7 marks. Out of the seven questions, a student
should answer any five.
question can have a maximum 2 subdivisions and carries 14 marks.
Syllabus
Module – 1 (Introduction to Data Mining and Data Warehousing)
Data warehouse-Differences between Operational Database Systems and Data Warehouses,
Multidimensional data model- Warehouse schema, OLAP Operations, Data Warehouse
Architecture, Data Warehousing to Data Mining, Data Mining Concepts and Applications,
Knowledge Discovery in Database Vs Data mining, Architecture of typical data mining system,
Data Mining Functionalities, Data Mining Issues.
Module - 2 (Data Preprocessing)

Data Preprocessing-Need of data preprocessing, Data Cleaning- Missing values, Noisy data, Data
Integration and Transformation, Data Reduction-Data cube aggregation, Attribute subset selection,
Dimensionality reduction, Numerosity reduction, Discretization and concept hierarchy generation.
Module - 3 (Advanced classification and Cluster analysis)

Classification- Introduction, Decision tree construction principle, Splitting indices -Information
Gain, Gini indexDecision tree construction algorithms-ID3, Decision tree construction with
presorting-SLIQ, Classification Accuracy-Precision, Recall.
Introduction to clustering-Clustering Paradigms, Partitioning Algorithm- PAM, Hierarchical
Clustering-DBSCAN, Categorical Clustering-ROCK
Module 4: (Association Rule Analysis)

Association Rules-Introduction, Methods to discover Association rules, Apriori(Level-wise
algorithm), Partition Algorithm, Pincer Search Algorithm, Dynamic Itemset Counting Algorithm,
FP-tree Growth Algorithm.
Module 5 (Advanced Data Mining Techniques)

Web Mining - Web Content Mining, Web Structure Mining- Page Rank, Clever, Web Usage
Mining- Preprocessing, Data structures, Pattern Discovery, Pattern Analysis. Text Mining-Text
Data Analysis and information Retrieval, Basic measures for Text retrieval, Text Retrieval
methods, Text Indexing Techniques, Query Processing Techniques.
Text Books
1. Dunham M H, “Data Mining: Introductory and Advanced Topics”, Pearson Education, New
Delhi, 2003.
2. Arun K Pujari, “Data Mining Techniques”, Universities Press Private Limited,2008.
3. Jaiwei Han and Micheline Kamber, “Data Mining Concepts and Techniques”, Elsevier,
2006
Reference Books
1. M Sudeep Elayidom, “Data Mining and Warehousing”, 1st Edition, 2015, Cengage
Learning India Pvt. Ltd.
2. MehmedKantardzic, “Data Mining Concepts, Methods and Algorithms”, John Wiley and
Sons, USA, 2003.
3. Pang-Ning Tan and Michael Steinbach, “Introduction to Data Mining”, Addison Wesley,
2006.

1. (a) Explain the OLAP operations in a multidimensional model.

(b) Compare the techniques used in ROLAP, MOLAP and HOLAP
2. Explain the various data mining issues with respect to mining methodology, user
interaction and diversity of data types.
3. Suppose that a data warehouse consists of the three dimensions time, doctor, and patient,
and the two measures count and charge, where charge is the fee that a doctor charges a
patient for a visit.
a) Draw star and snowflake schema diagrams for the data warehouse.
b) Starting with the base cuboid [day; doctor; patient], what specific OLAP operations
should be performed in order to list the total fee collected by each doctor in 2004?
1. Use the methods below to normalize the following group of data:100, 200, 300, 400,550,
600, 680, 850, 1000
(a) min-max normalization by setting min = 0 and max = 1
(b) z-score normalization
(c) Normalization by decimal scaling
Comment on which method you would prefer to use for the given data, givingreasons as to
why.
2. Identify a suitable dataset from any available resources and apply different preprocessing
steps that you have learned. Observe and analyze the output obtained. (Assignment)

1. Illustrate the working of ID3 algorithm with the following example
2. Illustrate the working of K medoid algorithm for the given dataset. A1=(3,9), A2=(2,5),
A3=(8,4), A4=(5,8), A5=(7,5), A6=(6,4), A7=(1,2), A8=(4,9).
3. Take a suitable dataset from available resources and apply all the classification and clustering
algorithms that you have studied on original and preprocessed datasets. Analyze the
performance variation in terms of different quality metrics. Give a detailed report based on
the analysis. (Assignment)
1. A database has five transactions. Let min sup = 60% and min con f = 80%.
a) Find all frequent item sets using Apriori and FP-growth, respectively. Compare the
efficiency of the two mining processes.
b) List all of the strong association rules (with support s and confidence c) matching the
following metarule, where X is a variable representing customers, and𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖 denotes
variables representing items (e.g., “A”, “B”, etc.)
∀𝑥𝑥 ∈ 𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡𝑡, 𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏(𝑋𝑋, 𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖1 ) ∧ 𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏(𝑋𝑋, 𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖2 ) ⇒ 𝑏𝑏𝑏𝑏𝑏𝑏𝑏𝑏 (𝑋𝑋, 𝑖𝑖𝑖𝑖𝑖𝑖𝑖𝑖3 ) [𝑠𝑠, 𝑐𝑐]
2. Identify and list some scenarios in which association rule mining can be used, and then use at
least two appropriate association rule mining techniques in one of the two scenarios.
(Assignment)
1. Consider an e-mail database that stores a large number of electronic mail (e-mail)
messages. It can be viewed as a semi structured database consisting mainly of text data.
Discuss the following.
a. How can such an e-mail database be structured so as to facilitate multidimensional
search, such as by sender, by receiver, by subject, and by time?
b. What can be mined from such an e-mail database?
c. Suppose you have roughly classified a set of your previous e-mail messages as junk,
unimportant, normal, or important. Describe how a data mining system may take this
as the training set to automatically classify new e-mail messages or unclassified ones.
2. Precision and recall are two essential quality measures of an information retrieval system.
(a) Explain why it is the usual practice to trade one measure for the other.
(b) Explain why the F-score is a good measure for this purpose.
(c) Illustrate the methods that may effectively improve the F-score in an information
retrieval system.
3. Explain HITS algorithm with an example.

QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
Course Code: CST466
Course Name: Data Mining
PART A
1. Differentiate between OLTP and OLAP.
2. Compare the techniques of ROLAP, MOLAP and HOLAP
3. Explain Concept hierarchy with an example.
4. Explain heuristic methods of attribute subset selection techniques.
5. Consider a two-class classification problem of predicting whether a photograph

contains a man or a woman. Suppose we have a test dataset of 10 records with
expected outcomes and a set of predictions from our classification algorithm.
Calculate precision, recall of the data.
6. Given two objects represented by the tuples (22,1,42,10) and (20,0, 36,8).
Compute the Euclideanand Manhattan distance between the two objects.
7. The pincer search algorithm is a bi-directional search, whereas the level wise
algorithm is a unidirectional search. Express your opinion about the statement.
8. Define support, confidence and frequent set in association data mining context.
9. Distinguish between focused crawling and regular crawling.
10. Describe any two-text retrieval indexing techniques. (10x3=30)
Part B
11. (a) Suppose a data warehouse consists of three measures: customer, account (7)
and branch and two measures count (number of customers in the branch)
and balance. Draw the schema diagram using snowflake schema and star
schema.
(b) Explain three- tier data warehouse architecture with a neat diagram. (7)
OR
12 (a) Illustrate different OLAP operations in multidimensional data model (7)
(b) Describe different issues in data mining (7)
13 (a) Suppose that the data for analysis includes the attribute age. The age values (8)
for the data tuples are (in increasing order) 13, 15, 16, 16, 19, 20, 20, 21, 22,
22, 25, 25, 25, 25, 30, 33, 33, 35, 35, 35, 35, 36, 40, 45, 46, 52, 70.
(a) Use min-max normalization to transform the value 35 for age onto
the
range [0-1].
(b) Use z-score normalization to transform the value 35 for age, where
the standard deviation of age is 12.94 years.
(c) Use normalization by decimal scaling to transform the value 35 for
age.
(d) Use smoothing by bin means to smooth the above data, using a bin
depth of 3. Illustrate your steps. Comment on the effect of this
technique for the given data.
(b) With proper illustration, explain how PCA can be used for dimensionality (6)
reduction? Explain
OR
14 (a) Suppose a group of 12 sales price records has been sorted as follows: 5, 10, (8)
11, 13, 15, 35, 50, 55, 72, 92, 204, 215. Sketch examples of each of the
following sampling techniques: SRSWOR, SRSWR, cluster sampling,
stratified sampling. Use samples of size 5 and the strata “youth,” “middle-
aged,” and “senior.”
(b) Partition the above data into three bins by each of the following methods: (6)
(i) equal-frequency (equi-depth) partitioning
(ii) equal-width partitioning
15 (a) Explain the concept of a cluster as used in ROCK. Illustrate with examples (9)
(b) Consider the following dataset for a binary classification problem. (5)
A B Class
Label
T F +
T T +
T T +
T F -
T T +
F F -
F F -
F F -
T T -
T F -
Calculate the gain in Gini index when splitting on A and B respectively.
Which attribute would the decision tree induction algorithm choose?
OR
16 (a) For a sunburn dataset given below, find the first splitting attribute for the (10)
decision tree by using the ID3 algorithm.
Name Hair Height Weight Lotion Class

Sarah Blonde Average Light No Sunburn
Dana Blonde Tall Average Yes None
Alex Brown Tall Average Yes None
Annie Blonde Short Average No Sunburn
Emily Red Average Heavy No Sunburn
Pete Brown Tall Heavy No None
John Brown Average Heavy No None
Katie Blonde Short Light Yes None
(b) Explain the working of SLIQ algorithm. (4)
17 (a) Illustrate the working of Pincer Search Algorithm with an example. (7)
(b) Describe the working of dynamic itemset counting technique? Specify when (7)
to move an itemset from dashed structures to solid structures?
OR
18 (a) A database has six transactions. Let min_sup be 60% and min_conf be (9)
80%.
TID items_bought
T1 I1, I2, I3
T2 I2, I3, I4
T3 I4, I5
T4 I1, I2, I4
T5 I1, I2, I3, I5
T6 I1, I2, I3, I4
Find frequent itemsets using FP Growth algorithm and generate strong

association rules from a three item dataset.
(b) Write partitioning algorithm for finding large itemset and compare its (5)
efficiency with apriori algorithm
19 (a) Describe web content mining techniques. (7)
(b) Write an algorithm to find maximal frequent forward sequences to mine log (7)
traversal patterns. Illustrate the working of this algorithm.
OR
20 (a) Explain how web structure mining is different from web usage mining and (7)
web content mining? Write a CLEVER algorithm for web structure mining.
(b) Describe different Text retrieval methods. Explain the relationship between (7)
text mining and information retrieval and information extraction.
Teaching Plan
No. of
No Contents lecture
hours
(36
Hrs)
Module 1(Introduction to Data Mining and Data Warehousing) (Text3) (6 hours)
1.1 Data warehouse-Differences between Operational Database Systems and

Data Warehouses, Multidimensional data model- Warehouse schema 1
1.2 OLAP Operations 1
1.3 DataWarehouse Architecture, Data Warehousing to Data Mining 1
1.4 Datamining Concepts and Applications, Knowledge Discovery in Database 1

Vs Data mining
1.5 Architecture of typical data mining system,Data Mining Functionalities 1
1.6 Data Mining Functionalities, Data Mining Issues 1
Module 2(Data Preprocessing) (6 hours) (Text3)
2.1 Data Preprocessing: Need of Data Preprocessing, Data Cleaning- Missing 1

values, Noisy data.
2.2 Data integration 1
2.3 Data transformation 1
2.4 Data Reduction-Data cube aggregation, Attribute subset selection 1
2.5 Data Reduction-Dimensionality reduction 1

2.6 Numerosity reduction, Discretization and concept hierarchy generation 1
Module 3(Advanced classification and Cluster analysis)(9 hours)(Text2,Text3)
3.1 Classification- Introduction, Decision tree construction principle, Splitting 1

indices-Information Gain, Gini index
3.2 Decision Tree- ID3 1
3.3 Decision Tree- ID3 1
3.4 Decision tree construction with presorting- SLIQ 1
3.5 Accuracy and error measures, evaluation 1
3.6 Introduction to clustering, Clustering Paradigms 1
3.7 Partitioning Algorithm- PAM 1
3.8 Hierarchical Clustering-DBSCAN 1
3.9 Categorical Clustering-ROCK 1
Module 4(Association Rule Analysis) (8 hours) (Text2,Text3,Text1)
4.1 Association Rules: Introduction, Methods to discover association rules 1
4.2 A priori algorithm (Level-wise algorithm) 1
4.3 A priori algorithm (Level-wise algorithm) 1
4.4 Partition Algorithm 1
4.5 Pincer Search Algorithm 1
4.6 Pincer Search Algorithm 1
4.7 Dynamic Itemset Counting Algorithm 1
4.8 FP-tree Growth Algorithm 1
Module 5(Advanced Data Mining Techniques) (7 hours) (Text1, Text3
5.1 Web Mining - Web Content Mining 1
5.2 Web Structure Mining- Page Rank 1
5.3 Web Structure Mining –Clever algorithm 1
5.4 Web Usage Mining- Preprocessing, Data structures 1

5.5 Web Usage Mining -Pattern Discovery, Pattern Analysis 1
5.6 Text Mining-Text Data Analysis and information Retrieval, Basic 1

measures for Text retrieval
5.7 Text Retrieval methods, Text Indexing Techniques 1

Query Processing Techniques
YEAR OF
CST476 MOBILE COMPUTING
PEC 2 1 0 3 2019
Preamble: The course is designed with the view of preparing the engineering students
capable of understanding the communication protocols, various architectures and security
features used in mobile computing. This course covers basics of mobile computing,
architecture of wireless transmission systems and next generation networks. This course
enables the learners to acquire advanced concepts on wireless communication systems and
mobile ad-hoc networks.
Prerequisite: A sound knowledge of computer networks.
CO# Course Outcomes
CO1 Explain the various mobile computing applications, services, design

considerations and architectures (Cognitive knowledge: Understand)
CO2 Describe the various technology trends for next generation cellular wireless
networks and use the spreading concept on data transmission (Cognitive
knowledge: Apply)
CO3 Summarize the architecture of various wireless LAN technologies
CO4 Identify the functionalities of mobile network layer and transport layer
CO5 Explain the features of Wireless Application Protocol (Cognitive

CO6 Interpret the security issues in mobile computing and next generation
technologies (Cognitive knowledge: Understand)

CO1
CO2
CO3
CO4
CO5
CO6
Assessment Pattern

(%)
Remember 30 30 30
Understand 50 50 50
Apply 20 20 20
Analyse
Evaluate
Create
Mark Distribution

150 50 100 3


Each of the two internal examinations has to be conducted out of 50 marks. First series test shall be
preferably conducted after completing the first half of the syllabus and the second series test shall
be preferably conducted after completing remaining part of the syllabus. There will be two parts:
Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the completed
modules and 1 question from the partly completed module), having 3 marks for each question
adding up to 15 marks for part A. Students should answer all questions from Part A. Part B
contains 7 questions (preferably, 3 questions each from the completed modules and 1 question
answer any 5.

Syllabus
Module - 1 (Mobile Computing Basics)

Introduction to mobile computing – Functions, Middleware and Gateways, Application
and services. Mobile computing architecture – Internet: The Ubiquitous network, Three-
tier architecture for Mobile Computing, Design considerations for mobile computing.
Module – 2 (Wireless Transmission and Communication Systems)

Spread spectrum – Direct sequence, Frequency hopping. Medium Access Control – Space
Division Multiple Access (SDMA), Frequency Division Multiple Access (FDMA), Time
Division Multiple Access (TDMA), Code Division Multiple Access (CDMA). Satellite
Systems – Basics, Applications, Geostationary Earth Orbit (GEO), Low Earth Orbit
(LEO), Medium Earth Orbit (MEO), Routing, Localization, Handover.
Telecommunication Systems - Global System for Mobile Communication (GSM)
services, Architecture, Handover, Security.
Module – 3 (Wireless LANs)

Wireless LAN - Advantages, Design goals, Applications, Infrastructure Vs Ad-hoc mode,
IEEE 802.11 System Architecture, Protocol Architecture, Physical layer, Medium Access
Control layer, HIPERLAN-1, Bluetooth.
Module – 4 (Mobile Network and Transport Layer)

Mobile network layer – Mobile Internet Protocol (IP), Dynamic Host Configuration
Protocol (DHCP), Mobile ad-hoc networks – Routing, Dynamic Source Routing (DSR),
Destination Sequence Distance Vector (DSDV), Ad-hoc routing protocols. Mobile
transport layer – Traditional Transmission Control Protocol (TCP), Improvements in
Classical TCP. Wireless Application Protocol (WAP) - Architecture, Wireless Datagram
Protocol (WDP), Wireless Transport Layer Security (WTLS), Wireless Transaction
Protocol (WTP), Wireless Session Protocol (WSP).
Module – 5 (Mobile Security and Next Generation Networks)

Security issues in mobile computing - Information security, Security techniques and
algorithms, Security models. Next generation networks - Orthogonal Frequency Division
Multiplexing (OFDM), Wireless Asynchronous Transfer Mode (WATM), Multi Protocol
Label Switching (MPLS), 10 pillars of 5G, Security for 5G communication.
Text Books
1. Asoke K. Talukder, Hasan Ahmad, Roopa R Yavagal, Mobile Computing Technology-
Application and Service Creation, 2/e, McGraw Hill Education.
2. Jochen Schiller, Mobile Communications, Pearson Education Asia, 2008.
3. Jonathan Rodriguez, Fundamentals of 5G Mobile Networks, Wiley Publishers, 2015.
Reference Books
1. Raj Kamal, Mobile Computing, 2/e, Oxford University Press.
2. Andrew S. Tanenbaum, Computer Networks, PHI, 3/e, 2003
3. Theodore S. Rappaport, Wireless Communications Principles and Practice, 2/e, PHI, New
Delhi, 2004.

1. Give examples for five mobile computing applications.
2. Identify any three differences between middleware and gateways.

1. There are four stations sending data 1,1,1,0 respectively. Station 3 receives station 1’s
data. Show the encoding, decoding and channel sharing mechanisms using CDMA.
2. Compare the influence of near/far effect and its countermeasures in TDMA and
CDMA systems.

1. Compare IEEE 802.11 and Bluetooth with respect to their ad-hoc capabilities.
2. Describe with neat sketch the major baseband states of a Bluetooth device.

1. With the help of an example, show how routing process is handled by Dynamic Source
Routing protocol.
2. Describe the major differences between AODV and the standard Distance Vector
Routing algorithm. Why are extensions needed?
3. Simulate routing protocols using NS2.

1. How does WAP push operation differ from pull operation?
2. With the help of a neat sketch explain the secure session establishment using WTLS.

1. Explain the 3GPP security framework for mobile security.
2. Explain the features of policy-based security model.

QP CODE: PAGES: 3
Reg No:_______________
Name:_________________

Course Code: CST476

Course Name : Mobile Computing
PART-A
1. Explain the different types of middleware and gateways in the architecture of

mobile computing.
2. Explain the major segments to support mobile computing functions.

3. Compare and contrast the satellite systems – GEO, LEO and MEO.
4. Assume all stations can hear all other stations. One station wants to transmit
and senses the carrier idle. Why can a collision still occur after the start of
transmission?
5. List any three advantages and disadvantages of wireless LANs.
6. Compare the features of infrastructure and ad-hoc networks.
7. Mention the basic purpose of DHCP. Also list the entities of DHCP.
8. Identify the benefits of location information for routing in ad-hoc networks.
9. List any six pillars of 5G.
10. How does multifactor security model provide security in a mobile network?
(10x3=30)
Part B
11. (a) Describe the design considerations of three tier architecture of mobile (6)
computing.
(b) Explain any four functions and applications of mobile computing. (8)
OR
12. (a) Explain Internet-Ubiquitous networks mentioning the significance and (6)
functions of core, edge and access network.
(b) With the help of a neat sketch explain the three-tier architecture of mobile (8)
computing.
13. (a) Check to see if the following set of chips can belong to an orthogonal system. (6)
[+1, +1, +1, +1] , [+1, -1, -1, +1] , [-1, +1, +1, -1] , [+1, -1, -1, +1]
(b) Summarize the routing and localization process in satellite systems. (8)
OR
14. (a) Apply Direct Sequence Spread Spectrum to the data 101 using Barker (6)
sequence 10110111000. Show the encoding and decoding steps.
(b) Describe the system architecture of GSM networks. (8)
15. (a) How is Quality-of-Service provided in Bluetooth? (6)

(b) Explain the phases in Elimination-yield non-preemptive priority multiple (8)

access of HIPERLAN-1.
OR
16. (a) Describe the protocol architecture of IEEE 802.11. (6)
(b) Explain the Medium Access Control management features provided in an (8)
IEEE 802.11 station.
17. (a) With the help of an example, show the routing table creation using (7)
Destination Sequence Distance Vector Routing protocol in mobile ad-hoc
networks.
(b) Describe the router discovery methods used in mobile IP. (7)
OR
18. (a) Compare the features of flat routing and hierarchical routing. (6)
(b) List the entities of a mobile IP. With the help of an example, explain how (8)
packet delivery is done to and from a fixed node.
19. (a) How is orthogonality helpful in Orthogonal Frequency Division (4)

Multiplexing?
(b) Explain the functioning of Multi Protocol Label Switching technology. (10)
OR
20. (a) Describe the services of Wireless Asynchronous Transfer Mode. (6)
(b) Explain the different security models in mobile computing. (8)
TEACHING PLAN
No Contents No.of
Lecture
Hrs
(35 hrs)
Module – 1 (Mobile Computing Basics) (6 hrs)
1.1 Introduction to mobile computing – Functions 1

1.2 Middleware and Gateways 1
1.3 Application and services 1
1.4 Internet: The Ubiquitous network 1

1.5 Three-tier architecture for Mobile Computing 1

1.6 Design considerations for mobile computing 1
Module – 2 (Wireless Transmission and Communication Systems) (8 hrs)
Direct sequence spread spectrum, Frequency hopping spread

2.1 1
spectrum
Space Division Multiple Access (SDMA), Frequency Division 1

2.2
Multiple Access (FDMA)
2.3 Time Division Multiple Access (TDMA) 1
2.4 Code Division Multiple Access (CDMA) 1
2.5 Satellite Systems Basics, Applications, Geostationary Earth Orbit 1

(GEO), Low Earth Orbit (LEO), Medium Earth Orbit (MEO)
2.6 Routing, Localization, Handover 1
2.7 Global System for Mobile Communication (GSM) services, 1

Architecture
2.8 Handover, Security 1
Module - 3 (Wireless LANs) (7 hrs)
3.1 Wireless LAN - Advantages, Design goals, Applications, 1

Infrastructure Vs Ad-hoc mode
3.2 IEEE 802.11 System Architecture 1
3.3 Protocol Architecture 1
3.4 Physical layer 1
3.5 Medium Access Control layer 1
3.6 HIPERLAN-1 1
3.7 Bluetooth 1
Module - 4 (Mobile Network and Transport Layer) (8 hrs)
Mobile Internet Protocol (IP), Dynamic Host Configuration

4.1 1
Protocol (DHCP)
4.2 Mobile ad-hoc networks – Routing, Dynamic Source Routing (DSR) 1

Destination Sequence Distance Vector (DSDV)

4.3 1
Ad-hoc routing protocols
4.4 1
4.5 Traditional Transmission Control Protocol (TCP), Improvements in 1
Classical TCP
4.6 Wireless Application Protocol (WAP) – Architecture, Wireless 1

Datagram Protocol (WDP)
4.7 Wireless Transport Layer Security (WTLS) 1
4.8 Wireless Transaction Protocol (WTP), Wireless Session Protocol 1

(WSP)
Module - 5 (Mobile Security and Next Generation Networks) (6 hrs)
Information security, Security techniques

5.1 1
5.2 Security algorithms, Security models 1

5.3 Introduction to Next generation networks, Orthogonal Frequency 1
Division Multiplexing (OFDM)
5.4 Wireless Asynchronous Transfer Mode (WATM) 1
5.5 Multi Protocol Label Switching (MPLS) 1
5.6 10 pillars of 5G, Security for 5G communication 1

SEMESTER VIII
PROGRAM ELECTIVE V
YEAR OF
HIGH PERFORMANCE CATEGORY L T P CREDIT INTRODUCTION
CST418
COMPUTING
PEC 2 1 0 3 2019
Preamble: This course helps the learners to understand the different architectural features of
high-end processors. This course discusses the Basics of high-end processors Architecture,
Instruction-Level Parallelism, Data-Level Parallelism, Thread Level Parallelism, and GPU
Architectures. This course enables the students to provide solutions to real-world problems
making use of the capabilities of HPC systems.
Prerequisite: Basic knowledge in Computer System architecture, Microprocessors, Operating
systems, and System software.
CO1 Describe different types of modern processing environments and parallel computing
hardware (Cognitive Knowledge Level: Understand)
CO2 Summarize the concepts of Instruction Level Parallelism (Cognitive Knowledge

Level: Understand)
CO3 Appreciate the idea of Data Level Parallelism (Cognitive Knowledge Level: Apply)
CO4 Demonstrate the concept of Thread Level Parallelism (Cognitive Knowledge Level:
Apply)
CO5 Describe the basics of GPU architecture. (Cognitive Knowledge Level: Understand)

CO1
CO2
CO3
CO4
C05

Assessment Pattern

Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 20 20 20
Understand 50 50 50
Apply 30 30 30
Analyze
Evaluate
Create
Mark Distribution
Total Marks CIE Marks ESE Marks. ESE Duration
150 50 100 3

Attendance 10 marks

Each of the two internal examinations have to be conducted out of 50 marks. The first series test
contains 2 full questions from each module of which students should answer anyone. Each
question can have a maximum of 2 sub-divisions and carries 14 marks.
Syllabus
Module-1 ( Basics of Architecture )
Classes of Computers - Classes of Parallelism and Parallel Architectures – Defining Computer
Architecture – Dependability – Quantitative Principles of Computer Design – Basics of Memory
Hierarchies – Virtual Memory and Virtual Machines – Pipelining
Module-2 ( Instruction-Level Parallelism)

Instruction-Level Parallelism: Concepts and Challenges – Basic Compiler Techniques for
Exposing ILP – Reducing Branch Costs With Advanced Branch Prediction – Hardware-Based
Speculation – Multithreading: Exploiting Thread-Level Parallelism to Improve Uniprocessor
Throughput
Module-3 (Data-Level Parallelism)

Vector Architecture – SIMD Instruction Set Extensions for Multimedia – Graphics Processing
Units – Detecting and Enhancing Loop-Level Parallelism
Module-4 ( Thread Level Parallelism)

Multiprocessor Architecture: Issues and Approach – Centralized Shared-Memory Architectures –
Performance of Symmetric Shared-Memory Multiprocessors– Distributed Shared-Memory and
Directory-Based Coherence – Synchronization: The Basics – Introduction to Memory
Consistency
Module-5 (GPU Architectures)

The CPU-GPU system as an accelerated computational platform – The GPU and the thread
engine – Characteristics of GPU memory spaces – The PCI bus: CPU to GPU data transfer
overhead – Multi-GPU platforms – Potential benefits of GPU – accelerated platforms
Text Books
1. John L. Hennessy, David A. Patterson Computer Architecture, Sixth Edition A
Quantitative Approach, Morgan Kaufman, Fifth Edition, 2012.
2. Robert Robey, Yuliana Zamora, Parallel and High-Performance Computing, Manning
Publications, First Edition, 2021.
Reference Books
1. Thomas Sterling, Matthew Anderson, and MaciejBrodowicz, High-Performance
Computing – Modern Systems and Practices, First Edition, 2017.
2. Charles Severance, Kevin Dowd,High-Performance Computing, O'Reilly Media, Second
Edition, 1998.
3. Kai Hwang, Faye Alaye Briggs, Computer Architecture and Parallel Processing,
McGraw-Hill, 1984.

1. Differentiate different classes of computer-based on features like microprocessor cost,
system cost, and system design issues.
2. Explain the different methods by which computer hardware exploits application-level
parallelism.
3. Explain in detail the instruction set architecture
4. Describe the encoding scheme specified as part of ISA

1. Differentiate data, name, and control dependencies with suitable examples.
2. Explain loop unrolling with suitable coding demonstration
3. Explain in detail about Tournament Predictors.
4. Describe the unique features of very long instruction word processors.

1. What are the three things conveyed through a data dependence? Explain the Data
Dependencies of the following code:
2. Assume a single-issue pipeline. Unroll the loop as many times as necessary to schedule it
without any stalls, collapsing the loop overhead instructions. How many times must the
loop be unrolled? Show the instruction schedule. What is the execution time per element of
the result?
3. Explain the SIMD Instruction Set Extensions for Multimedia.

1. With the help of a neat diagram illustrate a single-chip multicore with a distributed
cache.
2. Demonstrate the Implementation of cache coherence in a distributed-memory
multiprocessor by adding a directory to each node with a suitable diagram.
3. Consider the following code segments running on two processors P1 and P2.
Assume A, and B, are initially 0. Explain how an optimizing compiler might make it
impossible for B to be ever set to 2 in a sequentially consistent execution model.

1. Explain the benefits of potential GPU.
2. Illustrate GPU system as an accelerated computational platform.
3. Discuss CPU to GPU data transfer overhead.
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
Course Code: CST418
Course Name: High Performance Computing
PART A
1. Differentiate between Data level parallelism and Task level parallelism
2. Explain the principle of locality
3. Define Instruction Level Parallelism with an example.
4. Devise the importance of loop unrolling with an example.
5. What is the equation of CPI (cycles per instruction) for a pipelined processor? How
can we set the ideal pipeline CPI?
6. Explain the two types of name dependencies between an instruction i that precedes
instruction j in program order.
7. Differentiate between module reliability and module availability measures with

suitable examples.
8. Why SMP architectures are called UMA multiprocessors and DSM multiprocessors
as NUMA processors.
9. Explain the need for GPU.
10. List the characteristics of GPU memory spaces.
3x10=30
Part B
11. (a) Describe the quantitative principle of computer design with Amdahl's law. (8)
(b) Discuss in detail the importance of considering processor performance for (6)
the design of an efficient computer system.
OR
12. (a) Illustrate how processes are protected with the help of virtual memory. (7)
(b) Discuss the role played by virtual machines in providing protection for (7)
processes.
13. (a) Explain in detail data dependence and hazards. (8)
(b) With neat sketches explain how data-level parallelism is achieved in vector, (6)
and SIMD architectures.
OR
14. (a) Describe the unique features of very long instruction word processors. (8)
(b) Consider a three-way superscalar machine renaming these three instructions (6)
concurrently:
If the value of x1 starts at 5, then what will be its value when after this
sequence is executed?
15. (a) The following loop has multiple types of dependences. Find all the true (8)
dependences, output dependencies, and anti-dependencies, and eliminate the
output dependencies and anti-dependencies by renaming.
(b) Describe the limitations of Symmetric Shared-Memory Multiprocessors and (6)

Snooping Protocols
OR
16. (a) Demonstrate the different types of hardware approaches required for the (8)
working of multithreading.
(b) Consider the following loop: (6)
Are there exist dependencies between S1 and S2? Determine whether the
above loop is parallel? If not, show how to make it parallel.
17. (a) Consider an 8-processor multicore where each processor has its own L1 and (8)
L2 caches. Here snooping is performed on a shared bus among the L2
caches. Assume that the average L2 request is 15 cycles for a coherence
miss or other miss and a clock rate of 3.0 GHz, a CPI of 0.7, and a load/store
frequency of 40%. If the goal set is that no more than 50% of the L2
bandwidth is consumed by coherence traffic, then what is the maximum
coherence miss rate per processor?
(b) Explain the basic structure of a centralized shared-memory multiprocessor (6)

based on a multicore chip.
OR
18. (a) Suppose an application running on a 100-processor multiprocessor use 1, (6)

50, or 100 processors. If for 95% of the time all 100 processors are used,
illustrate how the remaining 5% of the execution time employs 50
processors for a speedup of 80?
(b) With a neat diagram, demonstrate invalidate cache coherence protocol for a (8)
private write-back cache, showing the states and state transitions for each
block in the cache.
19. (a) Explain the multi-GPU platform. (8)
(b) Explain some of the benefits of GPU. (6)
OR
20. (a) Discuss in detail the characteristics of GPU memory spaces. (8)
(b) Explain about GPU thread engine. (6)
Teaching Plan
No. of
Lecture
No Contents Hours
(36 hrs)
Module 1 - Basics of Architecture (7 hours)
1.1 Classes of Computers 1 hour

1.2 Classes of Parallelism and Parallel Architectures 1 hour
1.3 Dependability 1 hour
1.4 Quantitative Principles of Computer Design. 1 hour
1.5 Basics of Memory Hierarchies 1 hour

1.6 Virtual Memory and Virtual Machines 1 hour
1.7 Pipelining 1 hour
Module -2 (Introduction to Syntax Analysis) (7 hours)
2.1 Instruction-Level Parallelism: Concepts and Challenges 1 hour

2.2 Basic Compiler Techniques for Exposing ILP 1 hour
2.3 Reducing Branch Costs With Advanced Branch Prediction 1 hour
2.4 Hardware-Based Speculation 1 hour
2.5 Multithreading 1 hour
Exploiting Thread-Level Parallelism to Improve Uniprocessor Throughput – 1 hour
2.6
Lecture 1.
Exploiting Thread-Level Parallelism to Improve Uniprocessor Throughput – 1 hour
2.7
Lecture 2.
Module- 3 - Data-Level Parallelism (7 hours)
3.1 Vector Architecture -Lecture 1 1 hour

3.2 Vector Architecture -Lecture 2 1 hour
3.3 SIMD Instruction Set Extensions for Multimedia – Lecture 1 1 hour
3.4 SIMD Instruction Set Extensions for Multimedia – Lecture 2 1 hour

3.5 Graphics Processing Units 1 hour
Detecting and Enhancing Loop-Level Parallelism – Lecture 1 1 hour
3.6
Detecting and Enhancing Loop-Level Parallelism – Lecture 2 1 hour

3.7
Module 4– Thread Level Parallelism (8 hours)
4.1 Multiprocessor Architecture: Issues and Approach 1 hour

4.2 Centralized Shared-Memory Architectures – Lecture 1 1hour
4.3 Centralized Shared-Memory Architectures – Lecture 2 1hour
4.4 Performance of Symmetric Shared-Memory Multiprocessors 1hour
4.5 Distributed Shared-Memory 1hour
4.6 Directory-Based Coherence 1hour
4.7 Synchronization 1hour
4.8 Introduction to Memory Consistency 1hour
Module 5 – GPU Architectures (7 hours)
5.1 The CPU-GPU system as an accelerated computational platform 1 hour

5.2 The GPU and the thread engine – Lecture 1 1 hour
5.3 The GPU and the thread engine – Lecture 2 1 hour
5.4 Characteristics of GPU memory spaces 1hour
5.5 PCI bus: CPU to GPU data transfer overhead 1hour
5.6 Multi-GPU platforms 1hour
Potential benefits of GPU-accelerated platforms 1hour
5.7
YEAR OF
BLOCKCHAIN CATEGORY L T P CREDIT INTRODUCTION
CST428
TECHNOLOGIES
PEC 2 1 0 3 2019
Preamble: The purpose of this course is to create awareness and understanding among students
on the foundation of blockchain technology. The course introduces the cryptographic principles
behind blockchain and helps the students understand concepts like consensus, crypto-currency,
smart contracts, use cases etc. The course enables students to develop simple decentralized
applications using blockchain networks such as Ethereum.
Prerequisite: Basic knowledge in data structures and operating systems.
CO1 Illustrate the cryptographic building blocks of blockchain technology. (Cognitive

CO2 Explain the fundamental concepts of blockchain technology. (Cognitive Knowledge

Level: Understand)
CO3 Summarize the classification of consensus algorithms. (Cognitive Knowledge Level:

Understand)
CO4 Explain the concepts of first decentralized cryptocurrency bitcoin. (Cognitive

CO5 Explain the use of smart contracts and its use cases. (Cognitive Knowledge Level:
Understand)
CO6 Develop simple applications using Solidity language on Ethereum platform.

0 2
CO1
CO2
CO3
CO4
CO5
CO6

Assessment Pattern

Category Marks (%)
Test 1 (%) Test 2 (%)
Remember 30 30 30
Understand 50 50 50
Apply 20 20 20
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3

Attendance 10 marks

answer any 5.
Syllabus
Module – 1 (Fundamentals of Cryptography)
Introduction to Cryptography, Symmetric cryptography – AES. Asymmetric cryptography –
RSA. Elliptic curve cryptography, Digital signatures – RSA digital signature algorithms. Secure
Hash Algorithms – SHA-256. Applications of cryptographic hash functions – Merkle trees,
Distributed hash tables.
Module – 2 (Fundamentals of Blockchain Technology)

Blockchain – Definition, architecture, elements of blockchain, benefits and limitations, types of
blockchain. Consensus – definition, types, consensus in blockchain.
Decentralization – Decentralization using blockchain, Methods of decentralization, Routes to

decentralization, Blockchain and full ecosystem decentralization.
Module - 3 (Consensus Algorithms and Bitcoin)

Consensus Algorithms, Crash fault-tolerance (CFT) algorithms – Paxos, Raft. Byzantine fault-
tolerance (BFT) algorithms – Practical Byzantine Fault Tolerance (PBFT), Proof of work (PoW),
Proof of stake (PoS), Types of PoS.
Bitcoin – Definition, Cryptographic keys – Private keys, public keys, addresses. Transactions –
Lifecycle, coinbase transactions, transaction validation. Blockchain – The genesis block.
Mining – Tasks of miners, mining algorithm, hash rate. Wallets – Types of wallets.
Module - 4 (Smart Contracts and Use cases)
Smart Contracts – Definition, Smart contract templates, Oracles, Types of oracles, Deploying
smart contracts. Decentralization terminology – Decentralized applications, Decentralized
Autonomous Organizations.
Use cases of Blockchain technology – Government, Health care, Finance, Supply chain
management.
Blockchain and allied technologies – Blockchain and Cloud Computing, Blockchain and
Artificial Intelligence.
Module - 5 (Ethereum and Solidity)
Ethereum – The Ethereum network. Components of the Ethereum ecosystem – Keys and
addresses, Accounts, Transactions and messages. The Ethereum Virtual Machine, Blocks and
blockchain.
The Solidity language – The layout of a Solidity source code, Structure of a smart contract,
variables, data types, control structures, events, inheritance, libraries, functions, error handling.
Smart contracts Case study: Voting, Auction.
Text Book
1. Imran Bashir, Mastering Blockchain: A deep dive into distributed ledgers, consensus
protocols, smart contracts, DApps, cryptocurrencies, Ethereum, and more, Packt Publishing,
Third edition, 2020.
References
2. Ritesh Modi, Solidity Programming Essentials: A beginner's guide to build smart contracts
for Ethereum and blockchain, Packt Publishing, First edition, 2018.
3. Kumar Saurabh, Ashutosh Saxena, Blockchain Technology: Concepts and Applications,
First Edition, Wiley Publications, First edition, 2020.
4. Chandramouli Subramanian, Asha A George, et al, Blockchain Technology, Universities
Press (India) Pvt. Ltd, First edition, August 2020.
5. Lorne Lantz, Daniel Cawrey, Mastering Blockchain: Unlocking the Power of

Cryptocurrencies, Smart Contracts, and Decentralized Applications, O'Reilly Media, First
edition, 2020.
6. Andreas M. Antonopoulos, Gavin Wood, Mastering Ethereum: Building Smart Contracts
and DApps, O'Reilly Media, First edition, 2018.

1. Distinguish between Symmetric cryptography and asymmetric cryptography.
2. Explain the working of AES algorithm.

1. Categorize consensus mechanism used in blockchain.
2. Define Blockchain. Explain how decentralization of computing or processing power is
achieved by a blockchain.

1. Explain how Proof of Stake can achieve consensus among peers.
2. Explain the working of Raft protocol.

1. Describe the use of genesis block.
2. Explain the mining algorithm used in bitcoin.

1. Illustrate how blockchain technology can be used in supply chain management.
2. What are oracles in a blockchain ecosystem? Explain the generic data flow from a smart
contract to an oracle.
1. Develop a smart contract for voting process. In this application, delegated voting is
allowed and the counting is automatic and completely transparent at the same time.
2. Develop a smart contract for auction process. The contract should be a blind auction
where it is not possible to see the actual bid until the bidding period ends.
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 2
Course Code: CST428
Course Name: BLOCK CHAIN TECHNOLOGIES
PART A
1. Discuss the role of secure hash functions in blockchain.
2. List out the properties of digital signatures.
3. Illustrate the blockchain based decentralized system.
4. Explain how Proof of Stake can achieve consensus among peers.
5. If your blockchain network has 5 Byzantine nodes, what is the minimum number of
nodes that are required to ensure Byzantine fault tolerance using PBFT protocol?
6. How are transactions verified in a Bitcoin network?
7. Explain how smart contracts can be used for enforcing agreements between parties
in the form of business logic.
8. Explain the concept of blockchain-based digital identity cards.
9. Explain error handling in Solidity language.

10. With the help of a figure show the relationship between the transaction, transaction (10x3=30)
trie, and block header in Ethereum.
Part B
11. (a) Explain the design of SHA-256 and its compression function using a (9)
diagram.
(b) Explain how hash functions are used to build Merkle trees in blockchain. (5)
OR
12. (a) Explain public and private keys. Perform encryption and decryption using (7)
RSA for p=3, q=11, e= 7 and M=5.
(b) Explain elliptic curve digital signature algorithm. (7)
13. (a) Illustrate and explain how blockchain works using a neat diagram. (7)
(b) Explain the benefits, features and limitations of blockchain. (7)
OR
14. (a) Explain consensus mechanisms used in blockchain. List out any six (7)
consensus algorithms used in the context of blockchain.
(b) Define blockchain. Explain how decentralization of computing or processing (7)

power is achieved by a blockchain.
15. (a) Explain and illustrate how Paxos protocol can be used to achieve consensus. (7)
(b) Show how Practical Byzantine Fault Tolerance can achieve consensus in the (7)
presence of Byzantine faults.
OR
16. (a) Describe the various fields that make up a transaction in Bitcoin. (7)
(b) What is the role of a Bitcoin miner? Explain the mining algorithm used in (7)
Bitcoin with the help of a flowchart.
17. (a) Illustrate how blockchain technology can be implemented in finance sector. (7)
(b) Discuss oracles in a blockchain ecosystem. Explain the generic data flow from (7)
a smart contract to an oracle.
OR
18. (a) Explain the design process of decentralized applications with diagrams. (7)
(b) Explain the use of blockchain technology in supply chain management. (7)
19. (a) Using Solidity language, create a simple bank contract that allows a user to (7)
deposit, withdraw and view balance.
(b) Define block difficulty. Explain how block difficulty is adjusted in Ethereum (7)
blockchain network.
OR
20. (a) Using Solidity language, create a simple voting smart contract where a (7)
chairperson will give the right to vote to each address individually.
(b) Explain the concept of Gas in Ethereum. Explain how transaction cost can be (7)
calculated in an Ethereum blockchain network.
Teaching Plan
No. of
Lecture
No Contents Hours
(35 hours)
Module-1 (Fundamentals of Cryptography) (7 hours)
1.1 Introduction to cryptography 1 hour

1.2 Symmetric cryptography, AES 1 hour
1.3 Asymmetric cryptography, RSA 1 hour
1.4 Elliptic curve cryptography 1 hour
1.5 Digital signatures – RSA digital signature algorithm 1 hour
1.6 Secure Hash Algorithms – SHA-256 1 hour
Applications of cryptographic hash functions – Merkle trees, Distributed
1.7 1 hour
hash tables
Module-2 (Fundamentals of Blockchain Technology) (6 hours)
2.1 Blockchain – definition and architecture 1 hour
2.2 Elements of blockchain. 1 hour
2.3 Blockchain – benefits and limitations, types. 1 hour
2.4 Consensus – definition, types, consensus in blockchain 1 hour
2.5 Decentralization using blockchain, Methods of decentralization 1 hour
2.6 Routes to decentralization, Blockchain and full ecosystem decentralization 1 hour
Module-3 (Consensus Algorithms and Bitcoin) (7 hours)
Consensus Algorithms – Crash fault-tolerance (CFT) algorithms – Paxos,
3.1 1 hour
Raft (working is expected).
Byzantine fault-tolerance (BFT) algorithms – Practical Byzantine Fault
3.2 1 hour
Tolerance (PBFT) (working is expected).
3.3 Proof of work (PoW), Proof of stake (PoS), Types of PoS 1 hour
Bitcoin – Definition, Cryptographic keys – Private keys, public keys,
3.4 1 hour
addresses.
3.5 Transactions – Lifecycle, coinbase transactions, transaction validation 1 hour
3.6 Blockchain – The genesis block. Mining – Tasks of miners 1 hour

3.7 Mining – mining algorithm, hash rate. Wallets – Types of wallets. 1 hour
Module-4 (Smart Contracts and Use cases) (6 hours)
4.1 Smart Contracts – Definition, Smart contract templates 1 hour
4.2 Oracles, Types of oracles, Deploying smart contracts. 1 hour
Decentralization terminology –Decentralized applications, Decentralized
4.3 1 hour
Autonomous Organizations.
4.4 Use cases of Blockchain technology – Government, Health care. 1 hour
4.5 Use cases of Blockchain technology – Finance, Supply chain management. 1 hour
Blockchain and Allied Technologies – Blockchain and Cloud Computing,
4.6 1 hour
Blockchain and Artificial Intelligence.
Module-5 (Ethereum and Solidity) (9 hours)
Ethereum - The Ethereum network,
5.1 1 hour
Components of the Ethereum ecosystem – Keys and addresses, Accounts
5.2 Components of the Ethereum ecosystem – Transactions and messages 1 hour
5.3 The Ethereum Virtual Machine 1 hour
5.4 Ethereum Blocks and blockchain 1 hour
The Solidity language – The layout of a Solidity source code, Structure of a
5.5 1 hour
smart contract, variables, data types
5.6 The Solidity language – control structures, events, inheritance, libraries 1 hour
5.7 The Solidity language – functions, error handling. 1 hour
5.8 Smart contracts Case study: Voting. 1 hour
5.9 Smart contracts Case study: Auction. 1 hour
YEAR OF
IMAGE PROCESSING CATEGORY L T P CREDIT INTRODUCTION
CST438
TECHNIQUE
PEC 2 1 0 3 2019
Preamble: This course helps the learners understand the core concepts and applications of Digital
Image Processing. It covers Digital Image Fundamentals, Image Transforms, Image Enhancement
in Spatial and Frequency Domain, Image Restoration & Image Segmentation and Morphological
Operations & Representation and Description. The learners will be able to develop new
algorithms, tools, and application software for real-world applications involving image processing.
Prerequisite: A basic knowledge of Computer Graphics and Image representation
CO1 Explain the concepts of image formation and the basis of digital image processing.
CO2 Demonstrate the role of image transforms in representing, highlighting, and modifying
image features. (Cognitive Knowledge Level: Apply)
Solve image enhancement problems using spatial and frequency domain techniques.
CO3
CO4 Make use of the concept of image restoration and image segmentation techniques in
real-world problems. (Cognitive Knowledge Level: Apply)
CO5 Interpret morphological operations, image representation, and description techniques.


CO1
CO2
CO3
CO4
CO5
PO3 Design/Development of PO9 Individual and teamwork

solutions
Assessment Pattern

Bloom’s Examination
Category Marks (%)
Test 1 Test 2
(%) (%)
Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
Analyze
Evaluate
Create
Mark Distribution
Total CIE ESE Marks ESE

Marks Marks Duration
150 50 100 3

Attendance 10 marks

contains 2 full questions from each module of which students should answer anyone. Each
question can have a maximum 2 subdivisions and carries 14 marks.
Syllabus
Module – 1 (Digital Image Fundamentals)
Elements of Visual Perception, A Simple Image Formation Model. Spatial and Intensity
Resolution. Image Interpolation. Classification of Digital Images. Image Types. Image Storage
Mechanisms. Arithmetic and Logical Operations. Geometric Spatial Transformations and Image
Registration. Image File Formats. Colour Fundamentals and Colour Models.
Module - 2 (Image Transforms)
Basic concept of spatial domain and frequency domain, Unitary transform, Discrete Fourier
Transform- 2D DFT, 4 order DFT Transform coefficients, Forward and inverse transform,
Discrete Cosine Transform- 2D DCT, 4 order DCT Transform Coefficients(No derivation
needed), Forward and Inverse DCT, Hadamard Transform.
Module - 3 (Image Enhancement in Spatial and Frequency Domain)
Point operations- Clipping and Thresholding, Digital Negative, Intensity Level Slicing, Bit
Extraction, Range Compression. Spatial Operations- Fundamentals of spatial convolution and
correlation, Spatial averaging and spatial Low pass filtering, Directional Smoothing, Median
Filtering, Unsharp masking and Crispening.
Basics of Filtering in Frequency Domain, Filters, Smoothing Frequency Domain Filters-

Sharpening Frequency Domain Filters
Module - 4 (Image Restoration & Image Segmentation)

Image degradation model, Noise models, Mean Filters, Order Statistic filter, Adaptive filters.
Edge Detection, gradient operators, Laplace operators and zero crossings. Thresholding, Basic
Global Thresholding, Optimum global thresholding using Otsu method, Multiple thresholds,
Variable thresholding, Multivariable thresholding. Region-Based Approach to Segmentation.
Module - 5 (Morphological Operations & Representation and Description)

Structuring Element, Dilation and Erosion, Opening and Closing, Hit or Miss Transformation.
Boundary Following. Chain Codes. Polygonal Approximation. Boundary Descriptors. Regional

Descriptors. Relational Descriptors.
Text Books
1. Rafael C. Gonzalez, Richard E. Woods, Digital Image Processing (English) 3rd Edition,
Pearson India, 2013
2. A K. Jain, Fundamentals of digital image processing, Prentice Hall of India, 1989.
Reference Books
1. Al Bovik, The Essential Guide to Image Processing, Academic Press, 2009.
2. Milan Sonka, Vaclav Hlavac and Roger Boyle, Image Processing, Analysis, and Machine
Vision, Thomson Learning, 2008.
3. S Jayaraman, S Esakkirajan and T Veerakumar, Digital Image Processing, McGraw Hill
Education, 2009.
Course Outcome1 (CO1) :
1. Find the number of bits required to store a 256 X 256 image with 32 gray levels.
2. Explain the reasons for blocking artifacts and false contours in an image.
Course Outcome 2 (CO2) :
1. Compare different image transforms based on their roles, properties and applications.
2. Compute the inverse 2D DFT of the transform coefficients F(k,l) given below.
3. Use Discrete Fourier transform to construct 2D DFT for a 4x4 image given below. Assume that
indices start from (0,0)
1. Perform intensity level slicing on the 3 BPP (Bit Per Pixel) image. Let r1=3 and r2=5. Draw
the modified image with/without background transformations.
2. Let y(m) = {2,3,8,4,2}. Obtain the median filter output for the window W = [-1,0,1,2] and
show how salt and pepper noise is reduced.
3. Consider a 3*3 spatial mask that averages the four closest neighbors of a point(x,y), but
excludes the point itself from the average.
(a) Find the equivalent filter H(u,v) in the frequency domain.
(b) Show that H(u,v) is a lowpass filter (ASSIGNMENT)

1. Compare Region and Edge-based techniques in segmentation.
2. Consider a noisy image that is restored using arithmetic mean filter of size 3x3 and
using the geometric mean filter of the same size. Which image will be less blurred and
why?
3. Suppose that you want to help a radiologist to extract the tumor portion from an MRI
image for volumetric analysis. This volumetric analysis determines the effect of
treatment on the patient, which can be judged from the extracted size and shape of the
abnormal portion. Manual tracing of the tumor regions is very difficult since the tumor
portion on the MRI image is inhomogeneous, with complex shapes and ambiguous
boundaries. Suggest a sequence of steps that you may use to automate this process as an
image processing student. (ASSIGNMENT)

4. Explain the significance of structuring elements in morphological operations with
example.
5. Explain how chain codes are used to represent boundaries of a region with examples.

QP CODE:
Reg No: _______________
Name: _________________ PAGES : 4
Course Code: CST438
Course Name: IMAGE PROCESSING TECHNIQUE
PART A
1. Give an image representation model and describe how the representation changes
in different types of images.
2. Describe any three types of color models.
3. Obtain the HADAMARD basis matrix for N=8.

4. Prove that DFT is a unitary transform.
5. Sketch perspective plot of a 2-D ideal low pass filter transfer function and filter
cross-section. List its usefulness in Image enhancement.
6. Explain the significance of directional smoothing technique.
7. Specify the significance of the Zero crossing detector.
8. Describe region growing technique for image segmentation.

9. Define ‘Structuring Element’ used in morphological operations. Give samples for
Structuring Elements.
10. Explain image boundary representation using polygonal approximation.
(10x3=30)
Part B
11. (a) (7)
Explain a Simple Image Formation Model with the help of a neat diagram.
(b) Explain the relationship between image size, spatial resolution, and image (7)
quality. Compare gray level and intensity resolution.
OR
12. (a) Describe arithmetic, logical and geometrical operations on Image. (7)
(b) Explain the significance of image interpolation and describe its various types. (7)
13. (a) State the advantages of Discrete Cosine Transform over Discrete Fourier (4)
Transform.
(b) You are given a 4 X 4 image patch Compute 2D DCT for the image patch. (10)
Reconstruct the original image patch by neglecting the last four coefficients in
2D DCT. Comment on the observed result.
OR
14. (a) Discuss the concept of sequency in Hadamard transform. (4)
(b) Find the 2D forward DFT of the image segment (10)
1 1 1 1
1 1 1 1
1 1 1 1
Prove the unitary property of the given image segment.
15. (a) Explain the output and application of the following point processing (9)
techniques
(i)Range Compression (ii) Bit Extraction (iii) Thresholding
(b) State and explain the features of median filtering. Compute the output of the (5)
median filtering for Y(m)={2,4,8,3,2} , w={-1,0,1,2} where Y(m) is an array
and w is a window.
OR
16. (a) Describe the role of Unsharp masking with its applications (4)
(b) Explain and compare the basic frequency domain filters for image sharpening (10)
17. (a) A 4×4 image is given by (8)
2 4 8 7
12 6 9 8
13 7 4 3
8 12 4 9
Filter the above image using

(a) MIN filter (b) MAX filter using the filter mask
0 1 0
1 1 1
0 1 0
(Assume replicate padding of the input image)
(b) Explain any two types of thresholding techniques. Describe the threshold (6)
detection algorithm using Otsu’s method.
OR
18. (a) Explain Image degradation model with the help of a neat diagram. (8)
(b) Illustrate the split and merge algorithm for image segmentation using neat (6)
sketches.
19. (a) Explain the purpose of morphological operations in digital image? Describe (7)
the opening and closing operations with examples.
(b) Illustrate Hit or Miss Transformation. (7)
OR
20. (a) Explain the concept of the chain coding scheme with its applications. (6)
(b) Describe in detail any two boundary representation schemes and illustrate (8)
with examples.
Teaching Plan
No. of
Lecture
No Contents Hours
(36 hrs)
Module-1 (Digital Image Fundamentals) (7 hours)
1.1 Elements of Visual Perception, A Simple Image Formation Model 1
1.2 Spatial and Intensity Resolution, Image Interpolation, Classification of 1

Digital Image.
1.3 Image Types, Image Storage Mechanisms. 1
1.4 Arithmetic and Logical Operations. 1
1.5 Geometric Spatial Transformations and Image Registration. 1
1.6 Image File Formats. 1
1.7 Colour Fundamentals and Colour Models. 1

Module-2 (Image Transforms) (8 hours)
2.1 Basic concept of spatial domain and frequency domain. 1
2.2 Need of Image Transform, Basic properties of unitary transform. 1
2.3 Discrete Fourier transform, Proof DFT is Unitary. 1
2.4 4 order DFT Transform coefficients (Derivation). 1
2.5 Problems ( 4 order DFT). 1
2.6 Discrete Cosine Transform- 2D DCT. 1
2.7 4 order DCT Transform Coefficients(No derivation needed). 1
2.8 Hadamard Transform. 1
Module-3 (Image Enhancement in spatial and frequency domain) (8 hours)
Point operations- Clipping and Thresholding, Digital Negative. Intensity

3.1 1
Level Slicing.
3.2 Bit Extraction, Range Compression + (Work out problems). 1
3.3 Spatial Operations-Fundamentals of spatial convolution and correlation. 1
3.4 Spatial averaging and spatial Low pass filtering, Directional Smoothing. 1
3.5 Median Filtering, Unsharp masking and Crispening. 1
3.6 Basics of Filtering in Frequency Domain. 1
3.7 Smoothing Frequency Domain Filters : Ideal Low Pass Filter; Gaussian Low 1
Pass Filter; Butterworth Low Pass Filter;
3.8 Sharpening Frequency Domain Filters: Ideal High Pass Filter; Gaussian High 1
Pass Filter; Butterworth High Pass filter.
Module-4 (Image Restoration & Image Segmentation) ( 6 hours)
4.1 Image degradation model, Noise models. 1
4.2 Mean Filters – Order Statistic filter – Adaptive filters. 1
4.3 Edge Detection, Gradient operators, Laplace operators and zero crossings. 1
Thresholding- Basic Global Thresholding, Optimum global thresholding

4.4 using Otsu method. 1
4.5 Multiple thresholds, Variable thresholding, Multivariable thresholding. 1

4.6 Region-Based Approach to Segmentation. 1
Module-5 (Morphological Operations & Representation and Description) (7 hours)
5.1 Structuring Element. Dilation and Erosion, 1
5.2 Morphological Opening, Closing. 1
5.3 Hit or Miss Transformation. 1
5.4 Boundary Following. Chain Codes, Polygonal Approximation. 1
5.5 Boundary Descriptors. 1
5.6 Regional Descriptors. 1
5.7 Relational Descriptors. 1
YEAR OF
CST448 INTERNET OF THINGS
PEC 2 1 0 3 2019
Preamble: This course equips the learners with fundamental of the Internet of Things(IoT) and
the IoT ecosystem. It covers the architecture of IoT, communication mechanisms, protocols,
hardware, software, data analytics, and the cloud platforms for IoT. This course enables the
students to design smart IoT applications for real world problems using Raspberry Pi.
Prerequisite: Basic knowledge in Data Communication, Computer Networks and Programming

in Python
Outline the fundamentals of IoT and its underlying physical and logical architecture(Cognitive
CO1
Explain the hardware architectures for IoT (Cognitive Knowledge Level :

CO2 Understand)
Outline the Network architectures for IoT(Cognitive Knowledge Level :
CO3 Understand)
CO4 Implement data analytics on the IoT platforms (Cognitive Knowledge Level : Apply)
Appreciate the security considerations in IoT (Cognitive Knowledge Level :

CO5 Understand)
Implement IoT applications using the available hardware and software. (Cognitive
CO6 Knowledge Level : Apply)
CO1
CO2
CO3
CO4
CO5
CO6
complex problems
Assessment Pattern

Examination Marks
Remember 30 20 30
Understand 60 50 40
Apply 10 30 30
Analyze
Evaluate
Create
Mark Distribution
150 50 100 3 Hours
Attendance 10 marks


Syllabus
Module- 1 ( IoT Architecture)
What is IoT, Genesis of IoT, IoT and Digitization, IoT Impact, Convergence of IT and IoT, IoT
Challenges, IoT Network Architecture and Design, Drivers Behind New Network Architectures,
Comparing IoT Architectures, A Simplified IoT Architecture, The Core IoT Functional Stack,
IoT Data Management and Compute Stack.
Module- 2 (Engineering IoT Networks)
Smart Objects: The “Things” in IoT, Sensors, Actuators, and Smart Objects, Sensor Networks,
Connecting Smart Objects, Communications Criteria, IoT Access Technologies
Module- 3 (IoT Network Layer)
IP as the IoT Network Layer, The Business Case for IP, The need for Optimization, Optimizing
IP for IoT, Profiles and Compliances, Application Protocols for IoT, The Transport Layer, IoT
Application Transport Methods
Module 4 (Data Analytics for IoT)
Data and Analytics for IoT, An Introduction to Data Analytics for IoT, Machine Learning, Big
Data Analytics Tools and Technology, Edge Streaming Analytics, Network Analytics, Securing
IoT, A Brief History of OT Security, Common Challenges in OT Security, Differences between
IT and OT Security Practices and Systems, Formal Risk Analysis Structures: OCTAVE and
FAIR.
Module 5 ( Developing IoT Systems)
IoT Logical Design using Python, IoT Physical Devices and Endpoints - Raspberry Pi interfaces,
Programming Raspberry Pi using Python, Other IoT devices, IoT Physical devices and Cloud
offerings, Cloud Storage Models, WAMP - Autobahn for IoT, Django, Designing RESTful Web
API, Cloud Web Services for IoT.
Textbooks
1. David Hanes, Gonzalo Salgueiro, Patrick Grossetete, Robert Barton, Jerome Henry, "IoT
Fundamentals: Networking Technologies, Protocols, and Use Cases for the Internet of
Things”, 1st Edition, Pearson Education (Cisco Press Indian Reprint)
2. Arshadeep Bahga, Vijay Madisetti, “Internet of Things: A hands-on approach”, University

Press, 2015 (First edition)
References
1. Rajkamal, “Internet of Things: Architecture and Design Principles”, McGraw Hill (India)
Private Limited
2. Dieter Uckelmann, Mark Harrison, Michahelles Florian (Ed.), Architecting the internet of
things, Springer, 2011
3. Dr. Ovidiu Vermesan, Dr. Peter Friess, Internet of Things: Converging Technologies for
Smart Environments and Integrated Ecosystems, River Publishers, 2013
4. Simon Monk, “Programming Arduino: Getting Started with Sketches”, McGraw Hill
Publications

1. Write a short note on the impact of IoT in the real world
2. Explain the challenges of IoT.
3. Compare OT and IT Technology.
4. Describe the elements of one M2M architecture of IoT
1. Mention any four wireless technologies and its architectural characteristics
2. Comment things in IoT
3. Compare biosensors and biodegradable sensors used in IoT
4. Explain the term NBIoT(Narrow Band IoT)
1. Discuss the need for optimization
2. Compare MQTT and COAP
3. Explain different schedule management and packet forwarding models of 6TiSCH
1. Compare Bigdata and edge analytics
2. Compare structured and unstructured data
3. Describe the components of FNF

1. What are the major challenges in IoT security?
2. Explain the impact of OT Network Characteristics onIoT Security.
1. Implement LDR interfacing with Raspberry Pi
2. Explain the development of a RESTful web API.

QP CODE: PAGES :3
Reg No: _______________
Name: _________________
Course Code: CST448
Course Name: Internet of Things
Max.Marks : 100 Duration: 3 Hours

PART A
1. Explain the role of IoT in connected roadways,
2. Describe the functions of the various layers of simplified IoT Architecture Model.
3. Explain the communication protocols employed in Wireless Sensor Networks
4. What are the essential performance considerations of constrained-node networks?
5. Explain the parameters to be considered while choosing between IP adaptation /

adoption for last mile communication.
6. With neat diagrams compare the IoT protocol stacks using 6LoWPAN and IP.
7. Differentiate the types of IoT data analytics results.

8. How can the insecure operational protocols be characterized?
9. Write a program to interface an LED and a switch with Raspberry Pi
10. List down the Raspberry Pi interfaces and explain. (10x3=30)
Part B
11. (a) Illustrate the impact of IoT in at least 2 domains of normal human life. (9)
(b) Describe the Application and Analytics sublayer of IoT Architecture (6)
OR
12. (a)
Describe the Standardized IoT architectures.
(8)
(b) Explain the functions of Access Network Sublayer of IoT Architecture (6)
13. (a)
Describe the LoRaWAN technology as an IoT communication paradigm.
(10)
(b) (4)
Describe various types of sensors.
OR
14. (a) Define actuators. Describe the roles of actuators in IoT systems. (6)
(b) Explain the IEEE 802.15.4 standard for wireless communication. (8)
15. (a) Explain Message Queuing Telemetry Transport framework and message (8)
format.
(b) Explain tunneling of legacy SCADA over IP Networks with a neat diagram. (6)
OR
16. (a) Explain SCADA Transport over LLNs with MAP-T.

(7)
(b) Explain RPL encryption and authentication on constrained nodes. (7)

17. (a) Explain the Hadoop ecosystem with a neat diagram. (7)
(b) Explain the Flexible NetFlow Architecture. (7)
OR
18. (a) Explain the “The Purdue Model for Control Hierarchy” and OT network (8)
characteristics.
(b) Explain any twp formal risk analysis structures (6)
19. (a) (8)

Explain the working of WAMP protocol.
(b) Describehow AWS supports IoT development (6)
OR
20. (a) Demonstrate an example of Raspberry Pi applications for Industrial IoT. (8)
(b) Explain the Django Architecture (6 )
TEACHING PLAN
No Contents No of
Lecture
Hrs (35
Hrs)
Module – 1 ( IoT Architecture) (6 hrs) (TB-1, Chapter 1,2)
1.1 What is IoT, Genesis of IoT, IoT and Digitization, 1
1.2 IoT Impact, Convergence of IT and IoT, IoT Challenges 1
1.3 IoT Network Architecture and Design 1
1.4 Drivers Behind New Network Architectures, Comparing IoT Architectures 1
1.5 A Simplified IoT Architecture, 1

1.6 The Core IoT Functional Stack, IoT Data Management and Compute Stack. 1
Module- 2 (Engineering IoT Networks) (7hrs)(TB-1, Chapter 3,4)
2.1 Smart Objects: The “Things” in IoT, 1
2.2 Sensors, Actuators, and Smart Objects 1
2.3 Sensor Networks 1
2.4 Connecting Smart Objects 1
2.5 IoT Access Technologies –IEEE 802.15.4 (g/e), 1901.2a 1
2.6 IoT Access Technologies - 802.11ah, LoRaWAN 1
2.7 IoT Access Technologies – LoRaWAN, NBIoT, LTE 1
Module- 3 (IoT Network Layer) (7 hrs)(TB-1, Chapter 5,6)
3.1 IP as the IoT Network Layer, The Business Case for IP 1
3.2 The need for Optimizing IP for IoT 1
3.3 Optimizing IP for IoT, Profiles, and Compliance 1
3.4 Application Protocols for IoT - CoAP 1
3.5 Application Protocols for IoT - MQTT 1
3.6 The Transport Layer, IoT Application Transport Methods 1
3.7 The Transport Layer, IoT Application Transport Methods 1
Module 4 ( Data Analytics for IoT) (6hrs)(TB-1, Chapter 7,8)
4.1 An Introduction to Data Analytics for IoT, Machine Learning 1
4.2 Big Data Analytics Tools and Technology 1
4.3 Edge Streaming Analytics, Network Analytics 1

4.4 A Brief History of OT Security, Common Challenges in OT Security 1
4.5 Differences between IT and OT Security Practices and Systems 1
4.6 Formal Risk Analysis Structures: OCTAVE and FAIR 1
Module 5 ( Developing IoT Systems)(9 hrs) (TB-2, Chapter 6,7,8)
5.1 IoT Logical Design using Python, 1
5.2 IoT Physical Devices and Endpoints 1
5.3 Raspberry Pi interfaces, Programming Raspberry Pi using Python 1
5.4 Other IoT devices 1
5.5 Cloud Storage Models 1
5.6 WAMP-Autobahn for IoT 1
5.7 Django 1
5.8 Designing RESTful Web API 1
5.9 Cloud Web Services for IoT. 1

YEAR OF
CST458 SOFTWARE TESTING
PEC 2 1 0 3 2019
Preamble: This is a course in theoretical computer science that introduces the concepts and
methods in software testing. It covers various techniques for test case design used to test software
artifacts, including requirements, design, and code, the different techniques for test case design
based on graphs, programming language syntaxes and symbolic execution using PEX tool. It
enables the learners to follow a systematic software testing approaches while developing
applications.
Prerequisite: Nil
Course Outcomes: After the completion of the course the student will be able to:-
List a range of different software testing techniques and be able to apply specific unit
CO1 testing method to the projects using Junit.(Cognitive Knowledge Level:
Understand)
Illustrate using appropriate tools the mutation testing method for a given piece of code
CO2 to identify hidden defects that can’t be detected using other testing
methods.(Cognitive Knowledge Level: Apply)
CO3 Explain graph coverage criteria in terms of control flow graph and data flow graph
for a given program.(Cognitive Knowledge Level: Understand)
CO4 Demonstrate the importance of black-box approaches in terms of domain and

functional testing.(Cognitive Knowledge Level: Apply)
CO5 Illustrate the use of PEX tool with symbolic execution.(Cognitive Knowledge Level:
Apply)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO 9 PO10 PO11 PO12
CO1
CO2
CO3
CO4
CO5
Assessment Pattern

Marks
Remember 30 30 30
Understand 40 40 40
Apply 30 30 30
Analyze
Evaluate
Create
Mark Distribution
Total CIE ESE ESE

150 50 100 3 hours

Attendance 10 marks


Syllabus
Module - 1 (Introduction to Software Testing)
Some Popular Errors – Ariane 5, Therac 25, Intel Pentium Bug. What is Software testing? Why should it
be tested? Software Quality, Role of Testing. Testing Process - Level 0 thinking, Level 1 thinking, Level 2
thinking, Level 3 thinking, Level 4 thinking. Software Testing Terminologies - Verification, Validation
and Testing, Faults, Error and Bug, Test cases, Coverage Criteria. Types of Testing- Unit testing,
integration testing, System testing, Acceptance testing, Beta testing, Functional testing, Stress testing,
Performance testing, Usability testing and Regression testing. Testing Methods - Black Box testing, White
Box testing, Grey Box testing.
Module - 2 (Unit Testing)

Concept of Unit testing. Static Unit testing. Dynamic Unit testing - Control Flow testing, Data Flow
testing, Domain testing, Functional Program testing. Mutation testing - Mutation and Mutants, Mutation
operators, Mutation score. Junit - Framework for Unit testing. Case Study - Mutation testing using Junit
and Muclipse.
Module - 3 (Unit Testing - White Box Approaches)
Overview of Graph Coverage Criteria. Structural Graph Coverage Criteria - Node/vertex coverage, Edge
coverage, Edge pair coverage, Path coverage, Complete path coverage, Prime path coverage, Complete
round trip coverage, Simple round trip coverage. Data Flow Criteria - du paths, du pairs. Subsumption
Relationships among Graph Coverage Criteria. Graph Coverage for Source Code - Control flow graphs for
code, CFG: If statement, CFG: If statement with return, CFG: Switch-case, CFG: Loops, CFG: Exceptions
(try-catch). Example program – Statistics. Graph Coverage for Design Elements - Call graphs and classes,
Class inheritance testing: Coverage criteria, Coverage criteria on inheritance graph, Data flow at the design
level, Inter-procedural DU pairs, Coupling du-pairs example. Example - Quadratic Root. Case Study -
Graph Based testing using JUnit Framework.
Module - 4 (Unit Testing - Black Box Approaches)

Domain Testing / Input Space Partitioning - Partitions of a set. Input domain modelling - Interface-based
approach, Functionality-based approach. Identifying values. Multiple partitions of the input domain - All
Combinations Coverage (ACoC), Each Choice Coverage (ECC), Pair-wise Coverage, T-wise Coverage,
Base Choice Coverage, Multiple Base Choices Coverage. TriTyp example. Functional Testing - Functional
Testing Concepts of Howden. Functional testing - Important Steps. Types of Functional testing -
Equivalence Class Partitioning, Boundary Value Analysis, Decision Tables, Random Testing. Case Study -
Black Box testing approaches using JUnit.
Module - 5 (Grey Box Testing Approaches)

Introduction to Grey Box testing - Why Grey Box testing, Gray Box Methodology, Advantages and
Disadvantages. Techniques of Grey Box Testing - Matrix Testing, Regression Testing, Orthogonal Array
Testing or OAT, Pattern Testing. An Introduction to PEX - Parameterized Unit Testing, The Testing
Problem. Symbolic Execution – Example, Symbolic execution tree. PEX application Case Study – PEX.
Text Books
1. Paul Ammann and JeffOffutt , Introduction to Software Testing, Cambridge University Press
2. Kshirasagar Naik and Priyadarshi Tripathy, Software Testing And Quality Assurance: Theory And
Practice, Wiley.
Reference Materials
1. King, James C, “Symbolic Execution and Program Testing”, Association for Computing Machinery,
July 1976.

Explain the following types of testing methods with examples.
(i) Balck-box testing.
(ii) White-box testing.
(iii) Grey-box testing.
Define 12 mutants for the following method power() using effective mutation operators. Try to use each
mutation operator at least once. Approximately, how many mutants do you think there would be, if all
mutants for power() were created?
public static int power (int left, int right)

{
//**************************************
// Raises Left to the power of Right
// precondition : Right >= 0
// postcondition: Returns Left**Right
//**************************************
intrslt;
rslt = Left;
if (Right == 0)
{
rslt = 1;
}
else
{
for (int i = 2; i <= Right; i++)
rslt = rslt * Left;
}
return (rslt);
}
Draw the control flow graph and data flow graph of given piece of code.
public static double ReturnAverage(int value[],int AS, int MIN, int MAX){
/*
Function: ReturnAverageComputes the averageof all those numbers in the input array in
the positive range [MIN, MAX]. The maximum size of the array is AS. But, the array size
could be smaller than AS in which case the end of input is represented by -999.
*/
int i, ti, tv, sum;
doubleav;
i = 0; ti = 0; tv = 0; sum = 0;
while (ti< AS && value[i] != -999) {
ti++;
if (value[i] >= MIN && value[i] <= MAX) {
tv++;
sum = sum + value[i];
}
i++;
}
if (tv> 0)
av = (double)sum/tv;
else
av = (double) -999;
return (av);
}
Explain the following with examples.
1. Input domain modelling.
2. All Combinations Coverage (ACoC)
3. Each Choice Coverage (ECC)
4. Pair-wise Coverage
5. T-wise Coverage
6. Base Choice Coverage
7. Multiple Base Choices Coverage.
Draw the symbolic execution tree for the following program code and explain the symbolic
execution of testme (α1, α2).
int twice (int v) {
return 2 ∗ v;
}
void testme (int x, int y ) {
z = twice ( y);
if ( z == x ){
if ( x > y + 10)
ERROR;
}
}
int main() {
x = sym input();
y = sym input();
testme ( x , y);
return(0);
QP CODE: PAGES: 3
Reg No: Name :
Course Code: CST458
Course Name: Software Testing
PART A
1. Explain the differences between Validation and Verification?
2. Explain the differences between Fault, Error, and Bug?
3. Define Ground string, Mutation score, and Mutants?
4. What are the functions of Test driver and Test stubs in dynamic unit testing?
5. Define Node coverage, Edge coverage and Prime path coverage in a control flow
graph?
6. What are du paths and du pairs in a data flow graph?
7. Explain the two approaches in input domain modelling?
8. Explain the difference between Equivalence Class Partitioning and Boundary

Value Analysis?
9. Briefly explain three techniques of Grey box testing?
10. Explain the concept of symbolic execution with the help of a toy example?
(10x3=30)
Part B
11. (a) Explain the following types of testing

(i) Black Box testing (ii) White Box testing (iii) GreyBox testing (14)
(iv) Unit testing (v) Integration testing (vi) System testing (vii) Acceptance
testing
OR
12. (a) Explain the following coverage criterias based on the code fragment given
below? (i) Functional coverage (ii) Statement coverage (iii)Conditional (8)
coverage (iv)Branch coverage
int foo (int x, int y){
int z = 0;
if ((x > 0) && (y > 0)){
z = x;}
return z;
}
(b) Write positive and negative test cases for an ATM Machine? (6)
13. (a) Explain Dynamic unit test environment with a neat figure.
(8)
(b) Explain the major difference between control flow testing and data flow
testing. (6)
OR
14. (a) Explain seven types of mutation operators with neat examples? (14)
15. (a) Explain touring, side trips and detours with a neat example (7)
(b) Explain simple path coverage and prime path coverage with the help of CFG (7)
given below? 1
2 3
OR
16. (a) Draw CFG fragment for

(7)
(i) Simple if (ii) Simple while loop (iii) Simple for loop
(b) Explain the following concepts with examples? (7)

(i)Call graph (ii) Inheritance graph (iii) Coupling du-pairs
17. (a) What are the four important steps in functional testing? (7)
(b) Briefly explain input domain modelling approaches? (7)
OR
18. (a) Consider the triangle classification program with a specification: (6)
The program reads floating values from the standard input. The three values
A, B, and C are interpreted as representing the lengths of the sides of
triangle. The program then prints a message to the standard output that states
whether the triangle, if it can be formed, is scalene, isosceles, equilateral,
orright angled. Determine the following for the above program:
(i) For the boundary condition A +B > C case (scalene triangle),
(ii) For the boundary condition A = C case (isosceles triangle), identify
testcases to verify the boundary.
(iii) For the boundary condition A = B = C case (equilateral triangle),
identify testcases to verify the boundary.
(b) Develop a decision table to generate test cases for this specification. (8)
19. (a) Explain the importance of grey box testing, its advantages and disadvantages? (9)
(b) Explain the concept of symbolic execution tree? (5)
OR
20. (a) Consider the code fragment given below: - (7)
1. POWER: PROCEDURE(X, Y);

2. Z ← 1;
3. J ← 1;
4. LAB: IF Y ≥ J THEN
5. DO; Z← Z * X;
6. J ← J + 1;
7. GO TO LAB; END;
8. RETURN (Z) ;
9. END;
a) Explain Symbolic execution of POWER (αl, α2).
(b) Explain Execution tree for POWER (αl, α2). (7 )
TEACHING PLAN
No Contents No of
Lecture Hrs
(35 hrs)
Module 1 (Introduction to Software Testing) -(7 Hours)
1.1 Some Popular Errors– Ariane 5, Therac 25, Intel Pentium Bug. 1 Hour
What is Software testing? Why should it be tested? Software Quality,

1.2 Role of Testing. 1 Hour
Testing Process - Level 0 thinking, Level 1 thinking, Level 2 thinking,

1.3 Level 3 thinking, Level 4 thinking. 1 Hour
Software Testing Terminologies- Verification, Validation and Testing,

1.4 Faults, Error and Bug, Test cases, Coverage Criteria. 1 Hour
Types of Testing- Unit testing, integration testing, System testing,

1.5 Acceptance testing, Beta testing 1 Hour
Functional testing, Stress testing, Performance testing, Usability testing

1.6 and Regression testing. 1 Hour
Testing Methods - Black Box testing, White Box testing, Grey Box
1.7 testing. 1 Hour
Module 2 (Unit testing)- (6 Hours)
2.1 Concept of Unit testing, Static Unit Testing 1 Hour

Dynamic Unit testing - Control Flow testing, Data Flow testing, Domain
2.2 testing, Functional Program testing. 1 Hour
Mutation testing - Mutation and Mutants, Mutation operators, Mutation

2.3 score. 1 Hour
2.4 Junit - Framework for Unit testing. 1 Hour
2.5 Case Study - Mutation testing using Junit 1 Hour
2.6 Case Study - Mutation testing using Muclipse 1 Hour
Module 3 (Unit Testing:- White Box Approaches)- (8 Hours)
Structural Graph Coverage Criteria - Node/vertex coverage, Edge

3.1 coverage, Edge pair coverage, Path coverage 1 Hour
Complete path coverage, Prime path coverage, Complete round trip

3.2 coverage, Simple round trip coverage. 1 Hour
3.3 Data Flow Criteria - du paths, du pairs 1 Hour
3.4 Subsumption Relationships among Graph Coverage Criteria 1 Hour
Graph Coverage for Source Code – Control Flow Graphs (CFG) for code,
3.5 CFG: If statement, CFG: If statement with return, CFG: Switch-case, 1 Hour
CFG: Loops, CFG: Exceptions (try-catch). Example program - Statistics
Graph Coverage for Design Elements – Structural graph coverage and
3.6 data flow graph coverage for design elements 1 Hour
Module 4 (Unit Testing:- Black Box Approaches) -(7 Hours)
4.1 Domain Testing / Input Space Partitioning - Partitions of a set. 1 Hour
Input domain modelling - Interface-based approach, Functionality-based

4.2 approach. 1 Hour
Multiple partitions of the input domain - All Combinations Coverage

4.3 (ACoC), Each Choice Coverage (ECC), Pair-wise Coverage, T-wise 1 Hour
Coverage, Base Choice Coverage, Multiple Base Choices Coverage.
Functional Testing - Functional Testing Concepts of Howden.
4.4 Important Steps. 1 Hour
Types of Functional testing - Equivalence Class Partitioning, Boundary

4.5 Value Analysis 1 Hour
4.6 Decision Tables, Random Testing. 1 Hour
4.7 Case Study - Black Box testing approaches using JUnit. 1 Hour
Module 5 (Grey Box Testing Approaches)- (7 Hours)
Introduction to Grey Box testing - Why Grey Box testing, Gray Box
5.1 Methodology, Advantages and Disadvantages. 1 Hour
Techniques of Grey Box Testing - Matrix Testing, Regression Testing,

5.2 Orthogonal Array Testing or OAT, Pattern Testing. 1 Hour
An Introduction to Pex - Parameterized Unit Testing, The Testing

5.3 Problem. 1 Hour
5.4 Symbolic Execution – Example, Symbolic execution tree. 1 Hour

YEAR OF
CST468 BIOINFORMATICS INTRODUCTION
PEC 2 1 0 3 2019
Preamble: This course helps the learners to understand the fundamental concepts in Molecular
Biology, Genomics, Proteomics and Modelling. This course introduces bio macromolecules such
as genes and proteins, different biological databases, and tools and algorithms for biological data
processing, analysis and interpretation, and the elements of the systems approach to Molecular
Biology. This course enables the learners to contribute towards drug discovery and
computational analysis and modelling of biological process.
Prerequisite: Basic background in higher secondary biology
CO 1 Describe the basic concepts of Bioinformatics with an emphasis on structure, function

and synthesis of biomolecules (Cognitive knowledge level : Understand)
CO 2 Identify biological data formats and databases, retrieve bio-sequences, and align bio-
sequences to identify similarity (Cognitive knowledge level : Apply)
CO 3 Employ similarity searching tools and algorithms to align sequences to highlight the
similarity, and describe the structure of genes (Cognitive knowledge level : Apply)
CO 4 Demonstrate Protein Structure, visualize protein structure using tools, and explain how
proteins interact (Cognitive knowledge level : Apply)
CO 5 Explain the fundamental aspects of Systems Biology, Computational Modeling and

properties of models (Cognitive knowledge level : Understand)
CO1
CO2
CO3
CO4
CO5


Assessment Pattern

Test1 (%) Test2 (%) Examination
Remember 30 30 30
Understand 50 50 50
Apply 20 20 20
Analyse
Evaluate
Create
Mark Distribution

150 50 100 3
Attendance 10 marks
Continuous Assessment Tests (Average of Series Tests 1& 2) 25 marks


Syllabus
Module-1 (Introduction to bioinformatics)
Introduction to bioinformatics, Nature & Scope of Bioinformatics, DNA, RNA, and Protein: The
Central Dogma, Messenger RNA, tRNA, rRNA, Genetic code, Gene Structure and Control,
Transcription, translation
Module-2 (Introduction to bio sequences and analysis)
Introduction to Biological Databases, NCBI, Genbank, Bio sequence formats- FASTA, Sequence
alignment- Global Alignment and Local Alignment, Dot Matrix Method, Dynamic Programming
Method, Gap Penalties, Amino Acid Scoring Matrices - PAM and BLOSUM
Module-3 (Database Similarity Searching and genomics)
Database Similarity Searching, BLAST – Variants -BLASTN, BLASTP, BLASTX, Statistical

Significance, Needleman and Wunsch and Smith–Waterman Method, Multiple Sequence
Alignment, scoring function, Clustal, introduction to structure of prokaryotic and eukaryote
gene
Module-4 (Proteomics)
Protein Structure, Ramachandran Plot, Hierarchies of Protein Structure, Determination of Protein

three-dimensional structure, protein structure database-PDB, Protein structure visualization,
introduction to Protein protein interaction, STRING database
Module-5 (Systems Biology)
Introduction to Systems Biology, Models and Modelling, Properties of models, Systems state
and steady state, Variables, Parameters, and Constants in modelling, Purpose and Adequateness
of Models, Advantages of Computational Modelling, Model Development, Network Versus
Elements, Modularity, Robustness and Sensitivity, Data Integration
Text books
1. Zvelebil, Marketa J., and Jeremy O. Baum. Understanding bioinformatics. Garland Science,
2007.
2. Xiong, Jin. Essential bioinformatics. Cambridge University Press, 2006.
3. Klipp, E., Herwig, R., Kowald, A., Wierling, C., &Lehrach, H. Systems biology in practice:
concepts, implementation and application. John Wiley & Sons. 2005
References
1. Baxevanis, Andreas D., Gary D. Bader, and David S. Wishart, eds. Bioinformatics. John
Wiley & Sons, 2020.
2. Shaik, Noor Ahmad, et al. Essentials of Bioinformatics, Volume I. Springer, 2019
3. Selzer, Paul M., Richard J. Marhöfer, and Andreas Rohwer, Applied bioinformatics. An
introduction–Springer, Verlag,, 2008.
4. S C Rastogi, N Mendiratta and PRastogi, Bioinformatics: Methods and Applications , PHI
Learning Private Limited, New Delhi, 2015.
5. D E Krane and M L Raymer, Fundamental Concepts of Bioinformatics, Pearson Education,
2006.
6. Andreas D.Baxevanis, B F Francis Ouellette, Bioinformatics - A Practical Guide to the
Analysis of Genes and Proteins, Third Edition, John Wiley & Sons INC. , U.K. 2006
7. Neil C Jones and Pavel A Pevzner, An Introduction to Bioinformatics Algorithms, MIT press,
2004.

1. Compare and contrast the DNA and RNA on the basis of structure and functions.
2. Demonstrate with the help of a flow diagram the generation of protein using the
transcription and translation process.
1. Download DNA sequence of human insulin form NCBI
2. Identify the following qualifiers for GenBank and give their definitions: [ACCN],
[ALL], [AUTH], [ECNO], [FKEY], [GENE], [JOUR], [KYWD]
3. Construct a dot plot and find the sequence alignment between the following two
sequences:
Sequence1: GATTCTATCTAACTA, Sequence2: GTTCTATTCTAAC
1. Apply Needleman-Wunsch Algorithm to perform sequence alignment for the following
sequences: CGTGAATTCAT (sequence #1), GACTTAC (sequence #2)
2. Construct a BLAST procedure for sequence alignment(HSP) if a sequence and its
corresponding database sequence are given. Assume the necessary data and demonstrate
the procedure.
1. Differentiate between the different protein molecular structure visualizations. Also
mention the advantages and uses of each visualization technique.
2. Make use of an example and demonstrate the steps in protein comparison. Show how
root mean square deviationis calculated while comparing two proteins.
1. Explain how systems biology is used in data integration.
.
2. Explain the process of model development

QP CODE:
Reg No: _______________
Name: _________________ PAGES : 3

Course Code: CST468
Course Name: Bioinformatics
PART A
1. Differentiate DNA, Gene, genome and chromosome.
2. What are the functions of mRNA, tRNA and rRNA?
3. What do you mean by Gene expression?
4. Write difference between local and global alignment.
5. Write short note on Gap penalties and its usage in comparing Biological
sequences.
6. List any three typesof BLAST and make short description on each.
7. What are the principle underlying the formation of Ramachandran plot?.
8. What are the experimental methods for determining protein structure?
9. What do you mean by steady state in a biological system.
10. Justify the statement - systems are modular. (10x3=30)

Part B
11. (a) What is the central dogma of molecular biology? (6)
(b) Explain the steps involved in the process of transcription. How is the primary (8)
transcript produced by a prokaryote different from that produced by a
eukaryotic cell?
OR
12. (a) Discuss translation process in protein synthesis. (6)
(b) Explain bio-molecules involved in central dogma, its structure and types. (8)
13. (a) Explain the importance of Primary and secondary databases in (6)
Bioinformatics
(b) Illustrate the methods of pairwise sequence alignment. What is the use of (8)
assigning gap penalties in alignment?
OR
14. (a) Illustrate sequence alignment. What are the applications of sequence (7)
alignment in Bioinformatics?
(b) What is the use of scoring matrices? Differentiate between PAM and (7)
BLOSUM matrices and its usage in alignment.
15. (a) Using Needleman and Wunsch dynamic programming method, construct the (9)
partial alignment score table for the following two sequences, using the
scoring parameters: match score: +5, mismatch score: -1, gap penalty: -2.
CCATGCU
GATTACA
Also write down the optimal global alignment between these sequences along
with the optimal score.
(b) Interpret the blast result and statistical significance of the alignment by (5)
analyzing the results.
OR
16. (a) Using Smith Waterman method construct the partial alignment scoring table (9)
and obtain the optimal local alignment of the following two sequences:
ACGTATCGCGTATA
GATGCTCTCGGAJAA
(b) Illustrate multiple sequence alignment. (5)
17. (a) Discuss hierarchies of protein structure. (6)
(b) Explain how the protein structure is determined by using experimental (8)
techniques.
OR
18. (a) Discuss protein interaction. How it contributes to the complexity of an (9)
organism?
(b) Discuss on Protein Structure Database. (5)

19. (a) Discuss systems biology approach of understanding complex biological (6)
systems.
(b) Explain on Variables, Parameters, and Constants in modeling biological (8)
systems.
OR
20. (a) Explain on advantages of Computational Modeling of biological system. (7)
(b) What are the properties of models in biological system? (7 )
TEACHING PLAN
No Contents No of Lecture
(36 Hrs)
Module-1 (Introduction to bioinformatics)(8 hrs)
Text 1 (Relevant topics from chapter 1.1, 1.2, 1.3)
1.1 Introduction to bioinformatics 1
1.2 Nature & Scope of Bioinformatics 1
1.3 DNA, RNA, and Protein 1
1.4 The Central Dogma introduction 1
1.5 Messenger RNA, tRNA, rRNA, 1
1.6 Genetic code, 1
1.7 Gene Structure and Control 1
1.8 Transcription, Translation 1
Module-2 (Introduction to bio sequences and analysis) (7 hrs)

Text 2 (Relevant topics from chapter 2, 3)
2.1 Introduction to Biological Databases 1
2.2 NCBI Sequence retrieval 1
2.3 Genbank, Bio sequence formats- FASTA 1
2.4 Sequence alignment- Global Alignment and Local Alignment 1
2.5 Dot Matrix Method, Dynamic Programming Method 1

2.6 Gap Penalties 1
2.7 Amino Acid Scoring Matrices – PAM, BLOSUM 1
Module-3 (Database Similarity Searching and genomics) (7 hrs)

Text 2 (Relevant topics from chapter 4 5 and 8)
3.1 Database Similarity Searching, BLAST, Variants of BLAST - 1

BLASTN, BLASTP, BLASTX
3.2 BLAST Analysis - Statistical Significance 1
3.3 Needleman and Wunsch Method 1
3.4 Smith–Waterman Method 1
3.5 Multiple Sequence Alignment, scoring function 1
3.6 Clustal tool 1
3.7 Gene Structure of prokaryotic, eukaryote 1
Module-4 (Proteomics) (7 hrs)

Text 2 (Relevant topics from chapter 12, 13 and 19)
4.1 Protein Structure, Ramachandran Plot 1
4.2 Hierarchies of Protein Structure 1
4.3 Determination of Protein three-dimensional structure 1
4.4 protein structure database-PDB 1
4.5 Protein structure visualization 1
4.6 Protein protein interaction 1
4.7 Protein protein interaction networks, STRING database 1
Module-5 (Systems Biology) (7 hrs)
Text 3 (Relevant topics from Section 1.1-1.4)
5.1 Introduction to Systems Biology, Properties of models 1

5.2 Systems state and steady state 1
5.3 Variables, Parameters, and Constants in modelling 1
5.4 Purpose and Adequateness of Models 1
5.5 Advantages of Computational Modelling ,Model Development 1
(introduction only)
5.6 Network Versus Elements, Modularity, 1
5.7 Robustness and Sensitivity, Data Integration 1

YEAR OF
COMPUTATIONAL CATEGORY L T P CREDIT INTRODUCTION
CST478 LINGUISTICS
PEC 2 1 0 3 2019
Preamble: The course aims to teach the basics of Computational Linguistics to the students
viewing language phenomena from a computational/statistical standpoint. This involves ideas about
statstical and computational models and how these could be linked with various language
processing tasks. The course helps the learner to appreciate the complexities involved in language
processing tasks using a machine, in contrast with the ease with which human beings handle them.
Some practical aspects are also discussed using the Python and NLTK framework to equip the
student with the capability to design solutions to linguistic problems.
Prerequisite: Nil
CO# CO
Explain the fundamental concepts of language processing (Cognitive

CO1 Knowledge Level: Understand)
CO2 Demonstrate the concepts of probability, statistical inference and hidden

Markov model. (Cognitive Knowledge Level: Apply)
Compare and summarize the various methods of word sense disambiguation,

lexical acquisition and selectional preferences. (Cognitive Knowledge
CO3
Level: Apply)
Make use of different Part-of-Speech Tagging methods for language

CO4 modelling. (Cognitive Knowledge Level: Apply)
Examine Probabilistic Context Free Grammars and various probabilistic

CO5 parsing methods (Cognitive Knowledge Level: Apply)
Develop simple systems for linguistic tasks using Python and NLTK.
CO6
CO1
CO2
CO3
CO4
CO5
CO6

Accreditation
PO# Broad PO# Broad
PO PO

solutions
Assessment Pattern
Category Marks (%)
Test 1 Test 2
(%) (%)
Remember 30 30 30
Understand 30 30 30
Apply 40 40 40
Analyze
Evaluate
Create
Mark Distribution
Total CIE ESE Marks ESE

Marks Marks Duration
150 50 100 3Hrs

Attendance 10 marks

Syllabus
Module- 1 (Preliminaries)
Introduction: Rationalist and Empiricist Approaches to Language-Questions that linguistics
should answer-Noncategorical phenomena in language-Language and cognition as
probabilistic phenomena
The Ambiguity of Language: Why natural language processing is difficult-Lexical resources-
Word counts-Zipf’s laws-Collocations-Concordances
Linguistic Essentials:
Parts of Speech and Morphology -Nouns and pronouns-Words that accompany nouns:
Determiners and adjectives-Verbs-Other parts of speech-Phrase Structure-Phrase structure
grammars -Semantics and Pragmatics-Corpus Based Work
Module -2 (Mathematical Essentials:)

Probability Theory-Probability spaces-Conditional probability and independence-Bayes'
theorem-Random variables-Expectation and variance-Notation-Joint and conditional
distributions-Standard distributions-Bayesian statistics
Statistical Inference: n-gram Models over Sparse Data-Bins: Forming Equivalence Classes-
Reliability vs discrimination-n gram models
Markov Models-Hidden Markov Models-Why use HMMs?-General form of an HMM-
Finding the probability of an observation-Finding the best state sequence
Module -3 (Word Sense Disambiguation)

Methodological Preliminaries- Supervised and unsupervised learning-Pseudowords-Upper
and lower bounds on performance-Supervised Disambiguation-Bayesian classification-
Dictionary based Disambiguation-Disambiguation based on sense definitions-Thesaurus
based disambiguation
Lexical Acquisition-Evaluation Measures-Verb Subcategorization -Attachment
Ambiguity-PP attachment- Selectional Preferences
Semantic Similarity: Vector space measures-Probabilistic measures
Module -4 (Grammar)
Part-of-Speech Tagging-The Information Sources in Tagging-Markov Model Taggers-
Hidden Markov Model Taggers-Applying HMMs to POS tagging-The effect of initialization
on HMM training-Transformation Based Learning of Tags
Probabilistic Context Free Grammars-Some Features of PCFGs-Questions for PCFGs -The

Probability of a String -Using inside probabilities-Using outside probabilities-Finding the
most likely parse for a sentence-parsing for disambiguation-parsing model versus language
model
Module -5 (Language Processing with Python)

Introduction to NLTK, Text Wrangling and Text cleansing : Sentence Splitter, Tokenization,
Stemming, Lemmatization, Stop word removal , Rare word Removal, Spell Correction. Part
of Speech Tagging and NER. Parsing Structure in Text: Shallow versus deep parsing,
different types of parsers and dependency parsing.
Text Books :
1. C.D. Manning and H. Schutze. Foundations of Statistical Natural Language
Processing. MIT Press.
2. Steven Bird, ‎Ewan Klein, ‎Edward Loper, Natural Language Processing with Python and
NLTK. O’reilly Pub.
References:
1. D. Jurafsky and J.H. Martin: Speech and Language Processing: Introduction to Natural
Language Processing, Computational Linguistics and Speech Recognition, PHI.
2. James Allen: Natural Language Understanding. Pearson Pub.
3. Nitin Hardeniya, Jacob Perkins, Deepti Chopra, Nisheeth Joshi, ItiMathur: Natural
Language Processing: Python and NLTK., 1stEdition. Packt Publishing

1. What do you understand by the term collocations? List their properties.
2. Define the term phrase structure grammar formally.
1. State Bayes’ theorem and explain briefly. Comment on it’s usefulness in NLP.
2. How can n-grams be used to model natural language statistically?
1. What is meant by attachment ambiguity? Show it using English sentences
2. What is meant by Word Sense Disambiguation (WSD)? Outline any one WSD
algorithm
1. How can HMM be used for Parts of speech tagging?
2. Outline an implementation procedure for HMM
1. Show with an example how can probabilistic grammars be used to model human
preferences in parsing.
2. Give the technique of Transformation-Based Learning of Tags
1. Implement a python program for stop word removal in a simple paragraph.
2. Write a code to access a weather site and extract the forecast top temperature for your
town or city today.
QP CODE:
Reg No: _______________
Name: _________________ PAGES : 3
Course Code: CST478
Course Name: Computational Linguistics
PART A
1. Define Zipf's law.
2. List the uses of a corpus in language processing?
3. What is a Hidden Markov Model?
4. State Bayes’ theorem and explain briefly. Comment on its usefulness in NLP.
5. What is meant by supervised disambiguation? What are its prerequisites ?
6. Consider the sentence: "the children ate the cake with a spoon". Construct the
parse tree for it and explain the attachment ambiguity.
7. Discuss the properties of Markov chain useful in POS tagging.
8. Explain the features of PCFG.
9. What is NLTK? How is it useful in text processing ?
10. Write a Python program to extract different date formats from a text document.
(10x3=30)
Part B
11. (a) Write a note on the following terms with example: (9)
(i) Collocations (ii) Concordances (iii) Phrase structure grammars
(b) Differentiate stemming and lemmatization with examples. (5)
OR
12. (a) Write a note on all parts of speech tags of English language (9)
(b) What are the differences between Rationalist and Empiricist to Language (5)
approaches
13. (a) What do you mean by a probability distribution? (5)

What are the approaches used in SNLP to estimate probability distribution of
linguistic events?
(b) Give a formal definition of Hidden Markov Model (HMM) and state the (9)
relevant assumption while using HMM for language modeling
OR
14. (a) Assume that a particular type of syntactic error detected by a system A occurs (5)
once in 1,00,000 sentences on an average. This system detects an error
correctly with a probability 0.05. Suppose the system reports an error in a test
sentence. What is the probability that this is true?
(b) List some of the problems associated with sparse data in SNLP. (9)
Write a note on n-gram Models over Sparse Data
15. (a) What do you understand by Disambiguation based on sense definitions. (9)
Write and explain any one algorithm for this.
(b) With the help of Bayes’ rule, explain the Bayesian disambiguation algorithm. (5)
OR
16. (a) Write a note on selectional preferences with an example (5)
(b) What is meant by attachment ambiguity? List different attachment issues. (9)
17. (a) Write a note on Transformation-Based Learning of tags. Give it’s algorithm (9)
(b) How can HMM be used for parts of speech tagging (5)
OR
18. (a) Write the formal definition of PCFG. (5)

Apply probabilistic parsing on the following sentence and find the
correct parsing using the given grammar
Sentence: Astronomers saw stars with ears.
Probabilistic grammar:
(b) How do you find the probability of a string using inside and outside (9)
probabilities ?
19. (a) Write a Python program for PoS tagging using the necessary Python (9)
packages.
(b) Explain the process of Named Entity Recognition. (5)

List its uses and challenges involved.
OR
20. (a) Write a regular expression for removing punctuations, numbers and white (9)
spaces in a piece of text.
(b) Write a Python program to count the number of sentences, words and line (5)
numbers in a given piece of text. Display each sentence along with that.
TEACHING PLAN
No Contents No of
Lecture Hrs
(36 hrs)
Module - 1 (Preliminaries) (9 hrs)
1.1 Introduction: Rationalist and Empiricist Approaches to Language- 1

Questions that linguistics should answer-
1.2 Non-categorical phenomena in language-Language and cognition as 1
probabilistic phenomena
1.3 The Ambiguity of Language: Why natural language processing is 1
difficult
1.4 Lexical resources-Word counts 1
1.5 Zipf’s laws-Collocations-Concordances 1
1.6 Linguistic Essentials: Parts of Speech and Morphology -Nouns and 1
pronouns
1.7 Words that accompany nouns: Determiners and adjectives-Verbs-Other 1
parts of speech
1.8 Phrase Structure-Phrase structure grammars 1
1.9 Semantics and Pragmatics-Corpus Based Work 1
Module – 2 (Mathematical Essentials) (7 hrs)
2.1 Probability Theory-Probability spaces 1
2.2 Conditional probability and independence-Bayes' theorem 1
2.3 Random variables-Expectation and variance-Notation 1
2.4 Joint and conditional distributions-Standard distributions- 1
Bayesian statistics
2.5 Statistical Inference: n-gram Models over Sparse Data-Bins: Forming 1
Equivalence Classes
2.6 Markov Models-Hidden Markov Models: Why use HMMs? 1
2.7 General form of an HMM-Finding the probability of an observation- 1
Finding the best state sequence
Module – 3 (Word Sense Disambiguation) (7 hrs)
3.1 Methodological Preliminaries-Supervised and unsupervised learning 1
3.2 Upper and lower bounds on performance-Supervised Disambiguation 1
3.3 Bayesian classification-Dictionary based Disambiguation- 1
3.4 Disambiguation based on sense definitions-Thesaurus based 1
disambiguation
3.5 Lexical Acquisition-Evaluation Measures 1
3.6 Verb Subcategorization-Attachment Ambiguity, PP attachment- 1

Selectional Preferences
3.7 Semantic Similarity:Vector space measures-Probabilistic measures 1
Module – 4 (Grammar) (8 hrs)

4.1 Part-of-Speech Tagging-The Information Sources in Tagging 1
4.2 Markov Model Taggers-Hidden Markov Model Taggers- 1
4.3 Applying HMMs to POS tagging-The effect of initialization on 1
HMM training-
4.4 Transformation-Based Learning of Tags 1
4.5 Probabilistic Context Free Grammars-Some Features of PCFGs 1
4.6 Questions for PCFGs 1
4.7 The Probability of a String -Using inside probabilities 1
Using outside probabilities
4.8 Finding the most likely parse for a sentence-parsing for 1
disambiguation, parsing model vs. language model
Module - 5 (Language Processing with Python) ( 5 hrs)
5.1 Introduction to NLTK 1
5.2 Text Wrangling and Text cleansing : Sentence Splitter, 1
Tokenization, Stemming,
5.3 Lemmatization, Stop word removal , Rare word Removal, Spell 1
Correction.
5.4 Part of Speech Tagging and NER. 1
5.5 Parsing Structure in Text: Shallow versus deep parsing, types of 1
parsers
SEMESTER VIII
MINOR
YEAR OF
INTRODUCTION
CSD482 MINI PROJECT
PWS 0 0 3 4 2019
Preamble: The objective of this course is to apply the fundamental concepts of different courses
learned in respective Minor Streams: Software Engineering, Machine Learning and Networking.
This course helps the learners to get an exposure to the development of application
document, testing, development and deployment. Mini project enables the students to boost their
skills, widen the horizon of thinking and their ability to resolve real life problems.
Prerequisite: A sound knowledge in courses studied in respective minor stream.

CO# CO

CO4 Level: Apply)

CO1
CO2
CO3
CO4
CO5
PO# Broad PO# Broad

PO PO

solutions

complex problems
Assessment Pattern
Mark Distribution
Total CIE ESE Marks
Marks Marks
150 75 75

Attendance 10 marks
specifications.

Demo : 20 marks
Viva : 25 marks.
Total : 75 marks.
TEACHING PLAN

etc.
c. GUI Design
d. API Design
e. Database Design
f. Technology Stack

proper names/headings. Write figure title under the figure and table title above the table.

i. Top Cover
ii. Title page
iv. Acknowledgement
v. Abstract
viii. Chapters
SEMESTER VIII
HONOURS
YEAR OF
INTRODUCTION
CSD496 MINI PROJECT
PWS 0 0 3 2 2019
Preamble: The objective of this course is to apply the fundamental concepts of courses
learned in respective Honors Streams: Security in Computing, Machine Learning and Formal
Methods. This course helps the learners to get an exposure to the development of application
document, testing, development and deployment. Mini project enables the students to boost
their skills, widen the horizon of thinking and their ability to resolve real life problems.
Prerequisite: A sound knowledge in courses studied in respective honor stream.

CO# CO
CO4 Level: Apply)

CO1
CO2
CO3
CO4
CO5
PO# Broad PO# Broad

PO PO

solutions

complex problems
Assessment Pattern
Mark Distribution
Total CIE ESE Marks

Marks Marks
150 75 75

Attendance 10 marks

specifications.

Demo : 20 marks
Viva : 25 marks.
Total : 75 marks.
TEACHING PLAN

etc.
c. GUI Design
d. API Design
e. Database Design
f. Technology Stack


proper names/headings. Write figuretitle under the figure and table title above the table.

i. Top Cover
ii. Title page
iv. Acknowledgment
v. Abstract
viii. Chapters

Computerscienceandengineerings1 S8

Uploaded by

Copyright:

Available Formats

Computerscienceandengineerings1 S8

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

Computerscienceandengineerings1 S8

Uploaded by

Copyright:

Available Formats

SEMESTER I

LINEAR ALGEBRA AND CALCULUS CATEGORY L T P CREDIT Year of

Prerequisite: A basic course in one-variable calculus and matrix theory.

Bloom’s Category Continuous Assessment Tests End Semester

Total Marks CIE ESE ESE Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Course Level Assessment Questions

17𝑥 − 30𝑥 𝑥 + 17𝑥 = 128

1. Evaluate ∬ (𝑥 + 2𝑦) 𝐷𝐴where D is the region bounded by the parabolas 𝑦 = 2𝑥 and

4. Use spherical coordinates to evaluate ∭ (𝑥 + 𝑦 + 𝑧 ) 𝑑𝑉where B is the unit ball

1. Assuming the possibility of expansion find the Maclaurin series expansion of

Course Code: MAT 101

Max. Marks: 100 Duration: 3 Hours

LINEAR ALGEBRA AND CALCULUs

(Common to all branches)

(Answer all questions, each question carries 3 marks)

with 𝑓(𝑥 + 2𝜋) = 𝑓(𝑥).Hence show that + + +⋯ = . (14X5=70)

Module 1 (Linear algebra)

(Text 2: Relevant topics from sections 7.3, 7.4, 7.5, 8.1,8.3,8.4)

Module 2 (multivariable calculus-Differentiation)

(Text 1: Relevant topics from sections 13.3, 13.4, 13.5, 13.8)

Module 3(multivariable calculus-Integration)

Module 5 (Series representation of functions)

1. H. Anton, I. Biven,S.Davis, “Calculus”, Wiley, 10th edition, 2015.

1. J. Stewart, Essential Calculus, Cengage, 2nd edition, 2017

3. Peter V. O'Neil, Advanced Engineering Mathematics , Cengage, 7th Edition, 2012

5. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36 Edition, 2010.

Course Contents and Lecture Schedule

No Topic No. of Lectures

1 Linear Algebra (10 hours)

1.1 Systems of linear equations, Solution by Gauss elimination 1

1.3 Eigen values and eigen vectors 2

1.4 Diagonaliztion of matrices, orthogonal transformation, quadratic forms 4

2 Multivariable calculus-Differentiation (8 hours)

2.1 Concept of limit and continuity of functions of two variables, partial 2

2.2 Differentials, Local Linear approximations 2

2.3 Chain rule, total derivative 2

2.4 Maxima and minima 2

3 Multivariable calculus-Integration (10 hours)

3.1 Double integrals (Cartesian)-evaluation 2

3.2 Change of order of integration in double integrals, change of coordinates 2

3.4 Triple integrals 3

4 Sequences and series (8 hours)

4.1 Convergence of sequences and series, geometric and p-series 2

4.2 Test of convergence( comparison, ratio and root ) 4

5 Series representation of functions (9 hours)

5.1 Taylor series, Binomial series and series representation of exponential, 3

5.2 Fourier series, Euler formulas, Convergence of Fourier series(Dirichlet’s 3

5.3 Half range sine and cosine series, Parseval’s theorem. 3

Prerequisite: Higher secondary level Physics, Mathematical course on vector calculus,

CO 1 Compute the quantitative aspects of waves and oscillations in engineering systems.

Mapping of course outcomes with program outcomes

Continuous Assessment Tests

Total Marks CIE ESE ESE Duration

150 50 100 3 hours

Continuous Internal Evaluation Pattern:

Course Level Assessment Questions

Course Outcome 1 (CO1):