CS 101 Advanced Computer System Architecture 100 ( ) CS 102 Operating System 100 ( )

Transcription

1 Syllabus for M.Sc. Computer Science Programme Semester I External/ Internal CS 101 Advanced Computer System Architecture 100 ( ) CS 102 Operating System 100 ( ) CS 103 Mathematical Foundation of Computer Science 100 ( ) CS 104 Advanced Database Systems 100 ( ) CS 105 LAB (RDBMS) 100 ( ) CS101 Advanced Computer System Architecture Max. Marks: 75 UNIT I Basic Computer Organization, Memory Organization, Data Representation, Boolean Algebra, Karnaugh Map, Logic Families TTL, ECL and C-MOS Gates. UNIT II Combinational circuits: Half, Full Adder and Subtractor, Decoder, Encoder, Multiplexer, Demultiplexer. Sequential Circuits : Flip Flops (R-S, J-K, D and T), Working, Characteristic Table, Characteristic Equation, State Diagram, Timing Diagram, Excitation Table of Flip Flops, Design of Sequential Circuits, Reduction of States. UNIT III Registers : Shift Registers ( Left Shift and Right Shift ), Bidirectional Shift Registers. Counters : Synchronous and Asynchronous Counters. UNIT IV Instruction Codes, Stored Program Organization, Indirect Address, Computer Registers, Common Bus System, Computer Instructions, Instruction Cycle, Register -Reference Instructions, Memory Reference Instructions, Hardwired and Micro programmed Processor Design, Instruction Formats (0, 1, 2 and 3 addressing), Addressing Modes, RISC and CISC characteristics.

2 UNIT V Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction Pipeline, Input-Output Interface, Asynchronous Data Transfer, Strobe control Handshaking, Modes of Transfer, Priority Interrupt, Priority Encoder, DMA Controller. 1. M.Morris Mano, Computer System Architecture, PHI, New Delhi 2. M.Morris Mano, Digital Logic and Computer Design, PHI, New Delhi 3. B.Ram, Computer Fundamentals : Architecture and Organization, New Age 4. William Stallings, Computer Organization and Architecture, Pearson Education 5. Vrarsie, Zaky and Hamcher, Computer Organization, TMH CS102 Operating System Max. Marks: 75 Definition and type of operating systems, Batch Systems, Multi programming, Time sharing, Parallel and distributed Real time systems, Operating systems structure, Operating system components and services, System calls, System programs, virtual machines. Process Management: Process concept, Process scheduling, Cooperating processes, Threads, Interprocess communication, CPU scheduling criteria, Scheduling algorithms, Multipleprocessor scheduling, Real time scheduling and algorithm evaluation. I Process synchronization and Deadlocks: The critical section problem, Synchronization hardware, Semaphores, Classical problems of synchronization, Critical regions, Deadlock-System model, Deadlock Prevention, Avoidance and Detection, Recovery from deadlock. Banker s algorithm for deadlock handling. Memory Management- Logical and Physical address space, Swapping, Contiguous Allocation, Paging and segmentation, Virtual memory, Demand paging and its performance, page replacement algorithms, Allocation of frames, Thrasing, File Systems, secondary storage

3 structure, Disk scheduling methods, Disk management, Recovery, Disk structure, Disk Scheduling methods, Disk Management, Swap space Management, Disk reliability. Unit V Protection and Security: 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, Program Threats, System Threats, Threat Monitoring, The Unix System : File System, Process Management, Bourne shell, Shell variables, Command Line Programming, Filters and commands : Pr, head, tail, cut, paste, sort, uniq, tr, join etc grep, egrep, fgrep etc. Sed, awk etc. System calls: create, open, close, read, write, isleek, link, unlink, stat, fstat, umask, chmod, exec, fork, wail, system. 1. S. Galvin, Operating System Concepts, AWL 2. A.S. Tanenbaum, Moderning Operating System PHI CS103 Mathematical Foundation of Computer Science Max. Marks: 75 Sets, Representation of Sets, Types of Sets, Operations on Sets, Principle of Duality and Algebra of Sets, Mathematical Induction, Principle of Inclusion-Exclusion. Binary Relation, Properties of Binary Relations, Types of Functions, Composition of Functions, Inverse Function, Pigeonhole Principle. Group, Abelian group, properties of group, Semi Group, Subgroup,Cyclic group, Cosets, Monoid, Homomorphism, Isomorphism, and Automorphism of groups, Partially Ordered Sets(Posets), Hasse Diagrams,Lattices, Properties of Lattices, Lattices as Algebraic Systems, Sublattices, Complete Lattices, Bounded Lattices, Complemented Lattices. I Graphs, Walk, Path, connected graphs, Regular and Bipartite graphs, cycles and circuit. Diameter and center of a graph. Eccentricity of a vertex. Central graphs Planar Graphs. Tree, Rooted Tree, Spanning Tree, Minimal Spanning tree, Kruskal s and Prim s Algorithms. Proposition, First order logic, Basic logical operations, Tautologies, Contradictions, Algebra of Propositions, Logical equivalence, Normal forms, Inference Theory, Predicated and quantifiers.

4 Unit V Languages, operations on languages, Kleen closure, Regular Set, Regular expression, regular language, Phrase structure grammars, Types of grammars, types of languages. Conversion of regular expressionto Finite Automata, NFA, DFA.Moore Machine, Mealy Machine. 1. Seymour Lipschutz, Discrete Mathematics, TMH 2. J.P. Tremblay and R. Manohar, Discrete Mathematical Structure with Application to computer science, TMH 3. H. Rosen, Kenneth, Applied Discrete Structures for computer science, Galgotia Publication. 4. Gersting, Mathematical Structure for Computer Science, WH Freeman and Macmillan 5. C.L.Liu, Elements of Discrete Mathematics, McGraw Hill CS104 Advanced Database Systems Max. Marks: 75 Introduction: An overview of Database systems, Architecture, Schema and Instances, Data Independence and Data Base. Entity-Relationship Diagram, generalization, aggregation and association, Data Models: Hierarchical, Network and Relational. Relational data model concepts, Integrity constraints, keys, Domain Constraints, Referential Integrity, Assertions, Triggers, Foreign key, Relational Algebra, Relational Calculus, Tuple and Domain Calculus. Reduction of Relation Algebra to Relational Calculus, Relation Completeness. I Functional Dependencies, normal forms (1NF, 2NF, 3NF), BCNF, Mulivalued Dependencies,4NF, Join Dependencies and 5NF. Query processing and optimization. Transaction processing concepts. Transaction systems, schedule and recoverability, Testing of serializability, Serializability of schedules, conflicts. Concurrency control techniques: Locking techniques for concurrency control, Time stamping protocols validation techniques, multiple granularity, multiversion schemes.

5 Unit V Distributed database: Distributed data storage, data fragmentation, replication and allocation techniques for distributed database design, recovery in distributed database, protection and security. 1. Elmasri, Navathe, Fundamentals of Database Systems, Pearson Education. 2. Korth, Silbertz, Sudarshan, Database Concepts McGraw Hill 3. C.J. Date, An Introduction to Database Systems Addision Wesley 4. Bipin C. Desai, An Introduction to Database Systems, Galgotia Publication 5. Mazumdar and Bhattacharya, Database Management Systems, TMH 6. Ramakrishnan, Gehrke, Database Management System, McGraw Hill