You are on page 1of 74

BE (Information Technology

CODE HU 1101 PH 1101 CH 1201 MA 1101 ME 1101 TITLE Technical English Physics- I Engineering Chemistry Mathematics- I Engineering Mechanics UNIT 1.0 1.0 1.0 1.0 1.0 CODE ME 1102 CP 1202 PH 1102/ CH 1202 PE 1102 GA 1002 TITLE Engineering Graphics Unix & C Programming Physics Lab./ Chemistry Lab. Work Shop Practice- I NCC/ NSS/ PT & Games/ Creative Arts

UNIT 1.0 1.0 0.5 0.5 0.5


MA 2101 EE 2101 CP 2101 CH 2103 PH 2103

Mathematics- II Basic Electrical Engineering Data Structure in C++ Environmental Science Physics- II

1.0 1.0 1.0 1.0 1.0

ME 2102 CH 1202/ PH 1102 ME 2104/ EE 3102 CP 2102 PE 2102 GA 2002

Computer Aided Drafting Chemistry Lab./ Physics Lab. Engineering Mechanics Lab./ Basic Electrical Engineering Lab. Data Structure Lab. Workshop Practice- II NCC/ NSS/ PT & Games/ Creative Arts

1.0 0.5 0.5 0.5 0.5 0.5

EC 3101 MA 3101 EE 3101 CP 3101 CP 3103 ME 3207 Basic Electronics Mathematics III Introduction to System Theory Java Programming & Web Technology Digital Logic Design Principle of Mechanical Engineering 1.0 1.0 1.0 1.0 1.0 1.0 EC 3102 EE 3102/ ME 2104 CP 3102 CP 3104 GA 3002 Basic Electronics Lab. Basic Electrical Engineering Lab./ Engineering Mechanics Lab. Java Programming Lab. Digital Logic Design Lab. NCC/ NSS/ PT & Games/ Creative Arts 0.5 0.5 0.5 0.5 0.5


IT 4001 CP CP CP CP EC 4103 4105 4107 4109 4105

Discrete Mathematics and Graph Theory Scientific Computing Database Management Systems Operating Systems Computer System Architecture Discrete and Integrated Analog Circuits

1.0 1.0 1.0 1.0 1.0 1.0


4104 4106 4108 4106

Scientific Computing Lab. Database Management System Lab. Operating Systems Lab. Integrated Circuits Lab.

0.5 0.5 0.5 0.5

IT5101 IT5103 CP5103 CP5105 EC5101 EE5107 Introduction to Analog Communication Theory Theory of Computations Fundamentals of Data Communications Soft Computing Microprocessor and Interfacing Digital Signal Processing IT5102 CP5106 EC5102 EE5108 Communication Lab. - I Soft Computing Lab. Microprocessor Application Lab. Digital Signal Processing Lab. 0.5 0.5 0.5 0.5

1.0 1.0 1.0 1.0 1.0 1.0


IT 6101 IT 6103 IT 6105 IT 6107 CP 6101 CP 6109 Introduction to Digital Communication Theory Computer Networks & Security Principles of Multimedia Information & Coding Theory Design & Analysis of Computer Algorithms Software Engineering IT 6102 IT 6104 CP 6108 CP 6110 Communication System Lab.- II Multimedia Lab. Computer Networking Lab. Software Engineering Lab. 0.5 0.5 0.5 0.5

1.0 1.0 1.0 1.0 1.0 1.0

IT 7101 IT 7103 IT 7105 CP 7103 Modern Telecommunication Systems Wireless Communications & Networks Parallel & Distributed Computing Computer Graphics Elective – I Elective – II 1.0 1.0 1.0 1.0 1.0 1.0 IT 7104 IT 7106 CP 7104 IT 7112 Wireless Networking Lab. Parallel & Distributed Computing Lab. Computer Graphics Lab. Project 0.5 0.5 0.5 0.5

List of Electives IT 7111 Software Reliability & Testing IT 7113 Distributed Database Systems IT 7115 Business Data Communications IT 7117 E-Commerce CP 7107 Digital Image Processing CP 7115 Neural Networks & Applications CP 7117 Optimization Techniques CP 7123 Bio-informatics CP 7125 Object Oriented Analysis and Design CP 6103 System Programming CP 6105 Compiler Design

IT 8101 CP 8101 CP 8103 MB 6001 Data Mining & Warehousing 1.0 Artificial Intelligence & Expert Systems 1.0 Simulation & Modeling 1.0 Principle of Management 1.0 Elective – III 1.0 Elective – IV 1.0 CP 8104 CP 8110 IT 8112 Simulation & Modeling Lab. Artificial Intelligence Lab. Project 0.5 0.5 1.0

List of Electives IT 8111 Enterprise Resource Planning IT 8113 Information System Project Management IT 8115 Decision Support Systems & Intelligent Systems CP 8105 Distributed Systems CP 8115 Embedded System Design CP 8119 Advance Computer Graphics CP 8121 Pattern Recognition CP 8123 Real Time Systems CP 8127 Computing & Complexity Theory



MODULE – I Single word substitution, Idioms and phrases, Pairs of words, Common errors, Précis, Comprehension, Expansion. MODULE – II Official Correspondence - Memorandum, Notice, Agenda, Minutes, Circular letter, applying for a job, Resume, Demo-official letter. MODULE – III Business Correspondence-Types, sales letters; Social Correspondence- Invitation to speak, Congratulations; etc. MODULE – IV Report writing; general and technical report, Definition, Types, structure. MODULE – V Technical proposals, Definitions, types and format. MODULE – VI Research papers and articles. MODULE – VII Mechanics of manuscript preparation. BOOKS FOR REFERENCE: 1. Blickle, Margaret D., and K.W.Houp. 2. Reports for Science and Industry, Henry Holt & Co. N.Y. 3. Duddy, E.A. & M.J. Freeman Written Communication in Business, Amercian book Co. N.Y. 4. Berry, Thomas Elliot, The most Common Mistakes in English Usage; Tata McGraw Hill. 5. Stevensin, B.W., J.R. Spicer and E.C. Ames, English in Business and Engineering. Prentice Hall, Eaglewood 6. Cliffs, N.J. 7. Raul, Asha, Effective Business Communication, Prentice Hall of India. 8. Singh B. Business Correspondence including Bank letters. 9. Singh B. Theory and Practice of Business Correspondence, HPJ Kapoor Publications. 10. Report Writing and Business Correspondence Mohan and Sharma, Tata McGraw Hill Publications, India. 11. Best, W.D. The Students companion, Rupa & Co. Publications.


Tata Mcgraw Hill.Inductance.4). Resnick. Physics. AG 17. wave equation. applications of plasma(FFC-Ch-1.Polarization of light. polarization by reflection.H.3) [5] Polarization : ( SS.6). 3rd Edition. divergence and curl (Cartesian coordinates only). Rayleigh criterion(AG 16. 8.4). damped harmonic motion and forced oscillations(RHK 17.PH 1101 PHYSICS. applications. continuity equation for charge (SAD 5.Ghatak(AG). double slit and grating ( AG 16.4). interference in thin films and wedge-shaped layers(AG 13. (2001) 3. boundary conditions on B and H ( SAD 8. 1994 References: 1. 5. 2nd Edition. Double refraction) Analysis of linearly and circularly polarized light( RHK 44. [5] Faraday’s law in integral and differential form( SAD 9.8). 1996 3. physical and mathematical concepts of gradient. Hall effect (RHK32. Mathew N. S.10)).8. Pragati Prakasan.4).10).Hayt and J.5).2-17. Introduction to Plasma Physics. M.8). India 4 .11) [5] Diffraction: Fraunhofer diffraction by single slit( AG 16. reflection and anti-reflection coatings( AG 13.4. applications of interferometry: Newton’s rings(AG 13. Gauss’s theorem and Stokes’ theorem (Statements only. relation between r k .5). Wave packets and group velocity. Plenum Press.9). three magnetic vectors (SAD 7. A.O. three electric vectors.17. Michelson' Interferometer (AG 13.3-10.1-21. New Age International. Poyinting vector (SAD 10.17. phase velocity). 5th Edition.5-8.7).Part-I & II. electric potential and relation with E(SAD 4.3).Sen.2-9. Brewster's law. limit of resolution.F. types of plasma. Halliday and Krane(RHK).( SAD 7. equation of motion of simple harmonic oscillator and solutions.1-17. Malus's law. dielectric susceptibility boundary conditions on E and D(SAD 5.5-5.6-16.7). superposition of waves (RHK-Ch-18). Maxwell’s equations in free space (SAD 9.8-13. 2002) 6.2) [5] [4] MODULE – V Physical Optics: Interference: Two-Beam Interference( AG 12.7.1-7.capacitance(SAD-6.Chen(FFC). MODULE – IV Plasma Physics: Plasma state. Fresnel's equations and their applications (AG 21. magnetic energy density (SAD 8.5). ( SS . W. plane waves.5) and electrostatic energy density (SAD 4.3).7.8). electromagnetic wave r r E . [5] Amperes law in integral and differential form. 2005 4. Physics for Engineers. Elements of Electromagnetics. Fresnel diffraction(Qualitative.9)). [5] MODULE – III Electromagnetic Theory: Gauss’s law in integral and differential form.2) [5] Text Books: 1.( SS*.2-13.Srinivasan.9). Sadiku ( SAD). dielectrics. F. Oxford University Press 2.N. displacement current ( SAD 9. magnetic permeability and susceptibility. Optics. John Wiley ( 5. Introduction to Plasma Physics.I 1.R.1-44.1-16. Meerut -1.A. Engineering Electromagnetics.0 MODULE – I Waves and Oscillations: ( SS* : Wave motion: longitudinal and transverse waves. Tata McGraw Hill ( 2006) 2.Buck.8) [6] MODULE – II Fields: Vector and scalar fields.1-12. SAD-Ch.3) .5-4. B and equation for plane waves in dielectric medium and free space.5).

2. glass transition temperature (Tg). electrical. PET. colour and magnetism of coordination complexes. producer gas. W. examples and use of inorganic polymers. biological catalysis). application of catalyst in industrially important processes (Haber’s processes. synthesis of some commercially important polymers and their use (Nylon 6. knocking characteristics. rotational and Mossbauer spectroscopy MODULE – VI & VII Macromolecules: Classification. parallel reactions. Applied chemistry A text book for engineers and technologists. N. Mw. Banwell. 3. VSEPR theory. solid fuel (carbonization & gassification). flash photolysis. lubricants and its properties MODULE –IV Electrochemistry and corrosion sciences: Redox process cell. Addition and Condensation polymers. galvanic cells. 6. spectrochemical series MODULE –II Kinetics and catalysis: kinetics of chain reactions. Lee. kinetics of catalytic action (acid base catalysis. side reactions. D. liquid fuels (refining. petrol & diesel. Fuel cells. octane and cetane number) and gaseous fuels (water gas. H. Fundamentals of molecular spectroscopy: C. Inorganic chemistry: J. PE. reforming. Lewars. Gesser. general methods of corrosion prevention (with brief introduction to chemistry of paints. electro negativity). and its applications. CFT. Computational chemistry: E. potential and free energy. electrolysis and Nernst’s equation. PS) MODULE – VI & VII An introduction to computational chemistry Text Book: 1. molecular weight of polymers (Mn. Bergius process) MODULE – III Thermo-chemistry and Fuels: Hess’s law. fast reactions in solutions. Engineering chemistry: Sashi Chawla Reference: 1. Nylon 6. structure property relationship in polymers (chemical. Physical chemistry: P. Ostwald process. MOT for diatomic molecules and polyatomic molecules.0 MODULE – I Chemical Bonding: Trends in periodic properties (ionization energy. TMH publication 2. entropy. coal gas and biogas). optical and mechanical). coordination complexes & ligands. electron affinity. chemical and electrochemical corrosion. Plenum publishers. D. enthalpy and combustion calculations. characterization and application of fossil fuels.CH 1201 ENGINEERING CHEMISTRY 1. VBT. Mv). Kluwer publication 3. Atkins 5 . varnishes and enamel) MODULE –V Fundamentals of spectroscopic techniques: Basic principles of vibrational.

Centre of curvature and evolute. 5. Lagrange’s and Cauchy’s Mean value Theorem. Cartesion and polar subtangenent and Subnormal. Errors and Approximations. Das and Mukherjee (U. Total differential and derivatives. Tara Publications. Its generalisation and extension. Lagrange’s method of Undertermined multipliers in case of two and three variables. Envelope of curves. pedal and trangential polar forms. Leibnitz’s Rule for alternating series test. Orthogonal intersection of curves. Leibnitz’s Theorem. Razabe’s Test. Dhur & Co. Generatalised Mean value Theorem. Pran Nath and Agarwal. Beta and gamma functions. Pedal equations. Area. Functions of two variables. polar. Maxima and Minima of two variables. Tests for Convergence.0 Analytical Trigonometry: De-Moivre’s Theorem and its applications. convexity and points of inflexion. Higher Trigonometry. Euler’s Theorem on Homogeneous functions. Taylor’s series in case of two variables. Partial derivatives. Das and Mukherjee (U. Dhur & Co. (22L) Integral Calculus: Reduction Formula.) Engineering Mathematics.) Differential Calculus. Varanasi Integral Calculus. Gauss’s Test. Jacobians. (8L) Differential Calculus: Successive Differentiation.MA 1101 MATHEMATICS. Taylor’s and Maclaurin’s infinite series. volume and surface area without the use of multiple integrals.N. Curvature and radius of Curvature in case of Cartesian parametric. 2. Complex arguments. length. Grewal (Khanna Publishers) 6 . (9L) Infinite series: Convergency and Divergency of infinite series. Summation of trigonometric Series.I 1. Dass Higher Engineering Mathematics B.K. Rolle’s Theorem. Indeterminate forms L Hospital’s Rule. H. Separation into real and imaginary parts Gregory’s Result. Hyperbolic functions. Logarithmic and Higher logarithmic ratio test (No proof). Expansion of Sinx and Cosx in powers of x. 3.N. Cauchy’s root test. Concavity. Comparison Test. (6L) Books Recommended: 1. 4. Tangent planes and Normal lines. Expansions. p series test.S. Asymptotes (cartesian Co-ordinates only). D’ Alembert’s ratio test.

cantilever and simply supported beams with concentrated. Work and Energy: Translation and rotation of rigid body about a fixed axis. Varignon’s theorem. equilibrium of dynamic forces. vector representation and analysis of forces and moments. static. acceleration. Interfacial Friction: Friction and impending motion. rectilinear and curvilinear motion in two dimensions. laws of mechanics. velocity. centroidal and noncentroidal rotation. analysis of frames and parabolic cables. coefficient of restitution. virtual work. conservation of momentum. wedges. coplanar. Structural Mechanics: Analysis of simple plane truss by method of sections and methods of joints. distributed and moment loads. Kinematics and Kinetics of Particle and Rigid Bodies: Conceptual framework and vector representation of displacement. Newton’s laws of motion. Engineering Mechanics 7 . Shames. energy and work equations in translation and rotational motion. kinetic and rolling friction. conservation of energy. linear and angular momentum. systems with single degree of freedom. features of a vibrating system. concept of stress and strain. momentum equation. Books Recommended: 1. freebody diagram. Vibrating Systems: Inertia. shear force and bending moment diagrams. Impulse and Momentum: Impulse force and momentum. free vibration. Kumar. non-coplanar and spatial force system and conditions of equilibrium. screws jacks and belts. application to inclined planes. D’Alembert’s principle. general plane motion. Engineering Mechanics 2.ME 1101 ENGINEERING MECHANICS 1.0 Equivalent Force System and Equilibrium: Principles of statics.

tangential and normal acceleration of a particle moving on a plane curve. change of order of integration. (10L) Books Recommended: 1. Transformation of Co-ordinates. Advanced Mathematics for Engineers By Chandrika Prasad (Prasad Mudranalaya) 3. Applications to Engieering problems. Gradient. Rank of a tensor. 8 . Multiple integrals. examples and some simple properties. Conservative system of forces. (14L) Algebra of Matrices: Rank of a matrix. contravariant and covariant vectors and Tensors. Basis and dimension. Series solution of Differential equations by the method of Frobenius. Cauchy’s and Legendre’s differential equations. Consistency and inconsistency of a system of linear equations.K. Theorems of Green. Nonlinear equations. Stoke and Gauss and their applications. Directional derivatives. Radial and transverse. linear combination.SECOND SEMESTER MA 2101 MATHEMATICS. Volume and Surface area of solids using multiple integrals. Clairaut’s form. Advanced Engineering Mathematics byE.(Roots differing by non integer and equal roots). Parallelogram law and Pythagorian theorem. orthogonal sets. Cayley Hamiliton Theorem.0 Integral Calculus: Operations under the sign of integration. (8L) Vector Calculus and Tensor Analysis: Differentiation of vectors. Cauchy-schwartz inequality. (8L) Ordinary Differential Equations: Linear differential equations: Bernoulli’s from Exact equations. Mixed tensors Contraction. Kreyszig 2. Expansion Identities. Higher order equations with constant coefficients. Das. Inner Product. Gram-schmidt process of construction of orthogonal sets. (3L) Vector spaces: Definition. Advanced Engineering Mathematics By H. transformation of Co-ordinates. Tensors. Addition and multiplication of tensors. Solution of higher order equation by the change of independent variable. Divergence and Curl. Solenoidal and Irrotational vectors. Norm of a vector.II 1. Eigen values and eigen vectors. Subspaces. linear dependence and independence. Area. Vector integration. Method of variation of Parameters in Simple cases.

Power factor. Coefficient of coupling. Circuits: Steady state analysis with independent and dependent sources. Power. KCL and KVL equations. Phasor diagram. Power triangle.EE 2101 BASIC ELECTRICAL ENGINEERING 1. Impedance of Series circuits. RMS and Average value. Circuit Theorems: Superposition theorem. Series-parallel magnetic circuits. Loop current and Node voltage method. (7) MODULE – VI Magnetic Circuits: Introduction.C. Phasor diagram. Power relations.C. Maximum Power Transfer theorem.C. Single-phase Series Circuits: Common signals and their waveforms. (5) MODULE – IV Resonance and Q-factor. Basic Electrical Engineering 9 . Series and Parallel circuits.C. (12) MODULE – II A. Power. Power factor. Thevenin’s & Norton’s theorem. A. Electrical elements and their classification. Maximum Power Transfer theorem. Nagrath and Grabel.C. Thevenin’s & Norton’s theorem. Basic Indicating Instruments: Moving coil and moving iron type instruments. Self and mutual inductances. D. D.C. Power triangle. Single-phase Parallel Circuits: Admittance method. Eddy currents and Hysteresis losses. Analysis of balanced and unbalanced 3 phase circuits. (7) MODULE – V Three Phase Circuits: Line and Phase relation for Star and Delta connection. (4) Books Recommended: 1. Star-Delta conversion. Circuit Theorems: Superposition theorem. A. excitation. (5) MODULE – III A. Basic Electrical Engineering Fitzzerald and Higinbotham. Energy storage. Form factor & Peak factor of sinusoidal waveform. Analysis of Linear and Non-linear magnetic circuits. 2.0 MODULE – I Introduction: Importance of Electrical Engineering in day-to-day life. (5) MODULE – VII Coupled Circuits (Dot rule).

Pearson Education.0 MODULE – I & II Introduction to C++ and algorithm analysis: C++ classes. New Delhi. Shortest Path Algorithms. Gregory L. Leftist and Skew Heaps. Heap sort. 2004 10 . Mark A. MODULE – VI Sorting: Preliminaries. and Quick short. Reference: 1. and Object Programming. Merge sort. New Delhi – 2002. The Search Tree ADT – Binary Search Trees. Shell sort. Thomson Learning (Vikas Publishing House) New Delhi – 2001. B-Trees. The Stack ADT. Weiss – Data Structures & Algorithm Analysis in C++. C++ details. Network Flow Problems and Minimum Spanning Tree. Text Books: 1. AVL Trees. Tree Traversals. d-Heaps. Heilean – Data Structures Algorithms. New Delhi – 2002. Using matrics. A Lower Bound for Simple Sorting Algorithms. model and what to analyze. MODULE – V Hashing and Priority Queues: Model and Simple implementations. Tata McGraw Hill. The list ADT. Binary Heap. John R. The Queue ADT MODULE – IV Trees: Preliminaries. Splay Trees. Tata McGrow Hill. 2nd Edition. Running Time calculations. 2. Hubbard – Data Structures with C++. Insertion sort. Topological Sort. 3. Applications of Priority Queues. Stacks and Queues: Abstract Data Types. MODULE – III Lists. Adam Drozdek – Data Structures and Algorithms in C++. Binary Trees.CP 2101 DATA STRUCTURE IN C++ 1. MODULE – VII Graph Algorithms: Definitions. Mathematical background for algorithm analysis.

threats to biodiversity. consequences of deforestation.structure and function of an ecosystem. Biodiversity: ecosystem diversity . potability of water . (10) MODULE– V Water Pollution: Water resources .food web. global warming. ozone depletion. photochemical smog . value education . Environment Chemistry (4) (4) 11 . scope .consumer and decomposer. Soil Pollution. sampling and analysis.classification of air pollutants. BOD and COD measurement and their significance . (2) MODULE– II Ecology and Environment: concept of an ecosystem .CH 2103 ENVIRONMENTAL SCIENCE 1. Definition. population explosion. floods and draughts. primary and secondary waste water treatment. their toxic effect. ecological pyramid. food chain .women and child welfare. Environmental Pollution 2. Forest resource. green house effect. pathways and fate of environmental pollutants. physical .0 MODULE– I Environmental Awareness: Multidisciplinary nature of environmental Science.sources of water pollution . (3) MODULE– III Environmental Pollution : Segments of environment.chemical and biological transformation of pollutants .Water ( pollution and control ) Act. Air (prevention and control of pollution ) Act.rain water harvesting . (5) MODULE– IV Air Pollution: various segments of atmosphere and their significance.water shed management. sources. Dams benefits and problems. conservation of biodiversity. toxic effects.sulphurous smog. causes of environmental pollution . (12) MODULE– VI Natural Resources and Biodiversity: Renewable and non renewable resources. stationary and mobile emission. importance and need for public awareness. producer . MODULE– VII A brief introduction to Noise Pollution. De. Sharma and Kaur. environment and human health. Solid Waste Management. human rights. municipal water supply . equitable use of resources for sustainable development. Books Recommended: 1. disinfection. characteristics of waste water.various pollutants. sources and their control. energy and nutrient flow biogeochemical cycles.

3. 2. comparison of Maxwell-Boltzmann.3).1). wave particle duality.7.4. 3.9-12. 1999. Tata McGraw Hill. 3. Addison Wesley. 1998.0 MODULE – I Special Theory Of Relativity Postulates.1-24. John Wiley & Sons. Concepts of Modern Physics. [6] MODULE – IV Lasers And Applications: Emission of light by atoms. and Appendix to chapter-1 [6] MODULE – II Quantum Mechanics: Planck's theory of black-body radiation (AB: 2. Richards and Adair.7. Lorentz transformations.8. 1997. Kenneth Krane.2. uncertainty principle(AB:3.1. Optics.9). steady state one-dimensional heat conduction [(HRW:19-2.8).1.1-11. elementary ideas of holography (AG: 18. Einstein's A and B coefficients. [4] Zeroth law.2. Wehr. 2. entropy. 3.2). velocity addition.1. 9. 9. 19-9.7). 1997.6).4. Compton effect (AB: 2. 4th edition. 5th edition. [5] Text Books: 1.9.1. hydrogen atom (qualitative)(HRW:40-8).3. length contraction. 12 . Reference Books: 1. mass change and Einstein's mass energy relation. [8] Schrodinger equation in one dimension(AB:5.5.1). Modern Physics. heat transfer. time dilation. 21-3. potential barrier and tunneling(AB:5.2.8. 3.2. John Wiley & Sons. applications of lasers (AB: 4.4).5).4. properties of laser radiation.(SS:14.2. Tata McGraw Hill.5. particle in an infinite square well. spontaneous and stimulated emission (AB: 4. 9. 14.3. fission. liquid drop model (AB: 11. 5. second law. binding energy.6). 19-11).1. 9. 3.PH 2103 PHYSICS.6). physical interpretation of wave function and its normalization(AB:3. 9. [8] MODULE – IV Nuclear Physics: Nuclear forces. nuclear reactors. and AG: 23.4).1.9) and AG: 23. Modern Physics for Engineers.12). laser: population-inversion (AG: 23.7. Physics of the Atom.7)]. first law. Arthur Beiser.9. Galilean transformations. 3. Ajoy Ghatak. controlled thermonuclear reactions (AB: 12.1) and fiber optics (AG: 24. (AB: 1. solutions of time-independent Schrodinger equation for free particle(AB:3. 5. Bose-Einstein and Fermi-Dirac statistics (AB: 9. De Broglie waves. 2nd edition. Ruby & He-Ne lasers. Davisson and Germer's experiment(AB:2.II 1. [8] MODULE – III Statistical Physics And Thermodynamics: Elementary ideas. energy processes in stars.1. 2nd edition.1. Jasprit Singh.6. 5. fusion.2). expectation value(AB:5.3.4).

Circuit Theorems: Superposition theorem.P. 2nd Edition. Power.C. Circuit Theorems: Superposition theorem. Phasor diagram. Self and mutual inductances. Impedance of Series circuits. Electric circuits. Power.J. A. A. excitation.THIRD SEMESTER EC 3101 BASIC ELECTRONICS 1. Nagrath and D. Maximum Power Transfer theorem. Eddy currents and Hysteresis losses. KCL and KVL equations. RMS and Average value. Power triangle. Circuits: Steady state analysis with independent and dependent sources.C. 3. Form factor & Peak factor of sinusoidal waveform. Series and Parallel circuits. Single-phase Series Circuits: Common signals and their waveforms.C. Maximum Power Transfer theorem. Star-Delta conversion. Phasor diagram.Schaum Series 2. (12) MODULE – II A. Fitzgerald. Hinginbotham 2. Loop current and Node voltage method. (7) MODULE – VI Magnetic Circuits: Introduction. Power factor. Single-phase Parallel Circuits: Admittance method. Series-parallel magnetic circuits. Basic Indicating Instruments: Moving coil and moving iron type instruments. D.Mittle. Electrical Engineering.C. Coefficient of coupling. D. (5) MODULE – VII Coupled Circuits (Dot rule). Thevenin’s & Norton’s theorem. Kothari.Del Toro.C. Analysis of balanced and unbalanced 3 phase circuits. Energy storage. (7) MODULE – V Three Phase Circuits: Line and Phase relation for Star and Delta connection. Basic Electrical Engineering I. 13 . Power triangle. Power relations. (5) MODULE – III A. Electrical elements and their classification.0 MODULE – I Introduction: Importance of Electrical Engineering in day-to-day life. (4) Text Books: 1. Power factor. Reference Books: 1. Basic Electrical Engineering. (5) MODULE – IV Resonance and Q-factor. Basic Electrical Engineering. TMH.C. Thevenin’s & Norton’s theorem. Analysis of Linear and Non-linear magnetic circuits. Delhi.

Complex integration. Cauchy’s Residue Theorem. Orthogonarity relations. Relationship between Fourier and Laplace transform. (10L) Fourier Series and Fourier Transform: Periodic functions Existence conditions Euler’s formulae. Sneddon 14 . Elements of error analysis (4L) Books Recommended: 1. Fourier Integral Formula. Convolution or Faltung theorem. Concept of Random variable. Kreyszig 2. Contour integration (Poles on real axis excluded) (13L) Partial differential equations: Formation of partial differential equations. Derivation of one dimensional heat equation and its solution.III 1. Taylor’s and Laurent’s Series. Fourier series of functions with arbitrary period. Bilinear and conformal transformations. Cauchy Riemann differential equations in Cartesian and polar forms. Finite Fourier Transforms. Boundary value Problems. Non homogeneous equations: solution by separation of variables. Recurrence relations. Linearity property. Fourier Transform. Jacobi’s form of elliptic integrals. Poles and Singularities. Engineering Mathematics – E. Cauchy’s integral theorem and formula. Rodrigue’s Formula. Definition of Hankekl’s function. Fourier Transforms – I. Half range series. Moments.0 Special Functions: Bessel’s equation: solution and Bessel’s function of the first kind.MA 3101 MATHEMATICS. Generating function and Bessel’s integral. Advanced Engineering Mathematics – C. Lagrange’s first order linear equations. Higher order differential equations with constant Co-efficients. differentiability and analyticity of a function of a complex variable. Generating function and recurrence relation. Unit step function and Dirac Delta Function (10L) Statistics: Mean and variance. Orthogonality of Bessel’s Functions. wave equation in one dimension and its solution.N. Probability density and Distribution functions Problems. Inversion Theorem. Prasad 3. Non linear equations. Heaviside. Legendre’s equation: solution and Legendre’s polynomials. Harmonic functions. Derivatives. Elliptic Integral of the first and second kind. Fourier sine and cosine transforms and inversion formulae. (8L) Complex Variables: Continuity.

Non-uniqueness of state model. State vector and state space. Concept of poles and zeros. Limitations and its applications to closed loop systems. Sinusoidal transfer function. (6) Text Books: 1. Solution of time invariant state equation. State variable. Laplace transformation of common functions. System response.Basu & Natarajan 15 . D Alembert's Principle. (3) MODULE – IV Laplace Transform Method: Introduction. Inverse Laplace transform by partial fraction expansion and convolution integral method. Amplitude spectrum and phase spectrum of signals. Anand Kumar Reference Books: 1. Representation of common signals and their properties. 2. Natural. Roy Choudhury 2. transient and steady state responses. Laplace theorems shifting. (4) MODULE – VII State-Space Concept: Introduction. Laplace transform pair. Derivation of transfer function from state model. Step function and impulse function. Hydraulic and thermal systems. (5) MODULE – III Fourier Transform Method: Introduction. Types.K. Transition matrix and its properties. Control System – A. Control System Engineering – Nagrath & Gopal 3. Signals and Systems . (6) MODULE – VI System Stability: Concept of stability. forced. Superposition integral. Electrical analogue of mechanical. (12) MODULE – V System Analysis: System Analysis by Laplace Transform method. Routh Hurwitz stability criterion. Nature of system response from poles and zeros. Derivation of State model from transfer function. Force-voltage and force-current analogies. final value and convolution theorems. Bush form and diagonal canonical form of state model. Networks and Systems – D. State space representation. Fourier transform pair.Cheng. Definition: State. Analysis of Linear Systems – D. Gate function. Transfer function and characteristic equation. System modeling (4) MODULE – II Analogous System: Introduction.0 MODULE – I Introduction to signals and systems: Definition.EE 3101 INTRODUCTION TO SYSTEM THEORY 1. Basis of classification. initial value. Necessary and sufficient conditions.

Methods in java: declarations. Web server. creating and executing threads synchronization. random access file handling. passing arrays to methods. Equality and Relational Operators. Client / Server architecture. Arithmetic. java script: objects. statement. class scope. Introduction to String class and its members. Arrays: declaring and creating references and reference parameters. MODULE – VI World Wide Web.. this keyword and its use. MODULE – VII Introduction to DHTML. final methods and classes. argument promotions.CP 3101 JAVA PROGRAMMING & WEB TECHNOLOGY 1. compound assignment operators. File class. Recursion. composition. break and continue. switch. controlling access to members. Sequential access file manipulation. logical operators.0 MODULE – I Introduction to Java Applications. chained exception. finally clause. while. MODULE – IV Exception handling: Java exception hierarchy. nested classes. files and streams. Web browser. Inheritance hierarchy. scripting languages. Special tags in HTML. MODULE – III Inheritance and polymorphism: super class and subclass. do .. MODULE – II Object based programming.. events & event handling. else. scope of declarations. Control Statements: if. rethrowing an exception. abstract classes and methods. Relation ship between super and sub class... method overloading. for . HTML. selection statements. increment decrement operators. Drawing strings and lines. Memory Concepts. Decision making. static class members.. document structuring tags in HTML. garbage collection. classes. Type wrappers. Introduction to Java Applets. protected members. priorities and scheduling. MODULE – V Files and streams. methods. final instance variables. crating packages. while statement. package access. Data abstraction and encapsulation. overloading constructors. labeled break and continue. Multithreading: Life cycle of a thread. constructors. Declaring new exception types. multi dimensional arrays.. if . stack unwinding. hierarchy. creating a web site and mark up languages. 16 . Document object model.

2002.Text Book: 1. G. 5th edition. New Delhi. S. New Delhi. Pearson Education . Cornell . 2nd Edition. Schildt – The Complete Reference Java 2. Pearson Education. Tata McGraw Hill Publication. Reference: 1. 2. Tata McGraw Hill Publication. Balagurusamy -Programming in Java.Java How to program . 3. Dietel. Patrick Naghton & H. C. New Delhi. Raj Kamal – Intrernet and Web Technology.Dietel . New Delhi.Core Java 2 Vol I & Vol II. Horstmann. Tata McGraw Hill. 2. New Delhi. 17 .

TTL Logic Family and Data Sheets. The 74AL S193/HC193. Hexadecimal Arithmetic. Parallel Adder. Tristate Logic Outputs.0 MODULE – I Number Systems and codes: Binary to Decimal Conversions. Description. Basic Characteristics of Digital ICS. Parity Method for Error Detection.II Combinational logic circuits: Sum of Products From. Decoding a Counter. Boolean and DeMorgan’s Theorem. Subtraction. BCD Code. Logic Gate Representations. MODULE – VI Integrated – Circuit Logic Families: Digital IC Terminology. Types and Applications of ROM. NOR and NAND gates and their universality. CMOS Series Characteristics. TTL Characteristics. Parallel In/ Serial Out. TTL Loading and Fan – Out. Semiconductor RAM and RAM Architecture. MODULE . Serial In /Serial Out. 18 . MOS Technology. Asynchronous Inputs. Complementary MOS Logic. Logic Gates and Boolean Algebra: Boolean Constants and Variables. BCD – to – 7 Segment Decoders. and NOT Operations. BCD Addition. Static and Dynamic RAM. Truth Tables. Data Storage and Transfer. ALU Integrated Circuits. Parallel In / Parallel Out . ROM and its Architecture. Shift – Registers.CP 3103 DIGITAL LOGIC DESIGN 1. Counter Applications. Integrated Circuit Registers. MODULE – VII MSI Logic Circuits: Decoders. Memory Devices : Memory Terminology and General Operation. OR. Hexadecimal Number System. Decoding Glitches. AND. MODULE . Cascading BCD Counters. Parity Generators and Checker Enable/Disable Circuits . Digital MOSFET Circuits. Shift Registers. Full Adder. Arithmetic Circuits. Magnitude Comparator. Evaluation and Implementation of Logic Circuits. Potential Timing Problem in FF Circuits. Decimal to Binary Conversions. Timing. Programmable Logic Devices MODULE – III Sequential Logic Circuits: Latches and Flip-flops .V Counter and Registers: Different Asynchronous and Synchronous Counters. Octal Number System. Alphanumeric Codes. Encoders. Simplifying and Designing Logic Circuits. Multiplexes and Demultiplexers. Karnaugh map Method Executive – OR and Excluxre NOR Circuits . Schmitt – Trigger Devices. Multiplication and Division. Serial In / Parallel Out. Flip-flop Applications and Synchronization. Flip-flops Timing Considerations . MODULE – IV Digital Arithmetic: Binary Addition. Pre settable Counters. Counters.

Widmer .Text Book: 1.Digital Logic and Computer Design. Marcovitz. Ltd. TMH. Dondamudi.Introduction to Logic Design. PHI (Reprint). 8th Edn. A. New Delhi – 2004 19 .Digital Systems : Principles and Applications Pearson Education.Fundamentals of Computer Organization and Design Springer (India) Pvt.P.B. M. New Delhi. Tocci and Neal S. Ronald J. Morris Mano. 3. 2. S. New Delhi . New Delhi 2004.2002. 2002 Reference Books: 1.

Kolman et.2001 Reference Books: 1. 20 . Propositional Equivalences. Pearson Education. New Delhi – 2004. The Growth Functions.P. Representing Relations. Mathematical Induction. Products and Quotients of Semigroups. Decoding and Error Correction. Predicates and Quantifiers. TMH. Spanning Trees. New Delhi . Partial Orderings. MODULE – III & IV Functions and Relations: Functions. Shortest Path Programs. MODULE – V Graphs: Introduction to Graphs. Non. Methods of Proof. Sequences and Summations.2004. Relations and Their Properties. Closures of Relations. Product and Quotients of Groups.H. Tremblay et. MODULE – VI Trees: Introduction and applications of trees. Tata McGraw K. Semigroups. Coding of Binary Information and Error Correction. Minimum Spanning trees. Equivalence Reloans. Euler and Hamiltonian Paths. 5th Edn. Program Correctness. Groups and Coding: Binary Operations. New Delhi . Groups. Tree Traversal. Recursive Definition and Algorithms. – Discrete Mathematical Structures with Applications to Computer Science.Discrete mathematical Structures.0 MODULE – I & II Logic and Mathematical Reasoning: Logic.array Relations & Their Applications. B. 2. Connectivity. MODULE –VII Semgroups.FOURTH SEMESTER CP 4101 DISCRETE MATHEMATICAL STRUCTURES 1. Rosen – Discrete Mathematics and Its Applications – 4th Edn. Text Books: 1. Graph Terminology and Representation.

Approximations for Discrete Distributions. Distributions of Functions of a Random Variable. The Normal Distribution. The Uniform and Exponential Distributions. Methods of Enumeration. Random Functions Associated with Normal Distributions. Tests About Proportions. Numerical integration. Transcendental and Polynomial Equations: Introduction. Methods based on interpolation. Mathematical Expectation. The t and F Distributions. Numerical differentiation. Finite difference operators. Interpolating polynomial using finite differences.CP 4103 SCIENTIFIC COMPUTING 1. Computer Arithmetic. Methods for Complex Roots. Probability: Properties of Probability. B – STATISTICAL COMPUTING MODULE . Hermite interpolations. Predictor-corrector methods. Distributions of Two Random Variables. Rate of Convergence. MODULE . Chi-Square Goodness of Fit Tests. Random Variables of the Continuous Type. Ordinary Differential Equations: Introduction. Tests of the Equality of Two Normal Distributions. MODULE . Eigenvalues and Eigen Vectors.0 A – NUMERICAL COMPUTING MODULE .IV Empirical and Probability Distributions: Basic Concepts. MODULE . The Moment-Generating Function.I High Speed Computation: Introduction. Interpolation and Approximation: Introduction to Lagrange and Newton Interpolations. Direct Methods. and Standard Deviation.III Differentiation and Integration: Introduction. Tests of the Equality of Several Means. Confidence Intervals for Difference of Two Means.VII Estimation & Tests of Statistical Hypotheses: Point Estimation. Bisection Method.II System of Linear Algebraic Equations and Eigenvalue Problems: Introduction. Euler methods. The Central Limit Theorem. Bayes Theorem. Probability Density and Mass Functions. Sample Size. Bernoulli Trials and the Binomial Distribution. Piecewise and spline interpolation. Graphical Comparisons of Data Sets. The Gamma and Chi-Square Distributions. Polynomial Equations. Conditional Probability. 21 . The Mean Variance. Errors. The Poisson Distribution. Iterative Methods. Continuous-Type Data. Independent Events. Sampling Distribution Theory: Independent Random Variables. Continuos & Multivariable Distributions: Random Variables of the Discrete Type. Error analysis. Single and Multistep methods. Contingency Tables. Distributions of Sums of Independent Random Variables. Confidence Intervals for Means. Exploratory Data Analysis. Machine Computation. MODULE – V & VI Discrete. Iteration Methods.

2003.. W. etal : Numerical Methods for Scientific and Engineering Computation. Statististics and Random Processes. John Witey. 6th Edn. et_al – Probability and Statististics in Engineering. Hines. T. TMH. Jain. S. 3rd Edn. New Age Publication.V. & Tanis E.S. – Introductory Methods of Numerical Analysis. 2nd Edn. New Delhi.W. Singapore (Indian Reprint).. PHI. 3. R. Hogg. 4th edn.. New Delhi. A. Sastrty. 4th Edn.K.Text Books: 1. Reference Books: 1. 22 .. 2004. New Delhi. 1999 2.. Pearson Education.M. Veerarajan. 2005 2. – Probability. 2003. New Delhi . : Probability and Statistical Inference.

Database System Concepts. authorization. A. Database Languages. E-R model. New Delhi. SQL data types & schemas. R.2005 2. E – R Diagram. Introduction to Concurrency Control. Evaluation of Expressions. Functional dependency theory. New Delhi. Nested Sub Queries. New Delhi – .CP 4105 DATABASE MANAGEMENT SYSTEMS 1. Data Models. views. Fundamentals of Database Systems. Elmasri. Weak Entity Sets. Transaction States. Serializability & Its Testing. Constraints. Reduction to E – R Schemas. Reference Books: 1. Selection Operation. 5th Edn. Embedded SQL.Silberschatz et. MODULE – VI Query Processing: Measure of Query Cost. Concurrent Executions. Decomposition using functional dependencies.0 MODULE – I Introduction: Purpose of Database System.. complex queries. Basic structure of SQL queries. Pearson Education. Tata Mc-Graw Hill. Null Values. Transaction Management. Extended E – R Features. View of Data. Decomposition using functional dependencies. Integrity constraints. MODULE – IV SQL & Advanced SQL: Data definition. Date C. Pearson Education. Aggregate Functions. MODULE – VII Transaction & Concurrency Control: Transaction Concepts & ACID Properties. more normal forms. Decomposition using multivalued dependencies. MODULE – V Relational Database Design: Atomic domains & first normal form. Text Book: 1.Relational Model: Overview of design process. MODULE – II Database Design and Entity . Additional Relational Algebra Operations. 2005. Tuple Relational calculus. 23 . History of Database Systems. Query by Examples. modification of database. Storage Management. Database Users Administrator. Domain Relational Calculus. Fundamental Relational Algebra Operations. Locked Base Protocol & Deadlock Handling. Set Operations.An Introduction to Database System. Recoverability. MODULE – III Relational Model: Structure of Relational Database.J.

(5) File Systems: File Concept and support. Protection. (8) MODULE – V Disk Scheduling: Physical characterization. Segmentation. Cryptography. 5th Edn. Page replacement. User Authentication. 1993. New Yark.B. OS Synchronization. (3) MODULE – II CPU Scheduling: Scheduling concepts and algorithms. Demand paging. Deadlock prevention. Page replacement algorithms. Atomic Trancaction. and Combined approach to deadlock handling. Deitel H. Monitor. Virtual memory concepts. directory systems. Deadlock characterization. (8) MODULE – IV Virtual Memory: Overlays.E. Algorithms evaluation. Access and allocation methods.. Real Time systems. Deadlock avoidance. RAID structure. A and Golvin. 24 . Silver Schatz.. (6) MODULE – III Memory Management: Preliminaries. 2. FCFS scheduling and Shortest-Seek-Time-First. London. time-sharing. Bare Machine.. Multiple partitions. and Multiple processor scheduling. Disk Management. 2000 Reference Books: 1. Recovery from deadlock. Swapping. Performance of demand paging. Deadlock detection. P. (4) MODULE – VII Process Synchronization: Semaphors. Paging. ‘Operating System Concepts’. Allocation algorithms.CP 4107 OPERATING SYSTEMS 1. Text Book: 1. Addison Wesley. 1995. Combined systems. Swap-Space Management. ‘Operating System’ McGraw Hill. Mandinck S. John Wiley. and Thrashing. File protection.. ‘An Introduction to Operating System’.M.0 MODULE – I Introduction: What is an Operating System? Simple Multiprogramming. Security: The Security Problem. Performance. Inc. (6) MODULE – VI Deadlocks: The deadlock problem. Resident Monitor. London.

P..III Datapath Design: Fixed-Point Arithmetic Addition.II Processor Basics: CPU Organization Fundamentals. Singapore. 3rd ed McGraw-Hill. B. Fixed-Point Numbers.Level Devices.4th edition. Ram. J. Address Translation. Multiplier Control Unit Control Pipeline Control Instruction Pipeline. the Gate level The Register Level. New Delhi.. McGraw Hill. The Processor Level Processor. “ Computer System Design and Architecture”. Address Mapping MODULE. etal.”Computer Fundamentals: Architecture and Organization”.IV Control Design: Basic Concepts Introduction. Multiplication and Division Arithmetic Logic Units Combinational ALUs.M. Random Access Memories. 2000 3. Register. Mano.P.V Memory Organization: Memory Technology Memory Device Characteristics.CP 4109 COMPUTER SYSTEM ARCHITECTURE 1. Design Process. “Computer Architecture and Organization”. Hayes. Additional Floating-Point Numbers Data Representation Basic Format.. Prentice Hall of India. Serial Access Memories Memory Systems Multilevel Memories. Parallel Processing Text Book: 1. Memory Allocation Cache Main Features.VII Advaced Topics: Pipeline Processing. Hamacher. Sequential ALUs MODULE. Heuring V. London. 2000 25 . 1996 4. Register.. New Delhi. Programmable Logic Devices. M.. Hardwired Control Microprogrammed Basic Concepts. etal.I Design Methodology: System Design System Representation.VI System Organization: Communication Methods Basic concepts Bus Control System Control DMA and Interrupts MODULE.V.level Components. Subtraction. 2000 Reference Books: 1. 1995 2. “Computer System Architecture” . Floating-Point Numbers Instruction Sets Instruction Formats and Types MODULE. Processor-level Design MODULE. (Computer Organzation” . Arithmetic Pipeline MODULE .Level Components. Addision Wesley Indian Reprint.3rd ed New Age International Publication.0 MODULE.

Successive approximation type A/D converter. Specifications for D/A Converters.0 MODULE – I RC Filters: RC loss pass and high pass filters and their response to sinusoidal. (6) MODULE – IV Feedback amplifiers: Classification of amplifiers. 3. “Integrated Electronics”. (5) MODULE – VI Voltage and current time base generators: Exponential sweep. Reference Books: 1. A transistor current time-base generator. Amplifier response at high frequencies. Linearity correction through adjustment of driving waveforms. Book: “Digital Integrated Electronics”. D. 2.Bandwidth product. Crystal oscillators. MODULE – VII A/D and D/A Converters: D/A converters – Binary Weighted D/A Converter. Miller and Bootstrap time base generators. Millman & Halkias. P. Malvino & Leach. Belove. FET at high frequencies. Single tuned amplifier. (12) MODULE – V OP-Amp based Oscillators: Barkhausen criterion. “Modern Digital Electroncis”. square wave and ramp inputs. McGraw ill. Hartley and Colpitt’s oscillators. “Electronics Circuits: Discrete and Integrated”. pulse. TMH. Text 1. Gain. TMH. Comparison of converter types. UJT as a negative resistances switch in sawtooth generators. TMH. Ladder type D/A converters. Schilling and C. McGraw Hill. “Pulse Digital and Switching Waveforms”. 2. Jain. Dual slope converter.EC 4105 DISCRETE AND INTEGRATED ANALOG CIRCUITS 1. A/D Converters – Simultaneous A/D converter. Counter type A/D converter. step. “Digital Principles & Application”. Current shunt feedback. TMH 3. A simple current sweep. (5) MODULE – III Low frequency response of RC coupled stage and Multistage amplifiers. Phase shift and Wein bridge oscillators. Cascode (CE-CB pair) amplifier. Current series. Taub & Schilling. (5) MODULE – II Transistors at high frequencies: Hybrid π model. Voltage shunt. Millman & Taub. 26 . R. Voltage series. Frequency stability.

Haykin.IV Multiplexing: Introduction and its classification.Roden: Analog & Digital Communication Systems: Shroff. Energy Density Spectra. 2nd Edition 2. 2nd Edition 2. Introduction of Amplitude Modulation. 2nd Edition 2. 2003. Roddy & J. Text Books: 1. Fourier Transform and its Application to signal Analysis. Representation of Signals in the Frequency and Time Domain. Haykin.FIFTH SEMESTER IT 5101 INTRODUCTION TO ANALOG COMMUNICATION THEORY 1. Frequency spectrum of Amplitude Modulation. D. Types of Frequency Modulation. Text Books: 1. Communication Systems by S. Communication Systems by S. M. Superheterodyne receiver. M. PHI MODULE . Pub.II Amplitude Modulation System: Basics Communication system. Modulation.P Lathi. Text Books: 1. 2nd Edition 2. PHI 27 . B. Coolen: Electronics Communication 4th Edition. The Discrete Spectrum. Frequency division Multiplexing Text Books: 1. Communication Systems by S.V AM and FM receivers: Introduction.S. Haykin. Haykin. Roden: Analog & Digital Communication Systems: Shroff. Comparison of Frequency Modulation and Amplitude Modulation.0 MODULE . Frequency and phase Modulations. MODULE . 2003. Communication Systems by S. New Delhi. Roddy & J. Generation of SSB-SC signal and demodulation of SSB-SC and DSB-SC signal. Selectivity. 2nd Edition 2. Balanced Modulator and Ring Modulator. Modulator: Square law Modulator. Balanced Slope Detector and Phase Discriminator. 1968 MODULE . D. Sensitivity. Demodulator: Envelop Detector. Pub. Concept of Angle Modulation. S. Communication Systems. Classification of Radio receiver. Generation of FM wave: Direct and Indirect Method Detection of FM wave using slope detector. Coolen: Electronics Communication 4th Edition. Need of Modulation.III Angle Modulation System: Introduction. The Continuous Spectrum. MODULE . Communication Systems by S. New Delhi. Dirac Delta Functions. AM-DSB-SC. Switching Modulator. Square law detector.I Signal Analysis: Introduction of Signal. Haykin. AMSSB-SC. Fidelity and Image rejection ratio. Comparisons of Various AM systems Text Books: 1.

Noise Temperature. TMH. Haykin. Equivalent Noise figure of Amplifiers. Signal to Noise Ratio. Taub and D. Noise Figure. D. 2nd Edition 2. Haykin. Gaussian. PHI 28 . Atmospheric Noise.VII Noise: White Noise. Partition Noise.L. New Delhi. Thermal Noise. Schilling: Principles of Communication Systems. Communication Systems by S.Noise Factor. Flicker Noise. Continuous and Statistically Independent random variables. Roddy & J. H. Stationary & Ergodic Processes. Auto Correlation Functions. Examples of probability Density functions of Uniform. Equivalent Noise Band width Shot noise. Energy Spectral Density.VI Random Signal Theory: Random Variables. Communication Systems by S. Coolen: Electronics Communication 4th Edition. Text Books: 1.MODULE . 2nd Edition 2. Rayleigh functions.. Text Books: 1. MODULE .

P. and Languages: Sets. Three fundamental proof techniques. Text Book: 1. 2nd Edn. Fundamentals of the Theory of Computation: Principles and Practices: Horcourt India Pvt Ltd. Finite automata and regular expressions. Relations. The halting problem. State minimization. Finite and infinite sets.0 MODULE. Elements of the theory of computation – 2nd Edn. Finite representations of languages. Martin– Introduction to Languages and the theory of computation. MODULE. 2nd Edn.VII Undecidability: The Church-Tuning thesis. Algorithms for context-free grammars. J.. K. Determinism and parsing. 2000 29 . New Delhi. Languages that are and are not contextfree. Finite Automata: Deterministic finite automata. Papadimitriou. Misra – et.V & VI Turing Machine: Definition and Computing with Turning machines. Nondeterministic finite automata.I & II Sets. Universal Turing machines.L. “Theory of Computer Science”.H. New Delhi 2000 3. Reference Books: 1. Alphabets and languages. Nondeterministic Turing machines. Pearson Education. PHI. TMH. Unsolvable problems about Turing machines. Relations and functions. Special types of binary relations. Numerical functions. Unsolvable problems about grammars.IT 5103 THEORY OF COMPUTATIONS 1. Parse trees. MODULE. Properties of recursive languages.III & IV Context-free Languages: Context-free grammars. 2. MODULE..C. H. Closures and algorithms. Grammars. Pushdown automata. Random access Turing machines. Extensions of Turning machines.R. Algorithmic aspects of finite automata. Lewis & C. Pushdown automata and context-free grammars. Languages that are and are not 2000 Morgan Kaufmann Publishers.

Statistical Time Division Multiplexing. PHI. Frame Relay. X. Analog and Digital Data Transmission.IV Digital Data Communication Techniques: Asynchronous and Synchronous Transmission.Data Communications and Networking. Protocol Architecture: The Need for a Protocol Architecture. Channel Capacity. ATM Adaptation Layer. Circuit-Switching Concepts. MODULE. Line Configurations. New Delhi 2006 2.. Circuit-Switching Networks. MODULE.VI Circuit Switching and Packet Switching: Switching Networks. Gupta – Data Communications and Computer Networks. Error Correction. Wireless Propagation. Pearson Edn. MODULE. Control Signaling. Interfacing. P. PacketSwitching Principles. Analog Data Digital Signals. Types of Errors. Routing in Packet-Switching Networks. B. MODULE.CP 5103 FUNDAMENTALS OF DATA COMMUNICATIONS 1. Data Communications.VII Asynchronous Transfer Model: Protocol Architecture.V Data Link Control: Flow Control. Stallings. Synchronous Time Division Multiplexing. New Delhi. Guided and Wireless Transmission: Guided Transmission Media. 7th Edn. 4th Edn.I Data Communications and Networking Overview: A Communications Model. ATM Cells. Transmission of ATM Cells. Analog Data Analog Signals.C. ATM Service Categories. 2006 Reference Books: 1. New Delhi 2006 30 .II Data Transmission: Concepts and Terminology.0 MODULE. TMH. Data Communication Networking. Wireless Transmission. OSI. ATM Logical Connections. Line-of-Sight Transmission. Multiplexing: Frequency Division Multiplexing. Digital Data Analog Signals. MODULE. A Simple Protocol Architecture. A.III Signal Encoding Techniques: Digital Data Digital Signals. Transmission Impairments.25. W./ PHI. Softswitch Architecture. Least-Cost Algorithms Text Book: 1. Forouzan . Error Detection. High-Level Data Link Control (HDLC). Routing in Switched Networks: Routing in Circuit-Switching Networks. The TCP/IP Protocol Architecture MODULE.Data and Computer Communications. Error Control.

Sun and E. New Delhi 2004. MF Formulation and Parameterization.III Fuzzy Inference System: Introduction.R. Radical Basis Function Networks. Offline Learning. The Hopfield Network Networks. Inversion and detection. Vijayalakshmi Pai. New York. Architecture. Mamdani Fuzzy Models. Sugeno Fuzzy Models.0 I FUZZY LOGIC MODULE.IV Fundamentals of Genetic Algorithms: Basic Concepts Creation. T.A. Fuzzy IF THEN Rules. Reproduction. Online Learning. “Fuzzy Logic with Engineering Applications. Hebbian Learning. Mutation operator. J. MODULE. Methods of Speeding.Mizutani. Cross over.” TMH. Kohonen self-organising Text Book: 1. III ARTIFICIAL NEURAL NETWORKS MODULE. Back Propagation Multilayer Perceptrons. “Neuro-Fuzzy and Soft Computing” PHI/Pearson Education. Back Propagation Learning Rules. Offsprings Encoding. J. Functional Expansion Networks. Ross. Genetic Modelling: Inheritance Operators. Bitwise operators. Fuzzy Reasoning. Intersection and Complement. MODULE. 31 . Fitness functions. Adaline. MODULE. Rajasekaran & G.CP 5105 SOFT COMPUTING 1. II GENETIC ALGORITHMS MODULE. MF of two dimension. New Delhi 2003 Reference Books: 1.II Fuzzy Rules and Fuzzy Reasoning: Extension Principles and Fuzzy Relations. Other Variants. Back Propagation and feed Forward Networks. 1997.VII Unsupervised Learning: Competitive Learning networks. Set Theoretic Operations.V Introduction.T. C. PHI.I Fuzzy Set Theory: Basic Definition and Terminology.S. Jang. Fuzzy Union. 2. MODULE. S.VI Supervised Learning of Neural Networks: Introduction. Perceptrons. Tekamoto Fuzzy Models.

Multiplexed and De-multiplexed Bus. Hardware and Software Interrupts. “Digital Computer Electronics”. “Digital Computer Electronics”. “Microprocessor Architecture. Code conversions like BCD to Binary. “Microprocessor Architecture. Chowdhury and Sunetra Chowdhury. Memory Organization. 2/e. Malvino. Gaonkar. Sample and Hold circuit. DAC Interfacing. SAP concepts with stress on timing diagrams. “Microprocessor Architecture. Modes of operation. Programming examples for Generation of square wave. Text Books: 1. 2. MODULE.IV Architecture of 8255 I/O peripheral chip. Functions of all signals. Programming and Applications with 8085” by R.I Revision of logic circuits with emphasis on control lines. Programming and Applications with 8085”. P. P. by A. Programming and Applications with 8085” by R. 2. LF 398 and its applications in Data Acquisition. 2/e. MODULE. HEX to ASCII. S. 2. Binary to BCD.EC5101 MICROPROCESSOR AND INTERFACING 1. “Microprocessor and Interfacing. Memory Interfacing. Memory Mapped I/O. MODULE. Microprogramming. Bus concepts. Interrupt driven I/O. Programming and Applications with 8085” by R. ASCII to HEX. Malvino. Malvino. “Digital Computer Electronics”. 3. by A.0 MODULE. 2/e. Microinstructions. Minimum system. S. triangular and sine waves. ADC 0801 and ADC 0808 Interfacing with microprocessor. Programmed I/O. Interrupt instructions. P. Text Books: 1. Variable machine cycle. Hand shake mode operation. Looping. “Microprocessor Architecture. Programming examples like Time delay. “Microprocessor and Peripherals” by S. S. Timing diagrams. Stack operation. Gaonkar. DMA. Malvino. P. S. by R. BSR mode. 4. DAC 0808 specifications. 2. Text Books: 1. Addressing modes. 32 . Gaonkar. 2/e.II Instruction set. by A. by A. positive and negatives ramps. Analogue multiplexed ADC. I/O Mapped I/O. “Digital Computer Electronics”. P. Programming of Hardware” by Douglas Hall. BCD Arithmetic etc. Interrupts. Gaonkar. Sorting.III 8085 based Microcomputer system. Architecture of 8085 Processor . Text Books: 1.

Mukhopadhyay. 4. Interfacing. “Microprocessor and Peripherals” by S. Programming examples. Different modes of operation. by Bhupendra Singh Chhabra. by A. Instruction set. 3/e. 3/e. Addressing modes. 2. Rajasree.MODULE. 3.VII Introduction to Microcontrollers. Different modes of operation. Applications. 3. Port structure. Design and Interfacing”. Programming of Hardware” by Douglas Hall. 3. Programming examples. by Bhupendra Singh Chhabra. K. Design and Interfacing”. 2/e. Evolutionary steps and Additional features of 80186.VI Evolution of Microprocessors. Programming techniques. Rajasree. “Microprocessor and Peripherals” by S. 2. Programming. Architecture. “Advanced Microprocessors and Microcontrollers” by S. 80286. P. Venkata Ram. 33 . “Microprocessor. 2/ A. P. Chowdhury and Sunetra Chowdhury. Concept of CISC and RISC processors Text Books: 1.V 8253 timer. MODULE. 2. Modes of operation. “Advanced Microprocessors” by Y. Interrupt structure. K. Mukhopadhyay. 80486 and Pentium Processors. “Advanced Microprocessor” by Y. “Microprocessor. Architecture. Programming. 8051 Microcontroller. 8279 Keyboard/Display Interface. MODULE. Introduction (Architecture and Instruction set only) of 8086 and 8088. Microcomputer and their Applications”. Microcomputer and their Applications”. Text Books: 1. “Microprocessor and Interfacing. “The INTEL 8086/8088 Microprocessor. Chowdhury and Sunetra Chowdhury. Text Books: 1. Memory Organization. 8237 DMA Controller. “The INTEL 8086/8088 Msicroprocessor. 80386.K.

EE 5107



MODULE- I Introduction: Discrete-Time Signals, Shanon's sampling theorem, Difference equation description, characteristics of digital filters and time domain analysis, properties of discrete time system (linearity, time-variance, convolution), BIBO stability, Z-transformation and their application in solving difference equations, Relationship between Laplace and Ztransforms. (7) Text Books: 1. “Digital Signal Processing, Principles, Algorithms and Applications” ,John G. Proakis, Dimitris G. Mamalakis, 2. “Digital Signal Processing”, Alan V. Oppenheim Ronald W. Schafer, PHI, India. MODULE- II Frequency domain analysis: Discrete Time Fourier Transform (DTFT) and Discrete Fourier Transform (DFT), Periodic convolution, Direct evaluation of DFT, FFT algorithmsdecimation in time and frequency, Relationship between Fourier and Z-transforms (8) Text Books: 1. “Digital Signal Processing, Principles, Algorithms and Applications” ,John G. Proakis, Dimitris G. Mamalakis, 2. “Digital Signal Processing”, Alan V. Oppenheim Ronald W. Schafer, PHI, India. MODULE- III Digital Filter Structures: Direct form I&II, cascade, parallel and ladder realizations. (5) Text Books: 1. “Digital Signal Processing, Principles, Algorithms and Applications” ,John G. Proakis, Dimitris G. Mamalakis, 2. “Digital Signal Processing”, Alan V. Oppenheim Ronald W. Schafer, PHI, India. MODULE- IV Filter Function Approximations and Transformations: Review of approximations of ideal analog filter response, Butterworth filter, Chebyshev Type I & II. (6) Text Books: 1. “Digital Signal Processing, Principles, Algorithms and Applications” ,John G. Proakis, Dimitris G. Mamalakis, 2. “Digital Signal Processing”, Alan V. Oppenheim Ronald W. Schafer, PHI, India. MODULE- V Frequency Transformations: Frequency transformation in analog domain, frequency transformation in digital domain. (4) Text Books: 1. “Digital Signal Processing, Principles, Algorithms and Applications” ,John G. Proakis, Dimitris G. Mamalakis, 2. “Digital Signal Processing”, Alan V. Oppenheim Ronald W. Schafer, PHI, India.


MODULE- VI Design of IIR Filter: Design based on analog filter approximations, Impulse invariance method, Matched Z-transformation, Bilinear transformation. (7) Text Books: 1. “Digital Signal Processing, Principles, Algorithms and Applications” ,John G. Proakis, Dimitris G. Mamalakis, 2. “Digital Signal Processing”, Alan V. Oppenheim Ronald W. Schafer, PHI, India. MODULE- VII Design of FIR filters: Symmetric and antisymmetric FIR filters, design of linear phase FIR filters using windows and frequency – sampling methods, design of optimum equiripple linear phase FIR filters, comparison of FIR and IIR filters. (8) Text Books: 1. “Digital Signal Processing, Principles, Algorithms and Applications” ,John G. Proakis, Dimitris G. Mamalakis, 2. “Digital Signal Processing”, Alan V. Oppenheim Ronald W. Schafer, PHI, India. Reference Book: 1. “Digital Filter Design”, Antonious, Mc-Graw-Hill International Editions.



MODULE– I Basics of Communication System: Introduction, Types of Communication System, Advantages and disadvantages of Analog and Digital Communication, Base band and Band pass transmission. Text Books: 1. Electronic Communication Systems.4th Ed, Wayne Tomasi, Pearson Asia Education 2. Principles of Communication Systems”, 2/e, by H. Taub and DL Schilling, Tata McGraw Hills, ND. MODULE- II Random Signal, Sampling Theory and signal reconstruction: Probability, Mutually Exclusive events, Joint Probability, Statistical independence, Random variables, Cumulative Distribution function, Probability Density function, Mean and variance of random variables, Error function, Rayleigh Probability Density, Gaussian Probability Density. Sampling Theorem and Signal reconstruction Text Books: 1. Electronic Communication Systems.4th Ed, Wayne Tomasi, Pearson Asia Education 2. Principles of Communication Systems”, 2/e, by H. Taub and DL Schilling, Tata McGraw Hills, ND. MODULE- III Pulse Analog Modulation System: Analog Pulse modulation System, Demodulation of PAM Signal, Transmission of PAM signal, Transmission Bandwidth, Pulse time Modulation, Generation and demodulation of PWM and PPM signal Text Books: 1. Electronic Communication Systems.4th Ed, Wayne Tomasi, Pearson Asia Education 2. Principles of Communication Systems”, 2/e, by H. Taub and DL Schilling, Tata McGraw Hills, ND. MODULE- IV Pulse code Modulation System: Quantization of Signals, Quantizer, Quantization Error, Companding, PCM, PCM system, DPCM, DM, ADM, TDM, T1 digital system. Text Books: 1. Electronic Communication Systems.4th Ed, Wayne Tomasi, Pearson Asia Education 2. Principles of Communication Systems, 2/e, by H. Taub and DL Schilling, Tata McGraw Hills, ND. MODULE- V Digital Modulation Techniques: Introduction, Amplitude shift Keying(ASK),Phase shift Keying( PSK), Differential phase shift keying(DPSK), Frequency Phase shift keying(FSK), Quadrature Phase shift keying( QPSK), Comparison of different digital modulation systems. Text Books:


Tata McGraw Hills. Wayne Tomasi. Tata McGraw Hills. ND. 2/e. Principles of Communication Systems”. Average information.VI Information Theory Information Measure. Wayne Tomasi.4th Ed.4th Ed. Principles of Communication Systems”. Taub and DL Schilling. Electronic Communication Systems. Huffman’s code.4th Ed. Taub and DL Schilling. Bandwidth-S/N Trade off. by H. 2/e. Tata McGraw Hills. MODULE. Discrete Channel capacity. by H. Pearson Asia Education 2. content and information Rate. 37 . Electronic Communication Systems. Taub and DL Schilling. Wayne Tomasi. capacity of Gaussian channel. 2/e.VII Coding: Introduction. Text Books: 1.1. Shannon’s Theroems and channel capacity. Pearson Asia Education 2. ND. Pearson Asia Education 2. ND. Introduction to channel coding. Principles of Communication Systems”. MODULE. Entropy. Text Books: 1. Electronic Communication Systems. Shannon-Fano coding. by H. Source coding.

The Network Edge. MODULE. ConnectionOriented Transport: TCP.Data Communications and Computer Networks. Ethernet. File Transfer: FTP.. 2006 Reference Books: 1. PHI. Delay and Loss in Packet-Switched Networks. Pearson Education. Routing in the Internet. Routing Principles. ISPs and Internet Backbones. The Web and HTTP. Network Access and Physical Media. MODULE.IT 6103 COMPUTER NETWORKS AND SECURITY 1. Protocol Layers and their Service Models.VII Security in Computer Networks: What is Network Security?. Hubs. ErrorDetection and –Correction Techniques. and Switches. Principles of Congestion Control. Bridges. Text Book: 1. DNS. 4th Edn. Kurose & K.0 MODULE. The Internet Protocol (IP). TMH.VI Link Layer and Local Area Networks: Data Link Layer: Introduction and Services.The Internet’s Directory Service.0 38 . P. W. Principles of Reliable Data Transfer. Integrity.I Computer Networks and the Internet: What is the Internet?. J. New Delhi.III Transport Layer: Introduction and Transport –Layer Services.C.Down Approach. New Delhi. IT 6105 PRINCIPLES OF MULTIMEDIA 1. Hierarchical Routing. Multiple Access Protocols. Authentication.II Application Layer: Principles of Application Layer Protocols. MODULE. Asynchronous Transfer Mode (ATM). What’s inside a Router? IPv6. MODULE. F. MODULE. Principles of Cryptography. Ross.Computer Networking: A Top. New Delhi. Socket Programming with UDP. Gupta. 2006 2. Wireless Links. Connectionless Transport: UDP. A. 2nd Edition. Socket Programming with TCP.Data communications and Networking. 2006.IV & V Network Layer and Routing: Introduction and Network Service Models. Forouzan. PPP: The Point-to-Point Protocol. LAN Addresses and ARP. Multiplexing and Transport: UDP. Multicast Routing. The Network Core.

Multiple media. Musical note and pitch. Loudspeaker. Sound Card. Windows multimedia support. Relation between sampling rate and Bit Depth. MODULE. MPEG-7.VII Multimedia Architecture: Introduction. Quantization error. Distributed multimedia applications. 3D animation. Playback Architectures. JPEG image coding standard. MPEG-1 Audio.MODULE. Multimedia presentation and production. Digital to Analog conversion. Keyframes and Tweening. PC Video. MPEG-1 Video. Text compression. Fundamental characteristics of sound. MODULE. Utilities of multisensory perception. MIDI connections.VI Compression: Introduction. Synchronization. Software audio players. Digital Representation: Introduction. Insertion of text. Real-time protocols.I Multimedia-An Overview: Introduction. Microphone. Images: Introduction. Animation on the web. Creating movement. MIDI messages. Lossy/Perceptual compression techniques. Seeing color. Uses of multimedia. GIF image coding standard. Video signal formats. Waves. Image output on printer. Promotion of multimedia based content. Historical background. Pulse modulation. MODULE. Video recording formats and systems. Acoustics. MODULE. Camera. Basics of staff notation. Streaming technologies. Special effects. Audio and Multimedia.II Text: Introduction.III & IV Audio: Introduction. Hardware and Software requirements. Digital representation. Audio transmission. Analog Video camera. Specifications of digital images. Principles of animation. Multimedia 39 . Gamma and Gamma correction. Television broadcasting standards. MPEG-2 Video. Digital Video. Basic steps for image processing. MODULE. Digital Video standards. Fractals. Amplifier. Digital camera. Synthesizers. User interfaces. MPEG standards overview. General MIDI (GM) specifications. Color management system(CMS). Digital audio broadcasting. Audio recording devices. Digital Audio. Transmission of video signals. Audio recording systems. CODEC. Nature of sound waves. Image types. MPEG-2 Audio. Device independent color models. Types of Animation. Fourier representation. Lossless/Statistical compression techniques. Analog representation. Types of text. Some techniques of animation. Uses of Animation. Image processing software. Need for digital representation.V Video: Introduction. MPEG-4. Interface standards. Temporal relationships. Animation: Introduction. Rendering algorithms. Creating animation. Unicode standard. Characteristics of a multimedia presentation. Computer assisted animation. Image output on monitor. Musical instrument digital interface (MIDI). File formats. Video editing. Audio Mixer. File formats. Analog to Digital conversion. Video file formats and CODECs. Hardware support. Steps for creating a multimedia presentation. Audio file formats and CODECs. Types of redundancies. Font. Elements of audio systems. Types of compression. Color models. Importance and drawbacks of digital representation. Scanner. Psycho-Acoustics.

Steinmetz & K. P. Text Book: 1.Multimedia Systems Design.. New Delhi. Benchmarking of MMDBS. audio. New Delhi. Feature extraction of image. New Delhi.Multimedia: Computing. R. Pearson Edn.K. TMH. 2nd Edition. Nahrstedt. 2005.Audleigh & K. 2006 Reference Books: 1. R.database systems(MMDBS). PHI. 40 . Parekh – Principles of Multimedia. Feature extraction of Feature of extraction of video. Communications and Applications. 2. 2006.Thakrar.

System Entropies for the Binary Symmetric Channel. Shannon-Fano Coding. An Examples of Shannnon’s First Theorem. Channel Capacity. Entropy and Average Word-length. Shannon’s First Theorem.VI Error. McMillan’s Inequality. Equivalence of Linear Codes. Examples of Codes. 2000. The Gilbert – Varshamov Bound. Minimum Distance of Linear Codes. Reference Books: 1. Hamming Distance. Statement and Outline Proof of Shannon’s Theorem.0 MODULE. Costructing Instantaneous Codes. r-ary Huffman Codes. MODULE. CP 6101 DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS 1.W. 3rd Edition. Binary Huffman Codes. Coding and Cryptography.correcting Codes: Introductory Concepts. Minimum Distance. Optimality of Binary Huffman Codes. Kraft’s Inequality. G. New Delhi. The Standard Array. 1980. Comments on Kraft’s and McMillan’s Inequalities. Entropy of Extensions and Products. Extension of Shannon’s first Theorem to Information Channels. New Jersy.IT 6107 INFORMATION AND CODING THEORY 1. Instantaneous Codes. Uniquely Decodable Codes. 2002. R. Text Book: 1. An Examples of Improved Reliability.III Entropy: Information and Entropy.Information Theory. The Converse of Shannon’s Theorem. MODULE. R. Mutual Information for the Symmetric Channel.VII Linear Codes: Matrix Description of Linear Codes. Springer Publication.Jones & J. Average Word-length of Huffman Codes.Jones-Information and Coding Theory.A. Extensions of Sources. TMH. MODULE. Prentice-Hall. The Hamming Codes.0 41 . System Entropies.IV Information Channels: Notation and Definitions.II Optimal Codes: Optimality. MODULE. New Delhi.Coding and Information Theory. Properties of the Entropy Function. MODULE.V Using an Unreliable Channel: Decision Rules. The Binary Symmetric Channel. Hamming’s Sphere-packing Bound. Comments on Shannon’s Theorem MODULE. Mutual Information. Syndrome Decoding.Bose.M. Hamming. 2. The Golay Codes.I Source Coding: Definitions and Examples. Hadamard Matrices and Codes.

MODULE. Horowitz.puzzle problem. Galgotia Publication Reference Books: 1.Dasgupta et. application to 8. NPcompleteness of the satisfiability problem. merge sort. New Delhi . T. application to 0/1 Knapsack traveling salesman problems. New Delhi. MODULE. – Algorithms. New Delhi. and efficiency considerations. and polynomial. Pearson Education. 2005 3.I Basic Tools on Designing Algorithms: What is an algorithm? Algorithm specification and performance analysis. 2004 computer Algorithms. application to optimal storage on tapes. MODULE -VII NP-Hard and NP-Complete Problems: Introduction and basic concepts.Brassard & P. 0/1. G. optimal merge patterns and minimum weight spanning trees. application to multistage graphs.Kleinberg & E. Flow shop scheduling Backtracking: The general method. J. job sequencing with and traveling salesman problem. – Introduction to Algorithms – PHI. TMH. Ltd. Cormen application to binary search.queen problem and sum of subsets MODULE. et. MODULE -III The Greedy Method: The general method.. nondeterministic turing machine. NP-hard graph problems. Tardos – Algorithm Design.VI Branch and Bound: The Bratley – Fundamentals of Algorithms. all pairs shortest paths. Text Book: 1.2007 42 . Fundamentals of Pvt. 8. problem. New Delhi. quick sort.II Divide-and-Conquer: The general method. S..H. optimal binary search trees. randomized algorithms. finding the maximum and minimum. MODULE –IV & V Dynamic Programming: The general method. 2006 2. the problem of selection and Strassen's matrix multiplication. New Delhi. 2005 4. PHI. the classes of P and NP.

Reliability. New Delhi. IEEE standard of SRS.0 MODULE – I Introduction: Some Definitions. 7th ed. Peters & W. F. Walifull model. User requirements. Software characteristics. 43 . S. SW applications Software Processes: Software process models. R.CP 6109 SOFTWARE ENGINEERING 1. Pearson Education Publication. MODULE – III Software Requirements: Functional and non functional requirements. Requirements validation. spiral model. The software requirements document. User interface design UML: Class diagram. Object oriented Design. static analysis. White Box testing. MODULE – II Project Management: Management activities. John Wiley & Sons. 2000 3. MODULE – VII Software Change: Program Evolution Dynamic. I. J. Project duration and staffing. Collaboration diagram MODULE – V Verification and Validation: Verification and Validation Planning. Software Testing: Testing functions. Oxford Univ. FAQs about software engineering. New York. Quality Management: Quality assurance and standards. Sequence diagram. Reference Book: 1. Pedrycz– Software Engineering. Architectural Design. S/W inspection. Integration Testing. Project scheduling. Sommerville: Software Engineering. Quality control. Hudson – Software Engineering Fundamentals. 2000. S/W Maintance in detail.Behforooz & F. 2. the prototyping model. Unit testing. Press.Inc. Black box testing. Risk Management. Quality planning. System testing. Requirement management. Test care design. MODULE – VI Management: SW cost estimation: Estimation techniques.. A. Algorithmic cost modelling. 5th Edn. Text Book: 1. MODULE – IV Software Design: Design Concepts and Principles. Project planning.J. Quality of good SRS Requirement Engineering Process: Feasibility study. Requirements elicitation and analysis. System requirements. The evolving role of software. Pressman: Software Engineering: A Practiioners Approach. RAD and Incremental model. TMA.

Y. 1.interferences.Mc Graw – Hill Int. Characteristics of cell site and mobile antennas. Lee . Text Books : T. Edition. Effective Aperture etc.Wireless Communication Technology . B – ISDN. architecture and user access. MODULE – IV + V Mobile Cellular telecommunications: Basic Cellular systems. near . Vishwanathan . Singapore 2002. Brief descriptions and functions of different layers of ATM protocol. 3-. LP antenna. TDMA & CDMA MODULE – VI + VII Mobile Antennas: Antenna parameters (Gain. 44 . Digital Exchange ( basic concept only ).0 MODULE – I + II Introduction to Switching System: General principles of switching. Directivity. Discone antenna. Handoff.Telecommunication Switching Systems and Networks . co-channel and adjacent channel interferences. 3. Ltd. signaling and control.PHI. Horn antenna. Helical antenna. 2 -. Space Division and Time Division switching. and n – stage networks. concepts of ATM and user – network Interface. Channel assignment and frequency assignment. stored program control concepts. MODULE – III ISDN & ATM : ISDN user interface. components and operation of Cellular systems.SEVENTH SEMESTER IT 7101 Modern Telecommunication Systems 1. Singapore. frequency reuse channels. Spread Spectrum technique. Roy Blake . Multiple Access Techniques: Introduction to FDMA. Patch and slot antenna. 2/e.Thomson Asia Pvt. mobile propagation and fading. 1995. W. Blocking and Non – Blocking switching.) and radiation characteristics. Qualitative description of Dipole antenna.Mobile Cellular telecommunications . Efficiency.C. ISDN channels. PIFA. New Delhi. 2002 2.end .

Wireless Application Protocol (WAP). Mobile AD HOC Networks. Channel Equalization. Handoff Management. 2/e. Call Blocking and Delay at the Cell-Site. Location Management for Cellular Networks.Stallings – Wireless communications & Networks. New Delhi. MODULE-IV Fundamentals of Cellular Communications: Frequency Reuse and Mobility Management. Random Access. Large-Scale Path Loss and Shadowing. Cell Cluster Concept. Internet Protocol (IP). Reference Books: 1.IT 7103 Wireless Communications & Networks 1. Text Book: 1. MODULE-V Multiple Access Techniques: Multiple Access in a Radio Cell. Mark & W. New Delhi – 2007. MODULE-VII Wireless/Wireline Interworking: Mobile IP. Pearson Education. Channel Correlation Functions.W. Power Spectral Density. MODULE-VI Mobility Management in Wireless Networks: Introduction. Traffic Calculation. Spectral Efficiency. W. MODULE-II Bandpass Transmission Techniques for Mobile Radio: Introduction.Zhuang – Wireless Communications and Networking. Call Admission Control (CAC). Network Performance. MODULE-III Receiver Techniques for Fading Dispersive Channels: Overview of Channel Impairment Mitigation Techniques.0 MODULE-I Characterization of the Wireless Channel: Multipath Propagation Environment. J. Diversity. Location Management for PCS Networks. Pearson Education. Small-Scale Multipath Fading. Cochannel and Adjacent Channel Interference. Signal Space and Decision regions. ConflictFree Multiple Access Technologies. 45 . Transmission Control Protocol (TCP).2007. Linear Time-Variant Channel Model. Probability of Transmission Error. Digital Modulation.

H.0 MODULE-I Introduction: A brief history.IT 7105 Parallel & Distributed Computing 1. Distributed operating systems. Mutual Exclusion using powerful Primitives and R/W registers. Theory of Distributed Computing. Distributed database systems. Formal models for Message – passing systems. Example systems. 2. Crichlow – An Introduction to Distributed and parallel computing.Attiya & J. Wireless computing. 2/e PHI. Operating systems for distributed and parallel computing. Integrated Services Digital Network (ISDN). Asynchronous Transfer Mode. Flooring and Building a Spanning Tree. MODULE – VII Causality and synchronization. India Edition. MODULE – IV Distributed Computing: Introduction – Distributed Systems. Examples of using causality. J. Time: Capturing Causality. The client-server model. MODULE-II Communications and computer networks: Communications.M. 2/e John Wiley. 46 . MODULE – VI Fault to Lerant Concensus: Synchronous systems with Crash and Byzantine Failures. Computer organization for parallel and distributed computing. Broadcast and Converge Cast on a Spanning Tree. Anonymous Rings. Parallel programming languages and algorithms. Cache architectures in multiprocessors. Asynchronous and Synchronous Rings. The Leader Election Problems. New Delhi – 2002. Communications and computer networks. Massively parallel architecture. Network interconnection. 2006. Multicomputers and computer networks. Operating systems for parallel computing. Clock Text Books: 1. MODULE-III Operating systems for distributed and parallel computing: Network operating systems. Welch – Distributed Computing. MODULE V Mutual Exclusion in Shared Memory: Formal model for shared memory systems. Mutual Exclusion Problem. Multiprocessors. Distributed and Parallel system modeling. Non-von Neumann-type computers. Computer organization for parallel and distributed computing: Pipeline and vector processors. The Mutual Exlusion Problem. Constructing DFS Spanning Tree for a Specified Root and without a Specified Root. Impossibility in a synchronous systems. Computer network architecture Network topology.

CP 7103 Computer Graphics 1.Three Dimensional Display Methods. Polygon. Curved Lines & Surfaces. W.M. BSP-Tree Method & Area Subdivision Method. MODULE-II Output Primitives: Points and Lines. Bezier Curves and Surfaces. Text Book: 1. New Delhi. et. MODULE-VII Illumination Models and Surface Rendering: Light Sources.Principle of Interactive Computer Graphics. Harrington -Computer Graphics. Composite Transformations. Projection Transformations. Foley et. MODULE-V Three Dimensional Transformations and Viewing: Translation. Basic Illumination Models.Rendering Methods. Composite Transformations. S. Shears. D. Rotation.. MODULE-IV Three-Dimensional Concepts and Object Representation:. New Delhi. Newman. Video Display Devices. New Delhi. 1995. Homogeneous Coordinates. Line Drawing Algorithms (DDA & Bresenham’s). Cubic Spline interpolation methods. Different Input and Hard Copy Devices.Computer Graphics. Stereoscopic & Virtual Reality Systems. Back Face Detection. 2. 47 . A-Buffer Method. Polygon Surfaces. al. transformations between Coordinate Systems. 3. Pearson Education. 1994. Depth Sorting Method. Scan-Line Method.D. Raster and Random Scan Displays.0 MODULE-I Introduction and Overview of Graphics Systems: Use of Computer graphics. al. Window-to-Viewport Coordinate transformation.A Programming Approach .P. MODULE-III Two-Dimensional Geometric Transformations: Different types of transformations and their matrix representations. Polygon. Hearn & M. Raster and Random Scan Systems. Flat Panel Displays. 2005 Reference Books: 1. Curve and Text Clipping. Circle and Ellipse Generating Algorithms. 1993. Projections. Depth Buffer Method. Spline Representations. Refresh Cathode-Ray Tubes. Baker .A Fundamental of Computer Graphics Addition Wesley. Line. Conic Sections. Scaling. Color CRT Monitors. Direct View Storage Tubes. Graphics Softwares. MODULE-VI Visible Surface Detection Methods: Classification of Visible Surface Detection Algorithms. Clipping-Point. Affine transformations. Qudric Surfaces. London. Mc Graw Hill Publication.Parallel and Perspective. Reflection. Clipping. Three-Dimensional Viewing Devices. J. 2/e .Mc Graw Hill Publication.

Technologies. Text Book: . McGraw Hill. J. Calendar Time Component. MODULE – V Parameter Determination: Execution Time Component. Basic Concepts.Software Reliability: Measurement. Availability. New York.III Applications: System Engineering. Prediction & Application. Management of Operational Phase. Text Run Selection. Musa. et. Evaluation of S/W Engg. 48 . Other Consideration. MODULE – VI+VII Project Specific Techniques: Unobserved Failures. Modeling. Evolving Programs. Calendar Time Component. MODULE – II Selected Models: Execution Time Component. Failure Time Measurement. MODULE – IV System Definition: Failure definition.ELECTIVE IT 7111 Software Reliability & Testing MODULE – I Introduction: Software Reliability & Hardware Reliability. Changes in Environment. System Configuration. MODULE . D. Model Choice. Project Management.

2001. Text Book: 1. Distributed Reliability Protocols. Deadlock Management. Timestamp-based Concurrency Control algorithms. Semantic Integrity Control.II Distributed DBMS Architecture: DBMS standardization.ELECTIVE IT 7113 Distributed Database Systems MODULE . MODULE . Taxonomy of Concurrency Control Mechanisms.Tamer Ozsu & Patrick Valduries : Distributed Database Systems.VII Distributed DBMS Reliability: Reliability Concepts and Measures.III Distributed Database Design: Alternative Design Strategies. Centralized Query Queries. Allocation. Failures and Fault Tolerance in distributed Systems. 2/e. Education. MODULE . Pearson 49 . Global Directory Issues. Join Algorithms. Relaxed concurrency control.V Introduction to Transaction Management: Definition of a Transaction. Dealing with Site Failuros. MODULE . Distributed DBMS Architecture. Local Reliability Protocols. Promises of DDBSs. Network Partitioning. MODULE . MODULE .I Introduction: Distributed Data Processing. Failures in Distributed DBMS. Types of Transactions. Data Security.IV Optimization of Optimization. Complicating Factors. Architectural Considerations. Distributed Ordering in Queries: Fragment Query Optimization. Semantic data Control: View Management.VI Distributed Concurrency Control: Serializability Theory. Architectural Models for Distributed DBMSs. Properties of Transactions. Distributed Query Optimization MODULE . Optimistic Concurrency Control Algorithms. Fragmentation. Distributed Design Issjues. Locking – based Concurrency Control Algorithms. Problem Areas. M.

Data Encoding Techniques. Useful Publications. The Transmission of Information. Distributed Applications: Electronic Mail. MODULE-II Distributed Data Processing: Centralized Versus Distributed Processing. MODULE-IV Data Communication Fundamentals: Analog and Digital Data Communication. Distributed Data.A.L. Synchronous Time-Division Multiplexing. Wireless Transmission. Transmission Media: Guided Transmission Media. Middleware. Data Link Control Protocols. Electronic Data Interchange. The Nature of Business Information Requirements. D. MODULE-V + VI Data Link Control: Flow Control. Intranets. Enterprise Application Integration. Stadards. Transmission Efficiency: The Need for Transmission Efficiency. MODULE-VII Client/Server and Intranet Computing: The Growth of Client/Server Computing. Willian Stallings – Business Data Communications 4/e. 6/e. The Manager’s Dilemma.Stamper and T. Error correction. Management Issues.2004.Case Education. Internet Addressing. New Delhi. Client/Server Applications. Text Book: 1. Internet Resources.-2007. Transmission Impairments and Channel Capacity. Case Studies. Pearson 50 . Frequency-Division Multiplexing. The Internet Addressing and Services: The Internet. Distributed Data Processing. Interfacing. Software. MODULE-III Data Transmission: Signals for Conveying Information. Networking Implications of DDP. Extranets. Quality of Service. –Business Data Communications. Error Detection. Networks. Asynchronous and Synchronous Transmission. Pearson Education. Data Compression. Statistical Time-Division Multiplexing. New Delhi. Integrated Services. Communications. Reference Book: 1.ELECTIVE IT 7115 Business Data Communications MODULE-I Introduction: Information and Communication. Forms of Distributed Data Processing. Differentiated Services.

Purchasing on line. Technology. Reference Book: 1. Electronic Data Interchange (EDI) : Introduction. Examples. Advantages and Disadvantages of electronic market. EDI Technology. Transaction. Text Book: 1. Online Payments. Online share sealing. EDI implementation. Elements of E-Commerce: Elements. Introduction. Ravi Kalakota & Andre B. Grocery Supplies. Technologies and Applications.commerce. Competitive strategy. Business Environment. e-shop. Internet e-commerce. EDI and Business. Benefits. Electronic Data Interchange.V Electronic Market: Markets.ELECTIVE IT 7117 E-Commerce MODULE . e-commerce in passenger Air Transport. EDI Technology.IV Case Study: Case Study. Business to Business Electronic Commerce: Inter-orgranisational Transactions. Business to Consumer Electronic Commerce: Consumer Trade Organizations. e-commerce Technology. Definition. Advantages & Disadvantages. Internet Banking. First Mover advantage.Electronic Commerce A Manager’s Guide Pearson Education.VI Future of electronic markets: Electronic Data Interchange (EDI). EDI Security. Whinston . EDI implementations.I Introduction to Electronic Commerce: Electronic Commerce. ecommerce & evaluation. introduction. TMH. EDI Security.III Business strategy: Introduction to Business Strategy. Electronic Markets.E-COMMERCE: Strategy. Competitive advantage using e-commerce. e-diversity. MODULE . 2000. Electronic Market. Examples. MODULE . New Delhi. TCP/IP. Definition.VII Inter Organizational e-commerce: Transactions. 51 . E-Business: Introduction. EDI Communications. Usage of electronic markets. EDI Communications. Inter Organizational: e. e-commerce implementation. MODULE . Strategy Formulation and Complementation Planning. Internet e-commerce security. MODULE . Page on the Web : TAIL Basic. Scope of Electronic Commerce. Benefits. Purchasing on line. Supply Chains. MODULE . Electronic Commerce and Tmade cycle. Porter’s Value Chain Model Inter organizational Value chains Competitive advantage. Internet Components. Existing Business strategy. MODULE . e-shop. EDI Business. Internet: Internet. Gambling on the Net. Strategic implications of IT. David Whiteley .II Business Strategy in an Electronic Age: Value Chain. Porter’s Model. 2005. Definition of Electronic commerce. Business Capability. Internet Commerce.

M. Frequency Domain Methods. The Information Channel. Some Properties of the Two-Dimensional Fourier Transform. Elements of Information Theory – Measuring Information.Pratt. Rafael.Fundamentals of Digital Image Processing. MODULE – IV + V Image Restoring : Degradations Model . Interpixel Redundancy.Definitions. Histogram Processing. Effects of Diagonalization on the Degradation Model.K.Digital Image Processing. Smoothing Filters. Lossy Compression – Lossy Predictive Coding. Constrained Restoration. Sharpening Filters. Imagining Geometry.. Fundamental Coding Theorems. Lowpass Filtering. 3/e Edn. A Simple Image Model. Gonzalez & Richard E. Geometric Transformation. 2007.II Image Transforms: Introduction to the Fourier Transform. Transform Coding. 52 .. Text Book : 1. MODULE .al Image Processing. Learning.III Image Enhancement : Spatial Domain Methods. Generation of Spatial Masks from Frequency Domain Specifications. John Wiley & sons. Using Information Theory.Woods. 2006 2. C. Elements of a Digital Image Processing System. PHI. Fidelity Criteria.Jain. Some Basic Relationships between Pixels. A.K. Algebraic Approach to Restoration. Sonka et. Image Compression Models – The Source Encoder and Decoder. MODULE – VI + VII Image Compression: Fundamentals – Coding Redundancy. Some Simple Intensity Transformations.ELECTIVE CP 7107 Digital Image Processing MODULE . Analysis and Machine Vision.I Introduction: Background. 2/e Pearson Education. Image Averaging. 2/e. Block Circulant Matrices. W. Circulant Matrices. Fundamental Steps in Image Processing.-Digital Image Processing. Restoration in the Spatial Domain. Sampling and Quantization. Highpass Filtering. The Channel Encoder and Decoder.2006 Reference Books : 1. Psychovisual Redundancy. Unconstrained Restoration. Background. Inc. Inverse Filtering – Formulation.. Digital Image Fundamentals: Elements of Visual Perception. New Delhi. India Edition. New Delhi . Digital Image Representation. Other Separable Image Transforms. Diagonalization of Circulant and Block-Circulant Matrices. 2006 3. Error-Free Compression–Variable-Length Coding. Removal of Blur Caused by Uniform Linear Motion. MODULE . Degradation Model for Continuous Functions. The Discrete Fourier Transform. Bit-Plane Coding. Image Subtraction. Lossless Predictive Coding. Thomson.

53 . Least-Squares Neurocomputing Approach for Solving Systems of Linear Equations.III Solving Matrix Algebra Problems With Neural Networks: Introduction. MODULE .Component Regression. Parametric System Identification of Linear Systems Using PLSNET. A Generalized Robust Approach for Solving Systems of Linear Equations Corrupted with Noise. Identification of Linear Systems with ARMA Models. Systems of Simultaneous Linear Algebraic Equations. QR Factorization. LU Decomposition. Spectral Factorization. Distributed Time-Lagged Feedforward Neural MODULE .I Recurrent Networks And Temporal Feedforward Networks: Introduction . And Estimation Using Neural Networks: Introduction. MODULE . Identification and Control of Nonlinear Dynamical. Nonlinear System Representation. Simulated Annealing. Overview of Temporal Feedforward Networks. 2002. M. MODULE . Boltzmann Machine . Kostanic – Principles of Neurocomputing for Science & Engineering.VII Identification. MODULE – IV+V Solution Of Linear Algebraic Equations Using Neural Networks: Introduction. New Delhi. Learning Algorithms for Neural Network Adaptive Estimation of Principal Components. Simple Recurrent Network. Ham & I. Time-Delay Neural Networks. Neural Networks for Nonlinear Continuous Constrained Optimization Problems. Regularization Methods for Ill-Posed Problems with Ill-Determined Numerical Rank. Linear System Representation. Conjugate Gradient Learning Rule for Solving Systems of Linear Equations.ELECTIVE CP 7115 Neural Networks & Applications MODULE . Overview of Recurrent Neural Networks. Principal-Component Analysis. Inverse and Pseudoinverse of a Matrix. Text Book: 1. Autoregressive Moving Average Models . TMH. Principal.II Neural Networks For Optimization Problems: Introduction. Partial Least-Squares Regression. Matrix Splittings for Iterative Discrete-Time Methods for Solving Linear Equations. Neural Networks for Quadratic Programming Problems. Neural Network Approach for the Symmetric Eigenvalue Problem. Control.Eigenvalue Decomposition (EVD) (Symmetric Eigenvalue Problem). Neural Networks for Linear Programming Problems. A Neural Network Approach for Partial Least-Squares Regression. Hopfield Associative Memory . Schur Decomposition.VI Statistical Methods Using Neural Networks: Introduction.

Quadratic Programming. 3/e. Convex Programming. The Branch-and-Bound Technique and Its Application to Binary Integer Programming. Graphical Illustration of Nonlinear Programming Problems. TMH. Some BIP Applications. Text Book: 1. The Shortest-Path Problem. The Algebra of the Simplex Method. The Terminology of Networks. J. MODULE -V Integer Programming : Prototype Example. The revised Simplex Method. An Interior-Point Algorithm. Innovative Uses of Binary Variables in Model Formulation.ELECTIVE CP 7117 Optimization Techniques MODULE -I Introduction to Linear Programming: Prototype Example. The Role of Duality Theory in Sensitivity Analysis. Some Formulation examples. Types of Nonlinear Programming Problems. MODULE -III Other Algorithms for Linear Programming: The Dual Simplex Method. The Linear Programming Model. McMillan.A. Setting Up the Simplex Method. New Delhi-2007. MODULE -VI Nonlinear Programming : Sample Applications. MODULE -IV Dynamic Programming: A Prototype Example for Dynamic Programming. Adapting to Other Primal Forms. Probabilistic Dynamic Programming. One-Variable Unconstrained Optimization. The Upper Bound Techniques. Tie Breaking in the Simplex Method. Multivariable Unconstrained Optimization.Queueing Models Involving Nonexponential Distributions. Assumptions of Linear Programming.J. Network Optimization Models: Prototype Example. Reference Books: 1. Parametric Linear Programming.K. A Branch-and-Bound Algorithm for Mixed Integer. Pearson Education. Additional Examples. MODULE -VII Queueing Theory : Prototype Example. The Birth-and-Death Process. Some Perspectives on Solving Integer Programming Problems. Characteristics of Dynamic Programming Problems. The Maximum Flow Problem. 2007. MODULE -II The Theory Of The Simplex Method: Foundations of the Simplex Method. The Karush-KuhnTucker (KKT) Conditions for Constrained Optimization. Lieberman – Operations Research. Separable Programming . Basic Structure of queueing Models. 54 . India Ltd. 8/e. The Network Simplex Method. 8th Edn. New Delhi – 2006. Duality Theory And Sensitivity Analysis: The Essence of Duality Theory. Examples of Real Queueing Systems. 2. Solving Linear Programming Problems. Economic Interpretation of Duality. The Minimum Cost flow Problem. Postoptimality Analysis. Sharma – Operations Research. The Minimum Spanning Tree Problem. The Simplex Method in Tabular Form. S. Deterministic Dynamic Programming.The Simplex Method: The Essence of the Simplex Method. Some Classic Case Studies. The role of the Exponential Distribution. Queueing Models Based on the Birth-and Death Process .Taha – Operations Research. Primal-Dual relationships. Hiller & G. H. A Fundamental Insight. Adapting to Other Model Forms.

Eukaryotic Genomes. MODULE –V Character–Based Methods of Phylogenetics: Parsimony: Informative and Uninformative Sites. Valence. Alternative Spicing. Secondary. Polypeptide Composition. Algorithms for Modeling Protein Folding: Lattice Models. The Genetic Code. Introns and Exons. Accuracy of Predictions. Structure Prediction: Comparative Modeling. The Nature of Chemical Bonds: Anatomy of an Atom.ELECTIVE CP 7123 Bio-informatics MODULE – I Molecular Biology and Biological Chemistry: The Generic Material: Nucleotides. MODULE – II Data Searches and Pairwise Alignments : Dot Plots. MODULE –IV History of Molecular Phylogenetics: Advantages to Molecular Phylogenies. MODULE -VII Protein and RNA Structure Prediction : Amino Acids. Species Trees. Multiple Sequence Alignments. Open Reading Frames: Introns and Exons. Genomic Information Content: C-Value Paradox. and Quaternary Structure. Kimura’s Two-Parameter Model. Tertiary and Quaternary Structure: Hydrophobicity. Polymerase Chain Reaction. Human Origins. Secondary Structure: Backbone Flexibility. Prokaryotic Gene Structure: Promoter Elements. Dynamic Programming: The Needleman and Wunsch Algorithm. Open Reading Frames. Isochores. Scoring Matrices. FASTA and Related Algorithms. NeighborJoining Methods. Cloning. Estimation of Branch Lengths. Serial Analysis of Gene Expression. Global and Local Alignments: Semiglobal Alignments. Most Stable Structures. Disulfide Bonds. Gaps: Simple Gap Penalties. Protein Structure and Function: Primary Structure. Variations in Evolutionary Rates Between Genes. Tertiary. Distance Matrix Methods: UPGMA. Database Searches: BLAST and Its Relatives. Weighted Parsimony. Alignment Scores and Statistical Significance of Database Searches. Microarrays. Gene vs. Transitions and Transversions. MODULE – III Substitution Patterns: Estimating Substitution Numbers: Jukes-Cantor Model. Energy Functions and Optimization. Origination and Length Penalties. Regulatory Protein Binding Sites. The Central Dogma of Molecular Biology. Models With Even More Parameters. Reassociation Kinetics. Neighbor’s Relation Method. Character and Distance Data. Substitutions Between Protein Sequences. Conceptual Translation. Consensus Trees. Rooted and Unrooted Trees. Gel Electrophoresis. Open Reading Frames. Termination Sequences. Codon Usage Bias. Orientation. Multiple Sequence Alignments. The Smith-Waterman algorithm. Inferred Ancestral Sequences. Electronegativity. GC Content in Prokaryotic Genomes. Active Structures vs. Simple Alignments. Off-Lattice Models. Phylogenetic Trees: Terminology of Tree Reconstruction. Base Pairing. Threading : Reverse Protein Folding. Maximum Likelihood Approaches. Predicting RNA Secondary Structures. Parametric Tests. Transformed Distance Method. Hydrophilicity and Hydrophobicity. Heuristic Searches. Strategies for Faster Searches: Branch and Bound. DNA Sequencing. Eukaryotic Gene Structure: Promoter Elements. Blotting and Hybridization. MODULE –VI Genomics and Gene Recognition : Prokaryotic Genomes. Gene Structure and Information Content: Promoter Sequences. Tree Confidence: Bootstrapping. Molecular Phylogenies: The Tree of life. Gene Expression: cDNAs and ESTs. Molecular Biology Tools: Restriction Enzyme Digests. GC Content in Eukaryotic Genomes: CpG Islands. 55 . Comparison of Phylogenetic Methods. Unweighted Parsimony. The Chou-Fasman and GOR Methods. Prokaryotic Gene Density.

V.Bioinformatics: Methods and Applications. Oxford (Indian Edn). PHI. PHI. A. Srinivas .C.Bioinformatics: A Modern Approach. New Delhi-2005. Raymer .E. Rastogi et.. S. Reference Books: 1.L. New Delhi-2005. 56 . Krane & M. New Delhi-2003. 2. New Delhi-2004. D. Lesk – Introduction to Bioinformatics. Pearson Education.Fundamental Concepts of Bioinformatics.R.M.Text Book: 1.

The Role of Operation Specifications. Object Interaction and Collaboration. Adding Further Structure. Processor Allocation. MODULE-VI System Design: Introduction. Interaction Sequence Diagrams. 57 . Object-Oriented languages Today. Quality Guidelines. Measurable Objectives of Analysis and Design. The Architecture of the Presentation Layer. Qualities and Objectives of Analysis and Design. Design Patterns.Farmer – Object.ELECTIVE CP 7125 Object Oriented Analysis and Design MODULE-I What Is Object-Orientation: Introduction. Modelling Concepts: Introduction. Development Standards. Collaboration Diagrams. Describing Operation Logic. Prototyping the User Interface. MODULE-VII Design Patterns: Introduction. User Interface Design Patterns. TMH. Creating an Operation Specification. Designing Boundary Classes: Introduction. Contracts. What Must a Requirements Model Do. Measurable Objectives in Design. Use Case Realization. Benefits and Dangers of Using Patterns. System Design and Detailed Design. Moving Into Design: Introduction. User Requirements. Software Development Patterns. Planning for Design. Logical and Physical Design. Basic Notation. Fact Finding Techniques. Basic Concepts. User Involvement.Oriented Systems Andlysis and Design Using UML 2nd edn. Requirements Analysis: Introduction. Component-based Development. Requirements Capture and Modelling. Specifying Operations: Introduction. States and Events. Design for Implementation. Documenting Requirements. CRC (Class Responsibility Collaboration) Cards. Documenting PatternsPattern Templates. Prioritizing Design Trade-offs. How to Use Design Patterns. Models and diagrams. MODULE-II + III Requirements Capture: Introduction. Software Development Patterns. Designing Associations. The Origins of ObjectOrientation.Mc Robb and R.Bennett. Integrity Constraints. Designing Classes. Further Notation. Use Cases. Drawing Activity Diagrams. Modelling the Interface Using Statecharts. The Class Diagram. The Class Diagram Revisited. Model Consistency. Summary. S. MODULE-V Specifying Control: Introduction. Object Constraint Language. Class Specification. Preparing a Statechart. Interfaces. MODULE-IV Object Interaction: Introduction. S. OBJECT DESIGN: Introduction. Refining The Requirements Model: Introduction. Designing Operations. New Delhi – 2007. Software Architecture Concurrency. Assembling the Analysis Class Diagram. The Major Elements of System Design. Text Books: 1. How is Design Different from Analysis. Drawing a Class Diagram. Normalization. Designing Interaction with Sequence Diagrams. Criteria for Good Design. Data Management Issues. Consistency Checking.

G. New Delhi. M.Reference Book: 1. Thomson Learning. Jackson and S. J.Blaha and J. 2.2/e.Oriented Modeling and Design with UML 2.2007.1994. India Edition.Benjamin/Cumming. CA. Satzinger. Booch – Object Oriented Analysis and Design with Applications.D. 3. B. 58 . 2007./e.W.Runbangh – Object.R. Pearson Education. Burd – Object –Oriented Analysis and Design.

MODULE – II & III Assemblers: Basic Assembler Functions. L. D. New Delhi. Machine – Independent Loader Features. System Software and Machine Architecture. RISC Machines. L. McGraw Hill . New Delhi. MODULE – VII Software Engineering Issues: Introduction to Software Engineering Concepts. 2004 Reference Book: 1. Donovan – System Programming. 1993.M. Tata McGraw Hill . 2/e. Loader Design Options. Macro Processor Design Options. The Simplified Instructional Computer (SIC). 2. 2000 59 . Machine – Independent Macro Processor Features. MODULE – VI Macro Processors: Basic Macro Processor Functions. Text Book: 1. Machine . Dhamdhere – System Programming and Operating Systems. MODULE – IV & V Loaders and Linkers: Basic Loader Functions. System Specifications. Object – Oriented Design. 3/e. New Delhi. Machine – Dependent Assembler Features. Machine – Independent Assembler Features.ELECTIVE CP 6103 System Programming MODULE – I Background: Introduction. Pearson Education. Implementation Examples. Procedural System Design.J.. Beck – System Software – An Introduction to Systems Programming. Implementation Examples.Dependent Loader Features. Traditional (CISC) machines. J. Implementation Examples. Assembler Design Options. System Testing Strategies.

Symbol tables. K.Holub -Compiler Design in C. The phase of a compiler. New Delhi. Lexical Analysis: The role of the lexical analyzer. Language facilities for dynamic storage allocation.Aho. Bottomup parsing. Storageallocation strategies. R. Abstract stack machines.ELECTIVE CP 6105 Compiler Design MODULE -I Introduction to Compiling: Compilers. Constraction of syntax trees. Bottom-up evaluation of S-. Techniques. and Tools..P.V. Run-Time Environments: Source language issues. New Delhi. McGraw Hill. Dynamic storage allocation techniques. MODULE -II A Simple One-Pass Compiler: Syntax definition. Learning. The Principle sources of optimization. Pearson Education. Parsar generators.C. Lexical analysis. Sethi et. Declarations. Text Book: 1.The Theory and Practical of Compiler Writing. MODULE –III & IV Syntax Analysis : The role of the parser. Top-down parsing. Boolean Singapore. 2nd Edition. Design of a lexical analyzer generator. Prentice Hall of India. L-attributed definitions. Syntax-directed translation.I. 2006 Reference Books: 1. Assignment statements. Parsing. A. A language of specifying lexical analyzers. Thomson. Parameter passing. A. Access to nonlocal names. 60 . A translator for simple expressions. Run-time storage management. New Delhi. Cousins of the compiler. The grouping of phases. Specification of a simple type checker.Compiler Construction: Principles and Practice. 3. Input buffering.Compilers Principles. Analysis of the source program. J. Writing a grammar. 1993. MODULE VII Intermediate Code Generation: Intermediate languages. Code Generation: Issues in the design of a code generator. Type Checking: Type systems. Basic blocks and flow graphs. Specification of tokens. Louden. Incorporating a symbol table. Storage organization. Top-down translation. attributed definitions. Tremblay . Code Optimization: Introduction. Operator-precedence parsing. LR parsars. Using ambiguous grammars. Compiler-constructions tools. 1995 2. Target machine. Recognition of tokens. MODULE V & VI Syntax-Directed Translation: Syntax-direct definitions. 2005.

G. Outlier Analysis.Data Mining Concepts & Techniques Publisher Harcout India. Languages and System Architecture: Data Mining Primities. Prediction.VII Cluster Analysis: Types of Data in Cluster Analysis. Mining Descriptive Statistical Measures in Large Databases. Private Linited. COLAP. Relational Databases. Grid – Based Methods. TMH. Discretization and concept Hierarchy Generation. 2. New Delhi – 2004 3. MODULE . DMQL. Data Mining Primitives. Partitioning methods. Classification by decision Tree Induction. From Association Mining to Correlation Analysis. Architectures of Data Mining Systems. New Delhi. Bayesian Classification. Analytical Characterization. New Delhi – 2006. Reference Books: 1. Classification Accuracy.I Data Mining : Introduction. Transactional databases. MODULE . Data Integration and Transformation. MODULE . Gupta – Introduction to Data Mining with case Studies. MODULE . Multilevel Association Rules from Transaction Databases. Hierarchical methods. A Multidimensional data Model. 2006. Sridhar – Data Mining.II Data Warehouse : Introduction. MODULE – IV Concept Description: Data Generalization & Summarization – Based Characterization. Classification of Data Mining Systems.EIGHTH SEMESTER IT 8101 Data Mining & Warehousing 1. Other Classification.III Data Processing: Data Cleaning. Data Reduction. Classification by Back propagation. Text Books: 1. From Data warehousing to Data Mining. H. Pearson Education. Classification based on concepts & Association Rule. A. Single – Dimensional Booloan Association Rules. Data Mining Functionalities.V Mining Association Rules in Large Databases : Association Rule Mining. Dunham & S. Advanced database Systems and Application. Berson & S. Jiawei Han & Micheline Kamber .K. Multi Dimensional Association Rules from Relational Databases. Model – Based Clustering Methods.M. MODULE . Data Cube Technology. Data Warehouse Implementation. Mining Complex Types of Data. Data Warehouse Architecture. PHI. Smith – Data Warehousing Data Mining. Density – Based Methods.0 MODULE .VI Classification and Prediction : Classification & Prediction. 61 . Major Issues in Data Mining. Issues Regarding Classification & Prediction. Constraint – Based Association Mining. Data Warehouses.J. Mining class Comparisons.

NonProduction System Architecture. Structures Used in Matching. MODULE – V Structured Knowledge: Graphs. 3. Classes. New Delhi. Frames and Related Structures: Introduction. TMH. 2006. Messages and Methods. Miscellaneous Topics. PROLOG and Other AI Programming Languages. Informed Search. Text Book: 1. New Delhi.W. Modal and Temporal Logics. No deductive Inference Methods. 2/e. TMH. Knowledge System Building Tools. New Delhi. Associative Networks. Knowledge: General Concepts: Introduction. Ad-Hoc Methods. Possible World Representations. Simulation Example using an OOS Program.CP 8101 Artificial Intelligence & Expert Systems 1. Iteration and Recursion. Default Reasoning and the Closed World Assumption. MODULE – VII Knowledge Organization and Management: Introduction.. 62 . Matching Like Patterns.H. MODULE – III Knowledge Representation : Introduction. Representations Using Rules. Expert Systems Architectures: Introduction.Artificial Intelligence. Object-Oriented Representations: Introduction. E. Knowledge-Based Systems. Reference Books: 1. Preliminary Concepts. MODULE – II LISP and Other AI Programming Languages: Introduction to LISP : Syntax and Numeric Function. MODULE – IV Dealing With Inconsistencies and Uncertainties: Introduction. Bayesian Probabilistic Inference. Partial Matching. Syntax and Semantics for Propositional logic. Knowledge Manipulation. New Delhi. Winston . Output and Local Variables. 2005. Property Lists and Arrays. Predicate Completion and Circumscription. Knowledge Acquisition and Validation. PHI. Patterson . Examples of Search Problems. Predicates and Conditionals. P. Truth Maintenance Systems. Pearson Edition. Knight . Functions. Dealing with uncertainty. Syntax and Semantics for FOPL. Searching And-Or Graphs. Rule Based System Architecture. Inference Rules. Definition and Importance of Knowledge.Artificial Intelligence. Basic List Manipulation Functions in LISP. 2006. Properties of Wffs. Rolston. The Resolution Principle. Dan W. Dumpster-Shafer Theory.0 MODULE – I Overview of Artificial Intelligence: Definition & Importance of AI. Acquisition of Knowledge. MODULE – VI Search and Control Strategies: Introduction. Conceptual Dependencies and Scripts. Uninformed or Blind Search. Probabilistic Reasoning: Introduction.Principles of AI & Expert System Development. Integrating Knowledge in Memory. D. Frame Structures.Introduction to Artificial Intelligence and Expert Systems. Measures for Matching. Representation of Knowledge. 3/e. Indexing and Retrieval Techniques. Knowledge Organization. Input. Rich & K. Memory Organization Systems. Conversion to Clausal Form. Overview of Objects. Matching Techniques: Introduction. 2.

Activity III: Determining How Representative the Fitted Distributions Are.D. Techniques for Accessing Sample JobShop Model. 2004.The nature of Simulation. Multiteller Bank with Jockeying.Introduction. A. Generating Continuous Random Variates. Gordon – System Simulation. Banks et. Testing Random-Number Generators. Activity II: Estimation of Parameters. Kelton. Models. Tata McGraw Hill.Introduction.Law & W. Activity I: Hypothesizing Families of Distributions.Classfication of Simulation Software. New Delhi. 63 . Comparison of Simulation Packages with Programming Languages.F. India Edition. Discrete. 2007. Single-Server Queueing Simulation with Simlib. Applied Simulation Modeling. Efficient Event-List Manipulation. Generating Discrete Random Variates.Introduction.CP 8103 Simulation & Modeling 1.Linear Congruential Generators.List Processing in Simulation. 2006. MODULE -VI Random. Text Book: 1. New Delhi. Verification of Simulation Computer Programs. 3. 2006. Seila et. Advantages. Pearson Education. Systems. 2. New Delhi.0 MODULE-I Basic Simulation Modeling:. Steps in a Sound Simulation Study. Alternative Approaches to Modeling and Coding Simulations. General-Purpose Simulation Packages. MODULE -V Selecting Input Probability Distribution:. Time-Shared Computer Model. PHI. Object-Oriented Simulation. and Appropriately Detailed Simulation Models:Introduction and Definitions. General Approaches to Generating Random Variates. MODULE -VII Generating Random Variates:. MODULE -III Simulation Software:. Guidelines for Determining the Level of Model Detail. Disadvantages. J. Credible.Event Simulation. Discrete – Event System Simulation. and Simulation. Useful Probability Distributions. Reference Books: 1. and Pitfalls of Simulation.Simulation Modeling and Analysis. A. 4/e. G. Other Kinds of Generators.Number Simulation of an Inventory System. Techniques for Increasing Model Validity and Credibility. 4/e. MODULE -IV Building Valid. Simulation of a Single-Server Queueing System. Other Types of Simulation. MODULE -II Modeling Complex Systems:. Desirable Software Features.M. Thomson Learning.

Span of Decentralisation.I Concepts of Managements: Definition. Importance. Development and Welfare. 3. nature and scopes.Principle of Management Essentials of management. Personnel. 6. MODULE . Controlling: The elements. Drucker P. May and Roethlisberger. Line and Staff Relationship. MODULE . Koontz et. techniques of control. staffing.Management theory and Practice. Directing: Leadership and Supervision.W.Process of Managements. 2. and Method of Decision-Making.0 MODULE . Committees. Bureaucracy Introduced by Max Weber. Newman et. Formal and Informal Organisation.F .E. Type of formal organisations. 7. Management. MODULE – VI + VII Staffing: Selection. Finance.MB 6001 Principle of Management .Management-Task and Responsibility.Classics in Management Preface. process and style of Control.V Organisations: Definition. Taylor and his followers. Process Management-Introduced B. Motivation and communication. Behavioral Science approach-By Mc Gregor Maslow and others. Beach E. Merril H. Policies. Forms of Organisation. Relation with other social sciences and industry. 5.H. Nature. NCO-classical theory of management. overall view of MODULE – II + III Evolution Of Management Thought: Classical theory of management. Planning: Concept. Directing and controlling. aluman Relations-B. raining.The Practice of Management.F. Social Responsibility of Business: Reference Books: 1. Objectives.F .al . Departmentation. Fayol and others.IV Executive Functions: Production. strategies. Procedure. Organisation.L. 4. Marketing. .F. Theo Haiman .The Principle and Practical Management Chapter 1. Scientific Management-F. Management Functions: Planning. Recruitment. Drucker P. Modern Management theories peter Drucker. 64 . Theories of Organisation.

Oracle Corporation. Text Book : 1. TMH. India Edition 2007. People Soft. EIS (Executive Information system). Business Modeling. Vendors. Monk & B. CAD/CAM. Reasons of Failure. MODULE . OLAP. Reference Books: 1. Product Data Management. Data Management. Consultants & User’s: In – house Implementation – pros & cons. BAAN.VII Vendors. Quality Management. Finance. Bill of Material. Thomson Learning.ELECTIVE IT 8111 Enterprise Resource Planning MODULE . ERP Implementation Life Cycle: MODULE .I Introduction to ERP: Evolution of ERP. Integrated Data Model. DRP (Distributed Requirement Planning).II Enterprise.III ERP and Related Technologies: BRP (Business Process Reengineering). MODULE -V Benefits of PDM: ERP Modules. 2/e. New Delhi 2001. MIS (Management Information System). Plant Maintenance. What is ERP. Advantages of ERP. E. MRP-II. Closed loop MRP. MRP (Material Requirement Planning). DSS (Decision Support System).VI Benefits of ERP: ERP Market: SAP. End-users. Material Management. Alexis Leon .Enterprise Resource Planning. Supply Chain Management. MODULE . Consultants. Reasons for the growth of the ERP market. ERP Case Studies.An overview: Integrated Management information.IV A Manufacturing Perspective: ERP. MODULE . 65 . Future Directions in ERP. Wagner – Concepts in Enterprise source planning. MODULE .

Business Pressures.K. and Mobile Commerce: Wireless Technologies. and IT Support. Managing Information Resources. Wireless Security. Reference: 1. Strategies for Acquiring IT Applications. Database Management Systems. Functional Information Systems. Acquiring IT Application: Planning for and Justifying IT Applications. Enterprise and Executive Decision Support Systems. Data Warehousing. Mobile Computing and Mobile Commerce. Data and Knowledge Management: Managing Data. L. R. Why Should You Learn About Information Technology. and Informationsecurity: Ethical Issues. Examples of Information Systems. Outsourcing and Application Service Providers. 66 . The Traditional Systems Development Life Cycle. Wireless. John Wiley. Knowledge Management. Threats to Information Security. Electronic Data Interchange and Extranets. Text Book: 1. Privacy. Alternative Methods and Tools for Systems Development. MODULE -VI + VII Managerial Support Systems: Managers and Decision Making. Supply Chain Management Systems. 2006. MODULE -V Organizational Information Systems: Transaction Processing Systems. New Delhi-2006. Pervasive Computing. Decision Support Systems. Protecting Information Resources. E Turban & R. MODULE -III+ IV Ethics. Competitive Advantage and Strategic Information Systems. The Database Approach.Potter. Enterprise Resource Planning Systems. Types of Information Systems. Mobile Computing. Pearson Education. India Edition. The Modern Organization in the Digital Economy: Doing Business in the Digital Economy.E. Intelligent Systems. 2/e. Wireless Computer Networks and Internet Access. Organizational Responses.Introduction to Information Systems.Jessup – Information Systems Today.ELECTIVE IT 8113 Information System Project Management MODULE-I + II Information Systems: Concepts and Management: Information Systems: Concepts and Definitions. Customer Relationship Management. Data Visualization Technologies. Rainer Jr.

and Real-Time Analytics. Model Base Management. Business Intelligence/Business Analytics. Database Organization and Structures. Structure of Expert Systems. How Expert Systems Work. MSS Modeling. Evolution of Artificial Intelligence. DSS Development Tool Selection. MODULE -VI Knowledge Acquisition. What-If. Reasoning in Rule-Based Systems. DSS Hardware. Business Analytics. Prototyping: The DSS Development Methodology. Data Mining. The Nature and Sources of Data. Data Acquisition. Applications of Expert Systems. Influence Diagrams. Data Warehousing. The User Interface (Dialog) Subsystem. Problem Areas Suitable for Expert Systems. and Quality. Expert Systems Development. Mathematical Programming Optimization. Data Marts. Online Analytical Processing (OLAP). Change Management. MODULE -II Modeling and Analysis: Opening Vignette: DuPont Simulates Rail Transportation System and Avoids Costly Capital Expense. The Traditional System Development Life Cycle. Components of DSS. Team-Developed DSS. Heuristic Programming. MODULE -III Business Intelligence: Data Warehousing. Concepts of Knowledge Engineering. What Is a DSS. and Reasoning: Opening Vignette: Development of a Real-Time Knowledge-Based System at Eli Lilly. DSS Development Platforms. DSS Technology Levels and Tools. Data Mining. Knowledge Verification and Validation. Sensitivity Analysis. Problem-Solving Search Methods. Data Collection. Knowledge Acquisition from Multiple Experts. Decision Analysis of a Few Alternatives (Decision Tables and Decision Trees). Basic Concepts of Expert Systems. Visual Interactive Modeling and Visual Interactive Simulation. Concepts and Definitions of Artificial Intelligence. Alternative Development Methodologies. Data Visualization.ELECTIVE IT 8115 Decision Support Systems & Intelligent Systems MODULE-I Decision Support Systems: An Overview: Opening Vignette: Southwest Airlines Flies in the Face of Competition through DSS. The Data Management Subsystem. DSS Configurations. The Artificial Intelligence Field. Types of Expert Systems. Expert Systems on the Web. Inferencing with Uncertainty. DSS Classifications. End User Developed DSS. Benefits and Capabilities of Expert Systems. The Structure of MSS Mathematical Models. 67 . and Goal Seeking. Putting The DSS Together. Static and Dynamic Models. Representation of Knowledge. Uncertainty. Problems. Database Management Systems in Decision Support Systems/Business Intelligence. Expert System Success Factors. Introduction to DSS Development. Methods of Knowledge Acquisition from Experts. Representation. The Knowledge-Based Management Subsystem. MODULE -V Artificial Intelligence and Expert Systems: Knowledge-Based Systems: Opening Vignette: Intelligent Systems in KPN Telecom and Logitech. Strategizes Big-Develops the InfoNet HR Portal System. Scope and Types of Knowledge. Problems and Limitations of Expert Systems. MSS Modeling with Spreadsheets. MODULE -IV Decision Support System Development: Opening Vignette: Osram Sylvania Thinks Small. and Risk. Quantitative Sofware Packages. Certainty. The User. Automated Knowledge Acquisition from Data and Documents. The Web/Internet and Commercial Database Services. Simulation. and Visualization: Opening Vignette: Information Sharing a Principal Component of the National Strategy for Homeland Security. Multiple Goals. Characteristics and Capabilities of DSS. Multidimensionality. Knowledge Acquisition and the Internet. Explanation and Metaknowledge.

Text Book: 1.P. Classification and Types of Agents.2006. Characteristics of Agents. 7/e. Why Intelligent Agents. DSS Agents and MultiAgents.Decision Support Systems and Intelligent Systems. Turban. 68 . Web-Based Intelligent Systems. Pearson Education. Aronson & T.MODULE -VII Intelligent Systems over the Internet: Opening Vignette: Spartan Uses Intelligent Systems to Find the Right Person and Reduce Turnover. J.Liang.E. E. Intelligent Agents: An Overview. New Delhi. Internet-Based Software Agents.

Locks. Case studies of highly available services: the gossip architecture. MODULE -VII Replication: Introduction. Architectural models. Summary. New Delhi. Case studies: Ethernet. Logical time and logical clocks. MODULE -VI Distributed Transactions: Introduction. System model and group communication. Timestamp ordering. Challenges. MODULE -V Transactions and Concurrency Control: Introduction. Client-server communication. Types of network. events and process states. Bayou and Coda. systems. Comparison of methods for concurrency control. Fundamental models. Atomic commit protocols. Coulouris et. Transactions. Transactions recovery. Fault-tolerant services.ELECTIVE CP 8105 Distributed Systems MODULE-I Characterization of Distributed Systems: Introduction. 69 . Case study: interprocess communication in UNIX. Elections. Text Book: 1. Global states. Module-III Interprocess Communication: Introduction. Synchronizing physical clocks. Multicast communication. Coordination and Agreement: Introduction. Flat and nested distributed transactions. Internet protocols. Distributed mutual exclusion. Optimistic concurrency control. The API for the Internet protocols. 4/e. Network Principles. Pearson Education. Nested transactions. Concurrency control in distributed transactiuons. Distributed deadlocks. MODULE -II Networking and Internetworking: Introduction. MODULE -IV Time and Global States: Introduction. WiFi. Transaction with replicated data.Distributed Systems: concepts and Design. Bluetooth and ATM. Clocks. al. Examples of distributed System Models: Introduction. Resource sharing and the Web. G. Distributed debugging. . Group communication. External data representation and marshalling.

Wayner Wolf. Basic compilation techniques. givargis. Text Book: 1. John wiley. 2005. “Computers as components – Principle of Embedded Computing 2.Embedded Systems. Vahid & T. designing with microprocessors. MODULE -IV + V The embedded Computing Platform and program design: Introduction. F.Embedded system Design. Assembly. the CPU bus. Raj Kamal . Formalization for system design. Analysis optimisation of executive time. New Delhi 2004.ELECTIVE CP 8115 Embedded System Design MODULE-I Embedded Computing: Introduction. Complex systems and embedded system design process. The MODULE -II+III Instruction Sets CPUs: Instruction and preliminaries ARM and SHARC Processors. Microprocessors. Component interfacing.. System Design”. Linking. Programming I/O CPU performance and Power consumption. MODULE -VI+ VII Program Design and Analysis: Introduction program design. Morgan Kaufmann/ Hercourt India Pvt. TMH. development and debugging. Ltd. 2. India Edition. 70 . Reference Books : 1.

Quadratic Surfaces. Algorithms for Curved Surfaces. New Delhi. Extended Light Sources. Physically Based Illumination Models. Scan-Converting Primitives. Surface Detail. Color Models for Raster Graphics. Parametric Cubic Curves. 71 . Text Book: 1. Interacting with Our Other Senses. Introduction to Multiprocessing. Algorithms for Visible-Line Determination. Pipeline Front-End Architectures. Techniques for Efficient Visible-Surface Algorithms. MODULE -II Achromatic and Colored Light Achromatic Light.ELECTIVE CP 8119 Advance Computer Graphics MODULE-I Representing Curves and Surfaces: Polygon Meshes. Rendering Techniques for Line Drawings. MODULE -VII Advanced Geometric and Raster Algorithms: Clipping. – Computer Graphics Principles & Practical 2/e . Scan-Line Algorithms. Chromatic Color. J. MODULE -V Illumination and Shading : Illumination Models. Transparency. DisplayProcessor Systems.D. Algorithms for Octrees. MODULE -VI Visible-Surface Determination : Functions of Two Variables. Foley et. Area-Subdivision Algorithms. Making copyPixel Fast. Visible-Surface Ray Tracing. Spectral Sampling. Multiprocessor Rasterization Architectures. Standard Graphics Pipeline. Using Color in Computer Graphics. Stereopsis. Improved Displays. Parametric Bicubic Surfaces. Pearson Education. The z-Buffer Algorithm. Shadows. Improved Object Model. Parallel Front-End Architectures. MODULE -III The Quest for Visual Realism Why Realism. Fundamental Difficulties. Aliasing and Antialiasing. al. The Shape Data Structure and Shape Algebra. Shading Models for Polygons. Rendering Techniques for Shaded Images. The Special Problems of Text. Dynamics. List Priority Algorithms. Filling Algorithms. Antialiasing. 2004. Reproducing color. MODULE -VI Advanced Raster Graphics Architecture: Simply Raster-Display System. Interobject Reflections.

200. Maximum Likelihood Estimation Approach. Classifier Performance. Physical Neural Network. Neural Network Based Pattern Associators.ELECTIVE CP 8121 Pattern Recognition MODULE – I Pattern Recognition Overview: Overview. K-nn Non-Parametric Estimation. Grammar Based Approach and Application. Neural Network Structure from Pattern Recognition Applications. The Cocke-Younger Kasami ((ck) parsing algorithm. John Wiley. Duda – Pattern Classification. U. 72 . The Gaussian case and Class Dependence Discriminate Functions. Bayesian Parameter Estimation Approach. Classification and Description. Recognition by String Matching and Parsing. MODULE – III Supervised Learning: Parametric Estimation and Supervised Learning. RISK and Errors. Non – Parametric Approaches. MODULE – VII Neural Pattern Recognition: Introduction to Neural Networks. Robort Schalkoff . MODULE – IV Linear Discriminate Functions and the Discrete and Binary Feature Cases: Introduction. Techniques to Directly Obtain Linear Classifiers. Statistical. The Artificial Neural Network Model. String Generation as Pattern Description.Pattern Recognition. R. Structural and Neural Approach. MODULE – V + VI Syntactic Pattern Recognition: Overview Quantifying Structure in Pattern Description and Recognitions. Reference Books : 1. Training and Learning in PR Systems. Indian Edition. MODULE – II Statistical Pattern Recognition: Introduction. Pattern Recognition. Discrete and Binary Classification Problems. Patterns and Feature Extraction. Parzen Windows. Nearest Neighbour Rule. Indian Edition. Pattern Recognition Approaches. Text Book : 1. Extensions. 2006. John Wiley.

ELECTIVE CP 8123 Real Time Systems MODULE-I Basic Real-Time Concepts: Terminology. MODULE -VI Programming Languages and the Software Production Process: Introduction. Pearson Edition. Non-vonNeumann Architectures. Enhancing Performance. Application of Queuing Theory. 2006. Brief History. Performance Analysis. Common Misconceptions.W. Other Special Devices. Procedural Languages.India Edition. 3. Organizing and Writing Requirements. Procedural-Oriented Design. Performance Optimization. Laplante. MODULE -V Software System Design: Properties of Software. Appendix: Case Study in Software Requirements Specification for Four-Way Traffic Intersection Traffic Light Controller System. Organizing the Requirements Document. Types of Requirements. Theoretical Foundations of Real-Time Operating Systems. MODULE -III Real-Time Operating Systems: Real-Time Kernels. Intertask Communication and Synchronization. Mc Graw Hill – 1997.Real Time Systems. J. Requirements Validation and Review. Central Processing Unit.Real-Time Systems: Design and Analysis. Pearson Education. C. Memory.Krishna & K. Theory and Practice. MODULE -II Hardware Considerations: Basic Architecture. Assembly Language.S. Hardware Interfacing. Requirements Specification for Real-Time Systems. Memory Management. Formal Methods in Software Specification. John Wiley. Shiv – Real Time Systems. Case Study: POSIX.2007. MODULE -VII Performance Analysis and Optimization: Theoretical Preliminaries. Reference Books: 1. 4. 73 . MODULE -IV Software Requirements Engineering: Requirements-Engineering Process. Delhi. Object-Oriented Analysis and the Unified Modeling Language. Basic Software Engineering Principles.G.M. I/O Performance. Phillip A. Input/Output. The Design Activity.Liu – Real Time Systems. Real-Time System Design Issues. Object-Oriented Languages. Object-Oriented Design. Example Real-Time Systems. New 2. New Delhi – 2004. Structured Analysis and Design. Text Book: 1. Rajib Mall.

PSPACH-completeness – The TQBF problem. A Simple Undecidable Problem. Winning strategies for games. MODULE . formal definition of mapping reducibility. R. MODULE – V+VI Time Complexity: Measuring Complexity. The Definition of Algorithm. The Halting Problem. The Class P. NL-completeness.Exponential space completeness. Enumerators.Formal definition of a Turing machine. Pearson Education. Decidability of logical theories.M. An undecidable theory.Searching in graphs. 2. Decidable problems concerning context-free languages. The Hamiltonian path problem.Taylor – Models of Computation and Formal Languages.I The Church. MODULE .Turing Thesis: Turing Machines. Oxford University New York.The vertex cover problem.The Recursion Theorem.The diagonalization method. Moret – The Theory of Computation. Variants of Turing Machines. RelativizationLimits of the diagonalization method. Analyzing algorithms. 2.III Reducibility: Undecidable Problems from Language Theory. Incompressible strings and randomness. Michael Sipser – Introduction to the Theory of Computation. Self-reference. Definition of NP-completeness.Big-O and small-o notation. Mapping Reducibility-Computable functions.ELECTIVE CP 8127 Computing & Complexity Theory MODULE . MODULE .VII Space Complexity: Savitch’s Theorem. Generalized geography.Polynomial time. Terminology for the recursion theorem. MODULE . NP-completeness. applications. Examples of problems in P.Decidable problems concerning regular languages. Thomson Learning – India Edition 2006.G.IV Advanced Topics In Computability Theory:. The halting problem is undecidable. Turing Reducibility. 1998. Circuit Complexity.Hilbert’s problems. Reference Books: 1.Polynomial time reducibility. Additional NP-complete Problems.II Decidability: Decidable Languages. The Cook-Levin Theorem. NL equals coNL. The Class NP. The Classes L and NL. 74 . Terminology for describing Turing machines. A Definition of InformationMinimal length descriptions.Examples of problems in NP. Nondeterministic Turing machines. New Delhi – 2002. The Class PSPACE. Examples of Turing machines. 2/e.Multitape Turing machines. The subset sum problem.Reductions via computation histories. The P versus NP question. Text Book: 1.A decidable theory. Complexity relationships among models. Intractability: Hierarchy Theorems. Equivalence with other models. B.