Cse - Final PDF

2008 REGULATIONS
COMPUTER SCIENCE AND E N G I N E E R I N G F U L L T I M E B. E.
CURRICULUM A N D S Y L L A B I
G O V E R N M E N T COLLEGE OF TECHNOLOGY, COIMBATORE - 641 013 An Autonomous Institution - Anna University of Technology, Coimbatore
Curriculum & Syllabi (I - VIII SEM)
CANDIDATES ADMITTED DURING 2008 - 2009 AND ONWARDS

BRANCH : B.E. COMPUTER SCIENCE AND ENGINEERING
CURRICULUM FOR CANDIDATES ADMITTED DURING 2008-2009 AND ONWARDS
S.No
Subject Code
Course Title
Sessional Marks I SEMESTER
Final Total Exam Marks Marks
Credits L T P C
1 2 3 4 5 6 7 8
08S1Z1 08S1Z2 08S1Z3 08S1Z4 08S105 08S106 08S1Z7 08S1Z8
Communication Skills in English I Engineering Mathematics I Applied Physics Applied Chemistry C Programming Practical Workshop Physics Laboratory Chemistry Laboratory Total
25 25 25 25 25 25 25 25
75 75 75 75 75 75 75 75
100 100 100 100 100 100 100 100 800
3 3 3 3 3 0 0 0
1 1 0 0 0 0 0 0
0 0 0 0 2 3 3 3
4 4 3 3 4 2 2 2 24
II SEMESTER 1 2 3 4 5 6 7 8 08S2Z1 08S2Z2 08S2Z3 08S204 08S205 08S206 08S207 08S208 Communication Skills in English II Engineering Mathematics II Materials Science Environmental Science and Engineering Basics of Electrical and Electronics Engineering Object Oriented Programming and C++ Practical Engineering Graphics Object Oriented Programming Lab Total 25 25 25 25 25 25 25 25 75 75 75 75 75 75 75 75 100 100 100 100 100 100 100 100 800 3 3 3 3 4 3 2 0 1 1 0 0 0 1 0 0 0 0 0 0 0 0 3 3 4 4 3 3 4 4 4 2 28
27
S.No
Subject Code
Course Title
Sessional Marks III SEMESTER
Final Credits Total Exam Marks L T P C Marks 75 75 75 75 75 75 100 100 100 100 100 100 3 3 3 3 3 3 1 1 0 1 0 0 0 0 0 0 0 0 4 4 3 4 3 3
1 2 3 4 5 6
08S3Z1 08S302 08S303 08S304 08S305 08S306
Engineering Mathematics III Discrete Mathematics Database Systems Digital Systems Data Structures and Algorithms I Java Programming Practical
25 25 25 25 25 25
7 8
08S307 08S308
Integrated Circuits Lab Java Programming and Data Structures Lab Total
25 25
75 75
100 100 800
0 0
0 0
3 3
2 2 25
IV Semester
1 2 3 4 5 6
08S401 08S402 08S403 08S404 08S405 08S406
Numerical Methods Computer Architecture Microprocessors, Micro Controller and Applications Communication Engineering Systems Programming and Operating Systems Data Structures and Algorithms II Practical Microprocessors and Microcontrollers Lab Systems Programming, Operating Systems and RDBMS Lab Total
25 25 25 25 25 25
75 75 75 75 75 75
100 100 100 100 100 100
3 3 3 3 3 3
1 1 0 0 0 0
0 0 0 0 0 0
4 4 3 3 3 3
7 8
08S407 08S408
25 25
75 75
100 100 800
0 0
0 0
3 3
2 2 24
28
S.No
Subject Code
Course Title
Sessional Marks V SEMESTER
Final Total Exam Marks Marks
Credits L T P C
1 2 3 4 5 6
08S501 08S502 08S503 08S504 08S505 08S506
Probability, Random Processes and Queuing Theory Unix Internals Visual Programming Embedded System Design Using C Theory of Computation Computer Networks Practical
25 25 25 25 25 25
75 75 75 75 75 75
100 100 100 100 100 100
3 3 3 3 3 3
1 0 0 0 1 0
0 0 0 0 0 0
4 3 3 3 4 3
7 8
08S507 08S508
Unix Internals and Networking Lab Visual Programming Lab Total
25 25
75 75
100 100 800
0 0
0 0
3 3
2 2 24
VI SEMESTER
1 2 3 4 5 6
08S601 08S602 08S603 08S604 08S605 08S606
Artificial Intelligence Software Engineering Distributed Operating System Compiler Design Open Source Systems Fundamentals of Digital Signal Processing Practical
25 25 25 25 25 25
75 75 75 75 75 75
100 100 100 100 100 100
3 3 3 3 3 3
0 0 0 0 0 1
0 0 0 0 0 0
3 3 3 3 3 4
7 8
08S607 08S608
Compiler Design Lab Software Engineering Lab
25 25
75 75
100 100 800
0 0
0 0
3 3
2 2 23
Total
29
S.N o
Subject Code
Course Title
Sessional Marks VII SEMESTER
Final Exam Marks
Total Marks
Credits L T P C
1 2 3 4 5 6
08S701 08S702 08S703 08S704 08S7Ex 08S7Ex
Management and Economics Cryptography and Network Security Digital Image Processing Mobile Computing Elective I Elective II Practical
25 25 25 25 25 25
75 75 75 75 75 75
100 100 100 100 100 100
3 3 3 3 3 3
0 0 0 0 0 0
0 0 0 0 0 0
3 3 3 3 3 3
7 8
08S707 08S708
Digital Image Processing Lab Network Security and Elective Lab Total
25 25
75 75
100 100 800
0 0
0 0
3 3
2 2 22
VIII SEMESTER 1 2 08S8Ex 08S8Ex Elective III Elective IV Practical 3 08S801 Project Work Total 50 150 200 400 0 0 12 6 12 25 25 75 75 100 100 3 3 0 0 0 0 3 3
30
LIST OF ELECTIVES FOR B.E. COMPUTER SCIENCE AND ENGINEERING Final Exam Marks Credits L T P C
S.No
Subject Code
Course Title
Sessional Marks VII SEMESTER
Total Marks
1 2 3 4 5 6 7 8 9 10
08S7E0 08S7E1 08S7E2 08S7E3 08S7E4 08S7E5 08S7E6 08S7E7 08S7E8 08S7E9
Enterprise Java J2EE Real Time Systems High Performance Architecture C# and .Net Frame Work Component Based Technology Web Services Genetic Algorithm and Swarm Intelligence Multimedia Systems PC Hardware and Trouble Shooting Distributed Computing
25 25 25 25 25 25 25 25 25 25
75 75 75 75 75 75 75 75 75 75
100 100 100 100 100 100 100 100 100 100
3 3 3 3 3 3 3 3 3 3
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
3 3 3 3 3 3 3 3 3 3
VIII SEMESTER 1 2 3 4 5 6 7 8 9 10 08S8E0 08S8E1 08S8E2 08S8E3 08S8E4 08S8E5 08S8E6 08S8E7 08S8E8 08S8E9 Fuzzy Logic and Neural Networks TCP/IP Design and Implementation Pattern Recognition Theory of Grid Computing ATM Networks Advanced Data Bases Data Warehousing and Data Mining Software Project Management Parallel Computing Nano Technology and Applications 25 25 25 25 25 25 25 25 25 50 75 75 75 75 75 75 75 75 75 50 100 100 100 100 100 100 100 100 100 100 3 3 3 3 3 3 3 3 3 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 3 3 3 3 3 3 3 3 3
31
08S1Z1 COMMUNICATION SKILLS IN ENGLISH I

[COMMON TO ALL BRANCHES]
C 4 READING (09) Reading for the purpose of skimming, scanning, guessing the meaning of words, information transfer note making-detailed comprehension and identifying stylistic features- identifying the topic sentence in each paragraph - understanding discourse coherence. WRITING (09) a). Transcoding- Completion of charts- Developing hints- Making Recommendations and Expressing obligations. b) Letter Writing Calling for quotations Placing orders Letter of complaint regarding manufacturing defects Letter to a friend- making a few suggestions/ inviting suggestions Writing E-mails c). Report Writing: Report on an accident in a factory/ Industrial visit- Completion of a projectParagraph writing- Process description- Interpreting the data Defining an object/ device/ instrument/ machine etc.d). Process of Communication- Scientific Vocabulary- Project Report Writing. LISTENING (09) Listening for learning-Word Stress and Pronunciation practice- Listening for specific informationNote taking and comprehension- Listening to fill up information gaps- Listening to announcements at Railway stations, Airport etc.- Listening to News on the radio/TV- Listening to casual conversation- Listening to live speeches- Listening to American and British English. SPEAKING (09) Free discussion on chosen topics, introducing oneself. Offering suggestions and Recommendations-Expressing opinions(agreement/disagreement)-Giving Instructions Role play activities based on real life situations-Discussing travel plans/Industrial visit/Instructions for performing tasks at home and at work-Discussion on debatable topics.-Verbal and Non-Verbal Communication- Accuracy- fluency and appropriateness-Formal and Informal Communication. 5. FOCUS ON LANGUAGE AND FUNCTION (09) Register-Technical and General-word formation with Prefixes and Suffixes- Deriving other forms of words- Active and Passive Voices- Tenses- Conditional Sentences of certainty- Modals and degrees of probability- Compound Nouns and Expanding Nominal Compounds- Content Words- Expression of Comparison and Contrast- Definition and Classification-Framing of Questions (Wh pattern) LECTURE: 45 TUTORIAL: 15 TOTAL: 60 hours. TEXT BOOK 1. The Humanities and Social Science Division, Anna University, English for Engineers and Technologists, Orient Longman, Vol I & II (Combined Edition), Chennai 2006. REFERENCES 1) Structure of Technical English, A J Herbert- The English Language Society, 1986. 2) Perform in English, M.Balasubramanian & G.Anbalagan, Anuradha Publications, 2007. 3) Effective English Communication, Krishna Mohan & Meenakshi Raman, (Language GroupBITS,Pilani) Tata McGraw Hill, 2005.
L 3
T 1
P 0
32
08S1Z2 ENGINEERING MATHEMATICS I

L 3
T 1
P 0
C 4
MATRICES (09) Characteristic equation - eigenvalues and eigenvectors of a real matrix - properties of eigen values Cayley Hamilton Theorem(statement only) and applications- diagonalisation - similarity and orthogonal transformation-reduction of quadratic form to canonical form. THEORY OF EQUATIONS, HYPERBOLIC FUNCTIONS (09) Relation between roots and coefficients-transformation of equations-reciprocal equations-hyperbolic functions and inverse hyperbolic functions, properties. APPLICATIONS OF DIFFERENTIAL CALCULUS (09) Curvature -cartesian and polar coordinates -circle of curvature -involutes and evolutes - envelopes evolute as envelope of normals . FUNCTION OF SEVERAL VARIABLES (09) Function of two variables -Taylors expansion - maxima and minima - constrained maxima and minima by lagrangian multiplier method -jacobians -differentiation under integral sign. INTEGRAL CALCULUS (09) Gamma and Beta functions-Double integration -Cartesian and Polar Coordinates change of order of integration -Area as double integral Triple integration -Volume as triple integralTransformation to Polar, Cylindrical and Spherical co-ordinates. LECTURE: 45 TUTORIAL: 15 TOTAL: 60 hours TEXT BOOK 1.Kandasamy.P., Thilagavathy.K and Gunavathy.K. Engineering Mathematics for First year , S. Chand & Co., Ram Nagar, New Delhi, 2007. REFERENCES 1.Veerarajan.T., Engineering Mathematics for First year, Tata Mc Graw Hill Publishing Co., New Delhi., 2007. 2.M.K.Venkataraman, Engineering Mathematics Vol I, II & IIIA , The National Publishing company, Chennai, 2006. 3.B.S.Grewal, Engineering Mathematics, Khanna publishers, New Delhi., 2007.
33
08S1Z3 APPLIED PHYSICS

L 3
T 0
P 0
C 3
LASERS (09) Introduction-Spontaneous emission and stimulated emission Einsteins coefficients-Population inversion , Types of pumping Types of Lasers- He-Ne ,CO2 , Nd-YAG, Semiconductor laser & Dye laser- Applications-Lasers in microelectronics, welding, heat treatment, cutting, holography
FIBER OPTICS AND APPLICATIONS (09) Principles Modes of propagation-Numerical Aperture and acceptance angle- Classification of optical fiber based on materials, refractive index profile and Modes- Preparation of optical fiber- Crucible and Crucible technique - Splicing-fusion and multiple splices, Light sources for fiber optics - LEDsDetectors-PIN Photodiode, Avalanche photodiode- Fiber optical communication links. Fiber optic sensors for Temperature and displacement. QUANTUM PHYSICS AND APPLICATIONS (09) Introduction to Quantum theory. Dual nature of matter and radiation- de-Broglie wavelength. Uncertainty principle. Schrdingers Time independent & Time dependent wave equations -Particle in a box. -Optical microscope-Limitations of optical microscopy. Electron microscope- Scanning Electron Microscope(SEM)-Transmission . Electron Microscope(TEM). ULTRASONICS (09) Introduction-Production: Magnetostriction effect- Magnetostriction generator- Piezoelectric effectPiezoelectric generator- Detection of ultrasonic wave-properties-cavitation- industrial applicationsDrilling, welding, soldering and cleaning- Non- destructive Testing-Pulse echo system through transmission and resonance system. Medical applications-cardiology, Ultrasonic imaging, X ray radiography. VACUUM SCIENCE (09) Introduction. Importance of vacuum in industries. Schematic diagram of vacuum system. Pumping speed and throughput. Types of pumps-Rotary vane type Vacuum pump(oil sealed), Diffusion Pump and Turbo Molecular Pump-Measurement of High Vacuum-McLeod Gauge-Pirani Gauge-Penning Gauge High temp vacuum science. LECTURE: 45 TUTORIAL: 15 TOTAL: 60 hours TEXT BOOK 1.Ganesan S. Iyandurai N, Applied Physics, KKS Publishers, Chennai, 2007 REFERENCES 1.Gaur R K and Gupta S L-Engineering Physics, Dhanpat Rai and sons, 2002. 2. Avadhanulu M N and Kshirsagar P G, A textbook of Engineering Physics.S. Chand and Company Ltd, NewDelhi, 2005. 3.Arumugam M- Engineering Physics, Anu Radha Publishers, 2002. 4.Jayakumar S, Engineering Physics, RK Publishers, Coimbatore, 2003.
34
08S1Z4 APPLIED CHEMISTRY

L 3 POLYMERIC MATERIALS
T 0
P 0
C 3 (09)
Basic definitions: Monomers, functionality, degree of polymerization - Coordination polymerizationmechanism, Zeigler- Natta catalysts, applications - Glass transition temperature (Tg), crystallinity and the factors that affect these properties Commodity and engineering plastics, polymer blends and alloys, polymer composites, fibre reinforced plastics, examples Compounding of plasticscompounding materials, functions Fabrication-compression, injection, extrusion, blow moulding Conducting polymers- polyaniline, polypyrrole, mechanism of conduction CORROSION TECHNOLOGY (09) EMF series - Corrosion-mechanism of dry oxidation corrosion, nature of oxide, Pilling-Bedworth Electrochemical corrosion-mechanism of rusting, galvanic, aeration and pitting corrosion Factors influencing corrosion - Corrosion control-design, cathodic protection, modification of environment, use of inhibitors - Protective coating-metallic coating, anodic, cathodic, electroplating, cleansing before deposition Organic coatings-paints, constituents of paints, mechanism of drying, varnishes, enamels, lacquers Special paints-fire retardant, luminous, heat resistant paints. INSTRUMENTAL METHOD OF ANALYSIS (09) (Block diagram of the instrument, principle and working and application) Types of instruments and mentioning of their applications -Absorption spectroscopy-Lambert-Beer law, absorbance, UV- visible spectroscopy, types of electronic transitions, estimation of iron by colorimetry Atomic absorption spectroscopy, quantitative estimation of nickel Flame photometry, estimation of sodium Thermo gravimetric analysis, factors affecting TG curves, applications. chromatography, gas chromatography. INTEGRATED CIRCUITS FABRICATION (09) Basic fabrication steps in Planar technology - Crystal growth, Czochralski process and float zone process neutron transmutation doping, wafer preparation Methods of P-N junction formation, melt grown junction, alloying, solid-state diffusion, open tube furnace and evacuated sealed tube system, Ion implantation - Epitaxy, (details of methods not required) Masking and lithography-production of mask, photolithography, electron beam lithography Etching-wet, electrochemical, sputter, plasma - Metal deposition. PHASE RULE, ALLOYS AND POWDER METALLURGY (09) Phase rule, one component water system Reduced phase rule-two component alloy system, thermal analysis, Pb-Ag eutectic system, Cu-Ni alloy system and Mg-Al alloy system forming a series of solid solution Alloys-preparation, purpose of making alloys - Powder metallurgy-preparation of metal/ alloy powder, mixing and blending, compacting, pre-sintering, sintering, secondary operations, advantages and limitations. LECTURE: 45 TUTORIAL: 15 TOTAL: 60 hours TEXT BOOKS 1) P.C. Jain and Monika Jain,Engineering Chemistry, Dhanpat Rai Publishing Co. (P) Ltd. , New Delhi.(2002). 2)C.Parameswara Murthy,C.V.Agarwal and Andra Naidu, TEXT BOOK:for Engineering Chemistry B.S. Publications, Hyderabad (2006). REFERENCES 1) S.S. Dara, A TEXT BOOK:of Engineering Chemistry, S. Chand & Company, New Delhi. (2003). 2) B.K.Sharma, Engineering Chemistry, Krishna Prakasam Media (P) Ltd, Meerut (2001). 3) M.S.Tyagi, Introduction to Semiconductor Materials and Devices, John Wiely & Sons Singapore (2000).
35
08S105 C PROGRAMMING
[COMMON TO CSE, IT & IBT]
L 3
T 0
P 2
C 4
BASICS OF COMPUTER AND INFORMATION TECHNOLOGY (09) Digital Computer FundamentalsBlock diagram of a computerComponents of a computer system Applications of ComputersHardware and Software definitionsCategories of SoftwareBooting Installing and uninstalling SoftwareSoftware piracySoftware terminologies-Information Technology BasicsHistory of InternetInternet Tools. PROBLEM SOLVING METHODOLOGY Problem solving TechniquesProgramProgram development cycleAlgorithm Flow chart Pseudo Code Program control structures Types and generation of programming languages Development of algorithms for simple problems. BASIC ELEMENTS OF C (09) Introduction to C Lexical elements of C Operators and expressions Operator precedence and associativity of operators Input and Output Functions Simple computational problems DECISION MAKING Control statements Branching, looping, nested control structures, switch, break, continue, goto statements Problems using control structures. FUNCTIONS AND PROGRAM STRUCTURES (09) Prototypes and FunctionsDeclaring, defining and accessing functionsParameter passing methods RecursionStorage classesauto, extern, static and registerLibrary functions-Programs using functions. ARRAYS Defining and processing arraysPassing arrays to functionsMulti-dimensional arraysStrings and basic operations on stringsEnumerated data typesPrograms using simple sorting, searching and merging of arrays. POINTERS (09) Pointer conceptDeclarationAccessing variable through pointerInitializing pointer variable Pointers and FunctionsPointers and ArraysPointers and StructuresExample programs using pointers with function, arrays and structuresCommand line arguments Dynamic memory allocationOperations on pointers.
STRUCTURES, UNION AND FILE HANDLING (09) StructuresUser defined data typesUnionNested structure, passing structures to functions - Self referential structures - File pointerHigh level File operationsOpening and closing of fileCreating, Processing and Updation on filesSimple file handling programs-Low level Programming Additional Features of C. LECTURE: 45 PRACTICAL: 15 TOTAL: 60
36
TEXT BOOKS 1. ITL Education Solutions Limited, Introduction to Information Technology, Pearson Education (India), 2005. (Unit I) (Chapters: 1, 7, 9, 10, 15, 16) 2. Byron Gottfried, Programming with C, II Edition, (Indian Adapted Edition), TMH publications, 2006. (Unit II, III, IV and V) REFERENCES 1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Pearson Education Inc. (2005). 2. K. R. Venugopal and S. R. Prasad, Mastering C, TMH, Third reprint 2008. 3. Jeri R. Hanly and Elliot B. Koffman, Problem solving and program design in C, Fourth Edition, Pearson Education India, 2005. 4. Johnsonbaugh R. and Kalin M., Applications Programming in ANSI C,III Edition, Pearson Education India, 2003. LABORATORY EXERCISES Operators, Expressions and IO Formatting Decision Making and Looping Arrays and String Functions and Recursion Structures and Pointers Pointers and Dynamic memory Allocation Files Command line arguments.
37
08S106 WORKSHOP
[COMMON TO CIVIL, MECH, EEE, ECE, PROD, EIE, CSE & IT)
L 0 Plumbing, Sheet metal and Carpentry Study of tools and equipment in plumbing
T 0
P 3
C 2
Basic pipe connections involving the fittings like valves, taps, couplings, unions, reducers, elbows and other components used in household fittings Preparation of plumbing line sketches Practice in mixed pipe connections: Metal, Plastic and flexible pipes used in household appliance. Fabrication of Tray and Square box in sheet metal Preparation of simple wooden joints: Half lap, Half lap dovetail and Single dovetail joints
Welding and Foundry Safety precautions in welding Preparation of Lap, Butt and T-Joints Study of moulding tools and equipments Preparation of sand moulds for cubes, pipes and gear wheels
Electrical wiring and Electronic Circuit Practice Safety aspects of electrical wiring Wiring circuit for a lamp using single and staircase switches including calculation of power and energy Wiring circuit for a fluorescent lamps including calculation of power and energy Soldering of small electrical and electronic circuits Assembling of electronic components on a small PCB and testing Study of telephone, FM radio and low voltage power supplies TOTAL: 45 Hours
38
08S1Z7 PHYSICS LABORATORY

(COMMON TO ALL BRANCHES)
L 0 LIST OF EXPERIMENTS 1. Spectrometer Diffraction Grating Normal Incidence Methods 2. Air wedge 3. Youngs modulus Cantilever bending Koenings Method 4. Particle size determination 5. Thermal conductivity of the bad conductor lees disc method 6. Ammeter and volt meter calibration low range 7. Resistance of the given coil of wire Carey Fosters Bridge 8. Tortional pendulum 9. Youngs modulus Non uniform bending 10. Transistor characteristics
T 0
P 3
C 2
TOTAL: 45 Hours
39
08S1Z8 CHEMISTRY LABORATORY (COMMON TO ALL BRANCHES) L 0 LIST OF EXPERIMENTS 1. Estimation of hardness of water by EDTA method 2. Estimation of alkalinity of water sample 3. pH titration 4. Potentiometric titration 5. Conductometric titration 6. Estimation of ferric ion by spectro photometry 7. Determination of dissolved oxygen in sample water 8. Determination of calcium in lime water. 9. Determination of emf of an unknown cell and single electrode potential 10. Determination of degree of dissociation of weak electrolyte 11. Estimation of barium in Barium Chloride solution 12. Estimation of Calcium by permanganometry REFERENCES 1. Arthur L.Vogel, A text book of quantitative Inorganic analysis , ELBS (1971) 2. A.RaviKrishnan, Practical Engineering Chemistry ,Sri Krishna Publications Chennai (2002) T 0 P 3 C 2
TOTAL: 45 Hours
40
08S2Z1 COMMUNICATION SKILLS IN ENGLISH II

L 3
T 1
P 0
C 4
READING (09) Intensive reading, Extensive reading Understanding the Organization of texts Discourse cohesion Evaluating Style Inferring meaning Interpreting tables, flow charts Close reading. WRITING (09) a) Cause and Effect analysis Stating a Choice and Justifying it Safety Instructions Preparation of Check Lists Notices Agenda Minutes Memoranda /M.O.U . b) Letter writing Letter to the Editor of a Newspaper regarding a public cause. Seeking permission for in plant training. Asking for Certificates. c) Technical Structure, Style and International conventions Presentation of Technical Papers/Articles Analysis of Advertisements Slogan writing. LISTENING (09) Listening practice Listening to Speech segments (Accent and Vocabulary ) Listening to Recorded Telephonic Conversation, TV/Radio news in English (both American and British English) Listening to short and long conversations in different domains of activity. SPEAKING (09) Describing processes Pronunciation Practice(Word Stress , Consonant Cluster Homonyms) Conversational Eloquence Group Discussions Mock Interviews Seminar Presentation-Making Speeches(Comparing , Introducing a Guest to the Audience , Welcome Address and Proposing Vote of Thanks)- Preparing for a Call Handling a Call. FOCUS ON LANGUAGE (09) Synonyms and Antonyms Preposition-Numerical Expression-Rules for writing SI units-Language of Instructions Cause and Effect , Result , Purpose and Means, Time and Contracted Time StatementsSubject and Verb agreement- Phrasal Verbs , Commonly Confused Words Common Errors in English Discourse Markers American and British English Correction and Editing. LECTURE: 45 TUTORIAL: 15 TOTAL : 60 Hours TEXT BOOK 1. The Humanities and Social Science Division, Anna University, English for Engineers Technologists, Orient Longman, Vol I & II (Combined Edition), Chennai 2006. REFERENCES 1. Structure of Technical English, A J Herbert- The English Language Society, 1986. 2. Perform in English, M.Balasubramanian & G.Anbalagan, Anuradha Publications, 2007. 3. Effective English Communication, Krishna Mohan & Meenakshi Raman, (Language GroupBITS,Pilani) Tata McGraw Hill, 2005. and
41
08S2Z2 ENGINEERING MATHEMATICS II

L 3
T 1
P 0
C 4
ORDINARY DIFFERENTIAL EQUATIONS (09) Linear equations of Second and Higher order with constant coefficients when RHS is xn , eax ,sin ax, cos ax, eax f(x), xn f(x) simultaneous first order linear equations with constant coefficients -Homogeneous Linear differential equations of Euler-Cauchy type ,Legendre typemethod of variation of parameters. VECTOR CALCULUS (09) Gradient, divergence , curl line , surface & volume integrals Greens theorem in a Plane,Gauss Divergence and Stokes theorems ( Statements only) verifications and applications. LAPLACE TRANSFORMS (09) Transform of standard functions shifting theoremsTransforms of derivatives and integrals initial and final value theoremsperiodic functions inverse Transformconvolution Theorem solution of ordinary linear differential equations upto second order with constant coefficients and integral equations. COMPLEX DIFFERENTIATION (09) Cauchy-Riemann equations in cartesian and polar coordinates properties of analytic functionsconstruction of analytic functions -conformal mapping : w = z + a , az ,1/z , z2 , ez , cos z , sin z bilinear transformation. COMPLEX INTEGRATION (09) Cauchys integral theorem-Cauchys integral formulaTaylors and Laurents expansions- (statements only)- Poles and Residues Cauchys Residue theorem Contour integration Circular and semi circular contour ( Excluding poles on the real axis) LECTURE: 45 TUTORIAL: 15 TOTAL : 60 Hours TEXT BOOK 1.Kandasamy.P., Thilagavathy.K and Gunavathy.K. Engineering Mathematics for first year and Vol. III , S. Chand & Co., Ram Nagar, New Delhi, 2007. REFERENCES 1. Veerarajan.T., Engineering Mathematics for First year and for third Semester, Tata Mc Graw Hill Publishing Co., New Delhi. 2007. 2..M.K.Venkataraman, Engineering Mathematics Vol I, II & IIIA ,The National Publishing Company, Chennai, 2006. 3. B.S.Grewal, Engineering Mathematics, Khanna publishers, New Delhi. 2007. Company, Chennai, 2006.
42
08S2Z3 MATERIALS SCIENCE [COMMON TO ALL BRANCHES] L 3 T 0 P 0 C 3
SEMICONDUCTING MATERIALS AND DEVICES (09) Elemental and compound semiconductors. Intrinsic and extrinsic semiconductors-Properties- Carrier concentration in intrinsic and extrinsic semiconductors- Variation of Conductivity with temperature in intrinsic and extrinsic semiconductors -Hall effect-Hall coefficient in extrinsic semiconductors, experimental determination of Hall coefficient. Application of Hall coefficient. MAGNETIC MATERIALS (09) Classification of Magnetic material- Dia, para, ferro and ferric magnetic materials, anti ferro magnetism- Properties. Heisenberg and domain theory of ferromagnetism. Hysteresis-Experiment to draw Hysteresis loop- Hard and Soft magnetic materials. Ferrides- structure and applications. Devices and applications- The Transformer core-Magneto optical recording- MagneticValve SMART MATERIALS (09) Shape Memory alloys (SMA)-Characteristics, properties of NiTi alloy, application, advantages and disadvantages of SMA. Superconductivity -BCS theory of superconductivity(qualitative), Types of superconductors- properties- High critical Temperature superconductors, Application of superconductors- SQUID, Cryotron, Magnetic levitation. Metallic glasses- Preparation, properties and applications. NANOMATERIALS AND CHARACTERIZATION (09) Fabrication methods-Top down processes-lithographics -Bottom up process-Vapour phase deposition- physical vapour deposition(PVD) -chemical vapour deposition(CVD) methods, Molecular Beam Epitaxy(MBE) and Metalorganic Vapour Phase Epitaxy (MOVPE)- ordering of nano systems, self- assembly and self organization. NANODEVICES AND THEIR VARIOUS APPLICATIONS (09) Nanomagnetic materials-Magnetostatic Energy- Anisotropy energy- Magnetostriction EnergyParticulate nanomagnets and geometrical nanomagnets- Giant Magneto resistance(GMR)Nanomagnetism in technology- carbon nanotubes(CNT)-Properties and applications of Carbon Nanotubes- Organic Field Effect Transistor(OFET), organic Light Emitting Diodes(OLEDs)Quantum Well Physics. TOTAL: 45 Hours
TEXT BOOK 1.Ganesan S. Iyandurai N, Materials Science, KKS Publishers, Chennai, 2008 REFERENCES 1 . Jayakumar S, Materials Science, RK Publishers, Coimbatore, 2004 2. William D Callister Jr, Materials Science and Engineering An Introduction, John Wiley and sons Inc., 6th edition, New York, 2003 3. James F Shackelford, S Introduction to materials Science for Engineers, 6th Edition, Macmillan Publishing Company, New York, 2004
43
08S204 ENVIRONMENTAL SCIENCE AND ENGINEERING

[COMMON TO MECH, EEE, ECE, PROD, EIE, CSE, IT & IBT]
L 3
T 0
P 0
C 3
ENVIRONMENTAL RESOURCES (09) Forest resources- importance, deforestation- Water resources- anomalous properties of water, hydrological cycle- Food resources-effects of modern agriculture, fertilizers, pesticides-Land resources-causes and effects land degradation, desertification -Energy resources-renewable energy: wind, solar, geothermal, tidal, OTEC and nuclear. ECOSYSTEM AND BIODIVERSITY (09) Environment-biotic and abiotic Ecosystem-food chain, trophic levels- Energy flow in ecosystem, ecological pyramids- Ecological succession, types- Bio diversity, types, values of bio diversity, hot spots of bio diversity, threats to bio diversity, endangered and endemic species, conservation of bio diversity. ENVIRONMENTAL POLLUTION (09) Air pollution-classification of air pollutants gaseous, particulates - Sources effects and control of gaseous pollutants,SO2, NO2, H2S, CO, CO2 and particulates - Control methods-cyclone separator, electrostatic precipitator, catalytic combustion- Water pollution-classification of water pollutantsInorganic pollutants, sources effects and control heavy metals- Organic pollutants, oxygen demanding wastes, aerobic and anaerobic decomposition, BOD and COD and experimental determination of BOD only, treatment of domestic wastes- Noise pollution-sources, effects, decibel scale. ENVIRONMENTAL THREATS (09) Stratosphere, troposphere, composition and activities Acid rain, green house effect and global warming, ozone layer depletion, photo chemical smog, eutrophication, bio amplification - Disaster management-origin, effects and management of earth quake and floods- Solid waste managementsolid wastes, classification, origin, effects- Treatment methods-composting, sanitary land fillingDestructive methods-incineration, pyrolysis, recycling and reuse, co-disposal. SOCIAL ISSUES AND ENVIRONMENT (09) From unsustainable to sustainable development, objectives and ways of achieving it- Urban problem related to energy, energy conservation- Water conservation and management, rain water harvesting, watershed management- Waste land reclamation Environmental ethics- Consumerism- - Human population, exponential and logistic growth, variation in population among countries, population explosion, population policy, family welfare-programme and population control methods- HIV and AIDS. TOTAL : 45 Hours TEXT BOOKS 1. Elements of Environmental Science and Engineering, P.Meenakshi, Prentice- Hall of India, New Delhi, 2005. 2. Text Book of Environmental Chemistry and Pollution Control, S.S.Dara, S.Chand & Co., New Delhi, 2002. REFERENCES 1. Introduction to Environmental Engineering & Science, Gilbert masters, Prentice-Hall of India,New Delhi, 2004. 2. Environmental Science, Elden D. Enger, Bradley F. Smith, WCB McGraw Hill (VI Edn.).
44
08S205 BASICS OF ELECTRICAL AND ELECTRONICS ENGINEERING

[COMMON TO CSE & IT]
L 4
T 0
P 0
C 4
FUNDAMENTALS OF DC AND AC CIRCUITS
(12)
Fundamentals of DC circuits: Ohms law, Kirchhoffs law, Simple resistive circuits Effect of series and parallel resistances Mesh and Nodal analysis. Fundamentals of AC circuits: RMS and Average values of sine wave, Form factor, Peak factor. Single phase AC circuits Impedance, Power and Power Factor RL, RC, RLC circuits - Simple AC circuits. FUNDAMENTALS OF MAGNETIC CIRCUITS (12)
Ohms law of magnetic circuit, Simple and composite magnetic circuits, Effect of air gap leakage factor fringing effect Simple problems. Faradays law of electromagnetic induction Self and Mutually induced EMF Statically and Dynamically induced EMF. DC MACHINES AND TRANSFORMERS (12)
Electrical machines: Construction, Principle of Operation, Basic Equations and Applications of DC Generators, DC Motors, Single Phase Transformer, Induction Motors and Stepper Motors. INTRODUCTION TO SEMICONDUCTORS AND DIODES (12)
Semiconductors N-Type and P-Type Construction and static characteristics of Junction diode. Power Supplies: Half Wave and Full Wave Rectifiers, Voltage Regulator, Zener Regulator, Filters Voltage Multiplier Introduction to SMPS and UPS. TRANSISTORS-INTRODUCTION TO SMALL SIGNAL AMPLIFIER (12)
Transistor Types Transistor Characteristic Curve Transistor as Switch Measuring gain Amplification -Common Emitter Amplifier Stabilizing the Amplifier -Field effect transistors, Junction field effect transistor - N-Channel and P-Channel JFET, principle of working of JFET and MOSFET - characteristics, UJT and its characteristics. TOTAL: 60 Hours TEXT BOOK 1. Edward Hughes, I Mackenzie Smith, Electrical and Electronic Technology, 8th Edition, Pearson Education 2003. REFERENCES 1. Prem Kumar and Arumugam, Introduction to citcuit analysis, Khanna Publishers. 2. B.L.Theraja, Electrical Technology - Vol I&II Nirja construction and development company, New Delhi. 3. Charles A Schuler, Electronics Principles and Applications, 6th edition, Mc-Graw Hill, 2003.
45
08S206 OBJECT ORIENTED PROGRAMMING AND C++

L 3
T 1
P 0
C 4
INTRODUCTION TO OBJECT ORIENTED METHODOLOGY (09) Overview of object-oriented systems development-Object basics: object oriented philosophy, Attributes, object behavior and methods, Encapsulation and information hiding, Class hierarchy, Polymorphism, Object relationships and associations, Aggregations and containment - Objectoriented systems development life cycle-Object-oriented methodologies: Rumbaugh approach, Booch methodology, Jacobson methodologies, Patterns, Frameworks, Unified approach. UNIFIED MODELING LANGUAGE AND OBJECT ORIENTED ANALYSIS (09) Unified Modeling Language: Static and dynamic models, UML Diagram, UML Class diagram, Use case diagram, UML Dynamic Modeling, Model management, UML extensibility, UML Meta model Object Oriented Analysis Process -Object Analysis: Classifications theory, Approaches for identifying classes, Noun Phrase Approach, Common class Patterns Approach, Use case driven approach, Classes, Responsibilities and Collaborators, Naming classes. OBJECT IDENTIFICATION AND DESIGN PROCESS (09) Identifying Object Relationships, Attributes and Methods: Associations, Super-sub class relationships, Aggregation, class responsibility, Defining attributes and methods for ViaNet Bank Objects, Object responsibility-The object oriented design process and design axioms: design process, axioms, Corollaries, Design patterns- Designing Classes design philosophy, Object constraint language, Refining attributes, Designing methods and protocols, Packages and managing classes. BASICS OF C++ PROGRAMMING (09) An overview of C++- Classes and objects: Friend functions, Friend classes, Inline functions, Parameterized constructors, Static class members, Nested and local classes- Arrays, Pointers, References, Dynamic allocation operators-Function overloading, Copy constructors and default arguments-Operator overloading: Overloading with operator function, Overloading new, delete, special operators and comma operators-Inheritance POLIMORPHISM, TEMPLATES, EXCEPTION HANDLING AND I/O (09) Virtual functions, Pure virtual functions, Early Vs Late binding- Templates: Generic functions, Generic Classes-Exception handling: Fundamentals, derived class exceptions, options uncaught_exception(), terminate() and unexpected() functions -C++ I/O System Basics:++ Stream Classes, Formatted I/O, Overloading << and >> operators-File I/O: Opening ,Closing ,Reading and Writing files, Unformatted Binary I/O. LECTURE: 45 TUTORIAL: 15 TOTAL: 60 Hours TEXT BOOKS 1. Ali Bahrami, Object oriented Systems Development Using the Unified Modeling language , McGraw-Hill, 1999. 2. Herbert Schildt, The Complete Reference C++ , Tata Mc Graw-Hill Pub.Co.Ltd., Fourth edition, 2003. REFERENCES 1. Stanley B.Lippman Josee Lajoie, Barbara E.Moo, C++ Primer,4 th Edition, Addison Wesley, 2005. 2. VenuGopal K.R., Rajkumar, RaviShankar .T, Mastering C++ , Tata McGraw Hill Publishing Company Ltd., 1999
46
08S207 ENGINEERING GRAPHICS

[COMMON TO CIVIL, MECH, EEE, ECE, PROD, EIE, CSE & IT)
L 2
T 0
P 3
C 4
OBJECTIVE To develop graphic skills for communicating concepts, ideas and designing of engineering products and to give exposure to standards relating to technical drawings. CONCEPTS AND CONVENTIONS (Not for Examination) (06) Importance of Engineering Drawing- Visualization, Communication, Documentation B.I.S Conventions Drafting tools (construction of curves like ellipse, parabola, cycloid and involute concept of free hand sketching.) ORTHOGRAPHIC PROJECTIONS Introduction to Orthographic Projection Conversion of pictorial views to orthographic views. Projection of solids(inclined to one plane only) Auxiliary projections. (09)
SECTION OF SOLIDS AND DEVELOPMENT (09) Section of solids when the axis of the solid is vertical and cutting plane inclined to one plane. Development of surfaces (Solids and models) INTERPENETRATION OF SOLIDS Cylinder and cylinder, cone and cylinder only. PICTORIAL VIEWS Isometric projections- Perspective projections oblique projection (Simple objects and combination of simple objects) Conversion of orthographic views to pictorial views(simple objects). FREE HAND SKETCHING OF BASIC MACHINE COMPONENTS & THEIR APPLICATION (06)
(12)
(12)
Rivet Head, Riveted Joints, Keys, Cotters, Couplings, Stuffing Box, Cotter joint, Knuckle joint and Plummer block COMPUTER GRAPHICS (21) Computer Aided Drafting and dimensioning, To create 2D drawings for machine components, To create 3D Model for simple machine components, To generate 2D drawing from 3D models LECTURE: 30 PRACTICAL: 45 TOTAL: 75 Hours REFERENCES 1. K.Venugopal, Engineering Graphics, New Age International (P) Limited, 2007 2. Dhananjay.A.Jolhe, Engineering Drawing,Tata McGraw Hill Publishing Co.,2007 3. K.V.Nataraajan A text book of Engineering Graphics, Dhanalakshmi Publishers, Chennai, 2006 4. M.B.Shah and B.C.Rana, Engineering Drawing, Pearson Education, 2005 5. Luzadder and Duff, Fundamentals of Engineering Drawing Prentice Hall of India Pvt Ltd, XI Edition- 2001 6. K.R.Gopala Krishnan Machine Drawing, Subhas Publishers, 1995.
47
08S208 OBJECT ORIENTED PROGRAMMING LABORATORY L 0 LIST OF EXPERIMENTS Classes and Objects Arrays, Structures and Functions Inheritance Operator Overloading Virtual Functions Pointers and Templates Files and Streams C++ Graphics T 0 P 3 C 2
TOTAL: 45 Hours
48
08S3Z1 ENGINEERING MATHEMATICS III

L 3
T 1
P 0
C 4
PARTIAL DIFFERENTIAL EQUATIONS (09) Formation of PDE by elimination arbitrary constants and functions Solutions of standard types of first order equations Lagranges equation Linear partial differential equations of second and higher order with constant coefficients. FOURIER SERIES (09) Dirichlets Conditions General Fourier Series Half range Sine and Cosine series Parsevals Identity Harmonic Analysis. FOURIER TRANSFORMS (09) Statement of Fourier integral Theorem Fourier transform Fourier Sine and Cosine Transforms Properties Transforms of Simple functions, Convolution Theorem Parsevals Identity Finite Fourier transforms. BOUNDARY VALUE PROBLEMS (09) Method of separation of variables One dimensional wave equation One dimensional heat equation Steady state conditions Zero and non-zero boundary conditions Fourier series solution. Z TRANSFORMS (09) Z TransformsElementary properties Inverse Z-Transforms Initial and Final value theorems Convolution theorem Formation of difference equations Solution to difference equations using Z-transform. LECTURE: 45 TUTORIAL: 15 TOTAL: 60 Hours TEXT BOOK 1. Kandasamy.P, Thilagavathy.K, and Gunavathy.K, Engineering Mathematics , Vol I,II & III, S.Chand & Co., Ram Nagar, New Delhi, 2007. REFERENCES 1. Veerarajan.T, Engineering Mathematics for First Year and for Third Semester, Tata McGraw Hill Publishing Co., New Delhi, 2007. 2. Venkataraman.M.K, Engineering Mathematics Vol I,II & IIIA, The National Publishing Company, Chennai, 2006. 3. Grewal.B.S, Engineering Mathematics Khanna Publishers, New Delhi, 2007.
49
08S302 DISCRETE MATHEMATICS

L 3
T 1
P 0
C 4
MATHEMATICAL LOGIC (09) Statements and Notations, Connectives, Normal Forms, The theory of Inference for the statement calculus, Predicate Calculus, Inference theory of the predicate calculus. SET THEORY (09) Basic Concepts of set theory, Representation of Discrete Structures, Relations and Ordering, Functions, Natural Numbers, Recursion, Recursion in mechanical theorem proving. ALGEBRAIC STRUCTURES (09) Algebraic Systems, Semigroups and Monoids, Grammars and Languages, Polish Expressions and their compilation, Groups, The application of residue arithmetic to computers, Group Codes. LATTICES AND BOOLEAN ALGEBRA (09) Lattices and partially ordered sets, Boolean Algebra, Boolean Functions, Representation and Minimization of Boolean Functions, Design Examples using Boolean Algebra, Finite State machines. GRAPH THEORY (09) Basic concepts of Graph theory, Storage representation and Manipulation of graphs, Simple precedence grammars, PERT and related techniques, Introduction to Computability Theory. LECTURE: 45 TUTORIAL: 15 TOTAL: 60 Hours TEXT BOOK 1. Tremblay.J.P and Manohar.R, Discrete Mathematical Structures with Applications to Computer Science , Tata Mc-Graw Hill, Fourth Reprint 2001. REFERENCES 1. Liu C.L, Elements of Discrete Mathematics , Mc-Graw Hill International, 2nd Edition, 2000. 2. Kenneth H. Rosen, Discrete Mathematics and its Applications , Mc-Graw Hill Company, 2006.
50
08S303 DATABASE SYSTEMS

L 3
T 0
P 0
C 3
INTRODUCTION (09) Databases and users Advantages of DBMS Approach- Database applications- Database systemsconcepts and architectures- Data modeling using ER model -File organizations and indexes. RELATIONAL MODEL (09) Relational Mode and constraints- relational Algebra and calculus- relational database design by ER /EER to relational mapping SQL: schema definition, basic constraints, and queries. DATABASE DESIGN THEORY AND METHODOLOGY (09) Informal design guide lines- Functional Dependencies - Normal forms based on Primary keys Boyce codd form Properties of relational decompositions-Multi valued Dependencies and fourth Normal form-Join dependencies and fifth Normal form- Query processing and optimization. TRANSACTION PROCESSING (09) Transaction Processing- system Concepts-Schedules - Concurrency Control Techniques- Database Recovery Techniques- Database security and Authentication. ADVANCED DATABASE CONCEPTS (09) Object databases - Active Database Concepts-Temporal Database Concepts- multimedia Databases- Deductive Databases- XML and internet databases-Mobile Database- GIS- Genome Data Management. LECTURE: 45 TUTORIAL: 0 TOTAL: 45 TEXT BOOK 1. Ramez Elmasri, Shamkant B.Navathe, Fundamentals of Data Base Systems , Fourth Edition, Pearson Eduction,2004. REFERENCES 1. Abraham Silberschatz Henry F. Korth & Sudharsan.S, Database System Concepts , Fourth edition, Tata Mc-Graw Hill,2002. 2. Date.C.J, An Introduction to Database Systems , Seventh Edition Addison Wesley,2000. Hours
51
08S304 DIGITAL SYSTEMS

L 3
T 1
P 0
C 4
BOOLEAN ALGEBRA AND LOGIC GATES (09) Binary Systems. Boolean Algebra and Logic gates Boolean functions - canonical and Standard Forms- Digital Logic gates Integrated circuits. Gate level minimization Map methods- NAND and NOR Implementation Hardware Description Language. COMBINATIONAL LOGIC (09) Combinational circuits- Analysis and Design Procedure- Binary adder subtractor- Decimal adder Binary multiplier Magnitude comparator Decoders- Encoders- Multiplexers- HDL for Combinational Circuits. SYNCHRONOUS AND ASYNCHRONOUS SEQUENTIAL LOGIC (09) Sequential circuits- latches Flip flops Analysis of Clocked Sequential Circuits HDL for sequential Circuits- State Reduction and Assignment- Design Procedure. Asynchronous CircuitsAnalysis Procedure- Circuits with Latches Reduction of State Flow Tables Race Free State Assignment Hazards- Design Example. REGISTERS , COUNTERS AND MEMORY (09) Registers, Shift Registers, Ripple Counters, Synchronous Counters, HDL for Registers and Counters, Random access memory, Memory Decoding , Error Detection and correction, Read only Memory, Programmable Logic Array. Register Transfer Level introduction , RTL in HDL, Algorithmic State Machines, Binary Multiplier, HDL for ASM and Binary Multiplier. DIGITAL INTEGARTED CIRCUITS (09) Bipolar Transistor Characteristics, RTL and DTL Circuits, Transistor Transistor Logic (TTL) Emitter Coupled Logic (ECL)- Metal Oxide Semiconductor (MOS) Complementary MOS (CMOS) CMOS Transmission Gate circuits- Switch Lever Modeling with HDL. LECTURE : 45 TUTORIAL : 15 TOTAL : 60 Hours TEXT BOOK 1. Morris Mano , Digital Design Prentice Hall of India Private Ltd, 3d edition, 2002. REFERENCES 1. Bhasker.J, A VHDL Primer Prentice Hall India, 2003. 2. Charles H.Roth, Fundamentals of Logic Design , Fourth Edition, Jaico Publishing House, 2000.
52
08S305 DATA STRUCTURES AND ALGORITHMS I

L 3
T 0
P 0
C 3
INTRODUCTION (09) Structure and problem solving Algorithmic notation Introduction to algorithm analysis for time and space requirements Primitive data structures. REPRESENTATION AND MANIPULATION OF STRINGS (09) Definitions and concepts String manipulation and pattern matching Markov algorithms Primitive and composite functions Grammars Storage representation of strings String manipulation applications. LINEAR DATA STRUCTURES SEQUENTIAL STORAGE REPRESENTATION (09) Storage structures for arrays Structures and arrays of structures Stacks Applications of stacks Queues- Priority queues. LINKED STORAGE REPRESENTATION (09) Pointers and linked allocation Linked linear lists Operations Circularly and doubly linked list Applications Associative lists. NON-LINEAR DATA STRUCTURES-TREES (09) Trees Definitions and concepts Operations Storage representation and manipulation of binary trees Conversion of general trees to binary trees Sequential and other representation of trees Applications of trees. GRAPHS- Multilinked structures Graphs and their representations Applications of graphs Dynamic storage Management. Garbage Collection, Compaction. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. Jean-Paul Tremblay & Paul G Sorenson, An Introduction to Data Structures with Applications , Tata McGraw Hill publishing Company, 2007. REFERENCES 1. Sartaj Sahni, Data Structures, Algorithms and Applications in C++ , McGraw Hill, 1998 2. Lengsam.Y, Augenstein.M.J, and Tanenbaum.A.M, Data Structures using C , Pearson Education Asia, 2004.
53
08S306 JAVA PROGRAMMING

L 3 FUNDAMENTALS OF JAVA PROGRAMMING
T 0
P 0
C 3
(09) History and Evolution of Java, Overview of java, Operators, Control Structures, Methods, Classes and Objects, Inheritance, Packages and Interfaces, Exception Handling, Multi threaded Programming, Enumeration, Auto boxing, Annotations. I/O AND UTILITIES (09) I/O, applets and other topics, Generics, String Handling, Exploring java.lang., java.util part 1:The collections Frame work, java.util part 2:More utility classes, Input/Output: Exploring java.io. NETWORKING, APPLETS AND EVENT HANDLING (09) Networking, The Applet class, Event Handling, Introducing the AWT: working with windows, graphics and text, Using AWT controls, Layout Manager and menus. ADVANCED JAVA (09) Imaging Creating, loading and displaying, Image observer, Double buffering, Media tracker, Image producer, consumer, filters, animation, Remote Method Invocation, Java Database Connectivity. SOFTWARE DEVELOPMENT USING JAVA (09) Javabeans, Introducing and exploring Swings, Servlets. Case Study: Applying Java and Java Enterprise Applications. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. Herbert Schildt, Java 2: The Complete Reference , TataMcGrawHill, Seventh Edition, 2007. REFERENCES 1. Deitel .H.M and Deitel.P.J, Java: How to Program , Pearson Education Asia, International Sixth Edition 2004. 2. Lay.S & Horstmann Gary Cornell, Core Java Vol I , The Sun Microsystems & press Java Series, Seventh Edition, 2004. 3. Lay.S & Horstmann Gary Cornell, Core Java Vol II , The Sun Microsystems & press Java Series, Eighth Edition, 2008.
54
08S307 INTEGRATED CIRCUITS LAB

L 0 LIST OF EXPERIMENTS 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. Verification of Boolean theorems using digital logic gates
T 0
P 3
C 2
Design and implementation of combinational circuits using basic gates for arbitrary functions, code converters Design and implementation of 4-bit binary adder / subtractor using basic gates and MSI devices Design and implementation of parity generator / checker using basic gates and MSI devices Design and implementation of magnitude comparator Design and implementation of application using multiplexers Design and implementation of Shift registers Design and implementation of Synchronous counters Design of Encoders, Decoders Design and Implementation of Asynchronous Counters Coding combinational circuits using Hardware Description Language (HDL software required) Coding sequential circuits using HDL (HDL software required) TOTAL: 45 Hours
55
08S308 JAVA PROGRAMMING AND DATA STRUCTURES LAB

L 0 LIST OF EXPERIMENTS JAVA LAB 1. 2. 3. 4. 5. 6. 7. 8. Implementation of inheritance and interfaces Implementation of multithreading and Exception Handling Applet, AWT programming and Event Handling Program for network connection and monitoring Program for connecting to a database and database manipulation RMI Implementation and Servlet programming Software development using Java Case Study
T 0
P 3
C 2
DATA STRUCTURES LAB (To be implemented in C++) 1. 2. 3. 4. 5. 6. 7. 8. String manipulators and pattern matching Stack and Queue operations Application of recursion Conversion: Infix to polish, polish to code Linked list: Linear list, Circularly linked list, Doubly linked list Polynomial manipulations Trees: Operations on binary tree Application on graphs TOTAL: 45 Hours
56
08S401 NUMERICAL METHODS

[COMMON TO CIVIL,EEE,EIE,CSE & IT]
L 3
T 1
P 0
C 4
SOLUTION OF EQUATIONS AND EIGEN VALUE PROBLEMS (09) Iterative Method Newton Raphson Method for Single Variable and for Simultaneous Equations with Two Variables Solutions of Linear System by Gaussian, Gauss-Jordan, Croutes and Gauss Seidel Methods Ralaxation Method Eigen Value of a Matrix by Power Method. INTERPOLATION (09) Operators Relation between the Operators Newtons Divided Difference Formula Langranges and Hermites Polynomials Newton Forward and Backward Difference Formulae Sterlings and Bessels Central Difference Formulae. NUMERICAL DIFFERENTIATION AND INTEGRATION (09) Numerical Differentiation with Interpolation Polynomials Numerical Integration by Trapezoidal and Simpsons (Both 1/3rd and 3/8th) Rules Two and Three Point Gaussian Quadrature Formula Double Integrals using Trapezoidal and Simpsons Rules Difference Equation. INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL EQUATIONS (09) Single Step Method Taylor Series, Euler and Modified Euler, Runge-Kutta Method of Order Four for First Order Differential Equation Multistep Methods Milne and Adams Bashforth Predictor and Corrector Methods. BOUNDARY VALUE PROBLEMS FOR ORDINARY AND PARTIAL (09) DIFFERENTIAL EQUATIONS Finite Difference Solutions for the Second Order Ordinary Differential Equations Finite Difference Solutions for One Dimensional Heat Equation (Both Implicit and Explicit) One-Dimensional Wave Equation and Two Dimensional Laplace and Poisson Equation. LECTURE: 45 TUTORIAL: 15 TOTAL: 60 Hours TEXT BOOK 1. Kandasamy, P., Thilagavathy, K. and Gunavathy, K., Numerical Methods , S.Chand Co. Ltd., New Delhi, 2003. REFERENCES 1. Veerarajan.T and Ramachandran.T, Numerical Methods with Programming in C Tata Mc-Graw Hill Publishing Co., New Delhi, 2007. 2. Balagurusamy, E., Numerical Methods , Tata McGraw-Hill Publishing Co., New Delhi, 1999. Reprint. 2007. 3. Grewal.B.S, and Grewal.J.S, Numerical Methods in Engineering and Science , Khanna Publishers, New Delhi, 1999. 4. Gerald, C.F, and Wheatley, P.O, Applied Numerical Analysis , Fifth Edition, Addison Wesley, Singapore, 1998. 5. Sastry.S.S, Introductory Methods of Numerical Analysis , Third Edition, Prentice Hall of India, New Delhi,1998.
57
08S402 COMPUTER ARCHITECTURE

L 3
T 1
P 0
C 4
BASIC COMPUTER ORGANISATION AND DESIGN (09) Register Transfer Bus and Memory Transfers, Arithmetic, Logic and Shift Micro Operations Arithmetic Logical Shift Unit.: Instruction Codes Computer Registers and Instructions Timing and Control Instruction Cycle Memory-Reference, Input/Output and Interrupt Instructions Design of Basic Computer and Accumulator Logic. PROGRAMMING THE BASIC COMPUTER (09) Machine and Assembly Language Assembler Program Loops Programming Arithmetic and Logic Operations Subroutines Input/Output Programming. Addition, Subtraction, Multiplication and Division Algorithms Floating Point and Decimal Arithmetic Operations. MICROPROGRAMMED CONTROL & CENTRAL PROCESSING UNIT (09) Control Memory Address Sequencing Micro Program Example Design of Control Unit. General Register, Stack Organization, Instruction Formats, Addressing Modes Data Transfer and Manipulation Program Control RISC. INPUT / OUTPUT AND MEMORY ORGANIZATION (09) Peripheral Devices Input/Output Interface Asynchronous Data Transfer Modes of Transfer Priority Interrupt DMA IOP Serial Communication. Memory Hierarchy Main, Auxiliary, Associative, Cache and Virtual Memories Memory Management Hardware. PIPELINE, VECTOR PROCESSING AND MULTI PROCESSORS (09) Parallel Processing Arithmetic, Instruction and RISC Pipelines Vector Processing Array Processors. Characteristics Inter-Connection Structures Inter Processor Arbitration, Communication and Synchronization Cache Coherence. LECTURE : 45 TUTORIAL : 15 TOTAL : 60 Hours TEXT BOOK 1. Morris Mano.M, Computer System Architecture , Printice Hall of India, Third Edition, 2008.
REFERENCE 1. John P.Hayes, Computer Architecture and Organization Mc-Graw Hill International, Third Edition, 1998.
58
08S403 MICROPROCESSORS, MICROCONTROLLER AND APPLICATIONS

L 3
T 0
P 0
C 3
8 BIT MICROPROCESSOR (09) 8085 architecture- Timing diagrams ROM/ RAM Interfacing Decoding of memory addresses Interrupts Vector interrupts ISS - instruction set- Programming with 8085. 16 BIT MICROPROCESSOR (09) Architecture of 8086 8086 in MIN/ MAX mode Addressing modes- Instruction set - Programming with 8086. PERIPHERALS AND INTERFACING WITH 8085 (09) Serial and parallel I/O (8251 and 8255) Programmable DMA controller (8257) Programmable interrupt controller (8259) Keyboard and Display controller (8279 ) - Timer (8253) - ADC / DAC interfacing. MICROPROCESSOR BASED APPLICATIONS (09) Interfacing scanned multiplexed displays and Liquid crystal displays Interfacing a matrix keyboard Temperature controller - Stepper motor control Traffic light control Robotics and Embedded Control . MICROCONTROLLER (09) INTEL 8051 / 8031 Architecture 8051 Microcontroller hardware Ports and Circuits External memory Counter and timers Serial data I/O Interrupts Instruction set - Programming examplesApplications of 8051. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOKS 1. Ramesh S.Gaonkar, Microprocessor - Architecture, Programming and Applications with the 8085 , Penram International publishing private limited, fifth edition, 2002. 2. Douglas V.Hall, Microprocessors and Interfacing: Programming and Hardware , Tata McGraw Hill, Third edition, 2006. 3. Barrey B.Brey, The INTEL Microprocessor 8086/8088,80186,286,386,486, Pentium and Pentium Pro processor Architecture , Programming and Interfacing , Pearson Education Asia , 1998. REFERENCES 1. Kenneth J Ayala , The 8051 Microcontroller, Architecture, Programming and Applications , Penram International Publishing (India) 1996. 2. Ray.A.K. & Bhurchandi.K.M., Advanced Microprocessors and Peripherals Architectures, Programming and Interfacing , Tata Mc-Graw Hill, 2002 reprint. 3. Myke Predko Programming and Customizing the 8051 Microcontroller , Tata McGrawHill Edition , 1999 4. Mohamed Ali Mazidi, Janice Gillispie Mazidi, The 8051 Microcontroller and Embedded Systems , Pearson education, 2004.
59
08S404 COMMUNICATION ENGINEERING L 3 T 0 P 0 C 3
MODULATION SYSTEMS (09) Modulation Need Types Analog Modulation AM FM Modulation and Demodulation Comparison Receivers TRF Super heterodyne receiver FM Receivers (Block Diagram Only) TRANSMISSION MEDIUM (09) Transmission lines Types, equivalent circuit, losses, standing waves, impedance matching, bandwidth; radio propagation Ground wave and space wave propagation, critical frequency, maximum usable frequency, path loss, white Gaussian noise. DIGITAL COMMUNICATION (09) Time Division Multiplexing, Digital T-carrier System Pulse code modulation Digital radio system. Digital modulation: Frequency and phase shift keying Modulator and demodulator, bit error rate calculation. DATA COMMUNICATION AND NETWORK PROTOCOL (09) Data Communication codes, error control. Serial and parallel interface, telephone network, data modem, ISDN, LAN, ISO-OSI seven layer architecture for WAN. SATELLITE AND OPTICAL FIBRE COMMUNICATIONS (09) Orbital satellites, geostationary satellites, look angles, satellite system link models, satellite system link equations; advantages of optical fibre communication Light propagation through fibre, fibre loss, light sources and detectors LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOKS 1 2 3 Wayne Tomasi, Electronic Communication Systems , Pearson Education,Third Edition, 2001. Anokh Singh, Principles of Communication Engineering S.Chand & Co., 1999. G. Kennedy, Electronic Communication Systems , McGraw Hill, 4th edition, 2002.
REFERENCES 1 2 3 Louis E. Frenzel, Principles of Electronics Communication Systems , Tata McGraw Hill, 3rd Edition, 2008. Miller, Modern Electronic Communication , Prentice Hall of India, 2003. Roy Blake, Electronic Communication Systems , Thomson Delmar, 2nd Edition, 2002.
60
08S405 SYSTEMS PROGRAMMING AND OPERATING SYSTEMS

L 3
T 0
P 0
C 3
SYSTEMS PROGRAMMING (09) Assemblers: Elements of Assembly Language Programming, A simple Assembly scheme, Pass structure of assemblers, design of a two pass assemblers, A single pass assembler for IBM PC, Macros and Macro processors: Macro definition and call, Macro Expansion, Nested macro calls, Advanced macro facilities, Design of a macro preprocessor, Linkers: relocation and linking concepts, Design of a linker, self-relocating programs, Linker for MS DOS, Linking for overlays, Loaders, software Tools: software tools for program development, editors, debug monitors, programming environments. OPERATING SYSTEMS (09) PROCESS MANAGEMENT: Process concepts, Asynchronous concurrent processes, concurrent programming, deadlock and indefinite postponement. STORAGE MANAGEMENT (09) Real storage: Storage organization, management, hierarchy, management strategies virtual storage organization: Evolution of storage organizations, virtual storage, Multilevel storage organization, Block mapping, paging, segmentation, virtual storage management: Strategies, page replacement strategies, locality, working sets, page fault frequency page replacement, demand paging, Antic, page release, page size. PROCESSOR MANAGEMENT (09) Job and processor scheduling: scheduling levels, objectives, criteria, Preemptive vs Non preemptive scheduling, The interval time or interrupting clock, priorities, deadline scheduling , FIFO, RR, quantum size, SJF, SRT, HRN, multilevel feedback queues ,Auxiliary storage management-Disk performance optimization, Networks and security Operating systems security. CASE STUDIES Case study: UNIX systems, MS-DOS, (09)
LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOKS 1 . 2 . Dhamdhere.D.M, System Programming & Operating Systems , Second edition, Tata Mc-Graw Hill, 1997 (710 pages) (Reprinted 1997, 1998). Deitel.H.M, Operating Systems , Second edition, Pearson Education Asia,2002.
REFERENCES 1 . 2 . Beck.L, System Software: An Introduction to System Programming , Pearson Education Asia, 1999. Silberchatz & Galvin , Operating System Concepts , Pearson Education Asia,1998.
61
08S406 DATA STRUCTURES AND ALGORITHMS II

L 3
T 0
P 0
C 3
INTERNAL SORTING AND SEARCHING TECHNIQUES (09) Selection Sort Bubble Sort - Merge Sorting - Tree Sort Partition-Exchange Sort Radix Sort Address Calculation Sort. Sequential Searching Binary Searching. TREE SEARCHING AND HASHING METHODS (09) Search Trees Height Balanced Trees 2-3 Trees, Lexicographic Search Trees, B-Trees-RedBlack Trees, Weight Balanced Trees Trie Structures. Hash functions, Collision Resolution Techniques, Graphs Algorithms- DFS on directed graphs, Strongly connected components of a directed graph, DFS on undirected graph, Prims minimum Spanning tree algorithm, Single source shortest paths, Krukskals Minimum Spanning tree algorithm FILE STRUCTURES (09) External and Intermediate Storage Devices Sequential Files in Structure and Processing Sorting on Disks Indexed Sequential Files Structure and Processing of Indexed Sequential Files Class Record Retrieval System Direct Files An On Line Banking System. EXTERNAL SEARCHING (09) Dynamic Hashing Techniques Linear and Virtual Hashing Multiple Key Access and Data Base Systems. ALGORITHM DESIGN METHODS (09) The Greedy Method: Scheduling Problem, Huffman Codes, Knapsack Problem Divide and Conquer: Merge Sort, Binary Search, Quick Sort. Dynamic Programming: Matrix Multiplication, Common Subsequence Problem Backtracking: 8 Queens Problem, Knapsack Problem Branch and Bound.-Game Playing. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOKS 1. 2. 3. 4. Jean-Paul Tremblay & Paul G Sorenson, An Introduction to Data Structures with Applications , Tata McGraw Hill publishing Book Company, 2007. Sartaj Sahni, Data Structures, Algorithms and Applications in C++ , McGraw Hill, 1998.(Chapters 13,14,10,16 and 17 only). Robert L.Kruse, Bruce P.Leuag & Clovis L.Tondo, Data structure and Program Design in C , Prentice Hall of India Private Ltd, 2002. Sara Baase, Allen Van Gelder, Computer Algorithms, Pearson Education, Third Edition ( Chapters 7 and 8 only)
REFERENCE 1. Donald E.Knuth , The Art of Computer Programming , Volume III (second Edition), Pearson Education Asia, 1999.
62
08S407 MICROPROCESSORS AND MICROCONTROLLERS LAB

L 0
T 0
P 3
C 2
LIST OF EXPERIMENTS 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. Programming with 8085 8-bit / 16-bit multiplication/division using repeated addition/subtraction and shifting & adding method Programming with 8085-code conversion, decimal arithmetic, bit manipulations Programming with 8085-matrix multiplication, floating point operations Programming with 8086 String manipulation, search, find and replace, copy operations, sorting (PC Required) Interfacing with 8085/8086 8255 PPI Interfacing with 8085/8086 8253 Timer Interfacing with 8085/8086 8279 Keyboard display controller Interfacing with 8085/8086 8251 Serial Interface 8051 Microcontroller based experiments Simple assembly language programs (cross assembler required) 8051 Microcontroller based experiments Simple control applications (cross assembler required)
TOTAL: 45 Hours
63
08S408
SYSTEMS PROGRAMMING, OPERATING SYSTEMS AND RDBMS LAB

L 0 LIST OF EXPERIMENTS
T 0
P 3
C 2
SYSTEMS PROGRAMMING To be Implemented in C Language 1. 2. 3. Design of single pass assembler Design of two pass assembler Simulation of Linker and Loader
OPERATING SYSTEMS 1. 2. 3. 4. 5. Implementation of Process Scheduling Illustrated of Inter Process Communication Strategies Deadlock Prevention & Avoidance Algorithms Virtual Memory: Paging and Segmentation Implementation of Page Replacement Algorithms
RDBMS 1. 2. 3 4. 5. 6. 7. Creation and Manipulation tables using DDL and DML Functions, Joins, Constraints in SQL Subqueries and Multiple queries in SQL Views in SQL Control Structures using PL/SQL Cursors Using PL/SQL Form Creation, creating alerts, creating LOVS, records, groups, Editors, Menus creation , Libraries, Built-in procedures, Program units, Report creation, Object oriented Programming
TOTAL: 45 Hours
64
08S501 PROBABILITY , RANDOM PROCESSES AND QUEUING THEORY
L 3
T 1
P 0
C 4
PROBABILITY AND RANDOM VARIABLES (09) Axioms of Probability - Conditional Probability - Total Probability - Bayes Theorem One Dimensional Random Variable Moments - Moment Generating Functions and their properties. (09) STANDARD DISTRIBUTIONS Geometric, Negative Binomial, Uniform, Exponential, Gamma, Weibull and Normal distributions Mean and Variance Application (Problems). TWO DIMENSIONAL RANDOM VARIABLES (09) Joint distributions- Marginal and conditional distributions- Covariance- Correlation and regressionCentral limit theorem Chebyeshevs inequality. RANDOM PROCESSES AND MARKOV CHAINS Classification- Stationary process- Markov process- Poisson process- Markov chains. (09)
QUEUING THEORY (09) Markovian models-M/M/1, M/M/C, finite and infinite capacity-M/M/ queues- Finite source modelM/G/1 queue (steady state solution only)- Pollaczek- Khintchine formula- Special cases (Derivations assumed) Applications. LECTURE : 45 TUTORIAL : 15 TOTAL : 60 Hours TEXT BOOK 1. Veerarajan., T., Probability, Statistics and Random Processes, Tata McGraw-Hill Publishing Company Ltd., New Delhi-2003.
REFERENCES 1. Ross. S., A first course in probability, Sixth Edition, Pearson Education, Delhi, 2002. 2. Medhi J., Stochastic Processes, New Age Publishers, New Delhi, 1994. (Chapters 2, 3 & 4). 3. Taha. H.A., Operations Research-An Introduction Seventh Edition, Pearson Education Edition Asia, New Delhi, 2002. 4. Allen. A.O., Probability, Statistics and Queuing Theory, Academic press, New Delhi,1981. 5. Gross. D and Harris. C.M., Fundamentals of Queuing theory, John Wiley and Sons,Second Edition, New York,1985. 6. P. Kandasamy, K. Thilagavathy and K. Gunavathy, Probability and Random Processes, S.Chand & Co.Ltd., New Delhi - 2003.
65
08S502 UNIX INTERNALS L 3 T 0 P 0 C 3
INTRODUCTION (09) Architecture of UNIX operating system - kernel data structures - system administration. BUFFER CACHE: Buffer headers structure of buffer pool retrieval of a buffer reading / writing disk blocks. INTERNAL REPRESENTATION OF FILES: Inodes structure of a regular file directories conversion of a path name to an inode super block inode assignment to a new file allocation of disk blocks other file types. (09) SYSTEM CALLS FOR THE FILE SYSTEM Open read write close LSEEK file creation creation of special files change directoryroot ownermode STAT and FSTAT Pipes dup mounting and unmounting file systems link unlink file system abstractions and maintenance. (09) THE STRUCTURE OF PROCESSES AND PROCESS CONTROL Process states and transitions layout of system memory the context of a process manipulation of the process address space SLEEP. PROCESS CONTROL: Process creation signals process termination awaiting process termination invoking other programs the user ID of a process changing the size of a process The shell system boot and the init process. (09) PROCESS SCHEDULING, MEMORY AND I/O SUBSYSTEM Process scheduling system calls for time clock. MEMORY MANAGEMENT POLICIES: Swapping demand paging. I/O SUBSYSTEM: Driver interfaces disk and terminal drivers streams. INTER PROCESS COMMUNICATION (09) Process tracing system V IPC - network communication sockets-Multi processor systemsDistributed UNIX systems. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. Maurice J Bach, The Design of the UNIX operating system, Pearson Education Asia, 2006. REFERENCES 1. Steve D. Pate, UNIX Internals, A Practical Approach, Addison Wesley, 1996. 2. Kenneth Rosen, Douglas Host, James Farber and Richard Rosinski, UNIX The Complete Reference, Tata McGraw-Hill Co. Ltd., 2002.
66
08S503 VISUAL PROGRAMMING L 3 T 0 P 0 C 3
WINDOWS PROGRAMMING (09) GUI concept - Windows environment a simple windows program windows and messages creating the window displaying the window message loop the window procedure message processing text output painting and repainting WM_DESTROY message Scroll Bars Keyboard Mouse Menus introduction to GDI device context basic drawing child window controls. (09) VISUAL BASIC PROGRAMMING IDE First Visual Basic Program - Introduction to Forms Intrinsic Controls working with Files Accessing databases with data control - Classes and Objects ADO Object Model. (09) VISUAL C++ PROGRAMMING Windows Programming Model - Application Framework MFC library Visual C++ Components Event Handling Mapping modes colors fonts Graphics Device Interface-modal and modeless dialog windows common controls bitmaps Windows Message Processing and Multithreading. (09) THE DOCUMENT AND VIEW ARCHITECTURE Menus Keyboard accelerators rich edit control toolbars status bars reusable frame window base class separating document from its view reading and writing SDI and MDI documents splitter window and multiple views creating DLLs dialog based applications- activeX and object linking and embedding(OLE). (09) ADVANCED CONCEPTS Database Management with Microsoft ODBC Structured Query Language MFC ODBC classes sample database applications filter and sort strings DAO concepts displaying database records in scrolling view Threading VC++ Networking issues Winsock WinInet building a web client Internet Information Server ISAPI server extension chat application playing and multimedia (sound and video) files. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOKS 1. 2. 3. Charles Petzold, Windows Programming, Microsoft press, 1996. Francesco Balena, Programming Microsoft Visual Basic6.0, Microsoft press, Indian Reprint, 2001. David J. Kruglinski, George Shepherd and Scot Wingo, Programming Visual C++, Microsoft press, 1999.
REFERENCES 1. 2. 3. 4. Steve Holtzner, Visual C++ 6 Programming, Wiley Dreamtech India Pvt. Ltd., 2003. Steven Holtzner Visual Basic 6 Black Book, Coriolis Group 1998. P.J. Deitel, H.M. Deitel, Visual Basic 2008 How to Program, Prentice Hall, 2008. P.J. Deitel, H.M. Deitel, Visual C++ 2008 How to Program, Second Edition, Prentice Hall, 2008.
67
08S504 EMBEDDED SYSTEM DESIGN USING C L 3 T 0 P 0 C 3
INTRODUCTION TO REAL-TIME OPERATING SYSTEMS (09) Survey of Software Architectures: Round robin, Round-Round with interrupts, Function-QueueScheduling Architectures, Real-Time Operating System Architectures-Foreground/Background Systems , Shared Resource, Multitasking, Preemptive and Non Preemptive Kernal, Priorities, Intertask Communication , Mailboxes, Queues, Interrupts. (09) DEVELOPMENT OF KEYBOARD, LED AND LCD MODULES Keyboard basics, Matrix keyboard scanning Algorithm, Matrix Keyboard Module, Interface functions. Multiplexed LED Display Module, Interface functions. Liquid Crystal Displays, Character LCD Modules, Interface Functions. (09) TIMER AND CLOCK DESIGN MODULES Clocks, Clock /Calendar Module, Interface functions for clock. Timer Manager Module, Timer Manager Module Interface functions. (09) DISCRETE AND ANALOG I/OS Discrete Inputs, Discrete Outputs, Discrete I/O Module. Fixed point addition, subtraction, Multiplication and division. Analog inputs, Analog Outputs, Analog I/O Module. Interface functions for Analog I/O, Module configuration. (09) ASYNCHRONOUS SERIAL COMMUNICATION MODULE Asynchronous Communication, RS-232C, RS-485, Sending and Receiving Data, Serial Ports on a PC , Low level PC Serial I/O Module, Buffered Serial I/O Module. PC Services. Note : Hands on project done with Embedded processors will be given due weigtage in the sessional marks LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOKS 1. David Simon, An Embedded Software Primer, Pearson Publication, 1999. (Unit 1) 2. Jean J Labrosse, Embedded Systems Building Blocks, CMP Books Publication, 2000. (Unit 2,3,4 and 5)
REFERENCES 1. Raj Kamal,Embedded Systems, Tata Mc Graw Hill ,2003.
68
08S505 THEORY OF COMPUTATION C 4 REGULAR EXPRESSION AND FINITE AUTOMATA (09) Regular Languages and Regular Expressions - Memory Required to Recognize a Language -Finite Automata - Distinguishing One String from Another - Unions, Intersections, and Complements. NONDETERMINISM AND KLEENES THEOREM, REGULAR AND NONREGULAR LANGUAGES Nondeterministic Finite Automata - Nondeterministic Finite Automata with -transitions -Kleenes Theorem. Criterion for Regularity- Minimal Finite Automata-Pumping Lemma for Regular Languages-Decision Problems- Regular Languages and Computers. CONTEXT FREE GRAMMARS, CONTEXT FREE AND NON CONTEXT (09) FREE LANGUAGES Examples and Definitions - Regular Grammars - Derivations and Ambiguity - Unambiguous CFG for Algebraic Expression - Simplified Forms and Normal Forms. Pumping Lemma and Context Free Languages-Intersections and Complements of Context Free Languages- Decisions Problems. PUSHDOWN AUTOMATA Introduction- Definition- Deterministic Pushdown Automata PDA corresponding to a Given CFGCFG Corresponding to a Given PDA- parsing. (09) TURING MACHINES Definitions and Examples- Computing Partial Functions with Turing Machines Combining Turing Machines-Variations of Turing Machines with Multitape TMs-Nondeterministic Turing MachinesUniversal Turing Machines-Models of Computations and the Church Turing Thesis RECURSIVELY ENUMERABLE LANGUAGES Recursively Enumerable and Recursive-Enumerating a Language More General GrammarsContext Sensitive Languages and the Chomsky hierarchy- Not all Languages and Recursively Enumerable. UNSOLVABLE PROBLEM (09) Non recursive Language and an Unsolvable Problems-Reducing One Problem to Another: The Halting Problem-Other Unsolvable Problems Involving TMs-Rices Theorem and More Unsolvable Problems-Posts Correspondence Problems-Unsolvable problems Involving Context-Free Languages. COMPUTABLE FUNCTIONS Primitive Recursive Functions-Primitive Recursive Predicates and Some Bounded Operationsunbounded Minimalizations and -Recursive Functions-Global Numbering-All Computable Functions Are -Recursive- nonnumeric Functions, and Other Approaches to Computability. MEASURING AND CLASSIFYING COMPLEXITY, TRACTABLE AND (09) INTRACTABLE PROBLEMS Growth rates of Functions-Time and Space Complexity of a Turing Machines-Complexity Classes. Tractable and Possibly Intractable Problems: P and NP-Polynomial Time Reductions and NP Completeness-Cooks Theorem- Other NP Complete Problems. LECTURE : 45 TUTORIAL : 15 TOTAL : 60 Hours TEXT BOOK 1. John C. Martin, Introduction to Languages and the Theory of Computation, Third Edition, Tata McGraw-Hill Publishing Company Limited, New Delhi, 2004. REFERENCES 1. John E. Hopcroft, Rajeev Motwani, Jeffey D. Ullman, Introduction to Automata Theory Languages, and Computations, Pearson Education Asia, 2002. 2. Mishra K L B and Chandrasekaran N, Theory of Computer Science, Automata Languages and Computation, Prentice Hall of India Pvt. Ltd., 1993. L 3 T 1 P 0
69
08S506 COMPUTER NETWORKS L 3 T 0 P 0 C 3
INTRODUCTION AND PHYSICAL LAYER (09) The uses of computer networks - Network hardware - Network software -Reference models Example of networks- Network standardization. The physical layer: The theoretical basis for data communication Guided Transmission media - Wireless transmission media. (09) THE DATA LINK LAYER The Data Link Layer: Data link layer design issues - Error detection and correction -Elementary data link protocols - Sliding window protocols - MAC protocols - Ethernet Wireless LANs Broadband wireless - Bluetooth. (09) THE NETWORK LAYER Network layer design issues - Routing algorithms: Flooding, Distance vector and Link state routing, Hierarchical routing, Multicasting and broadcasting - Congestion control algorithms Internetworking. (09) THE TRANSPORT LAYER Elements of Transport protocols Simple transport protocol - Internet transport protocols UDP, TCP - ATM protocols. THE APPLICATION LAYER Domain name system - Electronic mail - World Wide Web - Multimedia - Network Security. (09)
LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOKS 1. Andrew S. Tanenbaum, Computer networks , PHI, 4th edition 2008. REFERENCES 1. Larry L. Peterson and Bruce S. Davie, Computer Networks, A Systems Second Edition. Morgan Kaufmann Publishers Inc, 2000. 2. William Stallings, Data and computer communication, PHI, 2001. 3. Douglas E. comer, Internetworking with TCP/IP-Volume-I, PHI, 1997. Approach,
70
08S507 UNIX INTERNALS AND NETWORKING LAB L 0 LIST OF EXPERIMENTS T 0 P 3 C 2
UNIX INTERNALS LAB 1. Shell Programming 2. UNIX Command implementation 3. Implementation of system calls 4. Illustration of mutual exclusion 5. Implementation of deadlock detection, prevention and avoidance algorithms 6. Implementation of Inter process communication using message queues, pipes and sockets 7. Case study: implementation of kernel NETWORKING LAB 1. Implementation of ARP/RARP 2. Implementation of Distance vector and link state routing algorithms 3. Illustration of multicasting 4. Implementation of mail servers 5. Case Study: Study of CISCO Router
Total 45: Hours
71
08S508 VISUAL PROGRAMMING LAB L 0 LIST OF EXPERIMENTS T 0 P 3 C 2
VISUAL BASIC 1. 2. 3. 4. 5. 6. 7. 8. 9. Simple programs with control structures Adding menus to forms Creating dialog boxes with various options MDI Applications Writing code for various keyboard and mouse events OLE container control Simple programs with classes and object Data access through Data control and DAO Database access using OLEDB VISUAL C++ 1. 2. 3. 4. 5. 6. 7. 8. 9. Creating a simple windows program Creating applications with Application wizard Painting and Repainting, Scroll Bars Drawing in documents Working with MFC Creating simple SDI and MDI application Exception handling Loading-Editing and Adding resources- Linking resources to applications Drawing bitmaps
10. OLE, Threads, ActiveX 11. Displaying database records in scrolling view 12. Database applications with SQL Total 45: Hours
72
08S601 ARTIFICIAL INTELLIGENCE L 3 T 0 P 0 C 3
PROBLEMS AND SEARCH (09) Meaning of Artificial Intelligence- Level of the Model. Problems, Problem Spaces and Search: Production Systems- Problem characteristics. Heuristic Search Techniques: Hill Climbing- Best-first search- Problem reduction Constraint Satisfaction Means ends analysis. KNOWLEDGE REPRESENTATION (09) Knowledge Representation issues Using Predicate Logic Representing Knowledge using rules Symbolic Reasoning under uncertainty- Statistical Reasoning Weak Slot and Filler StructuresStrong Slot and Filler Structures. ADVANCED TOPICS (09) Game Playing Planning Understanding Natural Language Processing Parallel and Distributed AI- Learning Connectionist Models Common Sense. TOOLS FOR AI (09) Expert Systems Expert System Shells . Perception and Action Real-time Search PerceptionAction-Robot Architecture. Fuzzy Logic Systems Crisp sets Fuzzy sets-Fuzzy Logic ControlFuzzy Hedges- Neuro Fuzzy Systems. Genetic Algorithms-Significance of the Genetic OperatorsTermination Parameters-Niching and Speciation-Evolving Neural Networks- Ant Algorithms. ARTIFICIAL IMMUNE SYSTEMS & LANGUAGE OF ARTIFICIAL (09) INTELLIGENCE Phenomenon of Immunity Immunity and Infection- Innate Immune System- Adaptive Immune System-Recognition Clonal Selection Learning Immune Network Theory-other applications. Prolog Converting English to Prolog-Prolog terminology variables-Control Structures-Arithmetic Operators- Matching in Prolog-Backtracking Cuts Recursion Lists Dynamic Databases Input/Output and Streams. LECTURE: 45 TUTORIAL: 0 TOTAL: 45 Hours TEXT BOOK 1. Elaine Rich, Kevin Knight , Shivashankar.B.Nair, Artificial Intelligence, Tata Mc Graw Hill Publishing Company Limited. Third Edition , 2009. REFERENCES 1. Nils .J. Nilson , Artificial Intelligence- A New Synthesis, Elsevier Publication, Reprinted 2004. 2. George Luger, Artificial Intelligence, Structures and Strategies for Complex Problem Solving, Sixth Edition, Pearson Education, 2008.
73
08S602 SOFTWARE ENGINEERING L 3 THE SOFTWARE PROCESS Introduction-A Generic view of Process- Process Models-An Agile view of Process. T 0 P 0 C 3 (09)
SOFTWARE ENGINEERING PRACTICE (09) Software Engineering Practice- System Engineering- Requirements Engineering- Building the Analysis model- Design Engineering- Creating an Architectural design- Modeling component level Design- Performing User Interface Design- Testing Strategies- Testing Tactics- Product Metrics. APPLYING WEB ENGINEERING (09) Web Engineering- Initiating a WebApp Project- Analysis for WebApps- Design for WebAppsTesting for WebApps. (09) MANAGING SOFTWARE PROJECTS Project Management- Metrics for Process and project- Estimation- Project Scheduling- Risk Management- Quality Management- Chain Management. ADVANCED TOPICS IN SOFTWARE ENGINEERING Formal Methods- Cleanroom Software Engineering- Component Reengineering- The Road Ahead. Based (09) Development-
LECTURE : 45 TUTORIAL :0 TOTAL : 45 Hours TEXT BOOK 1. Roger Pressman. S, Software Engineering: A Practitioner's Approach, Sixth Edition, McGraw Hill, 2005. REFERENCES 1. Ian Sommerville, Software Engineering, Sixth Edition, Pearson Education Asia, 2003. 2. Richard E. Fairley, Principles of Software Engineering, Wiley Blackwell, 2009. 3. Shari Pfleeger, Joanne Atler, Software Engineering: Theory and Practice, Fourth Edition, Pearson Education, 2009.
74
08S603 DISTRIBUTED OPERATING SYSTEM L 3 T 0 P 0 C 3
INTRODUCTION (09) Introduction-Goals- hardware concepts- bus based multiprocessor- switched multiprocessor- bus based multi computer- software concepts- network operating systems- True distributed systemmultiprocessor time sharing system- design issues- transparency- flexibility- reliability- Performance and scalability. (09) COMMUNICATION Layered protocols- ATM networks- Client server model- remote procedure call- group communication. (09) SYNCHRONIZATION Clock synchronization- Mutual Exclusion- Election algorithms- Atomic transactions- DeadlocksThreads- System models- Processor Allocation- Scheduling- fault tolerance- Real time systems. DISTRIBUTED FILE SYSTEMS (09) Distributed file system design- implementation- file models- fault tolerance- file replicationmultimedia. (09) DISTRIBUTED SHARED MEMORY Page based distributed shared memory- shared variable distributed shared memory- distributed programming languages- applications- case studies. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. Andrew S Tanenbaum, Distributed Operating Systems, Pearson Education Asia, 2001. REFERENCES 1. Mukesh Singhal, Niranjan G. Shivaratri, Advanced Concepts in Operating Systems, Tata McGraw Hill, 21st Reprint 2008. 2. George Couloris, Jean Dollimore, Jim Kindberg, Distributed Systems: Concepts and Design, Fourth Edition, Addison Wesley, 2005.
75
08S604 COMPILER DESIGN L 3 T 0 P 0 C 3
INTRODUCTION TO COMPILING (09) Compilers analysis of the source program phases of a compiler cousins of the compiler grouping of phases compiler construction tools. LEXICAL ANALYSIS Role of the lexical analyzers input buffering specification of tokens recognition of tokens finite automata from a regular expression to an NFA design of a lexical analyzers generator optimization of DFA-based pattern matchers. SYNTAX ANALYSIS (09) Role of the parser context free grammar writing a grammar Top-down parsing Bottom-up parsing operator precedence parsing LR parsers using ambiguous grammar. (09) SYNTAX DIRECTED TRANSLATION Syntax directed definitions construction of syntax trees Bottom-up evaluation of S-attributed definitions L-attributed definitions Top-down translation. TYPE CHECKING Type systems specifications of simple type checker. RUN-TIME ENVIRONMENTS (09) Source language issues storage organization storage allocation strategies symbol tables. INTERMEDIATE CODE GENERATION Intermediate language declarations assignment statements Boolean expressions case statements back patching procedure calls. CODE GENERATION (09) Issues in the design of a code generator the target machine run-time storage management basic blocks and flow graphs next-use information a simple code generator register allocation and assignment the dag representation of basic blocks peep-hole optimization. CODE OPTIMIZATION Introduction the principal sources of optimization optimization of basic blocks. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. Alfred V. Aho, Ravi Sethi and Jeffrey D. Ullman, Compilers : Principles, Techniques and Tools, Pearson Education Asia , 2007. REFERENCES 1. Reinhard Wilhelm, Compiler Design, Addison Wesley , 1995. 2. Allen I. Holub Compiler Design in C, Prentice Hall of India, 2003.
76
08S605 OPEN SOURCE SYSTEMS L 3 T 0 P 0 C 3
INTRODUCTION (09) Overview of Free/Open Source Software - GNU/Linux OS installation - Basic shell commands - User and group management - file ownerships and permissions - PAM authentication - Introduction to common system configuration files & log files - Configuring networking - basics of TCP/IP networking and routing - connecting to the Internet. (09) CONFIGURATION Configuring additional hardware - Understanding the OS boot up process - Performing every day tasks using gnu/Linux - accessing the Internet, playing music, editing documents and spreadsheets, sending and receiving email, copy files from disks and over the network, playing games, writing CDs - X Window system configuration and utilities - Installing software - Setting up email servers, web servers, file services, proxy services and printer services. (09) SECURITY AND COMPILER Setting up a firewall - Using the GNU Compiler Collection Assembler - Understanding build systems - constructing make files and using make using autoconf and autogen to automatically generate make files tailored for different development environments - Using source code versioning and management tools - using CVS to manage source code revisions, patch & diff. GNU LIBRARIES (09) Understanding the GNU libraries and linker - linking against object archives and dynamic shared object libraries - generating linked binaries and libraries - Using the GNU debugging tools - memory debugging - Review of common programming practices and guidelines for GNU/Linux and FOSS. (09) X WINDOWS SERVER ARCHITECTURE Basics of the X Windows server architecture - Qt Programming - Gtk+ Programming - Python Programming - Programming GUI applications with localization support. Case study: Open source software development. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. Carla Schroder, Linux Cookbook, First Edition, O'Reilly Cookbooks Series, 2004. REFERENCES 1. Matt Welsh, Matthias Kalle Dalheimer, Terry Dawson, and Lar Kaufman, Running Linux, Fourth Edition, O'Reilly Publishers, 2002. 2. N. B. Venkateshwarlu (Ed), Introduction to Linux: Installation and Programming, B S Publishers; 2005. 3. Stefan Koch, Free/Open Source software development, IGP 2005.
77
08S606 FUNDAMENTALS OF DIGITAL SIGNAL PROCESSING L 3 T 1 P 0 C 4
(09) OVERVIEW OF SIGNALS AND SYSTEMS Basic elements of digital signal Processing Concept of frequency in continuous time and discrete time signals Discrete time signals. Discrete time systems Analysis of Linear time invariant systems Z transform Convolution and correlation. (09) FAST FOURIER TRANSFORMS Introduction to DFT Efficient computation of DFT Properties of DFT FFT algorithms Radix-2 and Radix-4 FFT algorithms Decimation in Time Decimation in Frequency algorithms Use of FFT algorithms in Linear Filtering and correlation. (09) OVERVIEW OF DIGITAL FILTERS Introduction to digital filters-Types of digital filters-FIR and IIR filters choosing between FIR and IIR filters-specification of the filter requirements coefficient calculation-Realization structures of FIR and IIR filters Digital Matched Filtering. DIGITAL SIGNAL PROCESSORS (09) Introduction computer Architecture for signal processing Harvard architecture Pipelining Hardware Multiplier Accumulator Special Instructions Replication On chip memory cache Extended parallelism SIMD, VLIW and static superscalar processing General purpose Digital Signal processors Fixed point Digital Signal Processors floating point Digital Signal Processors Selecting Digital Signal Processors - Architecture of TMS320C5X (09) REAL WORLD APPLICATIONS OF DSP AUDIO APPLICATIONS OF DSP: Digital Audio Mixing Speech Synthesis and Recognition CD Digital audio Systems. TELECOMMUNICATION APPLICATIONS OF DSP: Architecture Digital cellular Mobile Telephony set Top Box for Digital TV reception Adaptine Telephone echo cancellation. BIOMEDICAL APPLICATIONS OF DSP: Fetal ECG Monitoring DSP based closed loop controlled Anasthaesia - Detection of fetal heart beats during Labour. LECTURE : 45 TUTORIAL : 15 TOTAL : 60 Hours TEXT BOOKS 1. Emmanuel C. Ifeachor, Barrie W. Jervis, Digital Signal Processing A Practical Approach, Second Edition, Pearson Education, 2003. 2. M.H. Hayes, Digital Signal Processing, Tata McGraw Hill, 2007. REFERENCES 1. John G Proakis and Dimtris G Manolakis, Digital Signal Processing Principles, Algorithms and Application, Third Edition, PHI/Pearson Education, 2000. 2. Alan V Oppenheim, Ronald W Schafer and John R Buck, Discrete Time Signal Processing, Second Edition, PHI/Pearson Education, 2000. 3. B.Venkataramani, M.Bhaskar, Digital Signal Processing: Architecture, Programming and Applications, 10th reprint, Tata McGraw Hill Publishing Company Limited, 2007.
78
08S607 COMPILER DESIGN LAB L 0 LIST OF EXPERIMENTS 1. Implement a program for constructing NFA from a regular expression. 2. Implement a program for constructing DFA from a regular expression. 3. Implement a program to find leading and trailing of the given grammar. 4. Implement a program to compute FIRST and FOLLOW of non terminals. 5. Implement a program to remove left factoring and left recursion. 6. Implement a program for constructing Top down parsing table. 7. Implement a program to implement shift Reduce Parsing Algorithm. 8. Implement a program to implement Operator Precedence Parsing Algorithm. 9. Implement a program to find the closure of the given grammar. 10. Implement a program for constructing LR parsing table. 11. Implement a program to generate DAG for the given expression. 12. Implement a program to simulate the storage management. 13. Implement a program to implement a front end of compiler that generates the three address code for the given language. 14. Implement a program to implement a back end of compiler which takes the three address code and produces the 8086 assembly language instructions. Total : 45 Hours T 0 P 3 C 2
79
08S608 SOFTWARE ENGINEERING LAB L 0 LIST OF EXPERIMENTS 1. Reusable software resources 2. LOC based estimation 3. FP based estimation 4. The COCOMO model 5. Risk Identification 6. Risk Projection 7. Time line charts 8. Tracking the schedule 9. Quality Assurance 10. Reliability 11. Version control 12. Change Control 13. Data flow diagrams 14. Jackson system development Total : 45 Hours T 0 P 3 C 2
80
08S701 MANAGEMENT AND ECONOMICS L 3 T 0 P 0 C 3
BASIS OF MANAGEMENT THOUGHT (09) Evolution of Management, Management- Definition, Levels, Principles, Differences with administration, Roles of Managers, External Environment of Business, Social responsibility, Management Ethics. PLANNING, ORGANIZING AND STAFFING (09) Planning- Process, Types, Guidelines, Premises, Organizing-Nature, Purpose, Concepts-Delegation of authority, Departmentation, Staffing-Manpower Planning, Recruitment, Selection (Step only), Training Methods DIRECTING AND CONTROLLING (09) Leadership-Nature, Theories-trait Theory, Managerial Grid, Ohio State Leadership Theory, Fiedlers Contingency Model, Challenges to Leadership, motivation- Need Hierarchy, Two-Factor, Theory X and Y, ERG, Equity and Social Comparison Theory, Communication- Process, Barriers, Guidelines and Barriers for effective communication. MICRO ECONOMICS (09) Nature, Scope, Demand- Departments, Law of Demand, Exceptions, Elasticity, Supply,-Determinants, Law of supply, Elasticity, Cost concepts, run vs Long run cost relationship. MACRO ECONOMICS (09) Money- Nature, Functions, Inflation,- Causes, Types, Corrective Measures, Impact, Deflation, Functions of countrys Central Bank and Commercial banks, Global Trade, Foreign Exchange, Balance of Payments.
LECTURE : 45 TUTORIAL :0 TOTAL : 45 Hours TEXT BOOKS 1. Koontz, Essentials of Management, McGraw-Hill 2003. 2. Prasad L.M, Principles and Practice of Management, Sultan Chand and Sons, New Delhi, 2003. 3. Varsheney R.L., Maheshwary K.L., Managerial Economics, Sultan Chand and Sons, New Delhi, 2003. REFERENCES 1. Samuelson P.A., Novohlans W.D., Economics, McGraw Hill, New York, 1992. 2. Stephen Robbins, Organizational Behavior, Pearson Education, New Delhi, 2003.
81
08S702 CRYPTOGRAPHY AND NETWORK SECURITY L 3 T 0 P 0 C 3
INTRODUCTION (09) Overview: Services, Mechanisms and Attacks- The OSI security model Architecture- A model for Network Security, Classical Encryption Techniques: Substitution Techniques- Transposition Techniques- Rotor Machines- Symmetric Cipher Model - block Ciphers and Data Encryption Standard: Simplified DES- Block Cipher Principles. (09) NUMBER THEORY Groups, Rings and Fields- Modular Arithmetic- Euclids Algorithm- Finite Fields of the form GF (p)Finite Fields of the form GF (2n)- Polynomial Arithmetic- Congruences and residue classes- Eulers Phi Functions- The theorems of Fermat and Lagrange- Computer Square roots modulo integerComputer Square roots modulo composite- Blum Integers. (09) PUBLIC KEY ENCRYPTION AND HASH FUNCTIONS Public Key Cryptography: Principles of public key cryptosystems- The RSA Algorithm- Message Authentication and Hash Functions: Authentication Requirements- Authentication FunctionsMessage Authentication Codes- Hash Functions- Security of Hash Functions and MACs. NETWORK SECURITY (09) Electronic Mail Security: Pretty Good Privacy- S/MIME- IP Security: IP Security Overview- IP Security Architecture- Authentication Header- Encapsulating Security Payload- Combining Security Associations- Key management- Web Security: Web Security Considerations- Secure Socket Layer and Transport Layer Security- Secure Electronic Transaction. SYSTEM SECURITY (09) Intruders: Intruders- Intruder Detection- Password Management- Malicious Software: Viruses and Related Threats- Virus Countermeasures- Firewalls: Firewall Design Principles- Trusted Systems. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. William Stallings, Cryptography and Network Security, Principles and Practice, Fourth Edition, prentice Hall, January, 2009. REFERENCES 1. 2. 3. Wenbo Mao, Modern Cryptography, Pearson Education, 2005. BruceSchneier, Applied Cryptography, Second Edition, Toha Wiley & Sons, January 2009. Douglas R. Stinson, Cryptography: Theory and Practice, CRC Press, Second Edition 2002.
82
08S703 DIGITAL IMAGE PROCESSING L 3 T 0 P 0 C 3
FUNDAMENTALS OF DIGITAL IMAGE PROCESSING (09) Introduction-Fundamental Steps in image processing-Building Blocks of Digital image processing systems- Image Acquisition, Storage, Processing, Display and Communication Interface, Digital Image Representation-Sampling and Quantization-Some Basic Relationships between pixels-Neighbors and Connectivity, Distance Measures, Image Transform-Fourier Transform-discrete Fourier transform-some properties of Fourier Transform-Fast Fourier transform- FFT Algorithm, Inverse FFT, DCT- Properties, Walsh Transform, Hadamard Transform, Haar Transform, Slant Transform, Hotelling Transform. IMAGE ENHANCEMENT (09) Introduction-Spatial and frequency domain approaches- Frequency domain Techniques-Spatial domain Techniques, Spatial Filtering, Frequency domain-Gray Level to Color Transform. (09) IMAGE COMPRESSION Introduction-Coding Redundancy, Inter pixel redundancy, Psycho Visual redundancy, Image compression models, The source Encoder and Decoder, The channel Encoder and decoder, Information Theory, Classification, Huffman coding, Lossy compression Techniques, Threshold coding, Vector quantization, Image compression standard(JPEG). (09) IMAGE SEGMENTATION Introduction, Detection of isolated points, Line detection, Edge detection, Edge linking and Boundary detection, Region oriented segmentation, Segmentation using threshold, Accumulative difference image. (09) IMAGE RESTORATION, REPRESENTATION AND DESCRIPTION Introduction: Degradation model, Degradation model for continuous functions, Discrete Degradation Model, Estimation of Degradation function by experimentation and modeling, Inverse filtering approach, LMS filter, Interactive Restoration, Constrained Least Square Restoration, Boundary Representation using chain codes, Linear signature, Shape number, Fourier descriptors, Moments Region representation, Regional descriptor, Texture, Relational Descriptors. LECTURE : 45 TUTORIAL :0 TOTAL : 45 Hours TEXT BOOK 1. Dr. S. Annadurai, Dr. R. Shanmugalakshmi, Fundamentals of Digital Image Processing, Pearson Education Asia,2007. REFERENCES 1. Rafael C. Gonzalez, Richard E. Woods, Digital Image Processing, Pearson Education Asia, 2002. 2. Anil K. Jain, Fundamentals of Digital Image Processing, Pearson Education Asia,1997.
83
08S704 MOBILE COMPUTING L 3 T 0 P 0 C 3
INTRODUCTION (09) Medium access control: Motivation for a specialized MAC, SDMA, FDMA, TDMA, CDMA, comparison of S/T/F/CDMA - Telecommunication systems: GSM, DECT, TETRA, UMTS and IMT-2000 Satellite systems Overview of Wireless Sensor Networks. WIRELESS LAN (09) Wireless LAN: Infra red Vs Radio transmission, Infra structure and Adhoc Networks IEEE 802.11 HIPERLAN Bluetooth. WIRELESS ATM AND ADHOC (09) NETWORKS Motivation for WATM Services Reference model Functions Radio access layer Handover Location management Addressing Mobile QOS Access point control. Adhoc Networks: Routing in mobile hosts Destination sequence, Distance vector, Dynamic Source routing, Hierarchical algorithms, Alternative Metrics. NETWORK ISSUES (09) Mobile IP DHCP Mobile Transport layer Indirect TCP Snooping TCP Mobile TCP Transmission / Time out freezing Selective retransmission Transaction oriented TCP. SUPPORT FOR MOBILITY (09) File Systems World Wide Web Wireless Application Protocol Security Analysis of existing wireless network. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOKS 1. Schiller J, Mobile Communications, Pearson Education Asia, Second Edition, 2007. 2. Feng Zhao, Leonidas Guibas, Wireless Sensor Networks: An Information Processing Approach, Elseivier 2004. REFERENCES 1. Charles E Perkins, Mobile IP: Design Principles and Practices, Pearson Education Asia, 2008. 2. William Stallings, Wireless Communications & Networks, Prentice Hall of India, Second Edition, 2005. 3. Reza BFar, Mobile Computing Principles, Cambridge University Press, 2006.
84
08S707 DIGITAL IMAGE PROCESSING LAB L 0 LIST OF EXPERIMENTS T 0 P 3 C 2
IMPLEMENTATION OF THE FOLLOWING 1. 2. 3. 4. 5. 6. 7. 8. 9. Image Reading and Displaying (Gray Scale, Color Image). TIFF, GIF, BMP, JPEG. Image Transformation. Histogram Equalization Low Pass Spatial filter High Pass Spatial Filter Mean and Median filters Frequency Domain Transformations Huffman Image Compression Run length encoding
10. Arithmetic Coding 11. Vector Quantization 12. Segment based Compression Technique 13. Developing Image Processing Software Package that implements Image Processing Operations TOTAL : 45 Hours
85
08S708 NETWORK SECURITY AND ELECTIVE LAB L 0 1. Substitution Techniques a. Implementation of Vigenere Cipher b. Implementation of Playfair Cipher c. Implementation of Hill Cipher 2. Transposition Techniques a. Implementation of Rail fence Technique b. Implementation of Rotor Mechanism 3. 4. 5. 6. 7. 8. 9. 10. 11. Implementation of DES Implementation of RC4 and RC5 Implementation of RSA algorithm Implementation of Elliptic Curve Cryptography Implementation of SHA Implementation of Steganography Cryptanalysis Configuring Firewall Experiments Corresponding to Electives TOTAL : 45 Hours T 0 P 3 C 2
86
08S7E0 ENTERPRISE JAVA - J2EE L 3 T 0 P 0 C 3
INTRODUCTION (09) Overview J2EE multi tier architecture - J2EE Best Practices J2EE Design Patterns and Frameworks. J2EE DATABASES J2EE Database concepts JDBC Objects JDBC and Embedded SQL. J2EE FOUNDATION HTML, XML and XHTML Java Server Pages Enterprise Java Beans. (09)
(09)
(09) J2EE INTERCONNECTIVITY Java Mail API Java Interface Definition Language and CORBA - Java Remote Method Invocation Java Message Service Security Java Naming and Directory Interface API. WEB SERVICES (09) SOAP Universal Description, Discovery, and Integration (UDDI) Electronic Business XML The Java API for XML Registers (JAXR) Web Services Description Language (WSDL). LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. Jim Keogh, J2EE The Complete Reference, Tata Mc-Graw Hill, 18th reprint 2006. REFERENCES 1. Allamaraju Subramanyam and Others, Professional Java Server Programming, Vol1 and Vol2, Pearson Education Asia, 2004. 2. William Crawford and Jonathan Kaplan, J2EE Design patterns, OReilly 2004.
87
08S7E1 REAL TIME SYSTEMS L 3 T 0 P 0 C 3
INTRODUCTION, CHARACTERIZING REAL TIME SYSTEMS AND TASKS, (09) SCHEDULING Issues in real time computing-structure of a real time system-task classes-performance measures for real time systems-estimating program run times-notation-classical uniprocessor scheduling algorithms-uniprocessor scheduling of IRIS tasks- Fault Tolerant scheduling. (09) TASK ASSIGNMENT, PROGRAMMING LANGUAGES AND TOOLS Task assignment-mode changes-Desired language characteristics-data typing-control structureshierarchical decomposition-packages-run time error handling-overloading and genericsmultitasking-low level programming-task scheduling-timing specifications-some experimental languages-programming environments-run time support. (09) REAL TIME DATABASES, REAL TIME COMMUNICATION Definitions-real time vs. general purpose databases-main memory databases-transaction priorities and aborts-concurrency control issues-disk scheduling algorithms- two phase approach to improve predictability-maintaining serialization consistency-databases for hard real time systemscommunications media-network topologies-protocols. (09) FAULT TOLERANCE TECHNIQUES, RELIABILITY EVALUATION TECHNIQUES Definitions-fault types and detection-fault and error containment-redundancy-data diversityreversal checks-malicious or Byzantine failures-integrated failure handling-obtaining parameter values-reliability models for hardware redundancy-software error models-taking time into account. (09) CLOCK SYNCHRONIZATION Clocks-a nonfault tolerant synchronization algorithm-impact of faults-fault tolerant synchronization in hardware- synchronization in software. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. C.M. Krishna, Kang G. Shin, Real Time Systems, McGraw-Hill International editions, 1997. REFERENCES 1. Jane W.S. Liu, Real Time Systems, Pearson Education Asia, 2000. 2. Raymond J.A. Buhr, Donald L. Bailey, An Introduction to Real Time Systems, Pearson Education Asia, 1999.
88
08S7E2 HIGH PERFORMANCE ARCHITECTURE L 3 T 0 P 0 C 3
(09) PARALLEL COMPUTER MODELS The State of Computing Multiprocessors and Multicomputers Multivector and SIMD computers PRAM and VLSI Models Architectural Development Tracks. PROGRAM AND NETWORK PROPERTIES Conditions of Parallelism Program Partitioning and Scheduling Program Flow Mechanisms System Interconnect Architectures. (09) PRINCIPLES OF SCALABLE PERFORMANCE Performance Metrics and Measures Parallel Processing Applications Speedup Performance Laws Scalability Analysis and Approaches. PROCESSORS AND MEMORY HIERARCHY Advanced Processor Technology Superscalar and Vector Processors Memory Hierarchy Technology Virtual Memory Technology. BUS, CACHE AND SHARED MEMORY (09) Backplane Bus Systems Cache Memory Organizations Shared-Memory Organizations Sequential and Weak Consistency Models. PIPELINING AND SUPERSCALAR TECHNIQUES Linear Pipeline Processors Nonlinear Pipeline Processors Instruction Pipeline Design Arithmetic Pipeline Design Superscalar and Super Pipeline Design. MULTIPROCESSORS AND MULTICOMPUTERS (09) Multiprocessors System Interconnects Cache Coherence and Synchronization Mechanisms Three Generations of Multicomputers Message-Passing Mechanisms. MULTIVECTOR AND SIMD COMPUTERS Vector Processing Principles Multivector Multiprocessors Compound Vector Processing SIMD Computer Organizations The Connection Machine CM-5. SCALABLE, MULTITHREADED AND DATAFLOW ARCHITECTURES (09) Latency-Hiding Techniques Principles of Multithreading Fine-Grain Multicomputers Scalable and Multithreaded Architectures Dataflow and Hybrid Architectures. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. Kai Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability, McGraw Hill International Edition, 1993. REFERENCES 1. Harold S. Stone, High-Performance Computer Architecture, Third edition, Pearson Education Asia, 1993. 2. David Patterson, John Hennessy, Computer Organization and Design, IV Edition, Elsevier Publication, 2008.
89
08S7E3 C# AND .NET FRAME WORK L 3 T 0 P 0 C 3
INTRODUCTION (09) Introduction to C# Applications Classes and objects Control statements Methods Arrays Deeper look on classes and objects. (09) OBJECT ORIENTED PROGRAMMING CONCEPTS Inheritance: Base classes and Derived classes, protected members, relationship, constructors, software engineering, class object. Polymorphism, Interfaces and operator overloading, Excerption handling. GRAPHICAL USER INTERFACE CONCEPTS (09) GUI Concepts Multithreading Strings, characters and regular expressions Graphics and Multimedia Files and streams. WEB APPLICATIONS XML Database - SQL - ADO .NET - ASP.NET Web forms and Web controls. (09)
(09) WEB SERVICES AND NETWORKING Web services: .NET web services basic, SOAP, publishing and consuming web services, session tracking, using web forms and services. Networking: Protocols, TCP and Datagram applications, web browser control, .NET remoting. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. Harvey M. Deitel and Paul J. Deitel, C# for Programmers, Pearson Education, Second Edition 2007. REFERENCES 1. Herbert Schildt, The Complete Reference: C#, TMH, third reprint 2006. 2. Andrew Troelsen, C# and .NET platform, Intertech Instruction series, second Indian reprint 2004. 3. Jesse Liberty, Learning C++, OReilly publications 2002.
90
08S7E4 COMPONENT BASED TECHNOLOGY L 3 T 0 P 0 C 3
INTRODUCTION (09) Introduction Standards Terms and Concepts Standardization and Normalization Components and Interfaces Callbacks Contracts Examples Self interference and Object reentrance. (09) JAVA BASED COMPONENT TECHNOLOGIES Overview and history of java components Java the language Java Beans Java Services Applets, Servlets, Beans and Enterprise Beans Advanced Java Services Interfaces vs Classes in java - JXTA and Jini Java and Web services. (09) CORBA Object and component wiring standards CORBA The object request broker CORBA Services CORBA Component Model Portable object Adapter CCM Components, Containers CORBA Complaint implementations CORBA facilities Application objects CORBA, UML, XML and MDA. (09) . NET BASED COMPONENT TECHNOLOGIES COM - Object reuse - Interfaces and Polymorphism COM object creation and COM Library initializing objects, persistence, structural storage, monikers From COM to distributed COM -Metainformation and Automation Other COM services- OLE containers and servers - Active X controls - Contextual Composition and Services - .NET framework -.NET components -Assemblies Common language Frameworks. (09) COM OVERVIEW AND COMPONENT FRAMEWORKS Component Architecture - Component Frameworks :: Contribution of contextual component frameworks - Frameworks for contextual composition - Black box component framework - Black box and OLE - Portos - Component Development : Component oriented programming - Tools Component Distribution and Acquisition - Component Assembly. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. Clemens Szyperski, Component Software: Beyond Object-Oriented Programming, Pearson Education publishers, 2003.
REFERENCES 1. 2. 3. G. Sudha Sadasivam, Distributed Component Architecture, Wiley India Pvt. Ltd. Mowbray, Inside CORBA, Pearson Education, 2003. Freeze, Visual Basic Development Guide for COM & COM+, BPB Publication, 2001.
91
08S7E5 WEB SERVICES L 3 T 0 P 0 C 3
STANDARDS, TECHNOLOGIES AND CONCEPTS (09) Introduction- Extensible Markup Language fundamentals-SOAP : Model Messages- Encoding RPC- SOAP, Web Services and REST Architecture-WSDL : Structure- interface-Elements-Bindings services-Extension-Universal Description , Discovery and integration: UDDI Business RegistryUDDI under Covers-Accessing UDDI (09) ADVANCED SERVICES AND TECHNOLOGIES Conversations: overview-Web Services Conversation Language- WSCL interface componentsRelationship between WSDL and WSCL-workflow : Business Process Management-Workflow Management-BPEL-Transactions: ACID properties-Distributed Transactions and Two Phase CommitOASIS Business Transaction Protocol. SECURITY, QUALITY OF SERVICE, SERVICE MANAGEMENT (09) Security: End to End process- Security issues-Attacks and Threats-WS-Security-Quality of Service: importance-metrics-Design Patterns and Best Practices-web services and applications-Portals-Web service management (09) JAVA WEB SERVICES ARCHITECTURE Java web services Developer pack-Java API for XML Processing-Architecture-SAX and DOM-JAXP and XML Schemas-JAX-RPC: Service model-Data types and serialization-Interoperability-JAX-RPC and J2EE (09) JAVA API SUPPORT API for XML messages: messaging and Message oriented Middleware-JAXM architecture-Designing and developing JAXM API for Registries and repositories-JAXR Architecture-information modelJAXR API to UDDI mapping-JAXR and enXML Registry-API for XML Building: Architecture-XML to java mapping-validation and customization. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOKS 1. Sandeep chatterjee, James Webber, Developing Enterprise Web services- An architects guide, Pearson Education, 2005. 2. James McGovern, Sameer Tyagi, Michael E. Stevens, Sunil Mathew, Java Web Services Architecture, Elsevier,2005 REFERENCES 1. Thomas Eri, Service Oriented Architecture: A field guide to integrating XML and Webservices, Fifth Edition, Prentice Hall, 2004. 2. David Chappell, Tyler Jewell, OReilly Vlg. Java Webservices, Gmbh & co., 2003.
92
08S7E6 GENETIC ALGORITHM AND SWARM INTELLIGENCE L 3 T 0 P 0 C 3
INTRODUCTION AND MATHEMATICAL FOUNDATIONS (09) Traditional Optimization and search methods GA vs. Traditional Methods Simple GA Schemata Learning the Lingo.Schema Processing Two Armed and K-armed Bandit problem Building block hypothesis Minimal deceptive problem Mapping Objective Functions to fitness form Fitness Scaling Codings A Multiparameter, mapped, Fixed point coding Discretization Constraints. ADVANCED OPERATORS AND TECHNIQUES (09) Dominance Diploidy Abeyance Inversion and Reordering operators Other micro operators Niche and Speciation Multi objective optimization Knowledge based techniques GA and parallel processors. GENETIC BASED MACHINE LEARNING AND ITS APPLICATIONS (09) Genetic based machine learning Classifier system Rule and message system The bucket brigade Genetic algorithm A simple classifier system Rise of GBML Development of CS1, the first classifier system - Smiths Poker player Other early GBML Efforts A Potpourri of current applications. METHODOLOGIES BASED ON PARTICLE SWARM INTELLIGENCE (09) Foundations, perspectives and applications Waves of SWARM particles - The WoSP Algorithm The WoSP Algorithm in Detail - The Performance of the WoSP Algorithm - Constraint Handling Grammatical Swarm: A Variable-Length Particle Swarm Algorithm - SWARMs of Self-Organizing Polymorphic Agents - Background and Motivation - SWARM Simulation of RTES/BTeV and results (09) EXPERIENCES USING PARTICLE SWARM INTELLIGENCE Swarm Intelligence Searchers, Cleaners and Hunters The Dynamic Cooperative Cleaners (DCC) Problem - Cooperative Hunters - Physical k-Clique - Ant Colony Optimization for Fast Modular Exponentiation using the Sliding Window Method - Window-Based Methods - Addition Chains and Addition Sequences - Ant Systems and Algorithms - Chain Sequence Minimization Using Ant System - Particle Swarm for Fuzzy Models Identification - PSO Algorithm - Fuzzy Models - A Methodology for Fuzzy Models Identification through PSO. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOKS 1. David E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Pearson Education publishers,1989,Reprint 2004. 2. Nadia Nedjah, Luiza de Macedo Mourelle, Swarm Intelligent Systems, Springer Verlog,2006. REFERENCES 1. Nadia Nedjah, Ajith Abraham, Luiza de Macedo Mourelle (Eds.), Genetic Systems Programming, Springer Verlog,2005. 2. Melanie Michell, An Introduction to Genetic Algorithms, PHI,1998.
93
03S7E7 MULTIMEDIA SYSTEMS L 3 T 0 P 0 C 3
MULTIMEDIA OVERVIEW (09) Uses of Multimedia Information, The convergence of computers, Communications and Entertainment products, Architectures and issues for distributed multimedia systems. (09) MEDIA AND TIME Digital audio representation and processing Video technology Digital video and image compression Time based media representation and delivery. (09) MULTIMEDIA INFORMATION SYSTEMS Operating system support for continuous media applications Middleware system services architecture Multimedia devices Presentation services and the user interface Multimedia file systems and information models Multimedia presentation and authoring. (09) MULTIMEDIA COMMUNICATIONS SYSTEMS Multimedia services over the public network Requirements Architectures and protocols Multimedia interchange Multimedia conferencing Multimedia GroupWare Computer and video fusion approach to open shared workspace. RECENT TRENDS High definition Television, Knowledge based Multimedia Systems. (09)
LECTURE : 45 TUTORIAL :0 TOTAL : 45 Hours TEXT BOOK 1. John F.Koegal Buford, Multimedia System , Pearson Education Asia,2000. REFERENCES 1. Ralf Steinmetz and Klara Nahrstedt, Multimedia Computing: Communication and Application, Pearson Education Asia, 1995. 2. Fred Halsal, Multimedia Communication: Application Networks, Protocols and Standard, Pearson Education Asia, 2001.
94
08S7E8 PC HARDWARE AND TROUBLESHOOTING L 3 T 0 P 0 C 3
(09) INTRODUCTION Microcomputer system Computer Organisation Memory ALU Control Unit Interrupts I/O Techniques Error Detection Techniques Personal Computer Concepts Operating Systems Multitasking and Multiprogramming Memory. PC HARDWARE Peripheral Devices: Keyboard Monitor Printer Magnetic Storage Devices Floppy Hard Disk Drive Mouse Track ball Modem CD Drive Scanner Digital Camera DVD other Peripherals. Hardware: BIOS DOS PC Hardware Product Engineering Inside the System Box Motherboard Logic Memory Space I/O Port address Wait state Interrupts Interfaces and Controllers. (09) HARDWARE COMPONENTS Hardware Components and ICs Microprocessors in PC Support chips in the Motherboard PC Bus and Motherboard Circuits. CONTROLLERS Printer Controller - Floppy Disk Controller Hard Disk Controller Subsystem. DISPLAY ADAPTER AND MAINTENANCE Display adapters Serial Interfaces - Maintenance: Installation and Preventive Maintenance. (09)
(09)
TROUBLESHOOTING (09) Computer Faults Nature of Faults Types of Faults Diagnostic Programs and Tools Bus Faults Fault Elimination Process Systematic Troubleshooting Symptoms Observation Analysis Fault Diagnosis Rectification Troubleshooting levels Post PC Diagnostic Software Layman Checks Problems & Diagnosis Circuit tips IC Faults Handling Procedures Problem Diagnosis Virus Attacks. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. B.Govindarajulu, IBM PC and Clones: Hardware, Trouble shooting and Maintenance, 17th Reprint Edition, Tata McGraw Hill, 2005.
REFERENCES 1. 2. Scott Mueller, Upgrading and repairing PCs, 18th Edition, Prentice Hall, 2008. Robert C. Brenner, IBM PC Troubleshooting and repair guide, Indianapolis, Indiana: Howard W Sams & Company, 1985.
95
08S7E9 DISTRIBUTED COMPUTING L 3 T 0 P 0 C 3
(09) INTRODUCTION Architectures of Distributed systems- Theoretical foundations- inherent limitations of a distributed system- Lamports logical clocks- vector clocks- casual ordering of messages- global state- cuts of distributed computation- termination detection- Distributed mutual Exclusion (09) DEADLOCK DETECTION & AGREEMENT PROTOCOLS Distributed deadlock detection- Agreement protocols: Introduction- The system model- A classification of agreement problems, Solutions to the Byzantine agreement problem, Applications of agreement algorithms. (09) DISTRIBUTED RESOURCE MANAGEMENT Distributed File Systems- Case Studies: Distributed Shared memory-Architecture- algorithms for implementing DSM- memory coherence and protocols- design issues- case studies. Distributed Scheduling- introduction- issues in load distributing- components- performance comparisonselecting a suitable load sharing algorithm. (09) REMOTE PROCEDURE CALL RPC-Introduction, model, transparency, implementation mechanism, stub generation, RPC messages, marshalling arguments and results, server management, parameter - passing semantics, call semantics, communication protocols for RPCs, client server binding, exception handling, security. (09) DISTRIBUTED FILE SYSTEMS AND RECOVERY DFS and security- Desirable features of good DFS, file models, file accessing Models, file sharing semantics, file caching schemes, and file replication. Fault Tolerance, atomic transaction, potential attacks to computer system, cryptography, authentication, access control, Digital signatures, DCE security service. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. Mukesh Singhal, Niranjan G.Shivaratri, Advanced Concepts in Operating Systems, Tata McGraw Hill, 21st reprint 2008.
REFERENCES 1. 2. Andrew S. Tanenbaum, Distributed Operating Systems Pearson Education, 2002. Pradeep K. Sinha, Distributed Operating Systems: Concepts & Design, PHI, 2005.
96
08S8E0 FUZZY LOGIC AND NEURAL NETWORKS L 3 FUZZY LOGIC Introduction Fuzzy Sets Fuzzy Relations Fuzzyfication and defuzzification methods FUZZY ARITHMETICS Fuzzy arithmetic, vectors, extension principle fuzzy rule based system linguistic hedges. T 0 P 0 C 3 (09)
(09)
INTRODUCTION TO NEURAL NETWORKS (09) Differences between biological and Artificial Neural Networks-Typical Architecture , Common activation function, McCulloch pitts neuron, Simple neural nets for pattern classification, Linear Separability- Learning Rules. BPN, BAM, HOPFIELD, SIMULATED ANNEALING, CPN, SOM (09) Back propagation The BAM and Hopfield Memory-Simulated Annealing The Counter propagation Network Self-Organizing Maps. APPLICATIONS OF NEURAL NETWORK AND FUZZY LOGIC (09) Application of Neural Networks: Pattern Recognition Image compression Communication Control systems Application of Fuzzy Logic: Fuzzy pattern recognition Fuzzy Image Compression Fuzzy Logic Controllers. LECTURE : 45 TUTORIAL :0 TOTAL : 45 Hours TEXT BOOKS 1. 2. Timothy J.Ross, Fuzzy Logic with Engineering Application, McGraw Hill 1997. J.A. Freeman and B.M.Skapura, Neural Networks, Algorithms applications and Programming Techniques, Pearson Wesley, 1990.
REFERENCES 1. 2. J.aurene Fausett, Fundamentals of Neural Networks , Pearson Education India , New Delhi,2004. Zimmermann.H.J., Fuzzy Set Theory and its Applications , II Edition, Kluwer Academic Publishers, Dordrecht, Germany,1991.
97
08S8E1 TCP/IP DESIGN AND IMPLEMENTATION L 3 T 0 P 0 C 3
(09) INTRODUCTION IP Addresses: Classful addressing- IP Address: Classless Addressing- Delivery forwarding and routing of IP Packets- ARP- RARP. DESIGN ISSUES (09) Transmission Control Protocol: TCP services- TCP features- Segment- TCP connection- State Transmission Diagram- Flow Control- Error Control- Congestion Control- TCP timers- OptionsTCP Package- Multicasting and Multicast Routing Protocols: Unicast, Multicast and BroadcastMulticast applications- Multicast Routing- MOSPF- DVMRP- CBT- PIM- MBONE. (09) IMPLEMENTATION ISSUES Internet Protocol: Datagram- Fragmentation- Options- Checksum- IP Package- Internet Control Message Protocol- Internet Group Management Protocol- User Datagram Protocol. (09) INTERFACING User Datagram Protocol: Process to process communication- User Datagram- Checksum- UDP Operation- UDP Package- Host Configuration: BOOTP- DHCP- Domain Name Server: Name Space- DNS in the internet- Resolution- DNS messages- Types of Records- Compression. (09) APPLICATIONS Remote Login: TELNET- Concept- NVT- NVT Character Set- Embedding- Options- Option Negotiation- Escape Character- Mode of Operation- User Interface- Security Issue- File Transfer Protocol- TFTP- Message Transfer Agent: SMTP- User Agent- MTA- Message Access Agent: POP and IMAP- SNMP: Concept- Management Components- SMI- MIB- SNMP- MessagesUDP Ports. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. Behrouz A. Forouzan, TCP/IP Protocol Suite, Tata McGraw-Hill Edition, Reprint 2008.
REFERENCES 1. 2. 3. Comer D.E., Internetworking with TCP/IP- Vol.1, 5th Edition, Prentice Hall of India,2006 Comer D.E & Stevens D.L., Internetworking with TCP/IP- Vol.3, Prentice Hall of India,1997. Stevens W.R., TCP/IP Illustrated Vol.1, 2 &3, Addison Wesley, 1999.
98
08S8E2 PATTERN RECOGNITION L 3 T 0 P 0 C 3
PATTERN CLASSIFIER (09) Overview of pattern recognition - Discriminant functions - Supervised learning - Parametric estimation -Maximum likelihood estimation - Bayesian parameter estimation - Perceptron algorithm - LMSE algorithm -Problems with Bayes approach - Pattern classification by distance functions Minimum distance pattern classifier. UNSUPERVISED CLASSIFICATION (09) Clustering for unsupervised learning and classification - Clustering concept - C-means algorithm - Hierarchical clustering procedures - Graph theoretic approach to pattern clustering - Validity of clustering solutions. STRUCTURAL PATTERN RECOGNITION (09) Elements of formal grammars - String generation as pattern description - Recognition of syntactic description Parsing - Stochastic grammars and applications - Graph based structural representation. FEATURE EXTRACTION AND SELECTION (09) Entropy minimization - Karhunen - Loeve transformation - Feature selection through functions approximation - Binary feature selection. RECENT ADVANCES (09) Neural network structures for Pattern Recognition - Neural network based Pattern associators Unsupervised learning in neural Pattern Recognition - Self organizing networks - Fuzzy logic - Fuzzy pattern classifiers - Pattern classification using Genetic Algorithms. LECTURE : 45 TUTORIAL :0 TOTAL : 45 Hours TEXT BOOK 1. Tou and Gonzales, Pattern Recognition Principles , Wesley Publication Company, London,1974.
REFERENCES 1. 2. 3. Robert J. Schalkoff, Pattern Recognition : Statistical, Structural and Neural Approaches ,John Wiley & Sons Inc., New York, 1992. Duda R.O., and Hart.P.E., Pattern Classification and Scene Analysis, Wiley, New York,1973. Morton Nadier and Eric Smith P., Pattern Recognition Engineering, John Wiley & Sons, New York, 1993.
99
08S8E3 THEORY OF GRID COMPUTING L 3 T 0 P 0 C 3
INTRODUCTION (09) Grid activities- Grid Business areas- Application- Grid computing Organizations and their rolesGrid computing anatomy- The Grid Computing road map. (09) GRID SERVICES AND WEB SERVICES Service oriented Architecture- Web Service Architecture- XML- SOAP- Service Message Description Mechanisms- Relationship between grid services and web services- Interoperability. OPEN GRID SERVICES ARCHITECTURE (09) OGSA Architecture and goal- Sample use cases- The OGSA platform components- Open Grid services Infrastructure. (09) OGSA BASIC SERVICES Common Management Model- Service domains- Policy Architecture- Security ArchitectureMetering and accounting- Common Distributed Logging- Distributed Data Access and Replication. (09) GT3 TOOLKIT Software Architecture Model- Service Programming Model- Sample Implementation- High Level Services- Net Middle ware solutions- OGSI.Net Framework implementation. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. Joshy Joseph, Craig Fellenstein, Grid Computing, Pearson Education, 2004.
REFERENCES 1. 2. Barry Wikinson, Michael Allen, Parallel Programming, Pearson Education, 2004. Sandeep Chatterjee, James Webber, Developing Enterprise Web Services: An Architects Guide, Pearson Education, December 2003.
100
08S8E4 ATM NETWORKS L 3 T 0 P 0 C 3
INTRODUCTION (09) Network evolution, network models, ATM: concept- Design goals- Packet networks-mixed network traffic-cell networks-additional advantages of ATM, ATM Layer: ATM CELL HEADER-Transmission of ATM cells-Virtual connections-QOS parameters-Traffic Descriptors- ATM service classes/ categories- ATM protocol architecture. (09) B-ISDN ISDN channels & interface structure specifications- B-ISDN services according to ITU- possible implementation scenario or B-ISDN services-B-ISDN principles, B-ISDN network concept: General architecture of B-ISDN signaling virtual channels-Broad band network performance. (09) ATM ADAPTATION LAYER AAL1, AAL2, AAL3/4, AAL5, AALS-ATM addressing-UNI signaling- PNNI signaling-PNNI routing, SONET: SONET-Multiplexing-Network Components- Network Configurations- Synchronous Digital Hierarchy-ATM Networks and SONET/SDH. (09) ATM TRAFFIC AND CONGESTION CONTROL ATM Traffic parameters and transfer capabilities-requirements-ATM traffic related attributes- Traffic management frame work-Traffic management-ABR traffic management, ATM switching: functional requirements- architecture model- Switching elements- switching networks- switches and cross connects. (09) ATM TRANSMISSION Overview-Cell transfer functions- Transmission systems- Network synchronization- BISDN local network topology & technology- trunk network structure- ATM transmission network equipmentOptical networking, ATM INTERNETWORKING: Internetworking with existing networks-LAN Emulation-Telephony over ATM- Wireless ATM and mobile ATM- security in ATM networks-ATM application programming interface (Introductory Treatment). LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOKS 1. Rainer Handel, Manfred N Huber, Stefan Schroder , ATM networks, Concepts, protocols and applications, Addison Wesley, 3 rd edition. 2. William Stallings, ISDN and broad band ISDN with frame relay and ATM, Fourth edition. Prentice Hall, Pearson Education Asia. REFERENCES 1. Leon Garcia, Widjaja, Communication Networks: Fundamental concepts and key architectures, Tata McGraw Hill. 2. Othmar Kyas, ATM Networks, Thomson computer Press, 2nd edition. 3. Stamatior V. Kartal opoulos, Understanding SONET/SDH and ATM, IEEE - PHI 2000. 4. Behrouz Forouzan Introduction to data communications and networking, TMH. 5. John Ross, Tele communication Technologies (Voice data & Fibre Optic Applications)
101
08S8E5 ADVANCED DATA BASES L 3 T 0 P 0 C 3
INTRODUCTION (09) Database system concepts and architecture E-R Model Relational model- Relational algebra ER to Relational model mapping- Functional, multi valued and join dependencies normal forms. DISTRIBUTED DBMS (09) Introduction- Architecture- Standardization- Architectural models for design- strategies-design issuesfragmentation-allocation-semantic data and integrity control-view management-Data security-Query decomposition- Localization of distributed data - Query optimization -Join ordering in fragment Queries-Distributed query optimization algorithms. ENHANCED DATAMODELS (09) Object databases- Object relational and extended relational systems- Active database conceptsTemporal database- multimedia database- deductive database-XML and Internet databases- mobile databases-GIS and GNOME data management. DATAMINING AND DATA WAREHOUSING (09) Data Mining--Data warehouse and OLAP Technology-multi dimensional data model-Data warehouse architecture and implementation-mining primitives - query language- Data mining system architecture Association rule mining Mining single dimensional Boolean association rules and multilevel association rules- Mining multidimensional association rules - correlation analysis-Constraint based mining. CLASSIFICATION AND CLUSTERING (09) Classification by decision tree induction, back propagation and Bayesian classification- other classification methods-prediction classifier accuracy-cluster analysis-partitioning methodsHierarchical methods - Density based methods- Grid based methods -model based clustering methodsoutlier analysis. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOKS 1. Ramez Elmasri, ShamkantB.Navathe, Fundamentals of Data Base systems, Fourth Edition, Pearson Education, 2004. 2. Tamer Ozsu.M., Patrick Valduriez, Principles of Distributed Database Systems, Pearson Education, Second Edition, 2004. 3. Jiawei Han, Micheline Kamber, Data Mining: Concepts and Techniques, Elsevier, 2004. REFERENCE BOOKS 1. Abraham Silberschatz, Henry Korth, S.Sudarshan, Database System Concepts, Fifth Edition, McGraw-Hill, 2005. 2. Ian H. Witten, Eibe Frank, Data Mining: Practical M/c Learning tools and techniques with Java implementation, Third Edition, Morgan Kaufman, 2000.
102
08S8E6 DATA WAREHOUSING AND DATA MINING L 3 T 0 P 0 C 3
INTRODUCTION TO DATAWARE HOUSE (09) Data warehouse environment Data warehouse design-Granularity-Data ware house and technologyDistributed data warehouse. (09) DATAWAREHOUSE ENVIRONMENT External data and data ware house-Migration to architectural environment-relational and multimedia models (09) INTRODUCTION TO DATAMINING Data Mining functionalities-Major issues Data warehouse and OLAP Technology: Multi dimensional Data model- -Data cube Technology-Data warehousing to Data mining- Data cleaningData Integration and Transformation-Data Reduction-Discretization and concept hierarchy generation- Primitives-Query Language-Architecture of Data mining system. (09) CONCEPT DESCRIPTION AND ASSOCIATION RULE MINING Concept Description: Data generalization and summarization based characterization-Analytical characterization-Mining class comparisons-Mining Descriptive Statistical Measures in Large Databases-Mining single dimensional association rule mining- Mining multilevel and multi dimensional association rule mining-correlation analysis-Constraint based association miningprediction. CLASSIFICATION AND CLUSTER ANALYSIS (09) Issues-Classification by decision tree induction-Bayesian Classification-Classification by back propagation-other classification methods-classification accuracy-Cluster analysis- Partitioning methods-Hierarchical Methods-Density Based Methods Grid Based Methods-Model based methods-Model based methods-outlier analysis. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOKS 1. 2. Jiewei Han, Micheline Kamber, Data mining concepts and techniques, Morgan Kaufman Pub,2001. William H. Inmon, Building the data ware house, Wiley Dreamtech (p) Ltd., IV Edition, 2005.
REFERENCE BOOKS 1. 2. Ian H.Witten, Eibe Frank, Data Mining: Practical M/c Learning tools and techniques with Java implementation, Third Edition, Morgan Kaufman, 2000. Ronen Feldman, James Sangee, The Text Mining Handbook: Advanced Approaches in analyzing unstructured data, Cambridge University Press, 2007.
103
08S8E7 SOFTWARE PROJECT MANAGEMENT L 3 T 0 P 0 C 3
BASICS (09) Managing people: Manage project culture, people, making and leading good people. Implement your process: Putting a process in place, implementing a process, adopting an agile process, assessing a process. Leverage your tools: Choosing tools, training to use tools, leveraging tools. Use your measurements: Selecting, planning and leveraging measurements. PREPARE TO MANAGE (09) Form your vision: Analyzing stakeholders, balancing project needs, assessing project risks, specifying project payoffs, specifying and communicating project vision. Organize your resources: Identifying hardware, software, support. Sketch your schedule: Estimation, scheduling immovable milestone, synchronization, communication. Write your plan: Organize the plan, covering all the bases, reviewing the plan. Case study. LAUNCH YOUR PROJECT (09) Rollout your roles: Identifying roles, matching people, highlighting commitments and dependencies. Schedule your schedule: Identify and schedule the tasks, assigning tasks to roles, creating a backup plan. Get your support: Hardware, software and tools support. Leaving the starting line: Directing the team, implementing the technology, capturing the measurement and monitoring the project. Case study. MANAGE TO STABILITY (09) Monitor your project: Gathering and understanding the information, avoiding problems, finding solutions. Reschedule your schedule, Engineer a great product: Requiring your requirements, design in quality, implementing smartly, testing effectively. Case study. COMPLETE A PROJECT (09) Deliver your system: Planning to finish, finishing a plan, supporting a product. Assess your Project: Planning project assessment, analyzing measurements, presenting the assessment results. Case study. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. Joel Henry, Software Project Management, Pearson Education, First Edition, 2004.
REFERENCES 1. 2. Kieron Convay, Software Project Management, Coriolis publication, 2003. Len Bass, Paul Clements and Rick Kazman, Software Architecture in practice, Pearson Education, 2004.
104
08S8E8 PARALLEL COMPUTING L 3 T 0 P 0 C 3
INTRODUCTION, PRAM ALGORITHMS, PROCESSOR ARRAYS, (09) MULTIPROCESSORS, AND MULTICOMPUTERS Parallel processing terminology- the sieve of Eratosthenes-Model of serial computation- PRAM model of parallel computation- PRAM algorithms- reducing number of processors- processor organizations, processor arrays, multiprocessors, multicomputers, Flynns taxonomy, speedup, scaled speedup and parallelizability. (09) PARALLEL PROGRAMMING LANGUAGES, MAPPING AND SCHEDULING, ELEMENTARY PARALLEL ALGORITHMS Programming parallel processes- FORTRAN 90- SEQUENT C- nCUBE C- OCCAM- C LINDAnotation for expressing parallel algorithms- Mapping data to processors- dynamic load balancing on multicomputers- static scheduling on UMA multiprocessors- deadlock- Classifying MIMD algorithmsreduction- broadcast- prefix sums. (09) MATRIX MULTIPLICATION, FAST FOURIER TRANSFORM, SOLVING LINEAR SYSTEMS Sequential matrix multiplication- algorithms for processor arrays, multiprocessors and multicomputersDiscrete Fourier transform- fast Fourier transform. Back substitution- odd even reduction- Gaussian elimination- Jacobi algorithm- Gauss Seidel algorithm- Jacobi and successive over relaxation- multigrid methods- conjugate gradient. SORTING AND DICTIONARY OPERATIONS (09) Enumeration sort- lower bounds on parallel sorting- odd even transposition sort- bitonic merge- quicksort based algorithms- random read and random write-Complexity of parallel search- searching on multiprocessors. (09) GRAPH ALGORITHMS AND COMBINATORIAL SEARCH Searching a graph- connected components- all pairs shortest path- single source shortest path- minimum cost spanning tree- Divide and conquer- branch and bound- parallel branch and bound algorithms- alpha beta search- parallel alpha beta search. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOK 1. Michael J. Quinn, Parallel computing-theory and practice, second edition, Tata McGraw-Hill, 2002.
REFERENCES 1. 2. Kai Hwang, Zhiwel Xu, Scalable Parallel Computing, McGraw-Hill International Editions,2000. Kai Hwang and Fayer A.Briggs, Computer architecture and Parallel processing, McGrawHill,1993.
105
08S8E9 NANO TECHNOLOGY AND APPLICATIONS L 3 T 0 P 0 C 3
INTRODUCTION TO SOLID STATE PHENOMENON (09) Intermolecular Forces: Thermodynamics aspects - Quantum Mechanical Treatment of the ManyParticle Problem - Potential Energy Surface - Pair Potential Approximation - Advantages and Limitations of the Pair Potential Approximation - Phenomenological Potentials - Pseudo-Potentials Many-Body Potentials. FUNDAMENTALS OF NANOSCIENCE (09) Size dependence of properties - Particle size determination - Bulk to nano transition - Semiconducting nanoparticles - Carbon nanostructures - Mechanical properties (hardness, ductility, elasticity) - Optical properties of nanotubes - Electrical properties of nanotubes. PREPARATION OF NANOSYSTEMS (09) Introduction to nanolithography - Carbon nanotubes: preparation - Synthesis and preparation of nanomaterials (crystalline and thinfilm) - Physical and chemical methods - Control and stability (size, shape, composition). CHARACTERIZATION OF NANOSYSTEMS (09) Thermal Stability Basic Material Properties Mean Values and Correlation Function X-ray diffraction Scanning Electron Microscopy Scanning tunneling Microscopy Electron Microscopy X-ray absorption spectroscopy Photoelectron emission spectroscopy. NANO-ENGINEERING: APPLICATION (09) Nanotubes, nanowires, nad nanodevices-introduction Functional Nanostructures Introduction to molecular electronics Field emission and Shielding Applications in computers Applications in fuel cells Applications in chemical sensors Applications in mechanical reinforcement Microelectromechanical systems (MEMs) Nanoelectromechanical systems (NEMs) Molecular and Supramolecular Switches. LECTURE : 45 TUTORIAL : 0 TOTAL : 45 Hours TEXT BOOKS Unit 1 and 2 1. Charles P. Poole and Frank J Owens, Introduction to Nanotechnology, Wiley Interscience, 2003 2. Crandall, B.C. and Lewis, James (Eds.), Nanotechnology: Research and Perspectives, MIT Press, 1922. Unit 3 and 4 3. P E J Flewitt, R K Wild, Physical Methods for Materials Characterization, 2nd Edition, Institute of Physics publishing, UK 2004. 4. Gottestein, Gunter (2004), Physical Foundations of Material Science, Springer Verlog. Unit 5 5. Cleland, Andrew N (2003), Foundation of Nanomechanics: From Solid-State Theory to Device Application, Springer Verlog.
106

Cse - Final PDF

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Cse - Final PDF

Uploaded by

Copyright:

Available Formats

2008 REGULATIONS

COMPUTER SCIENCE AND E N G I N E E R I N G F U L L T I M E B. E.

Curriculum & Syllabi (I - VIII SEM)

CANDIDATES ADMITTED DURING 2008 - 2009 AND ONWARDS

CURRICULUM FOR CANDIDATES ADMITTED DURING 2008-2009 AND ONWARDS

Sessional Marks I SEMESTER

Final Total Exam Marks Marks

08S1Z1 08S1Z2 08S1Z3 08S1Z4 08S105 08S106 08S1Z7 08S1Z8

100 100 100 100 100 100 100 100 800

Sessional Marks III SEMESTER

08S3Z1 08S302 08S303 08S304 08S305 08S306

100 100 800

08S401 08S402 08S403 08S404 08S405 08S406

100 100 100 100 100 100

100 100 800

Sessional Marks V SEMESTER

Final Total Exam Marks Marks

08S501 08S502 08S503 08S504 08S505 08S506

100 100 100 100 100 100

Unix Internals and Networking Lab Visual Programming Lab Total

100 100 800

08S601 08S602 08S603 08S604 08S605 08S606

100 100 100 100 100 100

Compiler Design Lab Software Engineering Lab

100 100 800

Sessional Marks VII SEMESTER

Final Exam Marks

08S701 08S702 08S703 08S704 08S7Ex 08S7Ex

100 100 100 100 100 100

100 100 800

Sessional Marks VII SEMESTER

08S1Z1 COMMUNICATION SKILLS IN ENGLISH I

08S1Z2 ENGINEERING MATHEMATICS I

08S1Z3 APPLIED PHYSICS

08S1Z4 APPLIED CHEMISTRY

08S1Z7 PHYSICS LABORATORY

08S2Z1 COMMUNICATION SKILLS IN ENGLISH II

08S2Z2 ENGINEERING MATHEMATICS II

08S2Z3 MATERIALS SCIENCE [COMMON TO ALL BRANCHES] L 3 T 0 P 0 C 3

08S204 ENVIRONMENTAL SCIENCE AND ENGINEERING

08S205 BASICS OF ELECTRICAL AND ELECTRONICS ENGINEERING

FUNDAMENTALS OF DC AND AC CIRCUITS

08S206 OBJECT ORIENTED PROGRAMMING AND C++

08S207 ENGINEERING GRAPHICS

08S3Z1 ENGINEERING MATHEMATICS III

08S302 DISCRETE MATHEMATICS

08S303 DATABASE SYSTEMS

08S304 DIGITAL SYSTEMS

08S305 DATA STRUCTURES AND ALGORITHMS I

08S306 JAVA PROGRAMMING

L 3 FUNDAMENTALS OF JAVA PROGRAMMING

08S307 INTEGRATED CIRCUITS LAB

08S308 JAVA PROGRAMMING AND DATA STRUCTURES LAB

08S401 NUMERICAL METHODS

08S402 COMPUTER ARCHITECTURE

08S403 MICROPROCESSORS, MICROCONTROLLER AND APPLICATIONS

08S404 COMMUNICATION ENGINEERING L 3 T 0 P 0 C 3

08S405 SYSTEMS PROGRAMMING AND OPERATING SYSTEMS

08S406 DATA STRUCTURES AND ALGORITHMS II

08S407 MICROPROCESSORS AND MICROCONTROLLERS LAB

SYSTEMS PROGRAMMING, OPERATING SYSTEMS AND RDBMS LAB

08S501 PROBABILITY , RANDOM PROCESSES AND QUEUING THEORY