Professional Documents
Culture Documents
VIT
-------
SYLLABUS M.S [SOFTWARE ENGINEERING] A place [2006 ONWARDS.,] to grow to Learn ; A chance
VIT
------VELLORE INSTITUTE OF TECHNOLOGY
DEEMED UNIVERSITY VELLORE 632 014
II SEMESTER
1 2 3 4 5 6 7 8 06MSE102 06MSE104 06MSE106 06MSE108 06MSE110 06MSE112 06MSE114L 06MSE116L Technical English - II Linear Algebra and Differential Equation Advanced Physics* Digital Computer Fundamental* Object Oriented Programming* Environmental Studies Digital Computer Fundamentals Lab* Object Oriented Programming Lab* Total
III SEMESTER
1 2 3 4 5 6 7 8 06MSE201 06MSE203 06MSE205 06MSE207 06MSE209 06MSE211 06MSE213L 06MSE215L Complex Variables and Partial Differential Equations Microprocessor and Assembly Language Programming Data Structures and Algorithms* Computer Profession and Society* Programming Practices and Coding Standards Management Information Systems Microprocessor and Assembly Language Programming Lab Data Structures and Algorithms Lab* Total
IV SEMESTER Sl.No 1 2 3 4 5 6 7 8 Sub code 06MSE202 06MSE204 06MSE206 06MSE208 06MSE210 06MSE212 06MSE214L 06MSE216L Subject Name Probability Statistics and Reliability Computer Architecture and Organization* System Programming* Internet Programming* Database Management Systems* Theory of Computation* Internet Programming Lab* Database Management Systems Lab* Total L 4 4 4 4 4 4 0 0 T 0 0 0 0 0 0 0 0 P 0 0 0 0 0 0 3 3 C 3 3 3 3 3 3 2 2 22
V SEMESTER
1 2 3 4 5 6 7 8 06MSE301 06MSE303 06MSE305 06MSE307 06MSE309 06MSE311 06MSE313L 06MSE315L Discrete Mathematical Structure Software Engineering* Operating Systems* Computer and Communication Networks* Open Source Programming - I Management in Engineering Computer and Communication Networks Lab* Operating Systems Lab* Total 4 4 4 4 4 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 3 3 3 3 3 3 2 2 22
VI SEMESTER
1 2 3 4 5 6 7 8 06MSE302 06MSE304 06MSE306 06MSE308 06MSE310 06MSE312E 06MSE314L 06MSE316L Graph Theory and its Applications Networking Protocols and Standards Software Architecture and Design Requirements Engineering Compiler Design* Elective I CASE Tools Lab - I Compiler Lab Total 4 4 4 4 4 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 3 3 3 3 3 3 2 2 22
VII SEMESTER Sl.No 1 Sub code 06MSE401 Project I VIII SEMESTER Sl.No 1 2 3 4 5 6 7 8 Sub code 06MSE402 06MSE404 06MSE406 06MSE408 06MSE410 06MSE412 06MSE414L 06MSE416L Subject Name Operation Research Software Testing Software Configuration Management Open Source Programming - II Elective II Elective III Software Testing Lab Open Source Programming - II Total IX SEMESTER Sl.No 1 2 3 4 5 6 7 8 Sub code 06MSE501 06MSE503 06MSE505 06MSE507 06MSE509E 06MSE511E 06MSE513L 06MSE515L Subject Name Design Patterns Software Inspection Software Measurements Software Quality and Process Improvement Elective IV Elective V CASE Tools Lab - II Software Measurements Lab Total X SEMESTER 1 06MSE502 Project 0 0 0 22 L 4 4 4 4 4 4 0 0 T 0 0 0 0 0 0 0 0 P 0 0 0 0 0 0 3 3 C 3 3 3 3 3 3 2 2 22 L 4 4 4 4 4 4 0 T 0 0 0 0 0 0 0 P 0 0 0 0 0 0 3 3 C 3 3 3 3 3 3 2 2 22 Subject Name L 0 T 0 P 0 C 22
List of Electives
VI Semester Data Warehousing and Data Mining Natural Language Processing E- Commerce Network Security VIII Semester Distributed Computing Web Services Image Processing Digital Signal Processing Computer Simulation and Modeling Mobile Communication Embedded Systems Neural Networks IX Semester Multimedia Computing Intelligent Systems Sensor Networks Geographic Information System Software Reengineering Software Agents Decision Support system Enterprise Resource Planning
Aim To learn the fundamental concepts of applied mathematics, namely the Fourier series and Vector Calculus. Objective To evaluate multiple integrals in Cartesian, Cylindrical and Spherical geometries. 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 possible 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- Taylors expansion-Maxima and Minima-Constrained maxima and minima by LaGrange multiplier method-Jacobians-Differentiation under the integral sign-Leibnitzs rule (without proof). Multiple Integrals Beta, Gamma functions-interrelation- Evaluation of Integrals-Error function. Evaluation of Double integrals-Change of order of integration-Change of variables-Polar coordinates- Evaluation of Triple integrals-Cartesian, cylindrical and spherical 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 between parallel lines-tangent plane to a sphere at a point. Vector Calculus: Scalar and vector point functions-gradient-physical interpretation-Total derivative Directional derivative Divergence Curl Vector identities (without proof) physical interpretation of divergence & Curl Scalar and vector potentials Line, surface & volume integrals Greens, Stokes, & Gauss divergence theorems (without proof) related problems. Infinite Series Convergence & Divergence of series, Comparison test D Alemberts Ratio test Raabes test Logarithmic test Cauchys root test Cauchys integral test alternating series Leibnitzz test Concept of Uniform convergence-Weierstrass M-Test-Theorems on Differentiation and Integration of Fourier series (without proof). Fourier Series Representation by Fourier series-Functions having arbitrary period-Euler's formulas for the Fourier coefficients-even and odd functions-Half range series-Theorems on Differentiation and Integration of Fourier series (without proof). Text Books: 1. Erwin Kreysizig, Advanced Engineering Mathematics, 8th Edition., John Wiley & Sons, (Wiley student Edison) (2004). 2. B. S.Grewal, Higher Engineering Mathematics, 38th Edition. Khanna Publications,(2005).
Reference Books: 1. G.B.Thomas and R.L.Finney, Calculus and analytical geometry, 9th Edition, Pearson Education, 5th Indian Reprint, (2002). 2. Michale D. Greenberg, Advanced Engineering Mathematics, 2nd Edition, Pearson Education, First Indian reprint,(2002). 3. R. Courant and F.John, Introduction to Calculus and Analysis, Vol.II, Wiley-Inter Science Pub. (1974) 4. Peter V. O Neil, Advanced Engineering Mathematics, 5th Edition, Thomson, Book/Cole. (2003). 5. C. Ray Wylie, Advanced Engineering Mathematics, 6th Edition, McGraw Hill,(1995). Mode of Evaluation: By Assignment, Seminars and Written Examinations
Aim To enable the students to understand the basics of latest advancement in Physics namely Quantum Mechanics, Laser and its applications, Fiber Optics and its applications, Ultrasonic, Microwaves and Nuclear Physics. Objective It will be the base to understand the concepts involved in all branches of Engineering and Technology. Quantum Physics Dual nature of electron magnetic radiation de Broglie waves Compton Effect experimental verification Heisenberg uncertainty principle Schrodinger equation application particle in a box (ID) Application of Quantum Mechanics problems. Contents Laser characteristics Einsteins coefficients its significance population inversion three level- four level laser gain coefficient threshold gain coefficient CO2 He Ne laser welding, drilling, cutting optical disk systems recording data readout from optical disks Problems. Fiber optics Light propagation through fibres Acceptance angle numerical aperture types of fibres step index, graded index single mode-multimode dispersion inter model intramodel application of fibre optics in communication - source LED Detector PIN photodiode endoscope problems. Ultrasonic and microwaves Properties generation magnetostriction method piezo electric method detection of ultrasonics applications NDT characteristic features of micro waves klystron Gunn diode applications of microwaves. Nuclear Physics Nuclear forces Einsteins mass energy relation (derivation) Binding energy mass defect energy released in nuclear fission critical size four factor formula. Nuclear reactor Fast Breeder reactor Nuclear Power plant. Text Books: 1. Physics for engineers Department of physics, VIT 2005. 2. Concepts of Modern Physics by Arthur Beiser, 6th edition, Tata-Mc Graw Hill Edition (2003) Reference books: 1. William Silfvast, Laser fundamentals, Cambridge University Press (2002). 2. Djafar K. Mynbaeu, Fibre Optic Communication Technology, Pearson Education Asia(2004) 3. C. Kittel, Solid State Physics, John Wiley & Sons, Seventh edition (2001) 4. Irving Kaplan, Nuclear physics, Narosa publishing house (2002) 5. V.Rajendran and A. Marikani, Applied physics & Engineers, 3rd edition, Tata Mc. Graw-Hill (2003) 6. K.C. Gupta, Micro waves, New Age International Ltd. (2000) Mode of evaluation: Written Examination, Assignments, Seminars and Mini projects
Aim 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, temperature, power ratings etc. The operational requirements such as proper heat sink arrangement etc. shall be provided. Semiconductor Basis Review of extrinsic semiconductor drift and diffusion currents thermal generation of minority carriers Hall Effect. Junction Diodes- Energy band diagram PN junction junction diode volt ampere characteristics ratings transition and diffusion capacitance varactor diode avalanche and Zener break down Zener diode tunnel diode PIN diode, clipper and clamper circuits. Transistor Principle of transistor action current components cutoff, active and saturation region input and output characteristics CE, CB, & CC Configurations small signal and large signal beta transistor breakdown ratings Thermal runaway problems Use of Heat sinks. FET And Other Devices Constructional features and characteristics of JFET and MOSFET depletion and enhancement modes VVR operation of FET handling precautions for MOSFET construction and characteristics of UJT, fabrication and characteristics of four layer devices such as SCR, Triac and Diac. Photo Electric Devices Photo emissivity-photo electric theory-Photo diodes Photo voltaic cell LED & LCD Photo multiplier circuit Light absorption and photo devices Photo conductive cell (LDR) Photo transistor PN junction LASER Solar energy converters. Electronic Circuits Half wave and full wave rectifier circuits performance characteristics of rectifier circuits filter consideration capacitor, inductor, L section, RC section filters Voltage regulators current regulators, IC voltage regulators protection circuits for dc power supplies switched mode power supplies. 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 Applications of Integrated Circuits, 1998. 3. J. Millman, C.C. Halkias, Electronic Devices and Integrated Circuits, McGraw Hill, 1997. Mode of Evaluation: By Assignment, Seminars and Written Examinations
06MSE111- PROGRAMMING IN C L 4 Aim To understand the basics of C Programming. Objective To know the basic C programming constructs like data types, operators, decision statements, Control statements, functions, arrays and pointers. Fundamentals of C Programming C fundamentals - character set - identifier and key works - data types - constants - variables declarations - expressions - statements - arithmetic, unary, relational and logical, assignment and conditional operators - 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 - comma operator Functions Functions - defining, accessing function - function prototypes - passing arguments - recursions storage classes multi file programs. Arrays and Structures Arrays - defining and processing - passing array to functions - multidimensional arrays - arrays and string structures - passing structures to functions - self referencing structures - unions Pointers Pointers - declarations - passing pointers to function - operation in pointers - pointer and arrays of pointers structures and pointers - files: creating processing, opening and closing - bit wise operations. Text Book: 1. Kamthane - Programming with ANSI and Turbo C, Pearson Education, 2002. Reference Books 1. 2. 3. 4. 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 T 0 P 0 C 3
Aim To give a comprehensive coverage to the subject of ordinary differential equations and matrices. Objective To know how to model a simple physical problem in the form of a differential equation and analyze it. Matrices The eigen value problem solution symmetric matrices- Theorems concerning eigen value and eigen vectors Quadratic forms Diagonalization Orthogonal reduction- positive definite forms Systems of linear differential equations- Model of a vibrating systems with two masses-Solution by matrix methods. Linear Differential Equations of Higher Order Linear differential equation with constant coefficients Rule for finding the complementary function and particular integral method of undetermined coefficients variation of parameters technique Equation reducible to linear equations with constant coefficient Cauchy Euler equations-simultaneous linear equations with constant coefficients. Power Series Solutions The Strum-Liouville Problem-orthogonality of eigen functions, Bessels and Legendres equations- Power series solutions method of Frobenius Legendre functions Bessels functions orthogonality relations (Proof not required) Fourier Bessel and Fourier Legendre series generating functions recurrence relations. Laplace Transforms Definition-Laplace transform of functions-properties of Laplace transforms Initial and Final value theorems Inverse transform Transform of periodic function convolution theorem step function, Impulse function-concept of transfer function-application to the solution of differential equations. Application of Differential Equations First order equations Newtons law of cooling radioactive decay, L-R and C-R circuits-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 electron 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: 1. Erwin Kreysizing, Advanced Engineering Mathematics, 8th Edition, John Wiley & Sons, (Wiley student Edison)(2004). 2. B.S.Grewal, Higher Engineering Mathematics, 38th Edition. Khanna Publications (2005). Reference Books: 1. W.E.Boyce and R.C. Diprima, Elementary differential equations, 7th Edition. John Wiley & Sons, Inc.(2002). 2 .Michale D. Greenberg, Advanced Engineering Mathematics, 2nd Edition, Pearson Education, First Indian reprint (2002). 3. Peter V. O Neil, Advanced Engineering Mathematics, 5th Edition, Thomson, Book/Cole (2003). 4. C. Ray Wylie, Advanced Engineering Mathematics, 6th Edn, McGraw Hill (1995). 5. Gary L. Peterson, Linear Algebra and Differential Equations, Addison-Wesley (2002). Mode of Evaluation: By Assignment, Seminars and Written Examinations
Aim To enable the students to understand the nature of different types of materials namely Dielectrics, Magnetic, Semi conducting, Conducting and Superconducting materials. Objective To enable the students to understand the nature of different types of materials namely Dielectrics, Magnetic, Semi conducting, Conducting and Superconducting materials. Dielectrics Introduction Dielectric parameters various polarization mechanisms in dielectrics and their frequency and temperature dependence Lorentz field Clausius Mosotti relation dielectric loss dielectric strength dielectric break down different types of dielectric breakdown problems. Magnetic Materials Origin of magnetic moment Bohr magnetron properties of dia, para, ferro, antiferro and ferri magnetic materials Ferromagnetism Domain theory of ferromagnetism Hystersis soft and hand magnetic materials Antiferromagnetic materials floppy and magnetic disk drives magnetic memories ferrite core memory and bubble memory Semi conducting Materials Band theory of solids Semiconductors classification intrinsic, extrinsic-n type, p type-direct, indirect band gap - electron hole pair formation and recombination 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 Drude Lorentz theory electrical conductivity relaxation time drift velocity thermal conductivity Wiedmann Franz law Matthiessens rule, Hall effect problems. Superconducting materials Zero resistance source of superconductivity properties effect of magnetic field Meissner effect critical current isotope effect type I and II superconductors BCS 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 2000.
Aim The subject aims to impart the knowledge about digital logic fundamentals, design steps involved in flipflop, shift register, designing a simple computer which is capable of providing few arithmetic and logical operation. Objectives The students shall be able to understand Boolean laws, Boolean algebra, Boolean logic, logic gate fundamentals, function of flip-flop and shift register, arithmetic and Logic unit, understand the memory representation in ROM, RAM and CPU. Number System Number Systems and Boolean Algebra- Number systems converting number from one base to another complements algorithms for rs and r-ls complements sign. Floating point representation of CodesBinary decimal, error detection reflection alphanumeric 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 dont care condition tabulation method. Combinational Logic Combinational Logic Design-Adder sub tractor code conversion analyzing a combinational circuit multi level NAND and NOR circuits binary parallel adder decimal adder RCD adder Magnitude comparator decoders demultiplexer. Sequential Logic Sequential Logic Design - Flip flops triggering of flip flop analyzing a sequential circuit state reduction excitation tables counters design with state equation. Registers - shift registers ripple and synchronous counters. Processor Organization Processor Organization-Memory unit inter register transfer micro operations bus organization scratch pad memory ALU design of ALU - status register effect of o / p carry design of shifter processor unit design of accumulator. Control Logic Control Logic Design- Control organization PLA control micro program control hardwired control micro program sequencer micro programmed CPU organization. Computer Design Computer Design- Computer configuration instructions and date formats instruction sets timing and control execution of instruction design of computer design of control. TEXT BOOK: 1. 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
Objectives Students will be able to know the fundamentals of object oriented programming and use OOPs features such as inheritance, polymorphism, and templates. Basic Concepts Object Oriented fundamentals- Structured versus object-oriented development, elements of object oriented programming, fundamentals of OO-class, object, and abstraction and its importance, encapsulation, polymorphism, benefits of OOP, structure of C++ program. Classes Working with classes- Classes and Objects- Class specification, class objects, accessing class members, defining member functions, inline functions, accessing member functions within class, data hiding, class member accessibility, empty classes, constructors, parameterized constructors, constructor overloading, copy constructor, new, delete operators, this pointer, friend classes and friend functions. Function Overloading Overloading-Function overloading, operator overloading- overload able operators, unary operator overloading, operator keyword, limitations of increment/decrement operators, binary operator overloading, arithmetic operators, concatenation of strings, comparison operators, Generic programming with templates-Function templates, class templates. Inheritance Inheritance - Base class and derived class relationship, derived class declaration, Forms of inheritance, inheritance and member accessibility, constructors in derived class, destructors in derived class, constructor invocation and data member initialization, data conversion, abstract classes, virtual base classes, virtual functions. Files Files and Streams-Opening and Closing a file, file modes, file pointers and their manipulation, sequential access to a file, ASCII and binary files, random access to a file, error handling during file manipulations, Exception handling-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, Object Oriented Programming with C++, 2nd Edition, 2004, Tata McGraw Hill 2. Bjarne stroustrup, The C++ programming Language, Addison Wesley, 3rd edition, 1988. Mode of Evaluation: By Assignment, Seminars and Written Examinations
Aim The subject aims to impart knowledge about natural resources, ecology, environmental pollution, Role of information technology in welfare of population and 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. Resources Environment & Natural Resources- Definition, Scope, importance, need for public, Natural Resources use, exploitation, deforestation, construction of multipurpose dams effect on forests, Water resources use of surface and subsurface water, effect of floods, drought, water conflicts, Mineral resources use and exploitation, environmental effects of mining, food resources food problems, advantage and disadvantage of fertilizers & pesticides, effect on environment, Energy resources need to develop renewable energy, land resources Land degradation, land slides, soil erosion, desertification & case studies. Ecosystem 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, grassland, desert, aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries). Bio-diversity-Definition, genetic, species and ecosystem diversity, bio geographical classification of India, Values consumptive use, productive use, social, ethical, aesthetic and option values, hotspots, threats related to habitat loss, paoching of wildlife, man-wildlife conflicts, endangered and endemic species of India, Conservation of biodiversity. Pollution Environmental Pollution- Definition - Causes, Pollution effects and control measures of Air, Water, Soil, Marine, Noise, Thermal, Nuclear hazards. Solid Waste management: causes, effects and control measures of urban and industrial wastes, pollution measures, case studies, Disaster management: floods, earthquake, cyclone and landslides. Problems and Development 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 change, global warming, acid rain, ozone layer depletion, nuclear accidents and holocaust case studies, Wasteland reclamation, Consumerism and waste products Environment Protection Act, Air, Water, Wildlife, Forest Conservation Act, Environmental legislation and public awareness. Environment Human Population and the Environment- Population growth, variation among nations, population explosion Family Welfare Programme, Environment and human health, Human Rights, Value Education, HIV / AIDS, Women and Child Welfare, Role of Information Technology Case Studies. Field Work- Documenting environmental assets river / forest / grassland / hill / mountain, Visit to local polluted site Urban / Rural / Industrial / Agricultural, Study of common plants, insects, birds, Study of simple ecosystems pond, river, hill slopes, etc., - Field Visits.
TEXT BOOKS: 1. Erach Bharucha, University Grants Commission, 2. Brunner RC, 1989, Hazardous Waste Incineration, McGram Hill Inc. 480 pgs. REFERENCE BOOKS: 1. Cunningham WP, Cooper TH, Gorhani E & Hepworth MT, 2001. Environmental Encyclopedia, Jaico Publishing House, Mumbai, 1196 pgs. 2. De AK, Environmental Chemistry, Wiley Eastern Ltd. 3. Down to Earth, Center for Science and Environment(R) 4. Odum EP, 1971. Fundamentals of Ecology, WB Saunders Co. USA, 574 pages. 5. Rao MN and Datta AK, 1987. Waste Water Treatment. Oxford and IBH Publishing Co. Pvt. Ltd. 345 pages. Mode of Evaluation: By Assignment, Seminars and Written Examinations
1. 2. 3.
Design a Half adder and a Full adder using NAND gates only. Cascade them to implement a 2 bit binary adder. Design and implement Excess-3 to BCD code converter using logic gates. (Choice 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 gates. Excess-3 to BCD code converter BCD to Excess-3 code converter Design and implement a full adder using a multiplexer. Also implement a multiplexer 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 count down from 7 to n (n>0). Display result on discrete LEDs and the waveform on CRO. 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 segment code converter IC. Design and implement to display result suitably: a. 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. of Logic gates
4.
5. 6. 7. 8. 9. 10.
11 Design and implement Mod n (n<8) synchronous counter using flip flops. Display result suitably. 12 Design and implement a 3-stage up/down counter that counts from a preset value using Decade presettable counter ICs. Display result suitably. 13 Design and implement using 4-bit shift register IC: a. Johnson counter b. Ring counter 14 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.
LIST OF EXPERIMENTS 1. Program illustrating function overloading feature. 2. Programs illustrating the overloading of various operators Ex : Binary operators, Unary operators, New and delete operators etc. 3. Programs illustrating the use of following functions : a) Friend functions b) Inline functions c) Static Member functions d) Functions with default arguments. 4. Programs illustrating the use of destructor and the various types of constructors (no arguments, constructor, constructor with arguments, copy constructor etc). 5. Programs illustrating the various forms of inheritance : Ex. Single, Multiple, multilevel, hierarchical inheritance etc. 6. Write a program having student as on abstract class and create many derived classes such as Engg. Science, Medical, etc. from students class. Create their objects and process them. 7. Write a program illustrating the use of virtual functions. 8. Write a program which illustrates the use of virtual base class. 9. Write programs illustrating file handling operations: Ex. a) Copying a text file b) Displaying the contents of the file etc. 10. Write programs illustrating how exceptions are handled (ex: division-by-zero, overflow and underflow in stack etc)
Objective
After completion the students will have a thorough knowledge in complex variables and partial differential equation. 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 transformations. (w = zA+B, w = z2 ,w= ez), Bilinear transformation, concept of conformal transformation Qualitative discussion on applications. Complex Integration Integration in the complex plane along a contour, the Cauchy-Goursat theorem, integral theorem Derivatives of analytic functions, Taylor and Laurent series(without proof's) singularities Zeros Poles, Residues, Cauchys Residue theorem Evaluation of integrals by the method of residues , Jordans lemma (without proof), Indented 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 Lagranges Linear Equations Linear PDE of Higher order with Constant Coefficients Homogeneous and non homogeneous equation Solution of PDEs by the method of separation of variables. Applications of Partial Differential Equations Solution of Laplaces equations in Cartesian, Cylindrical and Spherical coordinates variable separable method: Potential flow over a sphere. Wave Equation-Vibrations of a Stretched string-Variable Separable Method- D Alembert s solution for the initial value problem, Vibrations of a circular membrane Diffusion equation in Cartesian and Cylindrical coordinates. Integral Transforms Difference Equations and Z-transforms: Difference Equations with constant coefficients -Complementary function, particular integral method of undetermined co-efficient, variation of parameters technique (without proof), application to ladder type electrical network. Z-transform definition relation between Z transform and Laplace transform, Ztransform of elementary functions, properties of Z-transforms (proofs not required) Initial and final value theorems- Inverse Z-transforms partial fraction expansion method, Inversion contour method-solution of difference equations by Z- transform method. Exponential Fourier series Fourier Integral Transforms Definition Fourier Integral Fourier sine and cosine transforms; - Properties of Fourier transforms Convolution theorem for Fourier transforms Parsevals identity for Fourier transforms (proof not required) -Application of Integral Transforms to Partial differential equations: (i) Heat flow in an infinite bar (ii) Wave propagation on a semi infinite string (iii) Steady state heat flow in a semi-infinite domain.
Text Books: 1. Erwin Kreyzsizig, Advanced Engineering Mathematics, 8th Edition, John Wilag & Sons (Wiley student Edison) (2004). 2. B. S. Grewal, Higher Engineering Mathematics, 38th Edition, Khanna Publications (2005). Reference Books: 1. J. W. Brown and R.V. Churchill, Complex variables and application, Mc Graw Hill International ed., 7th Edition (2004). 2. R. V. Churchill and J. W. Brown, Fourier series and Boundary value problems, International student edition (1978) . 3. Ian Sneddon, Elements of Partial Differentail equations, MC Graw Hill International edition (1985). 4. MichaelD. Greenberg, Advanced Engineering Mathematics, 2nd Edition, PearsonEducation (2002). Mode of Evaluation: By Assignment, Seminars and Written Examinations
Aim This subject aims to impart knowledge about various types of data structures (standard and user defined) It covers algorithm analysis for the run time complexities 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 operations on them and also implement various sorting and searching techniques. Introduction Algorithm Analysis-Mathematical background model running time calculations complexity analysis abstract data types asymptotic notations. Stacks & Queues Stacks & Queues- Stack ADT stack model implementation of stacks applications of stacks infix, prefix and postfix expressions and their conversions, Queue ADT queue model array implementation of queues, List ADT simple array implementation of lists linked lists doubly & circular linked lists cursor implementation of linked lists polynomial addition and multiplication, Overview of Garbage collection & Compaction Trees 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. Sorting Insertion sort and its analysis, Shell sort, Heap sort and its analysis, merge sort and its analysis, quick sort and its analysis, bucket sort, selection sort, external sort. Algorithms Algorithm Design Techniques- Divide & Conquer Algorithm Strassens matrix multiplication and its analysis, Greedy Method- knapsack 01, Dynamic Programming- traveling salesman problem, Back Tracking- 8 queens problem, Branch and Bound- travelling salesperson problem algebraic manipulations, Lower Bound Theory- Basic concepts of NP-hard and NP-complete. TEXT BOOK: 1. Mark Allen Weiss, Data Structures & Algorithm Analysis in C++, Addison Wesley , 2004. REFERENCE BOOKS: 1. E. Horowitz, S. Sahni and S. Rajesekar, Computer Algorithms, Galgotia-1999. 2. 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
TEXT BOOKS 1. Deborah.G.Johnson, - Computer Ethics - Prentice Hall - 2nd Edition - 2002 2. Ernest A Kallman, John.P. Grillo - Ethical Decision making and Information Technology McGraw Hill - 2nd Edition - 1996. 3 Ronald B.Adler - Jeanne Marguardt Elmhorst - Communicating a work MCGraw Hill, 6th Edition - 1999. REFERENCE BOOKS 1. 2. 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.
Reference Bookls: 1. Robert W. Sebesta, Concepts of Programming Languages, 1st Indian Reprint, 1999, Addison Wesley 2. Doris Appleby & Julius J Vandekopple, Programming Languages Paradigm & Practice, Mc Graw Hill, 2nd Edition. 3. Ravi Sethi, Programming Languages, 2nd Edition, Addison Wesley, 1999 Mode of Evaluation: By Assignment, Seminars and Written Examinations
Instructions to the students Unless the problem explicitly states otherwise you can assume that the input data/output data will be in memory location and can be examined using a suitable debugging utility (DEBUG, CodeView, TURBO DEBUG etc., ) and that the program itself 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 during the examination. The interfaces to be used are: Stepper Motor, Logic Controller, Dual DAC, Display and Keypad. These interfaces are the standard interfaces used with 8085 trainers also. A brief description of these interfaces will be provided separately. 1.a) b) Develop and execute an Assembly Language program to find the LCM of two 16-bit unsigned integers 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). Develop and execute an Assembly Language program to find the GCD of two 16-bit unsigned integers 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 specified by the examiners) . 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 conducted.)
2.a) b)
3.a) Develop and execute an assembly language program to sort a given set of 16-bit unsigned integers into ascending order using insertion sort algorithm. b) Develop and execute an Assembly language program to generate a rectangular pulse train using the DAC interface. (The output of the DAC is to be displayed on a CRO. The on/off times can be any arbitrary values. No need to compute these values. ) 4.a) Develop and execute an assembly language program to sort a given set of 8-bit unsigned integers into ascending order using Bubble sort algorithm b) Develop and execute an assembly language program to generate a triangular 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 declarations 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.Create 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 files and execute the resulting file. b) Develop and execute an assembly language program to read the status of two inputs 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)
b)
Create an assembly language source file containing two PUBLIC procedures called RDKEY and ECHO. RDKEY reads from keyboard using INT 21H (Function 6) leaving 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 library file. Develop and execute an assembly language program which uses the RDKEY and ECHO procedures once. Develop and execute an assembly language program to read the status of eight inputs from the logic controller interface, to complement those values and to display these complemented values using the same interface.
7.a)
Develop and execute an assembly language program with the following features: It has a macro with one parameter called LOC. The macro reads the keyboard using INT21H (Function 6) and places the ASCII code of the key read in LOC. The macro defined above is used twice to read the keyboard twice and store the ASCII codes in two consecutive memory locations. b) Develop and execute an assembly language program to read the status of eight inputs from the logic controller interface, display FF if any input is high and display 00 otherwise. Using conditional assembly, develop and execute an Assembly language program 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 the32 bit result in a double-word memory location. (Assume overflow will not occur); Otherwise, it assembles code which computes 7*x+8 and places the 32-bit result in a double-word memory location.
8.a)
b) 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 search algorithm. Assume that the data consists of sorted 16-bit unsigned integers. The search key is also a 16-bit unsigned integer. b) 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 permit BCD to 7-segment code conversion. Develop and execute an assembly language program to drive the Elevator interface in the following way: Assume that initially the elevator is at ground floor and all service requests 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 that 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 simulate the elevator motion, the delay indicating the servicing of a request can be any arbitrary values. Examiner doesnt specify these values, nor is the student required to calculate them.
b)
11.a) Develop and execute an assembly language program to read a 4-digit hexadecimal number from the keyboard and store the corresponding 16-bit binary value in a word location. b) Develop and execute an assembly language program to display a 4 digit BCD number on the display interface. 12. a) Develop and execute an Assembly language program to compute the factorial of a positive integer n using recursive procedure. The 16-bit binary result can be left in a memory word location. (Use a value for n which will ensure that n! can be stored as a 16bit unsigned integer.) Develop and execute an assembly language program to scan a 4x4 keypad interface for key closure. The row number and column number of the key pressed are to be stored in memory locations. Develop and execute an assembly language program to compute nCr using recursive procedure. Assume n & r to be non-negative integers and leave the binary result in a memory word location. (Use values for n and r which will ensure that the can be stored as a 16-bit unsigned integer.). (b) Develop and execute an assembly language program to perform the following: Alternately, display two 4 digit messages on the display interface for suitable period of time. Ensure a flashing rate that makes it easy to read both the messages. (Examiner doesnt specify there delay values. Nor is it necessary for the student to compute these values).
b)
13.a)
14.a)
Develop and execute an assembly language program that determines if a given sub-string is present in a main string of characters. The result (1:present, 0:absent) can be left in a memory location b) Develop and execute an assembly language program to convert a 16 bit binary value (Assumed to be an unsigned integer) to BCD and to display it on the Display interface. (You can assume that the BCD equivalent will be less than or equal to 9999).
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), format it as HH:MM, and display it on the video screen (INT 21H, Function 2).
Aim To motivate the students to address the challenge of the relevance of Probability and Statistics Theory to Engineering problems. Objective To have an understanding of the Probability concepts, analyze the problems connected with statistics and reliability, to understand how to make the transition from a real problem to a probability model for that problem. Probability & Random Variables Axioms- Conditional Probability- Baye's Theorem- Independent Events-Random Variables-Distribution Function-Density Function (PDF)- Random Vector-Joint Distribution- Joint Density- Conditional Distribution and Density Functions- Independent Random Variables- Binomial, Poisson, Normal, Exponential, Gamma, Weilbull distributions. Statistical Parameters Mathematical Expectation- Variance- Moment Generating Function-Characteristic Function-Regression and Correlation- Partial and Multiple correlation. Tests of Statistical Hypothesis Large sample Tests - Procedure of Testing Hypothesis- small sample tests - Students 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 - x -chart- R-chart- Control Charts for Attributes- pchart- np-chart- c-chart Reliability Terms related to Reliability- Hazard Models- System Reliability - Reliability Allocation - Maintainability and Availability. Queuing Theory Preliminary Ideas (Markov Chains) - Exponential Distribution- Little's formula - Pure Birth and Death Models. Text Book: 1. R.E.Walpole, R.H.Myers, S.L.Myers and K.Ye, Probability and statistics for Engineers and Scientists, 7th Edition, Pearson Education (2003). Reference Books: 1. Bhat, B.R.. Modern Probability Theory, 3rd ed. New Age International Pvt. Ltd., New Delhi (1999). 2. Freund, JE , Mathematical Statistics, Prentice Hall International (1998). 3. Rohatgi, V.K. and Ebsanes Saleh, A.K. Md., An introduction to Probability and Statistics, 2nd Ed., John Wiley & Sons, Inc., New York (2002). 4. Morris H. DeGroot, Probability and Statistics, 3rd Edition, Addison-Wesley (2002). 5. J.L.Devore, Probability and Statistics, 5th Edition, Thomsun (2000) Mode of Evaluation: By Assignment, Seminars and Written Examinations
Aim The subject aims at imparting the knowledge of Computer architecture, the design of computers, including the instruction sets, hardware components, and system organization, Memory Management and Networking. Objectives At the end of the course students should be able to understand basic principles such as locality of reference, coarse-grain parallelism, overlapping 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. Introduction Nature of computing, Elements of Computers, Limitations of Computers; - the evolution of computersMechanical Era, Electronic Computers, The Later generation; the VLSI era- Integrated Circuits, Processor Architecture, System Architecture. Design Methodology- System design- System Representation, Design process, The Gate level; the Register level- Register - level components, programmable logic devices, and Register level design; the Processor Level- Processor Level Components, Processor level design. Processor Basisc Processor Basics- CPU organization: Fundamentals; Data Representation: Basic formats, Fixed Point Numbers, Floating point numbers; Instruction Sets: Instruction formats, Instruction Types, Programming Considerations. Arithmetic Data Path Design-Fixed point arithmetic-Addition and Subtraction, Multiplication, Division; Arithmetic Logic Units- Combinational ALUs, Sequential ALUs; Advanced Topics- Floating point Arithmetic, Pipeline Processing Memory Organization Memory Organization-Memory technology: Memory Device Characteristics, Random Access Memories, Serial Access Memories; memory systems: Multilevel memories, Address translations, Memory Allocation; Caches: Main features, address mapping, Structure versus performance. System Organization System Organization- Communication methods: Basic concepts, Bus control; IO And System Control: Programmed IO, DMA and Interrupts, IO processors, Operating Systems; Parallel Processing: Processor Level Parallelism, Multiprocessors, Fault Tolerance. TEXT BOOK: 1. John P. Hayes, Computer Architecture and Organization, 3rd Ed. McGraw Hill., 1998. REFERENCE BOOK: 1. John. L. Hennessy & David A. Patterson, Computer Architecture, 3rd Ed, 2003, Elsevier, India. Mode of Evaluation: By Assignment, Seminars and Written Examinations
Text Book 1. E. Balaguruswamy - Programming with JAVA A Primer - 2nd Edison - TMH - 2004 2nd edition. Reference Books: 1. Shishir Gundavaram - CGI Programming on the World Wide Web, O Reilly and Associates Shroff publishers - 2003. Mode of Evaluation: By Assignment, Seminars and Written Examinations
Relational Model The Relational data model Relational constraints Relational algebra Introduction to SQL Introduction PL/SQL Relational database standard ER to relational mapping E.F. Codd rules.
Normalization Functional dependencies Normalization for relational databases up to BCNF Query Optimization and Transaction Processing Query Processing Translating queries into relational algebra Using Heuristics in query optimization Introduction to Transactions Single user and multiuser system transactions Read and write operations DBMS buffers Transactions system concepts Serializability types. Concurrency, Recovery And Security 2PL Types of locks System lock tables deadlocks Timestamp ordering algorithm Recovery 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: 1. Ramez Elmasri & B.Navathe: Fundamentals of Database Systems, IV Ed., Addison Wesley, 2005. REFERENCE BOOKS: 1. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, III Edition, McGraw Hill. 2. Date C.J: Introduction to Database Systems, Sixth Edition, Addison-Wesley, 1995. Mode of Evaluation: By Assignment, Seminars and Written Examinations
Aim The subject aims to introduce of Formal Languages, Automata Theory and Abstract models of Computation and Computability, Computational complexities and NP Completeness. Objectives The students would be able to understand universal Model of Computation 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 determining whether a problem is solvable, efficiently solvable, and simply solvable or it cannot be solved. Introduction An overview of grammars and languages, Regular expressions and Regular languages Finite Automata and its minimization, Construction of NFA and DFA from Regular expressions, Conversion of NFA into DFA Normal Forms Chomsky hierarchy of language, Non determinism and kleenes theorem pumping lemma Decision problems. Normal Forms : Chomskys & Griebachs Normal Forms Automata Push down Automata and context free languages Context free grammars Derivation trees Ambiguity PDA& CFG Context Free and non-Context free languages. Turing Machine Turing machines Church Turing hypothesis Turing machine as language acceptors Partial function Non deterministic Turing Machine Universal Turing Machines Applications. Applications Unsolvable problems and computable functions Rice theorem Halting problem Posts correspondence Problem Primitive recursive functions Godel Numbering Recursive and recursively enumerable languages. TEXT BOOK: 1. John C. Martin, Introduction to Languages and the Theory of Computation, 3rd Edition, Tata McGraw Hill, 1997. REFERENCE BOOK: 1. K.L.P Mishra, N. Chandrasekaran, "Theory of Computation", Prentice Hall of India, 2nd Edition, 1998. Mode of Evaluation: By Assignment, Seminars and Written Examinations
14. Create an ASP application for sending E-Mails using CDO. 15. 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 16. Create a formatted business letter using XML & DTD. 17. Create a contact list database in XML using style sheets. 18. Develop a XML schema for the database document type. 19. Create a XML page for displaying staff details from the database 20. Connect to a database using XML & display its contents using HTML Page
4. Using Ex 3. 1. Drop unique constraint for item-name 2. Disable the constraint Nn-rate 3. Insert a record with NULL values for rate unit 4. 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. i) ii) Insert 6 records into Dept. Implement the following Join operations a) Self Join b) Equi Join c) Non Equi Join d) Outer Join e) Natural Join
10. Using EMP and DEPT, implement all type of view techniques. a) Row subset view b) Column subset view c) Row column subset view d) Grouped view e) Joined view f) With check option 11. Using EMP and DEPT a) Create a sequence to insert the empno in EMP table b) Create a synonym for the above two tables PART B 1. Create a cursor to update the salary of employees in EMP table 2. a) Write a PL/SQL program to raise an Exception i) When the bonus exceeds salary b) Write a PL/SQL program to test the built-in Exceptions 3. Write a procedure to insert a record into ORDER table by validating qty limit of the item and also check whether that item exists. 4. Write a function to find substring. 5. Create a trigger which checks whether employee with Emp_no is present in the Employee table before inserting into EMP.
Aim To address the challenge of the relevance of inference theory, Algebraic structures and graph theory to computer science and engineering problems. Objective To use inference theory in circuit models, and algebraic theory in computer science 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 Conjunctive Norm Forms. Inference Theory The Theory of Inference for the Statement Calculus -The Predicate Calculus - Inference 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 Compilation Groups - The Application of Residue Arithmetic to Computers - Group Codes. Lattices and Boolean Algebra Lattices as Partially Ordered Sets - Boolean Algebra - Boolean Functions Minimization of Boolean Functions. Representation and
Graph Theory Basic Concepts of Graph Theory - Matrix Representation of Graphs - Trees -Storage Representation and Manipulation of Graphs. Text Book: 1. J.P. Trembley and R. Manohar, Discrete Mathematical Structures with Applications to Computer Science, Tata McGraw Hill 13th reprint (2001). Reference Books: 1. Richard Johnsonbaugh, Discrete Mathematics, 5th Edition, Pearson Education (2001). 2. S. Lipschutz and M. Lipson, Discrete Mathematics, Tata McGraw Hill, 2nd Edition (2000). Mode of Evaluation: By Assignment, Seminars and Written Examinations
Aim This subject aims to introduce operating system concepts such as processes & threads, 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 & Threads, CPU scheduling algorithms, Semaphores and Critical regions, Deadlock prevention, Memory Management, I/O systems and File Systems .They would be able to use Linux system, windows 2000. Introduction Introduction, Computer-System Structures, Operating-System Structures Process Processes, Threads, CPU Scheduling, Process Synchronization, Deadlocks Memory Management Memory Management, Virtual Memory, File-System Interface, File-System Implementation, I/O Systems, Mass-Storage Structure Distributed File Structure Distributed System Structures, Distributed File Systems, Distributed Coordination, Protection, Security Case Studies The Linux System, Windows 2000. TEXT BOOK: 1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, "Operating System Concepts", John Wiley & Sons, Inc. 6th Edition REFERENCE BOOK: 1. Stallings William, "Operating Systems", Prentice Hall of India, Fourth Edition Mode of Evaluation: By Assignment, Seminars and Written Examinations
Aim The subject aims to introduce basics of Networks, client/server systems, Network design approaches, Architecture of Networks, and also future Networking technology. 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, different protocol standards, congestion & traffic control, different internetworking devices like bridges, switches, routers, etc, security protocols & security algorithms Network Services Networks and Services, Approaches to Network Design, The OSI Reference Model; Overview of TCP/IP Architecture, Application Protocols and TCP/IP Utilities Peer-to-Peer Protocols and Service Models ARQ Protocols, Sliding Window Flow Control, Multiple Access Communications, LAN and access methods, Introduction to LAN Standards and LAN Bridges, Ethernet networking. Packet Switching Packet Switching Networks- Network Services and Internal Network Operation, Packet Network Topology, Routing in Packet Networks, Shortest Path Algorithms, and Introduction to traffic management & QoS. TCP/IP TCP/IP Architecture, The Internet Protocol, Limitations of IPv4 and Introduction to IPv6, User Datagram Protocol, Transmission Control Protocol, DHCP, Introduction to Internet Routing Protocols Advanced Network Advanced Network Architectures and Security Protocols- Introduction to MPLS and Differentiated Services; RSVP; Security and Cryptographic Algorithms, Security Protocols, Cryptographic Algorithms TEXT BOOK: 1. A. Leon-Garcia, Indra Widjaja, "Communication Networks", Tata McGraw Hill, 2000 REFERENCE BOOKS: 1. William Stallings, " Data and Computer Communications", Pearson Education, 7th Edition 2. Andrew S. Tanenbaum, "Computer Networks", Prentice Hall India, 4th Edition, 2003 Mode of Evaluation: By Assignment, Seminars and Written Examinations
Write a program to display the servers date and time details at the client end. Write a program to display the clients 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 the message and returns it to the client. Encoding is done by replacing a character by the character next to it i.e. a as b, b as c z as a. This process is done using 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 the message and returns it to the client. Encoding is done by replacing a character by the character next to it i.e. a as b, b as c z as a. This process is done using UDP. Write a program for the above Write a program to display the name and address of the computer that we are currently working on. Write a program to capture each packet and to examine its checksum field. Write a program to create a daemon process.
1. Program to report the behavior of the OS to get the CPU type and model, kernal version. 2. Program to get the amount of memory configured into the computer, amount of memory currently available. 3. Implement the various process scheduling mechanisms such as FCFS, SJF, Priority, round robin. 4. Implement the solution for reader writers problem. 5. Implement the solution for dining philosophers problem. 6. Implement bankers algorithm. 7. Implement the first fit, best fit and worst fit file allocation strategy. 8. Write a program to create processes and threads. 9. Write a program that uses a wait able timer to stop itself K. Sec. After its started where K is a command line parameter.
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 various protocols and standards and the students can create new protocols for communication 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: 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 addresses, 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 protocols - FTP and TFTP, Mail and news protocols - SMTP, POP3, NNTP and IMAP, Other Protocols Suite ICMP and ARP Other networking protocols The IPX/SPX Protocol Suite, NetBEUI, AppleTalk Protocol, File sharing protocols - SMB, NCP, and NFS, Routing protocols - RIP, OSPF and BGP, Network Management Protocol SNMP and CIMP, Convergent Protocols H.323 and SIP. Text Book: 1. Behrouz A. Forouzan, TCP/IP Protocol Suite, Third Edition, Tata McGraw-Hill, 2005. Reference Book 1) W. Richard Stevens, TCP/IP Illustrated, The Protocols, Pearson Education, 2004. 2) D.E.Comer, Internetworking with TCP/IP Principles, Protocols and Architecture Vol - I, Pearson Education, 2001. 3) John Ray, Using TCP/IP, PHI, 4) Karanjit. S. Siyan, Tim Parker, TCP/IP Unleashed, Pearson Education. Mode of Evaluation: By Assignment, Seminars and Written Examinations
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, Compiler-based Analysis, 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
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 Configuration ManagementSoftware 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 Identification Configuration Control Status Accounting Configuration Verification and Audits. Software Configuration Management advanced concepts and standards Software Configuration Management: Advanced Concepts Software Configuration Management standards Software process improvement models and SCM Software Configuration Management organization & Document Management Software Configuration Management Plans Software Configuration Management organization Software Configuration Management tools - Documentation management and control and product data management Operation and Maintenance of Software Configuration Management Software Configuration Management Implementation Software Configuration Management operation and Maintenance- Software Configuration Management in special circumstances Text Book: 1. Alexis Leon, Software Configuration Management Handbook, 2nd Edition, John Weiley, 1992 Reference Books: 1. Software Configuration Management Strategies and IBM Rational ClearCase: A Practical Introduction, 2nd Edition
2. Managing Software Process, Watts S. Humphrey, Pearson Education , 2000 3. Managing Global Software Projects, Gopalswamy Ramesh, 2004, TMH Mode of Evaluation: By Assignment, Seminars and Written Examinations
Aim To create Software applications that can be accessed by all the people over the internet and to allow the users to customize the software based on their requirements. Objective On completion of this course the students will be able to create open source software applications and can publish it over the Internet. Introduction to PHP Open source Programming PHP, Apache, MySQL, Postgress, SQL and Perl- Overview of PHP Variables, operations, Constants, control structures arrays, Functions, classes Handling files. My SQL database programming Connecting table creation record insertion updation multiple database handling. E-mailing with PHP Sending an email multipart message storing images getting confirmation. Session tracking using PHP Graphics Input Validators cookies. Introduction to Perl / TCL / Python Numbers and Strings Control Statements Lists and Arrays Files Pattern matching Hashes Functions. Introduction to TCL/TK, Introduction to Python. Text Books: 1. Beginning PHP, Apache, MySQL web development Michael K.glass, Rommn le Scouarnec, et al.Wiley Publishing, Inc, New Delhi, 2004 2. Core PHP programming, Leon Atkinson and Zeev Suraski, Pearson Education, Delhi, 2004. Reference Books: 1. PHP Professional Projects, Ashish Wilfred Meeta Gupta and Karticj Bhatnagar PHI, 2002 2. Teach Fourself perl, Clinton pierce, Techmedia, New Delhi, 2000. 3. Tom Christiansen and Nathan Torkington, Perl CookBook, OReilly, 2003 Mode of Evaluation: By Assignment, Seminars and Written Examinations
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, Compiler-based Analysis, 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
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, Compiler-based Analysis, 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
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 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
Aim The subject aims to cover parallel & distributed computing architecture, networked clusters of computers, utilization and management of the expensive resources that are remote to the users. Objectives The students would be able to understand and use different network models, security mechanisms and design methodologies of Distributed systems Introduction Introduction to distributed computing system, evolution different models, gaining popularity, definition, issues in design, DCE, message passing introduction, desirable features of a good message passing system, issues in IPC, synchronization, buffering, multigram messages, encoding and decoding of message data, process addressing, failure handling, group communication. Remote Procedure Call RPC-Introduction, model, transparency, implementation mechanism, stub generation, RPC messages, marshalling arguments and results, server management, parameter - passing semantics, call semantics, communication protocols for RPCs, client server binding, exception handling, security, mini project using Java RMI Distributed Shared Memory Distributed shared memory- general architecture of DSM systems, design and implementation issues of DSM systems, granularity, structure of shared memory space, consistency model, replacement strategy, thrashing, advantages of DSM, clock synchronization DFS and security- Desirable features of good DFS, file models, 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 security service. Parallel and Distributing Computing Overview of Parallel and Distributed Computing, Operating Systems, Client-Server Model, Distributed Database Systems, Parallel Programming Languages and Algorithms. Distributed Network ArchitecturesManaging Distributed Systems. Design Considerations Tools Methods and tools for development, implementation & evaluation of distributed information systems, workflow, software processes, transaction management, and data modeling, infrastructure e.g. middle-ware to glue heterogeneous, autonomous, and partly mobile/distributed data systems, such as e.g. client/server, CORBA-, and Internet-technologies. Methods for building distributed applications. TEXT BOOK: 1. Pradeep K. Sinha, "Distributed Operating Systems: Concepts & Design", PHI, 2005. 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 Edition Mode of Evaluation: By Assignment, Seminars and Written Examinations
Aim The subject aims to cover knowledge discovery process and to design and populate 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 warehousing and data mining tools Data Warehouse and OLAP Technology for Data mining Introduction to Data Warehouse- A multidimensional Data Model Data Warehouse architecture Data preprocessing- Data cleaning Data integration and Transformation. Data Mining Introduction Introduction to Data Mining Data Mining Functionalities Classification of Data Mining systems, Major issues in Data mining. Data Mining primitives, languages & system architecture Data mining primitives: Task relevant data kind of knowledge to be mined Background knowledge interestingness measures presentation & visualization of discovered pattern - Data Mining Query language Designing Graphical User interfaces based on DMQL - Architecture of Data mining. Association Rule Mining Basic concepts market basket analysis - Mining single dimensional Boolean association rules from transactional databases. Classification & prediction: Whats classification - issues regarding classification and 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, Data Mining: Concepts and Techniques, Morgan Kaufmann, 2005. 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
Aim This subject aims to introduce the concepts of image processing such as Representation of Image, Image Transform, Image Restoration using various approaches, Image segmentation and Image recognition and interpretation Objectives The students would be able to understand and explain Fundamentals of Image processing, Image Transforms, Image restoration techniques, Image segmentation and Recognition & interpretation of Images. Digital Image representation Steps in image processing, Elements of Digital Image processing systems, Fundamentals: Elements of visual perception, sampling and quantization, basic relationship between pixels. Imaging Geometry some basic transforms, perspective transforms. Image Transform Fourier transform, Discrete Fourier transform, Fast Fourier transform, properties of 2 D Fourier transform, Image Enhancement Spatial domain methods, Frequency domain methods, Enhancement by point processing, spatial filtering, Enhancement in the Frequency domain. Image Restoration Degradation model, Algebraic approach to restoration, Inverse Filtering, Wiener Filter constraint least squares restoration, Restoration in the spatial domain, Image Compression- Redundancy, Compression models, Error free compression, Lossy compression, Image compression standards. Image Segmentation Detection of Detection of Discontinuity Edge linking and boundary detection, Thresholding Region oriented segmentation. Image representation Representation schemes, Boundary descriptors, Regional descriptors. Recognition and interpretation Elements of Image analysis, patterns and pattern classes, Decision and theoretic methods, structural methods, Interpretation. Text Book: 1. Rafel C. Gonzalez & Richard E. Woods, Digital Image Processing, Pearson Education, 2005 Reference book: 1. Anil K. Jain, Fundamentals of digital Image processing, PHI, 1989. Mode of Evaluation: By Assignment, Seminars and Written Examinations
Aim The subject aims to introduce multimedia computing & communications covering various building blocks such as hardware, software, operating systems and DBMS. Objectives At the end of the course students would be able to use multimedia computing hardware, software tools multimedia authoring and design process. Introduction Branch-overlapping Aspects of Multimedia, Content, Global Structure, Multimedia- Media and Data Streams, Medium, Main Properties of a Multimedia System, Traditional Data Stream Characteristics, Data Streams Characteristics for Continuous Media, Information Units. Sound /Audio Basic Sound Concepts, Music, Speech, Image and Graphics- Basic Concepts, Computer Image Processing, Introduction to Optical Storage Video and Animation Basic Concepts, Television, Computer-based Animation, Data Compression-Storage Space, Coding Requirements, Source, Entropy, and Hybrid Coding, Some Basic Compression Techniques-JPEG, H.261, MPEG, DVI Multimedia Operating Systems Introduction, Real-time, Resource Management, Process Management, File Systems, Additional Operating System Issues, System Architecture, Multimedia Communication Systems- Application Subsystem, Transport Subsystem, Quality of Service and Resource Management Multimedia Database Systems Data Analysis, Data Structure, Operations on Data, Integration in a Database Model, Introduction to Hypertext, Hypermedia, Document Architecture, SGML, ODA, MHEG, A Reference Model for Multimedia Synchronization, Multimedia Applications- Media Preparation. Media Composition, Media Integration, Media Communication, Media Consumption, Media Entertainment Text Book : 1. Ralf Steinmetz and Klara Mahrstedt, "Multimedia computing, communications and Applications", Pearson Education Asia, 1st reprint 2001. Reference Book: 1. K. Rao, "Multimedia Communication Systems: Techniques, Standards, and Networks", Prentice Hall, 2002 Mode of Evaluation: By Assignment, Seminars and Written Examinations
Aim To introduce the fundamental techniques of natural language processing, to develop an understanding of the limits of those techniques and of current research issues, and to evaluate some current and potential applications Objective Students should be able to discuss the current and likely future performance of several NLP applications, 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 disambiguation etc. Understand how these techniques draw on and relate to other areas of (theoretical) computer science, such as formal language theory, formal semantics of programming languages, or theorem proving Introduction Introduction to the Morphology, Syntax, Semantics by linking the linguistics view (computational linguistics) with the artificial intelligence view (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 and 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 relating those formalisms to recursive transition networks (RTNs) as well as augmented transition networks (ATNs). Semantics Language ambiguities on the level of meaning: represented by case structures and conceptual dependency structures. We will look at famous utterances such 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: 1. Daniel Jurafsky, James H. Martin Speech and Language Processing Prentice Hall, 2001 Reference Books: 1. Chris Manning and Hinrich Schtze, Foundations of Statistical Natural Language Processing, MIT Press. Cambridge, MA: May 1999. Mode of Evaluation: By Assignment, Seminars and Written Examinations
Aim This subject aims to cover statistical models in simulation, Inventory systems, and Random numbers & variables, Input and output analysis Objectives The students would be able to understand and use discrete event simulation, simulation techniques, and statistical methods. Introduction Simulation-Advantages and disadvantages of simulation, areas of application, Systems and system environment, Components of a system, Discrete and continuous systems, Model of a system. Types of models, Discrete events system simulation, Steps in a simulation study. Simulation Examples, Simulation of queuing systems, Simulation of inventory systems, other examples of simulation, discrete event simulation, general principles and computer simulation languages. Concepts in DES, Programming languages for DESS: FORTRAN, GASP, SIMSCRIPT, GPSS, SLAM, Summary and comparison of simulations. Statistical Models in Simulation Review of terminology & concepts, Useful statistical models, Discrete distributions, Continuous distributions, Process, Empirical distributions. Queuing Models: Characteristics of queuing systems, queuing notation, Transient & steady state behavior of queuing notation, Transient & steady state behavior of queues, long run measures of performance of queuing systems, steady state behavior of finite population models. Inventory Systems Measures of effectiveness, Inventory policies, Deterministic systems, and probabilistic systems, Simulation in inventory analysis. Random Number Generation: Properties of random numbers, Generation of Pseudo random. Nos., techniques for generating random nos., tests for random nos. Random Variable Generation: Inverse transform technique, Direct Transformation for the normal distribution, Convolution method, Acceptance-Rejection technique. Input Data Analysis Data collection, identifying the distribution, parameter estimation, goodness-of-fit tests. Verification and validation of simulation models: Model building, verification & validation, verification of simulation models, calibration & validation of models. Output Analysis Output Data 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-state simulations. Comparison and evaluation of alternative system designs: Comparison of two and several system designs, statistical models for estimating the effect of design alternatives. Text Book : 1. 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 Simulation, Freeman, 1991. Mode of Evaluation: By Assignment, Seminars and Written Examinations
Aim To provide an environment to understand the concept of GIS Objective To make the students to understand spatial data models, Arcinfo Concepts. Introduction Introduction and Overview of Geographic Information Systems:- Definition of a GIS, features and functions; why GIS is important; how GIS is applied; GIS as an Information System; GIS and cartography; contributing and allied disciplines; GIS data feeds; historical development of GIS. Maps Map Projections and Coordinate Systems:- Maps and their characteristics (selection, abstraction, scale, etc.); map projections; coordinate systems; precision and error. GIS Concepts and Spatial Data Models Automated cartography versus GIS; CAD Concepts; Data base; Remote Sensing, Concept of data model; raster data model; compression, indexing and hierarchical data structures; vector data model; topology; TIN data model. Arcinfo Concepts ARC/INFO Data Management; workspace; naming conventions; Map projections; Regions, Introduction to Arcinfo Modules. Data Sources Data Automation and Data Quality:- Major data feeds to GIS and their 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 Education, 2002 Mode of Evaluation: By Assignment, Seminars and written Examinations
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 requests for information but intelligently anticipate, adapt, and actively seek ways to support users. It covers various approaches to agent-to-agent communication and agent mobility, as well as the use of agents to provide intelligent interoperability between loosely coupled components of distributed systems. Objective The students would be able to describe and use software agents for enhance learning and providing intelligent assistance to users in situations where direct manipulation interfaces alone are insufficient. They would be able to select and use languages and tools for design and implementation of intelligent agents and multi-agent systems including mobile agents. They would also be able to comprehend the software agent applications in decision support systems, manufacturing system, information retrieval and knowledge discovery. Information Systems Internet - based Information systems - Adaptive (Customizable) Software Systems - Autonomous mobile and immobile robots - Data mining 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 Implementation of Intelligent Agents: Reactive - Deliberative - Planning - Knowledge - Based - Logical - Rational - Commutating - Adaptive Learning agents. Languages Languages and tools for design and implementation of intelligent agents and multi-agent systems, Introduction to mobile agents. Applications: Adaptive Information - Retrieval - Decision Support Knowledge Discovery - Computational Biology - Design and manufacturing - Smart Systems - Robots. Text Books: 1. Russell & Norvig, Artificial Intelligence:A Modern Approach, Prentice Hall, 1995. 2. Huhns and Singh(ed), Palo Alto, Readings in Agents, Morgan Kaufmann 1998. Reference Books 1) 2) 3) 4) 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 E-COMMERCE
L 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 Reengineering Electronic Commerce Electronic Commerce, electronic data interchange (EDI), value added networks, electronic commerce over internet, PC and networking, networking , communication media, computer communication system, ISO model, X.400 message handling system, internet E-mail, E-mail security, light weight directory access protocol, internet search, internet 2, Intranet Introduction, Services. Electronic data interchange (EDI) EDI introduction, cost and benefits, components of EDI system, implementation issues, UN/EDIFACT standard introduction, an EDIFACT message, interchange structure, message directories, EDI over internet, commerce over extranets, identification and tracking tools for electronic commerce. Technology and security issues Technology issues Bandwidth issues, technology issues for the internet, NII standard, NI1 services, NI1 agenda, G11, security issues security concerns, security solution, electronic cash over the internet, internet security, guidelines for cryptography policy. Reengineering Business process reengineering, approach for BPR, strategic alignment model, BPR methodology, change management, change management in public administration, implementation 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, SNS, E-commerce in India EDI in India, internet in India, laws for e commerce in India, UNCITRAL model law on electronic commerce, model interchange agreement for international commercial use of EDI. Text Book: 1. Kamlesh K. Bajaj - E-Commerce - Tata McGraw Hill 2000. Reference Books: 1) San Jose CA Electronic Publishing Guide Adobe Press 1998. 2) Jim Iterne World Wide Web Marketing John Wiley 1995. Mode of Evaluation: By Assignment, Seminars and Written Examinations T 0 P 0 C 3
T 0
P 0
C 3
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 various encryption algorithms. Objectives The students would be able to understand and use encryption algorithms such as RSA, Blow Fish etc; authentication techniques digital signatures and System-level security issues. Attacks, Service and Mechanism Attacks, Services & Mechanisms Security attacks Security services Network Security Model. Conventional Encryption: Classical Techniques: Conventional Encryption model - Stenography Classical Encryption Techniques- Modern Techniques: The Data Encryption Standard The Strength of DES Differential and Linear, Crypto-analysis. Public Key Cryptography Principles of public-key cryptosystems The RSA algorithm - Key management Diffie-Hellman key exchange Elliptic curve cryptography Message Authentication and Hash functions Authentication requirements Authentication functions Hash functions Security of hash functions and MACS. Hash Algorithm: MD5 Message Digest algorithm Secure Hash algorithm (SHA-1) HMAC. Digital Signatures and Authentication Protocols: Digital signatures Authentication protocols Digital signature standard. 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 architecture SSL record protocol Handshake protocols. Intruders and Viruses, Worms Intruders Intrusion techniques Password protection Access control Password selection strategies Intrusion detection- Different approaches of Intrusion detection - Audit records Viruses and related Threats Firewalls: Firewall design principles Firewall characteristics types of firewalls Firewall configurations. Text Book: 1. William Stallings Cryptography and Network security Principles and Practice", 2nd edition, Pearson Education, 2002. Reference Book: 1. Charlie Kaufman, Raja perlman, Mike speciner, Network Security 2nd edition, Prentice-Hall of India Pvt Ltd, 2002. Mode of Evaluation: By Assignment, Seminars and Written Examinations
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 practices of Mobile Communication, Satellite Communication, Medium Access Control techniques, Mobile Devices, Wireless Local Area Networks, HiperLAN and Bluetooth, Wireless ATM operations, mobile network layer and various wirelesses Application Protocol. Introduction Introduction-Wireless Transmission Frequencies for Radio transmission signals-Antennas Signal propagation multiplexing Modulation-Spread spectrum Cellular systems Communication Systems Communication Systems-Medium access control-Motivation for a specialized MAC SDMA-FDMATDMA-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 Cyclic Repetition of Data Digital Audio Broadcasting Digital Video Broadcasting. Wireless Communication Wireless Communication-Wireless LAN-Infrared vs Radio transmission Infrastructure and ad hoc networks IEEE802.11-HIPERLAN Bluetooth. Wireless ATM-Motivation for WATM Wireless ATM working group WATM Services-Reference Model-Functions-Radio Access Layer Handover Location Management Addressing Mobile quality of service Access point control protocol. Mobile Network Layers Mobile network layer-Mobile IP-Dynamic host configuration protocol-Ad hoc networks. Mobile transport layer-Traditional TCP292-Indirect TCP Snooping TCP,Mobile TCP-Fast Retransmit/Fast recoverytransmission/Timeout Freezing ,Selective Retransmission Transaction oriented TCPU File Systems Support for Mobility File Systems-Consistency World wide Web Hyper Text mark up language approaches that might help wireless access-System architecture Wireless Application Protocol Text Book: 1. 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
Aim To introduce the fundamental techniques of sensor Networks, to develop an understanding of the limits of those techniques and of current research issues, and to evaluate some current and potential applications. Objective At the end of the course students should Have a knowledge and understanding of wireless sensor networks and their principles. Have deeper knowledge and understanding of sensor models for automotives, etc., Be able to apply the available tools to perform various kinds of performance testing. Introduction to Sensors Communication Network, Ordinary Sensors Vs Networked Sensors, Use of Networked Sensors, Potential Problems with Networked Sensors, Canonical problems, Key definitions of sensor networks, Sensor network applications Network sensors & Infrastructure establishment Key assumptions, MAC:- SMAC, IEEE 802.15.4 standard- Zigbee; Graphic, Energy-aware routing, attribute- based routing; Infrastructure Establishment:- Topology control, clustering, Time synchronization , localization and localization services. Sensor tasking, Control and Data acquisition Task driven sensing, sensor nodes utilities, Information based sensor tasking, joint routing and information aggregation. Data Acquisition:- Sensor database challenges, Querying the physical environment, query interfaces, In-Network aggregation, data centric storage. Sensor network platforms & Tools Sensor Node hardware, Sensor network programming challenges, node level software platforms, node level simulators Network Technologies RS-232 , RS-485 , Seriplex , AS-i , Interbus- CAN bus, HART , Profibus , Foundation Fieldbus, WorldFIP, LonWorks Text Book Feng ZHAO, Leonidas GUIBAS Wireless Sensor Networks Elsevier Reference Books 1. Cauligi S. Raghavendra, Krishna Sivalingam, Wireless Sensor Networks Springer, 2005 2. Holger Karl, Andreas Willig, Protocols and Architectures for Wireless Sensor Networks, Wiley, 2005 Mode of evaluation: Written examination, Case Analysis, Assignments
Introduction Human and computers, the structure of the brain, learning in machines, the differences. Pattern recognition in perspective, pattern recognition a definition, feature vectors and feature space, discriminate functions, classification techniques, linear classifiers, statistical techniques, pattern recognition a summary. Basic Neuron The Basic Neuron- Introduction modeling the single neuron, learning in simple neurons, the perception; a vectorial perspective, the perception learning rule, proof, limitations of perceptions. The Multi-Layer Perception- Introduction altering the perception model, the new model the new learning rule, the multilayer perception algorithm, the XOP problem reverted, visualizing network behaviour, multilayer perceptions as classifiers, generalization, fault tolerance, learning difficulties radial basis functions, applications. Self Organizing Networks Kohenen Self-Organizing Networks- Introduction, the kohenen algorithm, weight training, neighborhoods, reducing the neighborhood, learning vector quantisation, the phonetic typewriter. Hopfield Networks Hopfield Network - Hopfield model, the energy landscape, the Boltzman machine, constraint satisfaction, Adaptive resonance theory, architecture and operation, ART algorithm, training the ART network, clarification conclusion, summary of ART. Associative Memory Associative Memory -Standard computer memory, implement associative memory, implementation in RAMs, FAMS & N-tupling, Willshaws associative net, the ADAM system, kanevas sparse distributed memory, bi-directional associative memories. Hardware and software implementations, optional computing optical computing and neural networks. Text Book: 1. Neural Computing: An Introduction, R. Beale & T. Jackson, Adam Hilger, 1990. Reference Book: 1. Peo Y.H. Adaptive pattern recognition and neural networks, Addison Wesley, 1989. Mode of Evaluation: By Assignment, Seminars and written Examinations