It Syllabus

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
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
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
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
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
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. 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. By the end of the course, the students are expected to develop the necessary mathematical skills, physical understanding of problems and intuition to independently analyze the mathematical equations which model the problems in their respective fields of study.
CAM-1 portion
Functions of a Complex Variable: Functions of a complex variable, limits and continuity, Cauchy Riemann equations, Analytic and Harmonic functions Complex potential Applications to flow around a corner and around a cylinder, Branch points, branch cuts, linear transformations (w = zA+B, w = z 2 ,w= ez), Bilinear transformation, concept of conformal transformation Qualitative discussion on applications. Complex Integration: Integration in the complex plane along a contour, the Cauchy- Goursat theorem, integral theorem Derivatives of analytic functions, Taylor and Laurent series(without proof's) singularities zeros Poles, Residues, Cauchys Residue theorem Evaluation of integrals by the method of residues, Jordans lemma (without proof), Indented contour integral, Inversion contours for Laplace, Fourier and ztransforms.
CAM-2 portion
Partial Differential Equations: Introduction Formation of PDEs Solution of PDE General, Particular and Complete integrals Lagranges Linear Equations Linear PDE of Higher order with Constant Coefficients Homogeneous and non homogeneous equation Solution of PDEs by the method of separation of variables. Applications of Partial Differential Equations : Solution of Laplace equations in Cartesian, Cylindrical and Spherical coordinates variable separable method: Potential flow over a sphere. Wave EquationVibrations of a Stretched string-Variable Separable Method- DAlemberts solution for the initial value problem, Vibrations of a circular membrane Diffusion equation in Cartesian and Cylindrical coordinates.
TERM-END portion
Integral Transforms, Difference Equations & Z-transforms: Difference equations with constant coefficients-Complementary function, particular integral method of undetermined co-efficient, variation of parameters technique (without proof), application to ladder type electrical network. Z-transform definition relation between Z transform and Laplace transform, Z-transform of elementary functions, properties of Z-transforms (proofs not required) Initial and final value theorems- Inverse Z-transforms partial fraction expansion method, Inversion contour method-solution of difference equations by Ztransform method. Exponential Fourier series Fourier Integral Transforms Definition Fourier
5
Integral Fourier sine and cosine transforms; - Properties of Fourier transforms Convolution theorem for Fourier transforms Parsevals identity for Fourier transforms (proof not required) Application of Integral Transforms to Partial differential equations: (i) Heat flow in an infinite bar (ii) Wave propagation on a semi infinite string (iii) Steady state heat flow in a semi-infinite domain.
TEXT BOOKS: 1. Erwin Kreyzsizig, Advanced Engineering Mathematics, 8th Edition, John Wilag & Sons (Wiley student Edison), 2004. 2. B. S. Grewal, Higher Engineering Mathematics, 38th Edition, Khanna Publications, 2005. REFERENCE BOOKS: 1. J. W. Brown and R.V. Churchill, Complex variables and application, McGraw Hill International ed., 7th Edition, 2004. 2. R. V. Churchill and J. W. Brown, Fourier series and Boundary value problems, International student edition (1978). 3. Ian Sneddon, Elements of Partial Differential equations, McGraw Hill International edition (1985). 4. MichaelD. Greenberg, Advanced Engineering Mathematics, 2nd Edition, Pearson Education (2002). 5. Peter V. O Neil, Advanced Engineering Mathematics, 5th Edition, John Wiley & Sons (2000).
Mode of Evaluation : Assignment/ Seminar/Written Examination.
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). It covers algorithm analysis for the run time complexities and the space requirements. Objectives: To make the Students learn various types of data structures and algorithm analysis. The students would be able to implement various data structures and apply operations on them and also implement various sorting and searching techniques.
CAM-1 portion
Algorithm Analysis: Mathematical background model running time calculations complexity analysis Abstract Data Types (ADT) asymptotic notations. Stacks, Queues & Lists: Stack: ADT stack model implementation of stacks applications of stacks infix, prefix and postfix expressions and their conversions, Queue: ADT queue model array implementation of queues, List: ADT simple array implementation of lists linked lists doubly and circular linked lists cursor implementation of linked lists polynomial addition and multiplication, Overview of Garbage collection & Compaction
CAM-2 portion
Trees: Preliminaries implementations of trees tree traversals (inorder, preorder, postorder) binary trees implementation expression trees binary search trees threaded binary trees B_tree B+trees hashing hash function, depth first search and breadth first search shortest path algorithm. Sorting Techniques: Insertion sort and its analysis, Shell sort, Heap sort and its analysis, merge sort and its analysis, quick sort and its analysis, bucket sort, selection sort, external sort.
TERM-END portion
Algorithm Design Techniques: Divide and Conquer Algorithm Strassens matrix multiplication and its analysis, Greedy Method- knapsack 0/1, Dynamic Programming- traveling salesman problem, Back Tracking- 8 queens problem, Branch and Bound- traveling salesman problem algebraic manipulations, Lower Bound Theory- Basic concepts of NP-hard and NP-complete. TEXT BOOK: 1. Mark Allen Weiss, Data Structures & Algorithm Analysis in C++, Addison Wesley, 2004.
REFERENCE BOOKS: 1. E. Horowitz, S. Sahni and S. Rajesekar, Computer Algorithms, Galgotia-1999. 2. Jean-Paul Tremblay and Paul. G. Sorenson, An Introduction to Data Structures with Applications, Tata McGraw Hill, 1991.
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, application and selection of appropriate devices to achieve a particular circuit function. Objective: The students would become aware of the range of devices with respect to frequency, temperature, power ratings etc. The students will understand the constructional features and characteristics of various electronic devices and circuits. Semiconductor Basics: Review of extrinsic semiconductor drift and diffusion currents thermal generation of minority carriers Hall Effect. Junction Diodes- Energy band diagram PN junction junction diode volt ampere characteristics ratings transition and diffusion capacitance varactor diode avalanche and Zener break down Zener diode tunnel diode PIN diode, clipper and clamper circuits. Bipolar Junction Transistor: Principle of transistor action current components cutoff, active and saturation region input and output characteristics CE, CB, & CC Configurations small signal and large signal beta transistor breakdown ratings Thermal runaway problems Use of Heat sinks. FET And Other Devices: Constructional features and characteristics of JFET and MOSFET depletion and enhancement modes VVR operation of FET handling precautions for MOSFET construction and characteristics of UJT, fabrication and characteristics of four layer devices such as SCR, TRIAC and DIAC. Photo Electric Devices: Photo emissivity - photo electric theory - Photo diodes Photo voltaic cell LED & LCD Photo multiplier circuit Light absorption and photo devices Photo conductive cell (LDR) Photo transistor PN junction LASER Solar energy converters. Electronic Circuits: Half wave and full wave rectifier circuits performance characteristics of rectifier circuits filter consideration capacitor, inductor, L section, RC section filters Voltage regulators current regulators, IC voltage regulators protection circuits for DC power supplies switched mode power supplies. TEXT BOOK: 1. G.K. Mithal, Electronic Devices & Circuits, Khanna Publishers, New Delhi, 2001. REFERENCE BOOKS: 1. Ben.G. Streetman, Solid state electronic devices, Prentice Hall of India, 1999. 2. S.P. Mathur, D.C.Kulshreshtha and P.R. Chanda, Electronic Devices and Applications of Integrated Circuits, 1998. 3. J. Millman, C.C. Halkias, Electronic Devices and Integrated Circuits, McGraw Hill, 1997.
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. The subject focuses on important application areas of computing and Information Technologies. Objectives: The students will be able to understand the importance of IT in business environment and the technologies involved in knowledge engineering. The students will acquire basic knowledge about Internet, multimedia, virtual reality based concepts. The students will be exposed to the application areas of IT. IT in the Business Environment- Introduction: Business and Information Technology, Information Technologies in the Modern Organization, Information Technology for Multimedia Communication, Principles of Visual Information Analysis IT Infrastructure- Computer Hardware, Computer Software, Managing Organizational Data and Information, Telecommunications and Networks, The Internet, Intranets, and Extranets Applying IT for Competitive Advantage: Functional, Enterprise, and Inter-organizational Systems, Electronic Commerce, Computer-Based Supply Chain Management and Information Systems Integration, Data, Knowledge, and Decision Support, Intelligent Systems in Business. Informational and Organizational Goals- Strategic Information Systems and Reorganization, Information Systems Development, Implementing IT: Ethics, Impacts and Security. Important Application Areas - Issues & Challenges, IT in Healthcare & Telemedicine, Remote Sensing and GIS Techniques, Cybermediary Concepts, Principles and Applications of Soft Computing, Industrial information Technology, IT in Mining and Electrical Load Forecasting, Information Processing from Document Images, IT for Rural Development. TEXT BOOK: 1. Efraim Turban, R. Kelly Rainer, Richard E. Potter, "Introduction to Information Technology", John Wiley & Sons, 2002. REFERENCE BOOKS:
1. Ray Ajoy Kumar, Acharya Tinku, "Information Technology: Principles and Applications",
Prentice Hall of India
2. Dennis P. Curtin, Kim Foley, Kunal Sen, Cathleen Morin, Introduction to Information
Technology The breaking ware Tata McGraw Hill.

10
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, design steps involved in flip-flop, shift register and designing a simple computer which is capable of providing few arithmetic and logical operations. Objectives: The students shall be able to understand Boolean laws, Boolean algebra, Boolean logic, logic gate fundamentals, function of flip-flop and shift register, arithmetic and Logic unit, understand the memory representation in ROM, RAM and CPU.
CAM-1 portion
Number Systems and Boolean algebra: Number systems converting number from one base to another complements algorithms for rs and r-ls complements sign. Floating point representation. CodesBinary decimal, error detection reflection alphanumeric codes. Basic laws, theorems and properties of Boolean algebra Boolean functions canonical and standard forms logical operations logic gates Karnaugh map up to 6 variables Sum of Products (SOP) and Product of Sums (POS) simplification with dont care condition tabulation method. 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. Sequential Logic Design- 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. Processor Organization: Memory unit inter register transfer micro operations bus organization scratch pad memory ALU design of ALU - status register effect of O/P carry design of shifter processor unit design of accumulator. Control Logic Design: Control organization PLA control microprogram control hardwired control microprogram sequencer microprogrammed CPU organization. Computer Design: Computer configuration instructions and data formats instruction sets timing and control execution of instruction design of computer. TEXT BOOK: 1. Morris M. Mano, "Digital Design", Prentice Hall India, Third Edition, 2001 REFERENCE BOOKS: 1. Thomas C. Bartee, "Computer Architecture Logic Design", Tata McGraw Hill 1997. 2. A. P. Malvino and D. P. Leach, Digital Principles and Applications, 4th edition, McGraw Hill 1999.
11
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, evolution of c++ as a object oriented programming language with focus on generic programming with templates and Exception Handling. Objectives: Students will be able to know the fundamentals of object oriented programming and incorporate OOPs features such as inheritance, polymorphism, templates using c++ as language. Introduction to Fundamentals concepts: Object oriented fundamentals- Structured versus objectoriented development, elements of object oriented programming, fundamentals of OO-class, object, and abstraction and its importance, encapsulation, polymorphism, benefits of OOP, structure of C++ program. Classes and Objects: Working with classes- Classes and Objects- Class specification, class objects, accessing class members, defining member functions, inline functions, accessing member functions within class, data hiding, class member accessibility, empty classes, constructors, parameterized constructors, constructor overloading, copy constructor, new, delete operators, this pointer, friend classes and friend functions. Overloading: Overloading-Function overloading, operator overloading- overloadable operators, unary operator overloading, operator keyword, limitations of increment/decrement operators, binary operator overloading, arithmetic operators, concatenation of strings, comparison operators, Generic programming with templates-Function templates, class templates. Inheritance: Inheritance- Base class and derived class relationship, derived class declaration, Forms of inheritance, inheritance and member accessibility, constructors in derived class, destructors in derived class, constructor invocation and data member initialization, data conversion, abstract classes, virtual base classes, virtual functions. Exception handling and Files: Files and Streams-Opening and Closing a file, file modes, file pointers and their manipulation, sequential access to a file, ASCII and binary files, random access to a file, error handling during file manipulations, Exception handling-exception handling model, exception handling constructs, lists of exceptions, catching exceptions, handling exceptions. TEXT BOOK: 1. K.R.Venugopal, T.Ravishankar, and Rajkumar, "Mastering C++, Tata McGraw Hill, 1997 REFERENCE BOOKS: 1. E.Balagurusamy, Object Oriented Programming with C++, Tata McGraw Hill, 2nd Edition, 2004, 2. Bjarne stroustrup, The C++ programming Language, Addison Wesley, 3rd edition, 1988.
12
05BIT 213L OBJECT ORIENTED PROGRAMMING LAB (Implementation of OOPS AND Data Structures Concepts) L T P C 0 0 4 2 1. Program illustrating function overloading feature. 2. Programs illustrating the overloading of various operators Ex: Binary operators, Unary operators, New and delete operators etc. 3. Programs illustrating the use of following functions : a) Friend functions b) Inline functions c) Static Member functions d)Functions with default arguments. 4. Programs illustrating the use of destructor and the various types of constructors (no arguments, constructor, constructor with arguments, copy constructor etc). 5. Programs illustrating the various forms of inheritance : Ex. Single, Multiple, multilevel, hierarchical inheritance etc. 6. Write a program having student as an abstract class and create many derived classes such as Engg. Science, Medical, etc. from students class. Create their objects and process them. 7. Write a program illustrating the use of virtual functions. 8. Write a program which illustrates the use of virtual base class. 9. Write Program illustrating File Handling operations Ex. a) Copying a text files b) Displaying the contents of the file etc. 10. Write programs illustrating how exceptions are handled (ex: division-by-zero, overflow and underflow in stack etc) Data Structure: 1. Implementing Stacks and queues. 2. Implementation and processing in lists. 3. Implementation of Binary trees and its traversals. 4. Implementation of Graphs and its ttraversals. 5. Implementation of shortest path algorithm. 6. Sorting: a. Insertion sort b. Merge sort c. Quick sort d. Selection sort 7. Searching: a. Linear search b. Binary search
13
05BIT 215L
ELECTRONIC DEVICES LAB
L T P C 0 0 4 2 LIST OF EXPERIMENTS: 1. Study of CRO and measurement of amplitude frequency time period and phase angle. 2. Forward and reverse characteristics of PN junction diode. 3. Characteristics of Zener diode and study of its power ratings. 4. Input and output characteristics of BJT (CE CB CC) and graphical determination of h-parameters. 5. Drain and transfer characteristics of JFET and graphical determination of transconductance. 6. Static emitter characteristics of UJT and PUT. 7. V-I characteristics of SCR and TRIAC. 8. Switching characteristics of BJT SCR and MOSFET. 9. V-I characteristics of tunnel diode and varactor diode. 10. Study of Logic Gates (AND OR NAND NOT EXOR gates). 11. Study of Flip flops (D T JK SR flip-flops). 12. Design and testing of Half and Full adders. 13. Design and testing of Half and Full subtractor. 14. Implementation and testing of 3 bit binary ripple counter. 15. Implementation and. testing of code converters. 16. Implementation and testing of Multiplexers. 17. Implementation of shift registers using flip-flops. 18. Study of decade counter using flip-flops.
14
05BIT 202
PROBABILITY, 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. By the end of the course, students will Have an understanding of the Probability concepts. 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. 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. Probability and Random Variables: Axioms- Conditional Probability- Baye's Theorem- Independent Events-Random Variables-Distribution Function-Density Function (PDF)- Random Vector-Joint Distribution- Joint Density- Conditional Distribution and Density Functions- Independent Random Variables- Binomial, Poisson, Normal, Exponential, Gamma, Weibull distributions. Statistical Parameters: Mathematical Expectation- Variance- Moment Generating Function-Characteristic Function-Regression and Correlation- Partial and Multiple correlations. Tests of Statistical Hypothesis: Large sample Tests - Procedure of Testing Hypothesis- small sample tests - Students t-distribution - F-test - Chi-square test- theory of estimation. ANOVA: One way and Two way classifications- CRD-RBD-LSD. Statistical Quality Control: Control Charts - Control Charts for Measurements - x -chart- R-chartControl Charts for Attributes- p-chart- np-chart- c-chart Reliability: Terms related to Reliability- Hazard Models- System Reliability - Reliability Allocation Maintainability and Availability. Queuing Theory: Preliminary Ideas (Markov Chains) - Exponential Distribution- Little's formula - Pure Birth and Death Models. TEXT BOOK:
1. R.E.Walpole, R.H.Myers, S.L.Myers and K.Ye, Probability and statistics for Engineers and
Scientists, 7th Edition, Pearson Education, 2003. REFERENCE BOOKS:
1. 1. Bhat, B.R, Modern Probability Theory, 3rd Edison. New Age International Pvt. Ltd., New
Delhi, 1999. 2. Freund, JE, Mathematical Statistics, Prentice Hall International, 1998. 3. Rohatgi, V.K. and Ebsanes Saleh, A.K. Md., An introduction to Probability and Statistics, 2nd Ed., John Wiley & Sons, Inc., New York, 2002. 4. Morris H. DeGroot, Probability and Statistics, 3rd Edition, Addison-Wesley, 2002. 5. J.L.Devore, Probability and Statistics, 5th Edition, Thomson, 2000. Mode of Evaluation : Assignment/ Seminar/Written Examination.
15
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, the design of computers, including the instruction sets, hardware components, system organization, Memory Management and Networking. Objectives : At the end of the course students should be able to understand the basic principles such as locality of reference, coarse-grain parallelism, overlapping communication and computation, performance/power trade-offs, and reliability, also how the computer systems are organized and the characteristics of modern processors that affect system architecture. Introduction: Nature of computing, Elements of Computers, Limitations of Computers - the evolution of computers- Mechanical Era, Electronic Computers, The later generation the VLSI era - Integrated Circuits, Processor Architecture, System Architecture. Design Methodology - System design - System Representation, Design process, The Gate level the Register level- Register - level components, programmable logic devices, Register level design the Processor Level - Processor Level Components, Processor level design. Processor Basics: CPU organization: Fundamentals; Data Representation: Basic formats, Fixed Point Numbers, Floating point numbers; Instruction Sets: Instruction formats, Instruction Types, Programming Considerations. Arithmetic Logic unit: Data Path Design-Fixed point arithmetic-Addition and Subtraction, Multiplication, Division; Arithmetic Logic Units- Combinational ALU, Sequential ALU Advanced Topics- Floating point Arithmetic, Pipeline Processing Memory Organization: Memory technology: Memory Device Characteristics, Random Access Memory (RAM), Serial Access Memory; memory systems: Multilevel memories, Address translations, Memory Allocation Caches: Main features, address mapping, Structure versus performance. System Organization- Communication methods: Basic concepts, Bus control IO and System Control: Programmed IO, DMA and Interrupts, IO processors, Operating Systems; Parallel Processing: Processor Level Parallelism, Multiprocessors, and Fault Tolerance. TEXT BOOK: 1. John P. Hayes, Computer Architecture and Organization, 3rd Ed. McGraw Hill, 1998. REFERENCE BOOK: 1. John. L. Hennessy & David A. Patterson, Computer Architecture, Elsevier, India, 3rd Ed, 2003. Mode of Evaluation : Assignment/ Seminar/Written Examination.
16
05BIT 206
MICROPROCESSOR & INTERFACING TECHNIQUES * L T P C 3 0 0 3
Aim: The subject aims to introduce various features of 8086, 80286, 386, Pentium, processors, peripheral devices. Objectives: The student shall be able to understand 8086 processor design and basic operations, Instruction set and aspects of assembly language programming, Interface peripherals with 8086 serial and parallel I/O (8251 A & 8255), PIT (8253), programmable DMA controller(8257), programmable Interrupt controller (8259), Keyboard and display controller(8279),the 80286 processor features, addressing modes, operation and Memory management ,the 80386 and 80486 processor features, addressing modes, operation, the advances in processors overview of Pentium I, II, III, IV and Microcontrollers 8051. Introduction to 8086 Processor: 8086 Processor-Introduction, 8086 architecture, Pin configuration, 8086 in min/max mode, Addressing modes, Instruction set of 8086, Assembler directives, Assembly language programming. Peripherals & Interfacing With 8086: Serial & parallel I/O (8251A and 8255), Programmable interval timer 8253, Programmable DMA controller 8257, programmable interrupt controller 8259A, Keyboard and display controller 8279, ADC / DAC interfacing. 80286 Processor: Features of 80286, internal architecture of 80286, real addressing mode, virtual addressing mode, privilege, protection, basic bus operation of 80286, fetch cycles of 80286. 80386 and 80486 Processor: Features of 80386Dx, internal architecture of 80386Dx, pin configuration of 80386, register organization of 80386Dx, features of 80486, register organization of 80486. Advance In Microprocessors: Features of Pentium processor, Pentium I, Pentium II, Pentium III, Pentium IV, Introduction to microcontroller 8051, architecture of 8051, Register set of 8051. TEXT BOOK: 1. A.K. Ray and K.M. Bhurchandi, Advanced Microprocessors and Peripherals, First Edition, Tata McGraw Hill, 2000. REFERENCE BOOKS: 1. Douglas V. Hall, Microprocessors and Interfacing Programming and Hardware. Tata McGraw Hill, 1999. 2. Goankar, Microprocessor Architecture Programming and Applications with 8085, Wiley Eastern, 2000.
17
05BIT 208
THEORY OF COMPUTATION * L T P C 3 0 0 3
Aim: The subject aims to introduce Formal Languages, Automata Theory and Abstract models of Computation and Computability, Computational complexities and NP Completeness. Objectives: The students would be able to understand universal Model of Computation in terms of both the current Platforms and the Philosophical ideas about the nature of Computation. They would be able to analyze the problems by determining whether a problem is solvable, efficiently solvable, and simply solvable or it cannot be solved. Overview: An overview of grammars and languages, Regular expressions and Regular languages Finite Automata and its minimization, Construction of NFA and DFA from Regular expressions, Conversion of NFA into DFA Theorem & Problem: Chomsky hierarchy of language, Non determinism and kleenes theorem pumping lemma Decision problems. Normal Forms: Chomskys & Griebachs Normal Forms Push Down Automata & Context Free Languages: Context free grammars Derivation trees Ambiguity PDA& CFG Context Free and non-Context free languages. Turing Machines: Church Turing hypothesis Turing machine as language acceptors Partial function Non deterministic Turing Machine Universal Turing Machines Applications. Unsolvable Problems & Computable Functions: Rice theorem Halting problem Posts correspondence Problem Primitive recursive functions Godel Numbering Recursive and recursively enumerable languages. TEXT BOOK:
1. John C. Martin, Introduction to Languages and the Theory of Computation, Tata McGraw Hill,
3rd Edition, 1997. REFERENCE BOOK:
1. K.L.P Mishra, N. Chandrasekaran, "Theory of Computation", Prentice Hall of India, 2 nd Edition,

1998.
18
05BIT 210
PROGRAMMING IN JAVA L T P C 3 0 0 3
Aim: The subject aims to introduce programming in Java. Objectives: The students shall be able to understand basic aspects of Java programming, Exception Handling mechanisms, Multithreading subsystems, Packages and Interfaces, the significance of Java Library and to use the same includes Strings, I/O, Networking, the standard Utilities, the collections framework, applets, GUI based control and imaging , Java beans and Swing. Overview OOP - Inheritance: Java as programming tool, Java buzzwords, Java programming environment, compiling and running Java programs, an overview of java, data types, variables and arrays, operators, control statements, introducing classes, methods and classes, Inheritance-Inheritance basics, methods overriding, abstract classes. Packages Interfaces Exception Handling - Multithreading: Packages and Interfaces-packages, access protection, importing packages, Interfaces, Exception handling fundamentals, exception types, uncaught exceptions, using try and catch, multiple catch clauses, nested try statements, throw, throws, finally, Java built-in exceptions, creating your own exception subclasses, Multithreading, String handling, simple type wrappers. Applets Event Handling: Applet class-Applet basics, Applet architecture, an applet skeleton, simple applet display methods, requesting repainting, the HTML applet tag, Event handling-two event handling mechanisms, the delegation event model, event classes, sources of events, event listener interfaces. AWT Layout Manager - Swing: AWT classes, window fundamentals, working with frame windows, creating frame window in an applet, creating a windowed program, displaying information within a window, working with graphics, working with colors, working with fonts, AWT controls, Layout managers, and menus, an introduction to swing. Streams and Files- Networking: Streams and files-streams, files, types, putting streams to use, object streams, file management, Networking- Basics, InetAddress, TCP/IP client sockets, datagram. TEXT BOOK: 1. Patrick Naughton, Java 2: The Complete Reference, Tata McGraw Hill, 2000. REFERENCE BOOK: 1. Hartsmann and Cornell, Core JAVA fundamentals, Vol.I, PTR (sun series), Addison Wesley, 2000.
19
05BIT 212
MANAGEMENT INFORMATION SYSTEMS *** L T P C 3 0 0 3
Aim: The subject aims to introduce Role & Impact of MIS, Decision making, Enterprise management systems, Role of MIS in Data Warehouse, Artificial Intelligence and Expert Systems Objectives : The Students shall be able to understand role and impact of MIS, various steps in management, Organization structure and theory, Development of Business Strategies, Decision making concepts, methods of data collection, applications of MIS in Manufacturing, basic features Enterprise Management Systems and Role of MIS in Data Warehouse, Artificial Intelligence and Expert systems. Role & Impact of MIS: Approaches to Management - Management as Control System - Management by Exception - Process of Management - Management Effectiveness - Planning- Organizing - Staffing Coordinating and Directing - Controlling - MIS: A Tool for Management Process. Organization Structure and Theory - Basic Model of Organization Structure - Modifications to the Basic Model of Organization Structure - Organizational Behavior - Organization as a System - MIS: Organization. Strategic Management of Business Corporate Planning Concepts - Strategic Planning - Development of Business Strategies Types of Strategies, Tools of Planning Decision Making: Methods, Tools & Procedures - Organizational Decision Making - MIS & Decision Making Concepts - Information as a Quality Product - Classification of Information - Methods of Data Collection - Value of Information - System Concepts - Systems Control - Types of System - Post Implementation Problems, MIS Development- Determining Information Requirement - MIS Development & Implementation IT Strategic Decision: Design - Evaluation - Implementation Plan - Choice of IT and MIS, Applications of MIS in Manufacturing- Applications in Service Sector, Decision Support Systems, Deterministic Systems - Artificial Intelligence, Knowledge Based Expert System, MIS and the Role of DSS Enterprise Management Systems: Basic Features & Benefits, Selection and Implementation of ERPTechnology in MIS, Data Processing - Transaction Processing Application Processing - Information System Processing - TQM of Information Systems - User Interface - Real Time Systems & Design Programming Languages - Case Tools, Business Process Re-engineering - Process Model of the Organization Data Warehouse: Architecture to Implementation - Electronic Business Technology - Models of EBusiness - Intranet/Extranet - Internet - World Wide Web - Electronic Payment Systems - Security in EBusiness - MIS and E-Business. Web: A Tool for Business Management - Internet and Web and Process of Management - Strategic Management under Web - Web Enabled Business Management - Application System Architecture in Web - MIS in Web Environment TEXT BOOK:
1. W.S. Jawadekar, "Management Information System", Tata McGraw Hill, 2nd Ed., 2002
REFERENCE BOOK: 1. James A. OBrien, Management Information Systems, Tata McGraw Hill, 2004 Mode of Evaluation : Assignment/ Seminar/Written Examination.
20
05BIT 214L
1. 2. 3. 4. 5.
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 to sort the strings in an alphabetical order. 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. Assume that m characters are extracted, starting with the nth character Write a JAVA program for illustrating overloading and overriding methods in JAVA. Define a class Baby with the following attributes: a. Name b. Date of birth c. Date on which BCG injection has to be given. (60 days from date of birth) d. Date on which Polio drops is to be given. (45 days from date of birth) Write a constructor to construct the Baby object. The constructor must find out BCG and polio drops dates from the date of birth. In the main program define a baby and display its details. Define a class called Employee with name and date of appointment. Create 5 employee objects as an array and sort them as per their date of appointment. That is, print them as per their seniority. Assume that a bank maintains two kinds of account for its customers, one called savings account and the other current account. 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. 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. Current account holders should also maintain a minimum balance and if the balance fails below this level, a service charge is imposed. Create a class Account that stores customer name, account number and type of account. From this derive the classes Curr-acct and Sav-acct to make them more specific to their requirements. Include the necessary methods in order to achieve the following tasks: Accept deposit from a customer and update the balance. Display the balance. Compute and deposit interest. Permit withdrawal and update the balance. Check for the minimum balance, impose penalty, if necessary, and update the balance. Do not use any constructors. Use methods to initialize the class members. Write a JAVA program which illustrates the implementation of multiple inheritance using interfaces in JAVA. Write a JAVA program to create your package for basic mathematical operations such as add, subtract, multiply. Demonstrate the use of this package in another class. Write a JAVA program that moves the text School of Computer Sciences welcomes you diagonally using Applet. Write a JAVA program to create an Applet with a label Do you know car driving? and two buttons Yes, NO. When the user clicks Yes button, the message Congrats must be displayed. When the user clicks NO button, Regrets must be displayed. Write a JAVA program to animate the face image using Applet. Write a JAVA program to create four Text fields for the name, street, city and pin code with suitable Labels. Also add a button called My Details. When you click the button, your name, street, city, and pin code must appear in the Text fields. Write a JAVA program to simulate a scientific calculator. Write a JAVA program that creates an Editor using menu. The menu should simulate the important function of the file and Edit menu in the original window menu. Create a Java application which will add, modify and delete records from a student database. The database has 3 fields-names, roll number, class. GUI must be user-friendly and concise. (Hint: Use frames and Panels). Write a JAVA program to create a form for entering bio-data of an user, and to display the confirmation of acceptance. Write a JAVA program that counts the number of digits in a given number. If an alphabet is entered instead of a number, the program should not terminate. Instead it should display appropriate error message. Write a JAVA program for frequency count of words and characters in a text file. Write a JAVA program for Client/Server interaction.
6. 7.
8.
9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21.
21
05BIT 216L
MICROPROCESSOR LAB
L T P C 0 0 4 2 1. Study Experiments a. Study of 8086 Architecture b. Study of 8255 PPI c. Study of 8253 PIT d. Study of 8279 PKI e. Study of 8259 PIC 2. Write an ALP to find out factorial of a given hexadecimal number using 8086 MP Data: OAH, OFH, 1OH 3. Write an ALP to perform 16 bit arithmetic operations (ADD, SUB, MUL, DIV) 4. Write an ALP to generate the sum of first N natural numbers using 8086 MP 5. Write an ALP to convert given hexadecimal number to binary using 8086 MP Data: ABH, CDH, 101H 6. Write an ALP to convert given binary number to hexadecimal number using 8086 MP Data: 101010102, 111111112, 11002, 11112 7. Write an ALP to order give set of hexadecimal numbers in ascending and descending order Data: 0AH, 0FH, 0DH, 10H, 02H 8. Write an ALP to move block of data from locations 1200H-1205H to 2200H 2205H 9. Write an ALP to reverse the given string Data: WELCOME
10. Write an ALP to generate the following series 1+1/x+1/x3+1/x5+ ..

11. Write an ALP to generate square wave using 8255 PPI 12. Write an ALP to generate rate generator using 8253 PIT 13. Write an ALP to interface keyboard with 8086 using 8279 PKI 14. Write an ALP to display the given message using 8279 PKI Message: INFORMATION TECHNOLOGY 15. Write an ALP to interface analog to digital converter.
22
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, Algebraic structures and graph theory to computer science and engineering problems. By the end of the course, the students are expected to use inference theory in circuit models, and algebraic theory in computer science problems, graph theory in network models and lattices & Boolean algebra in Boolean functions. Mathematical Logic: Introduction -Statements and Notation - Connectives - Tautologies - Equivalence Implications - Normal Forms - Principal Disjunctive Norm Forms - Principal Conjunctive Norm Forms. Inference Theory: The Theory of Inference for the Statement Calculus -The Predicate Calculus Inference Theory of the Predicate Calculus. Set Theory: Basic Concepts of Set Theory- Relations and Ordering- Functions- Recursion Algebraic Structures: Semigroups and Monoids - Grammars and Languages- Polish Expressions and their Compilation - Groups - The Application of Residue Arithmetic to Computers - Group Codes. Lattices and Boolean algebra: Lattices as Partially Ordered Sets - Boolean algebra - Boolean Functions Representation and Minimization of Boolean Functions. Graph Theory: Basic Concepts of Graph Theory - Matrix Representation of Graphs - Trees -Storage Representation and Manipulation of Graphs. TEXT BOOK:
1. J.P. Trembley and R.Manohar, Discrete Mathematical Structures with Applications to Computer
Science, Tata McGraw Hill 13th reprint, 2001. REFERENCE BOOKS: 1. 2. 3. 4. 5. Richard Johnsonbaugh, Discrete Mathematics, 5th Edition, Pearson Education, 2001. S. Lipschutz and M. Lipson, Discrete Mathematics, Tata McGraw Hill, 2nd Edition, 2000. B.Kolman, R.C.Busby and S.C.Ross, Discrete Mathematical structures, 4th Edition, PHI, 2002. C.L.Liu, Elements of Discrete Mathematics, Tata McGraw Hill, 2nd Edition, 2002. N.Ch.S.N.Iyengar, V.M.Chandrasekaran, K.A.Venkatesh and P.S.Arunachalam, Discrete Mathematics, Vikas Pub., 2003.
23
05BIT 303
DATA BASE MANAGEMENT SYSTEM * L T P C 3 0 0 3
Aim: The subject aims to introduce techniques to design, implement, tune, maintain a database application and advance database concepts. Objectives: The students shall be able to understand fundamental concepts of database management system, database modeling and design, SQL, PL/SQL, system implementation techniques. They will be able to analyze and design ER model for a customized application and distributed databases, concurrency techniques, Federated systems, active databases. Basic concepts: Data bases and databases users database system concepts and architecture data modeling using Entity Relationship model Files of Unordered & Ordered Records, Hashing Techniques, Other primary file Organizations Index structures for files- E.F.Codd Rules Relational model, languages & systems: The relational data model, relational constraints, and the relational algebra SQL the relational database standard ER to relational mapping and other relational languages Oracle Architectures. Database design theory and methodology: Functional dependencies and normalization for relational databases relational database design algorithms and further dependencies practical database design and tuning. System Implementation Techniques: Database system architectures and the system catalog query processing- Translating queries to relational algebra, basic algorithms for executing query operations, using heuristics in query optimization transaction-processing concepts. Concurrency control techniques: Locking techniques, time stamp ordering, using locks for concurrency control in indexes, and some other concurrency control issues Database recovery techniques- Recovery concepts, Recover techniques based on deferred update and immediate update, shadow paging, arise algorithm, database backup and recovery from catastrophic failures. Database security and authorizationIntroduction to database security issues, discretionary access control based on granting and revoking of privileges. Distributed Database: Introduction and Concepts, Data Fragmentation, Replication, and allocation techniques. TEXT BOOK:
1. Elmasri & Navathe Fundamentals of Database Systems, 3rd ed., Addison Wesley, 2000
REFERENCE BOOK: 1. Korth and Silberschatz, Data Base System Concepts, Tata McGraw Hill, 1997.
24
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, memory management, scheduling algorithms and distributed file systems Objectives : The students would be able to understand and explain various OS concepts such as timesharing, Multiprogramming, Parallel, Distributed systems, processes & Threads, CPU scheduling algorithms, Semaphores and Critical regions, Deadlock prevention, Memory Management, I/O systems and File Systems They would be able to use Linux system, windows 2000. Introduction: Computer-System Structures, Operating-System Structures Process Management: Processes, Threads, CPU Scheduling, Process Synchronization, Deadlocks Memory, File & IO Management: Memory Management, Virtual Memory, File-System Interface, FileSystem Implementation, I/O Systems, Mass-Storage Structure Distributed System: Distributed System Structures, Distributed File Systems, Distributed Coordination, Protection, Security Case Study: The Linux System, Windows 2000. TEXT BOOK: 1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, "Operating System Concepts", John Wiley & Sons, Inc. 6th Edition REFERENCE BOOK:
1. Stallings William, "Operating Systems", Prentice Hall of India, Fourth Edition
25
05BIT 307
COMPUTER AND COMMUNICATION NETWORKS L T P C 3 0 0 3
Aim: The subject aims to introduce basics of Networks, client/server systems, Network design approaches, Architecture of Networks, and also future Networking Technology. Objectives : Students shall be able to understand about working of Intranet, LAN, WAN, MAN setups, different topologies like Star, Mesh, etc., various functions of layers, different network architectures, different switching techniques, different protocol standards, congestion & traffic control, different internetworking devices like bridges, switches, routers, etc, security protocols & security algorithms Networks and Services: Approaches to Network Design, OSI Reference Model; Overview of TCP/IP Architecture, Application Protocols and TCP/IP Utilities Peer-to-Peer Protocols: Service Models, ARQ Protocols, Sliding Window Flow Control, Multiple Access Communications, LAN access methods, Introduction to LAN Standards and LAN Bridges, Ethernet networking. Packet Switching Networks: Network Services and Internal Network Operation, Packet Network Topology, Routing in Packet Networks, Shortest Path Algorithms, and Introduction to traffic management & QoS. TCP/IP Architecture: The Internet Protocol, Limitations of IPv4 and Introduction to IPv6, User Datagram Protocol, Transmission Control Protocol, DHCP, Introduction to Internet Routing Protocols Advanced Network: Architectures and Security Protocols- Introduction to MPLS and Differentiated Services; RSVP; Security and Cryptographic Algorithms, Security Protocols, Cryptographic Algorithms
TEXT BOOK: 1. A. Leon-Garcia, Indra Widjaja, "Communication Networks", Tata McGraw Hill, 2000 REFERENCE BOOKS: 1. William Stallings, Data and Computer Communications", Pearson Education, 7th Edition, 2003 2. Andrew S. Tanenbaum, "Computer Networks", Prentice Hall India, 4th Edition, 2003
26
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. Objectives: The students would be able to analyze software requirements, develop an efficient software system through group cohesiveness, use the testing tools and methods. Software Engineering Fundamentals: The system engineering process, Software process models, Process iteration, Software Specification, Software design and implementation, Software validation, Software Evolution, Project management activities- Project planning, Project scheduling, Risk management, Software requirements- Functional and non-functional requirements, User requirements, System requirements, software requirements document. Requirements Engineering Processes: Feasibility studies, Requirements elicitation and analysis, Requirements validation, Requirements management, System Models- Context, Behavioral, Data and Object models, CASE workbenches, Software prototyping- Prototyping in the software process, Rapid prototyping techniques, User interface prototyping, Formal Specification- Formal specification in the software process, Interface specification, Behavioral specification Architectural Design: System structuring, Control models, Modular decomposition, Domain-specific architectures, Overview of design for Distributed systems, Object-oriented and Real-time software, Design with Reuse- Component-based development, Application families, Design patterns, User interface design User interface design principles, User interaction, Information presentation, User support, Interface evaluation. Critical Systems: Overview of Dependability, System Specification, and System Development, Verification and validation- Planning, Software inspections, Automated static analysis, Cleanroom software development, Software testing- Defect testing, Integration testing, Object-oriented testing, Critical systems validation- Formal methods and critical systems, Reliability validation, Safety assurance, Security assessment. Industry Standards: Overview of Managing software people, Software cost estimation- Productivity, Estimation techniques, Algorithmic cost modeling, Project duration and staffing, Overview of Quality management & Process Improvement, Overview of Legacy Systems, Software change & re-engineering, Configuration management- planning and managing change, version and release, Overview of SEI-CMM, ISO 9000 and Six Sigma, Over view of CASE tools.
TEXT BOOK: 1. Ian Sommerville, "Software Engineering", Addison-Wesley, 2004 REFERENCE BOOK: 1. Roger S. Pressman, "Software Engineering", McGraw Hill, 2004.
27
05BIT 311
SYSTEM PROGRAMMING L T P C 3 0 0 3
Aim: The subject aims to introduce operations and functions of Assembler, Linker, Lexical analysis, parsing, Semantic analysis, Optimization and machine code generation. Objectives: The student will understand the different steps involved in pass I and pass II of Assembler, the structure of compiler and the functions performed in different phases of compiler Assemblers: Elements of assembly language programming simple assembly scheme pass structure of assemblers, Design of a two-pass assembler, Relocation and linking concepts, Design of a linker, selfrelocating program, linker for MS DOS, linker for overlays, loaders. Structure of Compilers: Lexical analysis, syntax analysis, intermediate code generation, optimization code generation, book keeping, and error handling compiler writing tools programming languages. Role of lexical analyzer: Design of lexical analyzer, regular expression, finite automation, regular expression to finite automata, minimizing DFA, implementation to lexical analyzer context free grammar, derivations & parse trees capabilities of context free grammar Parsers: Shift-reduce parsing, operator precedence parsing, top down parsing, syntax directed translation scheme, implementation of syntax-directed translators, intermediate code, postfix notation, parse trees and syntax trees, three address code, quadruples, triples, translation of assignment statement, Boolean expression, errors, lexical phase errors, semantic-phase errors, semantic errors. Optimization: Principles, sources of optimization, loop optimization, DAG representation of basic blocks, value numbers and algebraic laws, global data flow analysis, dominators, reducible flow graphs, depth-first search, loop-invariant computations, induction variable elimination, other loop optimization. TEXT BOOK: 1. D.M. Dhamdhere, System Programming, Tata McGraw Hill, 2nd Edition, 2000. REFERENCE BOOK: 1. A. V. Aho, J.D. Ullman, Principles of Compiler Design, Narosa Publishing, 1996.
28
05BIT 313L
RDBMS LAB L T P C 0 0 4 2
1. a) Create a table EMP with the following fields. EName Eno Salary DeptNo Address Dname b) Insert 5 records into EMP c) ALTER EMP table I) Varying size of Eno field II) Adding a new field job d) Delete the table EMP 1. Create a table EMP with the above mentioned fields. a. Insert 5 records into EMP b. Update the salary of the Employees by 10% hike c. Delete the employees whose name is AAA 2. Create a table ORDER with the following fields and constraints. 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. Using Ex 3 Perform the following a. Drop unique constraint for item-name b. Disable the constraint Nn-rate c. Insert a record with NULL values for rate unit d. Enable the constraint with NULL value existing on rate-unit 5. Create a table EMP mentioned above and test all the arithmetic functions and character functions. 6. Add a field date-of-birth to EMP table and test all the date functions. 7. i) Modify EMP table adding a new field BONUS, update it using NVL ii) Retrieve the employees whose name starts with S. iii) Select all the employees who are working in IT department. 8. i) Using EMP table find the employee getting maximum salary ii) Find the employee whose salary is minimum iii) Find the sum of salaries of all the employees working in ACCOUNTS department. 9. Create a table DEPT with the following fields DNo. Primary Key DName Modify EMP table adding a foreign key constraint on DeptNo.
29
Insert 6 records into Dept. Implement the following Join operations a. Self Join b. Equi Join c. Non Equi Join d. Outer Join e. Natural Join
10. Using EMP and DEPT, implement all type of view techniques. a. Row subset view b. Column subset view c. Row column subset view d. Grouped view e. Joined view f. With check option 11. Using EMP and DEPT a. Create a sequence to insert the empno in EMP table b. Create a synonym for the above two tables
PL/SQL Programming 1. 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. Write a PL/SQL program to test the built-in Exceptions 4. Write a procedure to insert a record into ORDER table by validating qty limit of the item and also check whether that item exists. 5. Write a function to find substring. 6. Create a trigger which checks whether employee with Emp_no is present in the Employee table before inserting into EMP.
30
05BIT 315L
OPERATING SYSTEM LAB L T P C 0 0 4 2
1. Program to report the behavior of the OS to get the CPU type and model, kernel version. 2. Program to get the amount of memory configured into the computer, amount of memory currently available. 3. Write a program to create processes and threads. 4. Implement the various process scheduling mechanisms such as FCFS, SJF, Priority, round robin. 5. Inter Process Communication (IPC) using Message Queues. 6. IPC using pipes. 7. Implementation of wait and signal using counting semaphores. 8. Implementation of wait and signal using binary semaphores. 9. Implement the solution for reader writers problem. 10. Implement the solution for dining philosophers problem. 11. Implement bankers algorithm. 12. Signaling process 13. Implement the first fit; best fit and worst fit file allocation strategy. 14. Implementation of page replacement algorithms.
31
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, Integer Programming. Objectives: The students would be able to understand and use concepts of OR, such as Linear programming, dynamic programming. They would be able to solve Inventory, maintenance and replacement problems. Concept of OR: Concept and scope of operations research (OR) Development of OR phase of OR Models in OR. Linear Programming-Methods of solution graphical and SIMPLEX methods of solution VARIATIONS duality in LP revised SIMPLEX method applications for business and industrial problem. Integer Programming: Formulation graphical representation Gomorys cutting plane method, Transportation and Assignment Problem- Initial solution methods of improving the initial solution traveling salesman problem dynamic programming principle of optimality. Sequencing and Scheduling Problems: Job sequencing n jobs through two machines, two jobs through m machines and n jobs through m machines. PERT & CPM Techniques critical path normal and crash time resource allocation resource leveling and smoothing. 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), reorder point (ROP) determination. Maintenance and Replacement Problems: Models for routine maintenance and preventive maintenance decisions replacement models that deteriorate with time and those fail completely. TEXT BOOK: 1. Taha. H.A. Operation Research- An Introduction, Macmillan, 2000. REFERENCE BOOKS: 1. Sharma. S.D., Operation Research, Keder Nath Ram Nath & co., 1989. 2. Billy. B. Gillet Introduction to Operation Research, Tata McGraw Hill 1982. 3. S. Hamblin & Stevens Jr. Operation Research, McGraw Hill Co., 1974. Mode of Evaluation : Assignment/ Seminar/Written Examination.
32
05BIT E04
REAL TIME SYSTEMS L T P C 3 0 0 3
Aim: The subject aims to assimilate the real time system technologies, covering programming languages and tools, database, communication and fault tolerance aspects. Objectives: The students would be able to understand the real time systems concepts to select architectures and programming languages, Analyze the Real Time systems requirements, Evaluate the fault tolerance techniques and systems reliability. Introduction: Issues in real-time system, task classes, architecture issues, operating system issues, performance measure for real time systems, estimating program run times, classical uniprocessor scheduling algorithm, uniprocessor scheduling of IRIS tasks, task assignment, mode changes, fault tolerance scheduling. Programming Languages and Tools: Introduction, desirable languages characteristics, data types, control structures, facilitating hierarchical decomposition packages, exception handling, overloading and generics, multitasking, low-level programming, task scheduling, timing specification, programming environments, run-time support. Real-Time Database & Communication: Basic definitions, real time vs. general purpose databases, main memory databases, transaction priorities, transaction aborts, concurrency control issues, disk scheduling algorithms, two-phase approach to improve predictability, maintaining serialization consistency, databases for real-time systems, communication network topologies, communication protocols. Fault -Tolerance Techniques: Introduction, failure causes, fault types, fault detection, fault and error containment, redundancy, data diversity, reversal checks, malicious or Byzantine failures, integrated failure handling. Reliability & Clock Synchronization: Introduction, obtaining parameter values, reliability models for hardware redundancy, software error models, taking time into account, clock synchronization, nonfaulttolerant synchronization algorithms, impact of faults, fault tolerant synchronization in hardware. TEXT BOOK: 1. C.M. Krishna, Kang G. shin, Real-Time systems, McGraw Hill, 2004. REFERENCE BOOK: 1. R.J.A. Buhr, D.L. Bailey, An Introduction to Real-Time Systems, Prentice-Hall International, 1999. Mode of Evaluation : Assignment/ Seminar/Written Examination.
33
05BIT E06
DISTRIBUTED DATABASE SYSTEM L T P C 3 0 0 3
Aim: This subject aims to cover Distributed Data processing, Distributed Database Design, Query processing, Query decomposition, Transaction management and Distributed DBMS reliability. Objectives: The students would be able to understand and use distributed Database Processing, Distributed databases, Query processing, Query decomposition and Transaction Management. Introduction to Distributed Data Processing: What is a distributed database system Promises of DDBS Complicating Factors Problem Areas, DBMS Standardization Architectural models for distributed DBMS Distributed DBMS Architecture Global Directory issues Distributed Database Design: Alternative Design Strategies Distributed Design issues Fragmentation Allocation, Semantic Data Control: View Management Data Security Semantic Integrity Control Overview of Query Processing - 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, Query Optimization Centralized Query Optimization Join Ordering in fragment queries distributed query optimization algorithms. Introduction to Transaction Management: Definition of a Transaction Properties of Transaction Types of Transaction, Distributed concurrency control- 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. 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. TEXT BOOK: 1. M. Tamer Ozsu, Patrick Valduriesz, "Principles of Distributed Database Systems", PHI, 1999 REFERENCE BOOK: 1. Stefanoceri, Giuseppe Pelagatti, "Distributed Database Principles and Systems", McGraw Hill publications, 1987.
34
05BIT E08
SOFT COMPUTING L T P C 3 0 0 3
Aim: The subject aims to introduce neural networks, fuzzy logic and genetic algorithms Objectives: The students would be able to understand and explain the concepts of neural networks, learning in biological neuron, learning algorithms, fuzzy sets, fuzzy arithmetic, handling uncertainty and problem solving using genetic algorithms Neural Networks: History, overview of biological Neuro-system, Mathematical Models of Neurons, ANN Architecture, Learning rules, Learning Paradigms supervised, unsupervised and reinforcement learning, ANN training algorithms perceptron, training rules, Delta, Back Propagation Algorithm, Multilayer perceptron Model, Hopfield Networks, Associative Memories, Applications of Artificial Neural Networks. Fuzzy Logic: Introduction to Fuzzy Logic, Classical and Fuzzy Sets: Overview of Classical sets, Membership Function, Fuzzy Rule generation, Operations on Fuzzy Sets- Complement, Intersections, Union, Combination of Operations, aggregation operations. Fuzzy Arithmetic: Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on Intervals and Numbers, Lattice of Fuzzy Numbers, Fuzzy Equations. Fuzzy Logic: Classical Logic, Multivalued Logics, Fuzzy Propositions, Fuzzy Qualifiers, Linguistic Hedges. Uncertainty based Information and Application of Fuzzy Logic: Information and Uncertainty, Nonspecificity of Fuzzy and Crisp Sets, Fuzziness of Fuzzy Sets, Application of Fuzzy Logic: Medicine, Economics Etc. Genetic Algorithm: An Overview, GA in problem solving, Implementation of GA. TEXTBOOK: 1. Klir and TA Folger, Fuzzy Sets, Uncertainty, and Information, Prentice Hall (1988). REFERENCE BOOKS: 1. Ross T.J. Fuzzy Logic with Engineering Applications, McGraw Hill, 1995 2. Zurada, J.M. Introduction to Artificial Neural systems, Jaico Publishing House, 1997 3. David. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison Wesley, 1985.
35
05BIT E10
INTERNETWORKING & TECHNOLOGIES L T P C 3 0 0 3
Aim: The subject aims to cover the fundamentals of internetworking. It also covers types of internetworks, WAN and voice over data network technologies. Objectives: The students would be able to understand and explain internetworking fundamentals, various types of networks, evolution of solutions for voice over data networks. Internetworking Fundamentals: Protocol and Standards, 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, Overview of Ethernet Networking Transceiver Functionality Heartbeat Frame components 802.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). 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.25, Frame Relay, and ATM Virtual Circuits Router Technology: Hubs Bridges Routers Router/Bridge / Hub Application Example Transparent Bridging, Mixed-Media Bridging, Translation, Source-Route Transparent Bridging, LAN Switching and VLANs, 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, Voice Networking, Voice over ATM, Voice over Frame Relay, Voice over IP, Quality of Service for VoIP, General MGCP Overview, General SIP Over view, Skinny Client Control Protocol (SCCP), Comparison and Contrast of the Various VoIP Signaling Alternatives, Evolution of Solutions for Voice over Data. TEXT BOOK: 1. Ed Taylor, "Networking Handbook", Tata McGraw Hill, 2000. REFERENCE BOOKS: 1. Uyless Black, "Internet Wide Area Networks: Internet Architecture", PHI, 2003. 2. Banerjee Rahul, "Internetworking Technologies: An Engineering Perspective", PHI, 2002. 3. Internetworking Technologies Handbook, Cisco Press, 4th Edition, 2003 Mode of Evaluation : Assignment/ Seminar/Written Examination.
36
05BIT E12
BASIC BIO-INFORMATICS L T P C 3 0 0 3
Aim: The subject aims to cover the basics of Bio informatics, Dynamic programming, Evolutionary trees & DNA sequencing. Objectives: The students would be able to understand and explain the fundamentals of Bio-informatics, Dynamic programming, searching algorithms, Evolutionary trees, DNA mapping, DNA sequencing and Gene predictions Introduction to Bioinformatics: Scope of Bioinformatics Elementary commands and Protocols, ftp, telnet, http, Primer on information theory. 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. 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. Evolutionary Trees and Phylogeny: Ultrasonic trees parsimony Ultrametric problem Perfect phylogeny Phylogenetic alignment connection between multiple alignment and tree construction. 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. TEXT BOOK: 1. Dan Gusfield, "Algorithms On Strings Trees and Sequences", Cambridge University Press, 1997 REFERENCE BOOKS: 1. Westhead, "Instant notes Bioinformatics", Viva Publishers. 2. Bergeron Bryan, "Bioinformatics Computing", Prentice Hall of India
37
05BIT E14
DISTRIBUTED COMPUTING L T P C 3 0 0 3
Aim: The subject aims to cover parallel & distributed computing architecture, networked clusters of computers, utilization and management of the expensive resources that are remote to the users. Objectives: The students would be able to understand and use different network models, security mechanisms and design methodologies of Distributed systems Models & IPC: Introduction to distributed computing system, evolution different models, gaining popularity, definition, issues in design, DCE, message passing introduction, desirable features of a good message passing system, issues in IPC, synchronization, buffering, multigram messages, encoding and decoding of message data, process addressing, failure handling, group communication. RPC: RPC-Introduction, model, transparency, implementation mechanism, stub generation, RPC messages, marshalling arguments and results, server management, parameter - passing semantics, call semantics, communication protocols for RPCs, client server binding, exception handling, security, mini project using Java RMI Distributed Shared Memory: Distributed shared memory- general architecture of DSM systems, design and implementation issues of DSM systems, granularity, structure of shared memory space, consistency model, replacement strategy, thrashing, advantages of DSM, clock synchronization, Resource and process Management: Introduction, desirable features of good global scheduling algorithm, task assignment approach, load balancing approach, process migration, threads. Distributed File Systems and Security: DFS and security- Desirable features of good DFS, file models, file accessing Models, file sharing semantics, file caching schemes, and file replication. Fault Tolerance, atomic transaction, potential attacks to computer system, cryptography, authentication, access control. Digital signatures, DCE security service.
TEXT BOOK: 1.Pradeep K. Sinha, "Distributed Operating Systems: Concepts & Design", PHI, 2005. REFERENCE BOOK: 1. Andrew S. Tanenbaum, Distributed Operating Systems Pearson Education, 2002.
38
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, UML and related methodologies. Objectives: The students would be able to understand the techniques, applications and UML based object oriented analysis and design. Complexity of software: Structure of complex systems, decomposing complexity, Designing complex systems, Object Model: Evolution, Elements of object model, Applying object model Elements of Notation: Class diagrams, state transition diagrams, object diagrams, Interaction diagrams, module diagrams, process diagrams, applying the notation. Principles, micro development process, macro development process. Management and planning: Staffing, Release management, Reuse, Quality Assurance and Metrics, Documentation, Tools, Benefits and Risks of Object Oriented development Introduction to Object-Oriented Paradigm and UML: Unified Process, the Requirement Workflow, Object-Oriented Analysis Workflow, Object-Oriented Design Workflow, Workflow and phases of the Unified process. Analysis and Design: Case studies, Teams, Testing, Management Issues, Planning and Estimating, Maintenance, User Interface system, Introduction to Web Based Systems. TEXT BOOK: 1. Grady Booch, "Object Oriented Analysis and Design with applications", Addison Wesley, 1994. REFERENCE BOOK: 1. Schach, Stephen R., "An Introduction to Object-Oriented Systems Analysis and Design with UML and the Unified Process", Tata McGraw Hill, 2003.
39
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, GSM, GPRS and Wireless Application protocols Objectives: The student would be able to understand the principles and practices of Mobile Communication, Satellite Communication, Medium Access Control techniques, Mobile Devices, Wireless Local Area Networks, HiperLAN and Bluetooth, Wireless ATM operations, mobile network layer and various wireless Application Protocol. 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. Telecommunication Systems GSM, DECT, TETRA, UMTS and IMT - 2000, Satellite Systems GEO139, LEO139, MEO140. Routing, Localization, Handover. Broadcast systems Overview Cyclic Repetition of Data Digital Audio Broadcasting Digital Video Broadcasting. Wireless Communication: Wireless LAN-Infrared vs. Radio transmission, Infrastructure and ad hoc networks, IEEE802.11, HIPERLAN, Bluetooth. Wireless ATM, Motivation for WATM, Wireless ATM working group, WATM Services, Reference Model, Functions, Radio Access Layer: Handover, Location Management, Addressing, Mobile quality of service, Access point control protocol. Mobile Network Layer: Mobile IP-Dynamic host configuration protocol-Ad hoc networks. Mobile transport layer-Traditional TCP292: Indirect TCP, Snooping TCP. Mobile TCP: Fast Retransmit/Fast recovery, transmission/Timeout Freezing, Selective Retransmission, 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.
TEXT BOOK: 1.Johchen schiller, Mobile Communication, Addison Wesley, 2000. REFERENCE BOOK`: 1. Asoke K. Talukder, Roopa R.Yavagal, Mobile Computing-Technology, Applications and Service Creation, Tata McGraw Hill, 2005.
40
05BIT 308
INTERNET COMPONENTS AND PROGRAMMING L T P C 3 0 0 3
Aim: The subject aims to introduce the web technologies, with emphasis on client side and server side scripting. Objectives: The students shall be able to understand and use the markup languages, scripting languages such as VB Script, Java Script, to access remote databases using XML and ASP. History of Internet: internet connection concepts, net and its features, e-mail, news groups, FTP, Telnet, Gopher, Domain Name systems, DNS servers, Internet services, accounts. Markup Languages: Introduction to HTML, common tags, Headers, text styling, linking, images, special characters, lists, tables, META, FRAMESET tags, JavaScript, Introduction to scripting, operators, control structures, functions, arrays objects. DHTML: Client side scripting, with VBscript, operators, data types and control structures, VBscript functions, arrays, string manipulations, classes and objects, E-commerce and security; introduction, shopping cart technology, online auction, trading case study, other E-business, security, commerce server, E-commerce core technologies, internet marketing. Active Server Pages: Introduction, ASP working, Client side vs. server side scripting, server side Active X components, File system objects, session tracking and cookies, accessing a database from ASP pages. XML: Introduction, structuring data, document type definition, customized markup languages, XML parsers, using XML with HTML, Extensible style language (XSL), Microsoft schema. TEXT BOOK: 1. Deitel, Deitel & Nietro, "Internet and World Wide Web How to program", Pearson Education, 2005. REFERENCE BOOKS: 1. Margaret Levine Young, "Internet The Complete Reference", TMH, 2004. 2. Valerie Quercia, "Internet in a Nutshell", OReily publishers, 2004. 3. Alfred Glass Brermer, "Internet 101 Computing", TMH 1995. 4. Active Server Pages 3.0 Wrox publisher, 2000.
41
05BIT 310
SOFTWARE RELIABILITY AND QUALITY ** L T P C 3 0 0 3
Aim: The subject aims to introduce software and system reliability, quality control and applications of reliability analysis in large-scale systems and to improve the quality of the software. Objectives : The students shall be able to understand the Markov models, Markov graphs, fault-free analysis, tie-set and cut-set methods, use of Boolean algebra and repairable systems, reliabilities of components & systems and the importance of fault free analysis, tie-set and cut-set methods and reliability aspects of repairable systems. Software Reliability and System Reliability: Reliability Bathtub curve, Causes of failures, various phases in software product life, Reliability mathematics, Software reliability issues, Techniques for Prediction Analysis. Software Reliability: Qualitative view of reliability, quantitative view of reliability, methods for reliability estimation, software related failures fault, Error failure. Causes of faults, software reliability modelsMusas Execution Time model, Jelinski Moranda Model, and Little Wood Model. Software Maintenance: Software maintenance, enhancing maintenance during development, managerial aspects of software maintenances, maintenance tools and techniques. Introduction to Quality Control: Control Quality assurance system- Responsibility for quality. Company wide quality management and Benefits of company wide quality control, Management for quality control and reliability. Software Quality Control: Software Quality attributes software quality assurance activities. Defect prevention. Software design review, Software quality management. TEXT BOOK: 1. Dr. Brijendra Singh, Quality Control & Reliability Analysis (Concepts & Applications), Khanna Publishers, 2nd Edition, 2005. REFERENCE BOOKS: 1. L.S. Srinath, Reliability Engineering, Affiliated East-West Pvt. Ltd, 3rd Edition. 2. Michael R. Lyu (Editor), "Handbook of Software Reliability Engineering", McGraw Hill, 1998. Mode of Evaluation : Assignment/ Seminar/Written Examination.
42
05BIT 312
NETWORK PROGRAMMING L T P C 3 0 0 3
Aim: To introduce basic network concepts and network application development. Objectives: The students shall be able to learn JAVA programming to share data across Internet for File transfer, Software updates etc., and accomplish many Network programming tasks. Introduction: Why networked Java What can a network program do, Security Basic network concepts: Networks, The layers of a network, IP,TCP and UDP, The Internet, The client/server model, Internet Standards, Basic Web concepts: URLs, HTML, SGML, and XML, HTTP,MIME Media types, Server Side Programs. Threads: Running Threads, Returning Information from a Thread, Synchronization, Deadlock, Thread scheduling, Thread pools, Looking Up Internet Addresses: The InetAddress Class,Inet4Address and Inet6Address,The Network Interface Class, Some useful programs, URLs: The URL class, URL encoder and URL decoder Classes, URL class, Proxies, communicating with Server Side Programs Through GET, Accessing Password-Protected Sites. Sockets for Clients: Socket Basics, Investigating Protocols with Telnet, The Socket Class, Socket Exceptions, Socket Addresses, Examples, Sockets For Servers: The Server Socket Class, Some Useful Servers, Secure Sockets: Secure Communications, Creating Secure Client Sockets, Methods of SSLSocket Class, Creating Secure Server Sockets, Methods of the SSLServerSocket Class. UDP Datagrams and Sockets: The UDP protocol, The Datagram Packet Class, The Datagram Socket Class, Some useful Applications, Datagram Channel, URLConnections: Opening URL Connections, Reading Data from a server, Reading the Header, Configuring the Connection, Configuring the Client Request HTTP Header, Writing Data to a server, Content Handlers, The Object Methods, Security Considerations for URLConnections, Guessing MIME Content Types, HttpURLConnection, Caches, JAR URLConnection. Remote Method Invocation: What is RMI? Implementation, Loading Classes at Runtime, the java.rmi Package, the java.rmi.registry Package, the java.rmi.server Package, The JavaMailAPI: What are Java Mail API, Sending Email, Receiving Email, Password Authentication, Addresses, The URLName Class, The Message Class, the Path Interface, Multipath Messages and File Attachments, MIME messages, Folders. TEXT BOOK: 1. Elliotte Rusty Harold JAVA Network Programming 3rd Edition published by Sharoff Publishers and Distributors Pvt. Ltd, Mumbai, 2005. REFERENCE BOOK: 1. David Reilly, Michael Reilly. "Java Network Programming & Distributed Computing", Published by Addison-Wesley. ISBN: 0201710374
43
05BIT 314L
NETWORKING LAB
L T P C 0 0 4 2 1. Write a program to display the servers date and time details at the client end. 2. Write a program to display the clients address at the server end. 3. Write a program to implement an echo UDP server.
4. Write a program to develop a simple Chat application.

5. The message entered in the client is sent to the server and the server encodes the message and returns it to the client. Encoding is done by replacing a character by the character next to it i.e. a as b, b as c z as a. This process is done using the TCP/IP protocol. Write a program for the above 6. The message entered in the client is sent to the server and the server encodes the message and returns it to the client. Encoding is done by replacing a character by the character next to it i.e. a as b, b as c z as a. This process is done using UDP. Write a program for the above 7. Write a program to display the name and address of the computer that we are currently working on. 8. Write a program to capture each packet and to examine its checksum field. 9. Write a program to create a daemon process. 10. A server should run for 10 secs and generate numbers continuously. The client connecting to it should read data and find out the sum of the data thus read. Write a Java program to implement this scenario. 11. Write graphical user interface for the sales database which lists all the customer names in one choice box and all products in another. When the user selects a customer name and product and press the submit button, display a list with the customer name, product, quantity, and date of order by the customer with the name of that product. Use prepared statements whenever possible. 12. Design and populate a database for a car rental system. Allow the client to check the availability of a category of car and to make reservation. 13. Write program to illustrate the following: i). Remote object interaction. ii). File downloading and uploading.
44
05BIT 316L
INTERNET COMPONENTS & PROGRAMMING LAB L T P C 0 0 4 2
1. Create a personal home page using HTML 2. Design an E-greetings page which has properly aligned paragraphs with images along with it. 3. 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. Using STYLE SHEETS: 1 .Set the Background Image Fixed and Foreground Scrolling 2. Set the Background Image without tiles and at the center of the screen. 3. Set the Background Color for the text using all the 4 methods of Style sheets 5. Using JavaScript create a web page for Online Testing (Quantitative Aptitude) 6. Develop a JavaScript program to get Register Number as Input and print the Students total mark and grades. 7. Develop a VBScript code to perform the functions of a Calculator. 8. Using VBScript, develop a web site for online counseling. 9. Create a Text Editor using VBScript. 10. Write a function that takes an integer value and returns the number with its digits reversed. For Ex. Given the number 7631, the function should return 1367. Incorporate the function into a VBScript that reads a value from the user. Display the result in the status bar of the browser window. 11. Create a server-side include file containing the AdRotator code to display 4 advertisements. 12. Create an ASP application that allows the user to customize a web page. The application should consist of three ASP files: Ask the user to login & read from a database to determine if the user is known. If the user is not known, second ASP file is loaded asking the user to choose their preference for foreground color, background color & image. Insert the new user & pREFERENCE to the database. Display the page customized according to the pREFERENCE selected. If the user is known at login, the customized page should be displayed.
13. Create an ASP application to display the students information from the Database. Note: Only 5
students information per page should be displayed. Use Previous & Next to retrieve the rest of the information.
45
14. Create an ASP application for sending E-Mails using CDO. 15. Design a web page for registering the following information into Oracle Database using ASP. Name Reg. No, Date of Birth, Date of Admission, E-Mail (check for validation) Gender Address Branch & Year 16. Create a formatted business letter using XML & DTD. 17. Create a contact list database in XML using style sheets. 18. Develop a XML schema for the database document type. 19. Create a XML page for displaying staff details from the database 20. Connect to a database using XML & display its contents using HTML Page
46
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, software, operating systems and DBMS. Objectives: At the end of the course students would be able to use multimedia computing hardware, software tools multimedia authoring and design process. Introduction: Branch-overlapping Aspects of Multimedia, Content, Global Structure, Multimedia- Media and Data Streams, Medium, Main Properties of a Multimedia System, Traditional Data Stream Characteristics, Data Streams Characteristics for Continuous Media, Information Units. Sound/Audio: Basic Sound Concepts, Music, Speech, Image and Graphics- Basic Concepts, Computer Image Processing, Introduction to Optical Storage Video and Animation: Basic Concepts, Television, Computer-based Animation, Data CompressionStorage Space, Coding Requirements, Source, Entropy, and Hybrid Coding, Some Basic Compression Techniques-JPEG, H.261, MPEG, DVI Multimedia Operating Systems: Introduction, Real-time, Resource Management, Process Management, File Systems, Additional Operating System Issues, System Architecture, Multimedia Communication Systems- Application Subsystem, Transport Subsystem, Quality of Service and Resource Management Multimedia Database Systems and Characteristics: Data Analysis, Data Structure, Operations on Data, Integration in a Database Model, Introduction to Hypertext, Hypermedia, Document Architecture, SGML, ODA, MHEG, A Reference Model for Multimedia Synchronization, Multimedia Applications- Media Preparation. Media Composition, Media Integration, Media Communication, Media Consumption, Media Entertainment
TEXT BOOK:
1. Ralf Steinmetz and Klara Mahrstedt, "Multimedia computing, communications and Applications",
Pearson Education Asia, 1st reprint 2001. REFERENCEBOOK: 1. K. Rao, "Multimedia Communication Systems: Techniques, Standards, and Networks", Prentice Hall, 2002.
47
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, 2D and 3D modeling. Objectives: The student would be able to understand and use Computer Graphics various Clipping algorithms, 2D and 3D transformations. Introduction to Computer Graphics: Display devices Hardcopy devices Interactive input devices Display processors Graphic Adapters basic function Monochrome adapters, 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. 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. Computer Graphics Applications: CAD/CAM, Image processing, VLSI, games graphs and charts animation Introduction of graphics and kernel system (GKS) binding language for GKS programming examples using GKS, PHIGS.
TEXT BOOK: 1. Donald Hearn and Pauline Baker Computer Graphics, Prentice Hall, New Delhi, 2000. REFERENCE BOOKS: 1. Steven Harrington, "Computer Graphics- A programming approach", McGraw Hill, 1986. 2. Foley J.D., Van Dam A, "Fundamentals of Interactive Computer Graphics", Addison Wesley, 1990
48
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, tools and systems for monitoring and managing network systems. Objectives: The students would be able to understand and use various principles and practices of managing and administering networked systems. Introduction: System Components, Networked Communities, Host Management, User Management Models of Network & System Administration: Configuration and Maintenance, Diagnostics, Fault & Change Management. SNMP Overview, Installing, Using & Maintaining SNMP Tools Application Level Services: Network Level Services, Principles of Security, Security Implications, Analytical System Administration Open Source and Network Administration: Open Source Tools, Environment & Background, Terminology & Conventions, Overview of Service Monitoring, Installing, Using, Configuring & Maintaining Sysmon Overview of Open Source Tools for Network Administration: MRTG, Neo, NetFlow, Oak, Tcpdump; Over view of Basic TCP/IP tools - Ping, Telnet, Netcat, Traceroute, MTR, Netstat; Over view of Custom Tools - Basics of Scripting, Bourne Shell, Programming Monitors, Running Programs from Cron.
TEXT BOOK: 1. Mark Burgess, "Principles of Network and System Administration", John Wiley & Sons, 2004 REFERENCE BOOK: 1. Mani Subramanian, Network Management Principles & Practice, Pearson Education, 2003.
49
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: Whats 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.
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.
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.

52
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. Objectives: The students shall be able to understand the biological and artificial model of neuron. Multi layer perceptrons, pattern recognition techniques, Associative memories and Holographic Pattern Recognition system. Introduction: Why Neural Networks and Why Now - What is a neural Net - Where are Neural Nets being used - How are Neural Nets being used - the McCulloch Pitts Neuron. Simple Neural Nets for Pattern Classification: General Discussion, Hebb Net: Algorithm, Application, Perceptron: Architecture, Algorithm, Application, Back Propagation Net: Standard Back Propagation: Architecture, Algorithm, Applications, Theoretical Results: Derivation of Learning rules, Multi Layer Neural Nets as Universal Approximators. Pattern Association: Auto associative Net: Architecture, Algorithm, Applications, Storage Capacity, Bidirectional Associative Memory: Architecture, Algorithm, Applications, Analysis. Neural Networks based on Competition: Kohonen Self Organizing Maps: Architecture, Algorithm, Applications, Learning Vector Quantization: Architecture, Algorithm, Application, Variations. Adaptive Resonance Theory: Introduction, ART1: Architecture, Algorithm, Applications, Analysis, ART2: Architecture, Algorithm, Applications, Analysis. TEXT BOOK: 1. Laurene Fausett, Fundamentals of Neural Networks Architectures, Algorithms, and Applications 3rd Edition, Pearson Education, 2004 REFERENCE BOOKS: 1. Simon Haykin, Neural Networks A Comprehensive Foundation, Pearson Education, 2nd Edition 2004. 2. I.R. Beale and T. Jackson, Neural Computing, IOP Publishing, 2000 Mode of Evaluation : Assignment/ Seminar/Written Examination.
53
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. Objective: To design a appropriate filter and evaluate its efficiency by comparing with various design methods. Review of Basic Concepts: Signals and signal processing: characterization and classification of signals, typical signal processing operations, examples of typical signals, typical signal processing applications, why digital signal processing - Transform-domain representations of Linear Time Invariant (LTI) systems: the frequency response, the transfer function, types of transfer functions, all pass transfer function, minimumphase and maximum-phase transfer functions, complementary transfer functions, digital two-pairs, stability test, discrete-time processing of random signals. Digital Filters: Structures: block diagram representation, signal flow-graph representation, equivalent structures, basic Finite Impulse Response(FIR) digital filter structures, basic Infinite Impulse Response (IIR) filter structures, state-space structures, all pass filters, tunable iir digital filters, cascaded lattice realization of IIR and FIR filters, parallel all pass realization of IIR transfer functions, digital sine-cosine generator, computational complexity of digital filter structures. Design: preliminary consideration, impulse invariance method of IIR filter design, bilinear transform method of IIR filter design, design of digital IIR notch filters, low pass IIR digital filter design. Examples, spectral transformations of IIR filters, FIR design based on truncated Fourier series, FIR filter design based on frequency sampling approach, computer-aided design of digital filters. Digital Signal Processors: Overview of Motorola dsp563xx family of digital signal processors, architectures of dsp56307: assembly language instructions and programming: typical software applications. Implementation, Applications: Implementation consideration: basic issues, software implementation, computation of the discrete Fourier transform the quantization process and errors, analysis of coefficient quantization effects, analysis of coefficient quantization effects in fir filters. Representative applications: dual tone multifrequency signal detection, spectral analysis using dft, short-term discrete Fourier transform, musical sound processing, digital fm stereo generation, discrete-time analytic signal generation, voice privacy system, subband coding of speech and audio signals. TEXT BOOK:
1. Sanjit K. Mitra: Digital Signal Processing A Computer Based Approach, Tata McGraw-Hill, 1998.
REFERENCE BOOKS:
1. Alan V. Oppenhein, And Ronald W. Schafer: Discrete Time Signal Processing (Second
Edition), Prentice Hall, 1998.
2. John G. Proakis & Dimitris G. Manolakis: DSP Principles, Algorithms, and Applications
Prentice-Hall, 1996.

54
05BIT E09
ARTIFICIAL INTELLIGENCE L T P C 3 0 0 3
Aim: The subject aims to cover fundamentals of Artificial Intelligence, knowledge representation, predicate calculus, reasoning system and expert systems Objectives: The students would be able to understand and explain the basics of Artificial Intelligence, problem solving techniques, knowledge representation, reasoning systems and Expert systems AI-Foundations: History-Intelligent Agents - Perception and Language Processing - Problem SolvingSearching-Heuristic Search-Game Playing, Introduction to Predicate calculus, Expert Systems and Robotics, Over view of AI languages such as PROLOG and LISP Agents that Reason Logically- First order logic-Inference in first order logic-Logical reasoning. Semantic Nets and Description Matching: Frames-Inheritance and common sense Rules-Rule Chaining, Substrates and cognitive modeling. Uncertainty-Probabilistic Reasoning Systems: Making simple and complex decisions Nonmonotonic reasoning and Truth Maintenance. Planning: Representation for planning-Partial order planning-Conditional planning- Replanning agentLearning-Analyzing differences-Explaining experience-Correcting mistakes-Recording cases-Overview of Version space method-Identification trees-Neural nets and Genetic algorithms, Expert systems Architecture. TEXT BOOK: 1. Stewart Russel, Peter Norvig. "Artificial Intelligence-A Modern Approach", PHI, 1995. REFERENCE BOOKS: 1. Patrick Henry Winston, "Artificial Intelligence", 3rd Edition, Addison Wesley, 1999. 2. Elain Rich and Kevin Knight, "Artificial Intelligence", Tata McGraw Hill, 1993.
55
05BIT E11
EMBEDDED SYSTEMS L T P C 3 0 0 3
Aim: The subject aims to cover the concepts of embedded systems, their design and applications, programming models and Interprocess communication. Objectives: The student would be able to understand and use in embedded systems, device drivers, software engineering practices in embedded systems development and Inter process communication. Introduction to Embedded Systems: Processor in the System Software Embedded into a system Exemplary Embedded Systems Embedded System-On-chip and in VLSI Circuit Processor and Memory Organization Structural Units in a Processor Processor Selection for an Embedded System Memory Devices Memory Selection for an Embedded System Allocation of Memory to Program Segments and Blocks and Memory Map of a System Direct Memory Access Interfacing Processor, Memories and I/O Devices. Devices and Buses for Device Networks: I/O Devices Timer and Counting Devices Serial Communication Using the I2 C, 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, PCI, 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, 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, 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, Task & Threads Multiple processes in an Application Problems of Sharing Data by Multiple Tasks & Routines Interprocess Communication. TEXT BOOK: 1. Rajkamal, Embedded Systems-Application, Practice & Design, Tata McGraw Hill, 2003 REFERENCE BOOKS: 1. Arnold S. Berger, Embedded Systems Design, CMP Books, 1997
56
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. Objectives: The students will be capable of designing the decision support system for managers to take the decision. The need for computerized decision support technologies, a framework for decision support, the concept of decision support systems, group decision support systems, executive information (support) systems, expert systems, artificial neural networks, hybrid support systems, the evolution and attributes of computerized decision aids, introduction and definitions, systems models, the modeling process; evaluation. DSS configuration: Characteristics, capabilities, and components of DSS, the user, DSS hardware, distinguishing DSS from management science and MIS, classifications of DSS, data warehousing, access, analysis, and visualization, the nature and sources of data, data collection and data problems, the internet and commercial database services, database management systems in DSS. Database organization and Structure: Data warehousing, OLAP: data access and mining, querying and analysis, data visualization and multidimensionality, intelligent database and data mining, Support systems. The GDSS meeting process: Constructing a GDSS and the determinants of its success, GDSS research challenges Modeling for mss, static and dynamic models, treating certainty, uncertainty and risk, influence diagrams, mss modeling in spreadsheets, decision analysis of a few alternatives, optimization. Heuristic Programming: Simulation, multidimensional modeling, visual spreadsheets, financial and planning modeling, visual modeling and simulation, ready-made quantitative software packages, model base management, knowledge-based DSS & AI concepts and definitions, AI verses natural intelligence, knowledge in AI, how AI differs from conventional computing, the AI field, types of knowledge-based DSS. Intelligent DSS: The future of AI. DSS construction; the DSS development process; the DSS of the future, decision making in groups, group DSS, the goal of GDSS and its technology levels, the technology of GDSS, the decision (electronic meeting) room, GDSS software idea generation, negotiation. TEXT BOOK:
1. Efrain Turban and Jay E. Aronson: Decision Support Systems and Intelligent Systems (Fifth
Edition), Prentice-Hall, 1998. Mode of Evaluation : Assignment/ Seminar/Written Examination.
57
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, Project scheduling, Risk management, resource allocation, software configuration management and software maintenance. Objectives: The students would be able to understand and use the concepts of software project management. They would be able to do Activity planning, projects scheduling, Risk Management, Resource allocation, 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. Activity Planning: Project schedules- sequencing and scheduling projects network planning modelshortening project duration identifying critical activities. Risk Management: Resource allocation-monitoring and control-managing people and organizing teamsplanning for small projects. Software Configuration Management: Basic management-prototyping models of prototyping. 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. TEXT BOOK:
1. Mike Cotterell, Bob Hughes, Software Project Management, Tata McGraw Hill, 3rd Edition, 2004
REFERENCE BOOK: 1. Ramesh Gopalaswamy, "Managing Global Software Projects", Tata Mc Graw Hill, 2001
58
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. It also covers the topics such as cryptography and various encryption algorithms. Objectives: The students would be able to understand and use encryption algorithms such as RSA, Blow Fish etc; authentication techniques digital signatures and System-level security issues. Attacks, Services & Mechanisms: Security attacks Security services Network Security Model. Conventional Encryption: Classical Techniques: Conventional Encryption model - Stenography Classical Encryption Techniques- Modern Techniques: The Data Encryption Standard The Strength of DES Differential and Linear, Crypto-analysis. Public Key Cryptography: Principles of public-key cryptosystems The RSA algorithm - Key management Diffie-Hellman key exchange Elliptic curve cryptography Message Authentication and Hash functions: Authentication requirements Authentication functions Hash functions Security of hash functions and MAC. Hash Algorithm: Message Digest algorithm (MD5) Secure Hash algorithm (SHA-1) HMAC. Digital Signatures and Authentication Protocols: Digital signatures Authentication protocols Digital signature standard. Electronic Mail Security: Pretty Good Privacy PGP services Transmission and reception of PGP messages PGP message generation PGP message reception. IP Security: Overview Architecture Authentication header Web Security: A comparison of Threats on the Web Secure Socket Layer and transport layer security: SSL architecture SSL record protocol Handshake protocols. Intruders and Viruses, Worms: Intruders Intrusion techniques Password protection Access control Password selection strategies -Intrusion detection- Different approaches of Intrusion detection - Audit records Viruses and related Threats Firewalls: Firewall design principles Firewall characteristics types of firewalls Firewall configurations. TEXT BOOK: 1. William Stallings Cryptography and Network security Principles and Practice", 2nd edition, Pearson Education, 2002. REFERENCE BOOK: 1. Atul Khate, Cryptography and Network Security, Tata McGraw Hill, 2005. 2. Charlie Kaufman, Raja perlman, Mike speciner, Network Security 2nd edition, Prentice-Hall of India Pvt Ltd, 2002.
59
05BIT E19
SOFTWARE ARCHITECTURE L T P C 3 0 0 3
Aim: This subject aims to introduce the basics of software architecture, analysis methods, component based systems and open systems. Objectives: The students would be able to understand the objectives and importance of software architecture, architectural styles. Software architecture analysis methods, review techniques, reuse of architectural assets and open systems. Architecture Business Cycle: Software Processes and the Architecture Business Cycle, Characteristics of a Good Architecture, Basics of Software Architecture, Architectural Styles, Reference Models, and Reference Architectures, Importance of Software Architecture, Various Architectural Structures, A Case Study in Utilizing Architectural Structures. Creating & Analyzing Architecture: Architectures and Quality Attributes, Architectural StylesOrganizing, Refining and Using Architectural Styles, Achieving Quality Goals with Architectural Styles, Unit Operations- Applying Unit Operations to User-Interface Software, Ramifications of Addressing Quality Attributes, Case studies of Web and CORBA. Software Architecture Analysis Methods: Application Examples, Architecture Reviews-Costs & Benefits, Review Techniques & Practices, A Case Study in Designing for High Availability, Assessing Architecture for Maintainability, Architecture Description Languages (ADL)- Capturing Architectural Information in an ADL, System Development using ADL, Choosing an ADL, An ADL Example, Over view of Architecture-Based Development, A Case Study Reuse of Architectural Assets: Creating Products and Evolving a Product Line, Organizational Implications of a Product Line, Component-Based Systems, a Case Study in Product Line Development Reference Architectures: Open Systems, The Process of Engineering an Open System, Standards, A Case Study in Building a Web-Based System from Off-the-Shelf Components, Software Architecture in the Future
TEXT BOOK: 1. Len Bass, Paul Clements, Rick Kazman, "Software Architecture in Practice", Addison Wesley Professional. REFERENCE BOOK: 1. Raphael Malveau Thomas Mowbray Ph.D, Software Architecture Bootcamp, Pearson Education Asia, 2001.
60
05BIT E21
WEB SERVICES
L T P C 3 0 0 3 Aim: To provide the student with the basics of .NET, C#. Objectives: After completion of this course the students will be able to undergo projects in .NET Introduction to Microsoft .NET Platform: Building Blocks of .NET C# Language Fundamentals: Object Oriented Programming in C#. .NET Framework Concepts I: console I/O-working with strings-formatting and conversion- file/O serialization. Threading NET Framework Concepts II: Reflection- Remoting -XML Parsing-Security; Writing GUI Applications with .NET Framework: Introduction to ADO.NET; Writing Web Application with the .NET framework; Introduction to Web Services: Writing Mobile Application with .NET Framework; Advanced Concepts. TEXT BOOK: 1.Rick Leinecker ASP.NET on the edge, IDG Books India Pvt. Ltd, 2003 REFERENCE BOOKS: 1. MSDN, Microsoft C# Language specification, WP Publishers and Distributors, 2001 2. MSDN, Microsoft Visual Basic .NET framework, WP Publishers and Distributors, 2003 3. MSDN, .NET Framework, WP Publishers and Distributors, 2003
61
05BIT E23
PATTERN RECOGNITION L T P C 3 0 0 3
Aim: This subject aims to cover basic concepts of Pattern recognition, Artificial Neural Network Structures, Advanced learning algorithms for Pattern Recognition. Objectives: The students would be able to understand and explain fundamentals of pattern recognition, their applications and comparative studies of feed forward artificial networks. Basic Concepts of Pattern Recognition: Decision theoretic algorithms structural pattern recognition. Artificial Neural Network Structures: Supervised training via error back propagation: derivations. 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. Neural Feature and Data Engineering: Neural engineering and testing of FANNs feature and data engineering. 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. TEXT BOOK: 1.Carl G. Looney, Pattern recognition using Neural Networks theory and algorithms for engineering and scientists, Newyork Oxford University Press 1997. REFERENCE BOOK: 1. Christopher M. Bishop, Neural Networks for Pattern Recognition, Oxford University Press, 1995.
62
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. Line Clipping Create a line and clip a part of that line to other location. 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. 8 Polygon Clipping Make a polygon and make a window on that shift that window to another location. Shearing 9 Draw an object and perform the shearing. 10 Draw any three dimensional object and see all possible views of it. 11 Draw a Car by the combination of lines and circles and move the car. Multimedia 1 2 3 4 5 6 7 8 9 Create Icons using any of the macromedia tools. Create Logos using any of the macromedia tools. Create a Image and Change the Image using Photoshop Create a Morphing images using any macromedia tools Create animation picture using flash. Manipulate Digital Audio using Sound editing tool. Manipulate Digital Video using Video editing tool. Using Fireworks create a Multimedia presentation. Create a Multimedia Presentation using Flash.
63
05BIT 415L
NETWORK ADMINISTRATION LAB
L T P C 0 0 4 2 1. SNMP- 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. MRTG - 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. View history of the network available and look for sudden changes that might account for a problem. Understand how traffic is distributed across the network, suggest plan capacity needs for the future 3. Neo - 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. NetFlow - Flow Monitoring Tool Receive flows, send to stdout Receive flows, 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. Oak - 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. Packet level debugging using Tcpdump Ping Telnet Netcat, Traceroute MTR 7. Netstat
64
65

It Syllabus

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

It Syllabus

Uploaded by

Copyright:

Available Formats

SCHOOL OF COMPUTING SCIENCES

B.Tech. Information Technology

CURRICULUM & SYLLABI [Regulations -2005]

A Place to Learn; A Chance to Grow

05BIT 201COMPLEX VARIABLES AND PARTIAL DIFFERNTIAL EQUATIONS

Mode of Evaluation : Assignment/ Seminar/Written Examination.

DATA STRUCTURES AND ALGORITHMS * L T P C 3 0 0 3

Mode of Evaluation : Assignment/ Seminar/Written Examination.

ELECTRONIC DEVICES AND CIRCUITS * L T P C 3 0 0 3

Mode of Evaluation : Assignment/ Seminar/Written Examination.

INTRODUCTION TO INFORMATION TECHNOLOGY

Mode of Evaluation : Assignment/ Seminar/Written Examination.

DIGITAL COMPUTER FUNDAMENTALS* L T P C 3 0 0 3

Mode of Evaluation : Assignment/ Seminar/Written Examination.

OBJECT ORIENTED PROGRAMMING *

Mode of Evaluation : Assignment/ Seminar/Written Examination.

ELECTRONIC DEVICES LAB

PROBABILITY, STATISTICS AND RELIABILITY * L T P C 2 1 0 3

COMPUTER ARCHITECTURE AND ORGANISATION * L T P C 3 0 0 3

MICROPROCESSOR & INTERFACING TECHNIQUES * L T P C 3 0 0 3

Mode of Evaluation : Assignment/ Seminar/Written Examination.

1. K.L.P Mishra, N. Chandrasekaran, "Theory of Computation", Prentice Hall of India, 2 nd Edition,

Mode of Evaluation : Assignment/ Seminar/Written Examination.

Mode of Evaluation : Assignment/ Seminar/Written Examination.

MANAGEMENT INFORMATION SYSTEMS *** L T P C 3 0 0 3

JAVA PROGRAMMING LAB L T P C 0 0 4 2

10. Write an ALP to generate the following series 1+1/x+1/x3+1/x5+ ..

DISCRETE MATHEMATICAL STRUCTURES * L T P C 2 1 0 3

Mode of Evaluation : Assignment/ Seminar/Written Examination.

DATA BASE MANAGEMENT SYSTEM * L T P C 3 0 0 3

Mode of Evaluation : Assignment/ Seminar/Written Examination.

1. Stallings William, "Operating Systems", Prentice Hall of India, Fourth Edition

Mode of Evaluation : Assignment/ Seminar/Written Examination.

COMPUTER AND COMMUNICATION NETWORKS L T P C 3 0 0 3

Mode of Evaluation : Assignment/ Seminar/Written Examination.

Mode of Evaluation : Assignment/ Seminar/Written Examination.

Mode of Evaluation : Assignment/ Seminar/Written Examination.

OPERATING SYSTEM LAB L T P C 0 0 4 2

REAL TIME SYSTEMS L T P C 3 0 0 3

DISTRIBUTED DATABASE SYSTEM L T P C 3 0 0 3

Mode of Evaluation : Assignment/ Seminar/Written Examination.

Mode of Evaluation : Assignment/ Seminar/Written Examination.

INTERNETWORKING & TECHNOLOGIES L T P C 3 0 0 3

Mode of Evaluation : Assignment/ Seminar/Written Examination.

Mode of Evaluation : Assignment/ Seminar/Written Examination.

OBJECT ORIENTED ANALYSIS & DESIGN L T P C 3 0 0 3

Mode of Evaluation : Assignment/ Seminar/Written Examination.

Mode of Evaluation : Assignment/ Seminar/Written Examination.

INTERNET COMPONENTS AND PROGRAMMING L T P C 3 0 0 3

Mode of Evaluation : Assignment/ Seminar/Written Examination.

SOFTWARE RELIABILITY AND QUALITY ** L T P C 3 0 0 3

Mode of Evaluation : Assignment/ Seminar/Written Examination.

4. Write a program to develop a simple Chat application.

INTERNET COMPONENTS & PROGRAMMING LAB L T P C 0 0 4 2

Mode of Evaluation : Assignment/ Seminar/Written Examination.

Mode of Evaluation : Assignment/ Seminar/Written Examination.

Mode of Evaluation : Assignment/ Seminar/Written Examination.

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

Mode of Evaluation : Assignment/ Seminar/Written Examination.

Mode of Evaluation : Assignment/ Seminar/Written Examination.

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

Mode of Evaluation : Assignment/ Seminar/Written Examination.

DIGITAL SIGNAL PROCESSING L T P C 3 0 0 3