You are on page 1of 42


REVISED COURSE STRUCTURE PATTERN (For the candidates admitted from the academic year 2006-2007 onwards)

Paper and Title

Inst. Hours /Week SEMESTER – I

Instructi on


Exam Hours

Marks Total
Int. Ext.

Paper I – Digital Electronics And Microprocessors Paper II – Discrete Mathematics Paper III – Data Structures And Computer Algorithms Paper IV – Accounting and Financial Management Paper V – Advanced C Programming Paper VI – Data Structures Lab – I Paper VII – PC packages Lab II

5 5 4 4 4 -

3 3 3 3 3 3 3

25 25 25 25 25 25 25

75 75 75 75 75 75 75

100 100 100 100 100 100 100

4 4

SEMESTER II Paper VIII – Numerical and Statistical Methods Paper IX – Computer Networks Paper X – Database Systems Paper XI – Operating Systems Paper XII – Object Oriented Programming Paper XIII – Object Oriented Programming using C++ - Lab III Paper XIV – RDBMS Lab. Lab – IV 5 5 4 4 4 4 4 3 3 3 3 3 3 3 25 25 25 25 25 25 25 75 75 75 75 75 75 75 100 100 100 100 100 100 100

SEMESTER III Paper – XV - Optimization Techniques Paper – XVI - Programming In JAVA Paper – XVII - Internet programming Paper – XVIII - Graphics and Multimedia Paper – XIX - OOAD and UML Paper – XX - Java programming Lab - V Paper – XXI - Internet programming – Lab - VI 4 5 5 4 4 3 3 3 3 3 3 3 25 25 25 25 25 25 25 75 75 75 75 75 75 75 100 100 100 100 100 100 100

4 4


SEMESTER IV Paper – XXII - Distributed Technologies 5 Paper – XXIII - Software Engineering 5 Paper – XXIV - System Modeling and Simulation 4 Paper – XXV (Elective – I ) – Optional 4 1. Principles of e-Commerce 2. Data Mining Paper – XXVI (Elective – II) – Optional 4 1. Distributed Operating System 2. Mobile Computing Paper – XXVII - Distributed Programming Lab Paper – XXVII - OS Lab with Unix / Linux SEMESTER V Paper –XXIX - Human-Computer Interaction 5 Paper – XXX - Compiler Design 5 Paper – XXXI - Cyber Security 4 Paper – XXXII – (Elective – III) – Optional 4 1. Software Project Management 2. Software Testing Paper – XXXIII (Elective – IV ) – Optional 4 1. Web Services 2. Grid Computing Paper – XXIV - Open Source Lab (lamp) Paper – XXXV - MINI PROJECT USING SOFTWARE ENGINEERING TOOLS

3 3 3 3

25 25 25 25

75 75 75 75

100 100 100 100





4 4

3 3 3 3 3 3

25 25 25 25 25 25

75 75 75 75 75 75

100 100 100 100 100 100





4 4

3 3

25 25

75 75

100 100



REVISED SYLLABUS SEMESTER – I PAPER I - DIGITAL ELECTRONICS AND MICROPROCESSORS UNIT-I Number Systems: Decimal, Binary, Octal and Hexadecimal number systems- Conversion between number systems- Binary arithmetic-BCD codes – BCD addition- Alphanumeric codes. Boolean Algebra and logic gates : AND, OR, NOT, NAND, NOR, XOR and XNOR gatesTruth tables- Basic laws of Boolean Algebra – De-Morgan’s theorems. UNIT-II Simplifications of Boolean expressions- Canonical SOP and POS forms- Karnaugh mapsImplementing Boolean expressions using NAND gates alone- Implementing Boolean expressions using NOR gates alone. Combinational logic circuits: Half and Full adders- Half and Full subs tractors- Parallel binary adder- BCD adder- Encoders- Decoders- Multiplexers- Demultiplexers. UNIT-III Sequential logic circuits: NAND latch – SR flip-flop- JK flip-flop – Edge triggering- PRESET and CLEAR inputs – Shift register- Universal shift register- Asynchronous and Synchronous counters – BCD counter. UNIT-IV Parallel Computer Models: Introduction, Flynn's classification, Parallel & Vector Computers system Attributes to performance, implicit & Explicit parallelism, shared, Memory Multiprocessors. Uniform and Non-uniform Memory Access and Cache only Memory Access Models, distributed Memory Multicomputers Multivector & SIMD Computers, PRAM and VLSI Models UNIT- V Processors and Memory hierarchy: CISC & RISC Architectures, CISC Family, RISC scalar processors, Super Scalar Processors and their features. Very Long Instruction word Architecture vector & Symbolic processors, Memory Hierarchy. TEXT BOOK(S) 1. Moris Mano, “ Digital Computer Fundamentals” TMH, III rd Edition 2. Thomas C Bartee “ Computer Architecture and logic Design ” TMH REFERENCE(S) 1. Malvino and Leech “ Digital Principles and Applications” , TMH 2. Badri Ram, “Fundamentals of Microprocessor and Microcomputers” Dhanpat Rai and Sons. 3. Liu and Gibson “ Microcomputer Systems” PHI 3

PAPER II - DISCRETE MATHEMATICS UNIT-I Sets, Relations & Functions: Property of binary relations, equivalence, compatibility, partial ordering relations, Hasse diagram, functions, inverse functions, compositions of functions, recursive functions. UNIT-II Mathematical logic: Logic operators, Truth tables, Theory of inference and deduction, mathematical calculus, predicate calculus, predicates and qualifiers. UNIT- III Groups & Subgroups: Group axioms, permutation groups, subgroups, cosets, normal subgroups, semi groups, free semi-groups, monoids, sequential machines, error correcting codes, modular arithmetic grammars. UNIT –IV Lattices & Boolean Algebra: Axiomatic definition of Boolean algebra as algebra as algebraic structures with two operations , basic results truth values and truth tables, the algebra of propositional functions, Boolean algebra of truth tables. UNIT –V Combinatorics & Recurrence Relations: Disjunctive and sequential counting, combinations and permutations, enumeration without repetition, recurrence relation, Fibonacci relation, solving recurrence relation by substitution, solving non- recurrence relation by conversion to linear recurrence relation. TEXT BOOK(S) 1. Trembly. J.P & Manohar. P., “ Discrete Mathematical Structures with Applications to Computer Science” Mc Graw Hill. 2. Kolman ,Busy & Ross “ Discrete Mathematical Structures” PHI 3. K.D Joshi “Foundations of Discrete Mathematics”, Wiley Eastern Limited. REFERENCE(S) 1. Seymour Lipschutz & March Lipson Tata Mc Graw Hill. 3. C.L.Liu “ Elements of Discrete mathematics “ Tata Mc Graw Hill. *****************


Development of Algorithms. ST. Stacks. Internal and External Sorting. Sahni. Backtracking and Branch & bound. Ellis Horowitz & S.PAPER III . Queues.DATA STRUCTURES AND COMPUTER ALGORITHMS UNIT. Structured Program Concepts. Unit IV ********************** 5 . Algorithms design methods.Aho. Introduction to design and Analysis of Algorithms – S. Goodman.II Sorting and Searching Techniques: Introduction. Hopcropft. Terminology. basic concepts. Principle of analyzing Algorithms. REFERENCE(S) 1. Selection. Galgotia Pub. Ullman . Tata McGraw-Hill 2. Binary search. Recursion. UNIT.III Graphs and Their applications: Introduction. Seymour Lipschitz “Data Structures. PHI 2. TEXT BOOK(S) 1. Top down development of algorithms. Binary tree and traversing. Merging.V Algorithms Design Techniques: Divide and Conquer algorithms. Records. V. Linked list. Fundamentals of Data Structures. Greedy algorithms. LPE 3. Data Structures Using C – Langsam. Tree & Binary tree.I Introduction to data structures. Hedetniem. Tenenbaum. UNIT. Sequential search. Arrays. UNIT. Topological sorting. Insertion. Representation of graphs. Hill climbing. shortest path Algorithms. Binary Tree search. Graph Theory. Sub goals. UNIT. operations on graphs.IV Algorithms. Searching: Introduction.E. Radix. Data structures and Algorithms. Quick sort. Dynamic Programming.TMH . Augenstien. Heap sort and Bubble sort.

Grewal & Gupta.Preparation of various functional budgets. Deva Publications.Preparations of cash budgets. Maheswari “ Principles of Management Accounting “. “Implementing Tally 5.Budgeting and budgetary control – types of budgets.assets and liabilities.IV Cost Accounting.N. S.II Journal – Ledger. TEXT BOOK(S) 1. Manufacturing and profit and Loss account – Balance sheet. Nadhani. Sultan Chand.K. “Computerized Accounting under Tally Publications”.classifications of cost. K.S. UNIT.Methods and Techniques of Cost Accounting.ACCOUNTING & FINANCIAL MANAGEMENT UNIT –I Accounting Principles and Concepts – Double entry book keeping.Depreciation. Gupta & R.Practical Problems in Management Accounting ( Recent edition) 2.Trading. All India Sultan Chand ( Recent Edition) 2. K.fixed and variable cost. T. UNIT. New Delhi ( Recent Edition) 3.marginal costing and decision making.Advantages of Budgeting and Budgetary control. ****************** 6 .volume – profit analysis.K. Sharma. “ Double Entry Book Keeping”. Shukla.Cost.V Financial Packages and Practical Applications: Tally Package –– Fundamentals – Differences Between Computer Accounting and Manual Accounting – Architecture and Customization of Tally – Features of Tally Configuration of Tally – Tally screens and menus – creation of groups – creation of ledgers – deleting and editing ledgers.Income and expenditureAccounting record and system. “ Advanced Accounts “ Sultan Chand 4. S. UNIT-III Analysis and interpretation of financial statements with ratios UNIT.Labour Cost – Overhead.flexible budgets. Khan and Jain “ Financial Management” Tata McGraw Hill ( Recent Edition) 3.4” REFERENCE(S) 1. Depletion and AmortizationAccounting for depreciation.PAPER IV .Material Cost. Case Study: Computerized Accounting.Trial Balance.Grewal.

entering values in – manipulating arrays – examining and passing an array. UNIT-III C Functions: Mathematical functions – sin – cos – tan –asin – acos – atan – sqrt – pow – log – String functions – stripy – stroat – stremp – strelen – strlwr – strupr and user – defined functions. REFERENCE(S) R. definitions.PAPER V .ADVANCED C PROGRAMMING UNIT-I C. Structure: definitions – assigning structure variable – assigning initial values – using a structures – structure arrays – structures and functions. 2000.Language fundamentals: Program Structure – Identifiers – Data types – Integer – float – double – char – constants – variables – operators and expressions – managing input and output operations. 1988. C. WHILE statement – WHILE…. Hutchison & S.ELSE statement – FOR statement – DO…... ******************** 7 . B. “Programming Using The C Language” McGraw Hill.. Tata McGraw Hill. Just. UNIT-V Pointers and File Operations: Understanding pointers – pointers and functions – File Operations: Understanding files – declaring a file – opening a file – closing a file – input and output functions – formatted input and output – working with structures adding data to a file – reading a printing a disk file. ELSE statement – nested IF…. UNIT-II C control structures: Decision making with IF statement – IF…. DO statement – GOTO statement – SWITCH statement. Balagurusamy. “Programming in C”. UNIT-IV Arrays and structures: Arrays. declarations. TEXT BOOK(S) E.

Operations on Binary tree and Traversals 10. Matrix Manipulations 4. Binary Search 3. SORTING: a. Selection Sort d. Operations on Doubly Linked List 9.DATA STRUCTURES LAB – 1 Write C programmes to implement the following: 1. File Processing ************************ 8 . Dijkstra’s Algorithms to find the Shortest Path 11. Bubble Sort b. Operations on Stack and Conversion of expressions 6. Quick Sort 2.PAPER VI . Linear Search b. Heap Sort e. Operations on Queue 7. Polynomial Addition & Multiplication 5. Insertion Sort c. Operations on Linked List 8. SEARCHING : a.

Insertion. Tables and Manipulations i. Copying text and pictures from Excel i. Prepare a business letter for more than one company using mail merge ii. Prepare an invitation to be sent to specific addresses in the data source. Prepare a greeting card ii. Prepare a letter 2. Create a calendar and Auto format it 4. Draw a chart in Excel and paste it on word ii. iii. Usage of Numbering. Text manipulation Change the font size and type Aligning and justification of text Underlining the Text Indenting the Text i. 3. Prepare a Bio-Data ii. Picture Insertion and alignment i. Bullets. Deletion (Columns & Rows) and usage of Auto Format ii. Mail Merge concepts i. Prepare a document in news paper format ii.PC PACKAGES LAB II WORD PROCESSING 1. Prepare a letter using any template ii. Prepare two data using various kinds of templates 6. Creation of documents using templates Creation of Templates i. Creations. Prepare a document with bullets and footers and headers. Prepare a handout 5. Footers and Headers Usage of Spell checks and Find and Replace i. Create a mark sheet using table and find out the total marks.PAPER VII . Import a picture from Excel and edit the picture. 9 . 7.

Usage of Formulae and built in functions Describe the types of functions File manipulations Data sorting – Ascending and descending Worksheet preparation Mark list Preparation for a student Individual Pay Bill Preparation Electricity Bill preparation Inventory Report Preparation Invoice Report Preparation Drawing Graphs Usage of Auto formatting PRESENTATION SOFTWARE i. xi. Customizing background of slide master iv. x. Creating presentation using Blank presentation ii. vi.ELECTRONIC WORK SHEET i. Exercises on slide transition and animation vi. iv. ix. xii. Creating presentation using Auto content Wizard iii. Working with Graphs and Objects v. iii. ***************** 10 . v. ii. viii. Usage of Design templates. vii.

Miline’s and Adams Methods. “An Introductory Text – Wiley Bastern Limited. 2. Gauss Jabcobi and Gauss seidal. C Gupta “Introduction to mathematics statistics”. Linear Regression. Correlation Coefficient.SEMESTER – II PAPER VIII . Predictor. False position Method.Bisection method. RajaRaman. a Statistical Methods.Sastry “Introductory methods of Numerical Analysis”.one tailed and two tailed tests – Student T-test. 2. . *************************** 11 . UNIT IV: Probability distribution and Correlation (12 hours) Binomial poisson and Normal distribution Fitting of probability distributions. Regula-Falsi Method. Method of least squares. C. Lagrange and Newton Interpolation. Chi-Square test. Interpolation: Polynomial interpolation. TEXT BOOK(S) 1. F-test. Chipping and rounding in different number systems. Transcendental and polynomial equation. Newton Raphson Method Secant Method. V. S. (12 hours) Solution of system of linear algebraic equations: Gauss elimination. S. Multiple linear regression. Corrector methods. Correlation and Regression. UNIT I: Introduction and Algebraic equations (12 hours) Errors in Numerical approximation: Sources of error. PHI. UNIT III: Differential Equations: (12 hours) Euler’s Method and its modified form Runge kutta method IV order. 3. UNIT II: System of Equations and Interpolation. Gauss Jordan. New Delhi. “Computer Oriented Numerical Methods”. Madin. various types of Errors. PHI.S.NUMERICAL AND STATISTICAL METHODS Objective: To develop computing and program writing skills. Xavier “ C Language and Numerical Methods” New Age International Publications. Iterative methods. UNIT V: Tests of Hypothesis (12 hours) Tests of hypothesis-Testing for attributes Mean and Normal Population. Sultan & Chand REFERENCE BOOK(S) 1.

2000. Kurose.25 – Frame Realy – Routing in Switched networks – Congestion control in switched networks.Wireless LANs – Technology: IEEE 802. Pearson Education.Medium Access control – Physical layer Unit IV Internet work Protocols – Basic Protocol Functions – Principles of Internetworking Connectionless Internetworking – Internet Protocol – IP V6 – Internetwork Operations: Multicasting – Routing protocols – Integrated service architecture Unit V Transport Protocol: Connection oriented transport protocol mechanism – TCP – TCP congestion control – UDP. Pearson Education. 2. Network Security: Security requirements and attacks – Confidentiality with symmetric encryption – Message Authentication and Hash function – Public key encryption and digital signatures Text Book: “Data and Computer Communication – William Stallings – 7th Edition. Uyless D.11 – Architecture and Services .Protocol Architecture: Need for Protocol Architecture – OSI – The TCP/IP Protocol Architecture – Analog/Digital Transmission – Guided and Wireless Transmission Unit II Wide Area Networks : Circuit switching & Packet Switching – Circuit switching: networks & concepts – Packet Switching – Principles .Tanenbaum – Pearson Education. Unit III Local Area Networks: Topology – Transmission media – Protocol – Architecture – Bridges – Switches – High Speed LANs – Ethernet – Token Ring – Fiber Channel . 2004.X.PAPER – IX . 3. 1998. Data Communications and Distributed Networks. ed. Computer Networks. Black. “Computer Networks” – III edition – Andrew S. Tata Mcgraw Hill. *********************** 12 . Reference Books: 1.COMPUTER NETWORKS Unit I Introduction – Communication Model – Data Communication – Communication Networking..

and Abraham Silberschatz. McGraw Hill. 2002 REFERENCE BOOK(S): 1. ******************** 13 .DATABASE SYSTEMS UNIT – I Introduction – purpose of database systems – Data Abstraction – Data models – Instances and schemes – Data independence – DDL – DML – Database users – ER model – Entity sets – Keys – ER diagram – relational model – Structure – Relations Algebra – Relational Calculus – Views.. 4th Edition. Galgotia Publications Private Limited. “An Introduction to data base systems”. UNIT – III File and system structure – overall system structure – file Organization – data dictionary – Indexing and hashing – basic concept B and B+ tree indices – Static and Dynamic hash functions.PAPER – X . TEXT BOOK(S): Henry F. Addison Wesley 1983. “An Introduction to Database Systems”.Date. schedules – serial and non-serial types – Serialization of schedules and views – testing for seriability – lock based protocols – time based protocols – validation techniques – multiple Granularity – multiversion schemes – insert and delete Operations. 3rd Edition. C. UNIT – II SQL – QBE – QUEL – Basic structure – various Operations – Relational database design problems in the relational data base design – Normalisation – normalization using functional. UNIT – V Distributed data bases – structure of distributed databases – Trade offs in Distributing the database – Transparency and autonomy – distributed query processing – recovery in distributed systems – commit protocols – security and integrity violations – authorization and views – security specification – encryption – Statistical databases. 1991.J. Sudarshan “Database system Concepts”. UNIT – IV Recovery and atomicity – failures classification and types – Transaction model and Log based recovery. 2.Korth. Pipin C.Desai. Multi value and join dependencies.

UNIT – V File Management – Files. William Stallings.PAPER – XI . 1992. I/O Buffering. 1997. I/O Management and disk scheduling – Organization of the I/O function – the Evaluation of the I/O function. Third Edition. “Operating Systems”. Address Translation in a Segmentation System – Combined Paging and Segmentation – Virtual Memory – Operating System Software – Fetch Policy. scheduling criteria. REFERENCES: 1.. Mutual Exclusion – Software support. Mutual Messages – Deadlock – Deadlock prevention. Silberchatz A. Segmentation –Organization. Placement Algorithm..OPERATING SYSTEMS Course Objectives: To impart knowledge about Operating Systems. scheduling Algorithms. Concurrency – Principles of Concurrency. Process Control –Processes and Threads. “Operating System Concepts”. Relocation in a Paging System – Sample Segmentation. Deital H. Operating System as a Resource Manager: Evaluation of OperatingSystems – Serial Processing. File Management Systems. Dekker’s Algorithm – Mutual Exclusion – Hardware support. TEXT BOOKS: 1. their functional architecture and processes. Highest response ratio and Feedback scheduling Performance comparison – Fair – Share Scheduling. Deadlock Avoidance – An Integrated deadlock Strategy. Time Sharing Systems. Shortest Process next.M. Galvan P.L. Peterson J. Maxwell McMillan. Addison Wesley Publishing Co. Functions of File Management File Directories – File Sharing – Secondary Storage Management – File allocation. 1998. Virtual Memory – Paging – Address Translation in a Paging System. 2. UNIT – III Memory Management – Memory Management Requirements – Fixed Partationing. Addison Wesley Publishing Co. Deadlock Detection. *********************** 14 . File System Architecture. Sample Batch Systems.. UNIT – I Operating Systems Objectives and functions – Operating System and User /Computer Interface. Logical structure of the I/O function. International Editions.. UNIT – II Process Description. Page buffering resident set Management. Disk Cache. FIFO. Round Robin. Shortest Remaining Time. Second edition. UNIT – IV Scheduling – Types of Scheduling. “An Introduction to Operating Systems”. Placement Policy and replacement Policy.

Some C++ I/O basics.more about virtual functions. REFERENCE(S) 1.C++ commands. precision () and fill() – using I/O manipulators.Returning references.overloading a Unary operator – using friend operator functions.Classes: Some difference between C and C++.checking the I/O status.Introducing Function Overloading.random access. binary I/O.Exception handling.virtual bas classes.OBJECT ORIENTED PROGRAMMING Objective: To impart Object Oriented Programming skills using C++ UNIT-I What is Object Oriented Programming? – C++ Console I/O. Tata McGraw Hill 5th Reprint 2000. E.formatted I/O using width().Constructors.overloading binary operators-overloading the relational and logical operators.Robert Lafore “ Object Oriented Programming in Turbo C++”.a closer at the assignment operator.Pointers and derived classes.Constructors take parameters.creating extractors.Using default arguments.Creating your own inserters.Overloading and ambiguity – Finding the address of an overload function.applying polymorphism. UNIT-V Creating your own manipulators.Arrays of objects – Using Pointers to Objects – Using new & delete – More about new & delete – references – Passing references to objects.customized I/O and files.Constructor and Destructor Functions. UNIT-IV Base class access control –using protected members. TEXT BOOK(S) Herbert Schildt “ Teach Your self C++”.more unformatted I/O functions.PAPER – XII -.Introduction to virtual functions.Independent References and restrictions. TMH New Delhi *************************** 15 . UNIT-II Assigning Objects – Passing Object to Functions – Returning Object from Functions.the basics of operator overloading. III rd edition.Creating and Using a Copy constructor.File I/O basics. UNIT-III Overloading Constructor Functions. destructors and inheritancemultiple inheritance. Balagurusamy “ Object Oriented Programming with C++ “. Galgotia 2001 2.Introducing Inheritance – Object Pointers – In line Functions – Automatic in lining.An Introduction to friend functions.overloading the subscript() operator.unformatted.

Write a program that exercises this class by creating two initialized and one uninitialized int values. in 11. and another should initialize it to fixed values.59. search for a record that to be printed g. Develop an object oriented program in C++ to read the following information from the keyboard: a. Include member functions to initialize an int to O. Use this class to store two double type values that could be used to compute the area of figures. edit an entry f. Add to the base class.59 format. and seconds. a member function get_data ( ) to initialize base class 16 . Derive two specific classes called triangle and rectangle from the base shape. The only data in this class is an int variable. c. adding these two initialized values and placing the response in the uninitialized values. Finally it should display the value of this third variable. Call the class Int (note different spelling). a. sort entries III – USING POLYMORPHISM Create a base class called shape. by reference and then sets the smaller of the two numbers to O. list a table c. A member function should display it. Create a class that imitates part of the functionality of the basic data type int. Designation d. The final member function should add two objects of type time passed as arguments. Employee name b. build a master table b. and then displaying this result. Years of experience e. delete old entry e. Develop a program in C++ to find the largest of any 3 numbers using Macro definitions c. Write a function in C++ to generate a Fibonacei series of n numbers b. Age and Construct an object oriented data base to carry out the following methods: a.PAPER – XIII OBJECT ORIENTED PROGRAMMING LAB USING C++ (LAB -III ) I – USING FUNCTIONS. and one that isn’t initialized time objects. II – USING CLASSES a. leaving the result in the third time variable. insert a new entry d. Then it should add the two initialized values together. and to add two int values. to initialize it to an int value. Employee code c. b. to display it ( it looks just like an int). Write a function called zeroSmaller ( ) that passes two int arguments. minutes. and one that isn’t initialized . Write a main ( ) program to exercise this function. A main ( ) program should create two initialized time objects. Create a class time that has separate int member data for hours. One constructor should initialize data to O.

default constructor and inline member functions. name of the patient. sex c. b. Make display_area () as a Virtual function and redefine this function in the derived classes to suit their repuirements. Write a C++ program to read a file and display the contents of the file on the screen with line numbers. namely name of the patient. Write a C++ program to check whether the given string is a palindrome or not using the pointer method. the number of rooms. V. name of the patient b. USING OVERLOADING a. Write a C++ program to find out the number of vowels in each word of a given text using a pointer. members and another member function display – area( ) to compute and display the area of figures. VIII – USING FILES a. VII . bed number f. sex and age. Another base class consists of ward numbers. nature of the illness g. date of admission Design a base class consisting of the data members namely. Find out the sum of the above two matrices separately and display the total sum of these arrays individually. create a derived class called office that inherits building and also stores the number of fire extinguishers and the number of telephone. Write a program in C++ using function overloading to read two matrices of different data types such as integers and floating point numbers. Using these three classes design a program that will accept dimensions of a triangle or rectangle interactively and display the area. Develop an object oriented program in C++ to create a data base of the following items of the derived class. Design a virtual class for the data member. a.USING POINTERS a. Create a generic base class called building that stores the number of floors a building has. ward number e. Next. destructor. Create a class FLOAT that contains one float data member. 17 . The derived class consists of the data member date of admission. and its total square footage. VI – USING CONSTRUCTORS & DESTRUCTORS Write an object oriented program in C++ to read an integer number and find the sum of all the digits until it reduces to a single digit using constructors. b. Create a derived class called house that inherits building and also stores the number of bedrooms and the number of bathrooms. age d. IV – USING INHERITANCE a. sex and age. bed number and nature of the illness. Overload all the four arithmetic operators so that operate on the objects of FLOAT.

b. Marklist Preparation. Case studies: i. Cursors. Creating. WHERE clause. NOT Operators.b. iii. UNION. MINUS. Mark – sheet Preparation. b. 5. Built-in-functions of SQL. ************************** PAPER – XIV -. Paybill Preparation ii. 7. a. OR. Sub queries. c. Student Information System IX – USING EXCEPTION HANDLING Create a generic function that returns the mode of an array values. Write a C++ program to merge two files into a one file heading. AND. c. INTERSECTION. Uses of Select statement – for queries. ********************* 18 . Income tax calculations. creating views and querying in views. 2.RDBMS LAB ( LAB IV) 1. Seat reservation Problems. Sorting and grouping. b. e. updating and inserting into database & simple queries. Nested queries using SQL. Pay – roll system. triggers and stored procedures and functions. Case studies : a. f. Personnel Information Systems d. Join. 6. a. 4. Student evaluation systems. Use of indexes. c. 3.

UNIT – II Queuing Models : Introduction – Deterministic Model – Queue Parameters – M/M/I Queue – Limited queue Capacity – Multiple Servers – Finite Sources – Waiting Times – Queue discipline – Non – Markovian Queues – Probabilistic models.Ravindran. “Operations Research – Principles and Practice John Wiley & Sons. 1982. Hamdy A Taha.SEMESTER – III PAPER XV .Philps.Solberg.J.OPTIMIZATION TECHNIQUES UNIT – I Linear Programming : Introduction – History of OR – Meaning of OR – Principles of Modeling – Linear equation – Gaussian Elimination – Formulation of LP models – Graphical Solution – Algebraic Solutions – Simplex Method – Feasibility – Optimality – Artificial Variables – M – Technique – Duality – Dual simplex Algorithm – Transportation Problem – Assignment Problem – Least Time Transportation Problems. Reference Book: 1. A. Operations Research – An Introduction Macmillan Publishing Company. Text Book: Kanti Swarup P. Don. 19 . James. “Operation Research”.Gupta and Man Mohan.K. 1976. UNIT – III Inventory Models: Determine Models – EOQ – Finite and Infinite Delivery Rates without BackOrdering – Finite and Infinite delivery rates with Backordering – Quantity Discounts – EOQ with constraints – Probabilistic model – Single Period Model – Reorder Point Model – Variable Lead Times UNIT – IV PERT / CPM: Arrow (Network) Diagram Representation – Time estimates – Critical Path – Floats – Construction of Time chart and Resource Leveling – Probability and Cost Consideration in Project Scheduling – Project Control. Sultan & Chand Publishers New Delhi.T. UNIT – V Replacement Theory : Introduction – Various replacement situations – Replacement Policy – Variables Maintenance costs and fixed money value – Variable Maintenance Costs and Variable Money Value – Individual Replacement Policy – Group Replacement Policy – Reliability. 1992. 2.

II Control flow – Exception – Strings . UNIT .II Extending Classes – Interfaces – Nested classes & Interfaces. Operators & Expressions – Classes & Objects UNIT . “ Programming with JAVA”. UNIT I.V Collection – Utilities – Standard Packages Text Book Ken Arnold. James Gosling. 1999. “The Java Programming Language”.IV Threads – Programming with types – I/O Packaging.Tokens. Muthu.PAPER XVI .Programming In JAVA UNIT .Packages UNIT . Patric Naughton and Herbert Schildt “Java 2 Complete Ref”. 3rd Edition Reference Book 1. C. David Holmes.I Introduction. 2005 3. Norton Peter and William STanek “Gude to Java Programming” Sams net 1996. Thomson. Tata Mc Graw Hill. 20 . 2.

David Hunter et al.Introduction to DOM and SAX Parsers.DTD.Hardware elements associated with internetInternet Services . Marshall T. UNIT – IV Introduction to XML – Well formed XML.PAPER XVII .XSD.FTP .General Syntactic Characteristics – Primitives.Web Indices – Search Engines UNIT – II Introduction to HTML.Internet Protocols – TCP/IP.Mail and its types.Valid XML. ( Unit IV) REFERENCE BOOK(S) 1.V Introduction to Dynamic Web Applications: Server Side Scripting basics – Server Side Scripting Languages – PHP Scripting .Remote access . Pearson Education ( Unit V) 3. Addison Wesley 1993.Frames – Framesets. HTTP – Other Protocols – TelnetGopher. UNIT . II and III) 2.Link documents using Anchor Tags– Images and Pictures – Tables – HTML Forms. Lynch. Beginning XML. 21 . Daniel C.III Introduction to Scripting – Java Script – Data types – Operators – Variables – Conditional Statements – Functions – Objects – Document object– Window Object – Event Handling – Introduction to VBScript and Perl Script.Tags and Documents. UNIT .CSS. Deitel & Deitel “Internet and WWW – How to program? Pearson Education. Programming the WWW. Rose.I Basics of Internet communication . Internet systems Handbook”.XSL. 2005 (Units I. operations and expressions – Control Statement – Arrays – Functions – Pattern Matching – Form Handling – Files – Cookies – Session Tracking – Database access with PHP and MYSQL TEXT BOOK(S) 1. Robert W Sebesta..INTERNET PROGRAMMING UNIT . UDP. Wrox publications 2000.

John. Willam M.Interactive Input devices – Display processors. Newman . UNIT .Display Devices – Hard copy Devices. UNIT .The Timeline – The stage Tools and toolbars – The menu bar – Properties Inspector – Using Bitmaps – importing bitmaps – bitmaps as fills. Koegel Buford. PHI 2. Donald Hearn M. Robert F. Regulatory and Social UNIT .PAPER XVIII .IV Architectures and Issues for Distributed Multimedia Systems: Distributed Multimedia systems – synchronization. Flash – How Flash works – Uses of flash – what can flash do. Paulin Baker “ Computer Graphics” 1992 .V Photoshop – Using the Toolbox – Palettes – Creating a simple image – creating BannersCreating buttons – Creating Shapes & Logos – Creating Patterns and Creating brush. Communications and Entertainment products: Technology trends – Multimedia applications: hybrid devices – A designers view of Multimedia appliances – Industry perspectives for the next decade – A forward view – Key challenges Ahead: Technical. Sproull “ Principles of Interactive Graphics” 1979 McGraw Hill. 3. TEXT BOOKS 1..III USES OF MULTIMEDIA INTRODUCTION Introduction – What is Multimedia .Multimedia and Personalized computing – Multimedia on the Map – A tour of emerging applications – Multimedia systems – The challenges The Convergence of Computers.GRAPHICS AND MULTIMEDIA UNIT – I GRAPHICS DEVICES – LINE AND CIRCLE DRAWING ALGORITHMS Overview of Graphics Systems. “Multimedia Systems”. using sound – importing & editing sound – adding video – manipulating video – Animation : Frame-by-frame animation – Motion tweening – Motion guides – animating text – movie clips.II FILLING TRANSFORMATIONS AND SEGMENTS Attributes – area filling algorithms – Scan conversion algorithms – Transformations – Two dimensional – Basic Composite and Other transformations – Matrix representationsWindowing and Clipping – View port Transformation – Segments – Introduction to 3D Graphics. Pearson Education 2005 22 .F. orchestration and QOS Architecture – The role of standards – A framework for multimedia systems Digital Video and Image Compression: Evaluating a compression system – redundancy and visibility – video compression techniques standardization of algorithms – The JPEG image compression standard – ITU –T recommendation H. graphics Software – Line drawing – various algorithms and comparisons – Circle drawing algorithms.261 – The Mpeg Motion video compression standard – DVI technology UNIT .

UNIT – IV Advanced Behavioral Modeling: Events and Signals – State Machines – Processes and Threads – Time and Space – State chart Diagrams. “The Unified Modeling Languages User Guide”. 2. Kendall Scott. Grady Booch. Ali Bahrami. UNIT – V : Architectural Modeling: Components – Deployment – Collaborations – Pattern and Frameworks – Component Diagram – Deployment Diagrams – Systems and Models. UNIT – II Classes and Objects : The nature of an object – Relationship among objects – The nature of a class – Relationship among classes – The interplay of classes and objects . Addition Wesley 1977. “UML Distilled-Applying the standard Object Modeling Language”. “Object –Oriented analysis and Design with Applications”.REFERENCE BOOKS 1. – Categories of analysis and design methods. 2. New Delhi. James Rumbaugh and Ivar Jacobson. Classification : The importance of proper classification – Identifying classes and objects – Key abstraction and mechanisms – A problem of classification. 23 . Pearson Education– Ninth Indian Reprint 2002. Text Books: 1. Macromedia Press. References 1. UNIT – III Basic Behavioral Modeling: Interactions – Use Cases – Use Case Diagrams – Interaction Diagrams – Activity Diagrams. The Object Model : The evolution of object model – Elements of object model – Applying the object model – Foundations of the object model. “Object Oriented Systems Development” Irwin-McGraw Hill. Grady Booch. 1999. Addison Wesley – Fourth Indian Reprinting 2000. Techmedia. PAPER XIX . Techmedia.On building quality classes and objects – Invoking a method. 2. Adobe Press “Adobe Photoshop CS”. Jen Dehaan “Macromedia FLASH MX 2004”. International editions.OOAD and UML UNIT – I Complexity : The inherent complexity of software – The Structure of complex systems – Bringing order to chaos – On designing complex systems. Martin Fowler.

d. 5. To add an item at the end of the list. which will create the layout below : FORMAT Enter your Name : Enter your Age : Select City : *Delhi *Madras Select S/W : *Oracle *Visual Basic *Java OK CANCEL Handle the following simple validations. Write a program that accepts a shopping list of five items from the command line and stores them in a vector and accomplish the following: a. Create a try block that is likely to generate three types of exception and then incorporate necessary catch blocks to catch and handle them appropriately. Compute and deposit interest. Implementation of the concept of multiple inheritance using interfaces and design a package to contain the class students and another package to contain the interfaces sports. one called savings account and the other current account.V 1. Write an Applet which will play two sound notes in a sequence continuously use the play( ) methods available in the applet class and the methods in the Audio clip interface.JAVA PROGRAMMING LAB . impose penalty. 4. b. 2. Current account falls below this level a service charge is imposed. Check for the minimum balance. Permit withdrawal and update the balance. d. 3. 24 . Use constructors and methods to initialize the class members. c.PAPER XX . Accept deposit form a customer and update the balance. Develop a simple real-life application program to illustrate the use of multithreads. Display any deposit interest c. Age entered should be done as the user exits the fields as well as when OK button is pressed. Hint use the Boolean action (Event evt. account number and type of account. b. To delete an item in the list. Introduce the necessary methods in order to achieve the following tasks: a. The savings account provides compound interest and withdraw facilities but no cheque book facility. object arg). 7. Create a class Account that stores customers name. To add an item at a specified location in the list. if necessary and update the balance. Assume that a bank maintains 2 kinds of account for its customers. From this derive the classes curr-acct and sav-acct to make them more specific to their requirements. The current account provides cheque book facility but no interest. Write a Java applet. To print the contents of the vector. e. 6. The name entered should be less than 25 characters wide.

5. 25 . grade of a student in tabular format by accepting user inputs for name. 2. Align the text with colors. Create a HTML table with rows and columns and split them using Rowspan and Colspan. Write an XSL style sheet and attach that to the XML document. Write a HTML program for new email account registration. Create a web page in the format of front page of a news paper using Text links.PAPER XXI . Validate the input using Java Script. Validate the document using DTD or XSD.VI 1. number and marks from a HTML form. total. 3. 3. Write a PHP program to access the data stored in a mysql table. 6.INTERNET PROGRAMMING – LAB . Write a server side PHP program that displays marks. Write an XML document to display your bio-data.

NET and ADO. New Delhi. Unit IV: ASP. New Delhi. Wiley India(p) Ltd.NET : Introduction – architecture – ASP.NET Runtime – Internet Information Services – Visual Web Developer Web Server – ASP.Net”. Books for Study 1. Unit V: ASP. Daniel H. “Introducing Microsoft.NET: System.DISTRIBUTED TECHNOLOGIES Unit I: Client server architecture: 2-tier model – 3-tier model – n-tier model – J2EE architecture – DODNET architecture – MVC architecture – struts framework. Platt S David. “Instant Enterprise Java y – Beans”.Data.NET Parser – Assembly – Page class. “J2EE Bibl”. 2.SEMESTER IV PAPER XXII . New Delhi. Paul Tremblett. Tata McGraw Hill Publishing company. 2002. Prentice hall if India.Steinberg. Web Server Controls – HTML Controls – AdRototor and Calendar Controls – Validation Controls – Security Management. 2001.Entity Beans – CMP and BMP – Message Driven Beans. (12) Unit II: Presentation services: Servlet – JSP – Javamail – Interaction services: RMI – CORBA – XML – JMS (12) Unit III: Component model: EJB : Session Beans : Stateless and State full . Jusin Couch. 3. SqlClient and Xml namespaces – Provider objects and Consumer objects – Disconnected data access – GridView FormView. 2003 26 .

Ghezzi. 27 . Roger S. architectures and applications. UNIT III : System Engineering : Computer based systems – The system engineering hierarchy – Business process engineering: overview – product engineering: . User Interface Design : The Golden rules – User interface design – Task analysis and modeling – Interface design activities – Implementation tools – Design evaluation. “Software Engineering Concepts”. UNIT IV : Design Concepts and Principles : Software design and software engineering – the design process – Design principles – Design concepts – Effective modular design – Design heuristics for effective modularity – Design Model – Design Documentation. Pressman. A Practitioner’s Approach”. C. “Software Engineering. Software Testing Strategies : A strategic approach to software engineering – Strategic issues – Unit testing – Integration testing – Validation testing – System testing – The Art of debugging. Richard Fairly. Architectural Design : Software Architecture – Data design – Architectural styles – Mapping requirements into software architecture – Transform mapping – Transactional mapping – Refining architectural design. Pearson Education. 2. Software Engineering. Sixth Edition. 3. M.Extreme Programming. Text Book : 1. UNIT II : Software Project Planning : Observation on estimating – Software scope – resources – Software project estimation – Decomposition techniques – Empirical estimation models – Make buy decision. Somerville. References : 1. UNIT V : Software Testing Techniques : Software testing fundamentals – Test case design – white box testing basis path testing – Control structure testing – Black box testing – Testing for specialized environments. Analysis Modeling : The elements of the Analysis model – Data modeling – Functional modeling and information flow – Behavioral modeling – The mechanics of structured analysis – Data Dictionary.PAPER XXIII - SOFTWARE ENGINEERING UNIT I : The evolving role of software : Software . Mandrioli. “Fundamentals of Software Engineering”. 1988. Pearson Education.Software myths – software engineering – a layered technology – the software process – the software process models – linear sequential model – prototyping model – RAD model – evolutionary software process model – component base development – Agile Computing. Tata McGraw Hill.Requirement engineering – System modeling. Jazayeri and D.

Simulation of Inventory Problem.O. SIMPLE 1 and C – Case Study.Carson. Prentice Hall of Inc. 1989. 1984. Programming for Discrete event systems in GPSS. 2. Prentice Hall of India. Single Channel Queue. Narsingh Deo. Simulation of LAN – Manufacturing System – Hospital System. Reference Books: 1. UNIT – V Simulations Languages – GPSS – SIMSCRIPT – SIMUKA – SIMPLE 1. Roth M. 1979. two server queue. Jerry Banks and John S. 1987. Text Books: 1. Random Variable Generation – Inverse Transform Technique – Exponential Distribution – Uniform distribution – Wei bull distribution – Empirical Continuous Distribution – Generation approximate Normal Varieties – Erlarg Distribution. Discrete Event Simulation – Concepts in Discrete – event Simulation. Prentice Hall of Inc. Technique for Generating Random Numbers – Mid square Method – The Mid Product Method – Constant Multiplier Technique – Additive Congruential Method – Linear Congruential Method – Tauswarthe Method – Tests for Random Numbers – The Kolmogorov Simrnov test – The Chi – square test.SYSTEM MODELING AND SIMULATION.Davis and Robert M. “Simulation Modelling with Pascal”. UNIT – I Principle of Computer Modeling and Simulation –Monete Carlo Simulation – Nature of Computer Modeling and Simulation – Limitation of Simulation – Areas of Application – System and Environment – Components of a system – Discrete and Continuous Systems – Models of a system – A variety of Modeling Approaches. Manual Simulation using event Scheduling. UNIT – III Empirical Discrete Distribution – Discrete Uniform Distribution – Poisson Distribution – Geometric Distribution – Acceptance – Rejection Technique for Poison Distribution – Gamma Distribution. 1. UNIT – IV Design and evaluation of simulation experiments – Input – Output Analysts – Variance reduction technique – Antithetic Variables – Verification and Validation of Simulation models. Francies Neelamkovil. “Discrete Event System Simulation”.Keefe. “Computer Simulation and Modelling”. UNIT – II Random Number Generation. 28 . John Wiley & Sons. “System Simulation with Digital Computer”.PAPER XXIV .

“Introduction to E-Commerce”.Commercial Transactions .Microsoft Internet Servers . 4th Edition. ONLINE COMMERCE ENVIRONMENTS Servers and Commercial Environments . 2004.Offline and Online Transactions .Trusted Key Distribution and Verification .Cryptography : Objective . UNIT 3.Functions and Features .Internet Strategies. TEXT BOOKS 1.Digital Currencies and Payment Systems .Optional ..Secure Web Servers .Security Protocols .Data Encryption Standard .Payment Methods . Greenstein.. 2003. New Delhi.Digital Signature Nonrepudiation and Message Integrity.Internet Environment Internet Advantage . REFERENCES 1.Selling through CyberCash. Ltd.Encryption . ELECTRONIC PAYMENT METHODS Traditional Transactions : Updating .Digital Currencies . INTRODUCTION Networks and Commercial Transactions . Digital and Virtual Internet Payment System . Ltd..Establishing Trust .Internet Security Holes . Tata Mc-Graw Hill Pvt. UNIT 4.Ecash Client Software and Implementation .DigiCash Using Ecash . Firewall media.Security Considerations – CyberCash: Model .Electronic Data Interchange .Protocols for the Public Transport . Jaworski.Customer Protection Client Application .PAPER XXV i) PRINCIPLES OF E-COMMERCE UNIT 1. Tata Mc-Graw Hill Pvt.Cryptographic Applications . 2000.Security . Ltd. “Electronic Commerce”.Internet and Other Novelties . UNIT 5.Breaking Encryption Schemes . Jeffrey F.Payment Systems : Electronic.The Chip .Account Setup and Costs .Credit Card Business Basics. 2nd Edition. 29 .Codes and Ciphers . ELECTRONIC COMMERCE PROVIDERS Online Commerce Options . SECURITY TECHNOLOGIES Why Internet Is Unsecure . UNIT 2.Electronic Transactions Today ..ELECTIVE PAPER 1: .Required Facilities .Server Market Orientation Netscape Commerce Server .SET . Techniques and Tools.. 2.World Wide Web. “Electronic Commerce”.Rayport and Bernard J.Pete Loshin.Smart Cards .Virtual Transaction Process InfoHaus . An imprint of laxmi publications Pvt.

Social implications. Classification and Predication: Decision Tree.ELECTIVE COURSE 1: ii) UNIT I: Introduction: Data mining-motivation. & Micheline kamber. University Press (India ) Limited. Outlier Analysis.Arun K. TEXT BOOK: 1. 3-tier DW Architecture-DW Implementation: Efficient computation of DATA Cubes. Data Mining Query Language-other languages for data mining. Measures-DW Architecture: Steps for design and construction of DW. First Edition. Bayesian Classification back propagation. DM Applications. First Indian Reprint.”data Mining: Concepts and Techniques”.Jiawei I-lan. Taskrelevant data.2001 DATA MINING 30 . Generalization and Specialization.2001 REFERENCE BOOK 2. Discretization and concept Hierarchy Generation. Grid-based methods. Spatial rules. Data Reduction. UNIT III : Data Preprocessing: Data Mining Primitives.Dunham. UNIT lV: Data Mining Algorithms: Association Rule Mining: MBA Analysis.Pearson Education.2003 3. Sequences. Pattern Detection.Margaret H. Pujari. UNIT V: Web. Basic Data Mining Tasks. The Apriori Algorithm. DM Vs KDD. Temporal And Spatial Data Mining: Web content Mining. spatial classification and clustering algorithms. Background Knowledge. Data Integration and Transformation. Times series. Temporal Mining: Modeling Temporal Events. Efficient Processing of OLAP queries.” Data Mining Techniques”. Cluster Analysis: Partitioning Methods. Mining Multidimensional Association rules from RDBMS and DXV. Hierarchical Method. Improving the efficiency of Apriori. Schemas. UNIT II: Data Warehousing:Difference between Operational Database and Data warehouseMultidimensional Data Model: From tables to data Cubes.First Indian Reprint. Metadata repository. Web Structure Mining. importance-DM Functionalities.DM Metrics. Spatial Mining: Spatial DM primitives. Presentation and Visualization of Discovered Patterns.”Data Mining: Introductory and Advanced Topics”.Languages: Data cleaning. Web usage mining. Harcourt India Private Limited.

1-5.1-1. owner and mode –stat and fstat – pipes –dup – mounting and unmounting file systems – link and unlink.Bach. Multiprocessor systems: Problem of multiprocessor systems – Solution with master and slave processors – solution with semaphores. K. Prentice Hall of India Private Limited. Prentice Hall of India Private Limited. Andrew S. 1993.1. (Chapters:1.Tanaenbaum.5-1.2. root.2.2.10) (Chapters: 6.1) Reference Books: 1. For Units IV & V : Maurice J.1. (Chapters : 1. “Modern Operating Systems”. Internal Representation of files : Inodes – Structure of a regular file – Directories – Conversion of a path to an inode – Super block – Inode Assignment to a new file – Allocation of Disk blocks.5. UNIT – IV File System Structure: History – System structure – User Perspective.PAPER XXVI i) DISTRIBUTED OPERATING SYSTEM UNIT – I Distributed Computing Systems: Evolution – Models – Distributed Operating System – Issues in designing DOS – Distributed Computing Environment.5. Communication in distributed system: Protocols – Features of a Good Message Passing – Synchronization – Buffering – Process addressing – Failure handling – Group Communication.11). Prentice Hall of India Private Limited. 1998. For Units I. II & III : Pradeep.ELECTIVE PAPER 2: Optional . “The design of the UNIX Operating System”. Process Management: Process Migration – Threats. Prentice Hall of India Private Limited.Richard Stevens.12. UNIT – III Security : Potential Attacks to Computer Systems – Cryptography – Authentication – Access Control – Digital Signatures – Design Principles. 1995.1. UNIT – V Interprocess Communication: Process tracing – System – V IPC – sockets.8.7.3. Text Books: 1.11. 4. W. 31 . System Calls for the file system: Open – Read – Write – Close – File creation – Creation of special files – Change directory. 2. “UNIX Network Programming”.3.8-3.3. 1997. UNIT – II Synchronization : Clock Synchronization – Event Ordering – Mutual Exclusion – Deadlock – Selection Algorithms.2-3. “Distributed Operating Systems Concepts and Design”.4.3.6.Sinha. 5.1.

Jochen Schiller. Sandeep Singhal.ELECTIVE COURSE 2: ii) Mobile Computing Unit I Introduction: Mobile and Wireless Devices – Simplified Reference Model – Need for Mobile Computing – Wireless Transmission – Multiplexing – Spread Spectrum and cellular systems – Medium Access Control – Comparisons – Unit II Telecommunications System: Telecommunication System – GSM – Architecture – Sessions – Protocols – Hand over and Security – UMTS and IMT 2000 – Satellite System Unit III Wireless LAN : IEEE S02. Delhi. Unit IV Mobile IP: Goals – Packet Delivery – Strategies – Registration – Tunneling and Reverse Tunneling – Adhoc Networks – Routing Strategies Unit V WIRELESS APPLICATION PROTOCOL: Wireless Application Protocol (WAP) – Architecture – XML – WML Script – Applications Text Book: 1. “Mobile Communication”. 2000. et al 32 . Pearson Education. References: “The Wireless Application Protocol: Writing Applications for the Mobile Internet”.11 – Hiper LAN – Bluetooth – MAC Layer – Security and Link Management.

Processes of Users iii. Write a shell program which accepts the name of a file from the standard input and then perform the following tests on it: i. Write a menu driven shell program for the following: i. 2. Sort the names in existing file iii.File existence ii.NET: Server & Client side controls ASP. File readable iii.NET and ADO. 6. 4. else display “Error message”. 33 . 11. Also check if right number of arguments are entered. Quit to UNIX. 5.List of files ii.DISTRIBUTED PROGRAMMING LAB 1. i. 4. Quit. Write a shell program which accepts the name of a file from the standard input and then performs the following tests on it.PAPER XXVII . Write a shell program using 3 arguments to take the pattern as well as input and output file names. Today’s Date iv. Enter the 5 names in a file ii. 7. 3. File Writable iv. 3. 2. RMI Servlets (Returning Information) Servlets and JDBC JSP JSP and java class EJB: Session Bean EJB: Entity Bean ASP. 8. If the pattern is found display “Pattern found”. 10. 9. Users of system v. List unsorted and sorted file iv. Both readable and writable.OS LAB WITH UNIX /LINUX 1.NET DOM usage on the server side AJAX: Client request & Server response PAPER XXVIII .

7. Student Reg.50/unit Above 200 units . Write the shell script which gets executed the moment the user logs in. 15.Enter the sentences in file ii. Mark1. Write a shell program to convert all capital letters in a file to small case letters. 11. The minimum pass for each subject is 50. Mark3.No. How would you sort this file with country as the primary sort key and state as the secondary sort key. 6. Write a shell program to sum up the series. Prepare the bill for the following format: Customer No. sort them and display the sorted output on the screen page by page. Mark4 . Write a menu driven shell program to perform the following tasks i. Mark2. 12.75/ unit For next 100 units . Suppose a user has renamed some files in current directory using a command like my filename filename. Write a menu driven shell program to copy.5. 10. (ii).3.Rs. It should display the message “Good Morning” / “Good Afternoon” / “Good Evening” depending upon the time at which the user logs in. 34 . 13. For first 100 units . Write a shell program to prepare electric bill for domestic consumers. Write a shell script to search all such files and rename them such that they do not contain the shell PID..$$. Also store this list in a file profile. name of state and name of country.0.Reading ----------Cur. Quit. file3.Display the list of last 20 files present in the current directory.1. 1/11 1/21 1/31 ………… + 1/101 9. file2.Rs. This script should obtain information about this file as given by is – 1 and display it in proper format.Rs. Write a shell program for a file contains records with each record containing name of city. rename. 14. edit.00/unit.Reading ----------Units Consumed ----------Charge ----------Signature 8. Merge the contents or the files file1. ----------Customer Name ----------Pre. delete a file. (i). Write a shell program to display the result PASS or FAIL using the information given below: Student Name. Search a given whole word in an existing file iii. Write a shell script which will receive either the file or the filename with its full path during execution.

Gregory D. Unit V: User support: Introduction.Paradigms for interaction. Abowd and Russell Beale”.Summary.SEMESTER V PAPER XXIX .User interface management systems.Evaluation through expert analysis. Universal Design: Introduction.Elements of the WIMP interface –Interactivity – The context of the interactions Paradigms: Introduction . Reference Book: 1.Evaluation through user participation – Choosing an evaluation method.Requirements of user support – Approaches to.2004. Janet Finlay.The software lifecycle – Usability engineering – Interactive design and prototyping – Design rationale. Third Edition. Introduction – Requirements of user support. Pearson Education. user support – Adaptive help systems designing user support systems. “John C.HUMAN-COMPUTER INTERACTION Unit I : The Interaction: Introduction . Text Book: 1.Models of interaction – Frameworks and HCI Ergonomics – Interaction styles . Human-Computer Interaction. Unit II : Interaction. Pearson Education” 2002. Unit IV: Evaluation techniques: What is evaluation. Design basics: Introduction – What is design? – User focus – Scenarios – Navigation design.Screen design and layout – Interaction and prototyping HCI in the software process: Introduction. 35 .Carroll”. “Alan Dix. Unit III: Design rules: Introduction –Principles to support usability – Standards – Guidelines – Golden rules and heuristics – HCI patterns Implementation Support: Introduction – Elements of windowing systems – Programming the application Using toolkits. Human-Computer Interaction in the New Millennium.Universal design principles – Multi-modal interactionDesigning for diversity.Goals of evaluation.Approaches to user support Adaptive help systems – Designing user support systems.

quadruples and triples – translation of assignment statements.. Unit III: Intermediate code generation – translation – implementation of syntax – directed translators – intermediate code – postfix notation – parse trees and syntax trees – three-address codes. 3. 36 .1990.COMPILER DESIGN Unit I: Different phases of a compiler – finite state automation and lexical analysis – a simple approach to the design of lexical analyzer – regular expressions NFA-DFA-reduced DFA-implementation of lexical analyzer – a language for specifying lexical analyzers. Unit V: Code optimization and code generation: Elementary code optimization technique – loop optimization – DAG representation of basic blocks – value numbers and algebraic laws – object programs in code generation – A machine model – A simple code Generation. David A. New Delhi. 2002. 1985.Ullman. William A.Aho.Bates.“The Theory and Practice of Compiler Writing”. Pearson Education. McGraw Hill. Jean-Paul Trembley and Paul G. Unit II: Context free grammars – Parsers – derivation and parse trees – shift-reduce parsing – operatorprecedence parsing – top-down parsing – predictive parsers. Alferd V. “Principles of Compiler Design”. Jeffery D..PAPER XXX . Rodney M. Unit IV: Symbol tables – data structures for symbol tables – implementation of a simple stack allocation scheme – implementation of block structured languages – errors – lexical phase error.Barrett.Couch – “Compiler Construction Theory and Practice”. Galgotia Publication Co. Text Book 1.Gustafson and John D. Soreson. Reference Books 2.

“Introduction to cryptography”.PAPER XXXI . 2. “Cryptography and Network Security”. ”Cryptography and Network Security – Principles and Practices”.CYBER SECURITY UNIT I: Overview – Symmetric Ciphers : Classical Encryption Techniques UNIT II : Symmetric Ciphers : Block ciphers and the Data Encryption Standards Public-key Encryption and Hash Functions: Public-Key Cryptography and RSA UNIT III: Network Security Practices : Authentication applications – Electronic Mail Security UNIT IV: Network Security Practices : IP Security – Web Security UNIT V: System Security : Intruders – Malicious Software – Firewalls Text Book: 1. William Stallings. Prentice-Hall. Buchanan . Johannes A. 2003 References: 1. Third edition. Atul kahate . Springer-Verlag. TMH 37 .

Unit 3.Software Development Process and models . Safer. REFERENCES 1. INTRODUCTION Introduction to Competencies .Brainstorming .Product Development Techniques .Problems and Risks . 2002.Project Portfolio Management Financial Processes .Selecting a Project Team . Unit 5.Critical Chain Scheduling. Asia.Benefits . “Software Project Management in Practice”.Effort Measures .Cost Estimation . 1. 3/E”.Management Skills .ELECTIVE COURSE 3 – Optional .Project Selection Models .PAPER XXXII i) . Shafer.Quality Function Deployment . Futrell.Scheduling Fundamentals .Organizational Form and Structure . TEXT BOOK 1. DOMAIN PROCESSES Managing Domain Processes .COCOMO: A Regression Model .Requirements . Addison Wesley.Guidelines . 2004.Planning and Organizing .The SEI CMM . SOFTWARE DEVELOPMENT Tasks and Activities .Goal and Scope of the Software Project Project Planning .The SEI CMM International Organization for Standardization.Challenges .Work Packages .Organizational Planning .Approaches to Building a WBS Project Milestones .Creating the Work Breakdown Structure . Donald F.Software Development Dependencies . Unit 4. SOFTWARE PROJECT MANAGEMENT Unit 1. Hughes. QUALITY ASSURANCE Quality: Requirements – The SEI CMM . Tata McGraw-Hill. Robert T. Pearson Education. Linda I.COCOMO II SLIM: A Mathematical Model .Tools .Project Roles and Skills Needed.Building the Software Quality Assurance .Software Size and Reuse Estimating . 38 .Case Study.Product Development Life Cycle .PERT and CPM Leveling Resource Assignments . “Quality Software Project Management”.Legal Issues in Software .Plan . Unit 2. Pankaj Jalote.Software Configuration Management: Principles .Map the Schedule to a Real Calendar . 2002. SCHEDULING ACTIVITIES Project Management Resource Activities .Building a WBS for Software. “Software Project Management.

Gary s. 2. Execution and Reporting Unit V: Software Test Automation . Addison Wesley Publications.Test Metrics and Measurements Text Books: 1. SAMS Techmedia. TMG. Marliss.Roger S Pressman. III.ELECTIVE COURSE 3 ii) SOFTWARE TESTING Unit I: Software Quality Quality Concepts . Ron Patton. Gopalaswamy Ramesh Pearson Education 2006 Reference Books: 1. Software Testing.Quality Movement – Software Quality Assurance – Software Reviews – Formal Technical Reviews – Formal Approaches to SQA – Statistical Software Quality Assurance . Indian Edition 2001 3.Testing the Documentation – Test Planning. Software Quality – Producing Practical. 39 . Software Engineering Concepts and Practices .Software Reliability – The ISO 9000 Quality Standards – The SQA Plan Unit II: Testing Fundamentals Testing Fundamentals – Types of Testing – White box testing – Black box testing Integration testing – System and acceptance testing – Performance testing – Regression testing Unit III: Specialized Testing Testing of Object Oriented Systems – Usability and Accessibility testing – Testing Web applications Unit IV: Testing Web applications . Software Testing (Units II. V) – Srinivasan Desikan. Introducing Software Testing – Louis Tamres. IV. Consistent Software – Mordechai Ben – Menachem. Sixth Edition ( For Unit I and Testing Web Apps) 2. Thomson Learning. Management. 2003. First Edition.

XML schema best practices Unit III : SOAP Overview Of SOAP – HTTP – XML-RPC – SOAP: Protocol – Message Structure – Intermediaries – Actors – Design Patterns And Faults – SOAP With Attachments. Global and local type declarations.The UDDI Business registry. 2002. Attributes and namespaces -XML Schema XML schema and namespaces. Schemas and instance documents. 40 . Managing Schemas. Pearson Education. “Developing Enterprise Web Services”. Implementing XML schema types. Inheritance. Substitution groups. Unit IV: UDDI UDDI at a glance. The any Element. Reference Book: Rank. 2004. James Webber. Unit II: XML Fundamentals: The Lingua Franca of web services.ELECTIVE COURSE 4 – Optional – PAPER XXXIII i) Web Services Unit I: Introduction What are web services? SOAP WSDL UDDI-Why Web Services are important ? .UDDI under the covers – Accessing UDDIHow UDDI is playing out Unit V: Conversations: Overview – Web Services – Web services Conversation Language – WSCL Interface components – The Bar scenario conversations – Relationship between WSCL and WSDL Text Book: 1. Coyle. Inheriting namespaces. A first schema. XML. Pearson Education. And not inheriting namespaces. P.XML Documents-XML namespaces Explicit and Default namespaces. Sandeep Chatterjee. Web Services And The Data Revolution.The evolution of web applications Not just another distributed computing platform – Web services and enterprises.

The Grid Computing Road Map: Autonomic Computing – Business on Demand and Infrastructure Virtualization – Service-oriented Architecture and Grid – Semantic Grid. Data and Network Requirements. 2006. Unit V OGSA Basic Services: Common Management Model – Service Domains – Policy Architecture – Security Architecture – Metering and Accounting – Common Distributed Logging – Distributed Data Access and Replication. ICFAI University Press. Unit II The Grid Computing Anatomy: The Grid Problem – Concept of Virtual Organizations – Architecture.OGSA Platform Components – OGSI: Grid Services – Specification – Service Data Concepts – Naming and Change Management Recommendations. Related Technologies – XML Messages and Enveloping – Service Message Description Mechanisms – Relationship between Web Service and Grid Service – Open Grid Services Architecture (OGSA): Architecture. Pearson Education. Unit IV OGSA Use Cases: Commercial Data Center – National Fusion Collaboratory – Online Media and Entertainment . Unit III Merging Grid Services Architecture with the Web Services Architecture: ServiceOriented Architecture – Web Service Architecture – XML.ELECTIVE COURSE 4 ii) GRID COMPUTING Unit I Introduction: Early and Current Grid Activities – An Overview of Grid Business Areas – Applications – Infrastructure. Grid Computing Organization and their Roles: Standards and Guidelines – Tool Kids and Framework – Grid-Based Solution to Solve Computing. Joshy Joseph and Craig Fellenstein. Text Book: “ Grid Computing “ . 41 . Case Study: GLOBUS – The Grid Computing Toolkit. 2005 References: “ Grid Computing “ S. Jaya Krishna .

Write a PHP program interface to create a database and to insert a table into it. Write a shell program to find the details of an user session. 4. and to read contents from the directory. Write a PHP program to upload a file to the server.OPEN SOURCE LAB (LAMP) 1. 3. grade of a student in tabular format by accepting user inputs for name. 5. Insurance 3. add. Write a PHP program to create a directory. PAPER XXXV . PROJECT WORK 42 . 8. 6. Write a PHP program to access the data stored in a mysql table. Test and Deploy using CASE tools 1. Banking 5. 7. Tourism 9. number and marks from a HTML form. Create a mysql table and execute queries to read. Share/stock portfolio 10. E-commerce(e-bay) 8. Health care 2. on-line reservation 6. Write a shell program to change the extension of a given file. Shopping Cart 7. 10. Write a PHP program that adds products that are selected from a web page to a shopping cart. Design . Write a PHP program using classes to create a table. Write a server side PHP program that displays marks. 2. Logistics Management SEMESTER VI: 1.MINI PROJECT USING SOFTWARE ENGINEERING TOOLS Preferred Domains: Gather .PAPER XXXIV . 9. e-Governance 4. Develop. remove and modify a record from that table. total.