SCHOOL OF COMPUTING SCIENCES

B.Tech. Information Technology

CURRICULUM & SYLLABI [Regulations -2005]

VIT
Vellore Institute of Technology
DEEMED UNIVERSITY VELLORE – 632 014 Tamil Nadu

A Place to Learn; A Chance to Grow

III SEMESTER Subject Code 05BIT 201 05BIT 203 05BIT 205 05BIT 207 05BIT 209 05BIT 211 05BIT 213 L 05BIT 215 L Subject Complex Variables And Partial Differntial Equations Data Structures And Algorithms * Electronic Devices & Circuits * Introduction To Information Technology Digital Computer Fundamentals * Object Oriented Programming * Object Oriented Programming Lab Electronic Devices Lab TOTAL IV SEMESTER Subject Code 05BIT 202 05BIT 204 05BIT 206 05BIT 208 05BIT 210 05BIT 212 05BIT 214L 05BIT 216L Subject Probability, Statistics and Reliability * Computer Architecture and Organization * Microprocessor & Interfacing Techniques * Theory Of Computation * Programming In Java Management Of Information Systems *** Java Programming Lab Microprocessor Lab TOTAL V SEMESTER Subject Code 05BIT 301 05BIT 303 05BIT 305 05BIT 307 05BIT 309 05BIT 311 05BIT 313 L 05BIT 315 L Subject Discrete Mathematical Structures * Data Base Management System * Operating Systems * Computer And Communication Networks Software Engineering * System Programming RDBMS Lab Operating System Lab Project TOTAL L 2 3 3 3 3 3 T 1 0 0 0 0 0 P C 3 3 3 3 3 3 2 2 2 24 L 2 3 3 3 3 3 T 1 0 0 0 0 0 P C 3 3 3 3 3 3 2 2 22 * L 2 3 3 3 3 3 T 1 0 0 0 0 0 P C 3 3 3 3 3 3 2 2 22

4 4

4 4

4 4

2

VI SEMESTER Subject Code 05BIT 304 05BIT 306 05BIT 308 05BIT 310 05BIT 312 05BIT 314 L 05BIT 316 L Subject ELECTIVE I Object Oriented Analysis And Design Mobile Communication ** Internet Components And Programming Software Reliability And Quality ** Network Programming Networking Lab Internet Components And Programming Lab Inplant Training Project TOTAL VII SEMESTER Subject Code 05BIT 401 05BIT 403 05BIT 405 05BIT 407 05BIT 413 L 05BIT 415 L Subject Multimedia Computing Computer Graphics Network Administration Data warehousing and Data Mining ** ELECTIVE II ELECTIVE III Multimedia And Graphics Lab Network Administration Lab Comprehensive Exam Project TOTAL VIII SEMESTER Sub Code 05BIT 402 Project TOTAL Subject L T P C 28 28 L 3 3 3 3 3 3 T 0 0 0 0 0 0 P C 3 3 3 3 3 3 2 2 2 6 30 L 2 3 3 3 3 T 1 0 0 0 0 4 4 P C 3 3 3 3 3 2 2 2 4 28

4 4 18 0 8

3

ELECTIVE I 1 05BIT E02 2 05BIT E04 3 05BIT E06 4 05BIT E08 5 05BIT E10 6 05BIT E12 7 05BIT E14 3 Resource Management Real Time Systems Distributed Database Systems Soft Computing Internet Working & Technologies Basic Bio-Informatics Distributed Computing 0 3 ELECTIVE II (FREE ELECTIVES) 1 05BIT E01 Image Processing 2 05BIT E03 Computer Simulation & Modeling 3 05BIT E05 Neural Networks 4 05BIT E07 Digital Signal Processing 5 05BIT E09 Artificial Intelligence 6 05BIT E11 Embedded Systems 7 05BIT E13 Decision Support System 3 0 3 ELECTIVE – III (SCHOOL SPECIFIC ELECTIVES) 1 05BIT E15 Software Project Management 2 05BIT E17 Network Security 3 05BIT E19 Software Architecture 4 05BIT E21 Web Services 5 05BIT E23 Pattern Recognition * COMMON BETWEEN CSE & IT ** SCHOOL SPECIFIC ELECTIVES ***FREE ELECTIVES 3 0 3 4 .

CAM-1 portion Functions of a Complex Variable: Functions of a complex variable. linear transformations (w = zA+B. w = z 2 . Vibrations of a circular membrane Diffusion equation in Cartesian and Cylindrical coordinates. Taylor and Laurent series(without proof's) singularities – zeros – Poles.05BIT 201COMPLEX VARIABLES AND PARTIAL DIFFERNTIAL EQUATIONS * L T P C 2 1 0 3 Aim & Objectives: The aim of this course is to present a comprehensive. compact and integrated treatment of two most important branches of applied mathematics for engineers and scientists namely (i) The functions of complex variable and (ii) Partial differential equations in finite and infinite domains. Analytic and Harmonic functions – Complex potential – Applications to flow around a corner and around a cylinder. concept of conformal transformation – Qualitative discussion on applications. particular integral – method of undetermined co-efficient. properties of Z-transforms (proofs not required) Initial and final value theorems. CAM-2 portion Partial Differential Equations: Introduction – Formation of PDEs – Solution of PDE – General. TERM-END portion Integral Transforms. Fourier and ztransforms. Inversion contour method-solution of difference equations by Ztransform method. Jordan’s lemma (without proof). variation of parameters technique (without proof). Z-transform – definition – relation between Z – transform and Laplace transform. integral theorem – Derivatives of analytic functions.D’Alembert’s solution for the initial value problem. Cylindrical and Spherical coordinates – variable separable method: Potential flow over a sphere. Branch points. branch cuts. application to ladder type electrical network. Bilinear transformation. limits and continuity. Cauchy – Riemann equations. Z-transform of elementary functions. Indented contour integral. Particular and Complete integrals – Lagrange’s Linear Equations – Linear PDE of Higher order with Constant Coefficients – Homogeneous and non homogeneous equation – Solution of PDEs by the method of separation of variables. Residues. Exponential Fourier series – Fourier Integral Transforms – Definition – Fourier 5 . physical understanding of problems and intuition to independently analyze the mathematical equations which model the problems in their respective fields of study. Since difference equations arise very frequently in engineering sciences and numerical analysis it is proposed to devote a few classes on difference equations and Z-transforms also. Complex Integration: Integration in the complex plane along a contour. the Cauchy. Wave EquationVibrations of a Stretched string-Variable Separable Method. Applications of Partial Differential Equations : Solution of Laplace equations in Cartesian. Inversion contours for Laplace. Difference Equations & Z-transforms: Difference equations with constant coefficients-Complementary function.w= ez).Goursat theorem. the students are expected to develop the necessary mathematical skills. Cauchy’s Residue theorem – Evaluation of integrals by the method of residues.Inverse Z-transforms – partial fraction expansion method. By the end of the course.

6 .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.

Mode of Evaluation : Assignment/ Seminar/Written Examination. International student edition (1978). Churchill. 7th Edition. REFERENCE BOOKS: 1. 2. R. W. John Wilag & Sons (Wiley student Edison). 4. Pearson Education (2002). “Elements of Partial Differential equations”.. W. O’ Neil. “Complex variables and application”. “Advanced Engineering Mathematics”. MichaelD. Brown and R. John Wiley & Sons (2000). 3. “Higher Engineering Mathematics”. J. 5th Edition. S. “Fourier series and Boundary value problems”. “Advanced Engineering Mathematics”. 2nd Edition.TEXT BOOKS: 1. Erwin Kreyzsizig. 2004. 2005. Ian Sneddon. Churchill and J. Brown. 8th Edition. B. Grewal. McGraw – Hill International edition (1985). McGraw Hill International ed. Khanna Publications. V. 5. 2. 38th Edition. 7 . “Advanced Engineering Mathematics”. Peter V.V. Greenberg. 2004.

8 queens problem. Greedy Method. TERM-END portion Algorithm Design Techniques: Divide and Conquer Algorithm – Strassen’s matrix multiplication and its analysis. List: ADT – simple array implementation of lists – linked lists– doubly and circular linked lists – cursor implementation of linked lists – polynomial addition and multiplication.knapsack 0/1. 2. external sort. Shell sort. 8 . postorder) – binary trees – implementation – expression trees – binary search trees – threaded binary trees – B_tree – B+trees – hashing – hash function. “Computer Algorithms”. G. selection sort. “An Introduction to Data Structures with Applications”. Sorenson. Overview of Garbage collection & Compaction CAM-2 portion Trees: Preliminaries – implementations of trees – tree traversals (inorder. bucket sort. Jean-Paul Tremblay and Paul.05BIT 203 DATA STRUCTURES AND ALGORITHMS * L T P C 3 0 0 3 Aim: This subject aims to impart knowledge about various types of data structures (standard and user defined). TEXT BOOK: 1.traveling salesman problem – algebraic manipulations. “Data Structures & Algorithm Analysis in C++”. quick sort and its analysis. Queues & Lists: Stack: ADT – stack model – implementation of stacks – applications of stacks– infix. It covers algorithm analysis for the run time complexities and the space requirements. depth first search and breadth first search – shortest path algorithm. E. S. Heap sort and its analysis. prefix and postfix expressions and their conversions. Stacks. The students would be able to implement various data structures and apply operations on them and also implement various sorting and searching techniques. merge sort and its analysis.Basic concepts of NP-hard and NP-complete. Mark Allen Weiss. Sorting Techniques: Insertion sort and its analysis. Galgotia-1999. Branch and Bound. Dynamic Programming. preorder. Rajesekar. Horowitz. Mode of Evaluation : Assignment/ Seminar/Written Examination. Tata McGraw Hill. Queue: ADT – queue model – array implementation of queues. Addison Wesley. REFERENCE BOOKS: 1. 1991. Sahni and S. Lower Bound Theory. 2004.traveling salesman problem. CAM-1 portion Algorithm Analysis: Mathematical background model – running time calculations – complexity analysis – Abstract Data Types (ADT) – asymptotic notations. Objectives: To make the Students learn various types of data structures and algorithm analysis. Back Tracking.

“Electronic Devices and Integrated Circuits”. fabrication and characteristics of four layer devices such as SCR. J. IC voltage regulators – protection circuits for DC power supplies – switched mode power supplies. 1998. Mithal. C.photo electric theory . FET And Other Devices: Constructional features and characteristics of JFET and MOSFET – depletion and enhancement modes – VVR operation of FET – handling precautions for MOSFET – construction and characteristics of UJT.05BIT 205 ELECTRONIC DEVICES AND CIRCUITS * L T P C 3 0 0 3 Aim: The subject aims to introduce most of the basic electronic devices and discuss about the functioning. TRIAC and DIAC. inductor.Kulshreshtha and P. clipper and clamper circuits. active and saturation region – input and output characteristics – CE. Chanda. power ratings etc. CB. Objective: The students would become aware of the range of devices with respect to frequency. L section. S. RC section filters – Voltage regulators – current regulators.R.C. Ben. & CC Configurations – small signal and large signal beta – transistor breakdown ratings – Thermal runaway problems – Use of Heat sinks. temperature. D.Photo diodes – Photo voltaic cell – LED & LCD – Photo multiplier circuit – Light absorption and photo devices – Photo conductive cell (LDR) – Photo transistor – PN junction LASER – Solar energy converters. “Solid state electronic devices”. 2.C. 1997. Halkias. Mathur. Millman. The students will understand the constructional features and characteristics of various electronic devices and circuits. Prentice Hall of India. REFERENCE BOOKS: 1. “Electronic Devices and Applications of Integrated Circuits”. Semiconductor Basics: Review of extrinsic semiconductor – drift and diffusion currents – thermal generation of minority carriers – Hall Effect. 2001. Bipolar Junction Transistor: Principle of transistor action – current components – cutoff.K. Streetman. G. “Electronic Devices & Circuits”. New Delhi.P. McGraw Hill. Junction Diodes. application and selection of appropriate devices to achieve a particular circuit function. Khanna Publishers.G. Photo Electric Devices: Photo emissivity . 1999.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. 3. 9 . Electronic Circuits: Half – wave and full – wave rectifier circuits – performance characteristics of rectifier circuits – filter consideration capacitor. TEXT BOOK: 1.

TEXT BOOK: 1. Impacts and Security. REFERENCE BOOKS: 1.Computer Hardware. Information Systems Development. Potter. Intranets. The subject focuses on important application areas of computing and Information Technologies. "Introduction to Information Technology". Curtin.Mode of Evaluation : Assignment/ Seminar/Written Examination. Objectives: The students will be able to understand the importance of IT in business environment and the technologies involved in knowledge engineering. The Internet. 10 . “Introduction to Information Technology – The breaking ware” – Tata McGraw Hill. Information Technology for Multimedia Communication.Issues & Challenges. The students will be exposed to the application areas of IT. IT in Mining and Electrical Load Forecasting. multimedia. Dennis P. "Information Technology: Principles and Applications". Information Processing from Document Images. Principles and Applications of Soft Computing.Introduction: Business and Information Technology. and Inter-organizational Systems.Strategic Information Systems and Reorganization. R. The students will acquire basic knowledge about Internet. IT in the Business Environment. Managing Organizational Data and Information. Acharya Tinku. and Decision Support. Data. Information Technologies in the Modern Organization. virtual reality based concepts. Kunal Sen. Ray Ajoy Kumar. Implementing IT: Ethics. Electronic Commerce. Computer Software. and Extranets Applying IT for Competitive Advantage: Functional. Kim Foley. Kelly Rainer. Telecommunications and Networks. Computer-Based Supply Chain Management and Information Systems Integration. 05BIT 207 INTRODUCTION TO INFORMATION TECHNOLOGY L T P C 3 0 0 3 Aim: The subject aims to introduce various IT related concepts of current Interest. Intelligent Systems in Business. Efraim Turban. John Wiley & Sons. Prentice Hall of India 2. Mode of Evaluation : Assignment/ Seminar/Written Examination. Enterprise. IT in Healthcare & Telemedicine. Principles of Visual Information Analysis IT Infrastructure. Cybermediary Concepts. Richard E. Informational and Organizational Goals. Important Application Areas . Industrial information Technology. Cathleen Morin. IT for Rural Development. Remote Sensing and GIS Techniques. 2002. Knowledge.

Morris M. McGraw Hill 1999. logic gate fundamentals. Malvino and D. Third Edition. Combinational Logic Design: Adder – subtractor – code conversion – analyzing a combinational circuit multi level NAND and NOR circuits – binary parallel adder decimal adder BCD adder – Magnitude comparator – decoders – demultiplexer. Bartee. Objectives: The students shall be able to understand Boolean laws. Floating point representation. CodesBinary decimal. Leach. Boolean logic. understand the memory representation in ROM. CAM-1 portion 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. design steps involved in flip-flop.05BIT 209 DIGITAL COMPUTER FUNDAMENTALS* L T P C 3 0 0 3 Aim: The subject aims to impart the knowledge about digital logic fundamentals. Processor Organization: Memory unit – inter register transfer – micro operations bus organization scratch pad memory – ALU – design of ALU . Basic laws.Flip flops – triggering of flip flops – analyzing a sequential circuit state reduction excitation tables – counters – design with state equation registers shift registers ripple and synchronous counters. Control Logic Design: Control organization – PLA control – microprogram control hardwired control microprogram sequencer – microprogrammed CPU organization.status register effect of O/P carry – design of shifter – processor unit – design of accumulator. Computer Design: Computer configuration – instructions and data formats instruction sets timing and control execution of instruction – design of computer. A. Sequential Logic Design. arithmetic and Logic unit. 4th edition. theorems and properties of Boolean algebra – Boolean functions – canonical and standard forms logical operations – logic gates – Karnaugh map up to 6 variables – Sum of Products (SOP) and Product of Sums (POS) simplification with don’t care condition – tabulation method. Thomas C. 11 . 2001 REFERENCE BOOKS: 1. Prentice Hall India. shift register and designing a simple computer which is capable of providing few arithmetic and logical operations. function of flip-flop and shift register. Mano. "Digital Design". P. “Digital Principles and Applications”. error detection – reflection – alphanumeric codes. Tata McGraw Hill 1997. P. TEXT BOOK: 1. 2. Boolean algebra. "Computer Architecture Logic Design". RAM and CPU.

Overloading: Overloading-Function overloading.overloadable operators. T. exception handling constructs. polymorphism. Tata McGraw Hill. 1988. 2004. comparison operators. polymorphism. “Object Oriented Programming with C++”. binary operator overloading.Structured versus objectoriented development. Exception handling and Files: Files and Streams-Opening and Closing a file. operator overloading. K. abstract classes. file modes. parameterized constructors.Balagurusamy. concatenation of strings. unary operator overloading. class objects. Introduction to Fundamentals concepts: Object oriented fundamentals. data conversion.R. inheritance and member accessibility. ASCII and binary files. accessing class members. object. and abstraction and its importance. Generic programming with templates-Function templates. 2. operator keyword. constructors in derived class. Classes and Objects: Working with classes. defining member functions. structure of C++ program. “The C++ programming Language”. TEXT BOOK: 1. file pointers and their manipulation. Forms of inheritance. accessing member functions within class. friend classes and friend functions. constructor overloading. virtual functions. sequential access to a file. 12 . virtual base classes. copy constructor. evolution of c++ as a object oriented programming language with focus on generic programming with templates and Exception Handling. fundamentals of OO-class. Tata McGraw Hill. and Rajkumar. Bjarne stroustrup. empty classes. class templates. limitations of increment/decrement operators.Classes and Objects. benefits of OOP. encapsulation. arithmetic operators. E.Ravishankar. 3rd edition. handling exceptions.Base class and derived class relationship. “this” pointer. Exception handling-exception handling model. delete operators. Addison Wesley.Class specification. 05BIT 211 OBJECT ORIENTED PROGRAMMING * L T P C 3 0 0 3 Aim: The subject aims to introduce the salient features of Object Oriented Programming. catching exceptions. Inheritance: Inheritance.Mode of Evaluation : Assignment/ Seminar/Written Examination.Venugopal. error handling during file manipulations. random access to a file. destructors in derived class. constructors. "Mastering C++”. class member accessibility. inline functions. derived class declaration. constructor invocation and data member initialization. Objectives: Students will be able to know the fundamentals of object oriented programming and incorporate OOPs’ features such as inheritance. data hiding. new. 1997 REFERENCE BOOKS: 1. 2nd Edition. lists of exceptions. templates using c++ as language. elements of object oriented programming.

etc.Mode of Evaluation : Assignment/ Seminar/Written Examination. 3. Programs illustrating the various forms of inheritance : Ex. 3. Programs illustrating the use of following functions : a) Friend functions b) Inline functions c) Static Member functions d)Functions with default arguments. Implementation of shortest path algorithm. Medical. Science. 10. Unary operators. 2. Linear search b. Quick sort d. multilevel. Implementation of Binary trees and its traversals. Binary search 13 . 6. Sorting: a. copy constructor etc). New and delete operators etc. 5. Write a program having student as an abstract class and create many derived classes such as Engg. 4. Multiple. Merge sort c. constructor. Implementation and processing in lists. 4. 05BIT 213L OBJECT ORIENTED PROGRAMMING LAB (Implementation of OOPS AND Data Structures Concepts) L T P C 0 0 4 2 1. from students class. hierarchical inheritance etc. 2. Programs illustrating the overloading of various operators Ex: Binary operators. constructor with arguments. Write a program which illustrates the use of virtual base class. Write Program illustrating File Handling operations Ex. Selection sort 7. Implementation of Graphs and its ttraversals. Programs illustrating the use of destructor and the various types of constructors (no arguments. a) Copying a text files b) Displaying the contents of the file etc. Insertion sort b. 7. overflow and underflow in stack etc) Data Structure: 1. 6. Implementing Stacks and queues. Write programs illustrating how exceptions are handled (ex: division-by-zero. Create their objects and process them. 5. 9. Program illustrating function overloading feature. Single. 8. Write a program illustrating the use of virtual functions. Searching: a.

5. Design and testing of Half and Full subtractor. 18. Study of Flip flops (D T JK SR flip-flops). V-I characteristics of SCR and TRIAC. 2. 17. 14. Static emitter characteristics of UJT and PUT.05BIT 215L ELECTRONIC DEVICES LAB L T P C 0 0 4 2 LIST OF EXPERIMENTS: 1. 8. Switching characteristics of BJT SCR and MOSFET. Implementation of shift registers using flip-flops. Study of decade counter using flip-flops. 10. Study of CRO and measurement of amplitude frequency time period and phase angle. Study of Logic Gates (AND OR NAND NOT EXOR gates). 13. Implementation and. V-I characteristics of tunnel diode and varactor diode. Forward and reverse characteristics of PN junction diode. 6. Characteristics of Zener diode and study of its power ratings. Input and output characteristics of BJT (CE CB CC) and graphical determination of h-parameters. 15. Drain and transfer characteristics of JFET and graphical determination of transconductance. Implementation and testing of 3 bit binary ripple counter. Implementation and testing of Multiplexers. testing of code converters. 9. 4. Design and testing of Half and Full adders. 7. 16. 14 . 3. 11. 12.

2002.Walpole. R. Probability and Statistics.Devore.Myers and K. Statistical Parameters: Mathematical Expectation.R-chartControl Charts for Attributes. 1999. STATISTICS AND RELIABILITY * L T P C 2 1 0 3 Aim and Objectives: The aim of the course is to motivate the students to address the relevance of Probability and Statistical Theory to Engineering problems. Rohatgi.. Tests of Statistical Hypothesis: Large sample Tests .Independent Random Variables.Baye's Theorem.Chi-square test.small sample tests . ANOVA: One way and Two way classifications. 3rd Edison. “Mathematical Statistics”.Little's formula .F-test . S. Thomson.System Reliability ..K. A.Hazard Models. 2000..L. New York.Moment Generating Function-Characteristic Function-Regression and Correlation. John Wiley & Sons.p-chart.c-chart Reliability: Terms related to Reliability. Queuing Theory: Preliminary Ideas (Markov Chains) . Md. and Ebsanes Saleh. The most desirable is to expose students to practical applications of expectation and probability that provide the proper tools for handling the design of the system that involve randomness. New Age International Pvt. “An introduction to Probability and Statistics”.theory of estimation. 2. 5. J. 3. 2003. Probability and Statistics. 1. 2002.E. Bhat.H..L. 15 .Joint Density. “Modern Probability Theory”.Student’s t-distribution . Poisson. New Delhi.Conditional Distribution and Density Functions.Pure Birth and Death Models.Independent Events-Random Variables-Distribution Function-Density Function (PDF). Statistical Quality Control: Control Charts . 1998.Control Charts for Measurements . Gamma. 5th Edition.Exponential Distribution. Prentice Hall International.CRD-RBD-LSD. Ltd. Mode of Evaluation : Assignment/ Seminar/Written Examination. Morris H.np-chart.Myers. JE. “Probability and statistics for Engineers and Scientists”.Partial and Multiple correlations. Normal. students will • Have an understanding of the Probability concepts.x -chart. 2nd Ed.Variance.Reliability Allocation Maintainability and Availability. • Analyze the problems connected with statistics and reliability • Understand how to make the transition from a real problem to a probability model for that problem. Freund.Procedure of Testing Hypothesis. 7th Edition. REFERENCE BOOKS: 1.R. By the end of the course. B. Exponential. Addison-Wesley.05BIT 202 PROBABILITY. Inc. DeGroot. 3rd Edition.Binomial. 4. Probability and Random Variables: Axioms. R.K.Conditional Probability. TEXT BOOK: 1.Random Vector-Joint Distribution.Ye. V. Weibull distributions. Pearson Education.

Structure versus performance. Multiplication. overlapping communication and computation. John P.Processor Level Components. Patterson.Floating point Arithmetic. “Computer Architecture and Organization”. the design of computers. Fixed –Point Numbers. Multiprocessors. – Arithmetic – Logic Units. Design Methodology . Processor Basics: CPU organization: Fundamentals. L. system organization. System Architecture. Elsevier.Register . memory systems: Multilevel memories. – Data Representation: Basic formats. Floating point numbers. Memory Management and Networking. Random Access Memory (RAM). “Computer Architecture”. Objectives : At the end of the course students should be able to understand the basic principles such as locality of reference. The later generation – the VLSI era . 16 .System design . Register level design – the Processor Level . and reliability. Limitations of Computers . The Gate level – the Register level. Elements of Computers. Electronic Computers. also how the computer systems are organized and the characteristics of modern processors that affect system architecture. Bus control – IO and System Control: Programmed IO. Hayes.Mechanical Era. REFERENCE BOOK: 1.05BIT 204 COMPUTER ARCHITECTURE AND ORGANISATION * L T P C 3 0 0 3 Aim: The subject aims at imparting the knowledge of Computer architecture. TEXT BOOK: 1. Sequential ALU – Advanced Topics. Operating Systems. Division. Memory Allocation – Caches: Main features. address mapping. Serial Access Memory. John. coarse-grain parallelism.level components. performance/power trade-offs. India. 3rd Ed.Integrated Circuits.the evolution of computers.System Representation. Hennessy & David A.Communication methods: Basic concepts. Mode of Evaluation : Assignment/ Seminar/Written Examination. Processor level design. Arithmetic Logic unit: Data Path Design-Fixed point arithmetic-Addition and Subtraction. IO processors. Pipeline Processing Memory Organization: Memory technology: Memory Device Characteristics. programmable logic devices. Introduction: Nature of computing. hardware components. Design process. Instruction Types.Combinational ALU. 2003. – Instruction Sets: Instruction formats. Programming Considerations. System Organization. including the instruction sets. McGraw Hill. 1998. and Fault Tolerance. 3rd Ed. Address translations. Processor Architecture. DMA and Interrupts. – Parallel Processing: Processor –Level Parallelism.

Goankar. internal architecture of 80286. 2000. II. Peripherals & Interfacing With 8086: Serial & parallel I/O (8251A and 8255). 80386 and 80486 Processor: Features of 80386Dx. A. fetch cycles of 80286. Pin configuration. Tata McGraw Hill. real addressing mode. virtual addressing mode. Pentium – II. Pentium – IV. “Microprocessor Architecture Programming and Applications with 8085”.the 80386 and 80486 processor features. peripheral devices. PIT (8253). programmable interrupt controller 8259A. “Advanced Microprocessors and Peripherals”. the advances in processors – overview of Pentium – I. internal architecture of 80386Dx. 8086 architecture. Keyboard and display controller 8279. privilege. Programmable DMA controller 8257. Introduction to 8086 Processor: 8086 Processor-Introduction. Bhurchandi. 80286. programmable DMA controller(8257). REFERENCE BOOKS: 1.the 80286 processor features. Keyboard and display controller(8279). 80286 Processor: Features of 80286. Instruction set of 8086. ADC / DAC interfacing. programmable Interrupt controller (8259). operation. 17 . Introduction to microcontroller 8051. Pentium – I. 386. protection. Programmable interval timer 8253. Assembly language programming. Register set of 8051. Wiley Eastern. Instruction set and aspects of assembly language programming. Tata McGraw Hill. Douglas V. addressing modes. Assembler directives. IV and Microcontrollers 8051. Objectives: The student shall be able to understand 8086 processor design and basic operations. basic bus operation of 80286. “Microprocessors and Interfacing Programming and Hardware”. features of 80486. register organization of 80486. pin configuration of 80386. register organization of 80386Dx. 2. First Edition. architecture of 8051. operation and Memory management . 2000. 8086 in min/max mode. TEXT BOOK: 1. addressing modes.M.K. Ray and K. 1999. Hall. Mode of Evaluation : Assignment/ Seminar/Written Examination. Addressing modes. Pentium. processors. Advance In Microprocessors: Features of Pentium processor. Pentium – III. III. Interface peripherals with 8086 serial and parallel I/O (8251 A & 8255).05BIT 206 MICROPROCESSOR & INTERFACING TECHNIQUES * L T P C 3 0 0 3 Aim: The subject aims to introduce various features of 8086.

P Mishra. and simply solvable or it cannot be solved. Automata Theory and Abstract models of Computation and Computability. "Theory of Computation". 1998. Mode of Evaluation : Assignment/ Seminar/Written Examination. Computational complexities and NP – Completeness. Overview: An overview of grammars and languages. REFERENCE BOOK: 1. Martin. Unsolvable Problems & Computable Functions: Rice theorem – Halting problem – Post’s correspondence Problem – Primitive recursive functions – Godel Numbering – Recursive and recursively enumerable languages. 2 nd Edition. 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. Prentice Hall of India. 3rd Edition.L. Construction of NFA and DFA from Regular expressions. 1997. Chandrasekaran. TEXT BOOK: 1. Turing Machines: Church Turing hypothesis – Turing machine as language acceptors – Partial function – Non – deterministic Turing Machine – Universal Turing Machines – Applications. K. John C. Normal Forms: Chomsky’s & Griebach’s Normal Forms Push Down Automata & Context Free Languages: Context free grammars – Derivation trees – Ambiguity – PDA& CFG – Context Free and non-Context free languages. Non – determinism and kleenes theorem – pumping lemma – Decision problems. “Introduction to Languages and the Theory of Computation”. Regular expressions and Regular languages Finite Automata and its minimization. Tata McGraw Hill. efficiently solvable. N. Conversion of NFA into DFA Theorem & Problem: Chomsky hierarchy of language.05BIT 208 THEORY OF COMPUTATION * L T P C 3 0 0 3 Aim: The subject aims to introduce Formal Languages. They would be able to analyze the problems by determining whether a problem is solvable. 18 .

putting streams to use. file management. the significance of Java Library and to use the same – includes Strings. requesting repainting. Layout managers. uncaught exceptions. operators. window fundamentals. the delegation event model.Multithreading: Packages and Interfaces-packages. working with fonts. 19 . simple type wrappers. finally. Packages and Interfaces. Applet architecture. working with colors. “Java 2: The Complete Reference”. Streams and Files. importing packages. GUI based control and imaging . working with frame windows. event classes. data types. InetAddress. an applet skeleton. Packages – Interfaces – Exception Handling . control statements. displaying information within a window. 2000. throw. TCP/IP client sockets. working with graphics. and menus. String handling. introducing classes.Inheritance: Java as programming tool. Java programming environment. types. datagram.I. Patrick Naughton. Applets – Event Handling: Applet class-Applet basics. REFERENCE BOOK: 1. AWT – Layout Manager . creating your own exception subclasses. the HTML applet tag. using try and catch. simple applet display methods. Interfaces.05BIT 210 PROGRAMMING IN JAVA L T P C 3 0 0 3 Aim: The subject aims to introduce programming in Java. AWT controls. Java built-in exceptions. files. methods and classes. methods overriding. Java buzzwords. nested try statements. 2000. Overview – OOP . creating frame window in an applet. Addison Wesley. Networking. Networking.Swing: AWT classes. the collections framework.Basics.Networking: Streams and files-streams. event listener interfaces. multiple catch clauses. Java beans and Swing. access protection. Event handling-two event handling mechanisms. Mode of Evaluation : Assignment/ Seminar/Written Examination. Exception handling fundamentals. the standard Utilities. “Core JAVA fundamentals”. Multithreading. PTR (sun series). I/O. applets. Exception Handling mechanisms. Multithreading subsystems. Hartsmann and Cornell. TEXT BOOK: 1. Inheritance-Inheritance basics. object streams. Tata McGraw Hill. throws. variables and arrays. abstract classes. Vol. an introduction to swing. creating a windowed program. sources of events. Objectives: The students shall be able to understand basic aspects of Java programming. exception types. compiling and running Java programs. an overview of java.

Enterprise management systems.Application System Architecture in Web .Organization as a System .Models of EBusiness .Artificial Intelligence.Management as Control System .Organizational Behavior . “Management Information Systems”. various steps in management. 2002 REFERENCE BOOK: 1.Modifications to the Basic Model of Organization Structure . "Management Information System".Process Model of the Organization Data Warehouse: Architecture to Implementation . Development of Business Strategies.Development of Business Strategies Types of Strategies. O’Brien.Electronic Business Technology .Security in EBusiness .Classification of Information . applications of MIS in Manufacturing.Process of Management . Tata McGraw Hill.Intranet/Extranet .MIS and E-Business. 2004 Mode of Evaluation : Assignment/ Seminar/Written Examination. basic features Enterprise Management Systems and Role of MIS in Data Warehouse.Value of Information .Information as a Quality Product .TQM of Information Systems .Real Time Systems & Design Programming Languages . methods of data collection. 20 . Data Processing .Strategic Planning .User Interface . Tata McGraw Hill. Strategic Management of Business Corporate Planning Concepts . Applications of MIS in Manufacturing. Deterministic Systems . MIS and the Role of DSS Enterprise Management Systems: Basic Features & Benefits.MIS Development & Implementation IT Strategic Decision: Design . James A. Role & Impact of MIS: Approaches to Management .MIS & Decision Making Concepts .05BIT 212 MANAGEMENT INFORMATION SYSTEMS *** L T P C 3 0 0 3 Aim: The subject aims to introduce Role & Impact of MIS. Knowledge Based Expert System.Planning.Methods of Data Collection .Internet .Implementation Plan .Case Tools. Business Process Re-engineering . Organization structure and theory.Applications in Service Sector.Systems Control .MIS in Web Environment TEXT BOOK: 1.Controlling .Management Effectiveness . Artificial Intelligence and Expert systems.Organizing . Tools of Planning Decision Making: Methods.Electronic Payment Systems .S.Post Implementation Problems..Basic Model of Organization Structure . Role of MIS in Data Warehouse.System Concepts . MIS Development.Determining Information Requirement . Artificial Intelligence and Expert Systems Objectives : The Students shall be able to understand role and impact of MIS. Decision making concepts.Transaction Processing Application Processing . W. Web: A Tool for Business Management .Evaluation . Organization Structure and Theory .Internet and Web and Process of Management .MIS: A Tool for Management Process.Types of System . Decision Support Systems.Management by Exception . Tools & Procedures .Strategic Management under Web . Jawadekar.Choice of IT and MIS. Decision making.World Wide Web .Staffing Coordinating and Directing . 2nd Ed.Web Enabled Business Management .Organizational Decision Making . Selection and Implementation of ERPTechnology in MIS.Information System Processing .MIS: Organization.

12. Define a class Baby with the following attributes: a. city and pin code with suitable Labels. Date on which BCG injection has to be given. 14. • Permit withdrawal and update the balance. and to display the confirmation of acceptance. The database has 3 fields-names. From this derive the classes Curr-acct and Sav-acct to make them more specific to their requirements. Write a JAVA program to simulate a scientific calculator. Write a JAVA program to create a form for entering bio-data of an user. When the user clicks “NO “button. and update the balance. (45 days from date of birth) Write a constructor to construct the Baby object. 3. Write a JAVA program for frequency count of words and characters in a text file. 15. if necessary. 4. 7. your name. Assume that a bank maintains two kinds of account for its customers. Include the necessary methods in order to achieve the following tasks: • Accept deposit from a customer and update the balance. 18. Date of birth c. Also add a button called “My Details”. (60 days from date of birth) d. 10. account number and type of account. The current account provides simple interest for an amount that remains in the a/c for more than one month & also it provides cheque book facility. 6. Date on which Polio drops is to be given. Write a JAVA program for Client/Server interaction. modify and delete records from a student database. The savings account provides compound interest for an amount that remains in the a/c for more than 45 days and withdrawal facilities but no cheque book facility. GUI must be user-friendly and concise. Write a JAVA program to create four Text fields for the name. one called savings account and the other current account. That is. Current account holders should also maintain a minimum balance and if the balance fails below this level. street. and pin code must appear in the Text fields. Assume that m characters are extracted. Create a class Account that stores customer name. Write a JAVA program to extract a portion of a character string and to print the extracted portion and the remaining portion of the string. street. Name b. subtract. 19. a service charge is imposed. 16. 20. city. starting with the nth character Write a JAVA program for illustrating overloading and overriding methods in JAVA. print them as per their seniority. Write a JAVA program to sort the strings in an alphabetical order. In the main program define a baby and display its details. JAVA PROGRAMMING LAB L T P C 0 0 4 2 Write a JAVA program to search the largest element from the given array. Write a JAVA program that counts the number of digits in a given number. 13. • Display the balance. multiply. Write a JAVA program that creates an Editor using menu. • Compute and deposit interest. 5. Define a class called Employee with name and date of appointment.05BIT 214L 1. 9. Instead it should display appropriate error message. Create a Java application which will add. “Regrets” must be displayed. roll number. 11. The menu should simulate the important function of the file and Edit menu in the original window menu. 8. Demonstrate the use of this package in another class. • Check for the minimum balance. 17. When the user clicks “Yes” button. Write a JAVA program which illustrates the implementation of multiple inheritance using interfaces in JAVA. 2. Write a JAVA program to animate the face image using Applet. (Hint: Use frames and Panels). the message “Congrats” must be displayed. Use methods to initialize the class members. 21 . class. Create 5 employee objects as an array and sort them as per their date of appointment. When you click the button. NO. Write a JAVA program to create an Applet with a label “Do you know car driving?” and two buttons Yes. Write a JAVA program that moves the text “School of Computer Sciences welcomes you” diagonally using Applet. Write a JAVA program to create your package for basic mathematical operations such as add. Do not use any constructors. The constructor must find out BCG and polio drops dates from the date of birth. impose penalty. the program should not terminate. 21. If an alphabet is entered instead of a number.

Study of 8253 – PIT d. Write an ALP to generate the following series 1+1/x+1/x3+1/x5+ ……. Write an ALP to interface keyboard with 8086 using 8279 PKI 14. MUL. 11002. 11112 7. Study of 8255 – PPI c. CDH. Study of 8086 Architecture b. Write an ALP to order give set of hexadecimal numbers in ascending and descending order Data: 0AH. 10H. Write an ALP to convert given binary number to hexadecimal number using 8086 MP Data: 101010102. Write an ALP to move block of data from locations 1200H-1205H to 2200H – 2205H 9.. 111111112. Study of 8279 – PKI e. 02H 8. Study Experiments a. Write an ALP to convert given hexadecimal number to binary using 8086 MP Data: ABH. 101H 6. 22 . 1OH 3.05BIT 216L MICROPROCESSOR LAB L T P C 0 0 4 2 1. Study of 8259 – PIC 2. Write an ALP to display the given message using 8279 PKI Message: INFORMATION TECHNOLOGY 15. Write an ALP to generate the sum of first ‘N’ natural numbers using 8086 MP 5. Write an ALP to find out factorial of a given hexadecimal number using 8086 MP Data: OAH. 0DH. OFH. SUB. 0FH. Write an ALP to interface analog to digital converter. Write an ALP to reverse the given string Data: WELCOME 10. DIV) 4. Write an ALP to generate square wave using 8255 PPI 12. Write an ALP to perform 16 bit arithmetic operations (ADD. Write an ALP to generate rate generator using 8253 PIT 13. 11.

Inference Theory: The Theory of Inference for the Statement Calculus -The Predicate Calculus Inference Theory of the Predicate Calculus. 2002. N. Mode of Evaluation : Assignment/ Seminar/Written Examination. Set Theory: Basic Concepts of Set Theory. the students are expected to use inference theory in circuit models. 2.Group Codes. and algebraic theory in computer science problems.Manohar. V. Lipson.S.Iyengar. B. Richard Johnsonbaugh. 4th Edition.M.Polish Expressions and their Compilation . “Discrete Mathematics”..C. “Discrete Mathematics”. 2001.Tautologies .Trees -Storage Representation and Manipulation of Graphs. R.Grammars and Languages. Mathematical Logic: Introduction -Statements and Notation .L. 2003. 5th Edition. J. “Elements of Discrete Mathematics”.Functions. Graph Theory: Basic Concepts of Graph Theory . “Discrete Mathematical structures”. 23 . TEXT BOOK: 1. 2001. S. “Discrete Mathematics”. “Discrete Mathematical Structures with Applications to Computer Science”. C.P.Kolman.N. 4.Equivalence Implications . Trembley and R.Chandrasekaran. Vikas Pub.Principal Conjunctive Norm Forms.Matrix Representation of Graphs .05BIT 301 DISCRETE MATHEMATICAL STRUCTURES * L T P C 2 1 0 3 Aim and Objective: The aim of this course is to motivate the students to address the challenge of the relevance of inference theory.Busby and S.The Application of Residue Arithmetic to Computers . 5.Arunachalam.Connectives .S. 2000. 3.Principal Disjunctive Norm Forms .Relations and Ordering. K.Ch. Tata McGraw Hill – 13th reprint.Boolean Functions Representation and Minimization of Boolean Functions. Tata McGraw Hill. By the end of the course.C.Ross.Boolean algebra .Groups . Lipschutz and M.Recursion Algebraic Structures: Semigroups and Monoids . Pearson Education. graph theory in network models and lattices & Boolean algebra in Boolean functions. PHI.Liu.Venkatesh and P. Tata McGraw Hill. 2002. REFERENCE BOOKS: 1. 2nd Edition. Algebraic structures and graph theory to computer science and engineering problems.Normal Forms . Lattices and Boolean algebra: Lattices as Partially Ordered Sets . 2nd Edition.A.

Mode of Evaluation : Assignment/ Seminar/Written Examination. 2000 REFERENCE BOOK: 1. “Data Base System Concepts”. relational constraints. and some other concurrency control issues Database recovery techniques. System Implementation Techniques: Database system architectures and the system catalog – query processing. using locks for concurrency control in indexes. 3rd ed.F. They will be able to analyze and design ER model for a customized application and distributed databases. and allocation techniques. database modeling and design.Translating queries to relational algebra. Distributed Database: Introduction and Concepts. SQL. Objectives: The students shall be able to understand fundamental concepts of database management system. PL/SQL. TEXT BOOK: 1. using heuristics in query optimization – transaction-processing concepts. discretionary access control based on granting and revoking of privileges. tune. system implementation techniques.Codd Rules Relational model. Addison Wesley. shadow paging. Hashing Techniques.Recovery concepts. Korth and Silberschatz.. Other primary file Organizations – Index structures for files. Database security and authorizationIntroduction to database security issues. 1997. Data Fragmentation. implement. active databases.05BIT 303 DATA BASE MANAGEMENT SYSTEM * L T P C 3 0 0 3 Aim: The subject aims to introduce techniques to design. database backup and recovery from catastrophic failures. and the relational algebra – SQL – the relational database standard – ER to relational mapping and other relational languages – Oracle Architectures. Replication. Database design theory and methodology: Functional dependencies and normalization for relational databases – relational database design algorithms and further dependencies – practical database design and tuning. Federated systems.E. Basic concepts: Data bases and databases users – database system concepts and architecture – data modeling using Entity Relationship model – Files of Unordered & Ordered Records. maintain a database application and advance database concepts. 24 . languages & systems: The relational data model. arise algorithm. basic algorithms for executing query operations. time stamp ordering. Recover techniques based on deferred update and immediate update. Tata McGraw Hill. Elmasri & Navathe – “Fundamentals of Database Systems”. concurrency techniques. Concurrency control techniques: Locking techniques.

Memory Management. 6th Edition REFERENCE BOOK: 1. scheduling algorithms and distributed file systems Objectives : The students would be able to understand and explain various OS concepts such as timesharing. John Wiley & Sons. Deadlocks Memory. Distributed File Systems. FileSystem Implementation. Operating-System Structures Process Management: Processes. windows 2000. Mass-Storage Structure Distributed System: Distributed System Structures. Fourth Edition Mode of Evaluation : Assignment/ Seminar/Written Examination. Abraham Silberschatz. Greg Gagne. memory management. TEXT BOOK: 1. Security Case Study: The Linux System. Peter Baer Galvin. 25 . Semaphores and Critical regions. Virtual Memory. I/O systems and File Systems They would be able to use Linux system. Distributed systems. Introduction: Computer-System Structures. Multiprogramming. Distributed Coordination. "Operating System Concepts".05BIT 305 OPERATING SYSTEMS * L T P C 3 0 0 3 Aim: This subject aims to introduce operating system concepts such as processes & threads. processes & Threads. CPU scheduling algorithms. Parallel. Windows 2000. Threads. Prentice Hall of India. Stallings William. Deadlock prevention. I/O Systems. CPU Scheduling. "Operating Systems". Protection. File-System Interface. Inc. Process Synchronization. File & IO Management: Memory Management.

different protocol standards. different switching techniques. congestion & traffic control. Packet Switching Networks: Network Services and Internal Network Operation. etc. etc. Tanenbaum. User Datagram Protocol. Limitations of IPv4 and Introduction to IPv6. Ethernet networking. A. 7th Edition. various functions of layers. TCP/IP Architecture: The Internet Protocol. 26 . Routing in Packet Networks. ARQ Protocols. LAN access methods. different topologies like Star. 2000 REFERENCE BOOKS: 1. Cryptographic Algorithms TEXT BOOK: 1. Introduction to Internet Routing Protocols Advanced Network: Architectures and Security Protocols. Leon-Garcia. "Communication Networks". RSVP. DHCP. Application Protocols and TCP/IP Utilities Peer-to-Peer Protocols: Service Models. Objectives : Students shall be able to understand about working of Intranet. routers. Introduction to LAN Standards and LAN Bridges..Introduction to MPLS and Differentiated Services. security protocols & security algorithms Networks and Services: Approaches to Network Design. Pearson Education. different network architectures. Packet Network Topology. Security and Cryptographic Algorithms. Sliding Window Flow Control. Mesh. Security Protocols. “Data and Computer Communications". Prentice Hall India. Shortest Path Algorithms. client/server systems. William Stallings. WAN. Overview of TCP/IP Architecture. 4th Edition. OSI Reference Model. switches. and Introduction to traffic management & QoS. Multiple Access Communications. different internetworking devices like bridges. MAN setups. Transmission Control Protocol. "Computer Networks". 2003 2. and also future Networking Technology. Network design approaches. Tata McGraw Hill. 2003 Mode of Evaluation : Assignment/ Seminar/Written Examination. Indra Widjaja. Architecture of Networks.05BIT 307 COMPUTER AND COMMUNICATION NETWORKS L T P C 3 0 0 3 Aim: The subject aims to introduce basics of Networks. Andrew S. LAN.

Domain-specific architectures. Object-oriented testing. User interface prototyping. Software prototyping. Pressman.Project planning. Design with Reuse. "Software Engineering". Application families. Reliability validation. Ian Sommerville. Interface specification.Formal methods and critical systems. Project management activities. Software Engineering Fundamentals: The system engineering process. Software inspections. 2004. CASE workbenches. Requirements validation. 2004 REFERENCE BOOK: 1. Verification and validation.Planning. Software requirements. version and release. "Software Engineering".Prototyping in the software process. Overview of Quality management & Process Improvement. Software cost estimation. Mode of Evaluation : Assignment/ Seminar/Written Examination. Behavioral. Over view of CASE tools. Project duration and staffing. Algorithmic cost modeling. User requirements. Critical Systems: Overview of Dependability. Risk management. Configuration management. Security assessment. Estimation techniques. Software validation. Integration testing. Requirements Engineering Processes: Feasibility studies.Context. Data and Object models. develop an efficient software system through group cohesiveness. Software Specification. use the testing tools and methods. Objectives: The students would be able to analyze software requirements. ISO 9000 and Six Sigma. Formal Specification. McGraw Hill. User interaction. Critical systems validation. User interface design User interface design principles. Information presentation. Cleanroom software development. Software design and implementation. Overview of design for Distributed systems. Overview of SEI-CMM. Process iteration. Software Evolution.Productivity. Addison-Wesley. System Models. System Specification. Behavioral specification Architectural Design: System structuring. User support. and System Development. Project scheduling. Automated static analysis. Design patterns.Defect testing. Requirements elicitation and analysis. Control models. TEXT BOOK: 1. Roger S.planning and managing change. Object-oriented and Real-time software. Software process models. Requirements management.Formal specification in the software process. Software testing. Software change & re-engineering.05BIT 309 SOFTWARE ENGINEERING * L T P C 3 0 0 3 Aim: The subject aims to impart sound knowledge to design and implement an efficient software system and manage the resources. 27 .Functional and non-functional requirements. Safety assurance. Rapid prototyping techniques. Industry Standards: Overview of Managing software people. Interface evaluation. Overview of Legacy Systems. Modular decomposition. System requirements.Component-based development. software requirements document.

“Principles of Compiler Design”. other loop optimization. Mode of Evaluation : Assignment/ Seminar/Written Examination. three address code. semantic errors. parsing. linker for MS – DOS.M. derivations & parse trees capabilities of context free grammar Parsers: Shift-reduce parsing. the structure of compiler and the functions performed in different phases of compiler Assemblers: Elements of assembly language programming – simple assembly scheme – pass structure of assemblers. Objectives: The student will understand the different steps involved in pass I and pass II of Assembler. Linker. lexical phase errors. Relocation and linking concepts. REFERENCE BOOK: 1. A. regular expression. intermediate code. optimization code generation. errors. syntax directed translation scheme.05BIT 311 SYSTEM PROGRAMMING L T P C 3 0 0 3 Aim: The subject aims to introduce operations and functions of Assembler. D. Boolean expression. Lexical analysis. minimizing DFA. Semantic analysis. sources of optimization. top down parsing. postfix notation. finite automation. Design of a linker. 2nd Edition. loop optimization. Ullman. 2000. operator precedence parsing. parse trees and syntax trees. induction variable elimination. loop-invariant computations. translation of assignment statement. DAG representation of basic blocks. Tata McGraw Hill. reducible flow graphs. Dhamdhere. Optimization and machine code generation. Narosa Publishing. value numbers and algebraic laws.D. Role of lexical analyzer: Design of lexical analyzer. 28 . semantic-phase errors. Aho. Optimization: Principles. syntax analysis. selfrelocating program. intermediate code generation. regular expression to finite automata. global data flow analysis. linker for overlays. TEXT BOOK: 1. V. 1996. depth-first search. “System Programming”. implementation of syntax-directed translators. J. loaders. book keeping. implementation to lexical analyzer context free grammar. triples. dominators. Structure of Compilers: Lexical analysis. quadruples. and error handling – compiler writing tools programming languages. Design of a two-pass assembler.

iii) Select all the employees who are working in IT department. 8. Update the salary of the Employees by 10% hike c. Delete the employees whose name is ‘AAA’ 2. Enable the constraint with NULL value existing on rate-unit 5. i) Using EMP table find the employee getting maximum salary ii) Find the employee whose salary is minimum iii) Find the sum of salaries of all the employees working in ‘ACCOUNTS’ department. a) Create a table EMP with the following fields. 29 . 6. EName Eno Salary DeptNo Address Dname b) Insert 5 records into EMP c) ALTER EMP table I) Varying size of Eno field II) Adding a new field job d) Delete the table EMP 1. Create a table DEPT with the following fields DNo. 9. Create a table ORDER with the following fields and constraints. Insert a record with NULL values for rate unit d. Disable the constraint Nn-rate c. Add a field date-of-birth to EMP table and test all the date functions. i) Modify EMP table adding a new field BONUS. a. Using Ex 3 Perform the following a. Create a table EMP with the above mentioned fields. Create a table EMP mentioned above and test all the arithmetic functions and character functions. Drop unique constraint for item-name b. Primary Key DName Modify EMP table adding a foreign key constraint on DeptNo. Insert 5 records into EMP b. 7. ORDER Column Name Order-no Item-name Qty Rate-unit Constraint Name pk-order-no itn ck-aty (25<QTY<50) Nn-rate Constraint Type PRIMARY KEY UNIQUE CHECK NOT NULL 3.05BIT 313L RDBMS LAB L T P C 0 0 4 2 1. update it using NVL ii) Retrieve the employees whose name starts with S.

Create a sequence to insert the empno in EMP table b.• • Insert 6 records into Dept. a. Create a cursor to update the salary of employees in EMP table a) Write a PL/SQL program to raise an Exception 2. When the bonus exceeds salary 3. Self Join b. 5. Row column subset view d. Outer Join e. With check option 11. Column subset view c. Write a procedure to insert a record into ORDER table by validating qty limit of the item and also check whether that item exists. Create a synonym for the above two tables PL/SQL Programming 1. Grouped view e. Equi Join c. Implement the following Join operations a. Create a trigger which checks whether employee with Emp_no is present in the Employee table before inserting into EMP. Row subset view b. 30 . Write a function to find substring. Write a PL/SQL program to test the built-in Exceptions 4. Joined view f. Natural Join 10. Using EMP and DEPT a. 6. implement all type of view techniques. Using EMP and DEPT. Non Equi Join d.

2. 10. 4. amount of memory currently available. Program to report the behavior of the OS to get the CPU type and model. Implement the solution for dining philosopher’s problem. SJF. Implementation of wait and signal using binary semaphores. IPC using pipes. 31 . 7. Program to get the amount of memory configured into the computer. Implementation of page replacement algorithms. Priority. Implementation of wait and signal using counting semaphores. Inter Process Communication (IPC) using Message Queues. best fit and worst fit file allocation strategy. 14.05BIT 315L OPERATING SYSTEM LAB L T P C 0 0 4 2 1. Implement banker’s algorithm. 11. Implement the various process scheduling mechanisms such as FCFS. kernel version. 6. Implement the solution for reader – writer’s problem. Implement the first fit. 9. 8. round – robin. 3. 12. 5. Signaling process 13. Write a program to create processes and threads.

“Operation Research. Integer Programming: Formulation – graphical representation – Gomory’s cutting plane method. Keder Nath Ram Nath & co. Mode of Evaluation : Assignment/ Seminar/Written Examination. two jobs through ‘m’ machines and ‘n’ jobs through ‘m’ machines. 1974. H.. McGraw Hill Co.An Introduction”. “Operation Research”. Sequencing and Scheduling Problems: Job sequencing – ‘n’ jobs through two machines. PERT & CPM Techniques – critical path – normal and crash time – resource allocation – resource leveling and smoothing. Gillet “Introduction to Operation Research”..Initial solution – methods of improving the initial solution – traveling salesman problem – dynamic programming – principle of optimality.05BIT E02 RESOURCE MANAGEMENT L T P C 3 0 0 3 Aim: This subject aims to introduce the operations research techniques such as Linear Programming. Tata McGraw Hill 1982. Sharma. REFERENCE BOOKS: 1. 2. 2000. reorder point (ROP) determination. Billy. Integer Programming. S. 3.. “Operation Research”. Objectives: The students would be able to understand and use concepts of OR. Concept of OR: Concept and scope of operations research (OR) – Development of OR – phase of OR – Models in OR. B. Linear Programming-Methods of solution – graphical and SIMPLEX methods of solution VARIATIONS – duality in LP – revised SIMPLEX method – applications for business and industrial problem. dynamic programming. TEXT BOOK: 1. Taha. Inventory Problems: Deterministic model – costs decision variables – economic order quality – instantaneous and non-instantaneous receipt of goods with and without shortage – quality discount – probabilistic inventory model – inventory systems – safety stock – reorder level (ROL). Maintenance and Replacement Problems: Models for routine maintenance and preventive maintenance decisions – replacement models that deteriorate with time and those fail completely. maintenance and replacement problems.D. Hamblin & Stevens Jr. 32 . They would be able to solve Inventory. 1989. such as Linear programming. Transportation and Assignment Problem.A. S. Macmillan.

estimating program run times. Fault -Tolerance Techniques: Introduction. reliability models for hardware redundancy. run-time support. fault types. uniprocessor scheduling of IRIS tasks. Kang G. control structures.M. communication and fault tolerance aspects. R. nonfaulttolerant synchronization algorithms. two-phase approach to improve predictability. facilitating hierarchical decomposition packages. shin. software error models. multitasking. transaction priorities.A. Prentice-Hall International. task classes. Buhr. covering programming languages and tools. mode changes. task assignment. TEXT BOOK: 1. “Real-Time systems”. integrated failure handling. fault tolerant synchronization in hardware. fault tolerance scheduling. architecture issues. real time vs. fault detection. Krishna. Bailey. database. obtaining parameter values. maintaining serialization consistency. data diversity. operating system issues. C. classical uniprocessor scheduling algorithm. 33 . impact of faults. exception handling.J. general purpose databases. timing specification. programming environments. Introduction: Issues in real-time system. Objectives: The students would be able to understand the real time systems concepts to select architectures and programming languages. failure causes. data types. Reliability & Clock Synchronization: Introduction. communication network topologies. Evaluate the fault tolerance techniques and systems reliability.L. low-level programming. 2004.05BIT E04 REAL TIME SYSTEMS L T P C 3 0 0 3 Aim: The subject aims to assimilate the real time system technologies. task scheduling. Analyze the Real Time systems requirements. D. 1999. reversal checks. performance measure for real time systems. transaction aborts. clock synchronization. disk scheduling algorithms. McGraw Hill. main memory databases. desirable languages characteristics. malicious or Byzantine failures. Real-Time Database & Communication: Basic definitions. databases for real-time systems. “An Introduction to Real-Time Systems”. overloading and generics. concurrency control issues. taking time into account. redundancy. Mode of Evaluation : Assignment/ Seminar/Written Examination. REFERENCE BOOK: 1. Programming Languages and Tools: Introduction. fault and error containment. communication protocols.

Query processing problem – objectives of query processing – Complexity of Relational Algebra operations – characteristics of Query Processors – Layers of Query processing Query Decomposition: Localization of Distributed Data. Stefanoceri. Distributed concurrency control. TEXT BOOK: 1. Mode of Evaluation : Assignment/ Seminar/Written Examination.05BIT E06 DISTRIBUTED DATABASE SYSTEM L T P C 3 0 0 3 Aim: This subject aims to cover Distributed Data processing. M. Query Optimization – Centralized Query Optimization – Join Ordering in fragment queries – distributed query optimization algorithms. 1999 REFERENCE BOOK: 1. "Principles of Distributed Database Systems". Distributed DBMS Reliability: Reliability concepts and measures – Failures and fault tolerance in distributed systems – local reliability protocols – distributed reliability protocols – dealing with site failures – Network partitioning – Architectural considerations. Objectives: The students would be able to understand and use distributed Database Processing. Introduction to Distributed Data Processing: What is a distributed database system – Promises of DDBS – Complicating Factors – Problem Areas. 34 . Giuseppe Pelagatti. Query processing. Tamer Ozsu. DBMS Standardization – Architectural models for distributed DBMS –Distributed DBMS Architecture – Global Directory issues Distributed Database Design: Alternative Design Strategies – Distributed Design issues – Fragmentation – Allocation. Query decomposition and Transaction Management. McGraw Hill publications. Distributed databases. Query processing. "Distributed Database Principles and Systems".Serializability theory – Taxonomy of concurrency control mechanisms – Locking based concurrency control algorithms Timestamp-based concurrency control algorithms – Optimistic concurrency control algorithms – Deadlock management – Relaxed concurrency control. Query decomposition. 1987. Introduction to Transaction Management: Definition of a Transaction – Properties of Transaction – Types of Transaction. Distributed Database Design. Semantic Data Control: View Management – Data Security – Semantic Integrity Control Overview of Query Processing . Patrick Valduriesz. PHI. Transaction management and Distributed DBMS reliability.

M. overview of biological Neuro-system. Fuzzy Arithmetic: Fuzzy Numbers. Genetic Algorithm: An Overview. Nonspecificity of Fuzzy and Crisp Sets. Lattice of Fuzzy Numbers. training rules. “Introduction to Artificial Neural systems”. Multivalued Logics. Fuzzy Propositions. “Genetic Algorithms in Search. Membership Function. Classical and Fuzzy Sets: Overview of Classical sets. Learning Paradigms – supervised. handling uncertainty and problem solving using genetic algorithms Neural Networks: History. Addison Wesley. McGraw Hill. Union. and Information”. learning in biological neuron. David. Prentice Hall (1988). Goldberg. Mathematical Models of Neurons. Fuzzy Logic: Introduction to Fuzzy Logic. Optimization and Machine Learning”.05BIT E08 SOFT COMPUTING L T P C 3 0 0 3 Aim: The subject aims to introduce neural networks. unsupervised and reinforcement learning. Fuzzy Equations. Operations on Fuzzy Sets. fuzzy logic and genetic algorithms Objectives: The students would be able to understand and explain the concepts of neural networks. Uncertainty based Information and Application of Fuzzy Logic: Information and Uncertainty. Associative Memories. learning algorithms. Fuzzy Rule generation. TEXTBOOK: 1. fuzzy arithmetic. J. 1995 2. Uncertainty. Combination of Operations.J. Jaico Publishing House. Back Propagation Algorithm. Fuzzy Qualifiers.Complement. Mode of Evaluation : Assignment/ Seminar/Written Examination. fuzzy sets. 35 . 1985. ANN training algorithms – perceptron. Zurada. Fuzziness of Fuzzy Sets. “Fuzzy Sets. Linguistic Variables. Linguistic Hedges. Implementation of GA. E. Ross T. 1997 3. Application of Fuzzy Logic: Medicine. REFERENCE BOOKS: 1. Multilayer perceptron Model. Delta. Economics Etc. Intersections. aggregation operations. Klir and TA Folger. Learning rules. GA in problem solving. Hopfield Networks. “Fuzzy Logic with Engineering Applications”. Fuzzy Logic: Classical Logic. Applications of Artificial Neural Networks. Arithmetic Operations on Intervals and Numbers. ANN Architecture.

Uyless Black. 4th Edition. 2. Voice over ATM. "Internet Wide Area Networks: Internet Architecture". 2000.25. LAN Switching and VLANs. Quality of Service for VoIP.05BIT E10 INTERNETWORKING & TECHNOLOGIES L T P C 3 0 0 3 Aim: The subject aims to cover the fundamentals of internetworking. Objectives: The students would be able to understand and explain internetworking fundamentals. Overview of Ethernet Networking – Transceiver Functionality – Heartbeat Frame components – 802. "Internetworking Technologies: An Engineering Perspective". 2003 Mode of Evaluation : Assignment/ Seminar/Written Examination. General SIP Over view. Cisco Press. evolution of solutions for voice over data networks. It also covers types of internetworks. Internetworking Technologies Handbook.3 Frame components – Addressing schemes – single-cast – multicast – Broadcast Address –Ethernet Via 10BaseT Overview of TCP/IP Technology: Layer Analysis –Transport Layer components and functions – Popular application layer offerings – TCP/IP Network requirements – Internet Protocol version 4 – Internet Protocol Version 6 (Ipv6). Comparison and Contrast of the Various VoIP Signaling Alternatives. Evolution of Solutions for Voice over Data. Voice over Frame Relay. Tata McGraw Hill. WAN and voice over data network technologies. Internetworking Fundamentals: Protocol and Standards. 3. PHI. Source-Route Transparent Bridging. General MGCP Overview. PHI. Frame Relay. 2003. various types of networks. Skinny Client Control Protocol (SCCP). Mixed-Media Bridging. 2002. Ed Taylor. "Networking Handbook". Internet Routing – Routing Protocols – Routing Security – New Developments – Switch based Routing – Routing in software – multicasting – mobile routing – New IP Addressing Voice & Data Internetworking Technologies: Advances in Applications and Voice Technologies. Wide Area Networks (WANs).Typical Functions of a WAN Network Layer – WAN Interfaces – Connection oriented and connectionless protocols – Relaying Data through the WAN – Circuit switching – Message Switching – Packet switching – Frame Relay – Cell Relay – Comparing WAN Technologies – X. Voice Networking. Translation. and ATM Virtual Circuits – Router Technology: Hubs – Bridges – Routers – Router/Bridge / Hub Application Example – Transparent Bridging. Banerjee Rahul. REFERENCE BOOKS: 1. TEXT BOOK: 1. Network Emergence – Network Types by Architecture – software – Network Design – Signal characteristics – signal types – signaling methods – signaling characteristics – analog & digital commonalties – Data networks Types of Networks: Data networks – voice networks – video networks – multimedia networks – internet – intranets. 36 . Voice over IP.

Bergeron Bryan. searching algorithms. 37 .05BIT E12 BASIC BIO-INFORMATICS L T P C 3 0 0 3 Aim: The subject aims to cover the basics of Bio informatics. Sequencing Alignment and Dynamic Programming: Introduction – Strings – Edit distance between two strings – string similarity local alignment gaps – Parametric sequence alignments – multiples alignment – common multiple alignment methods. Primer on information theory. Sequence Databases and Uses: Introduction to databases – database search – Algorithms issues in database search – sequence database search – FASTA – BLAST – Amino acid substitution matrices PAM AND BLOSSUM. Dan Gusfield. DNA sequencing and Gene predictions Introduction to Bioinformatics: Scope of Bioinformatics – Elementary commands and Protocols. Dynamic programming. Prentice Hall of India Mode of Evaluation : Assignment/ Seminar/Written Examination. telnet. DNA mapping. 1997 REFERENCE BOOKS: 1. Cambridge University Press. http. Evolutionary trees. Evolutionary trees & DNA sequencing. Westhead. "Algorithms On Strings Trees and Sequences". 2. "Instant notes – Bioinformatics". TEXT BOOK: 1. "Bioinformatics Computing". Special Topics in Bioinformatics: DNA Mapping and sequencing – Map alignment – Large scale sequencing and alignment – shotgun – DNA sequencing – sequence assembly – Gene predictions – Molecular predictions with DNA strings. Dynamic programming. Objectives: The students would be able to understand and explain the fundamentals of Bio-informatics. Evolutionary Trees and Phylogeny: Ultrasonic trees – parsimony – Ultrametric problem – Perfect phylogeny – Phylogenetic alignment – connection between multiple alignment and tree construction. Viva Publishers. ftp.

load balancing approach.Desirable features of good DFS.05BIT E14 DISTRIBUTED COMPUTING L T P C 3 0 0 3 Aim: The subject aims to cover parallel & distributed computing architecture. security. file accessing Models. Distributed File Systems and Security: DFS and security. "Distributed Operating Systems: Concepts & Design". authentication. “Distributed Operating Systems” Pearson Education. file sharing semantics. desirable features of good global scheduling algorithm. model. PHI. RPC messages. REFERENCE BOOK: 1. file caching schemes. granularity. mini project using Java RMI Distributed Shared Memory: Distributed shared memory. Fault Tolerance. file models. 38 . 2002. Tanenbaum. definition. client – server binding. implementation mechanism. synchronization. buffering. Sinha.passing semantics. replacement strategy. transparency. Resource and process Management: Introduction. advantages of DSM. clock synchronization. parameter . stub generation. Objectives: The students would be able to understand and use different network models. task assignment approach. message passing –introduction. group communication. cryptography. threads. communication protocols for RPCs. design and implementation issues of DSM systems.general architecture of DSM systems. access control. DCE. thrashing. Andrew S. desirable features of a good message passing system. consistency model. structure of shared memory space. encoding and decoding of message data. networked clusters of computers. utilization and management of the expensive resources that are remote to the users. security mechanisms and design methodologies of Distributed systems Models & IPC: Introduction to distributed computing system. TEXT BOOK: 1. RPC: RPC-Introduction. process addressing. DCE security service. exception handling. marshalling arguments and results.Pradeep K. evolution different models. potential attacks to computer system. Mode of Evaluation : Assignment/ Seminar/Written Examination. atomic transaction. multigram messages. 2005. failure handling. process migration. issues in design. server management. Digital signatures. call semantics. issues in IPC. gaining popularity. and file replication.

Workflow and phases of the Unified process. 39 .05BIT 304 OBJECT ORIENTED ANALYSIS & DESIGN L T P C 3 0 0 3 Aims: The subject aims to introduce of the object-oriented development processes. 1994. applications and UML based object oriented analysis and design. Management Issues. Object-Oriented Analysis Workflow. Complexity of software: Structure of complex systems. Teams. the Requirement Workflow. Grady Booch. Designing complex systems. User Interface system. Maintenance. Interaction diagrams. Mode of Evaluation : Assignment/ Seminar/Written Examination. Planning and Estimating. Tata McGraw Hill. Management and planning: Staffing. "Object Oriented Analysis and Design with applications". state transition diagrams. Analysis and Design: Case studies. "An Introduction to Object-Oriented Systems Analysis and Design with UML and the Unified Process". micro development process. decomposing complexity. Elements of object model. object diagrams. Documentation. Tools. macro development process. Object Model: Evolution. Applying object model Elements of Notation: Class diagrams. module diagrams. process diagrams. 2003. REFERENCE BOOK: 1. TEXT BOOK: 1. Object-Oriented Design Workflow. Principles. Stephen R. UML and related methodologies. Addison Wesley. Release management. Benefits and Risks of Object Oriented development Introduction to Object-Oriented Paradigm and UML: Unified Process. Quality Assurance and Metrics. Testing. Objectives: The students would be able to understand the techniques. Reuse. applying the notation. Introduction to Web – Based Systems. Schach..

2005. 2000. Transaction oriented TCPU Support for Mobility: File Systems-Consistency –World Wide Web – Hyper Text mark up language (HTML) – approaches that might help wireless access-System architecture –Wireless Application Protocol. Wireless Communication: Wireless LAN-Infrared vs.05BIT 306 MOBILE COMMUNICATION ** L T P C 3 0 0 3 Aim: The subject aims to impart the knowledge about the technologies like CDMA. Broadcast systems Overview –Cyclic Repetition of Data Digital Audio Broadcasting –Digital Video Broadcasting. DECT. GSM. 40 .11.Johchen schiller. Mobile Devices. Wireless ATM. Radio transmission. Telecommunication Systems –GSM. REFERENCE BOOK`: 1. Mobile quality of service. Localization. Wireless ATM working group. Medium Access Control techniques. Snooping TCP.2000. Wireless Local Area Networks. Motivation for WATM. Satellite Communication. WATM Services. HIPERLAN. Introduction: Wireless Transmission –Frequencies for Radio transmission –signals-Antennas –Signal propagation –multiplexing Modulation-Spread spectrum –Cellular systems Communication Systems: Medium access control-Motivation for a specialized MAC SDMA-FDMATDMA-CDMA-comparison of S/T/F/CDMA. MEO140. Mode of Evaluation : Assignment/ Seminar/Written Examination. Mobile transport layer-Traditional TCP292: Indirect TCP. Mobile Network Layer: Mobile IP-Dynamic host configuration protocol-Ad hoc networks. Reference Model. LEO139. Selective Retransmission. IEEE802.Yavagal. mobile network layer and various wireless Application Protocol. Applications and Service Creation”. UMTS and IMT . Routing. TEXT BOOK: 1. Access point control protocol. “Mobile Computing-Technology. Satellite Systems –GEO139. Talukder. Mobile TCP: Fast Retransmit/Fast recovery. Addison Wesley. Tata McGraw Hill. “Mobile Communication”. Handover. transmission/Timeout Freezing. Functions. Infrastructure and ad hoc networks. GPRS and Wireless Application protocols Objectives: The student would be able to understand the principles and practices of Mobile Communication. Radio Access Layer: Handover. TETRA. Bluetooth. Roopa R. Asoke K. Addressing. HiperLAN and Bluetooth. Location Management. Wireless ATM operations.

Active Server Pages: Introduction. classes and objects. Internet services. common tags. Client side vs. Headers. Extensible style language (XSL). with VBscript. images. XML: Introduction. arrays objects. e-mail. data types and control structures. Introduction to scripting. E-commerce and security. structuring data. Active Server Pages 3. "Internet – The Complete Reference". using XML with HTML. DNS servers. File system objects. 4. commerce server. TMH 1995. server side Active X components. customized markup languages. Domain Name systems. Margaret Levine Young. Gopher. TEXT BOOK: 1. accessing a database from ASP pages. "Internet 101 Computing". 2. news groups. document type definition. 3. arrays. string manipulations. Objectives: The students shall be able to understand and use the markup languages. "Internet and World Wide Web – How to program". security. Alfred Glass Brermer. to access remote databases using XML and ASP. 2005. Deitel & Nietro. FTP. REFERENCE BOOKS: 1. O’Reily publishers. META. Mode of Evaluation : Assignment/ Seminar/Written Examination. server side scripting. trading case study. Deitel. text styling. shopping cart technology. online auction. Telnet. History of Internet: internet connection concepts. VBscript functions. ASP working. 2004. internet marketing. operators. Markup Languages: Introduction to HTML. functions. other E-business. Microsoft schema. introduction. FRAMESET tags. with emphasis on client side and server side scripting. net and its features. XML parsers. tables. Pearson Education. E-commerce core technologies. Valerie Quercia. scripting languages such as VB Script. control structures. "Internet in a Nutshell". lists. special characters. 41 . 2000.0 – Wrox publisher. DHTML: Client side scripting. Java Script. JavaScript. 2004. TMH. accounts.05BIT 308 INTERNET COMPONENTS AND PROGRAMMING L T P C 3 0 0 3 Aim: The subject aims to introduce the web technologies. linking. session tracking and cookies. operators.

use of Boolean algebra and repairable systems. Techniques for Prediction Analysis. Software reliability issues. Dr. methods for reliability estimation. Mode of Evaluation : Assignment/ Seminar/Written Examination. Software quality management. TEXT BOOK: 1.05BIT 310 SOFTWARE RELIABILITY AND QUALITY ** L T P C 3 0 0 3 Aim: The subject aims to introduce software and system reliability. "Handbook of Software Reliability Engineering". Lyu (Editor). reliabilities of components & systems and the importance of fault free analysis. Software Quality Control: Software Quality attributes software quality assurance activities. Causes of failures. fault-free analysis. Causes of faults. 2. software reliability modelsMusa’s Execution Time model.S. McGraw Hill. software – related failures – fault. various phases in software product life. Management for quality control and reliability.Responsibility for quality. 42 . quality control and applications of reliability analysis in large-scale systems and to improve the quality of the software. Defect prevention. and Little Wood Model. Error failure. 3rd Edition. Brijendra Singh. Software Reliability and System Reliability: Reliability Bathtub curve. “Quality Control & Reliability Analysis (Concepts & Applications)”. Objectives : The students shall be able to understand the Markov models. Introduction to Quality Control: Control Quality assurance system. Srinath. Jelinski – Moranda Model. L. 2005. Michael R. 2nd Edition. enhancing maintenance during development. quantitative view of reliability. 1998. Software Reliability: Qualitative view of reliability. tie-set and cut-set methods and reliability aspects of repairable systems. Company wide quality management and Benefits of company wide quality control. Khanna Publishers. Reliability mathematics. Software design review. “Reliability Engineering”. tie-set and cut-set methods. REFERENCE BOOKS: 1. Ltd. managerial aspects of software maintenances. maintenance tools and techniques. Markov graphs. Software Maintenance: Software maintenance. Affiliated East-West Pvt.

Security Considerations for URLConnections. Loading Classes at Runtime. The Message Class. Proxies. The Datagram Packet Class. HttpURLConnection. "Java Network Programming & Distributed Computing". Password Authentication. Remote Method Invocation: What is RMI? Implementation. Methods of SSLSocket Class. Elliotte Rusty Harold “JAVA Network Programming” 3rd Edition published by Sharoff Publishers and Distributors Pvt.registry Package. The Datagram Socket Class. Software updates etc. Accessing Password-Protected Sites. UDP Datagrams and Sockets: The UDP protocol. ISBN: 0201710374 Mode of Evaluation : Assignment/ Seminar/Written Examination. Mumbai. Threads: Running Threads. Socket Addresses. Guessing MIME Content Types. Some Useful Servers. the Path Interface. and accomplish many Network programming tasks. the java. Thread scheduling. Socket Exceptions. 2005. Basic Web concepts: URLs. Some useful Applications. URL class. Configuring the Connection. Creating Secure Server Sockets. Content Handlers. Addresses. Multipath Messages and File Attachments. Introduction: Why networked Java What can a network program do. communicating with Server Side Programs Through GET. Ltd. Folders. URLs: The URL class. Caches. The Object Methods. the java. Investigating Protocols with Telnet.. Sockets For Servers: The Server Socket Class. SGML. Looking Up Internet Addresses: The InetAddress Class. Creating Secure Client Sockets. Internet Standards. Synchronization. Reading Data from a server.The Network Interface Class. JAR URLConnection. The URLName Class. Server Side Programs. Secure Sockets: Secure Communications. Published by Addison-Wesley.server Package. Sockets for Clients: Socket Basics.TCP and UDP. Datagram Channel. URL encoder and URL decoder Classes.rmi. Security Basic network concepts: Networks. Objectives: The students shall be able to learn JAVA programming to share data across Internet for File transfer. The Internet. Some useful programs. Thread pools. REFERENCE BOOK: 1. The JavaMailAPI: What are Java Mail API. Deadlock. Writing Data to a server. Returning Information from a Thread. MIME messages. Receiving Email. the java. The layers of a network. Methods of the SSLServerSocket Class. Configuring the Client Request HTTP Header. Michael Reilly.rmi Package.MIME Media types.rmi. and XML. TEXT BOOK: 1. Examples. IP. URLConnections: Opening URL Connections.05BIT 312 NETWORK PROGRAMMING L T P C 3 0 0 3 Aim: To introduce basic network concepts and network application development. HTTP.Inet4Address and Inet6Address. The client/server model. The Socket Class. David Reilly. 43 . Reading the Header. Sending Email. HTML.

Encoding is done by replacing a character by the character next to it i. 8. Write a program to develop a simple Chat application. Write graphical user interface for the sales database which lists all the customer names in one choice box and all products in another. 3. Write a Java program to implement this scenario. a as b.e. ii). b as c …z as a. Remote object interaction. 5. 4. 12. display a list with the customer name. Write a program to create a daemon process. The client connecting to it should read data and find out the sum of the data thus read. 11. Encoding is done by replacing a character by the character next to it i. This process is done using UDP.e. Design and populate a database for a car rental system. 10. Write a program for the above 6. When the user selects a customer name and product and press the “submit” button. Write a program to capture each packet and to examine its checksum field. Write a program to display the client’s address at the server end.05BIT 314L NETWORKING LAB L T P C 0 0 4 2 1. Write a program for the above 7. b as c …z as a. File downloading and uploading. a as b. Allow the client to check the availability of a category of car and to make reservation. Write a program to display the name and address of the computer that we are currently working on. and date of order by the customer with the name of that product. The message entered in the client is sent to the server and the server encodes the message and returns it to the client. This process is done using the TCP/IP protocol. 13. Write a program to implement an echo UDP server. 2. Write a program to display the server’s date and time details at the client end. 44 . 9. Use prepared statements whenever possible. Write program to illustrate the following: i). product. A server should run for 10 secs and generate numbers continuously. The message entered in the client is sent to the server and the server encodes the message and returns it to the client. quantity.

Set the Background Color for the text using all the 4 methods of Style sheets 5. Incorporate the function into a VBScript that reads a value from the user. Set the Background Image without tiles and at the center of the screen. 11. Use Previous & Next to retrieve the rest of the information. Using STYLE SHEETS: 1 . Given the number 7631. Insert the new user & pREFERENCE to the database. Display the page customized according to the pREFERENCE selected. Display the result in the status bar of the browser window. Using JavaScript create a web page for Online Testing (Quantitative Aptitude) 6.Set the Background Image Fixed and Foreground Scrolling 2. Design an E-greetings page which has properly aligned paragraphs with images along with it. 3. background color & image. 13. The application should consist of three ASP files: Ask the user to login & read from a database to determine if the user is known. 10. the customized page should be displayed. Note: Only 5 student’s information per page should be displayed. If the user is not known. Implement a Web site for Information Technology department Using a) Frameset b) Tables c) Internal Linking d) Headers e) List Items f) Hyperlink for mailing 4. Develop a JavaScript program to get Register Number as Input and print the Student’s total mark and grades. Create an ASP application to display the students information from the Database. If the user is known at login. Create a server-side include file containing the AdRotator code to display 4 advertisements. 8. Create a Text Editor using VBScript. Write a function that takes an integer value and returns the number with its digits reversed. second ASP file is loaded asking the user to choose their preference for foreground color. develop a web site for online counseling. Using VBScript. Create a personal home page using HTML 2. 12.05BIT 316L INTERNET COMPONENTS & PROGRAMMING LAB L T P C 0 0 4 2 1. the function should return 1367. Develop a VBScript code to perform the functions of a Calculator. 9. 45 . Create an ASP application that allows the user to customize a web page. 3. For Ex. 7.

Date of Admission. 17. Create an ASP application for sending E-Mails using CDO. Create a contact list database in XML using style sheets. Design a web page for registering the following information into Oracle Database using ASP.14. Develop a XML schema for the database document type. E-Mail (check for validation) • Gender • Address • Branch & Year 16. 15. • Name • Reg. Date of Birth. Connect to a database using XML & display its contents using HTML Page 46 . Create a XML page for displaying staff details from the database 20. No. 19. 18. Create a formatted business letter using XML & DTD.

MPEG. software tools multimedia authoring and design process. Media Entertainment TEXT BOOK: 1. Some Basic Compression Techniques-JPEG. System Architecture. ODA. Television. Coding Requirements. REFERENCEBOOK: 1. Objectives: At the end of the course students would be able to use multimedia computing hardware. and Networks". Standards. 1st reprint – 2001. File Systems. Document Architecture.Application Subsystem. SGML.Basic Concepts. Data CompressionStorage Space. Mode of Evaluation : Assignment/ Seminar/Written Examination. Transport Subsystem. Entropy. "Multimedia computing. Computer Image Processing.Media Preparation. 47 . H. 2002. Introduction: Branch-overlapping Aspects of Multimedia. K. Music. software. Additional Operating System Issues. Medium. Main Properties of a Multimedia System. Multimedia. Speech. Media Communication. MHEG. Data Streams Characteristics for Continuous Media. Information Units.05BIT 401 MULTIMEDIA COMPUTING L T P C 3 0 0 3 Aim: The subject aims to introduce multimedia computing & communications covering various building blocks such as hardware. Integration in a Database Model. Multimedia Applications. Computer-based Animation. Multimedia Communication Systems. Pearson Education Asia. communications and Applications". Quality of Service and Resource Management Multimedia Database Systems and Characteristics: Data Analysis.Media and Data Streams. Rao. Operations on Data. Data Structure. "Multimedia Communication Systems: Techniques. Sound/Audio: Basic Sound Concepts. Real-time. Image and Graphics. Process Management. Global Structure. operating systems and DBMS. Introduction to Optical Storage Video and Animation: Basic Concepts. Introduction to Hypertext. A Reference Model for Multimedia Synchronization. Source. Content. Ralf Steinmetz and Klara Mahrstedt. Prentice Hall. Media Composition. Hypermedia. DVI Multimedia Operating Systems: Introduction. Media Integration. and Hybrid Coding. Media Consumption.261. Traditional Data Stream Characteristics. Resource Management.

VLSI.D. Computer Graphics Applications: CAD/CAM.. "Fundamentals of Interactive Computer Graphics". New Delhi. Steven Harrington. Foley J. McGraw Hill. 1986.A programming approach". 48 . 2000. 2D and 3D transformations. 2. REFERENCE BOOKS: 1. Prentice Hall. video monitors – Graphic software – Output primitives – Line and circle drawing algorithms – Attributes of output primitives Two-Dimensional Transformation: Clipping and windowing – Clipping algorithms – Segmented display files – Display file compilation – Modeling and modeling transformation Interactive Input Methods: Physical devices – Logical classification of input devices – Interactive picture construction techniques – Input functions. Image processing. games graphs and charts animation – Introduction of graphics and kernel system (GKS) – binding language for GKS – programming examples using GKS. Donald Hearn and Pauline Baker Computer Graphics. PHIGS. TEXT BOOK: 1. Objectives: The student would be able to understand and use Computer Graphics various Clipping algorithms. Van Dam A.05BIT 403 COMPUTER GRAPHICS L T P C 3 0 0 3 Aim: The subject aims to cover Interactive and Non Interactive computer graphics methods. Addison Wesley. "Computer Graphics. Introduction to Computer Graphics: Display devices – Hardcopy devices – Interactive input devices – Display processors – Graphic Adapters – basic function – Monochrome adapters. 2D and 3D modeling. 1990 Mode of Evaluation : Assignment/ Seminar/Written Examination. 3D concepts: Methods of 3D representation – 3D transformations – Viewing – 3D clipping – Hidden – Surface and Hidden – line elimination – shading and coloring methods – Basic modeling concepts and modeling methods.

MTR. Fault & Change Management. 49 . Principles of Security. TEXT BOOK: 1. Terminology & Conventions. 2003. NetFlow. Neo. Using. Analytical System Administration Open Source and Network Administration: Open Source Tools. 2004 REFERENCE BOOK: 1. Mani Subramanian. Installing. Traceroute.05BIT 405 NETWORK ADMINISTRATION L T P C 3 0 0 3 Aim: The subject aims to cover various aspects of networks system administration such as plan and design of an efficient community of computers. Mode of Evaluation : Assignment/ Seminar/Written Examination. Environment & Background. Netstat. Pearson Education. Objectives: The students would be able to understand and use various principles and practices of managing and administering networked systems.Ping. Oak. Tcpdump. Networked Communities. SNMP Overview. Mark Burgess. Over view of Custom Tools . Diagnostics. Installing. "Principles of Network and System Administration". Telnet. Host Management. Netcat. Bourne Shell. Overview of Service Monitoring. Security Implications. “Network Management – Principles & Practice”.Basics of Scripting. John Wiley & Sons. Over view of Basic TCP/IP tools . Configuring & Maintaining Sysmon Overview of Open Source Tools for Network Administration: MRTG. tools and systems for monitoring and managing network systems. User Management Models of Network & System Administration: Configuration and Maintenance. Running Programs from Cron. Programming Monitors. Introduction: System Components. Using & Maintaining SNMP Tools Application Level Services: Network Level Services.

05BIT 407

DATAWAREHOUSING AND DATA MINING ** L T P C 3 0 0 3

Aim: The subject aims to cover knowledge discovery process and to design and populate a business data warehouse. Objectives : To make familiar with the various concepts of data warehousing like meta data, data mart, summary table, fact data and dimension data. To sail along with the various approaches in data mining. To familiarize with the various data warehousing and data mining tools Data Warehouse and OLAP Technology for Data mining: Introduction to Data Warehouse- A multidimensional Data Model – Data Warehouse architecture – Data preprocessing- Data cleaning – Data integration and Transformation. Data Mining Introduction: Introduction to Data Mining – Data Mining Functionalities – Classification of Data Mining systems, Major issues in Data mining. Data Mining primitives, languages & system architecture: Data Mining primitives: Task – relevant data – kind of knowledge to be mined – Background knowledge – interestingness measures– presentation & visualization of discovered pattern - Data Mining Query language – Designing Graphical User interfaces based on DMQL - Architecture of Data mining. Association Rule Mining: Basic concepts – market basket analysis - Mining single dimensional Boolean association rules from transactional databases. Classification & prediction: What’s classification - issues regarding classification and prediction – Bayesian classification – prediction: linear – non linear. Cluster analysis: Types of Data in cluster analysis - Major clustering methods. Data mining applications.

TEXT BOOK: 1. Han J. & Kambler, M, “Data Mining: Concepts and Techniques”, Morgan Kaufmann, 2005. REFERENCE BOOKS: 1. Immon.W.H., “Building the Data Warehouse”, Wiley Dream Tech, 3rd Edition, 2003. 2. Anahory S., Murray, D, “Data Warehousing in the Real World”, Addison Wesley, 1st Edition, 1997.

Mode of Evaluation : Assignment/ Seminar/Written Examination.

50

05BIT E01

IMAGE PROCESSING

L T P C 3 0 0 3 Aim: This subject aims to introduce the concepts of image processing such as Representation of Image, Image Transform, Image Restoration using various approaches, Image segmentation and Image recognition and interpretation Objectives: The students would be able to understand and explain Fundamentals of Image processing, Image Transforms, Image restoration techniques, Image segmentation and Recognition & interpretation of Images. Fundamentals: Digital Image representation, steps in image processing, Elements of Digital Image processing systems. , Elements of visual perception, sampling and quantization, basic relationship between pixels. Imaging Geometry – some basic transforms, perspective transforms. Image Transform: Fourier transform, Discrete Fourier transform, Fast Fourier transform, properties of 2 – D Fourier transform, Image Enhancement – Spatial domain methods, Frequency domain methods, Enhancement by point processing, spatial filtering, Enhancement in the Frequency domain. Image Restoration : Degradation model, Algebraic approach to restoration, Inverse Filtering, Wiener Filter constraint least squares restoration, Restoration in the spatial domain, Image CompressionRedundancy, Compression models, Error free compression, Lossy compression, Image compression standards. Image Segmentation: Detection of Detection of Discontinuity – Edge linking and boundary detection, Thresholding Region oriented segmentation. Image representation – Representation schemes, Boundary descriptors, Regional descriptors. Recognition and interpretation: Elements of Image analysis, patterns and pattern classes, Decision and theoretic methods, structural methods, Interpretation. TEXT BOOK: 1. Rafel C. Gonzalez & Richard E. Woods, Digital Image Processing, Pearson Education, 2005 REFERENCE BOOK: 1. Anil K. Jain, Fundamentals of digital Image processing, PHI, 1989.

Mode of Evaluation : Assignment/ Seminar/Written Examination.

51

05BIT E03

COMPUTER SIMULATION & MODELLING L T P C 3 0 0 3

Aim: This subject aims to cover statistical models in simulation, Inventory systems, Random numbers & variables, Input and output analysis Objectives: The students would be able to understand and use discrete event simulation, simulation techniques, statistical methods. Introduction to Simulation: Advantages and disadvantages of simulation, areas of application, Systems and system environment, Components of a system, Discrete and continuous systems, Model of a system. Types of models, Discrete – events system simulation, Steps in a simulation study. Simulation Examples, Simulation of queuing systems, Simulation of inventory systems, other examples of simulation, discrete event simulation, general principles and computer simulation languages. Concepts in DES, Programming languages for DESS: FORTRAN, GASP, SIMSCRIPT, GPSS, SLAM, Summary and comparison of simulations. Statistical Models in Simulation: Review of terminology & concepts, Useful statistical models, Discrete distributions, Continuous distributions, Process, Empirical distributions. Queuing Models: Characteristics of queuing systems, queuing notation, Transient & steady state behavior of queuing notation, Transient & steady state behavior of queues, long run measures of performance of queuing systems, steady – state behavior of finite population models. Inventory Systems: Measures of effectiveness, Inventory policies, Deterministic systems, and probabilistic systems, Simulation in inventory analysis. Random Number Generation: Properties of random numbers, Generation of Pseudo – random. Nos., techniques for generating random nos., tests for random nos. Random variable Generation: Inverse transform technique, Direct Transformation for the normal distribution, Convolution method, Acceptance-Rejection technique. Input Data Analysis: Data collection, identifying the distribution, parameter estimation, goodness-of-fit tests. Verification and validation of simulation models: Model building, verification & validation, verification of simulation models, calibration & validation of models. Output Analysis For a Single Model: Stochastic nature of O/P data, types of simulations with respect to O/P analysis, measures of performance and their estimation, O/P analysis for terminating simulations, O/P analysis for steady-state simulations. Comparison and evaluation of alternative system designs: Comparison of two and several system designs, statistical models for estimating the effect of design alternatives. TEXT BOOK: 1.Jerry Banks, John S. Carson, Discrete-event System Simulation, PHI, 3rd Edition REFERENCE BOOK: 1. Karian, Z.A. and Dvdewicz. E.J., Modern Statistical Systems and GPSS Simulation, Freeman, 1991.

Mode of Evaluation : Assignment/ Seminar/Written Examination.
52

“Neural Computing”. Analysis.05BIT E05 NEURAL NETWORKS L T P C 3 0 0 3 Aim: The subject aims to introduce the concepts of Neural Networks with emphasis on supervised and unsupervised learning algorithms as well as on computational characteristics. “Neural Networks – A Comprehensive Foundation. TEXT BOOK: 1.R. Algorithms. Pearson Education. 2004 REFERENCE BOOKS: 1. Pattern Association: Auto associative Net: Architecture. Bidirectional Associative Memory: Architecture. Learning Vector Quantization: Architecture. Multi layer perceptrons. Simon Haykin.What is a neural Net . Analysis.How are Neural Nets being used . “Fundamentals of Neural Networks Architectures. 2nd Edition 2004. Applications.Where are Neural Nets being used . Algorithm. Application. Associative memories and Holographic Pattern Recognition system. Applications. Algorithm. Multi Layer Neural Nets as Universal Approximators. Simple Neural Nets for Pattern Classification: General Discussion. Hebb Net: Algorithm. Laurene Fausett. Pearson Education. Application. Applications. Applications. Back Propagation Net: Standard Back Propagation: Architecture. Neural Networks based on Competition: Kohonen Self –Organizing Maps: Architecture. Algorithm. I. Algorithm. Adaptive Resonance Theory: Introduction. Theoretical Results: Derivation of Learning rules. and Applications” 3rd Edition. Jackson. Introduction: Why Neural Networks and Why Now . Applications. ART1: Architecture. 2. Algorithm. pattern recognition techniques. ART2: Architecture. Algorithm. Perceptron: Architecture. 2000 Mode of Evaluation : Assignment/ Seminar/Written Examination. Applications. Application. Beale and T. Variations. 53 . Algorithm. Analysis.the McCulloch Pitt’s Neuron. Algorithm. Objectives: The students shall be able to understand the biological and artificial model of neuron. IOP Publishing. Storage Capacity.

all pass transfer function. Alan V. Proakis & Dimitris G. Mode of Evaluation : Assignment/ Seminar/Written Examination. analysis of coefficient quantization effects. parallel all pass realization of IIR transfer functions. 1996. Implementation. basic Finite Impulse Response(FIR) digital filter structures. And Ronald W. REFERENCE BOOKS: 1. musical sound processing. typical signal processing applications. 1998. complementary transfer functions. Oppenhein. spectral transformations of IIR filters. impulse invariance method of IIR filter design. TEXT BOOK: 1. Sanjit K. examples of typical signals. 2. Applications: Implementation consideration: basic issues. computation of the discrete Fourier transform the quantization process and errors. voice privacy system. and Applications Prentice-Hall. Examples. low pass IIR digital filter design. Mitra: Digital Signal Processing – A Computer –Based Approach. FIR design based on truncated Fourier series.05BIT E07 DIGITAL SIGNAL PROCESSING L T P C 3 0 0 3 Aim: To understand the underlying the mathematics behind digital signal processors and designing various DSPs.Transform-domain representations of Linear Time Invariant (LTI) systems: the frequency response. 1998. Manolakis: DSP Principles. Tata McGraw-Hill. Prentice – Hall. John G. software implementation. Schafer: Discrete – Time Signal Processing (Second Edition). computational complexity of digital filter structures. types of transfer functions. tunable iir digital filters. analysis of coefficient quantization effects in fir filters. digital sine-cosine generator. Objective: To design a appropriate filter and evaluate its efficiency by comparing with various design methods. basic Infinite Impulse Response (IIR) filter structures. discrete-time analytic signal generation. Digital Signal Processors: Overview of Motorola dsp563xx family of digital signal processors. Digital Filters: Structures: block diagram representation. bilinear transform method of IIR filter design. typical signal processing operations. the transfer function. digital fm stereo generation. computer-aided design of digital filters. Design: preliminary consideration. Algorithms. subband coding of speech and audio signals. short-term discrete Fourier transform. signal flow-graph representation. state-space structures. why digital signal processing . discrete-time processing of random signals. spectral analysis using dft. 54 . cascaded lattice realization of IIR and FIR filters. FIR filter design based on frequency sampling approach. stability test. all pass filters. digital two-pairs. design of digital IIR notch filters. minimumphase and maximum-phase transfer functions. architectures of dsp56307: assembly language instructions and programming: typical software applications. equivalent structures. Review of Basic Concepts: Signals and signal processing: characterization and classification of signals. Representative applications: dual – tone multifrequency signal detection.

Uncertainty-Probabilistic Reasoning Systems: Making simple and complex decisions Nonmonotonic reasoning and Truth Maintenance.Problem SolvingSearching-Heuristic Search-Game Playing. Planning: Representation for planning-Partial order planning-Conditional planning. REFERENCE BOOKS: 1. Stewart Russel. 2. Introduction to Predicate calculus.Replanning agentLearning-Analyzing differences-Explaining experience-Correcting mistakes-Recording cases-Overview of Version space method-Identification trees-Neural nets and Genetic algorithms. Mode of Evaluation : Assignment/ Seminar/Written Examination. 1995. Expert Systems and Robotics. PHI.First order logic-Inference in first order logic-Logical reasoning. "Artificial Intelligence-A Modern Approach". Tata McGraw Hill. "Artificial Intelligence".Perception and Language Processing . predicate calculus. Over view of AI languages such as PROLOG and LISP Agents that Reason Logically. Substrates and cognitive modeling. Addison Wesley. "Artificial Intelligence". 1999. Expert systems Architecture. problem solving techniques. 3rd Edition. reasoning systems and Expert systems AI-Foundations: History-Intelligent Agents . Semantic Nets and Description Matching: Frames-Inheritance and common sense Rules-Rule Chaining. Patrick Henry Winston. knowledge representation. 1993. reasoning system and expert systems Objectives: The students would be able to understand and explain the basics of Artificial Intelligence.05BIT E09 ARTIFICIAL INTELLIGENCE L T P C 3 0 0 3 Aim: The subject aims to cover fundamentals of Artificial Intelligence. Elain Rich and Kevin Knight. 55 . TEXT BOOK: 1. knowledge representation. Peter Norvig.

Tata McGraw Hill. Devices and Buses for Device Networks: I/O Devices – Timer and Counting Devices – Serial Communication Using the I2 C. 1997 Mode of Evaluation : Assignment/ Seminar/Written Examination. Berger. Deadline and Interrupt Latency Program Modeling Concepts: Single and Multiprocessor Systems Software – Development ProcessModeling Processes for Software Analysis Before Software Implementation – Programming Models for Event Controlled or Response Time Constrained Real Time Programs – Modeling of Multiprocessor Systems Software Engineering Practices: Embedded Software Development Process-Software Algorithm Complexity – Software Development Process Life Cycle and its Models – Software Analysis – Software Design – Software Implementation – Software Testing. 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. Validating and Debugging – Real Time Programming Issues During the Software Development Process – Software Project Management – Software Maintenance –Unified Markup Language (UML) – Interprocess Communication & Synchronization of processes. PCI. “Embedded Systems-Application. Rajkamal. programming models and Interprocess communication.05BIT E11 EMBEDDED SYSTEMS L T P C 3 0 0 3 Aim: The subject aims to cover the concepts of embedded systems. Objectives: The student would be able to understand and use in embedded systems. their design and applications. 2003 REFERENCE BOOKS: 1. device drivers. Practice & Design”. PCI – X and Advanced Buses Device Drivers and Interrupts Servicing Mechanism: Device Drivers – Parallel Port Device Drivers in a System – Serial Port Device Drivers in a System – Device Drivers for Internal Programmable Timing Devices – Interrupt Servicing (Handling) Mechanism – Context and the periods for Context – Switching. “Embedded Systems Design”. ‘CAN’ and Advanced I/O Buses between the Networked Multiple Devices – Host System or Computer Parallel Communication between the Networked I/O Multiple Devices Using the ISA. 56 . TEXT BOOK: 1. Task & Threads – Multiple processes in an Application – Problems of Sharing Data by Multiple Tasks & Routines – Interprocess Communication. CMP Books. Memories and I/O Devices. Arnold S. software engineering practices in embedded systems development and Inter process communication.

expert systems. Objectives: The students will be capable of designing the decision support system for managers to take the decision. knowledge-based DSS & AI concepts and definitions. data visualization and multidimensionality. the DSS of the future. the user. systems models. access. Mode of Evaluation : Assignment/ Seminar/Written Examination. database management systems in DSS. financial and planning modeling. the technology of GDSS. and visualization. OLAP: data access and mining. TEXT BOOK: 1. data collection and data problems. model base management. evaluation. capabilities. querying and analysis. Aronson: “Decision Support Systems and Intelligent Systems” (Fifth Edition). Support systems. 1998. mss modeling in spreadsheets. ready-made quantitative software packages. visual modeling and simulation. Prentice-Hall. a framework for decision support. The GDSS meeting process: Constructing a GDSS and the determinants of its success. and components of DSS. executive information (support) systems. multidimensional modeling. treating certainty. the nature and sources of data. the DSS development process. the evolution and attributes of computerized decision aids. uncertainty and risk. the modeling process. DSS hardware. data warehousing. GDSS research challenges Modeling for mss. decision making in groups. visual spreadsheets. the decision (electronic meeting) room. Efrain Turban and Jay E. DSS construction. analysis. Heuristic Programming: Simulation. hybrid support systems. The need for computerized decision support technologies. DSS configuration: Characteristics. types of knowledge-based DSS. group DSS.05BIT E13 DECISION SUPPORT SYSTEM** L T P C 3 0 0 3 Aim: To provide an environment to understand the system and to make decisions. static and dynamic models. AI verses natural intelligence. the AI field. Intelligent DSS: The future of AI. introduction and definitions. classifications of DSS. decision analysis of a few alternatives. 57 . GDSS software idea generation. distinguishing DSS from management science and MIS. group decision support systems. artificial neural networks. influence diagrams. the goal of GDSS and its technology levels. the concept of decision support systems. how AI differs from conventional computing. the internet and commercial database services. negotiation. Database organization and Structure: Data warehousing. knowledge in AI. optimization. intelligent database and data mining.

Risk management. 58 . "Managing Global Software Projects". resource allocation. software configuration management and software maintenance. Activity Planning: Project schedules. 3rd Edition. Risk Management. “Software Project Management”. Tata McGraw Hill. 2004 REFERENCE BOOK: 1. Project scheduling. Ramesh Gopalaswamy. They would be able to do Activity planning. software configuration management and software maintenance and its characteristics Introduction: Software projects-various type of projects-problems with software projects-an overview of project planning-project evaluation-project analysis and technical planning-software estimation.sequencing and scheduling projects – network planning modelshortening project duration identifying critical activities.05BIT E15 SOFTWARE PROJECT MANAGEMENT L T P C 3 0 0 3 Aim: This subject aims to introduce software project management processes such as Activity planning. Risk Management: Resource allocation-monitoring and control-managing people and organizing teamsplanning for small projects. projects scheduling. Resource allocation. TEXT BOOK: 1. Bob Hughes. Tata Mc Graw Hill. Software Configuration Management: Basic management-prototyping models of prototyping. Mike Cotterell. functions-responsibilities-standards-configuration Software Maintenance and its characteristics: Tasks – side effects – maintenance issues – source code metrics – software reliability – definition of software reliability – concept of software repair and availability – software error and faults – estimating number of bugs in computer program – reliability models – availability models. 2001 Mode of Evaluation : Assignment/ Seminar/Written Examination. Objectives: The students would be able to understand and use the concepts of software project management.

Objectives: The students would be able to understand and use encryption algorithms such as RSA. Prentice-Hall of India Pvt Ltd. Tata McGraw Hill. Public Key Cryptography: Principles of public-key cryptosystems – The RSA algorithm . “Network Security” – 2nd edition. Mike speciner. 2002. 59 . Mode of Evaluation : Assignment/ Seminar/Written Examination. “Cryptography and Network Security”.Different approaches of Intrusion detection . Charlie Kaufman. 2005. 2nd edition.Modern Techniques: The Data Encryption Standard – The Strength of DES – Differential and Linear. Worms: Intruders – Intrusion techniques – Password protection – Access control – Password selection strategies -Intrusion detection. Atul Khate. Intruders and Viruses. TEXT BOOK: 1. authentication techniques digital signatures and System-level security issues. 2002. Blow Fish etc.Key management – Diffie-Hellman key exchange – Elliptic curve cryptography Message Authentication and Hash functions: Authentication requirements –Authentication functions – Hash functions – Security of hash functions and MAC. 2. Attacks. Raja perlman.Audit records Viruses and related Threats – Firewalls: Firewall design principles – Firewall characteristics – types of firewalls – Firewall configurations. It also covers the topics such as cryptography and various encryption algorithms. Digital Signatures and Authentication Protocols: Digital signatures – Authentication protocols – Digital signature standard. REFERENCE BOOK: 1. IP Security: Overview – Architecture – Authentication header – Web Security: A comparison of Threats on the Web – Secure Socket Layer and transport layer security: SSL architecture – SSL record protocol – Handshake protocols. Electronic Mail Security: Pretty Good Privacy – PGP services – Transmission and reception of PGP messages – PGP message generation – PGP message reception. Pearson Education. Services & Mechanisms: Security attacks – Security services – Network Security Model. Hash Algorithm: Message Digest algorithm (MD5) – Secure Hash algorithm (SHA-1) – HMAC. William Stallings “Cryptography and Network security – Principles and Practice".05BIT E17 NETWORK SECURITY L T P C 3 0 0 3 Aim: The subject aims to cover the significance of security of computer systems and computer networks. Crypto-analysis. Conventional Encryption: Classical Techniques: Conventional Encryption model .Stenography – Classical Encryption Techniques.

A Case Study Reuse of Architectural Assets: Creating Products and Evolving a Product Line. a Case Study in Product Line Development Reference Architectures: Open Systems.Capturing Architectural Information in an ADL. The Process of Engineering an Open System. Architectural StylesOrganizing. A Case Study in Utilizing Architectural Structures. Architecture Business Cycle: Software Processes and the Architecture Business Cycle. Importance of Software Architecture. component based systems and open systems. Len Bass. An ADL Example. Pearson Education Asia. Case studies of Web and CORBA. Organizational Implications of a Product Line.D. and Reference Architectures. Achieving Quality Goals with Architectural Styles. Assessing Architecture for Maintainability. System Development using ADL. Rick Kazman. Various Architectural Structures. Component-Based Systems. architectural styles. Software Architecture in the Future TEXT BOOK: 1. 2001. Raphael Malveau Thomas Mowbray Ph. Software Architecture Analysis Methods: Application Examples. Paul Clements. REFERENCE BOOK: 1. analysis methods. Architecture Reviews-Costs & Benefits. reuse of architectural assets and open systems. Software architecture analysis methods. Over view of Architecture-Based Development. Review Techniques & Practices. Refining and Using Architectural Styles. “Software Architecture Bootcamp”. Mode of Evaluation : Assignment/ Seminar/Written Examination. Objectives: The students would be able to understand the objectives and importance of software architecture.Applying Unit Operations to User-Interface Software. 60 . Architecture Description Languages (ADL). Characteristics of a Good Architecture.05BIT E19 SOFTWARE ARCHITECTURE L T P C 3 0 0 3 Aim: This subject aims to introduce the basics of software architecture. Reference Models. Standards. review techniques. Addison Wesley Professional. Basics of Software Architecture. "Software Architecture in Practice". Creating & Analyzing Architecture: Architectures and Quality Attributes. Choosing an ADL. Architectural Styles. Unit Operations. A Case Study in Building a Web-Based System from Off-the-Shelf Components. A Case Study in Designing for High Availability. Ramifications of Addressing Quality Attributes.

Writing Web Application with the . WP Publishers and Distributors. Threading NET Framework Concepts II: Reflection. Ltd. TEXT BOOK: 1. 2003 REFERENCE BOOKS: 1. Objectives: After completion of this course the students will be able to undergo projects in .NET.NET Framework. MSDN.Remoting -XML Parsing-Security. WP Publishers and Distributors. 61 .NET Framework Concepts I: console I/O-working with strings-formatting and conversion. 2003 Mode of Evaluation : Assignment/ Seminar/Written Examination.NET Introduction to Microsoft . . 2001 2.NET.NET C# Language Fundamentals: Object Oriented Programming in C#.NET Framework: Introduction to ADO.NET Framework. .Rick Leinecker ASP.NET Platform: Building Blocks of . MSDN. Introduction to Web Services: Writing Mobile Application with . Microsoft C# Language specification. Advanced Concepts. Writing GUI Applications with . Microsoft Visual Basic .05BIT E21 WEB SERVICES L T P C 3 0 0 3 Aim: To provide the student with the basics of . IDG Books India Pvt. MSDN. 2003 3. WP Publishers and Distributors.NET on the edge.NET framework.file/O – serialization.NET framework. C#.

” Oxford University Press. Looney. Christopher M. Newyork Oxford University Press – 1997. TEXT BOOK: 1. Mode of Evaluation : Assignment/ Seminar/Written Examination. “Neural Networks for Pattern Recognition. Artificial Neural Network Structures. Bishop. 1995. REFERENCE BOOK: 1. “Pattern recognition using Neural Networks – theory and algorithms for engineering and scientists”. 62 .Carl G. Basic Concepts of Pattern Recognition: Decision theoretic algorithms – structural pattern recognition. Objectives: The students would be able to understand and explain fundamentals of pattern recognition. Neural Feature and Data Engineering: Neural engineering and testing of FANN’s – feature and data engineering. their applications and comparative studies of feed forward artificial networks.05BIT E23 PATTERN RECOGNITION L T P C 3 0 0 3 Aim: This subject aims to cover basic concepts of Pattern recognition. Testing and Applications: Some comparative studies of feed forward artificial networks – pattern recognition applications in texture classification & recognition – speech recognition – neural processing of digital images – character recognition. Artificial Neural Network Structures: Supervised training via error back propagation: derivations. Advanced learning algorithms for Pattern Recognition. Advanced Fundamentals of Neural Network: Acceleration and stabilization of supervised gradient training of MLPs – advances in network algorithm for classification and recognition – recurrent neural networks.

Multimedia 1 2 3 4 5 6 7 8 9 Create Icons using any of the macromedia tools. Shearing 9 Draw an object and perform the shearing. Create Logos using any of the macromedia tools.05BIT 413L MULTIMEDIA & GRAPHICS LAB L T P C 0 0 4 2 Computer Graphics Reflection Draw an object to produce a mirror image relative to an axis of Reflection 1 X – axis 2 Y – axis Transformations 3 Draw an object and shift the object to another specified location 4 Draw an object and perform rotation by specified angles Clipping 5. 10 Draw any three dimensional object and see all possible views of it. Manipulate Digital Video using Video editing tool. Line Clipping Create a line and clip a part of that line to other location. 11 Draw a Car by the combination of lines and circles and move the car. 6 Window Clipping Draw an object make a window on that shift that window to another location 7 Circular Clipping Draw an object make a circle on that shift that circle portion to another location. Using Fireworks create a Multimedia presentation. Manipulate Digital Audio using Sound editing tool. Create a Image and Change the Image using Photoshop Create a Morphing images using any macromedia tools Create animation picture using flash. 8 Polygon Clipping Make a polygon and make a window on that shift that window to another location. 63 . Create a Multimedia Presentation using Flash.

Multi Router Traffic Grapher  View the traffic patterns of one or more networks at once  Determine if one or more is experiencing an abnormal traffic load.  Traceroute  MTR 7.Simple Network Management Protocol Tools  Query a variable and view the response  Set a variable and determine if it was successful  Query entire tables with get-next-request  Receive traps 2. SNMP.  Understand how traffic is distributed across the network. Netstat 64 . Oak . Packet level debugging using  Tcpdump  Ping  Telnet  Netcat. send to stdout  Receive flows.Message Log Management Tool  Examines a message log in syslog format  Set up to ignore unimportant messages  Condense redundant information  Produce reports of important messages  Notify operators immediately of critical messages 6. store to disk  Print flow data to the screen  Produce flow reports for other programs  Print flow statistics to the screen  Detect suspicious network traffic  Send flow data in NetFlow format  Generate test flow data  Import/Export data from/to other NetFlow tools 5. MRTG . suggest plan capacity needs for the future 3. NetFlow . Neo .05BIT 415L NETWORK ADMINISTRATION LAB L T P C 0 0 4 2 1.  View history of the network available and look for sudden changes that might account for a problem.Bandwidth Monitoring Tool  Check bandwidth usage or determine on which switch port a particular host resides  Use remote login session and check bandwidth  Find the host and disable its network 4.Flow Monitoring Tool  Receive flows.

65 .

Sign up to vote on this title
UsefulNot useful