PURPOSE To provide an adequate mastery of technical and communicative English Language training primarily, reading and writing skills, secondarily listening and speaking skills. INSTRUCTIONAL OBJECTIVES To provide language training to the engineering students which will enable them to understand and acquire knowledge in technical subjects. UNIT I LISTENING 5
a. Listening Comprehension – Listening Practice – Hints on Listening – Practice Questions
b. Note Taking – Note Taking Strategies UNIT II SPEAKING 7
b. Audio equipment : Types of Pronunciation – Word stress / social context, science and technology context-sentence stress and intonation.
UNIT III READING 7
a. Skimming – Scanning -close reading – Reading Comprehension – Transferring Information - Exercise – An unseen passage should be given and questions may be asked in the form of True or False statements, MCQ, short answers.
b. Transcoding : Interpreting tables, flow charts UNIT IV WRITING 12
a. Grammar – Parts of Speech(advanced) – prefixes and suffixes – Preposition + relative – Tense forms – Active and Passive voice – Abbreviations – punctuation - Exercise
b. Technical Report Writing – Lab Report - Exercise c. Art of Writing – Written Language – Rules for effective writing – Technical
Essay Writing - Exercise d. Letter Writing – Formal Letters – Letter to a News paper – Letter Inviting
Dignitaries – Letter of Application – Placing an Order – Curriculum Vitae – Invitation – Exercise
e. Note Making – Strategies – Organising Notes - Exercise UNIT V FOCUS ON AND COMMUNICATION AND “COMPUNICATION” 9
a. Communication – Basic Concepts – Process – Kinds – Routes – Forms – Factors – Barriers – Triangles – Communication (Communicate through Computers – Power Point & Tele Conferencing).
b. Dialogue Writing – How to write a dialogue - Enact dialogues between two or three people.
7
c. Mini Project Report Writing – Mini Project may submitted during course work – Example Topics like Internet – Role of Language – Communication – Technology – English Literature etc.
INTERNAL ASSESSMENT 5 Assignment and Mini Project Report Writing – Mini Project may be submitted during course work. Based on the test performance and project report of the students marks may be awarded.
TOTAL 45 TEXT BOOK 1. Abraham Benjamin Samuel “Practical Communication (Communicative English)
LSRW2000” – SRMEC - June 2002 Edition. REFERENCE BOOKS 1. Herbert. A.J. The structures of Technical English Orient Longman 1995. 2. Pickett and Laster, ‘Technical English, Writing, Reading and Speaking’, New York
Harper and Row Publications, 1997. 3. Swan, Michael, ‘Basic English Usage’, Oxford University Press, 1984. 4. Interactive course in phonetics and spoken English published by Acoustics
Engineers(ACEN) 2002. 5. Warner, Tony, “Communication Skills for Information Systems”, Pitman Publishing,
London, 1996. 6. Munter, Mary, “Business Communication Strategy and Skill”, Prentice Hall Inc., New
Jersey, 1987. 7. Day Robert.A. 1983, “How to Write and Publish a Scientific Paper” Vikas Publishing
House Pvt Ltd, New Delhi,1979. 8. Staff of the Department of Humanities and Social Sciences, Anna University, “English
for Engineers and Technologist Vol. – I”. Orient Longman, 1990.
MA101 MATHEMATICS – I L T P C (Common for all branches except BT, BI & GN) 3 1 0 4 UNIT I MATRICES 9 Characteristic equation – Eigen values and eigen vectors of a real matrix – Properties of eigen values – Cayley-Hamilton theorem – Orthogonal reduction of a symmetric matrix to diagonal form – Orthogonal matrices – Reduction of quadratic form to canonical form by orthogonal transformation. UNIT II GEOMETRICAL APPLICATIONS OF DIFFERENTIAL CALCULUS 9 Curvature – Cartesian and polar coordinates – Circle of curvature – Involutes and Evolutes – Envelopes – Properties of envelopes – Evolute as envelope of normals. UNIT III FUNCTIONS OF SEVERAL VARIABLES 9 Function of two variables – Partial derivatives – Total differential – Differentiation of implicit functions – Taylor’s expansion – Maxima and Minima – Constrained Maxima and Minima by Lagrangean Multiplier method – Jacobians – Differentiation under integral sign. UNIT IV ORDINARY DIFFERENTIAL EQUATIONS 9 Simultaneous first order linear equations with constant coefficients – Linear equations of second order with constant and variable coefficients – Homogeneous equation of Euler type –
8
Equations reducible to homogeneous form – Method of reduction of order – Method of variation of parameters. UNIT V THREE DIMENSIONAL ANALYTICAL GEOMETRY 9 Direction cosines and ratios – Angle between two lines – Equation of a plane – Equation of a straight line – Co-planar lines – Shortest distance between skew lines – Sphere – Tangent plane – Plane section of a sphere – Orthogonal spheres.
TUTORIAL 15 TOTAL 60
TEXT BOOK 1. Grewal B.S., Higher Engineering Mathematics, 36th edition, Khanna Publishers, 2002.
(Unit I – Chapter 2 section 2.13 - 2.18, Unit II – Chapter 4 Section 4.13 – 4.16, Unit III – Chapter 5 except Section 5.6, 5.10 Unit IV – Chapter 13 except Section 13.10, Unit V – Chapter 3 Section 3.13 - 3.17, 3.19, 3.20)
Singapore, 2001. 2. Veerarajan T., Engineering Mathematics, Tata McGraw Hill Publishing Co., New Delhi,
2000. 3. Kandasamy P etal. Engineering Mathematics, Vol. I (4th revised edition), S.Chand & Co.,
New Delhi, 2000. 4. Narayanan S., Manicavachagom Pillay T.K., Ramanaiah G., Advanced Mathematics for
Engineering students, Volume I (2nd edition), S.Viswanathan Printers and Publishers, 1992.
5. Venkataraman M.K., Engineering Mathematics – First Year (2nd edition), National Publishing Co., Chennai, 2000.
PH101 PHYSICS L T P C
(Common for all branches) 3 0 0 3 PURPOSE The purpose of this course is to develop scientific temper and analytical capability in the engineering graduates through learning of physical concepts and their applications in engineering and technology. Comprehension of some basic physical concepts will enable graduates to logically solve engineering problems they would come across in the fast developing new technologies in their engineering career. INSTRUCTIONAL OBJECTIVES At the end of the course, student should be able to: 1. understand scientific concepts 2. logically explain the concepts 3. apply the concepts in solving engineering problems 4. explain scientifically the new developments in engineering and technology 5. relate industrial developments to developments in the physical phenomena
9
UNIT I ACOUSTICS 9 Vibrating systems - longitudinal and transverse waves – expression for velocity in solids and fluids - Ultrasonics - production – magnetostriction and piezo-electric methods – properties – applications in industry and medicine – acoustics of buildings (elementary ideas).
UNIT II ELECTROSTATICS AND ELECTRODYNAMICS 9 Electric field and potential - Gauss Theorem – proof (coulomb’s law) – applications – line charge, hollow cylinder, hollow spherical conductor, solid spherical conductor - Divergence and curl of a vector, introduction to Maxwell's equation – derivation - wave equation for electromagnetic waves - propagation in free space.
UNIT III LASERS AND FIBER OPTICS 9 Lasers – Absorption and emission - Coherence and monochromatism - Three and four level laser systems - mode locking and Q-switching lasers - He-Ne, CO2, Nd: YAG and Ga As lasers - Introduction to Holography -applications of laser in industry, medicine and communication – Fiber optics - Optical fiber - physical structure, basic theory, mode types - optical fiber characteristics - application of optical fibers in information technology, communication and sensors (briefly). UNIT IV CRYSTAL PHYSICS 9 Crystalline and non-crystalline materials – Bravais lattice – crystal systems –simple crystal structures (NaCl, CsCl and diamond) – packing factor for SC, BCC, FCC and HCP structures – Miller indices- inter planar separation – imperfection in crystals(point and line) – Bragg’s law – X-ray diffraction methods to study crystal structures(Laue's method, Bragg's spectrometer and powder photograph method). UNIT V NON-DESTRUCTIVE TESTING OF MATERIALS 9 Liquid penetrant –magnetic particle – eddy current methods – x-ray radiography – fluoroscopy – Gamma ray radiography – ultrasonic scanning methods – ultrasonic flaw detector (pulse echo technique)- thermography
TOTAL 45 TEXT BOOKS 1. Arumugam .M., “Engineering Physics”, Anuradha publishers 1998. 2. Gaur & Gupta, “Engineering Physics”, Dhanpatrai & sons, V edition 1986. 3. John Thiruvadigal.D, Ponnusamy.S, Vasuhi.P.S and Kumar.C, " Physics for
Prentice Hall of India 1994 2. Feynman R.P, Leighton R.B, Sands.M, “The Feynman Lectures on Physics Vol,I, II, III”,
Narosa publishing House, New Delhi 1995 3. Thyagarajan.K.and Ghatak A.K.”Laser Theory and Applications”, Mac Millan India Ltd.
New Delhi 1992 4. C.K.Kao “Optical Fiber System Technology, Design and Applications,” McGraw Hill,
1982
10
CY101 CHEMISTRY L T P C
(Common for all branches) 3 0 0 3
PURPOSE To develop analytical capability to characterize, transform and use materials in engineering and to have in depth knowledge of chemistry of matter. INSTRUCTIONAL OBJECTIVES At the end of the course: • Student should be able to understand and explain the concepts logically. • Apply knowledge gained in solving related engineering problems. • Understand the role of applied chemistry in the field of engineering. UNIT I ELECTROCHEMISTRY and CORROSION AND ITS CONTROL 9 Electrodics: Measurement of conductance – Different types of electrodes, Electrochemical cell – reversible and irreversible cell – concentration cells - Nernst equation, – Application of EMF measurements Corrosion – Dry and wet corrosion, Differential aeration corrosion - mechanism, factors affecting corrosion – Corrosion control, different methods – Importance of selection of materials and design in reducing corrosion. UNIT II HIGH POLYMERS 9 Classification of polymers,- functionality,- polymerization reactions, Different types of polymerization catalyst – Anionic, cationic and free radical. Effect of polymer structure on properties – strength, plastic deformation, crystallinity, chemical resistance. Plastics- Classifications with examples - compounding of plastics, moulding techniques – Compression, injection, transfer, laminations, blowing. Elastomers- vulcanisation – synthetic rubber – styrene, butyl, nitrile, neoprine, sillicone rubbers. UNIT III WATER TREATMENT 9 Quality parameters, estimation of hardness by EDTA method. softening of water – zeolite process, demineralization by ion-exchanger – Treatment of water for domestic purpose – disinfection . Desalination – reverse osmosis. Waste water Treatment: Importance of dissolved oxygen in water – Determination of COD, BOD. Treatment of domestic waste water- primary, secondary, tertiary treatment. UNIT IV PHASE EQULLIBRIA 9 Clausius-Clapeyron equation – Phase transitions. Phase rule and its terms. One component system – water. Thermal analysis - Two component system:- one system from each class - Simple Eutectic and compound formation.,solid solution formation . Applications of eutectics. UNIT V INSTRUMENTAL ANALYTICAL TECHNIQUES 9 Basic principles and applications of electroanalytical methods: Potentiometery, Voltammetry, Amperometry and polarography.
publications 2001 3. Willard H.A., Merit L.L and Dean J.A., “Instrumental methods of analysis” 6th Edition
Van Nostrand, 1986. 4. Kamaraj P. & Arthanareeswari M., “Applied Chemistry”, Sudhandhira Publications, 2nd
Edition, 2003. REFERENCE BOOKS 1. Uppal M.M, “A text book of Engineering Chemistry”, Khanna Publishers.1986. 2. Dara S.S, Chand S. & Co., “A text book of Engineering Chemistry”, 10th revised Ed,
1987. 4. Kuriacose J.C. and Rajaram J. “Chemistry in Engineering and Technology”, Volume II,
Tata McGraw Hill p.b. Co., 1988. GE101 BASIC ENGINEERING – I L T P C
(Common for all branches) 4 0 0 4 PART - A CIVIL ENGINEERING L T P C
2 0 0 2 PURPOSE To get exposed to the glimpses of Civil Engineering topics that are essential for an Engineer. INSTRUCTIONAL OBJECTIVES 1. To know about different materials and their properties. 2. Engineering aspects related to buildings. 3. To know about importance of Surveying. 4. To know about the transportation systems. 5. To get exposed to the rudiments of engineering related to Dams, Water Supply and
Sewage Disposal. UNIT – I MATERIALS AND BUILDINGS 10 Introduction - Civil Engineering – Materials – Brick, Stone, Cement, Steel, Concrete – Properties – Uses – factor of safety. Buildings – Classification - Components of buildings - Foundations - Functions – Classification of foundations – Bearing capacity - Floorings – Requirements - Cement Concrete flooring – Mosaic flooring - Marble flooring - Roofs - Types – Requirements – Madras Terrace roof . UNIT – II SURVEYING – APPLICATION OF SURVEYING 10 Surveying - Objective – Principles – Classification – Instruments used for Surveying. Dams - Purpose – Selection of site – Classification – Gravity dam (cross-section details only)
12
UNIT – III TRANSPORTATION,WATER SUPPLY AND SEWAGE DISPOSAL 10 Transportation system - Classification – Components of Roads - Railway – Cross-section of permanent way- requirements, Bridges – bridge site and components of a bridge site - Harbour – classification. Water supply - Sources - Standards of drinking water – Distribution system – Sewage – types – septic tank – function and components. TOTAL : 30 TEXT BOOKS 1. Raju K.V.B., Ravichandran P.T., Basics of Civil Engineering, Ayyappa Publications,
Chennai, 2000. 2. Ramesh Babu, Elements of Civil Engineering, VRB Publishers, 2000. REFERENCE BOOKS 1. Rangwala,S.C., Engineering Materials, Charotar Publishing House, Anand, 1980. 2. National Building Code of India, Part V, Building Materials, 1983. 3. Surendra Singh, Building Materials, Vikas Publishing Company, New Delhi, 1996.
PART B MECHANICAL ENGINEERING L T P C
2 0 0 2PURPOSE To familiarise the students with the basics of Mechanical Engineering. INSTRUCTIONAL OBJECTIVES To familiarize with
• The Source of Energy and Power Generation • The various metal joining processes and metal working process • The Basic theory of Lathe & Drilling Machines
UNIT I SOURCES OF ENERGY AND POWER PLANTS 10 Non–renewable and renewable sources of energy–various types, characteristic, advantages/disadvantages. Thermal – steam, gas and diesel - Hydro and Nuclear power plants – its layout, element / component description, advantages, disadvantages, locations in India. UNIT II METAL JOINING AND SHEET METAL PROCESSES 10 Welding-Gas and Arc welding only– Introduction, types, equipments, tools and accessories, techniques employed, applications, advantages / disadvantages. Introduction to Brazing and soldering
Sheet Metal Work-Introduction, equipments, tools and accessories, Sheet Metal working process – various types, applications, advantages / disadvantages. UNIT III MACHINING 10 Lathe – Introduction, types, description of main components, cutting tools, work holding devices , Basic operations performed. Drilling machine- Introduction, types, and description, drilling tools. Tapping – tap tools. TOTAL 30
Technology” Vol. I & II”, Media Publishers, 1986. 2. Palanichamy M.S., “Basic Civil & Mechanical Engineering”, TMH, 1991.
GE103 BASIC ENGINEERING – II L T P C
(Common for all branches) 4 0 0 4 PART - A ELECTRICAL ENGINEERING L T P C
2 0 0 2 PURPOSE This course provides comprehensive idea about circuit analysis, working principles of machines and common measuring instruments. It also provides all fundamentals of circuit components electronic devices, transducers and integrated circuits. INSTRUCTIONAL OBJECTIVES At the end of the course students will be able
• To understand the basic concepts of magnetic , AC & DC circuits. • To explain the working principle, construction & applications of DC & AC
machines. • To gain knowledge about the fundamentals of electric components , devices,
PART A UNIT I MAGNETIC CIRCUITS 8 Definition of mmf flux and reluctance analysis of composite magnetic circuits, leakage flux, fringing, magnetic materials and B-H relationship. Faradays laws, induced emf’s and inductances. Energy storage in magnetic systems, Hysteresis and eddy currents. UNIT II AC AND DC CIRCUITS 12 Definition symbols and units of all circuits parameters like current of resistance etc. Ohms law, Kirchoff's law. Average and RMS values concept of phasor representation. RLC series and parallel circuits, resonance simple problems in DC & AC circuits. Introduction to Three phase systems, Generation of Three phase EMF-Waveform and phase sequence. UNIT III ELECTRICAL MACHINES AND WIRING 10 Electrical Machines : Working principle, construction and applications of DC machines and AC machines (transformer, three phase and single phase induction motors and alternators). Wiring : Types of wiring, joint box and looping systems, Wiring diagrams of staircase and corridor wiring. Working and characteristics of incandescant S.V and M.V lamps, Basic principles of earthing.
14
PART - B ELECTRONICS ENGINEERING L T P C
2 0 0 2 UNIT I ELECTRONIC COMPONENTS AND DEVICES 10 Passive components – Resisters, Inductors and Capacitors and their types. Semiconductor : Energy band diagram – Intrinsic and Extrinsic semiconductors – PN junction diodes and Zener diodes – characteristics. Rectifiers : Half wave and full wave rectifier – capacitive filter – wave forms – ripple factor – regulation characteristics. Transistors : PNP and NPN transistors – theory of operation – Transistor configurations – characteristics – comparison. Special semiconductor devices : FET – SCR – LED – V I characteristics – applications. UNIT II TRANSDUCERS AND MEASURING INSTRUMENTS 10 Transducers : General features and classification of tranducers, Resistive Transducers – Potentiometer, Unbonded strain gauge-Bonded strain gauge-Load cell, Inductive transducers – Differential output tranducers – LVDT, Flow transducers – Variable are flow meter, Temperature Transducers – Thermistors, Thermocouple and pyrometers. Measuring Instruments : Basic principles and classification of instruments, Moving coil and moving iron instruments, CRO – Principles operation. UNIT III DIGITAL ELECTRONICS 10 Digital Fundamentals : Number system – Boolean Theorems – DeMorgan’s Theorems Logic gates – Implementation of Boolean Expression using Gates. Integrated Circuits: IC fabrication – Monolithic Technique.
TOTAL 60 TEXT BOOKS 1. Muraleedharan K.A, Muthususbramanian R and Salivahanan S, "Basic Electrical,
Electronics and Computer Engineering" Tata McGraw Hill 1999. 2. Mehta V K, "Principles of Electronics", S.Chand & Co., 1980.
3. Kalsi H S, Electronic Instrumentation", ISTE publication,1995. REFERENCE BOOKS 1. Kothari D P and Nagrath I J, "Basic Electrical Engineering", Tata McGraw Hill, 1991. 2. Mithal G K, Electronic Devices & Circuits, Khanna Publications, 1997. 3. Ben .G. Streetman, "Solid State Electronics Devices, Prentice Hall of India, 1999.
PH103 PHYSICS LABORATORY L T P C
0 0 2 1 PURPOSE The purpose of this course is to develop scientific temper and analytical capability among the engineering graduates. INSTRUCTIONAL OBJECTIVES At the end of the course, student should be able to: 1. Understand scientific concepts 2. Develop the skill in arranging and handling different measuring instruments
15
3. Determine the errors in various measurements and planning / suggesting how these contributions may be made of the same order so as to make the error in the final result small.
LIST OF EXPERIMENTS 1. To determine the frequency of AC, using vibrating rod/tuning fork method. 2. Determination of velocity of ultrasonic waves in liquids. 3. Particle size determination using laser 4. Calibration of voltmeter & ammeter 5. Determination of field intensity – Field along the axis of a circular coil 6. Determination of wave length-Diffraction grating. 7. Determination of dispersive power of a prism using spectrometer. 8. Determination of laser parameters - divergence and wave length for a given laser source – Laser Grating 9. Study of attenuation and propagation characteristics of an optical fiber cable. 10. Determination of temperature co-efficient of resistance - Carey –Foster’s Bridge. TOTAL 30 REFERENCE BOOKS
1. Ouseph C.G., Practical Physics , S.Viswanathan Publishers, 1981 2. Aroro C.L., Practical Physics, S. Chand & Co., 1989. 3. John Thiruvadigal.D, Ponnusamy.S, Vasuhi.P.S and Kumar.C, "Hand Book of
Practical Physics", Vibrant Publications 2004.
CY103 CHEMISTRY LAB L T P C 0 0 2 1
PURPOSE An integrated laboratory course consists of experiments from applied chemistry and is designed to illustrate the underlying principles of measurement techniques, synthesis, dynamics and chemical transformation. INSTRUCTIONAL OBJECTIVES Students should be able to understand the basic concept and its applications. LIST OF EXPERIMENTS 1. Estimation of total hardness, permanent and temporary hardness by EDTA method. 2. Determination of Chloride content in water by Volhard’s method. 3. Determination of COD in waste water. 4. Conductometeric titration – determination of strength of an acid. 5. Estimation of iron by potentiometer – titration. 6. Determination of molecular weight of polymer by viscosity average – method. 7. Determination of dissolved oxygen in a water sample by Winkler’s method 8. Determination of corrosion rate. 9. Determination of pH / Acidity of water sample. 10. Estimation of Copper in ore. 11. Estimation of nickel in steel. 12. Determination of solubility product of sparingly soluble salts.
TOTAL 30 REFERENCE
1. Practical Chemistry – I, 2004 Edited by Dr. R. Jeyalakshmi. 2. Practical Chemistry by Kamaraj & Arthanareeswari, Sudhandhira Publications, 2003.
16
GE105 COMPUTER PRACTICE L T P C
0 0 3 2 PURPOSE To familiarize the students with the fundamentals of operating systems, office package tools and Programming basics INSTRUCTIONAL OBJECTIVES
a. Introduction to DOS, UNIX, Windows b. Word , Excel, Powerpoint , Access c. C Programming Basics
LIST OF EXPERIMENTS CYCLE - I Fundamentals of Computers and Introduction to Operating Systems Organization of Computers, Generation, Modern Computers , Applications Operating Systems : DOS , UNIX , WINDOWS , Introduction to GUI. CYCLE-II Office Automation Word Processing , DataBase Management , Spread sheet Package , Presentation tools. CYCLE –III C Programming Basics
1. Sum of Series , Sine, Cosine, Exponential 2. Counting number of words,vowels, lines in a text 3. Programs using Builtin math functions 4. Conversions : Hex to Decimal, Binary to Octal etc. 5. Matrix operations : Multiplication, Symmetric, Inverse 6. Student mark processing
Similar Problems covering basics of C Language TOTAL 45
TEXT BOOKS 1. Sheela Kumar.T., Sridhar.S.S. , “ Computer Practice “, Anuradha Publishers,2003. 2. Mullish Cooper , “The Sprit of C” , Jaico Books, 2002 3. Vikas Gupta, “Computer Course Kit”, Wiley-dreamtec India Pvt Ltd, 2002.
REFERENCE BOOKS 1. Balaguruswamy .E. “Programming in ANSI C”, TataMcGraw Hill, 2004. 2. Ed Bott, Woody Leonhard , “Using Office 2000”, PHI, 2000.
ME101 WORK SHOP PRACTICE L T P C
0 0 3 2 PURPOSE To provide the students with hands on experience on different trades of engineering like fitting, carpentary, smithy, welding and sheet metal.
17
INSTRUCTIONAL OBJECTIVES To familiarize with
• The basics of tools and equipments used in fitting, carpentary, sheet metal, welding and smithy
• The production of simple models in the above trades LIST OF EXPERIMENTS EMPHASIS TO BE LAID ON REAL LIFE APPLICATIONS WHEN FRAMING THE EXERCISES. 1. FITTING Tools & Equipments – Practice in chipping, filing & Drilling. Making Vee Joints, Square, dovetail joints, Key making. 2. CARPENTARY Tools & Equipments- Planing practice- Making Half Lap, dovetail, Mortise & Tenon joints, a mini model of a single door window frame( Frame only) 3. SHEET METAL Tools & equipments – Fabrication of a small cabinet, Rectangular Hopper, etc., 4. WELDING Tools & equipments – Arc welding of butt joint, Lap Joint, Tee Fillet. Demonstration of Gas welding, TIG & MIG. 5. SMITHY Tools & Equipments – Making simple parts like hexagonal headed bolt, chisel. TOTAL 45 REFERENCE BOOKS 1. Kannaiah.P. & Narayanan,K.C. “Manual on Workshop Practice”, Scitech
MA102A MATHEMATICS – II L T P C (Common for all B. Tech. branches except Food
Processing and Bio-Technology.) 3 1 0 4
(for candidates admitted from 2004-05 and afterwards)
UNIT I MULTIPLE INTEGRALS 9 Double integration in Cartesian and polar coordinates – Change of order of integration – Area as a double integral – Triple integration in Cartesian coordinates – Change of variables – Gamma and Beta functions : Definition and Simple problems only. UNIT II LAPLACE TRANSFORMS 9 Transforms of simple functions – Basic operational properties – Transforms of derivatives and integrals – Initial and final value theorems – Inverse transforms – Convolution theorem – Periodic functions – Applications of Laplace transforms for solving linear ordinary differential equations up to second order with constant coefficients only UNIT III VECTOR CALCULUS 9 Gradient, divergence, curl – Solenoidal and irrotational fields – Vector identities (without proof) – directional derivatives - Line, surface and volume integrals – Statements of Green’s, Gauss divergence and Stoke’s theorems only – Verification and applications to cubes and parallelopipeds only. UNIT IV ANALYTIC FUNCTIONS 9 Definition of Analytic Function - Cauchy Riemann equations – Properties of analytic functions – Determination of harmonic conjugate – Milne-Thomson’s method – Conformal mappings: Mappings w=z+a, az, 1/z, sin z and bilinear transformation. UNIT V COMPLEX INTEGRATION 9 Line integral - Cauchy’s integral theorem (without proof) – Cauchy’s integral formulae (with proof) – application of Cauchy’s integral formulae - Taylor’s and Laurent’s expansions (statements only) – Singularities –Poles and Residues – Cauchy’s residue theorem (with proof) – Contour integration – integration around unit circle.
(Unit I – Chapter 7 section 7.1 – 7.7, 7.14 – 7.16, Unit II – Chapter 8 Section 8.4 – 8.6, 8.8 -8.18, Unit III – Chapter 21 except Section 21.6, 21.21, Unit IV – Chapter 20 Section 20.1-20.5, 20.7 – 20.10.1, Unit V – Chapter 20 Section 20.13, 20.14, 20.16 -20.20(a).
2. Veerarajan T., Engineering Mathematics for Semester III, 2nd edition, TMH, 2003. (Unit II – Chapter 7, Section 7.9) REFERENCE BOOKS 1. Kreyszig.E, Advanced Engineering Mathematics, 8th edition, John Wiley & Sons,
Singapore, 2001. 2. Kandasamy P etal. Engineering Mathematics, Vol. I, II & III (4th revised edition),
S.Chand & Co., New Delhi, 2000.
19
3. Narayanan S., Manicavachagom Pillay T.K., Ramanaiah G., Advanced Mathematics for Engineering students, Volume I, II & III (2nd edition), S.Viswanathan Printers and Publishers, 1992.
4. Venkataraman M.K., Engineering Mathematics – Vol.III – A & B (13th edition), National Publishing Co., Chennai, 1998.
EC106 ELECTRON DEVICES & CIRCUITS L T P C
(for candidates admitted from 2004-05 and afterwards) 3 0 0 3 PURPOSE
The purpose of this course is to develop a strong foundation in the field of electronic devices and circuits. The subject gives the students a thorough knowledge about the characteristics of many electronic device and enables them to analyse and design any real time applications.
INSTRUCTIONAL OBJECTIVES 1. To understand the fundamental concepts of basic electronic devices. 2. To logically analyse electronic circuits 3. To understand the OP-AMP’s and their applications. UNIT I - SEMICONDUCTOR DEVICES 10 Diodes, BJT & FET – construction and characteristics of UJT, MOSFET, Thyristor and their applications. Opto Electronic Devices - Photo diodes – Photo voltaic cell – LED &LCD – Photo multiplier circuit – Photo conductive cell(LDR) – Photo transistor. UNIT II – AMPLIFIERS 9 Biasing circuits –stability factor – h parameter model of transistor – Small signal analysis of CE amplifier – Large signal amplifiers – Class A, Class B, Class AB & Class C power amplifiers – Efficiency calculation – Tuned amplifiers – Frequency response. UNIT III– FEEDBACK AMPLIFIERS & OSCILLATORS 9 Concept of Feedback – Types of negative feedback – Advantages – Topology – Practical voltage series & current series feedback amplifiers -RC oscillators – phase shift & wien bridge – LC oscillators – Hartley & Colpitts – Crystal oscillators UNIT IV – OP-AMPS & APPLICATIONS 9
Operational Amplifier Characteristics - Basic applications – V to I & I to V converters – Differentiator – Integrator –Log & Antilog amplifiers – Electronic Analog computation – Multipliers & Dividers – Sample & Hold circuit – IC Voltage regulator. UNIT V – PULSE & WAVE-SHAPING CIRCUITS 8 555 timer Internal block diagram – Bistable, Monostable and Astable Multivibrators using Op-amps & 555 timer – Schmitt trigger – Comparator – Clipper – Clamper – Triangular wave generator. (Qualitative treatment only)
(Umesh publications),1987 2. Roy Choudhury & Shail Jain ,”Linear Integrated Circuits”,New Age International,1987
20
REFERENCE BOOKS 1. S.Salivahanan, N.Suresh Kumar & A. Vallavaraj ,”Electronic Devices and Circuits”,
Tata McGraw Hill,1987 2. David A. Bell ,” Electronic Devices and Circuits”,Prentice Hall of India,1987 3. J. Millman & C.C. Halkias ,”Electronic Devices and Circuits”,Tata McGraw
(for candidates admitted from 2004-05 and afterwards) 3 0 0 3 PURPOSE This course is to develop a strong foundation in the field of digital electronics
INSTRUCTIONAL OBJECTIVES • Number System and Boolean Algebra • Synchronous and asynchronous circuits • State diagrams and State charts
UNIT—I INTRODUCTION 9 Introduction to Digital Systems—Data representations—Binary and Decimal Numbers, Boolean Algebra and Logic Gates: Basic Logic Operations—Identities—Algebraic Laws—Demorgan Theorems—Algebraic Reductions—Complete Logic Sets. UNIT—II COMBINATIONAL LOGIC DESIGN 9 Canonical Logic Forms—Logic Arrays—BCD and 7 segment Displays—Karnaugh Maps(3 variable & Four Variable) Digital Hard ware: voltage as logic Variables—Digital Integrated Circuits—Logic Delay Times—Logic Families. UNIT—III INTRODUCTION TO VHDL 9 Introduction—Defining Modules in VHDL—Structural Modeling—Conditional Models—Binary words. CMOS Logic Circuits: CMOS Electronics—MOSFETS—MOSFET Logic Formalization . Silicon Chips and VLSI—A Silicon Primer—Silicon Devices—Basic Circuit Layout—Cells and hierarchical Design—Floor Plans and Interconnect wiring. UNIT—IV LOGIC COMPONENTS 9 Concept of a Digital Component—An equality Detector—BCD Validity Detector—Line Decoder—Multiplexers—Demultiplexers—Binary Adder—Sub tractor—Multiplication—Transmission Gate logic. UNIT—V MEMORY ELEMENTS AND ARRAYS 9 Latches—Clocks and Synchronization—Master slave and edge—Triggered Flip Flops—Registers—Random Access Memory—Read Only Memory—CD ROM—CMOS Memories—Transmission—Gate Circuits. Sequential Logic Networks: The Concept of a sequential Network—Analysis of Sequential Networks—Sequential Network design—Binary Counters— The Importance of State Machines. Total:45
21
TEXT BOOK 1. John P.Uyemura, “A First Course in Digital Systems Design, An Integrated
1. Charles H Roth, “Fundamentals of Logic Design “, 5th edition, Thomson Asia,2004 2. W.H.Gothmann, “Digital Electronics – An Introduction, Theory and Practical”,
Prentice Hall of India.,2nd Edition,1999 3. T.L.Floyd, “Digital Fundamentals”, Universal Book Stall, New Delhi.,2002 4. D.J.Comer, “Digital Logic and State Machine Design”, Holt Saundens,1997. 5. Morris Mano, “Digital Design”, Prentice Hall of India,2001.
CS108 NUMERICAL METHODS USING C L T P C
(for candidates admitted from 2004-05 and afterwards) 3 1 0 4PURPOSE This course will enable to master the concepts of C and also the Numerical methods implementaions
INSTRUCTIONAL OBJECTIVES • Important concepts in C language like Functions , Pointers, Structures, Bitwise and
Files • Study of Roots of equations and implementation in C • Algebraic equations, Differentiation and Integration
UNIT-I FUNCTIONS & POINTERS 9 Structure of a C program – Identifiers – Variables – Constants – Expressions – Precedence & Associativity - Statements – Control structure – Functions – user-Defined functions – Recursion – Arrays – Arrays & functions - Passing an Array to function – pointers - Array of pointers – Memory Allocation function – Strings – Array of stings. UNIT—II STRUCTURES , UNIONS & FILES 9 Enumerated Types – structure – Accessing Structures – Complex structures – Array of structures – Structure and functions – Unions – Files – Binary files – Bitwise Operators – Linked List Structure and Functions. UNIT—III ROOTS OF EQUATIONS 9 Mathematical Modeling & Engineering Problem Solving—Approximation –Round off Errors—Roots of Equations: Graphical ,Bisection, False-Position - Newton Raphson—Secant method—System of Non linear equations - Roots of Polynomials. UNIT—IV ALGEBRAIC EQUATIONS 9 Linear Algebraic equations—Gauss elimination—Non Linear System of equations—Gauss Jordan—LU Decomposition—Matrix Inverse –Error analysis—Gauss Seidal Method . Lagrange’s Interpolation. UNIT—V DIFFERENTIATION AND INTEGRATION 9 Differentiation & Integration - Trapezoidal rule—Simpson’s rule—Romberg Integration—Euler’s Method—Runge–Kutta Method—Heun’s Method. Tutorial 15 Total 60
22
TEXT BOOKS 1. Behrauz A.Foruzan & Richard F.Gilberg , “ Computer science – A structure
programming approach Using C ”, Thomson Asia , 2001. (Chapter-2.2 – 2.6, 3.1, 3.2, 3.5, 3.6, 4.1 – 4.3, 5.2, 5.3, 6.5, 6.9, 8.2, 8.3, 8.7, 8.8, 9.1 – 9.7, 10.3, 10.5, 10.6, 11.1 – 11.5, 12.1 – 12.5, 13.1 – 13.3, 14.1 – 14.2, 15.1 – 15.2) 2. Steven C.Chatra, Raymond P.Canale,”Numerical Methods For Engineers with
(for candidates admitted from 2004-05 and afterwards) 3 0 0 3
PURPOSE This course is intended to provide students knowledge on various aspects of Electric circuit analysis INSTRUCTIONAL OBJECTIVES • Fundamentals of Circuit Theory • Network Theorems • Transient Response of Electric circuits UNIT I FUNDAMENTALS 9 Ideal sources – Dependent and Independent sources – Linear relation between voltage and current of Network elements - Source Transformation – Types of Networks – Network reduction – Voltage division – current division – star – delta transformation – concept of duality – Dual networks – Formation of Matrix equations and analysis of complex circuits using mesh – current and nodal – voltage methods UNIT II GRAPH THEORY 9 Network Graph – Tie set – Cut set – Tie set schedule – Cut set Schedule – Formation of incidence matrix – Reduced incidence matrix – Framing Network graph from the incidence matrix. UNIT III NETWORK THEOREMS 9 Thevenin’s theorem – Norton’s theorem, Superposition theorem –– Maximum power transfer theorem – Substitution theorem , Reciprocity theorem, Millman’s theorem, Tellegen’s theorem - Statement & application to AC & DC circuits. UNIT IV COUPLED CIRCUITS 9 Coefficient of coupling – Dot rule – Analysis of coupled circuits – Single & Double tuned coupled circuits – Analysis & coefficient of critical coupling – Magnetic leakage and Fringing Effects.
23
UNIT V TRANSIENTS AND NETWORK FUNCTIONS 9 Transient response of RL, RC, RLC Circuits to step input and sinusoidal input – Transfer Function of Two Port Network, Poles and Zeros – Necessary Conditions for Driving Point Function and Transfer Function – Stability Criterion for Active Network - Network Parameters – z, y, h, g parameters
Total : 45 TEXT BOOK 1. A. Sudhakar & S.P. Shyammohan , “Circuits & Networks (analysis & Synthesis)”, Tata
McGraw Hill Publishing company Ltd., New Delhi, 2000 REFERENCE BOOKS 1. S.L. Bhatia, “Hand Book of Electrical Engineering” Khanna Publications. 2. A. Chakrabarti, “Circuit Theory (analysis & synthesis)”, Dhanpat Rai & Co., 1999. 3. Robert. L Boylested, “Introducing Circuit analysis”, Universal Book Stall, New Delhi
1981. 4. R.Muthusubramanian, A.K. Ayappan, “Electric Circuits”, Anuradha Publications,
Kumbokonam, TN,2003.
GE 106 VALUE EDUCATION L T P C (Common for all branches) 1 0 0 1
(for candidates admitted from 2004-05 and afterwards) UNIT – I 3 Value Education—Introduction – Definition of values – Why values? – Need for Inculcation of values – Object of Value Education – Sources of Values – Types Values:
i) Personal values ii) Social values iii) Professional values iv) Moral and spiritual values v) Behavioral (common) values
UNIT- II 3 Personal values – Definition of person – Self confidence – Self discipline – Self Assessment – Self restraint – Self motivation – Determination – Ambition – Contentment – Humility and Simplicity - Sympathy and Compassion – Gratitude -Forgiveness – Honesty – Courtesy. UNIT – III 3 Social values – Definition of Society – Units of Society - Individual, family, different groups – Community – Social consciousness – Equality and Brotherhood – Dialogue – Tolerance – Sharing – Responsibility – Co-operation Freedom – Repentance and Magnanimity. UNIT – IV 3 Professional values – Definition – Competence – Confidence – Devotion to duty –Efficiency – Accountablility – Respect for learning /learned – Willingness to learn-Open and balanced mind – Team spirit – Professional Ethic – Willingness for Discussion – Aims – Effort – Avoidance of Procrastination and slothfulness –Alertness.
24
UNIT – V 3 Behavioral values – Individual values and group values – Good manners at home and outside – Equality – Purity of thought, speech and action – Understanding the role of religion – Faith – Understanding the commonness of religions – respect for other faiths – unity in diversity – Living together – Tolerance – Non-violence – Truthfulness – Common aim – Unified effort towards peace – Patriotism.
TOTAL 15 REFERENCE BOOKS 1. Dr. S. Ignacimuthu S. J., Values for life, Better yourself Books, Bandra
Mumbai-600 050 (1999). 2. Values(Collection of Essays)., Published by : Sri Ramakrishna Math., Chennai—4.,(1996) 3. Prof. R.P.Dhokalia.,Eternal Human Values NCRT –Campus Sri Aurobindo Marg., New Delhi - 110 011. 4. Swami Vivekananda., Education., Sri Ramakrishna Math., Chennai-4(1957) 5. Tirukural (English Translation by Dr.G.U.Pope). 6. The Bible 7. The Kuran 8. The Bagavath Geetha
GE 108 BIOLOGY L T P C (Common for all branches) 2 0 0 2
(for candidates admitted from 2004-05 and afterwards)
PURPOSE It makes the students knowledgeable in basic cognitive aspects of the brain and relations with modern machines INSTRUCTIONAL OBJECTIVES
To study human systems – nervous system, circulatory system To understand brain functions To understand the cognitive aspects of the brain To relate man machine interaction towards product development.
UNIT I HUMAN SYSTEMS 6 Nervous system, brain, parts of brain and their functions; circulatory system, heart and its function. UNIT II BRAIN FUNCTIONS 6 Perception, behavioral sequences, reflexes, instincts, emotions, thinking and other integrative activities. UNIT III COGNITIVE CAPABILITIES 6 Attention, Thinking, Evaluating, Insight, Abstraction, Creativity, Choice, Purpose, Planning, Generalization, Judgement, Introspection, Programming, Interest, Preference, Discrimination, Learning, Habituation, Memory, recognition, retention, Knowledge UNIT IV MEMORY 6 Memory stratification, Methods of processes used by the memory manager, Genetic structure
25
UNIT V MAN – MACHINE INTERACTION 6 Experience, learning, problem solving abilities and product development.
TOTAL 30
TEXT BOOKS 1. Elementary Biology, K.N.Bhatia and M.P.Tyagi 2002, Trueman Book Company,
Jalandhar 2. The Human Brain : Essentials of behavioural Neuroscience, Jackson Beatty 2001, Sage
Publications India Pvt. Ltd., Delhi REFERENCE BOOKS 1. Cognitive aspects of the Brain Relations with modern computers, Jose Molina 2003,
Molwick.
GE102 ENGINEERING GRAPHICS L T P C
(for candidates admitted from 2003-04 and afterwards) 1 0 4 3 ( Only First Angle Projection is to be followed) PURPOSE 1. To draw and interpret various projections of 1D, 2D and 3D objects. 2. To prepare and interpret the drawings of buildings. INSTRUCTIONAL OBJECTIVES To familiarise with
• The construction of geometrical figures • The projection of 1D, 2D & 3D elements • Sectioning of solids and development of surfaces • Preparation and interpretation of building drawing
UNIT I - FUNDAMENTALS OF ENGINEERING GRAPHICS 2 Lettering two dimensional geometrical construction, conics, representation of three -dimensional objects – principles of projections – standard codes – projection of points. UNIT II - PROJECTION OF LINES & SOLIDS 4 Projection of straight lines, projection of solids – auxiliary projections UNIT III – SECTION AND DEVELOPMENT 3 Sections of solids and development of surfaces. UNIT IV – PICTORIAL PROJECTIONS 4 Orthographic projection, isometric projection of regular solids & combination of solids. Conversion of orthographic to isometric. UNIT V – BUILDING DRAWING 2 Building Drawing – plan, elevation and section of single storied residential (or) office building with flat RCC roof and brick masonry walls having not more than 3 rooms (planning / designing is not expected in this course). Practicals: 60 Total : 75
Publishing Co., Anand. 2. K.Venugopal, ‘ Engineering Drawing & Graphics’, New age international Pvt. Ltd., 1999.
EC184 ANALOG AND DIGITAL CIRCUITS LABORATORY L T P C (for candidates admitted from 2004-05 and afterwards) 0 0 3 2
PURPOSE To learn the Analog and Digital circuits and their applications INSTRUCTIONAL OBJECTIVES
• Studying the characteristics of Transistor, Diode, LCD • Designing Gates , flip slops, adders, multiplexers and counters • Designing Encoders , decoders and shift registers
List of Experiments Analog circuits:
1. Transistor Biasing 2. Frequency response of amplifiers: CE, CB, CC 3. Characteristics of SCR & TRIAC 4. Characteristics of Zener diode 5. Characteristics of UJT 6. Characteristics of LDR & Photo-diode Digital circuits: 7. Verification of Gates & Flip Flops 8. Adders 9. Multiplexers & Demultiplexers 10. Counters 11. Shift registers 12. Encoders & Decoders Total : 45 REFERENCE : Laboratory Manual
27
CS116 PROGRAMMING LAB L T P C
(for candidates admitted from 2004-05 and afterwards) 0 0 3 2
List of Experiments 1. Functions, Pointers, Structures. 2. Files and operations 3. Bit-wise operations 4. Bisection Method 5. False-Position Method 6. Newton-Raphson Method 7. Secant Method 8. Lagrange’s Interpolation 9. Gauss-Elimination Method 10. LU Decomposition 11. Jacobi Method 12. Romberg Integration 13. Trapezoidal Rule 14. Simpson’s Rule 15. Runge-Kutta Method Language : C Total : 45 REFERENCE : Laboratory Manual
28
SEMESTER – III MA211A MATHEMATICS – III L T P C (Common for EEE , ECE, IT, CSE, ICE, BM & EIE) 3 1 0 4
(for candidates admitted from 2004-05 and afterwards) UNIT I FOURIER SERIES 9 Dirichlet’s conditions – General Fourier series – Half range Sine and Cosine series – Parseval’s identity – Harmonic Analysis. UNIT II PARTIAL DIFFERENTIAL EQUATIONS 9 Formation – Solution of standard types of first order equations – Lagrange’s equation – Linear homogeneous partial differential equations of second and higher order with constant coefficients - Classification of second order linear partial differential equations. UNIT III ONE DIMENSIONAL WAVE & HEAT EQUATION 9 Boundary and initial value problems - Transverse vibrations of elastic string with fixed ends – Fourier series solutions – One dimensional heat equation - Steady and transient states – problems. UNIT IV TWO DIMENSIONAL HEAT EQUATION 9 Two dimensional heat equation – Steady state heat flow equation – Laplace Equation Cartesian form – Laplace equation in polar form – heat flow in circular plates including annulus - Fourier series solution. UNIT V FOURIER TRANSFORMS 9 Statement of Fourier integral theorem – Fourier transform pairs – Fourier Sine and Cosine transforms – Properties – Transforms of simple functions – Convolution theorem – Parseval’s identity.
Singapore, 2000. 2. Kandasamy P etal. Engineering Mathematics, Vol. II & Vol. III (4th revised edition),
S.Chand & Co., New Delhi, 2000. 3. Narayanan S., Manicavachagom Pillay T.K., Ramanaiah G., Advanced Mathematics for
Engineering students, Volume II & III (2nd edition), S.Viswanathan Printers and Publishers, 1992.
4. Venkataraman M.K., Engineering Mathematics – Vol.III – A & B (13th edition), National Publishing Co., Chennai, 1998.
29
CS201 MICROPROCESSORS L T P C
(for candidates admitted from 2003-04 and afterwards) 3 1 0 4
PURPOSE This course provides a comprehensive knowledge of the various Microprocessors and their Interfacing concepts INSTRUCTIONAL OBJECTIVES • Basics of Intel Processors and Motorola Processors • Advanced concepts and programming the various processors • Peripherals and their Interfacing with processors UNIT I INTRODUCTION 8 Evolution of microprocessors-Microcomputer hardware-Microcomputer system software and programming concepts-basic features of microcomputer development systems—System development flow chart-harware and software. UNIT II INTEL 8085 8 8085Microprocessor:Architecture,instructionformat,instruction classification,instruction set,addressing modes.programming with 8085,8085 based microcomputer system. UNIT III INTEL 8086 9 Register Organization, Architecture, Signal Descriptions of 8086 -Minimum Mode and Timings-Maximum Mode and Timings-Instruction Formats-Addressing Modes-Instruction Set-Assembler Directives-Assembly language programs-Macros and Procedures-Stack Structures-Interrupts-Delay Routines. UNIT IV ADVANCED INTEL MICROPROCESSORS 9 Architecture, Salient features, Addressing Modes, Interrupts and Pin Details of 80286, 80386, 80486, Pentium-II, Pentium-III, Pentium Pro. UNIT V PERIPHERALS AND THEIR INTERFACING 11 Memory Interfacing, Static RAM,Dynamic RAM Interfacing, Interfacing I/O Ports, PIO 8255, Stepper Motor Interfacing- Programmable Interval Timer 8253- Programmable Interrupt Controller 8259A , Keyboard and Display Interfacing 8279- Programmable Communication Interface USART 8251- DMA Controller 8257, CRT Controller 8275.
Tutorial 15 Total 60
TEXT BOOK 1. Mohamed Rafiquzzaman ,“Microprocessors and Microcomputer Based system
design”, Universal Bookstall,2002. REFERENCE BOOKS 1. K. Ray and K. M. Bhurchandi, “Advanced Microprocessors and Peripherals-Architecture, Programming and Interfacing”, Tata McGraw- Hill Publishing Company, 2000
30
2 Ramesh Gaonkar,”Microprocessor architecture Programming and applications with 8085”,fifth edition,Prentice hall. 3. Dougles V.Hall, “Microprocessors and Interfacing-Programming and Hardware”,Tata McGraw-Hill,2002. 4. Lance A. Leventhal ,“Introduction to Microprocessors: software, Hardware, programming”, Prentice Hall of India. 5. Yu-Cheng Liu and Glenn A. Gibson. ,“Microcomputer Systems-The 8086/8088 family-Architecture, Programming and Design” 6. Barry B.Brey , “ The INTEL Microprocessors,PHI, 6th edition, 2002 7. Michael Slater, “ Microprocessor based design” , PHI, 2nd edition 2001
CS203 DATA STRUCTURES L T P C
(for candidates admitted from 2003-04 and afterwards) 3 1 0 4
PURPOSE The purpose of this course is to impart knowledge on various data structure concepts to the students.
INSTRUCTIONAL OBJECTIVES At the end of the course, student should be able to understand • Several data structure concepts like stacks, queues, linked list, trees and files • Applications of data structures • Problem solving using data structure tools and techniques UNIT-I INTRODUCTION 9 Definitions of Data Structure and Algorithm. – Time and Space complexity- Algorithm notations –Control structures- Variables – Data types- Arrays- String processing – Sorting and Searching- Insertion-Selection-Merge- Radix-Binary Search- Linear Search-Hashing UNIT-II STACKS AND QUEUES, RECORDS AND POINTERS 9 Stacks: Array representation of stacks – Arithmetic expressions- Quick sort using stack- Towers of Hanoi problem- Queues: : Array representation of Queues- Deque, Priority Queue, Circular Queue- Records and Pointers UNIT –III LINKED LIST 9 Representation of Linked List- Traversing a Linked List- Insertion- Deletion- Doubly Linked List- Circular Linked List UNIT – IV TREES 9 Binary tree- Representation – Traversing – Threaded Binary tree- Binary Search tree- Insertion deletion into a binary search tree- Heap sort- Huffman’s Algorithm- General Trees
UNIT- V GRAPH & FILES 9 Graph- Representation of Graph- Shortest path – Operation on Graphs- Traversing a Graph- Topological Sorting – Files Tutorial 15
Total 60
31
TEXT BOOKS : 1. Seymour Lipschutz ,“Theory and Problems of Data Structures” ,Schaum series 1986 2. Ellis Horowitz & Sartaj Sahani – “Fundamentals of Data Structures in C ” – W.H.
Freeman and Co. – 1992. (Only for files- Unit -V) REFERENCE BOOKS :
1. Mark Allen Weiss – “Data Structures and Analysis in C” - Pearson Education Pubs. – 1996.
3. Jean Paul Tremblay & Paul Sorenson – “An Introduction to Data Structures with Applications” – TMH – 1984.
4. Behrouz A.Forouzan, Richard Gilberg, “Computer Science – Structured Programming Approach Using C “, 2nd Ed, Thomson Asia, 2001
CS207 DESIGN AND ANALYSIS OF ALGORITHMS L T P C (for candidates admitted from 2003-04 and afterwards) 3 0 0 3
PURPOSE This course will provide an understanding of how to write algorithms for various problems and do an analysis of the same
INSTRUCTIONAL OBJECTIVES • Divide and Conquer , Dynamic Programming techniques • Backtracking , NP complete problems • Various analysis of algorithms
UNIT I ANALYSIS OF ALGORITHM 9 Introduction- Algorithms and Complexity – Asymptotic Notation- Orders-Analyzing Control Structures- Average Case Analysis – Worst Case Analysis. UNIT II DIVIDE AND CONQUER METHOD 9 General Method - Binary Search – Finding Maximum and Minimum – Merge Sort – Quick Sort Greedy Method – General Method – KnapSack Problem – Minimum Spanning Tree Algorithm – Single Source Shortest Path Algorithm. UNIT III DYNAMIC PROGRAMMING 9 General Method–Multistage Graph – All Pairs Shortest Path Algorithm – 0/1 Knapsack Problem – Traveling Salesman Problem - Basic search techniques and traversal techniques –bi-connected components – Depth First Search – Breadth First Search. UNIT IV BACKTRACKING 9 The General Method – 8-Queens Problem- Sum of Subsets – Graph Coloring- Hamiltonian Cycle-Knapsack Problem – Branch and Bound Method – 0/1 Knapsack Problem – Traveling Salesman Problem
32
UNIT V NP-COMPLETENESS AND HARDNESS 9 NP – Completeness – NP- Hardness – Basic concepts – NP Hard graph problems – NP Hard Scheduling problems – NP hard code generation problems - Approximation Algorithms – Introduction - Absolute approximations - Its Analysis.
Total 45 TEXT BOOK 1. E.Horowitz , Sahni & Sanguthevar Rajasekaran, “Fundamentals of Computer
Algorithms”, Galgotia Publications,1985 REFERENCE BOOKS 1. Gilles Brassard & Paul Brately ,”Fundamentals of Algorithms “, PHI, 1997 2. Aho, Ullman & Hopcraft, “The Design and Analysis of Algorithms”, Addison Wesley ,
1974 3. S.E.Goodman , S.T.Hedetniemi , “Introduction to the Design and Analysis of
Algorithms”, McGraw Hill 4. Sara Baase , “Computer Algorithms - Introduction to design and analysis”, Addison
wesley , 1991
CS209 DIGITAL COMPUTER FUNDAMENTALS L T P C
(for candidates admitted from 2004-05 and afterwards) 3 0 0 3
PURPOSE To learn the fundamentals of digital Computer and its components INSTRUCTIONAL OBJECTIVES • Boolean Algebra , Sequential and Combinational Logic • Process and Control Organization • Design of digital components • Design of Micro Computer. UNIT I INTRODUCTION 9 Computer Basics: - overview of computer operations- The central processor unit - data path components- The register file - The Arithmetic and logic unit - Local memory Instructions and the data path - control unit - CISC and RISC Architectures - Floating point operations. UNIT II INSTRUCTION SET 9 Instruction set Architecture: Basic computer operations cycle - Register set - operand Addressing - Addressing modes - Instruction set Architectures - Data transfer instructions - Data manipulation Instructions - program control Instructions - Program interrupt UNIT III CISC & RISC 9 Central processing unit designs: Tow CPU designs - The complex instruction set computer - Micro programmed control organization - Micro program structure - Micro routines- The Reduced Instruction set computer - Data path organization - Control organization - Data hazards - Control Hazards - CISC -RISC Compression - Recent Architectural Innovations - Digital Systems.
33
UNIT IV INPUT & OUTPUT 9 Input - output and communications: Computer I/O - Sample peripherals - I/O interfaces - Serial Communication - Modes of transfer - parallel priority hardware - Direct memory access - DMA controller - DMA transfer - I/O processors. UNIT- V MEMORY SYSTEMS 9 Memory systems: Memory hierarchy - Locality of reference - cache memory - cache mapping - cache loading - write methods - Instruction and data caches - multiple level caches - Virtual memory Page tables - Translation look aside buffer - Virtual memory and cache - Associative memory - Mapping techniques. Total: 45 TEXT BOOK 1. Morris Mano , “Logic and Computer Design Fundamentals”, 2nd edition updated, pearson education 2001 2. John p uyemura , “A first course in digital systems design An integrated approach “, Thomson books publishing (Chapter 8 for unit I)
REFERENCE BOOKS 1. Bhujade, “Digital Computer Design Principles”- M.R,Pitambar Publishing co.,1989. 2. Schneider G.M., “The principles of Computer Organization”, John Wiley & Sons,1985. 3. Bartee.T.C,”Computer Architecture Logic design”,McGraw hill 1997. 4. A.P.Malvino and D.P.Leach, “Digital Principles and applications”,4’th edition Tata McGraw Hill ,1997.
EC211 COMMUNICATION ENGINEERING L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3
PURPOSE The subject Communication Engineering is offered for EIE , ICE EEE&CSE branch students who are expected to know about the basics of communication engineering such as Analog modulation methods(AM, FM,PM Transmission, Reception), PCM and finally Digital modulation techniques. INSTRUCTIONAL OBJECTIVES • AM Modulation and Demodulation – DSB-FC,DSB-SC,SSB,VSB. • FM Modulation and Demodulation • Data Transmission – ASK, FSK, PSK. • PAM, PPM, PWM, PCM, TDM AND FDM. • Fundamentals of Radar, TV, satellite and fiber optical communication. UNIT I AM MODULATION 9 Source of noise – Internal and external – Types – Need for Modulation_ Amplitude Modulation – Generation of AM waves (DSB-FC) - Suppressed carrier systems (DSB-SC) – Single side band modulation(SSB) – Vestigial side band modulation (VSM) - comparison of various AM systems.
34
UNIT II TRANSMITTERS AND RECEIVERS 9 Demodulation of AM waves – Envelope Detectors – Synchronous Detectors - Pilot carrier method – AM Transmitters - Low level and High level transmitters – AM Receivers – TRF receiver, super heterodyne receiver – Frequency Division Multiplexing. UNIT III FM MODULATION AND DEMODULATION 9 Introduction to angle modulation systems – Definitions for FM & PM – Narrow band FM – Wide band FM – FM Modulators - Direct and Indirect method – FM Transmitters - FM Demodulators – Slope detector - Ratio Detector – Frequency discriminator – PLL - FM Receivers - Noise in angle modulated systems – Comparison between AM & FM. UNIT IV PULSE MODULATION 9 Introduction to Pulse modulation systems – Pulse amplitude modulation – Pulse Time modulation – Pulse code modulation – Inter symbol Interference - Eye Patterns – Equalization - companding – time division multiplexing – synchronous and asynchronous - pulse stuffing – Bandwidth of PCM – noise in PCM – delta modulation – adaptive delta modulation – comparison between PCM and DM – DPCM. UNIT V COMMUNICATION SERVICES (ELEMENTARY TREATMENT ONLY) 9 Radar: Basic Radar system – Radar range equation – Pulsed radar systems. Television: Picture elements – Transmission and reception of picture information – Motion picture – Horizontal and vertical scanning frequencies – TV transmitters – TV Receivers – TV channels. Satellite communication: Read – orbit – Satellite altitude – Transmission path – its loss – Satellite system. Fiber optical communication: Need – Principles of light transmission in a fiber – optical fiber communication system – optical fiber – Light sources – Photo detectors – Advantages.
Total 45
TEXT BOOKS 1. R.P.SINGH, S.D.SAPRE, “Communication Systems, Analog and Digital “, McGraw Hill
Pub. 5th Reprint 2000. 2. DESHPANDE,N.D , “Communication Electronics” , Tata McGraw Hill Pub.1989. REFERENCE BOOKS 1. KENNEDY, “Electronic of Communication Systems” , McGraw Hill – 5th reprint – 2000. 2. RODDY D. and COOLEN J.,” Electronic communications”, Prentice Hall of India P. Ltd.
1987. 3. ANOKH SINGH, “Principles of communication Engineering”, S.Chand & Co. 1991.
35
LE201 GERMAN LANGUAGE PHASE I L T P C (SEMESTER – 3) 2 0 0 2
Instructional Objectives for beginners with no knowledge of German acquiring basic verbal and communication skills. Unit – I 10 Hrs Introduction German Language, Alphabets and Pronunciation. Themen; Name, Land, Leute, Beruf, Familie geschwister, Einkaufen, Reisen, Zahlen, Haus, Freunden, Essen and Stadium, Fest, Zeit. Unit – II 10 Hrs Listening; Listening to the cassette and pay special attention to the meaning and sounds. Listening Comprehension – Announcements / Airport / Station / General. Unit – III READING : 10 Hrs Listening to the cassette and reading it allowed. READING COMPRENSION BASICS / STATION / NEWS / NOTICE BOARDS. TOTAL 30 Glossary Technical Words Lesson 1-5 Text Book with cassettes
A. Grundkurs Deutsch or B. Momentmal (Prescribed by Max Mueller Bhavan – Goethe Institute, Germany).
Continuous assessment tests : At the end of every two weeks. Listening 20 Marks Speaking 10 Marks Reading 10 Marks Writing 10 Marks Internal 50 Marks + End Semester Exam 50 Marks = 100 Marks = 2 Credits
36
CS213 DATA STRUCTURES AND ALGORITHMS LAB L T P C (for candidates admitted from 2003-04 and afterwards) 0 0 3 2
PURPOSE This laboratory course gives a thorough understanding of the concepts of various Data Structures and its applications. It also gives a comprehensive understanding of the various algorithms for problems given INSTRUCTIONAL OBJECTIVES
• Implementing Stack, Queue , Linked List , Binary tree • Sorting and Searching Techniques • Divide and Conquer, Dynamic Programming methods • Greedy method , Traversals and Backtracking
List of Exercises CYCLE – I 20 hrs 1. Implementation of stack & Queue 2. Linked Lists - Singly linked 3. Doubly linked lists 4. Binary tree Implementations and traversals. 5. Sorting Techniques : Insertion , Selection Sort 6. Sorting Techniques : Quick sort , Merge sort CYCLE- II 25 hrs
1. Divide and Conquer Method - Binary Search - Max Min Problem
3. Traversal Technique - Depth First Search - Breadth First Search
4. Backtracking - 8-Queens Problem
Total 45 REFERENCE :Laboratory Manual
37
CS215 MICROPROCESSOR AND ASSEMBLY LANGUAGE PROGRAMMING LAB
L T P C
(for candidates admitted from 2003-04 and afterwards) 0 0 3 2 PURPOSE This laboratory course provides a better understanding of Assembly Language Programming using 8086 processor INSTRUCTIONAL OBJECTIVES • Simple Assembly programming like conversions, sorting , searching etc. • Advanced concepts like functions and recursion • Manipulating the Directory and files List of Experiments: 8085 programs:
1. 8 bit addition,subtraction 2. 16 bit addition,16 bit subtraction,multiplication division. 3. Block movement of data. 4. Code conversion-BCD too Binary,Binary to BCD 5. Ascending and descending order
8086 programs: 1. 16b bit Addition and Subtraction, multiplication ,division.. 2. Sorting n numbers using any standard method 3. Matrix Multiplication 4. Reverse a String 5. Factorial Computation using Recursion 6. Generation of Fibonacci Sequence using recursion 7. Stepper motor controller 8. Display controller 9. Keyboard controller 10. Timer. REFERENCE : Laboratory Manual Total : 45
38
SEMESTER – IV
MA212A PROBABILITY AND QUEUEING THEORY L T P C (Revised Syllabus with effect from 2004-2005) 3 1 0 4 (COMMON FOR CSE, IT, ICE & BM )
UNIT I PROBABILITY AND RANDOM VARIABLES 9 Probability concepts − Random Variable – Characteristics of random variables : Expectation, Variance, Covariance, Moments; Moment generating function – Function of random variable – Chebychev’s inequality. UNIT II THEORETICAL DISTRIBUTIONS 9 Discrete : Binomial, Poisson, Geometric, Negative Binomial; Continuous : Exponential and Normal Distributions. UNIT III TESTING OF HYPOTHESES 9 Large sample tests based on Normal Distribution – Small sample tests based on t, F distributions – Chi square tests for goodness of fit and independence of attributes. UNIT IV PRINCIPLES OF QUEUEING THEORY 9 Introduction to Markovian queueing models – Single server model with finite and infinite system capacity – Characteristics of the model; Applications of queueing theory to computer science and engineering. UNIT V MARKOV CHAINS 9 Introduction to Markov process – Markov chains – transition probabilities – Limiting distribution.
TUTORIAL 15 TOTAL 60
TEXT BOOKS 1. Veerarajan T., Probability, Statistics and Random Processes, Tata McGraw Hill,1st
Reprint 2004. (Unit I – Chapter 1 Pages 1.1-1.20, Chapter 2 Pages 2.1 – 2.3, Chapter 3 Pages 3.1, Chapter 4 Pages 4.36 Unit II – Chapter 5 Pages 5.1 – 5.8, 5.38, 5.39,5.44 – 5.53, Unit IV – Chapter 8 Pages 8.1-8.10,8.15, Unit V–Chapter 6 Pages 6.1– 6.3, Chapter 7 Pages 7.45 – 7.49)
2. S.C. Gupta and V.K. Kapoor, Fundamentals of Mathematical Statistics, 9th extensively revised edition, Sultan Chand & Sons, 1999. (Unit III – Chapter 12 Section 12.1, 12.3,12.4,12.6-12.42, Chapter 13 Section 13.5, 13.39, 13.49, Chapter 14 Section 14.16- 14.24, 14.57).
REFERENCE BOOKS
1. Trivedi K S, “ Probability and Statistics with reliability, Queueing and Computer Science Applications”,Prentice Hall of India,New Delhi, 1984
2. Gross.D and Harris.C.M. “Fundementals of Queuing theory”, John Wiley and Sons, 1985.
3. Allen.A.O., “Probability Statistics and Queuing theory”,Academic Press, 1981.
39
CS202 OPERATING SYSTEMS L T P C (Same as IT204) 3 1 0 4
(for candidates admitted from 2003-04 and afterwards) PURPOSE Every computer professional should have a basic understanding of how an operating system controls the computing resources and provides services to the users. This course provides an introduction to the operating system functions, design and implementation. This course serves as a strong foundation for courses like Networks, Data base systems. INSTRUCTIONAL OBJECTIVES The main aim of this course is provide the various functions of the OS and how they are implemented. The students learn about:
• Structure and functions of OS • Process scheduling , Deadlocks • Device management • Memory management • File systems
UNIT I INTRODUCTION 6
Computer system overview-basic elements, Instruction execution, Interrupts, memory hierarchy, I/O communication techniques, operating system overview-objectives and functions, Evolution of OS characteristics of modern OS
UNIT II PROCESSES 9 Process description and control - process states, process description, process control; Processes and Threads, Symmetric Multiprocessing and microkernels. UNIT III CONCURRENCY AND SCHEDULING 12 Principles of concurrency - mutual exclusion and synchronization, semaphores, producer/consumer problem , monitors, Readers/Writers problem; Deadlocks. Scheduling : Types of scheduling – scheduling algorithms.. UNIT IV MEMORY 9 Memory management requirements, partitioning, paging, and segmentation; Virtual memory - Hardware and control structures, operating system software UNIT V INPUT/OUTPUT AND FILE SYSTEMS 9 I/O management and disk scheduling – I/O devices, organization of I/O functions; OS design issues, I/O buffering, disk scheduling, Disk cache, File management – organization, directories, file sharing, record blocking, secondary storage management; Tutorial 15
Total 60 TEXT BOOK 1. William Stallings, “Operating Systems – internals and design implementation ”, Prentice
Hall India, 4th Edition, 2001. (CH 1,2.1-2.4,3.1-3.3,4.1-4.3,5.1-5.5,5.7,6.1-6.5,7,8.1-8.2,9.1-9.2,11.1-11.5,11.7, 12.1-12.6)
40
REFERENCE BOOKS 1. Andrew S. Tannenbaum & Albert S. Woodhull, “Operating System Design and Implementation”, Prentice Hall India, 2nd Edition,1998. 2. Gary Nutt, “Operating System - A Modern Perspective”, Pearson Education Asia, 2nd Edition 2000.
(for candidates admitted from 2004-05 and afterwards) 3 1 0 4
PURPOSE To learn the Object Oriented concepts and programming using C++ and JAVA languages is the purpose of this course. INSTRUCTIONAL OBJECTIVES
• Understanding of Class and Objects • Thorough knowledge of concepts like Overloading , inheritance, virtual functions and
templates • Learning Streams and file operations
UNIT—I INTRODUCTION TO C++ 8
Introduction to OOP - Basic Concepts of OOP—Applications Of OOP –Basics of C++ -- Classes and objects—Special functions in C++(Static, Inline, Friend)—Constructors—Destructors—Container Classes –Iterator Classes—This Pointer—New and Delete Operators—Basics of Pointer. UNIT—II POLYMORPHISM 9
Overloading—Fundamentals—Restrictions—Unary and Binary Operators Overloading—Overloading Insertion and Extraction Operators—Inheritance—Basics—Access Specifiers—Types of Inheritance—Private, Protected and Public Inheritance—Overloading—Direct and Indirect base Classes –Abstract base Classes—Virtual Functions—Dynamic Binding—Virtual Destructors. UNIT—III STREAMS & FILES 8 Streams—I/O Streams—Stream Manipulators—Format states—Error States Files—File Operations—File Pointers—Error Handling During File Operations Templates—Introduction—Class template—Function Templates—Templates with Multiple Parameters.
Exception Handling — Basics of C++ Exception — Catching an Exception — Throwing an exception — Exception Specifications. UNIT—IV INTRODUCTION TO JAVA 10 Java—Introduction—Features—Data Types—Operators—Expressions—Control Structures—Classes, Objects and Methods—Constructors—Garbage Collector— Finalize() Method—Creation & Manipulation Of Arrays & strings—String Buffer Classes—Wrapper Classes—Inheritance—Types—Using Super keyword—Object Classes—Abstract and Final Classes—Packages—Interfaces.
41
UNIT—V MULTI THREADING AND STREAMS 10 Multi Threading—Fundamentals—Java Thread Model — Priorities—Synchronization—Inter Thread Communication. I/O—Basics—Streams—Bytes—Character Stream—Predefined Streams—Reading and Writing from Console and Files—Exception Handling Mechanisms—java Applet—AWT Controls. Tutorial 15 Total 60 TEXT BOOKS 1. Deitel H.M. & Deitel P.J. – “How to Program C++” – PHI – 2003. 2. Patrick Naughton and Herbertz Schidt , “Java-2 the complete Reference”, TMH, 2000 (Unit IV & V) REFERENCE BOOKS 1.D.Samanta, “Object Oriented Programming With C++”, PHI 2003 2. Hartmann , Cornell , “ Core Java Fundamentals” Vol-I , Sun series , Addison Wesley 2000 3 .Al Stevens – “C++ Programming” – Wiley dreamtech – 2003. 4. Herbert Schildt, “Complete Reference” - 2003 5. .Arnold and J .Gosling,”The Java Programming Language “ ,2nd Edition.
CS206 SYSTEM SOFTWARE L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3
PURPOSE In addition to application software, the students will be introduced to the very powerful system software programming. They will be able to appreciate and understand the working of assemblers, loaders, linkers, macro processors and compilers. INSTRUCTIONAL OBJECTIVES At the end of the course, student should be able to:
• Classify various system software machine architectures like RISC, CISC etc. • Write assembly language programs • Design compilers, linkers and loaders • Gain knowledge about various editors, debuggers and system software tools • Implement macros, parsers and various code generation techniques.
TOTAL 45 TEXT BOOK Leland L. Beck – “System software – An Introduction to Systems Programming”,Addison Wesley,1997. REFERENCE BOOKS 1.Dhamdhere D.M.– “Systems Programming and Operation Systems” – TMH - 1999. 2.John J. Donavan – “Systems Programming” - McGraw Hill. - 1972
CS208 COMPUTER ORGANIZATION AND ARCHITECTURE L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3
PURPOSE The purpose of this course is to give a strong foundation of the computer organization and its internal architecture. INSTRUCTIONAL OBJECTIVES
• Gives a knowledge of various architectures • CPU, Control unit, I/O Processing • Memory and its types • Design of the above components
UNIT I INTRODUCTION 9 Evolution Of Computer Systems-Different layers of a computer system and their interfaces- Addressing modes-Design of a computer system-Memory location and addresses-Instruction and instruction sequencing,RISC versus CISC. UNIT II CENTRAL PROCESSING UNIT 9 Introduction-Data path & control path-Micro operations on Data path-Arithmetic Logic Unit - Arithmetic Processor-co-processor , Fixed point arithmetic, floating point arithmetic.
43
UNIT III CONTROL UNIT DESIGN 9 Introduction-Control Transfer-Fetch cycle. Instruction Interpretation & Execution - Hardwired control - Microprogrammed control,pipelined control. UNIT IV MEMORIES AND SUBSYSTEMS 9 Semiconductor memory - Static and Dynamic -Associative memory- Cache memory- Virtual memory-Secondary memories-Optical magnetic tape & magnetic disks & controllers. UNIT V I/O PROCESSING 9 Introduction-Data transfer techniques- Bus Interface- I/O Channel / Processor,I/O devices.
Total 45 TEXT BOOK 1. P.Pal Chaudhuri, "Computer Organization and Design" , 2nd Edition, PHI ‘ 2003 REFERENCE BOOKS 1. Vincent P.Heuring Harry F.Jordan ,"Computer Systems Design & Architecture" Addison
- Wesley. 2. William Stallings , “Computer Organisation and Architecture – Designing for
Performance” , PHI, 2004. 3. John P.Hayes, "Computer Architecture and Organisation" III Edition, McGraw Hill
International Editions, 1998.
CS210 THEORY OF COMPUTATION L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3
PURPOSE The purpose of this course is to impart concepts of Theory of Computation. INSTRUCTIONAL OBJECTIVES
• Study of Finite Automata & Grammers • Pushdown Automata, Turing Machines • Undecidabilty problems
UNIT I FINITE AUTOMATA 10
Introduction - Basic Mathematical Notation and techniques- Finite State systems – Basic Definitions – Finite Automation – DFA & NFA – Finite Automaton with ε-moves – Regular Languages- Regular Expression – Equivalence of NFA and DFA – Equivalence of NFA’s with and without ε-moves – Equivalence of finite Automaton and regular expressions –Minimisation of DFA- Mealy and Moore Machines- Pumping Lemma for Regular sets – Problems based on Pumping Lemma.
44
UNIT II GRAMMARS 9
Introduction – Types of Grammar - Context Free Grammars and Languages– Derivations and Languages – Relationship between derivation and derivation trees – ambiguity – simplification of CFG – Greiback Normal form – Chomsky normal forms – Problems related to CNF and GNF.
UNIT III PUSHDOWN AUTOMATA 9
Pushdown Automata: Definitions – Moves – Instantaneous descriptions – Deterministic pushdown automata – Pushdown automata and CFL - pumping lemma for CFL - Applications of pumping Lemma. UNIT IV TURING MACHINE 9
Turing Machines: Turing machines – Computable Languages and functions – Turing Machine constructions – Storage in finite control – multiple tracks – checking of symbols – subroutines – two way infinite tape. UNIT V UNDECIDABILITY 8
Undecidability: Properties of recursive and Recursively enumerable languages – Universal Turing Machines as an undecidable problem – Universal Languages – Rice’s Theorems.- Halting Problem- Post Correspondence. Total 45
TEXT BOOK 1. J.E.Hopcroft and J.D.Ullman, “Introduction to Automata Theory, Languages and
Computation”, Narosa Publishers, 2002. REFERENCES BOOKS 1. Michael Sipser, “Introduction to the Theory of Computation”, Thomson Asia, 1997. 2. J.C.Martin, “Introduction to Languages and Theory of Computation”, McGraw Hill, 2003.
45
LE202 GERMAN LANGUAGE PHASE II L T P C (SEMESTER – 4) 2 0 0 2
Unit I Speaking; 20 Hrs Dialogue – Questioning / Basic queries / Conversational with practical exposure. Unit II Grammatik (Writing) 10 Hrs Verben, Wortstellung, Nomen, Pronomen, Artikel, Nominitativ, Akkusativ, Dativ, Adjective, Prasens, Perfect and Neben Satze. Total 30 Glossary Technical words. Lesson 6-10. Text Book with cassettes
A. Grundkurs Deutsch Or B. Momentmal (Prescribed by Max Mueller Bhavan – Goethe Institute, Germany).
Continuous Assessment tests : At the end of every two weeks. Listening 10 Marks Speaking 20 Marks Reading 10 Marks Writing 10 Marks Internal 50 Marks + End Semester Exam 50 Marks = 100 Marks = 2 Credits
46
CS214 OPERATING SYSTEMS LAB L T P C
(for candidates admitted from 2003-04 and afterwards) 0 0 3 2 PURPOSE This laboratory course gives a complete understanding of the operating systems principles and its implementations INSTRUCTIONAL OBJECTIVES
• Scheduling algorithms and File allocation and Organization • Deadlock algorithms and Page replacement algorithms • Memory management schemes ,Thread and synchronization
List of Experiments 1. Simulate the following CPU scheduling algorithms
a) Round Robin b) SJF c) FCFS d) Priority 2. Simulate all file allocation strategies
a) Sequential b) Indexed c) Linked 3. Simulate MVT and MFT 4. Simulate all File Organization Techniques
a) Single level directory b) Two level c) Hierarchical d) DAG 5. Simulate Bankers Algorithm for Dead Lock Avoidance 6. Simulate Bankers Algorithm for Dead Lock Prevention 7. Simulate all page replacement algorithms
a) FIFO b) LRU c) LFU 8. Shared memory and IPC 9. Simulate Paging Technique of memory management. 10. Threading & Synchronization Applications REFERENCE :Laboratory Manual Total 45
47
CS216 OBJECT ORIENTED PROGRAMMING LAB L T P C
(for candidates admitted from 2004-05 and afterwards) 0 0 3 2
List of Experiments C++ 1 Simple C ++ programs. 2. Inline Functions 3. Constructors and Destructors 4. Overloading 5. Inheritance ( Multiple, Multilevel, Hybrid & Hierarchical) 6. Virtual Functions 7 File Handling 8 Templates JAVA 1. Simple Java Programs 2. Programs using Arrays and Strings 3. Packages 4. Interfaces 5. Threading 6. Java Applets
REFERENCE : Laboratory Manual Total : 45
48
SEMESTER – V
MA321 DISCRETE MATHEMATICS L T P C (for candidates admitted from 2003-04 and
afterwards) 3 1 0 4
UNIT I MATHEMATICAL LOGIC 9 Propositions and Logical operators – Truth tables and propositions generated by a set – Equivalence and Implication – Tautologies – Laws of logic – Proofs in Propositional calculus – Direct proofs – Conditional conclusions – Indirect proofs – Propositions over a universe – Mathematical Induction – The existential and universal quantifiers – Predicate calculus including theory of inference. UNIT II SET THEORY 9 Laws of Set theory – Partition of a set – Minsets – The duality principle – Relations – Graphs of relations – Hasse diagram – Matrices of relations – Closure operations on relations – Warshall’s algorithm – Functions – Combinatorics. UNIT III RECURRENCE RELATION & ALGEBRAIC SYSTEMS 9 Recurrence relations – Solving a recurrence relation – Recurrence relations obtained from solutions – Generating functions – Solution of a recurrence relation using generating functions – Closed form expression for generating function. Groups – Cyclic groups and subgroups – Normal subgroups – Coding theory – Group codes. UNIT IV GRAPH THEORY 9 Basic concepts – Data structures for graphs – Connectivity – Traversals graph optimization – The traveling salesman problem and networks and the maximum flow problem – Trees – Spanning Trees – Rooted trees – Binary Trees – Kruskal’s algorithm – Traversals of Binary trees. UNIT V BOOLEAN ALGEBRA & FORMAL LANGUAGES 9 Boolean algebra – Posets – Lattices – Application of Boolean Algebra to switching theory. Languages – Recognition and generation - Phase structure grammars and languages – Finite state Machine – Recognition in regular languages .
TUTORIAL 15 TOTAL 60
TEXT BOOK 1. Alan Doerr and Kenneth Levasseur, “Applied Discrete Structures for Computer Science”,
REFERENCE BOOKS 1. Tremblay J.P. and Manohar R., “Discrete Mathematical Structures with applications to
Computer Science”, Tata Mc Graw Hill Publishing Co.,2000 2. Venkataraman M.K., etal. “Discrete Mathematics”, National Publishing Co. 3. Seymour Lipschutz, Marc Lars Lipson, “Discrete Mathematics”, Mc Graw Hill Inc., 1992 4. Kolman and Busby, “Discrete Mathematical Structures for Computer Science”, 1987.
CS301 COMPILER DESIGN L T P C (for candidates admitted from 2003-04 and afterwards) 3 1 0 4
PURPOSE To learn the Design aspects of a Compiler INSTRUCTIONAL OBJECTIVES
• To study the features of various phases in the design of a compiler • To learn the various parsing techniques for design of a translator • To learn how to optimize and effectively generate machine codes
UNIT I INTRODUCTION 7 System- Software - Programming Language - Translators - Interpreters - Compilers - Assembler -Loader - linker - editors - Phases of Compilers - Structure of compiler - Passes Bootstrapping UNIT – II GRAMMARS, EXPRESSIONS &AUTOMATA 9 Context free Language - Context free grammar - regular expression - Recognizing of patterns - finite automation (deterministic & non deterministic) Conversion of NDFA to DFA - Conversion of regular expression of NDFA - minimization of NDFA - Derivation - parse tree - ambiguity – handle UNIT III LEXICAL ANALYSIS AND SYNTAX ANALYSIS 9 Definition - the role of lexical analyzer - token specification - design of lexical analysis (LEX) - Automatic generation of lexical analyzer - input buffering - A language for specifying lexical analyzers - implementation of lexical analyzer - Definition - role of parsers - top down parsing - bottom-up parsing - Left recursion - left factoring - Handle pruning , Shift reduce parsing - operator precedence parsing - productive parsing - recursive descent parsing - parser generator. LR parsing – LR (0) items - SLR parsing - LALR parsing - generation of LALR - Ambiguous grammars - error recovery UNIT IV SYNTAX DIRECTED TRANSLATION 9 Languages - prefix - postfix - Quadruple - triple - indirect triples - intermediate code generation - Evaluation of expression - three-address code-Introduction - S-attribute - R-attributes - Declaration - flowcharted statements - procedure codes - CASE statements - Assignment statement schemes - Back patching - Syntax free construction UNIT V SYMBOL TABLE & CODE OPTIMIZATION 11 Symbol Table - Symbol table contents - data structure for symbol tables - storage allocation - Runtime storage management. Sources of optimization - Loop optimization - DAG representation of basic block - Dominators - flow graphs - object program - problems in code generation - machine model - simple code generator - Code generation from DAG - peephole optimization.
Tutorial 15
Total 60
50
TEXT BOOK 1. Alfred V Aho , Jeffery D Ullman , Ravi Sethi, " Compilers , Principles techniques and
tools ", Pearson Education 2001 REFERENCE BOOKS 1. Tremblay ,Sorensan , “Compiler Writing “ , McGraw Hill,1985 2. Alfred V. Aho , Jeffery D. Ullman, “Principles of Compiler Design", Narosa
Publishing ,1985 3. Hopcraft , Jeffery D Ullman, Rajeev Motwani , "Introduction to Automata theory,
languages and computation", Pearson Education, 2002 4. D.M.Dhamdhere , “Compiler Construction Principles and Practice” , Macmillan India
1995
CS303 SOFTWARE ENGINEERING L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3
PURPOSE This course in Software Engineering provides an in-depth understanding of the Software Engineering principles and methodologies INSTRUCTIONAL OBJECTIVES • Planning and Estimation of Software projects • Software Requirements Specification, Software Design Concepts • Implementation issues ,Validation and Verification Procedures • Maintenance of Software and methodologies UNIT I PLANNING AND COST ESTIMATIONS 9 Software project planning : Importance of software – Introduction – Defining the problem – Developing a solution strategy – Planning and development process – Other planning activities. Software cost estimation : Introduction – Software cost factors – Software cost estimation techniques – Staffing level estimation – Estimating software maintenance costs. UNIT II SOFTWARE REQUIREMENTS SPECIFICATION 9 Introduction – The software requirement specifications – Formal specification techniques – Languages and processors for requirements specification : SDAT, SSA, GIST, PSL/PSA, REL/REVS UNIT III SOFTWARE DESIGN CONCEPTS 9 Abstraction – Modularity – Software architecture – Cohesion, coupling – Various design concepts and notations – Real time and distributed system – Design – Documentation – Data flow oriented design – Jackson system development – Design for reuse – Programming standards. UNIT IV IMPLEMENTATION ISSUES AND MODERN LANGUAGE FEATURES 9 Implementation Issues : Introduction – Structured coding techniques – Coding style – Standards and guidelines – Documentation guidelines.
51
Modern Programming Languages Features : The translation process – PL characteristics – PL fundamentals : Type checking – Separate compilation – User defined data types – Data abstraction – Scoping rules – Excepting handling – Concurrency mechanisms. UNIT V VERIFICATION, VALIDATION AND MAINTENANCE 9 Introduction – Quality assurance – Walk through and inspections – Static analysis – Symbolic execution – Unit testing and debugging – System testing – Formal verification. Software Maintenance : Introduction – Enhancing maintainability during development – Managerial aspects of software maintenance – Configuration management – Source code metrics – Other maintenance tools and techniques.
Total 45 TEXT BOOK 1. Richard Fairley, “Software Engineering Concepts”, McGraw Hill, 1985. REFERENCE BOOKS 1. Roger S. Pressman, “Software Engineering A Practitioner Approach” 5th edition , McGraw
Hill, 1999 2. Sommerville I , “Software Engineering”,5th edition , Addison Wesley ,1996. 3. Shooman, Software Engineering, McGraw Hill, 1983. 4. David Gustafson, “ Software Engineering”, Schaum’s outlines,Tata McGraw- Hill,2003.
CS305 OBJECT ORIENTED ANALYSIS AND DESIGN L T P C
(Same as IT206) 3 0 0 3(for candidates admitted from 2003-04 and afterwards)
PURPOSE This course separates and makes explicit the decisions that make up an object oriented analysis and design. We show how to use the UML notations most effectively both to discuss designs with colleagues, and in documents. INSTRUCTIONAL OBJECTIVES To provide the students with sufficient knowledge for 1. Understanding Object Basics, Classes and Objects, Inheritance 2. Gaining enough competence in object-oriented analysis and design (OOAD) to tackle a
complete object oriented project 3. Understanding the issues and options in reuse 4. Using UML, a common language for talking about requirements, designs, and component
interfaces 5. Using different approaches for identifying classes, design process 6. Developing Testing strategies to ensure Software Quality UNIT I INTRODUCTION 7
Object Basics – Classes and Objects – Inheritance – Object relationship - Dynamic binding – OOSD Life Cycle – Analysis – Design - Implementation - Testing. UNIT II METHODOLOGY AND UML 10
Use case model; Approaches for identifying classes – Noun Phrase approach – Responsibilities-collaborators – Identifying Object relationships- case study. UNIT IV DESIGN 10
Design Process - Design Axioms,Class Design, Object Storage and Object Interoperability ; Access Layer – OODBMS , View Layer ; case study. UNIT V SOFTWARE QUALITY 8
Testing Strategies – Test cases - Test plan – Continuous testing – debugging principles – case study.
TOTAL 45 TEXT BOOK 1. Ali Bahrami , “Object Oriented System Development”, McGraw Hill International
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3 PURPOSE To learn the concepts and techniques of Artificial Intelligence and Expert systems with applications. INSTRUCTIONAL OBJECTIVES
• Heuristic techniques and knowledge representation • Reasoning techniques and Game playing • Expert Systems and their tools, with methodology for building an expert system
UNIT I INTRODUCTION 9 AI problems, AI Technique, defining problem as a static space search production systems, problem characteristics, production system characteristics. Heuristic Search Techniques: Generate – and – test, hill climbing, Best – First Search, problem reduction, constraint satisfaction, means-ends analysis. UNIT II KNOWLEDGE REPRESENTATION 9 Issues, predicate logic, resolution, representing, knowledge using rules, forward versus Backward reasoning, Matching, control knowledge, weak slot – and – filler structures, semantic nets, frames, stong slot – and – filler structures, conceptual dependency, scripts.
53
UNIT III REASONING TECHNIQUES 9 Nonmonotonic reasoning, Augmenting a problem solver, implementation of depth first search and Breadth first search, statistical reasoning, probability and Bayes theorem, certainty factors and rule-based systems, Bayesian Networks. Game Playing: Minimax search, alpha – beta cutoffs, planning system, Goal stack planning, hierarchical planning, understanding, understanding as constraint satisfaction. UNIT IV EXPERT SYSTEMS 9 Introduction, Characteristics, Acquiring, representing knowledge, reasoning, Nature of ES tools, stages in development of ES tools, EMYCIN, EXPERT, OPSS, ROSIE, Blackboard architecture , Rule based systems, Associative nets and symbolic computing. UNIT V BUILDING AN EXPERT SYSTEM 9 Building an Expert System, Difficulties in development of ES, Common pitfalls , Pitfalls during development, Expert Systems in market place , Commercial Implications.
Total 45 TEXT BOOKS 1. Elaine .Rich and K. Knight , “Artificial Intelligence”, TMH , 2nd Edition. ,2000 2. Donald A. Waterman , “ A Guide to Expert System”, Addison Weley, 1999 ( Unit – III & IV) REFERENCE BOOKS 1. Stewart Russel , Peter Norwig , “ Artificial Intelligence- A Modern Approach”, Prentice
Hall,1995 2. Hills J.Nilsson , “Artificial Intelligence – A new synthesis”, Harcourt Asia PTE Ltd.
Morgan Kaufmann ,1988 3. David W.Rolston , “Principles of AI and Expert System Development”, McGraw Hill ‘88
CS309 COMPUTER NETWORKS L T P C
(for candidates admitted from 2003-04 and afterwards) 3 1 0 4 PURPOSE To study the various layer in Computer Networking and its Protocol design INSTRUCTIONAL OBJECTIVES
• To study the various topologies, Physical and MAC layers • To learn the Transport ,Session and Presentation layers and its protocols • To learn the various applications of each layers
UNIT I INTRODUCTION 9 Computer Network Usage—Network Hardware—Network software—Reference Models—Example Networks—Network standardization.
54
UNIT II PHYSICAL AND DATA LINK LAYERS 9 Basics for Data communications—Transmission Media—Wireless transmission—Communication satellites—Tele Phone Network—Mobile Telephone system—Cable Television. Data link Layer design issues—Error Detection & Correction—Elementary Data link Protocols—Sliding window Protocols—Protocols Verification. UNIT III MAC & NETWORK LAYERS 9 Channel allocation problem—Multiple access Protocols—ether net—Wireless LAN’S—Briand band Wireless—Blue tooth—switching Network layer design issues—Routing Algorithms—Congestion Control Algorithms—QOS—Internetworking—In the Internet. UNIT IV TRANSPORT LAYER 9 Transport services—Elements of transport Protocols—A simple transport Protocols—UDP—TCP—Performance issues. UNIT V APPLICATION LAYER 9 DNS—E-mail—www-Multi Time dia—Cryptography—Communication Security. Tutorial 15 Total 60 TEXT BOOK 1. Andrew .S.Tenenbaum,” Computer Networks”, PHI, 4th Edition,2004. REFERENCE BOOKS 1. William Stallings, “Data & Computer Communication” , PHI 2001 2. Douglas E. Comer,”InterNetworking with TCP/IP Vol I & II “ , PHI, 2003 3. Richard Stevens, “UNIX Network Programming Volume 1,2nd edition,2002 4. Ed Tittel, David Johnson , “Guide to Network Essentials “, 2nd ed., Thomson Asia, 2001
CS313 SYSTEM SOFTWARE & COMPILER DESIGN LAB L T P C
(for candidates admitted from 2003-04 and afterwards) 0 0 3 2 PURPOSE This laboratory course gives good knowledge of writing systems software tools INSTRUCTIONAL OBJECTIVES
• Input and Output Processing and device management • DOS and memory resident programs • Linker, loader , editor simulations • Assembler , macro and phases of compiler designing
55
List of Experiments 1. Keyboard and screen processing 2. Disk processing 3. Memory resident programs 4. DOS file management 5. Implementation of simple editor 6. Design of a Linker 7. Design of a Loader 8. Design of an Assembler 9. Design of a Macroprocessor 10. Design of a Lexical Analyser 11. Converting a regular expression to DFA 12. Implementation of Shift Reduce Parsing 13. Implementation of Operator Precedence Parsing 14. Implementation of Recursive Descent Parsing 15. Computation of LR(0) items Ref: Laboratory Manual Total : 45
56
CS315 NETWORKING LAB L T P C (for candidates admitted from 2003-04 and afterwards) 0 0 3 2
PURPOSE This laboratory course deals with the complete implementation aspects of Networking and their applications INSTRUCTIONAL OBJECTIVES
• TCP Socket Programming , UDP applications , File transfer • RMI and Routing Algorithms.
List of Experiments 1. Write a socket Program for Echo/Ping/Talk commands.
2. Create a socket (TCP) between two computers and enable file transfer between them.
3. Write a program to implement Remote Command Execution ( Two M/Cs may be used )
4. Create a socket (UDP)
5. Write a code simulating ARP /RARP.
6. Create a socket for HTTP for web page upload & Download.
7. Write a program for TCP module Implementation.(TCP services)
8. Write a program for File Transfer in client-server architecture using following methods. (a) USING RS232C (b) TCP/IP
9. Write a program to implement RMI (Remote Method Invocation)
10. Perform a case study about the different routing algorithms to select the network path with its optimum and economical during data transfer.
a.Shortest path routing
b.Flooding
c.Flow based routing
d.Distance vector
e.Link State
f.Hierarchical
g.Broadcast /Multicast routing
Ref: Laboratory Manual Total :45
57
GE301 Personality Development – I L T P C 1 0 0 1 Purpose
To train the students to better in their overall competence
Objectives
The students will be able to improve the skills and learn new practices, emulate good
manners and get Good placement.
Unit – I Definition and Meaning (5hrs)
What makes up a personality, theories on Personality, Different Personality Types.
Unit – II influences on Personality – I (5hrs)
Personal Factors – Human Traits, Ego, Perception, Self – esteem, Conscience.
2. Practical Ways To A Powerful Personality, Gearge Weinberg, 1999
3. How To Win Friends And Influence People, Dale Carnegie., 2001
Public Speaking, Dale Carnegie., 2000
58
SEMESTER – VI
MA302 OPERATIONS RESEARCH L T P C (for candidates admitted from 2003-04 and
afterwards) 3 1 0 4
UNIT I RESOURCE SCHEDULING AND NETWORK ANALYSIS 9 Problem of sequencing – Sequencing n jobs through 2 machines and 3 machines, 2 jobs through m machines. PERT and CPM –Critical path calculation – Probability and cost consideration. UNIT II REPLACEMENT AND GAME THEORY 9 Replacement Models – Replacement of items that deteriorate with time – Equipment that fails suddenly. Two person zero sum games – Pure strategies and saddle point – Mixed strategies – 2 x n and m x 2 games – Method of dominance – Numerical and graphical solutions. UNIT III INVENTORY CONTROL 9 Inventory models – Deterministic models – Economic ordering quantity, Reorder level, optimum cost – Instantaneous and Non-instantaneous receipt of goods with or without shortages. UNIT IV LINEAR PROGRAMMING 9 Introduction to Linear Programming – Formulation of the problem – Graphical method – Simplex method – Artificial variable techniques - Primal-dual problems – Dual Simplex method. UNIT V ADVANCED LINEAR PROGRAMMING PROBLEMS 9 Integer programming problem - Cutting plane algorithm – Transportation models - Vogel’s Approximation method – MODI method – Unbalanced transportation problem – Degeneracy in transportation models – Assignment models – Traveling salesman problem-Dynamic Programming problem.
TUTORIAL 15 TOTAL 60 TEXT BOOK 1. Kanti Swarup, Gupta P.K., and Man Mohan, Operations Research, Sultan Chand &
Sons, 1994. (Unit I Chapter 10 Section 10.1 – 10.4, 10.6, Chapter 19 Section 19.1, 19.11, Unit – II Chapter 18 Section 18.1-18.3, Chapter 9 Section 9.1 – 9.9, Unit – III Chapter 17 Section 17.1, 17.2, 17.6, 17.7, 17.9, 17.10, 17.17, Unit – IV Chapter 2,3,4 Unit – V Chapter 4 Section 14.1-14.4 Chapter 6, 7, 11)
Techniques, A.R. Publications,2002 3. Taha H.A., Operations Research – An introduction, 7th edition, PHI, 2002. 4. Sharma S.D., Operations Research, Kedarnath Ramnath & Co., Meerut,1994. 5. Billy B. Gillet, Introduction to Operations Research – TMH Publishing Co. 6. Gupta P.K., and Manmohan, Operations Research and Quantitative Analysis – S.Chand &
Co., New Delhi.
59
7. Hamblin S., and Stevens Jr., Operations Research, Mc Graw Hill Co.
CS302 DATABASE MANAGEMENT SYSTEMS L T P C (for candidates admitted from 2003-04 and afterwards) 3 0 0 3
PURPOSE To study the concepts of Relational Database their design and Advanced Database technologies INSTRUCTIONAL OBJECTIVES
• To learn about ER diagrams, their representation in RDBMS • To learn the various storage structures for Database • To study Query processing and Transaction processing • To learn about Object Oriented databases and persistence in Database
UNIT I INTRODUCTION 8 Introduction to databases -Data Abstraction - Data Models - Instances and schemes Data independence- system structure- Entity relationship model - Entities and relations -E-R diagram. Design of E-R and E-E-R database schema. UNIT II FILES AND STORAGE 9 Primary file organizations and storage structures-indexing and hashing-Indexes for files - Single level ordered indexes - Multilevel indexes - Dynamic multilevel indexes using B- trees and B+ trees. UNIT III RELATIONAL MODEL AND DESIGN 11 Relational model - Key and Referential integrity constraints - Relational algebra - Selection Projection - Join and other operators - Query expression in relational algebra - Mapping ER-model description to relational-model description. SQL language - Data definition - Query formulation - Update operations - View specification in SQL - Embedded SQL. Relational Database Design- Normal forms- Normalisation using functional dependencies - multivalued dependencies and Join dependencies - Domain Key Normal Form. UNIT IV QUERY & TRANSACTION PROCESSING 9 Query processing - Query interpretation. Equivalence of expressions - join strategies for parallel processing. Query optimisation. Crash recovery - failure classification - recovery mechanisms - shadow paging - stable storage mechanisms. .Concurrency Control - Schedules - serializability - Lock based protocols - Time stamp based protocols. Transaction processing - storage model. - recovery from transaction failure. Deadlock handling. UNIT V ADVANCES IN DATABASES 8 Introduction to advanced databases-homogeneous and heterogeneous databases- temporal databases-spatial databases-data mining and warehousing- deductive databases-semistructured and web databases-mobile databases. OODBMS – introduction to object orientation- persistence of objects- object relational databases.
Total 45
60
TEXT BOOKS 1. A. Silberschatz, H. Korth and S. Sudarshan, “Database System Concepts”, 4rth Edition,
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3 PURPOSE This course provides a way to study the Artificial Neural Networks and its applications INSTRUCTIONAL OBJECTIVES
• To learn the basics of ANN in comparison with Human brain • To learn the various architectures of building an ANN and its applications • Advanced methods of representing information in ANN like self organizing
networks and competitive learning UNIT I INTRODUCTION 9 Artificial Neural Networks - Architectures, Definition and Fundamental Concepts - A Brief Overview - Engineering Approaches to Neural Computing - The Mappings View point - The Structure Viewpoint - Learning Approaches - Mathematical Foundations for ANN Study : Vector and Matrix Fundamentals - Geometry for State - Space Visualization- Optimization. UNIT II PERCEPTRONS 9 Elementary ANN Building Blocks : Biological Neural Units - Artificial Unit Structures - Unit Net Activation to Output Characteristics - Artificial Unit Model Extensions - Single Unit Mappings and Perceptron : Introduction - Linear Separability - Techniques to Directly Obtain Linear Unit Parameters - Perceptrons and Adaline / Madaline Units and Networks - Multilayer Perceptrons - Gradient Descent Training using Sigmoidal Activation Functions.
62
UNIT III PATTERN ASSOCIATORS & FEEDFORWARD NETWORKS 9 Introduction to Neural Mappings and Pattern Associator Applications : Neural Network based pattern associators - The Influence of Psychology on PA Design and Evaluation Linear Associative Mappings - Training and Examples - Hebbian or Correction based learning - Feed Forward Networks and Training : Multilayer Feedforward Network Structure - The Delta Rule - Architecture – Hidden Layer--Mapping Capability . UNIT IV EXTENSIONS AND ADVANCED TOPICS 9 Feedforward Pattern Associator Design - Weight Space - Error Surfaces and Search - Generalization - Output Error Norms - Higher Order Derivative Based Training - Stochastic Optimization for Weight Determination - Network Architecture Determination Problem - Genetic Algorithms for Network Training – Network Cascade Correlation - Minimization – Inversion. UNIT V COMPETITIVE AND SELF-ORGANISING NETWORKS 9 Introduction - Formal Characterization and General Clustering Procedures - Competitive Learning Architectures and Algorithms - Self - Organising Feature Maps - Adaptive Resonance Architectures - RBF Networks and Time Delay Networks - ANN Hardware and Implementation. Total 45 TEXT BOOK 1. Robert.J.Schalkoff , “Artificial Neural Networks” , McGraw Hill International Ed..1997 REFERENCE BOOKS 1. James .A.Freeman and David .M.Skapura , “Neural Networks Algorithms, Applications
and programming Techniques” , Pearson Education, 2002. 2. Simon Haykin ,"Neural Networks - A Comprehensive Foundation" , Pearson Education
Asia. 2002. 3. B.Yegnanarayana ,"Artificial Neural Networks", Prentice -Hal of India, 2001.
CS308 DISTRIBUTED COMPUTING L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3 PURPOSE This course provides an in-depth knowledge on Distributed systems and their applications in real time systems
INSTRUCTIONAL OBJECTIVES
• Design issues in Distributed systems • RPC model, synchronization • Distributed File systems and Databases
UNIT I INTRODUCTION 9
Introduction to distributed computing system-Hardware concepts- switched multiprocessor – Bus based multicomputers – switched multicomputers –software concepts – Network operating systems –Time distributed systems. Design Issues: Transparency – Flexibility – Reliability – Performance and scalability.
63
UNIT II RPC 9 RPC - Communications in distributed systems – The client /server model – Implementation-RPC model – Implementing RPC mechanism – communication protocols for RPCs-exception handling –special types of RPC- Stub generation- Client –Server binding –exception handling – RPC in heterogeneous environments. UNIT III SYNCHRONIZATION AND DISTRIBUTED SHARED MEMORY 10 General architecture of Distributed shared memory – Design and implementation issues of DSM – Granularity – Thrashing- structure of shared memory space – Advantages of DSM- synchronization in distributed systems – Clock synchronization – mutual exclusion – election algorithms – Atomic transactions – Deadlock distributed system- Threads – Thread usage and implementation of thread packages – processor allocation. UNIT IV DISTRIBUTED FILE SYSTEM 8 File service interface – semantics of file sharing – Distributed file system – Implementation of new trends in distributed file system . UNIT V DISTRIBUTED DATABASES 9 Distributed DBMS architecture – sorting data in a distributed DBMS – Distributed catalog management – distributed query processing – updating distributed data –distributed transaction management – distributed concurrency control – Recovery
Total 45 TEXT BOOKS 1. Andrew S. Tannenbaum – “Modern operating systems “– Prentice Hall .1995 2. Raghu Ramakrishnan – “Data base management systems”- McGraw Hill –1998(unit V) REFERENCE BOOKS 1. G.R.Andrews, “Distributed systems”.2000 2. Pradeep K. Sinha, “Distributed operating system “– PHI 3. Sape Mullender , “Distributed systems “, Addison –Wesley ,1993 4. Mukesh Singal and Shivaratu N.G., “Advanced Concepts in Operating Systems”, McGraw Hill, Newyork 1994. 5. George Coulouris , Jean Dollimore, Tim Kindberg , “ Distributed Systems , Concepts and Design” , 2nd edition , Pearson Education, 2000
ELECTIVE – I L T P C
3 0 0 3 Elective to be chosen from the list of subject codes given below CS352 , CS354 , CS356 , CS358 , CS360 and CS362
64
CS314 RDBMS LAB L T P C
(for candidates admitted from 2003-04 and afterwards) 0 0 3 2 PURPOSE This laboratory course gives a complete understanding of the front-end and back-end tools of the GUI environment INSTRUCTIONAL OBJECTIVES
• Learning the Structured Query Language and PL/SQL • Learning the Front-end tools and their operations • Learning to create projects and applications
LIST OF EXPERIMENTS 1. Program to learn DDL commands. 2. Program to learn DML commands 3. Program to learn PL/ SQL. 4. Writing Triggers and Assertions 5. Creating Forms and using controls and menus 6. Creating MDI , event procedures, reports 7. Personnel Information System 8. Payroll processing 9. Library information system 10. Computerized quiz. 11. Student marks Processing. 12. Banking system
Total 45
REFERENCE :Laboratory Manual
CS316 GRAPHICS LAB L T P C
(for candidates admitted from 2003-04 and afterwards) 0 0 3 2
PURPOSE This laboratory course will enable them to apply the graphical algorithms
INSTRUCTIONAL OBJECTIVES
• 2D and 3D transformations • Projections , clipping and windowing • Line , circle , filling algorithms implementation
List of Experiments 1. 2-D Translation of Lines, Rectangles, Rotation 2. 2-D Shear, Scaling, Reflection about Arbitrary Axis
65
3. 3-D Shape representation as lines and points 4. 3-D Translation, Shear, Rotation 5. 3-D Rotation, Reflection about Arbitrary Axis 6. Parallel & Perspective Projection 7. Line Algorithms 8. Ellipse, Circle Algorithms 9. Curve Algorithms 10. Filling Algorithms 11. Clipping and Windowing 12. 3-D Viewing of 3-D Surfaces & Curves Reference : Laboratory Manual Total 45
66
GE302 Personality Development – II L T P C
1 0 0 1 Purpose
To train the students to better in their overall competence
Objectives
The students will be able to improve the skills and learn new practices, emulate good
manners and get good placement.
Unit – I Skills for Better Personality – Managing Oneself (5hrs)
Tine Management, Negotiation Skills, Communication Skills (Public Speaking, Presentation
Skills and Writing Skills.), G.P. and Personal Interviews.
Unit – II Skills for Better Personality – Managing Interpersonal Relations (5hrs)
Conflict Management, Problem Solving Skills, Building and Managing Teams, Non – verbal
Communication Skills.
Unit – III Other Dimensions to Personality Development (5hrs)
Mind Reading, Philanthropy, Emulating Role – models. Self – actualization, Information
Technology and its Impact on Personality.
Total 15 hrs
Text Books:
1. Personality Development, S.P.Sharma
2. Practical Ways To A Powerful Personality, Gearge Weinberg, 1999
3. How To Win Friends And Influence People, Dale Carnegie., 2001
4. Public Speaking, Dale Carnegie., 2000
67
SEMESTER – VII
MB401 INDUSTRIAL MANAGEMENT AND ECONOMICS L T P C (for candidates admitted from 2003-04 and afterwards) 3 0 0 3
PURPOSE To expose the students on Economics and management aspects. INSTRUCTIONAL OBJECTIVES To apply theoretical economic concepts to practical business situation and to take decision in the Industrial Engineering Situation. UNIT I INTRODUCTION 9 Introduction to management :-Nature and scope of management –Functions-Planning-Organizing –Staffing –Leading-controlling. UNIT II PRODUCTION AND MANAGEMENT 9 Production & Management –Plant location –Factors Influencing location-Process-Methods-Procedures-Production routing, scheduling, Production Costs, Inventory and Controlling Techniques. UNIT III MANAGERIAL ECONOMICS 9 Managerial economics for Industry-Demand-Types-Supply-Factors-Determining Demand-Elesticity of Demand-Forecasting Methods-Utility-Theories of Utility - Pricing-Methods of Pricing. UNIT IV ENGINEERING ETHICS 9 Engineering Ethics-Social experimentation-Responsibility for safety-Collective bargaining-Global issues-Environmental Ethics-Sample Code & Conducts. UNIT V ACCOUNTING AND FINANCE 9 Accounting for Management –Concepts, Conventions-Introduction to financial statements-tools and techniques of Financial Statements-Budget and Budgetary control-Cost Concepts-Financial information System. Total 45 TEXT BOOKS
1. Koontz,” Essential of Management “,McGraw Hill Publishing Company, International edition.
2. Dr.S.N.Maheshwari,” Financial And Management Accounting”, sultan chand & sons, New delhi.,1998.
3. Mike Martin , Roland Schinzinger,”Ethics in Engineering “, Mac Graw Hill New York ,1996.
REFERENCE BOOKS
1. M.senthil,”Production Management “, A.R.S publishers, sivakasi. 2. Vaishney ,Sundaram,” Managerial economics”, sultan Chand, New Delhi.
68
CS403 WEB TECHNOLOGY L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3 PURPOSE Uses of web sites and portals have become common for knowledge sharing and business. The course focuses on the fundamentals of CGI, Networking, Web Applications
INSTRUCTIONAL OBJECTIVES This course introduces the students to • Basic web concept and Internet protocols. • CGI Concepts & CGI Programming • Networking principles & RMI • Study of DHTML, XML • Study of On-Line web application & Internet Concepts UNIT I INTRODUCTION 9
Internet Principles – Basic Web Concepts – Client/Server model – retrieving data from Internet – HTML and Scripting Languages – Standard Generalized Mark –up languages – Next Generation – Internet –Protocols and Applications. UNIT II COMMON GATEWAY INTERFACE PROGRAMMING 9 HTML forms – CGI Concepts – HTML tags Emulation – Server – Browser Communication – E-mail generation – CGI client Side applets – CGI server applets – authorization and security . UNIT III SOCKET PROGRAMMING 9
Dynamic Web content – cascading style sheets – DHTML – XML – Server side includes – communication – Active and Java Server Pages – Firewalls – Proxy Servers. UNIT V ON-LINE APPLICATIONS 9 Simple applications – on-line databases – monitoring user events – plug-ins –database connectivity – Internet Information Systems – EDI application in business – Internet Commerce – Customization of Internet Commerce.
TOTAL 45 TEXT BOOKS 1. Jason Hunter, William Crawford, “Java Servlet Programming”, O’ Reilly Publications,
1999. (Unit – III & IV) 2. Ravi Kalakota and Andrew B Whinston, “Frontiers of Electronic Commerce”, Addison
Wesley, 1996. (Unit – V) 3. Eric Ladd, Jim O’ Donnel, “Using HTML 4, XML and Java”, Prentice Hall of India –
QUE,1999. (Unit I , II & IV)
69
REFERENCE BOOKS 1. Jeffy Dwight, Michael Erwin and Robert Niles, “Using CGI”, Prentice Hall of India –
QUE, 1999. 2. Scot Johnson, Keith Ballinger, Davis Chapman, “Using Active server Pages”, Prentice
Hall of India, 1999.
CS405 MICRO PROCESSOR BASED SYSTEM DESIGN AND EMBEDDED SYSTEMS
L T P C
(for candidates admitted from 2003-04 and afterwards) 3 1 0 4 PURPOSE This course provides a foundation on design aspects of microprocessor based systems and the architecture of embedded systems
INSTRUCTIONAL OBJECTIVES
• Peripherals and its interfacing with processors • Troubleshooting and design problems • To understand the architecture of PIC microcontroller • To understand the architectures and applications of embedded microprocessor based
systems. UNIT I PERIPHERAL INTERFACING 9 Keyboard and Display interface to Microprocessor-Intel 8279 Keyboard/Display Controller Chip- introduction –interfacing to microprocessor-Interfacing to Keyboard Display Hardware-Software Interface-DMA Controllers-Printer Interface-8295 Printer Controller Chip -8295 Parallel Interface-8295 Serial mode-Floppy Disk Interface-Coprocessors. UNIT II MICROPROCESSOR BASED SYSTEMS AND TROUBLE SHOOTING
9 Microprocessor Development systems-Hardware tools-Logic probe-Logic analyzer-Software tools-emulators-UV eraser-assemblers-cross assemblers-debugger-Procedural checks for locating faults. UNIT III REVIEW OF EMBEDDED HARD WARE 9 Gates – Timing Diagram – Memory – Microprocessor – Buses – Direct Memory Access – Interrupts – Built ins on the Microprocessor – Convention Used on Schematic – Schematic – Interrupts Microprocessor Architecture – Interrupt Basics – Shared Data Problem – Interrupt Latency. UNIT IV MICROCHIP PIC MICRO CONTROLLER 9 Introduction – CPU Architecture – Registers – Instruction Sets – Addressing Modes – Loop Timing – Timers – Interrupts Timing – I/O Exception – I2 C Bus Operation – Serial EEPROM – Analog to Digital Converter – UART – Baud Rate – Data Handling – Initialization – Special features – Serial Programming – Parallel Slave Port . UNIT V EMBEDDED MICROCOMPUTER SYSTEM 9 Motorola MC68H11 Family Architecture – Registers – Addressing Modes Programs – Interfacing Methods – Parallel I/O Interface – Parallel Port Interface – Memory Interfacing –
70
High Speed I/O Interfacing - Interrupts– Interrupt Service Routine – Features of Interrupts – Interrupt Vector – Priority – Timing Generation & Measurement – Input capture – Output Compare – Frequency measurement – Serial I/O Devices – RS 232, RS485 – Analog Interfacing – Applications – Design problems
Tutorial 15 Total 60
TEXT BOOKS 1. Mohamed Refiquazzaman,”Microprocessors and Microcomputer based system design “,
Universal Books,New Delhi,Reprint 2002. (Unit I & II) 2. David E. Simon , “A Software Primer”,Pearson Education Asia ,2001. (Unit III,IV & V) REFERENCE BOOKS 1. Govindarajulu,”The IBM PC and its clones,hardware-Trouble shooting &
Maintenance”,Tata Mc Graw Hill-Fourteenth reprint 1998. 2. Douglas,V.Hall, “Microprocessor and Interfacing,Programming and Hardware” Mc Graw
Hill Edition, 1986. 3. David E. Simon , “A Software Primer”,Pearson Education Asia ,2001. 4. John B Peatman , “Design with PIC Microcontroller”,Pearson Education Asia, 1998. 5. Heath Steve, “Embedded System Design”, Newnes ,1997.
CS407 SOFTWARE QUALITY THEORY & MANAGEMENT L T P C
3 0 0 3
PURPOSE This course introducing the concept of software quality, and its improvement. INSTRUCTIONAL OBJECTIVES • Principles of software quality and concepts • Quality assurance models • Future trend in quality assurance models. UNIT-I SOFTWARE QUALITY 9 Introduction-Views of Quality-Hierarchical models of quality(Boehmn-Mccalls) UNIT-II MEASURING SOFTWARE QUALITY 9 Measuring quality-S/W metrics-Gill approach management and improvement of quality-Case tools for Quality –Quality standards. UNIT-III QUALITY MANAGEMENT SYSTEMS 9 Historical perspective –Deming, Crosby, Juran’s principles-Elements of a QMS-QMS for software control, Assurance, improvement.
UNIT-IV QUALITY MANAGEMENT STANDARDS 9 Purpose of standards-ISO 9000 series-CMM-TICKIT-SPICE-Models. UNIT-V FUTURE TRENDS 9 TSP & PSP-Clean room S/W Engg-Defect injection and prevention. Total 45
71
TEXT BOOK 1.Alan Gillies, “Software Quality -Theory and Management”, International Thompson Computer Press-1997 REFERENCE BOOKS 1. Watt.S.Humphery-Managing software process Addision Wesely 19998 2. Roger Pressman-Software Engineering MCGraw Hill 1997
ELECTIVE – II L T P C
3 0 0 3
ELECTIVE – III L T P C
3 0 0 3 Electives to be chosen from the list of subject codes given below CS451 , CS453 , CS455 , CS457 , CS459 ,CS461 , CS463 , CS465 , CS467 and CS469
CS413 WEB TECHNOLOGY LAB L T P C
(for candidates admitted from 2003-04 and afterwards) 0 0 3 2PURPOSE The purpose of this Lab is to Impart knowledge on various web technologies. INSTRUCTIONAL OBJECTIVES
1. Creating web pages. 2. Client side Scripting programs 3. Creating Dynamic web Pages. 4. Java servelets 5. Experiment s with Java server pages. 6. On line-Transactions—Data Base connectivity
LIST OF EXPERIMENTS
1. Create a web portal with properly aligned paragraphs, images and list of items in different styles.
2. Client side and server side image maps. 3. Use of style sheets in web pages. 4. Front end validations using Javascript . 5. Write a program in java to create servelets for displaying students mark list. Assume
that students information is available in the data base which has been stored in a server.
6. Run the program in java to create servlets for conducting online examination. 7. Storing the form fields in a data base through JSP.
Reference : Laboratory Manual Total: 45
72
CS415 INTERFACING AND EMBEDDED SYSTEMS LAB L T P C
(for candidates admitted from 2003-04 and afterwards) 0 0 3 2 PURPOSE This laboratory course will provide good knowledge of Programming for interfacing with peripherals and design using 8051 and PIC Micro Controllers .
INSTRUCTIONAL OBJECTIVES
• Interfacing with peripherals • Learn Programming using Microcontrollers • To learn testing using RTOS environment List of Experiments Cycle – I 1. Printer Interface. 2. Programmable Peripheral Interface. 3. Programmable Communication Interface. 4. Power On Self Test (POST). 5. Data Acquisition Systems. 6. Floppy Disk Drive,Hard Disk Drive Mechanism. 7. Interfacing A/D and D/A converters 8. Temperature Monitoring Cycle – II 1. Interfacing programs using 68HC11 * Job Scheduling * Priority Inheritance 2. Interfacing Programs using 8051 Micro Controllers * Seven Segment Display * LCD Interface * Buzzer and Alarm 3. Exposure in KEIL Tools Reference : Laboratory Manual Total 45
73
SEMESTER – VIII
CS402 MOBILE AND WIRELESS COMMUNICATION L T P C (Same as IT401) 3 0 0 3
(for candidates admitted from 2003-04 and afterwards) PURPOSE It provides a basic foundation of Wireless and Mobile networks and its applications INSTRUCTIONAL OBJECTIVES • Wireless transmission basics and Protocols • Wireless LAN and ATM • Mobile Application Architecture, Messaging and security UNIT 1 INTRODUCTION 9 Introduction – wireless transmission – radio propagation – signals and propagation – antennas – multiplexing and modulation – spectrum - operation of cellular systems, planning a cellular system, analog & digital cellular systems. UNIT II WIRELESS MEDIA 9 Wireless Media access control protocols – SDMA – FDMA – TDMA – CDMA – comparison. Telecommunication systems – GSM – DECT – TETRA – UMTS and IMT – 2000, satellite systems – GEO 139, LEO 139, MEO 140. Routing – localization – handover – broadcast systems – overview. Cyclic repetition of data – digital audio broadcasting – digital video broadcasting. UNIT III WIRELESS LAN AND ATM 9 Wireless LAN – IEEE 802.11 standards – HIPERLAN – Blue tooth technology and protocols. Wireless Local Loop technologies. Wireless ATM – motivation – working group – services – reference model – functions – radio access layer – handover – location management – addressing – mobile QoS issues , delays, error and packet loss, error control schemes – Access point control protocol. UNIT IV MOBILE APPLICATION ARCHITECTURE AND MESSAGING 9 Choosing the right architecture –Application Architecture—Smart Client—Messaging Types—Messaging Value Chain. UNIT V MOBILE AND WIRELESS SECURITY 9 Security Primer –Creating a Secure environment –Threads—Technologies—Other Security Measures—WAP Security—Smart Client Security—Overview of Smart Client Architecture—Mobile Operating Systems.
Total 45
TEXT BOOKS 1. Jochen Schiller, “Mobile Communications”, Addision Wesley ,2000. 2. Martyn Mallick , “Mobile and Wireless Design Essentials” , Wiley Dreamtech India Pvt. Ltd. , 2003, Chapter(4,5,6,7) REFERENCE BOOKS 1. Uyless Black, “Mobile and Wireless Networks”, Prentice Hall , 1996. 2. Willian C.Y.Lee, Mobile Communication Design Fundamentals, John Wiley, 1993.
74
ELECTIVE – IV L T P C
3 0 0 3
ELECTIVE – V L T P C
3 0 0 3 Electives to be chosen from the list of subject codes given below CS452 , CS454 , CS456 , CS458 , CS460 , CS462 , CS464 , CS466 , CS468 CS470 & CS472
CS414 PROJECT L T P C
0 0 16 8
CS416 COMPREHENSION L T P C 0 0 2 1
75
ELECTIVES FOR SIXTH SEMESTER
CS352 NATURAL LANGUAGE PROCESSING L T P C (for candidates admitted from 2003-04 and afterwards) 3 0 0 3
PURPOSE To learn the basics of artificial mechanisms or machinery to manipulate human language on an automatic basis or, more often, to be used as more natural and efficient interfaces between humans and computers INSTRUCTIONAL OBJECTIVES • The aim is to make clear the importance of natural language processing (NLP), both in
principle within Artificial Intelligence (AI) and as a practical application. • to study about the features of Indian languages • to familiarize with the syntax and semantics of the natural language • to build Indian language interface to standard packages • to learn about the various applications and tools in natural language UNIT I ISSUES & MOTIVATION 8 Issues; Motivation; Features of Indian Languages; Issues in Font; Coding Techniques; Sorting & Searching Issues. UNIT II MORPHOLOGY & PARTS OF SPEECH 10 Phonology; Words & Morphemes; Segmentation; Categorization and Lemmatization; Parts of Speech; Taggers; Rule Based; Hidden Markov Models; Morphology Issues of Indian Languages; Transliteration; UNIT III SYNTAX & SEMANTICS 10 Basic Concept of Syntax; Parsing Techniques; Lexicalized & Probabilistic Parsing; General Grammar Rules for Indian Languages; Semantics; Pragmatics; Fundamentals; Syntax & Semantics; Indian Language View Point; Statistical Techniques in Corpus Based Techniques. UNIT IV INTERFACE & TOOLS IN INDIAN LANGUAGES 7 Building Indian Language Interfaces to Standard Packages; Multilingual Issues; Specialized Tools for Indian Language Processing; GIST Cards; ISCII & Unicode Issues for Indian Languages; Speech Processing & Text to Speech Issues in Indian Languages. UNIT V APPLICATION 10 Online Education Tools in Indian Languages; Web Libraries; IT in Rural, Medical & E –Governance Application in Local Languages; Automatic Taggers; Natural Language Generation; Machine Translation; Information Extraction; Retrieval; Other Applications in Indian Languages. TOTAL 45 TEXT BOOKS 1. James Allen, “Natural Language Understanding”, Benjamin & CummingsPublishing
Co.,1995. 2. Ronald Hausser , “Foundations of Computational Linguistics”, Spring & Verleg, 1999. (Unit – II & IV)
76
REFERENCE BOOKS 1. Daniel Jurafskey & James H.Martin , “Speech & Language Processing”, Prentice Hall of
India ,2000. 2. Steve Young & Gerrit Bloothoof , “Corpus Based Methods in Language & Speech
Processing”, Kluwer Academic Publishers, 1997.
CS354 SYSTEM MODELING AND SIMULATION L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3 PURPOSE This course will give an introduction to simulation modeling techniques and queuing theory applications INSTRUCTIONAL OBJECTIVES
• Systems models , continuous system simulation • Queuing theory and probability concepts in simulation • Explains the simulation languages like GPSS and SIMSCRIPT
UNIT I SYSTEM MODELS 9 Concepts, continuous and Discrete systems, System Modeling, types of models,subsystems, corporate model, system study. System Simulation: Techniques, comparison of simulation and analytical methods, types of simulation, distributed log models, cobweb models. UNIT II CONTINUOUS SYSTEM SIMULATION 9 Numerical solution of differential equations, Analog computers, Hybrid computers,continuous system simulation languages CSMP, system dynamic growth models, logistic curves. UNIT III PROBABILITY CONCEPTS IN SIMULATION 9 Monte Carlo techniques, stochastic variables, probability functions, Random Number Generation algorithms. UNIT IV QUEUEING THEORY 9 Arrival Pattern distributions, servicing times, queuing disciplines , measure of queues, mathematical solutions to queuing problems. Discrete system simulation: Events, generation of arrival pattern, simulation programming tasks, analysis of simulation output. UNIT V GPSS & SIMSCRIPT 9 General description of GPSS and SIMSCRIPT, programming in GPSS. Simulation Programming Techniques: Data Structures, implementation of activities, events and queues, event scanning, simulation algorithms in GPSS and SIMSCRIPT.
Total 45 TEXT BOOKS 1. Geoffery Gordon, “ System Simulation” , PHI, 2nd edition
77
REFERENCE BOOK 1. Jerry Banks , John S.Carson ,Barry Nelson, David M.Nicol, “Discrete – Event System
Simulation”, PHI, 3rd edition 2. Karian. Z.A., Dvdewicz .E.Z, “Modern Statistical Systems and GPSS
Simulation”,Freeman, 1991
CS356 NETWORK SECURITY L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3 PURPOSE This course provides a way to understand the various security techniques in networks INSTRUCTIONAL OBJECTIVES
• Encryption techniques and key generation techniques • Authentication and security measures • Intrusion and filtering analysis
UNIT I SYSTEM AND NETWORK SECURITY 10 Resources – Intruders and Intrusion – Viruses and Worms – OS Security – Firewalls – Design Principles – Packet Filtering – Application gateways – Trusted systems – Counter Measures - E-mail security – pretty good privacy – S/MIME – IP security – overview and architecture – authentication header – encapsulating security payload – combing security associations – web security requirements SSL – TLS – secure electronic transactions – higher wall design principles – trusted systems. UNIT II CONVENTIONAL ENCRYPTION 10 Services – Attacks – Steganography – Classical Encryption Techniques – Substitution Ciphers – Ceaser – Mono alphabetic – Playfair – Hill – Poly Alphabetic – Transposition Ciphers – Cryptanalysis – SDES – DES – Differential and Linear Cryptanalysis – Modes of operation – Encryption Algorithms – IDEA – Blowfish – CAST128 – RC5 – Traffic Confidentiality UNIT III PUBLIC KEY ENCRYPTION 8 Uniqueness – Number Theory concepts – Primality – Modular Arithmetic – Fermet & Euler Theorem – Euclid Algorithm – Chinese Remaider Theorm – Discrete Logarithms – RSA – Security of RSA – Elliptic Curve Cryptography – Advantage over RSA – Diffie Hellman Key Exchange UNIT IV AUTHENTICATION 8 Digests – Requirements – MAC – Hash function – Security of Hash and MAC – Birthday Attack – MD5 – SHA – RIPEMD – Digital Signature Standard – Proof of DSS UNIT V SECURITY PRACTICE 9 Authentication applications – Kerberos – Kerberos Encryption Techniques – Email Security – PGP – Radix64 – IP Security Architecture – Payload – Key management – Web security requirements – SSL – TLS – SET
Total 45
78
TEXT BOOK 1. William Stallings , “Cryptography & Network Security” , Pearson Education, 2000 REFERENCE BOOKS 1. Bruce Schneider , “Applied Cryptography”, 2nd edition , John Willey & sons , 1996 2. Douglas R.Stinson, “Cryptography – Theory and Practice “ , CRC Press , 1995 3. Paul Campbel, Ben Calbert, Steven Boswell, “ Security + in depth “, Thomson Asia, 2004 4. Bruce Schneier , “Practical Cryptography” , Wiley Dreamtech, 2003 5. William Stallings, “SNMP, SNMPv2, SNMPv3 and RMON1 and 2”, Pearson education Asia, 3rd edition, 2001 6. Cormac Long, “IP network design”, Tata McGraw Hill, 2001
CS358 SOFT COMPUTING L T P C
(Same as IT467) 3 0 0 3 (for candidates admitted from 2003-04 and afterwards) PURPOSE This course provides a way to understand the concepts of Artificial Intelligence , ANN , Genetic Algorithms and Fuzzy systems and its applications INSTRUCTIONAL OBJECTIVES
• Basics of AI and ANN • Neuro fuzzy systems and its applications • Genetics algorithms and its applications
UNIT I BASICS OF NEUROSCIENCE AND ANN MODELS 9 The Brain as a Neural network-Basic Properties of Neurons - Neuron Models – Rosenblatt’s Prceptron – The widrow-Hoff LMS Learning Algorithm-Order of a Predicate and a Perceptron - Complexity of Learning using Feedforward Networks. UNIT II FUZZY SYSTEMS 9 Fuzzy Sets and Fuzzy Reasoning - Fuzzy Matrices - Fuzzy Functions – Decompositions - Fuzzy Automata and Languages - Fuzzy Control Method - Fuzzy Decision Making. UNIT III NEURO-FUZZY SYSTEMS 9 Introduction to Neuro - Fuzzy Systems -Fuzzy System Design Procedures – Fuzzy Sets and Logic Background - Fuzzy / ANN Design and Implementation UNIT IV GENETIC ALGORITHMS 9 Introduction - Robustness of Traditional Optimization and Search Techniques - The goals of optimization-Computer Implementation-Data Structures, Reproduction, Crossover and Mutation – Mapping Objective Functions to fitness form – Some Applications of Genetic Algorithms. UNIT V ARTIFICIAL INTELLIGENCE 9 AI technique-Level of the Model - Problems, Problem Spaces and Search - Issues in the Design of Search Programs - Heuristic Search Techniques - Knowledge Representations and Mappings Total 45
79
TEXT BOOKS 1. N. K. Bose and P. Liang , “Neural Network Fundamentals” 2. Timothy J. Ross , “Fuzzy Logic with Engineering Applications”, McGraw-Hill International Editions,1995 ( Unit II & III) REFERENCE BOOKS 1. Elaine Rich and Kelvin knight ,“Artificial Intelligence”,McGraw- Hill ,2000 2. David E. Goldberg, “Genetic Algorithms-In Search, optimization and Machine
Learning”, Pearson Education. 3. Robert J. Schalkoff, “Artificial Neural Networks”, McGraw-Hill International
Editions,1997. 4. Freeman J.A. & D.M. Skapura , “Neural Networks: Algorithms, Applications and
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3 PURPOSE This course gives a strong foundation to the Visual Programming concepts INSTRUCTIONAL OBJECTIVES
• Basics of Windows Programming • Visual Basic ,Visual C++ and Visual JAVA Programming • Java Applets and Networking concepts
UNIT I INTRODUCTION TO WINDOWS PROGRAMMING 8
Different paradigms of programming – Structured Programming- Object Oriented Programming-Functional Programming- Logic programming- Visual Programming- Concurrent Programming – Comparison – Event driven programming – Windows programming fundamentals – Applications.
UNIT- II VISUAL BASIC PROGRAMMING 10
Visual Basic Applications – Creating and using Controls – Menus and Dialogs – Managing projects – Programming fundamentals – Objects and instances – Debugging – Responding to mouse events – Using grid control – Creating graphics for application – Displaying and printing information – Interacting with the environment – File system controls - Processing files – Accessing databases with the data controls.
UNIT – III VISUAL C++ PROGRAMMING 9
Visual C++ components – Developing simple applications – Microsoft Foundation classes – Controls – Message handling - Document-view architecture – Dialog based applications – Mouse and keyboard events.
UNIT – V JAVA APPLETS AND NETWORKING 9 Visual J++ Applet wizard – Handling events – Multithreading – Animation techniques –
Animating images – Applets and HTML – Java beans – JavaScript – Combining scripts and Applets – Applets over web and networking.
Total 45 TEXT BOOKS 1. Charles Petzold, “Windows Programming”, Microsoft Press, 1995.(Unit – I) 2. Marion Cottingham “Visual Basic”, Peachpit Press, 1999. (Unit – II) 3. Kate Gregory ‘Using Visual C++”, Prentice Hall of India Pvt., Ltd., 1999. (Unit – III) 4. H.M.Deitel and P.J.Deitel, “Java how to program with an Introduction to Visual J++”, Prentice Hall, 1998. (Unit – IV & V)
REFERENCE BOOKS
1. C.H. Pappas, W.H. Murray, III “Visual C++: The Complete Reference”, Tata McGraw-Hill Publishing Company, 1999. 2. Stephen R.Davis, “Lean Java Now”, Microsoft Press, 1996. 3. Jamie Jaworski, “Java Unleashes”, SAMS Techmedia Publication, 1999. 4. Jason Blooberg. Jeff Kawski, and Paul Treffers, “Web Page Scripting Techniques”,Hayden books, 1996.
CS362 E- COMMERCE L T P C
(Same as IT300) 3 0 0 3(for candidates admitted from 2003-04 and afterwards)
PURPOSE This course Provides a better understanding of the concepts of Electronic Commerce INSTRUCTIONAL OBJECTIVES
• E-Commerce Framework, EDI • Security in E-Commerce • Intelligent Agents
UNIT I INTRODUCTION 9 History of E- Commerce – Overview of E- Commerce framework – E- Business models – Network infrastructure - Role of Internet – E- commerce and World wide Web. UNIT II E COMMERCE 9 Consumer oriented E- Commerce applications – Mercantile process models ; Electronic Payment Systems – Digital Token based EPS – Smart cards – Credit cards – Risks – designing EPS. UNIT III ORGANIZATIONAL COMMERCE AND EDI 9 Electronic Data Interchange – EDI applications in Business – EDI and e Commerce – EDI standardization and implementation – Internet based EDI.
81
UNIT IV SECURITY 9 Internet security standards – secure electronic payment protocols ; cryptography and authentication – security issues – encryption techniques; e commerce payment mechanisms –SET protocol – electronic check – electronic cash; E-commerce ethics, regulations and social responsibility.
UNIT V INTELLIGENT AGENTS 9 Definition and capabilities – limitation of agents – security – web based marketing – search engines and Directory registration – online advertisements – Portables and info mechanics – website design issues. Total 45 TEXT BOOKS
1. Ravi Kalakota and Andrew B Whinston, “ Frontiers of Electronic Commerce “, Pearson Education Asia, 1999.( Chapters 1,2,3,6-10,16)
2. Marilyn Greenstein and Todd M Feinman , ” Electronic commerce: Security, Risk Management and Control “ Tata McGraw-Hill , 2000.(Chapters 7,8,10-12) REFERENCE BOOKS 1. Judy Strauss and Raymond Frost , “ E Marketing “, PHI, 2002 2. Brenda Kienan , “ Managing e Commerce Business” , PHI,2001 3. Vivek Sharma and Rajiv Sharma , “ Developing e Commerce Sites – an integrated approach “ , pearson Education Asia, 2000
82
ELECTIVES FOR SEVENTH SEMESTER
CS451 SPEECH TECHNOLOGY L T P C (for candidates admitted from 2003-04 and afterwards) 3 0 0 3
PURPOSE To learn the speech processing and recognition techniques INSTRUCTIONAL OBJECTIVES
• Study of speech signals,, properties • Digital processing of speech signals • Linear predictive Coding and Speech recognition
UNIT – I FUNDAMENTALS OF SPEECH PROCESSING 8 Introduction to Speech processing - applications - Fundamentals of speech processing - Analysis tools - z – Fourier - DFT transforms - FIR - IIR filters - sampling. UNIT – II SPEECH MODELS 9 Digital models - Vocal tract analog and digital models - Time Domain models - Useful Performance measures - zero-crossings - voiced – unvoiced - pitch periods - correlation Functions - smoothing. UNIT – III DIGITAL REPRESENTATION AND ANALYSIS 10 Digital representations of speech waveform - Encoding of speech using delta modulation - PCM - differential PCM - other systems- Short-time Fourier analysis- Short term analysis Effects - filter banks - pitch detection - vocoders. UNIT- IV HOMOMORPHIC SPEECH PROCESSING AND 9 LINEAR PREDICTIVE CODING Homomorphic speech processing- Cepstrum - pitch detection - formant estimation – vocoders - Linear predictive coding of speech - LPC methods and parameters - relations between speech parameters. UNIT – V DIGITAL SPEECH PROCESSING AND RECOGNITION 9 Digital speech processing for man-machine communication by voice- Speech and speaker recognition- voice response systems. Total 45 TEXTBOOK 1. L.R. Rabiner & R.W. Schafer, “Digital Processing of Speech Signals”, Prentice-Hall,1978. REFERENCE BOOKS 1. T.P. Barnwell, et al, “Speech Coding”, Georgia Tech, 1996. 2. L. Rabiner & B.H. Juang, “Fundamentals of Speech Recognition”, Prentice-Hall, 1993.
83
CS453 ROBOTICS L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3 PURPOSE This course provides a way to understand the concepts of Robotics INSTRUCTIONAL OBJECTIVES
• Position Analysis, Motion and Velocities • Actuators and Sensors • Image processing and vision systems
UNIT—I INTRODUCTION 8 Introduction—Define of a Robot-Classification of Robots-History of Robotics-Advantages and Disadvantages of Robotics-Robot Comparent Robot Joints and Coordinates-Robot Degrees of Freedom-Robot Reference Frames-Programming Modes-Robot Characteristics, Work Space, Languages and applications-Robots And Applications . UNIT—II POSITION ANALYSIS 9 Introduction-Robotics as Mechanism-Matrix representation-Representation of Transformation Matrices- Forward and Inverse kinematics of Robots-Representation of Forward Kinematics Equation of Robots- The Inverse Kinematics solution of Robots-Inverse kinematics Programming of Robots-Degeneracy and Detensity-The Fundamental problem with the Denamit –Hartenberg Representation. UNIT—III DIFFERENTIAL MOTIONS & VELOCITIES 10 Introduction-Differential Relationships-Jacobean-Differential Motion of a Frame-Interpretation of the Differential Change –Differential Changes between Frames-Differential Motions of a Robot and its Hand Frame-Calculation of the Jacobean-Relation between the Jacobean and the Differential Operator-Inverse Jacobean-Introduction to Dynamic analysis and Forces –Dynamic equation for Multiple-Degree-of-Freedom Robots-Static Force Analysis of Robots-Transformation of Forces and Moments Between Coordinate Framer. UNIT—IV ACTUATORS & SENSORS 9 Introduction- Path vs Trajectory-Joint-Space us Cartesian-Space Descriptions-Basics of Trajectory Planning-Joint-Space Trajectory Planning-Cartesian-Space Trajectives-Confinuens Trajectory Recording –Introduction to Actuators –Characteristics of Actual systems-Hydranlic Devices. Pneumatic devices-Electric motors- Microprocessor Central of Electric Motors-maganetostrictive Actuators-Shape-Memory Type Metals-Speed reduction-Introction to Sensor-Sensor Characteristics-Position sensors-Velosity Sensors-Acceleration Sensors-Force and Pressure Sensors-Torque Sensor-Micro switches Light and Infrared Sensors-Touch and tactile Sensors-Proximity Sensors-Rang-Finders-Sniff Sensors-Vision Systems-Voice Recognition Devices-Voice Synthesizers – remote Center Compliance Device(RCC). UNIT—V IMAGE PROCESSING AND ANALYSIS WITH VISION SYSTEMS
9 Introduction- Image Processing us Image Analysis- 2 and 3 dimensional Image types-Definition of Image-Acquisition of Images- Digital Images-Frequency Domain us Spatial Domain-Frequency Content of an Image; Noise, Edges-Spatial Domain operations-Sampling
84
& Organization-Sampling theorem-Image-processing Techniques-Histogram of Images-Thresholding- Connetivity-Noise Reduction-Edge Detection-Hough Transform-segmentation-Binary Morphology operations-Gray Morphology operations-Image analysis-Object recognition by Features-Depth Measurement with Vision Systems-Specialized lighting-Image Data Compression-Real-Time Image Processing-Heuristics-Application Of Vision Systems. Total 45 TEXT BOOK 1. Saeed B.Niku, “ Introduction to Robotic Analysis, Systems. REFERENCE BOOKS
1. Robin R. Murphy , “Introduction to AI Robotics”, PHI,2004. 2. Mikell P.Groover, Mitchell Weiss, Roger N. Nagel, Nicholas.G.Odrey, “ Industrial Robotics technology, Programming and Applications”, McGraw Hill Book Company. 3. Fu K.S., R.C and Lee C.S.G., “Robotics-Control, Sensing, Vision and Applications”,
McGraw Hill international Editions, 1987. 4. Bernard Hodage and Paul Hallam, “Industrial Robotics”, British Library Cataloging ,
1990.
CS455 FAULT TOLERANT COMPUTING L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3 PURPOSE This course gives a detailed design of fault tolerant systems and self checking systems INSTRUCTIONAL OBJECTIVES
• Basics of failures and faults • Fault tolerant design and Fail safe design • Designing testable combinational logic circuits
UNIT I BASIC CONCEPTS 9 Failure and Faults, reliability and failure rate, relation between eligibility and Mean-time– Between failures, maintainability and availability, reliability of series and parallel systems, Modeling of faults, stuck at, Bridging (short-circuit), stuck open, transient and intermittent faults. Test Generation: Fault diagnosis of digital systems, Test generation for combinational logic circuits – conventional methods, Random testing, transition count testing and signature analysis. UNIT II FAULT TOLERANT DESIGN 9 Basic concepts – static, dynamic, Hybrid, and self-purging redundancy, shift-over Modular Redundancy (SMR). Triple Modular redundancy, SMR. Reconfiguration, use of error correcting codes. Time redundancy, software redundancy, fail soft-operation, examples of practical fault tolerant systems, Introduction to fault Tolerant Design of VLSI Chips. UNIT III SELF CHECKING CIRCUITS & FAIL SAFE DESIGN 9 Design of Totally self-checking checkers, checkers using m-out of –n codes, Berger codes and low cost residue code. Self-checking sequential Machines, partially self checking
85
circuits. Fail Safe Design: Strongly fault secure circuits, failsafe Design of sequential circuits using partition theory and Berger codes, totally self-checking PLA design. UNIT IV DESIGN FOR TESTABLE COMBINATION LOGIC CIRCUITS 9 Basic concepts of test ability, controllability and observability. The read-muller expansion technique, three level OR-AND-OR design, use of control logic and syndrome-testable design. UNIT V DESIGN OF TESTABLE SEQUENTIAL CIRCUITS 9 The scan-path technique – level sensitive scan design (LSSD) and Random Access scan technique, built-in-test, built-in-test of VLSI chips, design for autonomous self-Test, Designing Testability into logic Boards.
Total 45 TEXT BOOK 1. Parag K. Lala, “Fault Tolerant and Fault Testable, Hardware design” PHI 1985. REFERENCE BOOKS 1. LALA, “ Digital systems design using PLD’s “,PHI 1990. 2. N. N. Biswas, “Logic Design theory”, PHI 1990. 3. Shem , toy Levei , Ashok K.Agarwala , “Fault Tolerant System design”, Tata McGraw
Hill, 1994 4. Pradhan K.K., “Fault Tolerant Computing – Theory and Techniques”, Vol – I and II , PHI
1986
CS457 IMAGE PROCESSING L T P C
(Same as IT451) 3 0 0 3 (for candidates admitted from 2003-04 and afterwards) PURPOSE This course provides a fundamental knowledge of Digital Image Processing Techniques INSTRUCTIONAL OBJECTIVES
• Digital Image fundamentals, Image Transform • Image enhancement and restoration techniques • Image segmentation and Compression
UNIT - I DIGITAL IMAGE FUNDAMENTALS 9 Digital image – applications of digital image processing – elements of digital image processing systems – vidicon camera – line scan CCD sensor – area sensor – flash A/D converter – display – elements of visual perception – structure of the human eye – luminance – brightness – contrast – mach band effect – image fidelity criteria – colour models – RGB, CMY, HIS mathematical preliminaries of 2D systems – convolution – Fourier transform – ZS transform – toeplitz and circulant matrices – orthogonal and unitary matrices.
UNIT - II IMAGE TRANSFORM 9 Properties of unitary transform – 2D DFT- DCT- DST- Discrete wavelet transform – Discrete Hadamard – Walsh – Hotelling transform – SVD transform – Slant, Haar transforms.
86
UNIT- III IMAGE ENHANCEMENT AND RESTORATION 9 Contrast stretching – intensity level slicing – Histogram equalization – spatial averaging – directional smoothing – Median filtering – non linear filters – maximum, minimum, geometric mean, Harmonic mean contra-harmonic mean, Lp mean filters – edge detection – Roberts, Sobel, Isotropic, Kinsch, Campass gradient, Laplacian operators- Degradation model – unconstrained and constrained restoration – inverse filtering – removal of blur caused by uniform linear motion – Wiener filtering – geometric transformations for image restoration. UNIT- IV IMAGE COMPRESSION 9 Huffman coding – truncated Huffman coding – B2, binary codes, arithmetic coding – bit plane coding – contrast area coding – Run length encoding – transform coding JPEG and MPEG coding schemes.
UNIT - V IMAGE SEGMENTATION 9 Pixel based approach – feature threshold – choice of feature - optimum threshold - threshold selection methods – region based approach – region growing – region splitting –region merging, split and merge. Total 45 TEXT BOOKS 1. Gonzalez,R.C and Woods,R.E, “Digital Image Processing “,Addition – Wesley, 2000.
REFERENCE BOOKS
1. Anil.K.Jain “Fundamentals of digital image processing”, PHI, 1997. 2. Umbaugh,S.E , “Computer vision and image processing”, Prentice Hall International,
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3 PURPOSE .NET framework provides an environment for building, deploying and running web services and other applications. It is language neutral. C# is a language introduced with .NET framework. The purpose of this course is to introduce the concepts of this third generation component model and the first component based language.
INSTRUCTIONAL OBJECTIVES: • .NET framework and its runtime environment • Major aspects of C# language • Object oriented features such as classes, inheritacne, interfaces and polymorphism
88
• New features that are unique to c# such as properties, indexers, delegates, events and namespaces
UNIT I BASICS OF .NET AND C# 7
Understanding .NET framework – understanding the .NET runtime environment – Introduction to C# - Examining basic C# components – writing and compiling a simple C# program. UNIT II C# & OOP 10
C# data types – variables – operators – statements – Input/output – control flow – methods – debugging and error handling – namespaces – array – structs – OOP concepts – classes – abstract data type – constructors – destructors - conversions – inheritance – operator overloading. UNIT III INTERFACE AND INHERITANCE 9
Interfaces – Indexes – Delegates – Events – Variable argument Lists – Collection – Reflection – Events – Variable argument lists – collection – reflection – dynamic creation and invocation – Preprocessor. UNIT IV I/O & WINDOWS PROGRAMMING 9
File and Folder operations – Dates and Times – browsing the Internet – Windows Form Controls – Advanced windows – Form features using dialogs. UNIT V WEB & DATABASE 10
Developing Windows Applications – Accessing data with ADO.NET, .NET assemblies, Web programming basics – Web services – Case Study. Total 45 TEXT BOOKS
1. Stanley B.Lippman , “C# Primer : A practical approach”, Pearson Education,1991. 2. David.S.Platt, Introducing Microsoft .NET , Microsoft Press, 3rd, Edition, 2003. (Unit I)
REFERENCE BOOKS 1. Eric Gunnerson , “A Programmers Introduction to C# “,A Press, 2000. 2. Ben Albahari, Pter Drayton, Brad Merrill, “C# Essentials”, Oreilly & Associates, 2001. 3. E.Balagurusamy, Programming in C # Tata McGraw Hill, 2002. 4. Conard.J., et.al., Introducting .Net, wrox Press, 2000.
CS463 UNIX INTERNALS L T P C
(Same as IT469) 3 0 0 3(for candidates admitted from 2003-04 and afterwards)
PURPOSE This course enables us to understand the internal concepts UNIX Operating system INSTRUCTIONAL OBJECTIVES
• Basics of UNIX Operating system • Buffers, scheduling, segmentation and paging • Drivers and IPC
89
UNIT- I INTRODUCTION 9 UNIX Operating System – History – Commands – System Structure – Shell, Shell Programming – System / Calls – Unix Communications - Architecture – Kernel Data structures – File sub-system and Process – sub-system – User-Kernel modes – Process States and Transitions – Sleep and Wakeup. UNIT - II BUFFERS AND REPRESENTATIONS 9 Buffers – Structure and representator – Implementation of Systems Calls. UNIT - III SCHEDULING AND THREADS 9 Structure – Context – Address Space – Creation – Termination – Scheduling – Threads implementation of System Calls. UNIT - IV SEGMENTATION AND PAGING 9 Swapping – Segmentation – Demand Paging – Implementation of System calls. UNIT - V DRIVERS AND IPC 9 Drivers – Streams – Implementation of IPC mechanisms. Total 45 TEXTBOOK 1. Bach M.J. “The Design of the Unix Operating System”, Prentice Hall Of India, 1986. REFERENCE BOOKS 1. Goodheart B. Cox J, “The Magic Garden Explained”, Prentice Hall of India, 1994.
2. Leffler S.J., Mckusick M.K., Karels M.J. and Quarterman J.S., “The Design And Implementation of the 4.3 BSD Unix Operating System”, Addison Wesley, 1998. 3. Behrouz A.Forouzan , Richard Gilberg, “ Unix & Shell programming “, Thomson Asia, 2003
CS465 PATTERN CLASSIFICATION & RECOGNITION L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3 PURPOSE This course provide a way to learn the various pattern recognition techniques and their applications INSTRUCTIONAL OBJECTIVES
• Pattern features and Statistical techniques • Cluster analysis and synthetic pattern recognition • Feature extraction techniques and advances in the field
UNIT I INTRODUCTION 7 Pattern and features – Training and learning in pattern recognition systems – Pattern recognition approaches – Statistical pattern recognition – Syntactic pattern recognition – Neural pattern recognition – Reasoning driven pattern recognition – Discriminant functions – Linear and Fisher’s discriminant functions.
90
UNIT II STATISTICAL PATTERN RECOGNITION 10 Gaussian model – Supervised learning – Parametric estimation – Maximum likelihood estimation – Bayesian parameter estimation – Perceptron algorithm – LMSE algorithm – Problems with Bayes approach – Pattern classification by distance functions – Maximum distance pattern classifier. UNIT III CLUSTER ANALYSIS 8 Unsupervised learning – Clustering for unsupervised learning and classification – C-means algorithm – Hierarchical clustering procedures – Graph theoretic approach to pattern clustering – Validity of clustering solutions. UNIT IV SYNTACTIC PATTERN RECOGNITION 8 Elements of formal grammar – String generation as pattern description – Recognition of syntactic description – Parsing – Stochastic grammar and applications – Graph based structural representation. UNIT V FEATURES EXTRACTION AND RECENT ADVANCES 12 Entropy minimization – Karhunen –Loeve transformation – Neural network structures for pattern recognition – Unsupervised learning – Self organizing networks – Fuzzy pattern classifiers – Genetic algorithms – Application to pattern recognition.
Total 45 TEXT BOOK 1. Earl Gose, Richard Johnsonbaugh, Steve Jost, “Pattern Recognition and Image
Analysis”, Prentice Hall of India Private Ltd., New Delhi – 110 001, 1999. REFERENCE BOOK 1. Duda R.O. and Hart P.E., “Pattern Classification and Scene Analysis”, Wiley, New York, 1973 2. Morton Nadler and Eric Smith P., “Pattern Recognition Engineering”, John Wiley and Sons, New York, 1993. 3. Touand , Gonzalez R. “Patten Recognition Principles” Addision Wesley, 1974. 4. Robert J, Schalkoff, “Pattern Recognition: Statistical, Structural and Neural Approaches”, John Wiley & Sons Inc., New York, 1992.
CS467 GENETIC ALGORITHMS AND ITS APPLICATIONS L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3 PURPOSE This course enable us to understand the concepts of Genetic Algorithms and its applications INSTRUCTIONAL OBJECTIVES
• Genetic Operators and modeling • Applications of Genetic Algorithms • Genetic Based Machine Learing
91
UNIT I - INTRODUCTION TO GENETIC ALGORITHM 9 Introduction to Genetic Algorithm – History – Basic concepts – Creation of Offsprings – Working principle - Encoding – binary encoding – octal encoding – hexadecimal encoding – permutation encoding- value encoding – tree encoding – fitness function UNIT – II GA OPERATORS 10 Reproduction- Roulette-wheel Selection – Boltzman Selection – Tournament Selection-Rank Selection – Steady –state selection – Elitism – generation gap and steady-state selection - Inheritance operators - Crossover- Single-point crossover – Two-point cross over – Multi-point cross over – Uniform Cross over – Matrix Cross Over – Cross Over rate - Mutation operators – mutation – mutation rate UNIT – III GENETIC MODELLING 9 Inversion and deletion : Inversion – deletion and duplication - deletion and regeneration – segregation – cross over and inversion – Bit-wise operators – one’s complement operator – logical bit-wise operators – shift operators – bit-wise operators used in GA – generational cycle – convergence of GA - Differences and Similarities between GA and Other Traditional Methods UNIT – IV APPLICATIONS OF GA 8 The rise of GA – GA application of Historical Interaction. – Dejung & Function optimization – Current applications of GA -Techniques in genetic search :Dominance, Diploidy & abeyance –Niche & Speciation – Multi objective optimization – Knowledge-Based Techniques. – GA & parallel processes- Real Life Problem UNIT – V GENETICS-BASED MACHINE LEARNING 9 Genetics – Based Machined learning – Classifier system – Rule & Message system – Apportionment of credit: The bucket brigade – Genetic Algorithm – A simple classifier system in Pascal. – Results using the simple classifier system-The Rise of GBMC – Development of CS-1, the first classifier system. – Smitch’s Poker player–Current Applications. Total 45 TEXT BOOKS 1. David E. Gold berg, “Genetic Algorithms in Search, Optimization & Machine Learning” , Pearson Education, 2001 2. S.Rajasekaran, G.A.Vijayalakshmi Pai, “ Neural Networks, Fuzzy Logic and Genetic Algorithms “, PHI , 2003 ( Chapters 8 and 9 ) REFERENCE BOOK 1.Kalyanmoy Deb ,”Optimization for Engineering Design , Algorithms and examples” PHI 1995
CS469 ADVANCED JAVA PROGRAMMING L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3 PURPOSE This course provides an in-depth knowledge of Advanced Java language and programming
92
INSTRUCTIONAL OBJECTIVES • Java Data structure • Java Networking and Beans • Java Data Base and Graphics
UNIT - I JAVA BASICS-REVIEW 8
Java Streaming – Components and events handling – Threading concepts – Networking features – Byte code interpretation – Media Techniques. UNIT - II JAVA DATA STRUCTURES 9
1. Campione, Walrath and Huml, “The Java Tutorial”, Addison Wesley, 1999. 2. Duane A.Bailey, “Java Structures”, McGraw-Hill Publications, 1999. 3. Jeff Frentzen and Sobotka, ‘Java Script”, Tata McGraw-Hill, 1999.
93
ELECTIVES FOR EIGHTH SEMESTER
CS452 ATM NETWORKS L T P C (for candidates admitted from 2003-04 and afterwards) 3 0 0 3
PURPOSE This course provides an introduction to ATM Networks, Protocols and issues INSTRUCTIONAL OBJECTIVES
• ATM switching and Routing • High speed LAN • Protocols over ATM
UNIT - I INTRODUCTION 9 ATM – Historical perspective – Protocol Architecture – Logical connections – Cells – Transmission of ATM cells – SDH – SONET – Switches.
UNIT - II ATM PROTOCOL 9 Connection setup – Routing Switching, Signaling, ATM Service categories – QOS parameters – Adaptation Layer.
UNIT - III ROUTING ISSUES 10 Routing for high speed networks – RSVP, Traffic and Congestion control – Achieving QOS – Traffic shaping – Generic cell rate algorithms – Rate based congestion control – Connection admission control.
UNIT - IV HIGH SPEED LANS 7 Fast Ethernet – ATM LAN’s – LANE
UNIT - V PROTOCOLS OVER ATM 10 Multiple protocols over ATM, IP over ATM, TCP over ATM – Real time transport protocol – Wireless ATM – Current trends.
Total 45 TEXT BOOK
1. Rainer Handel, Manfred N. Huber, Stefan Schroder, “ATM Networks”, Addison Wesley, 1999.
REFERENCE BOOKS
1.William Stallings, “High Speed Networks TCP/IP and ATM Design Principles”, Prentice Hall International, 1998. 2. Uyless Black, “ATM Vol.1 and 2”, PHI, 1999. 3. William Stalling, “ISDN with Broad Lane ISDN with frame relay and ATM”, PHI, 4th edition, 1999.
94
CS454 DATA MINING L T P C
(Same as IT454) 3 0 0 3(for candidates admitted from 2003-04 and afterwards)
PURPOSE This course enable us to understand the concepts of Data Warehousing and Data Mining and its applications INSTRUCTIONAL OBJECTIVES
• OLTP and Developing a Data Warehouse • Data mining techniques and algorithms • Data Mining environments and applications
UNIT I DATA WAREHOUSING & OLAP 9 An Introduction to data ware housing and characteristics of a datawarehouse, various aspects of data marts , OnLine Analytical Processing: OLTP and OLAP systems, Data Modelling, OLAP Tools, web OLAP, Decision support system. UNIT II DEVELOPING A DATA WARE HOUSE 9 Architectural strategies and Organization Issues, Design Considerations, Tools for Data Warehousing, crucial decisions in designing a Data Ware house using ORACLE 8i / SQL server. UNIT III DATA MINING 9 From Data ware housing to Data Mining, Objectives of Data Mining, the Business context for Data mining, Process improvement, marketing and Customer Relationship Management (CRM), the Technical context for Data Mining, machine learning, decision support and computer technology. UNIT IV DATA MINING TECHNIQUES AND ALGORITHMS 9 Process of data mining, Algorithms, Data base segmentation or clustering, predictive Modelling, Link Analysis, Data Mining Techniques, Automatic Cluster Detection, Decision trees and Neural Networks. UNIT V DATA MINING ENVIRONMENT 9 Case studies in building business environment, Application of data ware housing and Data mining in Government, National Data ware houses and case studies.
Total 45 TEXT BOOKS 1. Berry and Lin off , “Mastering Data Mining: The Art and Science of Customer
Relationship Management”, John Wiley and Sons, 2001. (Unit – III,IV & V) 2. C.S.R. Prabhu , “Data Ware housing: Concepts, Techniques, Products and Applications”,
Prentice Hall of India, 2001. ( Unit – I & II) REFERENCE BOOKS 1. J.Han, M.Kamber , “Data Mining: Concepts and Techniques”, Academic Press, Morgan
Kanf man Publishers, 2001. 2. Pieter Adrians, Dolf Zantinge, “Data Mining”, Addison Wesley,2000. 3. W.H.Inmon, “ Building the DataWarehouse” , 3rd Edition, Wiley Dreamtech ‘02
95
4. Sam Anabory & Dennis Murray , “Data Warehousing in the real world”, Addisson Wesley, 1997.
5. Amitesh Sinha, “Data Ware Housing “, Thomson Asia, 2002
CS456 USER INTERFACE DESIGN L T P C
(Same as IT354) 3 0 0 3 (for candidates admitted from 2003-04 and afterwards) PURPOSE The subject aims the Principles and design issues of User Interface Design. The design process of User Interfaces are also discussed. INSTRUCTIONAL OBJECTIVES • The Importance of Interactive Software and Interactive devices are studied. • The principles and design issues of User Interface are studied. • The Visualization and information search in websites are studied UNIT I HUMAN FACTORS 9 Human factors of interactive software – interaction devices.
UNIT II MODELS 9 Theories – principles and design guidelines for user interface design – object – action interface model – principles for design – data display and entry guidelines.
UNIT III DESIGN PROCESS 9 User interface design process – usability testing – usability requirements and specification procedures and techniques.
UNIT IV INFORMATION SEARCH 9 Information search – visualization and the www.
UNIT V USABILITY 9 Usability of web sites and case study of e-commerce Sites.
Total 45
TEXT BOOK 1. Ben Schneider Man, “Designing the User Interface”, Addison Wesley, 3rd Edition, 1997.
REFERENCE BOOKS 1. Alan Cooper, “The Essentials of User Interface Design”, IDG books, 1995. 2. Jacob Neilson, “Usability Engineering”, Academic Press, 1993. 3. Alan dix et al , “Human-Computer Interaction”, Prentice Hall, 1993
96
CS458 MANAGEMENT INFORMATION SYSTEMS L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3 PURPOSE This course gives a thorough understanding of the principles of Management Information Systems and their related field INSTRUCTIONAL OBJECTIVES
• Concepts of Management Information Systems and its structure • DBMS , Decision making and system anlaysis • Decision Support Systems and planning
UNIT I INTRODUCTION 9 Data Processing – Transaction Processing – Application Processing – Information System Processing - Definition of MIS – MIS concepts – Role and Impact of MIS- Introduction to Management- Approaches to Management – Functions of the Manager- Management as a Control System – Management by exception – MIS as a support to the Management – Subsystems of MIS – Structure of MIS UNIT II DATABASE MANAGEMENT SYSTEM 9 Concepts – Data Models – Data base Design – MIS and Client – Server Architecture- Management effectiveness- Planning – Organizing – Staffing – Coordinating and Directing – Controlling – Network Topology – Features LAN , WAN – ATM technology – Data Communications –Distributed Systems- Organizational structure and theory – Basic model of organization structure – Modifications to the Basic model of organization structure- organizational behavior UNIT III DECISION MAKING AND INFORMATION 9 Decision Making Concepts – Problem formulation – Programmed vs Non-Programmed decisions- Classical Economical Model- Administrative Model – Resolution of Conflict-Uncertainty Avoidance-Problemistic search – Incremental Decision Making- Optimization Techniques under Certainty – Payoff matrices – Decision trees- Game Theory- Statistical Inference – Documenting and Communicating Decision rules – Information – Quality of Information – Redundancy – Sending and Receiving efficiency – Utility of Information – Errors and Bias – Value of Information – Sensitivity Analysis- General model of a Human as an Information Processor UNIT IV SYSTEMS ANALYSIS AND DESIGN 9 System Concepts – Types of Systems – Preventing System Entropy –System Stress- Systems control – Organizational efficiency and effectiveness – Use of subsystems in Information System design –Decoupling in Information System- Need of System Analysis- System Analysis in the existing system – System analysis of a new requirement – System Development Model- Structured System Analysis and Design (SSAD) – Computer System Design – MIS and System Analysis – Development of MIS – Development of Long range plan of the MIS – Ascertaining the class of Information Determining the Information Requirements – Development and Implementation in the MIS – Management of Quality in the MIS – MIS, the factors of success and failures
97
UNIT V PLANNING AND DECISION SUPPORT SYSTEMS 9 Hierarchy of Planning – Planning models – Computational Support for planning – Organizational Structure Implications and Management Theory in System Design- Decision Support System – concepts and Philosophy – Deterministic System – Artificial Intelligence System-Knowledge Bases Expert System – MIS and the role of DSS – Enterprise Management System (EMS)- Enterprise Resource Planning System(ERP)- ERP basic features- Benefits- solutions – Implementations Total 45 TEXT BOOKS
1. W.S.Jawadekar, “Management Information System “, Tata McGraw Hill’97 2. Gordon B.Davis & Marethe H. Olson, ” Management Information System”, McGraw
Hill ,1997 REFERENCE BOOKS 1. Jerome Kanther, “Management Information System”, PHI , 1990 2. James. A. O’Brien,” Management Information System”, Tata McGraw Hill , 1999 3. David Kroenke, “Management Information System”, Tata McGraw Hill , 1989
CS460 REAL TIME SYSTEM DESIGN L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3 PURPOSE This course enables us to understand the concepts of Real time systems and its applications INSTRUCTIONAL OBJECTIVES
• Basics of Real time systems • Real time memory and design considerations • Integration of Hardware and software in real time applications
UNIT I INTRODUCTION 9 Basic real time concepts - Introduction, Real-time Versus Conventional Software, Computer Hardware for Monitoring and Control, Software Engineering Issues. UNIT II DESIGN TECHNIQUES 9 Real time specification and design techniques – structure of an RTOS - real time kernels – intertask communication and synchronization. UNIT III MEMORY MANAGEMENT 9 Real time memory management. System performance analysis and optimization. UNIT IV QUEUING MODELS AND FAULT TOLERANT ARCHITECTURES 9 Queuing models – Reliability,testing and fault tolerance, HW/SW faults, diagnosis, functional testing . Fault tolerant architectures: TMR systems - multiprocessing systems.
98
UNIT V APPLICATIONS 9 Hardware/Software integration, real time applications Total 45
TEXTBOOKS 1. Laplante Philip.A, “Real-time systems design and analysis: An engineer’s handbook”,2nd
Edition, PHI.,1994 2. C.M.Krishna, Kang G.Shin, “Real-time systems” – McGraw Hill, 1997. REFERENCE BOOKS 1. Alan C. Shaw , “Real – Time Systems and software “,John Wiley & Sons Inc,2001 2. Buhr R J and Bailey D L, “An Introduction to Real-Time Systems”, Prentice-Hall 1999. 3. Burns, A and Wellings, A, “Real Time Systems and Programming Languages: Ada 95,
Real-Time Java and Real-Time C/POSIX”, Addison-Wesley. ISBN.,2001 4. Levi S.T. and Agarwal A.K., “Real time System Design”, McGraw Hill International
Edition, 1990.
CS462 VIRTUAL REALITY L T P C
(Same as IT452) 3 0 0 3(for candidates admitted from 2003-04 and afterwards)
PURPOSE To introduce the use of simulated environments as a component of education/training programs. INSTRUCTIONAL OBJECTIVES
• To understand the requirements and benefits of virtual reality • To learn the use of 2D and 3D modeling for virtual reality • To develop VR models using VRML • To learn and use VR hardware.
UNIT I VIRTUAL REALITY AND ENVIRONMENTS 9 Introduction- Computer Graphics – real – time computer graphics – flight simulation – virtual environments – requirements – benefit of virtual reality. The historical development of virtual reality: Scientific landmarks 3D computer Graphics: Virtual world space – positioning the observer – Perspective projection – human vision – stereo perspective projection – human vision stereo perspective projection – 3D clipping – color theory – 3D modeling – illumination – reflection models – shading algorithms – hidden surface removal – stereo graphic images. UNIT II GEOMETRIC MODELING 9 Conversion form 2D to 3D – 3D space curves – 3D boundary representation- modeling strategies. Geometric transformations: Frames of reverences – modeling transformations- Instance – Picking- flying – Scaling the virtual environment – Collision Detection. Generic virtual Reality: virtual Environment – Computer Environment – Virtual reality Technology – Models of interaction _ Virtual Reality Systems.
99
UNIT III ANIMATION 9 The Dynamics of number – animation of Objects – shape and object in betweening – frame- form deformation – particle systems. Physical simulation : Objects falling in the gravitational field – rotating wheels – elastic – collision – project tiles- simple pendulums – springs – flight Dynamics of an aircraft Human Factor : eye- ear-somatic senses –equilibrium. UNIT IV VIRTUAL REALITY HARDWARE 9 Sensor Hardware – head – Coupled displays – Acoustic hardware – integrated Virtual Reality Systems. Virtual Reality Software: Modeling virtual worlds – Physical simulation – Virtual Reality tool kits. UNIT V VIRTUAL REALITY APPLICATIONS 9 Engineering – entertainment – Science – training .Future of Virtual Reality: Virtual Environments – modes of Interaction.
Total 45 TEXT BOOKS
1. John Vince, “Virtual Reality Systems”, Addison Wesley, 1st Reprint, 1999. 2. Adams, “Visualizations of Virtual Reality”,Tata McGraw Hill, 2000.
REFERENCE BOOKS 1. Grigore C. Burdea, Philippe Coiffet , “Virtual Reality Technology” , Wiley- Interscience,1 Edition,1994. 2. William R. Sherman, Alan B. Craig, “Understanding Virtual Reality: Interface, Application, and Design”,Morgan Kaufmann, 1st Edition,2002.
CS464 DESIGN AND ANALYSIS OF PARALLEL
ALGORITHMS L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3 PURPOSE This course provide a way to learn the various Parallel Algorithms INSTRUCTIONAL OBJECTIVES
• Parallel Sorting and Searching • Matrix ,Numerical and Graph Algorithms • Computational Geometry
UNIT - I BASIC MODELS AND ALGORITHMS 9 Models of parallel computation – Parallel Algorithms – Design and Development – Parallel programming languages – Parallelizing sequential algorithms.
UNIT - II SORTING AND SEARCHING 9 Parallel sorting algorithms – Dictionary operations – Combinatorial search – Generating permutations and combinations in parallel.
UNIT - III MATRIX AND NUMERICAL ALGORITHMS 9 Matrix operations – Transposition – Multiplication – Numerical algorithm – Solving Systems of Linear Equations – Nonlinear equation – Partial Differential equations.
100
UNIT - IV FFT AND GRAPH ALGORITHMS 9 Computing DFT – FET in parallel – Finding connected components – Shortest paths – Minimum spanning trees of Graphs.
UNIT - V COMPUTATIONAL GEOMETRY 9 Inclusion Problem – Intersection – Proximity – Construction – Parallel Algorithms.
Total 45 TEXT BOOK
1. Michael J. Quinn, “Parallel Computing – Theory and Practice”, McGraw-Hill Book Company, 1994.
REFERENCE BOOKS
1. Rajumar Buyya, “High Performance Cluster Computing: Programming and Applications”, Vol – 2 Prentice Hall Pvt., 1999. 2. Selim G.Akl, “The Design and Analysis of Parallel Algorithms”, Prentice Hall International Inc., 1989. 3. Horowitz E., Sahni S., Rajasekaran S., “Computer Algorithms”, Galgotia, 1997. 4. Jeol M. Crichklow, “An Introduction to Distributed and Parallel Computing” PHI, 2nd edition, 1988.
CS466 VLSI FUNDAMENTALS L T P C
( Same as EC471) 3 0 0 3 (for candidates admitted from 2003-04 and afterwards) PURPOSE This course gives the fundamental structures of VLSI Systems, Design and Applications INSTRUCTIONAL OBJECTIVES
UNIT I DIGITAL SYSTEM AND VLSI 9 Digital System and VLSI – Integrated Circuit Manufacturing – CMOS Technology – Integrated Circuit Design Techniques – Transistor & Layout – Introduction – Fabrication Process – Transistors – Design rules – Layout Design & Tools. UNIT II LOGIC GATES COMBINATIONAL LOGIC NETWORKS 9 Logic Gates – Introduction – Combinational Logic Functions – Static Complementary Gates – Wires & Delays – Switch Logic – Alternative Gate Circuits –Introduction – Layout Design Methods – Simulation – Combinational Network Delay – Cross Talk – Power Optimization – Switch Logic Networks – Combinational Logic Testing. UNIT III SEQUENTIAL MACHINES AND PROGRAMMABLE LOGIC ARRAYS 9 Sequential Machines – Introduction – Latches & Flip Flops – Sequential Systems & Clocking Disciplines – Sequential System Design – Power optimization – Design Validation – Sequential Testing – Sub System Design – Principles – Combinational –Shifters – Adders –
101
ALUs – Multipliers – High Density Memory – Field Programmable Gate Arrays – Programmable Logic Arrays. UNIT IV FLOOR PLANNING 9 Floor Planning – Methods – Off Chip Connection – Architecture Design – Introduction – Registers – Transfer Design – High Level Synthesis – Architecture for Low Power – Architecture Testing. UNIT V DESIGN METHODOLOGIES 9 Chip Design – Introduction – Design Methodologies – Kitchen Timer Chip –PDP – 8 Data Path – CAD System & Algorithms – Introduction – CAD System – Layout Synthesis – Test Generation – Sequential Machine Optimization – Scheduling & Binding –Hardware/Software Co Design.
Total 45 TEXT BOOK 1. Wayne Wolf, “Modern VLSI Design ”, Prentice Hall , 2nd Edition,2003.
REFERENCE BOOK 1.Thomas E. Dillinger , “VLSI Engineering”, Prentice Hall, 1988.
CS468 ADVANCED OPERATING SYSTEMS L T P C
(for candidates admitted from 2003-04 and afterwards ) 3 0 0 3 PURPOSE This course provides a better understanding of various Operating Systems INSTRUCTIONAL OBJECTIVES
• Network Operating Systems • Distributed Operating Systems • Data Base and Real – Time Operating Systems
UNIT - I MULTIPROCESSOR OPERATING SYSTEMS 8 Threads – Process synchronization – Processor scheduling – Memory management – Reliability – Fault tolerance. UNIT - II NETWORK OPERATING SYSTEMS (NOS) 10 Types of NOS – NOS to LANs – Choosing and NOS – Multiple NOS on a single Network – NOS and Network management – Future Trends. UNIT - III DISTRIBUTED OPERATING SYSTEMS 11 Issues - Communication Primitives – Remote procedure call – Logical clocks – Vector clocks – Distributed mutual exclusion – Non token based algorithms – Token based algorithms – Issues in deadlock detection and resolution – Centralized and distributed deadlock detection algorithms – Election algorithms, Issues in load distributing – Load distributing algorithms – Distributed File System design issues – Mechanisms for building DFS UNIT – IV DATABASE OPERATING SYSTEMS 8 Requirements - Concurrency control model – Serializability theory – Distributed database systems – Synchronisation primitives – Lock based and timestamp based algorithms – Fully replicated database systems.
102
UNIT - V REAL TIME OPERATING SYSTEMS 8 Architecture of Real Time Systems – Operating Systems Issues – Performance Measures – Estimating Program runtimes – Uniprocessor Scheduling – IRIS Tasks – Task Assignment Mode changes – Fault – tolerant scheduling. Total 45 TEXT BOOKS 1. Mukesh Singhal, Niranjan G.Shivaratri, “Advanced Concepts in Operating systems”, McGraw-Hill, New York, 1994.(Unit I , III & IV) 2. C.M.Krishna, Kang G.Shin, “Real Time Systems”, McGraw-Hill, 1997.(Unit – V) 3. Philip Hunter, “Network Operating Systems – Making Right Choices”, Addison Wesley, 1995. (Unit – II)
REFERENCE BOOKS
1. Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall, NJ (Section 9 – 13 only). 2. Pradeep K. Sinha, “Distributed Operating Systems Concepts and Design”, PHI, 1997. 3. Gary Nutt, “Operating Systems – A Modern Perspective”, Addison Wesley, 2000.
CS470 BIO INFORMATICS L T P C
(Same IT460) 3 0 0 3 (for candidates admitted from 2003-04 and afterwards) PURPOSE To explore how biological information could be stored in digital form to create bioinformatics resources and how the same may be processed. INSTRUCTIONAL OBJECTIVES
• To study the different coding techniques and standards • To know about the different biological network of resources available • To learn how to maintain patient records • To learn and understand the protein and DNA sequence database • To understand and implement algorithms for processing biological databases
UNIT I CODING 8 Common Health Care Language – Coding Techniques – Coded & Quasi Quaded Data – Medical Vocabulary – Industry Wide Communication Standards HL7 – Unified Medical Language System – Quality of Care Paradigms – Risk mangement Bio Ethics. UNIT II INFORMATION NETWORKS 8 Internet Facilities used in the Web Browser STTP 5 – HTTP – HTML – URL – European Molecular Biology Network – National Center for Bio Technology Information. UNIT III PATIENT RECORD MAINTENANCE 8 Electronic Patient Record – Models or ERP – Environmental Services – Metrics – Tele Medicine – Community Networks – Tele Medecine Peripherals & Equipment Selection – Anatomy of Video Conference Technology.
103
UNIT - IV PROTEIN INFORMATION RESOURCES 9 Biology Data Basics – Primary Secondary Data Basics – Protein Pattern Data Basics – DNA Sequence Data Basics – DNA Analysis – Genes Structure and DNA Sequences – Interpretation of EST Structures – Different Approaches to EST Analysis. UNIT -V ALIGNMENT TECHNIQUES 12 Data Base Searching – Comparison of Two Sequences – Identity & Similarity – Global & Global Similarity – Global & Local Alignment – Multiple Sequence Alignment – Data Basis of Multiple Allignment – Secondary Data Base. Expert System – Statistical Decision Tree – Integration of Decision Support in Clinical Processors – Genome Project.
Total 45 TEXT BOOKS
1. T.K. Attwood and D.J Perry Smith, “ Introduction to Bio Informatics”, Prentice Hall, 1st Edition, 2001.
2. Jean Mickel Clavere & Cadrienotredom “Bio Informatics– A beginners guide” Wiley Green Tech, 2003. REFERENCE BOOKS 1. Bernser E.S., “Clinical Decision Support System: Theory & Practice”, Springer
Verlag; 1st Edition, 1998. 2. Coiera E. Chajsman “Guide to Medical Informatics: The Internet & Telemedicine”,
Oxford University Press, 1st Edition, 1997.
CS472 COMPONENT TECHNOLOGY L T P C
(for candidates admitted from 2003-04 and afterwards) 3 0 0 3PURPOSE This course will provide a good knowledge of the component technologies which are currently prevailing in the industries
INSTRUCTIONAL OBJECTIVES
• Software components like COM/DCOM , CORBA • Java programming using components • Distributes applications and transaction processing
UNIT I BASICCONCEPTS 9 Software Components - COM/DCOM - Java Beans - Enterprise Java Beans – CORBA - Distributed objects - request and response - remote reference - IDL interface – proxy - Marshalling. UNIT II BASIC PATTERNS AND INHERENT ISSUES 9 Factory - Broker - Garbage collection on the Client and Server - Persistence of Remote References – Transactions - Concurrency in Server Objects - Applying Client/Server relation recursively - Event Driven Programming.
104
105
UNIT III JAVA VS CORBA 9 Java Programming with CORBA - Overview of Java ORBs - First Java ORB Application - OMG IDL to Java mapping - ORB run-time system - Discovering Services (Naming, Trading) - Building Applications -Advanced features (DSI, DII, Interface depository) - CORBA Events – Practical applications UNIT IV DISTRIBUTED OBJECT DATABASE MANAGEMENT 9 Object model features - Fundamental object management issues - DOM architectures - Object caching - Object clustering - Object migration - Query processing in Distributed object DBMS - Transaction management in distributed object DBMS. UNIT V COM OVERVIEW 9 COM - Distributed COM - COM Facilities and Services - Applying COM Objects - Interfaces Objects - Class - Factory Components - Servers - Clients - Object Orientation Infrastructure - Memory Transparency - Concurrency -Security - Building Components with ATL - ActiveX Controls Total 45 TEXT BOOKS 1. Andreas Vogel, Keith Duddy “Java Programming with CORBA” John Wiley & Sons.
1998. (Unit – I & III) 2. Valduriez, “Principles of Distributed Database Systems”, Prentice Hall,2000 (Unit –IV) 3. Ozsu, “Inside COM”, Microsoft press, 2000. (Unit – I , II & V) REFERENCE BOOKS 1. Thomas J..Mowbray, William A.Ruh, “Inside CORBA Distributed Object Standards and Applications”, Addison – Wesley, 2001. 2. Dale Rojerson, “Inside COM”, Microsoft Press, 2001.
