Integral University, Lucknow Department of Computer Application STUDY AND EVALUATION SCHEME. Master of Computer Application (MCA)

Size: px

Start display at page:

Download "Integral University, Lucknow Department of Computer Application STUDY AND EVALUATION SCHEME. Master of Computer Application (MCA)"

Lisa Warren
5 years ago
Views:

1 Integral University, Lucknow Department of Computer Application STUDY AND EVALUATION SCHEME Master of Computer Application (MCA) S. No Subject Code Subject Periods Evaluation Scheme Sessional Year II nd Sem III rd Exam CT TA Total ESE Theory Subjects 1. IMCA-301 Computer Networks IMCA-302 Design and Analysis of Algorithms 3. IMCA-303 Operating System IMCA-304 Database Management System IMCA-305 Object Oriented Systems and C++ 6. IMCA-306 Software Engineering Labs 7. IMCA-371 DBMS Lab IMCA-372 OOPS and C++ Lab IMCA-373 Software Engineering Lab GP-301 General Proficiency Subject Total G. Total 1200

2 IMCA-301 COMPUTER NETWORKS UNIT -I Introductory Concepts: Goals and Applications of Networks, Network structure and architecture, OSI reference model, Network topology, Physical Layer: Transmission, Switching methods, Multiplexing, Integrated Services Digital Networks (ISDN). [8] UNIT -II Medium Access Sub Layer: Channel Allocations, LAN protocols, ALOHA Protocols, Carrier sense Multiple Access Protocols, CSMA with Collision detection, Collision free Protocols, IEEE standards (802.3, 802.4, 802.5, and 802.6), FDDI. Data Link Layer: Elementary data link control protocols, Sliding window protocols, Error handling (Error-Correction and Detection), HDLC. [10] UNIT-III Network Layer: Point-to Point networks, Routing algorithms, Congestion control algorithms, Leaky Bucket Algorithm. Internetworking: Overview, TCP/IP Model, Network Layer: IP Protocol, IP Addresses, IPv4, IPv6. [8] UNIT-IV Transport Layer: Duties of Transport Layer, Connection Management, TCP Window Management, User Datagram Protocol, Transmission Control Protocol. Session Layer: Session and Transport Interaction, Synchronization points, Session Protocol Data Unit. Presentation Unit: Translation, Encryption/ Decryption, Authentication, Data Compression. [8] UNIT-V Application Layer: Network Security, DES, RSA algorithms, Domain Name System, Simple Network Management Protocol, Electronic Mail, File Transfer Protocol, Hyper Text Transfer Protocol, Cryptography and compression Techniques. [6] REFERENCES: 1. A. S Tanenbaum, Computer Networks, 3 rd Edition, PHI. 2. Forouzan, Data Communication and Networking, TMH. 3. W. Stallings, Data and Computer Communication, Macmillan Press. 4. Comer, Computer Networks and Internet, PHI. 5. Comer, Internetworking with TCP/IP, PHI.

3 IMCA-302 DESIGN AND ANALYSIS OF ALGORITHMS UNIT-I Algorithm Analysis: Methodologies for analyzing algorithms, Asymptotic Notation, Growth of functions, Recurrences: Substitution method, Recursion Tree Method, Master s Theorem, Sorting and Order Statistics: Heap Sort, Quick Sort, Sorting in Linear Time: Radix Sort, Bucket Sort. [8] UNIT-II Advance Data Structure: Hash Tables, Red Black Tree, Augmenting Data Structure, B-Trees, Heaps: Binomial Heaps, Fibonacci Heaps, Data Structure for Disjoint Sets. [8] UNIT-III Fundamental Design Techniques: Divide and Conquer: General Method, Binary Search, Finding Maximum and Minimum, Strassen s Matrix Multiplication The Greedy Method: General Method: Knapsack Problem, Tree Vertex Splitting problem. Dynamic Programming: General Method, Multi-Stage Graph, String Editing. Backtracking: Basic 8 Queen Problem, Sum of Subset Problem. [8] UNIT-IV Elementary Graph Algorithms: Representations of Graphs, Breadth First Search, Depth First Search, Minimum Spanning Trees: Kruskal and Prim s Algorithms, Single Source Shortest Paths, All Pair Shortest Paths, Maximum Flow. [8] UNIT-V Additional Topics: String Matching, NP-Completeness: P and NP, NP-Completeness, Important NP- Complete problems, Approximation Algorithms, Randomized Algorithms. [8] REFERENCES: 1. Coreman, Rivest, Lisserson, Algorithms, PHI. 2. Horwitz and Sahani, Fundamental of Computer Algorithm, Galgotia. 3. Brassard Brately: Fundamental Of Algorithms, PHI 4. M.T.Godrich Etal, Algorithms Design, John Wiley

4 IMCA-303 OPERATING SYSTEM UNIT-I Introduction: Definition and types of Operating Systems, Batch Systems, Multiprogramming, Time- Sharing, Parallel, Distributed and Real-Time Systems, Operating System Structure, Operating System Components and Services, System Calls, System Programs, Virtual Machines. Process Management: Process Concept, Process Scheduling, Cooperating Processes, Threads, Interprocess Communication. [8] UNIT-II CPU Scheduling Criteria, Scheduling Algorithms, Multiple-Processor Scheduling, Real-Time Scheduling and Algorithm Evaluation. Process Synchronization: The Critical-Section Problem, Synchronization Hardware, Semaphores, Classical problems of Synchronization, Critical Regions, Monitors. [8] UNIT-III Deadlocks: Deadlocks-System Model, Characterization, Deadlock Prevention, Avoidance and Detection, Recovery from Deadlock, Combined Approach to Deadlock Handling. Storage Management: Memory Management-Logical and Physical Address Space, Swapping, Contiguous Allocation, Paging, Segmentation with Paging. [8] UNIT-IV Virtual Memory: Demand Paging and its Performance, Page Replacement Algorithms, Allocation of Frames, Thrashing, Page Size and Other Considerations, Demand Segmentation. File Management: File Systems, Secondary Storage Structure, File Concept, Access Methods, Directory implementation, Efficiency and performance, Recovery. [8] UNIT-V Disk Management: Disk Structure, Disk Scheduling, Disk Management, Recovery, Disk Structure, Swap-Space Management, Disk Reliability. Case Study: 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. Android OS: Overview, Features, Platform and android SDKs. [9]

5 REFERENCES: 1. Abraham Siberschatz and Peter Baer Galvin Operating System Concepts. 2. Milan Milankovic, Operating Systems, Concept and Design Mcgraw Hill. 3. Harvey M Ddeital Operating System Addison Wesley.

6 IMCA-304 DATABASE MANAGEMENT SYSTEM 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,Database Language,Database 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. [9] UNIT-II Relational Data Model and Language: Relational Data Model Concepts, Integrity Constraints: Entity Integrity, Referential Integrity, Keys Constraints, Domain Constraints, Relational Algebra and 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, Indexes Queries and Sub Queries, Aggregate Functions, Insert, Update and Delete Operations, Joins, Union, Intersection, Minus, Cursors in SQL, PL/SQL, Triggers and Clusters. [9] UNIT-III Database Design and Normalization: Functional Dependencies, Normal Forms, First, Second,Third Normal Forms, BCNF, Fourth Normal Form, Fifth Normal Form, Inclusion Dependencies, Loss Less Join Decompositions, Normalization using FD, MVD and JDs, Alternative approaches to Database Design. [8] UNIT-IV Transaction Processing Concepts: Transaction System, Testing of Serializability, Serializability of Schedules, Conflict and View Seralizable Schedule, Recoverability, Recovery from Transaction Failures, Log-Based Recovery, Checkpoints, and Deadlock Handling. [8] 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, Overview of Concurrency Control in Distributed Database, Oracle 8: Basic Architecture and Case Study PL/SQL. Object Oriented Database: Introduction, Object oriented database concepts, Application of OODBMS, Comparison with RDBMS. [8]

7 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 Davis, "Database Systems, Palgrave Macmillan. 5. Bipin C. Desai, "An Introduction to Database Systems", Galgotia Publication.

8 IMCA-305 OBJECT ORIENTED SYSTEMS AND C UNIT-I Object Modeling: Object and Classes, Links and Associations, Multiplicity, Advanced Link and Association, Generalization and Inheritance, Aggregation, Abstract Classes, A Sample Object Model, Multiple Inheritance, Meta Data, Candidates Keys, Constraints and Homomorphism. [8] UNIT-II Dynamic Modeling: Events and States, State Diagram Operations and Methods, Nested State Diagrams, State Generalization, Concurrency, Relation of Object and Dynamic Models, Advance Dynamic Model Concepts and A Sample Dynamic Model. [8] UNIT-III Functional Modeling: Functional Models, Data Flow Diagrams, Specifying Operations, Constraints, A Sample Functional Model, Relation of Function to Object and Dynamics Models. Object Oriented Methodologies: Translating Object Oriented Design into an Implementation, OMT Methodologies, Examples and Case Studies to Demonstrate Methodology, Comparison of Methodology, SA/SD and JSD. [9] UNIT-IV Programming in C++: Basics of C++, Expression. Functions: Call by reference, Call by value, Inline function, Friend function. Classes and Objects: Access Specifiers, Member functions. Constructor and Destructor: Default, Parameterized, Copy, Destructor. Inheritance: Single, Multiple, Multilevel, Hierarchal, Abstract classes. [9] UNIT-V Pointer, Virtual function and Polymorphism: Function overloading, Operator overloading, Type conversion, this pointer (Unary and Binary),I/O, Real Life Applications, Extended classes, Working with files, Class Templates, Function Templates and Exception Handling. [7] REFERENCES: 1. Ram Baugh James Etal, Object Oriented Design And Modeling PHI, Bjarne Stroustrup C++ Programming Language, Addison Wesley. 3. Balagurusamy E, Object Oriented Programming with C++ TMH, Booch Grady, Object Oriented Analysis and Design with Application 3/E.

9 IMCA-306 SOFTWARE ENGINEERING UNIT-I Fundamental Concept on Software Engineering: Introduction to Software Engineering, Software Crisis, Software Problems, Software-Engineering Problems, Characteristics of Software, Software Evaluation, Software Applications, Requirement Analysis and Requirement Specification Documents, Software Design, Coding, Testing, Maintenance, Validation and Verification, Monitoring and Control, Metrics and Measurement. Software Development Models: Waterfall Model, Prototyping Model, Interactive Enhancement Model, Spiral Model, Iterative Models, Evolutionary process models, Role of Management in Software Development and Problem Analysis. [8] UNIT -II Software Design: Design process, Design concepts, Design model, Problem Partitioning and Hierarchy, Abstraction, Modularity, Top-Down and Bottom-Up Approach, Structure Design Methodology, Functional Approach, Object Oriented Approach, Coupling and Cohesion, Cyclomatic Complexity. Object Oriented Design: OO Analysis and OO Design, Classes and Objects, Relationship among Objects, Inheritance and Polymorphism, Design Concepts, Design Notation and Specification, Design Methodology, Dynamic Modeling, Functional Modeling. [8] UNIT-III Software Coding: Programming Practice, Top Down and Bottom Up Structured Programming, Information Hiding, Programming Style, Internal Documentation, Size measures, Complexity Metrics, Style Metrics Software Testing: Testing Fundamentals, Top Down and Bottom Up Approaches, Functional Testing, Structural Testing, Test Cases and Test Criteria, Software Testing Strategies, Testing Levels, Unit Testing, Integration Testing and System Testing, Alpha and Beta Testing, Test Plan, Test Case Specification, Test Case Execution and Analysis. [8] UNIT-IV Software Maintenance and Software Project Management: Software as an Evolutionary Entity, Need for Maintenance, Categories of Maintenance: Preventive, Corrective and Perfective Maintenance, Cost of Maintenance, Software Re- Engineering, Reverse Engineering, Software Configuration Management Activities, Change Control Process, Software Version Control, Estimation of various Parameters, Project Scheduling Staffing and Personal Planning, Constructive Cost Models (COCOMO), Resource Allocation Models, Software Risk Analysis and Management. [8] UNIT-V Software Reliability and Quality Assurance: Software Reliability, Reliability Issues, Musa's Model, Software Quality, Reliability Growth, ISO 9000 Certification, SEI Capability Maturity Model,

10 Comparison between ISO and CMM Model. CASE (Computer Aided Software Engineering): Various CASE Tools and their Usefulness, Role of Data Dictionary in CASE Tools, Architecture of CASE Environment, CASE support in Software life cycle. [8] REFERENCES: 1. Pankaj Jalote, Software Engineering, Narosa Publications. 2. Rajib Mall, Fundamental of Software Engineering, PHI. 3. Roger S. Pressman, Software Engineering: A practitioner s Approach, 7 Edition, McGraw Hill International Edition. 4. Sommerville, Software Engineering, 7th edition, Pearson education. 5. K.K. Agarwal and Yogesh Singh, Software Engineering, New Age International Publishers 6. James F. Peters, Witold Pedrycz, Software Engineering, an Engineering approach, John Wiley. 7. Shely Cashman Rosenblatt, Systems Analysis and Design, Thomson Publications. 8. Waman S Jawadekar, Software Engineering principles and practice, TMH

11 IMCA-371 DBMS LAB Programs to be implemented in SQL using Oracle:- 1. Creating Tables. 2. Insertion, Deletion, Updation and Retrieval using aggregate functions. 3. Concept of Join, Semi Join and Equi Join. 4. Writing programs in PL/SQL. 5. Concept of Functions and Procedures 6. Concept of Cursors. 7. Concepts of Triggers. 8. Concept of Indexing and Views. 9. Concept of Rollback and Commit. 10. Concept of Grant and Revoke Permission.

12 IMCA-372 OOPS and C++ Lab Writing programs in C++:- 1. Program illustrating use of Classes and Objects. 2. Program illustrating use of Statements and Operators. 3. Program illustrating the concepts of Array and String handling. 4. Program to perform all possible Type Conversions. 5. Program illustrating use of Destructor and various types of Constructors. 6. Program illustrating use of Friend, Inline and Static Member functions, Default arguments. 7. Program illustrating how Exception handling is done. 8. Program illustrating various forms of Inheritance. 9. Program illustrating use of Virtual Functions, Virtual Base Class. 10. Program implementing various kinds of Sorting algorithms, Search algorithms, Graph algorithm. 11. Program to create a file to store some records and search for a particular record and display it.

13 IMCA-373 SOFTWARE ENGINEERING LAB List of Practical: 1. Program for Configuration Management. 2. Perform SA/SD for the following software. Hotel Automation System Book Shop Automation Software. Word Processing Software. Software Component Cataloguing Software. 3. Design and development of test cases for Testing. 4. Writing program in C++ for Computing Cyclomatic complexity. 5. Writing program in C++ for Halstead Analysis. 6. Perform Cost/Benefit Analysis. 7. Illustration of various activities of Software Development using MS Project Case Studies: Payroll System, Banking System, Purchase Order System, Library Management System, Railway Reservation System, Bill Tracking System, College Admission System, Sales Management System.

CS201 Design and Analysis of Algorithms Max.Marks:75

CS201 Design and Analysis of Algorithms Max.Marks:75 Syllabus for M.Sc. Computer Science Programme Semester II CS 201 Design and Analysis of Algorithms 100 ( 75 + 25 ) CS 202 Data Communication and Computer Network 100 ( 75 + 25 ) CS 203 Optimization Techniques