MZU Computer Engineering Syllabus

Department of
Computer Engineering
School of Engineering & Technology
Mizoram University
Aizawl- 796004
Course Structure & Syllabi for

B. Tech. Computer Engineering
(W.E.F. Aug 2016)
1
School of Engineering and Technology
Department of Computer Engineering (2016 onwards)
B. Tech. Course Structure
BRANCH: Common for B.Tech.(CV and CE) Courses Year: I

Semester: I
Sl. Code No Title L T P Credit Marks
No
1 16AM-101 Mathematics-I 3 1 0 4 100
2 16AP-101 Physics 3 1 0 4 100
3 16EE-101 Basic Electrical Engineering 3 0 0 3 100
4 16CV-101 Environmental Science and 3 0 0 3 100
Engineering
5 16ME-101 Engineering Mechanics 3 1 0 4 100
5 16EE 191 Basic Electrical Engg. Lab 0 0 3 2 100
7 16AP-191 Physics Laboratory 0 0 3 2 100
8 16WR-191 Workshop Practice 0 0 3 2 100
Total 15 2 9 24 800
L = Lecture, T= Tutorial, P = Practical Total Marks = 800

Total contact hours = 15+2+9=26 hrs per week Total Credits = 24
BRANCH : Common for B.Tech(CV and CE) Courses

BRANCH: CE Year: I Semester: II
Sl. Code No Title L T P Credit Marks

No
1 16AM-201 Mathematics-II 3 1 0 4 100
2 16EC-201 Basic Electronics Engineering 3 0 0 3 100
3 16AC-201 Chemistry 3 0 0 3 100
4 16HU-201 Communication Skills 3 0 0 3 100
5 16CE-201 Computer Concepts and Programming 3 0 0 3 100
6 16EC-291 Basic Electronics Lab 0 0 3 2 100
7 16AC-291 Chemistry Laboratory 0 0 3 2 100
8 16ME-291 Engineering graphics 0 0 3 2 100
9 16CE-291 Programming Laboratory 0 0 3 2 100
Total 15 1 12 24 900

2
Branch: CE Year : II Semester :III
Sl Code No Title L T P Credit Marks

No
1 16AM-301 Mathematics III 3 1 0 4 100
2 16EC-301 Digital Electronics & Logic Design 3 1 0 4 100
3 16EC-302 Electronics Devices & Circuits 3 0 0 3 100
4 16CE-301 Computer Architecture & 3 0 0 3 100
Organization
5 16CE-302 Data Structure & Algorithm 3 1 0 4 100
6 16CE-391 Data Structure & Algorithm 0 0 3 2 100
Laboratory
7 16EC-391 Digital Design Laboratory 0 0 3 2 100
8 16EC-392 Electronics Devices & Circuits 0 0 3 2 100
Laboratory
Total 15 3 9 24 800

BRANCH : CE Year : II Semester : IV

No
1 16EC-401 Microprocessors & Microcontrollers 3 1 0 4 100
2 16AM–401 Mathematics IV 3 1 0 4 100
3 16CE-401 Object Oriented Programming 3 1 0 4 100
4 16CE-402 Graph Theory 3 1 0 4 100
5 16CE-403 Design and Analysis of Algorithm 3 1 0 4 100
6 16EC-491 Microprocessor Laboratory 0 0 3 2 100
7 16CE-491 Object Oriented Programming Laboratory 0 0 3 2 100
Total 15 5 6 24 700

Total contact hours = 15+5+6= 26 hrs per week Total Credits = 24
Branch: CE Year : III Semester :V

No
1 16CE-501 Operating System 3 1 0 4 100
2 16CE-502 Theory of Computation 3 1 0 4 100
3 16CE-503 Database Management System 3 1 0 4 100
4 16CE-504 Computer Networks 3 1 0 4 100
5 16CE-505 Principles of Programming language 3 1 0 4 100
6 16CE-591 DBMS Laboratory 0 0 3 2 100
7 16CE-592 Computer Networks Laboratory 0 0 3 2 100
8 16CE-593 Industrial Training* 0 0 3 0 100**
Total 15 5 9 24 700
3
*Industrial Training must be done during summer vacation (between 4th and 5th
Semester) , training duration of minimum 30 days and maximum upto 45 days.
Industrial Training is audit course, The student have to complete the training to
complete the B.Tech Course, but this course have no Credit.
** Not to be counted for CGPA calculation, marks not to be counted, only
Grade should be awarded.
BRANCH : CE Year : III Semester :VI

No
1 16CE-601 UNIX and Shell Programming 3 1 0 4 100
2 16CE-602 Software Engineering 3 0 0 4 100
3 16CE-603 Compiler Design 3 1 0 4 100
4 16CE-604 Computer Graphics 3 1 0 4 100
5 16CE-605 Principles of Data Communication 3 0 0 4 100
6 16CE-691 UNIX and Shell Programming 0 0 3 2 100
Laboratory
7 16CE-692 Computer Graphics Laboratory 0 0 3 2 100
Total 15 3 6 24 700

BRANCH : CE Year : IV Semester: VII

No
1 16CE-701 Artificial Intelligence 3 1 0 4 100
2 16CE-702 Data Mining and Data 3 1 0 4 100
Warehousing
3 16CE-703 Embedded System 3 1 0 4 100
4 16CE-7XX Elective – I 3 1 0 4 100
5 16CE-7XX Elective – II 3 1 0 4 100
6 16CE-791 Mini Project* 0 0 6 4 100
Total 15 5 6 24 600

*Mark distribution (70- Presentation/Demonstration, 20- Viva Voce, 10-
Report) same for both sessional (Internal) and examination
“XX => 04 to 13”
Electives (as approved by the Department):
Code No. Subject

CE-04 Digital Signal Processing
CE-05 Pervasive Computing
CE-06 Distributed and Parallel Computing
4
CE-07 Remote Sensing and GIS
CE-08 Network Securities
CE-09 VLSI Design
CE-10 Applied Probability & Statistics
CE-11 Multimedia Technologies
CE-12 Soft Computing
BRANCH : CE Year : IV Semester :VIII

No
1 16BM-801 Principles and Practice of Management 3 0 0 3 100
2 16CE-8XX Elective – III 3 1 0 4 100
3 16CE-8XX Elective – IV 3 1 0 4 100
4 16CE-85X Open Elective 3 0 0 3 100
5 16CE-891 Project* 0 0 14 10 200
Total 12 2 14 24 600

Total contact hours = 12 +2+14 = 28hrs per week Total Credits = 24
*Project Allotment, literature survey etc. Start from 7th Semester and it will be
submitted in 8th Semester, Mark distribution (140- Presentation/Demonstration,
40- Viva Voce, 20- Report) same for both sessional and examination
“XX => 02 to 11”

Electives (any two approved by the Department):
Code Subject
CE-02 Cryptography
CE-03 Robotics
CE-04 Wireless Communication
CE-05 Internetworking with TCP/IP
CE-06 Natural Language Processing
CE-07 Digital Image Processing
CE-08 Cloud Computing
CE-09 Pattern Recognition
CE-10 Mobile Computing
Open Elective
Code Subject
CE-1 Web Technology
CE-2 GUI Programming with WxWidget
CE-3 Java Programming
CE-4 Optimization technique
CE-5 Grid Computing
Total Credits (Course): 24+24+24+24+24+24+24+24 = 192
Total Marks (Course): 800+900+800+700+700+700+600+600=5800

5
Mathematics- I: 16AM-101
Credits:4 (3L, 1T)

Total Hours: 48
Full Marks: 100 (Internal: 40 Marks, End Semester Examination: 60 Marks)
End semester mark distribution pattern:
Total 8 nos. of questions: {Q. 1 (a-f) 6 x 2(Mark) (Compulsory) + Any four (4) from Q.2-
8 x 12(Marks)} = 60.
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. 10L
UNIT II
Rolle‟s Theorem, mean value theorems, partial differentiation, Euler‟s theorem, total
differential, differentiation of composite and implicit functions. 8L
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. 8L
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. 11L
UNIT V
  
Reduction formulae for sin n x dx, cosn x dx, sin m x cosn x dx. . Evaluation of
 /2  /2  /2
 sin  cos  sin

n n m
x dx, x dx, x cos n xdx where m and n are positive integers. Tracing
0 0 0
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. 11L
Text Books:
1. B.S. Grewal, „Higher Engineering Mathematics‟41/e, Khana Publication, 2010.
2. Shanti Narayan, „Differential Calculus‟. S Chand Publication, 2006.
3. Shanti Narayan, „Integral Calculus‟10/e, S Chand Publication, 1942.
4. Maity and Ghosh, „Differential Calculus‟, New Central Book agency, 2007.
References Books:
1. C.B. Thomas, „Calculus and Analytical Geometry‟9/e,Dorling Kindersley India, 2009
2. N. Piskunov, „Differential and Integral Calculus, Vol. I and Vol. II‟ G.K Publication,
2000.
6
Basic Electrical Engineering: 16EE-101
Credits: 3 (3L)
Total hrs: 36
8 x 12(Marks)} = 60.
UNIT I
D.C. Circuit Analysis & Techniques: Definitions of Electric Circuits and Parameters,
Active and Passive elements, Independent and Dependent sources, Current and Voltage
division principles, KVL, KCL, Nodal, Loop and Mesh circuit analysis, Star-Delta
transformation, Source equivalence and conversion, Network theorems: Superposition,
Thevenin, Norton, Maximum Power Transfer and Reciprocity theorems and their
applications. 10L
UNIT II
AC fundamentals and Circuits: A.C. generation, waveforms, average and RMS values,
Peak factor, Form factor, Complex power, Power factor and Calculations of power in single
phase ac circuits, R-L, R-C and R-L-C circuits.
Resonance: Series and Parallel resonance, Bandwidth Q-factor, and Sharpness of resonance.
Three phase circuit analysis: Star and Delta connected Systems, voltages, current and power
in 3-phase circuits, Measurement of 3-phase power by two wattmeter method (Only balance
load). 10L
UNIT III
Fundamentals of electrical machines: Construction, working principles and characteristics
of DC generators and motors, Construction, working principle, EMF equation and equivalent
circuit of a Single phase transformer, transformer losses, open and short circuit tests on
transformer. 10L
UNIT IV
Electrical Wiring Systems: Introduction, Types of wiring systems, choice of wiring systems,
concepts on earthing and its various methods. 6L
Text Books:
1. Van Valkenburg, „Network Analysis‟, Prentice Hall of lndia, 3rdEdition, 1992.
2. Kamaleshaiah and Naidu, „Introduction to Electrical Engineering‟, Tata McGraw Hill
Pub. Co.
3. W.H. Hayt, J. E. Kimmerly, „Engineering Circuit Analysis‟, McGraw Hill, 5th
Edition, 2000.
4. Charles K. Aleximder & Matthew N. O. Sadiku, „Fundamental of Electric Circuits‟,
Tata McGraw, Hill, 2003.
5. Edward Hughes, „Electrical Technology‟, English Language Book Society
Publication with Longman.
References Books:
1. Joseph A Edminister, „Electric Circuits‟, Mc Graw Hill, 2011.
2. Vincent Del Torro, „Electrical Engineering Technology‟, 2nd Edition, Prentice Hall
of India Pvt. Ltd.
3. I. J. Nagrath, „Basic Electrical Engineering‟, Tata McGraw Hill Pub. Co.
7
Physics : 16AP- 101
Credits: 4 (3L, 1T)

Total Hours: 48
8 x 12(Marks)} = 60.
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.
Newton‟s laws of motion, motion in a uniform field, components of velocity and
acceleration in Cartesian system, Plane polar coordinate system, centripetal
acceleration, Centre of mass and its equation of motion, conservation of energy, linear
and angular momenta, Conservative and non-conservative forces. 12L
UNIT II:
Harmonic oscillations, differential equation and its solution, kinetic and potential
energy, spring and mass system, simple and compound pendulum, Superposition of
waves of the same frequency, 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.
9L
UNIT III:
Wave optics: Huygen‟s principle, Young double slit experiment, Newton‟s rings,
diffraction, single slit diffraction, diffraction grating. Polarization of light.
7L
UNIT IV:
Lattice, unit cell and translation vector, classification of crystals, Bravais lattice,
classification of solids, different types of magnetic materials, hysteresis, various
polarization mechanics in dielectrics and their frequency and temperature dependence,
loss tangent, dielectric loss, dielectric breakdown, High resistivity alloys,
superconductors-properties and applications. 10L
UNIT V:
Spontaneous and Stimulated emission of radiation, Population inversion, Einstein‟s
co-efficients, Optical resonator and condition necessary for active Laser action, Ruby
Laser, He-Ne Laser. Optical Fibers–Core and cladding, total internal reflection,
concept of numerical aperture and acceptance angle. 10L
Text Books:
1. A Beiser, Concepts of Modern Physics, McGraw Hill
2. R Feynman, R Leighton & M Sands, The Feynman Lectures in Physics, Vol. 1,
2 & 3.
3. M Speigel, Outline of Vector Analysis, Schaum Series.
4. C L Arora, Refresher Course in BSc Physics , S Chand and Co.
5. R Feynman, R Leighton and M Sands, The Feynman Lectures in Physics,
Volumes 1,2 & 3.
6. R Murugeshan and Kiruthiga Sivaprasath, Modern Physics, S Chand and Co.
8
Reference Books:
1. N C Rana and P S Joag, Introduction to Classical Mechanics, TMH.
2. D Halliday, R Resnick and J Walker, Fundamentals of Physics, J. Wiley &
Sons.
3. N Subrahmaniam and Brijlal, Textbook of Sound.
4. D.S. Mathur: Elements of Properties of Matter, S. Chand & Co.
5. S. Garg, C.K. Ghosh, S. Gupta: Oscillations and Waves, PHI India Ltd
6. M L Gupta, Radio and Electronics Engineering, Dhanpat Rai & Sons
7. C Kittel, Introduction to Solid State Physics, Wiley & Sons
8. J P Srivastava, Elements of Solid State Physics, Prentice Hall of India.
9. Sze S M, Introduction to Semiconductor Physics.
10. David A Bell, Introduction to Semiconductor Physics.
11. Ghatak A and Tyagarajan N, Introduction to Fiber Optics, Cambridge
University Press.
12. Gerd Keiser, Optical Fiber Communications, MGH.
13. P J Collins and M Hird, Introduction to Liquid Crystals, Taylor and Francis
14. M D Ventra, S Evoy and RJ R Heflin Jr, Introduction to Nanoscale Science
and Technology, Springer.
9
Environmental Science and Engineering: 16CV-101
Credits: 3 (3L)
Total Hours: 36
Internal mark: {28 (Term test) + 8 (Assignment/Presentation) + 4(Attendance)} End semester
mark distribution pattern:
Total 8 nos. of questions: {Q. 1 (a-f) 6 x 2(Mark) (Compulsory) + Any four (4) from Q.2-8
x12(Marks)} = 60.
Objective: Making the students understand and appreciate the unity of life in all its
forms, major causes of environmental degradation and methods of pollution
prevention.
UNIT I Environment & Natural Resources

Definition, scope, importance, need for public, Natural Resources – forest resources –
use, exploitation, deforestation, construction of multipurpose dams – effect on forests,
Water resources – use of surface and subsurface water; effect of floods, drought,
water conflicts, food resources – food problems, advantage and disadvantage of
fertilizers & pesticides, effect on environment, Energy resources – need to develop
renewable energy, land resources – Land degradation, soil erosion, desertification &
case studies. 10 L
Unit II Environmental Pollution
Definition – Causes, pollution effects and control measures of Air, Water, Soil,
Marine, NoiseThermal, Nuclear hazards. Unit operation and processes treatment of
drinking water and domestic wastewater (Overview and Layout only). 8L
Unit III Solid Waste Management

Types and sources of Solid wastes, properties of solid wastes, solid waste
management: overview – Material flow in society – reduction in raw material –
reduction in solid waste – reuse of solid wastes – materials recovery – energy
recovery. 6L
Unit IV Disaster Management
Classification of disaster, Natural disaster scene in the world, geophysical disaster,
Tsunami, Earthquake, Meteorological disaster, Hydrological and Climatological
disaster, Floods and Cyclone,Landslides. Disaster management, Disaster mitigation,
Disaster preparedness, Response to disaster, Recovery from disaster.Disaster
management in India.
6L
Unit V Social Issues and the Environment
Concept of Environmental Impact Assessment (EIA), urban problems related to
energy & sustainable development, water conservation, rain water harvesting,
watershed management.Role of Information Technology, remote sensing and
Geographical Information Systems (GIS) in natural resources management. 6L
Text Books:
1. Rajagopalan, R., (2014). Environmental Studies – from Crisis to Cure. 2nd
edition. Oxford university press.
2. Masters. G.M. Introduction to Environmental Engineering and Sciences
Prentice Hall of India.
3. Daniels and Krishnaswamy, (2010). Environmental studies. Wiley India Pvt
Ltd.
4. Kurian Joseph & R. Nagendran (2004) "Essentials of Environmental Studies",
1st Edition, Pearson Education, 2004.
10
References:
1. Peavy, H.S., D.R. Rowe & T.George, “Environmental Engineering”, New
York: Mc Graw Hill, 1987.
2. Metcalf & Eddy,"Wastewater Engineering: Treatment and Reuse", New Delhi,
Tata McGraw Hill, 2003.
3. Sharma, P. D. Ecology and Environment. Rastogi Publication, Meerut, India.
11
Engineering Mechanics: 16ME-101
Credits: 4 (3L
1T) Total Hours:
48
Internal mark: {28 (Term test) + 8(Assignment/Presentation) + 4(Attendance)}
Total 8 nos. of questions: {Q. 1 (a-f) 6 x 2(Mark) (Compulsory) + Any four (4)
from Q.2-8 x 12(Marks)} = 60.
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,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. Shearing Force and Bending Moment.
10L
UNIT-III
Centroid and Centre of Gravity covering, Centroid of simple figures from first
principle, centroid of composite sections; Centre of Gravity and its
implications; Area moment of inertia- Definition, Moment of inertia of plane
sections from first principles, Theorems of moment of inertia, Moment of inertia
of standard sections and composite sections; Mass moment inertia of circular
plate, Cylinder, Cone, Sphere, Hook. 10L
UNIT IV
Friction, Types of friction, Limiting friction, Laws of Friction, Static and
Dynamic Friction; Motion of Bodies, wedge friction, screw jack & differential
screw jack. 8L
UNIT V:
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.
10L
Text Books:
1. Beer, F.P and Johnson Jr. E.R. “Vector Mechanics for Engineers”, Vol. 1
Statics and Vol. 2, Dynamics, McGraw-Hill International Edition,
(1997).
2. Rajasekaran, S, Sankarasubramanian, G., “Fundamentals of Engineering

Mechanics”, Vikas Publishing House Pvt. Ltd., (2000).
3. Hibbeller, R.C., “Engineering Mechanics”, Vol. 1 Statics, Vol. 2
Dynamics, Pearson Education Asia Pvt. Ltd., (2000).
12
4. Palanichamy, M.S., Nagam, S., “Engineering Mechanics – Statics &
Dynamics”, Tata McGraw-Hill, (2001).
5. Irving H. Shames, “Engineering Mechanics – Statics and Dynamics”, IV
Edition – Pearson Education Asia Pvt. Ltd., (2003).
6. Ashok Gupta, “Interactive Engineering Mechanics – Statics – A Virtual
Tutor (CDROM)”, Pearson Education Asia Pvt., Ltd., (2002).
13
Physics Laboratory: 16AP- 191
Credits: 2(3P)
Total Hours: 36
Full Marks: 100 (Sessional: 50 Marks, End Semester Examination: 50 Marks)
(Mark distribution: 30-practical, 10-viva-voce, 10-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.
11. Determination of the dielectric permittivity of non, polar solids using LCR
meter
12. Determination of the dielectric permittivity of liquids using a dipole meter
13. Determination of band gap of semiconductors
14. Determination of particle size by using He, Ne Laser
15. Determination of Laser parameters
16. Determination of fiber, optical properties ,acceptance angle, power,loss
17. Use CRO for the study of A.C. supply waveform and compare the
frequencies.
18. Determination of wavelength of light by Newton‟s ring method.
14
Workshop Practice: 16WR -191
Credits: 2(3P)
Total Hours: 36
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:
1. Chapman & Arnold, „Workshop Technology‟, Very Low Priced Edition, 2001.
2. Begeman & Amstead, „Manufacturing Process‟8/e, John Wiley, 1987.
References Books:
1. B S Raghubansi, „Workshop Technology‟9/e, Dhanpat rai & sons, 2002.
2. Hajra, Chaudhuri, „Elements of Workshop technology‟Vol-I, Media Promoters &
Publishers, 2009.
3. Khanna , O.P., „Workshop Technology‟, Dhanpat Rai Publications, 2008.
4. S. Crawford, „Basic Engineering Processes‟, Hodder & Stoughton, 1985.
2. S. Gowri and T. Jeyapoovan, “Engineering Practices Lab Manual‟1/e, Vikas
Publishing House Pvt Ltd., 2011.
15
Basic Electrical Laboratory: 16EE- 191
Credits: 2(3P)
Total Hours: 36
1. Characteristics of Tungsten and Carbon filament lamps

2. Characteristics of Fluorescent lamps
(a) Verification of KVL
(b) Verification of KCL
3. Verification of Thevenin‟s theorem.
4. Verification of Norton‟s theorems.
5. Verification of Maximum power theorem.
6. Verification of Superposition theorem
7. Study of R-L-C Series circuit
8. Study of R-L-C parallel circuit
9. Series and Parallel Resonance
10. Measurement of 3-phase Power by two Wattmeter Method for balanced loads
11. Layout of a typical household wiring scheme
16
Mathematics-II: 16AM- 201
Credits: 4(3L, 1T)
Total Hours: 48
End semester mark distribution pattern::
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. 10L
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.
10L
Text Books:
1. E.D. Rainville and P. E. Bedient, „A short course in differential equation‟.
Pearson Higher Education, 1986.
2. Erwin Kreyszig, „Advanced Engineering Mathematics‟. Wiley India Pvt Ltd,
2010.
3. Shanti Narayan, „Differential Calculus‟. S.Chand Publishing, 2006
4. Shanti Narayan, „Analytical solid Geometry‟ S.Chand Publishing, 2005
References Books:
 C.B. Thomas, „Calculus and Analytical Geometry‟. Dorling Kindersley India,
2010.
 N. Piskunov, „Differential and Integral Calculus, Vol. I and Vol. II‟. Cbs
Publisher & Distributors, 2000.
17
Basic Electronics Engineering: 16EC 201
Credits: 3 (3L)
Total hrs: 48
Internal mark {28 (Term test) + 8 (assignment/Presentation) + 4 (Attendance)}
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, carrier
conc. and mobility, drift and diffusion, continuity equation, The Hall Effect. 6L
UNIT II:
P-N junction, Forward and reverse bias, V-I Characteristics, Simple diode circuits, Zener and
avalanche breakdown, load line, linear piecewise model, Capacitance of p-n junction diode,
rectifiers: half wave, full wave, its PIV, DC voltage and current, ripple factor, efficiency
Clipper and Clamper circuits, Zener diode application for voltage regulator, special types of
diodes & their applications. 9L
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. 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). 9L
UNIT IV:
JFET‟s operation, static characteristics IGFET, MOSFET operation, Characteristics,
types, enhancement, depletion mode, CS, CG, CD configuration. Introduction to CMOS and
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. 9L
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. 3L
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.

18
Chemistry: 16AC- 201
Credits: 3 (3L)
Total Hours: 48
8 x 12(Marks)} = 60.
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. 5L
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.
7L
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. 6L
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. 9L
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). 9L
Text Books:
1. G. M. Barrow, „Physical Chemistry‟, 5th Ed., TMH, New Delhi, 2009.
2. V. Walters, J. de Paulo, and Peter Atkins, „Explorations in Physical Chemistry‟,
Oxford,2007
3. Puri, Sharma, and Pathania, „Principle of Physical Chemistry‟, 44th Edition, Vishal
Publishing House, New Delhi, 2008.
4. Hameka, „Chemistry:Fundamentals and Applications‟, Academic Press, 2001
5. Davis, and Berner, „Handbook of Industrial Chemistry (vol. 1 & 2)‟, John,Wiley, 2004.
6. D. A. Skoog, „Principles of Instrumental Analysis‟, 5th Ed., Saunders College Publ, 2003.
7. Parameshwara Murthy, „Textbook of Engineering Chemistry‟, BS Publications, 2009.
8. Walton, „Polymers‟, „Oxford University Press, 2001.
19
References Books:
1. M. Bowker, „The basis and Applications of Heterogeneous Catalysis‟, Oxford
University Press (Oxford Chemistry Primers), 1998.
2. S. Metcalfe, „Chemical Reaction Engineering: First Course‟, Oxford (Oxford
Chemistry Primers), 1997.
3. West Anthony. R, „Solid,state Chemistry and its applications‟, John,Wiley,
2007.
4. Manfred Baerns, „Basic Principles in Applied Catalysis‟, Springer,Verlag
2004.
5. Jones, and S. Wimperis, „NMR: the Tool kit‟, Oxford University Press
(Oxford Chemistry primers)
6. A. K. Brisdon, „Inorganic Spectroscopic methods‟, Oxford University Press
(Oxford Chemistry primers), 2005.
7. W. Clegg, „Crystal Structure Determination‟, Oxford University Press (Oxford
Chemistry primers), 1998.
8. Robinson, „Undergraduate Instrumental Analysis‟6/e, John,Wiley, 2004.
9. James C Gerdeen, et. al., „Engineering Design with polymers and
Composites‟, CRC Press, 2005.
10. James G. Speight, „Handbook of Coal Analysis‟, John, Wiley. April-2005.
20
Computer Concepts and Programming: 16CE- 201
Credits: 3 (3L)
Total Hrs: 36
8 x 12(Marks)} = 60.
UNIT I:
Computer Fundamentals: Generation, Classification, Functional Units. Software
types, Concepts of algorithms, flowcharts 5L
UNIT II:
Introduction to C language – Tokens: constants, variables, keywords, data types, Type
conversion. Operators: Arithmetic, Logic, Hierarchy of Operators. Control Structures:
If, If-Else, While, For, Do-While, Break, Continue, Switch. 7L
UNIT III:
Functions: Concepts, return type, parameter passing, scope and life time of variable,
recursion. Pointers: concepts, pointer and functions, call by value and call by
reference.
6L
UNIT IV:
Array: declaration, initialization, array and function, array and pointer, more than one
dimensional array.
String: concept, string manipulation functions, two dimensional array of character,
pointer and string. 9L
UNIT V:
Structure: Declaration, accessing elements, storage, structure and pointer. Union. File:
opening, read,write,close, file opening modes, binary file, command line argument.
9L
Text Books:
 Yashavant P. Kanetkar, „Let Us C‟11/e, BPB Publications, 2008.
 E.Balaguruswamy, „Programming in ANSI C‟5/e, TMC, 2010
 Byron S. Gottfried, „Programming with C‟2/e, (Schaum's Outlines Series)Mc
Graw Hill, 1996.
References Books:
 Brian W. Kernighan and Dennis Ritchie, „The C Programming Language‟,
2nd Edition, PHI, 1998.
 R. Sethi, „Programming Language‟2/e, Addison Wisely, 2002.
 V. Rajaraman, „Computer Programming in C‟, PHI, 2008.
21
Communication Skills: 16HU-201
Credits: 3(3L)
Total Hours: 48
from Q.2-8 x 12(Marks)} =60.
UNIT I
Principles and Process of communication (coherent communication, barriers, removal
of bottleneck; verbal & non,verbal network of communication).
7L
UNIT II
Grammar: Parts of Speech (Sentence and its structures, subject verd,object formation
of speech & writing, assertive, negative, interrogative and idioms, active, passive
voice etc). 7L
UNIT III
Tense form, agreement /concord 6L
UNIT IV
Phonetics, Stress pattern in English, Speech mechanism & Spoken exercises; Group
discussion & Public speaking, presentation. 8L
UNIT V
Basics of Business letters, drafting: Addressing & concluding.
Report Writing: Types and specimens using hard & software.
8L
Text Books:
1. Leena Sen, „Communication Skills‟, PHI, 2009.
2. Urmila Rai, S.M. Rai, „Managerial Communication‟, Himalaya Publishing
house, 2009.
3. Wren and Martin,‟ English Grammar and Composition‟, S. Chand, 2011.
4. Das, B.K. Samantray, K. et all. „An Introduction to Professional English and
Soft Skills‟, New Delhi: CUP, 2009
5. Bansal, R.K.& Harrison, J. B., „Spoken English [for India]‟, Orient Longman,
2007.
References Books:
1. O‟Connor, J.D., „Better English Pronunciation (Cambridge English Language
Learning) 1981‟, CUP.
2. Vikrant Schgal,‟An Introduction to Phonetics & Linguistics‟, Pointer
Publisher, 2011.
3. Patnaik, P., „Group Discussion and Interview Skills‟, New Delhi: CUP, 2011.
4. Seeley, John, „Oxford Guide to Effective Writing and Speaking‟, Delhi: OUP,
2000.
5. E-Resources: Website, EnglishClub.com,for Business correspondence, Power
Point Presentation-for professional Communication.
6. Murphy, Raymond, „English Grammar in Use [3rd edn] CUP‟, 2010.
22
Chemistry Laboratory: 16AC-291
Credits: 2(3P)
Total Hours: 36
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.
23
Engineering Graphics: 16ME- 291
Credits: 2(3P)
Total Hrs: 36
(Mark distribution : 30-practical, 10-viva-voce, 10-report/record book/Chart)
UNIT-I
Scales:
Representative factor, plain scales, diagonal scales, scale of chords. Conic
sections: Construction of ellipse, parabola, hyperbola by different methods;
Normal and Tangent.
UNIT- II
Projection:
Types of projection, orthographic projection, first and third angle projection,
Projection of points and lines, Line inclined to one plane, inclined with both the
plane, True Length and True Inclination, Traces of straight lines.
UNIT - III
Projection of planes and solids:
Projection of Planes like circle and polygons in different positions; Projection of
polyhedrons like prisms, pyramids and solids of revolutions like cylinder,
cones in different positions.
UNIT - IV
Section of Solids:
Section of right solids by normal and inclined planes; Intersection of cylinders.
Development of Surfaces: Parallel line and radial ‐ line method for right solids.
UNIT - V
Isometric Projections:
Isometric scale, Isometric axes, Isometric Projection from orthographic
drawing.
Nomography,basic concepts & uses, Computer Aided Drafting (CAD):
Introduction, benefit, software's basic commands of drafting entities like
line, circle, polygon, polyhedron, cylinders; transformations and editing
commands like move, rotate, mirror, array; solution of projection problems
on CAD.
Text Books:
 K. L. Narayana & P Kannaiah, „Engineering Graphics‟, Tata McGraw-Hill, 1988
 V. Luxminarayana & Vaishwanar, „A text Book of Engineering Graphics‟16/e, Jain
Brothers, 2009.
References Books:
 N. D. Bhatt, „Elementary Engineering Graphics‟, Charotar publishing house,
Anand, 2004.
 M. Chandra & Satish Chandra, „Engineering Graphics‟, Narosa Publishing
House, 1998.
24
Note:
Sketching and drawing of geometries and projections based on above

syllabus Term work
To cover above syllabus, Institute must have CAD software and a computer
lab (6 to 12 hrs/month/student).
25
Programming Laboratory: 16CE- 291
Credits: 2(3P)
Total Hours: 36
(Mark distribution: 30-practical, 10-viva-voce, 10- report/record book)
Group A
1. Program to find whether the given number is prime or not.
2. Program to find the factorial of a given integer
3. Program to find the sum of individual digits of a positive integer.
4. Program to find the GCD (greatest common divisor) of two given integers.
5. Program to display first N terms of Fibonacci series.
6. Program to replace lowercase letters by uppercase letters and vice versa in a sentence
7. Program to check whether a string is palindrome or not
8. Program to sort 10 names in alphabetical order
9. Write a function(using a pointer parameter) that reverse the elements of a given array
10. Program to display contents of a file
Group B
1. Program to find output all the roots of a given quadratic equation, for non,zero
2. coefficients.
3. Program, which takes two integer operands and one operator from the user,
4. performs the operation and then prints the result. (Consider the operators +,-,*, /, %
and use Switch Statement)
5. Program to generate all the prime numbers between 1 and n, where n is a
6. value supplied by the user.
7. Program to find both the largest and smallest number in a list of integers.
8. Program to calculate the following Sum:
9. Sum=1,x2/2! +x4/4!,x6/6!+x8/8!,x10/10!
10. 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
11. Program to multiply two matrices
12. Program which copies one file to another file.
13. Program to count the number of characters, tabs, spces, number of lines in a file
14. 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
(assume F.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)
26
Basic Electronics Laboratory: 16EC-291
Credits: 2(3P)
Total Hours: 36
(Mark distribution : 30- practical, 10- viva-voce, 10- report/record book)
1. Familiarization with components such as Resistors, Capacitors,

Diodes, Transistors, FET‟s, Op-Amps.
2. Familiarization with DC Power supply, Multimeter, etc.
3. Familiarization with CRO for different electrical measurements.
4. Familiarization with Bread Board and Soldering practice.
5. Study on V-I characteristics of Junction Diode.
6. Study on V-I characteristics of Zener Diode.
7. Study on Half Wave and Full Wave rectifiers.
8. Study of CB, CE characteristics of BJT.
9. Study of Clipper and Clamper Circuit using Junction Diode.
10. Study of Voltage regulator Circuit using Zener Diode.
27
Mathematics-III: 16AM-301
Credits: 4(3L, 1T)
Total Hours: 48
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. 12L
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. 8L
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 8L
Text Books:
 R. V. Churchill and J. W. Brown, “Complex variables and applications”, 3/e,
MGH, 1974.
 B.S. Grewal, “Higher Engineering Mathematics”, 41/e, Khanna Publishers,
2010.
 I.N. Herstein, “Topics in algebra”, 2/e, John Wiley & Sons, 2006.
 C.L. Liu, “Elements of discrete mathematics”, 3/e, TMH, 2008.
 Narasingh Deo, “Graph theory with applications to Computer Science”, PHI,
2009
References:
 Stephen A. Witala, ”Discrete mathematics”,MGH, 1987.
 V. Chandra, V. Ghare & J. Moore, “Applications of Graph theory algorithms”,
Elsevier.
28
Digital Electronics and Logic Design: 16EC-301
Credits: 4(3L, 1T)
Total Hours: 48
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.
8L
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. 12L
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:
Bipolar logic families, Unipolar logic families, Characteristics of Digital ICs, DTL,
TTL, ECL, MOS and CMOS, their operation, specifications, Advantages and
Disadvantages. 8L
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.
 Zvi Kohavi, Niraj K. Jha, “ Switching and Automata theory”, Cambridge
university press.
 Nripendra N Biswas,” Logic design Theory”, PHI.
29
Electronic Devices & Circuits: 16EC-302
Credits: 3(3L, 0T)
Total Hours: 36
8 x 12(Marks)} = 60.
UNIT I:
Introduction to Properties of metal semiconductor junctions, Hetero-Junctions,
photovoltaic effect-solar cells, Tunnel diodes, Varactor diodes, Semi conductor
sensors and detectors, High voltage and high power transistors. 5L
UNIT II:
Basics of BJT biasing & stability factor, JFET & MOSFET , MOSFET as an amplifier
and as a switch, LF and HF model, Small signal operation of MOS amplifier. 7L
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, Barkhausen criteria, general form of
Oscillator, configuration, loop gain, Wien-bridge Oscillators, introduction to phase
shift oscillators and crystal Oscillator. 8L
UNIT V:
Silicon controlled Rectifier(SCR): Constructional features, physical
operation,characteristics, applications, Uni-Junction Transistors(UJT):Physical
Operation, Characteristics and simple applications, Concepts of TRIAC,DIAC,
Insulated Gate Bipolar Transistor(IGBT) and GTO 6L
Text Books:
 Millman & Halkias, ”Integrated Electronics”, TMH
 Millman & Grabel, “Micro-Electronics”, MGH
 Neamen, “Semiconductor Physics &devices”, TMH
 Chattopadhyay, Rakshit, Saha & Purkait, “2nd Edn Foundation of
Electronics” New Age International
References:
 Prof. Manis Mukherjee, “Foundation Of Electronics Devices And Circuits”,
EPH.
 Kasap, “Principles of Electronic Materials &devices”, TMH
 Malvino, “Principle of Electronics”, TMH
30
Computer Architecture & Organization: 16CE-301
Credits: 3(3L, 0T)
Total Hours: 36
Total 8 nos. of questions: {Q. 1 (a-f) 6 x 2(Mark) (Compulsory) + Any four (4) from Q.2-8 x
12(Marks)} = 60.
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. 8L
UNIT II:
Machine Language, Assembly Language, Assembler, Program Loops, Subroutines.
Control Unit: Micro-operations, Microinstruction Format, micro-programming,
Control of the processor, Hardwired Implementation. 8L
UNIT III:
Number Systems, Complements, Fixed Point Representation, Floating Point Number
Representation, Addition, Subtraction, Multiplication and Division of Numbers in
different types of Representation 7L
UNIT IV:
General Register Organization, Stack Organization, Instruction Formats. Addressing
Modes, RISC/CISC. Input/ Output: Peripheral Devices. Necessity of Interfacing.
Asynchronous function of I/0 and I/O bus, Modes of I/O Transfer. 7L
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 Parallel Processing system, Pipelining, Arithmetic Pipelining. 6L
Text Books:
 Mano, M.M., “Computer System Architecture”, 3rd Edition,Prentice Hall of India,
2007.
 Hayes, “Computer Architecture and Organization”, 2nd Edition,McGraw Hill
International Edition, 2005
 William Stallings, “Computer Organization & Architecture”, 8th Edition, PHI,
2010
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”, 2nd Edition,
McGraw Hill, 2005.
 Tanenbaum, A.S.,“Structured Computer Organization”,5/e,Prentice Hall of
India, 2009
 Dr.Madhulika Jain, VineetaPillai&Satish Jain, “Computer Organization and
Architecrure”.BPB, 2007
31
Data Structure & Algorithm: 16CE- 302
Credits: 4(3L, 1T)

Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Abstract Data Types (ADT); List – array-based implementation, linked list
implementation, cursor-based linked lists, doubly-linked lists; applications of lists –
Stack, Queue, circular queue implementation; Applications of stacks and
queues. 8L
UNIT II:
Need for non-linear structures; Tree – tree traversal techniques – Pre-Order, In-Order
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, Applications of trees. 10L
UNIT III:
Definitions – Directed and Undirected Graphs; Graph search – Depth First Search,
Breadth First Dearch; Shortest Path Algorithms; Minimum Spanning Tree;
Connectivity, Biconnectivity; Applications of graphs. 10L
UNIT IV:
Internal sorting methods; Simple Sorting Schemes – Bubble, Insertion, Selection;
Quicksort; Heapsort; Binsort; Analysis of sorting algorithms – Best case, worst case,
average case; Linear and binary search, 10L
UNIT V:
Efficiency of Algorithms; Running time of a program – Big Oh, Omega, theta
notation; Solving recurrence equations; Greedy algorithms; Divide & Conquer;
Dynamic Programming; Backtracking; Local Search Algorithms, asymptotic
notations – recurrences – NP-complete problems, 10L
Text Book:
 Aho, J.E. Hopcroft, and J.D.Ullman, „Data Structures and Algorithm‟, Pearson
Education, 1983
 Yashavant Kanetkar, „Data Structures through C‟, 2nd Edition, BPB
Publications, 2008.
 M. A. Weiss, „Data Structures and Algorithm Analysis in C‟,2nd Edition,
Pearson Education Asia, 2006
References Books:
 R. F. Gilberg, B. A. Forouzan, „Data Structures: A Pseudocode approach with
C‟, 2nd Edition, Thomson India Edition, 2005.
 Sara Baase and A. Van Gelder, „Computer Algorithms‟, 3rd Edition,
Pearson Education, 2000.
32
Data Structure and Algorithm Laboratory: 16CE-391
Credits: 2(3P)
Total Hours: 36
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. Finding simple interest for a given Principal, Time and rate of Interest.
2. Finding sum, average, maximum and maximum in an integer array.
3. Searching and insertion of element in integer array.
4. 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 1 i! n 0
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.
33
Digital Design Laboratory: 16EC-391
Credits: 2(3P)
Total Hours: 36
1. Design & Realization of basic gates using Universal logic gates
2. Design & Realization a circuit from 4-bit BCD code to Excess-3 code & vice-
versa
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
34
Electronics Devices and Circuits Laboratory: 16EC-392
Credits: 2(3P)
Total Hours: 36
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.
35
Microprocessors & microcontrollers: 16EC-401
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Evolution of microprocessors & microcontroller, important features & Applications.
RISC & CISC, CPU Architectures, Havard & Von-Neumann CPU architecture.
Intel 8085 µP Block Diagram, Pin Description, Generation of control Signals, De-
Multiplexing Of Address/Data Bus, Bus Buffering. Introduction to Instruction Set &
Programming Technique.
10L
UNIT II:
Intel 8085 Instruction Set: Data Transfer, Arithmetic and Logic-operation, Branching,
Stack and subroutines, Input and Output Programming,
Addressing mode and timing Process.
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. 10L
UNIT III:
Intel 8085 Serial Communication Using 8251: Synchronous and Asynchronous
transfer, Serial Communication. Interrupt Driven Data transfer, DMA Transfer and
DMA Controller. 8085 interrupts: Classification, Hardware and Software interrupts,
Enabling & Masking Interrupts, Device polling. 8L
UNIT IV:
Intel 8086 architecture: Memory Segmentation, read/Write Cycle in Min/Max mode.
Different states & operations, Pipelining and Co-Processing, Addresswing modes and
Introduction to Instruction Set & Programming Technique, Basic Bus Interface:
Peripheral component interconnect(PCI) Bus and parallel printer interface(LPT)
10L
UNIT V:
Intel 8051 Microcontroller: Important feature & Architectural block. Memory
organization and External Memory interfacing. Instruction Syntax and Introduction to
programming, Basic of I/O concepts & interfacings, Introduction to PIC
microcontroller. 10L
Text Books:
 Ramesh S. Gaonkar, “Microprocessor architecture, programming and
applications with 8085/8085A”, 5th Edition, Wiley eastern Ltd., 2002.
 B.Ram, “Fundamentals of Microprocessor and Microcomputers”, Dhanpat
Rai andSons, 2011
References:
 Intel Marketing Corporations, “The 8080 / 8085 Microprocessor”, Wiley inter
science publications, 1980.
36
 Adam Osborne and J. Kane, “An introduction to micro computers Vol. 2 –
some real Microprocessor”, Galgotia Book Source, New Delhi, 1978.
 Ray and Bhurchandi, “Advanced Microprocessors And Peripherals”, 2nd
Edition, TMH, 2006.
 Intel Corporation, “Micro Controller Handbook”, Intel Corporation, 1985.
 Douglas V. Hall, “Microprocessors and Interfacing: Programming and
Hardware”, 1st Edition, Mcgraw-Hill Professional.
 Alan R. Miller, “Assembly Language Techniques for the IBM PC”, Sybex
Inc., 1986.
37
Mathematics-IV : 16AM-401
Credits: 4 (3L, 1T)

Total hrs: 48
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. 10L
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. 10L
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. 8L
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. 10L
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. 10L
Text Books:
 B.S. Grewal, “Higher Engineering Mathematics”, 41th Edition, Khana
Publishers, 2010.
 S.S. Sastry, “Introductory methods of numerical analysis”, 4th Edition, Phi
Learning Pvt. Ltd., 2009.
 E.S. Page and L.B. Wilson, “An introduction of computational
combinatories”, Cambridge University Press, 1979.
 N. J. Nilsson, “Principles of Artificial Intelligence”, 1st Edition, Narosa
Publishing House, 2000.
38
 J .P. Tremblay and R. Manohar, “Discrete Mathematical Structure and
applications to computer science”, McGraw-Hill, 1975.
References:
 C.L. Liu, “Elements of discrete Mathematics”, 3rd Edition, Tata Mcgraw Hill
Education Private Limited, 2008.
 Stephen A. Wiita1a, “Discrete mathematics”, International Edition, Mcgraw
Hill, 1987.
39
Object Oriented Programming: 16CE-401
Credits: 4 (3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
Unit I:
Introduction of object oriented programming (OOP), applications of OOP, C++ and
its structure, process of OO programming, encapsulation, Token, Expressions,
Operator precedence, Control Structures, data types, abstract data type, type casting,
Arrays, Overview of functions, const, friend, virtual functions. 10L
Unit II:
Classes & Objects: Overview of class & object, class definition, class specifiers,
defining member functions, Inline functions, arrays within a class, memory allocation
for objects, arrays of objects, Constructor, destructor, copy constructor. 10L
Unit III:
Polymorphism: Function overloading, uses in program, operator overloading, defining
operator overloading, limitations of operator overloading, overloading unary and
binary operators. Inheritance and its types with examples. 10L
Unit IV:
Virtual Functions, pointers to objects, pure virtual functions and its implementation in
program, Managing I/O operations, I/O streams, File handling with OOP, Error
handling in file operations, random file access, Exception handling methods, throwing
mechanism, catching mechanism, strings characteristics and uses. 9L
Unit V:
Template: Class template with multiple parameters, Function template, function
template with multiple parameters, overloading of template functions. Components of
Standard Template library, containers and iterators. 9L
Text Books:
 Ken Arnold, James Gosling, David Holmes “The Java Programming
Language”, Pearson, 2008.
 Stanley B.Lippman, “C++ Primer”, Addison-Wesley Educational Publishers
Inc, 2005.
References:
 Deitel & Deitel, “C++: How to Program”, 7th Edition, PHI Learning Pvt. Ltd.,
New Delhi, 2010.
 E. Balagurusamy, “OOP with C++”, TMG, 2011.
 E. Balagurusamy, “Programming with Java – A primer”, 4th Edition, TMG,
2010.
 Y. Kanetkar, “Let us C++”, 2nd Edition, BPB Publications, 2002.
40
Graph Theory: 16CE-402
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Graphs, Sub graphs, some basic properties, various example of graphs & their sub
graphs, walks, path & circuits, connected graphs, disconnected graphs and
component, euler graphs, various operation on graphs, Hamiltonian paths and circuits,
the traveling sales man problem, digraph, bipartite graph, complete graph, planer
graph. 10L
UNIT II:
Trees, distance diameters, radius and pendent vertices, rooted and binary trees, on
counting trees, spanning trees, fundamental circuits, finding all spanning trees of a
graph and a weighted graph, algorithms of prim‟s, Kruskal and Dijkstra Algorithms.
8L
UNIT III:
Coloring, covering and partitioning of a graph, chromatic number, chromatic
partitioning, chromatic polynomials, matching, covering, four color problem 8L
UNIT IV;
Cuts sets and cut vertices, some properties, all cut sets in a graph, fundamental
circuits and cut sets , connectivity and separability, network flows Planer graphs,
combinatorial and geometric dual: Kuratowski graphs, detection of planarity,
geometric dual, criterion of planarity, thickness and crossings. 9L
UNIT V:
Vector space of a graph and vectors, basis vector, cut set vector, circuit vector, circuit
and cut set subspaces, Matrix representation of graph – Basic concepts; Incidence
matrix, Circuit matrix, Path matrix, Cut-set matrix and Adjacency matrix. 13L
Text Books
 Deo, N, “Graph theory with applications to Engineering and Computer Science”,
New Edition, PHI Learning, 2009.
 Gary Chartrand and Ping Zhang, “Introduction to Graph Theory”, 1st Edition, TMH
Education Private Limited, 2007.
References
 Robin J. Wilson, “Introduction to Graph Theory”, 5th Rev. Edition, Prentice-Hall,
2010.
 Harary. F, “Graph Theory”, 1st Edition, Narosa Publishing House, 2001.
 Bondy and Murthy, ”Graph theory and application”, Addison Wesley.
 V. Balakrishnan, “Schaum's Outline of Graph Theory: Including Hundreds of
Solved Problems”, 1st Edition, Mcgraw Hill, 1997.
 Geir Agnarsson, “Applied Graph Theory: Algorithms and Modeling”, 1st
International Edition, Prentice Hall, 2006.
41
Design & Analysis of Algorithms: 16CE-403
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Introduction: Analyzing algorithm, growth of functions, asymptotic notation, standard
notation and common Functions. Performance analysis of binary search, quick sort,
merge sort, heap sort. Polynomial and exponential time algorithms. 7L
UNIT II:
Recurrences: Substitution method, iteration method, master method, proof of master
theorem, Red-Black Trees: Properties of red-black trees, Rotations, insertion,
deletion. Augmenting Data Structures: Dynamic order statistics, How to augment a
data structure. 7L
UNIT III:
Divide and Conquer approach, Dynamic Programming: Elements of Dynamic
Programming, Matrix –chain multiplication, Optimal binary search tree. Greedy
Algorithm: Elements of the greedy strategy, Huffman codes, A task-scheduling
problem Amortized Analysis: Aggregate method, accounting method, and potential
method. 10L
UNIT IV:
Introduction: Graph and Minimum Spanning Trees, Kruskal‟s and prim‟s algorithm.
Single- Source Shortest Paths: The Bellman-Ford algorithm, Single-Source Shortest
Paths in directed acyclic graphs, Dijkstra‟s algorithm. All-Pairs Shortest Paths:
Shortest paths and matrix representation, The Floyd-Warshall algorithm.Maximum
Flow : Flow networks, The Ford- Fulkerson method, Max-flow- min-cut theorem.
Push –relabel algorithm. 12L
UNIT V:
Sorting Networks: A bitonic sorting network, merging network, sorting network.
Matrix Operations: Properties of matrices, Strassen‟s algorithm for matrix
multiplication. Linear Programming: Stander and slack forms, Formulating problems
as linear programs, The Simplex algorithm. Introduction to NP-Completeness. The
RSA public-key cryptosystem. 12L
Text Books:
 Horowitz, Sahni, Rajasekaran, “Fundamentals of Computer Algorithms”, 1st
Edition, Galgotia publications Pvt. Ltd., 2004.
 Cormen, Leiserson, Rivest, Stein, “Introduction to Algorithms”, 3rd Edition,
PHI Learning, 2010.
References:
 Kruse, Tondo, Leung, Mogalia, “Data Structures & Program Design in C”, 2nd
Edition, Pearson, 2007.
 Kyle Loudan, “Mastering Algorithms With C”, 1st Edition, O‟REILLY, 2010
42
Microprocessor Laboratory: 16EC-492
Credits: 2(3P)
Total Hours: 36
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 String Matching and

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.
43
Object Oriented Programming Laboratory: 16CE-491
Credits: 2 (3P)
Total Hours: 36
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
7. Program to implement polymorphism
8. Program to implement Class and Function Template
9. Program to implement STL
10. Program to implement Container
44
Operating System: 16CE-501
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Introduction to Operating System Concepts (including Multitasking,
multiprogramming, multi user, Multithreading etc)., Types of Operating Systems:
Batch operating system, Time-sharing systems, Distributed OS, Network OS, Real
Time OS; Various Operating system services, architecture, System programs and
calls. 9L
UNIT II:
Process concept, state transition diagram, PCB, process scheduling, preemptive, non
preemptive; CPU scheduling, scheduling criteria, scheduling algorithms -First Come
First Serve (FCFS), Shortest-Job-First (SJF), Priority Scheduling, Round Robin(RR),
Multilevel Queue Scheduling. mutual exclusion, Critical Section Problems, producer-
consumer problem, dining philosopher problem, semaphores, deadlock, methods for
handling deadlocks-deadlock prevention, avoidance & detection; deadlock recovery.
10L
UNIT III:
Need of Memory management and its requirements, paging, segmentation, concept of
fragmentation. Characteristics of contiguous & non-contiguous allocation techniques,
Detail study of fragmentation, Virtual memory management, introduction to page-
replacement. Concept of FIFO and optimal page-replacement algorithms, Concept of
LRU, LFU and its page-replacement algorithm, Concept of allocation algorithms.
Segmentation: Best fit, first fit & worst fit. 10L
UNIT IV:
File concept, access methods, directory structure, file system structure, allocation
methods (contiguous, linked, indexed), free-space management (bit vector, linked list,
grouping), directory implementation (linear list, hash table), efficiency &
performance. 10L
UNIT V:
I/O hardware, polling, interrupts, DMA, application I/O interface (block and character
devices, network devices, clocks and timers, blocking and non-blocking I/O), kernel
I/O subsystem (scheduling, buffering, caching, spooling and device reservation, error
handling). 9L
Text Books:
 J.L. Peterson and A. Silberschatz, “Operating System Concepts”, 5th Edition,
Addison Wesley, 1998.
 A. Tanenbaum, “Modern Operating Systems”, Prentice-Hall, 1992.
 William Stallings, “Operating Systems Internals and Design Principles”, 4th
Edition, Prentice-Hall, 2001.
45
References:
 Peterson,“Operating System Concepts”, 2nd Edition, Addison-Wiley, 1989.
 Milankovic, “Operating System Concepts”, 2nd Edition, TMH, 1990.
 Colin Ritche, “Operating System: Incorporating With Unix & Windows”, TMH,
1984.
46
Theory of Computation: 16CE-502
Credits: 4 (3L, 1T)
Total hrs: 48
8 x 12(Marks)} = 60.
UNIT I:
Finite State Machine Strings, Alphabet, Language, Operations, finite automaton
model, acceptance of strings, and languages, non deterministic finite automaton,
deterministic finite automaton, equivalence between NFA and DFA, Conversion of
NFA into DFA, minimisation of FSM, equivalence between two FSM‟s, Moore and
Mealy machines. 9L
UNIT II:
Regular sets, regular expressions, identity rules, manipulation of regular expressions,
equivalence between RE and FA, inter conversion, pumping lemma, closure
properties of regular sets (proofs not required), regular grammars, right linear and left
linear grammars equivalence between regular linear grammar and FA, inter
conversion. 9L
UNIT III:
Chomsky classification of languages, enumeration of properties of CFL (proofs
omitted). CFGs, CSG, Derivation trees, ambiguity, simplification of CFLs, normal
forms of CFGs, pumping lemma for CFGs, decision algorithms for CFGs, designing
CFGs, PDA: formal definition, examples of PDA, equivalence with CFGs, PDA,
LBA and CFG, Chomsky hierarchy, Parsing Technique and PDA. 10L
UNIT IV:
Formal definition of TM, Deterministic and Non-Deterministic Turing Machines,
Design of T.M, Halting problem of T.M., PCP Problem. computable languages and
functions, Turing Machine constructions, Recursive and Recursive enumerable
languages, Recursive Function, Partial and Total Recursive Function, Primitive
Recursive Function. 10L
UNIT V:
Time and Space complexity of TMs,Complexity classes, Introduction to NP-Hardness
and NP-Completeness. 10L
Text Books:
 Hopcroft H.E., Motwani Rajeev and Ullman J. D., “Introduction to Automata
Theory Languages and Computation”, 3rd Edition, Pearson, 2008.
 K.L.P.Mishra & N.Chandrasekaran, “Theory of Computer Science: Automata,
Languages and computation”, 3rd Edition, PHI learning, 2009.
 Lewis H.P. & Papadimitriou C.H., “Elements of Theory of Computation”, 2nd
Edition, PHI learning, 2009.
47
References:
 Michael Sipser, “Introduction to the Theory of Computations”, International
Edition, Cengageint, 2005.
 John C. Martin, “Introduction to Languages and the Theory of Computation”, 2nd
Edition, Mcgraw Hill College, 1997.
 Peter Linz, “ Introduction to formal Languages & Automata”, 4th Edition,
Narosa, 2010.
 Ramond Greenlaw and H. James Hoover, “Fundamentals of the Theory of
Computation- Principles and Practice”, morgan kaufmann publishers, 1998.
 Dr. R.B Patel and Prem Nath”Automata theory and Formal Language”, 2nd
edition, Umesh Publication, Nai Sarak, Delhi
48
Database Management Systems: 16CE-503
Credits: 4(3L, 1T)
Total Hours: 48
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. 9L
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. 10L
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 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. 10L
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. 9L
Text Books:
 Elmasri Ramex & Shamkant B Navathe, “Fundamentals of Database Systems”, 5th
Edition, Pearson, 2009.
 Date C. J. “An Introduction to Database System, Vol I, II & III”, Addison-
Wesley.
References:
 Jeffrey D. Ulman, “Principles of Data base Systems, Second Edition”, 3rd Edition,
Galgotia Publications Pvt. Ltd., 2011.
 Prakash Naveen, “Introduction to Data base Management”, 1st Edition, Tata
McGraw Hill, 1991.
49
Computer Networks: 16CE-504
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Introduction: Uses of computer network, types of network: LAN, MAN, WAN.
Network hardware, network software. Reference models: OSI/ISO, TCP/IP,
comparison of OSI and TCP reference model. Concept of data communication,
Transmission media: Optical fiber, coaxial and UTP cable. Introduction to Wireless
transmission, The telephone system (PSTN, structure of telephone system, switching
techniques) 9L
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. 9L
UNIT III:
The MAC sublayer: Channel allocation, multiple access protocols(ALOHA, carrier,
Carrier Sense Multiple Access Protocols, Collision-free protocols, Limited-
Contension 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. 10L
UNIT V:
Transport layer services, elements of transport protocols, internet transport protocol-
TCP-service model, protocol, segment header, connection management, transmission
policy, congestion control, timer management. UDP 10L
Text Books:
 A S Tenenbaum, “Computer Networks”, 4th Edition, Pearson, 2002.
 Forouzan, “Computer Networks Fundamentals”, TMH, 2006.
References:
 Black, “Computer Networks”, PHI.
 M Barry Dumas , Morris Schwartz, “Principles of Computer Networks and
Communications”, Prentice Hall, 2008.
 Stevens, “UNIX Network Programming”, 1st Edition, Pearson, 2011.
 Douglas, “TCP/IP and Internetworking”, Vol. 1, 5th Edition, PHI, 2005.
50
Principles of Programming Languages 16CE-505
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT----I
The role of programming languages – towards high level languages, problems of
scale, programming paradigms, language implementation- bridging the gap , language
description – syntactic structure, expression notations, abstract syntax trees, lexical
syntax, context free grammars, grammars for expressions, variants of grammars. 10L
UNIT---II
Statements, structured programming, Types , data representations, procedure
activations. 9L
UNIT---III
Object oriented programming – groupings of data and operations, constructs for
program structuring, information hiding, program design with modules, Modules and
defined types,
9L
UNIT----IV
Class declarations in C++, dynamic allocation in C++, Templates – parameterized
types, implementation of objects in C++, what is an object, object-oriented thinking,
inheritance, object oriented programming in C++, An extended C++ example,
Derived classes and information hiding.
10L
UNIT---V
Functional programming – elements of functional programming, functional
programming in a typed language, functions as first-class values, functional
programming with lists, logic programming, an introduction to concurrent
programming
10L
Essential readings:
1. R. Sethi, Programming Languages – Concepts & Constructs, Pearson Education
Supplementary reading:
1. R.W.Sebesta, Concepts of Programming Languages, 8th Edition, Addison-
Wesley
2. M.L.Scott, Programming Language Pragmatics, 2nd Edition, Morgan
Kaufmann,2005
3.Terrace W.Pratt, Programming Languages, 4th Edn, Pearson
51
Database Management System Laboratory: 16CE-591
Credits: 2 (3P)
Total Hours: 36
1. Introduction to database.
2. DDL/DML
3. SQL Commands
4. Table
5. Query
6. Form
7. Report Creation
8. Programming using Oracle
9. Designing a database of an organization (complete).
10. Excel sheet
52
Computer Network Laboratory: 16CE-592
Credits: 2 (3P)
Total Hours: 36
Instructions on:
1. Setting up Windows Server and Sharing of printer and files.
2. Ethernet Crimping / RJ45 Connection.
3. Fiber optic Cable splicing.
Experiments on:
1. Implementation of Stop and Wait Protocol and Sliding Window Protocol.
2. Study of TCP Socket Programming and Client – Server model
a. TCP Echo Server/Client
b. TCP Date Server/Client
c. TCP Chat Server/Client
3. Study of UDP Socket Programming and Client – Server model
a. UDP Echo Server/Client
b. UDP Date Server/Client
c. UDP Chat Server/Client
4. Study of RAW Socket programming
a. SYN Flooding
b. Packet Capture
5. Write a code for simulatingthe following protocols.
a. Go Back N
b. Selective Repeat
c. ARP Server/Client
d. RARP Server/Client
6. Write a code simulating PING and TRACEROUTE commands
7. Create a socket for HTTP for web page upload and download.
8. Write a program to implement RPC (Remote Procedure Call)
9. Study of Network simulator (NS).and Simulation of Congestion Control Algorithms
using NS
10. Designing and simulating using NS
a. Ethernet CSMA/CD protocol
b. Distance Vector routing protocol
11. Study Using NS:
a. UDP performance
b. TCP performance
53
UNIX and Shell Programming: 16CE-601
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Overview of LINUX Architectures editors and commands, shell scripts, system
administration. Introduction: - Data structures in LINUX kernel, process management,
systems calls, Memory Management 10L
UNIT II:
Inter Process Communication: Synchronization in kernel, communication via files,
pipes, ptrace, system versus IPC, and sockets, File System: Rules and Regulations,
Visibility. Multiprocessing: Multiprocessing, symmetric multiprocessing, Changes
with respect to kernel initialization, spooling, message exchange between processes,
interrupt handling. 10L
UNIT III:
Multi-user administration, network accessibility, network distribution principles,
complete file system and administration. Introduction of Telnet and UNIX OS
sharing. 10L
UNIT IV:
Filters using regular expressions, an advanced Filter. 9L
UNIT V:
Essential Shell Programming. 9L
Text Books:
 Silberschatz & P. B. Galvin, “Operating System Concepts”, John Wiley, 2000.
 Richard Petersen, “The Complete Reference-Redhat Linux”, 6th Edition, Tata
McGraw Hill Education Private Limited, 2007.
References:
 Sumitabha Das, “Your UNIX: The Ultimate Guide”, McGraw-Hill, 2000.
 Behrouz A.Forouzan and Richard F.Gilberg, “UNIX and Shell Programming”,
Cengage Learning, 2005.
54
Software Engineering: 16CE-602
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Introduction of Software Engineering, Software Development Life-cycle
Requirements analysis, software design, coding, testing, maintenance. 5L
UNIT II:
Software Engineering Process & Management: Generic view, Capability Maturity
Model, Process models waterfall, evolutionary, incremental etc., unified process, agile
view, project management, metrics estimation, project scheduling, risk management.
Software engineering Principles and Practice: Communication, planning and
modeling practices, system Engineering and modeling, business process engineering
requirement analysis, system analysis flow Oriented and class oriented modeling
using data modeling concepts. 12L
UNIT III:
Software Design Engineering: Design Concepts: Abstraction Architecture, pattern
modularity, information hiding, design classes, refactoring etc., Design of web
application, architectural design, component level design, user interface design.
8L
UNT IV:
Software Testing and Quality Management: Testing strategies, testing for object
oriented software testing for web applications, validation testing etc. Black box
testing, white box testing, Basis path testing. Testing for specialized environments,
architectures and application. Quality concepts, quality assurance, software reviews,
statistical quality assurance. Software Project Management: Cost estimation, Project
scheduling, Staffing, Project Monitoring, Risk Management, etc.
13L
UNIT V:
Software configuration management and advance topics: Elements of configuration
management system, process configuration for web engineering, component based
development, clean room software engineering, formal methods, software
reengineering, Software Maintenance. 10L
Text Books:
 Jalote Pankaj, “Integrated Approach to Software Engineering”, Narosa, 1993.
 Pressman, R.S, “Software Engineering - A Practitioner‟s Approach”, 6th Edition,
McGraw Hill, 2005.
 Sommerville Ian, “Software Engineering [with Access Code]”, 9th Edition,
Addison‐Wesley Longman, 2010.
55
References:
 Rumbaugh, J. Blaha, M. Premeralani, W. Eddy F. and Lorensen, W., “Object-
Oriented Modelling and Design”, Prentice Hall of India, 1997.
 Ghezzi, C. Jazayeri M. and Mandrioli, D., “Fundamentals of Software
Engineering”, Prentice Hall of India, 1994.
56
Compiler Design: 16CE-603
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Compiler Structure: Basics of a Compiler, difference with other converters like
Interpreter, assembler etc. Analysis of the source program - The phases – Cousins -
The grouping of phases - Compiler construction tools. The role of the lexical analyzer
- Input buffering - Specification of tokens - Recognition of tokens - A language for
specifying lexical analyzer.
Lexical Analysis: Interface with input, parser and symbol table, Token, lexeme, and
patterns. Difficulties in lexical Analysis, Error reporting, Implementation, Regular
definition, Transistion diagrams. 10L
UNIT II:
Syntax Analysis: Role of the parser, Writing Grammars, CFGs, Ambiguity,
Associativity, Precedence, Top down parsing, transformation on the grammars,
Recursive Descent Parsing, predictive parsing, bottom up parsing, Shift Reduce
Parsing, Operator Precedent Parsing, LR parsars (SLR, LR/Canonical LR Parser,
LALR), YACC. 9L
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/languages, translation of declarations, assignment statements, control
flow, Boolean expressions, Case Statements, Back patching, Procedure calls.
10L
UNIT IV:
Code Generation: Issues in the design of code generator, The target machine, Runtime
Storage management, Basic Blocks and Flow Graphs, Next-use Information, A simple
Code generator, DAG representation of Basic Blocks, Peephole Optimization.
10L
UNITV:
Code Optimization and Run Time Environments: Introduction, Principal Sources of
Optimization, Optimization of basic Blocks, Introduction to Global Data Flow
Analysis, Runtime Environments, Source Language issues, Storage Organization,
Storage Allocation strategies, Access to non-local names, Parameter Passing.
9L
Text Books:
 Aho, Sethi & Ullman, “Principles of Compiler Design”, Narosa Publishing House.
, 2002
57
 Alfred Aho, Ravi Sethi, Jeffrey D Ullman, “Compilers Principles, Techniques and
Tools”, Pearson Education Asia, 2007.
 Leland L. Beck, “System Software – An Introduction to Systems Programming”,
3rd Edition, Pearson Education Asia, 2000.
 A I Holub, “Compiler Design in C”, PHI Learning, 2009.
References:
 D.M. Dhamdhere, “Systems Programming and Operating Systems”, Second
Revised Edition, TMH Education Private Limited, 2001.
 J.J. Donovan, “System Programming”, Tata McGraw-Hill Education Private
Limited, 2002.
 Allen I. Holub, “Compiler Design in C”, PHI Learning, 2009.
 C. N. Fischer and R. J. LeBlanc, “Crafting a compiler with C”, Benjamin
Cummings, 2003.
 J.P. Bennet, “Introduction to Compiler Techniques”, 2nd Edition, Tata McGraw-
Hill, 2003.
 Henk Alblas and Albert Nymeyer, “Practice and Principles of Compiler Building
with C”, PHI, 2001.
 Kenneth C. Louden, “Compiler Construction: Principles and Practice”, Thompson
Learning, 2003.
 David Gries, “Modern Compiler Design”, Pearson Education Asia, 2007.
 Steven S. Muchnick, “Advanced Compiler Design & Implementation”, Morgan
Kaufmann Pulishers, 2000.
58
Computer Graphics: 16CE-604
Credits: 4 (3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Pixel, Resolution, video display devices - types – Graphical devices: input devices –
output devices, Types of computer graphics, Graphic Displays- Random scan
displays, Raster scan displays, Frame buffer and video controller, Points and lines,
Line drawing algorithms, Circle generating algorithms, Mid point circle generating
algorithm, and parallel version of these algorithms. 9L
UNIT II:
Basic transformation, Matrix representations and homogenous coordinates,
Composite transformations, Reflections and shearing. Windowing and Clipping:
Viewing pipeline, Viewing transformations, 2-D Clipping algorithms-Line clipping
algorithms such as Cohen Sutherland line clipping algorithm, Liang Barsky algorithm,
Line clipping against non rectangular clip windows; Polygon clipping – Sutherland
Hodgeman polygon clipping, Weiler and Atherton polygon clipping, Curve clipping,
Text clipping. 10L
UNIT III:
Three Dimensional: 3-D geometric primitives, 3-D Object representation, 3-D
Transformation, 3-D viewing, projections, 3-D Clipping. 9L
UNIT IV:
Curves and Surfaces: Quadric surfaces, Spheres, Ellipsoid, Blobby objects,
Introductory concepts of Spline, Bspline and Bezier curves and surfaces. 10L
UNIT V:
Hidden Lines and Surfaces: Back Face Detection algorithm, Depth buffer method, A-
buffer method, Scan line method, basic illumination models – Ambient light, Diffuse
reflection, Specular reflection and Phong model, Combined approach, Warn model,
Intensity Attenuation, Color consideration, Transparency and Shadows. 10L
Text Books:
 Donald Hearn and M Pauline Baker, “Computer Graphics C Version”, 2nd Edition,
Pearson Education, 2011.
 Amrendra N Sinha and Arun D Udai, “Computer Graphics”, TMH Education
Private Limited, 2008.
References:
 Donald Hearn and M Pauline Baker, “Computer Graphics with OpenGL”, 3rd
Edition, Pearson education, 2009.
 Steven Harrington, “Computer Graphics: A Programming Approach”, 2nd Edition,
TMH.
 Rogers, “Procedural Elements of Computer Graphics”, 2nd Edition, McGraw Hill
Science/Engineering/Math, 1997.
59
 James D. Foley, Andeies van Dam, Stevan K. Feiner and Johb F. Hughes,
“Computer Graphics Principles and Practices”, 2nd Edition, Addision Wesley,
2000.
60
Principles of Data Communication: 16CE-605
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
History of digital communication. Elements of digital communication system;
Chronology of developments; Prospects and trends, 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. 10L
UNIT II:
Bit error probability; Decoding errors; Error threshold; System comparisons.
Regenerative Repeaters, Error performance; Power saving. 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 Compander; modulation technique:PCM, DM, DPCM, ADM;
Digital Audio. 9L
UNIT III:
Introduction to different type of multiplexing, Frequency Division & Time Division
Multiplexing: multiplexing hierarchy, synchronous and asynchronous multiplexing,
pulse staffing and word staffing. Bit sync; Early-late gate sync; Frame sync;
Scrambler, De-scrambler; 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. BPSK, DPSK. BFSK, MARY-PSK & -FSK, QPSK, MSK
principles, QASK, Error calculation. 10L
UNIT V:
Synchronous, Envelope/Non-coherent schemes; Performance evaluation (BER, SNR,
BW) for various schemes. Introduction to Information Coding: Source coding,
Entropy Coding, Shanon-Fano-code, Huffman's code, Evaluation of digital systems in
the light of information theory - Specific examples.
9L
Text Books:
 Taub, Schilling and Saha, “Principle of Communication System”, 3rd Edition, Tata
McGraw Hill Education Private Limited, 2007.
 B.P. Lathi, “Modern Digital and Analog Comm. System”, 3rd Edition, Oxford
University press.
 Simon Haykin, “Communication System”, 5th Edition, John Wiley & Sons, 2009.
 L.W. Couch, “Modern Communication System: Principles and Applications”,
Prentice Hall India, 1995.
61
References:
 J.G. Proakis, “Digital Communications”, 5th Edition, McGraw Hill, 2008.
 J.Das, S.K.Mullick, P.K.Chatterjee, “Principle of Digital Communication”, John
Wiley & Sons Inc., 1986.
 Roden, “Analog & Digital Communication Systems”, 5th Edition, Shroff
Publishers & Distributors, 2003.
 Dungan, “Electronic Communication Systems”, 3rd Edition, Cengage Learning,
1998.
 Zeimer Tranter, “Principles of Communication”, Jaico Publishing House, 1993.
 Rekha K, “Digital Communications”, Scitech, 2003.
62
UNIX and Shell Programming Laboratory: 16CE-691
Credits: 2 (3P)
Total Hours: 36
List of Practicals:
1. Write a shell script to accept two numbers and perform all arithmetic
operations on it
2. Write a shell script to find largest of three numbers using conditional
execution operators
3. Write a shell script to accept the name of the file from standard input and
perform the following tests on it
a) File executable
b) File readable
c) File writable
d) Both readable & writable
4. Write a shell script which will display the username and terminal name who
login recently in to the Unix system
5. Write a shell script to find no. of files in a directory
6. Write a shell script to print prime numbers up to a given range using
arguments
7. Write a shell script which will display the number of days in the given month
and year
8. Write a shell script for concatenation of two strings
9. Write a shell script which will display Fibonacci series up to a given number
of argument
10. Write a shell script to demonstrate break and continue statements
63
Computer Graphics Laboratory: 16CE-692
Credits: 2 (3P)
Total Hours: 36
Full Marks: 100 (Sessional: 50 Marks, End Semester Examination:50 Marks)
1. Implementation of Line, Circle and ellipse Attributes.

2. Two Dimensional transformations - Translation, Rotation, Scaling, Reflection,
Shear.
3. Composite 2D Transformations.
4. Cohen Sutherland 2D line clipping and Windowing
5. Sutherland – Hodgeman Polygon clipping Algorithm.
6. Three dimensional transformations - Translation, Rotation, Scaling.
7. Composite 3D transformations.
8. Drawing three dimensional objects and Scenes.
9. Generating Fractal images.
64
Artificial Intelligence: 16CE-701
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Intelligent Agents, Agents and environments, Good behavior, The nature of
environments, structure of agents, Problem Solving, problem solving agents, Solving
Problems by Searching, Informed Search and Exploration, Adversarial Search Constraint
Satisfaction Problems. Searching for solutions, uniformed search strategies, avoiding
repeated states, searching with partial information. 9L
UNIT II:
Informed search and exploration – Informed search strategies – heuristic function –
local search algorithms and optimistic problems – local search in continuous spaces –
online search agents and unknown environments - Constraint satisfaction problems
(CSP) – Backtracking search and Local search for CSP – Structure of problems -
Adversarial Search – Games – Optimal decisions in games – Alpha – Beta Pruning –
imperfect real-time decision – games that include an element of chance. 10L
UNIT III:
Knowledge and Reasoning, Logical Agents, First order logic – representation revisited –
Syntax and semantics for first order logic – Using first order logic – Knowledge
engineering in first order logic - Inference in First order logic – prepositional versus
first order logic – unification and lifting – forward chaining – backward chaining -
Resolution - Knowledge representation, Planning Uncertain Knowledge and Reasoning,
Uncertainty, Probabilistic Reasoning, Ontological Engineering, Categories and objects,
Actions, Simulation and events, Mental events and mental objects. 10L
UNIT IV:
Learning from observations - forms of learning - Inductive learning - Learning
decision trees - Ensemble learning - Knowledge in learning – Logical formulation of
learning – Explanation based learning – Learning using relevant information –
Inductive logic programming - Statistical learning methods - Learning with complete
data - Learning with hidden variable - EM algorithm - Instance based learning -
Neural networks - Reinforcement learning – Passive reinforcement learning - Active
reinforcement learning - Generalization in reinforcement learning. 10L
UNIT V:
Communication – Communication as action – Formal grammar for a fragment of
English – Syntactic analysis – Augmented grammars – Semantic interpretation –
Ambiguity and disambiguation – Discourse understanding – Grammar induction -
Probabilistic language processing - Probabilistic language models – Information
retrieval – Information Extraction – Machine translation. Expert Systems, Fuzzy
Systems, Genetic Algorithms, Swarm Intelligent Systems etc. 9L
65
Text Books:
 Stuart Russell, Peter Norvig, “Artificial Intelligence – A Modern Approach”,
2nd Edition, Pearson Education / Prentice Hall of India, 2004.
 Patterson, “Artificial Intelligence-A Practical Approach”, Tata McGraw Hill,
3rd Edition, 2006
 N.P. Padhy, “Artificial Intelligence and Intelligent Systems”, Oxford University
Press, 2009.
References:
 Nils J. Nilsson, “Artificial Intelligence: A new Synthesis”, Harcourt Asia Pvt.
Ltd., 2000.
 Elaine Rich and Kevin Knight, “Artificial Intelligence”, 2nd Edition, Tata
McGraw-Hill, 2003
 George F. Luger, “Artificial Intelligence-Structures And Strategies For Complex
Problem Solving”, 6th Edition, Pearson Education / PHI, 2002.
66
Data Mining and Data Warehousing: 16CE-702
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Fundamentals of data mining, Data Mining Functionalities, Classification of Data
Mining systems, Data Mining Task Primitives, Integration of a Data Mining System
with a Database or a Data Warehouse System, Major issues in Data Mining. Need for
Preprocessing the Data, Data Cleaning, Data Integration and Transformation, Data
Reduction, Discretization and Concept Hierarchy Generation. 9L
UNIT II:
Data Warehouse and OLAP Technology for Data Mining, Data Warehouse,
Multidimensional Data Model, Data Warehouse Architecture, Data Warehouse
Implementation, Further Development of Data Cube Technology, From Data
Warehousing to Data Mining 9L
UNIT III:
Mining Frequent Patterns, Associations and Correlations, basic Concepts, Efficient
and Scalable Frequent Itemset Mining Methods, Mining various kinds of Association
Rules, From Association Mining to Correlation Analysis. 10L
UNIT IV:
Issues Regarding Classification and Prediction, Classification by Decision Tree
Induction, Bayesian Classification, Rule-Based Classification, Classification by
Backpropagation, Support Vector Machines, Associative Classification, Lazy
Learners, Other Classification Methods, Prediction, Accuracy and Error measures,
Evaluating the accuracy of a Classifier or a Predictor. 10L
UNIT V:
Cluster Analysis:Types of Data in Cluster Analysis, A Categorization of Major
Clustering Methods, Partitioning Methods, Hierarchical Methods, Density-Based
Methods, Grid-Based Methods, Text mining. 10L
Text Books:
 Jiawei Han & Micheline Kamber, “Data Mining – Concepts and Techniques”,
nd
Morgan Kaufmann Publishers, 2 Edition, 2006.
 Pang-Ning Tan, Michael Steinbach and Vipin Kumar,” Introduction to Data
Mining “, Pearson education, 2007
References:
 Sam Aanhory & Dennis Murray, “Data Warehousing in the Real
World”,Pearson Edn Asia, 1997
 K.P.Soman,S.Diwakar,V.Ajay ,”Insight into Data Mining”,PHI,2008.
 Paulraj Ponnaiah,”Data Warehousing Fundamentals”,Wiley student Edition,
2008
67
 Ralph Kimball,”The Data Warehouse Life cycle Tool kit”,Wiley student edition,
2007
 William H Inmon,”Building the Data Warehouse”, John Wiley & Sons Inc,
2005.
 Margaret H Dunham,”Data Mining Introductory and advanced topics”,Pearson
education, 2002
nd
 Arun K Pujari, “Data Mining Techniques” –2 edition, Universities Press,2010
 V.Pudi and P.Radha Krishna, “Data Mining”, Oxford University Press, 2009
 A.B.M Shawkat Ali and S.A.Wasimi,”Data Mining:Methods and Techniques”,
Cengage Learning, 2009
 W.H.Inmon,D.Strauss,G.Neushloss, “Data Warehouse 2.0, The Architecture for
the next generation of Data Warehousing”, Elsevier,Distributed by SPD,2005
68
Embedded System: 16CE-703
Credits: 4(3L, 1T)
Total Hours: 48
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. SOC: Memory sub-system, bus structure (PC-104, I2C etc.),
interfacing protocols (USB, IRDA etc), testing & debugging, power management.
10L
UNIT II:
Embedded Assembly language programming, Embedded C Programming, Embedded
Programming in C++. Embedded System Software: Program Optimization,
Concurrent Programming, 10L
UNIT III:
Real Time Operating Systems: Process Management, Timer functions, Event
Functions, Memory management, Device, File and I/O Management, RTOS task
scheduling Models. OS security Issues. RT Linux.
9L
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, Hardware – Software co-design Issues,
testing and verification, dependability issues. Embedded Software Development
process and Tools – Host and Target Machines, Linking and Locating Software,
getting embedded software into the target system, Simulators, Emulators, Device
programmer, In circuit Debugger. 10L
UNIT V:
Applications of different Embedded Systems. Case Studies on ABS, CNC Motion
Control, Injket Printers, Laserjet Printer, Robotics, etc.
9L
Text Books:
 Vahid Frank, Givargis, Tony, “Embedded System Design”, John Wiley &
Sons, 2001.
 Heath Steve, “Embedded System Design”, 2nd Edition, Elsevier India, 2008.
 Wayne Wolf, Computers as Components: Principles of Embedded Computing
Systems Design, Morgan-Kaufmann
References:
 Raj Kamal, “Embedded Systems: Architecture, Programming, and Design” 2nd
Edition, TMH, 2008.
 Prasad, “Embedded Systems/Real time Systems”, 2nd Edition, TMH, 2008
69
Digital Signal Processing: 16CE-704
Credits: 4(3L, 1T)
Total Hours: 48
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. 9L
UNIT II:
Convolutions, graphical and analytical techniques, overlap and add methods, matrix
method, some examples and solutions of LTI systems, MATLAB examples. 9L
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, windows-
rectangular, 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, 2004
 Proakis & Manolakis, “DSP, Principles, Algorithms and Applications”, 3rd
Edition, PHI/Pearson, 1995
 Chen, “Digital Signal Processing”, OUP, 2007.
References:
 Babu R, “Digital Signal Processing” , Scitech, 2004
 S. Salivahanan et al, “Digital Signal Processing”, TMH, 2009
 S.K.Mitra,” Digital Signal Processing - A Computer based approach”, 4th
Edition, TMH, 2010
 Xavier, “Digital Signal Processing”, 3rd Edition, S. Chand, 2009
70
Pervasive Computing: 16CE-705
Credits: 4(3L, 1T)
Total Hours: 48
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. 9L
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. 9L
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. 10L
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. 10L
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. 10L
Textbook:
 Jochen Burkhardt, “Pervasive Computing: Technology and Architecture of
Mobile Internet Applications”, 3rd edition, Addison-Wesley Professional,
2007
 Jochen Schiller, “Mobile Communications”, 2nd Edition, PHI, 2003.
References:
 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, 2002
 Agrawal and Zeng, Brooks/ Cole, “Introduction to Wireless and Mobile
Systems”, Thomson Learning, 2002
 Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober,
“Principles of Mobile Computing”, Springer, New York, 2003.
71
Distributed and Parallel Computing: 16CE-706
Credits: 4(3L, 1 T)
Total Hours:48
8 x 12(Marks)} = 60.
UNIT I:
Introduction to parallel processing: parallel architecture, systolic and associative
array, SISD, MIMD etc, data flow architecture, subsystems bandwidths, inter-
processor communication, shared RAM, interconnection network 10L
UNIT II:
Systolic array: cross-bar and ring network, multi-stage network, dynamic
communication. Parallel algorithms: sorting FFT, matrix operation, and graph
algorithm. 9L
UNIT III:
Introduction to distributed computing: distribution of data and control,
synchronization, distributed termination problem, load distribution, deadlocks in
distributed systems. 10L
UNIT IV:
High level language support in distributed computing: message passing primitives,
atomic action, remote procedure call mechanisms, case study of some languages like
OCCAMII, LINDA. 10L
UNIT V:
Formal development and verification of distributed algorithms. 9L
Text Books:
 Kai Hwang & F A Briggs, “Computer Architecture and Parallel Processing”,
MGH, 1984.
 J P Hayes, “Computer Architecture and Organisation”, MGH, 1982.
References:
 G Roddrick, “Parallel Computations”, Academic Press, new York, 1982.
 Ullman, “Computational aspects of VLSI”, Computer Science Press, 1984.
 Black U D, “Data Communication and Distributed Networks”,3rd Edition,
PHI, 2009.
72
Remote Sensing and GIS: 16CE-707
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Transmission of Solar Radiation through Atmosphere: Solar radiation spectrum;
Radio infrared & optical windows of earth's atmosphere; Spectrum of solar radiation;
Emissions from disturbed sun. Reflection, Absorption and Emission from Earth and
Atmosphere: Variation of earth's reflectivity, wavelength and geographical location;
Seasonal variation of reflectivity; Solar radiation reflected from earth. 7L
UNIT II:
Thermal radiation from the earth; Thermal radiation from the atmospheric
constituents; Thermal emission from cloud, rain, snow and fog; Radio noise and
interference at satellite heights. Sensors and Cameras: Optical and infrared detectors
and filters; Optical and infrared cameras; Microwave and Millimetrewave
radiometers; Scanning systems; Mechanical and Electronic Systems; Scatterometer;
Altimeter. 11L
UNIT III:
Remote Sensing Satellites: Orbits of remote sensing satellites; Remote sensing
satellites - LANDSAT; Indian Remote Sensing (IRS) Satellites; INSAT; NOAA
Series; NASA's Upper Atmosphere Research Satellites (UARS); TRMM satellite. 8L
UNIT IV:
Remote Sensing of Atmosphere and Sea State: Passive and active remote sensing;
Side Looking Airborne Radar (SLAR)); Synthetic Aperture Radar (SAR); Along
Track Scanning Radiometer (ATSR); Laboratory measurements of remote sensing
parameters; Tropical rainfall measurements; Microwave sensing of sea surface. 10L
UNIT V:
Interpretation of Sensing Data: Photo-interpretation, image processing and pattern
recognition; Spectral interpretation of remote sensing imagery; Interpretation of
thermal maps; Colour coding and enhancement; Image interpretation.GIS-Properties,
applications, space and GIS, advanced GIS. 12L
Text Books:
 Forsyth, “Computer Vision- A modern Approach”, Prentice Hall.
 Mann, Scott, “Wireless Application protocol”, Jws, 2000
 GIS Handbook.
References:
 Singhal, “Wireless Application protocol: Writing application for Mobile
Internet”, addison wesley longman, 2001
 Ganzalez, “Digital Image processing”, 3rd Edition, pearson, 2008
73
Network Securities: 16CE-708
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Review and Fundamentals: Overview of networking security - secure network
services, attacks; ITU's Recommendation X.800 OSI model - Introduction to
Cryptography, Authentication, Cryptographic Protocols (strong authentication, key
exchange). 7L
UNIT II:
Symmetric cryptography, Public-key cryptography, Analysis of Protocols, Standards
– SSL/TLS, SSH, IPSEC, Kerberos, S/Key, Public Key Infrastructures – PKI: X.509,
PGP, MD3,MD5,Hashing technique, SHA, RSA and DSA. 7L
UNIT III:
Building Security into the Network: The model of network security process, Defining
security zones, Device security, Secure Routing, Secure LAN switching, IEEE 802.1x
protocol, NAT and security. 10L
UNIT IV:
System Security: Intruders, Traffic monitoring and intrusion detection, Routing
Protocols, Distributed Denial of Service attacks, Network forensics/ Vulnerability
assessment, Malicious software, Packet Filtering/Firewalls, Cisco firewalls, VPN.
12L
UNIT V:
Network Security Applications: Authentication applications, E-mail security, IP
security, Web security, Network Management security, DNS security,
Smartcards/Biometrics, Privacy, Wireless security. 12L
Text Books:
 Kaufman, Perlman and Speciner, “Network Security: Private Communication
in a Public World”, 2nd Edition, Phi Learning, 2009
 Stevens, “TCP/IP Illustrated, vol. 1: the protocol”, Addison-Wesley,2011
 Moore, Robert, “Cybercrime: Investigating High-Technology Computer Crime,
Cincinatti”,2nd Edition, Anderson, 2010
References:
 American Psychological Association, “Publication Manual of the American
Psychological Association”, 5e, Washington DC, APA, 1994
 Research papers about WLAN security, mobile security, etc. by clicking RFC
2828 Internet Security Glossary, R. Shirey. May 2000.
74
VLSI Design: 16CE-709
Credits: 4(3L, 1 T)
Total Hours: 48
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. 13 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. 13L
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. 10L
Text Books:
 J.M. Rabaey, „Digital Integrated Circuits‟, PHI, 2009.
 Waste and Eshraghian, „Principle of CMOS VLSI Design‟, Addison Wesley,
1994.
 Geiger, Allen & Strader,‟ VLSI Design Tech. for Analog & Digital Circuits‟,
MGH, 2010.
 Pucknel, „VLSI Design‟,PHI, 2009.
 J. Bhaskar, „VHDL‟, PHI, 1994.
References Books:
 P.E. Allen and D.R. Holberg, „CMOS Analog VLSI Design‟, OUP, 2002.
 Ken Martin, „Digital Integrated Circuit Design‟, OUP, 2004.
75
 S.M. Kang and Y. Leblebici, „CMOS Digital Integrated Circuits‟, TMH, 2002.
 Baker, Li and Boyce, „CMOS Circuit Design, Layout and Simulation‟, PHI,
1997.
 M.Ismail and T. Fietz, „Analog VLSI Signal and Information Processing‟,
MGH, 1993.
76
Applied Probability and Statistics: 16CE-710
Credits: 4(3L, 1 T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Probability: Sample space and events – Probability – The axioms of probability –
Some Elementary theorems - Conditional probability – Baye‟s theorem; Random
variables – Discrete and continuous – Distribution – Distribution function. 8L
UNIT II:
Binomial and poison distributions Normal distribution – related properties; Sampling
distribution: Populations and samples - Sampling distributions of mean (known and
unknown) proportions, sums and differences. 14L
UNIT III:
Estimation: Point estimation – interval estimation - Bayesian estimation. 6L
UNIT IV:
Test of Hypothesis – Means– Hypothesis concerning one and two means– Type I and
Type II errors; One tail, two-tail tests; Tests of significance – Student‟s t-test, F-test,
2 test; Estimation of proportions. 14L
UNIT V:
Queuing Theory: Pure Birth and Death Process M/M/1 Model and Simple Problems.
6L
Text Books:
 T. K. V. Iyengar, B. Krishna Gandhi and Others,” Probability & Statistics”, S.
Chand & Company, 2008
 Shahnaz Bathul “A textbook of Probability & Statistics”, 2nd Edition, V. G. S.
Book Links.
References:
 Arnold O. Allen,” Probability & Statistics”, 2nd Edition, Academic Press, 2010
 Miller and John E. Freund ,“Probability & Statistics for Engineers”, Prentice Hall
of India, 2008.
 Mendan Hall, “Probability & Statistics”, Beaver Thomson Publishers.
 D. K. Murugeson & P. Guru Swamy ,“Probability & Statistics” Anuradha
Publishers.
77
Multimedia Technologies: 16CE-711
Credits: 4(3L, 1 T)
Total Hours: 48
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. 9L
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.
10L
UNIT III:
Digital Video Compression: Compression Models, Lossy Compression, Lossless
Compression, JPEG and Motion JPEG, MPEG 1, MPEG 2, MPEG 4, Compression
Standards. 10L
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. 9L
Text Books:
 Yan Zhang, Shiwen Mao, Laurence T. Yang, “Broadband Mobile Multimedia:
Techniques and Applications”, auerbach, 2008
 Ganzalez & Woods, “Digital Image Processing”, Pearson.
References:
 Shiguo Lian, “Multimedia Content Encryption: Techniques and Applications”,
Auerbach, 2008
 Rogers & Adams, “The mathematical element of Computer Graphics”,2nd
Edition, MGH, 2009.
 Genevieve Crabe, “Macintosh Graphic Techniques for Multimedia, morgan
Kaufmann, 1996
78
Soft Computing: 16CE-712
Credits: 4(3L, 1 T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Introduction - Soft Computing Concept Explanation - Importance of Tolerance of
Imprecision and Uncertainty - Biological and Artificial Neuron - Neural Networks -
Adaline - Perceptron - Back Propagation Neural Networks - Feed forward Multilayer
Networks. 9L
UNIT II:
Types of Neural Networks - Competitive Learning - Kohonen Maps - CPN - ART –
Neocognitron Neural Networks - Neural Networks as Associative Memories: Hopfield
and Bidirectional Associative Memory. 9L
UNIT III:
Fuzzy Systems – Fuzzy Sets – Operations and Properties - Fuzzy Rules and Reasoning –
Fuzzy Inference Systems – Fuzzy Models.- Adaptive Neuro-Fuzzy Inference Systems.
10L
UNIT IV:
Derivative-based Optimization – Derivative-free Optimization – Genetic Operations –
Crossover – Mutation – Fitness Scaling – Inversion - Genetic Algorithms. 10L
UNIT V:
Applications: Printed Character Recognition – Inverse Kinematics Problems -
Automobile Fuel Efficiency Prediction – Soft Computing for Color Recipe Prediction.
10L
Test Books:
 J.S.R. Jang, C.T. Sun and E. Mizutani, “Neuro-Fuzzy and Soft Computing”, Prentice
Hall of India, 2007.
 Aliev, R.A and Aliev, R.R, “Soft Computing and its Application”, World Scientific
Publishing Co. Pvt. Ltd., 2001.
 S. Rajasekaran and G.A.V. Pai, “Neural Networks, Fuzzy Logic and Genetic
Algorithms”, Prentice-Hall of India, 2003.
References:
 Jang J.S.R., Sun C.T. and Mizutani E, "Neuro-Fuzzy and Soft computing",
Prentice Hall 1998.
 Timothy J. Ross, "Fuzzy Logic with Engineering Applications", McGraw Hill,
1997.
 Laurene Fausett, "Fundamentals of Neural Networks", Prentice Hall, 1994.
 George J. Klir and Bo Yuan, "Fuzzy sets and Fuzzy Logic", Prentice Hall, USA
2005.
79
Principles & Practice of Management: 16BM-801
Credits: 3 (3L)
Total Hours: 36
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. 6L
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, Span of Control, Delegation of Authority,
Authority & Responsibility, Organizational Design. 8L
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. 8L
UNIT IV:
Leadership: The Core of Leadership: Influence, Functions of Leaders, Leadership
Style Communication: Communication Process, Importance of Communication,
Communication Channels , Barriers to Communication. 8L
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. 6L
Text Book:
 Prasad, L.M., „Principles & Practices of Management‟6/e, Sultan Chand
Publication, New Delhi, 2001.
 Gupta, C.B. „Modern Business Organization‟. Mayer Paper Books, New
Delhi, 2002.
80
Reference Books:
 Stoner, Freeman & Gilbert Jr, „Management‟6/e, Prentice Hall of India,1995.
 Koontz, „Principles of Management „1/e, Tata Mc Graw Hill, 2008.
 Robbins & Coulter, „Management‟8/e, Prentice Hall of India, 2010.
 Robbins S.P. and Decenzo David A., „Fundamentals of Management:
Essential Concept and Application‟5/e, Pearson Education,2010.
 Hillier Frederick S. and Hiller Mark S., „Introduction to Management Science:
A Modeling and Case Studies Approach with Spreadsheets‟2/e, Tata Mc Graw
Hill ,2008.
 Weihirch Heinz and Koontz Harold, „Management: A Global and
Entrepreneurial Perspective‟12/e, Mc Graw Hill, 2008.
81
Cryptography: 16CE-802
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
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. 10L
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,
10L
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 9L
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. 9L
Text Books:
 Jan C. A. & Van Der Lubbe, “Basic method of cryptography”, Cambridge

University press, 1998.
 Ranjan Bose, “Information theory Coding and Cryptography”, Tata Mcgraw Hill
Education, 2008
References:
 S.Kasana, “Complex Variables Theory And Applications”, 2nd Edition, PHI, 2008
82
Robotics: 16CE-803
Credits: 4(3L, 1T)
Total Hours: 48
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. 9L
UNIT II:
Dimensions of Object, Color differentiation, Gray level images, color Images, Length
estimations, Automated visual inspection, Object recognition & matching. 10L
UNIT III:
Stereo geometry & correspondence, Motion analysis, Optical flow, Robot arm, Robot
sensing, Speech Recognition. 9L
UNIT IV:
Imaging, recognition captured imagery, stereoscopy of images, Application of
computer vision, Bio-medical imaging, Document processing, Optical character
recognition (OCR) 10L
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”, mcgraw-hill, 2010
 Gonzalez, “Digital Image Processing”, Pearson,2008
References:
 Jain, “Machine Vision”, MGH, 1995.
 Forsyth, “Computer Vision- A modern Approach”, Prentice Hall, 2011.
83
Wireless Communication : 16CE-804
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT-I
Wireless local area network (LAN), applications, requirements, technology – Infrared
(IR) wireless LAN, diffuse, quasi-diffuse and point-to-point IR wireless LAN,
Narrowband Microwave LAN, Bluetooth: architecture and application, Wireless local
loop (WLL): configuration, advantages and its propagation characteristics. 9L
UNIT-II
Spread Spectrum Communication: definition, types, process gain, pseudo-random
sequences, direct sequence spread spectrum (DSSS), frequency hopping spread
spectrum (FHSS), Limitations of conventional mobile system, mobile cellular
communication: introduction, concept of frequency reuse, cluster size, cellular system
architecture: mobile station, base station, Mobile Switching centre, description of
mobile radio environment, introduction to radio wave propagation, concepts of free
space propagation model, comparison of first generation(1G) second generation (2G)
and third generation (3G) wireless cellular networks. 12L
UNIT-III
Global System for Mobile (GSM): services and features, system architecture, GSM
radio interface, protocols, GSM channel types, location updating and call setup,
handover, General packet radio service (GPRS). Introduction to Code Division
Multiple Access (CDMA), digital cellular standard, comparison between GSM and
CDMA. 12L
UNIT-IV
Brief history and overview of satellite communications, Orbital mechanics,
Transponder model, Satellite link design: basic transmission theory, system noise
temperature and G/T ration for earth stations, design of uplink and downlink. 8L
UNIT-V
Satellite Mobile Communication, GEO, MEO, LEO system, routing, localization and
handover, direct broadcast satellite receiving system ,Global positioning system:
basic principles of position fixing with GPS, GPS application. 7L
Text Book:
 Jochen Schiller,”Mobile Commnications”,2nd Edition, Pearson Education,
2003
 William C.Y.Lee, “Mobile cellular telecommunications: analog & digital
systems”,2nd Edition, MGH, 2006
 Kamilo Feher,”Wireless Digital Communications”,2nd Edition,PHI, 2009
 Stallings,”Wireless Communication & Networks”, 2nd Edition, Pearson
Education,2004.
 Pratt,Bostian,Allnutt,”Satellite Communiation”, 2nd Edition, Wiley, 2003
84
Reference Book:
 Theodore S. Rappaport, “Wireless communications: principles and practice”,2nd
Edition, Pearson, 2011
 Aggarwal, Vikas ,“Introduction to Wireless & Mobile Systems”, 2nd Edition, John
Wiley & Sons.
 D. C. Agarwal, “Satellite communication”, Khanna publishers, 2004
 Santamaria et al, “Wireless LAN systems”, Artech House, 1994
 Talukder & Roopa Yavagal, “Mobile Computing”, 2nd Edition,TMH 2010.
 Black U D,” Data Communication and Distributed Networks”, 3rd Edition, PHI, 2009
 Douglas E Comer, “Computer Networks and Internets”, Pearson Education,
2008
 Tanenbaum, “Computer Networks”,4th Edition, PHI, 2006
85
Internetworking with TCP/IP: 16CE-805
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Introducing TCP/IP networks: What TCP/IP provides: key application services and
multivendor capabilities, TCP/IP and the Internet, How Internet RFCs and STDs
affect TCP/IP. Introducing TCP/IP protocol architecture: Protocol layering concepts,
TCP/IP layering, Components of TCP/IP networks 9L
UNIT II:
Internet Layer functions: Fundamental internetworking concepts, Connecting
networks, Providing Physical Layer independence, Internet addressing: Classless
Addressing vs. Classful Addressing (Class A, B, C),Examining IPv4 headers. Address
resolution: Resolving MAC addresses with ARP, Avoiding duplicate IP addresses
with RARP, BOOTP and DHCP. IP address resolution: Building your own IP
network, NIC-registered addresses, Using private IP addresses: application proxy
firewalls, Introduction to IPv6, IP on non-Ethernet LANs: SNAP and LLC. 9L
UNIT III:
Implementing routed networks: The role of the IP router, Common IP routing
protocols: RIP, OSPF, Troubleshooting router problems. Going beyond the intranet:
Subdividing IP networks (subnetting),Control messages on IP networks: ICMP,
Subnetting and supernetting calculation formulas, Classless Inter-Domain Routing
(CIDR), Network Address Translation (NAT) 10L
UNIT IV:
Transport Layer fundamentals: The role of the transport protocol, Reliable vs best-
effort services. The Transmission Control Protocol (TCP): Providing a reliable data
delivery with TCP, Associating remote applications using port numbers and process
addressing, TCP packet structure, TCP performance issues, Troubleshooting the
protocol successfully. The User Datagram Protocol: Connectionless protocol
operation, Providing reliability at the Application Layer. 10L
UNIT V:
Functions and operation of application protocols: File transfer protocols: FTP, TFTP,
Network Virtual Terminal (TELNET), Employing DNS BIND, Examining SMTP
headers, Utilizing workstation mail: POP3, IMAP4, Examining the mechanisms of
VoIP. Vendor implementations: Sharing files with NFS. NFS protocols: RPC, XDR,
others , TCP/IP for Windows Server and UNIX. Managing TCP/IP networks: SNMP
management paradigm, Simple Network Management Protocol (SNMP), The
management database: MIB, SNMP evolution: MIB I and II, RMON, SNMPv2,
SNMPv3. Exploring Internet Services: Internet service access methods: Permanent
direct connection, Building virtual private networks (VPNs) with PPP. Internet
service tools: Retrieving files using Anonymous FTP. 10L
86
Text Books:
 Douglas E Comer, “Internetworking with TCP/IP vol-I,II,III”, Prentice Hall,
2005
 Douglas E Comer, “Computer Networks and Internets”, Pearson Education,
2008
 W. Richard Stevens, “TCP/IP Illustrated Vol. I”, Pearson Education, 2006
References:
 G. Shanmugarathinam, “Essential of TCP/ IP”, Laxmi, 2008
 William Stalling, “Data and Computer Communication”,8th Edition, Pearson
Education,2007
 Andrew S. Tanenbaum “Computer Networks”, 4th Edition, Pearson Education,2002
87
Natural Language Processing: 16CE-806
Credits: 4(3L, 1T)
Total Hours: 48
8 x 12(Marks)} = 60.
UNIT I:
Introduction of Natural Language Processing, Ambiguity and uncertainty in language,
the Turing test. Regular Expressions and automata: Regular expressions – Finite-State
automata. Morphology and Finite-State Transducers: Survey of English morphology –
Finite-State Morphological parsing – Combining FST lexicon and rules – Lexicon-
Free FSTs: The porter stammer – Human morphological processing.
7L
UNIT II:
Word classes and part-of-speech tagging: English word classes – Tag sets for English
– Part-of-speech tagging – Rule-based part-of-speech tagging – Stochastic part-of-
speech tagging – Transformation-based tagging – Other issues. Context-Free
Grammars for English: Constituency – Context-Free rules and trees – Sentence-level
constructions – The noun phrase – Coordination – Agreement – The verb phase and
sub categorization – Auxiliaries – Spoken language syntax – Grammars equivalence
and normal form – Finite-State and Context-Free grammars – Grammars and human
processing. Parsing with Context-Free Grammars: Parsing as search – A Basic Top-
Down parser – Problems with the basic Top-Down parser – The early algorithm –
Finite-State parsing methods. 12L
UNIT III:
Features and Unification: Feature structures – Unification of feature structures –
Features structures in the grammar – Implementing unification – Parsing with
unification constraints – Types and Inheritance. Lexicalized and Probabilistic Parsing:
Probabilistic context-free grammar – problems with PCFGs – Probabilistic lexicalized
CFGs – Dependency Grammars – Human parsing. 8L
UNITIV:
Representing Meaning: Computational desiderata for representations – Meaning
structure of language – First order predicate calculus – Some linguistically relevant
concepts – Related representational approaches – Alternative approaches to meaning.
Semantic Analysis: Syntax-Driven semantic analysis – Attachments for a fragment of
English – Integrating semantic analysis into the early parser – Idioms and
compositionality – Robust semantic analysis. Lexical semantics: relational among
lexemes and their senses – Word Net: A database of lexical relations – The Internal
structure of words – Creativity and the lexicon. 12L
UNIT V:
Word Sense Disambiguation and Information Retrieval: Selectional restriction-based
disambiguation – Robust word sense disambiguation – Information retrieval – other
information retrieval tasks. Natural Language Generation: Introduction to language
generation – Architecture for generation – Surface realization – Discourse planning –
Other issues. Machine Translation: Language similarities and differences – The
88
transfer metaphor – The Interlingua idea: Using meaning – Direct translation – Using
statistical techniques – Usability and system development. 9L
TEXTBOOK
 Daniel Jurafsky & James H.Martin, “Speech and Language Processing”, 2nd
Edition, Pearson Education, 2002.
REFERENCE
 James Allen, “Natural Language Understanding”, 2nd Edition, Pearson

Education, 2007.
89
Digital Image Processing: 16CE-807
Credits: 4(3L, 1 T)
Total Hours: 48
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.9L
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.10L
UNIT III:
Two dimensional orthogonal and unitary transforms, properties of unitary transforms,
one dimensional DFT, cosine, sine Harmed and Haar transforms. 9L
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. 10L
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,
2010
 Gonzalez Rafel C & Wintz Paul, “Digital Image Processing” , 2nd Edition,
Addison Wesley, 2001
References:
 Rosenfield Azriel & Kak Avinash, “Digital Image Processing” , Academic
Press, 1982
 Pratt William K, “Digital Image Processing”, 4th Edition,John Wiley and Sons,
2007
90
Cloud Computing: 16CE-808
Credits: 4(3L, 1 T)
Total Hours: 48
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. 10L
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. 10L
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 10L
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. 9L
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 9L
Text Books :
 Rajkumar Buyya, James Broberg, Andrzej Goscinski, “Cloud Computing:
Principles And Paradigms”, John Wiley & Sons, 2011
 Ronald L. Krutz, Russell Dean Vines, “Cloud Security - A Comprehensive
Guide To Secure Cloud Computing”, Wiley India Pvt Ltd, 2010
91
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, 2009
 Kevin Roebuck, “Cloud Computing Security: High-Impact Emerging
Technology”, Tebbo, 2011
 Tiberiu Tajts, “Cloud-Computing-Security”, Createspace, 2011
92
Pattern Recognition: 16CE-809
Credits: 4(3L, 1T)
Total Hours: 48
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. 9L
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.
10L
UNIT III:
Maximum likelihood estimation: expectation maximization EM, maximum likelihood
estimation, parametric and nonparametric estimation, Hidden Markov Model (HMM).
9L
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, K-
means algorithm. 10L
Text Books:
 B. Chanda, D Dutta Majumder, “Digital Image Processing”, PHI,2002
 Gonzalez, Woods, “Digital Image Processing”, 3rd Edition, Pearson Education,
2008
 Jiawei Han and Micheline Kamber, “Data Mining Concept and techniques”,
2nd Edition,Elsavier, 2011.
References:
 D Dutta Majumder, S K Pal, “Pattern Recognition”,PHI
 Foley, “Computer Graphics”, Addison Wesley, 2002
93
Mobile Computing: 16CE-810
Credits: 4 (3L 1T)
Total Hours: 48
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. 9L
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: multi-path and fading in signals, co-channel
suppression, and GMSK modulation. 10L
UNIT III:
Satellite mobile communication: Orbital mechanics: GEO, MEO, LEO system,
personal communication system (PCS), satellite PCS, Third generation Mobile
system. 9L
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. 10L
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. 10L
Text Books:
 Talukder & Roopa Yavagal, “Mobile Computing”, 2nd Edition, TMH 2006
 Black U D, “Data Communication and Distributed Networks”, 3rd Edition, PHI,
2009
94
References:
 Douglas E Comer, “Computer Networks and Internets”,5th Edition, Pearson
Education, 2008
 Andrew S. Tanenbaum,”Computer Networks”, Pearson,4th Edition, 2003
95
Web Technology: 16CE-851
(Open Elective)
Credits: 3(3L)
Total Hours: 36
Total 8 nos. of questions: {Q. 1 (a-f) 6 x 2(Mark) (Compulsory) + Any four (4) from
Q.2-8 x 12(Marks)} = 60.
UNIT I: History of the Internet and World Wide Web, Growth of the Web, Protocols
- HTTP, FTP, SMTP, POP3, MIME, IMAP. Choosing an ISP, Introduction to Internet
Services, E-Mail concepts, Sending and Receiving secure E-Mail . 6L
UNIT II: Web project, Web Team, Communication Issues, the Client, Multi-
departmental & Large scale Websites, Quality Assurance and Testing, Technological
advances and Impact on Web Teams, Overview of Static or Dynamic Web page,
Portal, Search Engine. 6L
UNIT III: HTML: Concept of Hypertext, Versions of HTML, Elements of HTML,

Formatting Tags, Links, Hyperlinks, Image & Image map, List, Tables, Frames,
Forms, Style Sheets, Background and Color Controls. DHTML: Introduction to
DHTML. Advanced Netscape DHTML, Advanced Microsoft DHTML & Cross
browser DHTML JavaScript: Introduction, Statements, Functions, objects in
JavaScript, Events and Event Handling, Arrays, FORMS, Buttons, Checkboxes, Text
fields and Text areas. 9L
UNIT IV: XML: Introduction, Problems with HTML & SGML, Types of XML
Markup, Displaying an XML Document, Document Type Definitions (DTD),
Linking, Using Style Sheets with XML. Data Interchange with an XML document,
Document type definitions, Client-side usage, Server Side usage 6L
UNIT V: ASP.NET, Features of ASP.NET, Differences between ASP and ASP.NET.

Create an ASP.NET web application, ASP.NET web forms, ASP.NET controls
validation controls, web server controls. Web database tools: overview of ADO.NET,
difference between ADO and ADO.net ADO.NET architecture, Accessing data
adapters and datasets, SQL server and AMS-ACCESS. 9L
Text books:
1. Burdman, “collaborative web development” addision Wesley
2. ASP.NET 21 days, SAMS, 2nd Edition
3. Dr. Ravinder Singh & Amit Gupta,“magic with HTML, DHTML, Javascript”, Laxmi
publication.
Reference:
1. Ramesh Bhangia “web technology”, Laxmi publication
96
GUI- Programming with WxWidgets: 16CE-852
(Open Elective)
Credits: 3(3L)
Total Hours: 36
from Q.2-8 x 12(Marks)} = 60.
UNIT-I
What Is wxWidgets?Why Use wxWidgets? A Brief History of wxWidgets, The
wxWidgets Community, wxWidgets and Object-Oriented Programming ,License
Considerations .The wxWidgets Architecture wxMSW, wxGTK, wxX11, wxMotif,
wxMac , wxCocoa, wxWinCE,wxPalmOS, wxOS2, wxMGL. 6L
UNIT-II
Event Handling: Event-Driven Programming, Event Tables and Handlers, Skipping
Events, Pluggable Event Handlers, Dynamic Event Handlers, Window Identifiers,
Defining Custom Events. Window Basics: Anatomy of a Window,The Concept of a
Window, Client and Non-Client Areas, Scrollbars, Caret and Cursor, Top-Level
Windows, Coordinate System, Painting, Color and Font, Window Variant, Sizing,
Input, Idle Time Processing and UI Updates, Window Creation and Deletion, Window
Styles. 6L
UNIT-III
Drawing and Printing, Understanding Device Contexts - Available Device Contexts,
Drawing on Windows with wxClientDC, Erasing Window Backgrounds, Drawing on
Windows with wxPaintDC, Drawing on Bitmaps with wxMemoryDC, Creating
Metafiles with wxMetafileDC, Accessing the Screen with wxScreenDC, Printing with
wxPrinterDC and wxPostScriptDC. Drawing Tools - wxColour, wxPen, wxBrush,
wxFont, wxPalette. Device Context Drawing Functions - Drawing Text, Drawing
Lines and Shapes, Drawing Splines, Drawing Bitmaps, Filling Arbitrary Areas,
Logical Functions. Using the Printing Framework - More on wxPrintout, Scaling for
Printing and Previewing, Printing under Unix with GTK+, 3D Graphics with
wxGLCanvas. 10L
UNIT IV
Handling Input : Mouse Input - Handling Button and Motion Events, Handling Mouse
Wheel Events. Handling Keyboard Events - An Example Character Event Handler,
Key Code Translation, Modifier Key Variations, Accelerators. Handling Joystick
Events - wxJoystick Events, wxJoystickEvent Member Functions, wxJoystick
Member Functions. Window Layout Using Sizers: Layout Basics , Sizers, Common
Features of Sizers, Further Layout Issues. Using Standard Dialogs: Informative
Dialogs, File and Directory Dialogs, Choice and Selection Dialogs, Entry Dialogs,
Printing Dialogs 6L
UNIT V
Programming with Images - Image Classes in wxWidgets. Clipboard and Drag and
Drop - Data Objects, Using the Clipboard. Data Structure Classes - Strings, wxArray,
wxList and wxNode, wxHashMap, Storing and Processing Dates and Times, Helper
Data Structures. Files and Streams - File Classes and Functions, Stream Classes.
97
Writing Multithreaded Applications - When to Use Threads, and When Not To, Using
wxThread, Synchronization Objects, Alternatives to Multithreading. Working with
Documents and Views - Document/View Basics, Other Document/View Capabilities,
Strategies for Implementing Undo/Redo. 8L
Text Books:
1. Julian Smart and Kevin Hock with Stefan Csomor, “Cross-Platform GUI
Programming with wxWidgets”, Prentice Hall
References:
WxWidgets online manual (http://docs.wxwidgets.org/)
98
JAVA Programming: 16CE-853
(Open Elective)
Credits: 3(3L)
Total Hours: 36
from Q.2-8 x 12(Marks)} = 60.
UNIT-I
Java Evolution: History – Features – How Java differs from C and C++ – Java and
Internet – Java and www –Web Browsers. Overview of Java: simple Java program –
Structure – Java Tokens – Statements – Java Virtual Machine. 5L
UNIT-II
Constants, Variables, Data Types - Operators and Expressions – Decision Making and
Branching: if, if-else, nested if, switch-case : Operator - Decision Making and
Looping: while, do, for – Jumps in Loops - Labeled Loops – Classes, Objects and
Methods. 10L
UNIT-III
Arrays, Strings and Vectors – Interfaces: Multiple Inheritance – Packages: Putting
Classes together – Multithreaded Programming.
10L
UNIT-IV
Managing Errors and Exceptions – Applet Programming – Graphics Programming.
Managing Input / Output Files in Java : Concepts of Streams- Stream Classes – Byte
Stream classes –Character stream classes – Using streams – I/O Classes – File Class –
I/O exceptions – Creation of files – Reading / Writing characters, Byte-Handling
Primitive data Types – Random Access Files. 11L
Text Books:
1. E. Balagurusamy, “PROGRAMMING WITH JAVA – A PRIMER”, 3 rd
Edition, TMH.
2. John R. Hubbard, “PROGRAMMING WITH JAVA” , 2nd Edition, TMH.
References:
 Patrick Naughton & Hebert Schildt, “THE COMPLETE REFERENCE JAVA
2” 3rd ed,TMH
 Kogent Learning Solutions Inc., "Java 7 Programming, Black Book", Wiley
India
99
Optimization Technique: 16CE-854
(Open Elective)
Credits: 3(3L)
Total Hours:36
8 x 12(Marks)} = 60.
UNIT I:
System orientation, se of interdisciplinary teams in OR, Necessity of OR in Business
and Industry, Scope of OR in modern management, OR and Decision Making,
Formulation of O.R. models, Introduction to different techniques. 4L
UNIT II:
Linear Programming formulation, Identification of decision variables, Constructing
Objective Functions and Constraints, Assumptions, Practical Examples. Methods of
Solution, Graphical Method: Simplex method(2-Phase and Big M methods, etc), By
computer.(Using Public Domain Software), Examples. 6L
UNIT III:
Duality theory: Existence of Dual of a LP problem, Economic Interpretation of
Duality. Primal Dual relationships in formulation and their solutions. Sensitivity
analyses or Post Optimality Analysis: Dual Simplex Method, Changes affecting
feasibility, Changes affecting optimality, Examples. 7L
UNIT IV:
The transportation algorithm: Formulation as a LP problem, Determination of Initial
solutions, Stepwise Improvement to obtain optimal solution, Special cases Such as
Multiple, Unbalanced, Degeneracy etc, The assignment model, Formulation as TP,
The Hungarian method of solution, Examples. 9L
UNIT V:
Minimal spanning tree problem, Shortest route problem, Maximal flow problem,
Critical Path Method (CPM), Program Evaluation and Review Technique (PERT),
Network representation of simple projects, Critical path computation, Construction of
time schedule, Crashing of project duration, Examples models. Queuing models:
Structure and components of a queuing process, Examples of real queuing systems,
Queuing theory assumptions , disciplines and notations, Single and Multi Channel
queuing models, Derivation of Necessary Formulae under steady-State conditions
only, Examples. 10L
TEXT BOOKS
 Frederick S.Hiller, Gerald J.Lieberman “Introduction to Operations Research”,
Pearson, 2001
 Hamdy A. Taha, “Operations Research An introduction”, 8th Edition, Pearson,
2008
 Harvey M. Wagner, “An introduction to
Operational Research”, R.R. Bowker.
100
REFERENCES
 Thomas G.Robertazzi, “Computer networks and systems (Queueing Theory
and Performance evaluation)”, springer, 2000
 Hans G.Daellenbach “Introduction to Operational Research trechniques”, John
Semester 3 – Detailed Syllabus IT3302 A. George
 Michael Q. Anderson , R.J.Lievano “Quantitative Management – An
Introduction “, 2nd Edition, Kent Pub, 1986
101
Grid Computing: 16CE-855
(Open Elective)
Credits: 3(3L)
Total Hours: 36
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 4L
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 5L
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 9L
UNIT IV:
THE OPEN GRID SERVICES INFRASTRUCTURE: Technical details of OSGI
specification, service data concepts, Naming and Change Management
Recommendations – OGSA basic services 9L
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 9L
Text Books :
 Fran Bermn, Geoffrey Fox, Anthony Hey J.G., “Grid Computing: Making the
Global Infrastructure a Reality”, Wiley, 2010
 Joshy Joseph, Craig Fallenstein, “Grid Computing”, Pearson Education, 2004
 Barry Wilkinson, “Grid Computing: Techniques And Applications”,
Chapman & Hall/crc, 2009
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
102

MZU Computer Engineering Syllabus

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

MZU Computer Engineering Syllabus

Hochgeladen von

Copyright:

Verfügbare Formate

Department of

Course Structure & Syllabi for

(W.E.F. Aug 2016)

BRANCH: Common for B.Tech.(CV and CE) Courses Year: I

L = Lecture, T= Tutorial, P = Practical Total Marks = 800

BRANCH : Common for B.Tech(CV and CE) Courses

Sl. Code No Title L T P Credit Marks

L = Lecture, T= Tutorial, P = Practical Total Marks = 800

Sl Code No Title L T P Credit Marks

L = Lecture, T= Tutorial, P = Practical Total Marks = 800

BRANCH : CE Year : II Semester : IV

Sl Code No Title L T P Credit Marks

L = Lecture, T= Tutorial, P = Practical Total Marks = 700

Branch: CE Year : III Semester :V

BRANCH : CE Year : III Semester :VI

Sl Code No Title L T P Credit Marks

L = Lecture, T= Tutorial, P = Practical Total Marks = 800

BRANCH : CE Year : IV Semester: VII

Sl Code No Title L T P Credit Marks

L = Lecture, T= Tutorial, P = Practical Total Marks = 600

“XX => 04 to 13”

Electives (as approved by the Department):

Code No. Subject

BRANCH : CE Year : IV Semester :VIII

Sl Code No Title L T P Credit Marks

L = Lecture, T= Tutorial, P = Practical Total Marks = 600

“XX => 02 to 11”

Total Credits (Course): 24+24+24+24+24+24+24+24 = 192

Total Marks (Course): 800+900+800+700+700+700+600+600=5800

Credits:4 (3L, 1T)

 sin  cos  sin

Credits: 4 (3L, 1T)

UNIT I Environment & Natural Resources

Unit III Solid Waste Management

2. Rajasekaran, S, Sankarasubramanian, G., “Fundamentals of Engineering

I. Theory (about various components involved in Workshop Practice)

II. Experiments : At least eight (8) experiments need to be conducted

1. Characteristics of Tungsten and Carbon filament lamps

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

10. Spectrophometric determination of copper.

11. Conductometric titration of weak acid with strong base.

Sketching and drawing of geometries and projections based on above

1. Familiarization with components such as Resistors, Capacitors,

2. Familiarization with DC Power supply, Multimeter, etc.

3. Familiarization with CRO for different electrical measurements.

4. Familiarization with Bread Board and Soldering practice.

5. Study on V-I characteristics of Junction Diode.

6. Study on V-I characteristics of Zener Diode.

7. Study on Half Wave and Full Wave rectifiers.

8. Study of CB, CE characteristics of BJT.

9. Study of Clipper and Clamper Circuit using Junction Diode.

10. Study of Voltage regulator Circuit using Zener Diode.

Credits: 4(3L, 1T)

1. Design & Realization of basic gates using Universal logic gates

4. Design & Realization of a simple Decoder Circuit