Download the original attachment VIT ------VELLORE INSTITUTE OF TECHNOLOGY DEEMED UNIVERSITY VELLORE 632 014

SCHOOL OF COMPUTER SCIENCES A place to Learn ; A chance to grow

VIT ------VELLORE INSTITUTE OF TECHNOLOGY DEEMED UNIV ERSITY VELLORE SCHOOL OF COMPUTER SCIENCES M S (SOFTWARE ENGINEERING) DEGREE CURRICULUM FROM 2006 onwards I SEMESTER Sl.No Sub code Subject Name L T P C 1 06MSE101 Technical English I 4 0 0 3 2 06MSE103 Calculus and Analysis 4 0 0 3 3 06MSE105 Modern Physics* 4 0 0 3 4 06MSE107 Introduction to Computer Science* 4 0 0 3 5 06MSE109 Electronic Devices and Circuits* 4 0 0 3 6 06MSE111 Programming in C* 4 0 0 3 7 06MSE113L Electronic Devices and Circuit lab* 0 0 3 2 632 014

8 06MSE115L Programming in C lab* 0 0 3 2 Total 22 II SEMESTER 1 06MSE102 Technical English - II 4 0 0 3 2 06MSE104 Linear Algebra and Differential Equation 4 0 0 3 3 06MSE106 Advanced Physics* 4 0 0 3 4 06MSE108 Digital Computer Fundamental* 4 0 0 3 5 06MSE110 Object Oriented Programming* 4 0 0 3 6 06MSE112 Environmental Studies 4 0 0 3 7 06MSE114L Digital Computer Fundamentals Lab* 0 0 0 2 8 06MSE116L Object Oriented Programming Lab* 0 0 3 2 Total 22 III SEMESTER 1 06MSE201 Complex Variables and Partial Differential Equations 4 0 0 3 2 06MSE203 Microprocessor and Assembly Language Programming 4 0 0 3 3 06MSE205 Data Structures and Algorithms* 4 0 0 3 4 06MSE207 Computer Profession and Society* 4 0 0 3 5 06MSE209 Programming Practices and Coding Standards 4 0 0 3 6 06MSE211 Management Information Systems 4 0 0 3 7 06MSE213L Microprocessor and Assembly Language Programming Lab 0 0 0 2 8 06MSE215L Data Structures and Algorithms Lab* 0 0 3 2 Total 22

IV SEMESTER Sl.No Sub code Subject Name L T P C 1 06MSE202 Probability Statistics and Reliability 4 0 0 3 2 06MSE204 Computer Architecture and Organization* 4 0 0 3 3 06MSE206 System Programming* 4 0 0 3 4 06MSE208 Internet Programming* 4 0 0 3 5 06MSE210 Database Management Systems* 4 0 0 3 6 06MSE212 Theory of Computation* 4 0 0 3 7 06MSE214L Internet Programming Lab* 0 0 3 2 8 06MSE216L Database Management Systems Lab* 0 0 3 2 Total 22 V SEMESTER 1 06MSE301 Discrete Mathematical Structure 4 0 0 3 2 06MSE303 Software Engineering* 4 0 0 3 3 06MSE305 Operating Systems* 4 0 0 3 4 06MSE307 Computer and Communication Networks* 4 0 0 3 5 06MSE309 Open Source Programming - I 4 0 0 3 6 06MSE311 Management in Engineering 4 0 0 3 7 06MSE313L Computer and Communication Networks Lab* 0 0 0 2 8 06MSE315L Operating Systems Lab* 0 0 3 2 Total 22 VI SEMESTER 1 06MSE302 Graph Theory and its Applications 4 0 0 3 2 06MSE304 Networking Protocols and Standards 4 0 0 3 3 06MSE306 Software Architecture and Design 4 0 0 3 4 06MSE308 Requirements Engineering 4 0 0 3 5 06MSE310 Compiler Design* 4 0 0 3 6 06MSE312E Elective I 4 0 0 3 7 06MSE314L CASE Tools Lab - I 0 0 0 2 8 06MSE316L Compiler Lab 0 0 3 2 Total 22

VII SEMESTER Sl.No Sub code Subject Name L T P C 1 06MSE401 Project I 0 0 0 22 VIII Semester Sl.No Sub code Subject Name L T P C 1 06MSE402 Operation Research 4 0 0 3 2 06MSE404 Software Testing 4 0 0 3 3 06MSE406 Software Configuration Management 4 0 0 3 4 06MSE408 Open Source Programming - II 4 0 0 3 5 06MSE410 Elective II 4 0 0 3 6 06MSE412 Elective III 4 0 0 3 7 06MSE414L Software Testing Lab 0 0 3 2 8 06MSE416L Open Source Programming - II 3 2 Total 22

IX SEMESTER Sl.No Sub code Subject Name L T P C 1 06MSE501 Design Patterns 4 0 0 3 2 06MSE503 Software Inspection 4 0 0 3 3 06MSE505 Software Measurements 4 0 0 3 4 06MSE507 Software Quality and Process Improvement 4 0 0 3 5 06MSE509E Elective IV 4 0 0 3 6 06MSE511E Elective V 4 0 0 3 7 06MSE513L CASE Tools Lab - II 0 0 3 2 8 06MSE515L Software Measurements Lab 0 0 3 2 Total 22 X Semester 1 06MSE502 Project 0 0 0 22

* Common between B.Tech (IT) List of Electives Distributed Computing Mobile Communication Web Services Geographic Information System Data Warehousing and Data Mining Software Reengineering Image Processing Software Agents Digital Signal Processing Decision Support system Multimedia Computing E- Commerce Natural Language Processing Network Security Computer Simulation and Modeling Enterprise Resource Planning Intelligent Systems Embedded Systems 06MSE101 - TECHNICAL ENGLISH L C T P

4 Aim

To Learn Technical Communication Objective To Communicate Technical Information orally and verbally. Reading Skills Mechanics of reading Exposure to Technical English on a wide range of topics Skimming and scanning Extensive and Intensive reading.

Oral Communication (Listening & Speaking) Listening for specific information communicative functions Expressing a point of view. Description of speech organs Consonants, vowels and diphthongs. Writing Skills Paragraph writing Inductive, deductive, expository techniques, Note making Lette r writing (formal & informal) Descriptive writing, Essay writing. Communication Grammar Sentence patterns, Noun group, articles verbal group adverbial group vocabulary S tem, Prefixes and Suffixes modals and verbs Tenses. Text Book: Effective English for Technical Communication, by Dr.T.M.Farhathullah ssons First 6 Lessons 2002 Publisher orient Longman Reference Books: Wings of Fire (Extensive Reader) II Lessons & I 2003 university press. English Practice Book for Engineering Students, by Dr. T.M.Farhathullah 2000 Eme rald publisher. Mode of Evaluation: By Assignment, Seminars and Written Examinations First 6 Le

06MSE103 - CALCULUS AND ANALYSIS L 4 Aim To learn the fundamental concepts of applied mathematics, namely the Fourier ser ies and Vector Calculus. Objective To evaluate multiple integrals in Cartesian, Cylindrical and Spherical geometrie s. T 0 P 0 C 3

To learn the powerful language of vector calculus with physical understanding to deal with subjects such as Fluid Dynamics and Electromagnetic fields. To analyze a signal by constructing Fourier series to it. To understand the concept of convergence and divergence of series and the possib le conditions under which they can be differentiated / integrated. Single and Multivariable Calculus Geometrical Applications of Differential calculus: Radius of Curvature Cartesian and polar coordinates Tracing of curves (Cordioid, Laminscate, Cycloid)- Length of a plane curve. Partial differentiation: Functions of two variables-continuity concept, partial derivatives Total differential Differentiation of implicit functions- Taylor s exp ansion-Maxima and Minima-Constrained maxima and minima by LaGrange multiplier me thod-Jacobians-Differentiation under the integral sign-Leibnitz s rule (without pr oof). Multiple Integrals Beta, Gamma functions-interrelation- Evaluation of Integrals-Error function. Eva luation of Double integrals-Change of order of integration-Change of variables-P olar coordinates- Evaluation of Triple integrals-Cartesian, cylindrical and sphe rical coordinates. Vector Analysis Applications of Vector Algebra: Vector equations for a plane, straight line and Sphere-perpendicular distance of a point from a plane-perpendicular distance be tween parallel lines-tangent plane to a sphere at a point. Vector Calculus: Scalar and vector point functions-gradient-physical interpretat ion-Total derivative Directional derivative Divergence Curl Vector identities (w ithout proof) physical interpretation of divergence & Curl Scalar and vector pot entials Line, surface & volume integrals Green s, Stoke s, & Gauss divergence theore ms (without proof) related problems. Infinite Series Convergence & Divergence of series, Comparison test D Alembert s Ratio test Raabe s t est Logarithmic test Cauchy s root test Cauchy s integral test alternating series ibnitz z test Concept of Uniform convergence-Weierstrass M-Test-Theorems on Differ entiation and Integration of Fourier series (without proof). Fourier Series Representation by Fourier series-Functions having arbitrary period-Euler's formu las for the Fourier coefficients-even and odd functions-Half range series-Theore ms on Differentiation and Integration of Fourier series (without proof).

Text Books:

Erwin Kreysizig, Advanced Engineering Mathematics, 8th Edition., John Wiley & So ns, (Wiley student Edison) (2004). B. S.Grewal, Higher Engineering Mathematics, 38th Edition. Khanna Publications,( 2005). Reference Books: G.B.Thomas and R.L.Finney, Calculus and analytical geometry, 9th Edition, Pearso n Education, 5th Indian Reprint, (2002). Michale D. Greenberg, Advanced Engineering Mathematics, 2nd Edition, Pearson Edu cation, First Indian reprint,(2002). R. Courant and F.John, Introduction to Calculus and Analysis, Vol.II, Wiley-Inte r Science Pub. (1974) Peter V. O Neil, Advanced Engineering Mathematics, 5th Edition, Thomson, Book/Col e. (2003). C. Ray Wylie, Advanced Engineering Mathematics, 6th Edition, McGraw Hill,(1995). Mode of Evaluation: By Assignment, Seminars and Written Examinations

06MSE105 MODERN PHYSICS L T P 4 Aim : 0 0

C 3

To enable the students to understand the basics of latest advancement in Physics namely Quantum Mechanics, Laser and its applications, Fiber Optics and its appl ications, Ultrasonic, Microwaves and Nuclear Physics. Objective : It will be the base to understand the concepts involved in all branches of Engin eering and Technology. Quantum Physics Dual nature of electron magnetic radiation de Broglie waves compton effect exper imental verification Heisenberg uncertainty principle Schrodinger equation appli cation particle in a box (ID) Application of Quantum Mechanics problems. Contents Laser Laser characteristics Einstein s coefficients its significance population inversio n three level- four level laser gain coefficient threshold gain coefficient CO2 He Ne laser welding, drilling, cutting optical disk systems recording data reado ut from optical disks Problems. Fiber optics Light propagation through fibres Acceptance angle numerical aperture types of fi

bres step index, graded index single mode-multimode dispersion model application of fibre optics in communication - source LED todiode endoscope problems. Ultrasonics and microwaves

inter model intra Detector PIN pho

Properties generation magnetostriction method piezo electric method f ultrasonics applications NDT characteristic features of micro waves unn diode applications of microwaves. Nuclear Physics

detection o klystron G

Nuclear forces Einstein s mass energy relation (derivation) Binding energy mass de fect energy released in nuclear fission critical size four factor formula. Nucle ar reactor Fast Breeder reactor Nuclear Power plant. Text Books Physics for engineers Department of physics, VIT 2005. Concepts of Modern Physics by Arthur Beiser, 6th edition, Tata-Mc Graw Hill Edit ion (2003) Reference books: William Silfvast, Laser fundamentals, Cambridge University Press (2002). Djafar K. Mynbaeu, Fibre Optic Communication Technology, Pearson Education Asia( 2004) C. Kittel, Solid State Physics, John Wiley & Sons, Seventh edition (2001) Irving Kaplan, Nuclear physics, Narosa publishing house (2002) V.Rajendran and A. Marikani, Applied physics & Engineers, 3rd edition, Tata Mc. Graw-Hill (2003) K.C. Gupta, Micro waves, New Age International Ltd. (2000) Mode of evaluation: Written Examination, Assignments, Seminars and Mini projects 06MSE107 - INTRODUCTION TO COMPUTER SCIENCE L T P C 4 Aim To establish knowledge in basics of computer science Objectives Exposure to fundamentals of computer science and Information technology. Introduction to Computer Science & IT 0 0 3

Information systems Software and data IT in business, Industry, Home at Play, Ed ucation, Training, Entertainment, Arts, Science, Engineering and Mathematics Com puters in Hiding Global Positioning System (GPS) Types of Computers Anatomy of a Computer Foundations of Modern Information Technology The Central Processing Unit Buses for Input and Output Text and Graphics State of the Art rn Output Display Screens Modern Storage Storage Media rd Increasing Data Storage Capacity Backing up your Data The Smart Ca Printers How Microprocessors and Memory Chips are Made Communication With Peripherals Input and Output I/O Devices Memory Inputting

Pointing Devices- Foundations of Mode

Software and Software Issues User Interface Application Programs Operating Systems Document Centric Computing

Network Computing se Applications ks

Word Processing and Desk top Publishing

Spreadsheet and Databa Local Area Networ High Bandwidt

Network Applications

Foundation of Modem Networks

Wide Area Networks h Personal Connections Multimedia on Web Text Book:

Links between Networks Multimedia

Networks: Dial up Access

Tools of Multimedia

Delivering Multimedia

Information Technology Reference Books:

The Breaking Wave, D.p.Curtin, K.Foley, K.Sen TMH

2002

1.Using Information Technology TMH 2003, 5th edition

Brief Version, Sawyer, Williams and Hutchinson,

Fundamentals of Information Technology, Alexis Leon and Mathews Leon, Vikas Publishing 1999 Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE109 ELECTRONIC DEVICES & CIRCUITS *

L 4 Aim

T 0

P 0

C 3

The subject covers most of the basic devices and their functioning, application and selection of apt devices to achieve a particular circuit function. Objective The students would become aware of the ranges with respect to frequency, tempera ture, power ratings etc. The operational requirements such as proper heat sink a rrangement etc. shall be provided. UNIT I: Semiconductor Basis- Review of extrinsic semiconductor drift and diffusi on currents thermal generation of minority carriers Hall Effect. Junction Diodes - Energy band diagram pn junction junction diode volt ampere characteristics rat ings transition and diffusion capacitance varactor diode avalanche and Zener bre ak down Zener diode tunnel diode PIN diode, clipper and clamper circuits. UNIT II: Bipolar Junction Transistor- Principle of transistor action current com ponents cutoff, active and saturation region input and output characteristics CE , CB, & CC Configurations small signal and large signal beta transistor breakdow n ratings Thermal runaway problems Use of Heat sinks. UNIT III: FET And Other Devices- Constructional features and characteristics of JFET and MOSFET depletion and enhancement modes VVR operation of FET handling pr ecautions for MOSFET construction and characteristics of UJT, fabrication and ch aracteristics of four layer devices such as SCR, Triac and Diac. UNIT IV: Photo Electric Devices- Photo emissivity-photo electric theory-Photo di odes Photo voltaic cell LED & LCD Photo multiplier circuit Light absorption and photo devices Photo conductive cell (LDR) Photo transistor PN junction LASER Sol ar energy converters. UNIT V: Electronic Circuits-Half wave and full wave rectifier circuits performan ce characteristics of rectifier circuits filter consideration capacitor, inducto r, L section, RC section filters Voltage regulators current regulators, IC volta ge regulators protection circuits for dc power supplies switched mode power supp lies. TEXT BOOK: 1. G.K. Mithal, Electronic Devices & Circuits , Khanna Publishers, New Delhi, 2001.

REFERENCE BOOKS:

1. Ben.G. Streetman,

Solid state electronic devices , Prentice Hall of India, 1999.

2. S.P. Mathur, D.C. Kulshreshtha and P.R. Chanda, Electronic Devices and Applica tions of Integrated Circuits , 1998. 3. J. Millman, C.C. Halkias, Electronic Devices and Integrated Circuits , McGraw Hi ll, 1997. Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE111- PROGRAMMING IN C L T P C 4 Aim To understand the basics of C Objective To know the basic C atements, programming constructs like data types, operators, decision st Programming. 0 0 3

Control statements, functions, arrays and pointers. Fundamentals of C Programming C fundamentals - character set - identifier and key works - data types - constants - variables - declarations - expressions - statem ents - arithmetic, unary, relational and logical, assignment and conditional ope rators - liberty functions. Primitive structures in C Data input/output functions - simple C programs flow of control - control structures - switch, break and continue go to statements - com ma operator Functions Functions - defining, accessing functions - function prototypes - pass ing arguments - recursions - storage classes multi file programs. Arrays and Structures Arrays - defining and processing - passing array to functi ons - multidimensional arrays - arrays and string structures - passing structure s to functions - self referencing structures - unions Pointers Pointers - declarations - passing pointers to function - operation in p ointers - pointer and arrays of pointers structures and pointers - files: creati ng processing, opening and closing - bit wise operations. Text Book: Kamthane - Programming with ANSI and Turbo C , Pearson Education, 2002. Reference Books

1.

Narain Gehani

C Advanced Introduction

Universities Press

2004.

Noel Kalicharan C by Example Cambridge university Press-1996. Kamthane - Programming with ANSI and Turbo C 2002. Herberet Schildt The Complete Reference, TMH, 4th Edition, 2000 Mode of Evaluation: By Assignment, Seminars and Written Examinations

06MSE113L ELECTRONIC DEVICES CIRCUITS LAB*

L 0 3

T 2

C 0

LIST OF EXPERIMENTS: Study of CRO and measurement of amplitude frequency time period and phase angle. Forward and reverse characteristics of PN junction diode. Characteristics of Zener diode and study of its power ratings. Input and output characteristics of BJT (CE CB CC) and graphical determination o f h-parameters. Drain and transfer characteristics of JFET and graphical determination of transc onductance. Static emitter characteristics of UJT and PUT. V-I characteristics of SCR and TRIAC. Switching characteristics of BJT SCR and MOSFET. V-I characteristics of tunnel diode and varactor diode. Study of Logic Gates (AND OR NAND NOT EXOR gates). Study of Flip flops (D T JK SR flipflops). Design and testing of Half and Full adders. Design and testing of Half and Full subtractor. Implementation and testing of 3 bit binary ripple counter. Implementation and. testing of code convertors. Implementation and testing of Multiplexers. Implementation of shift registers using flip-flops. Study of decade counter using flip-flops. 06MSE115L PROGRAMMING IN C LAB L T P C 0 0 3 2

LIST OF EXPERIMENTS 1. Determining a given number is prime or not. 2. Pascal s Triangle. 3. String Manipulation.

4. Matrix Multiplications. 5. Finding Determinant of a Matrix. 6. Finding inverse of a Matrix. 7. Checking for Tautologies and Contradictions. 8. Euclidean s Algorithms for finding GCD. 9. Generating Permutations. 10. Computing Combinations. 11. Creating database for telephone numbers and related operations Use file conc epts. 12. Creating database for Mailing addresses and related operations Using Struct ures. 13. Creating database for Web page addresses and related operations using point ers. 14. File Processing.

06MSE102 - TECHNICAL ENGLISH

II

L 4 Aim

T 0

P 0

C7 3

To improve the technical communication for the students. Objective To expertise in Technical report generation. Reading Skills Global and local perception interpreting charts and tables use of reference mate rial evaluating texts understanding discourse features and writer s opinion. Oral Communication (Listening & Speaking) Discussion role play-guided note taking. Stress, strong and weak forms, intonation. Writing Skills Business letters Technical report - Laboratory report advanced essay writing w charts, tables, graphics Description of instruments and machines. Communication Grammar Tenses revisited sequence of tenses-comparison of adjectives and adverbs ty use of imperatives conditionals concord - Preposition + relative. Text Book: Dr. T.M. Farhathullah - Effective English for Technical Communication - Emerald Publisher - 2001 Reference Books: 1. A.P.J Abdul Kalam - Wings of Fire (Extensive Reader) I & II Lessons - Univer sity Press. 2. Dr.T.M. Farhathullah - English Practice Book for Engineering Students - Emer ald Publisher, 2000. Mode of Evaluation: By Assignment, Seminars and Written Examinations flo

passivi

06MSE104 LINEAR ALGEBRA AND DIFFERENTIAL EQUATIONS L T P C 4 Aim To give a comprehensive coverage to the subject of ordinary differential equatio 0 0 3

ns and matrices. Objective To know how to model a simple physical problem in the form of a differential equ ation and analyze it. Matrices The eigen value problem solution symmetric matrices- Theorems concerning eigen v alue and eigen vectors Quadratic forms Diagonalization Orthogonal reduction- pos itive definite forms Systems of linear differential equations- Model of a vibrat ing systems with two masses-Solution by matrix methods. Linear Differential Equations of Higher Order Linear differential equation with constant coefficients Rule for finding the com plementary function and particular integral method of undetermined coefficients variation of parameters technique Equation reducible to linear equations with co nstant coefficient Cauchy Euler equations-simultaneous linear equations with con stant coefficients. Power Series Solutions The Strum-Liouville Problem-orthogonality of eigen functions, Bessel s and Legendr e s equations- Power series solutions method of Frobenius Legendre functions Besse ls functions orthogonality relations (Proof not required) Fourier Bessel and Fou rier Legendre series generating functions recurrence relations. Laplace Transforms Definition-Laplace transform of functions-properties of Laplace transforms Initi al and Final value theorems Inverse transform Transform of periodic function con volution theorem step function, Impulse function-concept of transfer function-ap plication to the solution of differential equations. Application of Differential Equations First order equations: Newton s law of cooling radioactive decay, L-R and C-R circ uits-Equation of motion for a particle in gravitational field Terminal velocity. Second order equations: Motion of a body in a resisting medium, Motion of an ele ctron in a uniform magnetic field. Mechanical Vibrations: Free undamped and damped vibrations, Forced oscillationsResonance phenomenon. Electrical Vibrations: series LCR circuit, Analogy with mass-spring system, LCR circuit with voltage source, complex impedance, and Resonance phenomena. Text Books: Erwin Kreysizing, Advanced Engineering Mathematics, 8th Edition, John Wiley & So ns, (Wiley student Edison)(2004). B.S.Grewal, Higher Engineering Mathematics, 38th Edition. Khanna Publications(20 05). Reference Books: 1. W.E.Boyce and R.C. Diprima, Elementary differential equations, 7th Edition. J

ohn Wiley & Sons, Inc.(2002). 2.Michale D. Greenberg, Advanced Engineering Mathematics, 2nd Edition, Pearson E ducation, First Indian reprint (2002). Peter V. O Neil, Advanced Engineering Mathematics, 5th Edition, Thomson, Book/Col e (2003). C. Ray Wylie, Advanced Engineering Mathematics, 6th Edn, McGraw Hill (1995). Gary L. Peterson, Linear Algebra and Differential Equations, Addison-Wesley (200 2). Mode of Evaluation: By Assignment, Seminars and Written Examinations

06MSE106 ADVANCED PHYSICS L 4 T 0 P 0 C 3

Aims & Objectives: To enable the students to understand the nature of different types of materials namely Dielectrics, Magnetic, Semi conducting, Conducting and Superconducting ma terials. Dielectrics Introduction Dielectric parameters various polarization mechanisms in dielectric s and their frequency and temperature dependence Lorentz field Clausius Mosotti relation dielectric loss dielectric strength dielectric break down different typ es of dielectric breakdown problems. Magnetic Materials Origin of magnetic moment Bohr magnetron properties of dia, para, ferro, antifer ro and ferri magnetic materials Ferromagnetism Domain theory of ferromagnetism H ystersis soft and hand magnetic materials Antiferromagnetic materials floppy and magnetic disk drives magnetic memories ferrite core memory and bubble memory Semiconducting Materials Band theory of solids Semiconductors classification intrinsic, extrinsic-n type, p type-direct, indirect band gap - electron hole pair formation and recombinati on radiative and non radiative band to band recombination - structure of Si and Ge Variation of Fermi level with carrier concentration and temperature in n type solar cell Problems. Conducting Materials Conducting Materials : Free electron gas ivity relaxation time drift velocity thiessen s rule, Hall effect problems. Drude Lorentz theory thermal conductivity electrical conduct Wiedmann Franz law Mat

Superconducting materials Zero resistance source of superconductivity properties effect of magnetic field Meissner effect critical current isotope effect type I and II superconductors BC S theory London equations (I&II) Josephson effect (AC & DC) application cryotron SQUIDS problems. Text books: 1. Physics for engineers Department of Physics, VIT 2005.

2. Materials Science and Engineering by V.Raghavan, Prentice Hall, 4th edition 2 000. Mode of evaluation : Written Examination, Assignments, Seminars and Mini projects

06MSE108 DIGITAL COMPUTER FUNDAMENTALS* L 4 Aim The subject aims to impart the knowledge about digital logic fundamentals, des ign steps involved in flip-flop, shift register, designing a simple computer whi ch is capable of providing few arithmetic and logical operation. Objectives The students shall be able to understand boolean laws, boolean algebra, boolea n logic, logic gate fundamentals, function of flip-flop and shift register, arit hmetic and Logic unit, understand the memory representation in ROM, RAM and CPU. UNIT I: Number Systems and Boolean Algebra- Number systems converting number fro m one base to another complements algorithms for r s and r-l s complements sign. Flo ating point representation.Codes- Binary decimal, error detection reflection alp hanumeric codes. Basic laws, theorems and properties of Boolean algebra Boolean functions canonical and standard forms logical operations logic gates Karnough map up to 6 variables SOP and POS simplification don t care condition tabulation m ethod. UNIT II: Combinational Logic Design-Adder subtractor code conversion analyzing a combinational circuit multi level NAND and NOR circuits binary parallel adder d 0 0 3 T P C

ecimal adder RCD adder

Magnitude comparator

decoders

demultiplexer.

Sequential Logic Design- Flip flops triggering of flip flop analyzing a sequenti al circuit state reduction excitation tables counters design with state equation registers shift registers ripple and synchronous counters. UNIT III: Processor Organization-Memory unit inter register transfer micro opera tions bus organization scratch pad memory ALU design of ALU - status register e ffect of o / p carry design of shifter processor unit design of accumulator. UNIT IV: Control Logic Design- Control organization PLA control microprogram con trol hardwired control microprogram sequencer microprogrammed CPU organization. UNIT V: Computer Design- Computer configuration instructions and date formats in struction sets timing and control execution of instruction design of computer de sign of control. TEXT BOOK: Morris M. Mano, "Digital Design", Third Edition, Prentice Hall India, 2001 REFERENCE BOOKS: 1.Thomas C. Bartee, "Computer Architecture Logic Design", Tata McGraw Hill 1997. 2.A. P. Malvino and D. P. Leach, Digital Principles and Applications , 4th edition, McGraw Hill 1999. Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE110 OBJECT ORIENTED PROGRAMMING * L T C 4 Aim The subject aims to impart the knowledge about the evolution of C++ language, fe atures of Object-oriented Programming and focuses on generic programming with te mplates and Exception handling. Objectives Students will be able to know the fundamentals of object oriented programming and use OOPs features such as inheritance, polymorphism, and templates. UNIT I: Object Oriented fundamentals- Structured versus object-oriented developm ent, elements of object oriented programming, fundamentals of OO-class, object, and abstraction and its importance, encapsulation, polymorphism, benefits of OOP , structure of C++ program. UNIT II: Working with classes- Classes and Objects- Class specification, class o bjects, accessing class members, defining member functions, inline functions, ac cessing member functions within class, data hiding, class member accessibility, 0 0 3

empty classes, constructors, parameterized constructors, constructor overloading , copy constructor, new, delete operators, this pointer, friend classes and friend functions. UNIT III: Overloading-Function overloading, operator overloading- overloadable o perators, unary operator overloading, operator keyword, limitations of increment /decrement operators, binary operator overloading, arithmetic operators, concate nation of strings, comparison operators, Generic programming with templates-Func tion templates, class templates. UNIT IV: Inheritance- Base class and derived class relationship, derived class d eclaration, Forms of inheritance, inheritance and member accessibility, construc tors in derived class, destructors in derived class, constructor invocation and data member initialization, data conversion, abstract classes, virtual base clas ses, virtual functions. UNIT V: Files and Streams-Opening and Closing a file, file modes, file pointers and their manipulation, sequential access to a file, ASCII and binary files, ran dom access to a file, error handling during file manipulations, Exception handli ng-exception handling model, exception handling constructs, lists of exceptions, catching exceptions, handling exceptions. TEXT BOOK : 1. K.R.Venugopal, T.Ravishankar, and Rajkumar, "Mastering C++ , Tata McGraw Hill, 1997 REFERENCE BOOKS: 1. E.Balagurusamy, McGraw Hill Object Oriented Programming with C++ , 2nd Edition, 2004, Tata

2. Bjarne stroustrup, The C++ programming Language , Addison Wesley, 3rd edition, 1988. Mode of Evaluation: By Assignment, Seminars and Written Examinations

6MSE112 ENVIRONMENTAL STUDIES L C 4 0 0 3 T P

Aim : The subject aims to impart knowledge about natural resources, ecology, env ironmental pollution, Role of information technology in welfare of population an d protection of environment. Objectives : The students shall be able to learn about various natural resources , concepts of ecosystem, bio-diversity, pollution, population explosion, welfare

programmes and role of Information technology in protection of environment. UNIT I: Environment & Natural Resources- Definition, Scope, importance, need for public, Natural Resources use, exploitation, deforestation, construction of multipurpos e dams effect on forests, Water resources use of surface and subsurface water, e ffect of floods, drought, water conflicts, Mineral resources use and exploitatio n, environmental effects of mining, food resources food problems, advantage and disadvantage of fertilizers & pesticides, effect on environment, Energy resource s need to develop renewable energy, land resources Land degradation, land slides , soil erosion, desertification & case studies. UNIT II: Ecology- Concept of ecosystem, structure & function of an ecosystem, producers, consumers and decomposers, energy flow, ecological succession, food chains, food webs and ecological pyramids, various characteristics features of forest, grass land, desert, aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuari es). Bio-diversity-Definition, genetic, species and ecosystem diversity, biogeographi cal classification of India, Values consumptive use, productive use, social, eth ical, aesthetic and option values, hotspots, threats related to habitat loss, pa oching of wildlife, man-wildlife conflicts, endangered and endemic species of In dia, Conservation of biodiversity. UNIT III: Environmental Pollution- Definition - Causes, Pollution effects and control meas ures of Air, Water, Soil, Marine, Noise, Thermal, Nuclear hazards. Solid Waste m anagement: causes, effects and control measures of urban and industrial wastes, pollution measures, case studies, Disaster management: floods, earthquake, cyclo ne and landslides. UNIT IV: Urban problems related to energy & sustainable development, water conservation, rain water harvesting, watershed management, problems related to rehabilitation case studies, Environmental ethics- Issues and possible solutions, Climate chang e, global warming, acid rain, ozone layer depletion, nuclear accidents and holoc aust case studies, Wasteland reclamation, Consumerism and waste products Environ ment Protection Act, Air, Water, Wildlife, Forest Conservation Act, Environmenta l legislation and public awareness UNIT V: Human Population and the Environment- Population growth, variation among nations , population explosion Family Welfare Programme, Environment and human health, H uman Rights, Value Education, HIV / AIDS, Women and Child Welfare, Role of Infor mation Technology Case Studies. Field Work- Documenting environmental assets river / forest / grassland / hill / mountain, Visit to local polluted site Urban / Rural / Industrial / Agricultura l, Study of common plants, insects, birds, Study of simple ecosystems pond, rive

r, hill slopes, etc., - Field Visits.

TEXT BOOKS: Erach Bharucha, University Grants Commission, Brunner RC, 1989, Hazardous Waste Incineration, McGram Hill Inc. 480 pgs. REFERENCE BOOKS: Cunningham WP, Cooper TH, Gorhani E & Hepworth MT, 2001. Enviromental Encyclopae dia, Jaico Publishing House, Mumbai, 1196 pgs. De AK, Environmental Chemistry, Wiley Eastern Ltd. Down to Earth, Center for Science and Environment(R) Odum EP, 1971. Fundamentals of Ecology, WB Saunders Co. USA, 574 pags. Rao MN and Datta AK, 1987. Waste Water Treatment. Oxford and IBH Publishing Co. Pvt. Ltd. 345 pgs. Mode of Evaluation : By Assignment, Seminars and Written Examinations

06MSE114L - DIGITAL COMPUTER FUNDAMENTALS LAB L 4 0 T 0 P 3 C

Design a Half adder and a Full adder using NAND gates only. Cascade them to impl ement a 2 bit binary adder. Design and implement Excess-3 to BCD code converter using logic gates. (Choice of Logic gates left to the student) Design and implement using NAND gates : 4:1 multiplexer 2:4 decoders Design and implement the following the following using 4-bit adder chip and gate s. Excess-3 to BCD code converter BCD to Excess-3 code converter Design and implement a full adder using a multiplexer. Also implement a multiple xer tree using 3 multiplexes.

Design and implement using decoder and other gates a. Full adder b. Full subtractor. Design and implement a 3 variable Boolean SOP expression using 2 numbers of 4:1 multiplexer IC. Design and implement a 3 stage asynchronous counter using J-K flip flops to coun t down from 7 to n (n>0). Display result on discrete LEDs and the waveform on CR O. Design and implement asynchronous counter using a Decade counter IC to count up from 0 to n (n<9). Display count value on 7 segment LED display using BCD to 7 s egment code converter IC. Design and implement to display result suitably: Asynchronous counter using 4 bit binary counter IC to count up from 0 to n ( n<=15). b. Asynchronous counter to count up to FFH using 2 stages of such an IC.

Design and implement Mod n (n<8) synchronous counter using flip flops. Display result suitably. Design and implement a 3-stage up/down counter that counts from a preset value using Decade presettable counter ICs. Display result suitably. Design and implement using 4-bit shift register IC: a. Johnson counter b. Ring counter Design and implement the following: a. Oscillator for a given frequency using Schmitt trigger inverter and RC components. b. Crystal controlled clock using CMOS inverters. 06MSE116L OBJECT ORIENTED PROGRAMMING LAB* L 0 T 0 P 3 C 2

LIST OF EXPERIMENTS Program illustrating function overloading feature. Programs illustrating the overloading of various operators

Ex : Binary operators, Unary operators, New and delete operators etc. Programs illustrating the use of following functions : a) Friend functions b) Inline functions c) Static Member functions d) Functions with default arguments. Programs illustrating the use of destructor and the various types of constructor s (no arguments, constructor, constructor with arguments, copy constructor etc). Programs illustrating the various forms of inheritance : Ex. Single, Multiple, multilevel, hierarchical inheritance etc. Write a program having student as on abstract class and create many derived clas ses such as Engg. Science, Medical, etc. from students class. Create their objec ts and process them. Write a program illustrating the use of virtual functions. Write a program which illustrates the use of virtual base class. Write programs illustrating file handling operations: Ex. a) Copying a text file b) Displaying the contents of the file etc. Write programs illustrating how exceptions are handled (ex: division-by-zero,ove rflow and underflow in stack etc) 06MSE201 COMPLEX VARIABLES AND PARTIAL DIFFERENTIAL EQUATIONS L T P C 4 0 0 3

Functions Of A Complex Variable Functions of a complex variable, limits and continuity, Cauchy Riemann equations , Analytic and Harmonic functions Complex potential Applications to flow around a corner and around a cylinder, Brach prints, branch cuts, linear transformation s . (w = zA+B, w = z2 ,w= ez), Bilinear transformation, concept of conformal transfo rmation Qualitative discussion on applications. Complex Integration Integration in the complex plane along a contour, the Cauchy-Goursat theorem, in tegral theorem Derivatives of analytic functions, Taylor and Laurent series(with out proof's) singularities Zeros Poles, Residues, Cauchy s Residue theorem Evaluat ion of integrals by the method of residues , Jordan s lemma (without proof), Inden ted contour integral, Inversion contours for Laplace, Fourier and Z transforms. Partial Differential Equations Introduction Formation of PDEs Solution of PDE General, Particular and Complete integrals Lagrange s Linear Equations Linear PDE of Higher order with Constant Coe fficients Homogeneous and non homogeneous equation Solution of PDE s by the metho d of separation of variables. Applications Of Partial Differential Equations Solution of Laplaces equations in Cartesian, Cylindrical and Spherical coordinat es variable separable method: Potential flow over a sphere.

Wave Equation-Vibrations of a Stretched string-Variable Separable Method- D Alembe rt s solution for the initial value problem, Vibrations of a circular membrane Dif fusion equation in Cartesian and Cylindrical coordinates. Integral Transforms Difference Equations and Z-transforms: Difference equations with constant coefficients-Complementary function, particul ar integral method of undetermined co-efficient, variation of parameters techniq ue (without proof), application to ladder type electrical network. Z-transform d efinition relation between Z transform and Laplace transform, Z-transform of ele mentary functions, properties of Z-transforms (proofs not required) Initial and final value theorems- Inverse Z-transforms partial fraction expansion method, In version contour method-solution of difference equations by Z- transform method. Exponential Fourier seires Fourier Integral Transforms Definition Fourier Integr al Fourier sine and cosine transforms; - Properties of Fourier transforms Convol ution theorem for Fourier transforms Parseval s identity for Fourier transforms (p roof not required) -Application of Integral Transforms to Partial differential e quations: (i) Heat flow in an infinite bar (ii) Wave propagation on a semi infin ite string (iii) Steady state heat flow in a semi-infinite domain. Text Books: Erwin Kreyzsizig, Advanced Engineering Mathematics, 8th Edition, John Wilag & So ns (Wiley student Edison) (2004). B. S. Grewal, Higher Engineering Mathematics, 38th Edition, Khanna Publications (2005). Reference Books: J. W. Brown and R.V. Churchill, Complex variables and application, Mc Graw Hill International ed., 7th Edition (2004). R. V. Churchill and J. W. Brown, Fourier series and Boundary value problems, Int ernational student edition (1978) . Ian Sneddon, Elements of Partial Differentail equations, MC Graw Hill Internatio nal edition (1985). MichaelD. Greenberg, Advanced Engineering Mathematics, 2nd Edition, PearsonEduca tion (2002). Mode of Evaluation: By Assignment, Seminars and Written Examinations

06MSE203 - MICROPROCESSORS & ASSEMBLY LANGUAGE PROGRAMMING L 4 Aim T 0 P 0 C 3

To understand the basic concepts of Micro processors and assembly language progr amming Objective: To understand the Architecture and working principles of various Microprocessors (8086 / 8088 ) To learn the interfacing of peripheral devices. To Code in assembly language Learning Outcome: Exposure to Microprogramming. Introduction Introduction to Microprocessor, Microprocessor-Based Computer Systems, Architect ure Of 8086/8-88, Programmer s Model Of 8086/8088, Segmentation And Memory Address ing In 8086/8088. Assembly language programming Assembly language, assemblers for the PC, addressing modes of 8086. Data movemen t instructions excluding string instructions, instruction encoding, assembling, linking and executing programs; arithmetic and logical instructions. String instructions, debugging programs, programming examples; program flow cont rol instructions. Machine control AND miscellaneous instructions, programming ex amples, modular program development: use of linker, library, macros and conditio nal assembly. Hardware features of 8086/8088 Pin-outs an pin functions, clock generator, bus buffering, latching and timing d iagrams, ready and wait state, min/max modes of operations. Memory interfacing Memory devices, address decoding, 8/16 bit memory interfacing, DRAM memory syste m Interrupt System and PIC (8259 A), I/O Interfacing Introduction to interrupts, Interrupt-related instructions, Interrupt processing , 8259A PIC and Interfacing of 8255 and 8254 devices- Application Examples. References: Barry B.Brey, The Intel Microprocessors, Fourth Edition, Prentice-Hall India, 19 97. K.UdayaKumar and B.S.Umashankar., Advanced Microprocessors And IBM PC Assembly Language Programming, Tata McGraw Hill, 1996. Doughlas V Hall., Microprocessors And Interfacing, Programming And Hardware, Sec

ond Edition, McGraw Hill, 1992. Michael Throne, Computer Organization And Assembly Language Programming, Addison -Wesley, 1991. Rajaraman & Radhakrishna, Essentials of Assembly Language Programming for The IB M PC, PHI 1999. Mode of Evaluation: By Assignment, Seminars and Written Examinations

06MSE205- DATA STRUCTURES AND ALGORITHMS* L T P C 4 0 0 3

Aim This subject aims to impart knowledge about various types of data structures (s tandard and user defined) It covers algorithm analysis for the run time complexi ties and the space requirements. Objective To make the Students learn various types data structures algorithm analysis. The students would be able to implement various data structures and apply operation s on them and also implement various sorting and searching techniques. UNIT I: Algorithm Analysis-Mathematical background model running time calculatio ns complexity analysis abstract data types asymptotic notations. UNIT II: Stacks & Queues- Stack ADT stack model implementation of stacks applica tions of stacks infix, prefix and postfix expressions and their conversions, Queu e ADT queue model array implementation of queues,List ADT simple array implement ation of lists linked lists doubly & circular linked lists cursor implementation of linked lists polynomial addition and multiplication, Overview of Garbage coll ection & Compaction UNIT III: Trees-Preliminaries implementations of trees tree traversals (inorder, preorder, postorder) binary trees implementation expression trees binary search trees threaded binary trees B trees B+-trees hashing hash function, depth first search & breadth first search shortest path algorithm. UNIT IV: Insertion sort and its analysis, Shell sort, Heap sort and its analysi s, merge sort and its analysis, quick sort and its analysis, bucket sort, select ion sort, external sort. UNIT V: Algorithm Design Techniques- Divide & Conquer Algorithm Strassen s matrix multiplication and its analysis, Greedy Method- knapsack 01, Dynamic Programming - traveling salesman problem, Back Tracking- 8 queens problem, Branch and Boundtravelling salesperson problem algebraic manipulations, Lower Bound Theory- Bas ic concepts of NP-hard and NP-complete.

TEXT BOOK: Mark Allen Weiss, Data Structures & Algorithm Analysis in C++ , Addison Wesley , 20

04. REFERENCE BOOKS: E. Horowitz, S. Sahni and S. Rajesekar, Computer Algorithms , Galgotia-1999. Jean-Paul Tremblay and Paul. G. Sorenson, An Introduction to Data Structures with Applications , Tata McGraw Hill, 1991. Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE207 COMPUTER PROFESSION AND SOCIETY* L 4 Aim To provide the concept of computer profession and how it helps the society Objectives To emphasis the students to adhere the ethics, issues related to ethics COMPUTER ETHICS Introduction: What is computer ethics?; Philosophical Ethics; Professional Ethic s; The Social Implication of Computers: Autonomy and Access.Ethics and Ethical D ecision Making Why we should care about Ethics, Computer Ethics and Regular Ethi cs, Competing Factors that affect our behavior, Value judgements, The types of e thical choices, Making defensible decisions. Ethics and Information Technology N ew Technologies, New Problems, Why is Ethical Computer Use a Special Challenge? What is Unethical computer use? ETHICAL ISSUES AND ETHICAL DECISION Property rights in Computer Software; Computers and Privacy; Crime, Abuse, and H acker Ethics; Responsibility and Liability. Solving Ethical Dilemmas: A Sample Case Exercise-A Four-Step Analysis Process, Sample Case-Too much of a good thing ?, Discovering an Ethical Dilemma, Using the Four-Step process. Select CasesAbort, Retry, Ignore: Recovery of Data leads to Discovery Of Confidential File Messages from All Over: Who controls the content of Email and BBS? Charades: A Stolen Password and its After-Effects. Trouble in Sardonia: Do Copyright Ethics Change Overseas? Ethics Codes and Polices : The need for Codes and Polices, An Email Privacy Poli cy, An Internet Use Policy. COMMUNICATION AND PERSONAL SKILL Communicating at work- The importance of Communication, The nature of Communicat ion, Using communication networks, choosing the optimal communication channel; C ommunication, Culture, and Work- Cultural Diversity and Communication, Organizat ional Culture. Verbal and Nonverbal Messages Verbal messages, Sexual harassment, T 0 P 0 C 3

Nonverbal Communication; Listening The Importance of Listening, Barriers to eff ective listening, Approaches to listening, Reasons for listening; Interpersonal Skills- Building Positive relationships, Dealing with criticism. Managing Conflict, Negotiating skills. WORKING IN GROUPS AND MAKING EFFECTIVE PRESENTATIONS Working in Groups:Working in Teams Characteristics of Groups and Teams, Types of Groups and teams, Leadership and Influence in groups and teams, Problem-Solvi ng Communication, Effective Communication in groups and teams. Making Effective Presentations: Developing the Presentation-Establishing a purpose, Developing th e Thesis, Analyzing the situation; Organizing your Ideas- The importance of c lear organization, Gathering ideas and material.Organizing the Body, Planning th e introduction, Planning the conclusions, Adding transitions; Verbal and Visual Support in Presentations Functions of supporting material, Verbal support, Visua l Aids; Developing the Presentations- Types of Delivery, Guidelines for delivery , Question and Answer Sessions, Speaking with confidence. TEXT BOOKS Deborah.G.Johnson, - Computer Ethics - Prentice Hall - 2nd Edition - 2002 Ernest A Kallman, John.P. Grillo - Ethical Decision making and Information Technology McGraw Hill - 2nd Edition - 1996. Ronald B.Adler - Jeanne Marguardt Elmhorst - Communicating a work MCGraw Hill, 6th Edition - 1999. REFERENCE BOOKS Deborah.G.Johnson, Helen Nissenbaum (eds) - Computers, Ethics, and Social Values - Prentice Hall - 1995. Jonathan Price, Kenry Korman.- How to communicate Technical Information Addison- Wesley - 1993. Mode of Evaluation: By Assignment, Seminars and Written Examinations

06MSE209 PROGRAMMING PRACTICES AND CODING STANDARDS L 4 Aim To deliver the concepts of various programming practices Objective To make the students to understand the concepts of various programming languages T 0 P 0 C 3

including syntax and semantics.

UNIT I Preliminaries: Programming Domains, Language evaluation criteria design categori es trade- offs, implementation methods, Programming environments, Evolution of t he Major Programming Languages : Zuse s plankalkul Pseudocodes FORTRAN LISP COBOL BA SIC PL/I APL and SNOBOL SIMULA 67 ALGOL 68 Prolog Ada Small talk C++ - JAVA

UNIT II Syntax and semantics: Problem of describing syntax- formal methods for describin g syntax, recursive descent parsing, attribute grammar, Dynamic semantics Names Binding, Type checking and scopes: Names variables concept of binding strong typ ing type compatibility scope & life time. Data types: Primitive chapter string u ser defined array associative arrays record union set pointers Abstract data ty es. UNIT III Expression and Assignment Statement: Arithmetic expressions Overload operators t ype conversions relational and Boolean expressions Assignment statements mixed m ode assignment. Statement Level Control structures: Compound selective interativ e statements, unconditional branching and guarded commands. Subprograms: Fundame ntals design issues local referencing parameter parsing overloaded subprograms esign issues of functions accessing nonlocal environment user defined overloade d operators Implementing subprograms UNIT IV Support for Object Oriented Programming: Object oriented programming design issu es Small talk example programs features evaluation. Support for object oriented programming in C++ - Java Ada 95 Eiffel, implementation object oriented construc ts. Concurrency: Subprogram level concurrency semaphores monitors message passin g concurrency in Ada 95, Java threads, statement level concurrency. UNIT V Exception Handling : Exception handling in PL / I Ada C++ - Java. Functional Pro gramming Languages: Mathematical functions fundamentals LISP introduction to sch ema COMMON LISP ML Haskell applications of functional languages comparison with imperative languages. Logic programming Languages : Predicate calculus predicate calculus and proving theorem overview of logical programming PROLOG overview ba sic elements deficiencies. Applications of programming languages.

REFERENCE BOOK: Robert W. Sebesta, Concepts of Programming Languages , 1st Indian Reprint, 1999, A ddison Wesley Doris Appleby & Julius J Vandekopple, Programming Languages Paradigm & Practice , M c Graw Hill, 2nd Edition. Ravi Sethi, Programming Languages , 2nd Edition, Addison Wesley, 1999 Mode of Evaluation: By Assignment, Seminars and Written Examinations

06MSE211 MANAGEMENT INFORMATION SYSTEMS L C 4 Aim The subject aims to introduce Role & Impact of MIS, Decision making, Enterprise management systems, Role of MIS in Data Warehouse, Artificial Intelligence and E xpert Systems Objectives The Students shall be able to understand role and impact of MIS, various steps i n management, Organization structure and theory, Development of Business Strateg ies, Decision making concepts, methods of data collection, applications of MIS i n Manufacturing, basic features Enterprise Management Systems and Role of MIS in Data Warehouse, Artificial Intelligence and Expert systems. UNIT I: Role & impact of MIS, Approaches to Management - Management as Control S ystem - Management by Exception - Process of Management - Management Effectivene ss - Planning- Organizing - Staffing - Coordinating and Directing - Controlling - MIS: A Tool for Management Process. Organization Structure and Theory - Basic Model of Organization Structure - Modifications to the Basic Model of Organizat ion Structure - Organizational Behaviour - Organization as a System - MIS: Organ ization. Strategic Management of Business Corporate Planning Concepts - Strategi c Planning - Development of Business Strategies - Types of Strategies, Tools of Planning UNIT II: Decision Making - Methods, Tools & Procedures - Organizational Decision Making - MIS & Decision Making Concepts - Information as a Quality Product - Cl assification of Information - Methods of Data Collection - Value of Information - System Concepts - Systems Control - Types of System - Post Implementation Prob lems, MIS Development- Determining Information Requirement - MIS Development & I mplementation UNIT III: IT Strategic Decision - Design - Evaluation - Implementation Plan - Ch oice of IT and MIS, Applications of MIS in Manufacturing- Applications in Servic e Sector, Decision Support Systems, Deterministic Systems - Artificial Intellige nce, Knowledge Based Expert System, MIS and the Role of DSS UNIT IV: Enterprise Management Systems- Basic Features & Benefits, Selection and Implementation of ERP- Technology in MIS, Data Processing - Transaction Process ing Application Processing - Information System Processing - TQM of Information Systems - User Interface - Real Time Systems & Design - Programming Languages Case Tools, Business Process Re-engineering - Process Model of the Organization UNIT V: Data Warehouse: Architecture to Implementation - Electronic Business Tec hnology - Models of E-Business - Intranet/Extranet - Internet - World Wide Web 0 0 3 T P

Electronic Payment Systems - Security in E-Business - MIS and E-Business. Web: A Tool for Business Management - Internet and Web and Process of Management - S trategic Management Under Web - Web Enabled Business Management - Application System Architecture in Web - MIS in Web Environment TEXT BOOK: 1. W.S. Jawadekar, "Management Information System", Tata McGraw Hill, 2nd Ed., 2 002 REFERENCE BOOK: James A.O Brien, Management Information Systems , Tata McGraw Hill, 2004 Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE213L MICROPROCESSOR AND ASSEMBLY LANGUAGE PROGRAMMING LAB L T P C 4 0 0 3

Instructions to the students Unless the problem explicitly states otherwise you can assume that the input dat a/output data will be in memory location and can be examined using a suitable de bugging utility (DEBUG, CodeView, TURBO DEBUG etc., ) and that the program itse lf is executed under the control of such a debugging utility. The board layout and the circuit diagram of the interface are to be provided to the student durin g the examination. The interfaces to be used are: Stepper Motor, Logic Controll er, Dual DAC, Display and Keypad. These interfaces are the standard interfaces u sed with 8085 trainers also. A brief description of these interfaces will be pro vided separately. 1.a) Develop and execute an Assembly Language program to find the LCM of two 16bit unsigned integers b) Develop and execute an Assembly Language program to drive a Stepper motor interface to rotate the motor in clockwise direction by N steps. (N specified by the examiner). Introduce suitable delay between successive steps. (The delay is not to be specified by the examiner. The student need not compute the delay. It can be any arbitrary value that just permits the steps of the motor rotation to be counted). 2.a) Develop and execute an Assembly Language program to find the 16-bit unsigned integers GCD of two

b) Develop and execute an Assembly Language Program to drive a Stepper motor interface to rotate the motor in anticlockwise direction by N steps. (N is spec ified by the examiners) . Introduce suitable delay between successive steps, (Th e delay is not to be specified by the examiner. The student need not compute the delay. It can be any arbitrary value that just permits the steps of the motor rotation to be conducted.) 3.a) Develop and execute an assembly language program to sort a given set of 1 6-bit unsigned

integers into ascending order using insertion sort algorithm. b) Develop and execute an Assembly language program to generate a rectangul ar pulse train using the DAC interface. (The output of the DAC is to be display ed on a CRO. The on/off times can be any arbitrary values. No need to compute t hese values. ) 4.a) Develop and execute an assembly language program to sort a given set of 8-b it unsigned integers into ascending order using Bubble sort algorithm b) Develop and execute an assembly language program to generate a triangula r wave form using a DAC interface. (The output of the DACis to be displayed on a CRO. The slope can be any arbitrary value. No need to compute this value.) 5.a) Create an assembly language source file containing PUBLIC dec larations for 100 bytes of data and PUBLIC code for a procedure READKB to read from keyword using INT 21H (Function code 6) leaving the result in AL.Creat e a second source file with EXTRN declaration for data and READKB procedure of the first source file and statements to read 10 bytes from keyboard and store the data in the data area declared as EXTRN. Assemble and link the above two fi les and execute the resulting file. b) Develop and execute an assembly language program to read the status of two i nputs from the logic controller interface and to display the output of 2 Boolean expressions of the two inputs, using the same interface. ( The two Boolean expressions are to be specified by the examiner.) 6.a) Create an assembly language source file containing two PUBLIC procedures c alled RDKEY and ECHO. RDKEY reads from keyboard using INT 21H (Function 6) leavi ng the ASCII code of key read in AL. The ECHO displays the ASCII character in AL on the screen using INT21H (Function 6) Assemble this file and place it in a li brary file. Develop and execute an assembly language program which uses the RDKEY and ECHO procedures once. b) Develop and execute an assembly language program to read the status of ei ght inputs from the logic controller interface, to complement those values and t o display these complemented values using the same interface. 7.a) Develop and execute an assembly language program with the following featu res: It has a macro with one parameter called LOC. The macro reads the keyboard ng INT21H (Function 6) and places the ASCII code of the key read in LOC. usi

The macro defined above is used twice to read the keyboard twice and store the

ASCII codes in two consecutive memory locations. Develop and execute an assembly language program to read the status of eight inp uts from the logic controller interface, display FF if any input is high and display 00 otherwise. 8.a) Using conditional assembly, develop and execute an Assembly language progr am with the following features: It uses one input value, an unsigned 16-bit integer called x. If Eqn 1 is true, it assembles code which computes 3*x*x*x+4*x+5 and places th e32 bit result in a double-word memory location. (Assume overflow will not occ ur); Otherwise, it assembles code which computes 7*x+8 and places the 32-bit res ult in a double-word memory location. Develop and execute an assembly language program to perform the following: Read the status of 3 inputs from the logic controller interface. Assuming that these three inputs represent a binary number x (0<=x<=7), display 2* x using the same interface. 9.a) Develop and execute an assembly language program that implements Binary se arch algorithm. Assume that the data consists of sorted 16-bit unsigned integers . The search key is also a 16-bit unsigned integer. Develop and execute an assembly language program to scan a 4 x 4 keypad for key closure and to store the code of the key pressed in a memory location. 10. a) Develop& execute an assembly language program to perform the following: Assuming a look up a table of 16 entries, each of which is 8-bit wide, & a 4-bit key value, look up the table to find the conversion value. Set up the table to p ermit BCD to 7-segment code conversion. Develop and execute an assembly language program to drive the Elevator interfac e in the following way: Assume that initially the elevator is at ground floor and all service requ ests are cleared. The elevator stays in the ground floor as long as there is no service request. When a service request is detected, the elevator moves to tha t floor. While it is travelling to that floor, if a service request is detected for any intermediate floor, it is also serviced (the floor request LED is turned off). After servicing the floor for which the request was first registered, the elevator returns to ground floor ignoring all further requests. The delays to s imulate the elevator motion, the delay indicating the servicing of a request ca n be any arbitrary values. Examiner doesn t specify these values, nor is the stude nt required to calculate them. 11.a) Develop and execute an assembly language program to read a 4-digit hexade

cimal number from the keyboard and store the corresponding 16-bit binary v alue in a word location. b) Develop and execute an assembly language program to display a 4 digit B CD number on the display interface. 12. a) Develop and execute an Assembly language program to compute the factoria l of a positive integer n using recursive procedure. The 16-bit binary resul t can be left in a memory word location. (Use a value for n which will ensure that n! ca n be stored as a 16bit unsigned integer.) b) Develop and execute an assembly language program to scan a 4x4 keypad i nterface for key closure. The row number and column number of the key pressed are to b e stored in memory locations. 13.a) Develop and execute an assembly language program to compute nCr using rec ursive procedure. Assume n & r to be non-negative integers and leave the binary result in a memor y word location. (Use values for n and r which will ensure that the can be stor ed as a 16-bit unsigned integer.). (b) Develop and execute an assembly lang uage program to perform the following: Alternately, display two 4 digit message s on the display interface for suitable period of time. Ensure a flashing rate that makes it easy to read both the messages. (Examiner doesn t specify there dela y values. Nor is it necessary for the student to compute these values). 14.a) Develop and execute an assembly language program that determines if a giv en sub-string is present in a main string of characters. The result (1:present, 0:abs ent) can be left in a memory location Develop and execute an assembly language program to convert a 16 bit binary valu e (Assumed to be an unsigned integer) to BCD and to display it on the Display in terface. (You can assume that the BCD equivalent will be less than or equal to 9 999). 15.a) Develop and execute an assembly language program to perform the following

: Read the current time from the system (INT 21 H, Function 2CH), forma t it as HH:MM, and display it on the video screen (INT 21H, Function 2).

06MSE215L DATA STRUCTURES AND ALGORITHMS LAB* L 0 LST OF EXPERIMENTS Implementing Stacks and queues. Implementation and processing in lists. Sorting: Insertion sort Merge sort Quick sort Selection sort Heap sort Shell sort Searching: Linear search Binary search 0 3 2 T P C

06MSE202 PROBABILITY, STATISTICS AND RELIABILITY L T P C

4 Aim

To motivate the students to address the challenge of the relevance of Pr obability and Statistics Theory to Engineering problems. Objective To have an understanding of the Probability concepts, To analyze the problems connected with statistics and reliability, To understand how to make the transition from a real problem to a pro bability model for that problem. Probability & Random Variables Axioms- Conditional Probability- Baye's Theorem- Independent Events-Random Varia bles-Distribution Function-Density Function (PDF)- Random Vector-Joint Distribut ion- Joint Density- Conditional Distribution and Density Functions- Independent Random Variables- Binomial, Poisson, Normal, Exponential, Gamma, Weilbull distr ibutions. Statistical Parameters Mathematical Expectation- Variance- Moment Generating Function-Characteristic Fu nction-Regression and Correlation- Partial and Multiple correlation. Tests of Statistical Hypothesis Large sample Tests - Procedure of Testing Hypothesis- small sample tests - Stude nt s t-distribution - F-test - Chi-square test- theory of estimation. ANOVA One way and Two way classifications- CRD-RBD-LSD. Statistical Quality Control Control Charts - Control Charts for Measurements - -chart- R-chart- Control Cha rts for Attributes- p-chart- np-chart- c-chart Reliability Terms related to Reliability- Hazard Models- System Reliability - Reliability Al location - Maintainability and Availability. Queuing Theory

Preliminary Ideas (Markov Chains) - Exponential Distribution- Little's formula Pure Birth and Death Models. Text Book: R.E.Walpole, R.H.Myers, S.L.Myers and K.Ye, Probability and statistics for Engin eers and Scientists, 7th Edition, Pearson Education (2003). Reference Books: Bhat, B.R.. Modern Probability Theory, 3rd ed. New Age International Pvt. Ltd ., New Delhi (1999). Freund, JE , Mathematical Statistics, Prentice Hall International (1998). Rohatgi, V.K. and Ebsanes Saleh, A.K. Md., An introduction to Probability and S tatistics, 2nd Ed., John Wiley & Sons, Inc., New York (2002). Morris H. DeGroot, Probability and Statistics, 3rd Edition, Addison-Wesley (2002 ). J.L.Devore, Probability and Statistics, 5th Edition, Thomsun (2000) Mode of Evaluation: By Assignment, Seminars and Written Examinations

06MSE204 COMPUTER ARCHTECTURE AND ORGANIZATION* L C 4 0 0 3 T P

Aim : The subject aims at imparting the knowledge of Computer architecture , the design of computers, including the instruction sets, hardware components, and s ystem organization,Memory Management and Networking. Objectives : At the end of the course students should be able to understand bas ic principles such as locality of reference, coarse-grain parallelism, overlappi ng communication and computation, performance/power trade-offs, and reliability, also how the computer systems are organized and the characteristics of modern processors that affect system architecture. UNIT I: Nature of computing, Elements of Computers, Limitations of Computers; the evolution of computers- Mechanical Era, Electronic Computers, The Later gene ration; the VLSI era- Integrated Circuits, Processor Architecture, System Archit ecture. Design Methodology- System design- System Representation, Design process , The Gate level; the Register level- Register - level components, programmable logic devices, Register level design; the Processor Level- Processor Level Compo nents, Processor level design.

UNIT II: Processor Basics- CPU organization: Fundamentals; Data Representation : Basic formats, Fixed Point Numbers, Floating point numbers; Instruction Sets: In struction formats, Instruction Types, Programming Considerations. UNIT III: Data Path Design-Fixed point arithmetic-Addition and Subtraction, Mult iplication, Division; Arithmetic Logic Units- Combinational ALUs, Sequential ALU s; Advanced Topics- Floating point Arithmetic, Pipeline Processing UNIT IV: Memory Organization-Memory technology: Memory Device Characteristics, R andom Access Memories, Serial Access Memories; memory systems: Multilevel memorie s, Address translations, Memory Allocation; Caches: Main features, address mappi ng, Structure versus performance. UNIT V: System Organization- Communication methods: Basic concepts, Bus control; IO And System Control: Programmed IO, DMA and Interrupts, IO processors, Operating Syst ems; Parallel Processing: Processor Level Parallelism, Multiprocessors, Fault Tol erance. TEXT BOOK: 1. John P. Hayes, Computer Architecture and Organization , 3rd Ed. McGraw Hill., 19 98. REFERENCE BOOK: John. L. Hennessy & David A. Patterson, Computer Architecture , 3rd Ed, 2003, Elsev ier, India. Mode of Evaluation: By Assignment, Seminars and Written Examinations

06MSE206 SYSTEM PROGRAMMING* L C 4 0 0 3 T P

Aim : The subject aims to introduce operations and functions of Assembler, Linke r, Lexical analysis, parsing, Semantic analysis, Optimization and machine code g eneration.

Objectives : The student shall be understand the different steps involved in pas s I and pass II of Assembler, the structure of compiler and the functions perfor med in different phases of compiler UNIT I: Assemblers elements of assembly language programming simple assembly sch eme pass structure of assemblers. Design of a two-pass assembler. Relocation and

linking concepts. Design of a linker, self-relocating program, linker for MS S, linking for overlays, loaders.

DO

UNIT II: Structure of compilers, lexical analysis, syntax analysis, immediate co de generation, optimization code generation, book keeping, and error handling co mpiler writing tools programming languages. UNIT III: Role of lexical analyzer design of lexical analyzer, regular expressio n, finite automation regular expression to finite automata, minimizing DFA, impl ementation to lexical analyzer context free grammar, derivations & parse trees c apabilities of context free grammar UNIT IV: Parsers, shift-reduce parsing, operator precedence parsing, top down pa rsing, syntax directed translation scheme, implementation of syntax-directed tra nslators, intermediate code, postfix notation, parse trees and syntax trees, thr ee address code, quadruples, triples, translation of assignment statement, Boole an expression, errors, lexical phase errors, semantic-phase errors, semantic err ors. UNIT V: Principles, sources of optimization, loop optimization, DAG representati on of basic blocks, value numbers and algebraic laws, global data flow analysis, dominators, reducible flow graphs, depth-first search, loop-invariant computati ons, induction variable elimination, other loop optimization. TEXT BOOK: 1.D. M. Dhamdhere, System Programming , Tata McGraw Hill, 2nd Edition, 2000. REFERENCE BOOK: 1. A. V. Aho, J.D. Ullman, Principles of Compiler Design , Narosa Publishing, 1996.

Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE208 INTERNET PROGRAMMING* L T C 4 Aim To understand the concepts of internet programming. Objective To know the internet concepts and to design web pages using java The Common Gate Way Interface (CGI) 0 0 3

CGI applications, con-figuring the server, programming in CGI. Input to the CGIEnvironmental variables, accessing from input, Languages under different operati ng systems. Examining environmental variables. Output from CGI and response head ers; Accept types and content types; the context length header, Server redirecti on; The expires and Pragma headers, Status codes, complete headers. Forms and CGI HTML tags; sending data to the server; Designing applications using forms in PER L. Decoding forms in other languages. Server Side Includes (SSI)- configuration environmental variables. Including boilerplates. File statistics. Executing exte rnal program and CGI programs. Tailoring SSI output. Common Errors. Hypermedia Documents Creating dynamic pages, CGI Examples with postscript. The gd graphics library. C GI Examples with gnuplot and pgperl. Animation. Advanced form applications- Goue stbook, Survey/poll and pie graphs, quiz/test form application, Security. Introduction To Java Overview of JAVA Language, Constants, Variables, and Data Types. Operators and E xpressions: Decision Making and Branching. Classes, Arrays, Strings and Vectors Classes, Objects and Methods Inheritance - Arrays, Strings and Vectors: Arrays, O ne-dimensional Arrays, Creating an Array, Two-dimensional Arrays, Strings, Vecto rs, Wrapper Classes. Interfaces, Packages, and Multithreaded Programming Interfaces - Multiple Inheritances - Java API Packages, Multithreaded Programmin g: - Managing Exceptions, Applet Programming Managing Errors and Exceptions - Applet Programming: How Applets Differ from App lications, Creating an Executable applet, Designing a Web Page, Applet Tag, Addi ng Applet to HTML File, Passing Parameters to Applets, Aligning the Display, Mor e about HTML Tags, Displaying Numerical Values, Getting Input from the Usr. Graphics Programming, Input / Output Graphics Programming: Introduction, The Graphics Class, Lines and Rectangles, Ci rcles and Ellipses, Drawing Arcs, Drawing Polygons, Line Graphs, Using Control L oops in Applets, Drawing Bar Charts. Managing input/output Files in JAVA

References: 1. Shishir Gundavaram - CGI Programming on the World Wide Web, O ciates - Shroff publishers - 2003. Reilly and Asso

2. E.Balaguruswamy - Programming with JAVA A Primer - 2nd Edison - TMH 004 2nd edition. Mode of Evaluation: By Assignment, Seminars and Written Examinations

06MSE210 DATABASE MANAGEMENT SYSTEMS* L T P C 4 Aim This subject aims to introduce techniques to design, implement and maintain data base applications. Objectives The students shall be able to understand fundamental concepts of database mana gement system, database modeling and design, SQL, PL/SQL, system implementation techniques. Analyze and design ER model for a customized application and concurr ency techniques and active databases. UNIT- I: INTRODUCTION AND ER MODELING Basic concepts Databases and database users Database system concepts and archite cture data modeling using Entity Relationship model. UNIT II: RELATIONAL MODEL 0 0 3

The Relational data model Relational constraints Relational algebra Introduction to SQL Introduction PL/SQL Relational database standard ER to relational mappin g E.F. Codd rules. UNIT- III: NORMALIZATION Functional dependencies Normalization for relational databases up to BCNF

UNIT- IV: QUERY OPTIMIZATION AND TRANSACTION PROCESSING Query Processing Translating queries into relational algebra Using Heuristics in query optimization Introduction to Transactions Single user and multiuser syste m transactions Read and write operations DBMS buffers Transactions system concep ts Serializability types. UNIT- V: CONCURRENCY, RECOVERY AND SECURITY 2PL Types of locks System lock tables deadlocks Timestamp ordering algorithm overy concepts ARIES recovery algorithm Introduction to database security issues Discretionary access control based on granting and revoking privileges. Concluding remarks including database design and implementation process. TEXT BOOK: Rec

Ramez Elmasri & B.Navathe: Fundamentals of Database Systems, IV Ed., Addison Wes ley, 2005. REFERENCE BOOKS: 1. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, III Edi tion, McGraw Hill. 2. Date C.J: Introduction to Database Systems, Sixth Edition, Addison-Wesley, 19 95. Mode of Evaluation: By Assignment, Seminars and Written Examinations

06MSE212 THEORY OF COMPUTATION* L C 4 0 0 3 T P

Aim: The subject aims to introduce of Formal Languages, Automata Theory and Abs tract models of Computation and Computability, Computational complexities and NP Completeness. Objectives: The students would be able to understand universal Model of Computat ion in terms of both the current Platforms and the Philosophical ideas about the nature of Computation. They would be able to analyze the problems by determinin g whether a problem is solvable, efficiently solvable, and simply solvable or it cannot be solved. UNIT I: An overview of grammars and languages, Regular expressions and Regular l anguages Finite Automata and its minimization, Construction of NFA and DFA from Regular expressions, Conversion of NFA into DFA UNIT II: Chomsky hierarchy of language, Non determinism and kleenes theorem pump ing lemma Decision problems. Normal Forms : Chomsky s & Griebach s Normal Forms UNIT III: Push Down Automata and context free languages Context free grammars D erivation trees Ambiguity PDA& CFG Context Free and non-Context free languages. UNIT IV: Turing machines eptors Partial function es Applications. Church Turing hypothesis Turing machine as language acc Non deterministic Turing Machine Universal Turing Machin

UNIT V: Unsolvable problems and computable functions Rice theorem Halting proble m Post s correspondence Problem Primitive recursive functions Godel Numbering rsive and recursively enumerable languages.

Recu

TEXT BOOK: John C. Martin, Introduction to Languages and the Theory of Computation, 3rd Ed ition, Tata McGraw Hill, 1997. REFERENCE BOOK: 1. K.L.P Mishra, N. Chandrasekaran, "Theory of Computation", Prentice Hall of In dia, 2nd Edition, 1998. Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE214L INTERNET PROGRAMMING LAB* L T P C 0 0 3 2

Create the personal home page using HTML Design a E-greetings page which has properly aligned paragraphs with images alon g with it. Implement a Web site for Information Technology department Using Frameset Tables Inernal Linking Headers List Items Hyperlink for mailing Using STYLE SHEETS: 1 .Set the Background Image Fixed and Foreground Scrolling 2. Set the Background Image without tiles and at the center of the scr een. 3. Set the Background Color for the text using all the 4 methods of St yle sheets Using JavaScript create a web page for Online Testing (Quantitative Aptitude) Develop a JavaScript program to get Register Number as Input and print the Stude nt s total mark and grades. Develop a VBScript code to perform the functions of a Calculator. Using VBScript, develop a web site for online counseling. Create a Text Editor using VBScript.

Write a function that takes an integer value and returns the number with its dig its reversed. For Ex. Given the number 7631, the function should return 1367. In corporate the function into a VBScript that reads a value from the user. Display the result in the status bar of the browser window. Create a server-side include file containing the AdRotator code to display 4 advertisements. Create an ASP application that allows the user to customize a web page. The application should consist of three ASP files: Ask the user name to login & read from a database to determine if the user is kn own. If the user is not known, second ASP file is loaded asking the user to choo se their preference for foreground color, background color & image. Insert the n ew user & pREFERENCE to the database. Display the page customized according to t he pREFERENCE selected. If the user is known at login, the customized page shoul d be displayed. Create an ASP application to display the students information from the Database Note: Only 5 student s information per page should be displayed. Use Previous & Next to retrieve the rest of the information. Create an ASP application for sending E-Mails using CDO. Design a web page for registering the following information into Oracle Database using ASP. Name Reg. No, Date of Birth, Date of Admission, E-Mail (check for validation) Gender Address Branch & Year Create a formatted business letter using XML & DTD. Create a contact list database in XML using style sheets. Develop a XML schema for the database document type. Create a XML page for displaying staff details from the database Connect to a database using XML & display its contents using HTML Page 06MSE216L DATABAE MANAGEMENT SYSTEMS LAB* L T P C

a) Create a table EMP with the following fields. EName Eno. Salary DeptNo Address Dname b) Insert 5 records into EMP c) ALTER EMP table i) varying size of Eno field ii) adding a new field job d) Delete the table EMP Create Insert Update Delete a table EMP with the above mentioned fields. 5 records into EMP the salary of the Employees by 10% hike the employees whose name is AAA

Create a table ORDER with the following fields and constraints. ORDER Column Name Constraint Name Constraint Type Order-no pk-order-no PRIMARY KEY Item-name itn Qty ck-aty UNIQUE CHECK (25<QTY<50) rate-unit Nn-rate NOT NULL Using Ex 3. Drop unique constraint for item-name Disable the constraint Nn-rate Insert a record with NULL values for rate unit Enable the constraint with NULL value existing on rate-unit 5. Create a table EMP mentioned above and test all the arithmetic functions and

character functions 6.Add a field date-of-birth to EMP table and test all the date functions. 7. i) Modify EMP table adding a new field BONUS, update it using NVL ii) Retrieve the employees whose name starts with S. iii)Select all the employees who are working in IT department. 8. I) Using EMP table find the employee getting maximum salary ii) Find the employee whose salary is minimum iii) Find the sum of salaries of all the employees working in ACCOUNTS department.

9. Create a table DEPT with the following fields DNo. Primary Key DName Modify EMP table adding a foreign key constraint on DeptNo. Insert 6 records into Dept. Implement the following Join operations Self Join Equi Join Non Equi Join Outer Join Natural Join 10. Using EMP and DEPT, implement all type of view techniques. Row subset view Column subset view Row column subset view Grouped view Joined view With check option 11. Using EMP and DEPT Create a sequence to insert the empno in EMP table Create a synonym for the above two tables PART B Create a cursor to update the salary of employees in EMP table a) Write a PL/SQL program to raise an Exception When the bonus exceeds salary b)Write a PL/SQL program to test the built-in Exceptions

Write a procedure to insert a record into ORDER table by validating qty limit of the item and also check whether that item exists. Write a function to find substring. Create a trigger which checks whether employee with Emp_no is present in the Emp loyee table before inserting into EMP. 06MSE301- DISCRETE MATHEMATICAL STRUCTURES L T P C 4 Aim To address the challenge of the relevance of inference theory , Algebraic struct ures and graph theory to computer science and engineering problems. Objective: To use inference theory in circuit models, and algebraic theory in computer sci ence problems, graph theory in net work models and lattices & Boolean algebra in Boolean functions . Mathematical Logic Introduction -Statements and Notation - Connectives - Tautologies - Equivalence - Implications - Normal Forms - Principal Disjunctive Norm Forms - Principal C onjuctive Norm Forms. Inference Theory The Theory of Inference for the Statement Calculus -The Predicate Calculus - Inf erence Theory of the Predicate Calculus. Set Theory Basic Concepts of Set Theory- Relations and Ordering- Functions- Recursion Algebraic Structures Semigroups and Monoids - Grammars and Languages- Polish Expressions and Their Co mpilation - Groups - The Application of Residue Arithmetic to Computers - Group Codes. Lattices And Boolean Algebra Lattices as Partially Ordered Sets - Boolean Algebra - Boolean Functions - Repr esentation and Minimization of Boolean Functions. Graph Theory Basic Concepts of Graph Theory - Matrix Representation of Graphs - Trees -Storag 0 0 3

e Representation and Manipulation of Graphs. References: J.P. Trembley and R. Manohar, Discrete Mathematical Structures with Applications to Computer Science, Tata McGraw Hill 13th reprint (2001). Richard Johnsonbaugh, Discrete Mathematics, 5th Edition, Pearson Education (2001 ). S. Lipschutz and M. Lipson, Discrete Mathematics, Tata McGraw Hill, 2nd Edition (2000). Mode of Evaluation: By Assignment, Seminars and Written Examinations

06MSE303 SOFTWARE ENGINEERING* L T P C 4 0 0 3

Aim : The subject aims to impart sound knowledge to design and implement an ef ficient software system and manage the resources . Objectives : The students would be able to analyse software requirements, develop an efficient software system through group cohesiveness, use the testing tools and methods. UNIT I: Software Engineering Fundamentals, The system engineering process, Soft ware process models, Process iteration, Software Specification, Software design and implementation, Software validation, Software evolution, Project management activities- Project planning, Project scheduling, Risk management, Software requ irements- Functional and non-functional requirements, User requirements, System requirements, software requirements document. UNIT II: Requirements engineering processes - Feasibility studies, Requirements elicitation and analysis, Requirements validation, Requirements management, Syst em Models- Context, Behavioural, Data and, Object models, CASE workbenches, Soft ware prototyping- Prototyping in the software process, Rapid prototyping techniq ues, User interface prototyping, Formal Specification- Formal specification in the software process, Interface specification, Behavioural specification UNIT III: Architectural design- System structuring, Control models, Modular deco mposition, Domain-specific architectures, Over view of design for Distributed sy stems, Object-oriented and Real-time software, Design with Reuse- Component-bas ed development, Application families, Design patterns, User interface design - U ser interface design principles, User interaction, Information presentation, Use r support, Interface evaluation. UNIT IV: Critical Systems- Over view of Dependability, System Specification, and System Development, Verification and validation- V&V planning, Software inspect

ions, Automated static analysis, Cleanroom software development, Software testin g- Defect testing, Integration testing, Object-oriented testing, Critical system s validation- Formal methods and critical systems, Reliability validation, Safet y assurance, Security assessment. UNIT V: Over view of Managing software people, Software cost estimation- Product ivity, Estimation techniques, Algorithmic cost modelling, Project duration and s taffing, Overview of Quality management & Process Improvement, Over view of Lega cy Systems, Software change & re-engineering, Configuration management- planning and managing change, version and release, Over view of SEI-CMM, ISO 9000, and S ix Sigma, Over view of CASE tools. TEXT BOOK: 1. Ian Sommerville, "Software Engineering", Addison-Wesley, 2004 REFERENCE BOOK: 1. Roger S. Pressman, "Software Engineering", McGraw Hill, 2004. Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE305 OPERATING SYSTEMS* L T P C 4 Aim This subject aims to introduce operating system concepts such as processes & thr eads, memory management, scheduling algorithms and distributed file systems Objectives The students would be able to understand and explain various OS concepts such as time-sharing, Multiprogramming, Parallel, Distributed systems, processes & Thre ads, CPU scheduling algorithms, Semaphores and Critical regions, Deadlock prevention, Memory Management, I/O sys tems and File Systems .They would be able to use Linux system, windows 2000. UNIT I: Introduction, Computer-System Structures, Operating-System Structures UNIT II: Processes, Threads, CPU Scheduling, Process Synchronization, Deadlocks 0 0 3

UNIT III: Memory Management, Virtual Memory, File-System Interface, File-System Implementation, I/O Systems, Mass-Storage Structure UNIT IV: Distributed System Structures, Distributed File Systems, Distributed Co ordination, Protection, Security

UNIT V: The Linux System, Windows 2000. TEXT BOOK: 1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, "Operating System Concep ts", John Wiley & Sons, Inc. 6th Edition REFERENCE BOOK: Stallings William, "Operating Systems", Prentice Hall of India, Fourth Edition Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE307 COMPUTER AND COMMUNICATION NETWORKS* L T P C 4 0 0 3

Aim : The subject aims to introduce basics of Networks, client/server systems, N etwork design approaches, Architecture of Networks, and also future Networking t echnology. Objectives : Students shall be able to understand about working of Intranet, LAN , WAN, MAN setups, different topologies like Star, Mesh, etc., various functions of layers, different network architectures, different switching techniques, dif ferent protocol standards, congestion & traffic control, different internetworki ng devices like bridges, switches, routers, etc, security protocols & security a lgorithms UNIT I: Networks and Services, Approaches to Network Design, The OSI Reference M odel; Overview of TCP/IP Architecture, Application Protocols and TCP/IP Utilitie s UNIT II: Peer-to-Peer Protocols and Service Models, ARQ Protocols, Sliding Windo w Flow Control, Multiple Access Communications, LAN and access methods, Introduc tion to LAN Standards and LAN Bridges, Ethernet networking.

UNIT III: Packet Switching Networks- Network Services and Internal Network Oper ation, Packet Network Topology, Routing in Packet Networks, Shortest Path Algori thms, and Introduction to traffic management & QoS. UNIT IV: TCP/IP Architecture, The Internet Protocol, Limitations of IPv4 and Int roduction to IPv6, User Datagram Protocol, Transmission Control Protocol, DHCP, Introduction to Internet Routing Protocols

UNIT V: Advanced Network Architectures and Security Protocols- Introduction to M

PLS and Differentiated Services; RSVP; Security and Cryptographic Algorithms, Se curity Protocols, Cryptographic Algorithms TEXT BOOK: 1. A. Leon-Garcia, Indra Widjaja, "Communication Networks", Tata McGraw Hill, 20 00 REFERENCE BOOKS: 1. William Stallings, " Data and Computer Communications", Pearson Education, 7t h Edition 2. Andrew S. Tanenbaum, "Computer Networks", Prentice Hall India, 4th Edition, 2 003 Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE309 OPEN SOURCE PROGRAMMING I L T P C 4 Aim To create Software applications that can be accessed by all the people ove r the internet and to allow the users to customize the software based on their r equirements. Objective On completion of this course the students will be able to create open sour ce software applications and can publish it over the Internet. Introduction to LINUX LINUX - The operating System; Compiling the Kernel; Introduction to the Kernel: Important data structures, Main algorithms, Implementing System Calls. LINUX Arc hitecture-independent memory model, Virtual address space for a process, Block d evice caching, Pages under LINUX. IPC, File System IPC: Synchronization in the Kernel, Communication via files, Pipes, Debugging us ing ptrace, System V IPC, IPC with sockets. File System: Basic Principles, Repre sentation of file system in the Kernel, The Proc file system and Ext2 file syste m. HTML AND FORMS HTML tags; sending data to the server; Designing applications using forms in HTM L. 0 0 3

Creating dynamic pages, CGI Examples with postscript. The gd graphics library. C GI Examples with gnuplot and pgperl. Animation. Advanced form applications- Gues tbook, Survey/poll and pie graphs, quiz/test form application, Security. JavaScript - VB Script Introduction to JavaScript, VB Script - usage in Web Page develpment, sending an email - multipart message - storing images - getting confirmation - Session tra cking - Graphics Input Validators - cookies.

TEXT BOOKS 1. M. Bek et al : LINUX Kernel Internals, Addison-Wesley, 1997. (Chapters 1 to 9 , Appendices A,B,C,D) 2. Remy Card et al: The LINUX Kernel book, John Wiley, 1998. RFERENCE BOOKS 1. Shishir Gundavaram - CGI Programming on the World Wide Web, O' Reilly and As sociates - Shroff ublishers - 1996. (Chapters 1 to 7) 2. Core PHP programming, Leon Atkinson and Zeev Suraski, Pearson Education, Delhi, 2004 Mode of Evaluation: By Assignment, Seminars and Written Examinations

06MSE311 MANAGEMENT IN ENGINEERING L T P C 4 Aim To emphasis the students the importance and concept of management and engineerin g Objective After completion of this course, the students will be able to Differentiate Management and Engineering Understand the functions of technology of management Understand planning and forecasting Understand research functions Unit I 0 0 3

Introduction to Engineering Management Engineering and Management: Engineering Management Engineering Management. Devel opment of Engineering Management : Industrial Revolution Management Philosophies Scientific Management Administrative Management Behavioral Management. Unit II Functions of Technology Management Planning and Forecasting: Nature of Planning Foundations for Planning Planning c oncepts Forecasting Strategies for Managing Technology. Human Aspects of Organiz ing Authority and Paver Delegation Committees and Meetings. Unit III Managing Technology Managing Research Function: Nature of Research and Development Research strategy and organization Selecting R & D projects Making R&D Organization successful. Unit IV Managing Projects: Project Planning and Acquistion Characteristics of a project Project proposal pr ocess Project Planning Tools Project organization Motivating Project Performance . Unit V Managing Engineering Career: Achieving Effectiveness as an Engineer Charting Career Communicating Ideas Techn ical Competent Professional Activity. Managerial and International Opportunitie s for Engineers Management and Engineer International Management. Reference Book 1. Managing Engineering and Technology Education, Third Edition 2005. Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE313L COMPUTER AND COMMUNICATION NETWORKS LAB* L 0 T 0 P 3 C 2 Daniel L. Babcock, Lucy C.Morse, Pearson

Write a program to display the server s date and time details at the client end. Write a program to display the client s address at the server end.

Write a program to implement an echo UDP server. Write a program to develop a simple Chat application. The message entered in the client is sent to the server and the server encodes t he message and returns it to the client. Encoding is done by replacing a charact er by the character next to it i.e. a as b, b as c z as a. This process is done u sing the TCP/IP protocol. Write a program for the above The message entered in the client is sent to the server and the server encodes t he message and returns it to the client. Encoding is done by replacing a charact er by the character next to it i.e. a as b, b as c z as a. This process is done u sing UDP. Write a program for the above Write a program to display the name and address of the computer that we are curr ently working on. Write a program to capture each packet and to examine its checksum field. Write a program to create a daemon process. 06MSE315L OPERATING SYSTEMS LAB* L T P C 0 0 3 2

Program to report the behavior of the OS to get the CPU type and model, kernal v ersion. Program to get the amount of memory configured into the computer, amount of memo ry currently available. Implement the various process scheduling mechanisms such as FCFS, SJF, Priority, round robin. Implement the solution for reader writers problem. Implement the solution for dining philosophers problem. Implement bankers algorithm. Implement the first fit, best fit and worst fit file allocation strategy. Write a program to create processes and threads. Write a program that uses a wait able timer to stop itself K. Sec. After it s sta rted where K is a command line parameter.

06MSE302 GRAPH THEORY AND ITS APPLICATIONS L T P C 4 Aim To introduce the basics concepts of graph theory and its applications to compute r net work models. Objective To know the basic concepts and notations in graphs. To give the combinatorial and matrix representation of graphs To explain the computer representation of graphs and its application to computer science. Introduction Definitions, importance, isomorphism, walk, paths, circuits, connected, disconne cted graphs, operation on graphs operation on graphs, euler and hamiltonian grap hs. Trees Properties, distance and centres, trees, spanning trees, fundamental circuits, m inimal spanning tree. Cut Sets Properties, fundamental circuits and cut sets, connectivity, separatability, net work flows, 1-2 isomorphism. Planar And Dual Graphs Combinatorial representation, planar graphs, kuratowski's graphs, detection of p 0 0 3

lanarity, dual graphs. Matrix Representation of Graphs Incidence matrix, circuit matrix, cut set matrix, fundamental matrices, relation ships amongst matrices, path matrix, adjacency matrix. Coloring, Covering And Partitioning Chromatic number, chromatic partitioning, matching, covering, four color problem . Directed Graphs Different types, directed paths and connectedness, euler digraphs, trees-matrix representation, tournament. Graph Theoretic Algorithms Computer representation of graphs - input & output, algorithms for connectedness , spanning tree, fundamental circuits, cut vertices, directed circuits and short est paths. References: Narasing Deo, Graph theory with application to engineering and computer science , Prentice Hall India, 1995. Tulasiraman And M.N.S. Swamy, Graph, Networks and Algorithms, John Wiley, 1981. F. Harary, Graph Theory, Addison Wesley / Narosa, 1998. E.M.Reingold, J. Nievergelt, N. Deo, Combinatorial algorithms: Theory and Practice, Prentice Hall, N.J. 1977. Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE304 NETWORKING PROTOCOLS AND STANDARDS L T P C 4 Aim To design new methods for communication and data transfer that eliminates delay and improves data integrity. Objective On completion of this course the students will be able to know about vario us protocols and standards and the students can create new protocols for communi cation and data transfer. Networking Standards and Specification: Networking standards and specifications, Need for standardization, ISO and the IEEE standards, The IEEE 802 Project Addressing and Routing: Network names and addresses, Physical layer addressing: 0 0 3

the MAC address, Network layer addressing: The IP address, Network layer address : The IPX address Overview of OSI and TCP/IP Protocol Suite: Converting network names to IP addres ses, Resolving IP addresses to physical addresses, Addressing and routing TCP/IP Protocol Suite: TCP/IP Protocol Suite, TCP/IP Protocol Suite advantages, Internet Protocol (IP), Transport Layer Protocols -TCP and UDP, File Transfer pr otocols - FTP and TFTP, Mail and news protocols - SMTP, POP3, NNTP and IMAP, Oth er Protocols Suite ICMP and ARP Other networking protocols: The IPX/SPX Protocol Suite, NetBEUI, AppleTalk Proto col, File sharing protocols - SMB, NCP, and NFS, Routing protocols - RIP, OSPF a nd BGP, Network Management Protocol SNMP and CIMP, Convergent Protocols H.323 an d SIP. References Behrouz A. Forouzan, TCP/IP Protocol Suite, Third Edition, Tata McGraw-Hill, 200 5. W. Richard Stevens, TCP/IP Illustrated, The Protocols, Pearson Education, 2004. D.E.Comer, Internetworking with TCP/IP Principles, Protocols and Architecture Vo l - I, Pearson Education, 2001. John Ray, Using TCP/IP, PHI, Karanjit. S. Siyan, Tim Parker, TCP/IP Unleashed, Pearson Education. Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE306 SOFTWARE ARCHITECTRE AND DESIGN L T P C 4 Aim To understand the fundamental concepts of software design and architecture Objective To learn the importance of software design and architecture Design Fundamentals The nature of Design process-Objectives-Building Modules, Constructs, Design qua lities, assessing the design, Design viewpoints for software. Design practices-R ational for method. Design strategies-Top down and bottom up, Organizational met hods and design. Design Methodologies and Models Jackson Structural programming, Jackson system development, object-oriented and object-based design and Structured System Analysis and Structured design method. Traditional approach to design-SADT organizational design practices-SSADM and d esign for real time systems MASCOT 0 0 3

Software Architecture Introduction - Software Architecture - Definition - Prospects - State of Art - A rchitectural Styles - Pipes and Filters - Layered Systems - Repositories - Proce ss Control - Other familiar Architecture - Heterogeneous Architectures. Architecture Design Architectural design and Mapping Description of various Architectural design pat terns - Object Oriented Organization. Architecture Structures for Shared Informa tion Systems. Architecture design guidance - User Interface Architecture. Miscellaneous Topics Tools for Architectural design - Exploiting style in architectural design ectural Interconnection - Case Studies. References: David Budgen, " Software Design ", Addison-Wesley, Pearson Education 2004 2nd ed ition. Pressman R.S, " Software Engineering ", 6th Edition, McGraw Hill Inc., 2005 6th edition. Mary Shaw David Garlan, " Software Architectural Perspectives on an emerging dis cipline ",EEE, PHI 1996. Gamma & Helm et al, Design Patterns , Addison Wesley Pearson Education of 1995. Frank Bushmann et al, Pattern Oriented S/W Architecture , John Wiley & sons -1996 Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE308 REQUIREMENTS ENGINEERING L T P C 4 0 0 3 Archit

Aim : To understand the concept of Requirement Engineering Objective : To emphasis the students to have a thorough knowledge in analyzing the problem and defining the systems. Introduction: The Requirements Problem introduction to requirements management d software development life cycle. Analysing the problem : The five steps in problem analysis ware Intensive systems. Business Modeling systems engineering of soft Requirements an

Understanding the user and stakeholder needs : The challenge of requirements elicitation the future of the product or system in terviewing requirements workshops brainstorming and idea reduction storyboarding

Defining the system: A Use case primer organizing requirements information - the vision document duct management establishing project scope managing your customer Refining the System Definition Software requirements refining the use cases developing the sublimentary specifi cation Building the right system: from use case to implementation using UML diag rams From use case to test cases tracing requirements Text Books: Managing Software Requirements , second Edition by Dean Leffingwell , Don Widrig , Pearson Education Unified Modeling Language by OMG 06MSE310 COMPILER DESIGN* L T P C 4 Aim To learn the fundamental concepts of compiler construction. Objective: To understand the different phases in compiler construction Introduction to Compiling and Lexical Analysis Compilers, Analysis of the source program, The phases of a compiler, Cousins of the compiler, The grouping of phases, Compiler-construction tools. Lexical Analy sis The role of the lexical analyzer, Input buffering, Specification of tokens, Recognition of tokens, A language for specifying lexical analyzers, Design of a lexical analyzer generator. Syntax Analysis The role of the parser, Context-free grammar, Writing a grammar, Top-down parsin g, Bottom-up parsing, Operator-precedence parsing, LR parsers, Parser generators . Syntax-Directed Translation Syntax-directed definitions, Construction of syntax trees, bottom-up evaluation of S-attributed definitions, L-attributed definitions, Top-down translations, Bo ttom-up evaluation of inherited attributes. 0 0 3 pro

Run-time Environments Source language issues, Storage organization, Storage-allocation strategies, Acc ess to nonlocal names, parameter passing, symbol tables, Language facilities for dynamic storage allocation, Dynamic storage allocation techniques. Storage allo cation in Fortran etc., Intermediate Code Generation Intermediate languages, Declarations, Assignment statements, Boolean expressions , Case statements. Code Generation Issues in the design of a code generator, The target machine, Run-time storage m anagement, Basic blocks and flow graphs, Next-use information, A simple code gen erator, Register allocation and assignment, The dag representation of basic bloc ks. Code Optimization Introduction, the principle source of optimization, Optimization of basic blocks , Loops in flow graphs. References: Alfred V Aho, Ravi Seti, Jeffrey D Ullman - Compilers-Principles, Techniques an d ools Addison-Wesley Pearson Education as 2004, Herk Albas, Albert Nymeyer, - Practice and principles of Compiler Building with C - PHI - 1996 Andrew W. Appel - Modern Compiler Implementation in Java - Cambridge University Press 2003. Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE314L CASE TOOLS LAB - I L T P C 0 0 3 2

The Students have to form a team size of 3 or 4. Each team is assigned System Analyze, Coding, testing/.metrics tools like Code Comparison, Compi ler-based Analysis, Complexity-based Metric, Modeling , Review, Volume testin g, Stress Testing, Regression testing etc This tool has to be used for testing and taking various metrics. Estimation for some application

Comparative Study of different tools have to be done The above facts has to be documented and a report has to be submitted at the end of the semester

06MSE316L COMPILER LAB L C 0 0 3 2 T P

Mini Projects will be assigned for the students under the following topics. Lexical Analysis Syntax Analysis Code Generation Code Optimization 06MSE402 OPERATIONS RESEARCH L 4 Aim The main aim of the course Operational Research is introduce the main techniques , methods and approaches of operational research. It provides numerate skills covering mathematical modeling and optimization tech nique with application to practical problems arising in computer science. Objective To introduce the concepts and techniques in decision theory. To use the concepts in network analysis and inventory theory To solve net work model problems using queuing theory. Decision Theory Decision Environments - Decision making under certainty - Decision making under risk - Decision making under uncertainty. Markovian Decision Process Scope of the Markovian Decision Problem - Gardner example - Finite stage Dynamic Programming model - Infinite stage model - Linear Programming solution. Deterministic and Probabilistic Dynamic Programming Recursive nature of computations in DP Selected DP Applications Problem of Dimen sionality A Game of chance - Investment Problem Maximization of the event of Ach ieving a Goal. Network Analysis T 0 P 0 C 3

Network Definitions - Minimal spanning tree algorithm - Shortest route Problem Maximum flow Model - Minimum cost capacitated flow problem - Linear Programming formulation - Network Simplex method CPM and PERT. Inventory Theory Basic Elements of an Inventory model - Deterministic models of the following typ es: Single item static model with and without price breaks - Multiple item stati c model with storage limitation. Probabilistic Models: Continuous Review model - Single period models. Queuing Theory Basic elements of a queuing model - Role of Poisson and Exponential distributio ns - Pure Birth and Death models Specialized Poisson Queues M/G/1 queue - Polla czek - Khintchine formula. Text Book: 1. Hamdy A. Taha , Operations Research ,Prentice - Hall of India Private Limited , New Delhi (2002). Reference Books: 1. F.S. Hiller and J.Lieberman -,Introduction to Operations Research ,7th Editi on, Tata McGraw Hill Publishing Company, New Delhi, 2001. 2. Beightler. C, D.Phillips, B. Wilde ,Foundations of Optimization ,2nd Edition, Prentice Hall Pvt Ltd., New York, 1979 3. Bazaraa, M.S; J.J.Jarvis, H.D.Sharall ,Linear Programming and Network flow, John Wiley and sons, New York 1990. 5. Gross, D and C.M.Harris, Fundamentals of Queuing Theory, 3rd Edition, Wiley and Sons, New York, 1998. Mode of Evaluation: By Assignment, Seminars and Written Examinations

06MSE404 SOFTWARE TESTING L C 4 Aim To learn the fundamental concepts of Software Testing methodologies. 0 0 3 T P

Objective To Apply the various software testing methodologies for software development. Software Testing Principles Software testing Need for testing - Role of software testing - Psychology of tes ting Testing economics - White box, Black box testing A structural approach to testing methods for developing test strategy - Testing methodologies. SDLC and T esting Verification & Validation. Testing Strategies White box testing techniques - Statement coverage - Branch Coverage Condition co verage - Decision/Condition coverage - Multiple condition coverage - Dataflow co verage - Mutation testing - Automated code coverage analysis - Black box testing techniques - Boundary value analysis - Robustness testing - Equivalence partiti oning - Syntax testing - Finite state testing - Levels of testing - Unit, Integr ation and System Testing. Life Cycle Testing Approach Requirements testing Walk through test tool Risk matrix test tool testing for re quirements phase and design phase Design review test tool Test data and volume t est tools. Installation phase testing Tools for acceptance test Software accepta nce process -Software maintenance Methodologies for testing Training and change installation. Testing methods, tools and techniques Testing methods, tools and techniques Testing the Validity of software Cost esti mate Strategies for cost estimation Testing the Progress of software system Over view of point accumulation tracking system Performance analysis of testing Inspe ction plan and test plan documents. Testing and other Related Issues Rapid prototyping Spiral testing Tool selection processes Structural system test ing Documentation of test results Test effectiveness evaluation Test measurement process Test metrics. Automated Tools for Testing - Static code analyzers - Tes t case generators GUI - Testing compilers and language processors - Testing webenabled applications. References: William E.Perry, " Effective Methods for Software Testing (2nd Edition) ", John Wiley & Sons, 1999 2nd edition. Glenford J.Myers, " The Art of Software Testing ", John Wiley & Sons, 1979. Boris Beizer, Black-Box Testing: " Techniques for Functional Testing of Software and Systems ",John Wiley & Sons, 1995. Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE406 SOFTWARE CONFIGURATION MANAGEMENT L T P

C 4 Aim To learn the basic concepts of Software Configuration Management. Objective To understand and apply Software Configuration Management concepts for software development. Introduction Overview of Software Configuration Management : History of Software Configuratio n Management- Software Configuration Management - concepts and definitions- Need and Importance of Software Configuration Management Basic Concepts. Software Configuration Management Implementation Different phases of Software Configuration Management Configuration Identificati on Configuration Control Status Accounting Configuration Verification and Audits. 0 0 3

Software Configuration Management advanced concepts and standards Software Configuration Management: Advanced Concepts Software Configuration Mana gement standards Software process improvement models and SCM Software Configuration Management organization & Document Management Software Configuration Management Plans Software Configuration Management organi zation Software Configuration Management tools - Documentation management and co ntrol and product data management Operation and Maintenance of Software Configuration Management Software Configuration Management Implementation Software Configuration Manageme nt operation and Maintenance- Software Configuration Management in special circu mstances Reference: Alexis Leon, Software Configuration Management Handbook , 2nd Edition Software Configuration Management Strategies and IBM Rational ClearCase: A Practica l Introduction, 2nd Edition Mode of Evaluation: By Assignment, Seminars and Written Examinations

06MSE408 OPEN SOURCE PROGRAMMING - II L C 4 Aim To create Software applications that can be accessed by all the people ove r the internet and to allow the users to customize the software based on their r equirements. Objective On completion of this course the students will be able to create open sour ce software applications and can publish it over the Internet. 0 0 3 T P

Introduction to PHP: Open source Programming PHP, Apache, MySQL, Postgress, SQL and Perl- Overview of PHP Variables, operations, Constants, control structures a rrays, Functions, classes Handling files. My SQL database programming: connecting multiple database handling. table creation record insertion updation

E-mailing with PHP: sending an email multipart message storing images getting co nfirmation. Session tracking using PHP Graphics Input Validators cookies. Introduction to Perl / TCL / Python: Numbers and Strings Control Statements List s and Arrays Files Pattern matching Hashes Functions. Introduction to TCL/TK, In troduction to Python. References Beginning PHP, Apache, MySQL web development Michael K.glass, Rommn le Scouarnec, et al.Wiley Publishing, Inc, New Delhi, 2004 Core PHP programming, Leon Atkinson and Zeev Suraski, Pearson Education, Delhi, 2004. PHP Professional Projects, Ashish Wilfred Meeta Gupta and Karticj Bhatnagar Pren tice Hall & India Pvt ltd, New Delhi, 2002. Teach Fourself perl, Clinton pierce, Techmedia, New Delhi, 2000. Tom Christiansen and Nathan Torkington, Perl CookBook, O Reilly, 2003 Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE414L SOFTWARE TESTING LAB L C T P

The Students have to form a team size of 3 or 4. Each team is assigned System An alyze, Coding, testing/.metrics tools like Code Comparison, Compiler-based Analy sis, Complexity-based Metric, Modeling , Review, Volume testing, Stress Testing, Regression testing etc This tool has to be used for testing and taking various decisions. Comparative Study of different tools have to be done The above facts has to be documented and a report has to be submitted at the end of the semester

06MSE416L OPEN SOURCE PROGRAMMING LAB L 0 0 3 2 T P C

Mini Projects will be assigned for the students under the following domains. PHP PERL My SQL Linux 06MSE501 DESIGN PATTERNS L C 4 Aim To provide advanced concepts on software design and architecture Objective To learn various architectural styles and Design Pattern Introduction Introduction to patterns Pattern categories Relationship- pattern description tterns and S/W architecture- Description of architectural patterns-Design patter n an Introduction Description of design pattern. pa 0 0 3 T P

Design Pattern Catalog of Design Pattern Problem solving by Design Pattern Guidelines for selec ting & using design pattern Creation of patterns Abstract factory Builder Factor

y methods

prototype

singleton Adapter

Discussion Composite Decorator Faade Flyweight Proxy

Structural Pattern Structural Pattern ssion. Behavioral Pattern

Bridge

Behavioral Pattern Chain of responsibility Command Memento- Observer - State Strategy Template method Future of Patterns Benefits of pattern in S/ W development tudy. References:

Interpreter Iterator visitor - discussion

Mediator

expectation from design pattern

A Case s

Gamma & Helm et al, Design Patterns , Addison Wesley 1999. Frank Bushmann et al, Pattern Oriented S/W Architecture , John Wiley & sons -2001 Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE503 SOFTWARE INSPECTION L T P C 4 Aim To learn the need and concepts of software inspection Objective To prepare, conduct and manage software inspection. Inspection Background Inspection background Inspection preconditions common questionnaires Inspections approach to success inspections first inspections approach to success inspectio n. Introduction definitions from inspection comparison Walk thru & review defect detection & prevent or characteristics inspection. The Inspection process flow of Improvement process planning & scheduling inspection meeting analysis meeting rework follow up prevention meeting & inspection process monitoring. Moderator & other roles Introduction quality of good moderator code of conduct for moderator moderator p ools moderating 1:1 Inspection role participation role assignments participant p ersonalities. Inspection Analysis 0 0 3

Inspection data goal setting defects classification sign of work products effort time & cost other inspection date inspection date tools defect density inspecti on meeting rate inspection effectiveness inspection analysis casual analysis par eto analysis presentation. Managing Inspections Re inspection criteria imp rate preparation rate, compelling on group consensus rework Vs restrictive recommendations Managing inspections policy commitment coordinators SQA responsible Types of Inspection Approaches what to inspect? Software work products systems engineering reviews w alk through self review disk check a person inspection N fold inspections formal technical review clear work inspection characteristics- inspections future impr ovements in work product - aspects of a best case inspection process References: Ronald a Radice , Software inspections how to cut costs , improve quality & short terms time cycles of software projects , Tata McGraw hill 2003 Watts Humpherey, Managing Software process addision wesly 2000 Pearson Education 2 004 Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE505 SOFTWARE MEASUREMENTS L T P C 4 Aim To learn the basics of software measurement Objective To understand and utilize the various product and process metrics for software q uality. Fundamentals of Measurements and Experimentation Fundamentals of measurement Basics of Measurements in Software Engineering A goa l-based framework for software measurement Software Measurement validation. Software Metrics Data Collection and Analysis 0 0 3 proctor projects quality of inspecti inspections co-

feedback

Empirical investigation - Planning formal experiments - Software metrics data Co llection - Analysis methods statistical methods. Measuring Product Attributes Measurement of internal product attributes - size and structure - External produ ct attributes - measurement of quality Metrics for Quality Software quality metrics - Product quality - Process quality Software reliability measurements -metrics for software maintenance. Measurement and Management Quality management models Resource measurement urement program measurement in practice. References: Norman E - Fentar and Share Lawrence Pflieger, " Software metrics ", Internation al Thomson Computer Press, 2003.Thomson Delmar 2nd edition Stephen H.Kin, " Metric and models in software quality engineering ", Addison We sley 1995 Pearson Education 2003 2nd edition William A. Florac and Areitor D. Carletow, " Measuring Software Process ", Addis on - Wesley, 1995. Mode of Evaluation: By Assignment, Seminars and Written Examinations 06MSE507 SOFTWARE QUALITY AND PROCESS IMPROVEMENT L T P C 4 Aim To learn the concepts and procedures assuring software quality and process impro vement Objective To understand and implement software quality and process improvement procedures. 0 0 3 process predictions planning meas

Software Quality Concepts of Quality Control, Quality Assurance, Quality Management - Total Quali ty Management; Cost of Quality; QC tools - 7 QC Tools Measuring of quality Stand ards and procedures Technical activities ISO 9000 series standards ISO 9001 accr editation Management responsibility Board responsibility and day to day responsi bility Documented quality system Training and induction Relation to ISO 9000-3.

Standards and procedures Quality system - Documentation Contract review Standards and procedures for fea sibility analysis Standards and procedures for design and requirements Traceabil ity validation Organizational interface Design input requirements Configuration management Configuration control Status accounting Subcontracted requirements Sub contracting decisions Purchased product identification Pre-checking. Software Process Improvement. A Framework for Software Process Improvement. Software process improvement envir onment. Software process infrastructure. Software process improvement roadmap. S oftware process assessment. Software process improvement plan. Software Process Infrastructure. Justification and definition. Organizational a nd management infrastructure. Process technical infrastructure. An example of a software process support infrastructure. Making the infrastructure effective. Process Improvement Roadmaps. Learning from the quality gurus. Software process improvement models. Staged versus continuous architecture for SPI models. Standa rds and models for SPI. Text Books: 1 .Sami Zahran Success Software Process Improvement: Practical Guidelines for Business McGraw Hill, New York -

2. Darrel Ince - ISO 9001 and Software Quality Assurance 1994. Reference Books:

Osten Oskarsson and R - An ISO 9000 Approach to Building Quality Software - Pr entice Hall - 1996. Roger Pressman, " Software Engineering ", McGraw Hill, Pearson Education 6th edi tion 2004 Watt.S. Humphery, " Managing Software Process ", Addison - Wesley, 2000. Mode of Evaluation: By Assignment, Seminars and Written Examinations

. 06MSE513L CASE TOOLS LAB - II L C 0 0 3 2 T P

The Students have to form a team size of 3 or 4. Each team is assigned System An alyze, Coding, testing/.metrics tools like Code Comparison, Compiler-based Analy sis, Complexity-based Metric, Modeling , Review, Volume testing, Stress Testing, Regression testing etc This tool has to be used for testing and taking various metrics. Estimation for some application Comparative Study of different tools have to be done The above facts has to be documented and a report has to be submitted at the end of the semester 06MSE515L SOFTWARE MEASUREMENT LAB L T P C 0 0 3 2

The Students have to form a team size of 3 or 4. Each team is assigned testing / metrics tools like Code Comparison, Compiler-based Analysis, Complexity-based M etric, Modeling , Review, Volume testing, Stress Testing, Regression testing e tc This tool has to be used for testing and taking various metrics. Estimation for some application Comparative Study of different tools have to be done The above facts has to be documented and a report has to be submitted at the end of the semester

ELECTIVE DISTRIBUTED COMPUTING L C 4 Aim The subject aims to cover parallel & distributed computing architecture, netwo rked clusters of computers, utilization and management of the expensive resource s that are remote to the users. 0 0 3 T P

Objectives The students would be able to understand and use different network models, secur ity mechanisms and design methodologies of Distributed systems UNIT I: Introduction to distributed computing system, evolution different model s, gaining popularity, definition, issues in design, DCE, message passing introdu ction, desirable features of a good message passing system, issues in IPC, synch ronization, buffering, multigram messages, encoding and decoding of message data , process addressing, failure handling, group communication. UNIT II: RPC-Introduction, model, transparency, implementation mechanism, stub g eneration, RPC messages, marshalling arguments and results, server management, p arameter - passing semantics, call semantics, communication protocols for RPCs, client server binding, exception handling, security, mini project using Java RMI UNIT III: Distributed shared memory- general architecture of DSM systems, design and implementation issues of DSM systems, granularity, structure of shared memo ry space, consistency model, replacement strategy, thrashing, advantages of DSM, clock synchronization DFS and security- Desirable features of good DFS, file mo dels, file accessing Models, file sharing semantics, file catching schemes, file replication, fault Tolerance, atomic transaction, potential attacks to computer system, cryptography, authentication, access control. Digital signatures, DCE s ecurity service. UNIT IV: Overview of Parallel and Distributed Computing, Operating Systems, Clie nt-Server Model, Distributed Database Systems, Parallel Programming Languages an d Algorithms. Distributed Network Architectures- Managing Distributed Systems. D esign Considerations UNIT V: Methods and tools for development, implementation & evaluation of distr ibuted information systems, workflow, software processes, transaction management , and data modeling, infrastructure e.g. middle-ware to glue heterogeneous, auto nomous, and partly mobile/distributed data systems, such as e.g. client/server-, CORBA-, and Internet-technologies. Methods for building distributed application s. TEXT BOOK: 1. Pradeep K. Sinha, "Distributed Operating Systems: Concepts & Design", PHI, 20 05. REFERENCE BOOKS: 1. Crichlow Joel M, "An Introduction to Distributed and Parallel Computing", PHI , 1997 2. Black Uyless, "Data Communications and Distributed Networks", PHI, 5th Editio n Mode of Evaluation: By Assignment, Seminars and Written Examinations ELECTIVE WEB SERVICES L T 4 0 0 3

Aim To provide the student with the basics of .NET, C#.

Objectives After completion of this course the students will be able to undergo projects in .NET UNIT I: Introduction to Microsoft .NET Platform; Building Blocks of .NET C# Lang uage Fundamentals: Object Oriented Programming in C#. UNIT II: NET Framework Concepts I: console I/O-working with strings-formatting a nd conversion- file/O serialization. UNIT III: Threading NET Framework Concepts II: Reflection- Remoting -XML Parsing -Security; UNIT IV: Writing GUI Applications with the .NET Framework; Introduction to ADO.N ET; Writing Web Application with the .NET framework; UNIT V: Introduction to Web Services; Writing Mobile Application with .NET Frame work; Advanced Concepts. TEXT BOOK: Rick Leinecker ASP.NET on the edge, IDG Books India Pvt. Ltd, 2003 REFERENCE BOOK: 1. MSDN, Microsoft C# Language specification, WP Publishers and Distributors, 20 01 2. MSDN, Microsoft Visual Basic .NET framework, WP Publishers and Distributors, 2003 3. MSDN, .NET Framework, WP Publishers and Distributors, 2003 Mode of Evaluation: By Assignment, Seminars and Written Examinations ELECTIVE DATAWAREHOUSING AND DATA MINING * L T C 4 Aim The subject aims to cover knowledge discovery process and to design and popula te a business data warehouse. Objectives To make familiar with the various concepts of data warehousing like meta data, data mart, summary table, fact data and dimension data. To sail along with the various approaches in data mining. To familiarize with the various data warehous ing and data mining tools 0 0 3

UNIT I: Data Warehouse and OLAP Technology for Data mining Introduction to Data Warehouse- A multidimensional Data Model Data Warehouse architecture Data prepro cessing- Data cleaning Data integration and Transformation. UNIT II: Data Mining Introduction Introduction to Data Mining Data Mining Functi onalities Classification of Data Mining systems, Major issues in Data mining. UNIT III: Data Mining primitives, languages & system architecture: Data Mining primitives: Task relevant data kind of knowledge to be mined Background knowledg e interestingness measures presentation & visualization of discovered pattern - D ata Mining Query language Designing Graphical User interfaces based on DMQL - Ar chitecture of Data mining. UNIT IV: Association Rule Mining Basic concepts market basket analysis - Mining single dimensional Boolean association rules from transactional databases. Clas sification & prediction: What s classification - issues regarding classification a nd prediction Bayesian classification prediction: linear non linear. UNIT V: Cluster analysis Types of Data in cluster analysis - Major clustering methods. Data mining applications. TEXT BOOK: 1. Han J. & Kamber, M, . REFERENCE BOOKS: 1. Immon.W.H., Building the Data Warehouse , Wiley Dream Tech, 3rd Edition, 2003. 2. Anahory S., Murray, D, Data Warehousing in the Real World , Addison Wesley, 1st Edition, 1997. Mode of Evaluation: By Assignment, Seminars and Written Examinations ELECTIVE IMAGE PROCESSING L T C 4 0 0 3 Data Mining: Concepts and Techniques , Morgan Kaufmann, 2005

Aim This subject aims to introduce the concepts of image processing such as Represen tation of Image, Image Transform, Image Restoration using various approaches, Im age segementation and Image recognition and interpretation Objectives The students would be able to understand and explain Fundamentals of Image proce ssing, Image Transforms, Image restoration techniques, Image segmentation and Re cognition & interpretation of Images. UNIT I: Digital Image representation, steps in image processing, Elements of Dig ital Image processing systems. Fundamentals : Elements of visual perception, sam pling and quantization, basic relationship between pixels. Imaging Geometry some basic transforms, perspective transforms.

UNIT II: Image Transform Fourier transform, Discrete Fourier transform, Fast Fou rier transform, properties of 2 D Fourier transform, Image Enhancement Spatial d omain methods, Frequency domain methods, Enhancement by point processing, spatia l filtering, Enhancement in the Frequency domain. UNIT III: Image Restoration Degradation model, Algebraic approach to restoration , Inverse Filtering, Wiener Filter constraint least squares restoration, Restora tion in the spatial domain, Image Compression- Redundancy, Compression models, E rror free compression, Lossy compression, Image compression standards. UNIT IV: Image Segmentation Detection of Detection of Discontinuity Edge linking and boundary detection, Thresholding Region oriented segmentation. Image repres entation Representation schemes, Boundary descriptors, Regional descriptors. UNIT V: Recognition and interpretation Elements of Image analysis, patterns and pattern classes, Decision and theoretic methods, structural methods, Interpretat ion. TEXT BOOK : 1. Rafel C. Gonzalez & Richard E. Woods, Digital Image Processing, Pearson Educa tion, 2005 REFERENCE BOOK: Anil K. Jain, Fundamentals of digital Image processing, PHI, 1989. Mode of Evaluation: By Assignment, Seminars and Written Examinations ELECTIVE DIGITAL SIGNAL PROCESSING L T C 4 Aim To deliver the concepts of signal processing Objective To make students to understand the various digital filters family of digital pro cessors and its applications. Review of basic concepts Signals and signal processing: characterization and classification of signals, t ypical signal processing operations, examples of typical signals, typical signal processing applications, why digital signal processing? Transform-domain repres entations of l to 1 systems: the frequency response, the transfer function, type s of transfer functions, all pass transfer function, minimum-phase and maximum-p hase transfer functions, complementary transfer functions, digital two-pairs, st ability test, discrete-time processing of random signals. Digital filters 0 0 3

Structures: block diagram representation, signal flow-graph representation, equi valent structures, basic fir digital filter structures, basic iir filter structu res, state-space structures, all pass filters, tunable iir digital filters, casc aded lattice realization of iir and fir filters, parallel all pass realization o f iir transfer functions, digital sine-cosine generator, computational complexit y of digital filter structures. Design: preliminary consideration, impulse invar iance method of iir filter design, bilinear transform method of iir filter desig n, design of digital iir notch filters, low pass iir digital filter design. Exam ples, spectral transformations of iir filters, fir design based on truncated fou rier series, fir filter design based on frequency sampling approach, computer-ai ded design of digital filters. Digital signal processors Overview of motorola DSP3xx family of digital signal processors, architectures o f DSP56307: assembly language instructions and programming: typical software app lications. Implementation, applications Implementation consideration: basic issues, software implementation, computation of the discrete fourier transform, the quantization process and errors, analysi s of coefficient quantization effects, analysis of coefficient quantization effe cts in fir filters. Representative applications: dual tone multifrequency signal detection, spectral analysis using dft, short-term discrete fourier transform, musical sound processing, digital fm stereo generation, discrete-time analytic s ignal generation, voice privacy system, subband coding of speech and audio signa ls. TEXT BOOK: Sanjit K. Mitra: Digital Signal Processing A Computer Based Approach, Tata McGraw -Hill, 1998. (Chapters 1,4,6,7,8.1 To 8.3, 9.1 To 9.10, 11.1 To 11.8) REFERENCE BOOKS: Alan V. Oppenhein, And Ronald W. Schafer : Discrete Time Signal Processing (Seco nd Edition), Prentice Hall, 1998. John G. Proakis & Dimitris G. Manolakis: DSP Principles, Algorithms, And Applica tions Prentice-Hall, 1996. Mode of Evaluation: By Assignment, Seminars and Written Examinations ELECTIVE MULTIMEDIA COMPUTING L T P C 4 0 0 3

Aim : The subject aims to introduce multimedia computing & communications coveri ng various building blocks such as hardware, software, operating systems and DBM S. Objectives : At the end of the course students would be able to use multimedia c omputing hardware, software tools multimedia authoring and design process.

UNIT I: Introduction, Branch-overlapping Aspects of Multimedia, Content, Global Structure, Multimedia- Media and Data Streams, Medium, Main Properties of a Mult

imedia System, Traditional Data Stream Characteristics, Data Streams Characteris tics for Continuous Media, Information Units. UNIT II: Sound/Audio- Basic Sound Concepts, Music, Speech, Image and Graphics- B asic Concepts, Computer Image Processing, Introduction to Optical Storage UNIT III: Video and Animation- Basic Concepts, Television, Computer-based Animat ion, Data Compression-Storage Space, Coding Requirements, Source, Entropy, and H ybrid Coding, Some Basic Compression Techniques-JPEG, H.261, MPEG, DVI UNIT IV: Multimedia Operating Systems- Introduction, Real-time, Resource Managem ent, Process Management, File Systems, Additional Operating System Issues, Syste m Architecture, Multimedia Communication Systems- Application Subsystem, Transpo rt Subsystem, Quality of Service and Resource Management UNIT V: Multimedia Database Systems and its characteristics, Data Analysis, Data Structure, Operations on Data, Integration in a Database Model, Introduction to Hypertext, Hypermedia, Document Architecture, SGML, ODA, MHEG, A Reference Mode l for Multimedia Synchronization, Multimedia Applications- Media Preparation. Me dia Composition, Media Integration, Media Communication, Media Consumption, Medi a Entertainment TEXT BOOK : Ralf Steinmetz and Klara Mahrstedt, "Multimedia computing, communications and Ap plications", Pearson Education Asia, 1st reprint 2001. REFERENCE BOOK: 1. K. Rao, "Multimedia Communication Systems: Techniques, Standards, and Network s", Prentice Hall, 2002 Mode of Evaluation: By Assignment, Seminars and Written Examinations ELECTIVE NATURAL LANGUAGE PROCESSING L T C 4 0 0 3

Aim To introduce the fundamental techniques of natural language processing, to devel op an understanding of the limits of those techniques and of current research is sues, and to evaluate some current and potential applications Objective Students should be able to discuss the current and likely future performance of several NLP appl ications, such as machine translation and email response be able to describe briefly a fundamental technique for processing language for several subtasks, such as morphological analysis, parsing, word sense disambigua

tion etc. Understand how these techniques draw on and relate to other areas of (theoretica l) computer science, such as formal language theory, formal semantics of program ming languages, or theorem proving Introduction: Introduction to the Morphology, Syntax, Semantics by linking th e linguistics view (computational linguistics) with the artificial intelligence vie w (natural language processing) Morphology Analysis and generation of language on word level: e.g. problems with compounding and idiomatic phrases, homophonous strings as well as loan words an d their processing using e.g. finite state automata as well as semantic networks . Ambiguities in words like pen and pipe , but will also discuss some complex strings . Syntax Analysis and generation of language on phrasal and sentence level: e.g. applications such as machine translation and grammar checking and the processing using phase structure grammars as well as unification based formalisms, and rel ating those formalisms to recursive transition networks (RTNs) as well as augmen ted transition networks (ATNs). Semantics Language ambiguities on the level of meaning : represented by case struc tures and conceptual dependency structures. We will look at famous utterances su ch as: Colourless green ideas sleep furiously. And will discuss why the machine runs into problems during analysis, and how these problems can be overcome. Applications of NLP Machine Translation, Grammar Checkers Dictation, Automatic Document Generation, NL Interfaces

Text Book: Daniel Jurafsky, James H. Martin e Hall, 2001

Speech and Language Processing Prentic

Reference Books: Chris Manning and Hinrich Schtze, Foundations of Statistical Natu ral Language Processing , MIT Press. Cambridge, MA: May 1999. Mode of Evaluation: By Assignment, Seminars and Written Examinations ELECTIVE COMPUTER SIMULATION & MODELLING L T P C 4 Aim This subject aims to cover statistical models in simulation, Inventory systems, Random numbers & variables, Input and output analysis Objectives The students would be able to understand and use discrete event simulation, simu lation techniques, and statistical methods. UNIT I: Introduction To Simulation-Advantages and disadvantages of simulation, a reas of application, Systems and system environment, Components of a system, Dis 0 0 3

crete and continuous systems, Model of a system. Types of models, Discrete eve nts system simulation, Steps in a simulation study. Simulation Examples, Simulat ion of queuing systems, Simulation of inventory systems, Other examples of simul ation, Discrete event simulation, general principles and computer simulation lan guages. Concepts in DES, Programming languages for DESS: FORTRAN, GASP, SIMSCRI PT, GPSS, SLAM, Summary and comparison of simulations. UNIT II: Statistical Models in Simulation- Review of terminology & concepts, Use ful statistical models, Discrete distributions, Continuous distributions, Proces s, Empirical distributions. Queuing Models: Characteristics of queuing systems, queuing notation, Transient & steady state behavior of queuing notation, Transi ent & steady state behavior of queues, long run measures of performance of queui ng systems, steady state behavior of finite population models. UNIT III: Inventory Systems- Measures of effectiveness, Inventory policies, Dete rministic systems, and probabilistic systems, Simulation in inventory analysis. Random Number Generation: Properties of random numbers, Generation of Pseudo ran dom. Nos., techniques for generating random nos., tests for random nos. Random V ariable Generation: Inverse transform technique, Direct Transformation for the n ormal distribution, Convolution method, Acceptance-Rejection technique. UNIT IV: Input Data Analysis-Data collection, identifying the distribution, para meter estimation, goodness-of-fit tests. Verification and validation of simulat ion models: Model building, verification & validation, verification of simulatio n models, calibration & validation of models. UNIT V: Output Analysis For A Single Model- Stochastic nature of O/I data, types of simulations with respect to O/P analysis, measures of performance and their estimation, O/p analysis for terminating simulations, O/P analysis for steady-st ate simulations. Comparison and evaluation of alternative system designs: Compa rison of two and several system designs, statistical models for estimating the e ffect of design alternatives. TEXT BOOK : Jerry Banks, John S. Carson, Discrete-event System Simulation, PHI, 3rd Edition REFERENCE BOOK: 1. Karian, Z.A. and Dvdewicz. E.J., Modern Statistical Systems and GPSS Simulati on, Freeman, 1991. Mode of Evaluation: By Assignment, Seminars and Written Examinations ELECTIVE GEOGRAPHIC INFORMATION SYSTEM L T C 4 Aim To provide an environment to understand the concept of GIS Objective 0 0 3

To make the students to understand spatial data models, Arcinfo Concepts. Unit I Introduction and Overview of Geographic Information Systems:- Definition of a GI S, features and functions; why GIS is important; how GIS is applied; GIS as an I nformation System; GIS and cartography; contributing and allied disciplines; GIS data feeds; historical development of GIS. Unit II Maps, Map Projections and Coordinate Systems:- Maps and their characteristics (s election, abstraction, scale, etc.); map projections; coordinate systems; precis ion and error. Unit III GIS Concepts and Spatial Data Models :Automated cartography versus GIS; CAD Concepts; Data base; Remote Sensing, Conce pt of data model; raster data model; compression, indexing and hierarchical data structures; vector data model; topology; TIN data model. Unit IV Arcinfo Concepts:- ARC/INFO Data Management; workspace; naming conventions; Map projections; Regions, Introduction to Arcinfo Modules. Unit V: Data Sources, Data Automation and Data Quality:- Major data feeds to GIS and the ir characteristics: maps, GPS, images, databases, commercial data; locating and evaluating data; data formats; data quality; metadata.

Text Books 1. Ian Heywood, Introduction to Geographical Information Systems, Pearson Educat ion, 2002

ELECTIVE SOFTWARE REENGINEERING L C 4 0 0 3 T P

Aim To understand the concept of software Reengineering Objective On completion of this course the students will understand Reengineering Patterns , Need for Reengineer, The Reengineering Life Cycle, Reengineering Patterns, For m of a Reengineering Pattern, A Map of Reengineering Patterns Unit I: Write Tests to Enable Evolution Pattern - Grow Your Test Base Incrementa lly Pattern - Use a Testing Framework Pattern - Test the Interface, Not the Impl ementation Pattern - Record Business Rules as Tests Pattern - Write Tests to Und erstand Unit II: Migration Strategies Forces Overview Pattern - Involve the Users Patter n - Build Confidence Pattern Migrate Systems Incrementally Pattern - Prototype t he Target Solution Pattern - Always Have a Running Version Pattern - Regression Test after Every Change Pattern- Make a Bridge to the New Town Pattern - Present the Right Interface Pattern - Distinguish Public from Published Interface Patte rn - Deprecate Obsolete Interfaces Pattern -Conserve Familiarity Pattern - Use P rofiler before Optimizing Unit III: Detecting Duplicated Code Forces Overview Pattern - Compare Code Mecha nically Pattern - Visualize Code as Dot plots Unit IV: Redistribute Responsibilities Forces Overview Pattern - Move Behavior C lose to Data Pattern - Eliminate Navigation Code Pattern - Split up God Class Unit V: Transform Conditionals to Polymorphism Forces Overview Pattern - Transfo rm Self Type Checks Pattern - Transform Client Type Checks Pattern - Factor Out State Pattern - Factor Out Strategy Pattern - Introduce Null Object Pattern - Tr ansform Conditionals into Registration Text Book: 1. Object-Oriented ReEngineering Patterns, Serge Demeyer, Stphane Ducasse, Oscar Nierstrasz , ELsvier Publication, 2003 Mode of Evaluation: By Assignment, Seminars and written Examinations

ELECTIVE SOFTWARE AGENTS L C 4 0 0 3 T P

Aim: The aim of this subject is to deal with the dynamic and distributed nature of both data and applications require that software not merely respond to reques ts for information but intelligently anticipate, adapt, and actively seek ways t o support users. It covers various approaches to agent-to-agent communication an d agent mobility, as well as the use of agents to provide intelligent interopera bility between loosely coupled components of distributed systems. Objective: The students would be able to describe and use software agents for en hance learning and providing intelligent assistance to users in situations where direct manipulation interfaces alone are insufficient. They would be able to se lect and use languages and tools for design and implementation of intelligent ag ents and multi-agent systems including mobile agents. They would also be able to comprehend the software agent applications in decision support systems, manufac turing system, information retrieval and knowledge discovery. Pre-requisites: Information Systems, AI Content: Information Systems: Internet - based Information systems - Adaptive (C ustomizable) Software Systems - Autonomous mobile and immobile robots - Data min ing and Knowledge discovery - Smart Systems (Smart homes, Smart automobiles, etc .) - Decision Support Systems and Intelligent design and Manufacturing Systems. Foundations: Theoretical Foundations for Software Agents. Design and Implementat ion of Intelligent Agents: Reactive - Deliberative - Planning - Knowledge - Base d - Logical - Rational - Commutating - Adaptive - Learning agents. Languages: L anguages and tools for design and implementation of intelligent agents and multi -agent systems, Introduction to mobile agents. Applications: Adaptive Informatio n - Retrieval - Decision Support - Knowledge Discovery - Computational Biology Design and manufacturing - Smart Systems - Robots. References: Russell & Norvig, Artificial Intelligence:A Modern Approach , Prentice Hall, 1995. Huhns and Singh(ed), Palo Alto, Readings in Agents , Morgan Kaufmann 1998. Bradshaw (ed.), Software Agents , MA:MIT Press, 1997. Bigus & Bigus, Constructing Intelligent Agents with Java , John Wiley, 1999. Jeffrey Broadshaw, Software Agents , MIT press, 1997 James. E. White, Mobile Agents , General Magic, Inc. 1996.

ELECTIVE DECISION SUPPORT SYSTEM L C 4 0 0 3 T P

Aim : To provide an environment to understand the system and to make decisions. Objectives : The students will be capable of designing the decision support syst em for managers to take the decision. Decision making and computerized support . Managers and decision making, managerial decision making and informative system , managers and computerized support, the need for computerized decision support technologies, a framework for decision support, the concept of decision support systems, group decision support systems, executive information (support) systems , expert systems, artificial neural networks, hybrid support systems, the evolut ion and attributes of computerized decision aids, introduction and definitions, systems models, the modeling process; evaluation. UNIT I: DSS configuration, characteristics, capabilities, and components of DSS, the use r, DSS hardware, distinguishing DSS from management science and MIS, classificat ions of DSS, data warehousing, access, analysis, and visualization, the nature a nd sources of data, data collection and data problems, the internet and commerci al database services, database management systems in DSS. UNIT II: Database organization and structure, data warehousing, OLAP: data access and min ing, querying and analysis, data visualization and multidimensionality, intellig ent database and data mining, the big picture. Support systems UNIT III: The GDSS meeting process, constructing a GDSS and the determinants of its succes s, GDSS research challenges Modeling for mss, static and dynamic models, treatin g certainty, uncertainty and risk, influence diagrams, mss modeling in spreadshe ets, decision analysis of a few alternatives, optimization. UNIT IV: Heuristic programming, simulation, multidimensional modeling, visual spreadsheet s, financial and planning modeling, visual modeling and simulation, ready-made q uantitative software packages, model base management, knowledge-based DSS & AI c oncepts and definitions, AI verses natural intelligence, knowledge in AI, how AI differs from conventional computing, the AI field, types of knowledge-based DSS .

UNIT V: Intelligent DSS, the future of AI. DSS construction; the DSS development process ; the DSS of the future, decision making in groups, group DSS, the goal of GDSS and its technology levels, the technology of GDSS, the decision (electronic mee ting) room, GDSS software idea generation, negotiation.

TEXT BOOK: Efrain Turban And Jay E. Aronson: Decision Support Systems And Intelligent Systems (Fifth Edition), Prentice-Hall, 1998, (Chapters ,2,3,4,5,6,8,10,12,13,14 ,15,16,21) Mode of Evaluation: By Assignment, Seminars and Written Examinations

ELECTIVE E-COMMERCE L C 4 Aim To provide an environment to understand the concepts of E-Commerce Objective To make students to the basic concepts, security issues and Business Process Ree ngineering Electronic Commerce: Electronic Commerce, electronic data interchange (EDI), value added networks, el ectronic commerce over internet, PC and networking, networking , communication m edia, computer communication system, ISO model, X.400 message handling system, i nternet E-mail, E-mail security, light weight directory access protocol, interne t search, internet 2, Intranet Introduction, Services. Electronic data interchange (EDI) EDI introduction, cost and benefits, components of EDI system, implementation is sues, UN/EDIFACT standard introduction, an EDIFACT message, interchange structur e, message directories, EDI over internet, commerce over extranets, identificati on and tracking tools for electronic commerce. Technology and security issues Technology issues Bandwidth issues, technology issues for the internet, NII stan dard, NI1 services, NI1 agenda, G11, security issues security concerns, security solution, electronic cash over the internet, internet security, guidelines for 0 0 3 T P

cryptography policy. Reengineering: Business process reengineering, approach for BPR, strategic alignment model, BPR methodology, change management, change management in public administration, imp lementation plan, legal issues, risks paper document versus electronic document, laws for e commerce, EDI interchange agreement. Case Studies: EDI in Indian customs, US electronic procurement, banks, automotive industry, SN S, E-commerce in India EDI in India, internet in India, laws for e commerce in I ndia, UNCITRAL model law on electronic commerce, model interchange agreement for international commercial use of EDI. REFERENCE BOOK: Kamlesh K. Bajaj E-Commerce - Tata McGraw Hill 2000. San Jose CA Electronic Publishing Guide Adobe Press 1998. Jim Iterne World Wide Web Marketing John Wiley 1995. Mode of Evaluation: By Assignment, Seminars and Written Examinations

ELECTIVE NETWORK SECURITY L C 4 0 0 3 T P

Aim : The subject aims to cover the significance of security of computer systems and computer networks. It also covers the topics such as cryptography and vario us encryption algorithms. Objectives : The students would be able to understand and use encryption algorit hms such as RSA, Blow Fish etc; authentication techniques digital signatures and System-level security issues. UNIT I: Attacks, Services & Mechanisms Security attacks Security services Networ k Security Model. Conventional Encryption: Classical Techniques: Conventional En cryption model - Stenography Classical Encryption Techniques- Modern Techniques: The Data Encryption Standard The Strength of DES Differential and Linear, Crypt o-analysis. UNIT II: Public Key Cryptography: Principles of public-key cryptosystems The RSA algorithm - Key management Diffie-Hellman key exchange Elliptic curve cryptogra phy UNIT III: Message Authentication and Hash functions: Authentication requirements Authentication functions Hash functions Security of hash functions and MACS. Has h Algorithm: MD5 Message Digest algorithm Secure Hash algorithm (SHA-1) HMAC. Di gital Signatures and Authentication Protocols: Digital signatures Authentication

protocols

Digital signature standard.

UNIT IV: Electronic Mail Security: Pretty Good Privacy PGP services Transmission and reception of PGP messages PGP message generation PGP message reception. IP Security: Overview Architecture Authentication header Web Security: A comparison of Threats on the Web Secure socket layer and transport layer security: SSL arc hitecture SSL record protocol Handshake protocols. UNIT - V: Intruders and Viruses, Worms: Intruders Intrusion techniques Password protection Access control Password selection strategies -Intrusion detection- Di fferent approaches of Intrusion detection - Audit records Viruses and related Th reats Firewalls: Firewall design principles Firewall characteristics types of fi rewalls Firewall configurations. TEXT BOOK: 1. William Stallings Cryptography and Network security 2nd edition, Pearson Education, 2002. REFERENCE BOOK: 1. Charlie Kaufman, Raja perlman, Mike speciner, Network Security ntice-Hall of India Pvt Ltd, 2002. Mode of Evaluation: By Assignment, Seminars and Written Examinations ELECTIVE ENTERPRISE RESOURCE PLANNING L 4 Aim To understand the concepts of ERP Objective To emphasis the need for ERP, Various Modules and benefits of market issues. Introduction Introduction to ERP, its evolution, its growth, its advantages, its need, integra ted management information, business modeling, integrated data model, ERP and re lated technologies: BPR, MIS, DSS, EIS, data warehousing, data mining, OLAP, sup ply chain management. Manufacturing perspective and various modules. MRP, BOM, closed loop MRP, MRP-11, DRP, JIT and kanban, CAD/CAM, PDM, data manag ement, benefits of PDM, MTO, and MTS, ATO, ETO, CTO, ERP modules Finance, plant maintenance, quality management, materials management. T 0 P 0 C 3 2nd edition, Pre Principles and Practice",

Benefits and Markets: Reduction of Load-time, on-time, shipment, reduction in cycle time, improved res ource utilization better customer satisfaction, improved supplier performance, i ncreased flexibility, reduced quality costs, market SAP AG, Baan, Oracle, People soft, JD Edwards, SSA, QAD. Implementation: ERP implementation lifecycle pro-evaluation screening, package evaluation, proje ct planning phase, gap analysis, reengineering, configuration, implementation te am training, testing, going live, end user training, post-implementation, In-hou se implementation pros and cons. Future directions and case studies: Faster implementation methodologies, business models and BAPIs. Convergence on w indows NT, application platforms, new business segment and features, some case s tudies. REFERENCE BOOK: 1. Alexis Leon, Enterprise Resource Planning , Tata McGraw Hill, 1999

Mode of Evaluation: By Assignment, Seminars and Written Examinations ELECTIVE INTELLIGENT SYSTEMS L T C 4 Aim To learn the fundamental concepts of intelligent systems Objective To understand the agent based software development. Introduction 0 0 3

Definitions - History - Intelligent Agents - Structure-Environment - Basic Probl em Solving Agents- Formulating - Search Strategies - Intelligent search - Game p laying as search. Knowledge Based Agents Representation - Logic-First order logic - Reflex Agent - Building a knowledge B ase - General Ontology - Inference - Logical Recovery.

Planning Agents Situational Calculus - Representation of Planning - Partial order Planning- Prac tical Planners Conditional Planning - planning Agents. Agents And Uncertainty Acting under uncertainty - Probability Baye s Rule and use - Belief Networks - Uti lity Theory - Decision Network - Value of Information - Decision Theoretic Agent Design. Other Agents Learning agents - General Model - Inductive Learning - Learning Decision Trees-R einforcement Learning - Knowledge in Learning - Communicative agents -Types of C ommunicating agents - Future of AI. . Text Book: Stuart Russell and Peter Norvig Artificial Intelligence - A Modern Approach, Pre ntice Hall, PHI 2004 2nd edition Reference Books: 1. Patrick Henry Winston, Artificial Intelligence, 3rd Edition, AW, Pearson Educ ation 2002 3rd Edition. Nils.J.Nilsson, Principles of Artificial Intelligence, Narosa Publishing House, 2002. Mode of Evaluation: By Assignment, Seminars and Written Examinations

ELECTIVE EMBEDDED SYSTEMS L C 4 0 0 3 T P

Aim : The subject aims to cover the concepts of embedded systems, their design a nd applications, programming models and Inter process communication.

Objectives : The student would be able to understand and use in embedded systems , device drivers, software engineering practices in embedded systems development and Inter process communication. UNIT I: Introduction to Embedded Systems, Processor in the System Software Embed ded into a system Exemplary Embedded Systems Embedded System-On-chip and in VLSI Circuit Processor and Memory Organization Structural Units in a Processor Processor Selection for an Embedded System Memory Devices Memory Selection for an Embedded System Allocation of Mem ory to Program Segments and Blocks and Memory Map of a System Direct Memory Acce ss Interfacing Processor, Memories and I/O Devices. UNIT II: Devices and Buses for Device Networks-I/O Devices Timer and Counting De vices Serial Communication Using the I2 C, CAN and Advanced I/O Buses between the Networked Multiple Devices Host System or Computer Parallel Communication betwee n the Networked I/O Multiple Devices Using the ISA, PCI, PCI X and Advanced Buse s UNIT III: Device Drivers and Interrupts Servicing Mechanism- Device Drivers Para llel Port Device Drivers in a System Serial Port Device Drivers in a System Devi ce Drivers for Internal Programmable Timing Devices Interrupt Servicing (Handlin g) Mechanism Context and the periods for Context Switching, Deadline and Interru pt Latency UNIT IV: Program Modeling Concepts in Single and Multiprocessor Systems Software Development Process- Modeling Processes for Software Analysis Before Software I mplementation Programming Models for Event Controlled or Response Time Constrain ed Real Time Programs Modeling of Multiprocessor Systems UNIT V: Software Engineering Practices in the Embedded Software Development Proc ess-Software Algorithm Complexity Software Development Process Life Cycle and it s Models Software Analysis Software Design Software Implementation Software Test ing, Validating and Debugging Real Time Programming Issues During the Software D evelopment Process Software Project Management Software Maintenance Unified Mode lling Language (UML) Inter-Process Communication & Synchronisation of processes, Tasks & Threads-Mult iple Processes in an Application Problems of Sharing Data by Multiple Tasks and Routines Inter process Communication. TEXT BOOK : 1. Rajkamal, Embedded Systems-Application, Practice & Design , Tata McGraw Hill

REFERENCE BOOKS: 1. Arnold S. Berger, Embedded Systems Design , CMP Books, 1997

Mode of Evaluation: By Assignment, Seminars and Written Examinations

ELECTIVE MOBILE COMMUNICATION L C 4 0 0 3 T P

Aim : The subject aims to impart the knowledge about the technologies like CDMA, GSM, GPRS and Wireless Application protocols Objectives : The student would be able to understand the principles and practice s of Mobile Communication, Satellite Communication, Medium Access Control techni ques, Mobile Devices, Wireless Local Area Networks, HiperLAN and Bluetooth, Wire less ATM operations, mobile network layer and various wireless Application Proto col. UNIT I: Introduction-Wireless Transmission Frequencies for Radio transmission sign als-Antennas Signal propagation multiplexing Modulation-Spread spectrum Cellular s ystems UNIT II: Communication Systems-Medium access control-Motivation for a specialize d MAC SDMA-FDMA-TDMA-CDMA-comparison of S/T/F/CDMA. Telecommunication Systems GSM DECT TETRA - UMTS and IMT - 2000, Satellite Systems GEO139, LEO139, MEO140 Routing Localization Handover Broadcast systems-Overview igital Audio Broadcasting Digital Video Broadcasting. Cyclic Repetition of Data D

UNIT III: Wireless Communication-Wireless LAN-Infrared vs Radio transmission Infr astructure and ad hoc networks IEEE802.11-HIPERLAN Bluetooth. Wireless ATM-Motivat ion for WATM Wireless ATM working group WATM Services-Reference Model-Functions-Ra dio Access Layer Handover Location Management Addressing Mobile quality of service Ac cess point control protocol. UNIT IV: Mobile network layer-Mobile IP-Dynamic host configuration protocol-Ad h oc networks. Mobile transport layer-Traditional TCP292-Indirect TCP Snooping TCP ,Mobile TCP-Fast Retransmit/Fast recovery-transmission/Timeout Freezing ,Selecti ve Retransmission Transaction oriented TCPU UNIT-V : Support for Mobility File Systems-Consistency World wide Web Hyper Text ma rk up language approaches that might help wireless access-System architecture Wire less Application Protocol TEXT BOOK: Johchen schiller, Mobile Communication, Addison Wesley, 2000. REFERENCE BOOK`: 1. Asoke K. Talukder, Roopa R.Yavagal, Mobile Computing-Technology, Applications and Service Creation , Tata Mcgraw Hill, 2005.

Mode of Evaluation: By Assignment, Seminars and Written Examinations