I want to get admission in M.Sc. Computer Science in Bharathiar University, Coimbatore and for that I want to get the syllabus of M.Sc. Computer Science of Bharathiar University, Coimbatore so can you provide me that?

As you want to get the syllabus of M.Sc. Computer Science of Bharathiar University, Coimbatore so here is the information of the same for you:

Syllabus of M.Sc. Computer Science of Bharathiar University, Coimbatore:
Eligibility Criteria:
Candidates must have passed with 50% of marks in B.Sc. Computer Science / BCA /B.Sc. Computer Technology / B.Sc. Information Technology / B.Sc. Information Science / B.Sc. Information Systems / B.Sc. Software Science / B.Sc. Software Engineering / B.Sc. Software Systems. In case of SC/ST candidates, a mere pass in any of the above Bachelor‟s degree will be sufficient.

Syllabus:
COMPUTER ORGANIZATION AND ARCHITECTURE:
Unit – I
Central Processing Unit – General Register Organization –Stack Organization – Instruction Formats – Addressing Modes – Data Transfer Instructions and Data Manipulation Instructions – Program Control Instructions – Reduced Instruction Set Computers(RISC).

Unit – II
Parallel Computer Models and Memory Hierarchy: State of Computing-Multiprocessors and Multi computers – Program and Network Properties: Condition of Parallelism – System Interconnect Architecture – Virtual Memory Technology – Cache Memory Organization.

Unit - III
Computer Arithmetic : Introduction – Addition and Subtraction Algorithms – Multiplication Algorithm – Booth Multiplication – Array Multipliers – Division Algorithm – Floating Point Arithmetic Operations – Decimal Arithmetic Unit – BCD Adder – BCD Subtraction - Decimal Arithmetic Operations.

Unit – IV
Pipelining and Superscalar Techniques : Linear Pipeline Processors – Nonlinear Pipeline Processors – Instruction Pipeline Processors - Arithmetic Pipeline Design: Computer Arithmetic Principles – Static Arithmetic Pipelines – Multifunctional Arithmetic Pipeline.

Unit – V
Multiprocessors and Multicomputer: Multiprocessor System Interconnects – Cache Coherence and Synchronization Mechanisms – Message Passing Mechanisms – SIMD Computers : SIMD Computer Organization, Implementation – CM-2 Architecture – MP – 1 Architecture .

Reference Books:
1. Kai Hwang, “Advanced Computer Architecture , Tata-M c GrawHill Edition 2001.
2. M. Morris Mano, “Computer System Architecture , Prentice-Hall India, Third Edition, 1999.
3. John P Hayes, “Computer Architecture and Organization , McGraw-Hill Book Company, Third Edition.
4. M Morris Mano, “Digital Logic and Computer Design , Prentice-Hall India.

OPERATING SYSTEMS:
Unit – I
Introduction : What is an Operating System? – Main frame Systems – Desktop Systems – Multiprocessor Systems – Distributed Systems – Clustered Systems – Real-Time Systems – Handheld Systems – Feature Migration – Computing Environments. Computer System Structures : Computer-System Operation - I/O Structure - Storage Structure - Storage Hierarchy - Hardware Protection - Network Structure. Operating System Structures: System Components – Operating System Services - System Cal ls - System Programs - System Structure - Virtual Machines - System Design and Implementation - System Generation.

Unit – II
Process Management : Process Concept - Process Scheduling - Operations on Processes – Cooperating Processes – Inter Process Communication – Communication in Client-Server Systems. CPU Scheduling : Scheduling Concepts Scheduling Criteria - Scheduling Algorithms - Algorithm Evaluation – Multiple-Processor Scheduling – Real-Time Scheduling. Process Synchronization: The Critical-Section Problem – Synchronization Hardware – Semaphores – Classic Problems of Synchronization – Critical Region – Monitors. Deadlocks: Deadlock Problem – Deadlock Characterization – Deadlock Prevention – Deadlock Avoidance – Deadlock Detection - Recovery from Deadlock.

Unit – III
Memory Management: Background – Swapping - Contiguous Memory Allocation - Paging – Segmentation - Segmentation with Paging. Virtual Memory: Demand Paging - Page Replacement – Allocation of Frames - Thrashing. File System Interface: File Concept - Access Methods - Directory Structure - File System Mounting - File Sharing - Protection. File System Implementation: File-System Structure - File-System Implementation - Directory Implementation - Allocation Methods - Free-Space Management - Recovery.

Unit – IV
I/O systems: I/O Hardware - Kernel I/O Subsystem. Mass-Storage Structure : Disk Structure - Disk Scheduling - disk management - swap-space Management, RAID structure, disk attachment, stable-storage implementation, tertiary-storage structure.

Unit – V
Comparative study - DOS, UNIX/LINUX, Windows 9x, Windows NT.

Reference Books:
Silberschatz, Galvin, Gagne, “Operating Systems Concepts”, John Wiley & Sons, Inc., Sixth Edition.
Andrew S. Tanenbaum, “Modern Operating Systems”, Pr entice Hall of India, Second Edition.
H. M. Deitel, “Operating Systems”, Pearson Education, Second Edition.

DATA STRUCTURES AND OBJECT ORIENTED CONCEPTS:
Unit - I
Object Oriented Concepts: Introduction – Classes an d Methods – Messages, Instances and Initialization – Inheritance – Implications of Inheritance – Polymorphism.

Unit – II
Stacks and Recursion: About Stacks – Evaluation of Expressions - Implementation of Stack – Principles of Recursion. Queues and Linked Lists : Definitions – Implementation of Queues – Circular Queues – Application of Queues – Pointers and Linked lists – Singly and Doubly Linked list - Linked Stacks and Queues – Application of Polynomial Arithmetic. The Polish Notation : Evaluation of Polish Expressions – Translation from Infix to Postfix form.

Unit - III
Searching: Sequential Search - Binary Search - Fibonacci Search - Comparative Analysis of the 3 searches - Internal Sorting: Shell Sort – Radix Sort - Quick (Divide-and- Conquer) Sort – Merge Sort – Heap Sort.

Unit - IV
Search Trees: Height Balance Trees – B-Trees. Binary Trees: Introduction – Binary Search Trees - Building a Binary Search Tree – Traversal. Graphs: Mathematical Background – Computer Representation – Graph Traversal – Depth-First and Breadth-First Algorithms – Topological Sorting.

Unit - V
File Structures: External Storage Devices – Sequential Files – Index Sequential Files – Direct Files. External searching: Distribution Dependent Hashing Function – Dynamic Hashing Techniques – Direct Files with Hashing – Linear Hashing.

Reference Book:
1. Timothy Budd, “An Introduction to Object Oriented Programming” , Pearson Education, Second Edition.
2. Jean Paul Tremblay, Paul G. Sorenson, “An Introduction to Data Structures with Applications”, Tata McGraw Hill, Second Edition.
3. Sahini, “Data Structures, Algorithms and Applications in C++”, Mc GrawHill, 1998.

ADVANCED JAVA PROGRAMMING:
Unit - I
Introduction to Java - Java features – Java programming structure – Java tokens - Java Literals - Java Data types-Type Casting Operators Arrays, Multi Dimensional array Control statements.

Unit –II
Object Oriented Concepts in JAVA – Classes – Objects – Array of Objects - Method Overloading – Inheritance – Method Overriding – Abstract classes – Interfaces – Packages.

Unit – III
Exception handling in Java – Multithreading – Using Thread class – Using runable interface – Thread priorities – Synchronization - Applet basics - Applets life cycle- AWT: working with graphics working with frame window- Using AWT Controls – Event handling.

Unit –IV
Java Server Pages and Servlets : Basic JSP Architecture - Life Cycle of JSP (Translation, compilation) - JSP Tags and Expressions – Directives- JSP applications. Introduction to servlet - Developing and Deploying Servlets - Handling Request and Response - Accessing Database. RMI: RMI overview - RMI architecture - Example demonstrating RMI.

Unit – V
Introduction to J2EE - Enterprise Java Beans: enterprise Bean overview - Types of enterprise beans - Advantages of Enterprise Beans - Working with Session Beans - State full vs. Stateless Session Beans - Working with Entity Beans- Message Driven Beans, JDBC. Awareness to Other J2EE Technologies: Introduction to Hibernate with an example - Introduction to Spring framework with an example - Introduction to AJAX with an example Struts Framework: What is Struts? Struts Architecture.

Reference Books:
1. Patrick Naughton, “The Java Hand Book , Tata McGraw Hill, 1996.
2. Kenny Chu, “The Complete Reference Java , Tata McGraw Hill, 1997.
3. Steven Haines, “Java 2 from Scratch , Prentice Hall of India, 2000.
4. Balagurusamy, Programming with Java,II Edition, Tata Mc.Graw-Hill, publishing company Ltd.
5. Herbert Schildt - JAVA 2 ( The Complete Reference)- Fourth Edition, TMH,Fifth, Reprint 2002, BPB Publications
6. Jim Keogh, “The Complete Reference J2EE, TMH.

For more detailed information I am uploading a PDF file which is free to download:

Syllabus of M.Sc. Computer Science of Bharathiar University, Coimbatore

Contact Details:
Bharathiyar University
Coimbatore,
Tamil Nadu 641046
India

Map Location

Attached Files

Syllabus of M.Sc. Computer Science of Bharathiar University, Coimbatore.pdf (286.6 KB, 119 views)