Professional Documents
Culture Documents
VIT
-------
VELLORE INSTITUTE OF TECHNOLOGY
DEEMED UNIVERSITY
VELLORE – 632 014
SYLLABUS
VIT
-------
VELLORE INSTITUTE OF TECHNOLOGY
DEEMED UNIVERSITY
VELLORE – 632 014
I – SEMESTER
Sl.No Sub code Subject Name L T P C
1 06MSE101 Technical English - I 4 0 0 3
2 06MSE103 Calculus and Analysis 4 0 0 3
3 06MSE105 Modern Physics* 4 0 0 3
4 06MSE107 Introduction to Computer Science* 4 0 0 3
5 06MSE109 Electronic Devices and Circuits* 4 0 0 3
6 06MSE111 Programming in C* 4 0 0 3
7 06MSE113L Electronic Devices and Circuit lab* 0 0 3 2
8 06MSE115L Programming in C lab* 0 0 3 2
Total 22
II – SEMESTER
1 06MSE102 Technical English - II 4 0 0 3
IV – SEMESTER
Sl.No Sub code Subject Name L T P C
1 06MSE202 Probability Statistics and Reliability 4 0 0 3
2 06MSE204 Computer Architecture and Organization* 4 0 0 3
3 06MSE206 System Programming* 4 0 0 3
4 06MSE208 Internet Programming* 4 0 0 3
5 06MSE210 Database Management Systems* 4 0 0 3
6 06MSE212 Theory of Computation* 4 0 0 3
7 06MSE214L Internet Programming Lab* 0 0 3 2
8 06MSE216L Database Management Systems Lab* 0 0 3 2
Total 22
V – SEMESTER
1 06MSE301 Discrete Mathematical Structure 4 0 0 3
2 06MSE303 Software Engineering* 4 0 0 3
3 06MSE305 Operating Systems* 4 0 0 3
4 06MSE307 Computer and Communication Networks* 4 0 0 3
5 06MSE309 Open Source Programming - I 4 0 0 3
6 06MSE311 Management in Engineering 4 0 0 3
7 Computer and Communication Networks 0 0 0 2
06MSE313L
Lab*
8 06MSE315L Operating Systems Lab* 0 0 3 2
Total 22
VI – SEMESTER
1 06MSE302 Graph Theory and its Applications 4 0 0 3
2 06MSE304 Networking Protocols and Standards 4 0 0 3
3 06MSE306 Software Architecture and Design 4 0 0 3
4 06MSE308 Requirements Engineering 4 0 0 3
5 06MSE310 Compiler Design* 4 0 0 3
6 06MSE312E Elective – I 4 0 0 3
7 06MSE314L CASE Tools Lab - I 0 0 0 2
8 06MSE316L Compiler Lab 0 0 3 2
Total 22
M.S. (Software Engineering) – Date of Revision 6th March 2006
VII – SEMESTER
Sl.No Sub code Subject Name L T P C
1 06MSE401 Project I 0 0 0 22
VIII – SEMESTER
Sl.No Sub code Subject Name L T P C
1 06MSE402 Operation Research 4 0 0 3
2 06MSE404 Software Testing 4 0 0 3
3 06MSE406 Software Configuration Management 4 0 0 3
4 06MSE408 Open Source Programming - II 4 0 0 3
5 06MSE410 Elective – II 4 0 0 3
6 06MSE412 Elective – III 4 0 0 3
7 06MSE414L Software Testing Lab 0 0 3 2
8 06MSE416L Open Source Programming - II 3 2
Total 22
IX – SEMESTER
Sl.No Sub code Subject Name L T P C
List of Electives
VI Semester VIII Semester IX Semester
Data Warehousing and Data Distributed Computing Multimedia Computing
Mining
Natural Language Processing Web Services Intelligent Systems
E- Commerce Image Processing Sensor Networks
Network Security Digital Signal Processing Geographic Information System
Computer Simulation and Software Reengineering
Modeling
Mobile Communication Software Agents
Embedded Systems Decision Support system
Neural Networks Enterprise Resource Planning
M.S. (Software Engineering) – Date of Revision 6th March 2006
Writing Skills
Paragraph writing – Inductive, deductive, expository techniques, Note making – Letter writing (formal &
informal) – Descriptive writing, Essay writing.
Communication Grammar
Sentence patterns, Noun group, articles – verbal group – adverbial group – vocabulary –Stem, Prefixes
and Suffixes – modals and verbs –Tenses.
Text Book:
1. Effective English for Technical Communication, by Dr.T.M.Farhathullah – First 6 Lessons First 6
Lessons 2002 Publisher orient Longman
Reference Books:
1. Wings of Fire (Extensive Reader) II Lessons & I 2003 university press.
2. English Practice Book for Engineering Students, by Dr. T.M.Farhathullah 2000 Emerald publisher.
L T P C
4 0 0 3
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.
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 – Green’s, Stoke’s, &
Gauss divergence theorems (without proof) – related problems.
Infinite Series
Convergence & Divergence of series, Comparison test – D’ Alembert’s Ratio test – Raabe’s test –
Logarithmic test – Cauchy’s root test – Cauchy’s integral test – alternating series – Leibnitz’z 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).
M.S. (Software Engineering) – Date of Revision 6th March 2006
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).
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 – Einstein’s 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.
Nuclear Physics
Nuclear forces – Einstein’s 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)
L T P C
4 0 0 3
Aim
To establish knowledge in basics of computer science
Objectives
Exposure to fundamentals of computer science and Information technology.
Modern Storage
Storage Media – Increasing Data Storage Capacity – Backing up your Data – The Smart Card
Text Book:
1. Information Technology – The Breaking Wave, D.p.Curtin, K.Foley, K.Sen– TMH – 2002
Reference Books:
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.
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.
06MSE111- PROGRAMMING IN C
L T P C
4 0 0 3
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.
Functions
Functions - defining, accessing function - function prototypes - passing arguments - recursions -
storage classes multi file programs.
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. Study of CRO and measurement of amplitude frequency time period and phase angle.
2. Forward and reverse characteristics of PN junction diode.
3. Characteristics of Zener diode and study of its power ratings.
4. Input and output characteristics of BJT (CE CB CC) and graphical determination of h-
parameters.
5. Drain and transfer characteristics of JFET and graphical determination of transconductance.
6. Static emitter characteristics of UJT and PUT.
7. V-I characteristics of SCR and TRIAC.
8. Switching characteristics of BJT SCR and MOSFET.
9. V-I characteristics of tunnel diode and varactor diode.
10. Study of Logic Gates (AND OR NAND NOT EXOR gates).
11. Study of Flip flops (D T JK SR flip-flops).
12. Design and testing of Half and Full adders.
13. Design and testing of Half and Full sub tractor.
14. Implementation and testing of 3 bit binary ripple counter.
15. Implementation and. testing of code converters.
16. Implementation and testing of Multiplexers.
17. Implementation of shift registers using flip-flops.
18. Study of decade counter using flip-flops.
M.S. (Software Engineering) – Date of Revision 6th March 2006
LIST OF EXPERIMENTS
1. Determining a given number is prime or not.
2. Pascal’s Triangle.
3. String Manipulation.
4. Matrix Multiplications.
9. Generating Permutations.
11. Creating database for telephone numbers and related operations Use file concepts.
12. Creating database for Mailing addresses and related operations Using Structures.
13. Creating database for Web page addresses and related operations using pointers.
Objective
To expertise in Technical report generation.
Reading Skills
Global and local perception – interpreting charts and tables – use of reference material – evaluating texts –
understanding discourse features and writer’s opinion.
Writing Skills
Business letters – Technical report - Laboratory report advanced essay writing – flow charts, tables,
graphics –Description of instruments and machines.
Communication Grammar
Tenses revisited – sequence of tenses-comparison of adjectives and adverbs – passivity – use of
imperatives – conditionals –concord - Preposition + relative.
Text Book:
1. Dr. T.M. Farhathullah - Effective English for Technical Communication - Emerald Publisher - 2001
Reference Books:
1. A.P.J Abdul Kalam - Wings of Fire (Extensive Reader) I & II Lessons - University Press.
2. Dr.T.M. Farhathullah - English Practice Book for Engineering Students - Emerald Publisher,
2000.
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.
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.
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
M.S. (Software Engineering) – Date of Revision 6th March 2006
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
Conducting Materials
Conducting Materials Free electron gas – Drude Lorentz theory – electrical conductivity – relaxation time
– drift velocity – thermal conductivity – Wiedmann Franz law – Matthiessen’s 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.
L T P C
4 0 0 3
Aim
The subject aims to impart the knowledge about digital logic fundamentals, design steps involved in flip-
flop, 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 r’s and r-l’s complements sign. Floating point representation of Codes-
Binary 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 don’t 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
M.S. (Software Engineering) – Date of Revision 6th March 2006
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.
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.
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.
M.S. (Software Engineering) – Date of Revision 6th March 2006
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.
L T P C
4 0 0 3
1. Design a Half adder and a Full adder using NAND gates only. Cascade them to implement a 2 bit
binary adder.
2. Design and implement Excess-3 to BCD code converter using logic gates. (Choice of Logic gates
left to the student)
4. 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
5. Design and implement a full adder using a multiplexer. Also implement a multiplexer
tree using 3 multiplexes.
7. Design and implement a 3 variable Boolean SOP expression using 2 numbers of 4:1 multiplexer IC.
8. 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.
9. 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.
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.
L T P C
0 0 3 2
LIST OF EXPERIMENTS
L T P C
4 0 0 3
Aim
To understand complex variables and partial differential equation
Objective
After completion the students will have a thorough knowledge in complex variables and partial differential
equation.
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, Cauchy’s Residue theorem – Evaluation of integrals by the method of residues , Jordan’s lemma
(without proof), Indented contour integral, Inversion contours for Laplace, Fourier and Z transforms.
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, Z-
transform 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
– Parseval’s 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.
M.S. (Software Engineering) – Date of Revision 6th March 2006
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).
Objective:
To understand the Architecture and working principles of various Microprocessors (8086 / 8088)
To learn the interfacing of peripheral devices.
To Code in assembly language
Introduction
Introduction to Microprocessor, Microprocessor-Based Computer Systems, Architecture Of 8086/8-88,
Programmer’s Model Of 8086/8088, Segmentation And Memory Addressing In 8086/8088.
Memory interfacing
Memory devices, address decoding, 8/16 bit memory interfacing, DRAM memory system
Text Book:
1. Barry B.Brey, The Intel Microprocessors, Fourth Edition, Prentice-Hall India, 1997.
2. K.UdayaKumar and B.S.Umashankar., Advanced Microprocessors And IBM – PC
Assembly Language Programming, Tata McGraw Hill, 1996.
Reference Book:
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.
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 – Strassen’s 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.
Objectives
To emphasis the students to adhere the ethics, issues related to ethics
Computer Ethics
Introduction: What is computer ethics? Philosophical Ethics; Professional Ethics; The Social Implication
of Computers: Autonomy and Access. Ethics and Ethical Decision Making – Why we should care about
Ethics, Computer Ethics and Regular Ethics, Competing Factors that affect our behavior, Value
judgements, The types of ethical choices, Making defensible decisions. Ethics and Information
Technology – New Technologies, New Problems, Why is Ethical Computer Use a Special Challenge?
What is Unethical computer use?
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
Objective
To make the students to understand the concepts of various programming languages including syntax and
semantics.
Preliminaries
Programming Domains, Language evaluation criteria – design – categories – trade- offs, implementation
methods, Programming environments, Evolution of the Major Programming Languages: Zuse’s plankalkul
– Pseudocodes –FORTRAN – LISP –COBOL – BASIC – PL/I – APL and SNOBOL – SIMULA 67 –
ALGOL 68 – Prolog – Ada – Small talk – C++ - JAVA
Exception Handling
Exception handling in PL / I – Ada – C++ - Java. Functional Programming Languages:
Mathematical functions – fundamentals – LISP – introduction to schema – COMMON LISP – ML –
Haskell – applications of functional languages – comparison with imperative languages. Logic
programming Languages: Predicate calculus – predicate calculus and proving theorem – overview of
logical programming – PROLOG – overview – basic elements – deficiencies. Applications of
programming languages.
Text Books:
1. Allen B. Tucker, Robernooan, Programming Langages Principles and Pradigms, 2002, TMH
M.S. (Software Engineering) – Date of Revision 6th March 2006
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
Objectives
The Students shall be able to understand role and impact of MIS, various steps in management,
Organization structure and theory, Development of Business Strategies, Decision making concepts,
methods of data collection, applications of MIS in Manufacturing, basic features Enterprise Management
Systems and Role of MIS in Data Warehouse, Artificial Intelligence and Expert systems.
Introduction
Role & impact of MIS, Approaches to Management - Management as Control System - Management by
Exception - Process of Management - Management Effectiveness - Planning- Organizing - Staffing -
Coordinating and Directing - Controlling - MIS: A Tool for Management Process. Organization Structure
and Theory - Basic Model of Organization Structure - Modifications to the Basic Model of Organization
Structure - Organizational Behaviour - Organization as a System - MIS: Organization. Strategic
Management of Business Corporate Planning Concepts - Strategic Planning - Development of Business
Strategies - Types of Strategies, Tools of Planning
Decision Making
Decision Making - Methods, Tools & Procedures - Organizational Decision Making - MIS & Decision
Making Concepts - Information as a Quality Product - Classification of Information - Methods of Data
Collection - Value of Information - System Concepts - Systems Control - Types of System - Post
Implementation Problems, MIS Development- Determining Information Requirement - MIS
Development & Implementation
Application
IT Strategic Decision - Design - Evaluation - Implementation Plan - Choice of IT and MIS, Applications
of MIS in Manufacturing- Applications in Service Sector, Decision Support Systems, Deterministic
Systems - Artificial Intelligence, Knowledge Based Expert System, MIS and the Role of DSS
Data Warehouse
Data Warehouse: Architecture to Implementation - Electronic Business Technology - Models of E-
Business - Intranet/Extranet - Internet - World Wide Web - Electronic Payment Systems - Security in E-
Business - MIS and E-Business. Web: A Tool for Business Management - Internet and Web and Process
of Management - Strategic Management under Web - Web Enabled Business Management - Application
System Architecture in Web - MIS in Web Environment
TEXT BOOK:
1. W.S. Jawadekar, "Management Information System", Tata McGraw Hill, 2nd Ed., 2002
REFERENCE BOOK:
1. James A.O’Brien, “Management Information Systems”, Tata McGraw Hill, 2004
Mode of Evaluation: By Assignment, Seminars and Written Examinations
M.S. (Software Engineering) – Date of Revision 6th March 2006
1.a) Develop and execute an Assembly Language program to find the LCM of two 16-bit unsigned
integers
b) Develop and execute an Assembly Language program to drive a Stepper motor interface to rotate
the motor in clockwise direction by N steps. (N specified by the examiner). Introduce suitable delay
between successive steps. (The delay is not to be specified by the examiner. The student need not
compute the delay. It can be any arbitrary value that just permits the steps of the motor rotation to
be counted).
2.a) Develop and execute an Assembly Language program to find the GCD of two 16-bit unsigned
integers
b) Develop and execute an Assembly Language Program to drive a Stepper motor interface to rotate
the motor in anticlockwise direction by N steps. (N is 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.)
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.)
M.S. (Software Engineering) – Date of Revision 6th March 2006
6.a) 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.
b) 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.
8.a) 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.
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.
b) 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 doesn’t specify these values, nor is the
student required to calculate them.
M.S. (Software Engineering) – Date of Revision 6th March 2006
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 16-
bit unsigned integer.)
b) 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.
13.a) 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 doesn’t specify there delay values.
Nor is it necessary for the student to compute these values).
14.a) Develop and execute an assembly language program that determines if a 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).
M.S. (Software Engineering) – Date of Revision 6th March 2006
LST OF EXPERIMENTS
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.
Statistical Parameters
Mathematical Expectation- Variance- Moment Generating Function-Characteristic Function-Regression
and Correlation- Partial and Multiple correlation.
Anova
One way and Two way classifications- CRD-RBD-LSD.
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)
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 computers-
Mechanical 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.
Objectives
The student shall be understand the different steps involved in pass I and pass II of Assembler, the
structure of compiler and the functions performed in different phases of compiler
Assembler
Assemblers – elements of assembly language programming – simple assembly scheme – pass structure of
assemblers. Design of a two-pass assembler. Relocation and linking concepts. Design of a linker, self-
relocating program, linker for MS – DOS, linking for overlays, loaders.
Compiler
Structure of compilers, lexical analysis, syntax analysis, immediate code generation, optimization code
generation, book keeping, and error handling – compiler writing tools programming languages.
Lexical Analyzer
Role of lexical analyzer – design of lexical analyzer, regular expression, finite automation regular
expression to finite automata, minimizing DFA, implementation to lexical analyzer context free grammar,
derivations & parse trees capabilities of context free grammar
Parser
Parsers, shift-reduce parsing, operator precedence parsing, top down parsing, syntax directed translation
scheme, implementation of syntax-directed translators, intermediate code, postfix notation, parse trees and
syntax trees, three address code, quadruples, triples, translation of assignment statement, Boolean
expression, errors, lexical phase errors, semantic-phase errors, semantic errors.
Code Optimization
Principles, sources of optimization, loop optimization, DAG representation of basic blocks, value
numbers and algebraic laws, global data flow analysis, dominators, reducible flow graphs, depth-first
search, loop-invariant computations, induction variable elimination, other loop optimization.
TEXT BOOK:
1.D. M. Dhamdhere, “System Programming”, Tata McGraw Hill, 2nd Edition, 2000.
REFERENCE BOOK:
1. A. V. Aho, J.D. Ullman, “Principles of Compiler Design”, Narosa Publishing, 1996.
Objective
To know the internet concepts and to design web pages using java
Hypermedia Documents
Creating dynamic pages, CGI Examples with postscript. The gd graphics library. CGI Examples with
gnuplot and pgperl. Animation. Advanced form applications- Gouestbook, Survey/poll and pie graphs,
quiz/test form application, Security.
Introduction To Java
Overview of JAVA Language, Constants, Variables, and Data Types. Operators and Expressions:
Decision Making and Branching.
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.
Objectives
The students shall be able to understand fundamental concepts of database management system, database
modeling and design, SQL, PL/SQL, system implementation techniques. Analyze and design ER model
for a customized application and concurrency techniques and active databases.
Introduction ER Modeling
Basic concepts – Databases and database users – Database system concepts and architecture – data
modeling using Entity Relationship model.
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
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
M.S. (Software Engineering) – Date of Revision 6th March 2006
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 : Chomsky’s & Griebach’s 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 – Post’s
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.
2. Design a E-greetings page which has properly aligned paragraphs with images along with it.
5. Using JavaScript create a web page for Online Testing (Quantitative Aptitude)
6. Develop a JavaScript program to get Register Number as Input and print the Student’s total mark
and grades.
10. Write a function that takes an integer value and returns the number with its digits reversed. For
Ex. Given the number 7631, the function should return 1367. Incorporate the function into a
VBScript that reads a value from the user. Display the result in the status bar of the browser
window.
11. Create a server-side include file containing the AdRotator code to display 4
advertisements.
12. Create an ASP application that allows the user to customize a web page. The
application should consist of three ASP files:
Ask the user name to login & read from a database to determine if the user is known. If the user
is not known, second ASP file is loaded asking the user to choose their preference for foreground
color, background color & image. Insert the new user & pREFERENCE to the database. Display
the page customized according to the pREFERENCE selected. If the user is known at login, the
customized page should be displayed.
13. Create an ASP application to display the students information from the Database
Note: Only 5 student’s information per page should be displayed. Use Previous &
Next to retrieve the rest of the information.
M.S. (Software Engineering) – Date of Revision 6th March 2006
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
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
M.S. (Software Engineering) – Date of Revision 6th March 2006
ORDER
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.
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
PART – B
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.
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).
Objectives
The students’ would be able to analyse software requirements, develop an efficient software system
through group cohesiveness, use the testing tools and methods.
Fndamentals
Software Engineering Fundamentals, The system engineering process, Software process models, Process
iteration, Software Specification, Software design and implementation, Software validation, Software
evolution, Project management activities- Project planning, Project scheduling, Risk management,
Software requirements- Functional and non-functional requirements, User requirements, System
requirements, software requirements document.
Engineering Process
Requirements engineering processes - Feasibility studies, Requirements elicitation and analysis,
Requirements validation, Requirements management, System Models- Context, Behavioural, Data and,
Object models, CASE workbenches, Software prototyping- Prototyping in the software process, Rapid
prototyping techniques, User interface prototyping, Formal Specification- Formal specification in the
software process, Interface specification, Behavioural specification
Architectural
Architectural design- System structuring, Control models, Modular decomposition, Domain-specific
architectures, Over view of design for Distributed systems, Object-oriented and Real-time software,
Design with Reuse- Component-based development, Application families, Design patterns, User interface
design - User interface design principles, User interaction, Information presentation, User support,
Interface evaluation.
Critical System
Critical Systems- Over view of Dependability, System Specification, and System Development,
Verification and validation- V&V planning, Software inspections, Automated static analysis, Clean room
software development, Software testing- Defect testing, Integration testing, Object-oriented testing,
Critical systems validation- Formal methods and critical systems, Reliability validation, Safety assurance,
Security assessment.
Managing Software
Over view of managing software people, Software cost estimation- Productivity, Estimation techniques,
Algorithmic cost modeling, Project duration and staffing, Overview of Quality management & Process
Improvement, overview of Legacy Systems, Software change & re-engineering, Configuration
management- planning and managing change, version and release, Over view of SEI-CMM, ISO 9000, and
Six Sigma, Over view of CASE tools.
TEXT BOOK:
1. Ian Sommerville, "Software Engineering", Addison-Wesley, 2004
REFERENCE BOOK:
1. Roger S. Pressman, "Software Engineering", McGraw Hill, 2004.
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
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
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
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
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 LINUX
The operating System; Compiling the Kernel; Introduction to the Kernel: Important data structures, Main
algorithms, Implementing System Calls. LINUX Architecture-independent memory model, Virtual address
space for a process, Block device caching, Pages under LINUX.
Creating dynamic pages, CGI Examples with postscript. The gd graphics library. CGI Examples with
gnuplot and pgperl. Animation. Advanced form applications- Guestbook, Survey/poll and pie graphs,
quiz/test form application, Security.
JavaScript - VB Script
Introduction to JavaScript, VB Script - usage in Web Page develpment, sending an email - multipart
message - storing images - getting confirmation - Session tracking - Graphics Input Validators - cookies.
TEXT BOOKS
RFERENCE BOOKS
1. Shishir Gundavaram - CGI Programming on the World Wide Web, O' Reilly and Associates - Shroff
ublishers - 1996. (Chapters 1 to 7)
2. Core PHP programming, Leon Atkinson and Zeev Suraski, Pearson
Education, Delhi, 2004
Objective
After completion of this course, the students will be able to
2. Differentiate Management and Engineering
3. Understand the functions of technology of management
4. Understand planning and forecasting
5. Understand research functions
Managing Technology
Managing Research Function: Nature of Research and Development Research strategy and organization –
Selecting R & D projects – Making R&D Organization successful.
Managing Projects
Project Planning and Acquistion Characteristics of a project – Project proposal process – Project
Planning Tools – Project organization – Motivating Project Performance.
Reference Book
1. Managing Engineering and Technology – Daniel L. Babcock, Lucy C.Morse, Pearson
Education, Third Edition –2005.
1. Write a program to display the server’s date and time details at the client end.
2. Write a program to display the client’s address at the server end.
3. Write a program to implement an echo UDP server.
4. Write a program to develop a simple Chat application.
5. 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
6. 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
7. Write a program to display the name and address of the computer that we are currently working on.
8. Write a program to capture each packet and to examine its checksum field.
9. Write a program to create a daemon process.
M.S. (Software Engineering) – Date of Revision 6th March 2006
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 it’s started where K is a
command line parameter.
M.S. (Software Engineering) – Date of Revision 6th March 2006
Objective
To know the basic concepts and notations in graphs.
To give the combinatorial and matrix representation of graphs
To explain the computer representation of graphs and its application to computer science.
Introduction
Definitions, importance, isomorphism, walk, paths, circuits, connected, disconnected graphs, operation on
graphs operation on graphs, euler and hamiltonian graphs.
Trees
Properties, distance and centres, trees, spanning trees, fundamental circuits, minimal spanning tree.
Cut Sets
Properties, fundamental circuits and cut sets, connectivity, separatability, network flows, 1-2 isomorphism.
Directed Graphs
Different types, directed paths and connectedness, euler digraphs, trees-matrix representation,
tournament.
Text Book:
1. Narasing Deo, Graph theory with application to engineering and computer science, Prentice Hall
India, 1995.
Reference Book
1. Tulasiraman And M.N.S. Swamy, Graph, Networks and Algorithms, John Wiley,
2. 1981.
3. F. Harary, Graph Theory, Addison Wesley / Narosa, 1998.
4. E.M.Reingold, J. Nievergelt, N. Deo, Combinatorial algorithms: Theory and
5. Practice, Prentice Hall, N.J. 1977.
Mode of Evaluation: By Assignment, Seminars and Written Examinations
M.S. (Software Engineering) – Date of Revision 6th March 2006
1. Behrouz A. Forouzan, TCP/IP Protocol Suite, Third Edition, Tata McGraw-Hill, 2005.
Reference Book
Aim
To understand the fundamental concepts of software design and architecture
Objective
To learn the importance of software design and architecture
Design Fundamentals
The nature of Design process-Objectives-Building Modules, Constructs, Design qualities, assessing the
design, Design viewpoints for software. Design practices-Rational for method. Design strategies-Top
down and bottom up, Organizational methods and design.
Software Architecture
Introduction - Software Architecture - Definition - Prospects - State of Art - Architectural Styles - Pipes
and Filters - Layered Systems - Repositories - Process Control - Other familiar Architecture -
Heterogeneous Architectures.
Architecture Design
Architectural design and Mapping – Description of various Architectural design patterns - Object
Oriented Organization. Architecture Structures for Shared Information Systems. Architecture design
guidance - User Interface Architecture.
Miscellaneous Topics
Tools for Architectural design - Exploiting style in architectural design – Architectural Interconnection -
Case Studies.
Text Book:
1. David Budgen, " Software Design ", Addison-Wesley, Pearson Education 2004 2nd edition.
Reference Books:
1) Pressman R.S, " Software Engineering ", 6th Edition, McGraw Hill Inc., 2005 6th edition.
2) Mary Shaw David Garlan, " Software Architectural Perspectives on an emerging discipline ",EEE,
PHI 1996.
3) Gamma & Helm et al, “Design Patterns”, Addison Wesley Pearson Education of 1995.
4) Frank Bushmann et al, “ Pattern Oriented S/W Architecture”, John Wiley & sons -1996
Aim
To understand the concept of Requirement Engineering
Objective
To emphasis the students to have a thorough knowledge in analyzing the problem and defining the
systems.
Introduction
The Requirements Problem – introduction to requirements management – Requirements and software
development life cycle.
Text Books:
1. Managing Software Requirements , second Edition by Dean Leffingwell , Don Widrig, Pearson
Education
2. Unified Modeling Language by OMG
Reference Books:
1. Practical Objected Oriented Design with UML, Mark Priestley, 2005, TMH
2. Introduction to Object Oriented Analysis and Design, Stephen R Schach, 2004, TMH
M.S. (Software Engineering) – Date of Revision 6th March 2006
Objective
To understand the different phases in compiler construction
Syntax Analysis
The role of the parser, Context-free grammar, Writing a grammar, Top-down parsing, Bottom-up parsing,
Operator-precedence parsing, LR parsers, Parser generators.
Syntax-Directed Translation
Syntax-directed definitions, Construction of syntax trees, bottom-up evaluation of S-attributed definitions,
L-attributed definitions, Top-down translations, Bottom-up evaluation of inherited attributes.
Run-time Environments
Source language issues, Storage organization, Storage-allocation strategies, Access to nonlocal names,
parameter passing, symbol tables, Language facilities for dynamic storage allocation, Dynamic storage
allocation techniques. Storage allocation in Fortran etc.,
Code Generation
Issues in the design of a code generator, The target machine, Run-time storage management, Basic blocks
and flow graphs, Next-use information, A simple code generator, Register allocation and assignment, The
dag representation of basic blocks.
Code Optimization
Introduction, the principle source of optimization, Optimization of basic blocks, Loops in flow graphs.
Text Book:
1. Alfred V Aho, Ravi Seti, Jeffrey D Ullman - Compilers-Principles, Techniques and Tools –
Addison-Wesley – Pearson Education as 2004,
Reference Books:
1. Herk Albas, Albert Nymeyer, - Practice and principles of Compiler Building with C - PHI - 1996
2. Andrew W. Appel - Modern Compiler Implementation in Java - Cambridge University Press
2003.
• 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
• The above facts has to be documented and a report has to be submitted at the end of the
semester
M.S. (Software Engineering) – Date of Revision 6th March 2006
Mini Projects will be assigned for the students under the following topics.
1. Lexical Analysis
2. Syntax Analysis
3. Code Generation
4. Code Optimization
M.S. (Software Engineering) – Date of Revision 6th March 2006
Objective
• To introduce the concepts and techniques in decision theory.
• To use the concepts in network analysis and inventory theory
Decision Theory
Decision Environments - Decision making under certainty - Decision making under risk - Decision
making under uncertainty. Markovian Decision Process
Scope of the Markovian Decision Problem - Gardner example - Finite stage Dynamic Programming
model - Infinite stage model - Linear Programming solution.
Network Analysis
Network Definitions - Minimal spanning tree algorithm - Shortest route Problem - Maximum flow Model
- Minimum cost capacitated flow problem - Linear Programming formulation - Network Simplex method
– CPM and PERT.
Inventory Theory
Basic Elements of an Inventory model - Deterministic models of the following types: Single item static
model with and without price breaks - Multiple item static models with storage limitation. Probabilistic
Models: Continuous Review model - Single period models.
Queuing Theory
Basic elements of a queuing model - Role of Poisson and Exponential distributions - Pure Birth and
Death models – Specialized Poisson Queues – M/G/1 queue - Pollaczek - Khintchine formula.
Text Book:
1. Hamdy A. Taha , Operations Research ,Prentice - Hall of India Private Limited,
New Delhi (2002).
Reference Books:
1. F.S. Hiller and J.Lieberman -,Introduction to Operations Research ,7th Edition,
Tata McGraw Hill Publishing Company, New Delhi, 2001.
2. Beightler. C, D.Phillips, B. Wilde ,Foundations of Optimization ,2nd Edition,
Prentice Hall Pvt Ltd., New York, 1979
3. Bazaraa, M.S; J.J.Jarvis, H.D.Sharall ,Linear Programming and Network flow,
John Wiley and sons, New York 1990.
5. Gross, D and C.M.Harris, Fundamentals of Queuing Theory, 3rd Edition, Wiley
and Sons, New York, 1998.
Objective
To apply the various software testing methodologies for software development.
Testing Strategies
White box testing techniques - Statement coverage - Branch Coverage – Condition coverage -
Decision/Condition coverage - Multiple condition coverage - Dataflow coverage - Mutation testing -
Automated code coverage analysis - Black box testing techniques - Boundary value analysis - Robustness
testing - Equivalence partitioning - Syntax testing - Finite state testing - Levels of testing - Unit,
Integration and System Testing.
Text Book:
1. William E.Perry, " Effective Methods for Software Testing (2nd Edition) ",
John Wiley & Sons, 1999 2nd edition.
Reference Books:
1) Glenford J.Myers, " The Art of Software Testing ", John Wiley & Sons, 1979.
2) Boris Beizer, Black-Box Testing: " Techniques for Functional Testing of Software and Systems
",John Wiley & Sons, 1995.
Objective
To understand and apply Software Configuration Management concepts for software development.
Introduction
Overview of Software Configuration Management : History of Software Configuration Management-
Software Configuration Management - concepts and definitions- Need and Importance of Software
Configuration Management – Basic Concepts.
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
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.
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.
• 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.
• The above facts has to be documented and a report has to be submitted at the end of the
semester
M.S. (Software Engineering) – Date of Revision 6th March 2006
Mini Projects will be assigned for the students under the following domains.
• PHP
• PERL
• My SQL
• Linux
M.S. (Software Engineering) – Date of Revision 6th March 2006
Objective
To learn various architectural styles and Design Pattern
Introduction
Introduction to patterns – Pattern categories – Relationship- pattern description – patterns and S/W
architecture- Description of architectural patterns-Design pattern –an Introduction – Description of
design pattern.
Design Pattern
Catalog of Design Pattern – Problem solving by Design Pattern – Guidelines for selecting & using design
pattern – Creation of patterns – Abstract factory – Builder – Factory methods – prototype – singleton –
Discussion
Structural Pattern
Structural Pattern – Adapter – Bridge – Composite – Decorator – Façade – Flyweight – Proxy –
Discussion.
Behavioral Pattern
Behavioral Pattern – Chain of responsibility – Command – Interpreter – Iterator – Mediator – Memento-
Observer - State Strategy – Template method – visitor – discussion
Future of Patterns
Benefits of pattern in S/ W development – expectation from design pattern – A Case study.
Text Book:
1. Gamma & Helm et al, “Design Patterns”, Addison Wesley 1999.
Reference Book:
1. Frank Bushmann et al, “ Pattern Oriented S/W Architecture”, John Wiley & sons -2001
Mode of Evaluation: By Assignment, Seminars and Written Examinations
M.S. (Software Engineering) – Date of Revision 6th March 2006
Objective
To prepare, conduct and manage software inspection.
Inspection Background
Inspection – background – Inspection preconditions – common questionnaires Inspections – approach to
success – inspections – first inspections – approach to success inspection. Introduction – definitions from
inspection comparison – Walk thru & review defect detection & prevent or – characteristics inspection. The
Inspection process – flow of Improvement process – planning & scheduling – inspection meeting – analysis
meeting – rework – follow up – prevention meeting & inspection process monitoring.
Inspection Analysis
Inspection data – goal setting – defects classification – sign of work products – effort time & cost – other
inspection date – inspection date tools – defect density – inspection meeting rate – inspection
effectiveness – inspection analysis – casual analysis pareto analysis – presentation.
Managing Inspections
Re – inspection – criteria – imp rate preparation rate, compelling – quality of inspection group consensus
– rework Vs restrictive recommendations
Managing inspections – policy – commitment – proctor projects – feedback – inspections co-coordinators
– SQA responsible
Types of Inspection
Approaches – what to inspect? – Software work products – systems engineering – reviews – walk through
– self review disk check – a person inspection – N – fold inspections formal technical review – clear work
– inspection characteristics- inspections future – improvements in work product - aspects of a best case
inspection process
Text Book:
1. Ronald a Radice ,”Software inspections – how to cut costs , improve quality & short terms time
cycles of software projects” –, Tata McGraw hill – 2003
Reference Book:
Objective
To understand and utilize the various product and process metrics for software quality.
Text Book:
1. Norman E - Fentar and Share Lawrence Pflieger, " Software metrics ", International Thomson
Computer Press, 2003.Thomson Delmar 2nd edition
Refernce Books:
1) Stephen H.Kin, " Metric and models in software quality engineering ", Addison Wesley 1995
Pearson Education 2003
2) William A. Florac and Areitor D. Carletow, “Measuring Software Process ", Addison - Wesley,
1995.
Objective
To understand and implement software quality and process improvement procedures.
Software Quality
Concepts of Quality Control, Quality Assurance, Quality Management - Total Quality Management; Cost
of Quality; QC tools - 7 QC Tools – Measuring of quality – Standards and procedures – Technical
activities – ISO 9000 series standards – ISO 9001 accreditation – Management responsibility – Board
responsibility and day to day responsibility – Documented quality system – Training and induction –
Relation to ISO 9000-3.
Text Books:
1. Sami Zahran – Software Process Improvement: Practical Guidelines for Business Success,Pearson
Education, 2002
2. Darrel Ince - ISO 9001 and Software Quality Assurance – McGraw Hill, New York, 1994.
Reference Books:
1. Osten Oskarsson and R - An ISO 9000 Approach to Building Quality Software - Prentice Hall -
1996.
2. Roger Pressman, " Software Engineering ", McGraw Hill, Pearson Education 6th edition 2004
2. Watt.S. Humphery, “Managing Software Process ", Addison - Wesley, 2000.
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
The above facts has to be documented and a report has to be submitted at the end of the
semester
M.S. (Software Engineering) – Date of Revision 6th March 2006
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
• The above facts has to be documented and a report has to be submitted at the end of
the semester
M.S. (Software Engineering) – Date of Revision 6th March 2006
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.
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
Objectives
After completion of this course the students will be able to undergo projects in .NET
Introduction
Introduction to Microsoft .NET Platform; Building Blocks of .NET C# Language Fundamentals: Object
Oriented Programming in C#.
Framework Concepts
Console I/O-working with strings-formatting and conversion- file/O –serialization.
Threading
NET Framework Concepts II: Reflection- Remoting -XML Parsing-Security;
Applications
Writing GUI Applications with the .NET Framework; Introduction to ADO.NET; Writing Web
Application with the .NET framework;
Web Services
Writing Mobile Application with .NET Framework; Advanced Concepts.
TEXT BOOK:
1. Rick Leinecker ASP.NET on the edge, IDG Books India Pvt. Ltd, 2003
REFERENCE BOOK:
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
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.
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.
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.
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.
Objective
To make students to understand the various digital filters family of digital processors and its applications.
Digital filters
Structures: block diagram representation, signal flow-graph representation, equivalent structures, basic fir
digital filter structures, basic iir filter structures, state-space structures, all pass filters, tunable iir digital
filters, cascaded lattice realization of iir and fir filters, parallel all pass realization of iir transfer functions,
digital sine-cosine generator, computational complexity of digital filter structures. Design: preliminary
consideration, impulse invariance method of iir filter design, bilinear transform method of iir filter design,
design of digital iir notch filters, low pass iir digital filter design. Examples, spectral transformations of iir
filters, fir design based on truncated Fourier series, fir filter design based on frequency sampling approach,
computer-aided design of digital filters.
Digital signal processors
Overview of motorola DSP3xx family of digital signal processors, architectures of DSP56307: assembly
language instructions and programming: typical software applications.
Implementation, applications
Implementation consideration: basic issues, software implementation, computation of the discrete fourier
transform, the quantization process and errors, analysis of coefficient quantization effects, analysis of
coefficient quantization effects in fir filters. Representative applications: dual – tone multifrequency signal
detection, spectral analysis using dft, short-term discrete fourier transform, musical sound processing,
digital fm stereo generation, discrete-time analytic signal generation, voice privacy system, subband coding
of speech and audio signals.
Text Book:
1. Sanjit K. Mitra: Digital Signal Processing – A Computer –Based Approach, Tata McGraw-Hill, 1998.
(Chapters 1,4,6,7,8.1 To 8.3, 9.1 To 9.10, 11.1 To 11.8)
Reference Books:
1. Alan V. Oppenhein, And Ronald W. Schafer : Discrete – Time Signal Processing (Second Edition),
Prentice – Hall, 1998.
2. John G. Proakis & Dimitris G. Manolakis: DSP Principles, Algorithms, And Applications
Prentice-Hall, 1996.
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
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
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 Schütze, “Foundations of Statistical Natural Language Processing”,
MIT Press. Cambridge, MA: May 1999.
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.
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.
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.
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.
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
Objective
On completion of this course the students will understand Reengineering Patterns, Need for Reengineer,
The Reengineering Life Cycle, Reengineering Patterns, Form of a Reengineering Pattern, A Map of
Reengineering Patterns
Evolution
Write Tests to Enable Evolution Pattern - Grow Your Test Base Incrementally Pattern - Use a Testing
Framework Pattern - Test the Interface, Not the Implementation Pattern - Record Business Rules as Tests
Pattern - Write Tests to Understand
Migration Strategies
Migration Strategies Forces Overview Pattern - Involve the Users Pattern - Build Confidence Pattern
Migrate Systems Incrementally Pattern - Prototype the Target Solution Pattern - Always Have a Running
Version Pattern - Regression Test after Every Change Pattern- Make a Bridge to the New Town Pattern -
Present the Right Interface Pattern - Distinguish Public from Published Interface Pattern - Deprecate
Obsolete Interfaces Pattern -Conserve Familiarity Pattern - Use Profiler before Optimizing
Overview of Pattern
Redistribute Responsibilities Forces Overview Pattern - Move Behavior Close to Data Pattern - Eliminate
Navigation Code Pattern - Split up God Class
Polymorphism
Transform Conditionals to Polymorphism Forces Overview Pattern - Transform Self Type Checks
Pattern - Transform Client Type Checks Pattern - Factor Out State Pattern - Factor Out Strategy Pattern -
Introduce Null Object Pattern - Transform Conditionals into Registration
Text Book:
1. Object-Oriented ReEngineering Patterns, Serge Demeyer, Stéphane Ducasse, Oscar
Nierstrasz , ELsvier Publication, 2003
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
Aim
To provide an environment to understand the system and to make decisions.
Objectives
The students will be capable of designing the decision support system for managers to take the decision.
Decision making and computerized support . Managers and decision making, managerial decision making
and informative system, managers and computerized support, the need for computerized decision support
technologies, a framework for decision support, the concept of decision support systems, group decision
support systems, executive information (support) systems, expert systems, artificial neural networks,
hybrid support systems, the evolution and attributes of computerized decision aids, introduction and
definitions, systems models, the modeling process; evaluation.
Database organization
Database organization and structure, data warehousing, OLAP: data access and mining, querying and
analysis, data visualization and multidimensionality, intelligent database and data mining, the big picture.
Support systems
UNIT III:
The GDSS meeting process, constructing a GDSS and the determinants of its success, GDSS research
challenges Modeling for mss, static and dynamic models, treating certainty, uncertainty and risk, influence
diagrams, mss modeling in spreadsheets, decision analysis of a few alternatives, optimization.
Simulation
Heuristic programming, simulation, multidimensional modeling, visual spreadsheets, financial and
planning modeling, visual modeling and simulation, ready-made quantitative software packages, model
base management, knowledge-based DSS & AI concepts and definitions, AI verses natural intelligence,
knowledge in AI, how AI differs from conventional computing, the AI field, types of knowledge-based
DSS.
Intelligent DSS
Intelligent DSS, the future of AI. DSS construction; the DSS development process; the DSS of the future,
decision making in groups, group DSS, the goal of GDSS and its technology levels, the technology of
GDSS, the decision (electronic meeting) room, GDSS software idea generation, negotiation.
Text Book:
1. Efrain Turban And Jay E. Aronson, Decision Support Systems And Intelligent
Systems (Fifth Edition), Prentice-Hall, 1998, (Chapters ,2,3,4,5,6,8,10,12,13,14,15,16,21)
ELECTIVE E-COMMERCE
L T P C
4 0 0 3
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.
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:
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.
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.
L T P C
4 0 0 3
Aim
To understand the concepts of ERP
Objective
To emphasis the need for ERP, Various Modules and benefits of market issues.
Introduction
Introduction to ERP, its evolution, ‘its growth, its advantages, its need, integrated management
information, business modeling, integrated data model, ERP and related technologies: BPR, MIS, DSS,
EIS, data warehousing, data mining, OLAP, supply chain management.
Implementation
ERP implementation lifecycle – pro-evaluation screening, package evaluation, project planning phase, gap
– analysis, reengineering, configuration, implementation team training, testing, going live, end – user
training, post-implementation, In-house implementation – pros and cons.
Reference Book:
Objective
To understand the agent based software development.
Introduction
Definitions - History - Intelligent Agents - Structure-Environment - Basic Problem Solving Agents-
Formulating - Search Strategies - Intelligent search - Game playing as search.
Planning Agents
Situational Calculus - Representation of Planning - Partial order Planning- Practical Planners – Conditional
Planning - planning Agents.
Other Agents
Learning agents - General Model - Inductive Learning - Learning Decision Trees-Reinforcement Learning
- Knowledge in Learning - Communicative agents -Types of Communicating agents - Future of AI.
.
Text Book:
1. Stuart Russell and Peter Norvig Artificial Intelligence - A Modern Approach, Prentice Hall,
PHI 2004 2nd edition
Reference Books:
1. Patrick Henry Winston, Artificial Intelligence, 3rd Edition, AW, Pearson Education 2002 3rd
Edition.
2. Nils.J.Nilsson, Principles of Artificial Intelligence, Narosa Publishing House, 2002.
Objectives
The student would be able to understand and use in embedded systems, device drivers, software
engineering practices in embedded systems development and Inter process communication.
Introduction
Introduction to Embedded Systems, Processor in the System – Software Embedded into a system –
Exemplary Embedded Systems – Embedded System-On-chip and in VLSI Circuit Processor and Memory
Organization – Structural Units in a Processor – Processor Selection for an Embedded System – Memory
Devices – Memory Selection for an Embedded System – Allocation of Memory to Program Segments and
Blocks and Memory Map of a System – Direct Memory Access – Interfacing Processor, Memories and
I/O Devices.
Programming Concepts
Program Modeling Concepts in Single and Multiprocessor Systems Software – Development Process-
Modeling Processes for Software Analysis Before Software Implementation – Programming Models for
Event Controlled or Response Time Constrained Real Time Programs – Modeling of Multiprocessor
Systems
Reference Books:
1. Arnold S. Berger, “Embedded Systems Design”, CMP Books, 1997
Mode of Evaluation: By Assignment, Seminars and Written Examinations
M.S. (Software Engineering) – Date of Revision 6th March 2006
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-FDMA-
TDMA-CDMA-comparison of S/T/F/CDMA. Telecommunication Systems –GSM – DECT – TETRA
- UMTS and IMT - 2000, Satellite Systems –GEO139, LEO139, MEO140
Routing –Localization –Handover –Broadcast systems-Overview –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.
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`:
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 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
Aim
To provide basic knowledge in Neural Networks
Objective
After completion of this course the students will be able to understand
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.
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, Willshaw’s associative net, the ADAM system, kaneva’s 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