Friday 5 October 2012

Syllabus of MSc Computer Science CENTRE FOR DISTANCE EDUCATION ACHARYA NAGARJUNA UNIVERSITY, ANU

Syllabus of MSc Computer Science (ANU) ACHARYA NAGARJUNA UNIVERSITY
 Name of the Course     :  M.Sc. (Computer Science)
 Duration                                   :  2 years
 Eligibility: Any Degree with computer science or Computer Applications as one of the subjects or BCA or B.Sc. (IT) or any degree with One year PGDCA or any PG Degree with one year PGDCA.
 Medium of instruction: English only



CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
FIRST YEAR SYLLABUS

Paper – 1: DATA STRUCTURES
UNIT I
Introduction and Overview: - Definitions, Concept of Data Structures, Overview of Data Structures, Implementation of Data Structures.

Arrays: - Definition, Terminology,

One-dimensional Arrays: - Memory Allocation for an Array, Operations on Arrays, Application of Arrays.
                                                                                                                                
Linked Lists: - Definition, Single Linked List, Circular Linked List, Double Linked Lists, Circular Double Linked List.

Application of Linked Lists: -
Sparse Matrix Manipulation, Polynomial Representation.

Stacks: - Introduction, Definition, Representation of Stack, Operation on Stacks.

Application of Stack: - Evaluation of Arithmetic Expressions, Implementation of Recursion, Factorial Calculation, Quick Sort.

Queues: - Introduction, Definition.

Representation of Queues: - Representation of Queue using Array, Representation of Queue using Liked List.

Various Queue Structures: - Circular Queue, Deque, Priority Queue.

Application of Queues: - Simulation, CPU Scheduling in Multiprogramming Environment, Round Robin Algorithm.  

Hash Tables: - Hashing Techniques, Collision Resolution Techniques" Closed Hashing, Open Hashing.

UNIT - II
            Basic Technologies.

Definition and Concepts: - Binary Trees, Properties of Binary Tree.

Representation of Binary Tree:- Linear Representation of a Binary Tree, Linked Representation of Binary Tree, Physical Implementation of Binary Tree in Memory.

Operations of Binary Tree: - Insertion, Deletion, Traversals, Merging of Two Binary Trees.

Types of Binary Trees: - Expression Tree, Binary Search Tree, Heap Trees, Threaded
Binary Trees, Height Balanced Binary Tree.

Tree and Forests: - Representation of Trees.

B Trees: - B Tree Indexing, Operations on a B Tree.

Unit - III
Simple sorting algorithm, Shell sort, Heap sort, Quick Sort, Sorting large objects, Bucket sort and External sorting.

UNIT - IV - Graphs
Introduction, Graph Terminologies.

Representation of Graphs: - Linked Representation, Matrix Representation.

Application of Graph Structures: - Shortest Path Problem, Topological Sorting, Minimum Spanning Trees, Connectivity in Graph, Euler's and Hamiltonian Circuts.

Text Books:
1.Classic Data Structures - D SAMANTA PHI Chapters 1 to 8
2.Mark Allen Weiss, Data Structures and Algorithm Analysis In C++, 1999, Addison Wesley Chapters 7

Reference Book:
Sartaj Sahni, Data Structures, Algorithm and Application In C++, 1998, McGraw-Hili.



CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
FIRST YEAR SYLLABUS

Paper – 2: OBJECT ORIENTED PROGRAMMING
UNIT - I
Introduction to computer & C++
Control Structures
Functions
Arrays

UNIT - II
Pointers and Strings
Classes and Data Abstraction.
Classes Part II

UNIT - III
Operator Overloading
Inheritance
Virtual Functions & Polymorphism.

UNIT - IV
C++ Stream Input/Output
Templates
Exception Handling
File Processing
Text Book                                                                                                                 
1. Dietel & Dietel, C++ How to Program, Third Edition, ,Pearson Education.

Reference Books:
1.K.R. Venugopal, Rajkumar, T.Ravlshankar,Mastering C++, Tata McGraw-Hili ..
2.Herbort Schildt, Teach yourself C++,'Tata McGraw-Hili, 3rd -Edition




CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
FIRST YEAR SYLLABUS

Paper – 3: Computer organization
Unit - I
Digital logic circuits
Logic gates, Boolean algebra, Map simplification, Combinational logic circuits, Flip flops, Sequential logic Circuits.
Digital Components
Integrated circuits, Decoders, Multiplexers, Registers, Shift registers, Binary Counters, Memory unit
Data Representation:
Data types, Complements, Fixed & Floating point representation, Other binary codes, Error Detection codes

UNIT II
Register Transfer and micro operations
Register transfer language, Register transfer, Bus and Memory transfers. Arithmetic micro operations, Logical micro operations, shift micro operations. Arithmetic Logic shift unit
Basic Computer Organization and Design
Instruction Codes, Computer Registers, Computer Instructions, Timing and Control. Instruction Cycle, Memory Reference Instructions, Input-output and Interrupt

UNIT III
Microprogrammed Control
Control Memory, Address Sequencing, Micropr.ogram example, Design of contrQl unit.
Central Processing Vnit, Genera1 Register Organization, Stack Organization, In~truetion format, Addressing modes, Data Transfer and Manipulation, Program Control

UNIT IV
Computer Arithmetic
introduction, Addition and Subtraction, Multiplication Algorithms, Division Algorithms, Floating-Point Arithmetic Operations, Decimal Arithmetic Unit, Decimal Arithmetic Operations.
Input-Output Organization:
Peripheral Devices, Input Output Interface, asynchronous Data Transfer, Modes of Transfers, Priority Interrupt.
Memory Organization:
Memory Hierarchy, Main memory, Auxiliary Memory, Associative memory, Cache memory.

TextBook:
Computer System Architecture , Morris Mano 3rd Edition.
Reference .Books:
1.lDhn P.Hayes, Computer Architecture and Organization, 2nd edition, McGra-hill
2.Hamacher, Computer Organization, 3rd ed, McGraw-Hili
3.Stallings, computer Origination and Architecture, Designing for performance,
   4th edition, PHI



CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
FIRST YEAR SYLLABUS

Paper – 4: DISCRETE MATH EMATICAL STRUCTURES
UNIT -I
Mathematical Logic: Connectives, Well formed Formulas, Truth Tables, tautology, Equivalence, Implication, Normal forms, Predicates, Free & bound variables, Rules of inference, consistency, Proof by contradiction, Automatic theorem, Proving.

UNIT - II        
Set Theory: Properties of binary Relations, Equivalence, Compatibility & Partial ordering relations, Hasse Diagram, functions, Inverse function, composition of functions, Recursive functions

UNIT - III
Algebraic Structures
Semi groups and Monoids, Groups, Homomorphism, group codes.
Lattices and Boolean Algebra introduction - lattices as partially ordered set, Boolean Algebra and Boolean functions    

UNIT- IV
Graph Theory
Introduction - Basic concepts of graph theory, Isomorphism's and subgraphs, connected components, cyclic graph, Bipartite graph, planar graphs, eulers formula, euler's circuits, de bruijin sequence, hamiltonian graphs, chromatic numbers, cut set, tie set, the four-color problem

Textbooks'
1.J.P.Tremblay & R.Manohar Discrete Mathematical Structures with Applications to
   computer science - McGraw-Hill
2.Joe L.Mott, Abraham Kande, Theodore P. Baker Discrete Mathematics for computer 
   scientists and Mathematicians - PHI

Reference:
1.Discrete Mathematics for Computer Scientists - JK Truss
2.Inroduction to Graph Theory - R.J.Willson 4th ED, Pearson Education
3.Discrete Mathematics - L.S.Levi
4.Discrete mathematical Structures - Kolman & Busy & Ross - PHI



CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
FIRST YEAR SYLLABUS

Paper – 5: SOFTWARE ENGINEERING
Unit I
The Product
The Process
Software Process and Project Metrics
Software Quality Assurance
Unit - II
Analysis Concepts and Principles
Analysis Modeling
Design Concepts and Principles
Unit - III
Architectural Design
User Interface Design

Unit - IV
Software Testing Techniques
Software Testing Strategies

Text Book:
Software Engineering - A practitioner's Approach - Fifth edition - Roger S.Pressman
- McGraw Hill                                                                                       

Reference Books:
1.     Software Engineering - Lan Somerville - Fifth Edition - Addition Wesley
2.     Software Engineering Concepts - Richard- E.Fairley - McGraw Hill



CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
FIRST YEAR SYLLABUS

Paper – 6: DISTRIBUTED OPERATING SYSTEM
Unit I
Introduction to Distributed Systems:
What is a Distributed System, goals, Hardware Concepts, Software Concepts, Design Isuues.

Communication in Distributed Systems:
Layered Protocols, Asynchronous Transfer Mode Networks, Client-Server Model, Remote Procedure Call.

Unit II
Synchronization in Distributed Systems:
Clock Synchronozation; Mutual Exculsion, Election Algorithms, Atomjc Transactions, Deadlock in Distributed Systems.

Unit III
Processes and Processors:
Threads, System Models, Processor Allocation, Scheduling in Distributed Systems, Fault Toleranace.

Unit IV
Distributed file Systems:
Distributed File System Design, Distributed file System Implementation, Trends in Distributed File Systems.

Distributed Shared Memory:
         Introduction, What is shared memory, Consistency Models Page - Based  Distributed Shared Memory.

Text Book:
Tanenbaum A.S - Distributed operating systems, pearson education Asia (2001)

Reference:                                                                                        
George Coulouris, Jean Dol!imore, Tim Kindberg – Distributed Systems concepts and Design - pearson Education Asia - III edition
Singhal M.Shivarathi N.G - Advance concepts in operation systems McGraw HiII,2001




CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
FIRST YEAR SYLLABUS

Paper – 7: database management systems
Unit - I
1. Introduction
Database Applications, Database systems versus File Systems, view of data, data models, database languages, Database users, & Administrators, Transaction Management, Database System structure, History of database systems.

2. Entity-Relationship model
Basic concepts, constraints, keys, design issues, E-R diagram, Weak entity sets, extended E-R features, design of an E-R Database schema, reduction of an E- R schema to tables.      

3. Relational Model
Structure of relational databases, Relational Algebra, Modification of the database, Extended Relational Algebra Operations, Views.

UNIT -II
4.SQL
Background, Basic structure, set operations, aggregate Functions, null values, Nested sub queries, views, complex queries, modification of the database, joined relations, data definition language, Embedded SQL & other SQL features.

5. Integrity and Security
Domain constraints, Referential integrity, Assertions, triggers, security & authorization in SQL, Encryption.

Unit - III
6. Storage and File Structure
Overview of physical storage media, Magnetic disks, RAID, storage access, file organization, data dictionary storage.

7. Indexing and Hashing                                                     
Basic Concepts, ordered indices, B+ tree index files, B-tree index files, static hashing, dynamic hashing, compression of ordered indexing & hashing, index definition in SQL, Multiple key Access.

8. Relational database design                                                    
First Normal form, pitfalls in relational database design, functional dependencies, Decomposition, Desirable properties of decomposition, 8oyce-codd Normal form, Third normal form, Fourth normal form, more normal forms, overall database design process.  





UNIT - IV
9. Transactions
Transaction Concept, T'1'nsaction State, Implementation of atomicity :and durability, concurrent executions, Serializability, recoverability, Implementation of Isolation, Transaction Definition in SQL, Testing for serializability.

10. Concurrency Control
Lock-based protocols, Timestamp-based protocols, validation based protocols, multiple granularity, Deadlock handling, Concurrency in Index Structure.

11. Example of Relational Database Management Systems: ORACLE

Text Book:
Silberschatz, korth, sudarshan - Database system concepts - McGrawHill - 4th edition

Reference:
Fundamentals Of Database Systems - Elmasri & Navathe.
Database management systems - Raghu Rama Krishnan, McGraw-Hill
Database Management Systems - C.J.Date
Oracle DBA Certification Exam Guide - Jason S. Couceman Tata McGraw Hill Edition 99.




CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
FIRST YEAR SYLLABUS

Paper- 8: THEORY of AUTOMATA AND FORMAL LANGUAGES
Unit I
Strings, Alphabet, language, Operations, Finite state machine, definitions, finite automation model, acceptance of strings and languages, non-deterministic automation, deterministic finite automation, equivalence between NFA and OFA, conversion of NFA into DFA, minimization of FSM, equivalence between two FSM's, Moore and Melay machines.

UNIT II
Regular sets, regular expressions, identity rules, manipulation of regular expressions, equivalence between RE and FA, inter conversion, pumping lemma, closure properties of regular sets, regular grammars, right linear and left linear grammars, equivalence between regular linear grammar and FA, inter conversion between RE and RG.

UNIT III
Context free grammar, derivation trees, chomsky normal form, Greibach normal form, Pushdown automata, definition, acceptance of CFL, equivalence of CFL and PDA, interconversion, enumeration of properties of CFL(proofs omitted).

UNIT IV
Turing machine, definition, desing of TM, computable functions, recursive enumerable language, church's hypothesis, counter machine, Types of TM's(proofs not required),Chomsky hierarchy of languages, liner bounded automata and context sensitive language, Introduction to DCFL and DPDA,LR(O) grammar, decidability, problems, universal Truing machine.

Text Book:
Introduction to Automata Theory, Languages, and Computation - John E. Hoperoft, Jefferey D.Ullman - Pearson Educational Asia.

Reference Books:
Krishna Murthy E.V "Introduction to Theory of computer science" Affliate Easte West Press.
Lewis H.P & Papadimition C.H "Elements of Theory of Computation" Prentice Hall. An Introduction to formal languages and automata(2nd Edition) - Peter linz - ­Jones and Bartlett publishers.




CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
FIRST YEAR SYLLABUS

Paper – 9: COMPUTER NETWORKS
UNIT I
Computer Networks and Internet
What is the Internet, What is a Protocol, the Network edge, The Network Core, Access Networks and Physical Media, Delay and Loss in Packet-Switched Networks, Protocol Layers and their Service Models, Internet Backbone, NAPs and ISPs.

Application Layer
Principles of Application Layer Protocols, The World Wide Web: HTTP, File Transfer: FTP, Electronic Mail in the Internet.

UNIT II
Transport Layer
Transport-Layer Services and Principles, Multiplexing and Demultiplexing Applications, Connection less Transport: UDP, Principles of Reliable Data Transfer, Connection-Oriented Transport: TCP.

UNIT III
Network Layer and Routing
Introduction and Network Service Models, Routing Principles, Hierarchical Routing, Internet Protocol, Routing in the Internet, Ipv6.

UNIT IV
Link Layer. Local Area Networks
The Data Link Layer: Introduction, Services, Error Detection and Correction Techniques, Multiple Access Protocols and LANs, LAN Address and ARP, Ethernet, Hubs, Bridges, and Switches, IEEE 802.11 LANs, PPP: The Point-to-Point Protocol.

Text Book
Computer Networking - A top-down approach featuring the Internet - kurose and Ross - 2002, pearson

Reference Book
Computer Networks - Tenenbaum - 4th edition, PHI



CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
FIRST YEAR SYLLABUS
Paper – 10: DESIGN & ANALYSIS OF ALGORITHMS

UNIT I
Introduction to Computer Algorithms
Elementary Data Structures

UNIT -II
Divide - And - Conquer
The Greedy Method

UNIT -III
Dynamic Programming
Basic Traversal and Search Techniques

UNIT IV
Backtracking
Branch and Bound

TextBook:
1.      Horowitz E, Sahni S et all - Fundamental of Computer Algorithms, Galgotia (2001)

Reference Books:

1.     Bases S. & Gelder A.V - computer Algorithms, Addision Wesley(200)
2.     Cormen TH et al - Introduction to Algorithms, PHI(2001)
3.     Brassard & Bralley - Fundamentals of Algorithms, PHI(2001)



CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
SECOND YEAR SYLLABUS
Paper – 1: USER INTERFACE DESIGN
UNIT-I
Human Factors of Interactive Software; Theories, Principles, and Guidelines; Managing Design Processes;
Unit II
Expert reviews, Usability Testing, surveys and continuing Assessments, Software Tools, Interaction devices, Response time & display rate.
UNIT-III
MFC and Windows, MFC Fundamentals, Processing Messages, Message Boxes and Menus.
UNIT -IV
Introduction Dialog Boxes, More Controls, Working with Icons and Bitmaps, Introducing Common Controls.

Text Books:
1.     Ben Shneiderman, Designing the User Interface 3rd Edition, pearson Education Asia, 1998.
2.     Schildt H: MFC Programming form the Ground Up, TMH(2nd Edition)

Reference Books:
1.     Alan Cooper, The essentials of user interface design, Comdex Computer Publishers, IDG Books India, 2nd Edition.
2.     Leineeker & Archer; Visual C++6 programming Bible, IDG Books(2002)



CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
SECOND YEAR SYLLABUS
Paper – 2: COMPUTER GRAPHICS
UNIT -I
Introduction - Nature & types of computer graphics, features of computer graphics, computer aided             design, entertainment, visualization, image processing, graphical user interfaces
Overview of Graphics Systems - Video Display Devices, Refresh Cathode Ray tubes, Raster scan displays, Random scan displays, color CRT monitors, Raster scan systems, random scan systems, graphics monitors and workstations, input devices, hard copy devices, graphics software
Output Primitives and Attributes - Points and lines, Line Drawing algorithms - DDA, Bresenhams, Circle generating algorithm, ellipse generating algorithm, pixel addressing, filled area primitives - inside - outside tests, boundary fill, flood fill, scan line polygon fill algorithm, character generation, antialiasing

Unit -II
Two Dimensional Geometric Transformations and Viewing - Basic transformations, matrix representation and homogeneous coordinates, composite transformations, other transformations, viewing pipeline, window to viewport coordinate transformation, clipping operations, line clipping - cohen sutherland line clipping, polygon clipping - sutherland hodgeman polygon clipping

Unit - III
Graphical User Interfaces & Interactive Input Methods - Input of graphical data, logical classification of input devices, input functions, input modes, interactive picture construction techniques.
3D Concepts and Object Representations:- 3D display methods, parallel projection, perspective projection, visible line and surface identification, polygon surfaces.

UNIT -IV
3D Geometric & Modeling transformations:- Translation, Rotation, Scaling, Other Transformations, Composite transformations, Modelling & coordinate transformations, parallel projection, perspective projection.
Visible surface detection methods - Classification of visible surface detection methods, Backface detection, Depth buffer method, Scanline method, Depth sorting method, Area subdivison method.

TextBook:
Donald Hearn & Pauline M.Baker - Computer Graphics - 2nd Edition-PHI
Reference Book:
Foley, Van Dam, Feiner and Hughes, Computer Graphics, Principles and Practice ­3rd Edition, 1999
N.Krishnamurthy - Introduction to Computer Graphics



CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
SECOND YEAR SYLLABUS
Paper – 3 : OBJECT ORIENTED ANALYSIS & DESIGN
UNIT-I:
Introduction - Modeling Concepts - Object Modeling - Advanced Object Modeling

UNIT-II
Dynamic Modeling - Functional Modeling

UNIT-III
Methodology Preview
Analysis-System Design -Object Design
Methodology Summary-Comparisions of Methodologies

UNIT-IV
From the Design of Implemention
 Programming Style
Objected Oriented Languages
Non-Object-Oriented Languages
Text Books:
1. Object Oriented Modeling & Design Ram baugh
References:
1.      Unify Methods for Object Oriented Development Booch & Ram baugh
2.      Object oriented Analysis and Design(2nd Ed.) Grady Bouch -Benjamin/ Cummeings



CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
SECOND YEAR SYLLABUS

Paper – 4 (A): ADVANCED COMPUTER ARCHITECTURE
UNIT I
Evolution of computer systems, parallelism in uniprocessor systems, pipeline computers, array computers, multiprocessor systems, data flow and new concepts, multiplicity of instruction data streams, parallel processing applications
Memory hierarchy, Addressing schemes for main memory, concept of virtual memory, page memory system, characteristics of cache memories, cache memory organizations, characteristics of I/O subsystems
Principles of linear pipelining, classification of pipeline processors, Design of pipelined instruction units, arithmetic pipelines design examples, instruction pre fetch and branch handling, data buffering and bushing structures, characteristics of vector processing.

UNIT II
The space of pipeline computers, Architectures of Star-l00 and TI-ASC, The architecture of AP-120B, The architecture of Cray-l, pipeline chaining and vector loops, the architecture of cyber-205
SIMD array processors, static versus dynamic networks, mesh connected illiac networks, SIMD matrix multiplication, Associative memory organizations The space of SIMD computers, Illiac-IV system architecture, Applications of Illiac-IV, the MPP system architecture, Parallel memory allocation

UNIT III
Functional structures, time shared or common buses, crossbar switch and multi port memories, classification of multiprocessor operating systems, language features to exploit parallelism
Process synchronization mechanisms, system deadlock problems, dimensions of multiple processor managementm classification of parallel algorithms

UNIT IV
The space of multiprocessor systems, the C.mmp multiprocessor system architecture, IBM 370/168 MP, 3033 and 3081, Operating system for IBM multiprocessors, Cray X-Mp System Architecture control flow versus data flow computers, static data flow computers, the systolic array architecture
Prescribed Book:
Wang K. and Briggs F.A, computer Architecture and Parallel Processing, McGRAW-HILL, International Edition 1985 (the course material is selected as suggested by the author in the preface)
Reference:
Hwang K. Advanced Computer Architecture, McGraw-Hili International Edition 1993
Stone H., Introduction to Computer Architecture, Galgotia Richard Y.Kain - Advanced Computer Architecture - A systems Design Approach PHI



CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
SECOND YEAR SYLLABUS

Paper – 4 (B): MICROPROCESSOR AND applications
UNIT I
Introduction: Overview of Microcomputer Systems, Data representation, Address, General Operation of a computer, Microprocessors in Digital System Design. 8086 Architecture: CPU architecture, Internal Operations, Addressing modes, Instruction formats, Instruction executing timings.

UNIT II
Assembler Instruction format, Data transfer instructions, Arithmetic instructions, Branch instructions, Loop instructions, NOP & HLT instructions, Flag manipulation instructions, Logical instructions, Shift & Rotate instructions, Directives and operators.

UNIT III
Linking and Relocation, Stacks, Procedures, Interrupt and Interrupt routines I/O programming: programmed I/O, Interrupt I/O, Block transfer and DMA

UNIT IV
Introduction to Multiprogramming: Process management and iRMX 86, Semaphore operations, common procedure sharing, Memory Management, Virtual memory.

Text Book:
YU-cheng Liu Gleen. A. Gibson Microcomputer systems :The 8086/8088 Family. Prentice-Hall of India second edition.

Reference Book:
MicroProcessor and Interfacing Programming and Hardware D.V.Hall, Mc Graw Hall International Edition.



CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
SECOND YEAR SYLLABUS
Paper – 5 (A): CRYPTOGRAPHY & NETWORK SECURITY

UNIT I
Introduction
Conventional Encryption: Classical Techniques Conventional Encryption: Modern Techniques

UNIT II
Confidentiality using conventional encryption public - key cryprography

UNIT III
Message authentification and Hash functions Digital signatures and Authentification Protocols

UNIT IV
Electronic Mail Security IP Security
Fire Walls

Text Book:
Stalling W: Cryptography & Network Security Principles and Practices

Reference Books:
Bruce Schneier - Applied Cryptography - Wiley - second edition Davies & Price: Security for computer Networks, Wilsey (1984)
Mayer & Matyas : A new dimension in computer data . security, wiley(1982)Wilsonbauk M : Cryptography in C & C++
Dreemtech/IDG Books India(2001)



CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
SECOND YEAR SYLLABUS

Paper – 5 (B): TCP/IP
UNIT-I
TCP/IP PROTOCOL
TCP/IP Protocol Suite, Addressing, TCP/IP Versions.
Underlying Technologies
Local Area Networks(LANs), Point-to-Point WANs, Switched WANs.
IP Addresses: Classful Addressing
Introduction, Classful Addressing, Other Issuses, A Sample Internet with Classful Addresses.
Subnetting/Supernetting and Classless Addressing
Subnetting, Supernetting, Classless Addressing.

UNIT-II
Delivery and Routing of IP Packets
Connection-Oriented versus Connection less Services, Direct versus Indirect Delivery, Routing Methods, Static versus Dynamic Routing, Routing Table and Routing Module, Classless Addressing: CIDR.
ARP and RARP
ARP, ARP Package, RARP.
Internet Protocol (IP)
Datagram, Fragmention, Options, Checksum, IP Packeage.
Internet Control Message Protocol
Types of Messages, Message Format, Error Reporting, Query, Checksum, ICMP Package.

UNIT-III
Internet Group Management Protocol (IGMP)
Group Management, IGMP Messages, IGMP Operation, Encapsulation, IGMP Package.
User Datagram Protocol(UDP)
Process-to-Process Communication, user Datagram, Checksum, UDP Operation, use of UDP, UDP Package.
Transmission Control Protocol
Process-to-Process Communication, TCP Services, Numbering Bytes, Flow Control, Silly Window Syndrome, Error Control, TCP Timers, Congestion Control, Segment, Options, Checksum, Connection, State transition diagram, TCP Operation, TCP Package.

UNIT-IV
Unicast Routing Protocols (RIP, OSPF, and BGP) Interior, and exterior Routing, RIP, OSPF, BGP.
Multicasting and Multicast Routing protocols
Introduction, Multicast Routing, Multicast Trees, Multicast Routing Protocols, DVMRP, MOSPF, CBT, PIM, MBONE.
Application Layer and Client-Server Model Client-Server Model, Concurrency, Process.
BOOTP and DHCP
BOOTP, Dynamic host Configuration protocol (DHCP).
Domain Name System (DNS)
Name Space, Domain Name Space, Distribution of Name Space, DNS in the Internet, Resolution, DNS Messages, Types of Records, Compression, Examples, DDNS, Encapsculation.
TELNET and Rlogin
Concept, Network virtual Terminal(NVT), NVT Character set, Embedding, Options, Option Negotiation, Suboption Negotiation, Controlling the Server, Out-of-Band Signaling, Escape character, Mode of Operation, Examples, user interface, Rlogin(remote login), Security issue.

Prescribed Books:
1. Behrouz. A. FOROUZAN TCP/IP Protocol Suite, -Second Edition TMH

Reference Books:
1.      Douglas E.comer / David L.Stevens - "internet Working with TCP/IP Volume - II Design, Implementation, and Internals", Prentice Hall
2.      Gray R.Wright, W.Richard Stevens - TCP/IP Illustrated Volume 2, Addison Weslsy, Pearson Education Asia.



CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
SECOND YEAR SYLLABUS
Paper - 6: DATA WAREHOUSING AND DATA MINING
UNIT I
Warehouse : What is it, who needs it and why? Finding & Building the team
Managing the Data warehousing project Data warehousing design methodologies

UNIT II
Data warehousing development methodologies Data marts and star scheme design
The physical data warehouse
Fundamentals of ETL architecture

UNIT III
Loading the oracle warehouse Oracle warehouse builder Partitioning data
Indexing the warehouse

UNIT IV
OLAP
Data mining
Text Book:
1. Corey, Abbey et all : Oracle 8i Data warehousing TMH(2001)

Reference Book:
1.      Strurm J : Data Warehousing with SQL Server & 0 Technical References PHI(2001)
2.      Anahory S & Murray D : Data Warehousing in the Real Works Pearson Education Asia(2001)
3.      Berry MJA & Linoff GS : Mastering Data Mining, Wiley(2001)



CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
SECOND YEAR SYLLABUS

Paper – 7 (A) : EMBEDDED SYSTEMS
UNIT-I
A first look at embedded systems, Hardware fundamentals for the s/w engineer, advanced hardware fundamentals.

UNIT-II
Interrupts, survey of software architectures.

UNIT-III
Introduction to Real-Time operating systems, More operating system services.

UNIT-IV
Basic design using a Real-Time operating system, Embedded software development tools.

Text Book:
1. An Embedded software Primer - David E Siman - PearsonEducation, Asia.

Reference:
1.    D. Gajski, F.Vahid, S.Narayana, J.Gong - specification and design of Embedded Systems - Prentice Hall.



CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
SECOND YEAR SYLLABUS
Paper – 7 (B):  IMAGE PROCESSING
UNIT I

Introduction, Digital Image Fundamentals: -
What is Digital Image Processing, The origins of Digital Image Processing, Fundamental steps in Digital Image Processing, Components of an Image Processing System, Elements of Visual Perception, Light and the electromagnetic spectrum, Image sensing and acquisition, Image sampling and Quantization ,Some basic relationships between pixels, linear and nonlinear operations.

UNIT II

Image Enhancement in the spatial Domain: -
Background, some basic gray level Transformations, Histogram processing, Enhancement using Arithmetic/logic operations, Basics of Spatial Filtering; Smoothing Spatial filters, Sharpening Spatial filters.

Unit III

Image Compression: -
Fundamentals, Image compression models, Elements of Information Theory, Error-free compression, Image Compression standards.

Unit IV

Image Segmentation: -
Detection of Discontinuities, Edge linking and boundary detection, Thresholding, Region Based Segmentation

Text Book:
Digital Image Processing - Gonzalez and woods 2nd Edition Pearson Education 2002.




CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
SECOND YEAR SYLLABUS

Paper – 8 (A): ARTIFICIAL INTELLIGENCE
UNIT I

What is Artificial Intelligence,
AI Problems, , AI Technique, Defining problem as a state space search, production systems, problem characterstics, production system characterstics.

Heuristic search techniques:
Generation and test - Hill climbing - Best-first search - problem reduction ­constraint satisfaction - means-ends analysis.

UNIT II

Knowledge Representation :
Issues ,using predicate logic, resoulution, forward versus backward reasoning, matching, control knowledge.

Symbolic reasoning under uncertainity:
Introduction to non monotonic reasoning, augmenting a problem solver, implementation of depth first search and breadth first search.

UNIT III
Weak slot-and-filler structures:
semantic nets, frames.
Strong slot-and-filler structures:
conceptual dependency, scripts.

UNIT IV
Natural Language Processing:
Syntatic processing, augmented transition networks, semantic analysis, case grammars.
Common sense: Qualitative physics, commonsense ontologies, memory organization, case based reasoning.
Expert systems - representing using domain knowledge-expert system shell.

TextBook:
Rich E & Knight k : Artificial Intelligence TMH(1991)

Reference Books:
Winston P.H : Artificial Intelligence, Addision Wesley (1993)
Russell & Norvig : Artificial Intelligence A moderen approach, Pearson education Asia
Donald A.waterman A guide to expert systems, pearson education India.



CENTRE FOR DISTANCE EDUCATION
ACHARYA NAGARJUNA UNIVERSITY :: NAGARJUNA NAGAR - 522 510

m.Sc. Computer Science (Course Code: 109)
SECOND YEAR SYLLABUS

Paper – 8 (B): COMPILER DESIGN

UNIT-I
Introduction to compiling, A simple one-pass compiler, Lexical Analysis.

UNIT- II
Syntax Analysis, Syntax-Directed Translation, Type Checking.

UNIT - III
Run-Time Environments, Intermediate Code Generations.

UNIT - IV
Code Generation, Code Optimization.

Text Book:
Compilers-Principles,Techniques & Tools Alfred V. Aho, Ravisethi, Jeffrey D. Ullman Addison-Wisley Publishing company

Reference Books:
Introduction to compiling Techniques by J.P. Bennett McGrawHills-1996
Compiler Writing - Remblay & Sorenson, McGraw Hill
Compiler Construction - Dhamendhere, Macmillan



1 comment: