INFORMATION TECHNOLOGY

UNIVERSITY OF KERALA
INFORMATION TECHNOLOGY
SCHEME OF STUDIES AND EXAMINATION AND SYLLABUS FOR B. TECH DEGREE
III to VIII SEMESTERS 2003 SCHEME

Semester III
03.301 Engineering Mathematics II
03.302 Problem Solving and Programming in C (R,F)
03.303 Discrete Structures (R,F)
03.304 Electronic Circuits (R,F)
03.305 Logic System Design (R,F)
03.306 Basics of Computer Systems
03.307 Electronic Circuits Lab (R,F)
03.308 Programming Lab
Semester IV
03.401 Engineering Mathematics III
03.402 Humanities
03.403 Computer Organization (R,F)
03.404 Object Oriented Techniques (R,F)
03.405 Data Structures & Programming Methodology (R,F)
03.406 Data Base Design (R,F)
03.407 Data Structures Lab (R,F)
03.408 Object Oriented Programming lab
Semester V
03.501 Engineering Mathematics IV
03.502 Advanced Mathematics and Queuing Models (R,F)
03.503 Operating Systems (R,F)
03.504 Systems Programming (R,F)
03.505 Microprocessors and Interfacing (R,F)
03.506 Elective I
3 03.507 Digital Circuits Lab
03.508 Database Lab (R,F)
03.506.1 Computer Hardware Design (R,F) (Common with Computer Science & Engg)03.506.2 Computer Architecture
03.506.3 Design of Digital Systems
Semester VI
03.601 Compiler Design (R,F)
03.602 Computer Communication (R,F)
03.603 Theory of Computation (R,F)
03.604 Internet Technology
303.605 Elective II
303.606 Elective III
303.607 Internet Lab
303.608 Mini Project
Elective II
03.605.1. Perl & python
03.605.2. Software Project Management (Common with Computer Science & Engg – Elective I )03.605.3. Software Architecture
Elective III
03.606.1. Multimedia Systems (Common with Computer Science & Engg – Elective I)
03.606.2. Computer Graphics (Common with Computer Science & Engg 03-604)
03.606.3. Bio Informatics
Semester VII 03.701 Computer Networks (R,F) 03.702 Internetworking
03.703 Software Testing
03.704 Web Applications Development
03.705 Elective IV
3 03.706 Elective V
3 03.707 Computer Networks Lab
03.708 Seminar /Project Design
Elective IV
03.705.1 Enterprise Resource Planning
03.705.2. Optical Networks
03.705.3. Mobile Computing
Elective V
03.706.1 Embedded Systems
03.706.2 Real time Systems
03.706.3 Network Programming
Semester VIII
03.801 Enterprise Networking
03.802 E-Commerce
03.803 E-Security 2
03.804 Distributed Systems (R,F)
03.805 Elective VI 3
03.806 Elective VII
03.807 Web Applications Lab
03.808 Project & Viva voce
Elective VI
03.805.1. Cryptography
03.805.2. Virtual Reality Systems
03.805.3. Client Server Programming
Elective VII
03.806.1. Distributed Database
03.806.2. Datamining and Warehousing
03.806.3. Object Oriented Database Systems

03.301 Engineering Mathematics II
(Common with all branches)
MODULE 1: Ordinary Differential Equations
Differential equations of the first order and higher degree: Equations solvable for p-Equations solvable for x-Equations solvable for y-Clairut’s Equation.
Linear Differential Equations: Higher order with constant coefficients-Method of variation of parameters-Homogeneous linear equations (Cauchy’s and Legender’s )-
Simultaneous linear equations with constant coefficients.
Orthogonal Trajectories: Cartesian form only.
MODULE 2: Fourier Series And Multiple Integrals
Fourier Series: Dirichlet’s conditions-Euler’s Formula-Functions with periods 2p and 2l-Even and odd functions-Half range sine and cosine series.
Multiple Integrals: Evaluation-Change of order of integration-Transformation to polar coordinates-Area as double integral-Volume as triple integral (cartesian coordinates only).
MODULE 3: Vector Calculus
Vector differentiation: Derivative of a vector function-Velocity and acceleration-Scalar and vector fields-Gradient-It’s geometrical interpretation-Directional derivative-Divergence and Curl-Their physical meaning-Relations involving Ñ -Solenoidal and irrotational fields-Scalar potentials(simple problems).
Vector Integration: Line integral, surface integral and volume integral-work done by a force-Statement and verification of Green’s theorem, Stoke’s theorem and Gauss’ Divergence theorem-their use in evaluating the integrals.
References:
Engineering Mathematics, Vol 2: S.S Sastry, Prentice Hall of India (P) Ltd.
Higher Engineering Mathematics: B. S. Grewal, Khanna Publishers
Engineering Mathematics: Sarveswara Rao Koneru, Universities Press
Advanced Engineering Mathematics: Michael D. Greenberg, Pearson Education
Note: The question paper consists of two parts. Part A (40 marks). Ten compulsory questions of 4 marks each. Part B (60 marks). Students must answer one out of two questions from each module. Each question carries 20 marks

03.302 PROBLEM SOLVING AND PROGRAMMING IN C (R,F) 2 - 2- 0

Module 1
Introduction to digital computer – VonNewman concept – hypothetical decimal computer – functional units of a computer – storage – primary storage – secondary storage. Introduction to programming languages – types of programming languages – high level languages – assembly language – machine language. Problem solving concepts – flow charts and algorithms – problem definition phase – general problem solving strategies – top-down design – breaking a problem into sub problems – choice of a suitable data structure. Documentation of programs – debugging of programs – program testing.
Module 2
Important C concepts. Preprocessor directives – header files – data types and qualifiers – operators and expressions – enumerations – data input and output – control statements – arrays and strings – structures and unions – working with bits in C – storage classes.
Module 3
Pointers – arrays of pointers – structures and pointers. Memory allocation functions. Function – function definition – function prototypes – function call by value and call by reference – recursive functions. Data files – formatted, unformatted and text files. Low level programming in C. Command line arguments.
Text Books:
computer Programming in C – V. Rajaraman, PHI
Progarmming with C – Byron S.Gottfried, Schaum’s Series.
Programming Techniques through C – M.G. Venkateshmurthy, Pearson Education India.
Problem Solving and Program Design in C – J.R. Hanly and E.B. Koffman, Pearson/Addison Wesley
References:
The C Programming language – Keringhan B.W. and Ritche D.M., PHI 1990.
Programming with ANSI and Turbo C – Ashok N. Kamthane, Pearson Education India
Introduction to Computer Science an Algorithmic approach – J.P. Trembly and R.B. Bunt, Mc Graw Hill.
Fundamentals of computers – V. Rajaraman, PHI
Note:
Question papers consist of two parts.
Part A (40 marks) – Compulsory ten short questions (10 x 4)
Part B (60 marks) – Three modules. Students must answer one out of two from each module.


03.303 DISCRETE STRUCTURES (R,F) 2 – 1 – 0
Module 1
Statement calculus: Statements, atomic statements, logical connectives, truth table, conditional and bi-conditional, well formed formulas, tautologies and contradictions, duals of logical formulas, tautological implications and equivalences.
Predicate calculus: Predicates, simple and compound statement functions, quantifiers, well formed formula of predicate calculus, predicate formulas, free and bound variables.
Sets: Operations on sets, power set. Cardinality of a set, countable and uncountable sets. Cantor’s theorem of power set. Principles of inclusion and exclusion. Relations – reflexive, transitive, symmetric, equivalence, compatibility. Functions – one – to – one, on to, bijection, composition of functions and relations. Mathematical induction, Pigeonhole principle.
Module 2
Partially ordered sets, Complete partial ordering (CPO), chain, lattice. Boolean and pseudo Boolean lattices. Graph: Directed and undirected. Eulerian chains and cycles. Hamiltonian chains and cycle. Trees, labeled trees. Computer representation of digraphs, connectivity, planarity and colourability. Applications. Recurrence relations, generating functions. Applications.
Module 3
Groups, semigroups and monoids. Cyclic semigroups and submonoids. Subgraphs and cosets. Congruence relations on semigroups, morphism, structure of cyclic group, permutation groups. Elementary applications in coding theory. Rings and subrings morphism of rings. Euclidean domains. Integral domains and fields. Boolean Algebras – direct product, morphisms. Boolean sub algebra. Boolean rings. Applications of Boolean algebra in logic circuits and switching functions.
Text Books
Discrete mathematical structures for Computer Science – Kolman B., prentice Hall, 1988.
Discrete mathematical structures with applications to computer science – J.P. Tremblay and R. Manohar, Tata McGraw Hill
Elements of Discrete Mathematics - C.L. Liu, Tata McGraw Hill
References:
Modern Algebra – Herstein.
Algorithmic graph theory – Gibbons, Cambridge University Press.
Graph theory – Harary.
The art of computer programming vol. I Fundamental algorithms – Knuth D.E., 2nd Edn Reading mass, Addison Wesley.
Universal Algebra for Computer Scientists. EATCS Monographs on Theor. Computer Science Vol. 25 Springer verlag. Barlin.
Note:
Question papers consist of two parts.
Part A (40 marks) – Compulsory ten short questions (10 x 4)
Part B (60 marks) – Three modules. Students must answer one out of two from each module.


03.304 ELECTRONIC CIRCUITS (R,F) 2 – 1 – 0

Module 1
Design and analysis of Rectifiers, Filters, Clippers, Clampers, Regulators, Differentiators, Integrators-RC circuits-response of high pass / low pass RC to sine wave, pulse and square wave inputs- principle of operation of inverters, uninterrupted power supplies, switched mode power supplies
Module 2
Transistor amplifiers- classification – small signal analysis – voltage divider bias – emitter follower configuration- feed back configurations- RC phase shift, Wien bridge, Colpitts, Hartley oscillator, Multivibrators- monostable, bistable and astable- 555 timer and applications- Op-amps- parameters, common mode and difference mode- summing amplifier, differential amplifier, inverting, non inverting amplifiers
Module 3
Digital ICs- Logic families- TTL NAND, open collector, totem pole, tristate logic, sinking and sourcing currents, CMOS inverter, CMOS NAND, CMOS NOR, ECL OR-NOR, IIL gates, parameters and characteristics, comparison, manufacturing of integrated circuits, NMOS ICs, bipolar technology- diodes, resistors, capacitors, layout, CMOS technology, twin tube process, pseudo NMOS logic, dynamic NMOS, domino logic gates
Text Books:
Electronic Devices and Circuits Theory – Boylestead and Nashelky, PHI
Digital Electronics and Logic Design – B. Somanathan Nair, PHI
References:
Op-amp and Linear Integrated Circuits- 4th Edition – Gayakwad, Pearson Education
Electronics: Analog and Digital – J.Naganath – PHI
Note:
Question papers consist of two parts.
Part A (40 marks) – Compulsory ten short questions (10 x 4)
Part B (60 marks) – Three modules. Students must answer one out of two from each module.


03.305 LOGIC SYSTEM DESIGN (R,F) 2 – 2 – 0
Module 1
Number systems – Decimal, Binary, Octal and Hexadecimal – conversion form systems to another representation of negative numbers – representation of BCD numbers – character representation – character coding schemes – ASCII – BBCDIC etc. – Algorithms for addition subtraction, multiplication and division of binary and BCD number – Addition and subtraction of octal and hexadecimal numbers. Representation of floating point numbers – precision – addition, subtraction, multiplication and division of floating point numbers.
Module 2
Postulates of Boolean algebra – Logic functions – logic gates – methods of minimization of logic functions – Karnaugh map method and tabulation method – realization using logic gates. Design of combinatorial logic circuits – adder, subtractor, binary parallel adder, decimal adder, code converter, magnitude comparator, decoder, multiplexer, demultiplexer, parity generator – design examples.
Module 3
Sequential Logic Circuits – Flip flops RS, D, JK & T type – Master slave flip flop. Analysis and design of clocked sequential circuits – state diagram – state reduction and assignment – design with state equations – shift registers – serial adder – Design of synchronous and asynchronous Counters – Timing Sequences.
Text Books
Digital Logic and Computer Design – Morris Mano, PHI.
Digital Fundamentals – Floyd, Pearson Education.
References:
Digital Electronics – An introduction to theory and practice – Gothman W.H., PHI.
Digital Computer Fundamentals (Fifth edition) – Bartee T, Mc Graw Hill.
An Introduction to Digital Computer Design – V. Rajaraman and T. Radhakrishnan, PHI.
Note:
Question papers consist of two parts.
Part A (40 marks) – Compulsory ten short questions (10 x 4)
Part B (60 marks) – Three modules. Students must answer one out of two from each module.




03.306 Basics OF COMPUTER systems

MODULE I - Hardware elements of a Personal Computer
System Board, Power Supply, Processor/CPU, Memory, Storage Devices, Monitor, Modem, Mouse, BIOS, CMOS, Ports, Cables, IDE/EIDE devices, Expansion slots
MODULE II - OPERATING SYSTEM TECHNOLOGIES
Windows, Linux, Solaris Operating Systems
Major Operating System Functions, Components, Creations of folders, Explorer, Control Panel, Command Prompt, Procedures
module iii- Peripherals and Communications
Printers-Printer types, Printer Connections and Configurations
Network cards, Network Access, Full duplex, Half duplex, Cabling, Physical Network Topologies
References:
David Groth, DOS/Windows study guide - - B.P.B
David Groth, A+ Study Guide - Core Module - - B.P.B

03.307 ELECTRONIC CIRCUITS LAB (R,F) 0 – 0 – 4
Tracing of hysteresis loop using CRO, Measurement of frequency and phase angle using CRO, Characteristics of diode, Zener diode, transistors and FET.
Clipping and clamping circuits. Differentiating and integrating circuits. Rectifier circuits. R.C. coupled amplifier, Astable, Monostable and Bistable circuits using discrete / IC components. Voltage regulator.


03.308 Programming Lab
1. Familiarization of Linux Operating System Commands.
2. Experiments based on use of Library Functions, Arrays, Strings, Records, Files and Pointers.
3. Programming Tools – Make file, Debuggers, Revision Control Systems.


03.401 engineering mathematics iii
MODULE 1: Partial Differential Equations
Formation of P.D.E-Solution by direct integration-solution of Lagrange’s linear equations-Nonlinear equations of first order-Types f(p,q)=0,f(z,p,q)=0,f(x,p)=g(y,q)-
Homogeneous P.D.E with constant coefficients-solution by the method of separation of variables.
MODULE 2: Application of partial differential Equations
Derivation of one dimensional wave equation-solution of the wave equation by the method of separation of variables –Boundary value problems involving wave equation-Derivation of one dimensional heat equation-solution by the method of separation of variables-Problems with zero and nonzero boundary conditions-Solution of Laplace equation in two dimensions (cartesian only)-Problems on finite and infinite strips.
MODULE 3: Fourier Transforms and Optimization Techniques
Fourier Transforms: Fourier integral Theorem(no proof)-Fourier sine and cosine integrals-Fourier Transforms-complex form-Sine and cosine Transforms-Inversion Formula-simple problems.
Optimization techniques: Linear Programming Problems-Formulation-Graphical solution-General L.P.P-Slack and Surplus variables-Basic feasible solution-Solution of L.P.P. using Simplex method-Big-M-method-Duality-Dual Simplex method.
References:
1. EngineeringMathematics,Vol.3:V.Sunderam, .Balasubramanian, K. A. Lakshminara-yanan, Vikas Publishing House (P) Ltd.
2. Higher Engineering Mathematics: B.S.Grewal, Khanna Publishers.
3. Advanced Engineering Mathematics: Michael D Greenberg, Pearson Education.
4. Engineering Mathematics,Vol2: S.S.Sastry, Prentice Hall Of India(P)Ltd.
5. Engineering Mathematics: Sarveswara Rao Koneru, University Press. Quantitative Techniques: P. C. Tulsian and Vishal Pandey, Pearson Education.
Note:
The question paper consists of two parts. Part A (40 marks). Ten compulsory questions of 4 marks each. Part B (60 marks). Students must answer one out of two questions from each module. Each question carries 20 marks



03.402 humanities
Part I – Economics (2 Periods per week)
Module I
Definition and scope of Economics- Definition of basic terms-Goods-wants and their classifications-wealth- Income –Money- -Near money- Credit money- Utility, features and kinds of utility – National Income and related concepts as GNP, NNP, -Disposable Income Resource Allocation, Technological choice & production possibility curve. Indifference curve analysis- the concept of supply- Supply curves-Cost curves – loss of returns.
Basic laws in Economics – Law of Diminishing marginal utility – Demand, Law of Demand and demand curve- The concept of supply- Supply schedule and supply curve.
Module II
Market structure – Classifications – Pricing under different markets as perfect competition, monopoly and oligopoly. Pricing under monopolistic competition.
4. Inflation – Measures to control inflation – Monetary measures and fiscal measures – Effects of inflation.
Tax – Classification of Taxes – Direct & Indirect taxes specific and AdValorem taxes – personal income tax – characteristics of a good tax system – Tax evasion.
Module III
International Monetary Fund – Issues & Challenges – International liquidity – Special Drawing Rights - India & IMF.
Welfare Economics – Old Welfare Economics -Pigou’s Analysis – New Welfare Economics Pareto’s welfare criterion.
Books for Study : Part-I
Dewtt.K.K Modern Economic theory
Books for References:-
1. Prof. G.Narendrababu “ Elements of Ecomic Analysis”
2. Sundaran K.P.M “ Money, Banking . Trade & Finance “
Part II – Communicative English (1 period per week)
Reading- Skimming-scanning-detailed reading-predicting content-interpreting charts and tables-identifying stylistic features in texts - evaluating texts-understanding discourse coherence-guessing meaning from the context- note making / transferring information.
Word formation with prefixes and suffixes-discourse markers and their functions-degrees of comparison- expressions relating to recommendations and comparisons-active and passive voice-antonyms-tense forms- gerunds- conditional sentences-modal verbs of probability and improbability-acronyms and abbreviations - compound nouns and adjectives-spelling-punctuation.
Sentence definition-static description-comparison and contrast-classification of information-recommendations- highlighting problems and providing solutions-formal and informal letter writing-using flow-charts/diagrams paragraph writing-editing.
Defining, describing objects-describing uses/functions-comparing-offering suggestions-analysing problems and providing solutions-expressing opinions (agreement/ disagreement) –expressing possibility/certainty – framing questions-providing answers.
Text Books: Part II
1. " English for Engineers and Technologists ", Volume I. Authors : Humanities and Social Science Department, Anna University, Published by Orient Longman Ltd., 1990.
2. Sarah Freeman, Written communication in English, Orient Longman, 1977.
References:
1. Narayanaswami, V.R, .Strengthen Your Writing, Orient Longman Ltd., Chennai 1996 (Revised Edition)
2. Pickett and Laster, Technical English, Writing, Reading and Speaking, New York Harper and Row Publications.
3. Swan, Michael, Basic English Usage, Oxford University Press, 1984.
4. Bhatnagar and Bell, Communication in English, Orient Longman, 1979.
5. Pravin.S.R.Bhatia, A.M.Sheikh, Professional Communication skills, S.Chand and Company Ltd., 2003.
University Question
Note: Part I and Part II to be answered in separate answer books.
Part – I Humanities
Part A – 30 Marks ( short answers) Covering entire syllabus ( 3x10=30)
Part B – 40 Marks ( 50% choice – One out of two or two out of four from each module.)
Part - II Communicative English
30 marks (50 % choice)
03.403 COMPUTER ORGANIZATION (R,F) 3 – 1 – 0

Module 1
Basic Structure of digital computer, functional units, basic operational concepts, bus structures, software, addressing methods and machine program sequencing, instruction formats, instruction sequencing addressing modes, assembly language, PDP – II addressing modes and instructions, simple I/O programming, stacks, subroutines.
Module 2
Processing unit – fundamental concepts, execution of a complete instruction, sequencing of control signals, I/O organization – Accessing of I/O devices, DMA, Interrupts, handling, I/O channels.
Module 3
Memory organization – basic concepts, semiconductor RAM memories, memory system considerations, semiconductor ROM memories, multiple module memories and interleaving, cache memory, Virtual memory segmentation, paging, Associative memory, Computer peripherals.
Text Books
1. Computer Organization – V. Carl Hamacher, S. Venko G. Vranesic and Safwat G. Zaky, Mc Graw Hill Publishing Company.
2. Computer Organization and Design – Pal Chaudhuri, Prentice Hall of India Pvt. Ltd.
References:
1. Computer Organization Programming – C.W. Gear, Mc Graw Hill International Student Edition.
2. Introduction to Computer Systems using PDP-II and Pascal – Glenn H. Mac Even, McGraw Hill.
Note:
Question papers consist of two parts.
Part A (40 marks) – Compulsory ten short questions (10 x 4)
Part B (60 marks) – Three modules. Students must answer one out of two from each module.


03.404 OBJECT ORIENTED TECHNIQUES (R,F) 2 – 1 – 0
Module 1
Fundamentals of object-oriented Design : Data Abstraction, Encapsulation, classes, Inheritance and Polymorphism, class Hierarchies.
Designing and object-oriented system; Identifying the classes, Assigning Attributes and Behaviour, finding relationship between classes, Arranging classes into hierarchies : A design example. A first look at C++: Using streams for input and output.
C++ enhancements to C : Default Function Arguments, Placement of variable declarations, the scope resolution operation, the “Const” Qualifier, overloaded functions, OODBMS.
References: References as Aliases, references and pointers similarities and differences, references as function parameters, references as return values.
Module 2
Introduction to classes : Declaring and using classes, class members, creation and destruction of objects, accessing data members, returning a reference, “Const” objects and member function.
Classes and dynamic memory allocation: New, delete operators, “this” pointer.
Static members, friends, array of class objects.
Module 3
Inheritance and polymorphism: Derived class and base class, derived class constructors, overriding member functions, public and private inheritance, virtual functions, polymorphism, multiple inheritance, classes within classes.
Operator overloading : Overloading unary operator, overloading binary operator, data conversion. Generic functions, generic classes. File processing – formatted – unformatted and random files. Microsoft foundation classes : Strings, data structure.
Text Books
Teach yourself C++ - Herbert Schildt, Tata McGraw Hill.
References:
Object Oriented Programming in Microsoft C++ - Rober Lafore, Galgotia Book House.
Object Oriented Programming in Microsoft C++ - Balagurusamy.
Object Oriented Programming – Barkakti
Note:
Question papers consist of two parts.
Part A (40 marks) – Compulsory ten short questions (10 x 4)
Part B (60 marks) – Three modules. Students must answer one out of two from each module.

03.405 DATA STRUCTURES AND PROGRAMMING METHODOLOGY (R,F) 2– 2 – 0
Module 1
Introduction to programming methodologies – structured approach, stepwise refinement techniques, programming style, documentation – analysis of algorithms: frequency count. Study of basic data structures – vectors, arrays, records, stacks, queues and dqueues.
Module 2
Logic characteristics of strings, physical representation for strings – linked lists – trees, binary tree traversals – graphs – applications. Storage management – free storage lists, reference counters, garbage collection, storage compaction, boundary tag method.
Module 3
Internal and external sorting techniques – selection, bubble, insertion, merge sorting, partition exchange sorting, heap sort. Searching – linear and binary – hashing. External sorting – sorting with disks, sorting with tapes.
Text Books
1. Introduction to data structures with applications – Tremblay and Sorensons, TMH.
2. Fundamentals of data structures in Pascal – Horowitz and Sahni
References:
1. Theory and problems of data structures – Seymour Lipschuts, Schaum’s series.
2. Algorithms + data Structures = Programs – M. Wirth, Prentice Hall Englewood cliffs.
3. A structured approach to Programming – J.K. Hugges and J.I. Michtm, Prentice Hall.
Note:
Question papers consist of two parts.
Part A (40 marks) – Compulsory ten short questions (10 x 4)
Part B (60 marks) – Three modules. Students must answer one out of two from each module.

03.406 DATABASE DESIGN (R,F) 2 – 1 – 0
Module I
Introduction to database- traditional file system- data and need for information- sequential, random and indexed sequential files- data organization- single and multilevel indexes- B trees and B+ trees- secondary storage devices- database approach–data models- schemas and instances- Data independence – 3 schema architecture – Data base languages – Data base users – Classification of data base systems – E-R modeling– Attributes and keys – E-R diagrams – Weak entities – extended E-R model- mapping ER model to relational model
Module II
Introduction to Relational model: Basic concepts: Domains Attributes, keys, tuples, relations – Relational data base schemas – relational Algebra operations, SQL in queries – views- Over view of relational calculus- Conceptual design of relational data base – Normalization theory- Functional dependencies- membership and minimal covers- Loss less decomposition of relations- First, Second, Third and Boyce – Cod normal forms – Multi valued dependencies and Fourth normal form – Join dependencies and Fifth normal form.
Module III
Security issues in database- transaction management - properties of transactions- database architecture- concurrency control- serializability (preliminary treatment only) – locking methods - time stamping methods - database recovery.
Text Books:
1. Database System Concepts – Henry F. Korth and Abraham Silbershatz, McGraw Hill
2. Database systems (3rd edition) – Thomas Connolly and Carolyn Begg, Pearson Education
References:
1. Database management systems - Alexis Leon and Mathews Leon, Vikas publishing
2. Fundamentals of Database Systems - Ramez Elmasri and Shakant B. Navathe, Pearson Education.
3. Principles of Database Systems - Jeffry D. Ullman, Galgotia Publications.
Note:
Question papers consist of two parts.
Part A (40 marks) – Compulsory ten short questions (10 x 4)
Part B (60 marks) – Three modules. Students must answer one out of two from each module.

03.407 DATA STRUCTURE LAB (R,F) 0 – 0 – 4
algorithm development – non-numeric application of computers – development of recursive programs for sorting, searching and text editing using different methods – development of application programs using arrays, strings, stacks, queues, list, trees and files. programs are to be developed in c.



03.408 Object ORIENTED PROGRAMMING LAB

1 Implementation of the Eight Queen Problem
2 Implementation of the Billiards game
3 Implementation of Solitaire
4 Implementation of a Container class
5 The implementation of the Standard Template Library


03.501 engineering mathematics iv

MODULE 1: Complex Analysis-Differentiation
Differentiation of functions of complex variable-Analytic functions-Cauchy-Riemann Equations(cartesian only)-Harmonic function-Orthogonal system-velocity potential
Conformal mapping-Mapping by w=1/z,w=z2, w=ez, w=z+1/z, w=sinz, w=cosz.
Bilenear Transformation-fixed points-Problems to find the transformation when three points and their images are given.
MODULE 2: Complex Analysis-Integration
Line integrals-simple problems-Statements of Cauchy’s integral theorem, Cauchy’s integral formula-Formula for higher derivatives-Evaluation of integrals using the above results.
Taylor series and Laurent’s series(no proof)-simple problems.
Singularities-Residues-Cauchy’s Residue theorem(no proof)-problems.
Evaluation of real definite integrals of the following types:
2p ¥ ¥ ¥
òf(sinq,cosq)dq, ò[f(x)/F(x)]dx, ò[sin mx/f(x)]dx, ò[cos mx/f(x)]dx
0 0 0 0
MODULE 3: Probability and statistics
Random variable-continuous and discrete distribution-mean and variance-
Binomial distribution-mean and variance-fitting a Binomial distribution-Problems.
Poisson distribution-Poisson distribution as a limiting case of the Binomial distribution-mean and variance-Problems.
Normal distribution-Properties-Problems
Curve fitting-Fitting of a straight line and a second degree parabola, by the method of least squares.
Testing of Hypothesis-Types of errors-Null hypothesis-level of significance-Confidence limits-Large sample tests-testing of proportion of attributes-confidence limits for unknown mean-test of significance for means of two large samples-Use of Student’s t distribution for small sample tests-Significance test of a sample mean-Significance test of difference between sample means.
References:
1.Higher Engineering Mathematics:B.S.Grewal, Khanna Publishers
2.Engineering Mathematics,Vol.2:S.S.Sastry,Prentice Hall of India(P)Ltd.
3.Complex Variables Theory And Applications:H.S.Kasana, Prentice Hall of India(P)Ltd
4.Advanced Engineering Mathematics: Michael D Greenberg, Pearson Education
5.Probability and Statistics for engineers ;Miller & Freund ,Pearson Education
Note:
The question paper consists of two parts. Part A (40 marks). Ten compulsory questions of 4 marks each. Part B (60 marks).Students must answer one out of two questions from each module. Each question carries 20 marks.

03.502 advanced mathematics & queueing models
MODULE 1: Special Functions
Beta and Gamma functions-Bessel’equation-Bessel function-recurrence formula-generating function for Jn(x)-Legender equation-Legender Polynomials-Rodrigue’s formula-generating function for Pn(x)-recurrence formula for Pn(x).
MODULE 2: Network scheduling
Construction of network-event-activity-Fulkerson’rule-CPM network-time calculations-slack-float-total float-free float-critical path-PERT-time calculations-critical path-probability of meeting the time schedule.
MODULE 3: Queuing Models
Characteristics of a queuing model-Kendall’s notation-types of queuing models-
(M/M/1):(¥/FIFO) model-Pn=rnP0(no proof)-Derivation of the following characteristics (a) Probability that queue size ³n (b)Average number of customers in the system(c)Average length of the waiting line-
Waiting time distribution(no proof)-waiting time in the system-waiting time in the queue-Little’s formulae-problems based on the above results.
(M/M/1):(N/FIFO) model-Formulae(with out proof) for the average number of units in the system and in the queue and the average waiting time-problems.
(M/M/c):(¥/FIFO) model-standard results(no derivation)-problems.
References:
Advanced Engineering Mathematics:Michael D.Greenberg,Pearson Education.
Higher Mathematics for Engineering&Science:M.K.Venkataraman,The National Publishing Company.
Operations Research:Hamdy A.Taha,Prentice Hall Of India(P)Ltd.
Operations Research:S.Kalavathy,Vikas Publishing House(P)Ltd.
Quantitative Techniques Theory And Problems:P.C.Tulsian and Vishal Pandey, Pearson Education.
Operations Research:P.K.Gupta and D.S.Heera,S.Chand and Company Ltd.
Note:
The question paper consists of two parts. Part A (40 marks). Ten compulsory questions of 4 marks each. Part B (60 marks). Students must answer one out of two questions from each module. Each question carries 20 marks.

03.503 OPERATING SYSTEMS (R,F) 2 – 1 – 0
Module 1
Introduction : Basic concepts - terminology Historical perspective - early system - simple monitor - performance - types of OS - batch processing - multiprogramming - time sharing - real time system - Protection - different classes of computers - functions and components of an operating system - OS structure - Multiprocessor system - distributed system. Operating system services.
Information management : File concepts file support - file system - directory structure - gaining access to files - basic file system calls - sharing and security - operation on files - file protection - allocation methods - implementation issues - case study.
Module 2
Processor management : CPU scheduling - Review of Multiprogramming concepts - scheduling concepts - scheduling algorithm - Multiprocessor scheduling , Concurrent process - precedence graph - hierarchy of process - The critical section problem - Semaphores - process coordination - determinant program Modularization - Synchronization - concurrent languages - Structured and Modular concurrent programming.
Memory management : Preliminaries - Memory architecture evolution - Bare machine - objectives - Resident monitor - Swapping - fixed partitions - variable partitions - paging - segmentation - combined system - virtual memory concepts - overlay - demand paging - page replacement - space allocation policies - segmented paging dynamic linking - caching of secondary storage information.
Module 3
Device management : Physical characteristics – FCFS, SST , C- SCAN selecting a disk scheduling algorithm - sector queuing. I/O scheduling policies - terminal I/O handling - channels and control units - virtual devices.
Dead locks : The dead lock problem characteristics prevention avoidance - detection - Recovery from dead lock - combined approach to dead lock handling.
Protection : Goals of protection - Mechanisms and policies - domain of protection - access matrix and its implementation. Dynamic protection structures, Language based protection - security. Case study : Typical Operating System Characteristics MS DOS, WINDOWS, WINDOWS NT, NETWARE & UNIX.
Text Books :
1. Operating system concepts – J.L. Peterson and A. Siberachits, Addison Wesley.
2. Operating systems - S. Madnick and J.J. Donovan, McGraw Hill International student edition, Kogokuzha, Tokyo.
References :
1. Operating System Principle – P. Brinch Hanson, Prentice Hall of India.
2. The Logical design of operating systems – A.C. Shaw, Prentice Hall
3. Operating system principles – H.M. Deite, Addison-Wesley
Note:
Question papers consist of two parts.
Part A (40 marks) – Compulsory ten short questions (10 x 4)
Part B (60 marks) – Three modules. Students must answer one out of two from each module.

03.504 SYSTEMS PROGRAMMING (R,F) 2 – 1 – 0
Module 1
Systems Programming – What is systems programming, Difference between systems programming and application programming – Dependence on systems programming on hardware – System software and Machine architecture. Traditional (CISC) machines – VAX architecture, Pentium Pro architecture, RIC machine – ultra SPARK, Power PC, Cray architecture.
Module 2
Assemblers – Basic assembler functions – machine dependent assembler features – machine independent assembler features – assembler design options – one pass assembler, multi pass assembler – assembler implementation – MASM, SPARC assemblers.
Loaders and Linkers basic loader functions, machine dependent loader features, machine independent loader featured, loader design options – linkage editors, dynamic linkage editors, dynamic linking, bootstrap loaders, examples – DOS linker.
Module 3
Macro processors – basic macro processor functions – machine dependent and machine independent macro processor architectures – design options – implementation examples – MASM, ANSI C macro processors. Introduction to Compilers. Text Editors – overview of the editing process – user interface, editor structure. Debuggers – debugging functions and capabilities, relationship with other parts of the system – user interface criteria.
Text Books
System Software-An Introduction to System Programming – Leland L. Beck, Addison Wesley Publishing.

References:
Systems Programming – John J. Donovan.
Operating Systems and Systems Programming – Dumdare.
Note:
Question papers consist of two parts.
Part A (40 marks) – Compulsory ten short questions (10 x 4)
Part B (60 marks) – Three modules. Students must answer one out of two from each module.


03.505 MICROPROCESSORS AND INTERFACING (R,F) 2 – 1 – 0
Module 1
Introduction to Microcomputers – Types, overview of structure and operation. Microprocessors – Evolution and Types. 8085 Microprocessor – Internal Architecture, Addressing modes, 8085 assembly language programming – development steps, machine code construction. Assembly language program development tools assembler directives.
Module 2
8085 system connections, Timing – 8085 bus activities during a read/write machine cycle. Addressing memory and ports, ROM/RAM/Port decoder. 8085 interrupts and interrupt responses, hardware interrupt applications, software interrupt applications, 8254 software programmable timer/counter, 8259A priority interrupt controller, A/D and D/A converters and interfacing.
Module 3
Digital interfacing – 8255 – Programmable parallel port device, display and key board interfacing with 8279, 8237 DMA controller, 8251A USART 8086 – Internal architecture, including addressing modes.
Text Books
Interfacing & applications of Microprocessors – Gaonkar, Prentice Hall
Microprocessors and Interfacing – Douglas V. Hall, McGraw Hill.
References:
Introduction to Microprocessor methods.
Microprocessors and programmed logic – Kenneth L. Short, Pearson Education.
Note:
Question papers consist of two parts.
Part A (40 marks) – Compulsory ten short questions (10 x 4)
Part B (60 marks) – Three modules. Students must answer one out of two from each module.





03.506.1 computer hardware design
Module 1
Arithmetic Algorithms: Algorithms for addition and subtraction of binary and BCD number – carry look ahead adder – multilevel carry look ahead adder – multiplication and division algorithms of binary and BCD numbers – array multiplier – booth’s multiplication algorithm – restoring and nonrestoring division – Floating point addition, subtraction, multiplication and division.
Module 2
Processor Logic Design: Register transfer logic – Interregister transfer – Arithmetic logic and shift microoperations – Conditional control statements – processor organization – Design of arithmetic unit, logic unit arithmetic logic unit and sifter – status register – Processor unit – design of accumulator.
Module 3
Control Logic Design – Control organization – Design of hardwired control – Control of Processor unit – PLA control – Microprogram control – microinstructions – Horizontal and vertical micro instructions – Nanomemory and nanoinstructions – microprogram sequencer – microprogrammed CPU organization.
Text Books
Digital Logic and Computer Design – M. Morris Mano PHI Edition.
Computer Organization and Design – P. Pal Chaudhuri, Prentice Hall India.
References:
Computer Organization and Architecture – William Stallings, Prentice Hall.
Computer Architecture and Organization – H.P. Hayes Mc Graw Hill.
Computer Architecture and parallel processing – K Ilawang & Briggs Mc Graw Hill.
Switching and finite Automata Theory – ZVI Kohavi TMH Edition.
Computer System Architecture – M. Morris Mano PHI Edition.
Note:
Question papers consist of two parts. Part A (40 marks) Compulsory ten short questions (10 x 4). Part B (60 marks) Three modules. Students must answer one out of two from each module.


03.506.2 computer architecture
MODULE I
Introduction, System Cost, Instruction Set Architecture, Qualitative and Quantitative Analysis of Instruction Set Architecture, RISE Architecture, Instruction Pipe Lining, Load Delay Slot Filling, Branch Delay Slot Filling, MIPS, Motorolla 88000, Spark, ISA and Operating Systems
MODULE II
Micro Architecture, Memory Subsystem Architecture, IO Subsystem Architecture
MODULE III
Parallel Processing, Parallelism in Uniprocessor Systems, Organization of Multi Processor Systems, Communication in Multi Processor Systems, Memory Organization, Multi Processor Operating Systems, Parallel Algorithms, Alternative Parallel Architecture
References :
1. John D. Carpinelli, “Computer Systems Organization & Architecture” , Pearson Education
2. P. Pal Chaudhari , “Computer Organization & Design” , PHI


03.506.3 Design of Digital Systems
MODULE I - BASIC CONCEPTS
Hardware Design Environment
VHDL background
Design methodology based on VHDL
Basic Concepts in VHDL
MODULE II - HARDWARE SPECIFICATIONS & DESCRIPTIONS
Structural specifications of hardware
Design organization & Parameterization
Utilities for high level descriptions
Data Flow and Behavioral descriptions
MODULE III - DESIGN
CPU Modeling for discrete design
Interface design and Modeling
VHDL as a Modeling language
Reference :
1. Z. Navabi, VHDL - Analysis and Modeling of Digital Systems - McGraw Hill
2. K. Skahill, VHDL for Programmable Logic - Addison Wesley


03.507 DIGITAL CIRCUITS lab
1 Realization of digital gates
2 Realization of flip-flops
3 Design and implementation of a counter
4 Design and implementation of a shift register
5 Multiplexer / Demultiplexer
6 timer Circuits (using 555)
7 Implementation of Booth algorithm using a Microprocessor Kit
8 Programming the PPI
9 Programming the Programmable Timer
10 Programming the Keyboard/Display Interface


03.508 DATABASE LAB (R,F) 0 – 0 – 4

1 Database Customization
2 Creating Databases/Table spaces
3 Create Objects
4 Moving Data
5 Recovery
6 Locking
7 Preparing Applications for Execution using a front end tool
Application Performance Tool


03.601 COMPILER DESIGN (R,F) 2 – 1 – 0
Module 1
Introduction to compilers and interpreters – Overview of compilation, Issues in compilation – structure of a compiler – compiler writing tools – bootstrapping – notations and concepts for languages and grammars – regular expressions – context free grammar, derivations and parse trees, BNF notations. Context of a lexical analyzer – construction of lexical analyzer, deterministic and non deterministic finite automata.
Module 2
Compile time error handling, error detection, reporting, recovery and repair. Basic parsing techniques – Top down parsing – recursive descent parser, predictive parser simple LL(1) grammar. Bottom up parsers, operator precedence parser, LR grammar, LR(0), SLR(1), LALR(1) parsers.
Module 3
Syntax directed translation schemes, intermediate codes, translation of assignments, translation of array reference, Boolean expressions, case statements, back patching, code optimization, loop optimization and global optimization, sources of sample code generation.
Text books:
1. Principles of Compiler design – Alfred V Aho and Jeffery D Ullman, Addison Wesley
2. Compilers Principles, Techniques and Tools – Alfred V Aho, Revi Sathi, Jeffery D Ullman, Addison Wesley
3. The theory and Practice of Compiler Writing – Jeann Paul Trembly and Sorenson, Mc Graw Hill
Reference
1. Compiler construction-Principles and Practice – Louden, Vikas Publishing Company
Note:
Question papers consist of two parts.
Part A (40 marks) – Compulsory ten short questions (10 x 4)
Part B (60 marks) – Three modules. Students must answer one out of two from each module.


03.602 COMPUTER COMMUNICATION (R,F) 2 – 1 – 0
Module 1
Time Domain and Frequency Domain concepts - Analog & Digital data and signals - Transmission Impairments - Attenuation, Delay distortion, Noise - Different types of noise - Channel capacity - Shannon's Theorem - Transmission media - twisted pair, Coaxial cable, optical fiber, terrestrial microwave, satellite microwave - synchronous and Asynchronous transmission - simplex, half duplex and full duplex transmission.
Module 2
Sampling theorem - Encoding digital data into digital signal - NRZ, Biphase, Multilevel binary - Encoding digital data into analog signals - ASK, FSK, PSK - Encoding analog data into digital signals - PCM, PM, DM - Encoding analog data into analog signals - AM, FM, PM - Multiplexing - TDM, FDM.
Module 3
Error Detecting and correcting codes, Hamming codes, block codes, convolution codes, parity check, CRC, Forward error correction, ARQ techniques - Concepts of Computer communication - point to point, multidrop lines - basic principles of switching - circuit switching, packet switching, message switching.
Text Books :
1. Data and Computer Communications - William Stallings - Maxwell Macmillan Int.
References :
1. Computer Networks – Tanenbaum
Note:
Question papers consist of two parts.
Part A (40 marks) – Compulsory ten short questions (10 x 4)
Part B (60 marks) – Three modules. Students must answer one out of two from each module.


03.603 THEORY OF COMPUTATION (R,F) 2 – 1 – 0
Module 1
Introduction to theory of computation, Finite state automata – description of finite automata, Properties of transition functions, Designing finite automata, NFA, 2 way finite automata, equivalence of NFA and DFA, Mealy and Moor machine, finite automata with epsilon moves, Regular sets and regular grammars, regular expressions, pumping lemma for regular languages, closure properties of regular sets and regular grammars, Application of finite automata, Decision algorithms for regular sets, Minimization of FSA.
Module 2
Chomsky classification of languages, CFGs, Derivation trees, ambiguity, simplification of CFLs, normal forms of CFGs, pumping lemma for CFGs, decision algorithms for CFGs, designing CFGs, PDA – formal definition, examples of PDA, equivalence with CFGs, PDA and CFG, Chomsky hierarchy.
Module 3
Turing machines basics and formal definition, Language acceptability by TM, examples of TM, variants of TMs – multitape TM, NDTM, Universal Turing Machine, offline TMs, Equivalence of single tape and multitape TMs, recursive and recursively enumerable languages, decidable and undecidable problems – examples, halting problem, reducibility.
Text Books :
1. Introduction to automata theory, languages and computation – Hopcroft and Ullman.
References:
1. Mathematical theory of computation – Manna, McGraw Hill
2. Introduction to automata theory and formal languages – Peter Linz, Narosa Publishing
3. Switching and Finite automata theory – Kohavi, Tata McGraw Hill
Note:
Question papers consist of two parts.
Part A (40 marks) – Compulsory ten short questions (10 x 4)
Part B (60 marks) – Three modules. Students must answer one out of two from each module.

03.604 Internet Technology
MODULE I
Web Content Preparation - HTML, DHTML, VRML, SGML, XML and other markup schemes, Images - Compression, Formats, Audio Compression Formats
MODULE II
Content Delivery, Protocols, HTTP and Variance, Internet Servers, Proxy Servers, Search Engines, Content Display - Browsers, Plug-ins, Helper Applications
MODULE III
Interactivity - JAVA, ActiveX, Component Technologies, JAVABEANS, CORBA, Security, Electronic Payment Systems, Firewalls, Encryption, Watermarks, Performance, Benchmarking the Web.
Reference :
1. Andrew S.Tanenbaum, 2002, “Computer Networks”, Fourth Ed., Phi

03.605.1 Perl & Python
module i - Perl Programming
Strings, Numbers, Arrays, Hashes, Pattern Matching, File Access, File Contents, Directories, Subroutines, References and Records, Package Libraries and Modules, Classes, Objects and Tiers, Database Access, User Interfaces, Process Management and Communication, Sockets, Internet Services, CGI Programming Web Automation
module ii - python programming
System Interfaces, GUI Programming, Internet Scripting, databases and Persistence, Data Structures, Text and Language, Integration- Extending Python
module iii - perl to python Migration
References :
1. Tom Christiansen - Perl Cook Book - O'reilly Pub.
2. Mark Lutz - Programming Python - O'reilly Pub.


03.605.2 Software Project Management
Module 1
Product: The evolving role of software-an industry perspective-aging software plant- software competitiveness. Software - characteristics-components-application-crisis on the horizon-software myths.
Process: Process-methods-tools-a generic view of software Engineering-software process models-linear sequential model-proto typing model- RAD model- incremental, spiral, component, assembly and concurrent development models. Project Management concept: People – Product-Process-Project
Module 2
Software process and project metrics: - Measures- Metrics and indicators- Software measurements-metrics for software quality- integrating metrics within the software process.
Software project planning: Planning objectives - software scope-resources-software project estimation-Decomposition Techniques –Empirical estimation models- COCOMO model-automated estimation tools. Risk management: software risks-risk identification-risk projection-risk mitigation, monitoring and management-safety risks and hazards-RMMM plan.
Module 3
Project scheduling and tracking: Basic concepts-relation between people and effort-defining task set for the software project-selecting software engineering task-refinement of major task-defining a task network-scheduling-project plan. Software quality assurance-quality concepts-software reviews-formal technical review-Formal approaches to SQA- software reliability-SQA plan-the ISO 9000 quality standards. Software configuration management: baselines-software configuration item-the SCM process-identification of objects in software configuration-version control-change control-configuration audit-status reporting-SCM standards.
Text Book:
1. Software Engineering – Royson S. Pressman, McGraw Hill International
References:
Software Project management: A unified framework – Walker Royce, Pearson Education
Software Project management in practice – Pankaj Jalote, Pearson Education
Software Project management: A concie study – S A Kelkar, PHI
Software Project management – Mike Cottorell and Bob Hughes
Software engineering – Sommerville I, Addison Wesley
Quality software project management – Robert t Futrell, Donald F Shafer and Linda I
Shafer, Person Education
Note:
Question papers consist of two parts. Part A (40 marks) Compulsory ten short questions (10 x 4). Part B (60 marks) Three modules. Students must answer one out of two from each module.

03.605.3 Software Architecture
MODULE I - ENVISIONING AND CREATING ARCHITECTURE.
The Architecture Business Cycle.
What Is Software Architecture?
A-7E Avionics System: A Case Study in Utilizing Architectural Structures.
Understanding Quality Attributes.
Achieving Qualities.
Air Traffic Control: A Case Study in Designing for High Availability.
Creating the Architecture.
Flight Simulation: A Case Study in an Architecture for Integrability.
Documenting Software Architectures.
Reconstructing Software Architectures.
MODULE II - ANALYZING AN ARCHITECTURE.
The ATAM: A Comprehensive Method for Architecture Evaluation.
CBAM: A Quantitative Approach to Architecture Design Decision Making.
The World Wide Web: A Case Study in Interoperability.
MODULE III - MOVING FROM ONE SYSTEM TO MANY.
Software Product Lines: Reusing Architectural Assets.
CelsiusTech: A Case Study in Product Line Development.
J2EE/EJB: A Case Study of an Industry Standard Computing Infrastructure.
The Luther Architecture: A Case Study in Mobile Applications Using J2EE.
Building Systems from Off-the-Shelf Components.
Software Architecture in the Future.
References:
Len Bass et al. Software Architecture in Practice. Addison Wesley,1998.
Booch,G., Rumbough, J., Jacobson, I., The Unified Modeling Language User Guide, Addison-Wesley, 1999.
Gamma, E.,Helm, R. Johnson, R. Vissides, J., Design Patterns, Elements of Reusable Object-Oriented Software, Addison-Wesley, 1995.
Frank Buschmann et al. Pattern Oriented Software Architecture, Volume 1: A System of Patterns. John Wiley and Sons, 1996.
Shaw, M., and Garlan, D., Software Architecture, Perspectives on an Emerging Discipline, Prentice-Hall, 1996.

03.606.1 Multimedia Systems
Module 1
Multimedia – definition, applications, introduction to making multimedia, multimedia Requirements, multimedia hardware – connections memory and storage devices, Input devices, output hardware, communication devices, multimedia software, basic tools, making instant multimedia.
Module 2
Multimedia building blocks, text, sound, images, animation and video compression techniques, inter frame and intra frame compression. JPEG image compression standard and MPEG motion video compression standards, Fractal compression.
Module 3
Object oriented multimedia, multimedia framework, frame work overview, media, transform, format and component classes; integrated multimedia systems. Multimedia and internet, multimedia on the web, tools for the World Wide Web.
Text books:
1. Multimedia making it work – Tay Vaughan, Tata Mc Graw Hill
2. Multimedia Programming objects, Environments and frameworks – Simon J Gibbs and Dionysios C Tsichritziz, Addison Wesley.
3. Multimedia Systems – John F. Koegd Buford, Addison Wesly.
Note:
Question papers consist of two parts. Part A (40 marks) Compulsory ten short questions (10 x 4). Part B (60 marks) Three modules. Students must answer one out of two from each module.

03.606.2 Computer Graphics
Module 1
Basic concepts in Computer Graphics - Types of Graphic Devices - Interactive Graphic inputs - Basic Raster Scan Graphics - Line Drawing Algorithms - Circle Generation Algorithms - Scan Conversion - frame buffers - solid area scan conversion - polygon filling.
Module 2
Two dimensional transformations - Homogeneous coordinate systems - matrix formulation and concatenation of transformations - Windowing concepts - two dimensional clipping.
Module 3
Introduction to graphics in three dimension - plane projections - vanishing points - specification of a 3D view - introduction to Bezzier curves, B-Splines and surfaces - 3D transformations and clipping - hidden line elimination - shading - Graphical User Interfaces. Introduction to multimedia systems.
Text Books :
1. Computer Graphics – Donald Hearn and M. Pauline Baker
2. Principles of Interactive Computer Graphics - William M. Newman and Robert F. Sproull.
References :
1. Procedural Elements for Computer Graphics – David F. Rogers
2. Multimedia systems – Johm F. Kodgel Buford, Addison Wesley.
3. Multimedia making it works – Tay Vaughan.
Note :
Question papers consist of two parts. Part A (40 marks) Compulsory ten short questions (10 x 4). Part B (60 marks) Three modules. Students must answer one out of two from each module.

03.606.3 Bio Informatics
MODULE I
Biological classification and nomenclature, Use of sequences to determine phylogenetic relationships, Searching for similar sequences in databases: PSI-BLAST, Introduction to protein structure, Protein structure prediction and engg. Clinical implications
MODULE II
Genome organization and evolution, Genomics & proteomics, Eavesdropping on the transmission of genetic information, Picking out genes in genomes, Genomes of pr-karyo types, Genomes of eu-karyotypes, The genome of homo sapiens , Single-nucleotide polymorphisms, Genetic diversity in anthropology, Evolution of genomes
MODULE III
Archives and information retrieval, Introduction, The archives, Gateways to archives, Assignment of protein structures to genomes, Prediction of protein function, Drug discovery and development.
Reference:
Arthur M Lesk, “Introduction to BioInformatics”, Oxford University Press.


03.607 Internet lab
1. Creating a Web page and deploying in a web server.
2. Converting a XML document to HTML.
3. Creating an object in VRML and deploying in a web server.
4. Parsing an XML document using DOM.
5. Writing a simple Web Client.
6. Writing a simple Email Client.
7. Configuring a web server.
8. Configuring a proxy Server.
9. CORBA
10. RMI


03.608 Mini Project
The student should be motivated to design and implement a small software product based on the topics he /she has learnt. The software design should be based on Object Oriented Techniques. An User Interface Exhibition should be conducted in the mid semester and the product should be evaluated at the end of the semester.
In the University Examination the expertise of the student for the User Interface Design will be evaluated.

03.701 COMPUTER NETWORKS (R,F) 3 – 1 – 0
Module 1
Introduction – Uses – Network Hardware – LAN –MAN – WAN – Wireless networks, Inter networks – Network Software – Protocol hierarchies – Design issues for the layers – Interface & Service – Service Primitives. Reference models – OSI – TCP/IP.
Physical layer – ISDN Services – Broad band ISDN – Narrow band ISDN ATM Networks – ATM Switches – Data Link layer Design Issues – Error & Error Detection & Correction – Flow Control Example Data link Protocols. HDLC DLL in Internet – DLL in ATM.
Module 2
MAC Sub layer – IEEE 802 FOR LANs & MANs 802.3, 802.4, 802.5 & 802.6 Bridges – High Speed LANs – FDDI.
Module 3
Network layer – Routing – Shortest path routing – Flooding – Flow based Routing – Routing for mobile hosts – Congestion control algorithms – Internetworking – Network layer in internet & ATM. Transport Layer – Elements of Transport Protocol – TCP & UDP. ATM adaptation layer – application layer – Cryptography. DNS, SNMP – Electronic mail – World Wide Web.
Text Books:
1. Computer Networks – Andrew S Tanenbaum, PHI.
2. Computer Networks and Internets – Douglas, Addison Wesly.
References:
1. Data and Computer Communications – William Stallings, PHI.
2. Hand book of Computer Communications Standards, Volume 1 – Willman Stallings, PHI.
3. An Engineering Approach to Computer Networks – Keshav, Addison Wesley.
Note:
Question papers consist of two parts.
Part A (40 marks) – Compulsory ten short questions (10 x 4)
Part B (60 marks) – Three modules. Students must answer one out of two from each module.



03.702 Internetworking
MODULE I
Internet Architecture, Addresses, Classify Internet address, Mapping Internet addresses to physical addresses (ARP Determining an Internet address at start-up. (RARP) Connections Datagram delivery- Routing IP datagrams, Error and Control messages, Class and Subnet address Extensions, Protocol Layering, User datagram Protocol. Reliable Transport Service.
Module II
Routing-Cores, Peers and algorithms- Exterior gate way Protocols and autonomous systems (BGP). Routing in an autonomous system (RIP, OSPF, HELLO)-Internet multi casting, TCP/IP user ATM networks, Mobile IP, private network interconnection. Client and server Model of interaction socket interface. Boot strap and auto configuration.
Module III
Applications, DNS, Telnet, Rlogin, FTP,TFTP, NFS, Email (SMTP, POP, IMAP, MIME),WWW (HTTP),Voice and Video user IP (RTP), Internet (SNMP)
Reference:
D.E. Comer,” Internetworking with TCP/ IP, Principles, Protocols and Architectures” VOL1.2002


03.703 Software Testing
module i
Tacking the testing Maze, Test Outlines, From Test Outline to Test Cases
Module ii
Using tables and Spreadsheets, Other Types of Tables , OO Testing, Web testing
Module III
Reducing the number of Test Cases, The Rest of the Test Cycle, Test Documentation, Improvements and Industry Standards.
Reference :
Louise Tamres, “Introducing Software Testing “, Pearson Education Asia


03.704 Web Applications Development
MODULE I
Developing applications
Creating Java Applications, Creating HTML resources, Creating Web applications with dynamic content
Database applications
Database connectivity, SQL Wizard & SQL Query Builder, Stored procedures, Accessing databases from applications
Module II
Testing and Deploying Web applications
Server Instances & server configurations, Testing and Debugging applications, Deploying Web applications
Module III
Profiling & Team Programming
Plug-ins development
Reference :
Osamu Takaglwa et.al, “ Web Sphere Studio Application Developer Programming Guide” IBM.Com/red Books

03.705.1 Enterprise Resource Planning
MODULE I
Introduction to ERP, Evolution of ERP, What is ERP? Reasons for the growth of ERP, scenario and justification of ERP in India, Evaluation of ERP, Various modules of ERP, advantages of ERP. An overview of Enterprise, Integrated Management Information, Business Modeling, ERP for small Business, ERP for make to order companies, Business process mapping for ERP module design, Hardware Environment and its selection for ERP implementation
MODULE II
ERP and Related Technologies, Business Process Reengineering (BPR), Management Information System (MIS), Executive Information System (EIS), Decision Support System ( DSS),Supply chain management(SCM).ERP modules, Introduction, Finance Maintenance, Quality Management, Materials Management. ERP Implementation Life cycle, Issues in implementing ERP packages, pre- evaluation Screening, package Evaluation, Project Planning Phase, Gap Analysis, Reengineering, Configuration, Implementation, Team Training, Going Live, End – User Training, Post Implementation (Maintenance Mode).
MODULE III
Vendors, Consultants and users, In –house Implementation-Pros and cons, Vendors, Consultants, End users, Future Directions in ERP, New Markets, New Channels, Faster Implementation Methodologies, Business models and BAPIs, Convergence on Windows NT, Application platforms, New Business Segments, More features, Web enabling, Market Snapshot.
References:
1. S. Sadagopan, ERP- “A Managerial Perspective”, Tata McGraw Hill
2. User manuals of SAP R/3
3. User manuals of BAAN VI
4. Alex Leon , “Enterprise Resource Planning”, Tata McGraw Hill


03.705.2 Optical Networks
module i - Introduction.
The Telecommunications Infrastructure. Characteristics of Optical Fiber. Emission (ASE). Chromatic Dispersion. Polarization-mode Dispersion (PMD). Lasers. Timing and Synchronization. SONET and SDH.
module ii
Architecture of Optical Transport Networks (OTNs). Wavelength Division Multiplexing (WDM). Network Topologies and Protection Schemes. MPLS and Optical Networks. Architecture of IP and MPLS-based Optical Transport Networks. The Link Management Protocol (LMP).
module iii
Optical Routers: Switching in Optical Internets. ATM vs. IP in Optical Internets. Optical Internets: Evolving to a 3G Architecture.
Reference :
Uyless Black, “Optical Networks”, Prentice Hall, PTR.

03.705.3 Mobile Computing
Module I
Overview of the emerging field of mobile computing; Historical perspectives (mainly from the perspective of radio); Land mobile vs. Satellite vs. In-building communications systems; RF vs. IR; Cellular telephony; Mobility support in cellular telephone networks; Personal Communications Systems/Personal Communications Networks; Wireless local area networks; Direct Broadcast Satellite; Low Earth Orbiting Satellites
Module ii
Communications Spectrum allocation and characteristics; 850 MHz cellular telephone; 902-928 MHz ISM Band; 1.8 GHz PCS band; 2.4 GHz ISM band; Characteristics of higher frequencies, especially 5 GHz, 20 GHz, 40 GHz and beyond; Simplified mobile radio environment: propagation characteristics, signal loss, multi path fading, interference; Design countermeasures: design margins, diversity, coding, equalization, and error correction; Channel concept; Frequency division, time division, spread spectrum; Spectrum efficiency issues; Frequency reuse/cellular/micro cellular concepts including sectorization and cell splitting
Module iii
Networking Cellular telephony as a case study in network support: hand-off, mobility, roaming, billing/authorization/authentication; Design decisions in European GSM, U.S. Digital TDMA, and U.S. Digital CDMA from the systems perspective; Interplay of channel characteristics (e.g., power vs. bit error rate, multipath fading) and network protocol design; Media access methods: Aloha network/carrier sense methods, Karn's MACA for packet radio; Packet radio schemes; Survivable network design; Mobile IP proposal and variations; Cellular Digital Packet Data (CDPD) standard; Satellite systems: low-earth orbiting systems; Symmetric vs. asymmetric communications schemes; Broadcast and multicast communications in a wireless context; Direct Broadcast Satellite systems; Description of commercially available wireless local area networking products
Reference:
Vijay Garg, Joseph Wilkes, Wireless and Personal Communications Systems, Prentice-Hall, Englewood Cliffs, NJ, 1996.

03.706.1 embedded systems
Module 1
Fundamentals of embedded systems- complex systems and microprocessors-
Embedded system design process – requirements- specifications- architecture design- design of hardware and software components- structural and behavioral description-
CPUs - i/o devices- i/o primitives- busy wait i/o- interrupts- supervisor mode- exception- traps- co-processors- caches- memory management- CPU performance.
Process and OS – multiple tasks- context switching- scheduling policies-, inter process- communication mechanisms - Design examples.
Module 2
Embedded computing platform – CPU bus, memory devices- i/o devices- component interfacing- designing with microprocessor- Design & analysis of programs-Data flow graphs- basic compilation techniques- analysis & optimization of execution time- program size - Validation and testing- Design examples.
Module 3
Micro controllers and embedded systems- micro controller families- 8051 micro controller-history- architecture- register banks and stack- instruction set- addressing modes- Programming- 8051 interrupts- interfacing 8051 to the keyboard.
Text books
1. Computers as components-principles of Embedded computer system design -
Wayne Wolf, Morgan Kaufmann
2. The 8051 micro controller and Embedded Systems - Muhammed Ali Mazidi, Janice Gillispie Mazidi, Pearson Education
References:
1. Fundamentals of Embedded system software - Daniel W Lewis, Pearson
Education
2. Embedded system design - Steve Heath, Butter worth-Heinemann
3. Embedded system Design -Arnold. S. Berger - CMP Books
Note:
Question papers consist of two parts. Part A (40 marks) Compulsory ten short questions (10 x 4). Part B (60 marks) Three modules. Students must answer one out of two from each module.


03.706.2 real time systems
module i
Architecture for computer Control Systems : Centralizes Architecture, Distributed Computer Control Architecture, Data High Way System, Digital Control Algorithms, Introduction to Computer Control, Self Tuning & Adaptive Algorithms, Supervisory Control Systems, Introduction , Multi-layer Hierarchical Structures, System Decomposition, Open - loop Coordination and parameter estimation (ISOPE), Double Interactive strategies, Illustrative example.
Module ii
Construction of software for real time computer control system : Introduction, Problems of real time software construction, Design techniques and tools, MASCOT, Structures of Development of real times systems, Dependability, fault detection and fault tolerance, use of redundancy, fault tolerance in mixed hardware - software systems, fault detection measures, fault detection mechanisms, Damage containment and assessment, Provision of fault tolerance. Languages for real time control : Basic requirements, Software components, Creation and management of tasks, Interrupts and device handling, Communication between software components, Mutual exclusion, Exception handling, Expert systems in real time, Applications of knowledge based systems for process management.
Module iii
Real Time Operating Systems : Real Time Multitasking Operating Systems, Task Management, Task Scheduling and Dispatch, Task Co-Operation and Communication, Producer Consumer Problem, Distributed Processing : Distributed data, Distribute Control, Computer Aided Control System Design : Personal Computer Software Packages for Control System Design : An Introduction, Modeling sand simulation, Control System Analysis and Design Package, System Identification,, PC-MATLAB and PC-MATLAB based software packages : An Introduction, Basics of MATLAB, Matrix Operations and functions, Relational and Logical Operations, Vectors and subscript, Control Flow Constructs, M Files and Functions, Other Features, Control System Toolbox, System Identification Tool Box, Multivariable Frequency Domain Toolbox, Turning methods
Reference :
1 S S lamba & Y P Singh, “Distributed Computer Control Systems”
2 Sylvia Goldsmith, “Real Time Systems Development”, Prentice Hall, 1993
3 Ian Pyle, Peter Hruschka, et al, “Real Time Systems” , Wiley Series, 1993


03.706.3 network programming
Module I
Internet Protocol, The structure of TCP ?IP software in an operating system, Network interface layer, Address Recovery and binding global, Software organization, Routing table and Routing algorithm, Fragmentation and reusability of data-grams, Error processing, Multi cast processing, User datagrams.
Module II
TCP- Data structures and Input processing. Finite state machine implementation, Output processing timer management, flow control and adaptive retransmission, Urgent data processing and the push function, socket level interface, active Route propagation and Passive acquisition, Route propagation with an SPF algorithm.
Module III
Simple network management protocol. MIB variables, representations and binding, client and server, Table access functions.
Reference:
D.E. Comer and D.L Stevens-“ Internetworking with TCP / IP. Vol II. Design, Implementation and Internal.”


03.707 Computer Networks Lab
1. Configuring router interfaces.
2. Configuring routing protocols.
3. Configuring switches, VLAN’s, ISL and VTP
4. Backup and Recovery
5. IPX Routing
6. Access Control
7. Configuring PPP.
8. Configuring Frame Relay



03.708 Seminar / Project Design
A student should present a seminar of 15 minutes of duration on any one of the emerging topics in Information Technology with the guidance of a faculty member of the department.
A student along with other team members and under the supervision of a faculty member should identify a problem for the final year project. It should be based on the core subjects of the discipline. The design of the project should be carried out in this semester. An evaluation should be conducted at the end of the semester.
The weightage of the seminar and project design will be 1:1.


03.801 Enterprise networking
Module I
Digital Transmission Technology in Corporate Networks : Networking in the 1990’s, Market size and Time Windows, Broadband at the Office/Campus level, Broadband at the Metropolitan - Area level, Existing High speed Dedicated Wan Services, Existing High - Speed Switched Wan Services, Engineering High Speed Point to Point fractional DSI/TI systems - A telephony view, User Perspective of DSI/TI connectivity. Point to Point fractional DSI/TI systems: FT1 Network Configurations, Channel bit layout, Network Management issues, FT1 marketplace, FT1 equipment, FT1 interchange carriers, Cost Considerations for inclusion of FT1 in private networks, Hubless DDS SWITCHED DSI and SWITCHED FRACTIONAL DSI/TI SYSTEMS: Switched DSI network configurations, Cost effectiveness issues, Switched 56 service, Inverse Multiplexing, some theoretical consideration in the general attractiveness of a switched service.
Module II
Channel Banks and Digital Cross - Connect systems: Channel Banks, Digital Cross connect systems, Managing Disasters - Communications Tools and Techniques. TI Multiplexes: TI Multi-plexer functions, Technical aspects of TI Multiplexes. Multiplexers type, commercial products, equipment trends, corporate backbone network switches and fast packet switching technology, market issues CENTRAL OFFICE - BASED MULTIPLEXING: Service description, example of service using CSUs to support subtract channel and CPBM carrier of TI Multiplexers, Disaster Recovery Application Example of usage large bank, bandwidth reservation, standards for subnet Multiplexing.
Module III
POINT TO POINT DS3/T3 Systems: DS3 frame formats, DS3 Electrical characteristics, DS4NA signals, User application, SONET Evolution, Carriers Motivations, Key SONET, ISDN and BISDN technologies and services: ISDN, BISDN, Near team ATM services.
FRAME RELAY TECHNOLOGY and SERVICES: background, Basic Frame Relay and call relay concepts, benefits of frame relay protocols, and standards, implementing frame relay in a private corporate network, frame relay equipment, Carrier Services, Frame relay product availability, the issue of traffic burstiness. SMDS concepts, SMDS service, MAN standards in support of SMDA, SMDA development.
References :
Daniel Minoli, Enterprise Networking, Artcech House - 1993


03.802 E-COMMERCE
module I. INTRODUCTION TO E-COMMERCE
E-commerce Business Models and Concepts.
Major Business-to-Consumer (B2C) Business Models.
How the Internet and the Web Change Business: Basic Business Concepts.
TECHNOLOGY INFRASTRUCTURE FOR E-COMMERCE.
The Internet and World Wide Web: E-Commerce Infrastructure.
Internet II: The Future Infrastructure.
Building an E-commerce Web Site.
Choosing Server Software.
Choosing the Hardware for an E-commerce Site.
Other E-commerce Site Tools.
Security and Encryption.
The E-commerce Security Environment.
Security Threats in the E-commerce Environment.
Technology Solutions.
Policies, Procedures, and Laws.
E-Commerce Payment Systems.
Credit Card E-commerce Transactions.
E-commerce Digital Payment Systems in the B2C Arena.
B2B Payment Systems.

module ii - BUSINESS CONCEPTS AND SOCIAL ISSUES.
E-commerce Marketing Concepts.
Consumers’ On-line: The Internet Audience and Consumer Behavior.
Basic Marketing Concepts.
Internet Marketing Technologies.
B2C and B2B E-commerce Marketing and Branding Strategies.
E-commerce Marketing Communications.
Consumers Understanding the Costs and Benefits of On-line Marketing Communications.
The Website as a Marketing Communications Tool.
Social, Legal and Ethical Issues in E-commerce.
Privacy and Information Rights.
Intellectual Property Rights.
Governance.
Public Safety and Welfare.
module ii - E-COMMERCE IN ACTION.
Retailing on the Web.
The Retail Sector.
Analyzing the Viability of On-line Firms.
On-line Service Industries.
The Service Sector: Offline and Online.
Online Financial Services.
Online Travel Services.
B2B E-commerce and Supply Chain Management.
Net Marketplaces.
Auctions, Portals and Communities.
Auctions.
E-commerce Portals.
Online E-commerce Communities.
Online Content Providers: Digital Media.
Online Content.
The Online Publishing Industry: Newspapers, Books, and Magazines.
The Online Entertainment Industry.

03.803 E-security
Module I
Security in Computing
Elementary Cryptography
Program Security
Module II
Protection in General
Purpose Operating Systems
Designing Trusted Operating Systems
Database Security
Module III
Security in Networks
Administering Security
Legal, Privacy & Ethical issues in Computer security
Reference:-
Charles P Pfleeger, Shari Lawrence, Pfleeger, "Security in Computing", Pearson
Andrew Nash, Derek Brink, Bill Duane, 2001,PKI: Implementing and Managing E Security, Mc Graw Hill.


03.804 DISTRIBUTED SYSTEMS (R,F) 2 – 1 – 0
Module 1
Characteristics of distributed System: Examples of distributed systems – resource sharing and web – world wide web – issues in the design of distributed system. System models: Architectural models and fundamental models. Networking and internetworking: Types of network – network principles – internet protocols
Module 2
Interprocess communication : the API for internet protocol – external data representation and marshalling – client server communication - group communication- case study: inter process communication in Unix. Distributed objects and remote invocation: communication between distributed objects – remote procedure call – Events and notification. Operating system support: Operating system layer – protection – processes and threads- communication and invocation – Operating system architecture security: Overview of security techniques
Module 3
Distributed file system: File service architecture - network file system- Andrew file system-recent advances Transactions and concurrency control: nested transactions-locks-optimistic concurrency control-comparison of methods for concurrency control-flat and nested distributed transactions- distributed deadlocks- transactions recovery. Replication System model and group communication- fault tolerant services-transactions with replicated data
Text Book:
1. Distributed Systems: Concepts and Design – George Coulouris, Jean Dollimore
and Tim Kindberg, Pearson Education
References:
1. Distributed Systems: Principles and paradigms – Andrew S Tanenbaum and
Maarten Van Steen, Pearson Education
2. Distributed Systems and Computer Networks – Morris Solomon and Jeff Krammer, PHI
Note:
Question papers consist of two parts.
Part A (40 marks) – Compulsory ten short questions (10 x 4)
Part B (60 Marks) – Three Modules. Students Must Answer One Out Of Two From Each Module.

03.805a. Cryptography
MODULE I - Introduction to cryptology
Cryptography and cryptanalysis, Aspects of security, Crypt-analytic attacks. Classical CIPHER SYSTEMS. Introduction, Transposition Ciphers, Substitution Ciphers, The Hagelin machine, Statistics and cryptanalysis. The Information Theoretical Approach. The general scheme, The information measure and absolute security, The unicity distance, Error probability and security, Practical security.
MODULE II - THE DATA ENCRYPTION STANDARD
The DES algorithm, Characteristics of the DES, Alternative descriptions, Analysis of the DES, The modes of the DES, Future of the DES, IDEA (International Data Encryption Algorithm). Shift Registers. Stream and Block enciphering, The theory of finite state machines, shift Registers, Random properties of shift registers sequences, The generating function, Crypto analysis of LFSRs, Non-linear shift registers. Public Key Systems. Introduction, The RSA system, The Knapsack system, Cracking the Knapsack system, public key systems based on elliptic curves.
MODULE III - AUTHENTICATION AND INTEGRITY
Protocols, Message integrity with the aid of Hash functions, Entity authentication with symmetrical algorithm, Message authentication with a message authentication code (MAC), Message authentication with digital signatures, Zero - knowledge techniques. Key Management and Network Security. General aspects of key management, Key distribution for asymmetrical systems, Key distribution for symmetrical algorithms, Network security, Fair cryptosystems
Reference:
“Basic method of cryptography”, Jan C. A.VAN DER LUBBE, CAMBRIDGE UNIVERSITY PRESS


03.805b. Virtual Reality Systems
1. Introduction, VR-the medium, Interface to the virtual world, Input, Output
2. Rendering the virtual world, interacting with the virtual World.
3. The virtual reality experience, Experience Design, The future of virtual reality.
Reference:
“Understanding Virtual Reality, Interface” , Application and Design by William R. Sherman, Morgan Kaufman Publisher


03.805c CLIENT SERVER PROGRAMMING
MODULE I. THE CLIENT
Client Server model, Concurrent Processing, Program Interface to Protocols, Socket interface, Client Software Design - Example, Concurrency in clients
MODULE II The Server
Server Software Design, Interactive Connectionless and connection Oriented Servers, Concurrent Connection Oriented Servers, Single Process Concurrent Servers, Multi-protocol Servers, Multiservice Servers, Uniform, Efficient Management of Server Concurrency
MODULE III Applications
Tunneling at the transport and applications levels. Application Level gateways, External data representation, Remote Procedure call, Distributed program Generation, Network File System, Mount, Telnet.
Reference :
D.E Comer and D L Stevens, Internetworking with TCP/IP Vol III, PHI

03 806a Distributed Databases
module i - Architecture and design
Distributed DBMS Architecture
Distributed Database Design
Semantic data Control
Module II - Query and transaction management
Overview of Query processing
Query Decomposition and data localization
Optimization of distributed queries.
Introduction to transaction Management
Distributed concurrency control
Distributed DBMS reliability
Module III - New trends
Parallel database systems
Distributed Object database management systems
Database Inter Operability
Concurrent Issues - warehousing, www, push based technologies, mobile databases
Reference :
Tamer Ozsu, “Principles of Distributed Database systems II edition” Prentice Hall

03.806. b Datamining & Warehousing
Module I
Introduction, Role of logic and probability in data mining. Foundations of pattern clustering: Theorem of the Ugly Duckling, abstraction and similarity. Clustering paradigms, Clustering for data mining.
Module II
Inductive logic programming and knowledge discovery. Integrating inductive and deductive reasoning for data mining.
Module III
Data mining using neural networks and algorithms. Fast discovery of association rules. Discovery of frequent episodes. Applications of Data mining to pattern classification.
Reference:
U. M. Fayyad, G. P. Shapiro et.al,” Advances in Knowledge Discovery and Data mining” , MIT press, Cambridge, 1996.

03.806.c Object Oriented Data Base Systems

module I. SYSTEMS ARCHITECTURE.
Introduction. Object-Oriented Data Integration: Running Several Generations of Database Technology in Parallel. Introduction. Integration Frame. Programmer’s View. Layered Model. Object Layer. Tuple Interface. Some Performance Considerations. Product Categories. Remote Database Access Products. Objectified Relational Databases. Federated Databases. Object-Oriented Databases with Relational Gateways. Object-Oriented Access Layers. Object-Relational Databases. Case Study: Persistent Objects in a Large Bank. Situation, Requirements and Software Environment. Why Products Failed in 1995. Our Architecture. Experiences and Summary. References
A Database Access Layer for ODBMS? The Architecture. Database. Transactions. Error Management. Interface to the Application Kernel. Filters and Iterators. Referencing Transient Objects. Software Production Environment. Experiences and Summary. References.
A Use of the End Game Design Strategy.
Introduction. Design a Persistent Account Class. The Simple Problem. The Harder Problem. The End Game Design Technique (“squeegee”).
Application of the End Game Strategy. Move 0: Problem Setup-Identify the Possible Area of Containment. Move 1: Secure the End-Client’s Interface. Move 2: Secure the Workstation Object’s Internal Design. Move 3: Secure the Distribution Service. Move 4: Secure the Server’s Internal Design. Results of Applying the EndGame Technique. How Would One Decide It Is Time to Try EndGame? Comparison of EndGame with Other Design Strategies.
Building a Push-Based Information System Using an Active Database.
Introduction. Related Work. Design Rationale. Predicate Maintained Collections. Using Predicate Maintained Collections. An Example. Experiences and Summary.
Module II. APPLICATIONS AND DESIGN.
Introduction. Flight-Simulator Database: Object-Oriented Design and Implementation. Introduction: Why Object-Oriented Flight Simulator Technology? Computing Infrastructure. Complex Objects: Airplane Model. Type Constructors: Airport Model. Polymorphism and Covariance. Control System Modeling. Behavioral Modeling: Aerodynamics. Queries. Persistence and Dynamic Binding. Constraints and Triggers. Analysis.
An Object-Oriented Image Database For Biomedical Research. Problems to be Solved. Image Boss System Overview. Software and Hardware. Various Applications and Tools Implemented. Image Boss Design. Data Abstraction. Class Hierarchy.
Future Design Plans. Justification For Selecting OODB. Problems Encountered. Integration of Other Tools. Archiving. Filename Translation. Locking. Queries. Server Crashes. Primary Applications of Image Database.
The OSEF (Object-Oriented Software Engineering Flow) Framework. OSEF Architecture. General Criteria. Software Development Method. Bought Components. CASE Tool. Database Management System. Source Code Administration Tool. Debugging and Tuning Tools. GUI Builder. Built Components. Framework Class Library. Rational Rose Metaschema Model. Perl Filters and Preprocessors. OSEF Runtime Kernel and Application Control Interface. The Development Cycle. Step A: Modeling. Step B: Implementation. Rational Rose/C++. Diagrams. Exportation/Importation of Items. Code Generation Property Sets. Preserved Code Regions. Tool Evaluation. Release History. Objectivity/DB. Data Definition Language. Storage Classes. References and Handles. Iterators. Associations.
Variable-Size Arrays. Physical Clustering of Objects. Indexes. Transactions and Locking. Objectivity/DB Classes in the OSEF Rose Metaschema Model. Database Architecture of OSEF Applications. Performances and Tuning. Evaluation.
Release History. Database Browsing and Inspection. Unused Features. Using Objectivity/DB in an Application for Configuration Management.
Configuration Managers and Object-Oriented Databases. Requirements of a Configuration Manager. Database Requirements. Using Objectivity/DB to Get an Implement a Configuration Manager. Organization of a Federated Database and Related Limits. The Proposed CM Model. Main Design. The CM Schema. Modeling Information Inside Associations. Final Considerations about Objectivity/DB. Automatic Association Generation in Versioning. Propagation Property of Associations. Evaluation of the CM model. Identification of the Configuration Elements. Change of Configurations. Status Accounting. Granularity. Support in Views. Using an OODB for an MIS Application. Pc-plus and its Products. A Directory Assistance Call Scenario. The MIS Application. Using VERSANT for MIS. MIS Architecture. Why VERSANT? The OODB’s Impact on the Architecture. Software Development Using the OODB.
Building a Multi-Petabyte Database-the RD45 Project at CERN. Introduction. The RD45 Project. Object Databases and Standards. Choosing an ODBMS. The ODBMS Market. HEP Event Data. Data Production and Analysis. Early Prototyping. Software Production Use of an ODBMS for HEP Event Data. The Interface to Mass Storage Systems. Performance and Scalability Measurements. Possible Storage Hierarchy. Use of Very Large Memories.
An Astronomer’s View of Object-Oriented Databases. Introduction. The Sloan Digital Sky Survey. The SDSS Archives. The Data Products. Typical Queries. Archive Architecture. Platforms, Tools, Libraries. Geometric Concepts.
module III. OBJECT DATABASE SELECTION AND MIGRATION.
Introduction.
On Acquiring OODBMS Technology: An Industry Perspective and a Case Study Comparison of Objectivity/DB and VERSANT. Introduction. Industry Perspective. The Application. ODMG Standard. VERSANT. Design. Query Capability. Objectivity/DB. Design. Query Capability. Comparison. Modeling Battlefield Sensor Environments: An Object Database Management System Case Study. Introduction. Data Model. User Interface. Database Management System. Transaction Processing in the Capital Markets. Introduction. Technology Product Set. Relational or Object Database? Relational Databases. Object Databases. Object-Relational Database Management Systems. The Selection for Aurora. ODBMS Selection. Architectural Overview. Language Binding. Building an Object Database Adapter. Approaches to Evaluating an ODBMS. Experiences with Three ODBMSs. GemStone. ObjectStore for Smalltalk. Objectivity/Smalltalk. Experiences and Summary. References. 15 Migration Process and Consideration for the Object-Oriented Vector Product Format to ObjectStore Database Management System.
Introduction. ODBMS Integration. Why Use an ODBMS? ODBMS Concepts. ObjectStore. OVPF Design. Introducing Object-Oriented Class Diagrams and Terms. Metadata Classes and Instances. Database Implementation. Persistent Object Webs in OVPF. ObjectStore.
pERFORMANCE.
Introduction.
Performance Tuning Considerations and Required Tools for an OODB Application. Abstract. Description of the Application. Performance Criteria. Application System Tuning. Application Tuning Factors. Application/OODB Tuning Factors. OODB Tuning Factors. Application/OODB Monitoring.
Performance Evaluation and Optimization for a Financial OODB Application. Introduction. Database Access Types. General Directions. Where to Optimize. What to Look For. Levels of Collecting Statistical Data. Transaction Level. Use Case Level. Performance
Analysis Tools. UBS Transaction Monitor and Perl Scripts. Object Store Performance Expert (OPE). Optimization Areas. Use Object References, Not Foreign Keys. Select Appropriate Transaction Boundaries. Reuse Instances to Avoid Frequent Object Creation and Deletion. Indexes for Associative Accesses. Extent Queries. Reduce Data Transfer for the GUI. Object Clustering. A Subjective View of Objectivity/DB. Federation-Wide Indexing in Objectivity. Background. Approaches Considered. Skip List Algorithm. Making It Generic. Benefits. Costs. Encapsulation of a Database Product to Achieve Vendor and Application Independence. Application Independence. Vendor Independence. Why Choose ODMG as the Model? Costs. Creating a Model to Fit the Underlying Database Architecture. Choosing a Database-Academic Comparison Versus Real-Life Usage. Evaluating a Product. Understanding Your Own Requirements.

03.807 Web Applications Lab
1. Implement Web applications using Servlets, HTML and JSPs and deploy.
2. Test the application on an Application Server.
3. Debug Web applications locally and remotely.
4. Developing applications in a team environment.
5. Retrieval of data from database using SQL and exchange information in XML format.


03.808 Project and Viva Voce
The project should be based on the core subjects of the discipline. The work can be carried out in the department under the supervision of a faculty member or with the help of an external organization. In the latter case, the motivation of the organizations should be purely academic and they should provide an external guide whose qualifications should be in par with that of a faculty member. An internal guide, will be consistently interacting with the external guide and monitoring the progress of the project. There should be a mid semester and end semester evaluation of the project. The student has to submit a thesis in the prescribed format, in triplicate, duly certified by the internal guide and external guide( if any)
The viva voce will be based on the project , seminar and the whole curriculum giving weightage in the ratio 2:1:2 respectively.