22-11-2012, 06:17 PM
MASTER OF COMPUTER APPLICATION Syllabus
MASTER OF COMPUTER APPLICATION.pdf (Size: 165.95 KB / Downloads: 26)
OPERATING SYSTEMS
Unit-I
Introduction: Definition and types of operating systems, Batch Systems, multi programming, time–sharing parallel, distributed and real-time systems, Operating system structure, Operating system components and services, System calls, system programs, Virtual machines.
Unit-II
Process Management: Process concept, Process scheduling, Cooperating processes, Threads, Interprocess communication, CPU scheduling criteria, Scheduling algorithms, Multiple-processor scheduling, Real-time scheduling and Algorithm evaluation.
Unit-III
Process Synchronization and Deadlocks: The Critical-Section problem, synchronization hardware, Semaphores, Classical problems of synchronization, Critical regions, Monitors, Deadlocks-System model, Characterization, Deadlock prevention, Avoidance and Detection, Recovery from deadlock, Combined approach to deadlock handling.
Unit-IV
Storage management: Memory Management-Logical and Physical Address Space, Swapping, Contiguous Allocation, Paging, Segmentation with paging in MULTICS and Intel 386, Virtual Memory, Demand paging and its performance, Page replacement algorithms, Allocation of frames, Thrasing, Page Size and other considerations, Demand segmentation, File systems, secondary Storage Structure, File concept, access methods, directory implementation, Efficiency and performance, recovery, Disk structure, Disk scheduling methods, Disk management, Recovery, Disk structure, disk scheduling methods, Disk management, Swap-Space management, Disk reliability.
Unit-V
Security & Case Study: Protection and Security-Goals of protection, Domain of protection, Access matrix, Implementation of access Matrix, Revocation of Access Rights, language based protection, The Security problem, Authentication, One Time passwords, Program threats, System threats, Threat Monitoring, Encryption.
Windows NT-Design principles, System components, Environmental subsystems, File system, Networking and program interface, Linux system-design principles, Kernel Modules, Process Management, Scheduling, Memory management, File Systems, Input and Output, Interprocess communication, Network structure, security
References
1. Abraham Siberschatz and Peter Baer Galvin, “Operating System Concepts”, Fifth
Edition, Addision-Wesley
2. Milan Milankovic, “Operating Systems, Concepts and Design”, McGraw-Hill.
3. Harvey M Deital, "Operating Systems", Addison Wesley
4. Richard Peterson, “Linux: The Complete Reference”, Osborne McGraw-Hill.
DESIGN AND ANALYSIS OF ALGORITHMS
Introduction: Algorithms, Analysis of Algorithms, Design of Algorithms, Complexity of Algorithms, Asymptotic Notations, Growth of function, Recurrences and their solution methods.
Sorting in polynomial Time: Insertion sort, Merge sort, Heap sort, and Quick sort
Sorting in Linear Time: Counting sort, Radix Sort, Bucket Sort, Medians and order statistics
Unit-II
Advanced Data Structure: Red Black Trees, Augmenting Data Structure, Binomial Heap, B-Tree, Fibonacci Heap, and Data Structure for Disjoint Sets, All kinds of Algorithms on these data structures, Dictionaries and priority Queues, mergeable heaps, concatenable queues
Unit-III
Advanced Design and Analysis Techniques: Dynamic programming, Greedy Algorithm, Backtracking, Branch-and-Bound, Amortized Analysis
Unit-IV
Graph Algorithms: Elementary Graph Algorithms, Breadth First Search, Depth First Search, Minimum Spanning Tree, Kruskal’s Algorithms, Prim’s Algorithms, Single Source Shortest Path, All pair Shortest Path, Maximum flow and Traveling Salesman Problem
Unit-V
Randomized Algorithms, String Matching, NP-Hard and NP-Completeness, Approximation Algorithms, Sorting Network, Matrix Operations, Polynomials and FFT, Number Theoretic Algorithms
References
1. Design and Analysis of Computer Algorithms, Aho, Pearson Education Pub.
(5)
2. Fundamentals of Computer Algorithms by Horowitz and Sahani, Galgotia
3. Introduction to Algorithms by Thomas H Cormen Leiserson et al, PHI
4. Computer Algoritms : Introduction to Design and Analysis by Sara Baase and Allen Van Gelder, Pearson Education
5. Algorithm Design by Jon Kleinberg and Eva Tardos, Pearson Education
6. Fundamental of Algorithms by Brassard Bratley, PHI
7. Algorithms Design by M T Goodrich et al, John Wiley
8. The Design and analysis of Algorithms by A V Aho et al, Pearson Education
DATABASE MANAGEMENT SYSTEMS
Unit- I
Introduction: An overview of database management system, Database System Vs File System, Database system concepts and architecture, data models schema and instances, data independence and data base language and interfaces, Data definitions language, DML, Overall Database Structure.
Data Modeling using the Entity Relationship Model: ER model concepts, notation for ER diagram, mapping constraints, keys, Concepts of Super Key, candidate key, primary key, Generalization, aggregation, reduction of an ER diagrams to tables, extended ER model, relationships of higher degree.
Unit- II
Relational data Model and Language: Relational data model concepts, integrity constraints: entity integrity, referential integrity, Keys constraints, Domain constraints, relational algebra, relational calculus, tuple and domain calculus.
Introduction to SQL: Characteristics of SQL, Advantages of SQL, SQL data types and literals, Types of SQL commands, SQL operators and their procedure, Tables, views and indexes, Queries and sub queries, Aggregate functions, Insert, update and delete operations, Joins, Unions, Intersection, Minus, Cursors in SQL.
PL/SQL, Triggers and clusters.
Unit- III
Data Base Design & Normalization: Functional dependencies, normal forms, first, second, third normal forms, BCNF, inclusion dependencies, loss less join decompositions, normalization using FD, MVD, and JDs, alternative approaches to database design.
Unit- IV
Transaction Processing Concepts: Transaction system, Testing of serializability, Serializability of schedules, conflict & view serializable schedule, recoverability, Recovery from transaction failures, log based recovery, checkpoints, deadlock handling.
Unit- V
Concurrency Control Techniques: Concurrency control, locking Techniques for concurrency control, Time stamping protocols for concurrency control, validation based protocol, multiple granularity, Multi-version schemes, Recovery with concurrent transaction. Transaction Processing in Distributed system, data fragmentation. Replication and allocation techniques for distributed system, overview of concurrency control and recovery in distrusted database.
References
1 Date C J, “An Introduction To Database System”, Addision Wesley
2 Korth, Silbertz, Sudarshan, “Database Concepts”, McGraw Hill
3 Elmasri, Navathe, “Fundamentals Of Database Systems”, Addision Wesley
4 Paul Beynon Davies, “Database Systems”, Palgrave Macmillan
5 Bipin C. Desai, “An introduction to Database Systems”, Galgotia Publication
6 Majumdar & Bhattacharya, “Database Management System”, TMH
7 Ramakrishnan, Gehrke, “Database Management System”, McGraw Hill
8 Bharti P.K, “An introduction to Database Systems”, JPNP
INTERNET & JAVA PROGRAMMING
MCA 314
Unit-1
Internet: Internet, Connecting to Internet: Telephone, Cable, Satellite connection, Choosing an ISP, Introduction to Internet services, E-Mail concepts, Sending and Receiving secure E-Mail, Voice and Video Conferencing.
Unit- II
Core Java: Introduction, Operator, Data type, Variable, Arrays, Control Statements, Methods & Classes, Inheritance, Package and Interface, Exception Handling, Multithread programming, I/O, Java Applet, String handling, Networking, Event handling, Introduction to AWT, AWT controls, Layout managers, Menus, Images, Graphics.
Unit-III
Java Swing: Creating a Swing Applet and Application, Programming using Panes, Pluggable Look and feel, Labels, Text fields, Buttons, Toggle buttons, Checkboxes, Radio Buttons, View ports, Scroll Panes, Scroll Bars, Lists, Combo box, Progress Bar, Menus and Toolbars, Layered Panes, Tabbed Panes, Split Panes, Layouts, Windows, Dialog Boxes, Inner frame.