MCA COURSE STRUCTURE:: AY 2012-13

The Course Structure for MCA -1st and 2nd semesters under autonomy system during the Academic year 2012-13 is detailed below: MCA- 1st Semester:

MCA- 2nd Semester:

S. No Code Subject T/P Credits

1 HSP0 1401 Accounting & Financial Management 4 4

2 ITP1 1401 Computer Organization 4 4

3 ITP1 1402 Computer Programming & Data Structures 4 4

4 ITP1 1403 Data Base Management Systems 4 4

5 MATHP0 1401 Probability & Statistical Applications 4 4

6

ITP1 1204 Computer Programming & Data Structures Laboratory

3 2

7 ITP1 1205 Data Base Management Systems Laboratory 3 2

Total Credits 24

S. No Code Subject T/P Credits

1 ITP1 1406 Advanced Data Structures 4 4

2 MATHP0 1402 Optimization Techniques 4 4

3 ITP1 1407 Operating Systems 4 4

4 ITP1 1408 OOPs Through Java 4 4

5 ITP1 1409 Software Engineering 4 4

6

ITP1 1210 Advanced Data Structures Laboratory 3 2

7 ITP1 1211 OOPs Through Java Laboratory 3 2

8 Term Paper - 2

Total Credits 26

MCA- 1st Semester

SYLLABUS

Course Title: ACCOUNTING AND FINANCIAL MANAGEMENT Course C ode: HSP0 1401 UNIT-I ACCOUNTING: (10 HOURS) Generally Accepted Accounting Principles (GAAP) & Accounting standards, Characteristics and limitations of single entry system, double entry system of accounting, introduction of basic books of accounts, users of accounting information. UNIT-II PREPARATION OF TRIAL BALANCE (8 HOURS) Final accounts - company final accounts. Role of Accountant in modern Organization. UNIT-III FINANCIAL MANAGEMENT (9 HOURS) Financial Management – meaning, scope, role and objectives, time value of money – over vitalization – under capitalization - profit maximization - wealth maximization - EPS maximization. UNIT-IV RATIO ANALYSIS (7 HOURS) Ratio Analysis - advantages - limitations - Fund flow analysis - meaning, importance, preparation and interpretation of Funds flow and cash flow statements. UNIT-V COSTING (6 HOURS) Costing - nature and importance and basic principles. Elements of cost, Absorption costing vs. marginal costing - Financial accounting vs. cost accounting vs. management accounting. UNIT-VI MARGINAL COSTING AND BREAK-EVEN ANALYSIS (6 HOURS) Marginal costing and Break-even Analysis: nature, scope and importance - practical applications of marginal costing, limitations and importance of cost - volume, profit analysis, Short run decisions. UNIT-VII STANDARD COSTING AND BUDGETING (8 HOURS) Standard costing and budgeting: nature, scope and computation and analysis – materials variance, labor variance and sales variance -cash budget, sales budget - flexible Budgets, master budgets. UNIT-VIII INTRODUCTION TO COMPUTERIZED ACCOUNTING S YSTEM (6 HOURS) Introduction to computerized accounting system: coding logic and codes, master files, transaction files, introduction documents used for data collection, processing of different files and Outputs obtained.

TEXT BOOKS: 1. Accounting for Management, T. Vijay Kumar, TMH. 2. A text book of accounting for management, SKM vikas,S.N. Maheswari and S.K. Maheswari, Vikas REFERENCES: 1. Financial Accounting, A. Mukherjee and M. Haneef, TMH 2. Basic Financial Accounting for Management, Ambaresh Gupta, Pearson 3. Accounts and Finance for Non Accounts, Chatterjee. D.K, Himalaya 4. Financial Analysis and Accounting, P. PremchandBabu and M.Madan Mohan, Himalaya. 5. Essential of Financial Accounting, Ashish. K and Ballacharya, PHI. 6. Guide to Financial Management, John Tannent, Viva. 7. Financial Management, M.Y.Khan, P K Jain, TMH

MCA- 1st Semester SYLLABUS

Course Title: COMPUTER PROGRAMMING AND DATA STRUCTURES Course Code: ITP1 1402

UNIT – I PRILIMINARIES (12 HOURS) Algorithm / pseudo code, flowchart, program development steps, structure of C program, A Simple C program, identifiers, basic data types and sizes, Constants, variables, arithmetic, relational and logical operators, increment and decrement operators, conditional operator, bit-wise operators, assignment operators, expressions, type conversions, conditional expressions, precedence and order of evaluation. Input-output statements, statements and blocks, if and switch statements, loops- while, do-while and for statements, go to and labels, break, continue statements. UNIT – II DESIGNING STRUCTURED PROGRAMS (10 HOURS) Arrays- concepts, declaration, definition, accessing elements, storing elements, arrays and functions, two dimensional and multi-dimensional arrays, applications of arrays. String manipulations. Designing structured programs, Functions, basics, parameter passing, storage classes- extern, auto, register, static, scope rules, block structure, user defined functions, standard library functions, recursive functions, header files, Preprocessor Directive. UNIT – III POINTERS (6 HOURS) Pointers- concepts, initialization of pointer variables, pointers and function arguments, address arithmetic, Character pointers and functions, pointers to pointers, pointers and multidimensional arrays, dynamic memory managements functions, command line arguments. UNIT – IV STRUCTURES & FILES (6 HOURS) Derived types- structures- declaration, definition and initialization of structures, accessing structures, nested structures, arrays of structures, structures and functions, pointers to structures, self referential structures, unions, typedef, bitfields. Input and output – concept of a file, text files and binary files, streams, standard I/o, Formatted I/O, file I/O operations, error handling. UNIT – V LINEAR DATA STRUCTURES (6 HOURS) Introduction to data structures, Representing stacks and queues using arrays, infix to post fix conversion, postfix expression evaluation. Circular Queues. UNIT – VI SEARCHING (7 HOURS) Searching – Linear and binary search methods, sorting – Bubble sort, selection sort, Insertion sort, Quick sort, merge sort. UNIT – VII LINKED LISTS (7 HOURS) Singly linked lists, doubly linked lists, circular list, representing stacks and queues using linked lists.

UNIT – VIII TREES & GRAPHS (7 HOURS) Trees- Binary tress, terminology, representation, traversals, graphs- terminology, representation, graph Traversals (DFS&BFS) TEXT BOOKS: 1. The C Programming Language, B.W. Kernighan, Dennis M.Ritchie,PHI/Pearson Education. 2. Data Structures Using C – A.S.Tanenbaum, Y. Langsam, and M.J. Augenstein, PHI/Pearson education. REFERENCES: 1. Computer science, A structured programming approach using C, B.A. Forouzan and R.F. Gilberg, Third edition,Thomson. 2.Let us C – YashvantKanetkar BPB Publications. 3. C Programming with problem solving, J.A. Jones & K. Harrow,dreamtech Press. 4. Programming in C – Stephen G. Kochan, III Edition, PearsonEductaion. 5. Data Structures and Program Design in C, R.Kruse, C.L. Tondo, BP Leung, Shashi M, SecondEdition, Pearson Education.

MCA- 1st Semester SYLLABUS

Course Title: COMPUTER ORGANIZATION Course Code: ITP1 1401

UNIT-I NUMBER SYSTEMS-AND COMPUTER ARITHMETIC (8 HO URS)

NUMBER SYSTEMS-AND COMPUTER ARITHMETIC: Numbering Systems, Binary coded decimal numbers, Number Base Conversions, Signed and unsigned Numbers , Addition and subtraction, multiplication, division, Floating point representation. Logical operations, Gray code, BCD codes, Error detecting codes, Error correcting codes, Boolean algebra, Simplification of Boolean expressions, Canonical forms for Boolean Functions, Binary Operators and Logic gates. UNIT-II GATE LEVEL MINIMIZATION & COMBINATIONAL LOG IC (12 HOURS) Gate Level Minimization: The map method, Four variable Karnaugh Map, Five variable map, Quine-McCluskey Procedure, Product of sums simplification, Don’t care conditions, NAND & NOR implementation, Other two level implementations, exclusive-or function. Combinational Logic: Combinational Circuits, analysis procedure, Design procedure, Binary adder, subs tractor, Decimal adder, Binary multiplier, Magnitude Comparator, Decoders, Encoders, Multiplexers, De Multiplexers. UNIT-III SYNCHRONOUS SEQUENTIAL LOGIC (7 HOURS) Synchronous Sequential Logic: Sequential Circuits, Latches, Flip-Flops, Analysis of clocked sequential Circuits, State Reduction & assignment, Design procedure. Registers, Shift registers, Counters. UNIT-IV PLO’S & ASYNCHRONOUS SEQUENTIAL LOGIC (8 HO URS) Introduction, Random-access memory, Error Detection & Correction, programmable Logic array, Programmable array Logic Asynchronous Sequential Logic: Introduction, analysis procedure, Circuits with latches, design procedure, Reduction of state & flow tables, race free state assignment. UNIT-V CENTRAL PROCESSING UNIT (4 HOURS) Central Processing Unit : Learning Goals, Introduction, Operation Code Encoding and Decoding, Instruction Set and Instruction Formats, Instruction set, Instruction Format, Addressing Modes, Base Addressing, Segment Addressing, PC Relative Addressing, Indirect addressing, How to Encode Various Addressing Modes, Register Sets. UNIT-VI INPUT -OUTPUT ORGANIZATION (8 HOURS) INPUT -OUTPUT ORGANIZATION-peripheral devices, input-output interface-I/0Bus and interface modules, I/O versus Memory bus, isolated versus memory mapped I/O, Modes of transfer, priority interrupts-Daisy chaining, parallel priority, interrupt cycle, DMA- DMA control, DMA transfer, Input output processor-CPU-IOP communication. UNIT-VII (4 HOURS) MEMORY ORGANIZATION-memory hierarchy, Main memory-RAM, ROM chips, Memory address map, memory contention to CPU; Associative Memory-Hardware logic, match, read and write logic; Cache Memory-Associative mapping, Direct mapping, set associative mapping, hit and miss ratio.

UNIT- VIII (9 HOURS) Pipeline and Vector Processing: Parallel Processing, Pipelining-General Considerations, Arithmetic Pipeline, Instruction Pipeline, Ex: Four-Segment Instruction Pipeline, Data Dependency, Handling of Branch Instructions, RISC Pipeline, Ex: Three-Segment Instruction Pipeline, Delayed load, Delayed Branch, Vector Processing, Vector Operations, Matrix Multiplication, Memory Interleaving Supercomputers, Array Processors, Attached Array Processor, SIMD Array Processor.

TEXT BOOKS: 1. Morris Mano -Computer System Architecture –3rd Edition-Pearson Education. 2. Digital Design-3rd edition – Morris Mano. 3. Digital Logic and Computer Organization, Rajaraman, Radhakrishnan, PHI, 20062.

REFERENCE BOOKS: 1. Computer Organization, 5th ed., Hamacher, Vranesic and Zaky, TMH ,20022. 2. Computer System Organization & Architecture, John D. Carpinelli, Pearson, 20083. 3. Computer System Organization, NareshJotwani, TMH, 20094. 4. Computer Organization & Architecture: Designing for Performance, 7th ed., WilliamStallings, PHI,

2006.

MCA- 1st Semester

SYLLABUS

Course Title: DATABASE MANAGEMENT SYSTEMS Course Code: ITP1 1403

UNIT-I INTRODUCTION (9 HOURS)

Data base System Applications, data base System VS file System, View of Data, Data Abstraction, Instances and Schemas, data models, the ER Model, Relational Model, Other Models, Database Languages – DDL – DML – database Access for applications Programs – data base Users and Administrator – Transaction Management – data base System Structure – Storage Manager –the Query Processor – History of Data base Systems. Data base design and ER diagrams – Beyond ER Design Entities, Attributes and Entity sets – Relationships and Relationship sets – Additional features of ER Model – Concept Design with the ER Model –Conceptual Design for Large enterprises. UNIT-II RELATIONAL MODEL & RELATIONAL ALGEBRA AND C ALCULUS (7 HOURS) Relational Model: Introduction to the Relational Model – Integrity Constraint Over relations – Enforcing Integrity constraints – Querying relational data – Logical data base Design – Introduction to Views – Destroying /altering Tables and Views. Relational Algebra and Calculus: Relational Algebra – Selection and projection set operations – renaming – Joins – Division –Examples of Algebra overviews – Relational calculus – Tuple relational Calculus – Domain relational calculus – Expressive Power of Algebra and calculus. UNIT-III SQL (8 HOURS) Form of Basic SQL Query – Examples of Basic SQL Queries – Introduction to Nested Queries – Correlated Nested Queries Set – Comparison Operators – Aggregative Operators – NULL values – Comparison using Null values – Logical connectivity’s – AND, OR and NOTR – Impact on SQL Constructs – Outer Joins – Disallowing NULL values – Complex Integrity Constraints in SQL Triggers and Active Data bases. UNIT-IV NORMALIZATION (7 HOURS) Schema refinement – Problems Caused by redundancy – Decompositions – Problem related to decomposition – reasoning about FDS – FIRST, SECOND, THIRD Normal forms – BCNF – Lossless join Decomposition – Dependency preserving Decomposition – Schema refinement in Data base Design – Multi valued Dependencies – forth Normal Form. UNIT-V TRANSACTION MANAGEMENT (6 HOURS) Overview of Transaction Management: ACID Properties – Transactions and Schedules – Concurrent Execution of transaction –Lock Based Concurrency Control – Performance Locking – Transaction Support in SQL – Introduction to Crash recovery. UNIT-VI CONCURRENCY CONTROL (10 HOURS) Concurrency Control: Serializability, and recoverability – Introduction to Lock Management – Lock Conversions – Dealing with Dead Locks – Specialized Locking Techniques – Concurrency without Locking. Crash recovery: Introduction to ARIES – the Log –Other Recovery related Structures – the Write-Ahead Log

Protocol – Check pointing – recovering from a System Crash Media recovery – Other approaches and Interaction with Concurrency control. UNIT-VII STORAGE AND INDEXING (6 HOURS) Overview of Storage and Indexing: Data on External Storage – File Organization and Indexing – Cluster Indexes, Primary and Secondary Indexes – Index data Structures – Hash Based Indexing – Tree base Indexing – Comparison of File Organizations – Indexes and Performance Tuning. UNIT-VIII QUERY EVALUATION (8 HOURS) Overview of Query Evaluation: The System Catalogue – Introduction to Operator Evaluation – Algorithm for Relational Operations. Tree Structured Indexing: Intuitions for tree Indexes – Indexed Sequential Access Methods (ISAM) – B+ Trees: A Dynamic Index Structure. Hash Based Indexing: Static Hashing – Extendable hashing – Linear Hashing – Extendable vs. Liner hashing. TEXT BOOKS: 1. Data base Management Systems, 3/e, Raghurama Krishnan, Johannes Gehrke, TMH. 2. Data base System Concepts, 6/e, Silberschatz, Korth, TMH. REFERENCE BOOKS: 1. Data base Management System, 5/e, ElmasriNavathe, Pearson. 2. Introduction to Database Systems, 8/e, C.J.Date, Pearson. 3. Data base Systems design, Implementation, and Management,5/e, Rob , Coronel, Thomson. 4. Database Management System, Connolly Begg, Pearson. 5. Database Management systems, Farcia-Molina Ullman Widom, Pearson. 6. Database Management Systems, Majumdr, Bhattacharyya, TMH ,96. 7. Database System Concepts, Peter ROB,Coronel,Cengage.

MCA- 1st Semester

SYLLABUS

Course Title: PROBABILITY AND STATISTICAL APPLICATIONS Course Code: MATHP0 1401 UNIT-I PROBABILITY (7 HOURS) Probability Theory: Sample spaces Events & Probability; Discrete Probability; Union, intersection and compliments of events; Conditional probability Baye’s theorem. UNIT-II RANDOM VARIABLES AND DISTRIBUTION (14 HOURS ) Random variables and distribution: Random variables Discrete Probability Distributions, Continuous probability distribution, Binomial, Poisson, uniform, Exponential, Normal. UNIT-III EXPECTATIONS AND HIGHER ORDER MOMENTS (7 H OURS) Expectations and higher order moments – Moment Generating Function, Characteristic functions– Laws on large numbers – Weak Laws and strong laws of large numbers. Central limit theorem and other limit theorems. UNIT-IV SAMPLING DISTRIBUTION (6 HOURS) Sampling distribution: Populations and samples - Sampling distributions of mean (known and unknown) proportions, sums and differences. Statistics based on Normal, Student’s t and F distributions. UNIT-V TESTS OF SIGNIFICANCE (11 HOURS) Tests of significance –Z-test, t-test, F-test, chi-square-test. Factor Analysis ANOVA, Application tomedicine, psychology, agriculture etc. UNIT-VI REGRESSION (8 HOURS) Linear correlation coefficient Linear regression; Non Linear regression Least square fit; polynomial and Curve fittings UNIT-VII TIME SERIES AND FORECASTING (7HOURS) Time series and Forecasting: Moving averages, Smoothening of curves Forecasting models and methods ,Statistical Quality Control Methods-bar charts p-charts etc. UNIT-VIII QUEUING THEORY (7 HOURS) Queuing theory – Markov Chains – Introduction to Queuing systems – Elements of a queuing model – Exponential distribution – Pure birth and death models. Generalized Poisson Queuing model – Specialized Poisson Queues. TEXT BOOKS: 1. Probability, Statistics and Random Processes Dr.K.Murugesan&P.Gurusamy by AnuradhaAgencies,Deepti Publications. 2. Probability, Statistics and Random Processes ,T.Veerarajan, TMH, India. REFERENCE BOOKS: 1. Probability and Statistics for Engineers: Miller and Freund, PHI. 2. Probability, Statistics and Queuing Theory Applications, 2nd ed, Trivedi, John Wiley and Sons. 3. Probability and statistics: Dr.T.K.V.Iyengar, Dr. B.K.Gandhi…etc: S.Chand publications.

MCA- 1st Semester SYLLABUS

Course Title: COMPUTER PROGRAMMING & DATA STRUCTURES LAB Course Code: ITP1 1204

Exercise 1

a) Write a C program to find the sum of individual digits of a positive integer. b) A Fibonacci Sequence is defined as follows: the first and second terms in the sequence are 0 and 1. Subsequent terms are found by adding the preceding two terms in the sequence. Write a C program to generate the first n terms of the sequence. c) Write a C program to generate all the prime numbers between 1 and n, where n is a value supplied by the user. d) Write a program which checks a given integer is Fibonacci number or not. Exercise 2 a)Write a C program to calculate the following Sum: Sum=1-x2/2! +x4/4!-x6/6!+x8/8!-x10/10! b) Write a C program to find the roots of a quadratic equation. c) Write a C program to implement Newton Raphson method for a quadratic equation d) Write a C program to implement Newton Raphson method for a general purpose algebraic equation Exercise 3 a) Write C programs that use both recursive and non-recursive functions i) To find the factorial of a given integer. ii) To find the GCD (greatest common divisor) of two given integers. iii) To solve Towers of Hanoi problem. iv) Write program to calculate probability of head/tail by generating random numbers using random() function. Exercise 4 a) The total distance travelled by vehicle in ‘t’ seconds is given by distance = ut+1/2at2 where ‘u’ and ‘a’ are the initial velocity (m/sec.) and acceleration (m/sec2). Write C program to find the distance travelled at regular intervals of time given the values of ‘u’ and ‘a’. The program should provide the flexibility to the user to select his own time intervals and repeat the calculations for different values of ‘u’ and ‘a’. b) Write a C program, which takes two integer operands and one operator form the user, performs the operation and then prints the result. (Consider the operators +,-,*, /, % and use Switch Statement) Exercise 5 a) Write a C program to find both the larges and smallest number in a list of integers. b) Write a C program that uses functions to perform the following: i) Addition of Two Matrices ii) Multiplication of Two Matrices iii) Checking symmetricity of a square matrix. iv) Calculating transpose of a matrix in-place manner.

Exercise 6 a) Write a C program that uses functions to perform the following operations: i) To insert a sub-string in to given main string from a given position. ii) To delete n Characters from a given position in a given string. b) Write a C program to determine if the given string is a palindrome or not Exercise 7 a) Write a C program that displays the position/ index in the string S where the string T begins, or -1 if S doesn’t contain T. b) Write a C program to count the lines, words and characters in a given text. Exercise 8 a) Write a C program to generate Pascal’s triangle. b) Write a C program to construct a pyramid of numbers. Exercise 9 Write a C program to read in two numbers, x and n, and then compute the sum of this geometric progression: 1+x+x2+x3+………….+xn For example: if n is 3 and x is 5, then the program computes 1+5+25+125. Print x, n, the sum Perform error checking. For example, the formula does not make sense for negative exponents - if n is less than 0. Have your program print an error message if n<0, then go back and read in the next pair of numbers of without computing the sum. Are any values of x also illegal ? If so, test for them too. Exercise 10 a) 2’s complement of a number is obtained by scanning it from right to left and complementing all the bits after the first appearance of a 1. Thus 2’s complement of 11100 is 00100. Write a C program to find the 2’s complement of a binary number. b) Write a C program to convert a Roman numeral to its decimal equivalent. Exercise 11 Write a C program that uses functions to perform the following operations using Structure: i) Reading a complex number ii) Writing a complex number iii) Addition of two complex numbers iv) Multiplication of two complex numbers Exercise 12 a) Write a C program which copies one file to another. b) Write a C program to reverse the first n characters in a file. (Note: The file name and n are specified on the command line.) Exercise 13 a) Write a C program that uses functions to perform the following operations on singly linked list.: i) Creation ii) Insertion iii) Deletion iv) Traversal b) Adding two large integers which are represented in linked list fashion. Exercise 14 Write a C program that uses functions to perform the following operations on doubly linked list.: i) Creation ii) Insertion iii) Deletion iv) Traversal in both ways

Exercise 15 a.) Write C programs that implement stack (its operations) using i) Arrays ii) Pointers iii) linked list. Exercise 16 a. Write C programs that implement Queue (its operations) using i) Arrays ii) Pointers iii) linked lists. Exercise 17 Write a C program that uses Stack operations to perform the following: i) Converting infix expression into postfix expression ii) Evaluating the postfix expression Exercise 18 a. Write a C program that uses functions to perform the following: i) Creating a Binary Tree of integers ii) Traversing the above binary tree in preorder, inorder and postorder. b. Program to check balance property of a tree. c. Program to check for its strictness. Exercise 19 Write C programs that use both recursive and non recursive functions to perform the following searching operations for a Key value in a given list of integers :i) Linear search ii) Binary search Exercise 20 Write C programs that implement the following sorting methods to sort a given list of integers in ascending order: i) Bubble sort ii) Quick sort Exercise 21 a. Write C programs that implement the following sorting methods to sort a given list of integers in ascending order: i) Insertion sort ii) Merge sort b. Recursive implementation of sorting algorithms. Reference Books: 1. Digital Fundamentals, Floyd, Jain, 8th ed , Pearson. 2. Digital Logic and Computer Organization, Rajaraman, Radhakrishnan, PHI, 2006.

MCA- 1st Semester

SYLLABUS

Course Title: Database Management Systems Laboratory Course Code: ITP1 1205

1. Execute a single line and group functions for a table.

2. Perform various DDL operations.

3. Implement SQL queries for a) insertion b) retrieval c) updation d) deletion

4. Execute DCL and TCL Commands.

5. Create and manipulate various DB objects for a table.

6. Create Views.

7. Create views, partitions and locks for a particular DB.

8. Create sample triggers and assertions.

9. Write PL/SQL block to perform various operations on relation.

10. Write a PL/SQL block for transaction operations of a typical application using triggers.

11. Write PL/SQL procedure for an application using cursors.

12. Write PL/SQL procedure for an application using exception handling.

13. Write a DBMS program to prepare reports for an application using functions.

14. Write a PL/SQL block for transaction operations of a typical application using package.

15. Create Forms.

16. Generate Reports.

17. Design and develop an application using any front end and back end tool (make use of ER

diagram and DFD).

MCA- 2nd Semester SYLLABUS

Course Title: ADVANCED DATA STRUCTURES Course Code: ITP1 1406

Unit-I (6 HOURS) Dictionaries: Sets, Dictionaries, Hash Tables, Open Hashing, Closed Hashing (Rehashing Methods), Hashing Functions (Division Method, Multiplication Method, Universal Hashing), Analysis of Closed Hashing Result (Unsuccessful Search, Insertion, Successful Search, Deletion), Hash Table Restructuring, Skip Lists, Analysis of Skip Lists. (Reference 1) Unit-II (7 HOURS) Balanced Trees: AVL Trees: Maximum Height of an AVL Tree, Insertions and Deletions. 2-3 Trees: Insertion, Deletion. Unit-III (7 HOURS) Priority Queues: Binary Heaps: Implementation of Insert and Delete min, Creating Heap. Binomial Queues: Binomial Queue Operations, Binomial Amortized Analysis, Lazy Binomial Queues Unit-IV (6 HOURS) Graphs: Operations on Graphs: Vertex insertion, vertex deletion, find vertex, edge addition, edge deletion, Graph Traversals- Depth First Search and Breadth First Search (Non recursive). Graph storage Representation- Adjacency matrix, adjacency lists. Unit-V (8 HOURS) Graph algorithms: Minimum-Cost Spanning Trees-Prim's Algorithm, Kruskal's Algorithm Shortest Path Algorithms: Dijkstra's Algorithm, All Pairs Shortest Paths Problem: Floyd's Algorithm, Warshall's Algorithm, Unit-VI (6 HOURS) Sorting Methods: Order Statistics: Lower Bound on Complexity for Sorting Methods: Lower Bound on Worst Case Complexity, Lower Bound on Average Case Complexity, Heap Sort, Quick Sort, Radix Sorting, Merge Sort. Unit-VII (6 HOURS) Pattern matching and Tries: Pattern matching algorithms- the Boyer –Moore algorithm, the Knuth-Morris-Pratt algorithm Tries: Definitions and concepts of digital search tree, Binary trie, Patricia, Multi-way trie Unit-VIII (6 HOURS) File Structures: Fundamental File Processing Operations-opening files, closing files, Reading and Writing file contents, Special characters in files. Fundamental File Structure Concepts- Field and record organization, Managing fixed-length, fixed-field buffers.

Text Books: 1) Data Structures, APseudocode Approach, Richard F Gilberg, Behrouz A Forouzan, Cengage. 2) Fundamentals of DATA STRUCTURES in C: 2nd ed, , Horowitz , Sahani, Anderson-freed,

University Press 3) Data structures and Algorithm Analysis in C, 2nd edition, Mark Allen Weiss, Pearson

Reference Books and web:

1) http://lcm.csa.iisc.ernet.in/dsa/dsa.html 2) http://utubersity.com/?page_id=878 3) http://freevideolectures.com/Course/2519/C-Programming-and-Data-Structures 4) http://freevideolectures.com/Course/2279/Data-Structures-And-Algorithms 5) File Structures :An Object oriented approach with C++, 3rd ed, Michel J Folk, Greg Riccardi, Bill

ZoellickC and 6) Data Structures: A Snap Shot oriented Treatise with Live examples from Science and Engineering,

NB Venkateswarlu& EV Prasad, S Chand, 2010.

MCA- 2nd Semester SYLLABUS

Course Title: OPTIMIZATION TECHNIQUES Course Code: MATHP0 1402 UNIT-I (7 HOURS) Introduction of operation research. LP Formulations, Graphical method for solving LP’s with 2 variables, Simplex method, Duality theory in linear programming and applications, Integer linear programming, dual simplex method. UNIT-II (6 HOURS) The Transportation & Assignment Problems: The transportation Problems, A streamlined simplex method for the transportation problems, The Assignment Problem. UNIT-III (7 HOURS) Dynamic Programming : Basic Concepts, Bellman’s optimality principles, Dynamics programming approach in decision making problems, optimal subdivision problem. UNIT-IV (6 HOURS) Sequencing Models: Sequencing problem, Johnson’s Algorithm for processing n jobs through 2 machines, Algorithm for processing n jobs through 3 or more machines, Processing 2 jobs through n machines. UNIT-V (8 HOURS) Project Management : PERT and CPM : Project management origin and use of PERT, origin and use of CPM, Applications of PERT and CPM, Project Network, Diagram representation, Critical path calculation by network analysis and critical path method (CPM), Determination of floats, Construction of time chart and resource labelling, Project cost curve and crashing in project management, Project Evaluation and review Technique (PERT).

UNIT-VI (6 HOURS) Queuing Models : Essential features of queuing systems, operating characteristics of queuing system, probability distribution in queuing systems, classification of queuing models, solution of queuing M/M/1

/FCFS, M/M/S :∞ /FCFS,M/M/1 : N/FCFS, M/M/S : ∞: N/FCFS.

UNIT-VII (6 HOURS) Inventory Models : Introduction to the inventory problem, Deterministic Models, The classical EOQ (Economic Order Quantity) model, Inventory models with deterministe demands(no shortage & shortage allowed), Inventory models with probabilistic demand, multiitem determinise models.

UNIT-VIII (6 HOURS) Game Theory: The formation of Twoperson, Zerosum games, Solving simple games, games with mixed strategies, Graphical solution Procedure, Solving by Linear Programming.

Text Books:

1. Gillet B.E. : Introduction to Operation Research, Computer Oriented Algorithmic approach - Tata McGraw Hill Publising Co. Ltd. New Delhi.

2. Taha H.A. “Operations Research an Introduction” McMillan Publication.

Reference Books:

1. P.K. Gupta & D.S. Hira, “Operations Research”, S.Chand & Co 2. J.K. Sharma, “Operations Research: Theory and Applications”, Mac Millan. 3. S.D. Sharma, “Operations Research”, Kedar Nath Ram Nath, Meerut (UP). 4. S.S. Rao “Optimization Theory and Application”, Wesley Eastern. 5. Tata Hamdy, A “Operations Research - An Introduction”, Fifth Edition, Prentice Hall of India Pvt.

Ltd., New Delhi. 6. Hiller and Lieberman, Introduction to Operation Research (Seventh Edition) Tata

McGrawHill Publishing Company Ltd

MCA- 2nd Semester

SYLLABUS

Course Title: OPERATING SYSTEMS Course Code: ITP1 1407

UNIT I (6 HOURS) Operating System Introduction: Structures - Simple Batch, Multi programmed, timeshared, Personal Computer, Parallel, Distributed Systems, Real-Time Systems, System components, Operating - System services, System Calls, Virtual Machines, System Design and Implementation. UNIT II (7 HOURS) Process and CPU Scheduling: Process concepts and scheduling, Operation on processes, Cooperating Processes, Threads and Interposes Communication Scheduling Criteria, Scheduling Algorithm, Multiple -Processor Scheduling, Real-Time Scheduling. UNIT III (7 HOURS) Memory Management and Virtual Memory: Logical versus Physical Address Space, Swapping, Contiguous Allocation, Paging, Segmentation, Segmentation with Paging. Demand Paging, Performance of Demanding Paging, Page Replacement, Page Replacement Algorithm, Allocation of Frames, Thrashing. UNIT IV (7 HOURS) File System Interface and Implementation: Access methods, Directory Structure, Protection, File System Structure, Allocation methods, Free-space Management, Directory Management, Directory Implementation, Efficiency and Performance. UNIT V (7 HOURS) Process Management and Synchronization: The Critical Section Problem, Synchronization Hardware, Semaphores, and Classical Problems of Synchronization, Critical Regions, Monitors. UNIT VI (6 HOURS) Deadlocks: System Model, Dead locks Characterization, Methods for Handling Deadlocks Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, and Recovery from Deadlock. UNIT VII (6 HOURS) Case Study-1- windows – design principles, system components, file systems, networking, programming Interface.

UNIT VIII (6 HOURS) Case Study-II-Linux System: Design Principles, Kernel modules, Process Management, Scheduling Memory Management, File Systems, Input and Output, Interposes Communication, Network Structure, Security. TEXT BOOKS: 1. Operating System Principles - Abraham Silberchatz, Peter B. Galvin, Greg Gagne7thEdition, John Wiley. 2. Operating Systems Internals and Design Principles - Stallings, Fifth Edition–2005,Pearson Education/PHI. REFERENCE BOOKS: 1. Operating System A Design Approach - Crowley, TMH. 2. Modern Operating Systems - Andrew S Tanenbaum 2nd edition Pearson PHI 3. Operating Systems - Dhamdhere, TMH

MCA- 2nd Semester SYLLABUS

Course Title: OOPS THROUGH JAVA Course Code: ITP1 1408 UNIT I (6 HOURS) Basics of Object Oriented Paradigm (OOP)Need for OOP paradigm, A way of viewing world – Agents, responsibility, messages, methods, classes and instances, class hierarchies (Inheritance), method binding, overriding and exceptions, summary of OOP concepts, coping with complexity, abstraction mechanisms. UNIT II (7 HOURS) Java Basics History of Java, Java buzzwords, data types, variables, scope and life time of variables, arrays, operators, expressions, control statements, type conversion and costing, simple java program, classes and objects – concepts of classes, objects, constructors, methods, access control, this keyword, garbage collection, overloading methods and constructors, parameter passing, recursion, string handling. UNIT III (7 HOURS) Inheritance – Hierarchical abstractions, Base class object, subclass, subtype, substitutability, forms of inheritance- specialization, specification, construction, extension, limitation, combination, benefits of inheritance, costs of inheritance. Member access rules, super uses, using final with inheritance, polymorphism- method overriding, abstract classes. UNIT IV (6 HOURS) Packages and Interfaces : Defining, Creating and Accessing a Package, Understanding CLASSPATH, importing packages, differences between classes and interfaces, defining an interface, implementing interface, applying interfaces, variables in interface and extending interfaces. UNIT V (6 HOURS) Exception handling and multithreading - Concepts of exception handling, benefits of exception handling, Termination or presumptive models, exception hierarchy, usage of try, catch, throw, throws and finally, built in exceptions, creating own exception sub classes. Differences between multi threading and multitasking, thread life cycle, creating threads, synchronizing threads, daemon threads, thread groups. UNITVI (8 HOURS) Event Handling: Events, Event sources, Event classes, Event Listeners, Delegation event model, handling mouse and keyboard events, Adapter classes, inner classes. The AWT class hierarchy, user interface components- labels, button, canvas, scrollbars, text components, check box, check box groups, choices, lists panels – scroll pane, dialogs, menu bar, graphics, layout manager – layout manager types – boarder, grid, flow, card and grid bag. UNIT VII (5 HOURS) Applets – Concepts of Applets, differences between applets and applications, life cycle of an applet, types of applets, creating applets, passing parameters to applets.

UNIT VIII (7 HOURS) Swing – Introduction, limitations of AWT, MVC architecture, components, containers, exploring swing- JApplet, JFrame and JComponent, Icons and Labels, text fields, buttons The JButton class, Check boxes, Radio buttons, Combo boxes, Tabbed Panes, Scroll Panes, Trees, and Tables. TEXT BOOKS: 1. Java; the complete reference, 7th editon, Herbert schildt, TMH. 2. Understanding OOP with Java, updated edition, T. Budd, pearsoneduction.

MCA- 2nd Semester SYLLABUS

Course Title: SOFTWARE ENGINEERING Course Code: ITP1 1409

UNIT I (6 HOURS) SOFTWARE ENGINEERING PROCESS: Introduction –S/W Engineering Paradigm – life cycle models (water fall, incremental, spiral, WINWIN spiral, evolutionary, prototyping, object oriented) - system engineering – component based development – Verification & Validation. CMMI. UNIT II (7 HOURS) SOFTWARE REQUIREMENTS ANALYSIS : Functional and Non-functional - user – system –requirements engineering– Requirements verification and techniques- feasibility studies – System Engineering: requirements – elicitation – validation and management – software prototyping – prototyping in the software process. Requirements Analysis-Analysis principles. UNIT III (7 HOURS) SOFTWARE PROCESS AND PROJECT METRICS: Measures, Metrics, and Indicators, Software Measurement- Size-Oriented Metrics- Function-Oriented Metrics- Extended Function Point Metrics - Metrics for Software Quality- An Overview of Factors That Affect Quality- Measuring Quality- Defect Removal Efficiency

UNIT IV (6 HOURS) DESIGN & CODING CONCEPTS: Design process and concepts – modular design – design heuristic – design model and document. Architectural design – software architecture – data design – architectural design – transform and transaction mapping – user interface design – user interface design principles. Coding standards-Code reviews.

UNIT V (7 HOURS) TESTING : Taxonomy of software testing – levels – test activities –Test case design- White-Box Testing, Basis Path Testing – black box testing techniques: Graph-Based Testing Methods, Equivalence Partitioning, Boundary Value Analysis, Comparison Testing -- Software testing strategies: Unit Testing , Integration Testing , Validation Testing, System Testing- The Art of Debugging . UNIT-VI (7 HOURS) PROJECT MANAGEMENT & RISK ANALYSIS : Software Project Management: Planning, estimation, COCOMO models, PERT and CPM in software project implementation. Risk management: What is Risk? Reactive vs. Proactive Risk strategies, software risks, Risk identification, Risk projection, Risk refinement, RMMM, RMMM Plan. UNIT-VII (4 HOURS) QUALITY MANAGEMENT :Quality concepts, Software quality assurance, Software Reviews, Formal technical reviews, Statistical Software quality Assurance, Software reliability, The ISO 9000 quality standards.

UNIT-VIII (8 HOURS) OOSE & WEB ENGINEERING : Introduction to Object Oriented Analysis, Design, Testing, Attributes of Web Based Systems and Applications, Web App Engineering Layers, the Web Engineering Process, Web Engineering Best Practices. TEXT BOOKS:

1. Software Engineering, 7/e , Roger S.Pressman , TMH. 2. Software Engineering, 8/e, Sommerville, Pearson.

REFERENCE BOOKS

1. Software Engineering, A Precise approach, PankajJalote, Wiley. 2. Software Engineering, Kassem A. Saleh, Cengage. 3. Software Engineering principles and practice, W S Jawadekar, TMH. 4. Software Engineering, James ,PHI.

MCA- 2nd Semester SYLLABUS

Course Title: Advanced Data Structures Laboratory Course Code: ITP1 1210

i) To implement functions of Dictionary using Hashing ( division method, Multiplication

method, Universal hashing)

ii) To perform various operations i.e, insertions and deletions on AVL trees

iii) To perform various operations i.e., insertions and deletions on 2-3 trees.

iv) To implement operations on binary heap.

v) To implement operations on graphs

i. vertex insertion

ii. Vertex deletion

iii. finding vertex

iv. Edge addition and deletion

vi) To implement Depth First Search for a graph non recursively.

vii) To implement Breadth First Search for a graph non recursively.

viii) To implement Prim’s algorithm to generate a min-cost spanning tree.

ix) To implement Krushkal’s algorithm to generate a min-cost spanning tree.

x) To implement Dijkstra’s algorithm to find shortest path in the graph.

xi) .To implement pattern matching using Boyer-Moore algorithm.

xii) To implement Knuth-Morris-Pratt algorithm for pattern matching.

MCA- 2nd Semester SYLLABUS

Course Title: OOPS Through JAVA Laboratory Course Code: ITP1 1211

1. Use JDK 1.5cabove on any platform e.g. windows or unix 2. Student is expected to implement any 16 Programs

1. The Fibonacci sequence is defined by the following rule. The first 2 values in the sequence

are 1, 1. Every subsequent value is the sum of the 2 values preceding it. Write A Java program (WAJP) that uses both recursive and non- recursive functions to print the nth value of the Fibonacci sequence

2. WAJP to demonstrate wrapper classes, and to fix the precision.

3. WAJP that prompts the user for an integer and then prints out all the prime numbers up to that integer.

4. WAJP that checks whether a given string is a palindrome or not. Ex: MALAYALAM is palindrome.

5. WAJP for sorting a given list of names in ascending order. 6. WAJP to check the compatibility for multiplication, if compatible multiply two matrices and

find its transpose. 7. WAJP that illustrates how runtime polymorphism is achieved. 8. WAJP to create and demonstrate packages. 9. WAJP, using string tokenizer class, which reads a line of integers and then displays each

integer and the sum of all integers. 10. WAJP that reads on file name from the user then displays information about whether the file

exists, whether the file is readable/writable, the type of file and the length of the file in bytes and display the content of the using Fileinputstream class.

11. WAJP that displays the number of characters, lines and words in text/text file. 12. Write an applet that displays the content of file. 13. WAJP that works as a simple calculator. Use a grid layout to arrange buttons for the digits

and for the +-x/% operations. Add a text field to display the result. 14. WAJP for handling mouse events. 15. WAJP demonstrating the life cycle of thread. 16. WAJP that correctly implements producer-consumer problem using the concept of Inter

Thread Communication. 17. WAJP that lets users create Pie charts. Design your own user interface (with Swings &

AWT). 18. WAJP that allows user to draw lines, rectangles and ovals. 19. WAJP that implements a simple client/server application. The client sends data to a server.

The client sends data to a server. The server receives the data, uses it to produce a result and then sends the result back to the client. The client displays the result on the console. For ex: The data sent from the client is the radius of a circle and the result produced by the server is the area of the circle.

20. WAJP to generate a set of random numbers between two numbers x1 and x2, and x1>0.

21. WAJP to create an abstract class named shape, that contains an empty method names number of sides(). Provide three classes names Trapezoid, Triangle and Hexagon, such that each one of the classes contains only the method number of sides(), that contains the number of sides in the given geometrical figure.

22. WAJP to implement a Queue, using user defined Exception Handling (also make use of throw, throws).

23. WAJP that creates 3 threads by extending Thread class. First thread displays “Good morning” every I sec, the second thread displays “Hello” every 2 second and the third displays “welcome” every 3 second. (Repeat the same by implementing Runnable.

24. Create an inheritance hierarchy of Rodent, Mouse, Gerbil, Hamster etc. In the base class provide methods that are common to all Rodents and override these in the derived classes to perform different behaviors, depending on the specific type of Rodent. Create an array of Rodent, fill it with different specific types of Rodents and call your base class methods.