Saturday, 26 May 2012

University of Pune, Syllabus for Engineering , computer science, for year I,II, III & IV


Teaching Scheme                                 Examination Scheme
Lectures - 4 Hrs / Week                        Paper - 100 marks
( 3 hours duration )

(1) Complex Numbers with Applications :Definition, Cartesian, Polar and exponential forms, Argand's Diagram, Demoiver's Theorem, Roots of Complex numbers, hyperbolic functions and logarithms of complex numbers.

(2) Matrices :Elementary Transformations, rank of a matrix, Inverse by Elementary Transformation, reduction to the Normal form, Linear dependence and Independence, Consistency of systems of linear equations, Linear Transformations, Orthogonal Matrix, Characteristics equation, Eigen values and Eigen Vectors, Cayley - Hamilton Theorem. (15 Hrs)

(3) Differential Calculus :Successive Derivatives, Leibnitz Theorem, Taylor's Expansion, Maclaurin's expansion, Indeterminate forms, L'Hospital's Rule, Limits etc. Curve tracing - (Cartesian and Polar). (12 Hrs)

(4) Partial Differentiation and its Applications :Partial Derivatives, Euler's theorem, Implicit Functions, Total Derivatives, Change of Independent Variables, Errors and Approximations, Jacobians(14 Hrs)

Reference Books
(1) Advance Engg. Mathematics ( 7th edition ) by Erwin Kreyszig . ( Wiley - Eastern Ltd . Bombay )
(2) Engineering Mathematics by B S Grewal ( Khanna Publications, Delhi )
(3) Applied mathematics ( Volume - I) by P N Wartikar and J N Wartikar.
(4) Engg. Mathematics by S S Shastri
(5) Advanced Engg. Mathematics by Wylie ( Mc Graw Hill )


Teaching Scheme                              Examination Scheme
Theory - 4 Hrs / Week                        Paper - 100 Marks( 3 Hrs Duration )
Practicals - 2 Hrs / Week                    Term work - 25 Marks

1. Quantum Mechanics :Wave nature of matter, De broglie waves, Wavelength of matter waves, electron diffraction, Davisson and Germer's Experiment. Heisenberg's Uncertainty Principle with illustrations. Schrodinger's time dependent and time independent wave equation Physical significance of wave function. Application of Schrodinger's time independent wave equation to the problems of

(1) particle in a rigid box
(2) Particle in a non - rigid box
(3) Harmonic oscillator
(4) Hydrogen atom ( qualitative discussion ) (6 Hrs)

2. Nuclear Physics :Binding energy curve, Packing fracton curve, Nuclear reaction. Types of nuclear reactions . Q - value of nuclear reaction. Liquid drop model of nucleus. Nuclear fission in natural Uranium. Chain reaction and four- factor formula. Nuclear fuel and power reactor. Nuclear fusion and thermonuclear reactions. Merits and demerits of nuclear energy. Van - de - Graff generator. Cyclotron, Betatron ( 6 Hrs )

3. Electrical Properties :Band Theory of solids. Band structures of Lithium , Sodium, Berrylium, silicon and diamond. Classification of solids on the basis of band theory. Fermi - Dirac probability function and position of Fermi level in intrinsic semiconductors (with derivation ) and its extrinsic semiconductors. Conductivity in semiconductors. Hall effect and hall coefficient. Band structure of P-N junction diode under forward and reverse biasing. Working of PNP and NPN transistors under different types of configurations. Characteristics of transistors. Transistor as an amplifier. Solar cell and its characteristics. (7 Hrs)

4. Magnetic Materials and Spectroscopy :Ferrites and their uses. Hysteresis loop. Hard and soft magnetic materials. Effect of magnetic field on spectral lines. Zeeman effect ( normal and anomalous), Raman effect. Raman spectroscopy and its engineering applications. Determination of electro - optical constants from Raman and infrared intensities. (5 Hrs)

Term Work

Practicals ( Group I )
( Any five experiments from the following )
1. Determination of band gap of a semiconductor.
2. Semiconductor diode characteristics. (Ge, Si, Zener and LED )
3. Transistor characteristics (input, output and transfer characteristics in common emitter configuration ).
4. Study of solar cell characteristics and photocell characteristics.
5. Transistor as an amplifier.
6. Susceptibility measurement.
7. Hall coefficient and Hall effect.

(Any two of the following )
1. Hysteresis curve.
2. Raman effect.
3. Electron diffraction - Davisson and Germen Experiment.
4. Linear acceleration / Holography

1. Wehr and Richards - Atomic physics, Addison London
2. Yarwood - Atomic Physics
3. B L Thereja - Modern Physics S Chand & Co., New Delhi
4. J B Rajam - Atomic Physics S Chand & Co., New Delhi
5. Allen Mottershade - Electronic devices and Circuits Prentice Hall of India, New delhi

Section - II( 50 Marks )
( Applied Chemistry )

1. Structures & properties of solids :Mettalic bond, explanation of metallic properties ;
(I) Electrical conductivity
(ii) Thermal conductivity,
(iii) Metallic luster.
(iv) Softness, Malleability and ductility .
(v) Tensile strength
(vi) Elasticity
(vii) Melting point.
Types of solids ; Amorphous & crystalline solids, their properties and comparison , isotropy and anisotropy.
Crystallography; Unit cell, The laws of symmetry - plane, axis & center of symmetry. Crystal system. Internal structure of crystals, Bravais lattices, Cubic lattice. Crystal structures & related properties of sodium chloride , diamond, graphite, copper , silicates - mica and talc.
II Water :Structure of water, water are solvent, characteristic properties of water , water for industry. Types of hardness,Units of hardness. Effects of hard water in boilers & heat exchangers. Corrosion , priming , foaming caustic embrittlement , scales & sludges.
Water softening :
(i) Lime soda treatment.
(ii) Phosphate conditioning
(iii) The base exchange of permuted process.Numericals based on the calculation of lime & soda and on zeolite process.
(iv) Demineralization and deionization of water ( 6 Hrs)
III. Fuels :Classification of fuels, comparison between solid, liquid & gaseous fuels, calorific value and its units.
Criteria for selection of fuel
Gaseous fuels : Composition, properties and applications of water gas, natural gas, gobar gas and L P G.
Nuclear fuels : Nuclear fission, Nuclear reactors, Nuclear energy, Rocket fuels,. Plasma and controlled nuclear fusion, fuel cells, solar energy. ( 6 Hrs)
IV. Lubricants :Types of lubrication, fluid film lubrication, boundary lubrication and extreme pressure lubrication.
Function of lubricants .Classification of lubricants, solid, semisolid, liquid, emulsions, synthetic lubricants. Conditions for using different types of lubricants. Properties of lubricants and significance of the following properties :
(1) Viscosity and viscosity index.
(2) Neutralization Number
(3) Saponification value.
(4) Cloud and pour point.
(5) Oxidation stability
(6) Aniline point.
(7) Flash and fire point. ( 6 Hrs)

( Any five experiments from the following)
1) Estimation of total hardness of a given sample of water by E D T A method.
2) Estimation of chlorides in a given sample of water by Mohr's method.
3) Estimation of moisture and ash content in a given sample of coal.
4) Use of pH meter.
5) Determination of coefficient of viscosity by Ostwald's Viscometer.
6) Determination of aniline point of an oil.
7) Determination of neutralisation number of a lubricant oil.

Term Work ( 25 Marks )

Term work shall consist of laboratory record of experiments performed by the student, at least five experiments from Group I & Group II given above.

Reference Books
1. Engineering Chemistry - Jain & jain
2. Chemistry of Engineering Materials - Uppal, Khanna Publishers , New Delhi


Teaching Scheme                              Examination Scheme
Theory - 4 Hrs / Week                        Paper - 100 Marks(3 Hrs Duration)
Practicals - 2 Hrs / Week                    Term Work - 25 Marks

1. Sources of Energy : ( Eight Hours)Conventional and non-conventional energy sources, Thermal Geothermal, Hydraulic, Nuclear, Wind, Solar, Tidal, Wave , Biogas, Ocean thermal energy ( elementary treatment only).
Power producing devices ( Prime movers ) : Principles of reciprocating Steam engines, Steam turbines, reciprocating I.C. engines, gas turbines, Hydraulic turbines, Compressed air motor. ( Theoretical study using schematic diagrams ).
Power absorbing devices : Reciprocating pumps and compressors, centrifugal pumps, rotary compressors, blowers. Study of household refrigerators and window air conditioner using schematic diagrams (elementary treatment only).

2. Fundamental Concepts & Definitions ( Five Hours)Thermodynamic system surroundings and boundary, thermodynamic properties , processes and cycles. Units and dimensions. Energy , power, work, heat, Zeroth law of Thermodynamics, temperature and temperature scale, Macro and microscopic approach.

3. Laws of Thermodynamics ( Eight Hours)Principles of conversation of mass and energy. Continuity equation. First law of Thermodynamics : Joules experiments, Application of first law to flow and non flow processes and cycles. Concept of internal energy, flow energy and Enthalpy. Application of steady flow energy equation to nozzles, turbines and pumps. Second law of Thermodynamics : Limitations of first law. Clausius and Kelvin Plank statements, Concepts of reversibility and reversible cycle , carnot cycle for heat engine, refrigeration and heat pump. Carnot theorem , Concept of entropy.

4. Ideal Gases and Processes ( Six Hours)Ideal gas definition, Gas laws, equation of state , specific gas constant and Universal gas constant, specific heats , constant pressure , constant volume , isothermal , adiabatic, polytropic and throttling processes on p-v diagram.

5. Properties of Steam and Introduction to Steam Generator ( Six Hours )Formation of steam, phase changes, properties of steam, use of steam tables, Introduction to water tube & fire tube boilers.

6. Introduction to Heat Transfer ( Four Hours )Basic modes of heat transfer, Fourier's law heat conduction. Newton's law of cooling , Stephen - Boltzmann law of radiation heat transfer.Conducting and insulating materials and their properties . Description of types of heat exchangers.

7. Manufacturing Processes ( Eight Hours )Metal cutting machine tools : lathe, Drilling machine, Milling machine, Shaping machine, Power saw.Moulding & sand casting process . Forging : Hot forging - Hammer forging Drop forging, Press forging , Hot rolling , Cold forging - Cold rolling , Cold extrusion , wire drawing. Welding , Soldering & brazing methods and applications. Gas cutting process and equipments.

8. Mechanical Devices ( Eight Hours ) Drives : Individual and group drives, belt drive, rope drive, chain drive, gear drive and friction clutches. Elements : Power transmission shafts, axles, keys, couplings, bush and rolling contact bearings.. Valves : On - off valves, non return valves, pressure regulating valves, throttle valves, butterfly valves - with application of each type.

Term Work
The term work shall consist of a record of minimum eight experiments from amongst the list given below :
1) Experiment to demonstrate Joules law of constant internal energy for ideal gases.
2) Study of water tube boiler or smoke tube boiler.
3) Study of reciprocating air compressor. 4) Study of pneumatic tools.
5) Study of I.C engine and following systems : Lubrication , power transmission , ignition.
6) Study of household refrigerator / window air conditioner.
7) Study of heat exchangers.
8) Study of power transmission elements i.e couplings, gears, shafts, bearings etc.
9) Study of lathe and drilling machine with demonstration
10) Study of valves ( any three types )

Reference Books
1. Thermodynamics an engineering approach by Y A Cengel & M A Boles, McGraw Hill Inc.1994 or later edition.
2. Thermodynamics by K Wark Jr,. Mc Graw Hill Inc.1990 or later edition.
3. Thermodynamics by J P Holman Mc Graw Hill Inc 1990 or later edition.
4. Workshop technology by W A J Chapman, Edward Arnold Pub Co
5. Pumps, Valves, Pipes & Accessories Hand Book, Editor J Nagraj 1993 or later edition, Associate ( Data) Pub. Pvt ltd , Secunderabad 500003.
6. Valve Selection hand Book by R W Zape, Gulf Pub Co, Houston 1987 or later edition.
7. Processes & Materials of manufacture by Roy A Lindberg, Prentice Hall
8. Manufacturing Processes by M L Begman, John Wiley Publication.



Teaching Scheme                               Examination Scheme
Theory - 4 Hrs / Week                         Paper - 100 Marks( 3 hrs Duration )
Practicals - 2 Hrs / Week                     Term Work - 25 Marks

1. General :Revision of concepts of e.m.f ,p.d and current. Resistance, effect of temperature on resistance. Resistance temperature coefficient. Insulation resistance and effect of temperature and moisture on it. S.I units of works, power and energy, conversion of energy from one from to another in Electrical, Mechanical and thermal systems. Brief Discussion of types of generating stations and stages involved in transmission of electrical power from generating station to consumer. ( Descriptive treatment only) (6 Hrs)

2. Simple D.C Circuits :Ohm's Law, Kirchhoffs Law, Simplification of Networks using series and parallel combinations and star delta conversations, Superposition theorem . ( 4 Hrs)

3. Electric & Magnetic Fields :Magnetic effect of electric current, nature of magnetic field of a long , straight conductor, solenoid and toroid. Concept of m.m.f., flux, flux density, reluctance, permeability and filed strength, their units and relationships. Simple series and simple parallel magnetic circuits. Comaparison of electric and magnetic circuits. Statically and dynamically induced e.m.f self and mutual inductance, coefficient of coupling. Energy stored in magnetic field. Descriptive treatment of B - H curve, Hysteresis loop, Hysteresis loss and eddy current loss. Concept of electrostatic field and capacitance , charging and discharging, energy stored in electrical field. ( 10 Hrs)

4. Measuring Instruments ( Descriptive treatment only )Principle of operation and use of ammeters, voltmeters, wattmenters and energy meters, their ranges. Their use in AC and DC systems. Use of multimeters. ( 4 Hrs)

5. Single phase A.C Circuits : Sinusoidal voltages and currents, their mathematical and graphical representation. Concept of instantaneous , peak ( maximum), average and r.m.s. values, frequency, cycle,period, peak factor and form factor, phase difference. Phasor representation and indication of phase difference in it. Rectangular and polar representation of phasors.

Study of A.C circuits of purely resistive, purely inductive, purely capacitive type and corresponding voltage - current phasor diagram. Development of the concept of reactance. Study of simple series and simple parallel circuits consisting of resistance, inductance and capacitance , combinations, to develop concepts of impedance, admittance, conductance, susceptance and relevant voltage - current phasor diagram , concept of volt-ampere , power factor and power ( 10 Hrs)

6. Three phase A.C Circuits :Concept of three phase-supply and phase sequence. Voltage , current and power relation in three phase balanced star -connected loads and delta- connected loads along with the phasor diagrams. ( 3 Hrs)

7. Single phase Transformers :Construction , principle of working, e.m.f equation, voltage and current ratios. Losses, definition of regulation and efficiency. Determination of these by direct loading method. Descriptive treatment of Autotransformers and dimmestats, ( 4 Hrs)

8. Types and Testing of Domestic Wiring and Study of Lamps : Study of various wiring components and types of wiring systems. Necessity of earthing, use of megger for testing, wiring installations. Safety precautions in working with electricity circuits and operations of filament (GLS) lamps, fluorescent tubes, mercury-vapour lamps and sodium-vapour lamps. ( 5 Hrs ) Total (46 Hrs)

Term Work
The term work shall consist of record of minimum eight exercises and experiments, at least four from each group, listed below.

Group I
1. (a) Study of various wiring components ( wires, switches , fuses, sockets, plugs, lamp holders, lamps etc. Their uses and ratings )
(b) Wiring of consumer panels including energy meter.
2. Wiring Exercises :
(a) Control of two lamps from 2 switches ( looping in system).
(b) Staircase wiring
(c) Study of fluorescent tube circuit.
(d) Use of megger for insulation test and continuity test of wiring installations and machines.
3. Study of mercury-vapour lamp/sodium - vapour lamp.
4. Connection of single phase energy meter and its calibration.
5. Study of various types of measuring instruments.
6. Verification of Kirchhoffs laws and superposition theorem.
Group II
1. (a) Determination of low and medium resistance by voltmeter-ammeter method.
(b) Determination of temperature rise of a medium resistance such as shunt field winding.
2. Three - ammeter method of measuring power and inductance in an inductive circuit.
3. Three voltmeter method of measuring power and inductance in an inductive circuit.
4. Study of L C R Series circuits under conditions of unity p.f lagging p.f and leading p.f.
5. Single phase transformer.
(I) Voltage and current ratios.
(II) Efficiency and regulation by direct loading.
6. Current and voltage relations in three phase balanced star and delta connected loads.
Reference Books
1. Electrical Technology - Edward Hughes ( ELBS)
2. Elements of Electrical Technology - H. Cotton


Teaching Scheme                     Examination Scheme
Theory - 4 Hrs / Week               Paper - 100 Marks
( 3 hrs Duration )
Practicals - 2 Hrs / Week           Term Work - 25 Marks

1. Civil Engineering - Branches of Civil Engineering Application of Civil Engineering to allied fields. Role of Civil Engineer in various construction activities. Specific application in Industrial buildings, housing the different types of machines and equipment, transmission towers Power houses, Chemical plants, foundation for antenna towers, refractory linings of furnaces etc. (4 Hrs)

2. Linear and angular measurements
(a) Measurement of distance by chain and tape, survey figures, base line and offsets. Equipments for laying offset, optical square.
(b) Study of prismatic compass, types of bearings and reference meridians. Measurement of bearings and angles. Local attraction and its adjustment, chain and compass survey, adjustment of closing error.. (6 Hrs)

3. Vertical measurement - study and use of dumpy level, levelling staff, Leveling procedure and reduction of levels, contours - uses and characteristics of contours lines.

4. Modern Electronic Equipments
(a) Distance measuring equipments - Electronic Distance Meter
(b) Angle measuring equipments - Digital Theodolites
(c) Area measuring equipments - Digital Planimeter
Basic concepts of Remote sensing and its applications in various fields. (4 Hrs)

5. Introduction to the salient features of acts related with development works - Maharashtra Industrial Development Act , 1961, the Land Acquisition Act , 1894, The water (prevention and control of pollution ) Act,1974, The Maharashtra housing and Area Development Act 1976, The Maharashtra ( urban areas) preservation of trees act 1975, Environment Protection Act, 1986. (4 Hrs)

6. Construction
(a) Types -
(I) load bearing
(ii) Framed construction
(b) Superstructure and its use for different types of structures.
(c) Material of construction -
(I) Brick and stone masonry used for load bearing construction and panel walls .
(ii) P.C.C , R.C.C precast and prestressed concrete, Hallow block construction,
(iii) Prefabricated structures ( 6 Hrs)

7. Foundations -
(I) Functions of foundations , bearing capacity of soils, types of foundation and their suitability in different situations
(ii) Machine foundations, precautions for impact type of machines and reciprocating type machines, causes of failure of foundations. ( 4 Hrs)

8. Building planning - Requirement of plans, selection of site, F.S.I / F.A.R building bye-laws, open space requirements and bye-laws regarding setback distance, heights, distance from road center, Ventilation and lighting. ( 4 Hrs)

9. Environmental pollution - Sources of pollution - Industrialisation , Urbanisation, Energy utilisation, natural and manmade sources. Types of pollution - Air, Water, Solid waste and energy environment , noise, thermal and radioactive materials.

Introduction to :
(I) Air pollution - combustion, types of fuels and products of combustion and their problems, Global pollution CFC & Ozone, Green house effect, effects and controls of air pollution
(ii) Water pollution - Domestic & Industrial. Characteristics - Physical, chemical, biological, effects and control measures.
(iii) Solid wastes - characteristics, garbage, plastics etc. Industrial and hazardous waste, control measures - composting , incineration. (6 Hrs)

10. Energy and Environment - Utilisation of energy and its effect on environment, conventional and nonconventional sources and their impact. Measurement and Instrumentation - Methods of measuring the various pollutants, Instruments used for the measurement of pollutants, introduction to the latest techniques of measurement. (4 Hrs)

Term Work : Marks : 25
Practical exercises given below to be carried out and record to be submitted in the Field book which will form a part of term work.
1. Study of prismatic compass.
2. Observation of bearings and measurement of included angles and adjustments of angles and drawing the correct polygon.
3. Study of Dumpy level.
4. Reduction of R.L's by Collimation plane method.
5. Reduction of R.L's by Rise and Fall method.
6. Measurement of area of irregular figures by Digital and mechanical planimeter.
7. Layout plan of an Industrial building as per byelaws.
8. Study of modern electronic equipment for measurement of distances and angles.

Reference Books
1. Air Pollution - M.N Rao & H V Rao; Tata McGraw Hill.
2. Solid Waste Management - A D Bhide
3. Sanitary Engineering - S K Garg
4. Building Design and Drawing - Shah, Kale and Patki; Tata McGraw Hill
5. Foundation Engineering - Dr. B J Kasmalkar; PVG Prakashan
6. Surveying and Leveling - Kanetkar and Kulkarni; PVG Prakashan
7. Acts - Published by the Director, Government Printing Stationary and Publications, Maharashtra State Mumbai.


Teaching Scheme                               Examination Scheme
Theory - 1 Hrs / Week                        Term Work - 25 Marks
Drg. Practicals - 2 Hrs / Week

(1) Lines , Lettering , dimensioning & scales (3 Hrs)
Different types of lines used in drawing practice, method of dimensioning - aligned and unidirectional systems ( According to SP 46 : 1988 - Engineering Drawing Practice for Schools and Colleges ), scales.

(2) Orthographic projections (3 Hrs)
Principal planes of projection - Horizontal plane or Horizontal Reference Plane, Vertical Plane or Frontal Reference Plane, Profile planes of projections, projection of the objects on these planes, first and third angle methods of projection. Sectional views - full, half, partial (broken or local) offset, revolved, removed sections. Orthographic projections on principal and auxiliary planes.

(3) Isometric projections (3 Hrs)
Definition, isometric scale, drawing isometric view from the given orthographic views with reference to given origin.

(4) Interpretation of given views (3 Hrs)
reading of given orthographic view to draw additional views, i.e. missing views, to convert either of the given views into sectional views or to draw the missing view as sectional view.

(5) Curves used engineering practice & loci of points (2 Hrs)
To draw an ellipse, a helix, an involute of a circle a cycloid, Archimedian spiral. Loci of points on a moving links and on simple mechanisms such as slider crank mechanism etc.

Term Work
The Term work shall consist of four A2 (420 X 594mm ) or half imperial size drawing sheets as detailed below :

Sheet No 1 : Orthographic Views : To draw orthographic views of two objects by first and third angle method respectively, one of the views should a sectional view.
Sheet No 2 : Missing views and Isometric views : Two problems on missing views and two problems of isometric views.
Sheet No 3 : Curves and Loci : Two draw any two out of the following : an ellipse, a helix, an involute of a circle, a cycloid, Archemedian spiral and to draw the locus of a point on a moving link or on a simple mechanism.
Sheet no 4 : Machine Parts : To draw views of minimum 12 machine parts , out of which free hand sketches should be drawn for 6 parts and the views of 6 parts should be drawn using drawing instruments. Machine parts to be studied ( during practical period only) : types of nuts, bolts, threads, screws studs, locking arrangements for nuts, foundation bolts, knuckle joint, turn buckle etc.

Reference Books
(1) N D Bhatt , Elementary Engineering Drawing, Charotar Publishing House, Anan ( India)
(2) N D Bhatt , Machine Drawing, Charotar Publishing House, Anand ( India )
(3) K L Narayana & P Kannaiah, Engineering Graphics, Tata McGraw Hill, Publishing New Delhi
(4) Warren J Luzzader, Fundamentals of Engineering Drawing, Prentice Hall of India , New Delhi
(5) Frederick E Giesecke, Alva Mitchell & others, principles of Engineering Graphics, Maxwell McMillan Publishing.


(1ST Term) Teaching Scheme                            Examination Scheme
Practical - 2 Hrs / Week                                   Term Work - 25 Marks

Topics to be studied or demonstrated during Practicals. Names, uses and setting of hand tools for carpentry , smithy and welding. Each candidate shall be required to complete and submit the term work as mentioned below :
1. Carpentry : One job will teak wood joints, use of filler material, adhesives etc. along with wood turning
2. Smithy : One job with various operations ( minimum 2 operations )
3. Welding : One job using arc welding operation containing simple joint.
Workshop book should include description with sketches of all demonstrations of various operations on above trades.


Teaching Scheme                        Examination Scheme
Theory - 4 Hrs / Week                   Paper - 100 Marks( 3 Hrs Duration )

(1) Solid Geometry : Coordinate Systems, sphere, Cone and Cylinder - ( Total 12 periods )

(2) Differential Equations : ( of first order and first degree) Definitions, Order and degree etc. Variables separable, Homogeneos Differential Equations, Reducible to Homogeneous type, Exact Differential Equations, Reducible to Exact, Linear differential equation, Reducible to linear types, Methods of substitution and miscellaneous types. (Total 10 periods )

(3) Applications of Differential Equations : ( of first order and first degree) Motion under gravity and rectilinear motion, L-R, R-C and L-C. circuits. Newton's law of cooling One dimensional conduction of heat. ( Total 5 periods )

(4) Fourier Series : Definition and Diritchlet's condition. Full range Fourier Series on (C <=x<C+2n) Full range Fourier series on on (C <=x<= C+2L) half-range Fourier series , Applications to analysis of problems involving periodic disturbances. ( Total 6 periods )

(5) Integral Calculus ; ( Single integrals ) Reduction formulae for nth order Sinusoidal functions, Rectification, differentiation under sign of integration, Beta, Gamma and error functions. ( total 9 periods )

(6) Double and triple Integrations :

(7) Double and triple Integrations , application of multiple integral to Mean, RMS values, Areas and volumes, application of the multiple integrals to center of gravity and moment of inertia. ( Total 12 periods )

Reference Books
1) Advanced Engg. Mathematics ( 7th Edition) by Erwin Kreyszig ( Wiley eastern Ltd , Bombay )
2) Engg. Mathematics by B S Grewal ( Khanna Publications , Delhi)
3) Applied Mathematics (Vol II ) by P N Wartikar & J N Wartikar
4) Engineering Mathematics by S S Shastri
5) Advanced Engg. Mathematics by Wylie (McGrew Hill)



(Applied Physics)
Teaching Scheme                              Examination Scheme
Theory - 4 Hrs / Week                        Paper - 100 Marks( 3 Hrs Duration )
Practicals - 2 Hrs / Week                    Term Work - 25 Marks

1. Interference : Interference of waves - Interference due to thin films of uniform and nonuniform thickness, Newton's rings. Mechelson's interferometer. Engineering applications of interference. ( Accurate measurement of gauges, lengths, optical flatness and young's modulus. Non-reflecting coating). ( 3 lectures)

2. Diffraction : Diffraction of waves - classes of diffraction. Diffraction at a single slit( Geometrical method) , conditions for maxima and minima. Diffraction at a circular aperture ( result only) . Plane diffraction grating, conditions for principal maxima and minima. Dispersive power of grating, reyleigh's criterion for resolution. Resolving power of grating and telescope. (4 lectures)

3. Polarization : Polarization by reflection. Brewster's law, Double refraction and Huygen's theory, Positive and negative crystals, Nicol prism. Dichroism. Law of Malus. Elliptical and circular polarisation. Quarter and half wave plates, production of polarized light. Analysis of light, babinet compensator. ( 6 lectures)

4. Laser and X-Rays : Origin of X-rays, Continuous and characteristic X - Rays. Properties and Engineering applications of x-rays. X-ray diffraction, Laue spots, Bragg's law, Bragg's spectrometer, Compton effect and derivation of Compton shift. Spontaneous and stimulated emission. Population inversion. Ruby laser. Helium Neon Laser Engineering, Applications of Laser, Elements of fiber optics. Types of optical fibers, Numerical aperture. Optical Laws. Holography. ( 6 lectures)

5. Modern Physics : Motion of charged particle in electric and magnetic fields. Electrostatics and magnetostatics focussing. Electron microscope. Principle, construction, working and applications of cathode ray oscilloscope. Positive rays, Separation of isotopes by Bainbridge Mass Spectrograph. ( 3 lectures)

6. Acoustics : Elementary acoustics, Reverberation and reverberation time. Sabine's formula ( without derivation) . Intensity level. Acoustics of buildings. Limits of audibility. Ultrasonic waves. Production of ultrasonic waves by Piezo electric oscillator and magnetostrictive oscillator. Applications of ultrasonic waves. Moir Fringes. ( 2 lectures)

Term Work
( Practicals Group - I)
( Any five experiments from the following )

1. e/m by Thomson's method.
2. Wavelength by diffraction grating.
3. Newton's rings.
4. Resolving power of a telescope.
5. Uses of C.R.O. ( Amplitude, frequency, phase measurement, study of waveforms)
6. Ultrasonic interferometer
7. Experiment based on Laser.

Any two from the following
1. Michelson's Interferometer.
2. Measurement of intensity by intensity Level Meter.
3. Fiber Optics
4. Young's modulus by interference method.

Reference Book
1. Jenkins and White Fundamental of Optics
2. Subramaniam and Brijlal Optics
3. Sen , Gaur and Gupta Engineering Physics
4. B L Theraja A Text Book of Engineering Physics.,S Chand and Company. New Delhi
5. J B Rajam Modern Physics, S Chand & Co.
6. Wood Text Book of Sound.

SECTION - II ( 50 Marks )
( Applied Chemistry - II)

1. Phase Rule : Basic principles of Gibb's phase rule : Definition and explanation of different terms. Application of phase rule to one component system - Water . Effect of change of temperature and pressure on equilibria. Two component system - Solid - liquid equilibria, Simple eutectic system, eutectic mixture , Silver - lead system. Iron - carbon system. Merits and limitations of phase rule.

I.Alloys : Definiton, purposes of making alloys, methods of preparation of alloys, Alloys steel - heat resistant steels, corrosion resistant steels. Alloys of aluminium, magnesium and titanium, Bearing metals. ( 6 lectures)

II. Polymers : Definition Classification of Polymers, techniques employed for the production of polymers.
Plastics - Thermo softening and thermo - setting plastics.
Polymerisation reaction , properties and engineering uses of polythene, polyvinyl chloride, teflon, nylon, melamine - formaldehyde, Polyurathane, polymethyl - methacrylate.
Rubber : Natural rubber, drawbacks of natural rubber, Vulcanisation.
Synthetic Rubber : preparation, properties and applications of S.B.R , neoprene, butyl rubbers, and silicon rubbers. ( 6 lectures)

III. Non- metallic engineering materials :
(i) Cement : Chemical constitution of Portland cement, functions of different constituents. Theories of the setting of cement.
(ii) Refractories : Definition, properties, classification of refractories.
(iii) Surface coatings : paints-ingredients and their functions , emulsion paints, cement paints and distempers.
(iv) Abrasives : Introduction, types of abrasives and applications. ( 6 lectures)
IV) Corrosion :
Definition, atmospheric corrosion by oxygen, wet corrosion, Nernst's theory, Electrochemical series, mechanism of wet corrosion. Factors affecting corrosion - Nature of metal , nature of environment. Methods of prevention of corrosion - cathodic and anodic protection. Metallic and non-metallic coatings, surface treatments. Air pollution - its causes, air pollutants, control of air pollution. ( 6 lectures)

List of experiments ( Group II) ( Any five experiments from the following)
1. Estimation of copper from brass idiometrically . ( inclusive of dissolution of alloy, dilution etc.)
2. Estimation of percentage of iron in plain carbon steel.
3. Determination of percentage of calcium in cement.
4. Volumetric estimation of calcium oxide in dolomite by EDTA method.
5. Preparation of phenol formaldehyde plastic.
6. Determination of molecular weight of a polymer.
7. Estimation of rate of corrosion of aluminium in acidic and basic medium.

Term Work ( 25 Marks )
Termwork shall consist of laboratory record of experiments performed by students, at least five experiments from Group I and Group II given above.

Reference Books
1. Engineering Chemistry - Jain and Jain
2. Chemistry of Engineering Materials - Uppal, Khanna Publisher, New Delhi
3. Engineering Chemistry - Sharma
4. Chemistry of Engineering materials - S S Dara


Teaching Scheme                                Examination Scheme
Theory - 4 Hrs / Week                          Paper - 100 Marks( 3 Hrs Duration )
Practicals - 2 Hrs / Week                      Term Work - 25 Marks
Section A ( Stastics)

1. Introduction : Various axioms related to mechanics : Transmissibility of a force, Superposition of forces, Equilibrium of collinear forces, Unit vector, Force vector, direction consines; Resolution and composition of forces, resultant of following coplanar force systems :
(a) Concurrent
(b) parallel and
(c) General force system. Moment of force about a point, Varignon's theorem, Couple, Equivalent force system,. Graphical approach, resultant of distributed forces, Centroid of plane areas, Centroid of lines, Center of gravity of solids, Second moment of areas. ( 6 lectures)

2. Analysis of bodies in equilibrium ( Two dimensional problems) : Condition of equilibrium on concurrent, parallel and general force systems ( Graphical and Analytical method) equilibrium under 3 forces, Sine rule. Types of support reactions. Free body diagrams, reaction in simple and compound beams; principle of virtual work, Application to simple and compound beams.( 5 lectures)

3. Equilibrium of force systems involving frictional forces : Equilibrium on a rough inclined plane, Ladders, wedges and block systems. Flat and V-belts, Band-brakes . ( 4 lectures)

4. Engineering application of 2 force, and multi force members : Pin jointed and rigidly jointed simple plane frames, Cables under concentrated loads only.

5. Force systems in space : Moment of a force about a point, moment of a force about a line, equivalent force systems. Simple problems based on eqilibrium under concurrent and parallel systems of space forces. ( 4 lectures)

Section B ( Dynamics)

6. Kinematics of a particle : Rectilinear motion of a particle moving with variable acceleration , Relative motion. Curvilinear motion in plane Cartesian system, Polar co-ordinates and path variables, Dependent motion.

7. Kinetics of particles : Application of Newton's second law of motion , D"Alembert's principle, Work - Energy principle, Principle of conservation of Energy, Impulse- momentum principle. Problems on direct-central impact, Coefficient of restitution, Elastic and plastic impacts; problems on work and power. ( 6 lectures)

 Term Work
(A) The term work shall consist of minimum four experiments from each of the following 2 groups : ( Total eight experiments minimum)
(a) Statics :
1. Verification of Law of polygon of forces.
2. Reactive forces in simple and compound beams ( using load cell)
3. Belt friction - and V - Belts.
4. Concurrent space force systems
5. Worm geared pulley block / Wetson's differential pulley block.
(b) Dynamics :
1. Experiments based on curvilinear motion.
2. Moment of inertia of a flywheel
3. Torsional pendulum.
4. Compound pendulum.
(B) The Termwork shall also consist of Graphical solutions of :
1. At least four problems on statics , and
2. At least four problems on dynamics, based on topics in the Syllabus above.

Reference Books
1. Vector Mechanics for Engineers Vol I ( Statics), Vol II ( Dynamics) by F P Beer and E R Johnston, 5th Edn. Tata McGraw - Hill.
2. Engineering Mechanics by S P Timoshenko & D H Young, 4th .Edn. McGraw - Hill.


Teaching Scheme                              Examination Scheme
Theory - 4 Hrs / Week                        Paper - 100 Marks( 3 Hrs Duration )
Practicals - 2 Hrs / Week                   Term Work - 25 Marks

1. Zener break down effect, Avalanche breakdown in a junction diode. A zener diode characteristics, LED, photo emissive effect. LCD types and typical application in character display. ( 4 Hrs)

2. (a) Review of rectifiers, ripple factor, efficiency, filter circuits, capacitor input filter and its dependence on load and output voltage. Effect of output capacitor on average output voltage (3 Hrs)

(b)Block schematic, principle and specifications of series, shunt regulated power supplies. Three terminal IC regulator such as 78XX series and LM 317 regulator. ( 3 Hrs)

3. Bipolar transistor : Basic transistor in active state, current gain of the transistor in common base, common emitter and common collector configuration. Transfer characteristics as a switch, cut off and on states of transistor. ( 4 Hrs)

4. Principle of operation of signal amplification. Symbolic block diagram of a typical voltage amplifier. Input output impedannce concept, and gain constant of an amplifier. Input output impendance concept, and gain constant of an amplifier. Frequency response and B.W of amplifier, transfer characteristics. Description of a typical single stage R.C coupled amplifier using a C.E transistor ( small signal ) ( 4 Hrs)

5. Digital circuits : Principle of logic circuits, logic levels, logic operations AND, OR NOT. Logic functions, truth table representing logic functions with Boolean expressions. Logic gates AND,OR,NOT,NAND,NOR and XOR gates with symbols. Concept of combinational logic, Properties of TTL logic family. Definitions of term positive, negative logic threshold level, fan-in and fan-out concept. ( 6 Hrs)

6. operational Amplifier : I.C, Op-Amp as a black box, ideal Op-Amp, characteristics of INV and non-INV . Configuration of Op-Amp. Summing and difference amplifier. Unity gain buffer, Op-Amp as a comparator. ( 3 Hrs)

7. Feedback principles in electronic circuits. Concept of positive and negative feedback. RC oscillators using Op-Amp only. ( 3 Hrs)

8. Timing Circuits : principle of RC timers, Rc timer with trigger and reset inputs. Timer operation as an interval timer. Black box concept of I.C 555 as a timer. ( 4 Hrs)

9. Transducers, Sensors and actuators. Classification of signal transducer. Temperature and pressure sensors. Principles of thermocouple. RTD,LVDT and strain gauge transducers. Ultrasonic detectors, Infrared emitters and detectors. Actuators in control system. Electromagnetic relays, Solenoids. ( 7 Hrs)

10. Operation of dual trace oscilloscope , counter, its specification and front panel controls. ( 3 Hrs)

11. Value added telecommunication systems, Evolution of communication systems. P.A system, wired and R.F links. Introduction to T.V . Radar, Satellite communication. Principles of E-mail, fax , Pager and Electronic gadgets. Security systems. A typical case study. ( 6 Hrs)

List of Experiments
Group A : Study of electronic components for background preparation of following experiments. ( Compulsory) Detailed write up shall be included in the journal.
1. (a) Plot a zener diode breakdown characteristics and measure knee point voltage and dynamic resistance. (r ) OR
(a) Measurement of transistor current gain 'a' in CB configuration. Static transfer characteristic plot of 'a' against bias current Ie.
(b) Measurement of current gain ( b or hFE ) in CE configuration. Static transfer characteristic plot of Ic against Ib.
2. Study of bridge rectifier.
(a) rectifier circuit without filter. Measurement of Vo-average O/P and output ripple at different Il.
(b) Measuremnet and comparison with the theoretical values with a capacitor input filter for O/P average voltage and ripple. Effect of different resistive load currents. Plot of diode voltage drop in each of above. OR
To plot regulation and ripple characteristics of a simple positive three terminal regulator( LM 7805 or Lm 7812) and to compare the behavior with that in (a).

Note : this regulation is to be regarded as represented by a single block symbol.

Instruments recommended :
(1) Oscilloscope
(2) Digital Multimeters
(3) Variable regulated power supply.
3. Experiment based on a single stage amplifier.
A single stage RC coupled n-p-n / p-n-p transistor amplifier in CE configuration.
· To measure a small signal voltage gain at the specified signal frequency (1KHz to 10KHz)
· To plot frequency response characteristics.
· To plot the Transfer characteristics of the Amplifier and determine the Band Width (BW) and mid band gain.
To study and plot the DC amplifier small signal transfer characteristic and to determine,
Input resistance Ri
Midband gain Av
Output resistance Ro.
DC amplifier is to be implemented by a general purpose OpAmp. ( Like LM 741) as an inverting amplifier.
Note : OpAmp is to be used with symbolic representation of a typical voltage amplifier with necessary I/O terminating resistors.
4. Fixed frequency sine wave oscillator. RC oscillator - Wien bridge or a phase shift type using 2 voltage amplifier building block, implemented through an operational amplifier at a specified audio frequency. In this experiment actual frequency is to be measured and compared with the theorotically calculated value. Plot the frequency drift and amplitude variation against D-C supply variation ( in %) and / or oscillator load variation.
Instruments to be used for experiments 3 and 4 are :

(1) 15 MHz , dual trace oscilloscope.
(2) Sweep frequency ( Sine wave) generator.
(3) Frequency counter ( with 3 to 4 Digit Min)
(4 ) Logic Circuits : ( two experiments )
Testing the combinational logic with simple 'SPDT' switches as I/P & LEDs as O/P for the given problem, testing of I/C gates. Simple problems like ' a staircase logic' or ' Lift control logic" may be set.
(5) Experiment on Timer circuits .
To test an R-C timer with duration in msec, or secs, in a mono-stable multivibrator mode .
To test the same in ON-Delay or OFF-Delay timer configuration .
Use of timer circuit in Astable multivibrator mode with adjustable On & OFF duration.
Circuit to be checked for :
Note : Timer IC like LM 555 may be used but shown in the circuit as a general purpose single block-symbol. No internal IC circuit study is expected.

Instruments required :
1) DC regulated power supply.
2) Digital multimeters
3) Digital stop watch OR oscilloscope.

( Minimum 2 Experiments to be performed)

1) Use of a "CURVE TRACER ' for : Characteristics of BJT.
2) Displacement measurement using "LVDT transducer' and 'LVDT amplifier'.
3) Use of strain gauge transducer / amplifier.
4) RF-field measurement using RF-transmitter & a field strength meter.

Public Address system

A color Television CRT Monitor .
Communication system that includes either TELEX / MODEM / FAX / PAGER.
Electronic gadgets ( Minimum 3) such as :
1) V.H.F trans-receiver
2) Smoke Detector
3) Remote Control
4) Typical Security System
5) Ultrasonic Distance Meter
6) Electronic Weighing machine
Note : The Term Work shall consist of a journal on the performance of Nine exercises and Experiments are listed above. The Term work shall be assessed progressively by internal examiner.

Reference Books
1) Electronic Principles by Malvino; TMH Publication
2) Electronic Devices & Circuits by Allen Mottershead ; TMH Publication.
3) Telecommunication Engineering by Rambhadran ; Khanna Publishers
4) Instrumentation by Rangan , Amni , Sharma ; PHI
5) Essential of Electronics by Frank D Petruzella ; McGraw hill


Teaching Scheme                              Examination Scheme
Theory - 3 Hrs / Week                        Paper - 100 Marks( 4 Hrs Duration )
Practicals - 2 Hrs / Week Term Work - 25 Marks

1. Projection of point & lines ( 6 hrs)
Projection of points, projection of lines, inclined to both the principal planes ( lines fully lying in the first quadrant only ), traces of lines, distance of a point from a given line, distance between skew lines.

2. Projection of planes ( 6 hrs)
Projection of planes such as triangle , quadrilateral, regular polygon , circle. Angle between two planes, distance of a point from a given plane.

3. Projection of solids ( 5 hrs)
Projection of solids such as tetrahedron, cube, right regular prism & pyramid, cylinder, cone, sphere and frustums of solids, axis of the solid inclined to HP and VP, solids in combination.

4. Sections of solids ( 6 hrs)
Projections of solids cut by AIP or AVP, true shape of cut surface, to located the section plane to obtain the given true shape of section, projections of truncated solids.

5. Development ( 6 hrs )
Development of the lateral surface of the solids, to draw development of cut solids, to draw principal views of solid when its development is given.

6. Intersection of surfaces of solids ( 5 hrs)
To show lines of curves of intersection when a cylinder or prism penetrates another solid such as cylinder, prism, cone, pyramid or sphere ( axes of the solids intersecting and perpendicular to each other).

7. Computer Aided Drafting ( any computer aided drafting package ) ( 8 hrs)

Advantages of using Computer Aided Drafting package, applications of Computer Aided drafting, basic operation of drafting package, use of various commands for drawing , dimensioning editing, saving, and printing/ plotting the drawings.


Term Work
The Term work shall consist of four A2 ( 420 X 594mm) or half imperial size drawing sheets and two computer outputs using any drafting package as detailed below :
Sheet No 1 : Lines and Planes : One problem on lines and two problems on planes.
Sheet No 2 : Solids and Sections of Solids : One problem on projections of solids and two problems on sections of solids.
Sheet No 3 : Development of surfaces : One problem on development and one problem on antidevelopment.
Sheet No 4 : Intersection of Surfaces : Two problems .
Computer Aided drafting Assignment No 1 : Construction of two dimensional graph such as T - O diagram, P - V diagram, lift - angle diagram for a cam etc.
Assignment No 2 : Drawing standard machine parts such as hexagonal nuts, bolt, rivet, bearing, circlip, bracket, spring, flange etc. OR Isometric drawing of simple machine component.

Reference Books
1. N D Bhatt - Elementary Engineering Drawing, Charotar Publishing House , Anand ( India)
2. N D Bhatt - Machine Drawing, Charotar Publishing House , Anand ( India )
3. K L Narayana, P Kannaiah & K Venkata Reddy - Machine Drawing, New Age International Ltd
4. K L Narayana & P Kannaiah - Engineering Graphics, Tata McGraw Hill Publishing , New Delhi
5. Warren J Luzzader - Fundamentals of Engineering Drawing, Prentice Hall of India, New Delhi
6. Frederick E Giesecke , Alva Mitchell & others - Principles of Engineering Graphics, Maxwell McMillan publishing
7. Daniel raker & Herbert Rice - Inside AutoCAD , BPB Publications , New Delhi
8. George Omura - Mastering Auto CAD, BPB Publications , New Delhi


Teaching Scheme                        Examination Scheme
Lectures - 2 Hrs / Week
Practicals - 2 Hrs / Week Term Work - 25 Marks

1. Computer Organisation : Simple model of computer, stored program concept, Number representation in computers, bus concept, Main Memory, Secondary storage, peripherals - functional description , PC / AT concept - typical configuration. ( 4 hrs)

2. Programming : Properties of Algorithm, flow-chart, lower/higher level languages, C or C++ fundamentals; Operators and expression, data input/output, Running a C or C++ program, Control statements, Functions, Program structure, arrays, Introduction to pointers. ( 14 hrs)

3. General purpose software : Microsoft office usage for Documentation, Exposure to Fox Pro ( 6 hrs)

Term Work

Termwork shall consist of a record of at least six exercises in C including printout of program listing, Students must be exposed to usage of computers.

1. Exposure to DOS, formatting, File handling Commands, Editors.
2. Documentations using MS-office features.
3. Study of various declarations, control statements.
4. General of prime numbers, series.
5. Array handling problems : Linear sort.
6. Matrix manipulation : Addition, Subtraction and multiplication.
7. Functions: Set by Instructors
8. File Creations.
9. Suitable assignment for Fox Pro exposure.
Instructor will have flexibility in Framing the assignments. ( 4 to 8)

Reference Books
1. Kernighan & Ritchie - The C Programming Language ; PHI
2. Gottfried - Programming with C; Schaum's Outline series, McGraw Hill.
3. Users Manual for FoxPro, MS-office.

102014 : WORKSHOP PRACTICE - II (2nd Term) ( Term Work - 25 Marks)

1. Topics to be studied or demonstrated during Practicals , Names, uses and setting of hand tools for fitting and tin smithy.

2. Study of basic measuring instruments : micrometer, vernier, bevel protector, dial indicator and guages.

Each candidate shall be required to complete and submit the Termwork as mentioned below :

1. Fitting : One job with one joint along with drilling, tapping, hacksaw operations.
2. Tin Smithy : One job including soldering, riverting operations.
3. Pipe Joints : One job involving different operations : bending, threading and welding.
4. Plastic Moulding : One plastic component on injection moulding machine.

Workshop book should include description with sketches of all demonstrations of various operations on above trades.

Syllabus for Computer Engg. - Pune University
Examination Scheme: Teaching Scheme:
Lectures: 4 hrs/week Theory: 100 Marks
Duration: 3 hrs
1. Introduction:
History of mathematics as related to Discrete Structures, Motivation for Discrete Structures.
2. Sets:
Introduction. combination of sets, finite and infinite sets, uncountably infinite sets, mathematical induction, principle of inclusion exclusion (addition principle)
3. Propositional Calculus:
Propositions, Logical connectives, Truth tables, Methods of proof using inference rules (equivalence and implication), Universal and Existential Quantifiers.
4. Permutations, Combinations and Discrete Probabilities:
Rules of sum and product, permutations, combinations, generation of permutations and combinations, Introduction to Discrete Probability, Information and Mutual Information.
5. Relations and Functions
Definition, properties of binary relations, equivalence relations and partitions, Partial ordering, relations, lattices, chains, antichains, Definition of function, pigeonhole principle, propositions and prepositional calculus
6. Graphs and Planar Graphs:
Basic terminology, multigraphs and weighted graphs, Paths and circuits, Shortest path in weighted graphs, Hamiltonian and Eulerian Paths and Circuits, Factors of a graph, Planner Graph
7. Trees and Cut sets:
Trees, rooted trees, Path length in rooted trees, Prefix codes, Binary search Trees, Spanning trees and cut sets, Minimal spanning trees (Kruskal's algorithrn and prime's algorithrn) Warshall's algorithm for transitive closure.
8. Algebraic systems
Algebraic systems, Groups, Subgroups, Semi groups, Monoid, ring, Integral domain, Field, Isomorphisms and automorphisms, Homomorphism, Group codes (minimum distance decoding criteria) eg. Hamming code
9. Vector Space:
Vector and Vector spaces, Vector spaces of a graph, basis vector of a graph circuit and cut sets, subspaces (Scope of this topic is restricted to concept, definition and examples only. No Theorems and problem solving expected)
1.C.L.LIU, Elements of discrete Mathematics; MGH.
2.Tremblay, Manohar, Discrete Mathematical Structures with application to Computer Science; MGH. (Recommended for prepositional Calculus)
3.Narsingh Deo, Graph theory with application to Engineering and Computer Science (Recommended for topics Graph and Vector Spaces).
4.Dantzig, Number; The Language of Science; (Recommended for Introduction).
5.Genett Brikhoff, Barti, Modern Applied Alcebra; MGH.


Teaching Scheme: Examination Scheme:
Lectures 4 hours/week Theory: 100 Marks
Duration: 3 hours
1. Transistor Biasing:
Biasing Circuits - Fixed Bias, Collector to base bias, Self bias, Stability factors, definition and qualitative analysis for self-bias only. Bias Compensation. Thermal runaway.
2. Field - Effect Transistor:
Construction, Characteristics (O/p & Transfer). Sinall Signal low frequency model, CS & CD Configuration and their comparison with respect to voltage gains and output impedance.
3. BJT Small signal low frequency amplifier:
Low frequency equivalent circuits -h parameter and Hybrid pi model, Analysis of CE, CB, CC Amplifiers using approximate h-parameter model. Miller's theorem.
4. Multistage Amplifiers:
Necessity of Cascading low frequency small signal amplifiers in various configurations. Techniques of improving input impedance common collector stage - Boot strapping, Darlington Connection. Frequency response, rise time, sag, square wave testing of common emitter amplifiers only Effect of cascading on Bandwidth.
5. Large signal amplifiers:
Class A, B, AB, C, Non-linear distortion and its minimization techniques. Comparison with respect to power output and efficiency. Complementary symmetry stag with driver. Power amplifier IC.
6. Feedback Amplifier:
Different topologies of Feedback Amplifiers and their effect on performance parameters.
7. Oscillators:
Barkhausen Criteria, LC Oscillators and Crystal Oscillator (Miller and Pierce Configurations), Frequency stability.
8. Operational Amplifier:
Transistorised differential amplifier, CMRR, Techniques of improving, CMRR, Operational amplifier-various stages of an op-amp, IC 741, op-amp parameter - offset voltage, current, thermal drift, CMRR, Slew rate, PSRR.
9. Power Devices:
Construction, characteristics & ratings of - SCR, Triac, Diac, UJT, PUT. Application of UJT as a trigger device, controlled rectifier using SCR. Optically coupled SCR, Opto-isolator MCT2E
10. Power Supplies:
IC 723, Protection circuits, SMPS, UPS - types, need, block diagram, ratings and areas of applications.
11. Multivibrator:
BJT as a switch, Transistorised Bistable Multivibrator.
1. Miliman Halkias, Integrated Electronics, Analog and Digital Circuits,
McGraw Hill.
2. Millman, Microelectronics, McGraw Hill.
3.Ned Mohan, Power Electronics; John Wiley.
4.Mottershed, Electronic Devices and circuits; PHI.


Teaching Scheme Examination Scheme:
Lectures: 4 hours/week Theory: 100 Marks.
Duration: 3 hours
1. Algebra of Logical Variables:
Review of boolean algebraic theorems, realisation of Boolean functions and sufficiency of NAND/NOR for implementation, standard SOP and POS forms of logical functions, minimization techniques using K-MAP and Quine McCluskey method (upto 4 variables)
2. Logic Families:
Basic TTL NAND with totem pole o/p and open collector o/p, Tristate 0/P, I/0 parameters, fanin and fanout, Noise margin, propagation delay, power dissipation etc. STTL, LSTTL, CMOS inverter, CMOS. NAND/NOR. CMOS characteristics, CHMOS, comparison of different logic families, interfacing TTL to CMOS and vice versa.

3. Design of Combinational Logic Circuits:
Half adders/subtractors, Full adder/subtractor, unsigned and signed number representation, n-bit parallel adder/sub. with look-ahead carry, BCD adder/sub using 7483, 74181 ALU; Code converter -binary, BCD, Excess-3, Gray, Parity Generator and checker. MUX, DEMUX, encoders, implementation of Boolean functions using MUX, DEMUX, BCD to 7-segment decoder-driver.
4. Flip Flops, Registers, Counters:
One bit latch using, NOR/NAND, steered latches, S-R FF, clocked S-R FF, J- K FF, Race around condition, M/S J-K FF, D FF, T FF; shift registers -SISO, SIPO, PIPO, PISO, applications of shift registers. Ripple Counters, Synchronous counters of arbitrary modulo. UP/DOWN Counters, Counter ICs like 7490, 7492, 7493, 74161. 7419 1, Functional block diagram of frequency counter.
5. Memories:
Random access memory, TTL RAM Cell, parameters, read/write cycles, ROMs-types. EPROM structure and proaramming. MOS static RAM Cell, Dynamic RAM Cell, refreshing, memory cycles.
6. Sequential Circuits:
Block diagram, state variables and excitation variables, state diagram representation, Moore and Mealy circuits. Design of sequence Generator and sequence detector, elimination of redundant states, Avoiding lockouts. fundamental mode sequential circuits, elimination of critical races. hazards. pulse mode sequential circuits, Clock Circuits.
7. Algorithmic State Machines: ASM charts, notations, design of simple controller, Multiplexer controller method, RTL notations and implementation.
8. Programmable Logic Devices:
Prgrammable Logic elements and array logic, Implementation of combinational and sequential loaic desicn usina PLEs, PALs, introduction to FPGA.
9. Digital Signal Transmission and Associated Problems
1. Dougles Hall, Diaital circuits and systems; MGH.
2. Morris Mano, Diaital Locic Design, PIII.
3. Hill & Peterson, Dicital Circuits and Microprocessor: WILEY.

Teaching Scheme Examination Scheme
Lectures: 4 hours/week Papers: 100 Marks
Duration: 3 hours
1. Review of R, L, C as basic elements in electrical circuits. Voltage and current sources. Kirchoff's voltage and current laws, Basic techniques of mesh and nodal analysis, star and delta transformations.
2.Conventions for describing networks, network equations, source transformations, loop and node analysis, network involving 1 st order differential equations, general and particular solutions, time constants, initial conditions. Network involving second order differential equations, internal and external excitation.
3.Network theorems, series and parallel combination of elements, superposition theorem and reciprocity theorem, Thevenin's and Norton theorems, input power and power transfer, maximum power transfer theorem, insertion loss.
4.Series and Parallel resonance, other resonant forms, Q and Bandwidth; Low Pass and High Pass filters.
5. Laplace Transform
Definition of Laplace transforms, Laplace transforms of simple time functions like unit, step, ramp and parabolic function, Properties of Laplace transforms - Convolution, Time shift and periodic functions, Shifting, Differentiation, Integration and scaling, in the frequency domain, Initial value And Final value theorems.
6. Complex frequency, Sinusoidal Forcing function, Z(s), Y(s) and H(s), Frequency response H(jw), Complex frequency plane, Concept of Poles and Zeros, Bode Plot.
7. Two port network parameters and their inter relationships. Open circuit short circuit parameters, admittance, hybrid and transmission parameters.
8. State variable analysis-state variable and normal form equations, use of matrix notations, solution of first order equations and matrix equations, State Transition Matrix.
1. William Hayt and Kimmerley, Engincei-inco Circuit Analysis; MGH.
2. Van Valken Bercr, Network Analysis and Synthesis; PHI.


Teaching Scheme Examination Scheme:
Theory: 4 hours/week Paper: 100 Marks
Duration: 3 hours
1. Basic Concepts of Management:
Management, Administration and Organisation Concepts. Management Principles. Management and Engineering Studies. Meaning and Types of Management. Functions of Management. The concept of Scientific Management - F.W.Taylor and Henry Fayol's contribution to Management. Role and importance of Management in Modern Society
2. Business Organisation:
Forms of Business Organisation - Individual Proprietorship, Partnership, Joint Stock Company, Co-operative Enterprise and Public Sector Undertakings. Organisation Structures in Industry. Line organisation, functional organisation. Line and Staff organisation. Committee Organisation, Project Organisation, Matrix Organisation.
3. Nature and Significance of Economics:
Science, engineering, and technology, their relationship with economic development. Basic economic concepts, Human Wants - Economic goods, Utility, Value, Price, Cost, Wealth and Capital. Demand, supply, elasticity of demand and supply. Concept of Profit and Revenue.
4. Economic Development of India:
Structure and features of Indian Economy. Industrialization of India. Economics of small and large-scale industries. Growth of public sector in India. Recent trend in labour movement in India. Role of agriculture in Indian Economy. Problems of Indian agriculture and modernization of Indian Agriculture.
5. Financial Management:
Concept of Management Accounting Systems. Financial accounting and cost accounting, system Sources of Industrial finance. Sales organisation of a firm. Management of Sales and Advertisement. Market Research. Management and Productivity.
6. Personnel Management:
Manpower planning sources of recruitment, Selection & training Job evaluation, Performance appraisal, Wags and Incentives, Self & Time Management. Communication: Definition, Elements, Principles of Communication, and Barriers in Communication, Oral and Written Communication.
7.Industrial Act:
Introduction, Factories Act, Pollution Control. Industrial Safety Introduction, Causes of accidents, safety, accident prevention techniques & related legal provisions
8. Quality Management:
Concept and importance of quality circles and Total quality management (TQM), ISO 9000. Patents, Patent Procedure.

1. OP. Khanna, - Industrial and Management.
2. C. S. George Jr., - Management for Business and Industry.
3. Kootz & O'Donnell, - Principles of Management.
4. Mc Connel, - Gupta, Economic Principles, Problems and Policies, TMH.
5. T. R. Bange & S.C.Sharma, - Industrial Organisation and Engineering Economic; Khanna Publication.
6. G. D. Stervens, - Engineering Economics.
7. M. C. Shukla, - Business Organisation and Management.
8. Spriegel W. R.. Lansburgh R. H., - Industrial Management
9. Freeman-Bell, Balkwill, - Management in Engineering Principal & Practice; PHI.

Teaching Scheme: Examination Scheme:
Lectures: 2 hours/week Term Work: 50 Marks
Practical: 4 hours/week Practical : 50 Marks
1. Advance C Programming:
Overview of pointers, structures and unions, Dynamic Allocation, String Processing, File Handling Functions and Parameter Passing, Sorting Techniques : Bubble, Selection, Insertion & Shell Sorting Methods, Binary search method, Logical and Bitwise Operation, Hashing.
2. Structured Programming and Programming Skills:
Top down programming, Problem definition, module flow diagram, variable naming, convention, Hungarian notation, programming, coding, documentation and testing, standards.
3. Representation of Numbers & Errors:
Representation of numbers, fixed point nos, floating point nos, Normalized floating point nos, Arithmetic operations, Errors in arithmetic operations. Types of errors, Truncation errors, Inherent error, Round off errors, Absolute errors, relative errors, evaluation of functions.
4. Solution of Transcendental Equation:
Types of iterative methods, Bisection method, false position method, Newton Raphson method, secant method, comparison & Graphical representation of iterative methods.
5. Interpolation:
Lagrange's interpolation, finite differences, forward backward &central differences, Newton's forward & backward formula, Stirling's central difference formula, errors in interpolation, Curve Fitting
6.Numerical Differentiation & Integration:
Numerical differentiation, numerical integration, Trapezoidal Rule, Simpson's 1/3 rule, Simpson's 3/8 rules, introduction of errors in integration.
7. Numerical solution of simultaneous equation:
Linear systems of equations, Matrix Inversion, Guass Elimination method, Pivoting, ill-conditioned equations, Guass seidel method, Comparison of direct and iterative methods.
Euler's and modified Euler's method, Taylors series method, Runge Kutta 2nd & 4th order method, errors in numerical method.

Note: Frame minimum 14 assignments on following topics
1. Generation of permutations and combination of given list.
2. String operations: Copy, length, reverse, concat, palindrome, Instring with and without library functions.
3. Sorting using - insertion sort, bubble sort, selection sort, bucket sort.
4. Maintaining a small database for student's information system using sequential files. Printing results (Aggregate marks, percentage) from A student data file, which contains roll no, name, subject wise marks. (Use of structures and pointers recommended)
5. Traversing in a students database file.
6. Recursive functions: Fibonnacci series and binary search.
7. Logical and bitwise operation.
8. Hashing.

Note: Frame minimum 8 assignments on following topics
1. Roots of the transcendental equations using Bisection or false position or Newton Raphson and secant method.
2. Interpolation usincr lagranee's, Newton's forward, Backward and sterlings central difference formula; when value of n is not constant.
3. Numerical integration using Trapazoidal, Simpson's 1/3 Rule, Simpson's 3/8 rules.
4. Solution of simultaneous equations Guass elimination and Guass seidel methods. Iterative Methods.
5. Solution of ordinary differential equation using Euler's & modified Euler's, Runge Kutta 2nd order and 4th order.
Students will submit the terinwork in the form of journal. Practical examination will be based on above assignments and questions will be asked to judge the understanding of assignments performed, at the time of examination.
1. Kernighan & Reitche; - C Programming Language; PHI.
2. V. Rajaramanl. - Computer Oriented Numerical Methods, PHI.
3. S. Chapra; - Computer Numerical Methods for Engineers. .
4. Jain, Iyengar; - Numerical Methods for scientific and engineering computations Wiley.
5. Press; - Numerical Recipes in C; Cambridcre.
6. Donald Knuth; - Semi numerical Algorithms.

Teaching Scheme Examination Scheme
Practical : 4 hours/week Term Work: 50 Marks
Practical : 50 Marks

Minimum 20 experiments are to be carried out inclusive of two simulation experiments from group A and C. In addition to above experiments, at least one circuit must be built and tested by subgroup of four to five students, wherein PCB layout software should be used.
Group A: Analog Circuits
Minimum 8 experiments are to be set from following experiments
1. Biasing of BJT Common Emitter Configurations
i) Fixed Bias
ii) Collector to base bias
iii) Self Bias
a) Measurement of operating point of all above biasing circuits and verify with the
calculated value.
b) Effect of temperature on stability of operating point.
2. Measurement of h-parameters of common Emitter configuration.
3. Plot the frequency response of common Emitter amplifier (with partial and full bypass for Re) Measurement of Gain, Input Impedance, Output Impedance.
4. Feedback Amplifier : Effect of feedback on Gain, Input Impedance, Output Impedance and bandwidth (by square wave testing).
5. High input impedance circuits
a) Emitter follower
b) Bootstrapped emitter follower
c) Darlington Bootstrapped emitter follower.
Note: Operating point of all above circuits should be same.
6. Oscillator
a) LC Oscillator
b) Crystal Oscillator
7. Differential amplifiers Effect of Re on CMRR
8. Study of Op-Amp:
i) Input offset voltage
ii) Input bias current
iii) Input offset current
iv) Slew rate
v) Frequency response
9. Uni Junction Transistor- (UJT)
i) Plot UJT characteristics
ii) Relaxation Oscillator
a) Observing all important wave forms
b) Measurement of frequency.
Silicon controlled Rectifier (SCR)
i) SCR characteristics
ii) Plot of Vdc (O/P) Vs firing angle.
10. Regulation characteristic of 723 IC
i) Load regulation with current limiting technique
ii) Line regulation.
11. Study of SMPS and UPS
12. Bistable Multivibrator.

Group B: Digital circuits and Logic design
Note: Minimum 8 experiments are to be set from the following
1. Implementation of Boolean function using Logic Gates OR
1. Code converters : Binary code to Gray code and vice versa, excess-3 code to BCD and vice versa.
2. Applications of Multiplexery and Demultiplexery.
3. BCD adder/subtractor using 4 bit adder IC.
4. Study of Flip Flops, Designing up/down counter using, Flip Flops.
5. Designing divide by N counter using 7490/74191 etc.
5. Design and implementation of sequence generator.
6. Design and implementation of sequence detector (Mealy/Moore)
7. Simple ASM using, multiplexer controller- method.
8. Design and implementation of digital circuits using, RTL (Data section using, 74 series chips and control section using shift register controller and classical methods).
8. Design of a controller and ALU with hypothetical instruction set.
Extensive use of CRO, logic analyser is to be made in experiments.
Group C : Linear Circuit Analysis:
Note : Minimum two experiments are to be set from the following:
1. Verification of Theorems-1
Thevenin's Theorem OR
1. Verification of theorems-II
a) Super position
b) Maximum power transfer
2. Resonance
a) Series
b) Parallel
Plot frequency response
2. Performance of lst order and 2nd order systems for following excitations.
a) Step
b) Ramp
c) Square wave
Students will submit the term work in the form of journal. Practical examination will be based on above assignments and questions will be asked to judge the understanding of assignments performed, at the time of examination.
Teaching Scheme: Examination Scheme:
Lectures: 4 hours/week Paper: 100 Marks
Duration: 3 hours
General Linear differential equation of the order n. solution of linear differential equations with constant coefficients, complementary functions and particular integral. Method of variation of parameters equations reducible to linear form (with constant coefficients). Cauchy's linear equation. Legendre's linear equation, simultaneous differential equations. Applications to simultaneous differential equations. Application to electrical circuits.
A. ? u/? t = a2 ?2U/?x2 (Head flow equation)
B. ?2 y/? t2 = a2 ?2y/?x2 (Wave equation)
C. Laplace equation in two dimensions (in Cartesian and polar co-ordinates) with initial and boundary conditions. Problems of electrical engineering applications involving above differential equations.
Fourier transforms. Inverse Fourier transform, properties and Theorems. Fourier sine and cosine integrals. Fourier transform of Standard functions. Application of Fourier transform in sampling of Signals. Discrete Fourier transform and its properties.
Definition of laplace transform, Inverse laplace transform, Properties and theorems, Laplace transform Of standard function. Unit step functions, ramp functions impulse functions. Methods of finding inverse transforms. Application to solutions of linear differential equations.
Definition of z-transform, Properties of z-transform, complex z-planes, Inverse z-transform, planes, z-transform of standard , Application of Relationship of Z-transform with Fourier transform.
Differentiation of vectors, Gradient of scalar point function, line integral , Surface, integral Divergence and curl of a vector point function, vector identies, Gauss's Stoke's theorem. Green'S Lemma , Applications to electromagnetic fields,

1. Erwin Ereyszig, - Advanced Engineering Mathematics( 7th Edition) Wiley Eastern Ltd., Bombay,
2. Dr.B.S.Gewal, - Higher Engineering Mathematics Khanna publications, New Delhi,
3. P.N.Wartikar and J,N.Wartikar, - A Text Book of Engineering Mathematics; Pune Vidyarthi Gruha, Pune.
4. Wyle, - Advanced Engineering Mathematics; McGrew Hill, N.Y.
SUBJECT COMMON TO: Electronics/ Industrial Electronics/ E&TC/ Electrical/ Instrumentation/ Computer/ Printing.

Teaching Scheme Examination Scheme
Theory : 4 hours/week Theory : 100 Marks
Duration : 3 hours
1. Review of tri- state logic, buffers, decoders, memory, memory expansion using typical RAM Chips.
2. Introduction to 8 bit processor architecture, 8085 microprocessor architecture, 8085 with associated latches, buffers. Memory interfacing , Memory Map, Address decoding logic.
3. 8085 Addressing modes and Instruction set, Machine code and Assembly language programming, Assembler directives. Stacks and subroutines. Timing diagram of Instruction execution, machine cycle, wait state.
4. I/0 programming, Memory mapped I/0, I/0 mapped 1/0, Polled I/0, I/0 ports using latches, PPI 8255, Various operating modes of 8255, interfacing, and programming, 4x4 key matrix interfacing, Seven Segment display interfacing
5. 8085 Interrupt structure, ISR, PIC 8259 interfacing and programming.
6. 8253 Timer, 8279 Keyboard Display Controller, interfacing and programming of both.
7. HOLD state and DMA, DMAC 8257/37.
8. Serial I/0, 8085 SID, SOD; Asynchronous and Synchronous serial I/0, 8251 USART programming and interfacing, RS232C interface.
9. Introduction to 16 bit processor - 8086/8088 architecture, minimum and maximum mode, supporting chips 8284, 8282, 8286, 8288 programmers model - Instruction encoding format, 8086 assembly language programming.
DOS components, use of BIOS and DOS calls.
Detailed study of all Peripheral Interface IC chips is expected.

1. Gaonkar, - Microprocessor Architecture, Programming and Application; 3rd edition Penvan International.
2. Peter Abel - Assembly Language Programming.
3. Hall - Digital systems and microprocessors ; TMH
4. Ray Duncan - Programmers Dos Manual
Teaching Scheme Examination Scheme
Theory : 4 hours/week Theory : 100 Marks
Duration : 3 hours
1. Signals
Definitions of different types of signals , their characteristics , speech , video signals ,ECG signals , Generation of signals like noise, random sequence.
2. Applications of op-amps
Adder , subtractor ,differentiator , integrator ,Use of integrator for solving differential equations , instrumentation amplifier , active filters, log and antilog amplifiers , V/I , I/V converters , precision rectifiers , zero crossing detector , Schmitt trigger , waveform generators , sample and hold , PLL.
3. Data converters
D/A , A/D conversion technique, Dual slope , successive approx. , flash converters. Application of A/D , D/A converters using commercial available ADC , DAC Ics (e.g. ADC 0809 , 7109 ,DAC 0808 ) performance specifications , sampling theorem , choice of sampling frequency , principle of DVM.
4. Signal Isolation
Linearization of signal , Necessity of isolations , sources of common mode noise , practical isolation techniques such as optically trimmed opamps , isolation amplifier.
5. Transducer & measurement techniques
PH , flow , conductivity measurement , microphone , speakers ,ccd , digital transducers , optical encoders , grating transducer , bar code principles.
6. Input/Output Devices
Principles and operations of digitizer , Mouse , scanners , performance parameters of each , magnetic tape, CTD.
7.Application of transducer and signal conditioners in simple instrumentation setup. Data acquisition system and its interfacing with computer I/O port.
References :-
1. D.Roy Choudhari , Linear IC and applications ; New Age International Ltd.
2. Tran Tien Lang , Electronics of measuring systems ; John Wiley and Sons.
3. Rangan , Sharma ,Mani ,Electronics Instrumentation and Application ; Wiley
4. Douglas Hall , Microprocessors and interfacing ; MGH.

Teaching Scheme : Examination Scheme :
Lectures : 4 Hrs/week Theory : 100 Marks
1. Introduction to Data Structures :
Concept of Data, Data types, Data object, Data structure, Abstract Data types(ADT), realisation of ADT in and C++. (only CLASS concept).
2. Algorithm analysis :
Definition and Characteristics of an Algoritbm. Running time of a program (frequency count) , Time and space Complexity, Big '0' Notations, Graphical representation of time complexities.
3. Algorithmic strategies :
Types of algorithms : Use and the peculier characteristics of each type, Divide and Conquer ( eg. Quickeort, Tower of Hanoi), Dynamic Programming (eg. The Triangulation Problem),Greedy Algorithms (eg.Graph Colouring Problem), Backtracking (eg. Eight Queens Problem) . (Implementation not expected).
4. Linear Data Structures using sequential Organization :
Concept of sequential organization, Concept of Linear and Non-Linear Data structures. arrays as ADT, Storage representations (row major and column major). Concept of ordered list and polynominal representation using arrays. Representation of sparse matrix using arrays, algorithm for sparse matrix addition transpose and time and space complexity analysis, for simple and fast transpose for sparse matrix.
5. Linear Data Structures Using Linked Organization :
Concept of linked organization, singly linked list, doubly linked list, circular linked list. Insertion, deletion & travereal on above data structures. Representation and manipulations of polynominals using linked lists.Representation of polynomial using generalized list. (Implementation of polynomial not expected)
6. Stacks and Queues :
Concept of stack and queue as ADT. Implementation of stacks, linear queue, circular queue using linked and sequential organization. Application of stack for expression conversion and recursion. Concept of Priority queue.
7. Non Linear Data Structures :
Trees and binary trees-Concept and terminology. Data structures for binary trees, Algorithm for tree traversals (recursive and non recursive). Conversion of general tree to binary tree (Implementation not expected). Insertion a deletion of nodes in inorder- threaded binary tree. Preorder, inorder and post order traversals of inorder threaded binary tree, optional binary search tree and AVL tree.
8. Graphs:
Concpets and terminology, Representation of graphs using adjacency matrix, adjacency list, Depth First search and Breadth First Search Algorithms for minimal spanning tree and shortest path (The instructor will discuss only Algorithms and rest of the topics are left for self study.)
9. Searching and sorting Techniques:
Search : Importance of searching. Sequential, Binary, Fibonacci search algorithms. Sorting :Bubble sort, selection sort, quick sort, heap sort (self study) Analysis of these algorithms in worst and average cases. Selection criteria for above algorithms. Symbol Tables: Notion of a symbol table. Binary search trees, static and dynamic trees, height balanced and weight balanced binary trees, hashing techniques.
10. Files:
Organization of files, types of files - sequential and direct access file, simple Index file.

1. Jean-Paul Trembley, Paul. G. Soresan, -An introduction to data structures with Applications, Mc-Graw Hill International Editions
2. Howorithz, Sahani, Data Strctures; Galgotia
3. Aho, Hopcroft, Ulman, Data Structures and Algorithms
4. Nikaulus Wirth, -Algorithms - Data Structures = Programs.
5. Tannenbaum, - Data Structures using C and C++; PHI.
6. Thoms Horbron,- File Systems - Structures and algorithms; PHI. I
7. Donald Knuth,- Art of Computer Programming Vol.I;

Teaching Scheme: Examination Scheme:
Lectures : 4 hours/week Paper: 100 Marks
Duration : 3 hours
Construction of D.C. Machine, Significance of back e.m.f., Generating action, motoring, action, Types, Torque - armature current characteristics, Torque - Speed characteristics, Speed armature current characteristics, Different methods of speed control including D.C. Drive with necessary circuit diagram and important features (only descriptive treatment to D.C. drive), Different types of starters for D.C. shunt motors.
Measurement and calculation of active and reactive power in 3-phase balanced circuit. Study of a typical H.T. consumer metering system, Concept of power factor improvement. Preliminary treatment only.
A) Alternator Construction, Principle of working. Definition of regulation and efficiency (only descriptive treatment)
B) Motor-: Principle of operation, Construction, Methods of starting,
applications, Synchronous motor as a condenser.
Turns ratio, losses in transformer, Definition of regulation and efficiency. Three phase transformer connections, C.T. and P.T., Industrial use of C.T. and P.T.
Three phase induction motor, principle of operation, slip and torque equation, Torque-slip characteristics, Types of starters, speed control, V/f control.
Principle of operation, types, control circuit, applications. (Descriptive Treatment only)
A.C./D.C. Servomotor/Brushless D.C. Motor, Principle of operation, applications (Descriptive Treatment)
Single phase induction motor, Universal motor, Principle of operation, characteristic and applications (Descriptive Treatment)
Permissible potential difference between neutral and earth point in computer rooms. Methods to reduce p.d. between neutral point and earth point. Methods of earthing as per I.S. specifications, Permissible value of earth resistance, Wiring diagrams for typical computer installations consisting of distribution boards, MCBS, Computer/Printer/UPS/Stablizer units, air conditioners etc.

1. S. K. Bhattacharya, - Eletrical Machines.
2. Nagnath Kothari, - Electrical Machines.
3. S. K. Pillai, - A First Course in Electrical Divel.
4. Edword Hughes, -. Electrical Technology.
5. Dr. Uppal, - Electrical Installation and Estimation

Teaching Scheme: Examination Scheme:
Lectures : 2 hours/week Practical : 50 Marks
Practicals : 2 hours/week Term Work: 50 Marks
1. Introduction to business data processing, Principles of Data Processing. Data storage devices.
2. Introduction to COBOL, Structure of COBOL, Coding Sheet format and Language Formats. Divisions of COBOL and their Characteristics, Identification division, Data division, Environment division, Procedure division.
3. Data Division Features :
a) Picture clauses: A, X, 1, Z, S, P, V, data division clauses. Usages, justified right, rename, redefines, multiple record, occurs.
b) Screen Section: Features
4. Procedure Division :
File oriented input output statements Open, Close, Read, Write Input - Output statements accept, display, data transfer statement, move, move corresponding. Arithmetic Statements: ADD, SUBTRACT, MULTIPLY, DIVIDE, COMPUTE Control Statements: IF statement, Go to, Go to depending, on, evaluate when, perform until, perform varying.
5. Table Handling, Sort and Merge, Report writing, control break processing, subroutines Call
6. File organisation : sequential file, indexed file, relative files.
7. Introduction to Management Information Systems and Decision Support Systems.
8. Use of following software for building Information systems.
Data base: Foxpro, MS Access etc. Spread Sheets : excel, lotus 123 etc.Financed Accounting : Tally, Ex etc.Project Planning: Turbo analyst.

Practical Assignments for Data Processing Laboratory:
1. Sequential File Manipulations.
2. Index file Manipulations using transaction file.
3. Relative file manipulation.
4. Table Handling
5. Control break Processing (above assignments with Creation, addition , deletion, update; processing, report generation).
6. Mini project based on following topics with problem definition decision, tables. report Generation and documentation.
1. Financial accounting
2. Payroll system
3. Railway reservation
4. Inventory system
5. Management System (eg. Sales, Services, Marketing, Production,
Personal etc.)
1. Philipakis & Kazmier; - Structured Cobol Programming
2. Stern & Stern; - Structured Cobol Programming
3. Roy Dastidar; - COBOL Programming
4. R.J.Condon; - Data Processing System Analysis & Design.
5. Management Information System - by Jawadekar.
6. Respective Manuals for various packages.
Students will submit their termwork in the form of a journal with 5 Programs and one mini-project (topic 6). Practical examination will he based on above assignments and questions will be asked to judge the understanding of assignments performed, at the time of examination.


Teaching Scheme: Examination Scheme:
Practicals : 4 hours/week Practical : 50 Marks
Term Work: 50 Marks

List of Experiments
Assembly Language Programming of 8085
1. Arranging the numbers
2. Lookup table for BCD to Seven Segment Conversion etc.
3. Programs using subroutines.
4. Multiplication by shift and add.
Assembly Language Programming of 8086
1. HEX-BCD, BCD-HEX conversion.
2. BCD addition.
3. String Manipulation and Text Processing
4. Sequential File Processing
5. Calling, Extern far Procedures.
Interfacing of
1. 8279 Keyboard/display/controller
2. 8255 Operations in various modes (Application Expected)
3. 8259 Priority Interrupt Controller.
4. 8251 For serial Communication.
5. 8253/8254 various operating modes
6. ADC, DAC interfacing.
7. Assignments on .exe, .com files.
Students are expected to study DOS interrupts, functional calls. Staff members will suitably frame assignments for Software and Hardware experiments.
Students will submit the termwork in the form of journal, practical examination will be based on above assignments and questions will be asked to judge the understanding of assignments performed, at the time of examination.

Teaching Scheme: Examination Scheme:
Practicals : 4 hours/week Practical : 50 Marks
Term Work: 50 Marks

List of'programming assignments to be executed in C/C++:
1. Represent sparse matrix using array and perform matrix addition or simple and fast transpose.
2. Represent polynomial as a circular linked list and write a menu driven program to perform addition, multiplication and evaluation.
3. Write a menu driven program to perform following operations on doubly linked list : Create, Insert, Delete and Display.
4. Create two singly or doubly linked lists, sort them after creation using pointer manipulation. Merge these two lists into one list without creating, a new node. Merged list should be a sorted one.
5. Write a program to create a generalized linked list and perform following operations copy, equivalence and depth.
6. Implement Stack as an abstract data type using array or linked list. Use this ADT for expression conversion and evaluation.
7. Represent circular Queue using, array and write a pro-ram to perform following operations Insert, Delete, Finding front and rear element.
8. Creation of binary tree and perform recursive and non recursive traversals.
9. Creation of binary inorder threaded tree and perform all three traversals.
10. Represent a given graph using adjacency list and perform DFS and BFS.
11. Represent a (given graph using adjacency list or array and find the shortest path using Dijkstra algorithm.
12. Represent a given graph using adjacency list or array and (generate a minimum spanning tree using Kruskal's and Prime's algorithms.
13. Implement binary search tree as an abstract data type.
14. Create a binary search tree and find height of a tree and print the leaf nodes.
15. Create a binary search tree, find its mirror image, Print original and mirror image using levelwise printing.
16. Create a hash table and handle the collisions using linear probing with perform or without replacement.
17. Implementation of simple index file.
18. Insertion and deletion of a record from a direct access file using, chaining, with or without replacement.
Students will submit Term Work in the form of a journal, which will include above programs. Each assignment includes algorithm analysis, program listing and printout of output. Each program will consist of appropriate functions with proper documentation. Practicals should be carried out on UNIX/ LINUX platform (At least C assignments).
Practical Examination will based on above assignments and questions will be asked to judge the understanding, of assignments performed, at the the time of examination.

Teaching Scheme Examination Scheme
Lectures: 4 hrs/week Paper: 100 marks
1. Introduction :
Set theory - Definition, finite and infinite set, countability of a set, cardinality of a set, closure of a set, Mapping between sets, functions and relations, closure properties of relations. Basic concepts, symbols, alphabet, string/word. Language - Definition, language states, difference between natural and formal language. Mathematical preliminary - Induction, Graphs and Trees - basic definitions, Basic machine -concept only.
2. Finite State Machine (FSM) :
Definition, Finite control, Transition graphs, adjacency matrix. (FSM must be dealt with machine function and state function), Finite automata (FA) - Definition of Deterministic Finite Automaton (DFA) and Non-deterministic Finite Automaton (NFA), Language acceptance by FA. Moore and Mealy machines -Definition, models, interconversion.
3. Regular Expressions :
Recursive definition of Regular Expression, Regular set recursive definition, NFA with E moves definition, NFA with E moves, NFA without E moves, Interconversion between NFA and DFA. Regular expression and FA. Regular sets- Properties, pumping lemma. FA limitations.
4. Grammars :
Definition, production rules, Formalization, derivation trees, ambiguous grammar, removal of ambiguity. Reduced form grammer - removal of unit productions, production, useless symbols, Chomsky hierarchy, Context Free Grammar (CFG) - definition, simplification of CFG, Context Free Language (CFL)-definition, inherently ambiguous CFLs, Regular grammar - definition, left linear & right linear Regular Grammar. Interconversion between left linear and right linear regular grammar. Regular grammar and Finite Automata Normal Forms - Chomsky Normal Form (CNF), Griebach Normal Form (GNF), Derivation graphs - type 0 and type 1 grammar.
5. Pushdown Stack Memory Machine :
Formal definition, pushdown Automata (PDA), Deterministic Push Down Automata (DPDA) -definition, Non-deterministic Push Down Automata (NPDA) -definition, Relative powers of DPDA and NPDA. PDA and CFG, closure properties of CFLs.
6. Post Machine :
Definition, Comparison between PDA and post machine.
7. Production System :
Definition, Axioms, Post canonical Systems, PMT systems, acceptors and generators, Markov algorithm and labelled markov algorithm.
8. Turing Machine .
Introduction, Definitions, model, comparison of Turing Machine - (TM), FSM, PDM and PM Examples of TM, combination TM, iterative TM, recursive TM, universal TM, Recursive sets, partial Recursive functions, recursively enumerable sets, Church's Turing hypothesis, multistack Turing machine, TM limitations, halting problem, incompleteness and undecidability, Solvability, Semi solvability and unsolvability.
9. Applications :
Application of RE and FA - Lexical analyser, Text editor and searching using RE. Application of PDA -Expression conversion. Application of CFG - syntax analysis, language definition.
Reference Books
1. E.V Krishnamurth, " Theory of Computer Science", EWP publications.
2. Hopcroft Ulman, "Introduction to Automata Theory, languages and Computations," Narosa
3. Daniel I.A. cohen, "Introduction to computer theory", Wiley Publications.
4. John C. Martin, "Introduction to language and theory of computation", McGraw Hill.

310242 Computer Organisation
Teaching Scheme : Examination Scheme:
Lectures: 4 Hrs/week Paper : 100 Marks
1. Computer system components Von Neumann architecture, Basic CPU implementation, Characteristics, Instruction cycles, Interconnection structures, Bus interconnection, Bus types, Addressing schemes, examples of PDP- 11/IBM 360 systems.
2. Classification of data types : Scalar data types, Fixed point numbers, Floating point numbers, Sign magnitude representation, Fixed point representation, Integer arithmetic (addition, subtraction, multiplication, Division), 2's compliment multiplication, Booths algorithm, hardware implementation, Division algorithm, Resorting and Non-restoring, Floating point representation, IEEE standards, Floating point arithmetic (addition, subtraction, multiplication, division).
3. Central processing Unit: CPU Architecture and functions, Register organisation, 80386 architecture as an example, Type of operands, Addressing modes, and formats, Instruction cycles, Instruction pipelining.
4. Control Unit: Operation, micro operation, hardware control, design methods and implementation an example using RTL, Micro program control, Micro Instruction Sequencing, Micro instruction execution, Control Unit design considerations. ALU &Sequencer, Look ahead carry generator.
5. Memory Organisation: Internal memory, Characteristics of memory systems, memory hierarchy, Main memory organization, chip packaging, error correction, cache memory, memory organisation, mapping, replacement algorithms, Pentium cache organisation, Advanced DRAM, Organisation, EDORAM, SDRAM, Cache DRAM, Rambus DRAM, RAM Link DRAM, Performance Characteristics, Associative memories, Virtual memory implementation. Secondary storage: Magnetic Disk, Disk organisation and layout, Disk partitioning, RAID Optical memory, CD ROM, magnetic tape, DAT (Understanding of these devices at Block schematic level with their specifications).
6. Input Output Systems: Programmed I/O, Interrupt driven I/O, Trap, Fault, Exception, 8086 interrupt system, I/O channels, DMA channels, peripheral devices and their characteristics - Printer, Keyboards, Device drivers
7. Multiprocessor Configuration: Closely coupled, Loosely coupled configuration, Problems of Bus contentions, Inter Processor communication, Buses, interconnection, system bus CPU and I/O bus operations, multi bus example of above for 8086, 8087, 8089, using bus controller, arbitration logic (8288, 8289), IEEE 488.
8. OS support: component of OS, example of MS-DOS, it's loading, DOS, BIOS, interrupts, TSR, Device driver for printer and keyboard.
9. RISC architecture: concept, example of 88510, and 80860 RISC processor. Super scalar processor, overview, power PC, Pentium.
Reference Books:
1. William Stalling, Computer Organization and Architecture, PHI fourth edition.
2. Hamacher and Zaky, Computer organization. MGH Fourth edition.

310243 Computer Graphics
Teaching Scheme: Examination Scheme:
Lectures : 4 Hrs/week Paper : 100 Marks
1. Basic concepts : Introduction to computer graphics, types of graphics devices, display file structure, display file interpreter, display processors, graphics file format, BMP, TIFF, PCX, GIF
2. Line and circle. Generation: Line generation - DDA and Bresenham's algorithm, Thick line segments, antialising of lines, Circle generation - DDA and Bresenham's algorithm, Character generation: Stroke Principle, Starburst principle, Bit map method.
3. Polygons: types, representations, entering Polygons, Polygon filling: Seed fill, Edge fill, scan conversion algorithm. Scan Conversion: real time scan conversion, solid area scan conversion, run length encoding, cell encoding.
4. Segments: Concepts, segment table, segment creation, deletion, renaming, and Image transformation.
5. 3-D Geometry: .2D transformations primitives and concepts - Translation, rotation, rotation about an arbitrary points, scaling and shearing, 3D transformations, rotation about an arbitrary axis, 3D viewing transformations, Concept of parallel and perspective projections, Viewing parameters, 3D clipping, Mid-point subdivision algorithm.
6. Windowing and clipping: Viewing transformation, 2D clipping, Sutherland-Cohen, subdivision Line Clipping algorithm, Midpoint subdivision algorithm, Generalized clipping, Cyrus-Beck algorithm, Interior and Exterior clipping, Polygon Clipping, Sutherland-Hodgman algorithm.
7. Hidden surfaces and lines: Back-face removal algorithm, hidden line methods, Z buffer, Warnock and Painters algorithm, Floating Horizon.
8. Light, Color and Shading: Diffused illumination, point source illumination, shading algorithm, Color models RGB, HVS, CYM etc., shading algorithm, Eliminating back spaces, transparency, reflection and shadows.
9. Curves and fractals: Curve generation, Interpolation, interpolating algorithms, interpolating polygons, B-Splins and corners, Bezier curves, Fractals, fractal surfaces and lines.
10. Interactive Graphics: Graphics standards, Graphics hardware, CRT display and. controller, Interlaced and Non interlaced display, Vector scan and Raster scan, Display adapter, VGA, SVGA, BIOS Video support, Graphics device drivers, Display buffers, Study of Graphics stations (practical aspects). Plotters, Digitisers, Scanners, Lightpen.
11. Graphical User Interface : Concepts of X-Windows: client-server model, protocols,
message passing (only GUI related concepts), Motif - widget, gadget, structure, (only GUI concepts), Concepts of MS Windows. OpenGL: why 3d? , why OpenGL ? OpenGL and Animation Graphics Standard : Introduction to Graphics kernel System with Basic primitives. Graphics Applications: Scientific & Engg. Applications, Business application, Application concept in Animation &Simulation.

Reference Books
1. David F. Rogers, "Procedural Elements for Computer Graphics", Mc-Graw Hill International Editions.
2. Steven Harrington, "Computer Graphics A Programming Approach", McGraw Hill International Editions.
3. Foley, Vandam, Feiner, Hughes, "Computer Graphics Principles and Practice", Addison Wesley.
4. Rao, Prasad, "Graphical user interface (GUI) with X-Windows and MOTIF", New Age International limited, Publisher.
5. Charles Petzold, "Programming Windows 3.1, Microsoft Publication.
6. Ron Fosner, "Open GL".

Teaching Scheme Examination Scheme
Lectures : 4 hrs/week Paper : 100 Marks
1. Introduction
Basic elements of digital signal processing (DSP) system, advantages of digital over analog signal processing, summary of DSP applications and introduction to DSP through these applications.
2. Signals and Systems :
Basic concepts of signals as array of values, standard signals, linearity, shift invariance, stability and causality, Linear Shift Invariant (LSI) systems, I/O mapping and difference equations, Linear convolution, properties of linear convolution, computation of linear convolution, A/D conversion process as sampling, quantisation, encoding, sampling theorem and anti aliasing filter.
3. Analysis of Signals :
Fourier transform, Fourier transform of standard signals, properties of Fourier transform, inverse Fourier transform, computation of Fourier transform, Discrete Fourier Transform (DST), DFT of standard signals, properties of DFT, computation of DFT, Fast Fourier Transform (FFT) using Goertzel, Decimation In Time (DIT) ant Decimation In Frequency (DIF) computation of Goertzel, DIT/DIF FFTs, Inverse DFT and computation of IDFT using the FFT algorithms.
4. Analysis of LSI Systems :
Magnitude/phase transfer functions using Fourier transform, computation for transfer function, Z transform, Z transforms of standard signals, properties of Z transform, inverse Z transform, computation of Z transform, System function from Z transform and pole-zero plots, computation of poles and zeros, Geometric constructs for transfer function Viz Region Of Convergence (ROC) using pole-zero plot and stability analysis.
5. Digital Filters :
Implementation of general difference equation, cascade and parallel forms of computation, Finite Impulse Response (FIR) and Infinite Impulse Response (IIR) filters from difference equations, FIR filter design using inverse Fourier transform and Windowing Gibb's phenomenon, computation of windows, IIR fitter design using impulse invariance and bilinear transform, computation of system function for given design parameters.
6. DSP Processors :
DSP micro-processors and their desirable features, ADSP-21 XX and ADSP-210XX series of DSP micro-processors and their architectural . features, implementing filters and FFTs on DSP microprocessors.

7. Application of DSP :
A brief overview of application of DSP in speech and image processing.

Reference Books
1. A.V Oppenheim, R.W Schafer, "Discrete time signal processing", PHI.
2. J.G. Proakis, D.G. Manolakis, "Digital signal processing", PHI.
3. Defatta, "Digital Signal Processing", Addison-Wesly.
4. Embree and Kimble, "C language algorithms for DSP", PHI.
5. Manual - ADSP 21 XX family DSP.
6. Press, "Numerical Recipes in C", Cambridge.

Teaching Scheme Examination Scheme
Lectures : 4 Hrs/week Paper : 100 Marks
1. Introduction :
Role of programming languages, need of study programming languages, characteristics of a good programming language, classification of Programming languages.
2. Implementation of Basic building blocks of a language:
variables, constants, binding types, structured data types, data structures, derived data types pointers, control flow, Statements.
3. Procedures :
Introduction, referencing, environment local, non- local, global, parameter passing methods, scope rules, activation records, study of procedures calls in C and Pascal. Storage Management - static, dynamic.
4. Object-oriented programming :
Basic concepts such as objects and classes, polymorphism, inheritance, abstraction, information hiding. Programming design with modules, templates, object-oriented concepts in C++, objects in Smalltalk.
5. Functional Programming :
Elements of functional programming, function declarations, types - values and operations, type checking, Expression evaluation, Functional programming with Lists.
6. Other Programming Language Paradigms :
Basic concepts of logic programming and concurrent programming.
7. Case Study of Pascal, Smalltalk, Lisp, Prolong, C, and C+ + (For each of these languages following points should be covered.
8. Overview of the building blocks of the language, procedures, control structures, and special features of the language.

Reference Books
1. Ravi Sethi, "Programming Languages", 2nd edition, Addison- Wesley Publications.
2. T.WPratt, "Programming Languages", 2 nd edition, Prentice-Hall of India.
3. Bjarne Stroustrup "The C+ + Programming Language" Addison Wesley.

Teaching Scheme: Examination Scheme
Practical: 4 Hrs/week Term Work: 25 Marks
Practical: 50 Marks
Assignments are based on the theory subjects Computer Graphics and Principle of programming languages, Theory of Computer Science.

Computer Graphics
1. Line/Circle drawing
2. Polygon filling.
3. 3-D transformations.
4. Segmentation.
5. Projections.
6. Animation
7. Windowing and clipping algorithms
8. Polygon clipping algorithm
9. Hidden line and surfaces
10. Curves and fractals
11. Fractals
12. Study assignment on any GUI application
13. Programming of display device drivers for various cards using Windows environment.
Programs must be designed using device independent graphics principles. Any Five from 1 to 11. Assignment number 12 is compulsory.

Principles Of Programming Languages
1. The instructor will frame suitable assignments to cover following Concepts of object-oriented programming.
2. Function prototypes, Function overloading, default values, references.
3. Objects and classes, public, private and protected members, methods, 'this' pointer.
4. Constructors and destructors, Inheritance and derived classes, Constructors and destructors in inheritance, public, private and protected derivations.
5. Multiple heritance
6. Static data members and methods.
7. Operator overloading.
8. Virtual functions, pure virtual functions
9. Abstract base class and Polymorphism
10. Virtual classes
11. Natural language processing using LISP
12. Line Editor using LISP

Theory of Computer Science
1. Regular expression to DFA.
2. Regular grammar to DFA.
The staff member should frame two assignments in C based on the above topics.
All together 6 + 5 + 2 = 13 assignments are expected minimally. All the assignments shall be carried out using Development system under windows.
Students will submit Term Work in the form of a Journal, which will include above assignments. Each assignment includes algorithm analysis, program listing and printout of output.
Practical examination will be based on above assignment, and questions will be asked to Judge the understanding of assignments performed, at the time of examination.


Teaching Scheme Examination Scheme
Practical: 4 hrs/week Term Work: 25 Marks
Oral: 50 Marks
1. Check the performance of a general difference equation LSI system using suitable Software package. Write a C function to implement a general difference equation based array mapping and compare the results.
2. Write C programs to generate samples of cosine, sine, square, sawtooth, exponential and random noise signals at specified sampling frequencies and compare the results with that of a standard software package.
3. Check the performance of a linear convolution operation using suitable software package. Write a C function to implement the linear convolution operation and compare the results.
4. Write a C function to compute the Fourier transform of a sequence at a given frequency and using the function, compute the transfer function of a few LSI systems.
5. Write a C function to compute the Z transform of a sequence at a given value of Z and using the function, compute the system function of a few LSI systems at points on the unit circle and X- Y axes.
6. Write a C program to accept the coefficients of a difference equation and plot the corresponding poles and zeros against unit circle and compare the results with that of a standard software package.
7. Write a C program to accept the coefficients of a difference equation generate the magnitude and the phase transfer function plots for the same and compare the results with that of a standard software package.
8. Write a C program to accept the pole-zero locations for LSI system and convert the same to the coefficients of a difference equation and compare the results with that of a standard software package.
9. Write a C program to implement a notch band-pass filter at a given frequency using a zero-pole-zero combination.
10. Write an assembly language routine on an DSP -Processor simulator and test it on a kit with ADC and DAC to perform AD-DA looping, AD-DA looping with inversion & AD-DA looping with half wave. rectification.
11. Write an assembly language routine on a DSP-Processor simulator and test it on a kit with ADC and DAC to perform difference equation implementation with given coefficients. Compare your results with the standard software with the kit.
12. Write a C program to design low-pass, high-pass FIR filters with given cut-off frequency, given no. of coefficients and given smoothing window. After generating the filter coefficients use the earlier difference equation function to check the response of the filter at different frequencies.
13. Write a C program to design Butterworth filters of given order and cut-off frequency using the bilinear transform method. Compare your results with the standard software package.
14. Write an assembly language routine to implement Goertzel algorithm for DFT at a given k on a DSP-Processor simulator and test it on a kit with ADC and DAC to perform difference equation implementation with given coefficients. Compare your results with the standard software with the kit.
15. Write a C function to implement DIT FFT of a given length. Compare test it on a kit with ADC and DAC so that the kit may be used as a spectrum analyser.
16. To implement a harmonic distortion analyser on the DSP - Processor kit and test the result for sinusoidal, square and sawtooth inputs.

Assignments from no. 1 through 5 are compulsory minimum TWO assignments from no. 6 through 9 and minimum SEVEN assignments from no. 10 through 17 are to be carried out. Students will submit the term work in the form of journal.
All programming assignments shall be carried out using Development system under Windows.
Students will submit Term Work in the form of a Journal, which will include above assignments. Each assignment includes algorithm analysis, program listing and printout of output.
Oral Examination will be based on the Term Work.

Teaching Scheme: Examination Scheme:
Practical: 4 hrs/week Term work: 50 Marks
Practical: 50 Marks
1. Design and implementation of 4-bit multiplier.
2. Design and implementation of 4-bit divider.
3. Design of 4/8-bit CPU.
4. Reading a boot record and displaying its contents.
5. Use FAT to read a file and determine number of bad sectors. File under DOS. Use of file handlers.
6. Device driver in assembly language (printer I/O). Under DOS, in WINDOWS 95.
7. TSR in assembly for Alarm, Printing in background, screen saver.
8. Floating point calculation using co-processor instruction.
9. Write an assembly language program to implement a COPY, TYPE etc., commands.
10. Partitioning of Hard Disk and Making a partition a system partition.
11. Study of VXDs and windows device drivers.
12. Emulation of catching techniques.
13. Graphics printer device driver.
Staff member should frame minimum 14 assignments on above topics.
Students will submit Term Work in the form of a Journal, which will include above assignments. It must include design diagram, results (for hardware) and algorithm, program listing, printout (for software) assignments.
Practical examination will be based on above assignment and questions will be asked to judge the understanding of assignments performed, at the time of examination.
Teaching Scheme: Examination Scheme
Lectures : 4 Hrs/week Paper : 100 marks

1.80386 architecture, functional diagram, support for pipelining, dynamic bus sizing, 80386DX/SX differences. Programmers model of 80386, register model, data types and addressing modes, Instruction set of 80386. Bus cycles with 16 & 32 bit data bus with timing, state diagrams, interrupt acknowledge, HOLD, HALT, RESET cycles.
2.80386 mode, Real, Protected , VM86 modes programming model. Memory management through segmentation and paging. Support registers and caching in memory management.
3.Protection mechanism and privilege levels in protected and VM86 modes, privileged instructions, Protection mechanism in segmentation and paging procedures. Inter privilege level access mechanism gates. Multitasking support, task switching, task gates.
4.Exceptions, Faults, Traps, Interrupt handling, IVT, IDT. Interrupt, trap gates, interrupt handling in real, protected, V86 mode.
5.Co-processor interface, 80387 interconnection and features.
6.16 and 32 bit memory interfacing, static and dynamic RAM, DRAM controller design, cache memory, organization for Pentium family, 82496 cache controller, 82491 cache CPU chipset.
7.Pentium Family Architecture and features.
8.I/O address space and I/O interfacing, PCI, SCII bus and controller.
9.Micro controller MCS-31/51 family architecture and study, Register set, Register bank, Memory and I/O interfacing, SFRs, interrupt structure, other features. Design of micro-controller card.

1. Tribel, 80386/486/Pentium Hardware and Software, PHI.
2. Turley, 80386 advance programmer manual.
3. Microprocessor Data manual Vol-II, Intel.
4. Intel MCS- 51 series data manual.
5. Intel 80386 Hardware reference manual.

Teaching Scheme : Examination Scheme
Lectures : 4 Hrs/week Paper : 100 marks
1. Signals and Spectral Analysis :
Classification of signals periodic, non-periodic, Fourier series and Fourier Transform representation for signals, properties of Fourier transform, convolution theorem, Energy and power spectral densities, filtering of signals, Bandwidth requirements of signals.
2. Amplitude and Angle Modulation :
Amplitude modulation & its variations like DSB-FC, SSB-SC, frequency modulation, phase modulation, Principle of Superheterodyne radio receiver (Block diagrams only), Application in brief for above modulation techniques e.g. radio, T.V, mobile Phone etc.
3. Pulse Modulation :
Sampling theorem, natural and flat-top sampling, Pulse amplitude modulation, Time Division multiplexing, Pulse transmission over band limited channel, cross talk and guard time Inter symbol Interference, Eye diagram.
4. Source Coding Techniques in Digital Communication :
Pulse Code Modulation Encoder/Decoder, Codec ICs, Multiple Channel frame Alignment -for PCM-TDM, Multiplexing hierarchy, Typical bit rate calculations for voice transmission in telephone networks, Quantization noise, compounding, Delta modulation, Slope overload and Adaptive Delta Modulation, Applications of above source coding techniques as data compression tools e.g. Linear predictive coders etc., voice coders. Effect of Guassian type noise on digital transmission.
5. Error Control and Line Coding Techniques in Digital Communication :
Measure of information, entropy, information rate, Shannon's theorems on channel capacity, codes for error detection and correction such as parity, vertical redundancy check, longitudinal redundancy check, checksum, block check character, block codes Hamming code, cyclic redundancy check code. Line codes such as bipolar, unipolar, RZ, NRZ, Manchester, AMI, handshaking techniques like FEC, ARQ, channel through put and efficiency calculations.
6. Modems :
Digital continuous wave modulation techniques for modem such as ASK, FSK, PSK, Block diagram of Modern and interface control for typical modem, modem standards.
7. Network Protocols
International standard organization - open system Interconnection (ISO-OSI) architecture seven layer model, physical layer protocol, RS232, RS-422, RS-449, 4 to 20 mA current interface, Data link level protocol HDLC, SDLC, X-25 Types of Networks, LAN, WAN, Satellite Network, PSTN, ISDN etc., Introduction to LAN, attributes of LAN, topologies, IEEE LAN 802 standards for MAC, LLC, CSMA/CD, Token Bus, Token ring etc., net-working media such as coaxial thin/thick, twisted pairs - shielded/unshielded, optical fibre cables.
8. Telephone Network
Wire telephony, subscriber loop, trunk circuits, Four wire terminating set, Public switch telephone networks, Network stability, Vin Net loss.
9. Satellite Communication :
Orbital aspects, Geostationary satellite, station keeping, Frequency plans and polarization, transponders, multiple access methods, power budget.
10. Fibre optic communication :
Principle of light transmission in fibre, types and modes of fibre, losses in fibre, Dispersion, light sources and detectors, fiber optic communication link.

Reference Books:
1. Roddy Coolen, "Electronics Communication", PHI, 4th Edition.
2. William Sinnema, "Digital Analog and Data Communication", PHI, 2nd Edition.
3. William Schweber, "Data Communication", MeGraw Hill.
4. Prackash C. Gupta, "Data Communication", PHI.
5. William Stailining, Data and Computer Communication, PHI.

Teaching scheme: Examination Scheme:
Lecturers: 4 Hours/Week Paper: 100 Marks

* Conventional DBMS Course coverage
* Introduction to various database Architectures
* Introduction to New database Applications
* Introduction of Database Administration Issues


1. Introduction to DBMS:
Basic concepts, Advantages of a DBMS over file-processing systems, Data abstraction, Data Models and data independence. Components of a DBMS and overall structure of a DBMS. Life cycle of a DBMS Application, Database terminology
2. Data Modeling:
Basic Concepts, Types of data models, E-R data model and Object-oriented data model. Relational, Network and Hierarchical data models and their comparison. E-R and EER diagramming.
3. Relational Model:
Basic concepts. Attributes and domains. Intentions and extensions of a relation, concept of integrity and referential constraints. Relational Query Languages (Relational Algebra and relational Calculus). Concepts of View and triggers.
4. SQL:
Structure of a SQL query, DDL and DML, SQL queries, Set Operations, Predicates and Joins, Set membership, Tuple variables, set comparison, ordering of tuples, aggregate functions, nested queries, Database modification using SQL, Dynamic and Embedded SQL and concept of stored procedures.
5. Relational Database Design:
Notion of a normalized relations. Normalization using functional dependency, Multi-valued dependency and Join dependency.
6. Database Administration Issues:
DBA role, Query optimization, indexes, data dictionary, security, backups, replication, SQL support for DBA. Commercial RDBMS selection.
7. Transaction management:
Basic concept of a transaction, Components of transaction management (Concurrency and recovery system). Different concurrency control protocols such as timestamps and locking. Different crash recovery methods such as log-based recovery and shadow-paging. Concepts of cascaded aborts, multi-version concurrency control methods.
8. Object-oriented DBMS:
Object-oriented concepts: objects, classes, attributes, messages, inheritance and polymorphism etc., object schemes, class-subclass relationships, inter-object relationship, features of object-oriented DBMS and ORDBMS.
9. Database systems Architecture:
Centralized, client-server systems, Parallel systems, distributed systems, Web-enabled systems.
10 New Applications:
Need for data analysis, Decision support systems, Data Warehouse. On-line Analytical Processing(OLAP), Data mining concepts, spatial and geographical databases, multi-media Databases.

Reference Books :

1. Henry Korth, Abraham Silberchatz: "Database System Concepts", Third Ed., McGraw Hill, Inc, New York.
2. C. J. Date, "Introduction to database Management systems", 6th Ed.
3. Groff James R., Paul Weinberg, "LAN times guide to SQL"
4. Bipin Desai, "Introduction to database management systems".


Teaching Scheme: Examination Scheme:
Theory: 4 hrs/week Paper: 100 Marks


Definition, Components of system software, Evolution of system software, Language translators, batch monitors, multiprogramming operating system, time sharing operating system, evolution of programming system.
Structure of an assembler, Design of two pass assembler(8085 as ref), single pass assembler-Table of incomplete instruction, backpatching, cross assembler.
Macro instructions, Features of a macro facility, Design of two pass macroprocessor, Implementation of nested macros(macro call inside definition , definition inside definition)
Schemes:compile and go, general loader scheme, absolute loader, subroutine linkages, relocating loaders, direct linking loader, dynamic linking loader, overlay structure. Design of - absolute loader, direct linking loader. Implementation example - MSDOS linker.
Compiler phases (Introduction, with input/output for each phase must dealtwith), Concept of cross compiler(introductory part only), Features of machine dependent and in dependent compilers, Types of compilers with definition only, Interpreters, Types of Compilers.
Tools for programming testing, Text editors- screen editor, line editor, Word processors, debug monitors.
Operating system components, system calls, OS services - file management, memory management, devoice management, process management, system calls, Process scheduling : long term, short term, middle term scheduler. Interprocess communication : direct communication, indirect communication, buffering.
8. DLL
Concept of clip board, Dynamic data exchange. Dynamic link libraries-The need, conventional dynamic linking libraries, the class library, dynamic linking, name mangling & DLLs. The use of call back functions, far function prolog, Different methods of specifying link, Dynamic linking with & without import. OLE basic idea of what is an object linking & embedding is expected.

1. L. Beck: "System software an introduction to system programming" AWP-1977 3rd edition.
2. John Donovan: "System programming", McGraw Hill Publications.
3. D.M. Dhamdere: "System programming & operating system", Tata McGraw Hill.
4. Peterson, "Operating system".
5. Charles Petzold, "Programming Windows 3.1", Microsoft Press.


Teaching Scheme Examination Scheme
Practicals : 4 hrs/week Paper : 100 Marks


1.Software & Software Engineering:- What Is & Why Software Engineering?, Product: Evolving Role Of Software , Software Characteristics, Components, Applications ,Software Crisis & Myths ,Software Engineering ,Software Process ,Software Development Phases & Software Process Models , Prototyping & RAD Models , Waterfall Model, Incremental Model, Spiral Model, 4 GT Model , CASE Tools & Classifications .
2. Planning & Management Of Software Projects:- People ,Problem & Process ,Measures ,Matrices & Indicators ,Matrices For Software Quality , Scooping, Software Project Estimation , Make-Buy Decisions , Software Acquisition , Software Risks , Identification, Assessment, Monitoring , Project Scheduling & Tracking , Tasks/Work Breakdown Structures , Timeline Chart , Project Plan , CASE Tools
3. Systems Engineering:- Computer Based Systems , Systems Engineering Hierarchy , Information Engineering , Information Strategy, Planning , Enterprise Modelling , Data Modelling , Business Area Analysis , Feasibility Study , Economic & Technical Feasibility Analysis , Modelling System Architecture Diagram , CASE Tools
4. Requirement Analysis:- Communication Techniques , FAST , Quality Deployment , Analysis Principles , Modelling , Partitioning , Prototyping , Specifications , SRS & SRS Reviews , Analysis Models , Data Modelling, Functional Modelling & Information Flow , Data Flow Diagrams , Extensions To Real Time Systems , Behavioural Models , Mechanics Of Structured Analysis , ER Diagrams , Control Modelling , Data Dictionary , CASE Tools
5. Design Fundamentals:- Software Design & Software Design Process , Principles & Concepts , Abstraction , Refinement & Modularity , Software Architecture , Control Hierarchy , Partitioning , Data Structure , Information Hiding , Effective Modular Design , Cohesion , Coupling , Design Module , Design Document , CASE Tools
6. Design Methods:- Architectural Design & Design Process , Transform & Transaction Flow , Design Steps , Interface Design Procedural Design , Graphical & Tabular Design Notations.
7. Software Testing & Testing Strategies:- Software Testing Fundamentals , Test Case Design , White-Box, Black-Box Testing , Control Structure Testing , Strategic Approach To Testing , Strategic Issues , Unit Testing , Integrated Testing , Validation Testing , System Testing , CASE Tools
8. Object Oriented (OO) Software Engineering:- Planning , OO Paradigms & Concepts , Identifying Elements Of Object Model , Object Oriented Analysis (OOA) & OOD , Conventional Vs OO , Generic Components Of OO Analysis Model , OOA Process , Object-Relationship Model , Object-Behaviour Model , Human Computer Interface (HCI) Components , Object Design Process , Design Patterns , CASE Tools
9. Unified Modelling Language (UML):- Different Methods , Rambaugh / Booch / Jackobsons , Need For Standardisation , Diagramming In UML , (Use Class, Class Interaction, State Diagrams) , CASE Tools
10. Software Quality Assurance:- Software Quality Concepts , Software Quality Assurance (SQA) & Approaches , Software Reliability , SQA Plan , ISO 9000 & SEI Standards For Software , Software Configuration Management (SCM) , Base Lines , Scan Process , Version Control , Change Control , SCM Audits , CASE Tools

Reference Books:

1. Roger Pressman: Software Engineering, a practitioners approach.
2. Martin Fowler: UML Distilled, Addision Wesley.
3. Grady Booch: OOA & design, Addision Wesley.
4. Rambaugh et.: OO modeling & design, PHI.
5. Pfleeger S.L.: Software Engineering.


Teaching Scheme Examination Scheme
Practicals : 4 hrs/week Term Work : 50 Marks
Oral : 50 Marks


1. Assembly Language programming for 80386. Simple programs for introduction sets e.g. 32-bit Calculator. Integer Arithmetic.
2. 80386 Protected Mode - i) Task Switching in the Protected Mode. ii) Paging.
3. Study of 386, 486, Pentium Motherboard (Any one) -
i)Layout of Motherboard and minimal peripheral devices like HDD, RDD, mouse, etc.
ii) Study of CMOS set up.
iii)Study of cable set in computer system.
iv)Installation of peripherals.
4. Mouse interfacing.
5. PC Diagnostics using Diagnostic Tool.
6. Hardware Troubleshooting of computer system.
i) Detection of Memory Failure
ii) Detection of Video Adpaters Failure
iii) Detection of HDD, FDD Failure.
iv) Detection of Keyboard Failure.
v) Detection of Serial/Parallel Port Failure
7. PC-to-PC communication through RS 232 port.
8. Study of Modern Commands and PC-PC involving communication using external modem with component CRC/BLOCK check codes.
9. PC-PC communication using optical link.
10. Paper work for 386 / Pentium Based Microcomputer System Design.
11. PCM using CODEC device
12. Study of ASK/ PSK/ FSK techniques.
13. Generation of Data Pattern like RZ, NRZ, Split Phase Manchester, AMI, etc. using graphics.
14. Interfacing with 8031/ 51 development board.
Staff member should frame minimum 14 assignments consisting of minimum three assignments on 8031/51. Students will submit Term Work in the form of Journal which will include above assignments with design, algorithm, listing.
Oral examination will be based on Term Work.


Teaching Scheme Examination Scheme
Practical : 4 hrs/week Term Work : 50 Marks


1. Windows Programming
Basic Windows SDK programming. Programming involving Dialog Boxes, Menus and standard GUI components. Writing of Windows Help file using "HC". Writing DLLs and VXDs (Win 95).
2. Front-end Tools :
Assignment based on packages like VC+ + / VB 1 VJ + + / Delphi 1 Borands Builder Pro. Assignments should cover basic GUI components, Database Access, File processing (In case of Microsoft products, assignment based on ActiveX technology).
3. Internet Programming Tools
HTML and/or SGML Basis, Vbscript and/or Java Scripts. Internet Programming using VB/VC + + etc. CGI programming, PERL programming. Elementary VRML programming.
Staff member should frame at least FOUR assignments on each of above topics. Also a mini project should be assigned to and developed by a group of maximum TWO students.
Student will submit Term Work in the form of Journal which will include above assignment with neat documentation.


Teaching Scheme : Examination Scheme :
Practical : 4 hrs/week Term Work : 50 marks
Practical : 50 marks

Assignments in this laboratory will be based on Database Management systems, Systems Programming and Software Engineering.

A. Database Management Systems:
1. Creating a sample Database application using conventional file processing mechanisms and 'C' language. The program should provide facilities for retrieving, adding, deleting and modifying records.
2. Prepare an E-R diagram for the given problem definition. Prepare and verify a relational database design using concepts of normalization techniques appropriate normal form.
3. Creating a sample database files and indexes (for design made in experiment no. 2) using any client server RDBMS (Oracle/Sybase) package using SQL DDL queries. This will include constraints (key referential etc) to be used while creating tables.
4. SQL DML queries: Use of SQL DML queries retrieve, insert, delete and update the database created in experiment no. 3. The queries should involve all SQL features such as aggregate functions, group by, having, order by, subqueries and various SQL operators.
5. Screen design and Report Generation: Sample forms and report should be generated using their Developer 2000 (in case of Oracle) or through Power-Builder orVisual Basic front end tools or any prototyping software engineering tool.
6. Case study of a MIS.

B. Software Engineering :
For a given problem definition, perform Object-Oriented analysis and Design activities. Make use of any available Object-oriented analysis and design tools (such as Object Analyst) and provide an object-oriented design.

C. System Programming :
Develop a program in 'C' or 'C+ + ' for the Intel 8085/86 assembler. Augment the above program to support macros.
Staff member should frame minimum 6 assignment from group A, 4 assignments from group B and 2 assignments from group C.
Student will submit Term Work in the form of Journal which will include above assignment. Each assignment includes algorithm analysis, program listing and printout of output. It is desired that presentation, category diagrams etc. be used in software engineering assignments. Emphasis on good documentation.
Practical examination will be based on above assignment and questions will be asked to judge understanding of assignments performed at the time of examination.


Teaching Scheme Examination Scheme
Lectures: 4 hrs/week Theory: 100 Marks
Practical: 2 Hrs./Week Term Work: 25 Marks
Oral 50 Marks


1. Introduction to Computer Networks:
Uses of Computer Networks, Types of Networks, Networks Hardware, Networks software, Network Design Issues, Network design tools. ISO's OSI Reference Model & TCP/IP reference Model. Example Network: Novell Netware, ARPANET. Internet, SMDS, X.25 networks, Frame Relay & B-ISDN and ATN.
2. Network Analysis and Modelling:
Analysis of loss and delay, Queing theory, M/M/l queue, Modeling Network as a graph, Fundamental graph algorithms.
3. Data Link Layer:
Design Issues, Services provided to the Network layer, Framing Error Control, Flow control. Elementary Data Link Protocols: Simplex Stop & Wait Protocol, Simplex Protocol for Noisy Channel. Sliding window protocols: Using GO Back n, using selective Repeat. Protocol performance, Protocol Specification & verification. The Data Link Layer in the Internet & ATM.
4. The Medium Access Sublayer:
Static and Dynamic Channel Allocation, Multiple access protocol: ALOHA, CSMA/CD. Collision-Free Protocols. Limited-contention Protocols, WDMA, Wireless LAN Protocols & Digital Cellular Radio. IEEE 802.3, 802.4, 802.5 & 802.5 standards. BRIDGES: 802 Bridges, Transparent Bridges Source Routing Bridges, Remote Bridges FDDI, Fast Ethernet & satellite networks.
5. Network Layer:
Design issues, Routing algorithms, Congestion control algorithms, Internetworking, firewalls.
6. Transport Layer:
The transport service, Elements of transport protocols: Addressing Establishing & releasing a connection, Flow control and buffering, Multiplexing and Crash recovery. Simple transport protocol. The Internet transport protocol TCP & UDP. Performance issues. Concept of socket and socket programming (TCP/IP, SPX/PX, WINSOCK).
7. Network Security:
Issues of Network security and privacy, Traditional cryptography, substitution and transposition ciphers, Cryptographic principals, Secrete key algorithms, Data Encryption standards (DES), Public key algorithms, RSA algorithm, Authentication protocols and digital signature.
8. Network Management:
Overview of Distributed computing and technologies, RPC, NFS. Network management system, Network management standards, SNMP, CMIP, Management activities. Fault management, Security management, and Accounting management.
9. Internet & Application :
DNS, Concepts and configuration of DNS, Proxy server, Mail server, Web server, Client server interaction, example client and a server, Email representation and transfer. File transfer and remote file access, www pages and browsing, CGI and Java technology. Case Study and systems requirements for ISR

1. A. S. Tanenbaum, Computer networks, Latest edition PHI Publication
2. Aaron Kershenbaum, Telecommunication Network design Algorithms, MCGraw Hill
3. William Stallings. Data and Computer communication, PHI
4. Keshav, Engineering approach to Computer networks. Addison Wesley
5. Douglas E. Corner, Computer networks and internets, Prentice Hall.
6. Barry Nance, Network Programming in C, Prentice Hall.
7. Ralph Devis, Windows Network Programming, Addison Wesley.


Teaching Scheme Examination Scheme
Lectures : 4 hrs/week Theory : 1 00 Marks


Review of types of operating systems :
Batch timesharing,,multiprogramming, multitasking and distributed and real time. Unix O.S. Fundamentals : System concepts, Kernel data structure and administration, Concept of Buffer cache, Reading and writing to disk blocks.
Processes and process management:
Process concept, interleaved I/0 and CPU burst; Process states; O.S. services for process, management. thread, Scheduling algorithm, Interprocess communication and synchronization - Need for interprocess synchronization, Semaphores, H/W support for mutual exclusion, Deak Lock - Principle, detection, prevention and avoidance, Critical region and conditional, critical regions : Monitors, messages for inter process communication and synchronization, Classical problems in concurrent programming (viz. pro ducer/consumer/reader/writer with and without bounded buffer).
Process management in Unix : Structure of processes, Process, control, User ID of Process creating process, Process System calls - fork, join, EXEC, System boot & init process, Shutdown process.
Memory management:
Types : Contiguous and non-contiguous, Paging -concept, Virtual memory, Management of Virtualmemory : allocation, fetch, replacement.
Memory management in Unix : Policies, Swapping, Demand paging.
I/0 management:
I/0 Interfaces, Buffer register, Buffer commands, Operating system design issue.
File management :-
File organization, concept of files & directories, Hierarchical structure of files Space Allocation, Free space management, Security issues, Protection mechanism.
File management in Unix : Internal representation of files, Inodes, structure of various files Directories, Super block, Inode assignment to a new file, Allocation of disk blocks, system calls for files - Open, read, write, close, File creation, Pipes.
Distributed operating system :-
Fundamental concept of distributed operating system, What is distributed computing system evolution, system models, in brief issues in designing distributed OS.

1. Milenkovic, Operating Systems Concepts and Design, McGraw Hills
2. Peterson, Operating Systems Concepts
3. P K. Sinha, Distributed Operating Systems Concepts and Design, PHI
4. Bach, Unix Operating Systems
5. Godbole, Operating System
6. Steven, Advanced Unix Programming.


Teaching Scheme Examination Scheme
Lectures: 4 hrs/week Theory: 100 Marks


1. Review of Object modeling , new paradigm, object oriented thinking-rethinking, Objects and Classes. Links and association, Generalization and specialization, Inheritance, Grouping concepts, aggregation, abstracts classes, Polymorphism, Metadata, Constraints, Reuse, Dynamic modelling events states, Operations, Concurrency.
2. Importance of modeling, brief overview of Object Modelling Technology (OMT) by Rambaugh, Booch Methodology, USE CASE drive approach (OOSE) by Jackobson, overview of CRC card method by cunnignhaum.
3. Overview of UML : Efforts of standardization/ Integration, OMG approval for UML, Scope of UML, Conceptual model of UML, architecture-Metamodel, mechanisms Unified Software Development lifecycle, UML diagrams.
4. UML Diagrams: Terms and concepts, relationship, diagrams.
- Advanced Class Diagram: Advanced relationship, interface-types and rules, packages common modelling techniques, modelling groups of elements, modelling architectural views.
- Instances and Objects Diagrams: modeling concrete/Prototypical instances, links, objects interaction.
- Collaborations, Use Cases, Interaction Diagrams, State Transition Diagrams.
- Architectural Modeling: Component Diagram, Deployment Diagram, Pattern and framework.
5. Introduction to Component Technology, Concept of distributed Object Systems: COM, DCOM and CORBA, Introduction to Object Oriented Databases.

1. Booch/Rambaugh, Jachobson-UML User Guide, Addison Wesley.
2. Sinon Alhair : UML-IN a Net Shell.
3. Rambaugh : Object Oriented Modeling and Desigri, PHI.
4. Booch, Object Oriented analysis and Design with applications, Addison Wesley.
5. B. Meyer, Object Oriented Software Constructions, PHI.


Teaching Scheme Examination Scheme
Lectures: 4 hrs/week Theory: 100 Marks


1. Introduction to Compiler
Translator issues, why to write compiler, compilation process in brief, front end and backend model, compiler construction tools, Interpreter and the related issues, Cross compiler, Incremental compiler, Boot strapping.
2. Lexical Analysis
Introduction of lexical analysis: alphabet, token, lexical error, Block schematic of lexical analyser, explanation of NFA, DFA, Conversion form NFA to DFA, R.E. to optimised DFA, time v/s space complexity. Construction of Lexical analysis: Hand coding of Lexical analyser, i/o buffering, Lexical lookahead issue, comment handing, error recovery, Time and space complexity, Automatic construction of lexical analyser (LEX), LEX specification details.
3. Syntax Analysis
Introduction: Role of parsers & issues of separating lexical & syntax analysis. Types of grammar, CFG introduction, expressing language through CFG. Basic concepts in parsing-leftmost derivation, rightmost derivation, derivation tree, sentence, sentential form, language, derivation, parse tree, Ambiguous grammar. Representation of CFG-Tree, Backous Naur form, recursive rules etc., Precedence and associativity, disambiguating grammar. Parsing technique: Top down-RD parser, Predictive LL (k) parser, Bottom up-shift-Reduce, SLR, LR(k), LALR etc. [I/p, o/p, data structures required, block schematic, algorithm, limitations, efficiency to be covered about all above parsers. Automatic construction of parser (YACC), YACC specification file details-error detection and recovery in YACC.
4. Static Semantics and Intermediate code Generation:
Need of semantic analysis, declaration processing, type analysis-unification algorithm, polymorphic algorithm, overloading function and operation, type conversation, equivalence of type, Limitation of CFG, augmenting CFG with attributes, Attributes grammar-S-attribute grammar with attribute evaluation, Integrating attribute evaluation with parsing, S-attribute definition for name, scope analysis and its interaction with symbol table management-Symbol Table (ST) organisation for block structure and non block structured languages, ST management, L-attributed definition for declaration processing, Comparison of different intermediate code forms, Intermediate code generation for declaration, assignment, iterative statements, case statements, arrays, structures, conditional statements, Boolean expressions, procedure function definition and cell [Usage of YACC utility to generate intermediate code].
5. Code Generation
Introduction: Issues in code generation, Target description [may be taken as 8085/80861. operand description, partial result handing, register description, local and global Register allocation and assignment, Dynamic programming-principle and algorithm, Peephole optimisation, unreachable code, time versus space complexity trade off, Sethi Ullman algorithm for expression trees, Aho Johnson algorithm, different models of memory used in compiler (e.g. small, tiny in Turbo C), Code generator-generator concept.
6. Code Optimisation
Introduction, Principle sources Of Optimisation, m/c dependent Optimisation, m/c independent optimisation, Optimising transformation, compile time evaluation, Common expression evaluation value propagation, code Movement and loop invariant computation, strength reduction, loop test replacement, dead code elimination. Local optimisation: DAG based local optimisation, Introduction to global data flow analysis, control flow analysis-concepts and definition, data flow analysis-definition and concepts, formulation of data flow problem, solving data flow problem, Performing data flow analysis, Representing dataflow analysis, Computer data flow analysis, meet over paths, forward and backward dara flow programming. Computing global data flow information. Iterative data flow analysis, Interprocedural analysis and optimisation.
7. Run Time Storage Organisation
Storage allocation strategies, static, dynamic storage allocation, allocation strategies for block structured and non-block structured languages; O.S. support required for YO statements. (e.g. printf, scanf) and memory allocation deallocation related statement. (e.g. new, malloc)

Reference Books
1. Aho, A. V., R. Sethi and J. D. Ulman, Compiler principle, techniques and tools-, Addison wesley.
2. Barrent W. A., J. D. Couch, Compiler construction theory and practice-, Computer science series, Asian student edition.
3. Dhamdhere D. M., Compiler construction principle and practice-, Mac. Millan India, New Delhi.
4. Gress D.. Compiler construction for digital computer, Wiley New York.
5. Holub A. J., Compiler design in C-Printice Hall.
6. Tremblay J. P. and R G. Sorenson Theory and Practice of compilers.
7. Lex and Yece-O'relly.
8. Muchnlk -Advanced compiler design & Implementation.


Teaching Scheme Examination Scheme
Lectures : 4 hrs/week Paper : 100 Marks
Pract. : 2 hrs. /Week Term Work : 25 Marks
Oral : 50 Marks


1. Introduction to Artificial Intelligence :
Definition. A.I Applications, A.I Representation, Properties of internal Representation, Heuristic search techniques. Best first search, mean and ends analysis, A* and AO* Algorithm.
2. Game Playing:
Minimize search procedure, Alpha-beta cut offs. Waiting for Quiescence, Secondary search.
3. Knowledge representation using predicate logic:
Predicate calculus, Predicate and arguments, ISA hierarchy, Frame notation, Resolution, Natural deduction.
4. Knowledge representation using non-monotonic logic:
TMS (Truth maintenance system), Statistical and probabilistic reasoning, Fuzzy-logic, Structure knowledge representation, Semantic-net, Frames, Script, Conceptual dependency.
5. Planning:
Block world, strips, implementation using goal stack, Non-linear planning with goal stacks, Hierarchical planning, List commitment strategy.
6. Perception:
Action, Robot architecture, Vision, Texture and images, Representing and recognizing scenes, Waltz algorithm, Constraint determination, Trihedral and Non Trihedral figures labelling.
7. Learning :
Learning as induction-matching algorithms. Failure driver learning, learning in general problem solving concept learning.
8. Neural Networks:
Introduction to neural networks and perception-qualitative Analysis only, neural net architecture and applications.
9. Natural language processing and understanding and pragmatic, syntactic, semantic, analysis, RTN, ATN, understanding sentences.
10. Expert system :
Utilization and functionality, Architecture of expert system Knowledge -representation, two case studies on expert systems.

Reference Books
1. Eugene, Chamiak, Drew McDerinott; Introduction to artificial intelligence.'
2. Elaine Rich and Kerin Knight; Artificial Intelligence.
3. Kishan Mehrotra, Sanjay Rawikd, K. mohan; Artificial Neural Network.

Laboratory Work
Assignment based on,
1. A* Algorithm Implementation.
2. AO* Algorithm Implementation.
3. Implementation of Unification Algorithm.
4. Development of Mini Expert System using Prolog.
5. Implementation of Truth Maintenance system using Prolog.
6. Implementation of Min/MAX Search procedure for Game Playing.
7. Parsing Method Implementation.
Staff should frame any six assignments on above topics.


Teaching Scheme Examination Scherne
Practical:- 4 hrs/week. Term Work : 50 Marks
Pract: 50Marks

(A) Laboratory Assignments in Compiler Construction:

1. Calculator(text. or graphics) using LEX and YACC.or Document editor (find replace, macro) using LEX and YACC or Similar kind of assignment using LEX nd YACC
2. Lexical Analyser for a subset of PASCAL/C. using LEX
3. Syntax analyser along With Intermediate code generation (Triple, Quad) for a subset of PASCAL/C using LEX and YACC
4. Interpreter for an expression grammar
5. PASCAL to C converter using LEX and YACC
6. Code generator for a Hypothetical Machine
7. Any two optimisation techniques on intermediate Code Generation
- Constant expression evaluation
- Local copy propagation
- Common sub expression elimination
- Loop invariant code movement
8. Pseudo language complier (for 8085 rhachine) using LEX & YACC
[Assignments number 2 6, 7 are compulsory and from the remaining any one).

(B) Laboratory Assignments in Operating System
1. Study of various commands in UNIX
2. Program development toWards study process and communication in UNIX
3. CPU scheduling
4. Demand Paging
5. Concurrent programming-Reader/Writer Problem
6. Deadlock Bankers Algorithm
7. Installation of LINUX
Four assignments on above topics.

(C) Laboratory Assignments in Object Oriented Modelling and Design :
Consider representative system such as College Library INventory Super Shopee (or any other topic of sufficient complexity) for this system define as assignment.
1. Class Diagram
2. Use Cases
3. Interaction or Activity Diagram
4. State Chart Diagram Using Object Analyst.


Teaching Scheme Examination Scheme
Practical : 2 Hrs. Term Work : 50 Marks

Each student will select a topic in the area of Computer Engineering and Technology preferably keeping track with recent Technological trends and development. The topic must be selected in consultation with the institute guide.
Each student will make a seminar presentation in the term making use of audio/visual aids for a duration of 20,-25 minutes.and submit the seminar report in the form of bound journal (l copy) duly guide signed by the guide and Head Of department.. Attendance at seminars for all students is Compulsory.
The seminar will he assessed internally by a Pannel of staff members from the institute, during Presentation.


Teaching Scheme Examination Scheme
Practical: 2 Hrs/Week (Term I) Term Work: 100 Marks
6 Hrs/Week (Term II) Oral: 50 Marks

(At the end of Term II)
The student will undertake one project over. The academic Year, which will involve the design of system or subsystem in the area of Computer Engineering.
(i) If the project is chosen a hardware project it will involve the designing a system - subsystem or upgrading an existing system. The design must be implemented into a working model with necessary software interface and a user manual.
(ii) If the project chosen is in the area of pure Software Application it must involve in the detail Software Design Specifications, Data Structure Layout, File Design, Testing with complete documentation and user interface. With life cycle testing and as an executable package.
The project will be undertaken preferably by a group of at least 4: students who will jointly work and implement the project. The group will select a project with the approval of the guide (Staff-members assigned) and submit the name of the project with a synopsis of not more than 2 to 3 pages not after than the second week of August in the academic year. A preliminary report by the group must be submitted and certified at the end of Semester I This is necessary for grant of first term.
The group will submit at the end of Semester II.
(i) The workable project.
(ii) Project Report in the form of bound journal complete in all Respects 1 copy for the institute 1 copy of each student in the Group for certification.
The term work will be assessed by the examiners in consultation with the guide. Oral Examinations will be based on the project work completed by the candidate.
The project report will contain the details
1. Problem definition and requirements specification, acceptance test procedure (ATP)
2. System definition-requirement analysis
3. System design
4. System implementation-code documentation-dataflow diagram /algorithm.
5. Test results and procedure-test report as per ATP.
6. Platform choice use.
7. Appendix tools used, references.
Documentation will use UML approach with Presentation, Category, Use Case Class Diagrams etc.


Teaching Scheme Examination Scheme
Theory: 100 Marks Lectures: 4 hrs/week


1. Introduction to parallel processing
Necessity of high performance, Constraints of conventional architecture, Parallelism in uni processor system, Evolution of parallel processors, Future trends, Architectural classification, Applications of parallel processing, Programming and networking properties, Principles of scalable performance.
2. Pipeline processing:
Principles and implementation, Classification of pipeline processors, General pipeline and reservation table, Design aspects of arithmetic, and instruction pipelines, Pipeline hazards and resolving techniques, Data buffering techniques, Advanced pipeline techniques: Loop unrolling technique, Out of order execution, Software scheduling, Trace scheduling, Software pipeline, VLIW processor,
3. Vector Processors:
Basic architecture, Issues in Vector processing, Vector instruction formats, Vector performance modeling, Vectorizer and Optimizers,
4. Array Processor:
SIMD computer organization, Masking and data network mechanism, Inter PE communication, Interconnection network of SIMD, Static Vs Dynamic network, Cube, Hyper cube network
5. Parallel algorithms for array processors:
SIMD matrix multiplication, Parallel sort, FFT
6. Multiprocessor Architecture:
Loosely coupled, Tightly coupled, Processor characteristics, Inter processor communication networks: Time shared bus, PCI bus, Crossbar switch, Multi port switch Memory contention and arbitration techniques, Cache coherence and snooping, Issues towards cluster computing,
7. Multi threaded architecture:
Latency hiding techniques, Principles of multithreading, Issues and solutions, Message passing program development, Synchronous message passing, Asynchronous message passing
8. Parallel Software Issues:
a. Compiler technology for vector machine, Code optimization and Vectorization, Inter process communication mechanism and Semophore for multiprocessing
b. Parallel algorithms for multiprocessors, Classification, Performance
c. Operating system for parallel processors, Multiprocessor OS, Study of parallel programming interface: PVM in distributed memory system, Pthreads in shared memory system, Elements of distributed file system.
9. Parallel Programming Techniques:
Data parallelism, Shared variables, Message passing
10. Altra SPARC V-9 architecture -case study
11. Introduction to neuro computing and optical computing

1. Kai Hwang, Advanced Computer architecture.
2. Harrold Stone,High performance computer architecture.
3. Richard Y. Kain, Advanced Computer architecture.
4. Impact course material-ISTE.


Teaching Scheme Examination Scheme
Theory: 100 Marks Lectures: 4 hrs/week


1. Introduction
Introduction to Project Management, Scope of the Project Planning and Management Activity, Task and responsibilities of a Project Manager/Team Members, Typical Software Organizational Structure.
2. Requirement Engineering Problem Definition System Analysis Requirement Specification and Tractability Estimation of Project Costing, resources and schedules Continued Chained Projects Management
3. Risk Management:
Classic mistake, element of Risk Management, Risk Identification, Risk Analysis, Risk Prioritization, risk Control, risk, High Risk and Gambling, Impact Analysis/Tools (case study)
4. Detailed Project Definition
Project Plan Verification-Configuration Management Plan and Change Control -SQA plan
5. Estimation
Cost Estimation Story, Estimation Process Overview, Software metrics, Metrics data collection, size estimation (Kloc, function points, feature points, 3-D function pointed to determine on schedule estimation, Ballpark schedule, Estimate technique, Empirical models, COCOMO-II application of metrics)
6. Resource Planning and Scheduling:
PERT/CPM: critical path theory and application Gantt Chart, Decision Tree, Work-Break down structure, Term work: S/W uses of teamwork, Team importance to rapid Development, Creating high performance team, Why team fails, Long term building, Team structure: Team structure consideration, team models, managers and Technical leads.
7. Software Quality Assurance:
Software verification and validation, Inspection, Reviews and Audit testing strategies: Test plan Development GUI testing, Functional testing, Robustness testing, Usability testing, format verification methods.
8. Introduction to Advanced topic in Software Engineering subtracting and subcontractor control software reuse: Management issue, reuse process, domain engineering, Building reusable components, Classifying and retrieving components, Economic of software reuse Re-engineering: Business process re-engineering, S/W re-engineering, Reverse re-engineering, Restructuring Forward re-engineering, Economics of re-engineering
9. Software Engineering, Institute- Capability Maturity Model (SEI-CMM):
SEI-SEI and Standards -IBEE Guide Lines, CMM Model - 5 maturity levels, KPA etc. Personal Software Process PSP
10. CASE Tools:
What is CASE? Building block foe CASE, Taxonomy of CASE, Tools, Integrated CASE Environment, CASE repository. MS-Project as CASE study.

Reference Books:
1. Pressman : Software Engineering
2. Meconnell : Rapid development
3. Merlin Durfman and Richard Thayer: Software Engineering
4. Kemerer : Software project management.


Teaching Scheme Examination Scheme
Lectures: 4 hrs/week Theory: 100 Marks
Practical: 2 Hrs./Week Term Work: 25 Marks
Oral 50 Marks


1. Brief review of Unix Kernel files and directory structures. Network file system. -
2. Features of Unix Shells Boume, Korn, C Shells, and Shell programming from administrators point of view, Unix AWK Programming.
3. Process Control: Introduction, Race conditions, Process accounting, Scheduling Process, Process Relationship, Process Group, Process Related Signals, background and foreground process, Daemon Process.
4. Signals: Introduction, Signal concepts, Interrupted system calls, Re-entrant functions, Signal sets, various functions in signals and Job Control Signals.
5. Interprocess Communication: Review of pipes and functions, Identifiers, Keys, Permission Structures, Message Queues, Semaphores, Shard memory, Client Server properties, Stream pipes and Sockets.
6. Multithreaded Programming: Thread structure and uses, Thread and Lightweight Processes, Thread and A,PI's, Thread Synchronisation objects.
7. I/O subsystem: Driver interfaces, Disc driver Terminal drivers and Streams.
8. Rebuilding of Kernel: For mismatch in H/W, New H/ W addition, New Version upgradation system tuning.
Laboratory Assignments on:
1. Shell Programming and AWK programming
2. Process Control / Relationship / Daemon Process
3. Signals
4. I/O Stream and Driver Interfaces
5. Semaphores, Client Server properties
6. Multithreading
7. Study of h &c files for studying Unix file system. File structure, network relates issues, interprocess communication etc.
Reference Books :
1. Bach : Unix operating systems.
2. W.Richard Stevens : Unix Network Programming (PHI)
3. Stephen Prata : Advanced Unix - A Programmer's Guide,SAMS.
4. R.S.Tare : Unix Utilities- A Programmer's reference,Mcgraw Hill.
5. Sumitabdas : Unix Shell Programming PHI.
6. Plice: Unix programming,PHI
7. W.Richard Stevens, Advanced Programming in the Unix Environment, Addison Wessley.


Teaching scheme: Examination scheme:
Theory: 4 Hrs./Week Theory: 100 Marks

1. Introduction:
What is multimedia, Multimedia Applications, Goal and Objectives, Multimedia Building Blocks, Multimedia and Internet
2. Multimedia Configuration
Multimedia PC Workstation Components, Multimedia Platform, Multimedia Development Tool, Authoring Tool, Interactivity, High End Multimedia Architecture, Multimedia O.S.: File System (File Formats: TIFF, BMP, PCX, GIF etc), Process Management, Multimedia Communication System, Multimedia DBMS,
3. Multimedia Audio
Basic Sound Concepts, Audio Capture, Music, Speech Sound Processor, Sound Recovery Techniques, VOC & WAV File Formats for Sound,
4. Multimedia Graphics
2D/3D animation fundamentals, Color modules, Digital Imaging: Still and Moving Images: Video Capture, Animation, Video Processing, Video recovery Techniques, AVO File Format, AVI File Format, NTSC, PAL, SCAM, HDTV System, Video/Audio Conferencing Techniques, Video/Audio Conferencing Standards, Video Streaming, Motion Synchronization
5. Image Compression Techniques
LZW, DCT, Run Length Coding, JPEG, MPEG, Hypertext and Hypermedia, MHEG, Document Architecture, ODA, SGML,
6. Augmented and Virtual Reality and Multimedia
Concepts, VR Devices: Hand Gloves, Head Mounted tracking System, VR Chair, CCD, VCR, 3D Sound System, Head Mounted Displays, Rendering Software Setup, Virtual Objects, VRML,
7. Multimedia Devices
Mass Storage Systems for Multimedia Requirements, Magnetic Devices, Optical Devices, CD ROM, DVD, Scanners: Types and Specifications,
8. Windows Support to Multimedia
Multimedia Databases( in Oracle), Multimedia Function Calls, Windows support for Sound, Animation, Movies, Music, MIDI Controls
9. CASE Study
Multimedia and UNIX, Virtual Coffee House Application

1. Ralf Steinmetz, Llara Nahrstedt, Multimedia: Computing,communication
and applications PH-PTR Inovative Technology series.
2. Judith Jefcoate, Multimedia in practice: Technology and Application PHI 1998.
3. Durano R. Begault , Virtual Reality and multimedia, AP Professionals.
4. Micheal J. Young,Windowws Multimedia and Animation with C++ Programming for WIN95, NAP professionals.
5. Kris Jama, Phil Schmauder,Nelson Yee,VRML programmer's Library, Galgotia.
6. Joe Gradicki, Virtual reality Construction kit, Jhon Wile & Sons. Inc.
7. Aitken Jarol, Visual C++ Multimedia Adventure set,Coriolis Group books.


Teaching Scheme: Exam Scheme
Practical: 4hrs/week TW: 25 marks
Pract: 50 marks

1. Use of multimedia workstation and its component, installation process, use of Microsoft Multimedia Development Kit.
2. Create, Edit .VOC file and convert it to .WAV file format, save it.
3. Create, Edit .WAV file and convert it to .VOC file saves it.
4. Run a Video-clip using windows Active Move Controls.
5. Use Multimedia controls to reproduce sound stored in compressed form.
6. Write a tool to create presentation slide with audio and video effects.
7. Write a tool for a 3-D bouncing ball animation and generates a collision sound depending upon the collision speed using multimedia function calls.
8. Use of 3D Studio ad its features.
9. Draw a polygon model to display virtual tree. View it through right red and left blue eyepiece to get virtual effects.
10. Static / Dynamic HTML file for creating Web Pages.
11. Using VRML generate following Virtual Scene.
1. Coffee House
2. Building models
3. Furniture models
12. Study of virtual reality workstation
1. Head mounted display types
2. Hand glove
3. Virtual reality sound system
4. VR chair controls
13. Design VR hand glove to interface it to virtual environment.
14. Parallel algorithms and concurrent programming.
Staff member should frame minimum eight assignments on above topics. The multimedia assignments will be conducted in a laboratory with multimedia kits, scanners, and CCD cameras.

Related Posts Plugin for WordPress, Blogger...