Bangalore University Computer Science

Hello sir I want to do M.sc in Computer Science from Bangalore University so would you please provide me syllabus and other details of M.sc Computer Science course of Bangalore University??

[Quick Sam]

Bangalore University was established in 1886, it is a public state university and its offers Integrated Programmes, Bachelors, Masters and Doctoral degrees apart from Diplomas and Certificates in many disciplines.

Here I am giving you information about M.sc Computer Science course…

Duration of the course : 2 years (4 semesters)

Eligibility:
Candidates must have B.Sc. (Computer Science) or BCA degree with Mathematics as one of the subject and atleast 50% aggregate marks of all optional subjects (throughout 3 years B.Sc. / BCA course),

The minimum requirement for SC / ST candidates is relaxed in accordance with University regulations.

Scheme of study:
Each semester is of 4 months duration I to III semester: Theory papers 4 , Practicals 2 in each semester. IV semester : Project, seminar and viva-voce, theory papers 4.

Syllabus:
FIRST SEMESTER MSc
UNIT – I [ 12 Hours ]
Introduction: File Structures, The Heart of the file structure Design, A Conceptual Toolkit; Fundamental File Operations: Physical Files and Logical Files, Opening Files, Closing Files, Reading and Writing, Seeking, Special Characters, The Unix Directory Structure, Physical devices and Logical Files, File-related Header Files, UNIX file System Commands; Buffer Management, Input /Output in UNIX. Fundamental File Structure Concepts, Managing Files of Records: Field and Record Organization, Using Classes to Manipulate Buffers, Using Inheritance for Record Buffer Classes, Managing Fixed Length, Fixed Field Buffers, An Object-Oriented Class for Record Files, Record Access, More about Record Structures, Encapsulating Record Operations in a Single Class, File Access and File Organization.

UNIT – II [ 10 Hours ]
Organization of Files for Performance, Indexing: Data Compression, Reclaiming Space in files, Internal Sorting and Binary Searching, Key sorting; Index: Introduction, A Simple Index for Entry- Sequenced File, Object-Oriented support for Indexed, Entry-Sequenced Files of Data Objects, Indexes that are too large to hold in Memory, Indexing to provide access by Multiple keys, Retrieval Using Combinations of Secondary Keys. Consequential Processing and The Sorting of Large Files: A Model for Implementing Consequential Processes, Application of the Model to a General Ledger Program, Extension of the Model to include Multi-way Merging, A Second Look at Sorting in Memory, Merging as a Way of Sorting Large Files on Disk.

UNIT – III [ 10 Hours ]
Multilevel indexing and B-Trees: The invention of B-Tree, Statement of the problem, Indexing with Binary Search Trees; Multi-Level Indexing, B-Trees, Example of Creating a B-Tree, An Object-Oriented Representation of B-Trees, B-Tree Methods; Nomenclature, Formal Definition of B-Tree Properties, Worst-case Search Depth, Deletion, Merging and Redistribution, Redistribution during insertion; B* Trees.

UNIT – IV [ 10 Hours ]
Indexed Sequential File access and Prefix B+ Trees: Indexed Sequential Access, Maintaining a Sequence Set, Adding a Simple Index to the Sequence Set, The Content of the Index: Separators Instead of Keys, The Simple Prefix B+ Tree and its maintenance, Index Set Block Size, Internal Structure of Index Set Blocks: A Variable-order B- Tree, Loading a Simple Prefix B+ Trees, B-Trees, B+ Trees and Simple Prefix B+ Trees in Perspective.

UNIT – V [ 10 Hours ]
HASHING: Introduction, A Simple Hashing Algorithm, Hashing Functions and Record Distribution, Collision resolution by progressive overflow, Buckets. How Extendible Hashing Works, Implementation, Deletion, Extendible Hashing Performance, Alternative Approaches.

Reference Books:
1. Michael J. Folk, Bill Zoellick, Greg Riccardi, “File Structures-An Object Oriented Approach with C++ “, 3rd Edition, Addison-Wesley.
2. Raghu Ramakrishan and Johannes Gehrke, “Database Management Systems”, 3rd Edition, McGraw Hill, 2003.
3. Robert L. Kruse, Bruce P. Leung, Clovis L.Tondo, “Data Structures and Program Design in C”, 2nd Edition, Prenctice Hall India, 2001.
M.sc in Computer Science details
MSC102T: THEORY OF COMPUTATION
Total Teaching Hours: 52 No of Hours / Week: 04
UNIT – I [ 12 Hours ]
Review of Mathematical Terms and Theory: Basic Mathematical Notations and Set Theory, Logic Functions and Relations, Language Definitions, Mathematical Inductions and Recursive Definitions. Finite Automata: Deterministic and Non Deterministic Finite Automata, U-Transitions, Conversion from NFA to DGA, Kleene’s Theorem, Regular and Non Regular Languages.
UNIT – II [ 10 Hours ]
Context Free Grammar: Introduction to CFG, CFG and Known Languages, Unions, Concatenations and *’s Notations and CFL, Derivatives of Trees and Ambiguity and Unambiguous CFG and Algebraic Expressions, Normal Forms and Simplified Forms.
Pushdown Automata, CFL and NFL: Introduction to PDA, Definition, DPDA, PDA Corresponding to CFG, CFG Corresponding to PDA, Introduction to CFL, Intersections and Complements of CFL, Decisions Problems and CFL.
UNIT – III [ 10 Hours ]
Turing Machines, Recursive Language: Model of Computation and Church Turning Thesis, Definitions of Turing Machine, TM and Language Acceptors, Variations of TM, Non Deterministic TM, Universal TM, Enumerable and Language, Recursive and Non Recursive Enumerable.
UNIT – IV [ 10 Hours ]
Computation Functions, Measuring, Classifications And Complexity: Primitive Recursive Functions, Halting Problem, Recursive Predicates and Some Bounded Operations, Unbounded Minimizations and µ-Recursive Functions, Godel Numbering, Computable Functions and µ-Recursive, Numerical Functions.
UNIT – V [ 10 Hours ]
Tractable And Intractable Problems: Growth Rate and Functions, Time and Speed Complexity, Complexity Classes, Tractable and Possibly Intractable Problems, P and Np Completeness, Reduction of Time, Cook’s Theorem, Np-Complete Problems.
Reference Books:
1. John E. Hopcroft, Rajeev Motwani, Jeffrey D.Ullman, “Introduction to Automata Theory, Languages and Computation”, 3rd Edition, Pearson Education, 2011.
2. John C Martin, “Introduction to Languages and Automata Theory”, 3rd Edition, Tata McGraw-Hill, 2007.
3. Daniel I.A. Cohen, “Introduction to Computer Theory”, 2nd Edition, John Wiley and Sons, 2009.
4. Thomas A. Sudkamp, “An Introduction to the Theory of Computer Science, Languages and Machines”, 3rd Edition, Pearson Education, 2006.

MSC103T: ADVANCED DATABASES
Total Teaching Hours : 52 No of Hours / Week : 04
UNIT – I [ 12 Hours ]
Database Concepts: Characteristics of Database Approach – Data Models – Schemas- Three Schema Architecture and Data Independence; Database Design: ER Modelling – ER diagrams; Normalization; Relational Model and Query Processing
UNIT – II [ 10 Hours ]
TRANSACTION PROCESSING AND CONCURRENCY CONTROL: Definition of Transaction and ACID properties;. Concurrency Control Techniques : Lock based Concurrency control -Optimistic Concurrency Control – Timestamp based Concurrency Control, Deadlocks ; Database Security: Security Issues – Control Measures-

Discretionary, mandatory and role based access control; Database Recovery Techniques: Recovery Concepts- Deferred Update and Immediate Update techniques – Shadow Paging – ARIES – Database backup and recovery
UNIT – III [ 10 Hours ]
OBJECT ORIENTED, PARALLEL AND DISTRIBUTED DATABASES: Concept of Object Database: Object Definition Language ODL- Object Query Language; Object Database conceptual Design : Difference between ODB and RDB. Database System Architectures: Centralized and Client-Server Architectures - Parallel Systems- Distributed Systems ;
UNIT – IV [ 10 Hours ]
Parallel Databases: I/O Parallelism – Inter and Intra Query Parallelism – Inter and Intra operation Parallelism – Design of Parallel Systems ;
Distributed Database Concepts - Distributed Data Storage – Distributed Transactions – Commit Protocols – Concurrency Control – Distributed Query Processing.
UNIT – V [ 10 Hours ]
EMERGING DATABASE TECHNOLOGIES: Multimedia Databases ; Spatial Databases ; XML and Web Databases ; Mobile Databases: Location and Handoff Management - Effect of Mobility on Data Management -Location Dependent Data Distribution - Mobile Transaction Models -Concurrency Control -Transaction Commit Protocols; Data Warehousing Data Mining; Text Mining.
Reference Books:
1. R. Elmasri, S.B. Navathe, “Fundamentals of Database Systems”, Fifth Edition, Pearson Education/Addison Wesley, 2008.
2. Henry F Korth, Abraham Silberschatz, S. Sudharshan, “Database System Concepts”, Sixth Edition, McGraw Hill, 2011.
3. C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database Systems”, Eighth Edition, Pearson Education, 2006.

MSC104T: ADVANCED COMPUTER ARCHITECTURE
Total Teaching Hours : 52 No of Hours / Week : 04
UNIT – I [ 12 Hours ]
Fundamentals of Computer design: Instruction set principles and examples- classifying instruction set - memory addressing- type and size of operands - addressing modes for signal processing-operations in the instruction set- instructions for control flow- encoding an instruction set. Overview of Parallel Processing and Pipelining Processing Necessity of high performance, Constraints of conventional architecture, Parallelism in uniprocessor system, Evolution of parallel processors, Architectural Classification, Applications of parallel processing
UNIT – II [ 10 Hours ]
Parallel Computer methods: Multiprocessor and multi computers – Shared-Memory multiprocessors, Distributed-Memory Multiprocessors. Multi-vector and SIMD computers. PRAM and VLSI models - Architectural development tracks - Multiple-Processor Tracks, Multi-vector and SIMD Tracks, Multi-threaded and Dataflow Tracks. Program and Network properties: Conditions of parallelism - Program partitioning and scheduling - Program flow mechanism - System interconnect architecture. Principles of Scalable Performance: Performance metrics and measures - Speedup performance laws - Scalability analysis and approaches
UNIT – III [ 10 Hours ]
Processors and Memory Hierarchy: Advanced processor technology - Super scalar and vector processors - Memory hierarchy technology - Virtual memory technology. Bus,

Cache and Shared Memory: Bus System-Cache memory organizations-Shared memory organization-Sequential and weak consistency models.
UNIT – IV [ 10 Hours ]
Instruction level Parallelism & Data Parallel Architectures: Instruction level parallelism (ILP)- over coming data hazards- reducing branch costs –high performance instruction delivery- hardware based speculation- limitation of ILP - ILP software approach- compiler techniques- static branch protection- VLIW approach- H.W support for more ILP at compile time- H.W verses S.W solutions - SIMD Architectures – Associative and Neural Architectures – Data-Parallel Pipelined and Systolic Architectures – Vector Architectures
UNIT – V [ 10 Hours ]
Multiprocessors and Thread level parallelism: Multi-threaded Architectures, Distributed Memory MIMD Architectures, Shared Memory Architectures. Architecture of Multi-threaded processors, Latency hiding techniques, Principles of multithreading, Issues and solutions. Synchronization and Multiprocessing modes – Shared-Variable program structures, Message Passing program development, Mapping programs onto Multicomputers.
Reference Books:
1. Dezso Sima, Terence Fountain, Peter Kacsuk, “Advanced Computer Architectures – A Design Space approach”, Pearson Education, 2009
2. Kai Hwang, “Advanced Computer Architecture – Parallelism, Scalability, Programmability”, Tata McGraw-Hill, 2008.
3. John L. Hennessey and David A. Patterson, “Computer architecture – A quantitative approach”, Morgan Kaufmann / Elsevier Publishers, 5th Edition

MSC105P: FILE STRUCTURES LAB
1. Write a C++ Program to read series of names, one per line, from standard input and write these names spelled in reverse order to the standard output using I/O redirection and pipes. Repeat the exercise using an input file specified by the user instead of the standard input and using an output file specified by the user instead of the standard output.
2. Write a C++ program to read and write student object with fixed length records and the fields delimited by “|”. Implement pack(), unpack(), modify(), and search() methods.
3. Write a C++ program to read and write student objects with Variable-Length records using any suitable record structure. Implement pack(), unpack(), modify(), and search() methods.
4. Write a C++ program to read and write student objects with Variable-Length records using any suitable record structure and to read from this file a student record using RRN.
5. Write a C++ program to implement simple index on primary key for a file of student objects. Implement add(), search(), delete() using the index.
6. Write a C++ program to implement index on secondary key, the name, for a file of student objects. Implement add(), search(), delete() using the secondary index.
7. Write a C++ program to read two lists of names and then match the names in the two lists using sequential Match based on a single loop. Output the names common to both the lists.
8. Write a C++ program to read k Lists of names and merge them using k-way merge algorithm with k = 8.

Contact detail;
Bangalore University
Jnana Bharathi Campus Off Mysore Road,
Bengaluru, Karnataka 560056

Map;
[MAP]Bangalore University[/MAP]
For more detail about this course and rest of the syllabus here I am attaching pdf file which is free for download..