M.Sc (Computer Science)

Transcription

1 GOVERNMENT ARTS COLLEGE (AUTONOMOUS), SALEM-7. M.Sc (Computer Science) SYLLABUS (Effective from the academic year ) 1

2 S. No. GOVERNMENT ARTS COLLEGE(AUTONOMOUS), SALEM - 7 PG UNDER CBCS M.Sc (Computer Science) Course Code 1 17PCS PCS PCS PCS PCS PCSP1 7 17PCSP2 For the candidates admitted from the academic year Hours Title of the Course to be handled SEMESTER I Core Course I : Discrete Structures Core Course II : Design and Analysis of Algorithms Core Course III : Distributed Operating Systems Core Course IV : Advanced Computer Architecture Principles of Information Security Core Practical - I : Implementation of Algorithms Core Practical - II :DOS and Linux Shell Programming Credits Exam Fees Marks I.A. S.E. TOTAL Total Credits and Marks

3 GOVERNMENT ARTS COLLEGE (AUTONOMOUS), SALEM -7 MASTER OF SCIENCE IN COMPUTER SCIENCE - M. SC (CS) SEMESTER I Core Course I : DISCRETE STRUCTURES Course Code : 17PCS01 A. Objectives It brings out the relation between mathematics and computer science, in the way how it could be applied. The need of discrete structure is how we apply the mathematics in computer science. It will be applied not only in computer science and also how mathematics will be applied in engineering. B. Learning Outcomes Students who successfully complete the course will provide the following outcomes: Have an idea of mathematical logics and how to write principle of conjunctive normal form and disjunctive normal form. It brings the idea of how the functions and relations will be applied in computer science. To know the idea of Lattices and Boolean algebra. It helps to understand the concepts of Language and Grammar. C. Syllabus UNIT I Introduction: Statements and Notations Connectives: Negation Conjunction Disjunction Statement Formulas and Truth Tables Conditional and Bi-Conditional Well Formed Formulas Tautologies Equivalence of Formula Duality law Tautological implications. Normal Forms: Disjunctive Normal Forms Conjunctive Normal Forms Principal Disjunctive Normal Forms Principal Conjunctive Normal Forms. UNIT II Theory of inference for the Statements Calculus The Predicate Calculus: The Statement, function, variables and quantifiers Predicate formula Free and Bound Variables The Universe of discourse. Inference Theory of the Predicate Calculus: Valid Formulas and equivalences Some valid formula involving quantifiers Theory of inference for the predicate calculus Formulas involving more than one quantifiers. 3

4 UNIT III Relations and Functions: Relations and ordering Properties and Binary relations in a Set-Relation Matrix and Graph of a relation Partition and covering of a set Equivalence Relations Compatibility relations Composition of Binary Relations Functions. Definition and Introduction Composition of function Inverse functions Binary and n-nary operations Hashing functions Natural numbers Recursion. UNIT IV Lattices and Boolean Algebra: Lattices as partially ordered sets Some Properties of Lattices Boolean Algebra Boolean Functions. UNIT V Grammars and Languages: Discussion of Grammars Formal Definition of Languages Notions of syntax Analysis Polish Expression and their compilation Simple Precedence Grammars. TEXT BOOK: TREMBLEY J.P AND MANOHAR.R., Discrete Mathematical Structures with Applications to Computer Science, Tata McGraw Hill Publications Co. Ltd., New Delhi REFERENCE BOOKS: 1. KOLMAN, BUSY AND ROSS, Discrete Mathematical Structures, PHI. 2. K.D. JOSHI, Foundations of Discrete Mathematics, Wiley, Eastern Limited. D. Web References: 1. en.wikipedia.org/wiki/ 2. mathworld.wolfram.com 3. wiki.answers.com E. Assignments: Assignments can be given from the following topics: 1. How to write PCNF, PDNF with and without using truth table. 2. Method of writing Polish Expressions and their compilation. 3. Problems to use Recursion and Equivalence. 4

5 GOVERNMENT ARTS COLLEGE (AUTONOMOUS), SALEM -7 MASTER OF SCIENCE IN COMPUTER SCIENCE - M. SC (CS) SEMESTER I Core Course II: DESIGN AND ANALYSIS OF ALGORITHMS Course Code : 17PCS02 A. Objectives To inculcate the ability to analyze the asymptotic performance of algorithms. To introduce rigorous correctness proofs for algorithms. To bring in a familiarity with major algorithms and data structures. To demonstrate important algorithmic design paradigms and methods of analysis. To synthesize efficient algorithms in common engineering design situations. B. Learning Outcomes Students who complete the course will have the ability to Argue the correctness of algorithms using inductive proofs and invariants. Analyze worst-case running times of algorithms using asymptotic analysis. Demonstrate the divide-and-conquer paradigm and explain when an algorithmic design situation calls for it. Discuss the dynamic-programming paradigm and explain when an algorithmic design situation calls for it. Describe the greedy paradigm and explain when an algorithmic design situation calls for it. C. Syllabus UNIT- I Introduction: Algorithm - Algorithm Specification - Performance Analysis - Divide- And-Conquer: General Method - Binary Search - Finding the Maximum and Minimum - Merge Sort- Quick Sort Selection. UNIT II The Greedy Method: The General Method - Knapsack Problem - Job Sequencing with Deadlines Minimum-Cost Spanning Trees Optimal Storage on Tapes Single Source Shortest Paths. 5

6 UNIT- III Dynamic Programming: The General Method- Multistage Graphs All Pairs Shortest Path Single-Source Shortest Paths: General Weights Optimal Binary Search Trees 0/1- Knapsack - The Traveling Salesperson Problem. UNIT -IV Backtracking: The General Method The 8-Queens Problem Some of Subsets Graph Coloring Hamiltonian Cycles - Knapsack Problem. Branch-And -Bound: The Method 0/1 Knapsack Problem Travelling Salesperson. UNIT -V NP-Hard and NP-Complete Problems: Basic Concepts - Cooks 'Theorem - Np-Hard Scheduling Problems - Np Hard Code Generation Problems. TEXT BOOKS 1. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran Fundamentals of Computer Algorithms. [First Edition]. Galgotia Publication Pvt. Ltd. New Delhi REFERENCE BOOKS 1. Anany Levitin, 2005, Introduction to the Design and Analysis of Algorithms. [First Edition] Pearson Education Asia. Beijing. 2. Thomas H Cormen, Charles E Leiserson, Ronald L Rivest and Clifford Stein. 2009, Introduction to Algorithms. [Third Edition]. PHI Pvt. Ltd. New Delhi. 3. Sara Baase and Allen Van Gelder Computer Algorithms Introduction to Design and Analysis [Third Edition], Pearson Education Asia. Beijing. D. Web References g/specializations/algorithms 3. E. Assignments 1. Comparative study on various algorithms associated with the Divide and Conquer and justifications have to be produced in the form of Time and Space Complexities 2. Memory Management Vs Algorithms. 6

7 GOVERNMENT ARTS COLLEGE (AUTONOMOUS), SALEM -7 MASTER OF SCIENCE IN COMPUTER SCIENCE - M.Sc.(C.S) Core Course - III Course Code SEMESTER I : DISTRIBUTED OPERATING SYSTEMS : 17PCS03 A. Objectives To provide deep understanding on Distributed Operating System design and implementation. B. Learning Outcomes Students who have successfully completed this course will have unambiguous understanding of the following concepts: Hardware and software concepts, client server model, Remote Procedure call Distributed clock synchronization Concepts and Algorithms, thread and system models, processor allocation, fault tolerance and shared memory. C. Syllabus UNIT I What is a Distributed System Hardware Concepts Software Concepts Design Issues The Client Server Model. UNIT II Remote Procedure Call Clock Synchronization Mutual Exclusion Election Algorithms Deadlocks in Distributed Systems. UNIT III Threads System Models Processor Allocation Fault Tolerance. UNIT IV Real-Time Distributed systems Distributed File System Design - Distributed File System Implementation -Trends in Distributed File Systems. UNIT V What is Shared Memory Consistency Models Page based Distributed Shared Memory Case Study: MACH. 7

8 TEXT BOOK: 1. Andrew S.Tanenbaum, Distributed Operating Systems, Pearson Education, REFERENCE BOOKS: 1. George coulouris, Jean Dollimore, Tim Kindberg, Distributed Systems Concepts and Design, Third Edition, Pearson Education Asia, Hagit Attiya and Jennifer Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, Wiley, Mukesh Singhal, Advanced Concepts in Operating Systems, McGrawHill Series in Computer Science, A.S.Tanenbaum, M.Van Steen, Distributed Systems, Pearson Education, M.L.Liu, Distributed Computing Principles and Applications, Pearson Addison Wesley, D. Web References E. Assignments 1. Discuss a situation where a proxy can be used. 2. Difference between a local call and a remote call with example. 3. Demonstrate shared memory concept in distributed system. 8

9 GOVERNMENT ARTS COLLEGE (AUTONOMOUS), SALEM -7 MASTER OF SCIENCE IN COMPUTER SCIENCE - M. SC (CS) SEMESTER I Core Course IV: ADVANCED COMPUTER ARCHITECTURE Course Code : 17PCS04 A. Objectives To understand the fundamental knowledge in architecture design, pipelined processor design, and their impacts on performance To inculcate knowledge in types of memory and their hierarchy. To insist the communication and the computing possibilities of Multithreading architecture To develop the foundations for analyzing the benefits of design options in computer architecture. B. Learning Outcomes Students are expected to possess the ability to: Evaluate performance of different computer structures Understand the components and operation of a memory hierarchy and the range of performance issues influencing its design. Know about Principles, Linear Pipelining, Design and Characteristic. C. Syllabus UNIT- I Instruction Level Parallelism: Pipelining Instruction Level Parallelism Hardware and Software Approaches Dependence Dynamic Scheduling Software and Hardware Solution to ILP: Introduction Extracting Parallelism with Hardware Support Performance Issues Branch Prediction Branch Target Buffer The First Intel Pentium. UNIT- II Multiple Instruction Processor: Superscalar Very Long Instruction Word More of Multiple Instruction Issue Processor: Hardware Support for Exposing Parallelism Hardware vs Software Speculation Mechanism The Intel IA-64 Itanium Processor Itanium Limits of Instruction-Level Parallelism. 9

10 UNIT-III Multiprocessors With Shared Memory Architecture: Parallel Processing Parallel Architecture Taxonomy Performance Metrics for Communication Mechanism Advantages of Communication Mechanism Cache Coherence Directory-based Cache Coherence Protocols Synchronization Cache Wire Strategies Cache Performance. UNIT- IV Main Memory and its Performance: Main Memory Virtual Memory Semiconductor RAM ROM I/O Device and their Performance: Introduction Type of Storage Devices Other Storage Device Buses Bus Standards I/O Data Transfer Methods by using Memory Bus Disk Arrays Disk Performance Benchmarks. UNIT V Multi-threading Architecture: Software and Hardware Multithreading Types of Multithreading Transparent Software and Hardware Multithreading Support for Extended Multithreading Multithreading Case Study SMT and CMP Architecture. TEXT BOOK 1. K A Parthasarathy, Advanced Computer Architecture, Third Edition, Vijay Nicole Imprints Private Limited, REFERENCE BOOKS 1. Kai Hwang and Faye A Briggs, Computer Architecture and Parallel Processing, McGraw-Hill International Editions, Kai Hwang, Advanced Computer Architecture, McGraw-Hill International Editions, Michael J Quinn, Parallel Computing Theory and Practice [Second Edition], TMH, D. Web Resources E. Assignment 1. Analyze parallel processing in Industrial scenario. 2. Compare memory mapping techniques. 10

11 GOVERNMENT ARTS COLLEGE (AUTONOMOUS), SALEM -7 MASTER OF SCIENCE IN COMPUTER SCIENCE - M.Sc.(C.S) SEMESTER I Core Course - V : PRINCIPLES OF INFORMATION SECURITY Course Code : 17PCS05 A. Objectives To introduce the importance of Information Security. To inculcate Legal and ethical issues of Information Security To classify various Security Technologies to protect Information against threats. To motivate the Systematic Project Management principles to ensure Security in an organization. B. Learning Outcomes Students who complete the course will have the ability to: Understand the common threats against Information and determine the solutions in the form of security. Incorporate the basic principles and techniques when designing a secure system. Acquire the technologies for protecting information in today's communication era. C. Syllabus UNIT-I Information Security: Introduction The History of Information Security What is Security? Components of an Information System The System Development Life Cycle- The Security System Development Life Cycle. Why Security is needed? : Introduction - Business needs first Threats Attacks Secure Software Development. UNIT-II Professional, Legal, and Ethical issues in Information Security: Introduction Law and Ethics in Information Security- Relevant U.S. Laws International laws and legal bodies Ethics and Information Security Codes of Ethics and Professional Organizations. Managing IT Risk: Introduction An Overview of Risk Management Risk Identification Risk Assessment Risk Control Strategies. 11

12 UNIT III How to Plan for Security: Introduction - Information Security Planning and Governance - Information Security Policy, Standards, and Practices The Information Security Blueprint Security Education, Training, and Awareness Program. Security Technology : Wireless VPNs, and Firewalls : Introduction Access Control Firewalls Protecting Remote Connections. UNIT IV Security Technology: Prevention Systems, Intrusion Detection, and Other Security Tools : Introduction Intrusion Detection and Prevention systems Honeypots, Honeynets, and Padded cell systems Scanning and Analysis Tools Biometric Access Control. Using Encryption : Attacks on Crypto Systems. UNIT-V Implementing Information Security : Introduction Information Security Project Management Technical Aspects of Implementation Nontechnical Aspects of Implementation - Information Systems Security Certification and Accreditation. Maintenance of Information Security and ediscovery : Introduction Digital Forensics. TEXT BOOK: 1. Michael E.Whitman and Herbert J.Mattord Principles of Information Security. [Seventh Impression] Cengage Learning India Private Limited, Delhi. REFERENCE BOOKS: 1. Calabrese Information Security Intelligence: Cryptographic Principles and Applications. [India Edition]. Thomson Delmar Learning Publications. 2. Bhaskar, S.M. and Ahson. S.I Information Security A Practical Approach. Narosa Publishing House, New Delhi. D. Web References E. Assignments 1. Detailed Survey on Major security threats against Information and its consequences. 2. Plan for security by Industries and Institutions. 12

13 GOVERNMENT ARTS COLLEGE (AUTONOMOUS), SALEM -7 MASTER OF SCIENCE IN COMPUTER SCIENCE - M.Sc.(C.S) Core Practical I Practical Code SEMESTER I : IMPLEMENTATION OF ALGORITHMS : 17PCSP1 List of Practical Exercises (Use C language for 1-4 and C++ for 5-10) 1. Write a Program to perform stack operations using Array. 2. Write a Program to perform stack operations using Pointer. 3. Write a Program to perform Queue operations using Array. 4. Write a Program to perform Queue operations using Pointer. 5. Write a program to build a binary tree for the given elements (i.e., integers) and give non-recursive traversal functions: inorder, preorder, postorder. 6. Write a program to perform polynomial addition using linked list. 7. Write a program to perform BFS and DFS. 8. Write a program to perform Quick Sort. 9. Write a Program to perform Shortest path. 10. Write a Program to perform 8 Queen's problem. 13

14 GOVERNMENT ARTS COLLEGE (AUTONOMOUS), SALEM -7 MASTER OF SCIENCE IN COMPUTER SCIENCE - M.Sc.(C.S) Core Practical II Practical Code SEMESTER I : DOS AND UNIX SHELL PROGRAMMING : 17PCSP2 Write Shell Programs to perform the following: 1. Mark list preparation 2. Menu Creation 3. Login Greetings Script 4. Copying files 5. Searching a word in a file 6. Compression techniques 7. Paragraph formatting 8. User Creation 9. Group Creation & Batch File Creation 10. DOS Commands 14