This action might not be possible to undo. Are you sure you want to continue?
MASTER OF COMPUTER APPLICATIONS (MCA) (Colleges) (For Regular ad Distance Education except University Department) (FOR THE CADIDATES ADMISTTED DURING THE ACADEMIC YEAR 2005-2006) Bharathiar University, which was established in the year 1982 by the Government of Tamil Nadu, is situated near the Marudhamalai hills. The campus is ten kilometers away from the city. The University offers various master’s degree Curses and offers facilities for fundamental and advance research. ELIGIBILITY FOR ADMISSION: Candidates for admission to the first year course leading to the Degree of Master of Computer Applications (M.C.A) will be required to posses: A pass in any degree with Mathematics at +2 level or any degree with at least one paper in Mathematics or Statistics at degree level. In case of SC/ST candidates, a mere pass in any of the above Bachelor's degree will be sufficient. DURATION OF THE COURSE The course shall be offered on a full-time basis. The course will consist of five semesters of course work and laboratory work and the sixth semester shall be Project work. REQUIREMENTS OF EXAMS AND ATTENDANCE A candidate will be permitted to appear for the University examinations if, he/she secures not less than 75% of attendance in the number of working days during the semester and that the candidate’s character has been satisfactory. If a candidate fails to secure 75% attendance and conduct has been satisfactory it shall be open to the syndicate or any authority delegated such powers to grant exemption to a candidate for valid reasons subject to usual conditions. EXAMINATIONS University examinations shall be conducted at the end of each Semester for the subjects of study undergone by the students in that Semester. The question paper pattern for theory examination is give below. Question Paper Pattern Section – A Section – B Section – C 10 Marks (10 Objective type Questions of 1 Mark each; No choice) 15 Marks (5 Question either or type of 3 Marks each) 50 Marks (5 Question either or type of 10 Marks each)
Practical examinations will be conducted with one internal examiner and one external examiner. The question paper for practical examination will jointly be set by both internal & external examiners. One external examiner for every 15 students will be appointed to conduct viva-voce examinations during sixth semester.
SESSIONAL MARKS Sessional marks will be awarded to the candidates in both theory and practical. The award shall be on the basis of assessment made by the faculty from the candidate's performance in tests and laboratory work.
PASSING REQUIREMENTS: 1. Double valuation (One Internal and one External) system will be followed to award marks. 2. A candidate shall be declared to have passed the examinations in a subject if he/she secures not less than 50% of the total prescribed marks for the subject in sessional and University examinations put together, subject to his/her getting a minimum of 50% of the marks in the University examination. 3. A candidate who successfully completes the course and passes the examinations prescribed in all the subjects of study and practical examinations shall be declared to have been qualified for the degree. 4. If a candidate does not complete the course successfully within a period of 6 years (12 semesters) from the date of his/her joining, he/she will be disqualified from the course. 5. Candidates who have passed 75% with and more aggregate and have cleared all the papers in the first attempt be classified as first class with distinction.
CLASSIFICAITON OF SUCCESSFULL CANDIDATES 1. All Candidates securing not less than 60% of the aggregate marks including sessional shall be declared to have passed the Degree in FIRST CLASS provided they have passed the examination in every subject including practical, project work and Viva-Voce within three years of joining the course. 2. Other successful candidates shall be declared to have passed the examinations in SECOND CLASS.
SCHEME OF EAMINATIONS. MASTER OF COMPUTER APPLICATIONS (MCA) SYLLABUS EFFECTIVE FROM THE ACADEMIC YEAR 2005-2006 SEM SUBJECT AND PAPER
INSTRUCTIONAL HRS PER WEEK
13A 13B 13C 13D 13E I3P 13Q
Introduction to information Technology Computer Organization & Architecture Problem Solving in C Numeric Algorithms & Statistics Accounting & Financial Management Information Technology Lab Problem solving using C Lab Data Structures & Algorithms Relational Database Management System System Software & Introduction to Operating System Computer Graphics Foundation of Computer Science Data Structures & Algorithms Lab RDBMS Lab Object Oriented Analysis and design & C++ Advanced Operating System Analysis & Design of information systems Computer Networks
4 4 4 4 4 5 5 4 4 4 4 4 5 5 4 4 4 4
UNIVERSITY EXAMINATION Duration Max. in Hrs. Mark 3 100 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100
23A 23B 23C 23D 23E 23P 23Q
33A 33B 33C 33D 33E 33P 33Q
4 Operation Research 5 OOPs & C++ Lab 5 Network & OS Lab
SUBJECT AND PAPER
INSTRUCTIONAL HRS PER WEEK
UNIVERSITY EXAMINATION Duration in Hrs. Max. Mark 100 100 100 100 100 100 100 100 100 100 100 100 100 100 200
43A 43B 43C 4EE 4EF 43P 43Q
Visual Programming Java Programming Management Concepts & Communication Elective - I Elective - II Visual Programming Lab Java Programming Lab Software Engineering Internet & Web programming Data Mining & Warehousing Elective - III Elective – IV Mini Project Internet & Web Lab PROJECT WORK Project and Viva-Voce (150+50)
4 4 4 4 4 5 5 4 4 4 4 4 5 5
3 3 3 3 3 3 3 3 3 3 3 3 3 3
53A 53B 53C 5EE 5EF 53P 53Q
* Includes 25% continuous internal assessment marks.
1. Neural Networks ELEVTIVE – II E.3 AI & Expert Systems .2.4.2 Distributed Computing E.2.1.2 Embedded Systems E.220.127.116.11 Digital Image Processing E.2.1 Multimedia and its applications E.3 Simulation and Model ELECTIVE FOR FIFTH SEMESTER ELECTIVE – III E.4.1 Software Project Management E.3.1 Analysis & Design of algorithms E.4.ELECTIVES FOR FORTH SEMESTER ELECTIVE – I E.3 Bio Informatics ELEVTIVE – IV E.1 WAP & XML E.3.2 E-Commerce E.
“Element of Computer Science”. 2004.V Some Internet applications – Email – WWW – Information Browsing Service – Information retrieved from World Wide Web – Audio on internet – Business information system : Introduction – Types of information needed by organization – Why should we use computer in business – Design of operational information system – System life cycle – Computer systems for transaction processing. Prentice Hall of India. Archival Memory – Central Processing Unit – Output Devices. TEXT BOOK 1. S. S. Gupta.I Data and Information : Types of data simple model of a computer – Desktop Computer. Macmillan India Ltd. Research and Development Wing ITL Education. UNIT . . “IT Tools and Applications”. UNIT .Ajoy Kumar Ray & Tinku Acharya. V. 3. representation of characters in computers – error detecting codes. Acquisition of numbers and textual data : Introduction – Input units – internal representation of numeric data. “ Introduction to Information Technology”.III Data Storage : Introduction – Memory cell – RAM. Chand & Co. ROM. 2004. 2002. UNIT .IV Computer software – Computer networks – Data organization.K. UNIT .K. Acquiring audio data – Acquisition of video – Processing multimedia data – processing and displaying textual data. "Information Technology – Principles and Application”... REFERENCE BOOK 1. Sarkar & A. CD ROM. Floppy Disk Drive.II Acquiring graphical data : introduction – Acquisition of textual data. pictures – Storage format for pictures – Image compression Fundamentals – Image acquisition with digital camera. Prentice Hall of India. 2003.SEMESTER I PAPER I INTRODUCTION TO INFORMATION TECHNOLOGY UNIT . 2. Rajaraman.
Conversion from one to another – Complements – Binary codes.I Number systems: Binary. UNIT . UNIT .Albert Paul Malvino. TEXT BOOK 2. Hexadecimal . "Digital Principles and applications”. Pearson education. Donald P. REFERENCE BOOK 1. “ Computer system architecture”.IV Input – Output organization : Peripheral Devices – Input – Output interface – Asynchronous Data Transfer (Strobe & Handshaking Method) – Modes of Transfer – Priority interrupt – DMA – IOP. Morris Mano. “Computer Organization & Architecture – Designing for performance”.. JK Flip-flops – Registers – Shift Registers – Ripple Counters – Synchronous counters. UNIT .V Memory organization : Memory Hierarchy – Main memory – Auxiliary memory – Associative memory – Cache Memory – Virtual Memory. UNIT . “ Digital Logic and Computer Design”. Leach. William Stallings. Octal.J. Manipulation and program control instructions. D. Flip-flops : RS. Tata Mc Graw Hill Pub.II Combinational Logic Circuits Design : Multiplexers – Demultiplexers – Decoders – Encoders – Hall Adder – Full Adder – Subtractor – Parallel Adders. Third Edition. Sixth edition. Morris Mano. PHI. Decimal. Hayes “Computer Architecture and organization” Tata Mc Graw Hill Pub. .PAPER II COMPUTER ORGANIZATION AND ARCHITECTURE UNIT . NOR implementation – Sum of products. 3. 2. Basic Logic Gates – Basic Theorems and Properties of Boolean algebra NAND.III Register Transfer and Micro Operations : Arithmetic circuits – Logic Circuit – Shift Circuits – Arithmetic logic shift unit – Stack organization – Instruction formats – Addressing modes – Data transfer. Pearson Education. 3.Product of Sums – Karnaugh map – Tabulation Method – Don’t Care conditions.P. Company Ltd. Company Ltd.
I PROBLEM SOLVING IN C Planning the Computer Program – Flow chart – Types of logic used in flowchart – Computer Language – Hierarchy of programming languages .P. PHI. Langsam and Augenstein.PAPER III UNIT . .IV Pointers – Introduction – Pointer and Arrays – Pointers and Strings – Pointer and Structures – Pointers and Data structures.Tata McGraw Hill. ‘ TEXT BOOKS: 1.Kamthane. Balagurusamy.Classification of programming language – Popular programming language – Program development process – Characteristics of a Good program – Program development process – error in programming.III Function . “Programming with ANSI and Trubo C”. “Let us C” 2. Deitel & Deitel. UNIT .Operators Expressions . UNIT . Yeswanth Kanetkar.Function Arguments . 3 4. “Data Structures Using C”.Recursion . 2.Program control structures .constants .declarations .Arrays .Loop control structures – C formatted Input/Output . Yeswanth Kanetkar. Pearson Education Asia. UNIT -V File processing – C Preprocessors – Command Line Arguments – Low Level Programming in C – Calling BIOS and DOS interrupts – Port I/O functions to access CMOS – Keyboard and Speaker – Writing into Video Buffer.Function prototype .Structure – Unions – Bit Manipulations and Enumerations – Self-Referential Structures – Dynamic Memory Allocation.Storage classes . “C How to program”. Third Edition.data types and sizes . “TSR through C” 4. E. Pearson Education Asia.II An overview of C . 'Programming in ANSI C'.Strings. ISBN:81-203-0696-1.Nagpal “Computer Fundamentals – Concepts system & Applications” REFERENCE BOOKS 1.variables . UNIT . D. Yeswanth Kanetkar. Ashok N. Tenenbaum. 2003. “Pointers in C” 3.
Methods of solving regression equations. "Numerical Methods in Science and Engineering”. P. Numerical differentiation – Numerical integration – Trapezoidal and Simpson’s 1/3rd rule and 3/8th rule. Gupta and V. (No derivations – simple problems only) TEXT BOOKS: 1. . S. M. UNIT III Solution of numerical algebraic & transcendental equations – Bisection methods – Methods of false position – Newton – Raphson method – iterative method. "Fundamentals of Mathematical Statistics". Exponential and normal distribution. S. Gunavathi. Numeric methods : Curve fitting by methods of least squares – Fitting of a straight line – Parabola and exponential curve. 2nd Edition. New Delhi. 1. UNIT II Numerical methods : Finite difference operators – Difference table – Numerical interpolation – Finding missing values – Langrange’s interpolation.PAPER IV NUMERICAL ALGORITHMS & STATISTICS UNIT I Matrix – Rank of a matrix – Consistency and inconsistency of systems of linear algebraic equations. Kandaswamy K. UNIT V Probability : Introduction to probability – Addition and multiplication theorems conditional probability – Baye’s theorem – Probability distribution – Binomial poisson.Kapoor. “Numerical Methods”. National Publishing company. Methods of solving simultaneous linear algebraic equations – Gauss elimination method – Gauss Seidal iterative methods. Chand & Company Limited. 2.K.C. Venkatraman. UNIT IV Univariate distribution – Frequency distribution – Grouped and Ungrouped distributions – Measures of central tendency – Measures of dispersion – Coefficient of variation. Bivariate distribution : Correlation – Types of correlation – Karl Pearson’s coefficient of correlation – Rank correlation – Regression – Regression equations . Uniform.K. Thilakavathy and K. Sultan Chand and Sons REFERENCE BOOKS.
PAPER V UNIT -I ACCOUNTING AND FINANCIAL MANAGEMENT Accounting : Definition. .II Radio Analysis : Meaning – Advantages – Limitations – Classification of Ration : Profitability.S. S. Advantages – cost – Volume profit analysis – Break Even analysis – Uses and assumptions – Applications of Marginal Costing. REFERENCE 1. New Delhi. Introduction to Accountancy”. Maheswari . Ramachandran and Srinivasan. Methods of Accounting – Single Entry and Double Entry System. Objectives of Budgetary control. Final Accounts : Trading and Profit and Loss Account and Balance sheet of Sole Proprietary Concern. Mani Nagarajan. Text Books : 1. UNIT -V Costing : Definition. Turnover and Solvency Ratios. Nature and importance Advantages and limitations of Cost accounting – Classifications of Cost – Preparation of Cost sheet. T. Sharma and Sasi K. UNIT -IV Budget and Budgetary Control : Meaning and definition. Vinayakam. UNIT . 2. Eurasia Publishing House. 2. “Principles of Accuntancy”. Sultan and Chand Co. UNIT -III Fund flow Statement : Concept of Funds – Funds flow statement – Uses and limitations – Preparation of fund flow statement – Cash flow statement. “Management Accounting”. Grewal.Gupta. Advantages and Limitations preparation of different types of budgets. Sultan Chand & Co. Accounting. “ Management Accuonting” Kalyani Publishers. Accounting Conventions. Advantages. TRichy. Sri Ram Publications. Objectives. Marginal Costing : Meaning."Principles of Management Accounting".N. Accounting Concepts. Basic Books of accounts – Journal and Ledger – Preparation of Trial Balance. 3.
Programs based on numerical Algorithms and Statistics. 4. Program Using Functions with Pointers. Programs using file. Problems using an accounting package. Programs using Arrays. 5. 3. PRACTICAL II PROBLEM SOLVING USING “C” LAB 1.PRACTICAL I INFORMATION TECHNOLOGY LAB 1. 7. Program to access the array elements using pointers. Problems using simple multimedia packages. Power Point) 2. Programs using control structures. Excel. 3. 6. Program using Structure. 2. Problems using PC packages. (Word. .
Gregory L. UNIT .II Linked List : Singly Linked List – Linked Stacks and Queues – Polynomial Addition – More on Linked List – Sparse Matrices . Muthali Pub. Queries and Sequential organization – Index Techniques – File Organizations. “Data Structure and Algorithm Analysis in C”. Analyzing Algorithms. C. TEXT BOOKS 1. Murugan.SEMESTER . Ellis Horowitz.Jondo. Company Ltd. “Data Structure Algorithms and Object Oriented Programming” Tata McGraw Hill Publication Company Ltd. Arrays : Spare Matrices – Representation of arrays. . Dr. Sanguthevar Rajasekaran. REFERENCE BOOKS 1.IV Symbol Tables : Static Tree Tables – Dynamic Tree Tables – Hash Tables : Hashing Function – Overflow Handling.I Introduction : Introduction of algorithms. UNIT . Tata McGraw Hill Pub. Heileman. Galgotia Publication. "Data and File Structures". “An introductions to Data Structures with Applications”. Stacks and Queues. Fundamentals – Evaluation of expression Infix to Postfix Conversion – Multiple Stacks and Queues – Perform Analyze the algorithms. Robert Kruse.II PAPER VI DATA STRUCTURES AND ALGORITHMS UNIT . “Data Structure and Program Design in C”. 1. Graphs : Terminology and Representation – Traversals. “Graph Theory and Algorithms”.III Internal Sorting : Insertion Sort – Quick Sort – 2 Way Merge Sort – Heap Sort – Shell Sort – Sorting on Several Keys. House. Tremblay Sorenson. External Sorting : Storage Devices – Sorting with Disks : K-Way Merging – Sorting with Tapes – Perform Analyse the Algorithms.. Mark Allen Weiss. Pearson Education Asia. 3. “ Computer Algorithms”. UNIT V Case Study : Recursion – Towers of Hanoi – Simulation of an Airport – Pattern Matching in strings – Game Trees. M. Bruce Leung. 2003. Second Edition. Galgotia Publication. 4. Pearson Education Asia. 5. Ellis Horowitz & Sartaj Shani.Doubly Linked List and Dynamic – Storage Management – Garbage Collection and Compaction.. 2nd edition. Second Edition. Files : Files. UNIT . Trees : Basic Terminology – Binary Trees – Binary Tree Representations – Binary Trees – Traversal – More on Binary trees – Threaded Binary Trees – Binary Tree Representation of Trees – Council Binary Trees.. Sartaj Shani. 2.L. Chennai. Connected Components and Spanning Trees – Shortest Paths and Transitive Closure = Perform Analyze the Algorithms.
UNIT IV Schema Refinement and normal forms: Introduction to schema refinement – Functional dependencies – Reasoning about functional dependencies – Normal forms – Properties of Decompositions – Normalization – Schema refinement in data base design – Other kinds of dependencies. Sundarshan. ER to relational introduction to views – Destroying / Altering Tables & Views. OIDS and reference Types – Database design for and ORDBMS – OODBMS – comparing RDBMS OODBMS and ORDBMS. Object Database Systems: Motivation Example – Structured data types – Operation on structured data types – Encapsulation & ADTS – Inheritance – Objects.Concurrency control without locking. Database design & ER diagrams – Entities attributes and entity sets – Relationships and Relationship sets – Additional features of the ER model – conceptual database design with the ER model. McGraw-Hill Higher Education. Pearson . UNIT V Parallel & Distributed databases: Introduction – Architecture for parallel databases – Parallel Query evaluation – Parallel zing individual operations – Parallel query optimization – Introduction to distributed databases – Distributed DBMS architecture sorting data in a distributed DBMS. serializability and Recoverability – Introduction to lock Management – Lock conversions – Specialized Locking techniques. “Database System Concepts”. Silberschatry. Concurrency control: 2PL. Third edition.PAPER VII RELATIONAL DATABASE MANAGEMENT SYSTEM UNIT I Overview of database systems: Managing data – A historical perspective file systems versus a DBMS – Advantages of a DBMS – Describing and storing data in a DBMS – Queries in a DBMS – Transaction management – Structure of a DBMS. Johannes Gehrke – “Database Management Systems”. Fourth Edition. Raghu Ramakrishnan. Elmasti Navathe. McGraw-Hill Higher Education. TEXT BOOKS 1. REFERENCE BOOK 1. Security: Introduction to database security – Access control – Discretionary access control – Mandatory access control – Additional issues to security. Third Edition. UNIT II Relational Model: Integrity constrains over relations – Enforcing integrity constraints – Querying relational data – Logical database design.’ UNIT III SQL: Queries. Programming Triggers: The form of a basic SQL Query – UNION. INTERSECT and EXCEPT – Nested Queries – Aggregate operators – Null values – Complex integrity constraints in SQL – Triggers & Active data bases. 2. Transaction Management Overview: The ACID properties – Transactions & Schedules – Concurrent execution of transactions – Lock-based concurrency control – performance of locking – Transaction support in SQL. Relational algebra and calculus: Relational Algebra – Relational Calculus. Korth. “Fundamentals of Database Systems”.
Unit IV Principles of Deadlock – Prevention – Detection – Avoidance – Memory management – Fixed partition – Dynamic partition – Simple paging – Simple segmentation – virtual memory – Locality – Paging – Page size – Segmentation. PAPER VIII SYSTEM SOFTWARE AND INTRODUCTION TO OPERATING SYSTEM Unit I System Software : Definition – Components of system software – Evaluation of System software.Linkage editing. (UNITS I & II) 2. “Operating Systems”. Unit II Compilers : Overview of the compilation process – Scanning – Parsing – Storage allocation – Compilation of control structures – Code optimization. William Stallings. Software processes : Introduction . Prentice Hall of India.M.Education Asia. TEXTBOOKS 1. “Systems Programming and Operating Systems”. Second Edition. REFERENCE BOOKS 1. Dhamdhere. Loaders and linkage editors : Loading. PHI. IV &V). 2003. Unit III Operating system – Overview – Objectives and functions – Evaluation of operating systems – Process states – Principles of concurrency – Mutual exclusion – Semaphores. Tata McGraw-Hill Publishing Company Ltd. Bhatt.Translators – Loaders – Interpreters – Assemblers : Overview – Design of a two – Pass Assembler – Macros and Macro processors. 2001 (UNIT III. linking and relocation – Relocatability . Pramod Chandra P. D. New Delhi. “An Introduction to Operating Systems”.. . Unit V Uniprocessor scheduling – Types of scheduling – Scheduling algorithms – File management – File organization and access – Directories – File sharing – Secondary storage management.
UNIT . 2nd Edition TMCH. Donald Hearn. . scan line method. a-buffer method.III Three Dimensional Concepts – Three Dimensional Object Representations: Polygon surface – Curved lines and surface – Quadric surface – Super Quadrics Blobby objects – Spline Representations – Cubic spline interpolation. Pixel Addressing. back face detection. Second Edition.2. Roy Phastock.II Two Dimensional Geometric Transformations: Basic Transformations. Zhigangxiang. Tanenbum. Prentice Hall of India. UNIT . Pearson Education. UNIT . PAPER IX COMPUTER GRAPHICS UNIT .I A Survey of Computer Graphics – Overview of Graphics systems – output primitives: Points and Lines. viewing pipeline. Composite Transformations – Line Clipping – Two dimensional viewing – Graphical user interfaces and interactive import methods. UNIT V Visible – surface detection methods: Classification of visible – surface detection algorithms. BSP-Tree method. Bresenham’s Algorithms. viewing co-ordinates. Andrew S. “Computer Graphics C Version” Second Edition. projections clipping. Matrix representations. depth –buffer method. M. Illumination methods and surface – Rendering methods: Basic Illumination models – polygon rendering methods – Color models and color applications – Computer animation. “Modern Operating System”.Pauline Baker. properties of Circles & Ellipse.IV Three-dimensional geometric and modeling transformations – Three dimensional viewing. TEXT BOOKS 1. “Computer Graphics”. DDA. Reference Book 1.
Vol II. TMH. Unit II Set Theory : Basic set operations – Relations – Types of Relations – Representation of relations in matrix form – Composition of relations – Functions – Types of functions – Principles of mathematical induction. Tremblay & Manohar. Ltd. 2nd Edition . Sharma. “Engineering Mathematics”. Publishing 2.Principal conjunctive normal form – Equivalance formulae – Indirect method of Proof. Unit III Mathematical Logic : Introduction – Connectives. 2003. Boolean Algebra : Definition – Sub Boolean algebra – Boolean functions and Boolean Expressions. Unit IV Graph theory : Graphs. . J. “Discrete Mathematical structures with applications to computer science”. free and bound variables. Predicate calculus. Unit V Grammars and Language : PSG – Types of Grammars – Productions – Regular grammar and languages – Finite State Automata (FSA) – Deterministic and Non deterministic FSA – Conventions of NDFSA to DFSA. Natinal Co. NAND & NOR connectives – Tautology and Contradiction – Truth tables – Logical Networks – Normal forms – Principal disjunctive normal form . REFERENCE BOOKS 1. Diagraph – Types of graph – Simple theorems – Definitions of paths. Hopcraft & Ullman. “Introduction to Automata Theory. Languages & Computation”. reachability – Matrix representation – Shortest path problem – Binary tees – Traversal of binary trees – Expression trees – Infix. inference theory for predicate calculus.K. M.PAPER X FOUNDATIONS OF COMPUTER SCIENCE Unit I Matrices : Definition – Types of Matrices – Basic Operations in Matrix – Determinants – Properties of Determinants – Inverse of a Matrix – Finding Eigen values and vectors – Cayley – Hamilton theorem. Macmillan India. postfix. prefix expressions.K. “Discrete Mathematics. Venkatraman. Pearson Education.. 3. TEXTBOOKS 1.
Use of forms and report writer packages. Vijayaraghavan. Some sample applications. Heap. Sorting – Radix. Stack and Queue Operations. Infix to Postfix Conversion. Arrays Creation and Operations 2. Student mark processing system (Internal & External marks) Hotel Management Stock Maintenance. 4. creation of a database. Tree Traversals. 6. are given below. 3. Personal information. PRACTICAL IV RDBMS LAB Study features of commercial RDBMS packages such as Oracle and Developer 2000. Quick. 2001. Searching – Linear. 5. 8. binary. PRACTICAL III DATA STRUCTURES & ALGORITHMS LAB 1. Laboratory exercises should include defining scheme of applications. writing SQL queries to retrieve information from database. P. 7. T. • • • • • . Recursion. • Banking system various schemes. Kalaikathir Publications. which may be programmed. Graph – Shortest Path. Doubly Linked List Operations. .2. 2003. Santha. shell. M. Fibonacci 9. “Foundations of Mathematics”. Radha. 3. Use of host language interface with embedded SQL. Scitech. Merge. “Discrete Mathematics for Computer Science & Applications”. Online reservation system. Polynomial Addition using Singly Linked List.
(both. UG & PG) .• College admission system.
“Object Oriented Analysis and Design with applications”. UNIT IV Classes and Objects – Constructors and Destructors – operators overloading – Type conversion – Inheritance – Pointers and arrays. REFERENCE BOOK 1. Second Edition. Balagurusamy “ Object Oriented Programming with C++”. Pearson education.Input and output statement in C++ . TEXT BOOK: 2. Class and Objects: The nature of an object – relationship among objects. . Ashok N.SEMERTER III PAPER XI . . PHI.Grady Booch. “Object Oriented Programming with ANSI & Turbo C++”. 3. First Indian print-2003.Declarations – Control structures – functions in C++. UNIT III Introduction to C++ . UNIT II Classes and Object: Nature of class – Relationship among classes – The interplay of classes and objects. Samanta “Object Oriented Programming with C++ and Java” . UNIT V Memory Management Operators – Polymorphism – Virtual functions – Files – Exception handling – string handling – Templates. Classification: The importance of proper classification .identifying classes and objects – key abstractions and mechanism. Pearson Education. TMCH. 2.OBJECT ORIENTED ANALYSIS DESIGN & C++ UNIT I The object Model: The evolution of the object model – Elements of the object model – applying the object model. Second edition.Kamthane.
1998. Mutiprogrammed Batch.PAPER XII UNIT I: ADVANCED OPERATING SYSTEMS Introduction.Prentice Hall of India.exit. . Example C programs by using fork. Prentice -Hall of India.2000 2. V-Specified Algorithm Only] REFERENCE BOOKS. 1. Andrew S. Unit V: Unix: Process Control in Unit-Algorithm for Fork system call-Algorithm for ExitAlgorithm for Wait-Algorithm for Exec –Uses of Exec –Algorithm for Booting the Unix system-Algorithm for Init process-Process scheduling algorithm –Example of process scheduling in Unix . Network and Real time operating systems-Computer Hardware review-Interrupts-Operating System Concepts –Concepts -Process-ModelCreation-Termination-Process Hierarchy-Process state-Implementation of process – Threads-Thread usage Implementation of Threads in User Space and Kernel space-Multi Threading. UNIT II.wait.”Modern Operating Systems “. TEXT BOOKS 1 .2004 Pearson Education.The RPC Model –Transparency of RPC –Implementing RPC mechanism – Stub Generation –RPC Message –Server Management –Parameter Passing Semantics – Call Semantics – Communication Protocol for RPCs . 3. UNIT III Distributed Operating System Concepts & Design-Fundamentals -Remote Procedure Calls. “Operating systems”. Classical IPC problems: The Dining Philosophers Problem – The Readers and Writers problem-The Sleeping Barber problem – Producer Consumer problem. ”The Design of the Unix operating system”. Second Edition . UNIT IV: UNIX: Architecture of Unix Operating System –Introduction to system concepts – Internal representation of Files-Algorithm for allocation of Incore Inode-Algorithm for Releasing a inode-Structure of a Regular file-Directors-Super block – Algorithm for assigning new Inode and freeing Inode-Allocation of Disk blocks-Process states and transition-Layout of system memory-The context of a process.Race condition –Critical Region –Mutual Exclusion –Sleep and wakeup –Semaphores –Mutexes. Prentice -Hall of India .Second Edition.William stalling.system calls.2001[Unit I. Simple Batch. Pradeep K. ”Distriputed operating system concepts and design” . Distributed File System: Introduction –Desirable Features-File models –File-Accessing Models –File Sharing Semantics –File Caching Schemes-file Replication.Evolution of Operating systems-Serial.Message passing. 2. Bach . PHI/pearson Education Asia.” Unix System programming “.Sinha.Kay A Robbins & Steven Robbins.exec.2002[Unit III]. Distributed. Maurice J. Inter Process Communication.[Units IV. Timesharing.II].Tanenbaum .
PAPER XIII ANALYSIS & DESIGN OF INFORMATION SYSTEMS UNIT I Information and management: Type of information – why do we need a computer based information system – management structure – management and information requirements – qualities of information – example of information systems. TEXT BOOK 1.Control Audit . Rajaraman . UNIT III System requirements specification : Data dictionary – steps in systems analysis – modularizing requirements specification – feasibility analysis : deciding on project goals – examining alternative solutions – evaluating proposed system – cost-benefit analysis – payback period – feasibility report-system proposal – data flow diagram : symbol used in DFDs – describing a system with a DFD – good conventions in developing DFDs – logical and physical DFDs. V.”Analysis and Design of information system”-2nd Edition-prentice-hall of India 2004. James A Senn . UNIT II Information systems analysis overview: overview of design of an information system – the role and task of a system analyst – attributes of a systems analyst – tools used by systems analyst – information gathering : Strategy to gather information – information sources – methods of searching for information – interviewing techniques – questionnaires – other methods of information search – Case study. REFERENCE BOOKS – Establishing the logical correctness of decision table-use of Karnaugh maps to detect logical 1. “Analysis and Design of information system”-2nd Edition MCH international Edition.Testing and Security of information system – System Design Example. UNIT V Data input methods: Data input – Coding Techniques. . UNIT IV Process specification: Process specification methods-structured English-Decision tables: Decision tables terminology and Development-Extended Entry Decision table errors in Decision tables-Eliminating redundant Specifications.Detection of error in codes – Validating input data-Interactive data input-Designing outputs: output Device-Objectives of output design-Design of output Report-Design of screens-Use of business Graphics.
TMH. “Projects in Networking”. UNIT III Data Link Layer: Data link layer design issues – Error detection and correction – elementary data link protocols – Sliding windows protocols – Protocol verification – Example data link protocols. IV Edition.Network layer in the Internet. SCITECH Publications. cryptography – application layer: Design issues. New York / Princeton. Harry Katzan – An Introduction to “Distributed Data Processing”. UNIT II The Physical Layer: The Theoretical basic for data communication Guided transmission media – Wireless transmission – Communication satellites – the Public switched Telephone network – Cable Television – Mobile telephone system. Pllenum Press. Pearson Education. 6. 4. P. 2005. 5. Tittel – Theory and problem of Computer Networking.PAPER XIV UNIT I COMPUTER NETWORKS Introduction: Use of computer networks – Network Hardware – Network software Reference Models – Example of Networks. control algorithms – Quality of service . Schaum’s outline series. Hari & Barani. Transport Layer: The transport service – Elements of Transport protocol – A simple transport protocol – The Internet transport Protocols : UDP – The internet Transport Protocols : TCP-Performance issues UNIT V Session layer : Design issues. Godbole – Data Communication & Networking. TEXT BOOKS Andrew S. 2.Routing algorithms . TMH. UNIT IV Network layer: Network layer design issues . E-mail. Tanenbaum “Computer Networks”. 3. . REFERENCE BOOKS 1. 1982. Green – Computer Network Architectures and protocols. Lean Garcia – Communication Networks : Fundamental Concepts & Key Architecture. TMH. A Petrocelli Book.Congestion.Internetworking . file transfer. synchronization – presentation layer : design issues.
Problem in Operations Research – P. REFERENCE BOOK 1. P. UNIT IV Replacement model: Introduction – Replacement of items that deteriorates gradually: value of money does not change with time – value of money changes with time – Replacement of items that fails suddenly: Individual replacement – Group replacement.K.Graphical solutions to LPP . UNIT III Inventory control: Introduction – Costs involved in inventory. 2. Seventh Edition.K. Seventh edition. D. Gerald J.K. Second Edition. The assignment problem: Introduction – Mathematical formulation – Hungarian assignment method – Maximization in assignment problem – Unbalanced assignment problem – Impossible assignment. 3.Kanti Swarup. Gupta. “Operations Research Theory & Applications”. S. UNIT V Queuing Theory: Introduction – Characteristics of queuing system – Problems of single server with finite / infinite population model – Problems of multi server with finite / infinite population model. Sultan Chand & Sons. . Macmillan India Ltd. Chand & Company Ltd. Pearson Education. Tata McGraw Hill Pub Company Ltd.Operation Research – An Introduction. 1..Frederick S.Deterministic models: EOQ models without and with shortage – Buffer stock and reorder level – Price break models – ABC analysis. Man Mohan. Lieberman.Hamdy A... (No derivation) TEXT BOOK Operation Research. “Introduction to Operations Research”. Sharma.J. PERT/CPM: Introduction – Construction of network – CPM calculations – PERT calculations.Simplex Method – Big M method – Two – Phase simplex methods – Duality in Linear Programming: Primal & Dual problems – Dual simplex method.PAPER XV OPERATIONS RESEARCH UNIT I Linear Programming: Formulation of Linear Programming Problem . Taha. Hillier. UNIT II The Transportation problem: Introduction – Mathematical formulation – Finding initial basic feasible solutions – moving towards optimality – Unbalanced transportation problems – Degeneracy. Gupta.S Hira. 2.
C++ Program using Polymorphism. C++ Program using files.PRACTICAL V . Program using the concept of OS. C++ Program using friend functions. C++ Program using templates. 8. C++ Program using pointers. 3. 7. C++ Program using operator overloading functions. Program using UNIX.OOPS & C++ LAB 1. study of RPC under Client –server environment. 5. study of different routing protocol 4. study performance stop & wait & sliding & windows protocol. . 2. 7. 5. C++ Program using inheritance. PARCTICAL VI NETWORK & OS LAB 1. 8. study of different application standard in the area of • • • File transfer access & management. 9. 3.Study of network configurations & system details. Remote logging & Virtual terminals E-mail systems 6. study of Asynchronous & synchronous communication. C++ Program using Type conversion. C++ Program using String manipulation functions. 6. 4. 2.
ClistResources:MenusAccelerators. UNIT IV Visual C++: Programming: MFC & windows –MFC Fundamentals-MFS class Hierarchy-MFC Member &Global Functions-Various Object propertiesCObject.Net. TMCH 6.Bitmaps. Second edition Techmedia.Cexcept. Herbert Schildt.Object. Pearson edition.CwinApp.Cedit.MSDN Visual studio Library.PHI 3. REFERENCE BOOK 1.2004 2.Net.Net A beginners guide. UNIT V VC++ (contd): connecting to data sourcr-DAO-ODBC-Thread-Based Multitasking Visual C++ APPWIZARD & class winard.File processing.Net variables-data type constant –Building project –Displaying output –operators –conditional statement –if-then. For next . . TMCH 4. Viktor Toth.SEMESTER IV PAPER XVI VISUAL PROGRAMMING UNIT I Introduction to VB. UNIT II VB.Icon.Cdialog.Shirish Chavan.CGD. TEXT BOOK 1.Net”. UNIT III Array-Menus & dialog boxes. select-case. “MFC Programming from the Ground up” 2ND edition. Files classification –Handling files using function & classes.CWnd.Cfile.Dialog.versions-Message Maps-Document/View Architecture.Visual Basic.looping Do.Selecting & resizing controlRelocating control properties windows & setting properties of form & control (using properties window & using event procedure).Carchive. ”Visual Basic.Tata McGraw Hill. 5th Edition . structures programming –Object oriented programming.Schneider.Net-opening & closing windows toolbars –Existing project-Auto Hide.Welcome to VB. Mveller.Customizing windows placing control on a form.Kant.Directory class-File class.”An introduction to programming using Visual Basic .Cstring. “Visual C++6 Unleased”. 2.Nested loops Import statement –msg bog –Function-input Box()-Function-user defined &built functionscontrols. “Visual C++ form the Ground up”.
Xavier. Horstmann. Third Edition Pearson Education Asia. JcheckBox. JpasswordField. Gary Cornell.(India) Pvt. rectangles. break and continue – operator: assignment.. ares. for. writing and reading a random access file – Class file – reading. Jslider – Mouse event handling. 2001. Cays S. .Pearson Edi..PAPER XVII JAVA PROGRAMMING Unit – 1 Introduction History of JAVA. inserting and updating a database (Use JDBC to a MS Access) Unit – V Overview of Servelet technology – Handling HTTP GET and POST request – session tracking – RMI: defining implementing the RMI – define the client – Compile execute the server and the client – Networking : reading a file on a web server – Establishment a simple server and a simple server and a simple client (using stream sockets) – Random and BitSet class – Class arrays – interface collection and class collections – sets – maps – JAVABEANS : Preparing a class to be a JavaBean – Creating a javaBean – Adding Beans and properties a class to be a JavaBean – Connecting Beans with Events in the BeanBox – the Beaninfo class. charAt. Applet adding integers (Example) – Control structures if. do/while. reading and updating a sequential access file – Creating. Unit – III String constructors – String methods: length. 2. Cays S. REFERENCE BOOKS 1. “Core Java2 Volume I–Fundamentals”. Adapter classes – Layout managers – panels – Using menus with frames – Boxlayout manager. Company Ltd. JAVA class libraries – Basics of a typical JAVA environment – Arithmetic Equality and relational operators – Thinking about objects. “Programming with Java2”. TEXT BOOKS 1. 3.. Keyur shab. hashCode. Scitech Pub. Jbutton. Gary Cornell. C. getChars. if/else. polygons and polylines – The JAVA2D API – swing overview – Jlabel – event handling model – JtexField. Horstmann. JradioButton. increment and decrement and logical – primitive data types. “Java 2 Programming”. switch. Unit – IV The basics of JAVA exception handling – Try blocks – Throwing catching and rethrowing an exception – Throws clause – finally block – Class thread an overview – Thread states – Thread priorities and scheduling – Thread synchronization – Runnable interface – Thread groups – Loading displaying and scaling images – Files and streams – Creating. JcomboBox. JtextArea. 2003. while. 4. Tata McGraw Hill pub. Unit – II Methods: Program modules in JAVA – Methods – Method definitions – JAVA API packages – duration of identifiers – Scope rules – Method overloading –Arrays – references and reference parameters – passing arrays to methods – multiple subscripted arrays – Class scope – Controlling access to members – creating packages – constructors – overloaded constructors – set and get methods – final instance variables – package access – using this reference – finalizers – static class members – data abstraction and information hiding – superclasses and subclasses – protected members – Constructers and finalizers in subclass – inner class definitions – type wrapper class for primitive types. Deitel and Deitel. Pearson Edi. Ltd. “Core Java2 Volume II–Fundamentals”. value of intern and miscellaneous string methods – substrings and concatenating strings – stringBuffer class – string Tokenizer class – graphics contexts and graphics objects – color and font control – drawing lines. “Java How to Program”. Ovals. Jlist.
2. Prasad – Sultan chand and Sons.Meaning and importance–process of communication – principles –types – barriers to communication. Motivation-meaning and importance-types.Meaning-functions-principles. Rajendran Paul and Korala Kalli. Planning. UNIT II Organization. L.types of organization-merits and demerits – delegation of authority – decentralization–advantages and disadvantages. Sultan Chand & Sons. agenda. McGregor.Business letters –lay-outs of business letter drafting letters for sales and collection. 4.steps in planning – advantages and limitations – management by objectives.importance. Management by Koontz and werich Principles of management – Tripathy and Reddy – Tata Megra Hill Principles of Practice of management. Essentials of Business communication.M. Leadership-need importance – qualities of leadership-leadership styles.overcoming barriers UNIT V Written communication.definition-steps in control process.requirement of effective control system. minutes. Departmentation –meaning – process – basis types of departmentation – importance. UNIT IV Controlling. Herzberg. REFERENCE BOOKS 1. advantages and limitations. Oral communication – interviews-telephone conversation-instruction – dictation conducting meetings: notice.theories of motivation. UNIT III Staffing-definition-processing of staffing-recruitment – sources of recruitment-stages in selection procedure-trading and development. .PAPER XVIII MANAGEMENT CONCEPTS AND COMMUNICATION UNIT I Management-meaning and definition – features – functions – importance difference between administration and management – management hierarchy.meaning – nature-objectives.Budgetary and non-budgetary control techniques Communication. 3.maslow.
Animate images at different intervals by using multi threading concepts. Java program to maintain the student information in text file. Program to implement polymorphism. 8. 5. 2. Java Program to handle different mouse events. 2. Create a frame with user specific size and position it at user specific position (use commend line argument) Then different shapes with different colors (use menus) 4. 8. Java Program that prohibit to reading of text files that containing bad words. 2. Program to sent a text message to another system and receive the text message from the system (use socket programming) 9. 6. 6. 5. VB . 7. 4. Java program to implement RMI.NET PROGRAM LIST 1. 11. 3. 3. Program for a notepad application Program to employee details Program for supplier details Program for hospital management Program for newspaper vendor Program for simple calculator Program for create and reading text file PRACTICAL VIII JAVA PROGRAMMING LAB 1. Program to create a Window Using MFC Program to implement Message Maps Program to build Arithmetic Calculator Program to perform Car application Program for List Box Application Program to implement Threads Program to create Circle & Rectangle. 7. Java program by using JDBC concepts to access a database. Create an applet for a calculator application. 10. Use constructors to initialize the employee number and use overloading method to set the basic pay of the employee. 10. 13. Java Program by using to implement the tree viewer. 7. . Java bean program to view an image. 12.PRACTICAL VII VISUAL PROGRAMMING LAB VC++ PRACTICAL LIST 1. Create a employee package to maintain the information about the employee. 9. inheritance and inner classes. 6. 8. Program for a various font application. 5. By using this package create a java program. 3. 4. Program to Payroll Application using ODBC Program to Students Details using DAO. Program to Draw Circles on Mouse Click Point.
UNIT II Analysis concepts & Principles: Requirement Analysis – Analysis Principles – Software Prototyping – Specification.Design principles – Design concepts – Effective modular design. “Fundamentals of Software Engineering”. (5th edition) Tata McGraw Hill Higher education. Dino Mandrioli. 3. second edition. REFERENCE BOOKS 1. Component level design: Structured programming – Comparison of design notations. TEXT BOOK 1. Rajib Mall “Fundamentals of Software Engineering”. Tata McGraw Hill. Analysis modeling : Data modeling – Functional modeling & information flow – Behavioral modeling. . Carlo Ghezzi. A strategic approach to software testing – Strategic issues – Unix testing – integration testing – Validation testing – System testing.SEMESTER V PAPER XXI SOFTWARE ENGINEERING UNIT I The evolving role of software – Software – Software Crises and Myths – Software Engineering: Layered Technology – The software process model – Evaluating Software process models – Component Based development – The formal methods model – 4GT – Software project planning: Project planning objectives – Software Scope – resource – Software Project estimation – Decomposition Techniques – Empirical estimation models. UNIT IV User interface design: The Golden Rules – User interface design – Task Analyzing and modeling – interface design activities – implementation tools – Design evaluation. pearson education asia. Pressman. Pearson Education. UNIT V Software Testing Techniques: Software testing fundamentals – Test case design – While box testing – Basic path testing – Control structure testing – Black box testing. Sommerville. “Software Engineering Concepts”.S. PHI. UNIT III Design concepts & Principles : The design process . “Software Engineering”. 4. "Software Engineering a Practioner’s Approach". Second Edition. Software Testing strategies: . Architectural design: Software architecture – Data design – Analyzing alternative architectural design – Mapping requirements into software architecture – Transform mapping – Transaction mapping. Sixth edition. 2. Mehdi Jazayeri. Object-Oriented design: Design for object – Oriented systems – the system design process – The object design process. R. Richard Fairpy. 1997.
text flow and the box model.duration of identifiers – scope rules – recursion – recursion Vs iteration . selection structure while.defined functionsfunction definitions. data.resources.arithmetic.laballed break and continue statementslogical operators. Java script functions: introduction – program modules in java script.PAPER XXII INTERNET AND WEB PROGRAMMING UNIT I Introduction to computer and the internet: history of the world wide web.memory concepts. for. If/else. nested and ordered lists-basic HTML tables – intermediate HTML tables and formatting – basic HTML forms – more complex HTML forms – internal linking – creating and using image maps <META> tags <FRAMESET> tags – internet and www resources. UNIT II Java script – introduction to scripting: introduction. horizontal rules and more line breaks – internet and www resources. Dynamic HTML: CSS: introduction –inline styles – creating style sheets with the style element – conflicting styles. Introduction of HTML: introduction.markup language –editing HTML –common tags-headers – text styling – linking – images formatting text with <FONT> special characters.searching arrays – multiple subscripted arrays. UNIT III Java script arrays: introduction – array-declaring and allocating arrays – references and references parameters – passing arrays to functions – sorting arrays.break and continue statements. Java script control structures: If.decision making – java script internet & www. bookan and number objects.programmer.java script global functions.user style sheets – internet & www.hardware trends – the say software trend: object technology –java script object – v=based scripting for the web-browser portability.resources.math string. do/while repetition structures: multiple-selection structure. Java script objects: introduction –thinking about objects.linking external style sheets-positioning elements –backgrounds – element dimensions. . Intermediate HTML: introduction – unordered lists.
UNIT V Active Server Pages (ASP) Introduction –How ASP work.making text glow – creating motion with blur.Powell. gray and x ray – adding shadows to text –creating gradients with alpha.structuring data –documents type definitions-customized markup language – XML parsers –XHTML – internet & www resources. Dynamic HTML: Filters and Transitions: Introduction-Flip filters: Flipu and Filph-transparency with the chroma filter – creating image filters: invert. “Internet and Word wide Web How to Program”.UNIT IV Dynamic HTML: object model and collections : introduction –object referencing –collections all and children –dynamic style-dynamic positioning-using the frames collection –novigator object. fourth edition. 2003 REFERENCE BOOKS 1Thomas A. Company Ltd.data types and control structures – VB script functions – arrays –string manipulation classes and objects –internet & www resources. CGI and Pert: CGI-Introduction to Perl –configuring personal web server or Pert/ CGI – string processing and regular expressions –viewing client/server environment variables –form processing and business logic-server-side includes –verifying a username and password –sending E-Mail from a web browser –using ODBC to connect to a database – cookies and perl –internet & www resources. XML: Introduction. Company Ltd.client –side scripting versus – server side scripting –using personnel web page server or internet information server-server – side activex components – file system objects – session tracking and cookies – accessing a data base from an ASP – internet & www resources. Tata Msgraw Hill Pub.using the wave filter-advanced filters: drop. shadow and light -transitions I: Filter transitions II: Filter reveal trans. Dynamic HTML: event model : introduction –event ON CLICK-event ON LOAD – error handling with ON ERROR-tracking the mouse with event ON MOUSE MOVE-rollovers with ON MOUSE OVER and ONBLUR – more form processing with ON SUBMIT and ON RESET – event bubbling more DHTML events. Nieto. Atul Kahate. “Web Technologies – TCP/IP to internet application architectures”. “The Complete reference HTML and XHTML”. Godbole. 2003. Pearson Education Asia . .. TEXT BOOK Deitel. Tata MsGraw Hill Pub. 2Achyut s.. Dynamical HTML: Client side scripting with VB script: Introduction -operators.
Margaret H.Stephen J.PHI.”data warehousing.data mininig. 2. TEXT BOOKS 1.Smith. Association rules: Introduction-large item sets – basic algorithms – parallel & distributed algorithms – comparing approaches – incremental rules – advanced association rules techniques – measuring the quality of rules. Unit-V Developing a data WAREHOSE:why and how to build a data warehouse architectural strategies and organization issuses-design consideration.”Tecniques”. “data warehousing-concepts.Second Edtion. Prabhu. Unit IV Data warehousing: An introduction.characteristic of a data warehouse – data mats – other aspects of data mart.2003 2.& OLAP. Applications of data warehousing and data mining in government:Indroduction-national data warehousing and data mining.based algorithms – decision tree.based algorithms.product and application”. TMCH.Ltd.C. Unit III Clustering: Introduction – Similarity and distance Measures – Outliers – Hierarchical Algorithms – Partitional Algorithms. Unit II Classification: Introduction – statistical – based algorithms. Data mining techniques: Introduction – a statistical perspective on data mining – similarity measures – decision trees – neural networks – genetic algorithms.Pujari..Arun.techniques.”data mining introductory and advanced topics”.PAPER XXIII DATA MINING AND WAREHOUSEING Unit I Basic data mining tasks – data mining versus knowledge discovery in databases – Data mining issues – data mining metrices – social implications of data mining – data mining from a database perspective. Online analytical processing: introduction.K.S.pearson education.University Press(India) Pvt.data content-metadata distribution of datatools for data warehousing-performance consideration-crucial decision in designing a data warehose.Aler Berson.data modeling – multifact star schema or snow flake schema – OLAP TOOLS – state of the market – OLAP TOOLS and the internet.neural network – based algorithms – rulebased algorithms – combining techniques. REFERANCE BOOKS 1.Dunham.OLTP & OLAP systems – data modeling – star schema for multidimensional view.2003 .R.2001.distance.
Dhall.General method – binary search – merge sort – Quick sort – The Greedy method:-General method – knapsack problem – minimum cost spanning tree – single source shortest path. ANALYSIS AND DESIGN OF ALGORITHMS 2.stacks and queues – trees – dictionaries – priority queues – sets and disjoint set union – graphs – basic traversal and search techniques. First-Order Linear recurrence.1 UNIT I Introduction:. Sundarshan K. “Data Structures and Algorithms”. “Computer Algorithms” 2. John E. UNIT V Parallel models:-Basic concepts.Hopcroft. Parallel Algorithms: Parallel complexity.1. S.general method – 8-Queens problem – sum of subsets – graph oloring – Hamiltonian cycles – knapsack problem – Branch and bound:. Analysis of Parallel Addition. parallel Evaluation of General Arithmetic Expressions. TEXT BOOKS 1.Lakshmivarahan. Ellis Horowitz. . Jeffrey D.algorithm definition and specification – performance analysis – Elementary Data structures:. 3rd edition.The Method – 0/1 Knapsack problem – traveling salesperson. UNIT IV Backtracking:. Wiley. Alfred V. performance Measures. “Analysis and Design of Parallel Algorithms” REFERENCE BOOKS 1. Parallel Multiplication and division. UNIT II Divide – and – conquer:. Goodrich “Data Structures & Algorithms in Java”. UNIT III Dynamic Programming – general method – multistage graphs – all pair shortest path – optimal binary search trees – 0/1 Knapsack – traveling salesman problem – flow shop scheduling.Aho.Ullman.ELECTIVE I E.
TEXT BOOK 1. . .Light and the electromagnetic spectrum – Image sensing and acquisition – Image sampling and quantization – sonic basic relationship between pixels – Linear & Nonlinear operations. Woods. UNIT – II Image enhancement in the spatial domain: Background – some basic Gray level transformations – Histogram processing – enhancement using arithmetic / logic operations – basic of spatial filtering – smoothing spatial filters – sharpening spatial filters – combining spatial enhancement methods.Parallel algorithms: Models of computation – analysis of parallel algorithms prefix computation – sorting – searching – matrix operations. Rafael C. Gonzalez.1. UNIT – V Image segmentation: Detection and discontinuities – edge linking and boundary deduction – thresholding – region-based segmentation – segmentation by morphological watersheds – the use of motion in segmentation.2 UNIT – I Introduction: DIGITAL IMAGE PROCESSING What is digital image processing – the origin of DIP – example of fields that use DIP – Fundamentals steps in DIP – Components of an image processing system. portion invariant degradations – estimating the degradation function – inverse filtering – minimum mean square error filtering – constrained least squares filtering – geometric transformations. Richard E. UNIT – IV Image compression fundamentals – Image compression models – elements of information theory – error free compression – Lossy compression – image compression standards. “Digital Image Processing”.E. Digital Image Fundamentals: Elements of visual perception . UNIT – III Image restoration: A model of the image degradation / Restoration process – Noise models – Restoration is the process of noise only – Spatial filtering – periodic noise reduction by frequency domain filtering – Linear. Second edition pearson education.
UNIT III Fuzzy relation – Member function – Fuzzy matrices – Fuzzy entropy – Fuzzy operation – Fuzzy composition.3 NEURAL NETWORKS UNIT I Pattern classification – Learning and generalization – Structure of neural networks – ADA Line. New York. TEXT BOOKS: P. application of fuzzy logic concepts in fuzzy controller design and fuzzy querying in relational database model. UNIT IV Fuzzy variables – Linguistic variables – Measure of fuzziness – Transition Matrix – Concept of De Fuzzification and applications. B.Wasserman. “Neural Computing and Practice”.D. UNIT V CASE STUDY: Application of Neural Networks in character recognition. Outstar network – ART – Kohonens network – Neocognition. Prentice Hall on India. Delta Rule – Input Output value – perceptions – Linear separability – back propagation – XOR function – Introduction to Boolean neural networks. 1991. speech recognition.Kosko.E. “Neural Network in Computer Intelligence”. Prentice Hall. “Fuzzy sets and Fuzzy Logic – Theory and Applocations”. . 1996. UNIT II Hopfield networks – Energy – The harming Network – RAM – Boltzmann machine – Instar. drug discovery.1. Klir & Yuban. “Neural Networks and Fuzzy Syatems”. Van Nostran Reinhold. 1994. 1996. Limin Fu. McGraw Hill International Editions.
Introduction to making multimedia – Macintosh and Windows production platforms – Basic Software tools. Koegel Bufford. REFERENCE BOOKS 1. Fifth Edition. “Multimedia Systems”. The Vaughan. Tata McGraw Hill. UNIT V High Definition Television and Desktop Computing – Knowledge based Multimedia systems. “ Multimedia making it work”. . UNIT II Making Instant Multimedia – Multimedia authoring tools – Multimedia building blocks – Text – Sound. TEXT BOOKS MULTIMEDIA & ITS APPLICATIONS 1. John F. 2003. 2003.1 UNIT I What is Multimedia . Multimedia in Practice (Technology and Applications) – Judith Jeffloate – PHI. Pearson Education.ELECTIVE II E.2. UNIT III Images – Animation – Video UNIT IV Multimedia and the Internet – The internet and how it works – Tools for World Wide Web – Designing – Designing for the World Wide Web. 2.
designing a distributed processing system.network database design considerations ration analysis . UNIT V Distributed Databases: An overview .Distributed Database Design . John A Sharp.an e-mail server. McGraw Hill Book Co.DISTRIBUTED COMPUTING UNIT I Distributed Systems: Fully distributed processing systems structures . Joel M Crichlow.The R* project Technique Problems of Heterogeneous Distributed Databases.dimension analysis .loading factors . "Data Communications & Distributed Network(unit iii) 3.managing the distributed resources . TEXT BOOKS: 1.Distributed databases . UNIT III Design Considerations: Communications line loading .printer server .Partitioning and allocation .file server .E.Data flow systems . Ginseppe Pelagatti.division of responsibilities. III) 2. "Distributed Databases Principlesand Systems".2. Stefans Ceri.database decision trees . "An Introduction to distributed and parallel processing ".synchronization of network databases.Line loading calculations . Uyless D Black. UNIT II Distributed systems: Pros and Cons of Distributed processing . Networks and Interconnection .Principles distributed databases levels of transparency . "Introduction to Distributed & Parallel Computing" Unit IV 4. Black well scientific publications (for unit I.2 .Distributed databases . UNIT IV Client-Server Network Model: Concept . New York (1985(Unit V)).the challenge of distributed data .
UNIT III Empirical discrete distribution – Discrete uniform distribution – Poisson distribution – Geometric distribution – Acceptance – Rejection technique for Poisson distribution – Gamma distribution. UNIT IV Design and evaluation of simulation experiments – Input – Output analysis – Variance reduction technique – Verification and validation of simulation models. two server queue. areas of Application. simulation of inventory problems.3 SIMULATION & MODELING UNIT I Principle of computer modeling and simulation. empirical continuous distribution – Generating approximate normal variants. .ELECTIVE II E 2. Models of a system – A variety of modeling approaches. Case Study : Simulation of LAN – Manufacturing system – Hospital Management system. single channel queue. Monte Carlo simulation. UNIT II Random number generation. UNIT V Simulation languages – GPSS – SIMSCRIPT – SIMULA – Programming for Discrete event systems in GPSS and C. Nature of computer modeling and simulation. System and environment – components of a system – Discrete and Continuous systems. Discrete event simulation – Concepts in discrete – event simulation – Manual simulation using event scheduling.The chi-squares test. Limitation of simulation. Random variable generation – Inverse transform technique – Exponential distribution – Uniform distribution – Weibull distribution. technique for generating random numbers – Midsquare method – The midproduct method – Constant multiplier technique – Additive congruential method – Linear congruencies method – Tests for random number – The Kolmogorov Smirnov test .
Francis Neelamkovil.Carson II. “ Discrete Event System Simulation”.TEXT BOOKS 1. Narsingh Deo. 1984 2. REFERENCE BOOKS 1. David Kelton. Law and W. “ Computer Simulation and Modeling”. “System Simulation with Digital Computer”. Prentice Hall Inc. Prentice Hall of India. McGraw Hill International Editions . Averil M.1991 . Jerry Banks and John S. “ Simulation Modeling and Analysis”. 1979. John Wiley & Sons.1987 2.
3.common challenges during estimation – Metrices for the estimation processes.challenges during the requirements management phse.metrices for the requirements phase.management structures for testing in global teams – metrices for testing phase. Metrices: Introduction – The metrices roadmap – A typical metrices strategy – What should you measure – Set targets and track them – Understanding and tryimg to minimize variability – Act on data people and organizational issues in metrices programmes – common pitfalls to watch out for in metrices programmes – Metrices implementation checklists and tools. Unit – IV Design and development phase: some difference in our chosen approach – salient features of design – evolving in architecture / Blueprint – design for reusability – Technology choices /constrains – design to standards – design for portability – user interface issues – design for testability design for diagnosability – design for maintainability – design for installability-inter – operability design.Differences for a shrink-wrapped software. Unit – II Software configuration management : Introduction – Basic definitions and terminology – The process and activities of software configuration audit – software configuration management in geographically distributed teams-metrices in software configuration management – software configuration management tools and automation.challenges during design and development phases-skill sets for design and development metrices for design and development phases. Risk Management: Introduction-what is risk management and why is it important – Risk management cycle. Project Management in the testing phase: Introduction – what is testing – what are the activities that male up testing.test scheduling and types of tests-people issues in testing.ELECTIVE III E.1 SOFTWARE PROJECT MANAGEMENT Unit – 1 Product Life Cycle: Introduction – idea generation – Prototype development phase – Alpha phase – Beta phase – Protection phase – Maintenance and obsolescence phase. What is project life cycle model-A frame work for studying different life cycle models – The waterfall model – The prototype model – The repaid application development model – The spiral model and its variants. .Risk and mitigation in the context of global project – Teams – some practical techniques in risk management – metrices in risk management. Unit – III Software requirements gathering: Inputs and start criteria for requirements gathering – Dimensions of requirements gathering to be followed during requirements gathering – outputs and quality records from the requirements phase – skills sets required during the requirements phase. Estimation: What is estimation when & why is estimation done – The three phases of estimationestimation methodology – formal models for size estimation – translation effort estimated into schedule estimates .Risk identification: common tools and techniques – Risk quantification – Risk monitoring-Risk mitigation. Project Life Cycle models. Software quality assurance: How do you define quality important in software – quality control and quality assurance – cost and benefits of quality – software quality analyst’s functions – some popular misconceptions about the SQA’s role-software quality assurance tools – organizational structures – profile of a successful SQA-measures of SQA success – pitfalls to watch out for in the SQA’s role.
2. 1995. 3. Stephen H. Tata McGraw Hill Publishing Company. 2003.advantages of using geographically distributed teams for the maintenance phase-matrices for the maintenance phase.V Project management in the maintenance phase: Introduction – activities during the maintenance phase-management issues during the maintenance phase. Milk Cotterel. Derrel Ince. 1955.A.configuration management during the maintenance phase – skill sets for people in the maintenance phase-estimating size. REFERENCE BOOKS 1. Gobalswamy Ramesh. “Metrices and Models in Software Quality Engineering”. Kelkar. Inclination/Thomas Computer press.challenges in building global teams-models for the execution of some effective management techniques for managing global teams. . Sharp and M. Pearson Education Asia. “Software Project Management – A Concise study”. “Managing Global Software Projects”. TEXT BOOKS 1. 2nd edition. H. 2003. Tata McGraw Hill. S. “Software project Management”. “Introduction to software project management and quality assurance”. Impact of the internet on project management: Introduction – the effect of internet on project management – managing projects for the internet – effect on project management activities. Globalization issues in project management: Evolution of globalization. PHI. effort and people resources for the maintenance phase. Woodman.Unit . Bob Hughes. 4. Kan.
Tasks and threads multiple processes in an application – problem of sharing data by multiple tasks and routines – inter process communication. ISRs. interrupt latency and response times of the tasks as performance metrices – performance metric in scheduling models for periodic sporadic tasks – IEEE standard POSIX 1003.2 UNIT – I EMBEDDED SYSTEMS Introduction to embedded systems: An embedded system – processor in the system – other hardware units – software embedded into a system – exemplary embedded systems – On chip and in VLSI circuit processor and memory selection for an embedded systems. Devices drivers and interrupts servicing mechanism: Device drivers – Parallel port device drivers in a system – serial port device in a system – device driver for internal programmable timing devices – interrupt servicing mechanism – context and the periods for contextswitching deadline and interrupt latency. . UNIT – IV Inter – Process communication & synchronization of processes. REAL TIME OPERATING SYSTEM : Real time and embedded systems operating systems – Interrupt routines in RTOS environment – RTOS task scheduling models.E.3. OS functions and tasks and for resource management – embedded Linux internals. UNIT – III Program modeling concepts in single & multiprocessor systems software – development process – modeling processes for software analysis before software implementation – programming models for event controlled or response time constrained real time programs – modeling for microprocessor systems software engineering practices in the embedded software development process software algorithms 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 – UML.1b functions for standardization of RTOS and inter-task communication functions – list of basic action in a preemptive scheduler and expected times taken at a processor – fitters – point strategy for synchronization between the processes. UNIT – II Devices and buses for device networks: I/O devices – timer and counting devices.
“An Embedded software primer” Pearson education Asia. REFERENCE BOOK David E. . programming and design”. 2003. Tata McGraw Hill.UNIT – V Hardware – software co-design in an embedded system: Embedded system project management – embedded system design and co-design issues in system development processes – design cycle in the development phase for an embedded system – uses of target system or its emulator and in-circuit emulator – Use of software tools for development of an embedded system – Use of scopes and logic analysis for system hardware tests – issues in embedded system design. Case Study : An embedded system for an adaptive cruise control system in a car. 2003. Simon. TEXT BOOK Raj Kamal. embedded system for a smart card. “Embedded system – Architecture.
2. Unit – III Data Base Searchers and Pair Wise Alignment Data base searching – Alphabets and Complexity – Comparing Two Sequences – Sub-Sequence – Identity and Similarity – Dot plots – Simple alignment – Gaps – Scoring Matrices – Dynamic programming – BLAST and its relative – FSTA and related algorithms – Alignment scores and statistical significance of data base sequences. 2003. Raymer. Unit – V RNA Structure: Amino Acids – Polypeptide Composition Algorithm – Modeling protein folding prediction – RNA Sequence Structure.E. “ fundamental Concepts of Bioinformatics”.Composite Protein – Pattern database structure and classification of database. “ Introduction to Bioinformatics”.: Distance Based Methods – Based Methods – Comparison.J. Proteomics: Classification – Techniques – Inheritors – Drying Design – Structures – X-Ray Crystal – NMR – Empirical methods and prediction techniques. DNA Sequence analysis : Why analyse DNA? – Gene structure – Features of DNA sequence analysis – Issues in the interpretation and EST search – Approach of Gene hunting – Cell CDNA libraries and ESTs – Approaches to EST analysis – Effect of EST data on DNA data base examples of EST analysis.T. . Michale L. 2003.Attwood. Unit – II Genome Information Resources . Parry-Smith.K.3 BIO INFORMATICS Unit – I Introduction – Importance of Bioinformatics – Biological Sequence Structure – Deficit – Genome Projects – Status – Sequence analysis – Homology and analogy. Global and local Alignments : Algorithms – Similarities – Semi global alignment Unit – IV Multiple Sequence Alignment : Goal – Definition – Consensus – Complex – methods – Database of multiple Alignment – searching database with multiple alignment. D.3. Primary Sequence Databases Biological data base – Primary Sequence Database – Composite Protein Sequence Database – Secondary Database . Methods of Photo Genetics. TEXT BOOK 1. EMBNET – NCBI – virtual Tourism.DNA Sequence data base – Specialised genomic Resources. Pearson Education Asia. Pearson Education Asia. Krane.Dan E.
Easier Acess – Beyound Browsing – Beyound Cellular – Mobile Data Unleashed. Daniel Mauney. UNIT III Variables – other content you an include – controls – miscellaneous markup – sending information – application security – other data: The meta element – document type declarations – error and browser limitations – content generation – WML version negotiation.ELECTIVE IV E. easy to user web site design computer terminals Vs mobile terminals – designing a usable WAP site – structured usability methods – User interface design guidelines – design guidelines for selected WML elements. UNIT IV User interface design: Making wireless applications. Text Book: Sandeep Singhal. Pearson Education 2003. Jari Aluinen.4. “The WAP”.1 WAP & XML Unit I The Rise of mobile data: Market convergence Enabling convergence – Key services the mobile internet: Overview of the wireless application protocol: The origins of WAP – overview of the WAP architecture – components of the WAP standard – network infrastructure services supporting WAP clients – WAP architecture design principles – relationship to other standards. David Bevis. UNIT II The wireless markup language : overview – the WML documents model – WML authoring – URL’s identity content – Markup basics .WML – basics – basics content – events. trash and bindings. Jim Chan. UNIT V Wireless telephony applications: Overview of the WTA Architecture – WTA Client Framework – WTA Server & Security – Design Considerations – Application Creation Toolbox – Further WTA Enhancements. . Stefan Hild. The Mobile internet Future: Better Content. Lalitha Suryanarayana. Thomas Bridgram.
TMCH.Credit card based electronic Payment Systems Risk and Electronic Payment Systems .Components of the IWay . Bernard J. P.2 E-COMMERCE UNIT .Corporate data warehouse. Electronic Data Interchange . Joseph.Consumer-Oriented Applications – Mercantile models form the consumer’s perspective – Mercantile models from the merchant’s perspective.IV Internet information systems .EDI: Legal. Security and Privacy issues . 2002.E.Web Background: Hypertext Publishing . UNIT .. UNIT II Architectural Framework for Electronic Commerce .Electronic Commerce Organization Applications.Works flows automation and Co-ordination .Market research .Jaworski. TEXT BOOKS: 1. Pearson Edu. UNIT .Customization and internal commerce .The Last Mile: Local Roads and Access Ramps .Risk and Electronic Payment Systems .Supply chain commerce system . Andrew Winston. Masket forces influencing the I-Way .T.Rayport.Net work Access Equipment .Designing Electronic Payment Systems.Consumer Data Internet Emerging Tools.Issues behind Document infrastructure . “E-commerce – A Managerial Perspective”.Types of digital documents .based marketing .search and resource Discovery Paradigms Information Search and Retrieval .Making a business case for a document library . Jeffery F.4. . REFERENCE BOOKS 1. PHI.EDI Applications in business .Electronic Commerce Consumer Applications .EDI and electronic Commerce. UNIT III Types of Electronic Payment systems .Advertising on the internet .Digital token based electronic payment systems Smart Cards and Electronic Payment Systems .Electronic Commerce and Media Convergence .Electronic Commerce Catalogs or directories . “E-Commerce”.Charting the On-Line Marketing process .I Electronic Commerce Framework .The anatomy of E-Commerce Applications .V The new age of information .Information Filtering .Global Information Distribution Networks .Macroforces and internal commerce . 2. Ravi Kalakota. "Frontiers of Electronic Commerce".Public Policy issues shaping the I-Way. 2003.World Wide Web (W W W) as the Architecture. .Technology behind the Web Security and the Web. 2003.
‘Artificial Intelligence”.AI Techniques . Elaine Rich and Kevin Knight.Resolution . 4th Edition. Constraint Satisfaction . Problems.Understanding.Frame Problem.3 AI & EXPERT SYSTEMS UNIT .Issues in design of Search.Criteria for success. Knowledge representation issues : Representations and mappings Approaches to Knowledge representations . UNIT – III Using Predicate logic: Representing simple facts in logic -Representing Instance and Isa relationships . TEXT BOOK 1.Control Knowledge. UNIT – V Learning .Issues in Knowledge representations .II Heuristic Search Techniques: Generate and Test . Problem spaces.Planning . “Artificial Intelligence”. 1991. George f Luger.Knowledge representation . REFERENCE BOOK 1.Matching . Representing knowledge using rules: Procedural Vs Declarative knowledge Logic programming -Forward Vs Backward reasoning . Means-end analysis. (chapter 1-6 only).Perception and Action .ELECTIVE – IV E 4.Hill Climbing -Best-First . UNIT – IV Statistical reasoning .Expert System. Pearson Education Publ. Second Edition.I Introduction: AI Problems .Common sense .Problem Characteristics .2002.Natural deduction. UNIT .Tata McGraw Hill Publishers company Pvt Ltd. . Problem Reduction.Computable functions and predicates . Search: State space search Production Systems .
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue listening from where you left off, or restart the preview.