Download Physics-II: AP 201

Department of
Information Technology
School of Engineering & Technology
Mizoram University
Aizawl- 796 004
Course Structure & Syllabi
for
Bachelor of Technology(B.tech)
Programme in
Information Technology
(2011)
MIZORAM UNIVERSITY
School of Engineering and Technology
Department of Information Technology
B. Tech (IT) Course Structure
BRANCH : Common for all B.Tech. Courses
Sl.
No
1
2
3
4
5
6
7
8
9
Code No
AP-101
AC-101
AM-101
IT-101
ME-101
HU-101
AP-191
AC-191
IT-191
Title
Physics-I
Chemistry
Mathematics-I
Computer Concepts and Programming
Engineering Mechanics
English Communication Skills
Physics Laboratory-I
Chemistry Laboratory
C Programming Laboratory
Total
Year : I
L
T
P
Credit
Marks
2
2
2
3
3
1
0
0
0
13
1
1
1
1
0
1
0
0
0
5
0
0
0
0
0
0
3
3
3
9
3
3
3
4
3
2
2
2
2
24
75
75
75
100
75
50
50
50
50
600
L = Lecture, T= Tutorial, P = Practical
Total contact hours = 13+5+9=27 hrs per week
BRANCH : Common for all B.Tech. Courses
Sl.
No
1
2
3
4
5
6
7
8
Code No
AP-201
AM-201
EC-201
EE-201
ES-201
ME-291
AP-291
WR-291
Title
Physics-II
Mathematics-II
Basic Electronics
Basic Electrical Engineering
Environment & Ecology
Engineering Graphics
Physics Laboratory-II
Workshop Practice
Total
L = Lecture, T= Tutorial, P = Practical
Total contact hours = 13+5+9=27 hrs per week
2
Semester :I
Total Marks = 600
Total Credits = 24
Year : I
Semester :II
L
T
P
Credit
Marks
2
3
3
3
2
0
0
0
13
1
1
1
1
1
0
0
0
5
0
0
0
0
0
3
3
3
9
3
4
4
4
3
2
2
2
24
75
100
100
100
75
50
50
50
600
Total Marks = 600
Total Credits = 24
BRANCH : Common for all B.Tech. Courses
Sl
No
1
2
3
4
5
6
7
8
Code No
AM-301
EC-301
EC-302
IT-301
IT-302
IT-391
EC-391
EC-392
L
T
P
Credit
Marks
Mathematics III
Digital Electronics & Logic Design
Electronics Devices & Circuits
Computer Architecture & Organization
Data Structure & Algorithm
Data Structure & Algorithm Laboratory
Digital Design Laboratory
Electronics Devices & Circuits Laboratory
Total
3
3
3
3
3
0
0
0
15
1
1
0
0
1
0
0
0
3
0
0
0
0
0
3
3
3
9
4
4
3
3
4
2
2
2
24
100
100
75
75
100
50
50
50
600
BRANCH : IT
Code No
EC-401
AM-401
IT-401
IT-402
IT-403
IT-491
EC-491
Semester :III
Title
L = Lecture, T= Tutorial, P = Practical
Total contact hours = 15+3+9=27 hrs per week
Sl
No
1
2
3
4
5
6
7
Year : II
Total Marks = 600
Total Credits = 24
Year : II
Title
Microprocessors
Mathematics IV
Software Engineering
Object Oriented Programming
Computer Graphics
Object Oriented Programming Laboratory
Microprocessor Laboratory
Total
L = Lecture, T= Tutorial, P = Practical
Total contact hours = 15+5+6= 26 hrs per week
3
Semester : IV
L
T
P
Credit
Marks
3
3
3
3
3
0
0
15
1
1
1
1
1
0
0
5
0
0
0
0
0
3
3
6
4
4
4
4
4
2
2
24
100
100
100
100
100
50
50
600
Total Marks = 600
Total Credits = 24
BRANCH : IT
Sl
No
1
2
3
4
5
6
7
Code
No
EC-501
IT-501
IT-502
IT-503
IT-504
IT-591
IT-592
Year : III
Title
Linear Integrated Circuits
Operating Systems
Database Management System
Principles of Data Communication
Unix and Shell Programming
DBMS Laboratory
Software Development Laboratory
Total
Semester :V
L
T
P
3
3
3
3
3
0
0
15
1
1
1
1
1
0
0
5
0
0
0
0
0
3
3
6
L = Lecture, T= Tutorial, P = Practical
Total contact hours = 15+5+6= 26 hrs per week
BRANCH : IT
Sl
No
1
2
3
4
5
6
7
Code
No
IT-601
IT-602
IT-603
IT-604
IT-605
IT-691
IT-692
Compiler Design & System Software
Multimedia Technologies
Computer Networks
Wireless & Mobile Networks
Theory of Computation
Multimedia Laboratory
Industrial Training*
Total
L = Lecture, T= Tutorial, P = Practical
Total contact hours = 15+5+6= 26 hrs per week
4
4
4
4
4
2
2
24
100
100
100
100
100
50
50
600
Total Marks = 600
Total Credits = 24
Year : III
Title
Credit Marks
Semester :VI
L
T
P
Credit
Marks
3
3
3
3
3
0
0
15
1
1
1
1
1
0
0
5
0
0
0
0
0
3
3
6
4
4
4
4
4
2
2
24
100
100
100
100
100
50
50
600
Total Marks = 600
Total Credits = 24
*Industrial Training must be done during winter vacation ( between 5th and 6th
Semester), training duration of minimum 30 days and maximum upto 45 days.
Industrial Training: Full Marks: 50 (Sessional: 25 Marks,
End Semester Examination: 25 Marks)
(Mark Distribution : 15-presentation/demonstration, 5 viva voce, 5report/record book)
4
BRANCH : IT
Sl
No
1
2
3
4
5
6
7
Year : IV
Semester:VII
Code No
Title
L
T
P
Credit
Marks
IT-701
IT-702
IT-703
IT-7XX
IT-7XX
IT-791
IT-891
Web Technology
Distributed Algorithms and Systems
Network Security
Elective-I
Elective-II
Mini Project
Project *
Total
3
3
3
3
3
0
0
15
1
1
1
1
1
0
0
5
0
0
0
0
0
6
0
6
4
4
4
4
4
4
0
24
100
100
100
100
100
100
000
600
L = Lecture, T= Tutorial, P = Practical
Total contact hours = 15+5+6= 26 hrs per week
Total Marks = 600
Total Credits = 24
Mini Project: Full Marks: 100 (Internal: 50 Marks,
End Semester Examination: 50 Marks)
(Mark Distribution : 35-demonstration/presenation, 10 viva voce, 5-report book)
“XX => 04 to 18”
*=>Project allotment, literature survey etc., starts from 7th Semester and it
will be submitted in the 8th Semester.
Electives (any two approved by the Department):
Code No.
IT 04
IT 05
IT 06
IT 07
IT 08
IT 09
IT 10
IT 11
IT 12
IT 13
IT 14
IT 15
IT 16
IT 17
IT 18
Subject
VLSI Design
Distributed System Programming using Java
Advanced Network Management
Parallel Algorithms
Design Patterns
Embedded Systems
Pervasive Computing
Digital Image Processing
Service Oriented Architechture
Advanced Communication Technology
Genetic Algorithms
Software Project Management
Fuzzy and Neural Computing
Software Testing
Database Application Design
5
BRANCH : IT
Sl Code No
No
1 BM-801
2
IT-8XX
3
IT-8XX
4
IT-891
Year : IV
Semester :VIII
Title
Principles and Practice of Management
Elective-III
Elective-IV
Project
Total
L = Lecture, T= Tutorial, P = Practical
Total contact hours = 9 +3+18 = 30 hrs per week
L
T
P
Credit
Marks
3
3
3
0
9
1
1
1
0
3
0
0
0
18
18
4
4
4
12
24
100
100
100
300
600
Total Marks = 600
Total Credits = 24
Mini Project: Full Marks: 300 (Internal: 150 Marks,
End Semester Examination: 150 Marks)
(Mark Distribution : 105-presentation/demonstration, 30 viva voce, 15-report
book)
“XX => 01 to 11”
Electives (any two approved by the Department):
Code
IT 01
IT 02
IT 03
IT 04
IT 05
IT 06
IT 07
IT 08
IT 09
IT 10
IT 11
Subject
Data Warehousing & Data Mining
Pattern Recognition
Mobile Computing
Cryptography
Digital Signal Processing & Applications
Robotics
Cellular & Satellite Communication
Distributed Operating System
Graph Theory
Cloud Computing
Grid Computing
Total Credits (Course): 24+24+24+24+24+24+24+24 = 192
Total Marks (Course): 600+600+600+600+600+600+600+600=4800
6
Physics-I: AP 101
Credits: 3 (2L, 1T)
Total Hours: 45
Full Marks: 75 (Internal: 30 Marks, End Semester Examination: 45 Marks)
Internal Mark : 21(Term test) + 6(assignment/presentation) + 3(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X1.5(marks)(compulsory) + (any 4 from Q. 2-8)
X 9(marks) = 45]
UNIT I:
Use of vectors in Physics, Different coordinate systems – Cartesian, cylindrical and
spherical polar coordinates, Vector fields and their potentials, gradient, divergence,
curl and their physical significance, continuity equations, Gauss and Stokes theorems
and their physical significance.
8L
UNIT II:
Newton’s laws of motion, motion in a uniform field, components of velocity and
acceleration in Cartesian system, Plane polar coordinate system, Uniformly rotating
frame, centripetal acceleration, Coriolis force and its applications, Centre of mass and
its equation of motion, conservation of energy, linear and angular momenta,
Conservative and non-conservative forces.
10L
UNIT III:
The laws of thermodynamics: The Zeroth law, indicator diagram, first law of
thermodynamics, Reversible and irreversible changes, Carnot cycle and its efficiency,
Carnot theorem and the second law of thermodynamics, Entropy, principle of increase
of entropy, The thermodynamic scale of temperature; its identity with the perfect gas
scale, third law of thermodynamics, Thermodynamics potentials, Maxwell’s general
relationships, Clausius-Clapeyron equation, Thermal conductivity and diffusivity,
differential equation of rectilinear flow of heat (one dimension), Wiedemann-Franz
law.
10L
UNIT IV:
Schrodinger equation: Schrodinger equation in time-dependent and time-independent
form, Physical interpretation and probability interpretation of wave function, Equation
of continuity, conservation of probability, expectation values of an operator-Ehrenfest
theorem, Basic postulates of quantum mechanics, Schrodinger equation as eigen value
equation, eigen value and eigen function, Free particle in one dimensional infinite
potential well, calculation of its eigen values and normalized eigen functions,
Calculation for transmission and reflection coefficient for particle in step potential.
10L
UNIT V:
Harmonic oscillations, differential equation and its solution, kinetic and potential
energy, examples of simple harmonic oscillations, spring and mass system, simple
and compound pendulum, Superposition of waves of the same frequency, Lissajous
figures, group and phase velocities, Standing waves, Free and forced vibration,
resonance and condition of resonance, sharpness of resonance, Ultrasonics:
production, detection and application of ultrasonic waves in engineering and
medicine.
7L
7
Text Books:
 A Beiser, Concepts of Modern Physics, McGraw Hill
 R Feynman, R Leighton & M Sands, The Feynman Lectures in Physics, Vol.
1,2&3.
 M Speigel, Outline of Vector Analysis, Schaum Series.
Recommended Books:
 N C Rana and P S Joag, Introduction to Classical Mechanics, TMH.
 D Halliday, R Resnick and J Walker, Fundamentals of Physics, J. Wiley &
Sons.
 Brijlal and Subrahmaniam, Heat and Thermodynamics, S Chand and Co.
 J L Powell and B Crasemann, Quantum Mechanics, Narosa Pub. House.
 D Halliday, R Resnick and J Walker, Fundamentals of Physics, John Wiley &
Sons
 N Subrahmaniam and Brijlal, Textbook of Sound.
 D.S. Mathur: Elements of Properties of Matter, S. Chand & Co.
 P. K. Chakaraborty: Advanced Text Book on Heat, Modern Book Agency,
Kolkata.
 D. S. Mathur: Fundamentals of Heat, S. Chand & Co. (latest edition)
 S. Garg, C.K. Ghosh, S. Gupta: Oscillations and Waves, PHI India Ltd
8
Chemistry: AC 101
Credits: 3 (2L, 1T)
Total Hours: 45
Full Marks: 75 (Internal: 30 Marks, End Semester Examination: 45 Marks)
Internal Mark : 21(Term test) + 6(assignment/presentation) + 3(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X1.5(marks)(compulsory) + (any 4 from Q. 2-8)
X 9(marks) = 45]
UNIT I:
Phase rule, and their thermodynamic derivations, the distribution law and solvent
extraction. Ionic, molecular and covalent network in solids, Crystal types: AX and
AX2, Point defects in crystals, Band theory of solids.
7L
UNIT II:
Concept of rate, Rate constant, 1st, 2nd, and 3rd order reactions, Determination of Rate
law, Kinetics of catalytic, photochemical, and, fast reactions, Collision and absolute
reaction rate theories, Adsorption of gases on solids, Langmuir and Freundlich
isotherms, Homogeneous & heterogeneous catalysis, Industrial applications, Zeolites.
9L
UNIT III:
Electrochemical systems, galvanic cells, classification and thermodynamic treatment,
Concentration cell and liquid junction potential, Potentiometry, Membrane equilibria,
ion-selective electrodes, and pH-metry, Corrosion types, mechanism, and methods of
prevention.
7L
UNIT IV:
Composition and properties of glass, refractoriness and cement, Molecular sieve,
elementary ideas of electronic and photonic ceramics. Classification and properties of
composite materials, Mechanism of reinforcement composites. Polymerization,
classification, linking and engineering uses of polymers, thermoplastic and
thermosetting resins, elastomers & synthetic fibers, ion-exchange resins, organic
conducting and insulating materials.
11L
UNIT V:
Elementary idea of absorption & emission spectrometry, flame, and
spectrophotometer analysis of engineering materials, Infra-Red (IR) and Nuclear
Magnetic Resonance (NMR) Spectroscopy and spectra of simple compounds, Mass
Spectrometry, X-ray methods (X-Ray Diffraction, Electronic Spectroscopy for
Chemical Analysis).
11L
Text Books:
 G. M. Barrow, Physical Chemistry, 5th Ed., TMH, New Delhi.
 V. Walters, J. de Paulo, and Peter Atkins, Explorations in Physical Chemistry, Oxford.
 Puri, Sharma, and Pathania, Principle of Physical Chemistry, 44th Edition, Vishal
Publishing House, New Delhi
 Hameka, Chemistry: Fundamentals and Applications, Academic Press.
 Davis, and Berner, Handbook of Industrial Chemistry (vol. 1 & 2), John-Wiley.
 D. A. Skoog, Principles of Instrumental Analysis, 5th Ed., Saunders College Publ.
 Parameshwara Murthy, Textbook of Engineering Chemistry, BS Publications.
9

Walton, Polymers, Oxford University Press (Oxford Chemistry primers)
References:
 M. Bowker, The basis and Applications of Heterogeneous Catalysis, Oxford
University Press (Oxford Chemistry Primers).
 S. Metcalfe, Chemical Reaction Engineering: First Course, Oxford (Oxford
Chemistry Primers).
 West, Solid-state Chemistry and its applications, John-Wiley.
 Baerns, M., Basic Principles in Applied Catalysis, Springer-Verlag.
 Jones, and S. Wimperis, NMR: the Tool kit, Oxford University Press (Oxford
Chemistry primers)
 A. K. Brisdon, Inorganic Spectroscopic methods, Oxford University Press
(Oxford Chemistry primers)
 W. Clegg, Crystal Structure Determination, Oxford University Press (Oxford
Chemistry primers)
 Robinson, Undergraduate Instrumental Analysis, John-Wiley.
 James C Gerdeen, et. al., Engineering Design with polymers and Composites,
CRC Press.
 James G. Speight, Handbook of Coal Analysis, John-Wiley.
10
Mathematics-I: AM 101
Credits: 3(2L, 1T)
Total Hours: 45
Full Marks: 75 (Internal: 30 Marks, End Semester Examination: 45 Marks)
Internal Mark : 21(Term test) + 6(assignment/presentation) + 3(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X1.5(marks)(compulsory) + (any 4 from Q. 2-8)
X 9(marks) = 45]
UNIT I:
Successive differentiation, Leibnitz’s theorem, polar curves, angle between radius
vector and tangent, angle of intersection of two curves, derivatives of arcs (Cartesian
and polar), curvature, radius of curvature and evolute.
8L
UNIT II:
Rolle’s Theorem, mean value theorems, partial differentiation, Euler’s theorem, total
differential, differentiation of composite and implicit functions.
7L
UNIT III:
Convergence, divergence, comparison test, ratio test, Cauchy’s root test, Cauchy’s
integral test, alternating series, Leibnitz’s theorem, absolute and conditional
convergence, Expansion of functions into Taylor’s and Maclaurin’s series.
6L
UNIT IV:
Binary operation, linear dependence and independence, basis, orthogonal basis,
Vector Spaces and Subspaces, Simple examples, Matrices, elementary column and
row operations, inverse, rank, system of linear equations, solution by Gauss
elimination method.
12L
UNIT V:
Reduction formulae for  sin n x dx ,  cos n x dx,  sin m x cos n x dx . Evaluation of



2
2
2
n
 sin x dx,
n
 cos x dx,
 sin
0
0
0
m
x cos n x dx where m and n are positive integers.
Tracing of standard curves Folium of Descartes, Strophoid, Lemniscate of Bernoulli,
Witch of Agnessi, Astroid, Cissoid of Diocles, Cardioid, Cycloid, Roses (three and
four leaved), Length, area and volume of revolution involving simple curves. 12L
Text Books:
 B.S. Grewal, Higher Engineering Mathematics.
 Shanti Narayan, Differential Calculus.
 Shanti Narayan, Integral Calculus.
 Maity and Ghosh, Differential Calculus.
References:
 C.B. Thomas, Calculus and Analytical Geometry.
 N. Piskunov, Differential and Integral Calculus, Vol. I and Vol. II.
11
Computer Concepts and Programming: IT 101
Credits: 4 (3L, 1T)
Total Hrs: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Computer Basics-characteristics of a computer system, I/O Devices, functional
units.Operating System-definition, application of OS.Sofwares-types and
uses.Problem Solving Technique, concepts of algorithms, flowcharts
7L
UNIT II:
Introduction to C language - background, compilation. Tokens, character sets,
constants, variables, identifiers, keywords, data types, user-defined data type.
Operators and expressions, Input and output in C programs.Decision making and
branching, looping.
15L
UNIT III:
Arrays – Declaration, initialization on one dimensional array, two dimensional arrays,
multidimensional arrays, dynamic arrays. Character arrays and string.
8L
UNIT IV:
Functions – concepts, elements of user defined function, passing values, scope,
visibility and lifetime of variables
Pointers – Concepts, pointers and arrays, pointers and character strings, array of
pointers, pointers and function (pointers as function arguments, functions returning
pointers).
15L
UNIT V:
Structure-concepts, operations on individual members, array of structures, structures
and function, union, size of structure. File operation(opening a file, closing file, input
output operations, modes). Error handling during I/O operations, random access to
files, command line arguments
15L
Text Books:
 E.Balaguruswamy, “Programming in ANSI C”, TMC
 Yashavant P. Kanetkar, “Let Us C”, BPB Publications
 Byron S. Gottfried “Programming with C, (Schaum's Outlines Series)Mc
Graw Hill
References:
 Brian W. Kernighan and Dennis Ritchie: “The C ProgrammingLanguage”,
2nd Edition, PHI, 1998.
 R. Sethi, “Programming Language”, Addison Wisely
 V. Rajaraman “Computer Progmamming in C”, PHI
12
Engineering Mechanics: ME 101
Credits: 3 (3L)
Total Hours: 45
Full Marks: 75 (Internal: 30 Marks, End Semester Examination: 45 Marks)
Internal Mark : 21(Term test) + 6(assignment/presentation) + 3(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X1.5(marks)(compulsory) + (any 4 from Q. 2-8)
X 9(marks) = 45]
UNIT I:
Types of forces-concurrent, coplanar, distributed, spatial, resultant of a force about an
axis, concept of equilibrium, Moment and couple, Principles of Transmissibility,
Lamis and Varignon’s theorem, Moment of inertia of areas and masses, Simple
applications to machines, mechanical efficiency.
10L
UNIT II:
Concepts of stress and strains-Internal and external forces, Stress-normal, shearing
and bearing, Deformations, Strain-Normal, shearing and bearing, Stress-strain
diagram, Elastic and plastic behavior, elastic constants and their mutual relations,
Thermal stresses, Deflections of beams, Shearing force and bending moments.10L
UNIT III:
Rectilinear and curvilinear motion of particles, General plane motions, equations of
motions in non-inertial frames of reference, D’Alembert’s principle, Basic Principle
of work and energy, Mechanical vibrations, Principle of impulses and momentum,
application to plane motion of particles and rigid bodies.
9L
UNIT IV:
Introduction, first law for closed and open systems, flow processes and control
volume, Limitations of first law of thermodynamics, Power producing and power
absorbing devices, second law of thermodynamics, Corollaries of second law. 8L
UNIT V:
Properties of Fluid, Classifications, ideal fluid, Newtonian and non-Newtonian fluids,
Inviscid fluid, Newton's law of viscosity, Basic concept of Fluid Statics, Dynamics
and Kinetics, Flow through open channel.
8L
Text Books:


Cengel, Thermodynamics.
Som & Biswas, Fluid Mechanics and Machinery.
References:
 Rao Y.V.C., Engineering Thermodynamics, Universities Press
 Garde, Engineering Fluid Mechanics, Scitech.
13
English Communication Skills: HU 101
Credits: 2(1L, 1T)
Total Hours: 30
Full Marks: 50 (Internal: 20 Marks, End Semester Examination: 30 Marks)
Internal Mark : 14(Term test) + 4(assignment/presentation) + 2(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X1(marks)(compulsory) + (any 4 from Q. 2-8)
X 6(marks) = 45]
UNIT-I :
Principles and Process of communication (coherent communication, barriers, removal
of bottleneck; verbal & non-verbal network of communication)
6L
UNIT-II:
Grammer: Parts of speech (sentence and its structures-subject verb-object formation
of speech & writing, Assertive, negative, interrogative and Idioms, Active, Passive
voice etc)
6L
UNIT-III:
Tense, agreement/concord
4L
UNIT-IV:
Phonetics & stress patterns in English, Group discussion, public speaking,
presentation
7L
UNIT-V:
Basics of Business letters, drafting: Addressing & concluding.
Report Writing: Types and specimens using hard & software.
7L
Text Books:
 Leena Sen “Communication Skills”, PHI
 Urmila Rai, S.m Rai “Managerial Communication”, Himalaya Publishing
house
 Wrein and Martin “English Grammar and Composition”
 Bansal, R.K.& Harrison, J. B. Spoken English [for India], Orient Longman.
References:
 O’Connor, J.D. Better English Pronunciation (Cambridge English Language
Learning) 1981, CUP.
 Verma, S.K. An Introduction to Phonetics and Linguistics,
 Patnaik, P. Group Discussion and Interview Skills, New Delhi: CUP, 2011.
 Seeley, John. Oxford Guide to Effective Writing and Speaking, Delhi: OUP,
2000.
 E-Resources: Website- EnglishClub.com -for Business correspondence.
 PowerPoint Presentation – for Professional Communication.
 Murphy, Raymond. English Grammar In Use[3rd edn] CUP,2010.
14
Physics Laboratory-I: AP 191
Credits: 2(3P)
Total Hours: 45
Full Marks: 50 (Sessional: 25 Marks, End Semester Examination: 25 Marks)
(Mark distribution : 15 practical, 5-viva voce, 5-report/record book)
List of Experiments:
1. Errors and approximations – with data from Vernier Callipers and Screw
Gauge
2. Determine the acceleration due to gravity by bar pendulum
3. Determination of Young’s Modulus by cantilever bending method
4. Determination of Thermal Conductivity of bad conductor by Lee’s Disc
5. Verify laws of vibrations of strings by using ac sonometer
6. Determine the coefficient of linear expansion of a rod by optical lever
method
7. Determination of velocity of ultrasonic sound in liquid using Ultrasonic
wave interferometer
8. Determination of co-efficient of viscosity by Poiseulle’s capillary flow
method.
9. Determination of thickness of a wire by using air-wedge
10. Determine the refractive index of a liquid/solid by using a traveling
microscope.
15
Chemistry Laboratory: AC 191
Credits: 2(3P)
Total Hours: 45
Full Marks: 50 (Sessional: 25 Marks, End Semester Examination: 25 Marks)
(Mark distribution : 15 practical, 5-viva voce, 5-report/record book)
List of Experiments:
1. Estimation of hardness of water using EDTA titration.
2. Critical micellar concentration of commercial detergents from surface tension
measurements using stalagmometer.
3. Conductometric titration of strong acid with strong base.
4. Potentiometric titration of Fe2+ using potassium dichromate.
5. Evaluation of pKa of weak acid using pH meter.
6. Determination of surface tension and viscosity of liquid
7. Kinetics; Determination of rate constant for acid catalysed hydrolysis of Ester.
8. Determination of percentage composition of sugar solutions using viscometer.
9.
Determination of partition coefficient of acetic acid between n-butanol and
water.
10. Spectrophometric determination of copper.
11. Conductometric titration of weak acid with strong base.
16
C Programming Laboratory: IT 191
Credits: 2(3P)
Total Hours: 45
Full Marks: 50 (Sessional: 25 Marks, End Semester Examination: 25 Marks)
(Mark distribution : 15 practical, 5-viva voce, 5-report/record book)
Group A
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Program to find whether the given number is prime or not.
Program to find the factorial of a given integer
Program to find the sum of individual digits of a positive integer.
Program to find the GCD (greatest common divisor) of two given integers.
Program to display first N terms of Fibonacci series.
Program to replace lowercase letters by uppercase letters and vice versa in a sentence
Program to check whether a string is palindrome or not
Program to sort 10 names in alphabetical order
Write a function(using a pointer parameter) that reverse the elements of a given array
Program to display contents of a file
Group B
11. Program to find output all the roots of a given quadratic equation, for non-zero
coefficients.
12. Program, which takes two integer operands and one operator from the user,
performs theoperation and then prints the result. (Consider the operators +,-,*, /,
% and use Switch Statement)
13. Program to generate all the prime numbers between 1 and n, where n is a
value supplied by the user.
14. Program to find both the largest and smallest number in a list of integers.
15. Program to calculate the following Sum:
Sum=1-x2/2! +x4/4!-x6/6!+x8/8!-x10/10!
16. Program to read matrix A (M X N) and find the following using function
i) sum of elements of M rows
ii) sum of elements of N columns
iii) sum of all elements of the matrix
17.
18.
19.
20.
Program to multiply two matrices
Program which copies one file to another file.
Program to count the number of characters, tabs, spces, number of lines in a file
Create a structure to specify data on students given below:
-
Roll No. , Name, Class, marks obtained on three subjects
Enter N students information and display the percentage of each student (assumeF.M
is 100 each).
Print the data of a student whose roll number is given by the user
(During Practical examination students have to attempt one program from each group)
17
Physics-II: AP 201
Credits: 3(2L, 1T)
Total Hours: 45
Full Marks: 75 (Internal: 30 Marks, End Semester Examination: 45 Marks)
Internal Mark : 21(Term test) + 6(assignment/presentation) + 3(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X1.5(marks)(compulsory) + (any 4 from Q. 2-8)
X 9(marks) = 45]
UNIT I:
Wave optics: Huygen’s principle, Young double slit experiment, colour of thin films,
Newton’s rings, diffraction, single slit diffraction, diffraction grating. Polarization of
light.
8L
UNIT II:
Lattice, unit cell and translation vector, classification of crystals, Bravais lattice,
Bloch theorem, Kronig-Penney and the origin of band gap in solids, classification of
solids, different types of magnetic materials, hysteresis, various polarization
mechanics in dielectrics and their frequency and temperature dependence, internal
field and Clausius-Mosotti equation–concept of complex permittivity, loss tangent,
dielectric loss, dielectric breakdown, High resistivity alloys, superconductorsproperties and applications.
12L
UNIT III:
Semiconductors–intrinsic and extrinsic semiconductors, elemental and compound
semiconductors and their properties, density of states, Fermi-Dirac statistics,
calculation of Fermi energy and its importance, concept of hole, origin of band gap in
solids (qualitative treatment only), effective mass of electron, Carrier concentration in
intrinsic semiconductors – carrier concentration in n-type and p-type semi conductors.
12L
UNIT IV:
Spontaneous and Stimulated emission of radiation, Population inversion, Einstein’s A
& B co-efficient (basic idea), Optical resonator and condition necessary for active
Laser action, Ruby Laser, He-Ne Laser.
7L
UNIT V:
Optical Fibers–Core and cladding, total internal reflection, calculation of numerical
aperture and acceptance angle, losses in optical fibers, types of optical fibers. 6L
Text Books:
 C L Arora, Refresher Course in BSc Physics , S Chand and Co.
 R Feynman, R Leighton and M Sands, The Feynman Lectures in Physics,
Volumes 1,2 & 3.
 R Murugeshan and Kiruthiga Sivaprasath, Modern Physics, S Chand and Co.
 D J Griffiths, Introduction to Electromagnetics.
Reference Books:
 M L Gupta, Radio and Electronics Engineering, Dhanpat Rai & Sons
 C Kittel, Introduction to Solid State Physics, Wiley & Sons
 J P Srivastava, Elements of Solid State Physics, Prentice Hall of India.
 Sze S M, Introduction to Semiconductor Physics.
 David A Bell, Introduction to Semiconductor Physics.
18




Ghatak A and Tyagarajan N, Introduction to Fiber Optics, Cambridge
University Press.
Gerd Keiser, Optical Fiber Communications, MGH.
P J Collins and M Hird, Introduction to Liquid Crystals, Taylor and Francis
M D Ventra, S Evoy and RJ R Heflin Jr, Introduction to Nanoscale Science
and Technology, Springer.
19
Mathematics-II: AM 201
Credits: 4(2L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q.
2-8) X 12(marks) = 60]
UNIT I:
Order, degree, Solutions of equations - homogeneous and non homogeneous
equations, exact equations, linear equations, Bernoulli's equations.
10L
UNIT II:
Homogeneous equations, linear equations with constant coefficients, non
homogeneous equations, method of variations of parameters and inverse differential
operators, solution of Cauchy's homogeneous linear equations, Solution of simple
simultaneous equations.
10L
UNIT III:
Laplace Transforms of elementary functions, transforms of derivatives and derivatives
of transforms, Inverse transforms, transforms of periodic, functions, unit step
function, shifting theorems, and solutions of differential equations using Laplace
transforms.
15L
UNIT IV:
Direction cosines, planes, straight lines, spheres, right circular cone and right circular
cylinder.
8L
UNIT V:
Extreme values of a function of two variables, Lagranges's method of undetermined
multipliers, simple problems, multiple integrals: evaluation by change of order of
integration, changing of variables. Jacobians, Applications to areas and volumes, Beta
and Gamma functions: elementary properties, simple problems.
17L
Text Books:
 E.D. Rainville and P. E. Bedient, A short course in differential equation.
 Erwin Kreyszig, Advanced Engineering Mathematics.
 Shanti Narayan, Differential Calculus.
 Shanti Narayan, Analytical solid Geometry
References:


C.B. Thomas, Calculus and Analytical Geometry.
N. Piskunov, Differential and Integral Calculus, Vol. I and Vol. II
20
Basic Electronics: EC 201
Credits: 4 (3L, 1T)
Total hrs: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Crystalline materials, Fermi energy, Conductors, Semiconductors and Insulators: electrical
properties, band diagrams, Intrinsic and extrinsic semiconductor, P-type and N-type, drift and
diffusion carriers, The Hall Effect.
10L
UNIT II:
P-N junction, Forward and reverse bias, V-I Characteristics, Simple diode circuits, Zener and
avalanche breakdown, load line, linear piecewise model, rectifiers: half wave, full wave, its
PIV, DC voltage and current, ripple factor, efficiency Clipper and Clamper circuits. 10L
UNIT III:
Formation of PNP / NPN junctions, energy band diagram; transistor mechanism and principle
of transistors, CE, CB, CC configuration, Ebers-Moll model of transistor, transistor
characteristics, Biasing and Bias stability: derivation of stability factor. Different operating
modes, Equivalent Circuit for h-parameters; Transistors as amplifier: Calculation of gain
(Current and Voltage), input and output impedance, frequency response for CE amplifier with
and without source impedance (qualitative).
15L
UNIT IV:
Introduction to IC Technology, Properties of Op-amp, specification of IC-741, concept of
virtual earth, Op-Amp transfer characteristics, Application of operational amplifier: inverting
and non-inverting amplifier, summing, difference, constant gain multiplier, voltage follower,
comparator, integrator, differentiator. Silicon Controlled Rectifier (SCR): constructional
features, physical operation, characteristics, applications, Uni-Junction Transistors (UJT):
Physical operation, Characteristics and simple applications, Concept of TRIAC, DIAC,
Insulated Gate Bipolar Transistor (IGBT) and GTO.
15L
UNIT V:
CRO Operation, Construction features of cathode ray tube, concept of dual beam CRO,
application of CRO for different electrical measurements: amplitude frequency and phase of
sine wave, Lissajous figure.
10 L
Text Books:
 Malvino, Electronic Principle
 Mottershed, Electronics Devices & Circuits
 B.G.Streetman & S. Banerjee, Electronics Devices & Circuits
 Millman & Halkias, Integrated Electronics
References:
 Millman & Grabal, Microelectronics
 Schilling & Belove, Electronics Circuits
 Salivahanan, Electronics Devices & Circuits
21
Basic Electrical Engineering: EE 201
Credits: 4 (3L, 1T)
Total hrs: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Coulomb’s law, Gauss’s theorem (proof), capacitance calculation for plates,
concentric spheres and co-axial cylinders, dielectrics, stored energy, electrostatic
precipitator, electrostatic photocopying (Xerox ), Ohm’s law, Kirchhoff’s laws, mesh
current and node voltage methods.
12L
UNIT II:
Magnetism as a Relativistic effect, Biot-Savart law, Ampere’s circuital law, magnetic
field due to long straight conductors, coils and solenoids; magnetic forces: Lorentz
/Ampere force, force production in simple systems (as in PMMC), B-H characteristics
of ferromagnetic materials, Magnetic circuits, Faraday’s law.
12L
UNIT III:
D.C. Machines, Construction, Characteristics of D. C. generators and D.C. motors
(qualitative and only for shunt & series machines), starting (by 3-point starter) and
speed control of D.C. machines (armature voltage and field current control), D.C.
transients in R-L, R-C and R-L-C circuits.
12L
UNIT IV:
A.C. generation, waveforms, average and RMS values, peak-factor, R-L, R-C and RL-C circuits, Three phase power supplies, Delta and star connection, line and phase
quantities, solution of 3-phase circuits for balanced voltage and balanced loads,
phasor diagrams, 3 phase, 4 wire circuits, power measurement by two wattmeter
method, General structure of electrical power systems.
12L
UNIT V:
Single phase Transformers: Core and shell type construction, EMF equation, no load
and on load operation, open and short circuit tests, 3-Phase Induction Motors:
Construction, Production of rotating field, principle of operation ratings. Torque –
speed characteristics (qualitative only).
12L
Text Books:
 Nagrath I J, Basic Electrical Engineering, Tata McGraw Hill Pub. Co.
 Kamaleshaiah and Naidu, Introduction to Electrical Engineering, Tata
McGraw Hill Pub. Co.
References:
 Edward Hughes (revised by Ian McKenzie Smith), Electrical Technology,
Seventh Ed., English Language Book Society Publication with Longman.
 Vincent Del Torro, Electrical Engineering Technology, Second Edition,
Prentice Hall of India Pvt. Ltd.
 Rizzoni, Principles and Applications Of Electrical Engineering, TMH.
22
Environment & Ecology: ES 201
Credits: 3(2L, 1T)
Total Hours: 45
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Concept of environment, ecology and. Introductory to population & community
ecology. Life forms and biological spectrum, population interaction, man, society and
environment, need for environmental awareness.
5L
UNIT II:
Concept, types and components of an ecosystem, understanding of food chain, food
web , trophic levels, ecological pyramids and energy flow in an ecosystem, a brief
account of aquatic (lentic & lotic ) and terrestrial (forests, grassland, desert )
ecosystems and major biomes of world.
10L
UNIT III:
Definition and types of environmental polution(air, water and soil), Climate change,
Global warming, greenhouse gases, acid rain, ozone layer depletion, A brief account
of eutrophication, biomagnification, radioactive pollution and hazardous effects of
radiation environment and human health.
8L
UNIT IV:
Concept of environmental impact assessment (EIA), application of information
technology and remote sensing in environment management , disaster management
floods ,earthquakes, cyclone and landslides.
10L
UNIT V:
Concept of biodiversity (genetic, species & ecosystem), concept of mega-diversity,
hot spots, anthropogenic activities in relation to deterioration of environment, concept
of genetic, species and loss of biodiversity. Convention of Biodiversity (1992),
agenda 21 and sustainable development.
12L
Text Books:
 Masters. G.M. Introduction to Environmental Engineering and Sciences PHI
 Nebel, B.J. Environmental Sciences PHI
References:
 Cunningham, W.P, M.A. Cunningham and B.W. Sargo. Environmental
Sciences: a Global Concern. 8th edition. MGH, New York.
 Frankie, R.G and D.N. Frankie. Man ad the changing Environment. Holt
Renechart and Winston, New York.
 Odum E.P. Fundamentals of Ecology. 3rd edition. W.B. Saunders Company,
USA.
 Sharma, P. D. Ecology and Environment. Rastogi Publication, Meerut, India.
23
Engineering Graphics: ME 291
Credits: 2(3P)
Total Hrs: 45
Full Marks: 50 (Sessional: 25 Marks, End Semester Examination: 25 Marks)
(Mark distribution : 15 practical, 5-viva voce, 5-report/record book)
UNIT I:
Purpose of Engineering Drawing & graphics, Drawing Instruments & materials,
Lines & their conventions, dimension, scales, sense of proportioning.
9H
UNIT II:
Lattering, projections of points & lines, Orthographic projections (cylinder, cone,
cube, pyramid), isomeric projections.
9H
UNIT III:
Projections of plane figures (obtaining true shape of plane figures by projection),
Angle of Projections, free hand sketching, orthographic views, pictorial views,
auxiliary views.
13H
UNIT IV: Projections of Solids, Lines, planes, intersection & development of
surface.
7H
UNIT V:
Nomography-basic concepts & uses, AutoCAD commands & simple drawings
using AutoCAD
7H
Text Books:
 K. L. Narayana & P Kannaiah, Engineering Graphics, TMH.
 V. Luxminarayana & Vaish wanar, Engineering Graphics, Jain Brothers, New
Delhi.
References:
 N. D. Bhatt, Elementary Engg Graphics, Charatar Book Stall, Anand.
 A. M. Chandra & Satish Chandra, Engineering Graphics, Norosa.
24
Physics Laboratory-II: AP 291
Credits: 2(3P)
Total Hours: 45
Full Marks: 50 (Sessional: 25 Marks, End Semester Examination: 25 Marks)
(Mark distribution : 15 practical, 5-viva voce, 5-report/record book)
List of Experiments:
1. Determination of the dielectric permittivity of non-polar solids using LCR meter
2. Determination of the dielectric permittivity of liquids using a dipole meter
3. Determination of band gap of semiconductors
4. Determination of particle size by using He-Ne Laser
5. Determination of Laser parameters
6. Determination of fiber-optical properties – acceptance angle, power-loss
7. Determination of Hall-Coefficient of semiconductors
8. Hysterisis tracing of the B-H Loop
9. Use CRO for the study of A.C. supply waveform and compare the frequencies.
10. Determination of wavelength of light by Newton’s ring method.
25
Workshop Practice: WR 291
Credits: 2(3P)
Total Hrs: 45
Full Marks: 50 (Sessional: 25 Marks, End Semester Examination: 25 Marks)
(Mark distribution : 15 practical, 5-viva voce, 5-report/record book)
I. Theory (about various components involved in Workshop Practice)
(a) Carpentry: Timber, definition, Engineering applications, seasoning and
preservation, plywood and ply-boards.
(b) Metal Joining Definitions of welding, brazing and soldering processes, and their
applications. Oxy-acetylene glass welding process, equipment and techniques, types
of flames and their applications. Manual metal arc welding technique and equipment,
AC and DC welding, electrodes, constituents and functions of electrode coating.
Welding positions. Types of weld joint. Common welding defects such as cracks,
undercutting, slag inclusion, porosity.
(c) Metal Cutting: Introduction to machining and common machining operations.
Cutting tool materials. Definition of machine tools, specification and block diagram
of lathe, shaper, milling, drilling machine and grinder. Common lathe operations such
as turning, parting, chamfering and facing. Quick return mechanism of shaper.
Difference between drilling and boring. Files-material and classification.
II. Experiments : At least eight (8) experiments need to be conducted
List of Jobs to be made in the Workshop
(a) Carpentry:
1. T-Lap & L-joints
2. Bridle joint
(b) Metal Joining: Welding Practice.
1. Gas welding practice on mild steel flat
2. Lap joint by Gas welding
3. MMA welding practice by students
4. Square butt joint by MMA Welding
5. Lap joint by MMA Welding
6. Demonstration of brazing
7. Tin smithy for making mechanical joints and soldering of joints
(c) Metal Cutting:
1. Job on lathe with one step turning and chamfering operations
2. Job on shaper and milling machine for finishing two sides of a job
3. Drilling two holes of size 5 and 12 mm diameter on job used / to be used for
shaping
4. Grinding a corner of above job on bench grinder
5. Finishing of two sides of a square piece by filing.
Text Books:

Chapman & Arnold, Workshop Technology, Very Low Priced Edition.

Begeman & Amstead, Manufacturing Process, John Wiley.
References:

B S Raghubansi, Workshop Technology, Dhanpat rai & sons.

Hajra, Chaudhuri, Elements of Workshop technology, Media Promoters &
Publishers.

Khanna , O.P., Workshop Technology, Dhanpat Rai Publications.

S. Crawford, Basic Engineering Processes, Hodder & Stoughton.

T. Jeyapoovan, Workshop Practics, Vikas Publication.
26
Mathematics-III : AM 301
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Boolean algebra: partial ordering, lattice and algebraic systems, principle of duality,
basic properties of algebraic systems defined by lattices, distributive and
complemented lattices, Boolean lattices and Boolean algebra, uniqueness of finite
Boolean algebra, Boolean functions and Boolean expressions.
10L
UNIT II:
Group theory: definitions of semigroup, monoid, group, Permutation group and
simple examples. Cosets, Lagrange's theorem, normal subgroup, homomorphism,
Burnside's theorem (statement only) and its simple applications, codes and group
codes.
10L
UNIT III:
Complex variables: Introduction -complex numbers, functions, continuity,
Differentiability, analyticity -Cauchy Riemann equations and properties of ana1ytic
functions. Contour integrals and their basic properties, Cauchy's integral Theorem and
Cauchy's integral formula.
10L
UNIT IV:
Power series: Taylor, Maclaurin and Laurent's series, residue theorem, evaluation of
standard real integrals using contour integrals.
Fourier series: Fourier series, periodic functions, Fourier series of odd and even
functions. Functions with arbitrary period, half range expansion, Fourier sine and
cosine transforms, Fourier integrals.
20L
UNIT V:
Graph theory: directed and undirected graphs, circuits, paths, cycles of connectivity,
adjacency and incidence matrices, Networks, Dijkstra's algorithms
(i) for finding shortest paths between two specified points
(ii) Spanning trees -algorithm to find Spanning tree, Minimal Spanning Tree
Algorithm - Kruskals and solution
10L
Text Books:

R. V. Churchill and J. W. Brown, Complex variables and applications.

B.S. Grewal, Higher Engineering Mathematics.

I.N. Herstein, Topics in algebra.

C.L. Liu, Elements of discrete mathematics.

Narasingh Deo, Graph theory with applications to Computer Science
References:

Stephen A. Witala, Discrete mathematics.

V. Chandra, V. Ghare & J. Moore, Applications of Graph theory algorithms.
27
Digital Electronics and Logic Design: EC 301
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Introduction, Binary representation, Codes and their conversions, BCD, Octal,
Hexadecimal, ASCII, Gray code, Excess-3 code, Binary arithmetic.
10L
UNIT II:
Boolean algebra, logic gates and circuits, Minimization of logic expressions by
algebraic method, K-map method, VEM methods and Quine Mc Clauskey method.
10L
UNIT III:
Adder, subtractor, encoder, decoder, comparator, multiplexer, de-multiplexer, parity
generator, Priority Encoder, ALU, BCD to 7 segment code converter. Flip Flops,
various types of Registers and counters and their design, Ring Counter, State table
and state transition diagram, sequential circuits design methodology.
20L
UNIT IV:
Weighted resistor and R-2R ladder type D/A converter, Parallel-comparator type,
Successive approximation type, Dual slope, Counting A/D converters.
10L
UNIT V:
DTL, TTL, ECL, MOS and CMOS, their operation, specifications, Advantages and
Disadvantages, RAM, ROM, PROM, EROM.
10L
Text Books:
 Jain, Modern Digital Electronics, 2/e ,TMH
 Leach & Malvino, Digital Principles & Application, 5/e, TMH
 Morris Mano, Digital Logic Design, PHI.
References:
 H.Taub & D.Shilling, Digital Integrated Electronics, Mc Graw Hill.
 Givone, Digital Principles & Design, TMH
 Virendra Kumar, Digital Technology, New Age.
 S.Aligahanan, S.Aribazhagan, Digital Circuit & Design, Bikas Publishing
House.
28
Electronic Devices & Circuits: EC 302
Credits: 3(2L, 1T)
Total Hours: 45
Full Marks: 75 (Internal: 30 Marks, End Semester Examination: 45 Marks)
Internal Mark : 21(Term test) + 6(assignment/presentation) + 3(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X1.5(marks)(compulsory) + (any 4 from Q. 2-8)
X 9(marks) = 45]
UNIT I:
Introduction to Properties of metal semiconductor junctions, photovoltaic effect-solar
cells, Zener and Tunnel diodes, Varactor diodes, Semi conductor sensors and
detectors, LED’s, High voltage and high power transistors.
10L
UNIT II:
JFET’s operation, static characteristics, JFET biasing, amplification, IJFET. MOSFET
operation, Characteristics, types, enhancement, depletion mode, Introduction to
CMOS.
8L
UNIT III:
MOS: MOS fundamentals, MOS capacitor, surface space charge region, accumulation,
depletion and inversion, Flatband and threshold voltages, MOS capacitor on n-sub,
electrostatic characteristic of MOS, Device physics of MOS, drain current and channel
charge, gradual channel approximation, strong and moderate Inversion, Body bias effects.
10L
UNIT IV:
Concept, properties, positive and negative feed back, loop gain, open loop gain, feed
back factors, topologies of feed back amplifier, effect of feed back on gain, output
impedance, input impedance, sensitivities (qualitative), BW, Stability, effect of
positive feed back: instability and oscillation.
10L
UNIT V:
Condition for oscillation, Barkhausen criteria, general form of oscillator,
configuration, loop gain, Wien- bridge oscillators, introduction to phase shift
oscillators and crystal oscillators.
7L
Text Books:




Millman & Halkias, Integrated Electronics, TMH
Millman & Grabel, MGH Micro-Electronics
Neamen, Semiconductor Physics &devices TMH
Chattopadhyay, Rakshit, Saha & Purkait, 2nd Edn -Foundation of Electronics
References:



Prof. Manis Mukherjee, Foundation Of Electronics Devices And Circuits,
EPH.
Kasap, Principles of Electronic Materials &devices TMH
Malvino, Principle of Electronics, TMH
29
Computer Architecture & Organization: IT-301
Credits: 3(2L, 1T)
Total Hours: 45
Full Marks: 75 (Internal: 30 Marks, End Semester Examination: 45 Marks)
Internal Mark : 21(Term test) + 6(assignment/presentation) + 3(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X1.5(marks)(compulsory) + (any 4 from Q. 2-8)
X 9(marks) = 45]
UNIT I:
Introduction to digital computers, Functional Units, Introduction to Logic Gates,
Boolean algebra, Map Simplification, Combinational Circuits, Half-adder, Full-adder.
Integrated Circuits, Decoders, Multiplexers, Registers. Memory Unit-RAM, ROM,
Types of ROMs. Basic Computer Organization and design: Instruction Codes,
Computer Registers, Computer Instructions, Timing & Control, Instruction Cycle,
Memory-Reference Instructions, Concept of Interrupt.
15L
UNIT II:
Machine Language, Assembly Language, Assembler, Program Loops, Subroutines.
Control Unit: Micro-operations, Microinstruction Format , Control of the processor,
Hardwired Implementation.
15L
UNIT III:
Number Systems, Complements, Fixed Point Representation, Floating Point Number
Representation, Addition, Subtraction, Multiplication and Division of Numbers in
different types of Representation
10L
UNIT IV:
General Register Organization, Stack Organization, Instruction Formats. Addressing
Modes,
RISC.
Input/
Output:
Peripheral
Devices.
Necessity
of
Interfacing.Asynchronours function of I/0 and I/O bus, Modes of I/O Transfer.10L
UNIT V:
Introduction to memory unit, Memory Hierarchy, Main Memory, Auxiliary Memory,
Cache Memory, Virtual, Memory,Memory Management Hardware.M.J.Flynn’s
Classification of Computer Systems, Parallel Processing, Pipelining, Arithmetic
Pipelining.
10L
Text Books:
 Mano, M.M., Computer System Architecture, Prentice Hall of India, 1983.
 Hayes, Computer Architecture and Organization, McGraw Hill International
Edition.
 William Stallings, Computer Organization & Architecture, PHI
References:
 Langholz, G., Grancioni, J., and Kandel, A.L., Elements of Computer
Organization, Prentice Hall International, 1988.
 Assembler, Manual for the Chosen Machine.
 Gear, C. W., Computer Organization and Programming, McGraw Hill, 1975.
 Tanenbaum, A.S., Structured Computer Organization, Prentice Hall of India.
 Dr.Madhulika Jain, VineetaPillai&Satish Jain, Computer Organization and
Architecrure.
30
Data Structure & Algorithm: IT 302
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Abstract Data Types (ADT); List ADT – array-based implementation, linked list
implementation, cursor-based linked lists, doubly-linked lists; applications of lists –
Stack ADT, Queue ADT , circular queue implementation; Applications of stacks and
queues.
12L
UNIT II:
Need for non-linear structures; Tree ADT – tree traversal techniques – Pre-Order, InOrder and Post-Order; Representation of trees – Array, Linked-list, leftmost child,
right sibling representations; Binary Tree – Huffmann Coding, Expression trees,
Prefix, Infix and Postfix notations; binary search tree ADT, Applications of trees. 12L
UNIT III:
Definitions – Directed and Undirected Graphs; Graph traversals – Depth First Search,
Breadth First Dearch; Shortest Path Algorithms; Minimum Spanning Tree;
Connectivity, Biconnectivity; Applications of graphs.
12L
UNIT IV:
Internal sorting methods; Simple Sorting Schemes – Bubble, Insertion, Selection;
Quicksort; Heapsort; Binsort; Analysis of sorting algorithms – Best case, worst case,
average case..
12L
UNIT V:
Searching in Linear, Tree and Graph – Analysis & Complexities, Program Case
Study: Prim's and Kruskal's algorithms implementation.
12L
Text Book:
 Aho, J.E. Hopcroft, and J.D.Ullman, “ Data Structures and Algorithm”,
Pearson Education, 1983
References :
 Yashavant Kanetkar, Data Structures through C, BPB Publications.
 R. F. Gilberg, B. A. Forouzan, “Data Structures: A Pseudocode approach with
C”, Second Edition, Thomson India Edition, 2005.
 Sara Baase and A. Van Gelder, “Computer Algorithms”, Third Edition,
Pearson Education, 2000.
 M. A. Weiss, “Data Structures and Algorithm Analysis in C”, Pearson
Education Asia, 2002
31
Data Structure and Algorithm Laboratory: IT 391
Credits: 2(3P)
Total Hours: 45
Full Marks: 50 (Sessional: 25 Marks, End Semester Examination: 25 Marks)
(Mark distribution : 15 practical, 5-viva voce, 5-report/record book)
List of practicals to be done in the DSA Lab. Programming may be done using C/
C++. (The teacher in-charge may select suitable list based on the convenience)
1.
2.
3.
4.
Finding simple interest for a given Principal, Time and rate of Interest.
Finding sum, average, maximum and maximum in an integer array.
Searching and insertion of element in integer array.
Implementation of different sorting techniques in integer array.
n
i2  i N 2
5. Program to calculate series e.g., 
,  (n  2n  10) etc
i!
n 0
i 1
6. Construction of Graph using 2-D array for directed and undirected, weighted
and unweighted graphs.
7. Implementation of minimum spanning tree in a given graph.
8. Construction of binary tree using linked list ADT.
9. Implementation of Depth First Search in binary tree.
10. Implementation of Breadth First Search in binary tree.
11. Preorder Tree Traversal technique.
12. Inorder Tree Traversal technique.
13. Postorder Tree Traversal technique.
14. Conversion of infix to postfix expression.
15. Evaluation of postfix expression.
16. Finding shortest path in a given graph.
32
Digital Design Laboratory: EC 391
Credits: 2(3P)
Total Hours: 45
Full Marks: 50 (Sessional: 25 Marks, End Semester Examination: 25 Marks)
(Mark distribution : 15 practical, 5-viva voce, 5-report/record book)
List of Experiments:
1. Design & Realization of basic gates using Universal logic gates
2. Design & Realization a circuit from 4-bit BCD code to Excess-3 code & viceversa
3. Design & Realization a circuit from BCD code to Gray code & vice-versa
4. Design & Realization of a simple Decoder Circuit
5. Design & Realization Multiplexer and De-Multiplexer circuits
6. Design & Realization of BCD to 7- Segment Decoder
7. Design & Realization of Half Adder & Full Adder circuits using Universal
logic gates
8. Design & Realization of Half Subtractor & Full Subtractor circuits using
Universal logic gates
9. Design & Realization of 4-bit parity generator & comparator circuits
10. Design & Realization of RS & JK flip-flops using Universal logic gates
11. Design & Realization of D & T flip-flops using Universal logic gates
12. Design & Realization of Asynchronous & Synchronous Up/Down counter
13. Design & Realization of Ring counter & Johnson’s counter
14. Design & Realization of a Shift Register circuit
33
Electronics Devices and Circuits Laboratory: EC 392
Credits: 2(3P)
Total Hours: 45
Full Marks: 50 (Sessional: 25 Marks, End Semester Examination: 25 Marks)
(Mark distribution : 15 practical, 5-viva voce, 5-report/record book)
List of Experiments:
1.
Familiarization with components such as Resistors, Capacitors,
Diodes, Transistors, FET’s, Op-Amps, DC Power supply, Multimeter,
CRO etc.
2.
Study on V-I characteristics of Junction Diode.
3.
Study on V-I characteristics of Zener Diode.
4.
Study on Half Wave and Full Wave rectifiers.
5.
Study of CB, CE characteristics of BJT.
6.
Study of fixed base bias BJT circuit and determination of operating
point.
7.
Study of collector to base bias BJT circuit and determination of
operating point.
8.
Study of Emitter resistance bias BJT circuit and determination of
operating point.
9.
Study of self bias circuit bias BJT circuit and determination of
operating point.
10.
Study of VI characteristics of Field Effect Transistors.
11.
Study of feedback circuit.
12.
Study of Wien bridge oscillator.
13.
Study of RC phase shift Oscillator Circuit.
14.
Study of LC oscillator circuit.
34
Microprocessors: EC 401
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Evolution of microprocessors, important features, Applications.
Register
Arithmetic and Logic Unit, Interface section, Timing and Control section.
section,
10L
UNIT II:
MPU Block Diagram, Pin Description, Generating Control Signals, Demultiplexing,
Address / Data Bus, Bus Buffering, 8085 Instruction and Timing process.
10 L
UNIT III:
Data Transfer, Arithmetic and Logic-operation, Branching, Stack and subroutines,
Input and Output, Problems using Instruction set. The Address Map, Address
Decoding Techniques, Memory Interfacing, Design of I/O Ports using MSI and PPI,
Keyboard and Display Interfacing, DAC and ADC Interfacing Technique.
15L
UNIT IV:
Introduction Synchronous & Asynchronous transfer, Interrupt Driven data transfer,
DMA Transfer. 8085 interrupts, multiple interrupts, Enabling & Masking Interrupts,
Device Polling.
10 L
UNIT V:
8086 and architecture, segmented memory has cycles, read/write cycle in min/max
mode. Reset operation, wait state, Halt state, Hold state, Lock operation, and
interrupt processing, Addressing modes and their features, Introduction to
Programming. Brief overview of some other microprocessors (eg. 6800
Microprocessor).
15 L
Text Books:
 Ramesh S. Gaonkar, Microprocessor architecture, programming and
applications with 8085/8085A, Wiley eastern Ltd.
 B.Ram, Fundamental of Microprocessor and Microcomputers, Dhanpat Rai
andSons
References:
 Intel Corp: The 8085 / 8085A. Microprocessor Book – Intel marketing
communication, Wiley inter science publications.
 Adam Osborne and J. Kane, An introduction to micro computers Vol. 2 –
some real Microprocessor, Galgotia Book Source, New Delhi
 Ray and Bhurchandi, Advanced Microprocessors, TMH
 Intel Corp. Micro Controller Handbook – Intel Publications.
 Douglas V. Hall, Microprocessors and Interfacing, MGH International Ed.
 Alan R. Miller, Assembly Language Programming the IBM PC, Subex Inc.
35
Mathematics-IV : AM 401
Credits: 4 (3L, 1T)
Total hrs: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Grammar and Predicate calculus: Formal language-Syntax, Semantics and Grammar.
Predicate calculus -definition of well formed formula (WFF), connectives.
Quantification examples and properties of WFF into Causal form. Resolution and
refutation, answer extraction and simple examples.
12L
UNIT II:
Elementary configurations -Permutations and Combinations, Generating functions,
Principle of inclusion and exclusion (statement only), Partitions and Compositions,
Lexicographical and Fike's orderings of permutations. .Algorithms for
Lexicographical, Reverse Lexicographical and Fike ' s ordering of permutation.
Search Procedure: Back tracking, Branch and Bound techniques, Applications to
classical Assignment Problem, Hungarian method.
12L
Unit III:
Solution of algebraic and transcendental equations using method of ordinary
iteration.Regula Falsi and Newton Rapson’s method, Simple example. Interpolation
and applications: finite difference, Divided differences, Newton -Gregory and
Lagrange's interpolation formulae, Numerical differentiation.
12L
UNIT IV
Numerical integration: Trapezoidal rule, Simpson's one third and three eighth rule,
Solution of systems of linear equation: Jacobi, Gauss -Seidal and relaxation methods,
Solution of tridiagonal systems. Eigenvalues and eigenvectors of matrices and
elementary properties, computation of largest eigen value by power method.
12L
UNIT V
Numerical solution of initial value problems in ordinary differential equations by
Taylor series method, Picard's method, Euler's method, Modified Euler's method,
Runge Kutta second and fourth order method, Millne's Predictor and Corrector
method.
12L
Text Books:
 B.S. Grewal, Higher Engineering Mathematics
 S.S. Sastry, Introductory methods of numerical analysis
 E.S. Page and L.B. Wilson, An introduction of computational combinatories
 N. J. Nilson, Principles of Artificial Intelligence
36

J .P. Trembly and R. Manohar, Discrete Mathematical Structure and
applications to computer science.
References:
 C.L. Liu, Elements of discrete Mathematics.
 Stephen A. Wita1a, Discrete mathematics.
 Ervin Kreyszig, Advance Engineering Mathematics
37
Software Engineering : IT-401
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Introduction of Software Engineering, Software Development Life-cycle
Requirements analysis, software design, coding, testing, maintenance, etc.
10L
UNIT II:
Software Requirements Specification, Waterfall model, prototyping, interactive
enhancement, spiral model, Role of Management in software development, Role of
metrics and measurement, Problem analysis, requirement specification, validation,
metrics, monitoring and control.
15L
UNIT III:
System Design: Problem partitioning, abstraction, top-down and bottom-up design,
Structured approach, Functional versus object-oriented approach, design specification
and verification metrics, monitoring and control.
10L
UNIT IV:
Coding: Top-down and bottom-up, structured programming, information hiding,
programming style and internal documentation, Verification, metrics, monitoring and
control.
Testing: Levels of testing, functional testing, structural testing, test plane, test cases
specification reliability assessment.
15L
UNIT V:
Software Project Management: Cost estimation, Project scheduling, Staffing,
Software configuration management, Quality assurance, Project Monitoring, Risk
Management, etc.
10L
Text Books:
 Jalote Pankaj, Integrated Approach to Software Engineering, Narosa, 1993.
 Pressman, R., Software Engineering A Practitioner’s Approach, Fourth
Edition, McGraw Hill 1997.
References:
 Rumbaugh, J. Blaha, M. Premeralani, W. Eddy F. and Lorensen, W., ObjectOriented Modelling and Design, Prentice Hall of India, 1991, (Reprinted
1997).
 Ghezzi, C. Jazayeri M. and Mandrioli, D., Fundamentals of Software
Engineering, Prentice Hall of India, 1992, (Reprinted 1994).
38
Object-Oriented Programming: IT-402
Credits: 4 (3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Object-oriented paradigm; elements of object oriented programming; Merits and
demerits of OO methodology; C++ fundamentals – data types, operators and
expressions, control flow, arrays, strings, pointers and functions, function
overloading.
10L
UNIT II:
Classes and objects – constructors and destructors, inheritance, pointers, virtual
functions, polymorphism, C++ features: friends, operator overloading.
15L
UNIT III:
I/O Operations: C++ streams – console streams; console stream classes - formatted
and unformatted console I/O operations; File streams classes, file opening modes; file
pointers and manipulations file I/O.
Exception handling
10L
UNIT IV:
Java Introduction: An overview of Java - data types, variables and arrays, operators,
control statements, classes, objects, methods, Inheritance.
12L
UNIT V:
Java Programming: Packages, Interfaces, Exception handling, Multithreaded
programming, Applet programming, Managing Input /Output.
13L
Textbooks:
 Stanley B. Lippman: “C++ Primer” Addison-Wesley Educational Publishers
Inc, 2005
 Ken Arnold, James Gosling, David Holmes “The Java Programming
Language”, Pearson
References:
 Y. Kanetkar, Let Us C++.
 Horowitz & Sahni, Fundamentals of DataStructures, Computer Science Press.
 E. Balagurusamy, “OOP with C++”, TMG
 E. E. Balagurusamy, “Programming with Java – A Primer”, TMG
39
Computer Graphics: IT 403
Credits: 4 (3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Line Generation: Points, lines, Planes, Vectors, Pixels and frame buffers, Vector and
character generation.
Graphics Primitives: Display devices, Primitive operations, Display-file structure,
Display control text.
15L
UNIT II:
Polygons: Polygons representation, Entering polygons, Filling polygons.
Transformations: Metrics Transformations, Transformation routines, Display
procedures.
15L
UNIT III:
Segments: Segments table, Creating, Deleting and renaming a segment Visibility,
Image transformation.
Windowing and Clipping: Viewing transformation, Clipping, Generalised clipping
Multiple windowing.
10L
UNIT IV:
Interaction: Hardware Input device handling algorithms, Event handling Echoing,
Interactive techniques.
Three Dimensions: 3-D Geometry Primitives, Transformations, Projection, Clipping
10L
UNIT V:
Hidden Line and Surfaces: Back-face Removal Algorithms, Hidden line methods.
Rendering and Illumination, Introduction to curve generation, Bezier, Hermite and Bspline algorithms and their Comparisons.
10L
Text Books:
 Rogers, Procedural Elements of Computer Graphics, McGraw Hill.
 Newman & Sproulle., Principles of Interactive Computer Graphics, McGraw
Hill 1987.
References:
 Harringtons S., Computer Graphics A programming Approach, Second
Edition, McGraw Hill 1987.
 Rogers & Adams, Mathematical Elements of Computer Graphics, Second
Edition, McGrawHill.
 Henary Baper, Computer Graphics.
40
Object Oriented Programming Laboratory: IT 491
Credits: 2(3P)
Total Hours: 45
Full Marks: 50 (Sessional: 25 Marks, End Semester Examination: 25 Marks)
(Mark distribution : 15 practical, 5-viva voce, 5-report/record book)
Notes:

Each program takes 2hrs/3hrs for Algorithm design, analysis, coding, compilerun, output produce

Programs 1 to 6 may be done using C++ and the rest may be done using Java
List of Practicals:
1. Program to implement constructor.
2. Program to implement copy constructor.
3. Program to implement function overloading and operator overloading.
4. Program to implement inheritance.
5. Program to implement file stream operations/ IO operations.
6. Program to implement a banking package (e.g. bank which has only
withdrawal and deposit)
7. Program to implement inheritance in Java
8. Program to manage I/O in Java
9. To implement Multithreaded program in Java
10. To implement Java Applet program
41
Microprocessor Laboratory: EC 491
Credits: 2(3P)
Total Hours: 45
Full Marks: 50 (Sessional: 25 Marks, End Semester Examination: 25 Marks)
(Mark distribution : 15 practical, 5-viva voce, 5-report/record book)
List of Experiments:
1.
Familiarization with 8085 register level architecture and trainer kit
components. Study of prewritten programs on trainer kit using the
basic instruction set ( data transfer, Load/Store, Arithmetic, Logical).
2.
Familiarization with 8085 simulator on PC and also Study of
prewritten programs using basic instruction set (data transfer,
Load/Store, Arithmetic, Logical) on the simulator.
3.
Programming using kit/simulator for table look up, Copying a block of
memory, shifting a block of memory.
4.
Programming using kit/simulator for Packing and unpacking of BCD
numbers, Addition of BCD numbers and Binary to ASCII conversion.
5.
Programming using kit/simulator for
Multiplication using Booth’s Algorithm.
6.
Interfacing with ADC.
7.
Interfacing with Speed control of mini DC motor using DAC.
8.
Interfacing with Keyboard.
9.
Interfacing with Multi-digit Display with multiplexing.
10.
Interfacing with Stepper motor.
11.
Interfacing any 8-bit Latch with trainer kit as a peripheral mapped
output port with absolute address decoding.
12.
Program using subroutine calls and IN/OUT instructions using 8255
PPI the trainer kit.
42
String
Matching
and
Linear Integrated Circuits: EC 501
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
The basic operational amplifier and its schematic symbol, Block diagram
representation of op-amp, Power supply requirements of an op-amp, Evolution of opamp, Specification of a typical op-amp (μA-741C), DC and AC gain analysis of μA
741C , Some popular op-amp ICs
10 L
UNIT II:
Input offset voltage, input bias current, input offset current, total output offset voltage,
thermal drift, error voltage, variation of OPAMP parameter with temperature and
supply voltage. Supply voltage rejection ration (SVRR), CMRR-Measurement of OPAMP parameters, Null offset methods, Slew rate, causes of slew rates and its effects
in application
15 L
UNIT III:
Open loop gain of OP-AMP, the Negative feedback configurations - inverting and
non inverting amplifiers, voltage followers and high input impedance configuration,
differential amplifiers, closed loop frequency response and circuit stability, inverting
and non-inverting summing, scaling and averaging amplifiers, voltage to current and
current to voltage converters, integrators and differentiators, logarithmic and
antilogarithmic amplifiers, difference amplifier and instrumentation amplifiers.15 L
UNIT IV:
Advantages of active filters, classification of filters, response characteristics of butter
worth, first order and second order butter worth filters- low pass and high pass types,
Band pass and band reject filters. All pass filters (Phase shifters), Universal filters. 10
L
UNIT V:
Basic comparator and its characteristics, zero crossing detector, voltage limiters,
clippers and clampers, small signal half wave and full wave rectifiers, absolute value
detectors, analog multipliers and square rooter, sample and hold circuit. square wave,
triangular wave and saw tooth wave generators, voltage controlled oscillator, 10 L
Text Books:
 Millman & Halkias, Integrated El;ectronics, Tata McGraw Hill.
 Franco, Design with Operational Amplifiers & Analog Integrated Circuits ,
3/e,TMH
 Gayakwad R.A, OpAmps and Linear IC’s, PHI
 Coughlin and Drisscol, Operational Amplifier and Linear IC – Pearson
Education.
 Millman and Halkias, Integrated Electronics: Analog and Digital circuits and
system Tata McGraw Hill
43
References:
 Malvino, Electronic Principles , 6/e ,TMH
 Millman & Taub, Pulse, Digital & switching waveforms- TMH
 Horowitz & Hill, The Art of Electronics; Cambridge University Press.
 Hayes & Horowitz, Student Manual for The Analog Elect.; Cambridge Univ.
Press.
 Boyle’stead & Nashelsky, Electronic Devices & Circuit theory, PHI.
 Millman & Halkias, Basic Electronic Principles; TMH.
 Tushar Jadhab, Linear Integrated Circuits, Everest Publishing House
44
Operating Systems: IT 501
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Introduction of Operating System objective and function. The Evaluation of
Operating Systems. Batch, interactive, time-sharing and real time systems. Protection.
Operating System Structure: System components, operating system service, System
structure
10L
UNIT II:
Concurrent Processes, Process concept, Principles of concurrency. The
Producer/consumer problem. The critical section problem, Semaphore. Classical
problems in concurrency. Interprocess Communication, Process generation. 10L
UNIT III:
Process Scheduling, CPU Scheduling, Scheduling concepts, Performance criteria,
Scheduling algorithms. Algorithm evaluation, Multiprocessor scheduling. Deadlocks:
System model. Deadlock characterization. Prevention, avoidance and detection.
Recovery from deadlock Combined approach.
10L
UNIT IV:
Memory Management: Base machine, Resident Monitor, Multiprogramming with
fixed partitions. Multiprogramming with variable partitions. Multiple Base Registers.
Paging, segmentation. Paged segmentation, Virtual memory concept, Demand Paging,
Performance, Page Replacement algorithms, Allocation of frames, Thrashing 15L
UNIT V:
I/O Management and Disk Scheduling: I/O devices and the organisation of the I/O
function. I/O Buffering, Disk I/O, Operating system Design issues. File System: File
concept-File organization and Access mechanism, File Directories, File sharing.
Implementation issues.
15L
Text Books:
 Silbersehatz A. and Peterson, J. L. Operating System Concepts, Wiley.
 Milenkovic M., Operating System : Concept & Design, McGraw Hill.
 Stalling, William, Operating Systems, Maxwell McMilan International
Editions, 1992.
References:
 Dietel, H. N., An Introduction to Operating Systems, Addison Wesley.
 Tanenbaum, A. S. Operating System Design & Implementation, PH NJ.
45
Database Management Systems: IT 502
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Introduction to Data Base System Concepts and Architecture, Data models, scheme
and instances, Data independence, Data base language and Interface.
10L
UNIT II:
ER model concepts, Notations for ER diagram, Extended ER model, Relatioships of
higher degree, Relational Data Model and languages, Relational Data Model
Concepts, constraints, relational algebra. Relational calculus, tuple and Domain
calculus, SQL, data definitions queries and updates in SQL, QBE, data definitions,
queries and updates in QBE.
15L
UNIT III:
Example DBMS System (ORACLE) : Basic Architecture, Data definitions, Data
manipulation, Basic Query statements.
10L
UNIT IV:
Database Design : Functional Dependencies, Normal forms, First, Second and Third
functional personal normal forms. BCNF, multi-valued dependencies Fourth normal
form, Join dependencies and fifth normal form, Inclusion dependencies, Query
Processing and Optimisation, Algorithms for executing query operations, Heuristics
for query Optimisation.
15L
UNIT V:
Transaction Processing Concepts, Transaction and System Concepts, schedules and
Recoverability, serializability of schedules.
Concurrency Control Techniques: Locking techniques for concurrency control, Time
Stamping and concurrency control.
10L
Text Books:
 Elmasri, Ramex & Shamkant B Navathe, Fundamentals of Data base Systems.
 Date, C. J. An Introduction to Data base System, Vol I, II & III, AddisonWesley.
References:
 Jeffrey D. Ulman, Principles of Data base Systems, Second Edition, Galgotia
 Prakash Naveen, Introduction to Data base Management, Tata McGraw Hill.
46
Principles of Data Communications: IT 503
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
A historical perspective in the development of digital communication. Elements of
digital communication system. Merits and demerits; Chronology of developments;
Prospects and trends;
Digital Signaling:Transmission Line Codes; Differential encoding; psd of digital
signals (viz. UP, P, BP, SP, HDB3, DB). Inter Symbol Interference : Nyquist's Laws;
Spectrum shaping; Optimum pulse shape; Full cosine roll-off; Duo binary.
12L
UNIT II:
Bit error probability; Decoding errors; Error threshold; System comparisons.
Regenerative Repeaters, Error performance; Power saving. Matched filtering:
Impulse response and transfer function; Signal and noise components at the output;
Integrate-dump filter. Analog-to-Digital Conversation : Quantization error; PCM
telephony; Non-uniform quantization; A-Law Compandor; PCM, DM, DPCM, ADM;
Digital Audio; CD.
13L
UNIT III:
Synchronization: Bit sync; Early-late gate sync; Frame sync; Scrambler, Descrambler; Carrier Sync -PLL. Multiplexing: Synchronous, Quasi Synchronous and
Asynchronous multiplexers.
10L
UNIT IV:
Parity check; Hamming distance; ARQ and FEC systems; Flow control; Cyclic
redundancy check; Coders and decoders for linear block codes; Cyclic codes &
Convolutional codes.
10L
UNIT V:
Modulation:BPSK, DPSK. BFSK, MARY-PSK & -FSK, QPSK, MSK principles,
QASK, Error calculation. Demodulation:Synchronous, Envelope/Non-coherent
schemes; Performance evaluation (BER, SNR, BW) for various schemes.
System Evaluation: Source coding; Entropy Coding; Shanon-Fano-code; Hoffman's
code; Evaluation of digital systems in the light of information theory - Specific
examples.
15L
Text Books:
 Taub & Schilling, Principle of Communication System, Tata McGraw Hill.
 B.P. Lathi, Modern Digital and Analog Comm. System, Oxford University
press.
 Simon Haykin, Communication System, John Wiley & Sons,
 L.W. Couch II, Modern Communication System, Prentice Hall India.
47
References:
 J.G. Proakis, Digital Communications, McGraw Hill.
 J.Das, S.K.Mullick, P.K.Chatterjee, Principle of Digital Comm., Wiley
Eastern Ltd.
 Roden, Analog & Digital Communication Systems, 5e, SPD
 Dungan,Electronics Communication System, Vikas
 Zeimer & Tarnter, Principles of Communication, Jaico
 Rekha, Digital Communications, Scitech
48
Unix And Shell Programming : IT 504
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Overview of UNIX Architectures editors and commands, shell scripts. Data structures
in UNIX kernel, process management, systems calls. The File System, Handling
Ordinary files
15L
UNIT II:
Inter Process Communication: Synchronization in kernel, communication via files,
pipes, ptrace, Basic File Attributes
10L
UNIT III:
The Vi Editor, Customizing the environment. More file attributes, Simple filters.
7L
UNIT IV:
Filters using regular expressions, An Advanced Filter – sed and awk
UNIT V:
Essential Shell Programming
8L
20L
Text Book:
 Sumitabha Das: UNIX – Concepts and Applications, 4th Edition, Tata
McGraw Hill, 2006.

Silberschatz & P. B. Galvin, Operating System Concepts, John Wiley & Sons
(Asia) Pte. Ltd, 2000.
Reference Books:
 Behrouz A. Forouzan and Richard F. Gilberg: UNIX and Shell Programming,
Cengage Learning, 2005.
 M.G. Venkateshmurthy: UNIX & Shell Programming, Pearson Education,
2005.

B. W. Kernighan & R. Pike, The UNIX Programming Environment, PHI,
2000
49
DBMS Laboratory: IT591
Credits: 2(3P)
Total Hours: 45
Full Marks: 50 (Sessional: 25 Marks, End Semester Examination: 25 Marks)
(Mark distribution : 15 practical, 5-viva voce, 5-report/record book)
List of Programs/Experiments:
(Each Program/experiment takes 2 to 3 hrs approx.)
Suggested Package: Oracle 8i/9i, MS SQL Server
1 Creation of tables, creation of tables with constraints and validation checks
2 Select queries with different clauses
3 Nested queries
4 Aggregate and order queries
5 Joining of tables
6 Creating views
7 Update, delete and alter tables
8 Creation of procedures, creation of triggers and cursors, fetching data using cursors
9 Designing and generation of reports based on queries
10 Basic Triggering Programs
11 Basic Transaction Processing Programs
12 Basic database programs (sample database).
Text Books:


Complete Reference: Oracle 8i/9i
Silberschat, Korth & Sudarshan, Database System Concepts
References:
 Complete Guide to MS SQL Server
 C J Date, Introduction to Database Systems
 Navathe & others, Database Systems.
50
Software Development Laboratory: IT 592
Credits: 2(3P)
Total Hours: 45
Full Marks: 50 (Sessional: 25 Marks, End Semester Examination: 25 Marks)
(Mark distribution : 15 practical, 5-viva voce, 5-report/record book)
Students shall do software development on the topics chosen, each student or a group
of students may be assigned the project. During sessional evaluations, students shall
be required to complete milestone of each development life-cycle and presentation
shall be given. The end semester examination shall consist of preparation of software
development documentation, presentation, viva-voce etc and demonstration of
software.
1.
2.
3.
4.
5.
6.
7.
Library Systems.
Banking Systems.
Game.
Text editor
Application Software.
Modules.
Others (Course In-charge may decide the topic of the project in
Group/Individual)
Suggested Package/Language: C/C++/Java/J2EE/VC++/VB/Oracle.
51
Compiler Design and System Software: IT 601
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Compiler Structure: Basics of a Compiler, difference with other converters like Interpreter,
assembler etc. Analysis, Synthesis, Model of Compilation, Various phases of Compiler, Tool
based approach to construct a compiler.
Lexical Analysis: Interface with input, parser and symbol table, Token, lexeme, and patterns.
Difficulties in lexical Analysis, Error reporting, Implementation, Regular definition,
Transistion diagrams.
14L
UNIT II:
Syntax Analysis: CFGs, Ambiguity, Associativity, Precedence, Top down parsing,
transformation on the grammars, predictive parsing, bottom up parsing, LR parsars (SLR, LR,
LALR), YACC.
10L
UNIT III:
Syntax directed Definitions: Inherited and synthesized definitions, attributes, dependency
graphs, Evaluation Order, bottom up and top down evaluation attributes, L-and-S attributed
definitions. Intermediate Code Generation: Intermediate representations, translation of
declarations, assignments, control flow, Boolean expressions, procedure calls.
12L
UNIT IV:
System software and machine architecture – The Simplified Instructional Computer (SIC) Machine architecture - Data and instruction formats - addressing modes - instruction sets - I/O
and programming.
Basic assembler functions - A simple SIC assembler – Assembler algorithm and data
structures - Machine dependent assembler features - Instruction formats and addressing
modes – Program relocation - Machine independent assembler features - Literals – Symboldefining statements – Expressions - One pass assemblers and Multi pass assemblers
12L
UNIT IV:
Basic loader functions - Design of an Absolute Loader – A Simple Bootstrap Loader Machine dependent loader features - Relocation – Program Linking – Algorithm and Data
Structures for Linking Loader. Dynamic Linking.
Basic macro processor functions - Macro Definition and Expansion – Macro Processor
Algorithm and data structures - Machine-independent macroprocessor features Concatenation of Macro Parameters – Generation of Unique Labels – Conditional Macro
Expansion
12L
Text Books:
 Aho, Sethi & Ullman, Compilers Principles, Addision –Wisley.
 Leland L. Beck, “System Software – An Introduction to Systems Programming”, 3rd
Edition, Pearson Education Asia, 2000.
 A C Holub, Compiler Design in C, PHI.
References:
 D.M. Dhamdhere , Systems Programming and Operating Systems, Second Revised
Edition, TMH.
 J.J. Donovan, System Programming, Tata McGraw-Hill.
52
Multimedia Technologies: IT 602
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Introduction of Multimedia, multimedia tools, Audio & Video Response of Human
Organs, Fundamentals of multimedia. Digital Audio: Audio synthesis, FM synthesis,
Digital signal processing.
10L
UNIT II:
Digital video: Fundamentals of picture frame and interlacing, RGB Color
representation, VGA and SVGA standards, display devices-CRT, LCD, Plasma Panel
display, Comparison, Mixing video and graphics, Digital Video Camera, Zooming.
15L
UNIT III:
Digital Video Compression: Compression Models, Lossy Compression, Lossless
Compression, JPEG and Motion JPEG, MPEG 1, MPEG 2, MPEG 4, Compression
Standards.
15L
UNIT IV:
CD Technology: CD production, CD formats, Recording and playback techniques,
Comparison, CD standards, DVD technology, DVD writing technology, Difference
with CD.
10L
UNIT V:
Multimedia transmission: Issues, Properties of Multimedia data, Transmission time,
quality maintenance, Noise reduction, transmission techniques: ISDN, ISDB, OFDM,
COFDM.
10L
Text Books:
 Ranjan Parekh, Principles of Multimedia, Tata McGraw Hill
 Ganzalez & Woods, Digital Image Processing, Pearson.
References:
 Rogers & Adams, The mathematical element of Compuetr Graphics, MGH.
53
Computer Networks: IT 603
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Introduction: Uses of computer network, Network hardware, network software.
Reference models: OSI, TCP/IP, comparison of OSI and TCP reference
model.Concept of data communication, Transmission media, Introduction to Wireless
transmission, The telephone system(PSTN, structure of telephone system, switching
techniques)
10L
UNIT II:
The Data Link Layer : Design issues – services provided to the network layer,
framing, error control, flow control. Error detection and correction-error correcting
codes, error detecting codes. Sliding window protocols – one bit sliding window
protocol, a protocol using Go Back n, a protocol using Selective Repeat.
10L
UNIT III:
The MAC sublayer: Channel allocation, multiple access protocols(ALOHA, carrier,
Carrier Sense Multiple Access Protocols, Collision-free protocols, LimitedContension Protocols), Satellite Networks(Polling, ALOHA, FDM, TDM, CDMA)
10L
UNIT IV:
The network layer: Design issue, routing algorithms (The Optimallity Principle, SPR,
flooding, flow, Distance Vector Routing, Link State Routing, Broadcast Routing,
Multicast Routing) , Congestion control algorithms(The leaky bucket algorithm, token
bucket algorithm, flow specification) Congestion control in virtual circuits, load
shedding , jitter control, congestion control for multicasting, Internetworking, the
network layer in the Internet.
20L
UNIT V:
Transport layer services, elements of transport protocols, internet transport protocolTCP-service model, protocol, segment header, connection management, transmission
policy, congestion control, timer management. UDP
10L
Text Books:
 Tenenbaum, Computer Networks
 Ferozaan, Computer Networks Fundamentals
References:
 Black, Computer Networks.
 Schwartz, Communication Networks.
 Stevens, UNIX Network Programming.
 Douglas, TCP/IP and Internetworking.
54
Wireless & Mobile Networks: IT 604
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Wireless Transmission: Transmission Fundamentals, Frequencies and regulations,
Signals, Antennas and Signal propagation,
Propagation Models, Fading,
Multiplexing, Modulation Techniques, Spread Spectrum modulation(FHSS, DSSS),
CDMA Wireless Link Improvement Technique, Equalization , Diversity, Error
detection, Block Error correction codes, RLP, Convolutional codes.
10L
UNIT II:
Wireless Media Access Control: Motivation, Wireless Issues, FDMA, TDMA,
CDMA, SDMA, Fixed ALOHA, CSMA-CA, MACA, Multiple Accesses with
Collision Avoidance, Packet Radio Access.
Wireless Networking Standards: WLAN: IEEE 802.11 Architecture and services,
802.11 MAC, Physical layer WMAN, Bluetooth, WPAN.
15L
UNIT III:
Cellular Network: Mobile communication concepts, Cellular Architecture: cellular
concepts, frequency allocation, spectrum efficiency, Handoffs in Cellular networks,
Location Management in cellular networks, speech coding, error control coding for
mobile channel, call routing in cellular networks.
10L
UNIT IV:
Mobility Management: MIPv4, MIPv6, Cellular IP, HAWAI, HiMIPv6 protocols
Security Issues in Mobile and wireless networks computing: Security Framework
for Mobile environment.
12L
UNIT V:
Satellite Network: Satellite Parameters and configurations, capacity allocation with
FDM, TDM. Signal and noise calculations.
Other Topics: Introduction to Wireless Sensor networks, MANET, VANET,
Cognitive Radio Network.
13L
Text Books:
 Vijay Kumar Garg “Wireless communications and networking”
 Jochen Schiller “Mobile Communications (2nd Edition) “
 William Stallings “Wireless Communications & Networks (2nd Edition)
55
Theory of Computation: IT 605
Credits: 4 (3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Finite Automata: Basic Notation and terminology, Deterministic and nondeterministic finite automata Transition System, Extension of Transition function,
Accessibility of a String by Finite Automata, Process to minimize no. of states of
DFA, Equivalence of DFA and NFA.
10L
UNIT II:
Regular expression, Two-way finite Automata, Finite automata with output,
properties of Regular sets, pumping lemma, closure properties, My-hill- Nerode
theorem. Moore Machine, Mealy Machine (only definition with example),equivalence
of Moore and Mealy Machines.
Grammar & Language, Context Sensitive Language, Chomsky classification of
Languages, Language and their relation, Conversion of a NDFA to DFA,
Constrcution of Finite Equivalent to a Regular Expression, Pumping Lemma for
Regular Sets and it’s application.
15L
Unit III:
Context free Grammars (CFG): Derivation trees, Elimination of Null and Unit
productions, simplification normal forms. Lemda Productions, Push Down Automata
(PDA): Definitions, Relationship between PDA and context free Languages (CFL)
properties of CFLs properties of CFLs Decision Algorithms.
10L
UNIT IV:
Turing Machine: The Turing machine model, Representation of Turing Machine,
Representation using Transition Diagram, Language Accessibility by Turing
Machines, Computable languages and functions, Modification of Turing machines,
Church’s Hypothesis, Undecidability.
15L
UNIT V:
Advanced Theory of Computation: Properties of recursive and recursively
enumerable languages, Universal Turing machines and an Undecidable problems,
Rice’s Theorem, Rice’s Theorem for recursively enumerable index sets,
Undecidability of Post’s correspondence problem, Introduction to recursive function
theory
10L
Text Books:
 Hopcroft and Ullman, Introduction to Automata theory Languages and
Computation, Narosa.
 Mishra & Chandra Shekaran, Theory of Computer science, Prentice Hall.
References:
 Kohan, Theory of Computer Science.
 Korral, Theory of Computer science.
 Peter Linz, An Introduction to Formal Languages and Automata
56
Multimedia Laboratory: IT-691
Credits: 2(3P)
Total Hours: 45
Full Marks: 50 (Sessional: 25 Marks, End Semester Examination: 25 Marks)
(Mark distribution : 15 practical, 5-viva voce, 5-report/record book)
List of Experiments:
(Suggested Software: Adobe Flash/Adobe Photoshop Autodesk Maya /Autodesk
Maya)
1.
2.
3.
4.
Graphics Design.
3D/2D object modeling, texturing and rendering
Animation.
Sound Operations.
Note : Students may be given Major assignments.
Text Books:
 Adobe Creative Team, Adobe Flash Professional CS5 Classroom In A Book
Pearson
 Todd Palamar, Eric Keller, Mastering Autodesk Maya 2012: Autodesk
Official Training Guide, Wiley India Pvt Ltd
 Boardman, 3DS Max 4 Fundamentals.

Adobe Creative Team, Adobe Photoshop CS5 Classroom In A Book,
Pearson
References:






Dariush Derakhshani , Introducing Autodesk Maya 2012: Autodesk Official
Training Guide, Wiley India Pvt Ltd
Autodesk Maya Press, Learning Autodesk Maya 2008: The Modeling &
Animation Handbook, Autodesk Press
Sham Tickoo, Cadcim Technologies, Autodesk 3ds Max 2011 : A
Comprehensive Guide, Pearson.
Chris Georgenes, Justin Putney, Animation With Scripting For Adobe Flash
Professional CS5 Studio Techniques, Adobe Press
Sue Jenkins , Smashing Photoshop CS5: 100 Professional Techniques
Scott & David, Flash 5 Magic with Action script.
57
Web Technology: IT-701
Credits: 4(3L, 1 T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Introduction and Overview: Motivation for networking, TCP/IP internet, internet
services, History and scope of internet, the internet architecture board, the IAB
reorganization, the internet society, internet request for comments, internet protocol
and standardization, future growth and technology.
4L
UNIT II:
Review of underlying network technologies: Introduction, two approaches of network
communication, Wide area and local area networks, Ethernet technology fiber
distributed data interconnected (FDDI), asynchronous transfer mode(ATM), WAN
technology, ARPANET national science foundation networking. Concepts on DNS,
email, www.
6L
UNIT III:
Basics Of Internet : Client/Server Computing: What is C/S Computing, Middleware,
Fat client VS Fat Servers, N-tiered Software Architecture. Markup Languages And
Their Grammers: SGML, DTD Resouce; HTML, CSS; XML, XSL, Query
Languages for XML W3schools xml validator script .
17L
UNIT IV:
Web Browser: Browser Architecture, Configuration of Netscape and IE Web Server: Apache
Architecture, Web Server Architecture, Server Features, Configuration of Apache and IIS.
Protocols: HTTP, FTP, SMTP, POP; JAVASCRIPT CGI PROGRAMMING JAVA
Overview of Java, JAVA Applet, JAVA Servlet; ASP & JSP Search Engines; Web Database
Connectivity.
18L
UNIT V:
CGI interface to Datatabase, JDBC interface to Database . Web Security: S-HTTP, Fire
Walls, Proxy Servers. Distributed Object Models: CORBA, DCOM, EJB.
15L
Text Books:






Uttom K. Roy “Web Technologies”
D.E Comer “Internetworking with TCP/IP: Principles, protocols and architecture”.
Shelly Powers et al., “Dynamic Web Publishing “, Techmedia, 1998.
Jamie Jaworski, “Java 1.2 Unleashed“, Techmedia, 1998.
Robert Niles et.al., “CGI by Examples”, Que, 1996.
Scot Johnson et.al., ”Using Active Server Pages”, Que,, Information Technology.
58
References:
 Douglas, TCP/IP and Internetworking.
 Tenenbaum, Computer Networks
 Ferozaan, Computer Networks Fundamentals
 Black, Computer Networks.
 Schwartz, Communication Networks.
59
Distributed Algorithms and Systems: IT 702
Credits: 4(3L, 1 T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Introduction to Distributed Systems: Definition, Characterization, Goals, Hardware
and Software Concept;
Protocols: The Model: Transition Systems and Algorithms, Providing properties of
Transition Systems, Casual order of event and logical clocks, Additional assumptions,
Complexity; Communication Protocols: The balanced sliding-window protocol, A
timer-based protocol;
10L
UNIT II:
Routing Algorithms: Destination-based routing, The all-pair shortest-path problem,
The Netchange algorithm, Routing with compact routing tables, Hierarchical Routing;
Deadlock-free packet switching: Introduction, Structured solution, Unstructured
solution, Further issues;
12L
UNIT III:
Fundamental Algorithms: Wave and Traversal Algorithms: Definition and use of
wave algorithms, A collection of wave algorithms, Traversal algorithms, Time
complexity-Depth first search; Election algorithms: Introduction, Ring Networks,
Arbitrary networks, The Korach-Kutten-Moran Algorithm;
10L
UNIT IV:
Termination Detection: Preliminaries, Computation Trees and Forests, Wave-based
solutions, Other solutions;
Communication: Client-server architecture, Remote procedure call, Remote object
invocation, Message oriented communication, Stream oriented communication;
Naming: Naming entities, Name services, Domain name systems, Directory and
Discovery services, Case study of Global Name Service;
15L
UNIT V:
Consistency and Replication: Data-centric consistency models, Client-centric
consistency models, Distribution protocols, Consistency protocols, Casuallyconsistent Lazy Replication, Highly available services;
Fault Tolerance: Fault Tolerance in Distributed Systems; Fault Tolerance in
Asynchronous systems: Impossibility of consensus; Fault Tolerance in Synchronous
systems; Failure Detection; Stabilization;
13L
Text Books:


Distributed Systems: Concepts and Design (3rd Edition), G Coulouris,
Jean Dollimore, Tim Kindberg
Distributed Systems: Principles and Paradigms (2nd Edition) by Andrew
S. Tanenbaum , Maarten Van Steen
60
Network Security: IT 703
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Secured Network: Process to implement secured network, issues related to network
security, basic tools for security, characteristics of Network layer with respect to
security, most sensitive layer of network, Models of secured networks, Design of
network model.
15L
UNIT II:
Threats of Security: Virus attack, Unauthorized Access, Intruders, Remote Accessing,
Emailing threats, Password hacker, hacking software, Cyber Crimes.
10L
UNIT III:
Security related Fault Tolerance: Basic Concepts, Failure Models, Failure Masking by
Redundancy; Process Resilience: Design Issues, Failure Masking and Replication;
Reliable Client-Server Communication: Point-to-Point Communication, RPC
Semantics in the Presence of Failures; Reliable Group Communication: Basic
Reliable-Multicasting Schemes; Distributed Commit: Two-Phase Commit; Recovery:
Check pointing.
15L
UNIT IV:
Tools for Security: Software and Hardware used in Network Security, Antivirus
Software, Malicious virus remover, worm remover, firewall, network filter, Password
checker, Hardware checkpoint, Cyber Law.
10L
UNIT V:
Database Security Over network: Integrity and Security, Domain Constraints;
Referential Integrity; Assertions; Triggers; Authorization; Authentication,
Concurrency control, semaphore.
10L
Text Books:
 Andleih & K Prabhat, Security Engineering: A guide to build dependable
Distributed Systems
 Anderson & Ross, Security Engineering: A guide to build dependable
Distributed Systems.
References:
 Peikari, Chuvakin & Anton, Security Warrior.
 Pfleeger P Charles & Pfleeger Shariawrence Security in Computing.
61
VLSI Design: IT 704
Credits: 4(3L, 1 T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Introduction, Review of MOSFET characteristics, scaling and small-geometry effects,
MOSFET capacitances, MOS current source, current mirror circuits, MOS voltage
source.
6L
UNIT II:
MOS inverters, CMOS inverter, state characteristics, switching characteristics, power
dissipation issues. CMOS logic gates: NAND, NOR, XOR, CMOS logic design of
half and full adders. CMOS transmission gates, pseudo-nMOS, domino logic gates.
Sequential MOS Logic Circuits: The SR latch circuit, clocked latch and flip-flop,
CMOS D-latch and edge-triggered circuits, Schmitt trigger circuit, Comparator,
Dynamic Logic Circuits: Pass transistor logic.
16 L
UNIT III:
Switches: Ideal Voltage Controlled Switches, Bipolar Transistor as a Switch, MOS
Transistor as a Switch, Common Source Amplifier, Differential Amplifier, Two stage
CMOS operational amplifier (OPAMP) design, Cascade OPAMP, Compensation
techniques, VLSI Interconnects: - distributed RC model, transmission line model,
Future inter connect technologies.
16 L
UNIT IV:
Design Methodologies: Full Custom, Standard Cells and Gate Arrays, basics of PAL
& PLA, Programmable Logic Devices (PLD), CPLD and FPGA.
6L
UNIT V:
SPICE: Element lines, Control lines, Command lines, Types of analysis, Models and
model parameters.
Layout: Layout design rules, Layout of inverters, NAND, NOR gates using LASI.
VHDL Syntax: Basic concepts in VHDL and VHDL grammar, Structural
specification, VHDL description of Inverter, NAND gate, Full adder.
16L
Text Books:
 J.M. Rabaey, Digital Integrated Circuits, PHI
 Waste and Eshraghian, VLSI Design.
 Geiger, Allen & Strader, VLSI Design Tech. for Analog & Digital Circuits,
MGH.
 Pucknel, VLSI Design.
 J. Bhaskar, VHDL.
References:
 P.E. Allen and D.R. Holberg, CMOS Analog VLSI Design, OUP.
 Ken Martin, Digital Integrated Circuit Design, OUP
 S.M. Kang and Y. Leblebici, CMOS Digital Integrated Circuits, TMH
 Baker, Li and Boyce, CMOS Circuit Design, Layout and Simulation, PHI
 M.Ismail and T. Fietz, Analog VLSI Signal and Information Processing.
62
Distributed System Programming Using Java: IT 705
Credits: 4(3L, 1 T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I :
JAVA FUNDAMENTALS: Java I/O streaming – filter and pipe streams – Byte Code
interpretation - reflection – Dynamic Reflexive Classes – Threading – Java Native
Interfaces-Swing.
12L
UNIT II :
NETWORK PROGRAMMING IN JAVA: Sockets – secure sockets – custom sockets
– UDP datagrams – multicast sockets – URL classes – Reading Data from the server –
writing data – configuring the connection – Reading the header – telnet application –
Java Messaging services
12L
UNIT III :
APPLICATIONS IN DISTRIBUTED ENVIRONMENT: Remote method Invocation
– activation models – RMI custom sockets – Object Serialization – RMI – IIOP
implementation – CORBA – IDL technology – Naming Services – CORBA
programming Models - JAR file creation
12L
UNIT IV :
MULTI-TIER APPLICATION DEVELOPMENT: Server side programming –
servlets – Java Server Pages - Applet to Applet communication – applet to Servlet
communication - JDBC – Using BLOB and CLOB objects – storing Multimedia data
into databases – Multimedia streaming applications – Java Media Framework. 12L
UNIT V :
ENTERPRISE APPLICATIONS: Server Side Component Architecture – Introduction
to J2EE – Session Beans – Entity Beans – Persistent Entity Beans – Transactions. 12L
Text Books :
 Elliotte Rusty Harold, “Java Network Programming” 3/ed (covers Java 5.0),
O’Reilly publishers

Ed Roman, “Mastering Enterprise Javabeans 3.0”, John Wiley & Sons Inc.

Hortsmann & Cornell, “CORE JAVA 2 ADVANCED FEATURES, VOL II”,
Pearson Education, 2002.
References :

Brian Goetz, David Holmes, Doug Lea, Tim Peierls, Joshua Bloch, Joseph
Bowbeer, Java Concurrency In Practice , Pearson
 Web reference: http://java.sun.com.

Patrick Naughton, “COMPLETE REFERENCE: JAVA 8th Ed”,Tata McGrawHill.
63

Andrew Lee Rubinger, Bill Burke, Richard Monson-haefel,
JavaBeans 3.1 O'reilly Media


Jan Graba, An Introduction To Network Programming With Java, Springer.
Markus Aleksy, Axel Korthaus, Martin Schader , Implementing Distributed
Systems With Java And CORBA, Springer
64
Enterprise
Advanced Network Management: IT 706
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Networking, Client-side networking Server-side networking, HTTP networking,
Datagram networking, Multicast networking.
10L
UNIT II:
Internet Architecture, Addresses, Classify Internet address, Mapping Internet,
addresses to physical addresses, (ARP Determining an Internet address at start-up.
(RARP) Connections Datagram delivery- Routing IP, Datagram, Error and Control,
messages, Class and Subnet address Extensions, Protocol Layering, User, Datagram,
Protocol. Reliable Transport Service.
15L
UNIT III:
Applications, DNS, Telnet, Rlogin, FTP, TFTP, NFS, Email (SMTP, POP, IMAP,
MIME), WWW, (HTTP), Voice and Video user IP (RTP), Internet (SNMP). New
Mobile Protocols, VOIP, Introduction of VSAT.
10L
UNIT IV:
Routing-Cores, Peers and algorithms- Exterior gate way Protocols and autonomous
systems (BGP). Routing in an autonomous system (RIP, OSPF, HELLO)-Internet,
Multi casting, TCP/IP user ATM networks, Mobile IP, private network
interconnection. Client and server Model of interaction socket interface. Boot strap,
and auto configuration.
10L
UNIT V:
Digital Transmission Technology in Corporate Networks: Networking in the 1990’s, Market
size and Time, Windows, Broadband at the Office/Campus level, Broadband at the
Metropolitan - Area level, Existing High speed Dedicated Wan Services, Existing High Speed Switched Wan Services, Engineering High Speed Point to Point fractional DSI/TI
systems - A telephony view, User Perspective of DSI/TI connectivity. Point to Point
fractional DSI/TI systems: FT1 Network Configurations, Channel bit layout, Network
Management issues, FT1 marketplace, equipment & interchange carriers, Cost Considerations
for inclusion of FT1 in private networks, Hubless DDS SWITCHED DSI & its configurations
and SWITCHED FRACTIONAL DSI/TI SYSTEMS, Cost effectiveness issues, Switched 56
service, Inverse Multiplexing, theoretical consideration in general attractiveness of a switched
service.
15L
Text Books:

D.E. Comer, Internetworking with TCP/ IP, Principles, Protocols and
Architectures.
 William Lee, Mobile Cellular Telecommunication, MGH.
References:
 Black U D, Data Communication and Distributed Networks, PHI.
 Tenenbaum, Computer Networks.
65
Parallel Algorithms: IT 707
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Sequential model, need of alternative model, parallel computational models such as
PRAM, LMCC, Hypercube, Cube Connected Cycle, Butterfly, Perfect Shuffle
Computers, Tree model, Pyramid model, Fully Connected model, PRAM-CREW,
EREW models, simulation of one model from another one.
13L
UNITII:
Performance Measures of Parallel Algorithms, speed-up and efficiency of PA, Costoptimality, An example of illustrate Cost- optimal algorithms- such as summation,
Min/Max on various models.
12L
UNIT III:
Parallel Sorting Networks, Parallel Merging Algorithms on CREW/EREW/MCC,
Parallel Sorting Networks on CREW/EREW/MCC/, linear array
10L
UNIT IV:
Parallel Searching Algorithm, Kth element, Kth element in X+Y on PRAM, Parallel
Matrix Transportation and Multiplication Algorithm on PRAM, MCC, Vector-Matrix
Multiplication, Solution of Linear Equation, Root finding.
15L
UNIT V:
Graph Algorithms - Connected Graphs, search and traversal, Combinatorial
Algorithms- Permutation, Combinations, Derrangements.
10L
Textbook:
 M.J. Quinn, “Designing Efficient Algorithms for Parallel Computer”,
McGrawHill.
References:
 S.G. Akl, “Design and Analysis of Parallel Algorithms”
 S.G. Akl, ”Parallel Sorting Algorithm” by Academic Press
66
Design Patterns: IT -708
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT-I:
Patterns – what makes patterns, categories, relationships between patterns,
description, patterns & software architecture; Architectural patterns – introduction,
from mud to structure, layers, pipes & filters, blackboard.
12 L
UNIT-II:
Distributed Systems, broker,
Presentation-abstraction-control.
Interactive
Systems,
Model-view-controller,
12 L
UNIT-III:
Adaptable systems, Microkernel, Reflection, Design patterns – Introduction, structural
decomposition – Whole-Part, Organization of work – Master Slave, Access Control –
Proxy
12 L
UNIT-IV: Design patterns cont – Management-Command Processor, view handler,
Communication – Forwarder-receiver, client-dispatcher-server, publisher-subscriber.
12L
UNIT-V:
Idioms – Introduction, what idioms provide, idioms & style, use of idioms; Future of
patterns – pattern mining, pattern organization & indexing, methods & tools,
formalizing patterns.
12 L
Textbook:
 Gamma E: “Design Patterns”, Pearson
 Frank Buschmann, Regine Meunier et al, “Pattern-Oriented Software
Architecture”, Wiley
References:
 Roger S.Pressman, “Software Engineering: A Practitioner’s Approach”,
McGraw Hill International edition, Sixth edition, 2005.
 Ian Sommerville, “Software Engineering”, 8th Edition, Pearson Education,
2008.
 Stephan Schach, “Software Engineering”, Tata McGraw Hill, 2007
 Pfleeger and Lawrence “Software Engineering: Theory and Practice”, Pearson
Education, second edition, 2001
 Martin Fowler, “Patterns Of Enterprise Application Architecture”, Addisonwesley Professional
67
Embedded System: IT 709
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Overview of Embedded Systems: Introduction, terminologies, Characteristics.
Embedded System Architecture: Processor Examples - ARM, PIC, etc.; features of
digital signal processor.
15L
UNIT II:
SOC: Memory sub-system, bus structure (PC-104, I2C etc.), interfacing protocols
(USB, IRDA etc), testing & debugging, power management.
15L
UNIT III:
Embedded System Software: Program Optimization, Concurrent Programming, Realtime Scheduling and I/O management.
10L
UNIT IV:
Networked Embedded Systems: Special networking protocols (CAN, Bluetooth).
Embedded System Design: Representation tools (UML, task graph, etc.), design space
exploration, hardware-software co-design, testing and verification, dependability
issues.
10L
UNIT V:
Applications of different Embedded Systems. Case Studies
10L
Text Books:
 Vahid Frank, Givargis, Tony, Embedded System Design.
 Heath Steve, Embedded System Design.
References:
 Raj Kamal, Embedded Systems: Architecture, Programming, and Design.
 Prasad, Embedded Systems/Real time Systems.
68
Pervasive Computing : IT 710
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Technology – Past, Present, Future; Application examples – Airline checking &
booking, Car information systems; Device Technology – Hardware, Human-machine
interfaces, Biometrics, trends.
12L
UNIT II:
Device connectivity – Protocols, Security, Device management; Web application
concepts – history, architecture, protocols, transcoding; WAP and beyond –
Components of WAP architecture, infrastructure, security issues, Wireless markup
language, Push Technology, I-Mode.
12L
UNIT III:
Voice Technology – basics, voice standards, speech applications, speech & pervasive
computing, security; PDA – categories, Operating system, standards, characteristics,
software components, mobile applications, PDA browsers.
12L
UNIT IV:
Pervasive Web Application Architectures: Introduction, Scalability and Availability
Issues, Web-enabled Pervasive Computing Application Development Issues and
Mechanisms, Architectural Issues and Choices; User Interface in Pervasive
Computing, Architectures, Implementation of User Interface Architectures. 12L
UNIT V:
Smart Card-based Authentication Mechanisms over the Internet, Applications; Issues
and Mechanisms in WAP-enabling the Pervasive Computing Systems; PDA-based
Access Architectures; Voice-based Access Architectures: Implementation Issues;
Wearable Computing Architectures.
12L
Textbook:
 Jochen Burkhardt, “Pervasive Computing: Technology and Architecture of
Mobile Internet Applications”, Addison-Wesley Professional; 3rd edition,
2007
References:
 Jochen Schiller, “Mobile Communications”, PHI, Second Edition, 2003.
 Frank Adelstein, Sandeep KS Gupta, Golden Richard, “Fundamentals of
Mobile and Pervasive Computing”, McGraw-Hill 2005
 Debashis Saha, “Networking Infrastructure for Pervasive Computing:
Enabling Technologies”, Kluwer Academic Publisher, Springer; First edition,
2002
 “Introduction to Wireless and Mobile Systems” by Agrawal and Zeng,
Brooks/ Cole (Thomson Learning), First edition, 2002
69
Digital Image Processing : 711
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Enhancement, restoration, Image analysis and reconstruction, image data
compression, two dimensional systems, linear systems and shift invariance, Fourier
transform, Z-transform, Block matrices and Kronecker products, Random signals.10L
UNIT II:
Introduction, light, luminance, brightness and contrast, MTF of the visual system,
visibility, function, monochrome vision models, color matching and reproduction,
color vision Model, Image sampling and quantization, two dimensional sampling
theory, reconstruction of images from its samples, Nyquist rate, aliasing, sampling
theorem, Practical limits in sampling reconstruction, Image & visual quantization.15L
UNIT III:
Two dimensional orthogonal and unitary transforms, properties of unitary transforms,
one dimensional DFT, cosine, sine Harmed and Haar transforms.
10L
UNIT IV:
Point operations, contrast stretching, clipping and thresholding, digital negative
intensity level slicing, bit extraction, Histogram modeling, histogram equalization,
modification, spatial operations, smoothing techniques, Magnificent and interpolation,
Transform Operations, Color image enhancement.
15L
UNIT V:
Spatial feature extraction, transform features, Edge detection, gradient operators,
compass operators, stochastic gradients, line and spot detection.
10L
Text Books:
 Jain Anil K, Fundamentals of Digital Image Processing , Prentice Hall
 Gonzalez Rafel C & Wintz Paul, Digital Image Processing , Addison Wesley
References:
 Rosenfield Azriel & Kak Avinash, Digital Image Processing , Academic
Press.
 Pratt William K, Digital Image Processing, John Wiley and Sons.
70
Service Oriented Architecture : IT 712
Credits: 4(3L, 1 T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I
The goal of loose coupling-Web services overview-Introducing Service oriented
Architecture: Enterprise architecture-The service oriented architecture
12L
UNIT II
EAI-web services in portals and software development-managing the supply chainBuilding hubs-Partner to Partner-Government and scientific SOA
12L
UNIT III
Goal of the real time enterprise-Delivering real time with the SOA –Real time virtual
data warehouse-business level agreements. SECURITY: Risk of loose coupling-layers
of SOA security-Solutions to SOA security
12L
UNIT IV
Problems in the unmanaged SOA-web services management solutions-Managing the
SOA network-Securing the SOA network and solutions-SOA network managementUtility computing in the SOA
12L
UNIT V
Exploring an SOA for titan-achieving consensus at titan-Grouping for SOA Training
ESTABLISHING PRACTICE, PLAN AND PROCEED: Services discovery-Service
creation-Selecting a platform-Forming an SOA plan and proceed
12L
Text Books :
 Eric Pulier,Hugh Taylor, “ Understanding Enterprise SOA”, Dreamtech press,
 Greg Lomow, Eric Newcomer, “Understanding SOA with Web Services”,
Pearson Education
References :
 Dan Woods, Thomas Mattern, “Enterprise SOA: Designing it for Business
Innovation”, Shroff publishers.
 Chris Peiris and Dennis Mulder, ”Pro WCF Practical Microsoft SOA
implementation”, Apress, Berkeley, CA, USA.
 Martin Fowler, “Patterns Of Enterprise Application Architecture”, Addisonwesley Professional
71
Advanced Communication Technology: IT 713
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Introduction: Present trend and scope. Network preliminaries: Examples of networks;
Capacity assignment in network; Capacity assignment in distributed networks; Centralized
networks; Time delay - cost trade-offs. Elements of Queuing theory - Infinite buffer; Poisson
arrivals; Exponential service times; General service time distribution; Priority queuing; Multiuser queues.
15L
UNIT II:
Concentration and buffering in store-and-forward network - Concentration; Finite buffers;
Dynamic buffering; Block storage. Routing and flow control - Deterministic techniques;
Stochastic routing; Adaptive routing; Optimal routing; Congestion control in networks.10L
UNIT III:
Global Control. Networking: Local area and wide area networking - Characteristics;
Capabilities; Applications. Different networking standards; ARCNET; ETHERNET;
THINNET; THICKNET; 10 base T/100 base T. Concept of structured cabling networking;
Concept of wireless networking; Wireless LAN. Network operating systems.
15L
UNIT IV:
Gateways; ISDN; VSATs; PDNs, Networking products - Ethernet cards; Bridges; Routers.
Internetworking protocols - TCP/IP, SNA, X.25, X.400 etc. Internet; e-mail; World Wide
Web; Space division and Time division switching. Broadband Technology: Fiber optic links
and systems; Broadband ISDN; Asynchronous transmission medium; Video compression.
Multimedia Communications: Concept of multimedia and its uses; Video on demand; Voice
mail; Virtual reality.
10L
UNIT V:
Mobile Communications: Cellular mobile systems; Co-channel interference reduction;
Switching and Traffic; Intelligent call concepts; Intelligent network communication; Mobile
satellite communications; Wireless local loop; Satellite PCS; Third generation mobile
systems.
10L
Text Books:
 Henderson, Communication & Broadcasting.
 Tanenbaum, Computer Networks.
References:


Talukder, Yavagal, Mobile Computing.
Akhtar, Zheng, Networks for Computer Scientists and Engineers.
72
Genetic Algorithms: IT 714
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Introduction to Optimization, Binary Genetic Algorithms, Continuous Parameter
Genetic Algorithms, 1D array allele genome.
10L
UNIT II:
Applications of Genetic Algorithms: Danny Hillis' Story and a short Bio, Hillis attack
on sorting networks (host versus parasite), Shell Sort Sequences: A Genetic
Algorithm Approach, Introduction to GALIB.
10L
UNIT III:
Crossover and mutations with respect to Permutations. CA's 1D and 2D Life etc,
Neural Nets and NP Complete problems, Schema with respect to Crossover and
Mutations.
15L
UNIT IV:
Genetic Algorithms with respect to Diophantine Equations, Puzzles and Speciation.
Implement a simple string GA with fitness-proportionate selection, roulette-wheel
sampling.
15L
UNIT V:
Evolving Neural Networks, Evolving Cellular Automata, Analysis of Crossover and
Mutation Strategies, Applications to NP complete problems, Artificial Life. 10L
Text Books:


Randy L. Haupt & Sue Ellen Haupt, Practical Genetic Algorithms.
Matthew Wall, GAlib: A C++ Library of Genetic Algorithm Components.
73
Software Project Management: IT 715
Credits: 4(3L, 1 T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT - I
Introduction, Need for Software Project Management – Software Project versus other
projects – Overview of Project planning
12L
UNIT - II
Introduction, Strategic assessment, Technical Assessment, Cost benefit Analysis,
Cash flow forecasting, Cost benefit Evaluation Techniques Risk Evaluation –
Selection of appropriate project planning.
12L
UNIT III
Objectives of activity planning, Project schedules, Projects and activities, Sequencing
and scheduling activities, Network Planning models –Formulating network models,
Using dummy activities, Identifying critical path, identifying critical activities. Risk
Analysis and Management: Nature of risk, Managing risk, Risk identification, Risk
analysis, reducing the risks, evaluating the risks.
12L
UNIT IV
Problems with over and under estimate, the basis for software estimation, software
estimation Techniques. Expert judgments, Estimating by analogy, Function point
analysis. Resource Allocation: Identifying resource requirements, Scheduling
resources, Monitoring and control, Managing people and organization teams. 12L
UNIT V
Project Management in the Testing phase – Introduction, test scheduling, test types,
issues, management structures for testing, metrics for testing phase, Project
Management in the Management phase – Introduction, activities, management issues,
configuration management, estimating size, effort and people resources, advantages,
metrics
12L
Text Books :
 Bob huges, Mike cotterell, “Software Project Management”, Tata McGraw
Hill, New Delhi, 2002.
 Gopalaswamy Ramesh, “Managing Global Software Projects”, Tata McGraw
Hill, New Delhi, 2006.
References :
 Kamna Malik, Praveen Choudary, “Software Quality, a practitioner’s
Approach”, Tata McGraw Hill, New Delhi, 2008.
 Andrew Stellman, Jennifer Greene, Applied Software Project Management,
O’reilly
74
Fuzzy and Neural Computing: IT 716
Credits: 4(3L, 1 T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Fuzzy Logic : Brief overview of crisp set; Introduction to Fuzzy Logic, The notation
of fuzziness; what, why and when to apply fuzzy set; Classical set To fuzzy Sets,
Propabilities & Fuzzy Sets, Operations on fuzzy sets; Types of Fuzzy Sets, Properties
of Fuzzy Set, Fuzzy numbers, Membership Functions, Extension Principle. 10L
UNIT II:
Relations :Crisp relations, fuzzy relations, operations on fuzzy relations, Fuzzy
Relational Equations, Linguistic Variables.
Fuzzy Arithmetic: Theories & Examples
Approximate reasoning: Different methods of Rule Aggregation , Fuzzy Inference
Rules, Formalization of Fuzzy Conditional Inference.
15L
UNIT III:
Fuzzy logic based control system: Difference with conventional control systems,
fuzzifier, Fuzzy rule base, Defuzzifier, Inference Engine.
Applications of Fuzzy Sets: Selected application on Control and/or Pattern
Recognition.
10L
UNIT IV:
Introduction to Artificial Neural networks: History and inspiration from neuroscience
for the development of artificial neural networks (ANN), Overview of Biological
Neural System, Structure and function of the nerve cell , Mathematical model of
Neurons. ANN Architecture.
Introduction to the learning process: Mc-Culloch Plts model of neuron , Learning
rules, Learning Paradigms ,Supervised, Unsupervised and Reinforcement learning, ,
ANN training Rules.
10L
UNIT V:
The Perceptron Learning Rule: Perceptron Architecture, Perceptron Learning Rule,
Proof of the Perceptron convergence algorithm, Multilayered Perceptron Model ,
Delta Rule, The Back propagation Algorithm with theory & examples, variations on
Backpropagation. Hopfield Network: Model, Pattern Retrieval process, Application to
optimization problems. Learning Networks: Kohonen’s Learning, Competitive
Learning, Hebbian Learning Self organizing networks. Associative learning : Simple
Recall Network. Application of ANN: Neuro Fuzzy Systems
15L
Text Books:


Timothy J. Ross “Fuzzy logic with engineering applications”
Fauset, “Fundamentals of Neural Networks: Architectures, Algorithms and
Applications”
75
Software Testing: IT 717
Credits: 4(3L, 1 T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Perspective of Testing – definition, approaches, testing during development life cycle,
test policy, test planning, categories of defect, configuration management, risk
analysis.
12L
UNIT II:
Levels of testing, acceptance testing, criticality of requirement, special tests –
complexity, GUI, compatibility, security, recovery, installation, error handling,
smoke, sanity, parallel and execution testing.
12L
UNIT III:
Testing and test automation – The V model –Tool support for life-cycle testing – The
promise of test automation, Common problems of test automation – The limitations of
automating software testing, Script Preprocessing, Scripting Techniques
12L
UNIT IV:
Selecting tools - requirements - tool market - tool selection project – tool selection
team - Identifying requirements - Identifying constraints – Identifying tools
availability in market - Evaluating the candidate tools - decision making, Testing
Tools - WinRunner, SilkTest, LoadRunner, JMeter.
12L
UNIT V:
Verification, comparison, automation – comparators, dynamic comparison – postexecution comparison – simple comparison, complex comparison – test sensitivity –
comparing different types of outcomes – comparison filters and guidelines – Testware
Architecture – Automating pre and post processing – Building maintainable tests 12L
Text Books :
 Limaye L G, “Software Testing – Principles, Techniques and Tools”, Tata
Mc- Graw Hill Education Pvt. Ltd., New Delhi, 2009
 Boris Beizer, “Software Testing Techniques”, Dream Tech press, New Delhi,
1990.
 Mark Fewster, Dorothy Graham., "Software Test Automation: Effective Use
of Test Execution Tools", Addison Wesley, New Delhi, 1999.
References :
 William E Perry, “Effective Methods of Software Testing”, John Wiley &
sons, Singapore 2006.
 Roger S Pressman, "Software Engineering – A Practitioner’s Approach", sixth
edition, Tata McGraw Hill, New Delhi, 2006.
 Glenford J Myer, "The Art of Software Testing", second edition, John Wiley
& Sons, Singapore, 2004.
76
Database Application Design: IT 718
Credits: 4(3L, 1 T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Functional Dependencies, Decomposition of Relation Schemes, Normal for Relations
Schemes, Normal Forms for Relations Scheme, Multi valued and other kinds o0f
Dependencies.
10L
UNIT II:
Basic Optimization strategies, Algebraic Manipulation, Optimization of Selections in
System, Exact optimization under weak equivalence.
10L
UNIT III:
Integrity, Integrity Constraints in query-by-example, Security, Security in Query-byexample, Security in Statistical Databases.
10L
UNIT IV:
Basic Concepts, a Simple transaction Model, a Model with Read-and-Write-Only
model, Concurrency for Hierarchical structured items, protecting against crashes,
optimistic concurrency control.
15L
UNIT V:
Fragments of relations, Optimization transmission cost by semi joins, Distributed
concurrency control, the optimistic approach, Management of Deadlocks and crashes.
15L
Text Books:
 Rishe, Database Design Funundamentals, PH Int.
 Ullman, Principles of Database Systems, Galgotia.
References:
 Whittington, Database System Engineering, Oxford.
 Wiederhold, Database Design, MGH.
77
BM-801 : Principles & Practice of Management
Credits: 4 (3L 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I :
Management: Concept, Nature, Importance; Management Vs. Administration,
Management Skills, Levels of Management, Characteristics of Quality Managers.
History of management Thoughts, Theories & Approaches to Management. Business
Ethics and Social Responsibility: Concept, Shift to Ethics, Tools of Ethics. 10 L
UNIT II:
Planning: Nature, Scope, Objectives and Significance of Planning, Types of Planning,
Process of Planning, Barriers to Effective Planning, Planning Premises and
Forecasting, Decision Making.
Organizing: Concept, Organization Theories, forms of Organizational Structure.
Combining Jobs: Departmentation, Spa of Control, Delegation of Authority,
Authority & Responsibility, Organizational Design.
15L
UNIT III:
Staffing: Concept, System Approach, manpower Planning, Job Design, Recruitment
& Selection, Training & Development, Performance Appraisal
Directing: Concept, Direction and Supervision
Motivation: Concept, Motivation and performance, Theories of Motivation,
Approaches for improving Motivation, Pay and Job Performance, Quality of Work
Life, Morale Building.
15L
UNIT IV:
Leadership: The Core of Leadership: Influence, Functions of Leaders, Leadership
Style
Communication: Communication Process, Importance of Communication,
Communication Channels , Barriers to Communication
10L
UNIT V:
Controlling; Concept, Types of Control, Pre requisite of Control. The Quality Concept
Factors affecting Quality, Developing a Quality Control System, Total Quality
Control.
Change and Development: Model for managing Change, Forces for Change, Need for
Change, Alternative Change Techniques.
10L
Text Book:
 Prasad, L.M. Principles & Practices of Management
 Gupta, C.B. “Modern Business Organization”. Mayer Paper Books, New
Delhi
Reference:
 Stoner, Freeman & Gilbert Jr-Management ( Prentice Hall of India, 6th
Edition)
 Koontz- Principles of Management (Tata Mc Graw Hill, 1St Edition 2008)
 Robbins & Coulter- Management (Prentice Hall of India, 8th Edition)
78



Robbins S.P. and Decenzo David A. Fundamentals of Management: Essential
Concept and Application (Pearson Education , 5th Edition)
Hillier Frederick S. and Hiller Mark S. Introduction to Management Science:
A Modeling and Case Studies Approach with Spreadsheets (Tata Mc Graw
Hill , 2nd Edition 2008)
Weihirch Heinz and Koontz Harold- Management: A Global and
Entrepreneurial Perspective (Mc Graw Hill, 12th Edition 2008)
79
Data Warehousing & Data Mining: IT 801
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Data Warehousing : Introduction, definitions, multi-dimensional data model, OLAP
and OLAP engine.
10 L
UNIT II:
Data Mining : Introduction, definitions, KDD vs DM, DBMS vs DM, DM techniques,
issues and challenges, application areas.
10 L
UNIT III
Association rules : Introduction, methods to discover association rules, algorithms.
Clustering techniques : Clustering paradigms, partitioning algorithms, k-medoid
algorithms, hierarchical clustering.
15 L
UNIT IV:
Decision Trees: tree construction principle, decision tree construction algorithm,
presorting.
Web mining: content, structure and usage mining, text mining, image and multimedia
mining.
15 L
UNIT V:
Data mining applications, Additional themes on data mining, Social Impacts of data
mining, Trends in Data mining.
10 L
Text Books :


J. Han and M. Kamber, Morgan Kaufman, “Data Mining : Concepts and
Techniques”, Indian Reprint.
Elmasri, Ramex & Shamkant B Navathe, Fundamentals of Data base Systems.
References :


Arun K. Pujari, “Data Mining Techniques”, University Press 2001
Harry S. Singh, “ Data Warehousing : Concepts, Technologies,
Implementations and Management”, Prentice Hall.
80
Patern Recognition: IT 802
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Introduction to pattern recognition, Pattern recognition system: pattern classification,
preprocessing, segmentation, feature extraction, post processing, feature space,
classifier, learning and adaptation, supervised and unsupervised learning.
10L
UNIT II:
Statistical approach to pattern classification: Bayesian decision theory, priori
probability, posteriori probability, likelihood ratio, continuous features, two category
classification, minimum error rate classification, normal density, univariate density,
multivariate density, Baye's decision for discrete features, missing and noisy features.
15L
UNIT III:
Maximum likelihood estimation: expectation maximization EM, maximum likelihood
estimation, parametric and nonparametric estimation, Hidden Markov Model (HMM).
10L
UNIT IV:
Non-parametric decision-making: K-nearest neighbor classification technique, Parzon
window estimator, adaptive decision boundary, and Fuzzy classification.
10L
UNIT V:
Unsupervised learning and clustering technique for classification: hierarchical
clustering, single linkage algorithm, complete linkage algorithm, partial clustering, Kmeans algorithm.
15L
Text Books:
 B. Chanda, D Dutta Majumder, Digital Image Processing, PHI.
 Gonzalez, Woods, Digital Image Processing, Pearson.
References:
 D Dutta Majumder, S K Pal, Pattern Recognition,PHI
 Foley, Computer Graphics.
81
Mobile Computing: IT 803
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Basics of Mobile Technology, Brief history of Mobile Computing, Terrestrial cellular
telephony: cellular concept, cell cluster, frequency reuse, mobile station (MS), base
station (BS), Mobile switching center (MSC), Different cellular standards, digital
cellular systems, TDMA and CDMA systems, global system for mobile
communication (GSM) standard, GSM network, control function, call setup, call
handling, mobility management.
12L
UNIT II:
Cellular digital packet data (CDPD) system: IP based mobile system, general packet
radio service (GPRS). Switching and Traffic: intelligent cell concepts, intelligent
network communication, and wireless local loop Antennas for cellular systems: multipath and fading in signals, co-channel suppression, and GMSK modulation. 12L
UNIT III:
Satellite mobile communication: Orbital mechanics: GEO, MEO, LEO system,
personal communication system (PCS), satellite PCS, Third generation Mobile
system.
12L
UNIT IV:
Spread spectrum communication: definition, types, process gain, pseudo-random
sequences, direct generation of spread spectrum signals (SSS), frequency hop SSS,
hybrid SSS, Analysis of spread spectrum systems, near and far problem, acquisition
and tracking of SSS.
12L
UNIT V:
Satellite links: direct broadcast satellite receiving system, earth station design, VSAT,
analog and digital transmission of voice and TV signals, bandwidth compression,
principles of FDMA, TDMA, CDMA, SPADE, DMAS, Global positioning system:
basic principles of position fixing with GPS, errors in position fixing, DGPS, WAAS,
GPS application.
12L
Text Books:
 Talukder & Roopa Yavagal, Mobile Computing.
 Jochen Schiller “Mobile Communications”

Black U D, Data Communication and Distributed Networks, PHI
References:
 Comer, Computer Networks and Internets, PH Int.
 Tanenbaum, Computer Networks, PHI.
82
Cryptography: IT 804
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT 1:
Cryptography and cryptanalysis, Aspects of security, Crypt-analytic attacks. Classical
CIPHER SYSTEMS. Introduction, Transposition Ciphers, Substitution Ciphers, The
Hagelin machine, Statistics and cryptanalysis, The Information Theoretical Approach,
The general scheme, The information measure and absolute security, The unicity
distance, Error probability and security, Practical security.
15L
UNIT II:
The DES algorithm, Characteristics of the DES, Alternative descriptions, Analysis of
the DES, The modes of the DES, Future of the DES, IDEA (International Data
Encryption Algorithm). Shift Registers. Stream and Block enciphering, The theory of
finite state machines, shift Registers, Random properties of shift registers sequences,
15L
UNIT III:
The generating function, Crypto analysis of LFSRs, Non-linear shift registers. Public
Key Systems, Introduction, The RSA system, The Knapsack system, Cracking the
Knapsack system, public key systems based on elliptic curves.
10L
UNIT IV:
Protocols, Message integrity with the aid of Hash functions, Entity authentication
with symmetrical algorithm, Message authentication with a message authentication
code (MAC), Message authentication with digital signatures, Zero – knowledge
techniques
10L
UNIT V:
Key Management and Network Security. General aspects of key management, Key
distribution for asymmetrical systems, Key distribution for symmetrical algorithms,
Network security, Fair cryptosystems.
10L
Text Books:


Jan C. A. & Van Der Lubbe, Basic method of cryptography, Cambridge
University press.
Ranjan Bose, Information theory Coding and Cryptography.
References:
 S.Kasana, Complex Variables Theory And Applications, PHI
83
Digital Signal Processing and Applications: IT 805
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Concepts of Signal, Overview of digital signal processing. Time linear system,
Sequences, arbitrary sequences, linear time invariant system, causality, stability.
Difference equation, relation between continuous and discrete system. Classifications
of sequence, recursive and non-recursive system.
10L
UNIT II:
Convolutions, graphical and analytical techniques, overlap and add methods, matrix
method, some examples and solutions of LTI systems, MATLAB examples. 10L
UNIT III:
Definition, relation between Z transform and Fourier transform of a sequence,
properties of Z transform, mapping between S-plane and Z-plane. Unit circle,
convergence and ROC, Inverse z-transform, solution of difference equation using the
one sided Z-transform MATLAB examples.
10L
UNIT IV:
Definition, IDFT Twiddle factor, linear transformation, basic properties, circular
convolution, multiplication of DFT, linear filtering using DFT, filtering of long data
sequences, overlap add and save method. Computation of DFT, FFT, FFT algorithm,
Radix 2 algorithm. Decimation-in-time & decimation-in- frequency algorithm, signal
flow graph, butterflies, Chirp z-transform algorithm, MATLAB examples.
10L
UNIT V:
Principle, structures of all-zero filters. Design of FIR filters, linear phase, windowsrectangular, Berlitt, Hanning, Hamming and Blackman. Design of IIR from analog
filters. Bilinear transformation, Butterworth, Chebyshev, Elliptic filters. Optimization
method of IIR filters. Some example of practical filter design. Computer aided filter
design, MATLAB examples.
10L
Text Books:
 L.R. Rabiner & B.Gold, Theory and Application of Digital Signal Processing,
PHI
 Proakis & Manolakis, DSP, Principles, Algorithms and Applications,
PHI/Pearson
 Chen, Digital Signal Processing, OUP.
References:
 Babu R, Digital Signal Processing , Scitech
 S. Salivahanan et al, Digital Signal Processing, TMH
 S.K.Mitra, Digital Signal Processing - A Computer based approach, TMH
 Xavier,
Digital
Signal
Processing,
S.
Chand.
84
Robotics : IT 806
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Introduction to cognitive science and perception, problem representation through
heuristics, problem reduction, basic heuristic search procedures; Knowledge
representation and knowledge engineering.
10L
UNIT II:
Dimensions of Object, Color differentiation, Gray level images, color Images, Length
estimations, Automated visual inspection, Object recognition & matching.
15L
UNIT III:
Stereo geometry & correspondence, Motion analysis, Optical flow, Robot arm, Robot
sensing, Speech Recognition.
10L
UNIT IV:
Imaging, recognition captured imagery, stereoscopy of images, Application of
computer vision, Bio-medical imaging, Document processing, Optical character
recognition (OCR)
15L
UNIT V:
Inference engines and expert systems; Programming languages for AI; Feedback
control and robot manipulation, robot learning.
10L
Text Books:


Rich & Knight, Artificial Intelligence.
Gonzalez, Digital Image Processing.
References:


Jain, Machine Vision, MGH.
Forsyth, Computer Vision- A modern Approach, Prentice Hall.
85
Cellular & Satellite Communication: IT 807
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Orbital Aspects of Satellites: Orbital mechanics; LEO, MEO and GEO Orbital
elements; Look angle; Orbital perturbations; Orbital effects in communication
systems performance; Launches and Launch vehicles; Mechanics of launching a
geostationary satellite, ELV, STS.
15L
UNIT II:
Spacecraft's: Spacecraft subsystems; TAT & C; AOCS; Power systems; Spacecraft
antennas; Equipment reliability. Satellite Communication Links: Design of satellite
links; Direct Broadcast Satellite receiving systems, Earth station design; VSAT.10L
UNIT III:
Modulation and Multiplexing Techniques for satellite Links: Analog telephone
transmission; Analog TV transmission, Digital transmission of voice and TV;
Bandwidth compression; FM, FDMA and CDMA; SPADE; DAMAS.
10L
UNIT IV:
Global Positioning System: Basic principle of position fixing with GPS; Errors in
position fixing; DGPS; WAAS; GPS applications. Propagation Effects on SatelliteEarth Path: Attenuation; Doppler shift; Faraday rotation and Depolarization;
Scintillation; Multi-path effects; Rain and Ice effects; Alleviating propagation effects.
15L
UNIT V:
Cellular Communication System: Characteristics, Comparison with other system,
Implementation feasibility, User-friendly Cellular systems, Application areas, Issues
in implementation, Present trends.
10L
Text Books:


Tri T. Ha, Digital Satellite Communication, McGraw Hill.
William Lee, Mobile Cellular Telecommunication, MGH.
References:


Singhal, Wireless Application protocol: Writing application for Mobile
Internet.
D. C. Agarwal, Satellite communication, Khanna publishers.
86
Distributed Operating System: IT 808
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Introduction to Network Operating Systems: Structure, Processes, Inter process
Communication - Race Conditions - Critical Sections - Mutual Exclusion - Busy
Waiting - Sleep And Wakeup - Semaphores - Event Counters - Monitors - Message
Passing. Process Scheduling - Round Robin Scheduling - Priority scheduling multiple queues - Shortest Job First - Guaranteed scheduling - Two-level scheduling.
15L
UNIT II:
Introduction to distributed network operating systems - distributed network systems design issues. Client server model, Remote procedure call. Synchronisation in
distributed network systems - clock synchronisation - concurrency control Deadlocks in distributed network systems. Process management - threads - system
models - processor allocation algorithms - distributed network file systems. 10L
UNIT III:
Security in Network OS: Introduction, Attacks, Services and Mechanism, Model for
Inter network Security, Cryptography: Notion of Plain Text, Encryption, Key, Cipher
Text, Decryption and cryptanalysis; Public Key Encryption, digital Signatures and
Authentication.
10L
UNIT IV:
Information Management: Introduction, A Simple File System, General Model of a
File System, Symbolic File System, Basic File System, Access Control Verification,
Logical File System, Physical File System File-System Interface: File Concept,
Access Methods, Directory Structure, Protection, Consistency Semantics File-System
Implementation: File-System Structure, Allocation Methods, Free-Space
Management.
15L
UNIT V:
Network Management in UNIX/LINUX OS.
10L
Text Books:
 Mukesh Singhal, Niranjan G. Shivaratri “Advanced Operating Systems:
Distributed Data Bases And Multiprocessor Systems” Mcgraw-hill Education
 Madnick E., Donovan J., Operating Systems, Tata McGraw Hill, 2001.
 Pradeep K.Sinha, Distributed Operating Systems, Tata McGraw Hill, 1998.
References:


Charles Crowley, Operating systems:A Design Oriented Approach, TMG,
1997.
Garry Nutt, Operating Systems:A Modern perspective, 2nd Ed, Addison W’ley,
2000.
87
Graph Theory: IT 809
Credits: 4(3L, 1T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT I:
Graphs – Introduction – Isomorphism – Sub graphs – Walks, Paths, Circuits –
Connectedness – Components – Euler Graphs – Hamiltonian Paths and Circuits –
Trees – Properties of trees – Distance and Centers in Tree – Rooted and Binary Trees.
12L
UNIT II:
Spanning trees – Fundamental Circuits –Spanning Trees in a Weighted Graph – Cut
Sets – Properties of Cut Set – All Cut Sets – Fundamental Circuits and Cut Sets –
Connectivity and Separability – Network flows – 1-Isomorphism – 2-Isomorphism –
Combinational and Geometric Graphs – Planer Graphs – Different Representation of
a Planer Graph.
15L
UNIT III:
Incidence matrix – Submatrices – Circuit Matrix – Path Matrix – Adjacency Matrix –
Chromatic Number – Chromatic partitioning – Chromatic polynomial - Matching Covering – Four Color Problem – Directed Graphs – Types of Directed Graphs –
Digraphs and Binary Relations – Directed Paths and Connectedness – Euler Graphs –
Adjacency Matrix of a Digraph.
15L
UNIT IV:
Algorithms: Connectedness and Components – Spanning tree – Finding all Spanning
Trees of a Graph –Set of Fundamental Circuits – Cut Vertices and Separability –
Directed Circuits.
10L
UNIT V 9
Algorithms: Shortest Path Algorithm – DFS – Planarity Testing – Isomorphism
8L
Text Books:
 Narsingh Deo, “Graph Theory: With Application to Engineering and
Computer Science”, PHI, 2003
References:
 Ranjan Bose, Information theory Coding and Cryptography.
 R.J. Wilson, “Introduction to Graph Theory”, Fourth Edition, Pearson
Education, 2003.
88
Cloud Computing : IT 810
Credits: 4(3L, 1 T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT – I
Foundation
: Cloud Computing Introduction, Roots of Cloud Computing,
Virtualization and Cloud Computing,
Layers and types of clouds : Infrastructure as a Service, Infrastructure as a Service
Case studies - Amazon Web Services, GoGrid, Rackspace Cloud Servers. Software as
a Service, Case Studies Platform as a Service (PAAS)-Aneka, Google App Engine,
Microsoft Azure. Deployment Models, Desired Features of a cloud, Challenges and
Risks, Migrating into Cloud, Enriching the ‘integration as a service’ paradigm for the
cloud era. Enterprise Cloud Computing Paradigm.
12L
UNIT – II
Infrastructure As A Service(IAAS) : Virtual Machines provisioning and machines
provisioning, The management of virtual machines for cloud infrastructures and
migration services, Enhancing cloud computing using a cluster as a service. Secure
distributed data storage in cloud computing.
12L
UNIT – III
Platform And Software As A Service(PAAS): Aneka- Integration of private and
public clouds, Cometcloud: an autonomic cloud engine, T-Systems’ Cloud-based
solutions for business applications, Workflow Engine for Clouds, Understanding
scientific application for Cloud Environments, The MapReduce programming model
and implementation
12L
UNIT – IV
Monitoring and Management: An architecture for federated cloud computing, SLA
management in cloud computing : A service provider’s perspective, Performance
prediction for High Performance Computing(HPC) on Clouds.
12L
UNIT – V
Application : Best practices in architecting cloud applications in the AWS Cloud,
Massively Multiplayer Online Game hosting on cloud, building content delivery
networks using clouds, Resource cloud MASHUPS,
Security : Cloud Computing Software Security Fundamentals, Cloud Computing
Risks Issues, Cloud Computing Security Challenges, Cloud Computing Security
Architecture, Cloud Computing Life Cycle Issues
12L
Text Books :
 Rajkumar Buyya, James Broberg, Andrzej Goscinski, Cloud Computing:
Principles And Paradigms, John Wiley & Sons
 Ronald L. Krutz, Russell Dean Vines, Cloud Security - A Comprehensive
Guide To Secure Cloud Computing, Wiley India Pvt Ltd
89
References :
 Michael Miller, “ Cloud Computing”, Pearson Education, New Delhi, 2009
 Toby Velte, Anthony Velte, Robert Elsenpeter, Cloud Computing, A Practical
Approach , Tata Mcgraw Hill Education Private Limited
 Kevin Roebuck, Cloud Computing Security: High-Impact Emerging
Technology, Tebbo
 Tiberiu Tajts, Cloud-Computing-Security, Createspace
 Matthias Wissmann, Cloud Computing, Vdm Verlag
90
Grid Computing: IT 811
Credits: 4(3L, 1 T)
Total Hours: 60
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
Internal Mark : 28(Term test) + 8(assignment/presentation) + 4(attendance)
End Semester mark distribution pattern::
Total 8 no. questions: [Q. 1(a-f) 6X2(marks)(compulsory) + (any 4 from Q. 2-8)
X 12(marks) = 60]
UNIT – I
INTRODUCTION: The Grid - Past, Present, Future, A New Infrastructure for 21st
Century Science - The Evolution of the Grid - Grids and Grid Technologies,
Programming models - A Look at a Grid Enabled Server and Parallelization
Techniques – Grid applications
12L
UNIT – II
THE ANATOMY OF THE GRID: The concept of virtual organizations – Grid
architecture – Grid architecture and relationship to other Distributed Technologies –
computational and data Grids, semantic grids
12L
UNIT – III
THE OPEN GRID SERVICES ARCHITECTURE: Grid Management systems,
security, Grid Grid-Enabling software and Grid enabling network services, Data Grid
- Virtualization Services for Data Grids, Peer-to-Peer Grids - Peer-to-Peer Grid
Databases for Web Service Discovery
12L
UNIT – IV
THE OPEN GRID SERVICES INFRASTRUCTURE: Technical details of OSGI
specification, service data concepts, Naming and Change Management
Recommendations – OGSA basic services
12L
UNIT – V
APPLICATION CASE STUDY: Molecular Modeling for Drug Design and Brain
Activity Analysis, Resource management and scheduling, Setting up Grid,
deployment of Grid software and tools, and application execution
12L
Text Books :
 Fran Bermn, Geoffrey Fox, Anthony Hey J.G., “Grid Computing: Making the
Global Infrastructure a Reality”, Wiley,
 Joshy Joseph, Craig Fallenstein, “Grid Computing”, Pearson Education
 Barry Wilkinson, Grid Computing: Techniques And Applications, Chapman
& Hall/crc
References :
 Ian Foster, Carl Kesselman, “The Grid2: Blueprint for a New Computing
Infrastructure”. Morgan Kaufman, New Delhi, 2004
 Ahmar Abbas, “Grid Computing: Practical Guide to Technology and
Applications”, Delmar Thomson Learning, USA, 2004,
91