Академический Документы
Профессиональный Документы
Культура Документы
3. Regulations
The general Regulations of the Bharathiar University Choice Based Credit System
Programme are applicable to this programme.
*******
M.Sc. Comp. Sci. (UD) 2011-12 Annexure : 39 A
Page 2 of 5 SCAA Dt. 23.03.2011
M. Sc. COMPUTER SCIENCE (CBCS)
Credits
Sem.
Hrs.
Elective/ Code Title of the Paper Marks
Supportive/
Project
Core 1 10CSEEC01 I Computer Organization & 4 4 100
Architecture
Core 2 10CSEEC02 I Operating Systems 4 4 100
Core 3 10CSEEC03 I Data Structures & Object Oriented 4 4 100
Concepts
Core 4 10CSEEC04 I Advanced Java Programming 4 4 100
Elective 1 10CSEEEXX I Elective 1 4 4 100
Lab 1 10CSEEP01 I Data Structures Lab 3 3 75
Lab 2 10CSEEP02 I Advanced Java Programming Lab 3 3 75
Supportive 1 10CSEEGSXX I General Supportive 1 2 2 50
Core 5 10CSEEC05 II Programming in C# 4 4 100
Core 6 11CSEEC06 II Relational Database Management 4 4 100
Systems
Core 7 11CSEEC07 II Design & Analysis of Algorithms 4 4 100
Core 8 10CSEEC08 II Computer Graphics 4 4 100
Elective 2 10CSEEEXX II Elective 2 4 4 100
Lab 3 10CSEEP03 II Programming in C# - Lab 3 3 75
Lab 4 07CSEEP04 II Relational Database Management 3 3 75
Systems Lab
Supportive 2 10CSEEGSXX II General Supportive 2 2 2 50
Core 9 10CSEEC09 III Computer Networks 4 4 100
Core 10 10CSEEC10 III Visual Programming 4 4 100
Core 11 10CSEEC11 III Software Project Management 4 4 100
Core 12 10CSEEC12 III Data mining & Warehousing 4 4 100
Elective 3 10CSEEEXX III Elective 3 4 4 100
Lab 5 10CSEEP05 III Computer Networks Lab 3 3 75
Lab 6 10CSEEP06 III Visual Programming Lab 3 3 75
Supportive 3 10CSEEGSXX III General Supportive 3 2 2 50
Core 13 10CSEEC13 IV Project Work & Viva-voce 6 150
Total 90 2250
M.Sc. Comp. Sci. (UD) 2011-12 Annexure : 39 A
Page 3 of 5 SCAA Dt. 23.03.2011
Electives for M.Sc. Computer Science (CBCS)
Credits
Hrs.
Sem.
Suggested Title of the Paper Marks
Code
Note :
1. The syllabus for the above papers (except Relational Database Management
System (11CSEEC06) and Design and Analysis of Algorithms (11CSEEC07) be
the same as prescribed for the academic year 2010-11.
Unit - II
Relational Database Design: Anomalies in a Database Functional Dependency Lossless
Join and Dependency-Preserving Decomposition Third Normal Form Boyce Codd
Normal Form Multivalued Dependency Fourth Normal Form Join Dependency
Project Join Normal Form Domain Key Normal Form.
Unit - III
SQL: Data Definition Data Manipulation Integrity Constraints Views PL/SQL.
Recovery : Reliability Transaction Recovery in Centralized DBMS Reflecting Updates
to Database and Recovery Buffer Management, Virtual Memory and Recovery Logging
Schemes Disaster Recovery.
Unit - IV
Concurrency Management: Introduction Serializability Concurrency Control Locking
Schemes Timestamp Based Order Optimistic Scheduling Multiversion Techniques
Deadlock and its Resolutions Atomicity, Concurrency and Recovery.
Unit - V
Distributed Databases: Introduction Homogeneous and Heterogeneous databases
Distributed data storage Distributed Transactions-Commit Protocols-Concurrency
Control-Distributed Query Processing-Deadlocks in Distributed Systems .Introduction to
OODBMS: Object Approach. Knowledge Based Systems.
Reference Books:
1. Bipin C. Desai, An Introduction to Database Systems, Galgotia Publications, 2002.
2. Abraham Silberschatz, Henry F. Korth and S. Sudarshan, Database System
Concepts, McGraw-Hill, Fourth Edition.
3. Raghu Ramakrishnan and Johannes Gehrke, Database Management Systems,
McGraw Hill Higher Education.
4. Elmasri, Navathe, Fundamentals of Database Systems, Pearson Education Asia,Third
Edition.
M.Sc. Comp. Sci. (UD) 2011-12 Annexure : 39 A
Page 5 of 5 SCAA Dt. 23.03.2011
Unit - II
Divide and Conquer: General Method Binary Search Merge Sort Quick Sort. Greedy
Method: General Method Knapsack Problem Minimum Cost Spanning Tree Single
Source Shortest Path.
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.
Unit - IV
Backtracking: General Method 8-Queens Problem S um of Subsets Graph Coloring
Hamiltonian Cycles Knapsack Problem. Branch and Bound: The Method 0/1 Knapsack
Problem Traveling Salesperson.
Unit V
Algebraic Problems: General Method Evaluation and Interpolation - Modular Arithmetic
Even Faster Evaluation and Interpolation. NP-Hard and NP-Complex Problem: Basic
Concepts Traveling Salesperson Decision Problem Scheduling Identical Processors
Implementing Parallel Assignment Instructions.
Reference Books:
1. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, Fundamentals of Computer
Algorithms, Second Edition, Universities Press, 2008
2. Robert Sedgewick, Phillipe Flajolet, An Introduction to the Analysis of Algorithms,
Addison-Wesley Publishing Company, 1996.
3. Alfred V. Aho, John E. Hocroft, Jeffrey D. Ullman, Data Structures and Algorithms.
4. Wiley, Goodrich, Data Structures and Algorithms in Java, Third Edition.