Computer Science and Engineering (CSE) is an interdisciplinary academic program at some universities that combines aspects of both computer science and computer engineering programs. It is a subfield of electronics engineering. However, it covers only the digital aspects of electronics engineering, with added courses like computer architecture, processor design and parallel computing. It focuses more on hardware-software integration, considering the machine as a system.

Credits- 4

**Course objectives :**

Basic concepts of mechanics, optics and its applications, electricity, magnetism and qualitative
understanding of concepts of quantum physics and statistical mechanics.

**1. Mechanics (7L)**

Problems including constraints & friction. Basic ideas of vector calculus and partial
differential equations. Potential energy function F = -grad V, equipotential surfaces and meaning
of gradient. Conservative and non-conservative forces. Conservation laws of energy & momentum.
Non-inertial frames of reference. Harmonic oscillator; Damped harmonic motion forced
oscillations and resonance. Motion of a rigid body in a plane and in 3D. Angular velocity vector.
Moment of inertia.

**2. Optics (5L)**

Distinction between interference and diffraction, Fraunhofer and Fresnel diffraction, Fraunhofer
diffraction at single slit, double slit, and multiple slits ( only the expressions for max;min, & intensity and qualitative discussion of fringes); diffraction grating(resolution formulac only), characteristics of diffration grating and its applications.

Polarisation : Introduction, polarisation by reflection, polarisation by double reflection, scattering of light, circular and elliptical polarisation, optical activity.

Lasers : Principles and working of laser : population inversion, pumping, various modes, threshold
population inversion with examples .

**3. Electromagnetism and Dielectric Magnetic Properties of Materials (8L)**

Maxwell’s equations. Polarisation, permeability and dielectric constant, polar and non-polar
dielecrrics, internal fields in a solid, Clausius- Mossotti equation(expression only), applications of
dielectrics.

Magnetisation , permeability and susceptibility, classificationof magnetic materials, ferromagnetism, magnetic domains and hysteresis, applications.

**4. Quantum Mechanics (16L)**

Introduction to quantum physics, black body radiation, explanation using the photon concept, Compton effect, de Broglie hypothesis, wave-particle duality, verification of matter waves, uncertainty principle, Schrodinger wave equation, particle in box, quantum harmonic oscillator, hydrogen atom.

**5. Statistical Mechanics (8L)**

Macrostate, Microstate, Density of states, Qualitative treatment of Maxwell Boltzmann, Fermi-Dirac
and Bose-Einstein statistics.

**Course outcomes:**

Students will be familiar with

Basic concepts of mechanics

Bragg’s Law and introduction to the principles of lasers, types of lasers and applications.

Various terms related to properties of materials such as, permeability, polarization,etc.

Some of the basic laws related to quantum mechanics as well as magnetic and dielectric properties of
materials.

Simple quantum mechanics calculations.

**Learning Resources:**

1. Introduction to Electrodynamics, David J. Griffiths, Pearson Education India Learning Private Limited

2. Principles of Physics, 10ed, David Halliday, Robert Resnick Jearl Walker , Wiley

3. Electricity, Magnetism, and Light, Wayne M. Saslow, Academic Press

4. Engineering Mechanics (In SI Units) (SIE), S. Timoshenko, D.H. Young, J.V. Rao, Sukumar Pati , McGraw Hill Education

5. Classical mechanics, Narayan Rana, Pramod Joag, McGraw Hill Education

6. Introduction to Classical Mechanics, R Takwale, P Puranik, McGraw Hill Education

7. Engineering Mechanics, M.K. Harbola , Cengage India

8. An Introduction to Mechanics (SIE), David Kleppner, Robert Kolenkow, McGraw Hill Education

9. Principles of mechanics, John L. Synge and Byron A. Griffith, New York, McGraw-Hill

10. Mechanics (Dover Books on Physics) , J. P. Den Hartog , Dover Publications Inc.

11. Engineering Mechanics: Dynamics, L.G. Kraige J.L. Meriam, Wiley

12. Quantum Physics of Atoms, Molecules, Solids, Nuclei and Particles, Robert Eisberg, Robert Resnick, Wiley

13. Introduction to Quantum Mechanics, J. Griffiths David , Pearson Education

14. Modern Quantum Mechanics, J. J. Sakurai, Cambridge University Press

15. Optics , Hecht, Pearson Education

16. Optics, Ghatak, McGraw Hill Education India Private Limited

17. Fundamentals of Statistical and Thermal Physics, Reif, Sarat Book Distributors

18. Statistical Mechanics , Pathria , Elsevier

19. Statistical Physics, L.D.Landau , E.M. Lifshitz, Butterworth-Heinemann

Credits- 4

**i) Atomic and molecular structure (10 lectures)**

Schrodinger equation. Particle in a box solutions and their applications for simple sample. Molecular orbitals of diatomic molecules (e.g.H2). Energy level diagrams of diatomic. Pi-molecular orbitals of butadiene and benzene and aromaticity. Crystal field theory and the energy level diagrams for transition metal ions and their magnetic properties. Band structure of solids and the role of doping on band structures.

**ii) Spectroscopic techniques and applications (8 lectures)**

Principles of spectroscopy and selection rules. Electronic spectroscopy. Fluorescence and its applications in medicine. Vibrational and rotational spectroscopy of diatomic molecules. Applications. Nuclear magnetic resonance and magnetic resonance imaging, surface characterisation techniques. Diffraction and scattering.

**iii)Intermolecular forces and potential energy surfaces (4 lectures)**

Ionic, dipolar and van Der Waals interactions. Equations of state of real gases and critical phenomena.

**iv)Use of free energy in chemical equilibria (8 lectures)**

First and second laws of thermodynamics and thermodynamic functions: energy, entropy and free energy.
Estimations of entropy and free energies. Free energy and emf. Cell potentials, the Nernst equation and applications. Acid base, oxidation reduction and solubility equilibria. Water chemistry. Corrosion. Use of free energy considerations in metallurgy through Ellingham diagrams.

**v) Periodic properties (4 Lectures)**

Effective nuclear charge, penetration of orbitals, variations of s, p, d and f orbital energies of atoms in the periodic table, electronic configurations, atomic and ionic sizes, ionization energies, electron affinity and electronegativity, polarizability, oxidation states, coordination numbers and geometries, hard soft acids and bases, molecular geometries

**vi)Stereochemistry (4 lectures)**

Representations of 3 dimensional structures, structural isomers and stereoisomers, configurations and
symmetry and chirality, enantiomers, diastereomers, optical activity, absolute configurations and
conformational analysis. Isomerism in transitional metal compounds

**vii) Organic reactions and synthesis of a drug molecule (4 lectures)**

Introduction to reactions involving substitution, addition, elimination, oxidation, reduction, cyclization and ring openings. Synthesis of a commonly used drug molecule.

**Course Outcomes: **

The concepts developed in this course will aid in quantification of several concepts in chemistry that have been introduced at the 10+2 levels in schools. Technology is being increasingly based on the electronic, atomic and molecular level modifications. Quantum theory is more than 100 years old and to understand phenomena at nanometer levels, one has to base the description of all chemical processes at molecular levels.

The course will enable the student to:

Analyse microscopic chemistry in terms of atomic and molecular orbitals and intermolecular forces.

Rationalise bulk properties and processes using thermodynamic considerations.

Distinguish the ranges of the electromagnetic spectrum used for exciting different molecular energy
levels in various spectroscopic techniques

Rationalise periodic properties such as ionization potential, electronegativity, oxidation states and electronegativity.

List major chemical reactions that are used in the synthesis of molecules.

**Learning Resources:**

1. University chemistry, by B. H. Mahan

2. Chemistry: Principles and Applications, by M. J. Sienko and R. A. Plane

3. Fundamentals of Molecular Spectroscopy, by C. N. Banwell

4. Engineering Chemistry (NPTEL Web-book), by B. L. Tembe, Kamaluddin and M. S. Krishnan

5. Physical Chemistry, by P. W. Atkins

6. Spectroscopy of Organic Compounds, by P.S.Kalsi, New Age International Pvt Ltd Publishers

7. Physical Chemistry, P. C. Rakshit, Sarat Book House

8. Organic Chemistry: Structure and Function by K. P. C. Volhardt and N. E. Schore, 5th Edition

9. Engineering Chemistry, Satyaprakash, Khanna Book Publishing, Delhi

Credits- 4

**1. Calculus (Integration):**

Evolutes and involutes; Evaluation of definite and improper integrals; Beta and Gamma functions and their properties; Applications of definite integrals to evaluate surface areas and volumes of revolutions. **8**

**2. Calculus (Differentiation):**

Rolle’s Theorem, Mean value theorems, Taylor’s and Maclaurin’s theorems with remainders; Indeterminate forms and L'Hospital's rule; Maxima and minima. **6**

**3. Matrices:**

Matrices, Vectors: addition and scalar multiplication, matrix multiplication; Linear systems of equations, linear Independence, rank of a matrix, determinants, Cramer’s Rule, inverse of a matrix, Gauss elimination and Gauss-Jordan elimination. **7**

**4. Vector Spaces:**

Vector Space, linear dependence of vectors, Basis, Dimension; Linear transformations (maps), Range and Kernel of a linear map, Rank and Nullity, Inverse of a linear transformation, Rank-Nullity theorem, composition of linear maps, Matrix associated with a linear map. **9**

**5. Vector Spaces (Continued):**

Eigenvalues, Eigenvectors, Symmetric, Skew-symmetric, and Orthogonal Matrices, Eigenbases. Diagonalization; Inner product spaces, Gram-Schmidt orthogonalization. **10**

**Course Outcomes:**

The students will be able to:

Apply the concept and techniques of differential and integral calculus to determine curvature and
evaluation of different types of improper integrals.

Understand the domain of applications of mean value theorems to engineering problems.

Learn different types of matrices, concept of rank, methods of matrix inversion and their applications.

Understand linear spaces, its basis and dimension with corresponding applications in the field of
computer science.

Learn and apply the concept of eigen values, eigen vectors, diagonalisation of matrices and
orthogonalization in inner product spaces for understanding physical and engineering problems

**Learning Resources:**

1. Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley & Sons.

2. Michael Greenberg, Advanced Engineering Mathematics, Pearson.

3. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers.

4. Kanti B. Dutta, Mathematical Methods of Science and Engineering, Cenage Learning.

5. Veerarajan T., Engineering Mathematics for first year, Tata McGraw-Hill, New Delhi.

6. S.K. Mapa, Higher Algebra: Abstract and Linear, Sarat Book House Pvt.Ltd.

7. Hoffman and Kunze: Linear algebra, PHI.

8. Reena Garg, Engineering Mathematics-I, Khanna Publishers.

Credits- 4

**1. Calculus (Integration):**

Evolutes and involutes; Evaluation of definite and improper integrals; Beta and Gamma functions and their properties; Applications of definite integrals to evaluate surface areas and volumes of revolutions. **8**

**2. Calculus (Differentiation):**

Rolle’s Theorem, Mean value theorems, Taylor’s and Maclaurin’s theorems with remainders; Indeterminate forms and L'Hospital's rule; Maxima and minima. **6**

**3. Sequence and Series:**

Convergence of sequence and series, tests for convergence; Power series, Taylor's series, series for exponential, trigonometric and logarithm functions; Fourier series: Half range sine and cosine series, Parseval’s theorem. **11**

**4. Multivariate Calculus:**

Limit, continuity and partial derivatives, Directional derivatives, Total derivative; Tangent plane and normal line; Maxima, minima and saddle points; Method of Lagrange multipliers; Gradient, Curl and Divergence. **9**

**5. Matrices:**

Inverse and rank of a matrix, Rank-nullity theorem; System of linear equations; Symmetric, Skew-symmetric and Orthogonal matrices; Determinants; Eigenvalues and Eigenvectors; Diagonalization of matrices; Cayley-Hamilton Theorem, and Orthogonal transformation. **8**

**Course Outcomes:**

After completing the course the student will be able to :

Apply the concept and techniques of differential and integral calculus to determine curvature and
evaluation of different types of improper integrals.

Understand the domain of applications of mean value theorems to engineering problems.

Learn the tools of power series and Fourier series to analyze engineering problems and apply the
concept of convergence of infinite series in many approximation techniques in engineering disciplines.

Apply the knowledge for addressing the real life problems which comprises of several variables or
attributes and identify extremum points of different surfaces of higher dimensions.

Understand different types of matrices, their eigen values, eigen vectors, rank and also their
orthogonal transformations which are essential for understanding physical and engineering problems.

**Learning Resources:**

1. Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley & Sons.

2. Michael Greenberg, Advanced Engineering Mathematics, Pearson.

3. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers.

4. Kanti B. Dutta, Mathematical Methods of Science and Engineering, Cenage Learning.

5. Veerarajan T., Engineering Mathematics for first year, Tata McGraw-Hill, New Delhi.

6. Reena Garg, Engineering Mathematics-I, Khanna Publishers.

Credits- 4

**Module 1: DC Circuits (8 hours):**

Electrical circuit elements (R, L and C), voltage and current sources, Kirchoff current and voltage
laws, analysis of simple circuits with dc excitation. Superposition, Thevenin and Norton Theorems.
Time-domain analysis of first-order RL and RC circuits.

**Module 2: AC Circuits (8 hours)**

Representation of sinusoidal waveforms, peak and rms values, phasor representation, real power, reactive power, apparent power, power factor. Analysis of single-phase ac circuits consisting of R, L,
C, RL, RC, RLC combinations (series and parallel), resonance. Three phase balanced circuits, voltage and current relations in star and delta connections.

**Module 3: Transformers (6 hours)**
Magnetic materials, BH characteristics, ideal and practical transformer, equivalent circuit, losses in
transformers, regulation and efficiency. Auto-transformer and three-phase transformer connections.

**Module 4: Electrical Machines (8 hours)**

Generation of rotating magnetic fields, Construction and working of a three-phase induction motor,
Significance of torque-slip characteristic. Loss components and efficiency, starting and speed control
of induction motor. Single-phase induction motor. Construction, working, torque-speed characteristic
and speed control of separately excited dc motor. Construction and working of synchronous generators.

**Module 5: Power Converters (6 hours)**

DC-DC buck and boost converters, duty ratio control. Single-phase and three-phase voltage source
inverters; sinusoidal modulation.

**Module 6: Electrical Installations (6 hours)**

Components of LT Switchgear: Switch Fuse Unit (SFU), MCB, ELCB, MCCB, Types of Wires and Cables, Earthing. Types of Batteries, Important Characteristics for Batteries. Elementary calculations
for energy consumption, power factor improvement and battery backup.

**Course Outcomes:**

To understand and analyze basic electric and magnetic circuits

To study the working principles of electrical machines and power converters.

To introduce the components of low voltage electrical installations

**Learning Recourses:**

1. D. P. Kothari and I. J. Nagrath, “Basic Electrical Engineering”, Tata McGraw Hill, 2010.

2. D. C. Kulshreshtha, “Basic Electrical Engineering”, McGraw Hill, 2009.

3. L. S. Bobrow, “Fundamentals of Electrical Engineering”, Oxford University Press, 2011.

4. E. Hughes, “Electrical and Electronics Technology”, Pearson, 2010.

5. V. D. Toro, “Electrical Engineering Fundamentals”, Prentice Hall India, 1989.

6. Ritu Sahdev, Basic Electrical Engineering, Khanna Book Publishing Co. (P) Ltd., Delhi.

Credits- 1.5

**Experiments in Optics**

1. Determination of dispersive power of the material of a prism

2. Determination of wavelength of a monochromatic light by Newton’s ring

3. Determination of wavelength of a monochromatic light by Fresnel’s bi-prism

4. Determination of wavelength of the given laser source by diffraction method

**Electricity & Magnetism experiments**

1. Determination of thermo electric power of a given thermocouple.

2. Determination of specific charge (e/m) of electron by J.J. Thompson’s method.

3. Determination of dielectric constant of a given dielectric material.

4. Determination of Hall coefficient of a semiconductor by four probe method.

5. To study current voltage characteristics, load response, areal characteristic and spectral response of a photovoltaic solar cell.

6. Determination of resistance of ballistic galvanometer by half deflection method and study of variation of logarithmic decrement with series resistance.

7. Determination of unknown resistance using Carey Foster’s bridge

8. Study of Transient Response in LR, RC and LCR circuits using expeyes

9. Generating sound from electrical energy using expeyes

**Experiments in Quantum Physics**

1. Determination of Stefan-Boltzmann constant.

2. Determination of Planck constant using photocell.

3. Determination of Lande-g factor using Electron spin resonance spectrometer.

4. Determination of Rydberg constant by studying Hydrogen spectrum.

5. Determination of Band gap of semiconductor.

6. To study current voltage characteristics, load response, areal characteristic and spectral response of a photovoltaic solar cell.

**Miscellaneous experiments**

1. Determination of Young’s modulus of elasticity of the material of a bar by the method of flexure

2. Determination of bending moment and shear force of a rectangular beam of uniform cross-section

3. Determination of modulus of rigidity of the material of a rod by static method

4. Determination of rigidity modulus of the material of a wire by dynamic method

5. To determine the moment of inertia of a body about an axis passing through its centre of gravity and to determine the modulus of rigidity of the material of the suspended wire

6. Determination of coefficient of viscosity by Poiseulle’s capillary flow method

Credits- 1.5

**Choose 10 experiments from the following:**

1. Conductometric titration for determination of the strength of a given HCl solution by titration against a standard NaOH solution.

2. pH- metric titration for determination of strength of a given HCl solution against a standard NaOH solution.

3. Determination of dissolved oxygen present in a given water sample.

4. To determine chloride ion in a given water sample by Argentometric method (using chromate indicator solution)

5. Determination of surface tension and viscosity

6. Thin layer chromatography

7. Ion exchange column for removal of hardness of water

8. Determination of the rate constant of a reaction

9. Determination of cell constant and conductance of solutions

10. Potentiometry - determination of redox potentials and emfs

11. Saponification/acid value of an oil

12. Chemical analysis of a salt

13. Determination of the partition coefficient of a substance between two immiscible liquids

14. Adsorption of acetic acid by charcoal

15. Use of the capillary viscosimeters to the demonstrate of the isoelectric point as

the pH of minimum viscosity for gelatin sols and/or coagulation of the white part of egg

Credits- 4

**Course objectives :**

Basic concepts of mechanics, optics and its applications, electricity, magnetism and qualitative
understanding of concepts of quantum physics and statistical mechanics.

**1. Mechanics (7L)**

Problems including constraints & friction. Basic ideas of vector calculus and partial
differential equations. Potential energy function F = -grad V, equipotential surfaces and meaning
of gradient. Conservative and non-conservative forces. Conservation laws of energy & momentum.
Non-inertial frames of reference. Harmonic oscillator; Damped harmonic motion forced
oscillations and resonance. Motion of a rigid body in a plane and in 3D. Angular velocity vector.
Moment of inertia.

**2. Optics (5L)**

Distinction between interference and diffraction, Fraunhofer and Fresnel diffraction, Fraunhofer
diffraction at single slit, double slit, and multiple slits ( only the expressions for max;min, & intensity and qualitative discussion of fringes); diffraction grating(resolution formulac only), characteristics of diffration grating and its applications.

Polarisation : Introduction, polarisation by reflection, polarisation by double reflection, scattering of light, circular and elliptical polarisation, optical activity.

Lasers : Principles and working of laser : population inversion, pumping, various modes, threshold
population inversion with examples .

**3. Electromagnetism and Dielectric Magnetic Properties of Materials (8L)**

Maxwell’s equations. Polarisation, permeability and dielectric constant, polar and non-polar
dielecrrics, internal fields in a solid, Clausius- Mossotti equation(expression only), applications of
dielectrics.

Magnetisation , permeability and susceptibility, classificationof magnetic materials, ferromagnetism, magnetic domains and hysteresis, applications.

**4. Quantum Mechanics (16L)**

Introduction to quantum physics, black body radiation, explanation using the photon concept, Compton effect, de Broglie hypothesis, wave-particle duality, verification of matter waves, uncertainty principle, Schrodinger wave equation, particle in box, quantum harmonic oscillator, hydrogen atom.

**5. Statistical Mechanics (8L)**

Macrostate, Microstate, Density of states, Qualitative treatment of Maxwell Boltzmann, Fermi-Dirac
and Bose-Einstein statistics.

**Course outcomes:**

Students will be familiar with

Basic concepts of mechanics

Bragg’s Law and introduction to the principles of lasers, types of lasers and applications.

Various terms related to properties of materials such as, permeability, polarization,etc.

Some of the basic laws related to quantum mechanics as well as magnetic and dielectric properties of
materials.

Simple quantum mechanics calculations.

**Learning Resources:**

1. Introduction to Electrodynamics, David J. Griffiths, Pearson Education India Learning Private Limited

2. Principles of Physics, 10ed, David Halliday, Robert Resnick Jearl Walker , Wiley

3. Electricity, Magnetism, and Light, Wayne M. Saslow, Academic Press

4. Engineering Mechanics (In SI Units) (SIE), S. Timoshenko, D.H. Young, J.V. Rao, Sukumar Pati , McGraw Hill Education

5. Classical mechanics, Narayan Rana, Pramod Joag, McGraw Hill Education

6. Introduction to Classical Mechanics, R Takwale, P Puranik, McGraw Hill Education

7. Engineering Mechanics, M.K. Harbola , Cengage India

8. An Introduction to Mechanics (SIE), David Kleppner, Robert Kolenkow, McGraw Hill Education

9. Principles of mechanics, John L. Synge and Byron A. Griffith, New York, McGraw-Hill

10. Mechanics (Dover Books on Physics) , J. P. Den Hartog , Dover Publications Inc.

11. Engineering Mechanics: Dynamics, L.G. Kraige J.L. Meriam, Wiley

12. Quantum Physics of Atoms, Molecules, Solids, Nuclei and Particles, Robert Eisberg, Robert Resnick, Wiley

13. Introduction to Quantum Mechanics, J. Griffiths David , Pearson Education

14. Modern Quantum Mechanics, J. J. Sakurai, Cambridge University Press

15. Optics , Hecht, Pearson Education

16. Optics, Ghatak, McGraw Hill Education India Private Limited

17. Fundamentals of Statistical and Thermal Physics, Reif, Sarat Book Distributors

18. Statistical Mechanics , Pathria , Elsevier

19. Statistical Physics, L.D.Landau , E.M. Lifshitz, Butterworth-Heinemann

Credits- 4

**i) Atomic and molecular structure (10 lectures)**

Schrodinger equation. Particle in a box solutions and their applications for simple sample. Molecular orbitals of diatomic molecules (e.g.H2). Energy level diagrams of diatomic. Pi-molecular orbitals of butadiene and benzene and aromaticity. Crystal field theory and the energy level diagrams for transition metal ions and their magnetic properties. Band structure of solids and the role of doping on band structures.

**ii) Spectroscopic techniques and applications (8 lectures)**

Principles of spectroscopy and selection rules. Electronic spectroscopy. Fluorescence and its applications in medicine. Vibrational and rotational spectroscopy of diatomic molecules. Applications. Nuclear magnetic resonance and magnetic resonance imaging, surface characterisation techniques. Diffraction and scattering.

**iii)Intermolecular forces and potential energy surfaces (4 lectures)**

Ionic, dipolar and van Der Waals interactions. Equations of state of real gases and critical phenomena.

**iv)Use of free energy in chemical equilibria (8 lectures)**

First and second laws of thermodynamics and thermodynamic functions: energy, entropy and free energy.
Estimations of entropy and free energies. Free energy and emf. Cell potentials, the Nernst equation and applications. Acid base, oxidation reduction and solubility equilibria. Water chemistry. Corrosion. Use of free energy considerations in metallurgy through Ellingham diagrams.

**v) Periodic properties (4 Lectures)**

Effective nuclear charge, penetration of orbitals, variations of s, p, d and f orbital energies of atoms in the periodic table, electronic configurations, atomic and ionic sizes, ionization energies, electron affinity and electronegativity, polarizability, oxidation states, coordination numbers and geometries, hard soft acids and bases, molecular geometries

**vi)Stereochemistry (4 lectures)**

Representations of 3 dimensional structures, structural isomers and stereoisomers, configurations and
symmetry and chirality, enantiomers, diastereomers, optical activity, absolute configurations and
conformational analysis. Isomerism in transitional metal compounds

**vii) Organic reactions and synthesis of a drug molecule (4 lectures)**

Introduction to reactions involving substitution, addition, elimination, oxidation, reduction, cyclization and ring openings. Synthesis of a commonly used drug molecule.

**Course Outcomes: **

The concepts developed in this course will aid in quantification of several concepts in chemistry that have been introduced at the 10+2 levels in schools. Technology is being increasingly based on the electronic, atomic and molecular level modifications. Quantum theory is more than 100 years old and to understand phenomena at nanometer levels, one has to base the description of all chemical processes at molecular levels.

The course will enable the student to:

Analyse microscopic chemistry in terms of atomic and molecular orbitals and intermolecular forces.

Rationalise bulk properties and processes using thermodynamic considerations.

Distinguish the ranges of the electromagnetic spectrum used for exciting different molecular energy
levels in various spectroscopic techniques

Rationalise periodic properties such as ionization potential, electronegativity, oxidation states and electronegativity.

List major chemical reactions that are used in the synthesis of molecules.

**Learning Resources:**

1. University chemistry, by B. H. Mahan

2. Chemistry: Principles and Applications, by M. J. Sienko and R. A. Plane

3. Fundamentals of Molecular Spectroscopy, by C. N. Banwell

4. Engineering Chemistry (NPTEL Web-book), by B. L. Tembe, Kamaluddin and M. S. Krishnan

5. Physical Chemistry, by P. W. Atkins

6. Spectroscopy of Organic Compounds, by P.S.Kalsi, New Age International Pvt Ltd Publishers

7. Physical Chemistry, P. C. Rakshit, Sarat Book House

8. Organic Chemistry: Structure and Function by K. P. C. Volhardt and N. E. Schore, 5th Edition

9. Engineering Chemistry, Satyaprakash, Khanna Book Publishing, Delhi

Credits- 1.5

**Experiments in Optics**

1. Determination of dispersive power of the material of a prism

2. Determination of wavelength of a monochromatic light by Newton’s ring

3. Determination of wavelength of a monochromatic light by Fresnel’s bi-prism

4. Determination of wavelength of the given laser source by diffraction method

**Electricity & Magnetism experiments**

1. Determination of thermo electric power of a given thermocouple.

2. Determination of specific charge (e/m) of electron by J.J. Thompson’s method.

3. Determination of dielectric constant of a given dielectric material.

4. Determination of Hall coefficient of a semiconductor by four probe method.

5. To study current voltage characteristics, load response, areal characteristic and spectral response of a photovoltaic solar cell.

6. Determination of resistance of ballistic galvanometer by half deflection method and study of variation of logarithmic decrement with series resistance.

7. Determination of unknown resistance using Carey Foster’s bridge

8. Study of Transient Response in LR, RC and LCR circuits using expeyes

9. Generating sound from electrical energy using expeyes

**Experiments in Quantum Physics**

1. Determination of Stefan-Boltzmann constant.

2. Determination of Planck constant using photocell.

3. Determination of Lande-g factor using Electron spin resonance spectrometer.

4. Determination of Rydberg constant by studying Hydrogen spectrum.

5. Determination of Band gap of semiconductor.

6. To study current voltage characteristics, load response, areal characteristic and spectral response of a photovoltaic solar cell.

**Miscellaneous experiments**

1. Determination of Young’s modulus of elasticity of the material of a bar by the method of flexure

2. Determination of bending moment and shear force of a rectangular beam of uniform cross-section

3. Determination of modulus of rigidity of the material of a rod by static method

4. Determination of rigidity modulus of the material of a wire by dynamic method

5. To determine the moment of inertia of a body about an axis passing through its centre of gravity and to determine the modulus of rigidity of the material of the suspended wire

6. Determination of coefficient of viscosity by Poiseulle’s capillary flow method

Credits- 1.5

**Choose 10 experiments from the following:**

1. Conductometric titration for determination of the strength of a given HCl solution by titration against a standard NaOH solution.

2. pH- metric titration for determination of strength of a given HCl solution against a standard NaOH solution.

3. Determination of dissolved oxygen present in a given water sample.

4. To determine chloride ion in a given water sample by Argentometric method (using chromate indicator solution)

5. Determination of surface tension and viscosity

6. Thin layer chromatography

7. Ion exchange column for removal of hardness of water

8. Determination of the rate constant of a reaction

9. Determination of cell constant and conductance of solutions

10. Potentiometry - determination of redox potentials and emfs

11. Saponification/acid value of an oil

12. Chemical analysis of a salt

13. Determination of the partition coefficient of a substance between two immiscible liquids

14. Adsorption of acetic acid by charcoal

15. Use of the capillary viscosimeters to the demonstrate of the isoelectric point as

the pH of minimum viscosity for gelatin sols and/or coagulation of the white part of egg

Credits- 1

**Choose 10 experiments from the following:**

1. First activity: Introduction to basic safety precautions and mentioning of the do’s and Don’ts. Noting down list of experiments to be performed, and instruction for writing the laboratory reports by the students. Group formation. Students are to be informed about the modalities of evaluation.

2. Introduction and uses of following instruments :

(a) Voltmeter

(b) Ammeter

(c) Multimeter

(d) Oscilloscope

Demonstration of real life resistors, capacitors with color code , inductors and autotransformer.

3. Demonstration of cut-out sections of machines: DC machine, Induction machine, Synchronous
machine and single phase induction machine.

4. Calibration of ammeter and Wattmeter.

5. Determination of steady state and transient response of R-L, R-C and R-L-C circuit to a step change
in voltage.

6. Determination of steady state response of R-L and R-C and R-L-C circuit and calculation of
impedance and power factor.

7. Determination of resonance frequency and quality factor of series and parallel R-L-C circuit.

8. (a) Open circuit and short circuit test of a single-phase transformer

(b) Load test of the transformer and determination of efficiency and regulation

9. Demonstration of three phase transformer connections. Voltage and current relationship, phase shifts between the primary and secondary side.

10. Measurement of power in a three phase unbalanced circuit by two wattmeter method.

11. Determination of Torque –Speed characteristics of separately excited DC motor.

12. Determination of Torque speed characteristics and observation of direction reversal by change of
phase sequence of connection of Induction motor.

13. Determination of operating characteristics of Synchronous generator.

14. Demonstration of operation of (a) DC-DC converter (b) DC-AC converter (c) DC-AC converter for
speed control of an Induction motor

15. Demonstration of components of LT switchgear.

Credits- 4

**1. Basic Probability:**

Probability spaces, conditional probability, independence; Discrete random variables, Independent random variables, the Multinomial distribution, Poisson approximation to the Binomial distribution, infinite sequences of Bernoulli trials, sums of independent random variables; Expectation of Discrete Random Variables, Moments, Variance of a sum, Correlation coefficient, Chebyshev's Inequality. **11**

**2. Continuous Probability Distributions:**

Continuous random variables and their properties, Distribution functions and densities, Normal, Exponential and Gamma densities. **4**
**3. Bivariate Distributions:**

Bivariate distributions and their properties, distribution of sums and quotients, Conditional densities, Bayes' rule. **5**

**4. Basic Statistics:**

Measures of Central tendency, Moments, Skewness and Kurtosis, Probability distributions: Binomial, Poisson and Normal and evaluation of statistical parameters for these three distributions, Correlation and regression – Rank correlation. **8**

**5. Applied Statistics:**

Curve fitting by the method of least squares- fitting of straight lines, second degree parabolas and more general curves. Test of significance: Large sample test for single proportion, difference of proportions, single mean, difference of means, and difference of standard deviations. **8**

**6. Small samples:**

Test for single mean, difference of means and correlation coefficients, test for ratio of variances - Chi-square test for goodness of fit and independence of attributes. **4**

**Course Outcomes:**

The students will be able to:

Learn the ideas of probability and random variables, various discrete and continuous probability
distributions with their properties and their applications in physical and engineering environment.

Understand the basic ideas of statistics with different characterisation of a univariate and bivariate data set.

Apply statistical tools for analysing data samples and drawing inference on a given data set.

**Learning Resources:**

1. Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley & Sons

2. S. Ross, A First Course in Probability, Pearson Education India

3. W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, Wiley.

4. John E. Freund, Ronald E. Walpole, Mathematical Statistics, Prentice Hall.

5. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers.

6. N.G. Das, Statistical Methods (Combined Volume), Tata-McGraw Hill.

7. Reena Garg, Chandrika Prasad, Advanced Engineering Mathematics, Khanna Publishers.

Credits- 4

**1. Multivariate Calculus (Integration):**

Multiple Integration: Double integrals (Cartesian), change of order of integration in double integrals, change of variables (Cartesian to Polar), Applications: Areas and volumes, Center of mass and Gravity (constant and variable densities); Triple integrals (Cartesian), Orthogonal curvilinear coordinates, Simple applications involving cubes, sphere and rectangular parallelepipeds; Scalar line integrals, vector line integrals, scalar surface integrals, vector surface integrals, Theorems of Green, Gauss and Stokes. **11**

**2. First order ordinary differential equations:**

Exact, linear and Bernoulli’s equations, Equations not of first degree: equations solvable for p, equations solvable for y, equations solvable for x and Clairaut’s type. **5**

**3. Ordinary differential equations of higher orders:**
Second order linear differential equations with constant coefficients, Use of Doperators, Second order linear differential equations with variable coefficients, method of variation of parameters, Cauchy-Euler equation; Power series solutions; Legendre polynomials, Bessel functions of the first kind and their properties. **9**

**4. Complex Variable – Differentiation**

Differentiation of complex functions, Cauchy-Riemann equations, Analytic functions, Harmonic functions, determination of harmonic conjugate, elementary analytic functions (exponential, trigonometric, logarithmic) and their properties; Conformal mappings, Mobius transformations and their properties. **6**

**5. Complex Variable – Integration**

Contour integrals, Cauchy-Goursat theorem (without proof), Cauchy integral formula (without proof), Liouville’s theorem and Maximum-Modulus theorem (without proof); Taylor’s series, Zeros of analytic functions, Singularities, Laurent’s series; Residues, Cauchy residue theorem (without proof), Evaluation of definite integral involving sine and cosine, Evaluation of certain improper integrals
using the Bromwich contour. **9**

**Course Outcomes:**

The students will be able to:

Learn the methods for evaluating multiple integrals and their applications to different physical
problems.

Understand different techniques to solve first and second order ordinary differential equations with its formulation to address the modelling of systems and problems of engineering sciences.

Learn different tools of differentiation and integration of functions of a complex variable that are used with various other techniques for solving engineering problems.

Apply different types of transformations between two 2- dimensional planes for analysis of physical
or engineering problems.

**Learning Resources:**

1. Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley & Sons.

2. Michael Greenberg, Advanced Engineering Mathematics, Pearson.

3. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers.

4. Kanti B. Dutta, Mathematical Methods of Science and Engineering, Cenage Learning.

5. Veerarajan T., Engineering Mathematics for first year, Tata McGraw-Hill, New Delhi.

6. E. L. Ince, Ordinary Differential Equations, Dover Publications.

7. J. W. Brown and R. V. Churchill, Complex Variables and Applications, Mc-Graw Hill.

8. Reena Garg, Chandrika Prasad, Advanced Engineering Mathematics, Khanna Publishers

Credits- 2

**1. Vocabulary Building**

1.1 The concept of Word Formation

1.2 Root words from foreign languages and their use in English

1.3 Acquaintance with prefixes and suffixes from foreign languages in English to form derivatives.

1.4 Synonyms, antonyms, and standard abbreviations.

**2. Basic Writing Skills**

2.1 Sentence Structures

2.2 Use of phrases and clauses in sentences

2.3 Importance of proper punctuation

2.4 Creating coherence

2.5 Organizing principles of paragraphs in documents

2.6 Techniques for writing precisely

**3. Identifying Common Errors in Writing**

3.1 Subject-verb agreement

3.2 Noun-pronoun agreement

3.3 Misplaced modifiers

3.4 Articles

3.5 Prepositions

3.6 Redundancies

3.7 Clichés

**4. Nature and Style of sensible Writing**

4.1 Describing

4.2 Defining

4.3 Classifying

4.4 Providing examples or evidence

4.5 Writing introduction and conclusion

**5. Writing Practices**

5.1 Comprehension

5.2 Précis Writing

5.3 Essay Writing

**6. Oral Communication**

(This unit involves interactive practice sessions in Language Lab)

Listening Comprehension

Pronunciation, Intonation, Stress and Rhythm

Common Everyday Situations: Conversations and Dialogues

Communication at Workplace

Interviews

Formal Presentations

**Learning Resources:**

(i) Practical English Usage. Michael Swan. OUP. 1995.

(ii) Remedial English Grammar. F.T. Wood. Macmillan.2007

(iii) On Writing Well. William Zinsser. Harper Resource Book. 2001

(iv) Study Writing. Liz Hamp-Lyons and Ben Heasly. Cambridge University Press. 2006.

(v) Communication Skills. Sanjay Kumar and PushpLata. Oxford University Press. 2011.

(vi) Exercises in Spoken English. Parts. I-III. CIEFL, Hyderabad. Oxford University Press

(vii) Kulbushan Kumar, R S Salaria,Effective Communication Skills, Khanna Publishing House, Delhi.

**Course Outcomes:**

The student will acquire basic proficiency in English including reading and listening comprehension, writing and speaking skills.

Contracts:3L

Credits- 3

Science, Technology and Engineering as knowledge and as Social and Professional Activities

**Effects of Technological Growth:**

Rapid Technological growth and depletion of resources, Reports of the Club of Rome.
Limits of growth: sustainable development

Energy Crisis: Renewable Energy Resources

Environmental degradation and pollution. Eco-friendly Technologies. Environmental Regulations, Environmental
Ethics

Appropriate Technology Movement of Schumacher; later developments

Technology and developing notions. Problems of Technology transfer, Technology assessment impact analysis.
Human Operator in Engineering projects and industries. Problems of man, machine, interaction, Impact of assembly
line and automation. Human centered Technology.

**Ethics of Profession:**

Engineering profession: Ethical issues in Engineering practice, Conflicts between business demands and professional
ideals. Social and ethical responsibilities of Technologists. Codes of professional ethics. Whistle blowing and beyond,
Case studies.

**Profession and Human Values:**

Values Crisis in contemporary society

Nature of values: Value Spectrum of a good life

Psychological values: Integrated personality; mental health

Societal values: The modern search for a good society, justice, democracy, secularism, rule of law, values in Indian
Constitution.

Aesthetic values: Perception and enjoyment of beauty, simplicity, clarity
Moral and ethical values: Nature of moral judgements; canons of ethics; ethics of virtue; ethics of duty; ethics of
responsibility.

**Books:**

1. Stephen H Unger, Controlling Technology: Ethics and the Responsible Engineers, John Wiley & Sons, New York
1994 (2nd Ed)

2. Deborah Johnson, Ethical Issues in Engineering, Prentice Hall, Englewood Cliffs, New Jersey 1991.

3. A N Tripathi, Human values in the Engineering Profession, Monograph published by IIM, Calcutta 1996.

Contracts:4L

Credits- 4

**Module 1:**

**Vector Calculus:**

1.1 Physical significances of grad, div, curl. Line integral, surface integral, volume integral- physical examples in the
context of electricity and magnetism and statements of Stokes theorem and Gauss theorem [No Proof]. Expression of
grad, div, curl and Laplacian in Spherical and Cylindrical co-ordinates. 2L

**Module 2 :**

**Electricity**

2.1 Coulumbs law in vector form. Electrostatic field and its curl. Gauss’s law in integral form and conversion to
differential form . Electrostatic potential and field, Poisson’s Eqn. Laplace’s eqn (Application to Cartesian, Spherically
and Cylindrically symmetric systems – effective 1D problems) Electric current, drift velocity, current density,
continuity equation, steady current. 5L

2.2 Dielectrics-concept of polarization, the relation D=ε0E+P, Polarizability. Electronic polarization and polarization in
monoatomic and polyatomic gases. 3L

**Module 3:**

**Magnetostatics & Time Varying Field:**

3. Lorentz force, force on a small current element placed in a magnetic field. Biot-Savart law and its applications,
divergence of magnetic field, vector potential, Ampere’s law in integral form and conversion to differential form.
Faraday’s law of electro-magnetic induction in integral form and conversion to differential form. 3L

**Module 4:**

**Electromagnetic Theory:**

4.1 Concept of displacement current Maxwell’s field equations, Maxwell’s wave equation and its solution for free
space. E.M. wave in a charge free conducting media, Skin depth, physical significance of Skin Depth, E.M. energy
flow, & Poynting Vector. 6L

**Module 5:**

**Quantum Mechanics:**

5.1 Generalised coordinates, Lagrange’s Equation of motion and Lagrangian, generalised force potential, momenta and
energy. Hamilton’s Equation of motion and Hamiltonian. Properties of Hamilton and Hamilton’s equation of motion. 4L

Course should be discussed along with physical problems of 1-D motion

5.2 Concept of probability and probability density, operators, commutator. Formulation of quantum mechanics and
Basic postulates, Operator correspondence, Time dependent Schrödinger’s equation, formulation of time independent
Schrödinger’s equation by method of separation of variables, Physical interpretation of wave function ψ (normalization
and probability interpretation), Expectation values, Application of Schrödinger equation – Particle in an infinite square
well potential (1-D and 3-D potential well), Discussion on degenerate levels. 9L

**Module 6:**

**Statistical Mechanics:**

3.1 Concept of energy levels and energy states. Microstates, macrostates and thermodynamic probability, equilibrium
macrostate. MB, FD, BE statistics (No deduction necessary), fermions, bosons (definitions in terms of spin, examples),
physical significance and application, classical limits of quantum statistics Fermi distribution at zero & non-zero
temperature, Calculation of Fermi level in metals, also total energy at absolute zero of temperature and total number of
particles, Bose-Einstein statistics – Planck’s law of blackbody radiation. 7L

**Books:**

1.

Contacts: 3L = 3

Credits: 3

**General**

Basic ideas of environment, basic concepts, man, society & environment, their interrelationship. 1L

Mathematics of population growth and associated problems, Importance of population study in environmental
engineering, definition of resource, types of resource, renewable, non-renewable, potentially renewable, effect of
excessive use population growth, Sustainable Development. 2L

Materials balance: Steady state conservation system, steady state system with non conservative pollutants, step function. 1L

Environmental degradation: Natural environmental Hazards like Flood, earthquake, Landslide-causes, effects and
control/management; Anthropogenic degradation like Acid rain-cause, effects and control. Nature and scope of
Environmental Science and Engineering. 2L

**Ecology**

Elements of ecology: System, open system, closed system, definition of ecology, species, population, community,
definition of ecosystem- components types and function. 1L

Structure and function of the following ecosystem: Forest ecosystem, Grassland ecosystem, Desert ecosystem, Aquatic
ecosystems, Mangrove ecosystem (special reference to Sundar ban); Food chain [definition and one example of each
food chain], Food web. 2L

Biogeochemical Cycle- definition, significance, flow chart of different cycles with only elementary reaction [Oxygen,
carbon, Nitrogen, Phosphate, Sulphur]. 1L

Biodiversity- types, importance, Endemic species, Biodiversity Hot-spot, Threats to biodiversity, Conservation of
biodiversity. 2L

**Air pollution and control**

Atmospheric Composition: Troposphere, Stratosphere, Mesosphere, Thermosphere, Tropopause and Mesopause.

1L
Energy balance: Conductive and Convective heat transfer, radiation heat transfer, simple global temperature model
[Earth as a black body, earth as albedo], Problems. 1L

Green house effects: Definition, impact of greenhouse gases on the global climate and consequently on sea water level,
agriculture and marine food.Global warming and its consequence, Control of Global warming. Earth’s heat budget. 1L

Lapse rate: Ambient lapse rate Adiabatic lapse rate, atmospheric stability, temperature inversion (radiation inversion). 2L

Atmospheric dispersion: Maximum mixing depth, ventilation coefficient, effective stack height, smokestack plumes and
Gaussian plume model. 2L

Definition of pollutants and contaminants, Primary and secondary pollutants: emission standard, criteria pollutant.
Sources and effect of different air pollutants- Suspended particulate matter, oxides of carbon, oxides of nitrogen, oxides
of sulphur, particulate, PAN. 2L

Smog, Photochemical smog and London smog.

Depletion Ozone layer: CFC, destruction of ozone layer by CFC, impact of other green house gases, effect of ozone
modification. 1L

Standards and control measures: Industrial, commercial and residential air quality standard, control measure (ESP.
cyclone separator, bag house, catalytic converter, scrubber (ventury), Statement with brief reference). 1L

**Water Pollution and Control**

Hydrosphere, Hydrological cycle and Natural water.

Pollutants of water, their origin and effects: Oxygen demanding wastes, pathogens, nutrients, Salts, thermal application,
heavy metals, pesticides, volatile organic compounds. 2L

River/Lake/ground water pollution: River: DO, 5 day BOD test, Seeded BOD test, BOD reaction rate constants, Effect
of oxygen demanding wastes on river[deoxygenation, reaeration], COD, Oil, Greases, pH.
2L

Lake: Eutrophication [Definition, source and effect]. 1L

Ground water: Aquifers, hydraulic gradient, ground water flow (Definition only) 1L

Standard and control: Waste water standard [BOD, COD, Oil, Grease], Water Treatment system [coagulation and flocculation, sedimentation and filtration, disinfection, hardness and alkalinity, softening] Waste water treatment system, primary and secondary treatments [Trickling filters, rotating biological contractor, Activated sludge, sludge treatment, oxidation ponds] tertiary treatment definition. 2L

Water pollution due to the toxic elements and their biochemical effects: Lead, Mercury, Cadmium, and Arsenic 1L

**Land Pollution**

Lithosphere; Internal structure of earth, rock and soil 1L

Solid Waste: Municipal, industrial, commercial, agricultural, domestic, pathological and hazardous solid wastes;
Recovery and disposal method- Open dumping, Land filling, incineration, composting, recycling.
Solid waste management and control (hazardous and biomedical waste). 2L

**Noise Pollution**

Definition of noise, effect of noise pollution, noise classification [Transport noise, occupational noise, neighbourhood noise] 1L

Definition of noise frequency, noise pressure, noise intensity, noise threshold limit value, equivalent noise level, Noise pollution control. 1L

**Environmental Management:**

Environmental impact assessment, Environmental Audit, Environmental laws and protection act of India, Different
international environmental treaty/ agreement/ protocol. 2L

**References/Books**

1. Masters, G. M., “Introduction to Environmental Engineering and Science”, Prentice-Hall of India Pvt. Ltd.,
1991.

2. De, A. K., “Environmental Chemistry”, New Age International.

Contracts:3L

Credits- 3

Pre-requisite of Analog Electronics: Basic Electronics Parts I & II learned in the First year, semesters 1 & 2. Basic
concept of the working of P-N diodes, Schottky diodes, Basic BJTs, Basic FETs and OPAMP as a basic circuit
component. Concept of Feedback.

**Module -1: [9L]**

1. Different Classes of Amplifiers - (Class-A, B, AB and C - basic concepts, power, efficiency [2L]; Recapitulation of basic concepts of Feedback and Oscillation [1L], Phase Shift, Wein Bridge oscillators [2L]. (5L)

2. Astable & Monostable Multivibrators [1L]; Schimtt Trigger circuits [1L], 555 Timer [2L]. (4L)

[Learning Outcome: The learner will be trained to compare the merits and demerits of the different amplifiers and must be able to bias the transistors accordingly; the student must be able to design multivibrator circuits using 555 timers]

Pre-requisite of Digital Electronics: Binary numbers & Basic Boolean algebra – already covered in First year; Logic
gates, Truth Tables and function realization – already covered in First year upto minimisation of Logic expressions by
algebraic method, K-map,

**Module – 2: [11 L]**

a) Binary Number System & Boolean Algebra (recapitulation ) [1L]; BCD, ASCII, EBDIC, Gray codes and their
conversions [1L]; Signed binary number representation with 1’s and 2’s complement methods [1L], Binary
arithmetic, Venn diagram, Boolean algebra (recapitulation) [1L]; Representation in SOP and POS forms [1L];
Minimization of logic expressions by algebraic method. [2L] (7L)

b) Combinational circuits - Adder and Subtractor circuits (half & full adder & subtractor) [2L]; Encoder,
Decoder, Comparator, Multiplexer, De-Multiplexer and Parity Generator [2L]. (4L)

**Module - 3: [10L]**

1. Sequential Circuits - Basic Flip-flop & Latch [1L], Flip-flops -SR, JK, D, T and JK Master-slave Flip Flops
[3L], (4L)

2. Registers (SISO,SIPO,PIPO,PISO) [2L], Ring counter, Johnson counter [1L], Basic concept of Synchronous
and Asynchronous counters (detail design of circuits excluded), [2L], Design of Mod N Counter [2L]
(6L)

**Module – 4: [6L]**

1. A/D and D/A conversion techniques – Basic concepts (D/A :R-2-R only [2L]

A/D: successive approximation [2L]) (4L)

2. Logic families- TTL, ECL, MOS and CMOS - basic concepts. (2L)

[Learning Outcome: The student must be able to convert from one number system to another, work out problems
related to Boolean algebra, minimisation problems etc. The student must also learn to differentiate between the
combinational and sequential circuits and design simple circuits)

**Textbooks:**

Microelectronics Engineering - Sedra & Smith-Oxford.

Principles of Electronic Devices & circuits—B L Thereja & Sedha—S Chand

Digital Electronics – Logic & Systems by J.Bigmell & R.Donovan; Cambridge Learning.

Digital Logic and State Machine Design (3rd Edition) – D.J.Comer, OUP

**Reference:**

Electronic Devices & Circuit Theory – Boyelstad & Nashelsky - PHI

Bell-Linear IC & OP AMP—Oxford

P.Raja- Digital Electronics- Scitech Publications

Morries Mano- Digital Logic Design- PHI

R.P.Jain—Modern Digital Electronics, 2/e , Mc Graw Hill

H.Taub & D.Shilling, Digital Integrated Electronics- Mc Graw Hill.

Contracts:4L

Credits- 4

Pre-requisites: CS 201 (Basic Computation and Principles of C), M101 & M201 (Mathematics), basics of set theory

**Module -I. [8L]**
Linear Data Structure

Introduction (2L): Why we need data structure?
Concepts of data structures: a) Data and data structure b) Abstract Data Type and Data Type.

Algorithms and programs, basic idea of pseudo-code. Algorithm efficiency and analysis, time and space analysis of algorithms – order notations.

**Array (2L):**
Different representations – row major, column major.

Sparse matrix - its implementation and usage. Array representation of polynomials.

**Linked List (4L):**
Singly linked list, circular linked list, doubly linked list, linked list representation of polynomial and applications.

**Module -II: [7L]**

Linear Data Structure

[Stack and Queue] (5L):

Stack and its implementations (using array, using linked list), applications.
Queue, circular queue, dequeue. Implementation of queue- both linear and circular (using array, using linked list),
applications.

Recursion (2L):

Principles of recursion – use of stack, differences between recursion and iteration, tail recursion.
Applications - The Tower of Hanoi, Eight Queens Puzzle.

**Module -III. [15L]**

Nonlinear Data structures

Trees (9L):

Basic terminologies, forest, tree representation (using array, using linked list).

Binary trees - binary tree traversal (pre-, in-, post- order), threaded binary tree (left, right, full) - non-recursive traversal
algorithms using threaded binary tree, expression tree.

Binary search tree- operations (creation, insertion, deletion, searching).

Height balanced binary tree – AVL tree (insertion, deletion with examples only).

B- Trees – operations (insertion, deletion with examples only).

Graphs (6L):

Graph definitions and concepts (directed/undirected graph, weighted/un-weighted edges, sub-graph, degree, cutvertex/articulation
point, pendant node, clique, complete graph, connected components – strongly connected
component, weakly connected component, path, shortest path, isomorphism).

Graph representations/storage implementations – adjacency matrix, adjacency list, adjacency multi-list.

Graph traversal and connectivity – Depth-first search (DFS), Breadth-first search (BFS) – concepts of edges used in
DFS and BFS (tree-edge, back-edge, cross-edge, forward-edge), applications.

Minimal spanning tree – Prim’s algorithm (basic idea of greedy methods).

**Module - IV. Searching, Sorting (10L):**

Sorting Algorithms (5L): Bubble sort and its optimizations, insertion sort, shell sort, selection sort, merge sort, quick
sort, heap sort (concept of max heap, application – priority queue), radix sort.

Searching (2L): Sequential search, binary search, interpolation search.

Hashing (3L): Hashing functions, collision resolution techniques.

**Recommended books:**

1. “Data Structures And Program Design In C”, 2/E by Robert L. Kruse, Bruce P. Leung.

2. “Fundamentals of Data Structures of C” by Ellis Horowitz, Sartaj Sahni, Susan Anderson-freed.

3. “Data Structures” by S. Lipschutz.

4. “Data Structure Using C”, 2/e by A.K. Rath, A. K. Jagadev.

5. “Introduction to Algorithms” by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.

Contracts:3L

Credits- 3

Pre-requisite: Concept of basic components of a digital computer, Basic concept of Fundamentals & Programme
structures. Basic number systems, Binary numbers, representation of signed and unsigned numbers, Binary Arithmetic
as covered in Basic Computation & Principles of Computer Programming Second semester, first year. Boolean Algebra,
Karnaugh Maps, Logic Gates – covered in Basic Electronics in First year

**Module – 1: [8L]**

Basic organization of the stored program computer and operation sequence for execution of a program. Role of
operating systems and compiler/assembler. Fetch, decode and execute cycle, Concept of operator, operand, registers and
storage, Instruction format. Instruction sets and addressing modes. [7L]

Commonly used number systems. Fixed and floating point representation of numbers. [1L]

**Module – 2: [8L]**
Overflow and underflow. Design of adders - ripple carry and carry look ahead principles. [3L]

Design of ALU. [1L]

Fixed point multiplication -Booth's algorithm. [1L]

Fixed point division - Restoring and non-restoring algorithms. [2L]

Floating point - IEEE 754 standard. [1L]

**Module – 3: [10L]**

Memory unit design with special emphasis on implementation of CPU-memory interfacing. [2L]

Memory organization, static and dynamic memory, memory hierarchy, associative memory. [3L]

Cache memory, Virtual memory. Data path design for read/write access. [5L]

**Module – 4: [10L]**

Design of control unit - hardwired and microprogrammed control. [3L]

Introduction to instruction pipelining. [2L]

Introduction to RISC architectures. RISC vs CISC architectures. [2L]

I/O operations - Concept of handshaking, Polled I/O, interrupt and DMA. [3L]

**Text Book:**

1. Mano, M.M., “Computer System Architecture”, PHI.

2. Behrooz Parhami “ Computer Architecture”, Oxford University Press

**Reference Book:**

1. Hayes J. P., “Computer Architecture & Organisation”, McGraw Hill,

2. Hamacher, “Computer Organisation”, McGraw Hill,

3. Chaudhuri P. Pal, “Computer Organisation & Design”, PHI,

4. P N Basu- “Computer Organization & Architecture” , Vikas Pub

Contracts:2L

Credits- 2

Approximation in numerical computation: Truncation and rounding errors, Fixed and floating-point arithmetic,
Propagation of errors. (4)

Interpolation: Newton forward/backward interpolation, Lagrange’s and Newton’s divided difference Interpolation.
(5)

Numerical integration: Trapezoidal rule, Simpson’s 1/3 rule, Expression for corresponding error terms. (3)

Numerical solution of a system of linear equations:

Gauss elimination method, Matrix inversion, LU Factorization method, Gauss-Seidel iterative method. (6)

Numerical solution of Algebraic equation:

Bisection method, Regula-Falsi method, Newton-Raphson method. (4)

Numerical solution of ordinary differential equation: Euler’s method, Runge-Kutta methods, Predictor-Corrector
methods and Finite Difference method. (6)

**Text Books:**

1. C.Xavier: C Language and Numerical Methods.

2. Dutta & Jana: Introductory Numerical Analysis.

**References:**

1. Balagurusamy: Numerical Methods, Scitech.

2. Baburam: Numerical Methods, Pearson Education.

Contracts:4L

Credits- 4

**Module I**

Theory of Probability: Axiomatic definition of probability. Conditional probability. Independent events and related
problems. Bayes theorem (Statement only) & its application. One dimensional random variable. Probability
distributions-discrete and continuous. Expectation. Binomial, Poisson, Uniform, Exponential, Normal distributions and
related problems. t, χ2 and F-distribution (Definition only). Transformation of random variables. Central Limit
Theorem, Law of large numbers (statement only) and their applications. Tchebychev inequalities (statement only) and
its application. (14L)

**Module II**

Sampling theory: Random sampling. Parameter, Statistic and its Sampling distribution. Standard error of statistic.
Sampling distribution of sample mean and variance in random sampling from a normal distribution (statement only) and
related problems.

Estimation of parameters: Unbiased and consistent estimators. Point estimation. Interval estimation. Maximum
likelihood estimation of parameters (Binomial, Poisson and Normal). Confidence intervals and related problems. (7L)

**Module III**

Testing of Hypothesis: Simple and Composite hypothesis. Critical region. Level of significance. Type I and Type II
errors. One sample and two sample tests for means and proportions. χ2 - test for goodness of fit. (5L)

**Module IV**

Advanced Graph Theory: Planar and Dual Graphs. Kuratowski’s graphs. Homeomorphic graphs. Eulers formula ( n - e
+ r = 2) for connected planar graph and its generalisation for graphs with connected components. Detection of planarity.
Graph colouring. Chromatic numbers of Cn, Kn , Km,n and other simple graphs. Simple applications of chromatic
numbers. Upper bounds of chromatic numbers (Statements only). Chromatic polynomial. Statement of four and five
colour theorems. ( 10L )

**Module V**

Algebraic Structures: Group, Subgroup, Cyclic group, Permutation group, Symmetric group ( S3), Coset, Normal
subgroup, Quotient group, Homomorphism & Isomorphism ( Elementary properties only).

Definition of Ring, Field, Integral Domain and simple related problems. ( 12L)

**Text Books:**

1. Banerjee A., De S.K. and Sen S.: Mathematical Probability, U.N. Dhur & Sons.

2. Gupta S. C and Kapoor V K: Fundamentals of Mathematical Statistics, Sultan Chand & Sons.

3. Mapa S.K. :Higher Algebra (Abstract & Linear), Sarat Book Distributors.

**References:**

1. Babu Ram: Discrete Mathematics, Pearson Education.

2. Balakrishnan: Graph Theory (Schaum’s Outline Series), TMH.

3. Chakraborty S.K and Sarkar B.K.: Discrete Mathematics, OUP.

4. Das N.G.: Statistical Methods, TMH.

Contracts:3L

Credits- 3

**Module - 1:**

Elements of Communication system, Analog Modulation & Demodulation, Noise, SNR Analog-toDigital
Conversion. (Basic ideas in brief) [8]

[Details: Introduction to Base Band transmission & Modulation (basic concept) (1L); Elements of Communication
systems (mention of transmitter, receiver and channel); origin of noise and its effect, Importance of SNR in system
design (1L); Basic principles of Linear Modulation (Amplitude Modulation) (1L); Basic principles of Non-linear
modulation (Angle Modulation - FM, PM) (1L); Sampling theorem, Sampling rate, Impulse sampling, Reconstruction
from samples, Aliasing (1L); Analog Pulse Modulation - PAM (Natural & flat topped sampling), PWM, PPM (1L);
Basic concept of Pulse Code Modulation, Block diagram of PCM (1L); Multiplexing - TDM, FDM (1L);

**Module - 2: **

Digital Transmission: [8]
[Details: Concept of Quantisation & Quantisation error, Uniform Quantiser (1L); Non-uniform Quantiser, A-law &
law companding (mention only) (1L); Encoding, Coding efficiency (1L); Line coding & properties, NRZ & RZ,
AMI, Manchester coding PCM, DPCM (1L); Baseband Pulse Transmission, Matched filter (mention of its importance
and basic concept only), Error rate due to noise (2L); ISI, Raised cosine function, Nyquist criterion for distortion-less
base-band binary transmission, Eye pattern, Signal power in binary digital signals (2L);

**Module - 3:**

Digital Carrier Modulation & Demodulation Techniques: [8]
[Details: Bit rate, Baud rate (1L); Information capacity, Shanon’s limit (1L); M-ary encoding, Introduction to the
different digital modulation techniques - ASK, FSK, PSK, BPSK, QPSK, mention of 8 BPSK, 16 BPSK (2L);
Introduction to QAM, mention of 8QAM, 16 QAM without elaboration (1L); Delta modulation, Adaptive delta
modulation (basic concept and importance only, no details (1L); introduction to the concept of DPCM, Delta
Modulation, Adaptive Delta modulation and their relevance (1L); Spread Spectrum Modulation - concept only. (1L).

**Module - 4:**

Information Theory & Coding: [8]
[Details: Introduction, News value & Information content (1L);, Entropy (1L);, Mutual information (1L);, Information
rate (1L);, Shanon-Fano algorithm for encoding (1L);, Shannon's Theorem - Source Coding Theorem (1L);, Channel
Coding Theorem, Information Capacity Theorem (basic understanding only) (1L);; Error Control & Coding - basic
principle only. (1L);

**Text Books:**

1. An Introduction to Analog and Digital Communications by Simon Haykin; Published by Wiley India.

2. Data Communication and Networking by Behrouz A. Forouzan, Published by Tata McGraw-Hill

**References:**

1. Communication Systems 4th Edition by Simon Haykin; Published by Wiley India (Student Edition)

2. Principles and Analog and Digital Communication by Jerry D Gibson, Published by MacMillan.

3. Communication Systems by A. B. Carlson, Published by McGraw-Hill.

4. Understanding Signals and Systems by Jack Golten, Published by McGraw Hill.

Contracts:4L

Credits- 4

Prerequisites of Formal Language & Automata Theory:
Elementary discrete mathematics including the notion of set,function,relation,product,partial order,equivalence
relation,graph& tree. They should have a thorough understanding of the principle of mathematical induction.

**Module-1: [13 L]**

Fundamentals: Basic definition of sequential circuit, block diagram, mathematical representation, concept of transition
table and transition diagram (Relating of Automata concept to sequential circuit concept) Design of sequence
detector, Introduction to finite state model [ 2L]

Finite state machine: Definitions, capability & state equivalent, kth- equivalent concept [ 1L]

Merger graph, Merger table, Compatibility graph [ 1L]

Finite memory definiteness, testing table & testing graph. [1L]

Deterministic finite automaton and non deterministic finite automaton. [1L]

Transition diagrams and Language
recognizers. [1L]

Finite Automata: NFA with Î transitions - Significance, acceptance of languages. [1L]

Conversions and Equivalence: Equivalence between NFA with and without Î transitions. NFA to DFA conversion.
[2L]

Minimization of FSM, Equivalence between two FSM’s , Limitations of FSM [1L]

Application of finite automata, Finite Automata with output- Moore & Melay machine. [2L]

**Module-2: [8 L]**

Regular Languages : Regular sets. [1L]

Regular expressions, identity rules. Arden’s theorem state and prove [1L]

Constructing finite Automata for a given regular expressions, Regular string accepted by NFA/DFA [1L]

Pumping lemma of regular sets. Closure properties of regular sets (proofs not required). [1L]

Grammar Formalism: Regular grammars-right linear and left linear grammars. [1L]

Equivalence between regular linear grammar and FA. [1L]

Inter conversion, Context free grammar. [1L]

Derivation trees, sentential forms. Right most and leftmost derivation of strings. (Concept only) [1L]

**Module-3: [9L]**

Context Free Grammars, Ambiguity in context free grammars. [1L]

Minimization of Context Free Grammars. [1L]

Chomsky normal form and Greibach normal form. [1L]

Pumping Lemma for Context Free Languages. [1L]

Enumeration of properties of CFL (proofs omitted). Closure property of CFL, Ogden’s lemma & its applications [1L]

Push Down Automata: Push down automata, definition. [1L]

Acceptance of CFL, Acceptance by final state and acceptance by empty state and its equivalence. [1L]

Equivalence of CFL and PDA, interconversion. (Proofs not required). [1L]

Introduction to DCFL and DPDA. [1L]

**Module-4: [6L]**

Turing Machine : Turing Machine, definition, model [1L]

Design of TM, Computable functions [1L]

Church’s hypothesis, counter machine [1L]

Types of Turing machines (proofs not required) [1L]

Universal Turing Machine, Halting problem [2L]

**TEXT BOOKS:**

“Introduction to Automata Theory Language and Computation”, Hopcroft H.E. and Ullman J. D., Pearson
Education.

“Formal Languages and Automata Theory”, C.K.Nagpal, Oxford

**REFERENCES:**
2.1 “Switching & Finite Automata”, ZVI Kohavi, 2nd Edn., Tata McGraw Hill

2.2 “Introduction to Computer Theory”, Daniel I.A. Cohen, John Wiley

Contracts:4L

Credits- 4

**Module – 1: [12 L]**

Introduction: Review of basic computer architecture (Revisited), Quantitative techniques in computer design,
measuring and reporting performance. (3L)

Pipelining: Basic concepts, instruction and arithmetic pipeline, data hazards, control hazards and structural hazards,
techniques for handling hazards. Exception handling. Pipeline optimization techniques; Compiler techniques for
improving performance. (9L)

**Module – 2: [8L]**

Hierarchical memory technology: Inclusion, Coherence and locality properties; Cache memory organizations,
Techniques for reducing cache misses; Virtual memory organization, mapping and management techniques, memory
replacement policies. (8L)

**Module – 3: [6L]**

Instruction-level parallelism: basic concepts, techniques for increasing ILP, superscalar, superpipelined and VLIW
processor architectures. Array and vector processors. (6L)

**Module – 4: [12 L]**

Multiprocessor architecture: taxonomy of parallel architectures; Centralized shared- memory architecture:
synchronization, memory consistency, interconnection networks. Distributed shared-memory architecture. Cluster
computers. (8L)

Non von Neumann architectures: data flow computers, reduction computer architectures, systolic architectures. (4L)

Contracts- 3L

Credits- 3

**Module-I**

1. Economic Decisions Making – Overview, Problems, Role, Decision making process.

2. Engineering Costs & Estimation – Fixed, Variable, Marginal & Average Costs, Sunk Costs, Opportunity Costs, Recurring And
Nonrecurring Costs, Incremental Costs, Cash Costs vs Book Costs, Life-Cycle Costs; Types Of Estimate, Estimating Models - PerUnit
Model, Segmenting Model, Cost Indexes, Power-Sizing Model, Improvement & Learning Curve, Benefits.

**Module-II**

3. Cash Flow, Interest and Equivalence: Cash Flow – Diagrams, Categories & Computation, Time Value of Money, Debt repayment,
Nominal & Effective Interest.

4. Cash Flow & Rate Of Return Analysis – Calculations, Treatment of Salvage Value, Annual Cash Flow Analysis, Analysis Periods;
Internal Rate Of Return, Calculating Rate of Return, Incremental Analysis; Best Alternative Choosing An Analysis Method, Future
Worth Analysis, Benefit-Cost Ratio Analysis, Sensitivity And Breakeven Analysis. Economic Analysis In The Public Sector -
Quantifying And Valuing Benefits & drawbacks.

**Module-III**

5. Inflation And Price Change – Definition, Effects, Causes, Price Change with Indexes, Types of Index, Composite vs Commodity
Indexes, Use of Price Indexes In Engineering Economic Analysis, Cash Flows that inflate at different Rates.

6. Present Worth Analysis: End-Of-Year Convention, Viewpoint Of Economic Analysis Studies, Borrowed Money Viewpoint, Effect
Of Inflation & Deflation, Taxes, Economic Criteria, Applying Present Worth Techniques, Multiple Alternatives.

7. Uncertainty In Future Events - Estimates and Their Use in Economic Analysis, Range Of Estimates, Probability, Joint Probability Distributions, Expected Value, Economic Decision Trees, Risk, Risk vs Return, Simulation, Real Options.

**Module-IV**

8. Depreciation - Basic Aspects, Deterioration & Obsolescence, Depreciation And Expenses, Types Of Property, Depreciation
Calculation Fundamentals, Depreciation And Capital Allowance Methods, Straight-Line Depreciation Declining Balance
Depreciation, Common Elements Of Tax Regulations For Depreciation And Capital Allowances.

9. Replacement Analysis - Replacement Analysis Decision Map, Minimum Cost Life of a New Asset, Marginal Cost, Minimum Cost
Life Problems.

10. Accounting – Function, Balance Sheet, Income Statement, Financial Ratios Capital Transactions, Cost Accounting, Direct and
Indirect Costs, Indirect Cost Allocation.

**Readings**

1. James L.Riggs,David D. Bedworth, Sabah U. Randhawa : Economics for Engineers 4e , Tata McGraw-Hill

2. Donald Newnan, Ted Eschembach, Jerome Lavelle : Engineering Economics Analysis, OUP

3. R.Paneer Seelvan: Engineering Economics, PHI

Contracts:4L

Credits- 4

**Complexity Analysis:[2L]**
Time and Space Complexity, Different Asymptotic notations – their mathematical significance
Algortihm Design Techniques:

**Divide and Conquer: [3L]**

Basic method, use, Examples – Binary Search, Merge Sort, Quick Sort and their complexity.
Heap Sort and its complexity [1L]

**Dynamic Programming: [3L]**

Basic method, use, Examples – Matrix Chain Manipulation, All pair shortest paths, single source shortest path. Backtracking: [2L]

Basic method, use, Examples – 8 queens problem, Graph coloring problem. Greedy Method: [3L]

Basic method, use, Examples – Knapsack problem, Job sequencing with deadlines, Minimum cost spanning ree by Prim’s and
Kruskal’s algorithm.

**Lower Bound Theory: [1L]**

O(nlgn) bound for comparison sort

Disjoint set manipulation: [2L]

Set manipulation algorithm like UNION-FIND, union by rank.

Graph traversal algorithm: Recapitulation [1L]

Breadth First Search(BFS) and Depth First Search(DFS) – Classification of edges - tree, forward, back and
cross edges – complexity and comparison

**String matching problem: [3L]**

Different techniques – Naive algorithm, string matching using finite automata, and Knuth, Morris, Pratt (KMP) algorithm with
their complexities.

Amortized Analysis: [3L]

Aggregate, Accounting, and Potential Method.

**Network Flow: [3L]**

Ford Fulkerson algorithm, Max-Flow Min-Cut theorem (Statement and Illustration)
Matrix Manipulation Algorithm: [3L]

Strassen’s matrix manipulation algorithm; application of matrix multiplication to solution of simultaneous
linear equations using LUP decomposition, Inversion of matrix and Boolean matrix multiplication

Notion of NP-completeness: [3L]

P class, NP class, NP hard class, NP complete class – their interrelationship, Satisfiability problem, Cook’s
theorem (Statement only), Clique decision problem

**Approximation Algorithms: [3L]**

Necessity of approximation scheme, performance guarantee, polynomial time approximation schemes,
vertex cover problem, travelling salesman problem.

**Text Book:**

1. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, “Introduction to Algorithms”

2. A. Aho, J.Hopcroft and J.Ullman “The Design and Analysis of Algorithms”

**Reference:**

2.5 K.Mehlhorn , “Data Structures and Algorithms” - Vol. I & Vol. 2.

2.6 S.Baase “Computer Algorithms”

2.7 E.Horowitz and Shani “Fundamentals of Computer Algorithms”

Contracts:4L

Credits- 4

**Module -1: [8L]**

Introduction to Microcomputer based system. History of evolution of Microprocessor and Microcontrollers and their advantages and
disadvantages. [1L]

Architecture of 8085 Microprocessor, Pin description of 8085. [2L]

Address/data bus Demultiplexing , Status Signals and the control signals. [1L]

Instruction set of 8085 microprocessor, Addressing modes, [3L]

Timing diagram of the instructions (a few examples). [1L]

**Module -2: [9L]**

Assembly language programming with examples, Counter and Time Delays, Stack and Subroutine, [6L]

Interrupts of 8085 processor(software and hardware), I/O Device Interfacing-I/O Mapped I/O and Memory Mapped I/O , Serial (using
SID and SOD pins and RIM, SIM Instructions) and Parallel data transfer [3L]

**Module 3: [10L]**

The 8086 microprocessor- Architecture, Addressing modes, Interrupts [3L]

Introduction to 8051 Microcontroller –Architecture, Pin Details. [3L]

Addressing modes, Instruction set, Examples of Simple Assembly Language. [4L]

**Module -4: [9L]**

Memory interfacing with 8085, 8086 [2L]

Support IC chips- 8255 ,8251,8237/8257,8259 [4L]

Interfacing of 8255 PPI with 8085 and Microcontroller 8051. [2L]

Brief introduction to PIC microcontroller (16F877) [1L]

**TEXTS :**

1. Microprocessors and microcontrollers - N. Senthil Kumar, M. Saravanan and Jeevananthan
(Oxford university press)

2. 8051 Microcontroller – K. Ayala (Cengage learning)

3. MICROPROCESSOR architecture, programming and Application with 8085 - R.Gaonkar (Penram international Publishing LTD.)

**Reference:**

1. 8086 Microprocessor –K Ayala (Cengage learning)

2. The 8085 Microprocessor, Architecture, Programming and Interfacing- K Uday Kumar, B .S
Umashankar (Pearson)

3. The X-86 PC Assembly language, Design and Interfacing - Mazidi, Mazidi and Causey (PEARSON)

Contracts:3L

Credits- 3

**Module I:**

Introduction to Propositional Calculus: Propositions, Logical Connectives, Conjunction, Disjunction, Negation and their
truth table. Conditional Connectives, Implication, Converse, Contrapositive, Inverse, Biconditional statements with truth table,
Logical Equivalence, Tautology, Normal forms-CNF, DNF; Predicates and Logical Quantifications of propositions and related
examples. 10L

**Module II:** Theory of Numbers: Well Ordering Principle, Divisibility theory and properties of divisibility; Fundamental theorem of
Arithmetic; Euclidean Algorithm for finding G.C.D and some basic properties of G.C.D with simple examples; Congruences,
Residue classes of integer modulo n(Zn) and its examples.Order, Relation and Lattices: POSET, Hasse Diagram, Minimal ,
Maximal, Greatest and Least elements in a POSET, Lattices and its properties, Principle of Duality, Distributive and Complemented
Lattices. 10L

**Module III:** Counting Techniques: Permutations, Combinations, Binomial coefficients, Pigeon- hole Principle, Principles of inclusion
and exclusions; Recurrence relations: Formulation/Modelling of different counting problems in terms of recurrence relations,
Solution of linear recurrence relations with constant coefficients ( upto second order) by (i) The iterative method (ii) Characteristic roots method (iii) Generating functions method. 10L

**Module IV:** Graph Coloring: Chromatic Numbers and its bounds, Independence and Clique Numbers, Perfect Graphs-Definition and
examples, Chromatic polynomial and its determination, Applications of Graph Coloring.
Matchings: Definitions and Examples of Perfect Matching, Maximal and Maximum Matching, Hall’s Marriage Theorem (Statement
only) and related problems. 6L

**Texts:**

1. Russell Merris, Combinatorics, Wiley-Interscience series in Discrete Mathematics and Optimisation

2. N. Chandrasekaran and M. Umaparvathi, Discrete Mathematics, PHI

**References:**

3. J.K. Sharma, Discrete Mathematics, Macmillan

4. Winfried Karl Grassmann and Jean-Paul Tremblay, Logic and Discrete Mathematics, PEARSON.

Contracts:4L

Credits- 4

**Object oriented design [10 L]**

Concepts of object oriented programming language, Major and minor elements, Object, Class, relationships among objects,
aggregation, links, relationships among classes-association, aggregation, using, instantiation, meta-class, grouping constructs.

**Object oriented concepts [4 L]**

Difference between OOP and other conventional programming – advantages and disadvantages. Class, object, message passing,
inheritance, encapsulation, polymorphism

Basic concepts of object oriented programming using Java [22 L]

Implementation of Object oriented concepts using Java.

Language features to be covered:

**Class & Object proprieties [6L]**

Basic concepts of java programming – advantages of java, byte-code & JVM, data types, access specifiers, operators, control
statements & loops, array, creation of class, object, constructor, finalize and garbage collection, use of method overloading, this keyword, use of objects as parameter & methods returning objects, call by value & call by reference, static variables & methods, garbage collection, nested & inner classes, basic string handling concepts- String (discuss charAt() , compareTo(), equals(), equalsIgnoreCase(), indexOf(), length() , substring(), toCharArray() , toLowerCase(), toString(), toUpperCase() , trim() , valueOf() methods) & StringBuffer classes (discuss append(), capacity(), charAt(), delete(), deleteCharAt(), ensureCapacity(), getChars(), indexOf(), insert(), length(), setCharAt(), setLength(), substring(), toString() methods), concept of mutable and immutable string, command line arguments, basics of I/O operations – keyboard input using BufferedReader & Scanner classes.

**Reusability properties[6L]**

Super class & subclasses including multilevel hierarchy, process of constructor calling in inheritance, use of super and final keywords with super() method, dynamic method dispatch, use of abstract classes & methods, interfaces. Creation of packages, importing packages, member access for packages.

Exception handling & Multithreading [6L]

Exception handling basics, different types of exception classes, use of try & catch
with throw, throws & finally, creation of user defined exception classes. Basics of multithreading, main thread, thread life cycle, creation of multiple threads, thread priorities, thread synchronization, interthread communication, deadlocks for threads, suspending & resuming threads.

**Applet Programming (using swing) [4L]**

Basics of applet programming, applet life cycle, difference between application & applet programming, parameter passing in applets, concept of delegation event model and listener, I/O in applets, use of repaint(), getDocumentBase(), getCodeBase() methods, layout manager (basic concept), creation of buttons (JButton class only) & text fields.

**Textbooks/References:**

1. Rambaugh, James Michael, Blaha – "Object Oriented Modelling and Design" – Prentice Hall, India

2. Ali Bahrami – "Object Oriented System Development" – Mc Graw Hill

3. E. Balagurusamy – " Programming With Java: A Primer" – 3rd Ed. – TMH

Contracts- 3L + 1T

Credits- 4

**Module-I**

**Overview of data communication and Networking: [5L]**

Introduction; Data communications: components, data representation(ASCII,ISO etc.),direction of data flow(simplex,
half duplex, full duplex); Networks: distributed processing, network criteria, physical structure (type of connection,
topology), categories of network (LAN, MAN,WAN);Internet: brief history, internet today; Protocols and standards;
Reference models: OSI reference model, TCP/IP reference model, their comparative study.

**Physical level: [5L]**

Overview of data(analog & digital), signal(analog & digital), transmission (analog & digital)& transmission media (
guided & non-guided); TDM, FDM, WDM; Circuit switching: time division & space division switch, TDM bus;
Telephone network;

**Module-II**

**Data link layer: [6L]**

Types of errors, framing(character and bit stuffing), error detection & correction methods; Flow control; Protocols:
Stop & wait ARQ, Go-Back- N ARQ, Selective repeat ARQ, HDLC;

**Medium access sub layer: [5L]**

Point to point protocol, LCP, NCP, FDDI, token bus, token ring; Reservation, polling, concentration; Multiple access
protocols: Pure ALOHA, Slotted ALOHA, CSMA, CSMA/CD, FDMA, TDMA, CDMA; Traditional Ethernet, fast
Ethernet;

**Module-III**

**Network layer: [8L] **

Internetworking & devices: Repeaters, Hubs, Bridges, Switches, Router, Gateway; Addressing : Internet address,
classful address, subnetting; Routing : techniques, static vs. dynamic routing , routing table for classful address;
Routing algorithms: shortest path algorithm, flooding, distance vector routing, link state routing; Protocols: ARP,
RARP, IP, ICMP, IPV6; Unicast and multicast routing protocols.

**Transport layer: [6L]**

Process to process delivery; UDP; TCP; Congestion control algorithm: Leaky bucket algorithm, Token bucket
algorithm, choke packets; Quality of service: techniques to improve Qos.

**Module-IV**

**Application layer: [5L]**

DNS; SMTP, SNMP, FTP, HTTP & WWW; Security: Cryptography, user authentication, security protocols in internet,
Firewalls.

**Modern topics: [5L] **

ISDN services & ATM ; DSL technology, Cable modem, Sonet.
Wireless LAN: IEEE 802.11; Introduction to blue-tooth, VLAN’s, Cellular telephony & Satellite network.

**Text Books:**

1. B. A. Forouzan – “Data Communications and Networking (3rd Ed.) “ – TMH

2. A. S. Tanenbaum – “Computer Networks (4th Ed.)” – Pearson Education/PHI

3. W. Stallings – “Data and Computer Communications (5th Ed.)” – PHI/ Pearson Education

4. Zheng & Akhtar, Network for Computer Scientists & Engineers, OUP

5. Black, Data & Computer Communication, PHI

6. Miller, data Communication & Network, Vikas

7. Miller, Digital & Data Communication, Jaico

8. Shay, Understanding Data Communication & Network, Vikas

**Reference Books:**

1. Kurose and Rose – “ Computer Networking -A top down approach featuring the internet” – Pearson
Education

2. Leon, Garica, Widjaja – “Communication Networks” – TMH

3. Walrand – “Communication Networks” – TMH.

4. Comer – “Internetworking with TCP/IP, vol. 1, 2, 3(4
th Ed.)” – Pearson Education/PHI

Contracts:3L

Credits- 3

**Module I**

Overview of System Analysis & Design , Business System Concept, System Development Life Cycle, Waterfall Model
, Spiral Model, Feasibility Analysis, Technical Feasibility, Cost- Benefit Analysis, COCOMO model. **[10L]**

**Module II**

System Requirement Specification – DFD, Data Dictionary, ER diagram, Process Organization & Interactions. **[5L]**

System Design – Problem Partitioning, Top-Down And Bottop-Up design ;Decision tree, decision table and structured
English; Functional vs. Object- Oriented approach. **[5L]**

**Module III**

Coding & Documentation - Structured Programming, OO Programming, Information Hiding, Reuse, System Documentation. **[4L]**

Testing – Levels of Testing, Integration Testing, Test case Specification, Reliability Assessment . , Validation &
Verification Metrics, Monitoring & Control. **[8L]**

**Module IV**

Software Project Management – Project Scheduling , Staffing, Software Configuration Management, Quality Assurance, Project Monitoring. **[7L]**

CASE TOOLS : Concepts, use and application. **[5L]**

**Books: **

1. R. G. Pressman – Software Engineering, TMH

2.Behforooz, Software Engineering Fundamentals,OUP

3. Ghezzi, Software Engineering, PHI

4.Pankaj Jalote – An Integrated Approach to Software Engineering, NAROSA.

5.Object Oriented & Classical Software Engineering(Fifth Edition), SCHACH,TMH

6.Vans Vlet, Software Engineering, SPD

7.Uma, Essentials of Software Engineering, Jaico

8.Sommerville, Ian – Software Engineering, Pearson Education

9.Benmenachen, Software Quality, Vikas

**Reference:**

1. IEEE Standards on Software Engineering.

2. Kane, Software Defect Prevention, SPD

Contracts:3L

Credits- 3

**Module I**

**Introduction to computer graphics & graphics systems [6L]**

Overview of computer graphics, representing pictures, preparing, presenting & interacting with pictures for
presentations; Visualization & image processing; RGB color model, direct coding, lookup table; storage tube graphics
display, Raster scan display, 3D viewing devices, Plotters, printers, digitizers, Light pens etc.; Active & Passive
graphics devices; Computer graphics software.
**Scan conversion: [6L]**

Points & lines, Line drawing algorithms; DDA algorithm, Bresenham’s line algorithm, Circle generation algorithm;
Ellipse generating algorithm; scan line polygon, fill algorithm, boundary fill algorithm, flood fill algorithm.

**Module II**

**2D transformation & viewing [8L]**

Basic transformations: translation , rotation, scaling ; Matrix representations & homogeneous coordinates,
transformations between coordinate systems; reflection shear;
Transformation of points, lines , parallel lines, intersecting lines. Viewing pipeline, Window to viewport co-ordinate
transformation , clipping operations , point clipping , line clipping, clipping circles , polygons & ellipse.

**3D transformation & viewing [7L]**

3D transformations: translation, rotation, scaling & other transformations. Rotation about an arbitrary axis in space,
reflection through an arbitrary plane; general parallel projection transformation; clipping, viewport clipping, 3D
viewing.

**Module III**

**Curves [3L]**

Curve representation, surfaces , designs , Bezier curves , B-spline curves, end conditions for periodic B-spline curves,
rational B-spline curves.

**Hidden surfaces [3L]**

Depth comparison, Z-buffer algorithm, Back face detection, BSP tree method, the Printer’s algorithm, scan-line
algorithm; Hidden line elimination, wire frame methods , fractal - geometry.
Color & shading models [2L]
Light & color model; interpolative shading model; Texture;

**Module IV**

**Multimedia [10L]**

Introduction to Multimedia: Concepts, uses of multimedia, hypertext and hypermedia.; Image, video and audio standards.

Audio: digital audio, MIDI, processing sound, sampling, compression.

Video: MPEG compression standards, compression through spatial and temporal redundancy, inter-frame and intraframe compression .

Animation: types, techniques, key frame animation, utility, morphing.
Virtual Reality concepts.

**Text Books:**

1. Hearn, Baker – “ Computer Graphics ( C version 2nd Ed.)” – Pearson education

2. Z. Xiang, R. Plastock – “ Schaum’s outlines Computer Graphics (2nd Ed.)” – TMH

3. D. F. Rogers, J. A. Adams – “ Mathematical Elements for Computer Graphics (2nd Ed.)” – TMH

4. Mukherjee, Fundamentals of Computer graphics & Multimedia, PHI

5. Sanhker, Multimedia –A Practical Approach, Jaico

6. Buford J. K. – “Multimedia Systems” – Pearson Education

7. Andleigh & Thakrar, Multimedia, PHI

8. Mukherjee Arup, Introduction to Computer Graphics, Vikas

9. Hill,Computer Graphics using open GL, Pearson Education

**Reference Books:**

1. Foley, Vandam, Feiner, Hughes – “Computer Graphics principles (2nd Ed.) – Pearson Education.

2. W. M. Newman, R. F. Sproull – “Principles of Interactive computer Graphics” – TMH.

3. Elsom Cook – “Principles of Interactive Multimedia” – McGraw Hill

Contracts:3L+1T

Credits- 4

**Module I:**

**System Software [15]**

Assemblers: General design procedures, Design of two pass assemblers, Cross Assemblers, Macro Processors –
Features of a macro facility,(macro instruction arguments, conditional macro expansion, macro calls within macros),
Implementation of a restricted facility : A two pass algorithm; Macro Assemblers.
Loader schemes: Compile and go loaders, absolute loaders, relocating loader, Linking, Reallocation- static & dynamic
linking, Direct linking loaders, Binders, Overlays, dynamic binders; Working principle of Editors, Debuggers.
System Administration

**Module II:**

**Introduction: [3L]**

Duties of the Administrator, Administration tools, Overview of permissions.
Processes: Process status, Killing processes, process priority. Starting up and Shut down:
Peripherals, Kernel loading, Console, The scheduler, init and the inittab file, Run-levels, Run level scripts.

**Managing User Accounts: [2L]**

Principles, password file, Password security, Shadow file, Groups and the group file, Shells, restricted shells, user
management commands, homes and permissions, default files, profiles, locking accounts, setting passwords, Switching
user, Switching group, Removing users.

**Managing Unix File Systems: [2L]**

Partitions, Swap space, Device files, Raw and Block files, Formatting disks, Making filesystems, Superblock, I-nodes, Filesystem checker, Mounting filesystems, Logical Volumes, Network Filesystems, Boot disks

**Configuring the TCP/IP Networking : [4L]**

Kernel Configuration; Mounting the /proc Filesystem, Installing the Binaries, Setting the Hostname, Assigning IP Addresses, Creating Subnets, Writing hosts and networks Files, Interface Configuration for IP, ifconfig, netstat command, Checking the ARP Tables; Name service and resolver configuration.

**Module III**

**TCP/IP Firewall : [6L]**

Methods of Attack, What Is a Firewall? What Is IP Filtering? Setting Up Linux for Firewalling Testing a Firewall Configuration; A Sample Firewall Configuration:
IP Accounting, Configuring the Kernel for IP Accounting, Configuring IP Accounting, Using IP Accounting Results

**IP Masquerade and Network Address Translation : [4L]**

Side Effects and Fringe Benefits, Configuring the Kernel for IP Masquerade, Configuring IP Masquerade.

**Module IV**

**The Network Information System : [3L]**

Getting Acquainted with NIS, NIS Versus NIS+ , The Client Side of NIS, Running an NIS Server, NIS Server Security.

**Network file system: [3L]**

Preparing NFS, Mounting an NFS Volume, The NFS Daemons, The exports File.
**System Backup & Recovery: [3L]**

Log files for system and applications; Backup schedules and methods (manual and automated).

**Text Books:**

1. L.L. Beck – “System Software “ (3rd Ed.)- Pearson Education

2. Michel Ticher – “PC System Programming” , Abacus.

3. Kirch – “ Linux network Administrator’s guide (2nd Ed.)” – O’Rielly

4. Maxwell – “Unix system administration” - TMH

5. Limoncelli –“The Practice of System & Network Administration”-Pearson

6. Wells, LINUX Installation & Administration, Vikas

**Reference Books:**

1. W. R. Stevens – “Unix network programming, vol. 1(2nd Ed.)” – Pearson Education/PHI

2. W. R. Stevens – “TCP/IP illustrated, vol. 1” – PHI/Pearson Education

3. Comer – “Internetworking with TCP/IP, vol. 1(4th Ed.)” – Pearson Education/PHI

4. E. Nemeth, G. Snyder, S. Seebass, T. R. Hein – “ Unix system administration handbook” – Pearson
Education

Contracts:3L

Credits- 3

**Module I**

**Introduction [6 L]**

Why object orientation, History and development of Object Oriented Programming language, concepts of object oriented programming language.

**Object oriented analysis [4L]**

Usecase diagram; Major and minor elements, Object, Class.

**Module II**

**Object oriented design [10 L]**

Relationships among objects, aggregation, links, relationships among classes- association, aggregation, using, instantiation, meta-class, grouping constructs.

**Module III**

**Basic concepts of object oriented programming using Java [15 L]**

Object, class, message passing, encapsulation, polymorphism, aggregation, threading, applet programming, difference between OOP and other conventional programming-advantages and disadvantages.

**Module IV**

**Fundamentals of Object Oriented design in UML [12 L]**

Static and dynamic models, why modeling, UML diagrams: Class diagram, interaction diagram: collaboration diagram, sequence diagram, statechart diagram, activity diagram, implementation diagram, UML extensibility- model constraints and comments, Note, Stereotype.

**Text Books :**

1. Ali Bahrami, - “Object –Oriented System Development” - Mc Graw Hill.

2. Rambaugh, James Michael, Blaha - “Object Oriented Modelling and Design” - Prentice Hall India/ Pearson Education.

3. Bruce, Foundations of Object Oriented Languages, PHI

4. Patrick Naughton, Herbert Schildt – “The complete reference-Java2” - TMH

5. Priestley – “ Practical Object Oriented Design using UML” - TMH

6. Jana, C++ & Object Oriented Programming, PHI

7. Alhir, learning UML, SPD/O’Reily

**Reference Books:**

1. Page Jones, Meiler - “Fundamentals of object oriented design in UML”

2. Roff: UML: A Beginner’s Guide TMH

3. Rajaram: Object Oriented Programming and C++, New Age International

4. Mahapatra: Introduction to System Dynamic Modelling, Universities Press

5. Muller : Instant UML, Shroff Publishers / Wrox

6. Srimathi, Object Oriented Analysis & Design Using UML, Scitech

7. Alhir : UML in a Nutshell, Shroff Publishers / O’reilly

8. Olshevsky : Revolutionary guide to Object Oriented Programming using C++, Shroff / Wrox

Contracts:3P

Credits- 2

• IPC (Message queue)

• NIC Installation & Configuration (Windows/Linux)

• Familiarization with :

o Networking cables (CAT5, UTP)

o Connectors (RJ45, T-connector)

o Hubs, Switches

• TCP/UDP Socket Programming

• Multicast & Broadcast Sockets

• Implementation of a Prototype Multithreaded Server

• Implementation of :

o Data Link Layer Flow Control Mechanism (Stop & Wait, Sliding Window)

o Data Link Layer Error Detection Mechanism (Cyclic Redundancy Check)

o Data Link Layer Error Control Mechanism (Selective Repeat, Go Back N)

Contracts:3P

Credits- 2

• Point plotting, line & regular figure algorithms

• Raster scan line & circle drawing algorithms

• Clipping & Windowing algorithms for points, lines & polygons

• 2-D / 3-D transformations

• Simple fractals representation

• Filling algorithms

• Web document creation using Dreamweaver.

• Creating Animation using Flash.

Contracts:3P

Credits- 2

• Packet Monitoring software (tcpdump, snort, ethereal)

• Trace route, Ping, Finger, Nmap

• Server configuration (FTP, SMTP, DNS)

• NFS Configuration

• Firewall Configuration using iptables/ipchains (Linux only)

• Experiments using Turbo C Assembler

**Note:** All the above experiments may be performed in both Unix /Linux & Windows

Contracts:3P

Credits- 2

1. Assignments on class, constructor, overloading, inheritance, overriding

2. Assignments on wrapper class, vectors, arrays

3. Assignments on developing interfaces- multiple inheritance, extending interfaces

4. Assignments on creating and accessing packages

5. Assignments on multithreaded programming, handling errors and exceptions, applet programming and graphics programming

6. Use of CASE tools

**Note:** Use Java as programming language.

Contracts:3L

Credits- 3

**Introduction to Compiling [3L]**

Compilers, Analysis of the source program, The phases of the compiler, Cousins of the compiler.

**Lexical Analysis [6L]**

The role of the lexical analyzer, Tokens, Patterns, Lexemes, Input buffering, Specifications of a token, Recognition of a tokens, Finite automata, From a regular expression to an NFA, From a regular expression to NFA, From a regular expression to DFA, Design of a lexical analyzer generator (Lex).

**Syntax Analysis [9L]**

The role of a parser, Context free grammars, Writing a grammar, Top down Parsing, Non-recursive Predictive parsing (LL), Bottom up parsing, Handles, Viable prefixes, Operator precedence parsing, LR parsers (SLR, LALR), Parser generators (YACC). Error Recovery strategies for different parsing techniques.

**Syntax directed translation [5L]**

Syntax director definitions, Construction of syntax trees, Bottom-up evaluation of S attributed definitions, L attributed definitions, Bottom-up evaluation of inherited attributes.

**Type checking [4L]**

Type systems, Specification of a simple type checker, Equivalence of type expressions, Type conversions

**Run time environments [5L]**
Source language issues (Activation trees, Control stack, scope of declaration, Binding of names), Storage organization (Subdivision of run-time memory, Activation records), Storage allocation strategies, Parameter passing (call by value, call by reference, copy restore, call by name), Symbol tables, dynamic storage allocation techniques.

**Intermediate code generation [4L]**

Intermediate languages, Graphical representation, Three-address code, Implementation of three address statements (Quadruples, Triples, Indirect triples).

**Code optimization [5L]**

Introduction, Basic blocks & flow graphs, Transformation of basic blocks, Dag representation of basic blocks, The principle sources of optimization, Loops in flow graph, Peephole optimization.

**Code generations [4L]**

Issues in the design of code generator, a simple code generator, Register allocation & assignment.

**Text books:**

1. Aho, Sethi, Ullman - “Compiler Principles, Techniques and Tools” - Pearson Education.

2. Holub - “Compiler Design in C” - PHI.

Contracts:3L

Credits- 3

**Introduction [2]**

Overview of Artificial intelligence- Problems of AI, AI technique, Tic - Tac - Toe problem.

**Intelligent Agents [2]**

Agents & environment, nature of environment, structure of agents, goal based agents, utility based agents, learning agents.

**Problem Solving [2]**

Problems, Problem Space & search: Defining the problem as state space search, production system, problem characteristics, issues in the design of search programs.

**Search techniques [5]**

Solving problems by searching :problem solving agents, searching for solutions; uniform search strategies: breadth first search, depth first search, depth limited search, bidirectional search, comparing uniform search strategies.

**Heuristic search strategies [5]**

Greedy best-first search, A* search, memory bounded heuristic search: local search algorithms & optimization problems: Hill climbing search, simulated annealing search, local beam search, genetic algorithms; constraint satisfaction problems, local search for constraint satisfaction problems.

**Adversarial search [3]**

Games, optimal decisions & strategies in games, the minimax search procedure, alpha-beta pruning, additional refinements, iterative deepening.

**Knowledge & reasoning [3]**

Knowledge representation issues, representation & mapping, approaches to knowledge representation, issues in knowledge representation.

**Using predicate logic [2]**

Representing simple fact in logic, representing instant & ISA relationship, computable functions & predicates, resolution, natural deduction.

**Representing knowledge using rules [3]**

Procedural verses declarative knowledge, logic programming, forward verses backward reasoning, matching, control knowledge.

**Probabilistic reasoning [4]**

Representing knowledge in an uncertain domain, the semantics of Bayesian networks, Dempster-Shafer theory, Fuzzy sets & fuzzy logics.

**Planning [2]**

Overview, components of a planning system, Goal stack planning, Hierarchical planning, other planning techniques.

**Natural Language processing [2]**

Introduction, Syntactic processing, semantic analysis, discourse & pragmatic processing.

**Learning [2]**

Forms of learning, inductive learning, learning decision trees, explanation based learning, learning using relevance information, neural net learning & genetic learning.

**Expert Systems [2]**

Representing and using domain knowledge, expert system shells, knowledge acquisition.

**Basic knowledge of programming language like Prolog & Lisp. [6]**

**Books:**

1. Artificial Intelligence, Ritch & Knight, TMH

2. Artificial Intelligence A Modern Approach, Stuart Russel Peter Norvig Pearson

3. Introduction to Artificial Intelligence & Expert Systems, Patterson, PHI

4. Poole, Computational Intelligence, OUP

5. Logic & Prolog Programming, Saroj Kaushik, New Age International

6. Expert Systems, Giarranto, VIKAS

7. Artificial Intelligence, Russel, Pearson

Contracts:3L

Credits- 3

**Windows concepts and terminology, key elements [11]**

Creating the look, communication via messages, windows resources and functions, adding multimedia and sound resources

Writing windows applications, taking control of windows, adding menus, dialog boxes,
Special controls. Concepts of X-Windows System & programming.

Introduction to Visual Basic & difference with BASIC. Concept about form Project, Application, Tools, Toolbox, Controls & Properties. Idea about Labels, Buttons, Text Boxes.
Data basics, Different type variables & their use in VB, sub-functions & Procedure details, Input box () & Msgbox ().

Making decisions, looping List boxes & Data lists, List Box control, Combo Boxes, data Arrays.
Frames, buttons, check boxes, timer control, Programming with data, built in functions, ODBC data base connectivity.

Data form Wizard, query, and menus in VB Applications, Graphics.

**Dynamic Web Pages [2L]**

The need of dynamic web pages; an overview of DHTML, cascading style sheet (css), comparative studies of different technologies of dynamic page creation

**Active Web Pages [2L]**

Need of active web pages; java applet life cycle.

**Java Script [3L]**

Data types, variables, operators, conditional statements, array object, date object, string object.

**Java Servlet [4L]**

Servlet environment and role, HTML support, Servlet API, The servlet life cycle, Cookies and Sessions.

**JSP [15L]**

JSP architecture, JSP servers, JSP tags, understanding the layout in JSP, Declaring variables, methods in JSP, inserting
java expression in JSP, processing request from user and generating dynamic response for the user, inserting applets and java beans into JSP, using include and forward action, comparing JSP and CGI program, comparing JSP and ASP program; Creating ODBC data source name, introduction to JDBC, prepared statement and callable statement.

**J2EE[7L]**

An overview of J2EE web services, basics of Enterprise Java Beans, EJB vs. Java Beans, basics of RMI, JNI.

**Books:**

1. Win32 API Programming With VB , Roman,SPD/O’REILLY

2.Learn Microsoft VB 6.0 Now,Halvorson, PHI/MSP

3.Visual Basic 6 from the Ground Up, Cornell,TMH

4.Visual Basic 6, CDG, TMH

5. Visual Basic 6,Dietel, Pearson

6.Visual basic 6.0 in 30 days, Krishnan, Scitech

7.Beginning VB 6 ,Wright,SPD/WROX

8. Visual Basic Complete, Prasenjit Sinha, S. Chand

9. Web Technologies - Godbole A. S. & Kahate A., TMH.

10.Web Technology & Design - Xavier C., New Age Publication.

11. Java Server Programming, J2EE edition. (VOL I and VOL II); WROX publishers

12. X-Window System, R.W.Scheifler & J. Gettys, PHI.

Contracts:3L

Credits- 3

**Introduction [3L]**

Financial Management, Financial Planning and Capitalization- definitions, objectives, changing roles and functions, Financial Decision.

**Capital Budgeting [7L]**

Nature of Investment decision, Importance of Capital Budgeting, The Capital. Budgeting Process - Investment Criterion, Pay-back period, Accounting, ROR (Rate of Return) Method, Discounting Cash flow method, Net - presentv value method, IRR (Internal Rate of Return) method, The benefit-Cost Ratio method.

**Management of Working Capital [7L]**
Various concepts, Elements, Classification, Financing and importance of working capital, Investment analysis, Cash flow determination, cost of capital, capital budgeting methods.

**Budgeting Control Technique [5L]**

Concepts of Budget, budgeting and budgetary control, Objectives, Functions, Uses, Advantages, Limitations; Master Budget and Report.

**Cost - Volume - Profit Analysis [8L]**
Classification of costs, Allocation, apportionment and absorption, Cost centers, different costing systems, Cost analysis for managerial decisions, Meaning of Linear CVP analysis, Objectives, Assumptions, Break - Even analysis, determining the Break-Even point profit, Volume graph profit, Volume ratios margin of Safety.

**Introduction to Accounting [8L]**

Basic accounting concepts, important definitions, uses, limitations, advantages; types of Accounting, Financial statements, introduction to Journal Accounting; different types of Vouchers, double entry bookkeeping, different types of transactions related to Financial Accounting.

**Financial Control [7L]**

Posting of Ledgers and preparation of Trial Balance; preparation of Balance Sheet and Profit and Loss Accounts;

Controlling other departments by Financial Accounting (A practical Approach).

**Books:**

1. Financial Management and Accounting - P. K. Jain, S. Chand & Co.

2. Management & Accounting: Principles and Practice - R. K. Sharma & Shashi Kumar Gupta, Kalyani
Publishers.

3. Advanced Management Accounting - Kaplan & Atkinson, PHI.

4. Fundamentals of Financial Management - Van Home, PE.

5. Financial Mgmt Accounting, Gupta,Pearson

6. Financial Mgmt, I.M. Pandey, Vikas

7. Financial Mgmt., Khan & Jain, TMH

8. Financial Mgmt , Mcmenamin, OUP

9. Financial Mgmt & Policy, Van Horne, PHI

10. Financial Mgmt,Kulkarni & Satyaprasad, Himalaya

Credits- 3

**Module I [5]**
Distributed DBMS features and needs. Reference architecture. Levels of distribution transparency, replication. Distributed database design - fragmentation, allocation criteria.

**Module II [10]**

Storage mechanisms. Translation of global queries. / Global query optimisation. Query execution and access plan. Concurrency control - 2 phases locks. Distributed deadlocks. Time based and quorum based protocols. Comparison. Reliability- non-blocking commitment protocols.

**Module III [10]**

Partitioned networks. Checkpoints and cold starts. Management of distributed transactions- 2 phase unit protocols. Architectural aspects. Node and link failure recoveries.

**Module IV [10]**

Distributed data dictionary management. Distributed database administration. Heterogeneous databases-federated database, reference architecture, loosely and tightly coupled.

**Module V [10]**

Alternative architecture. Development tasks, Operation- global task management. Client server databases-SQL server, open database connectivity. Constructing an application.

**Books:**

1. Database System Concepts, Silberschatz Korth, Sudarshan, MH

2. Distributed Database, Tannenbaum, Pearson

3. Principles of Distributed Database Systems, M. Tamerozsu Patrick Valduriez, Pearson

3. Database Management Systems,Ramakrishnan, MH

4. Beginning SQL Server 2000 programming, Dewson,SPD/WROX

6. Database Management Systems, Leon, VIKAS

7. My SQL :Enterprise Solutions, Alexender Pachev, Wiley Dreamtech

Credits- 3

**Module I: 12L**

**Introduction to Genomic data and Data Organization:** Sequence Data Banks - Introduction to sequence date banks - protein sequence data bank. NBFR-PIR, SWISSPROT, Signal peptide data bank, Nucleic acid sequence data bank - GenBank, EMBL nucleotide sequence data bank, AIDS virus sequence data bank. RRNA data bank, structural data banks - protein Data Bank (PDB), The Cambridge Structural Database (CSD) : Genome data bank - Metabolic pathway data : Microbial and Cellular Data Banks.
**Module II: 12L**

**Introduction to MSDN (Microbial Strain Data Network):** Numerical Coding Systems of Microbes, Hibridoma Data Bank Structure, Virus Information System Cell line information system; other important Data banks in the area of Biotechnology/life sciences/biodiversity.

**Sequence analysis:** Analysis Tools for Sequence Data Banks; Pair wise alignment -NEEDLEMAN and Wunsch algorithm, Smith Waterman, BLAST, FASTA algorithms to analyze sequence data: Sequence patterns motifs and profiles.

**Module III: 11L**

**Secondary Structure predictions:** prediction algorithms; Chao-Fasman algorithm, Hidden-Markov model, Neural Networking.

**Tertiary Structure predictions:** prediction algorithms; Chao-Fasman algorithm, Hidden-Markov model, Neural Networking.

**Module IV: 10L**

**Applications in Biotechnology:** Protein classifications, Fold libraries, Protein structure prediction: Fold recognition (threading), Protein structure predictions : Comparative modeling (Homology), Advanced topics: Protein folding, Protein-ligand interactions, Molecular Modeling & Dynamics, Drug Designing.

**Books:**

1. Lesk, Introduction to Bio Informatics, OUP

2. Introduction to Bioinformatics, Atwood, Pearson Education

3. Developing Bioinformatics Computer Skills, Cynthia Gibas and Per Jambeck, 2001 SPD

4. Statistical Methods in Bioinformatics, Springer India

5. Beginning Perl for Bio-informatics, Tisdall, SPD

6. Biocomputing: Informatics and Genome Project, Smith, D.W., 1994, Academic Press, NY

7. Bioinformatics: A practical Guide to the Analysis of Genes and Proteins, Baxevanis, A.D., Quellette, B.F.F., John Wiely & Sons.

8. Murty CSV, Bioinfornmatics, Himalaya

Credits- 3

**Module I [10]**
Introduction : Computational demands on modern science, advent of practical parallel processing, parallel processing terminology.

PRAM algorithms : model of serial computation, PRAM model of parallel computation, PRAM algorithms, reducing the number of processors.

**Module II [10]**

Processes and processors. Processor organizations, Processor arrays, Multiprocessors, Multicomputers, FLYNN’s taxonomy, Shared memory. Fork. Join constructs. Basic parallel programming techniques- loop splitting, spin locks, contention barriers and row conditions.

**Module III [10]**

Variations in splitting, self and indirect scheduling. Data dependency-forward and backward block scheduling. Linear recurrence relations. Backward dependency. Performance tuning overhead with number of processes, effective use of cache.

**Module IV [15]**

Parallel programming examples: Average, mean squared deviation, curve fitting, numerical integration, Matrix multiplication, sorting, travelling salesman problem, Gaussian elimination. Discrete event time simulation. Parallel Programming Languages :Fortran 90, C*,Sequent C, OCCAM,C- Linda, Parallel programming under Unix.

**Books:**

1.Parallel Computing, Quinn,TMH

2.Introduction to Parallel Processing ,Sashi Kumar,PHI

3.Parallel Programming, Wilkinson, Pearson

4.Elements of Parallel Computing, Rajaraman,PHI

5.Fundamentals of Parallel Processing, Jordan, PHI

6. Advanced Computer Architecture, Hwang, TMH

Credits- 3

**Process Synchronization [5]**

Concepts of processes, Concurrent processes, Threads, Overview of different classical synchronization problems, Monitors, Communicating Sequential processes(CSP)

**Process deadlocks [4]**

Introduction, causes of deadlocks, Deadlock handling strategies, Models of deadlock

**Distributed operating system [10]**

Architectures, Issues in Distributed operating systems, Limitations of Distributed Systems, Lamport’s logical clock, Global states, Chandy-Lampert’s global state recording algorithm,Basic concepts of Distributed Mutual Exclusion ,Lamport’s Algorithm, Ricart -Agrawala Algorithm;Basic concepts of Distributed deadlock detection, Distributed File system, Architecture, Design issues, SUN Network File system Basic concepts of Distributed shared memory, Basic concepts of Distrubuted Scheduling, Load balancing, Load sharing

**Distributed OS Implementation [4]**

Models, Naming, Process migration, Remote Procedure Calls.

**Multiprocessor System [6]**

Motivation, Classification, Multiprocessor Interconnections, Types, Multiprocessor OS functions & requirements; Design & Implementation Issue; Introduction to parallel programming; Multiprocessor Synchronization.

**Performance, Coprocessors, RISC & data flow [5]**

Introduction, Necessity, Measures, Techniques, Bottlenecks & Saturation, Feedback loops, Coprocessors, RISC.

**Analytic Modeling [5]**

Introductions, Queing Theory, Markov Process

**Security & Protection [6]**

Security-threats & goals, Penetration attempts, Security Policies & mechanisms, Authentication, Protections & access control Formal models of protection, Cryptography, worms & viruses.

**Books:**

1) Operating Systems Concepts & design - Milan Milenkovic, TMH

2) Operating System - H.M. Deitel, Pearsons .

3) Advanced Concepts in operating Systems - Mukesh Singhal and Niranjan G. Shivaratri, TMH

Credits- 3

**Module I [12]**

Introduction

• historical perspective

• algorithmic background

• geometric preliminaries

• initial forays

Convex hulls

• problem statement and lower bounds

• convex hull algorithms

• convex hulls in >2 dimensions

• extensions and applications

**Module II [18]**

Polygon approximation

• triangular approximations

• k-gonal approximations

• restricted approximations

• other criteria of approximation

Geometric searching

• point-location problems

• range-searching problems

**Module III [15]**

Proximity

• Typical problems and lower bounds

• Closest pair problem

• Voronoi diagrams

• Minimum spanning trees

• Triangulations

Miscellaneous problems

• (More) Art gallery problems

• Intersections

• Pattern recognition

• Parallel computational geometry

**Books:**

1. Laszlo, Computational Geometry, PHI

2. M.de Berg, Computational Geometry-algorithms & applications,Springer India

Credits- 3

**Module I [12]**

The notion of system, model, simulation. Types of simulations. Illustrative examples. Conceptual and
computer models. Verification and validation of models. Simulation experiment. Simulation project
life cycle. Description of simulation models. Structure vs. behaviour models. Classification of tasks
solved within the modeling and simulation process. Detailed example introduction: database server as a typical queuing system.

Description of discrete-event systems behaviour. Modeling of time. The notion of status, event, activity, process and their interdependencies. Object-oriented model design. Simulation time, control of time advancement, event list. Event driven simulation algorithm.
Detailed example: implementation of the database server as a queuing system.

Random numbers in simulation. Random variables with discrete and continuous probability distribution. Pseudo-random generators. Multiplicative and additive congruential method. Nonuniform random numbers.

**Module II [10]**

Testing of pseudo-random generators. Monte Carlo method. Precision. Queueing systems. Entities:
queues, service facilities, storages. Properties of input and output stream. Kendall classification of
queueing systems. Entity behaviour and statistical data sampling during the simulation run.

Discrete and continuous Markov model. Birth -Death processes.

Steady-state queueing systems of types M/M/1, M/M/? , M/M/m, M/Er/1, Er/M/1 and their variants.

**Module III [10]**

Models M/G/1, G/M/1, G/M/m, G/G/1, G/D/1, M+D/D/1. Closed systems and queueing networks.

Simulation languages for discrete-event systems. Case study and comparison: Simscript, GPSS, SOL.

**Module IV [13]**

Case study and comparison: Simula 67. Object oriented design and implementation of simulation
models. Persistence of objects in C++, case studies. Application in a simulation system.

Simulation experiments. Preparation and pre-processing of input data. Statistical data collected during the simulation run. Time dependency of statistics. Histograms. Evaluation and interpretation of results. Model validation and verification.

Simulation of digital systems. Abstractions levels of digital system description. Models of signals and functions. Structure vs. behaviour. Models of components. Models of delays.

Digital systems simulators - methods of implementation. Flow of simulation time. Synchronous and
asynchronous algorithm of digital systems simulation. Acceleration of simulation run.

Register-transfer level simulation. Simulation languages of HDL type. VHDL language and tools.
Implementation of concurrent statements and processes in VHDL. Modeling of time and event list.

**Textbooks:**

1.Law, A.M., Kelton, W.D.: Simulation Modeling and Analysis. McGraw-Hill, New York, 2-nd edition, 1991. ISBN 0-07-100803-9.

2. Basmadjian, Mathematical Modeling of Physical Systems, OUP

3. Brewmaud, Markov Chains; With Gibbs Field , Monte Carlo Simulation & Ques, Springer Verlag

4.Hoover,S.V., Perry,R.F.: Simulation: a Problem-Solving Approach. Addison - Wesley, 1990. ISBN 0-201-16880-4.

5.Zeigler,B.P.: Theory of Modeling and Simulation. John Wiley, New York,1976. Re-published Krieger Publ., Malabar, 1985.

6.Fishwick,P.A.: Simulation Model Design and Execution: Building Digital Worlds. Prentice Hall, Englewood Cliffs,1995.

7.Kleinrock, L.: Queuing Systems Vol.I, Vol.II, Wiley & Sons, London, 1975.

8. First Course in Mathematical Modeling, Giordano, Vikas

Credits- 3

**Introduction [5L]**

Background, Digital Image Representation, Fundamental steps in Image Processing, Elements of Digital Image Processing - Image Acquisition, Storage, Processing, Communication, Display.

**Digital Image Formation [6L]**

A Simple Image Model, Geometric Model- Basic Transformation (Translation, Scaling, Rotation), Perspective Projection, Sampling & Quantization - Uniform & Non uniform.

**Mathematical Preliminaries [7L]**

Neighbour of pixels, Connectivity, Relations, Equivalence & Transitive Closure; Distance Measures, Arithmetic/Logic Operations, Fourier Transformation, Properties of The Two Dimensional Fourier Transform, Discrete Fourier Transform, Discrete Cosine & Sine Transform.

**Image Enhancement [8L]**

Spatial Domain Method, Frequency Domain Method, Contrast Enhancement -Linear & Nonlinear Stretching,
Histogram Processing; Smoothing - Image Averaging, Mean Filter, Low-pass Filtering; Image Sharpening. High-pass Filtering, High-boost Filtering, Derivative Filtering, Homomorphic Filtering; Enhancement in the frequency domain - Low pass filtering, High pass filtering.

**Image Restoration [7L]**

Degradation Model, Discrete Formulation, Algebraic Approach to Restoration - Unconstrained & Constrained; Constrained Least Square Restoration, Restoration by Homomorphic Filtering, Geometric Transformation - Spatial Transformation, Gray Level Interpolation.

**Image Segmentation [7L]**

Point Detection, Line Detection, Edge detection, Combined detection, Edge Linking & Boundary Detection - Local Processing, Global Processing via The Hough Transform; Thresholding - Foundation, Simple Global Thresholding, Optimal Thresholding; Region Oriented Segmentation - Basic Formulation, Region Growing by Pixel Aggregation, Region Splitting & Merging.

**An Overview of GIS [5L]**

Definition of GIS, Features & Functions, GIS as an Information System, GIS & Cartography, GIS data feeds, Historical development of GIS.

**Books:**

1. Digital Image Processing, Gonzalves,Pearson

2. Digital Image Processing, Jahne, Springer India

3.Digital Image Processing & Analysis,Chanda & Majumder,PHI

4.Fundamentals of Digital Image Processing, Jain, PHI

5.Image Processing, Analysis & Machine Vision, Sonka, VIKAS

6. Getting Started with GIS- Clarke Keith. C; PE.

7. Concepts & Techniques of GIS - Lo C.P, Albert, Yeung K.W- PHI.

Programming Languages such as PROLOG & LISP

Problems pertaining to CS-703

Contracts:3L

Credits- 3

Science, Technology and Engineering as Knowledge and as Social and Professional Activities **[2L]**

**Effects of Technological Growth: [15L]**

Rapid Technological growth and depletion of resources. Reports of the Club of Rome. Limits to growth; sustainable development. Energy Crisis; Renewable Energy Resources.
Environmental degradation and pollution. Eco-friendly Technologies. Environmental Regulations. Environmental Ethics. Appropriate Technology Movement of Schumacher: later developments. Technology and developing nations. Problems of Technology transfer. Technology assessment/ impact analysis; Industrial hazards and safety, safety regulations safety engineering. Politics and technology, authorization versus democratic control of technology; Human Operator in Engineering projects and industries. Problems of man machine interaction. Impact of assembly line and automation. Human centred Technology

**Ethics of Profession: [8L]**

Engineering profession: Ethical issues in engineering practice. Conflicts between business demands and professional ideals. Social and ethical Responsibilities of Technologists. Codes of professional ethics. Whistle blowing and beyond. Case studies.

**Profession and Human Values [14L]**

Value Crisis in contemporary society. Nature of values: Value Spectrum of a ‘good’ life Psychological values: Integrated personality; mental health. Societal values: The modern search for a ‘good’ society, justice, democracy, secularism, rule of law; values in Indian Constitution. Aesthetic values: Perception and enjoyment of beauty, simplicity, clarity Moral and ethical values: Nature of moral judgments; canons of ethics; Ethics of virtue; ethics of duty; ethics of responsibility. Work ethics, professional ethics.

**Books:**

1.Blending the best of the East & West, Dr. Subir Chowdhury, EXCEL

2.Ethics & Mgmt. & Indian Ethos, Ghosh, VIKAS

3.Business Ethics,Pherwani,EPH

4.Ethics,Indian Ethos & Mgmt., Balachandran,Raja,Nair, Shroff Publishers

5.Business Ethics: concept and cases, Velasquez, Pearson

Contracts:3L

Credits- 3

**Human Resource Management: [8L]**

Recruitment and selection, Performance appraisal, Industrial Relations, Trade Union, Collective Bargaining

**Organizational Behaviour: [8L]**

Different Schools of Management Thought : Scientific Management, Administrative Theory, Theory of Bureaucracy, Human Relations Theory(Elton Mayo).

Motivation: Concept, Different Theories (Maslow, ERG, Herzberg)

Communication: Purpose, process, Barriers to effective communication, Guidelines to make communication effective.

Perception: Process, Importance, Factors influencing perception, Shortcuts for judging people- Halo effect, Stereotyping, Projection.

**Quality Management: [6L]**

Concept, Dimensions for goods and services, Cost of Quality, Statistical Quality Control, Control Charts, Acceptance Sampling (single).

Total Quality Management: Concept, benefits, Criticism.

New Quality Tools: Kaizen, Six Sigma, Quality Circles.

**Productions Management: [5L]**

Concept. Difference from Operations Management, Types of Production( Mass, Batch, Project), Functions of Production Management.

Productivity: Concept, Different Inputs and Productivity Measures, Effeciency and Effectiveness, Measures to increase Productivity.

**Marketing Management: [6L]**

Basic Concepts of Marketing, Difference between Selling and Marketing, Elements of Marketing Mix- the 4 P’s.

Marketing Environment: Mega Environment, Micro Environment, Internal Environment, Relevant Environment. Simple Marketing Strategies: SWOT Analysis, BCG Matrix, Industry Matrix.

**Materials Management: [6L]**

Concept, Functions, EOQ Models- Wilson model, model with shortage, model with quantity discount, model without shortage , Selective Inventory Control—ABC, VED, FSN analysis

**Books:**

1. Industrial Management, Vol.1 L.C. Jhamb, EPH

2. Industrial Relations, Trade Unions & Labour Legislation - Sinha, Pearson Education Asia

3. Organizational Behaviour, S.P. Robbins, Prentice Hall

4. Productions and Operations Management, S. N. Chary, TMH

5. Marketing Management, Phillip Kotler, Prentice Hall/Pearson Education.

6. Productions and Operations Management, Joseph Monks,TMH

Contracts:3L

Credits- 3

Robot Anatomy Arm Geometry-Direct & Inverse Kinematics Problem.Arm Dynamics,D Alembert Equations of
Motion, Synthesis of elements with movalulity constraints,manipulations-trajectory planning,joint interpolated trajectories. **[15L]**

Control of Robot Manipulation-computed torque technique sequencing & adaptive control, resolved motion control Moluie Robots. **[6L]**

Robot sensing-Range & Proximity & Higher-Level vision, illumination techniques,Imaging Geometry, Segmentation Recognition & Interpretation. **[8L]**

Robot Programming Language Characteristics of Robot Level & Task Level languages.Robot intelligence-State Space search, Robot learning,Robot Task Planning,Knowledge Engineering.**[10L]**

**References:**

1. K.S Fu R.C . CSG Lee-Robotics Control,Sensing, Vision & Intelligence,McGraw-Hill.

2. M.P. Groover,M.Weins,R.N. Nagel,N.C. Odrey –Industrial Robotics,McGraw Hill

3. Andrew C.Straugard-Robotics & AI,PHI

4. S. Sitharama Iyengar,Alberto Elefes-Autonomous Mobile Robots Control,Planning & Achitecture,IEEE
Computer Society Press

Contracts:3L

Credits- 3

**Introduction to artificial neural network [10L]**
Neural Networks: History, overview of biological Neuro-system, Mathematical Models of Neurons, ANN architecture, Learning rules, Learning Paradigms-Supervised, Unsupervised and reinforcement Learning, ANN training Algorithmsperceptions, Training rules, Delta, Back Propagation Algorithm, Multilayer Perceptron Model, Applications of Artificial Neural Networks. Competitive learning networks, Kohonen self organizing networks, Hebbian learning; Hopfield Networks, Associative Memories, The boltzman machine; Applications.

**Fuzzy Logic [12L]**

Fuzzy Logic: Introduction to Fuzzy Logic, Classical and Fuzzy Sets: Overview of Classical Sets, Membership Function, Fuzzy rule generation. Operations on Fuzzy Sets: Compliment, Intersections, Unions, Combinations of Operations, Aggregation Operations. Fuzzy Arithmetic: Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on Intervals & Numbers, Lattice of Fuzzy Numbers, Fuzzy Equations.Fuzzy Logic: Classical Logic. Genetic algorithms(Gas),Evolution strategies(Ess),Evolutionary programming(EP),Genetic Programming(GP),Selecting,crossover,mutation,schema analysis,analysis of selection algorithms;convergence;

**Markov & other stochastic models.[10L]**

**Other Soft computing approaches [7L]**

Simulated Annealing, Tabu Search, Ant colony based optimisation, etc.

**Text:**

1. “Neuro-Fuzzy and Soft computing”, Jang, Sun, Mizutani, Pearson

2. “Neural networks: a comprehensive foundation”, Haykin, Pearson

3. “Genetic Algorithms”, Goldberg, Pearson

4. “Fuzzy Sets & Fuzzy Logic”, G.J. Klir & B. Yuan, PHI.

**Reference:**

1. “An Introduction to Neural Networks”, Anderson J.A., PHI, 1999.

2. “Introduction to the Theory of Neural Computation”, Hertz J. Krogh, R.G. Palmer, Addison-Wesley,
California, 1991.

3. “An Introduction to Genetic Algorithm”, Melanie Mitchell, PHI, 1998.

4. “Neural Networks-A Comprehensive Foundations”, Prentice-Hall International, New Jersey, 1999.

5. “Neural Networks: Algorithms, Applicati

Contracts:3L

Credits- 3

Introduction, Overview of digital signal processing **[2L]**

Review of :Discrete – Time linear system, Sequences, arbitrary sequences, linear time invariant system, causality, stability. Difference equation, relation between continuous and discrete system. Classifications of sequence, recursive
and non-recursive system. **[4L]**

Review of :Mathematical operations on sequences: Convolution, graphical and analytical techniques, overlap and add methods, matrix method, some examples and solutions of LTI systems, MATLAB examples. **[2L]**

Z-transform: Definition, relation between Z transform and Fourier transform of a sequence, properties of Z transform, mapping between S-plane and Z-plane. Unit circle, convergence and ROC, Inverse Z-transform, solution of difference equation using the one sided Z-transform MATLAB examples.
**[7L]**

Discrete Fourier transform: Definition, inverse discrete Fourier transform (IDFT) Twiddle factor, linear transformation, basic properties, circular convolution, multiplication of DFT, linear filtering using DFT, filtering of long data sequences, overlap add and save method. Computation of DFT, Fast Fourier transform (FFT), FFT algorithm, Radix 2 algorithm. Decimation-in-time and decimation-in- frequency algorithm, signal flow graph, butterflies, Chirp z-transform algorithm, MATLAB examples.
**[12L]**

Digital filter realization: Principle of digital filter realization, structures of All-zero filters. Design of FIR (Finite impulse response) filters, linear phase, windows-rectangular, Berlitt, Hanning, Hamming and Blackman. Design of infinite impulse response filters (IIR) from analog filters. Bilinear transformation, Butterworth, Chebyshev, Elliptic filters. Optimisation method of IIR filters. Some example of practical filter design. Computer aided filter design, MATLAB examples . **[12L]**

**Text:**

1. “Digital Signal Processing”, Ifeachor, Pearson

2. “Understanding Digital Signal Processing”, R. G. Lyons, Pearson

3. “Theory and Application of Digital Signal Processing”, L.R. Rabiner & B.Gold, PHI

4. “Digital Signal Processing, Principles, Algorithms and Applications”, J.G. Proakis & D.G. Manolakis, PHI

5. “Digital Signal Processing”, S. Salivahanan et al, TMH

**Reference:**

1. Digital Signal Processing, Chen, OUP

2. Digital Signal Processing with FPGA, Meyer-Basse U, Spriger India

3. Digital Signal Processing using MATLAB, Ingle, Vikas

4. Digital Signal Processing , Babu R, Scitech

5. Digital Signal Processing - A Computer based approach, S.K.Mitra, TMH

6. Digital Signal Processing, Xavier, S. Chand

7. Digital Signal Processing Applications, Pradhan, Jaico

Contracts:3L

Credits- 3

Introduction to CMOS circuits: MOS Transistors, MOS transistor switches, CMOS Logic, The inverter, Combinational Logic, NAND gate, NOT Gate, Compound Gates, Multiplexers, Memory-Latches and Registers.
**[6L]**

Processing Technology: Silicon Semiconductor Technology- An Overview, wafer processing, oxidation, epitaxy deposition, Ion-implantation and diffusion, The Silicon Gate Process- Basic CMOS Technology, basic n-well CMOS process, p-well CMOS process, Twin tub process, Silicon on insulator, CMOS process enhancement-Interconnect, circuit elements, 3-D CMOS. Layout Design Rule: Layer Representations, CMOS n-well Rules, Design Rule of background scribe line, Layer Assignment, SOI Rule **[10L]**

.Power Dissipation: Static dissipation, Dynamic dissipation, short-circuit dissipation, total power dissipation. Programmable Logic, Programmable Logic structure, Programmable interconnect, and Reprogramable Gate Array: Xilinx Programmable Gate Array, Design Methods: Behavioural Synthesis, RTL synthesis **[8L]**

Placement: placement: Mincut based placement – Iterative improvement placement simulated annealing. Routing: Segmented channel routing – maze routing – routability and routing resources – net delays. **[5L]**

Verification and Testing: Verification Versus Testing, Verification: logic simulation design validation – timing verification – Testing concepts: failures – mechanisms and faults – fault coverage – ATPG methods – types of tests – FPGAs – programmability failures – design for testability. **[5L]**

**Overview of VHDL [5L]**

**Text Book:**

1.“Digital Integrated Circuit”, J.M.Rabaey, Chandrasan, Nicolic, Pearson

2. “CMOS Digital Integrated Circuit”, S.M.Kang & Y.Leblebici, TMH

3.”Modern VLSI Design” Wayne Wolf, Pearson

4.“Algorithm for VLSI Design & Automation”, N.Sherwani, Kluwer

5.”VHDL”, Bhaskar, PHI

**References:**

1. “ Digital Integrated Circuits” Demassa & Ciccone, Willey Pub.

2. “Modern VLSI Design: system on silicon” Wayne Wolf; Addison Wesley Longman Publisher

3. “Basic VLSI Design” Douglas A. Pucknell & Kamran Eshranghian; PHI

4. “CMOS Circuit Design, Layout & Simulation”, R.J.Baker, H.W.Lee, D.E. Boyee, PHI

Contracts:3L

Credits- 3

**Electronic Commerce :** Overview, Definitions, Advantages & Disadvantages of E – Commerce,
Threats of E – Commerce, Managerial Prospective, Rules & Regulations For Controlling E –
Commerce, Cyber Laws.**[3L]**

**Technologies :** Relationship Between E – Commerce & Networking, Different Types of Networking For
E – Commerce, Internet, Intranet & Extranet, EDI Systems Wireless Application Protocol : Definition, Hand Held Devices, Mobility & Commerce, Mobile Computing, Wireless Web, Web Security, Infrastructure Requirement For E – Commerce .**[5L]**

**Business Models of e – commerce :** Model Based On Transaction Type, Model Based On Transaction Party - B2B, B2C, C2B, C2C, E – Governance. **[2L]**

**E – strategy :** Overview, Strategic Methods for developing E – commerce. **[2L]**

**Four C’s :** ( Convergence, Collaborative Computing, Content Management & Call Center ).

Convergence : Technological Advances in Convergence – Types, Convergence and its implications,

Convergence & Electronic Commerce. Collaborative Computing : Collaborative product development, contract as per CAD, Simultaneous Collaboration, Security.

Content Management : Definition of content, Authoring Tools & Content Management, Content –
partnership, repositories, convergence, providers, Web Traffic & Traffic Management ; Content
Marketing.

Call Center : Definition, Need, Tasks Handled, Mode of Operation, Equipment , Strength &
Weaknesses of Call Center, Customer Premises Equipment (CPE). **[6L]**

**Supply Chain Management :** E – logistics, Supply Chain Portal, Supply Chain Planning Tools (SCP
Tools), Supply Chain Execution (SCE), SCE - Framework, Internet’s effect on Supply Chain Power.**[3L]**

**E – Payment Mechanism :** Payment through card system, E – Cheque, E – Cash, E – Payment Threats
& Protections. **[1L]**

**E – Marketing :** Home –shopping, E-Marketing, Tele-marketing **[1L]**

**Electronic Data Interchange (EDI) :** Meaning, Benefits, Concepts, Application, EDI Model, Protocols (UN EDI FACT / GTDI, ANSI X – 12), Data Encryption (DES / RSA). **[2L]**

**Risk of E – Commerce :** Overview, Security for E – Commerce, Security Standards, Firewall,
Cryptography, Key Management, Password Systems, Digital certificates, Digital signatures. **[4L]**

**Enterprise Resource Planning (ERP) :** Features, capabilities and Overview of Commercial Software,
re-engineering work processes for IT applications, Business Process Redesign, Knowledge engineering and data warehouse .

Business Modules: Finance, Manufacturing (Production), Human Resources, Plant Maintenance, Materials Management, QualityManagement, Sales & Distribution ERPPackage.

ERP Market: ERP Market Place, SAP AG, PeopleSoft, BAAN, JD Edwards, Oracle Corporation

ERP-Present and Future: Enterprise Application Integration (EAI), ERP and E-Commerce, ERP and Internet, Future Directions in ERP **[10]**

**Reference :**

1. E-Commerce,M.M. Oka, EPH

2. Kalakotia, Whinston : Frontiers of Electronic Commerce , Pearson Education.

3. Bhaskar Bharat : Electronic Commerce - Technologies & Applications.TMH

4. Loshin Pete, Murphy P.A. : Electronic Commerce , Jaico Publishing Housing.

5. Murthy : E – Commerce , Himalaya Publishing.

6. E – Commerce : Strategy Technologies & Applications, Tata McGraw Hill.

7. Global E-Commerce, J. Christopher & T.H.K. Clerk, University Press

8. Beginning E-Commerce, Reynolds, SPD

9. Krishnamurthy, E-Commerce Mgmt, Vikas

Contracts:3L

Credits- 3

**Introduction (4L):**

Examples; The nature of statistical pattern recognition; Three learning paradigms;
The sub-problems of pattern recognition; The basic structure of a pattern recognition
system; Comparing classifiers.

**Bayes Decision Theory (7L):**

General framework; Optimal decisions; Classification; Simple performance bounds.

**earning - Parametric Approaches (4L):**L

Basic statistical issues; Sources of classification error; Bias and variance; Three approaches to classification: density estimation, regression and discriminant analysis; Empirical error criteria; Optimization methods; Failure of MLE.

**Parametric Discriminant Functions (4L):** Linear and quadratic discriminants; Shrinkage; Logistic classification; Generalized linear classifiers; Perceptrons; Maximum Margin; Error Correcting Codes.

**Error Assessment (4L):**

Sample error and true error; Error rate estimation; Confidence intervals; Resampling methods; Regularization; Model selection; Minimum description length; Comparing classifiers.

**Nonparametric Classification (4L):** Histograms rules; Nearest neighbor methods; Kernel approaches; Local polynomial fitting; Flexible metrics; Automatic kernels methods.

**Feature Extraction (6L):**

Optimal features; Optimal linear transformations; Linear and nonlinear principal components; Feature subset selection; Feature Extraction and classification stages, Unsupervised learning and clustering, Syntactic pattern recognition, Fuzzy set Theoretic approach to PR.

**Margins and Kernel Based Algorithms (3L):**

Advanced algorithms based on the notions of margins and kernels

**Applications of PR (3L):**

Speech and speaker recognition, Character recognition, Scene analysis.

Contracts:3L

Credits- 3

Introduction to Personal Communications Services (PCS): PCS Architecture, Mobility management, Networks signalling. Global System for Mobile Communication (GSM) system overview: GSM Architecture, Mobility
management, Network signalling. **[5L]**

General Packet Radio Services (GPRS): GPRS Architecture, GPRS Network Nodes. Mobile Data Communication: WLANs (Wireless LANs) IEEE 802.11 standard, Mobile IP. **[5L]**

Wireless Application Protocol (WAP): The Mobile Internet standard, WAP Gateway and Protocols, wireless mark up Languages (WML). Wireless Local Loop(WLL): Introduction to WLL Architecture, wireless Local Loop Technologies. **[7L]**

Third Generation (3G) Mobile Services: Introduction to International Mobile Telecommunications 2000 (IMT 2000) vision, Wideband Code Division Multiple Access (W-CDMA), and CDMA 2000, Quality of services in 3G. **[7L]**

Global Mobile Satellite Systems; case studies of the IRIDIUM and GLOBALSTAR systems. Wireless Enterprise Networks: Introduction to Virtual Networks, Blue tooth technology, Blue tooth Protocols. **[7L]**

Server-side programming in Java, Pervasive web application architecture, Device independent example application **[8L]**

**Text :**

1. “Pervasive Computing”, Burkhardt, Pearson

2. “Mobile Communication”, J. Schiller, Pearson

3. “Wireless and Mobile Networks Architectures”, Yi-Bing Lin & Imrich Chlamtac, John Wiley & Sons, 2001

4. “Mobile and Personal Communication systems and services”, Raj Pandya, Prentice Hall of India, 2001.

**Reference :**

1. “Guide to Designing and Implementing wireless LANs”, Mark Ciampa, Thomson learning, Vikas Publishing House, 2001.

2. “Wireless Web Development”, Ray Rischpater, Springer Publishing.

3. “The Wireless Application Protocol”, Sandeep Singhal, Pearson.

4. “Third Generation Mobile Telecommunication systems”, by P.Stavronlakis, Springer Publishers.

Contracts:3L

Credits- 3

Introduction-defining Real time systems,Embedded Real Time Systems,Special Characteristics of real time systems,a brief evolutionary history. Hardware Architectures of Real Time systems. **[12L]**

Software architectures(concepts of interrupt driven activation,need for real time monitor,pseudo parallelism),meeting of dead lines & real time constraints.**[5L]**

Overview of WARD & MELLOR Methodology: Ward & Mellor Life Cycle,the essential model step,the
implementation model,real time extensions of DFD **[10L]**

Real time languages: overview of ADA/Java Extension **[4L]**

Real time Operating Systems . **[4L]**

System Development Methodologies. **[4L]**

**Text :**

1. “Embedded System Design” Frank Vahid & Tony Givargis; John Wiley & sons, Inc.

2. “Real – Time Systems and software”Alan C. Shaw ; John Wiley & Sons Inc

3. “Fundamentals of embedded Software”, Daniel W. Lewis, Pearson

4. “Real time Systems”, J. W. S. Liu, Pearson

5. “Embedded Realtime System Programming”, S. V. Iyer and P. Gupta, TMH

**References:**

1. “An Embedded System Primer” David E. Simon; Addison-Wesley Pub

2. “Embedded System Design” Steve Heath; Butterworth-Heinemann Pub.

3.”Embedded System Computer Architecture” Graham Wilson, Butterworth-Heinemann.

Contracts:3L

Credits- 3

**Introduction and Overview of Geographic Information Systems [3L]**

Definition of a GIS, features and functions; why GIS is important; how GIS is applied; GIS as an Information System; GIS and cartography; contributing and allied disciplines; GIS data feeds; historical development of GIS.**GIS and Maps, Map Projections and Coordinate Systems [4L]**

Maps and their characteristics (selection, abstraction, scale, etc.); automated cartography versus GIS; map projections; coordinate systems; precision and error.**Data Sources, Data Input , Data Quality and Database Concepts [3L]**

Major data feeds to GIS and their characteristics: maps, GPS, images, databases, commercial data; locating and evaluating data; data formats; data quality; metadata. Database concepts and components; flat files; relational database systems; data modeling; views of the database; normalization; databases and GIS.**Spatial Analysis [3L]**

Questions a GIS can answer; GIS analytical functions; vector analysis including topological overlay; raster analysis; statistics; integrated spatial analysis.**Making Maps [6L]**

Parts of a map; map functions in GIS; map design and map elements; choosing a map type; producing a map formats, plotters and media; online and CD-ROM distribution; interactive maps and the Web.

**Implementing a GIS [4L]**

Planning a GIS; requirements; pilot projects; case studies; data management; personnel and skill sets; costs and benefits; selecting a GIS package; professional GIS packages; desktop GIS; embedded GIS; public domain and lowcost packages.**Technology & Instruments involved in GIS & Remote Sensing [8L]**

GIS applications; GIS application areas and user segments; creating custom GIS software applications; user interfaces; case studies. Future data; future hardware; future software; Object-oriented concepts and GIS; future issues – data ownership, privacy, education; GIS career options and how to pursue them.**Remote Sensing [8L]**

Remote sensing of environment, E.M. Principle, Thermal infrared remote sensing, Remote sensing of Vegetation, Remote sensing of water, urban landscape

**Text:**

1. “Principles of geographical information systems”, P. A. Burrough and R. A. Mcdonnel, Oxford.

2. “Remote sensing of the environment” , J. R. Jensen, Pearson

**References:**

1. “Exploring Geographic Information Systems”, Nicholas Chrismas, John Wiley & Sons.

2. “Getting Started with Geographic Information Systems”,Keith Clarke, PHI.

3. “An Introduction to Geographical Information Systems”, Ian Heywood, Sarah Cornelius, and Steve
Carver. Addison-Wesley Longman.

Contracts:3L

Credits- 3

**Introduction [3]**

Attacks, Services, Mechanisms, Security Attacks, Security Services, Model for Network Security

**Conventional Encryption and Message Confidentiality [8]**

Conventional Encryption Principles, Conventional Encryption Algorithms, Location of Encryption Devices, Key Distribution

**Public Key Cryptography and Message Authentication [8]**

Approaches to Message Authentication, SHA-1, MD5, Public-Key Cryptography Principles, RSA, Digital Signatures, Key Management

**Network Security Applications [4]**

Kerberos Motivation, Kerberos Version 4, PGP Notation, PGP Operational Description

**IP Security [2]**

IP Security Overview, IP Security Architecture, Authentication Header

**Web Security [7]**

Web Security Threats, Web Traffic Security Approaches, Overview of Secure Socket Layer and Transport Layer Security, Overview of Secure Electronic Transaction

**Intruders and Viruses [4]**

Intruders, Intrusion Techniques, Password Protection, Password Selection Strategies, Intrusion Detection, Malicious Programs, Nature of Viruses, Types of Viruses, Macro Viruses, Antivirus Approaches

**Firewalls [3]**

Firewall Characteristics, Types of Firewalls, Firewall Configuration

**Text :**

1. “Network Security Essentials: Applications and Standards” by William Stallings, Pearson

2. “Network Security private communication in a public world”, C. Kaufman, R. Perlman and M. Speciner,
Pearson

**Reference :**

1. “Cryptography and Network Security”, William Stallings, 2nd Edition, Pearson Education Asia

2. “Designing Network Security”, Merike Kaeo, 2nd Edition, Pearson Books

3. “Building Internet Firewalls”, Elizabeth D. Zwicky, Simon Cooper, D. Brent Chapman, 2nd Edition, Oreilly

4. “Practical Unix & Internet Security”, Simson Garfinkel, Gene Spafford, Alan Schwartz, 3rd Edition, Oreilly

Contracts:3L

Credits- 3

Client & server side programming.

Enterprise architecture styles: Single tier , 2-tier , 3-tier, n-tier; Relative comparison of the different layers of architectures.

MVC Architecture: Explanation, Need, Drawbacks, J2EE WEB SERVICES, Different components & containers. **[4L]**

Servlet: Introduction, Advantages over CGI, How it works?, Servlet life cycle, Servlet API (Different interfaces & classes of generic servlet & HTTP servlet), Accessing user information by means of Request & Response, Servlet session management techniques and relative comparison. **[4L]**

JSP: Introduction, Comparison between JSP & servlet., Architecture/Life cycle, Different types of JSP architectures and relative comparison.; JSP tags ,Directives, Scripting elements, Actions; JSP implicit objects, Accessing user information using implicit objects. **[5L]**

EJB :Introduction, Comparison of EJB & Java Beans , Applications, Drawbacks, Different types of enterprise beans ,Services provided by EJB container. **[5L]**

RMI: Introduction and applications, Architecture ,Use of RMI Registry.

JNDI: Introduction and applications, Comparison between LDAP and JNDI

JDO (Java Data Objects): Introduction, Integration of EJB and JDO, JDO & RMI

JINI :Introduction, Applications **[5L]**

JDBC: Introduction, Database driver ,Different approaches to connect an application to a database server, Establishing a database connection and executing SQL statements, JDBC prepared statements, JDBC data sources. **[5L]**

XML: Java & XML, XML syntax, Document type definition., Parsers, SAX parsers, DOM parsers, SAX vs. Dom,
JAXP and JAXB. **[8L]**

**Text :**

1. “Professional JAVA Server Programming”, Allamaraju and Buest ,SPD Publication

2. “Beginning J2EE 1.4” Ivor Horton, SPD Publication.

3. “Advanced Programming for JAVA 2 Platform” Austin and Pawlan, Pearson

**Reference Books:**

1. Internet & Java Programming by Krishnamoorthy & S. Prabhu(New Age Publication)

Contracts:3L

Credits- 3

**Introduction to NLP [2L]:**

Definition, issues and strategies, application domain, tools for NLP, Linguistic organisation of NLP, NLP vs PLP.

**Word Classes [13L]:**

Review of Regular Expressions, CFG and different parsing techniques **1L**

Morphology: Inflectional, derivational, parsing and parsing with FST, Combinational Rules **3L**

Phonology: Speech sounds, phonetic transcription, phoneme and phonological rules, optimality theory, machine learning of phonological rules, phonological aspects of prosody and speech synthesis. **4L**

Pronunciation, Spelling and N-grams: Spelling errors, detection and elimination using probabilistic models, pronunciation variation (lexical, allophonic, dialect), decision tree model, counting words in Corpora, simple N-grams, smoothing (Add One, Written-Bell, Good-Turing), N-grams for spelling and pronunciation. **5L**

**Syntax [7L]:**

POS Tagging: Tagsets, concept of HMM tagger, rule based and stochastic POST, algorithm for HMM tagging, transformation based tagging **4L**

Sentence level construction & unification: Noun phrase, co-ordination, sub-categorization, concept of feature structure and unification. **3L**

**Semantics [9L]:**

Representing Meaning: Unambiguous representation, canonical form, expressiveness, meaning structure of language, basics of FOPC **2L**

Semantic Analysis: Syntax driven, attachment & integration, robustness **2L**

Lexical Semantics: Lexemes (homonymy, polysemy, synonymy, hyponymy), WordNet, internal structure of words, metaphor and metonymy and their computational approaches **3L**

Word Sense Disambiguation: Selectional restriction based, machine learning based and dictionary based approaches. **2L**

**Pragmatics[8L]:**

Discourse: Reference resolution and phenomena, syntactic and semantic constraints on Coreference, pronoun resolution algorithm, text coherence, discourse structure **4L**

Dialogues: Turns and utterances, grounding, dialogue acts and structures **1L**

Natural Language Generation: Introduction to language generation, architecture, dicourse planning (text schemata, rhetorical relations). **3L**

**Text Book:**

1. D. Jurafsky & J. H. Martin – “Speech and Language Processing – An introduction to Language processing,

2. Computational Linguistics, and Speech Recognition”, Pearson Education

**Reference Books:**

1. Allen, James. 1995. – “Natural Language Understanding”. Benjamin/Cummings, 2ed.

2. Bharathi, A., Vineet Chaitanya and Rajeev Sangal. 1995. Natural Language Processing- “A Pananian Perspective”. Prentice Hll India, Eastern Economy Edition.

3. Eugene Cherniak: “Statistical Language Learning”, MIT Press, 1993.

4. Manning, Christopher and Heinrich Schütze. 1999. “Foundations of Statistical Natural Language Processing”. MIT Press.