Wednesday, February 1, 2012

ANNA UNIVERSITY MCA 2ND SEMESTER SYLLABUS COMMON TO ALL ENGINEERING COLLEGES UNDER ANNA UNIVERSITY CHENNAI


AFFILIATED INSTITUTIONS
ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2009
M.C.A. (MASTER OF COMPUTER APPLICATIONS)
II SEMESTERS (FULL TIME) CURRICULUM AND SYLLABUS



MC9227 SYSTEM SOFTWARE LAB MCA 2ND SEMESTER SYLLABUS


MC9227 SYSTEM SOFTWARE LAB 


1. Assemblers.
2. Linkers.
3. Loaders.
4. Features of text editors.
5. Basic UNIX commands.


6. Shell Programming.
7. Grep, sed, awk.
8. File system related system calls.
9. Process management – Fork, Exec.
10. Message queues.
11. Pipe, FIFO’s.
12. Signals.
13. Shared memory.


MC9226 OBJECT ORIENTED PROGRAMMING LAB MCA SECOND SEMESTER ANNA UNIVERSITY SYLLABUS |


MC9226 OBJECT ORIENTED PROGRAMMING LAB 
0 0 3 2 1. Write a C++ Program to illustrate Enumeration and Function Overloading
2. Write a C++ Program to illustrate Scope and Storage class
3. Implementation of ADT such as Stack and Queues
4. Write a C++ Program to illustrate the use of Constructors and Destructors and
Constructor Overloading
5. Write a Program to illustrate Static member and methods
6. Write a Program to illustrate Bit fields
7. Write a Program to overload as binary operator, friend and member function



8. Write a Program to overload unary operator in Postfix and Prefix form as member
and friend function
9. Write a Program to illustrate Iterators and Containers
10. Write a C++ Program to illustrate function templates
11. Write a C++ Program to illustrate template class
12. Write C++ Programs and incorporating various forms of Inheritance
13. Write a C++ Program to illustrate Virtual functions
14. Exception Handling


MC9225 OPERATING SYSTEMS MCA 2ND SEMESTER ANNA UNIVERSITY SYLLABUS | MC9225 OPERATING SYSTEMS MCA SYLLABUS


MC9225 OPERATING SYSTEMS


UNIT I INTRODUCTION 


Introduction – Operating Systems and services – Processes – CPU Scheduling
approaches


UNIT II PROCESS SYNCHRONIZATION 


Process synchronization – Semaphores – Deadlocks – Handling deadlocks –
Multithreading


UNIT III MEMORY MANAGEMENT

Memory management – Paging – Segmentation – Virtual Memory – Demand paging –
Replacement Algorithms


UNIT IV DISK SCHEDULING 


Disk Scheduling approaches – File systems – Design issues – User interfaces to file
systems – I/O device management.


UNIT V CASE STUDIES 




Case study – Design and implementation of the UNIX OS, Process model and structure
– Memory management – File system – UNIX I/O management and device drivers –
Windows – System components – Process Management – Memory management – File
Systems – Networking


REFERENCES:
1. Abraham Silberschatz Peter B. Galvin, G. Gagne, “Operating System Concepts”,
Sixth Edition, Addison Wesley Publishing Co., 2003.
2. M. J. Bach, “Design Of The Unix Operating System”, Pearson Education.
3. Willam-Stalling “ Operating System” Fourth Edition, Pearson Education, 2003.

MC9223 DESIGN AND ANALYSIS OF ALGORITHMS ANNA UNIVERSITY SYLLABUS | MCA 2ND SEMESTER SYLLABUS |DESIGN AND ANALYSIS OF ALGORITHMS MC9223 ANNA UNIVERSITY SYLLABUS


MC 9223 DESIGN AND ANALYSIS OF ALGORITHMS 


UNIT I INTRODUCTION 


Fundamentals of algorithmic problem solving – Important problem types –
Fundamentals of the analysis of algorithm efficiency – analysis frame work –
Asymptotic notations – Mathematical analysis for recursive and non-recursive algorithms.


UNIT II DIVIDE AND CONQUER METHOD AND GREEDY METHOD 


Divide and conquer methodology – Merge sort – Quick sort – Binary search – Binary
tree traversal – Multiplication of large integers – Strassen’s matrix multiplication –
Greedy method – Prim’s algorithm – Kruskal’s algorithm – Dijkstra’s algorithm.


UNIT III DYNAMIC PROGRAMMING 


Computing a binomial coefficient – Warshall’s and Floyd’ algorithm – Optimal binary
search tree – Knapsack problem – Memory functions.


UNIT IV BACKTRACKING AND BRANCH AND BOUND 


Backtracking – N-Queens problem – Hamiltonian circuit problem – Subset sum problem
– Branch and bound – Assignment problem – Knapsack problem – Traveling
salesman problem.


UNIT V NP-HARD AND NP-COMPLETE PROBLEMS 


P & NP problems – NP-complete problems – Approximation algorithms for NP-hard
problems – Traveling salesman problem – Knapsack problem.




REFERENCES:
1. Anany Levitin “Introduction to the Design and Analysis of Algorithms” Pearson
Education 2003.
2. Thomas H.Cormen, Charles E.Leiserson, Ronald L.Rivest, “Introduction to
algorithms” Prentice Hall 1990.