Professional Documents
Culture Documents
Annexure No. 31 G
SCAA Dated 20.02.2008
BHARATHIAR UNIVERSITY, COIMBATORE 641 046
M. Sc COMPUTER SCIENCE (CBCS)
with compulsory Diploma course in Software Quality Assurance
(Effective from the academic Year 2007-2008)
1. Eligibility for Admission to the Course
Candidates for admission to the first year course leading to the Degree of Master of Science
in Computer Science (M. Sc-CS) will be required to possess:
A pass in B. Sc. Computer Science / BCA / B. Sc. Computer Technology /B. Sc.
Information Technology /B. Sc. Software Systems /B. Sc. Degree with Electronics.
2. Duration of the Course
The course shall be offered on a full-time basis. The course will consist of three semesters of
course work and laboratory work and the fourth semester consists of project work. An
additional Diploma course in Software Quality Assurance shall also be offered along with
this M. Sc (Computer Science) course.
3. Regulations
The general Regulations of the Bharathiar University Choice Based Credit System
Programme are applicable to this programme.
4. The Medium of Instruction and Examinations
The medium of instruction and Examinations shall be in English.
5. Submission of Record Notebooks for Practical Examinations & Project Viva-Voce.
Candidates taking the Practical Examinations should submit bonafide Record Note Books
prescribed for the Examinations. Otherwise the candidates will not be permitted to take the
Practical Examinations.
Candidates taking the Project Viva Examination should submit Project Report prescribed for
the Examinations. Otherwise the candidates will not be permitted to take the Project Viva-
voce Examination.
6. Ranking
A candidate who qualifies for the PG Degree Course passing all the Examinations in the first
attempt, within the minimum period prescribed for the Course of Study from the date of
admission to the Course and secures 1st or 2nd Class shall be eligible for ranking and such
ranking will be confined to 10% of the total number of candidates qualified in that particular
subject to a maximum of 10 ranks.
7. Revision of Regulations and Curriculum
The above Regulation and Scheme of Examinations will be in vogue without any change for
a minimum period of three years from the date of approval of the Regulations. The University
may revise /amend/ change the Regulations and Scheme of Examinations, if found necessary.
8. Transitory Provision
Candidates who have undergone the Course of Study prior to the Academic Year 2007-2008
will be permitted to take the Examinations under those Regulations for a period of four years
i.e. up to and inclusive of the Examination of April 2012 thereafter they will be permitted to
take the Examination only under the Regulations in force at that time.
*******
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 2 of 45
Marks
Credits
Sem.
Elective/ Suggested
Title of the Paper
Supportive/ Code L P
Project
Credits
Marks
Elective/ Suggested
Title of the Paper L P
Supportive/ Code
Project
Elective 07CSEEE01 Mathematical Foundations of Computer Science 4 4 100
Elective 07CSEEE02 Image Processing 2 2 4 100
Elective 07CSEEE03 BioInformatics 4 4 100
Elective 07CSEEE04 Artificial Intelligence and Expert Systems 4 4 100
Elective 07CSEEE05 Microprocessor Principles and Design 2 2 4 100
Elective 07CSEEE06 Principles of Programming Languages 4 4 100
Elective 07CSEEE07 Neural Networks and Fuzzy Systems 4 4 100
Elective 07CSEEE08 Mobile Computing 2 2 4 100
Elective 07CSEEE09 TCP/IP 4 4 100
Elective 07CSEEE10 Embedded Systems 2 2 4 100
Elective 07CSEEE11 Genetic Algorithms 2 2 4 100
Elective 07CSEEE12 Programming in C# 2 2 4 100
Elective 07CSEEE13 Mainframe Computing 4 4 100
Elective 07CSEEE14 Cryptography and System Security 4 4 100
Elective 07CSEEE15 Natural Language Processing 2 2 4 100
Elective 07CSEEE16 Virtual Reality 4 4 100
Elective 07CSEEE17 Speech Processing 4 4 100
Elective 07CSEEE18 E-Commerce 3 4 100
Elective 07CSEEE19 Parallel Processing 4 4 100
Elective 07CSEEE20 Distributed Systems 4 4 100
Elective 07CSEEE21 Data Compression 2 2 4 100
Elective 07CSEEE22 Web Services 4 4 100
Reference Books:
1. Kai Hwang, Advanced Computer Architecture, Tata-McGrawHill 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.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 5 of 45
Reference Books :
1. Silberschatz, Galvin, Gagne, Operating Systems Concepts, John Wiley & Sons, Inc.,
Sixth Edition.
2. Andrew S. Tanenbaum, Modern Operating Systems, Prentice Hall of India, Second
Edition.
3. H. M. Deitel, Operating Systems, Pearson Education, Second Edition.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 6 of 45
Subject Description:
This course presents the principles of object oriented concepts and various types of
data structures.
Goals:
To enable the student to learn the object oriented concepts and various types of data
structures.
Objectives:
On successful completion of the course the student should have:
Understood the object oriented concepts and learnt various types of data structures
and their function.
Contents:
Unit - I
Object Oriented Concepts: Introduction Classes and 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.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 7 of 45
Contents:
Unit - I
A Survey of Computer Graphics Overview of Graphics Systems. Output Primitives: Points
and Lines, DDA, Bresenhams Algorithms - Properties of Circles and Ellipse Pixel
Addressing.
Unit - II
Two Dimensional Geometric Transformations: Basic Transformations Matrix
Representations - Composite Transformations. Two Dimensional Viewing: Line Clipping
Polygon Clipping Curve Clipping Text Clipping.
Unit - III
Three-Dimensional Concepts
Three Dimensional object Representations: Polygon Surfaces Curved Lines and Surfaces
Quadric Surfaces Super Quadric - Blobby Objects Spline Representations Cubic Spline
Interpolation - B-Spline Curves and Surfaces Fractal Geometry Methods Classification
Dimension Uniform B-Spline.
Unit - IV
Three Dimensional Geometric and Modeling Transformations: Translation Rotation
Scaling. Three Dimensional Viewing: Viewing Pipeline Viewing Co-ordinates
Projections Clipping.
Unit - V
VisibleSurface Detection Methods: Classification of Visible Surface Detection Algorithms
Back Face Detection - Depth-Buffer Method - A-Buffer Method. Illumination Models and
Surface-Rendering Methods: Basic Illumination Models Polygon Rendering Methods.
Color Models and Color Applications: RGB YIQ CMY HSV. Computer Animation:
Animation Sequences - Animation Functions Morphing.
Reference Books:
1. Donald Hearn and M. Pauline Baker, Computer Graphics C Version, Prentice Hall
of India, Second Edition.
2. Jones D.Foley, Andries Van Dan, Stevan K. Feiner and John F. Hughes, Computer
Graphics Principles and Practices in C, Second Edition.
3. Steven Harrington, Computer Graphics, A Programming Approach, McGraw Hill,
Second Edition.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 8 of 45
Subject Description:
This course presents the fundamentals of object oriented programming with Java.
Goals:
To enable the student to learn the programming concepts in java.
Objectives:
On successful completion of the course the student should have:
Understood programming concepts in java.
Contents:
Unit - I
Object Oriented Fundamentals and Java Revolution: Object Oriented Programming
Encapsulation Inheritance Polymorphism Java Genesis Characteristics. Java
Programming Techniques : Reserved Words Identifiers Literals Operators Separators
Variables Data Types - Arrays Operator Precedence - IfElse Statement Break
Statement Switch Statement Return Statement Looping While Statement Do-While
Statement - For Statement Continue Statement.
Unit - II
Classes and Objects : Classes Declaration Object References InstanceVariables - New
Operator Method Declaration Method Calling This Operator Constructors Method
Overloading Inheritance Super Class Dynamic Method Dispatch Final , Static and
Abstract Classes.
Unit - III
Packages and Interfaces : Packages The Package Statement Import Statement Interface
Statement Implements Statement - Constructors String Creation String Concatenation
Character Extraction. Exception Handling: Exception Handling Fundamentals Types
Uncaught Exceptions Nested By Statements User Defined Exceptions.
Unit - IV
Multithreading: Java Threads Model Priorities Synchronization Unable The
Synchronized statement Deadlock Thread API Summary. Utilities: Simple Type
Wrappers - Dictionary Class Hash Tables String Tokenizer Runtime System Class
Comparison Input and Output File Directory Filename Filters File Streams.
Unit - V
Abstract Window Toolkit : AWT- Labels Buttons - Text Fields - Text Areas Check Boxes
Choices Lists - Layout Managers Applets HTML Applet Tag Order of Applet
Initialization Sizing Graphics Simple Graphics Methods Draw Line Draw Arc Font
Manipulation Simple Image Loader Image Observer Summary. Applet Handling Events
: Events - Types of Events Event Methodology Action Events Adjustment Events
Focus Events Item Events Keyboard Events - Mouse Events Mouse Motion Events
Window Events.
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.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 9 of 45
Reference Books:
Reference Books:
Reference Books:
Subject Description:
This course presents the introduction to computer networks.
Goals:
To enable the student to familiar of each layers and its functions in the network
Objectives:
On successful completion of the course the student should have:
Understood computer network and its layers.
Contents:
Unit - I
Introduction: Use of Computer Networks Network Hardware Network Software-
Reference Models Example of Networks. The Physical Layer: The Theoretical Basis for
Data Communication - Guided Transmission Media Wireless Transmission
Communication Satellites The Public Switched Telephone Network.
Unit - II
Data Link Layer: Data Link Layer Design Issues Error Detection and Correction
Elementary Data Link Protocols Sliding Window Protocols. Medium Access Control
Sublayer: The Channel Allocation Problem - Multiple Access Protocols - Wireless LANs
Bluetooth.
Unit - III
Network Layer: Network Layer Design Issues Routing Algorithms Congestion Control
Algorithms Quality of Service Internetworking.
Unit - IV
Transport Layer: The Transport Service Elements of Transport Protocol A Simple
Transport Protocol. The Internet Transport Protocols: UDP TCP Performance Issues.
Unit - V
Application Layer: Domain Name System - Electronic Mail - World Wide Web. Network
Security: Cryptography - Symmetric-Key Algorithms - Public Key Algorithms - Digital
Signatures - Communication Security - E-Mail Security.
Reference Books:
Subject Description:
This course presents the introduction to visual programming.
Goals:
To enable the student to be familiar with visual programming concepts.
Objectives:
On successful completion of the course the student should have:
Understood basics in ASP.NET.
Learnt advances issues in E-mail.
Contents:
Unit - I
ASP.NET Basics: Introduction to .NET Framework - Building Forms with Web Controls -
Rich Web Controls - Custom Controls.
Unit - II
ASP.NET Database Programming: Introducing ADO.NET - Using SQL Server with
ASP.NET.
Unit - III
Advanced Issues: E-Mail - Application Issues - Working with IIS and Page Directives.
Unit - IV
Advanced ASP.NET: Application Configuration - Developing Business Objects and Building
HTTP Handlers.
Unit - V
Building Web Services: Building, Creating, Testing and Debugging the Web services -
Finding Web services.
Reference Books:
1. Mridula Pariharetal, ASP.NET Bible, IDG Books INDIA, First edition 2002.
2. Greg Buczek, ASP.NET Developers Guide, Tata McGraw-Hill Edition 2002.
3. Dave Mercer, ASP.NET A Beginners Guide, Tata McGraw Hill Edition 2002.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 14 of 45
Reference Books:
1. Bob Hughes and Mike Cotterell, Software Project Management, Mc Graw Hill,
Second Edition.
2. Walker Royce, Software Project Management, Addition Wesley.
3. Derrel Ince, H. Sharp and M. Woodman, Introduction to Software Project
Management and Quality Assurance, Tata Mc Graw Hill, 1995.
Reference Books:
1. Sam Anahory and Dennis Murray, Data Warehousing in the Real World, Pearson
Education.
2. Margaret H. Dunham, Data Mining Introductory and Advanced Topics, Pearson
Education, 2004.
3. Pieter Adriaans, Dolf Zantinge, Data Mining, Addison Wesley, 1998.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 16 of 45
ELECTIVE PAPERS
Reference Book:
1. M. K. Venkataraman, Engineering Mathematics, Volume II, National Publishing
Company.
2. John E. Freunds, Irwin Miller, Marylees Miller, Mathematical Statistics, Pearson
Education, Sixth Edition.
3. Hopcroft and Ullman, Introduction to Automata Theory, Languages and
Computation, Pearson Education, Second Edition.
4. Tremblay and Manohar, Discrete Mathematical Structures with Applications to
Computer Science, Tata McGraw-Hill.
5. Rama B. Bhat, Snehashish Chakraverty, Numerical Analysis in Engineering, Narosa
Publishing House, 2004.
6. Radha Muthu, T. Santha, Discrete Mathematics for Computer Science and
Applications, Kalaikathir Achchagam, Coimbatore, 2003.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 17 of 45
Reference Books:
1. Rafael C.Gonazalez,Richard E. Woods,Digital Image Processing, Second Edition
Pearson Education.
2. Anil K.Jain ,Fundamentals of Digital Image Processing ,Pearson Education
PTE(Singapore)Ltd.,1989.
3. B.Chanda, D.Dutta Majumder,Digital Image Processing and Analysis, PHI,2003.
4. Nick Efford ,Digital Image Processing a practical introducing using Java,Pearson
Education.2004.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 18 of 45
Subject Description:
This course presents the importance of biological concepts and biological databases.
Goals:
To enable the student to know about sequence analysis, all biological databases, perl
programming.
Objectives:
On successful completion of the course the student should have:
Understood different structure and functions.
Learnt the different modeling techniques & sequence analysis.
Contents:
Unit - I
Introduction importance of bioinformatics biological concepts DNA & protein
(Structure and functions)
Unit - II
Model organisms and genome projects, Biological Databases, Sequence databases, Primary,
secondary, composite databases, Nucleotide sequence databases (NCBI, EBI, DDBJ), Protein
sequence databases (SwissPROT, TrEMBL, PIR, Expasy), Structural databases, DNA
structure databases, Protein structure database (PDB, SCOP, CATH), Genome databases,
NCBI genome, Pathway database, KEGG.
Unit - III
Sequence analysis gene identification methods (Prokaryotic and eukaryotic), Needleman
and Wunsch algorithm, Smith and Waterman algorithm, pair wise sequence alignment (local
and global alignment), scoring a matrix (Pam and Blosum), Multiple sequence alignment,
sequence motif analysis
Unit - IV
Elements of PERL Programming Data types, syntax, loops, input and outputs.
Unit - V
Structural biology and molecular modeling - Molecular visualization, RasMol, ViewerPro,
Swiss PDB Viewer, Protein conformational analysis, Ramachandran plot, Secondary
structure prediction, 3DPSSM, Protein Domains, Blocks and Motifs, CD Search, PDB
Search, PDB Format, Comparative Modeling.
Reference Books:
1. T.K. Attwood, D.J. Parry-Smith, Introduction to Bioinformatics, Pearson
Education, Asia, 2003
2. Dan E.Krane, Michael L.Raymer, Fundamental concepts of Bioinforamtics,
Pearson Education, Asia, 2003.
3. Dr. K, Mani and N. Vijayaraj, Bioinformatics for beginners, Kalaikathir
Achchagam
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 19 of 45
Subject Description:
This course presents the problem solving and AI, search methods and expert systems.
Goals:
Enable the student to be familiar with theorems and algorithms.
Objectives:
On successful completion of the course the student should have:
Understood the problem states and AI, state space methods, problem reduction search
methods, predicate calculus, and knowledge engineering in expert systems.
Contents:
Unit- I
Problem solving and AI Puzzles and Games Problem States and operators Heuristic
programming state space representations state descriptions graph notations non-
deterministic programs
Unit - II
State space search methods breadth first and depth first search heuristic dmissibility
optimality of algorithms performance measures problem reduction representations
AND/OR graphs and higher level state space
Unit - III
Problem reduction search methods cost of solution trees ordered search alpha beta and
minimum procedure theorem proving in predicate calculus syntax, semantics, Herbrand
universe: variables, qualifiers, unification, resolvents
Unit - IV
Predicate calculus in problem solving answer extraction process resolution Automatic
program writing predicate calculus proof finding methods
Unit - V
Expert systems: Expert systems and conventional programs expert system organization
Knowledge engineering: knowledge representation techniques knowledge acquisition
acquiring knowledge from experts automating knowledge acquisition Building an expert
system difficulties in developing an expert system
Reference Books:
1. E Charnail, CK Reiesbeck and D V Medermett, Artificial Intelligence
Programming, Lawrence Erlbaum Associates, N J, 1980
2. N J Nilson, Principles of Artificial Intelligence, Tiega Press, Polo Alto , 1980
3. Elain Rich and Kevin Knight, Artificial Intelligence, McGraw Hill, 1991
4. Donald A Waterman, A Guide to Expert Systems, Techknowledge series in
knowledge engineering, 1986
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 20 of 45
Subject Description:
This course presents the architecture memory, I/Devices, interrupts, signals DMA
controller and chips.
Goals:
To enable the student learn the programming concepts in microprocessor.
Objectives:
On successful completion of the course the student should have:
Understood assembly languages.
Contents:
Unit - I
Introduction - Microprocessor instruction set and Computer Languages
Microcomputer and Large computers 8085 Pin configuration 8085 Architecture Memory
Input and Output devices Example of a microcomputer system - Review: Logic devices
for interfacing Memory Interfacing Interfacing I/O devices.
Unit - II
Instructions Instruction format Addressing modes Types of Instructions Intel
8085 instruction set Development of Assembly Language Programs Programming
Techniques: Looping , counting and indexing Additional data transfer and 16 bit Arithmetic
instructions Arithmetic operations related to memory - Logical Operations: Rotate and
Compare Counters and Time delays Stack and Subroutines BCD to Binary conversion
Binary to BCD Conversion BCD to seven segment LED code conversion Binary to
ASCII and ASCII to Binary code conversion BCD Arithmetic.
Unit - III
8085 interrupts Hardware and Software interrupts Multiple interrupts 8259A
programmable Interrupt controller- DMA controller - 8255A Programmable peripheral
interface 8254 programmable interval timer.
Unit - IV
Basic concepts in serial I/O Software controlled asynchronous serial I/O 8085
serial I/O lines: SOD and SID- Hardware controlled serial I/O using programmable chips.
Microprocessor Applications: Designing a Scanned display Interfacing a Matrix Keyboard
Memory design.
Unit - V
ADC/DAC interface Keyboard interfacing Printer Interfacing - Contemporary 8
bit microprocessors Single chip micro controllers 16 bit microprocessors 32 bit
microprocessors.
Reference Books:
1. Ramesh S.Gaonkar, Microprocessor Architecture, Programming and Applications
with the 8085, Penram International Publications, Fourth Edition.
2. Mohammad Rafiguzzaman, Microprocessor and microcomputer based system
Design, Universal Bookstall, 1990.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 21 of 45
Subject Description:
This course presents the various principles of programming languages.
Goals:
To enable the student to learn the Language Design Issues, data types, inheritance,
control structure, and storage management.
Objectives:
On successful completion of the course the student should have:
Understood the structure and operation of a computer with various programming
Languages.
Contents:
Unit - I
Language Design Issue: The structure and operation of a computer Virtual Computers and
Binding Times Language Paradigms. Language Translation Issues: Programming Language
Syntax Stages in Translation Formal Translation Models.
Unit - II
Data Types: Properties of Types and Objects Elementary Data Types Structured Data
Types. Abstraction: Abstract Data Types Encapsulation by Subprograms Type
Definitions Storage Management.
Unit - III
Sequence Control: Implicit and Explicit Sequence Control Sequencing with Arithmetic and
Non arithmetic Expressions Sequence Control Between Statements. Subprogram Control:
Subprogram Sequence Control Attributes of Data Control Shared Data in Subprograms
Unit - IV
Inheritance: Inheritance Polymorphism, Advances in Language Design: Variation on
Subprogram Control Parallel Programming - Language Semantics Software Architecture.
Unit - V
Logic Programming Language: PROLOG Overview Data Objects Sequence Control -
Subprograms and Storage Management Abstraction and Encapsulation Sample Program.
Functional Language: LISP Overview-Data Objects Sequence Control- Subprograms and
Storage Management Abstraction and Encapsulation Sample Program.
Reference Books:
Subject Description:
This course presents the fundamentals of neural networks and fuzzy systems
Goals:
To enable the student to familiar with to Fuzzy Set Theory, Fuzzy Systems Adaptive
Resonance Theory and Back Propagation Networks
Objectives:
On successful completion of the course the student should have:
Understood concepts and principles of fuzzy and neural networks.
Concepts:
Unit - I
Fundamentals of Neural Networks : basic Concepts of Neural Networks Human Brain
Model of an Artificial Neuron Neural Network Architectures Characteristics of Neural
Networks Learning Methods Taxonomy of Neural Network Architectures History of
Neural Network Research Easy Neural Network Architectures Some Application
Domains.
Unit - II
Back Propagation Networks : Architecture of a Back Propagation Network Back
Propagation Learning Illustration Applications Effects of Tuning Parameters of the
Back Propagation Neural Network Selection of Various Parameters in BPN Variations of
Standard Back Propagation Algorithm.
Unit - III
Adaptive Resonance Theory: Introduction ART1 ART2 Applications.
Unit - IV
Fuzzy Set Theory: Fuzzy versus Crisp Crisp Sets Fuzzy Sets Crisp Relations Fuzzy
Relations.
Unit - V
Fuzzy Systems: Crisp Logic Predicate Logic Fuzzy Logic Fuzzy Rule Based System
Defuzzification Methods.
Reference Books:
Subject Description:
This course presents an introduction to mobile communications, Digital cellular
system, Mobile switching systems, Network management systems
Goals:
To enable the student learn Digital cellular system.
Objectives:
On successful completion of the course the student should have:
Understood the generation of mobile communication.
Contents:
Unit - I
Introduction: Introduction to mobile communications generation of mobile communication
FM, TDMA, CDMA basic cellular architecture.
Unit - II
Digital cellular system infrastructure: global system for mobile communication (GSM)
GSM architecture principles of synchronous digital hierarchy principles of
Pleisosynchronous digital hierarchy principles of fiber optics communications.
Unit - III
Mobile switching systems: Mobile service switching centre (MSC) inter working functions
(IWF) home location register (HLR) and Vister Location register (VLR) Gateway MSC
Signaling transfer point (STP)
Unit - IV
Base station sub systems: Base station controller (BSC) base transceiver station (BTS)
transcoder rate adaptation unit (TRAU) open system interconnection frequency
management.
Unit - V
Network management systems: Operating sub systems network operation, maintenance and
administration subscription management and charging mobile equipment management.
Reference Books:
Subject Description :
This course presents the introduction of TCP/IP architecture.
Goals:
To enable the student to learn routing mechanisms and applications.
Objectives:
On successful completion of the course the student should have:
Understood OSI layers, features and its applications.
Contents:
Unit - I
Introduction: TCP /IP Internet Internet Services Internet Protocols and Standardization
Application level interconnection-Network Level Interconnection Internet Architecture
Interconnection through IP Routers TCP /IP Internet Address Concepts.
Unit - II
Technical Features: Mapping Internet addresses to Physical addresses RARP-
Connectionless Datagram Delivery Routing IP Datagrams Error and Control Messages
(ICMP)
Unit - III
Subnet and Supernet address Extensions-User Datagram Protocol (UDP) Internet
Multicasting The Domain Name System (DNS)
Unit - IV
Routing: Introduction to Routing and the Origin of Routing Tables Core Routers Peer
Backbones Gateway-to-Gateway Protocol GGP Messages Formats Link State Routing
and Protocols-Exterior gateway protocol.
Unit - V
Applications: Remote Login (Telnet) File Transfer and Access (FTP, NFS) Electronic
Mail (SMTP) Internet Management (SNMP).
Reference Books:
1. Douglas E. Comer, Internetworking with TCP /IP, Prentice-Hall.
2. W. Richard Stevens, TCP/IP Illustrated, Addison Wesley.
3. Pete Loshin, TCP/IP Clearly Explained, Morgan Kaufmann.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 25 of 45
Subject Description:
This course presents the Hardware Fundamentals, Software Architecture Interrupts,
RTOS Operating System Services, Embedded software life cycle and tools.
Goals:
To enable the student to learn fundamentals, and concepts of operating system.
Objectives:
On successful completion of the course the student should have:
Understood: Hardware fundamentals, Software Architecture, Interrupts, Embedded
software lifecycle and tools.
Contents:
Unit - I
Hardware Fundamentals Hardware Fundamentals: Terminology-Gates-Timing Diagrams-
Memory Advanced Hardware Fundamentals: Microprocessors-Microprocessor architecture-
Direct Memory Access-Conventions and Schematics-Introduction to embedded systems: An
embedded system-Processor in the system-Exemplary embedded systems.
Unit - II
Interrupts and Software Architecture Interrupts: Interrupt basics-Interrupt service routines
Survey of Software Architectures: Round Robin with interrupts-Function-Queue-Scheduling
Architecture-Real Time Operating Systems Architecture Introduction to Real Time Operating
Systems: Selecting in RTOS-Tasks and Task States-Tasks and Data-Semaphores and shared
data
Unit - III
Concepts of RTOS More Operating System Services: Interrupt process communication-
Message queues-Mailboxes and pipes-Timer functions-Events-Memory management-
interrupt routines in an RTOS environment Basic design using a Real Time Operating
System: Principles-encapsulating semaphores and queues-hard real time scheduling
considerations-saving memory space and power-introduction to RTL & QNX
Unit - IV
Embedded software life cycle and tools Embedded software Lifecycle : Software Algorithm
complexity-Software development process life cycle and its models Software development
tools: development tools-hosts and target machine-linker/locators for embedded software-
getting embedded software into the target machine Debugging techniques: testing on your
host machine-instruction set simulators-the asset macro-using laboratory tools
Unit V
Case Study
Reference Books:
2. Raj Kamal, Embedded Systems architecture, programming and design, Tata McGraw
Hill Publishing Company Ltd., New Delhi 2003.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 26 of 45
Subject Description:
This course presents an introduction to genetic algorithms and its applications
Goals:
To enable the student to familiar with the concepts of genetic algorithms
Objectives:
On successful completion of the course the student should have:
Understood the concepts and applications of genetic algorithms
Contents:
Unit - I
Introduction: Genetic algorithms (GA) Traditional optimization and search methods GA
Vs Traditional methods Simple GA- schemata learning the Lingo- GA mathematical
foundation: Schema processing Two armed and K armed bandit problem building block
hypothesis minimal deceptive problem. Data structure GA operations mapping
objective functions to fitness values. Fitness scaling coding multi parameter
representation Discretization constrains.
Unit - II
Applications of GA: The Rise of GA Bagley and Adaptive Game playing program,
Tosenberg and Biological cell simulation pattern recognition metalevel GAs Hollstien
and Function optimization Real genes Box and Evolutionary operations Evolutionary
optimization techniques, programming. Function optimization improvements in basic
techniques Current applications Pipeline systems Structural optimization medical
registration
Unit - III
Dominance Diploidy and Abeyance and reordering operators- other micro operators:
Segregation, Translocation and multiple chromosome structure Duplication and Deletion.
Sexual determination and Differentiation Niche and speciation. Multi objective
optimization Knowledge based techniques GA and Parallel Processors.
Unit - IV
Genetic based Machine: Classifier system Rule and Message system The Bucket Brigade
GA Implementation issues.
Unit - V
Genetic Based Machine Learning (GBML) Development of CS-1-Smiths Poker Player
LS 1 Performance GBML efforts ANIMAT classifier system pipeline operation
classifier system.
Reference Books:
Subject Description:
This course presents an introduction on operations, class, constructors and about
handling errors in C#.
Goals:
To enable the student to be familiar in programming concepts
Objectives:
On successful completion of the course the student should be able to program in C#:
Contents:
Unit - I
Introduction: Mathematical Operations Controlling Program Flow.
Unit - II
Common Operations: Working with Arrays, Objects and Functions.
Unit - III
String Class Controlling String Output Inheritance Polymorphism Abstract Classes.
Unit - IV
Default Constructors Multiple Constructors Constructors and Inheritance.
Unit - V
Handling Errors Extending the Exception Mechanism Interface Delegates.
Reference Books:
1. Andrew Troelsen, C# and the .NET Platform, A Press, 2001.
2. E. Balagurusamy, Programming in C#, Tata McGrawHill, 2002.
3. Allen Jones, Adam Freeman, C# for Java Developers, Tata McGraw-Hill, 2003.
4. Stephen Randy Davis, C# Programming in 2 Days, IDG Books India (P) Ltd,
2002.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 28 of 45
Subject Description:
This course presents the introduction to COBOL, DB2, CICS
Goals:
To enable the student to familiar with to be familiar with the concepts in databases
Objectives:
On successful completion of the course the student should have:
Understood concepts of COBOL, JCL, and DB2.
Contents:
Unit-I
History of MVS- Basic concepts of JCL- Introduction to ISPF-JOB statement-EXEC
statement-DD statement- Procedures-GDG-Utility program-VSAM-JES2 and JES3-ALTER,
DELETE, EXPORT, IMPORT command in VSAM-SMS.
Unit-II
Introduction to COBOL- INDENTIFICATION DIVISIION-ENVIRONMENT DIVISION-
DATA DIVISION-PROCEDURE DIVISION-SYNCHRONIZED clause-JUSTIFIED clause-
REDEFINES clause- RENAMES clause- SIGN clause- VERBS-CONDITIONAL and
SEQUENCE CONTROL VERBS.
Unit-III
Table Handling- Sequential files-sorting and merging of files-EXAMINE verbs-INSPECT
verb- STRING and UNSTRING verb- Direct access files- Report.
Unit-IV
Introduction to DB2- Data types-Literals-Scalar operators and functions- assignment and
comparison - DDL statement-DML statement: Simple queries, sub queries correlated queries;
join queries, quantified comparison-Catalog: Introduction, Quantifying catalog, Updating
catalog, Aliases and Synonyms, labels- Views- Security and Authorization Integrity
Embedded SQL-Transaction processing Lock and Dead Lock Dynamic SQL.
UnitV
Introduction to CICS-House Keeping: HANDLE CONDITION, IGNORE CONDITION,
PUSH & POP, Alternates to HANDLE CONDITION, SERVICE RECORD, ADDRESS,
ASSIGN, EXEC Interface Block-Program control- File control-Terminal control-BMS-
Transient Data Control- Systems security Recovery and Restart - Test and Debugging
Inter communication.
Reference Books:
1. Kip R. Irvine, COBOL for the IBM Personal Computers, Prentice Hall, 1988.
2. Craig S. Mullins, Deveopers Guide DB2, TechMedia Publications, Third Edition,
1997.
3. Yukihisa Kageyama , CICI Hand Book, Tata McGraw Hill, 1997.
4. C. J. Date, Colin J. White, A Guide to DB2, Addision Wesley Publication, Fourth
Edition, 1993.
5. Alexis Leon, Gibu Thomas, IBM Mainframe and Solutions, Comdex Publishing
Company, 1997.
6. Stren, Stren, Structured COBOL Programming.
7. Mainframe Handbook
8. M. K. Roy, COBOL Programming.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 29 of 45
Subject Description:
This course presents an idea on different threats and security issues
Goals:
To enable the student to familiar with attacks, and security
Objectives:
On successful completion of the course the student should have:
Understood authentication applications, web security, intruders and viruses.
Contents:
Unit - I
Introduction Attacks, Services and Mechanisms Security Attacks Security Services A
model for Inter network Security - Conventional Encryption Principles- Conventional
Encryption Algorithms Cipher Block Modes of Operation Location of Encryption devices
Key Distribution. Public Key Cryptography and Message Authentication: Approaches to
Message Authentication Secure Hash function and HMAC Public key Cryptography
Principles Public key Cryptography algorithms Digital Signatures.
Unit - II
Authentication Applications: Kerberos X.509 Directory Authentication Services. Electronic
Mail Security: Pretty Good Privacy S/MIME. IP Security : IP Security Overview IP
Security Architecture Authentication header Encapsulating Security payload Combining
Security Associations Key Management.
Unit - III
Web Security: Web Security Requirements Secure Socket Layer and Transport Layer
Security Secure Electronic Transaction. Network Management Security: Basic concepts of
SNMP SNMPv1 CommUnit - y facility.
Unit - IV
Intruders and Viruses: Intruders - Viruses and Related threats Fire wall design Principles
Trusted Systems.
Unit - V
Case Studies on Cryptography and Security: Introduction Cryptographic Solutions - A case
study Single Sign on (SSO) Secure Inter branch Payment Transactions Denial of
Service (DOS) Attacks IP Spoofing Attacks Cross site Scripting Vulnerability Contract
Signing Secret Splitting Virtual Elections.
Reference Books:
1. William Stallings Network Security Essentials, Pearson Education Asia.
2. Atul Kahate Cryptography and Network Security, Tata McGraw Hill.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 30 of 45
Subject Description:
This course presents an idea on natural language processing
Goals:
To enable the student to familiar with to Introduction to Natural Language
Understanding, Grammars for Natural Languages, Linking Syntax and Semantics, and
Conversational Agent
Objectives:
On successful completion of the course the student should have:
Understood the natural language processing.
Contents:
Unit - I
Introduction to Natural Language Understanding Linguistic Background Grammars
and Parsing Features and Augmented Grammars.
Unit - II
Grammars for Natural Languages Towards Efficient Parsing Ambiguity Resolution
Statistical Methods Semantics and Logical Forms.
Unit - III
Linking Syntax and Semantics Resolution Strategies for Semantic Interpretation
Scoping and Interpretation of Noun Phrases.
Unit - IV
Knowledge Representation and Reasoning Local Discourse Context and Reference
World Knowledge Discourse Structure.
Unit - V
Conversational Agent Logic and Natural Language Model Theoretic Semantics
Semantics of Set Theoretic Models.
Reference Books:
1. James Allen, Natural Language Understanding, Pearson Education, Second
Edition.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 31 of 45
Subject Description:
This course presents an idea on Computer graphics, Generic VR Systems, Physical
Simulation, VR Hardware
Goals:
To enable the student to familiar with to computer graphics, 3D Computer graphics,
and simulation
Objectives:
On successful completion of the course the student should have:
Understood virtual reality in detail
Contents:
Unit - I
Virtual Reality and Virtual Environments: Introduction Computer Graphics Real-time
computer Graphics Flight Simulation Virtual Environment Benefits of Virtual Reality
Historical Development of VR: Scientific Landmarks
Unit - II
3D Computer Graphics: Virtual world Space Positioning the Virtual Observer The
Perspective Projection Human Vision Stereo Perspective Projection 3D Clipping
Color Theory Simple 3D Modeling illumination, reflection Models- Shading Algorithms
Radiosity Hidden surface removal realism- stereographic Images Geometric Modeling:
3D Space Curves 3D boundary representation other modeling strategies Geometrical
Transformations: Frames of reference Modeling Instances Picking, Flying, scaling
Collision detection.
Unit - III
Generic VR System: Virtual Environment computer Environment VR technology
Models of Interaction VR Systems Animating the Virtual Environment: The Dynamics of
numbers animation of objects Shape and object in between Free-form deformation
Particle Systems
Unit - IV
Physical Simulation: Objects Falling in a gravitational field Rotating wheels Elastic
Collisions Projectiles Simple Pendulums Springs Flight dynamics of an aircraft.
Human Factors: The eye the ear The Somatic senses Equilibrium.
Unit - V
VR Hardware: Sensor Hardware Head-Coupled displays Acoustic Hardware Integrated
VR Systems VR Software: Modeling Virtual World Physical Simulation VR Tool Kids
VR Applications: Engineering Entertainment Science training The Future: Virtual
Environments Modes of Interaction.
Reference Books:
1. John Vince, Virtual Reality Systems, Pearson Education Asia, 2001
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 32 of 45
Subject Description:
This course presents an idea on fundamentals of speech recognition, pattern
comparison techniques and processing
Goals:
To enable the student to familiar with to Overview of signals and systems,
Fundamentals of speech recognition, Pattern-comparison techniques.
Objectives:
On successful completion of the course the student should have:
Understood concepts and principles in speech recognition.
Contents:
Unit - I
Overview of signals and systems Review of One dimensional and two dimensional signal
processing and discrete Fourier transforms and digital filters- domain models for speech
processing.
Unit - II
Fundamentals of speech recognition. The speech signal production, perception and
Acoustic-Phonetic characterization. Signal processing and analysis methods of speech
recognition. Bank-of-filters-front-end processor-linear predictive coding model for speech
recognition-vector quantization-auditory based spectral analysis models.
Unit - III
Pattern-comparison techniques. Speech recognition system analysis and implementation
issues: Application of source-coding techniques-template training methods-performance
analysis and recognition enhancements.
Unit - IV
Homomorphic speech processing-Speech Recognition algorithm: Pattern Recognition based
and knowledge based Discrete utterance and continuous speech recognition systems-
Principles of speaker recognition-projects.
Unit - V
Speech recognition based on connected word models-Large vocabulary continuous speech
recognition Task oriented applications of automatic speech recognition.
Reference Books:
1. Rabiner & Schaffer, Digital processing of speech signals, Prentice Hall. 1980.
2. Lawrence Rabiner, Fundamentals of speech recognition, Prentice Hall.
3. Samuel D.Stearns and Ruth A.David Signal Processing algorithms, Prentice Hall,
1988.
4. D.Shanghessuy, Speech Communication, Prentice Hall,1987
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 33 of 45
Subject Description:
This course presents an idea on fundamentals of E-Commerce
Goals:
To enable the student to familiar with network infrastructure, Information Publishing
Technology, Search Engines and Directory Services.
Objectives:
On successful completion of the course the student should have:
Understood concepts and principles in E-Commerce
Contents:
Unit - I
Introduction to E-Commerce: Benefits-Impacts-Classification and Application of E-
Commerce-Business Model-Architectural Frame Work
Unit - II
Network Infrastructure: Local Area Network-Ethernet-Wide Area Network-Internet-TCP/IP
Reference Model-Domain Name System-Internet Industry structure-Information Distribution
and Messaging: FTP Application-Electronic Mail-World Wide Web Server-HTTP-Web
Server Implementations
Unit - III
Information Publishing Technology: Information publishing-Web Browsers-HTML-CGI-
Multimedia Content - Other Multimedia Objects-VRML- Securing the Business on Internet-
Why Information on Internet is vulnerable?-Security Policy-Procedures and Practices-Site
Security-Protecting the Network-Firewalls-Securing the Web Service
Unit - IV
Securing Network Transaction-Electronic Payment Systems: Introduction Online Payment
Systems-Pre-paid Electronic Payment System- Post-paid Electronic Payment System-
Requirement Metrics of a Payment System
Unit - V
Search Engines and Directory Services: Information Directories Search Engines Internet
Adverting- Agents in Electronic Commerce: Needs and Types of Agents-Agent
Technologies-Agents Standards and Protocols-Agents Applications-Case Study.
Reference Books:
1. Bharat Bhasker, Electronic Commerce Framework, Technologies and Applications,
Tata McGraw Hill Publication, 2003.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 34 of 45
Subject Description:
This course presents an Introduction to Distributed Systems, Client/Server Network
Model, Distributed Databases
Goals:
To enable the student to familiar with distributed systems and client server computing
Objectives:
On successful completion of the course the student should have:
Understood Distributed Systems in detail
Contents:
Unit - I
Distributed Systems: Fully distributed processing systems Networks and Interconnection
structures Designing a Distributed Processing System.
Unit - II
Distributed Systems: Pros and Cons of Distributed processing Distributed databases the
challenge of distributed data loading factors managing the distributed resources division
of responsibilities.
Unit - III
Design Considerations: Communications line loading Line loading Calculations
Partitioning and allocation Data flow systems dimension analysis network database
design considerations ration analysis database decision trees synchronization of network
databases.
Unit - IV
Client/Server Network Model: Concept file server printer server an e-mail server.
Unit - V
Distributed Databases: An overview Distributed Databases Principles of Distributed
Databases levels of transparency Distributed Database Design The R* Project
Technique Problems of Heterogeneous Distributed Databases.
Reference Books:
1. John A. Sharp, An Introduction to Distributed and Parallel Processing, Blackwell
Scientific Publications, 1987.
2. Uyless D.Black, Data Communications & Distributed Networks.
3. Joel M.Crichlow, Introduction to Distributed & Parallel Computing.
4. Stefans Ceri, Ginseppe Pelagatti, Distributed Databases Principles and Systems,
McGraw Hill Book Co., New York, 1985.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 36 of 45
Subject Description:
This course presents an brief introduction to compression schemes and modulation
Goals:
To enable the student to familiar with Information and Coding and Compression of
Still Images
Objectives:
On successful completion of the course the student should have:
Understood data compression concepts and principles
Contents:
Unit - I
Information and Coding: Information and Entropy Noiseless and Memoryless Coding
Shannon Fano Coding: Shannon Coding Shannon-Fano Coding.
Unit - II
Huffman Coding Arithmetic Coding - Dictionary Techniques - Sampling and Quantization
Unit - III
Predictive Coding: Delta Modulation Differential Pulse Code Modulation. Transform
Coding: Defining a Transform Interpretation of Transforms Karhenun-Loeve Transform
Hadamard Transform Discrete Wavelet Transform. Subband Coding: Down sampling and
Up sampling Bit Allocation
Unit - IV
: JPEG The Baseline System Progressive DCT-based Mode of Operation Hierarchical
Mode of Operation Sequential Losses Mode of Operation. Video Image Compression:
MPEG MPEG-1, MPEG-2, MPEG-4 and MPEG-7
Unit - V
Fourier analysis: Fourier series The Fourier Transform The Discrete Fourier Transform -
The Sampling Theorem. Wavelets: Wavelet Transforms Multiresolution Analysis
Reference Books:
Subject Description:
This course presents an Overview of Distributed Computing, XML, web services
Goals:
To enable the student to be familiar with distributed services, XML and web services
Objectives:
On successful completion of the course the student should have:
Understood the concepts of web services
Contents:
Unit - I
Overview of Distributed Computing. Introduction to web services Industry standards,
Technologies and concepts underlying web services their support to web services.
Applications that consume web services.
Unit - II
XML its choice for web services network protocols to back end databases- technologies
SOAP, WSDL exchange of information between applications in distributed environment
locating remote web services its access and usage. UDDI specification an introduction.
Unit - III
A brief outline of web services conversation static and interactive aspects of system
interface and its implementation, work flow orchestration and refinement, transactions ,
security issues the common attacks security attacks facilitated within web services quality
of services Architecting of systems to meet users requirement with respect to latency,
performance, reliability, QOS metrics, Mobile and wireless services energy consumption,
network bandwidth utilization, portals and services management.
Unit - IV
Building real world enterprise applications using web services sample source codes to
develop web services steps necessary to build and deploy web services and client
applications to meet customers requirement Easier development, customization,
maintenance, transactional requirements, seamless porting to multiple devices and platforms.
Unit - V
Deployment of Web services and applications onto Tomcat application server and axis SOAP
server (both are freewares) Web services platform as a set of enabling technologies for
XML based distributed computing.
Reference Books:
1. Sandeep Chatterjee, James Webber, Developing Enterprise Web Services : An
Architects Guide, Prentice Hall, Nov 2003.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 38 of 45
Subject Description
This Course presents the essentials of Software Qulaity, Plan for SQA, Standards,
Tools for SQA.
Goals:
To enable the students to learn the Concepts and Principles of SQA.
Objectives :
On successful completion of the course the students should have:
Understood the principles of SQA
Must be able to judge the quality of Softwares.
Content
UNIT I
Introduction to software quality Software modeling Scope of the software quality
program Establishing quality goals Purpose, quality of goals SQA planning software
Productivity and documentation.
UNIT II
Software quality assurance plan Purpose and Scope, Software quality assurance
management - Organization Quality tasks Responsibilities Documentation.
UNIT III
Standards, Practices, Conventions and Metrics, Reviews and Audits Management,
Technical review Software inspection process Walk through process Audit process
Test processes ISO, cmm compatibility Problem reporting and corrective action.
UNIT IV
Tools, Techniques and methodologies, Code control, Media control, Supplier control,
Records collection, Maintenance and retention, Training and risk management.
UNIT V
ISO 9000 model, cmm model, Comparisons, ISO 9000 weaknesses, cmm weaknesses,
SPICE Software process improvement and capability determination.
REFERENCES
1. Mordechai Ben Meachem and Garry S.Marliss, Software Quality Producing
Practical, Consistent Software, International Thompson Computer Press, 1997
2. Watt. S. Humphrey, Managing Software Process, Addison Wesley, 1998.
3. Philip.B.Crosby, Quality is Free : The Art of making quality certain, Mass Market,
1992.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 39 of 45
Subject Description
This course provides the insight in to the reliability factors of the Software.
Goal :
To enable the students to learn about the principle and concepts of Software reliability.
Objectives :
On successful completion of the course the students must have
understood the concepts of Software reliability
analysed the quality standards
Content
UNIT I
Software Reliability Definitions - software disasters - Errors - faults - failures - different views of software reliability software
requirements specification - Causes of unreliability in software - Dependable systems: reliable, safe, secure, maintainable, and
available - Software maintenance.
UNIT II
The phases of a Software Project - Monitoring the development process The software
life cycle models - software engineering - Structured Analysis and structured Design -
Fault tolerance - Inspection - Software cost and schedule.
UNIT III
Software quality modeling - Diverse approaches and sources of information - Fault
avoidance, removal and tolerance - Process maturity levels (CMM) - Software quality
assurance (SQA) - Monitoring the quality of software - Total quality management
(TQA) - Measuring Software Reliability - The statistical approach - Software reliability
metrics.
UNIT IV
Data Trends - Complete prediction Systems - overview of some software reliability
models - The recalibration of the models - Analysis of model accuracy - Reliability
growth models and trend analysis - Software Costs Models - Super models.
UNIT V
Testing and maintaining more reliable software logical testing functional testing
algorithm testing regression testing - fault tree analysis failure mode effects and
critical analysis reusability - case studies.
REFERENCES
1. J.D. Musa, A. Iannino and K.Okumoto, Software Reliability, Measurement,
Prediction, Application, McGraw Hill, 1990.
2. J.D. Musa, Software Reliability Engineering, McGraw Hill, 1998.
3. Michael R. Lyer, Handbook of Software Reliability Engineering, McGraw Hill, 1995.
4. Xie, M., Software Reliability Modelling, World Scientific, London, 1991.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 40 of 45
Subject Description
This course provides principles of Software Testing and about tools.
Goal :
To enable the students to learn about the principle and tools of Software testing.
Objectives :
On successful completion of the course the students must have
understood the concepts of Software testing
got the skill of software testing
exposed to software testing tools.
Content
UNIT I
Purpose of Software testing Some Dichotomies a model for testing Playing pool and
consulting oracles Is complete testing possible The Consequence of bugs Taxonomy of
Bugs.
UNIT II
Software testing Fundamentals Test case Design Introduction of Black Box Testing and
White Box testing Flow Graphs and Path testing Path testing Basics - Predicates, Path
Predicates and Achievable Paths - Path Sensitizing Path Instrumentation Implementation
and Application of Path Testing.
UNIT III
Transaction Flow testing Transaction Flows techniques Implementation Comments
Data Flow Testing Basics Strategies Applications, Tools and effectiveness Syntax
Testing Why, What, How Grammar for formats Implementation Tips.
UNIT IV
Logic Based Testing Motivational Overview Decision tables Path Expressions KV
Charts Specifications States, State Graphs and transition Testing State Graphs Good
& bad states state testing Metrics and Complexity.
UNIT V
Testing GUIs Testing Client Server Architecture Testing for Real-time System A
Strategic Approach to Software testing issues unit testing Integration Testing
Validation testing System testing The art of Debugging.
REFERENCES :
1. Boris Beizer, Software testing techniques, Dreamtech Press, Second Edition 2003.
2. Myers and Glenford.J., The Art of Software Testing, John-Wiley & Sons,1979
3. Roger.S.Pressman, Software Engineering A Practitioners Approach ,Mc-Graw Hill,
5th edition, 2001
4. Marnie.L. Hutcheson, Software Testing Fundamentals, Wiley-India,2007
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 41 of 45
Subject Description
This course provides hand on experience of Software Testing tools.
Goal :
To enable the students to learn about the usage of tools of Software testing.
Objectives :
On successful completion of the course the students must have
understood the concepts of Software testing
got the skill of software testing tools
expertise in using software testing tools.
- WinRunner
- Silk Test
- SQA Robot
- LoadRunner
- JMeter
- TestDirector
- GNU Tools ( Source Code Testing Utilities in Unix / Linux)
- Quick Test Professional
REFERENCE :
Subject Description:
This course presents the basics of Windows and MS- Word
Goal:
To enable the students to learn the basics of Windows and MS-Word
Objectives:
On successful completion of the course the students should have:
Understood Windows and MS-Word concepts
UNIT-I
Getting started - about OS - types of OS - mouse handling - pulldown menu selection.
UNIT-II
Window resizing File manager operation - control panel operation - opening and closing
files.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 42 of 45
UNIT-III
Editing - cut, paste- copy to clipboard - creating icon - Creating group items.
UNIT-IV
Introduction to common office tools and techniques- sharing information within MS office -
word basics - formatting text documents - working with header, footer and footnotes.
UNIT-V
Tabs- tables and sorting - graphics - templates writer tools - macros - keyboard shortcuts -
menus - custom toolbars.
REFERENCE BOOKS
1. Microsoft Office'2000 by Woody Leonhard
2. Using Microsoft Office'97 by Rick Winter and Patty Winter.
Subject Description:
This course presents the basics of Internet and HTML
Goal:
To enable the students to learn the basics of Internet and HTML
Objectives:
On successful completion of the course the students should have:
Understood Internet and HTML concepts
UNIT I :
Internet Basics : Origin of Internet - ARPANET - Protocol - Packet switching theory -
TCP/IP - IP address (classification), Domain name system (Concept of DNS Server) -
Router.
UNIT II :
Routing Algorithm (just introduction) - Direct & Dial up Networking - MODEM -
ISP(VSNL) Services (shell & TCP/IP ACC.) Up load, down load Protocols
(ZMODEM,KERMIT etc.)
UNIT III :
Email - Newsgroup -FTP - Gopher - Origin of WWW - Origin of HTML - URL - Browsers
(Text & Graphics) - HTTP - Search Engines (Purpose & Facilities, Yahoo, Altavista
webcrawler etc.
UNIT IV:
Archie - Veronica - Telnet - Chat - What is meant by Website, Homepage.. etc.
UNIT V
HTML Programming : HTML - Basic Tags - Various versions of HTML - HTML forms -
HTML frames - Browser (IE, Netscape communicator, Lynx(Text)) -Browser dependent -
HTML tags.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 43 of 45
REFERENCE BOOKS:
1. Using Microsoft Office'97 by Rick Winter and Patty Winter.
2. Advanced Internet for Dummies by John Levine and Margaret Levine.
3. Asian Publishers Internet Concepts, problems and Solutions by Singh.
Subject Description:
This course presents the basics of MS-Access
Goal:
To enable the students to learn the basics of MS-Access
Objectives:
On successful completion of the course the students should have:
Understood MS-Access concepts
UNIT-I
Introduction - creating database - creating tables - design view, datasheet view- Table wizard
- Import table -Input mask-validation rule.
UNIT -II
Creating forms - placing controls in forms - Entering and editing data - finding, sorting and
displaying data.
UNIT-III
Creating reports - forms, letter and label -creating a macro.
UNIT -IV
Graphics in database - linking, importing and exporting records.
UNIT - V
Creating a module - Creating and attaching a menu - An application project.
REFERENCE BOOKS:
1. Using Microsoft office'97 by Rick Winter and patty Winter.
Subject Description:
This course presents the basics of Excel and Powerpoint
Goal:
To enable the students to learn the basics of Excel and Powerpoint
Objectives:
On successful completion of the course the students should have:
Understood Excel and Powerpoint concepts
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 44 of 45
UNIT-I
Excel basics- creating workbook, worksheets-Rearranging worksheets - naming worksheets.
UNIT-II
Excel formatting tips and techniques- creating and naming arrange- sorting-filtering- auto
filter-advanced filter-goal seek-scenario.
UNIT-III
An introduction to function-mathematical function-financial function-excel chart features-
working with graphics in Excel.
UNIT - IV
Power point basics-using text- adding visual elements-charts and tables.
UNIT-V
Drawing-clipart-sounds-animation-apply time transitions to slides.
REFERENCE BOOKS:
1. Microsoft Office'2000 by Woody Leonhard.
2. Using Microsoft powerpoint'97 by Nancy Stevenson.
Subject Description:
This course presents the basics of C programming
Goal:
To enable the students to learn the basics of C programming
Objectives:
On successful completion of the course the students should have:
Understood C programming techniques
UNIT I
Introduction to computers - problem solving - structured approach - top-down design- flow
charts algorithms.
UNIT II
An overview of C - data types and sizes - declarations - variables - constants - arithmetic
operators - relational and logical operators - hierarchy of operators - C expressions -
precedence and order of evaluation - storage classes.
UNIT III
program control structure - the loop control structures - the case control unformatted input
and output - external variables, register variables, static variables - structure - arrays - strings
- pointers - problems with pointers.
Anx.31 G - M Sc CS (CBCS) 2007-08 Page 45 of 45
UNIT IV
Functions - scope rules of functions - function arguments (command line arguments) -
function prototypes - returning pointers - recursion - variable number of arguments - function
pointers.
UNIT V
Structures - array of structures - pointers to structure - structure in functions - self referential
structures - unions - user defined types.
REFERENCE BOOKS
1. Brain W. Kernighan, Dennis M.R. Chie, 'The C Programming Language' Prentice
Hall, 1990.
2. Hughes, J.K. and Michtom J.I. 'A Structured approach programming' Prentice Hall,
1977
3. Gottfried, B. 'Theory and Problems of Programming with C', McGraw Hill, 1990.
4. E. Balagurusamy, 'Programming in ANSI C', Tata McGraw Hill, 1992.
5. Robert A. Radcliffe, 'Encyclopedia C' BPB Publications.