Master of Science -Technology in CS (1)

7/31/2019 Master of Science -Technology in CS (1)

1/37

Master of Science-Technology in Computer Science(Syllabus)

BoS-Sept11 1 of 37

MASTER OF SCIENCE-TECHNOLOGY IN COMPUTER SCIENCE

SYLLABUSThird Semester

SubjectCode Subject Name TheoryCredits LabCredits TotalCredits

CSE 601 Object Oriented Systems 03 01 04

CSE 603 Data Structures 03 01 04

CSE 605 Software Project Management 03 01 04

CSE 607 Design and Analysis of Algorithms 03 01 04

CSE 609 Design of Operating System 03 01 04

CSE 611 Database System Concepts 03 01 04

Term Paper-I -- -- 01

TOTAL 18 06 25

Fourth SemesterCSE 602 Graph Theory 03 01 04

CSE 604 Network Protocols and Network Security 03 01 04

CSE 606Advanced Computer Architecture &

Algorithms03 01 04

CSE 608 Digital Image Processing & Application 03 01 04

CSE 610 Elective I 03 01 04

CSE 612 Elective II 03 01 04

Term Paper-II -- -- 01

TOTAL 18 06 25

Fifth & Sixth SemesterProject Work - - 40

Total Number of Credits to Award Degree 90

CSE 610 Elective I:

CSE 610.1 Distributed Systems

CSE 610.2 Neural Networks

CSE 610.3 Pattern Recognition & Scene Analysis

CSE 610.4 Cloud Computing

CSE 610.5 Grid Computing

CSE 612 Elective II:

CSE 612.1 Mobile Computing

CSE 612.2 Data Warehousing & Data Mining

CSE 612.3 Formal Methods

CSE 612.4 Software Quality Assurance

CSE 612.5 Software Architecting


2/37


BoS-Sept11 2 of 37

Detailed Syllabus Master of Science-Technology in Computer Science

Semester III

CSE 601Object Oriented Systems

Credits: 3 Total No of Hrs: 36 Introduction: Overview of OOL; Object Classes; Meta Types, Object Oriented Methodologies;

The Unified Approach Modeling; Why Modeling; Static and Dynamic Models; Functional

Models.

Object Modeling: Object. Links. Association. Multiplicity, Aggregation, Composition,Constraints, Inheritance. Grouping Constructs; Problems on Object Modeling. Advantages of

Object Modeling.

Analysis: Problem Analysis, Problem Domain Classes. Identify Classes and Objects of RealWorld problems. Using Use Case Analysis; Recording Analysis.

Sequence Diagram: Modeling Scenarios. Mapping Events to Object. Interfaces. DiscoveringAttributes. Modeling Simple Collaboration Modeling. Logical Database Schema. Activity

Diagram. Modeling Workflow.

Class Diagram: Class, attributes, methods, visibility, Inter-relationship Design: Architectural Design. Refining the Model. Refactoring. Coupling and Cohesion. Who

should own the Attribute? Who should own the Operations? Process and Threads.

Design Classes: Classes Visibility, Entity class, boundary class, control class User Interface.Subsystem Interface

Component Diagram: Modeling Source Codes. Physical Databases Deployment Diagram: Modeling in a Distributed System and Embedded Systems.

References

1. Object Oriented Modeling and Design with UML: James Rumbaugh and Michael Blaha2. Object Oriented system analysis and Design using UML : Simon Benntt, Steve McRobb, Ray

Farmer.3. Visual Modelling with Rational Rose 2002 and UML ,Terry Quatrani,Pearson Pub.4. The unifies Modeling Language User Guide ,Grady Booch,Ivar Jacobson,James

Rumbaugh

5. Applying UML & Patterns: An Introduction to Object Oriented Analysis andDesign,Craig Larman

6. Object Oriented analysis and Design with Application,Grady Booch.


3/37


BoS-Sept11 3 of 37

CSE 603 Data StructuresCredits: 3 Number of Hours: 36

Learning Objectives: Learner should be able to understand the concept, design and

implementation of following data structures Stack, Queues, Lists, Trees. Learner will understandoperations on Hash tables, an introduction to Amortized complexity of algorithms. Binary treeand operations on it.

UNITI 06 hrs

Stack : Definition, implementation. Applications - infix to postfix conversion, Postfixevaluation.

Recursion properties and examples. Queue: Linear queue, Circular queue, Double ended

queue, Priority queue - Definition, implementation.

Lists :Dynamic memory allocation. Linear singly linked list, Circular singly linked list, Doublylinked list.basic definition and implementation of different operations.UNITII 09 hrs

Trees: Definition, basic terminology, types of trees, implicit array representation, linked list

representation, implementation of binary tree and traversals.Search trees - Binary search tree (BST), Static and Dynamic weighted BST

Hashing Open hashing closed hashing, Collision resolution strategies linear probing,

Quadratic probing, and double hashing.Choosing a good hash function, rehashing.

Dictionaries, Data structures for disjoint sets and linked list representations of disjoint sets.

UNITIII 06 hrs

Introduction to Amortized complexityExternal sorting and tournament trees ( winner and looser trees)

Optimal merge patterns ( Huffman trees)

Double ended priority queues

Leftist trees, Binomial heaps and Fibonacci heapsUNITIV 09 hrs

Balanced binary search

AVL-trees, 2-3 and 2-3-4 trees, Red-black trees, B-trees, B+

trees and splay trees. Skips listsUNIT V 06 hrs

Definition and examples of the following concepts:

Tries and Digital Search Trees, Suffix trees, Bloom filters, Segment trees, Priority search trees,

k-d trees, quad and oct trees.

References

(UNIT-I)

1. Yedidyah, Augenstein and Tenenbaum, Data Structures Using C and C++ -Second Edition, PHI- India

(UNIT-II to V)

2. Data structures, Algorithms and Applications in C++ , Sartaj Sahni3. Data Structures and Algorithm analysis in C++, Mark Allen Weiss.4. Introduction to Algorithms ,Thomas M.Corman,Charles E.Leiserson,Ronald

L.Rivest,PHI


4/37


BoS-Sept11 4 of 37

CSE 605 Software Project Management

Credits: 3 Total No of Hours: 36

Learning objective of the subject: Learner should be able to understand software management

issues. Learner should be able to Handle practical issues in managing a software projects. Learner

should be able to understand tools and techniques in project management. Learner should be able

understand structured management ideas and industrial practices.

Unit 1: Software Development Life cycle 3 hours

Analysis, design, implementation, testing, maintenance and enhancement of software systems.

Deliverables and reviews

Unit 2: Life cycle Models 3 hours

All kinds of models like Build and Fix model, waterfall model, Spiral, Iterative, Prototype etc. Later

general discussion on Agile model alsoUnit 3: Project process groups and Project Initiation 3 hours

Process groups (Initiation, Planning, Execution, Monitor and Control, Closing), Initiation activities,

Development of project charter and Preliminary Project Scope Statement

Unit 4: Work breakdown structure and Time management 3 hours

Activity List, Milestone list, Project Schedule network diagrams, Activity resource requirements,

Resource breakdown structure, Activity duration estimates, Project Schedule, Schedule model data

Unit 5: Cost management 3 hours

Activity Cost Estimates, earned value analysis, Cost budgeting, Cost control

Unit 6: Quality management 3 hours

Quality Assurance. Reviews and inspections, metrics, standards, tests and Certification. Total

Quality Management. Costs and benefits

Unit 7: Configuration management 3 hoursConfiguration items. Status accounting. Derivation and traceability. Change control and releases.

Standards.

Unit 8: Software Testing 3 hours

Testing objectives, methods, test planning, test case design. Validation and verification. Integration

testing, systems and acceptance testing. Alpha and beta site testing. Reliability. Performance

evaluation

Unit 9: Project closing activities 3 hours

Acceptance deliverables, Final product, Close Contract

Unit 10: Project activities in various process groups, Risk etc. 3 hours

All 5 Process groups and activities in all groups, Risk management

Unit 11: Leadership and Communication management 3 hoursCommunication management, Leadership management

Unit 12: Risk management, Practices problems in the industry, Best Practices 3 hours

Reference Books:

1. Software Project Management, Royce Walker, Pearson

2. Software Project Management Concept to Development, Conway Kieron,Dreamtech Press.

Many good materials are available on web which are related to PMI. These are to the point and

exam oriented also.


5/37


BoS-Sept11 5 of 37

CSE 607 Design and analysis of algorithmsCredits 3 No of Hrs: 36

Learning Objectives :

i) Learn a mathematical model to analyze efficiency of algorithms.ii) Learn different types of algorithms and their efficiency classes. Compare and

contrast different algorithms solving the same problem.

Algorithms-definitions (1.1 [ANL)) correctness, time and space complexity, Average and worst case analysis, (2.1, 2.2, 2.3,

and 2.4 [ANL] and [CLR])

Algorithmic languages and data structures, set representation and components of agraph, (1.4 [ANL))

Searching (Linear and binary search [ANL)), sorting (Merge sort, Quick sort, and heap sort [ANL)), merging sorted lists, Numerical, non-numerical, combinational and graph algorithms (Solving systems of

linear equationsForward and backward substitution, Gaussian elimination, DFS, BFS,topological order, Minimum spanning treeKruskals algorithm, Prims algorithm [ANL)

and [CLR])

String matching and data compression algorithms (Horspool , Boyer-Moore [ANL),Robin-Karp and KMP[CLR]),

Algorithms for linear, non-linear, integer and dynamic programming problemsShortest path problems (Simplex method to solve linear programs, Duality, Bellman Ford

algorithm[CLR], Computing Binomial Co-efficient, Warshalls and Floyds algorithm,

Dijkstras algorithm [ANL)),

polynomial, matrix and vector manipulations (definition of Polynomial, polynomialrepresentations, Fast multiplication of polynomials in co-efficient form, Properties of

matrices, Strassens matrix multiplication - [CLR] ),

decision trees (Decision tree for maximum of three elements, selection sort, insertion sort,lower bound argument for comparison sort [ANL))

game trees, branch and bound algorithms (Two playerzero sum game, tic-tac-toeproblem, solving Traveling sales person problem using branch and bound [ANL)),

Optimality, P and NP complete problems (Definitionsfeasible solution, optimal solution,P, NP, NP Complete problems, problem reducibility, Circuit satisfiability, formula

satisfiability and clique problem [CLR]).


6/37


BoS-Sept11 6 of 37

Parallel algorithms and distributed processing (Pointer Jumping, Finding the roots in aforest of binary trees, CRCW algorithm to find maximum of n-array elements [CLR])

REFERENCES1 [CLR] Introduction to Algorithms, Thomas M.Corman,Charles E.Leiserson, Ronald

L.Rivest, PHI2 [ANL]Introduction to the Design and Analysis of Algorithms, Levitin Anamy, PearsonFURTHER READING

3 [AUH]Design and Analysis of Algorithms, Aho,Ulmann and Hopcraft.4 [GDH]Introduction to the design and Analysis of Algorithms, Goodman S and

Hedetniemi .S ,McGraw Hill


7/37


BoS-Sept11 7 of 37

CSE609 Design of Operating System

Credits: 3 No of hours: 36

UNIT I (3 Hours): INTRODUCTION: What is an Operating Systems?, Mainframe Systems,

Desktop Systems, Distributed Systems, Real-Time Systems, Handheld Systems, Feature

Migration, Computing Environments.

COMPUTER-SYSTEM STRUCTURES: Computer-System Operation, I/O Structure, Storage

Structure, Hardware protection, Network Structure. (Chapters 1, 2)

UNIT II (3 Hours): OPERATING SYSTEM STRUCTURE: System Components, Operating

System Services, System Calls, System Programs, System Structure, Virtual Machines, System

Design and Implementation.

PROCESSES: Process Concept, Process Scheduling, Operations on Processes, Cooperating

Processes, Inter process Communication, communication in Client-Server Systems. (Chapters 3,

4 )

U N I T III (3 Hours): THREADS: Multithreading Models threads, Solaris 2 threads, Window

2000 threads, Linux Threads, Java Threads.

CPU SCHEDULING: Basic concepts, Scheduling Criteria, Scheduling Algorithms, Multiple-

Processor Scheduling, Real-Time Scheduling, Process Scheduling Models. (Chapters 5, 6)

U N I T IV (3 Hours): PROCESS SYNCHRONIZATION: Background, The Critical-Section

Problem, synchronization Hardware, Semaphores, Critical Regions, Monitors, OS

Synchronization.

DEADLOCKS: System Model, Deadlock Characterization, Methods for Handling Deadlocks,

Deadlock Prevention, Deadlock Avoidance, Deadlock Detection.(Chapters 7, 8)

U N I T V (4 Hours) : MEMORY MANAGEMENT: Background, Swapping, Contiguous Memory

Allocation, Paging, Segmentation.

VIRTUAL MEMORY: Background, Demand Paging, Process Creation, Page Replacement,

Allocation of Frames, Thrashing.( Chapters 9,10)U N I T VI (4 Hours): FILE SYSTEM INTERFACE: File Concept, Access Methods, Directory

Structure, File-System Mounting, File Sharing.

FILE-SYSTEM IMPLEMENTATION: File-System Structure, File-system Implementation,

Directory Implementation, Allocation Methods, Free-Space Management, Efficiency and

Performance, Recovery. (Chapters 11, 12)

U N I T VII (4 Hours): I/O SYSTEMS: I/O Hardware, Application I/O Interface, Kernel I/O

Subsystem, Transforming I/O to Hardware Operations, STREAMS.

MASS-STORAGE STRUCTURE: Disk Structure, Disk Scheduling, Disk Management, Swap- Space

Management, RAID Structure, Disk Attachment, Stable-Storage Implementation. (Chapters 13,

14)

UNIT VIII (4 Hours): PROTECTION: Goals of Protection, Domain of Protection, Access

Matrix, Implementation of access Matrix, Revocation of Access Rights, Capability-BasedSystems.

SECURITY: The Security Problem, User Authentication, Program Threats, System Threats,

Securing Systems and Facilities, Cryptography. (Chapters 18 , 19)

UNIT IX (4 Hours): DISTRIBUTED FILE SYSTEMS: Background, Naming and Transparency,

remote file access, Stateful versus Stateless service, File replication, AFS.

DISTRIBUTED COORDINATION: Event ordering, mutual exclusion, Atomicity, Concurrency

control, Deadlock handling, Election Algorithm, reaching agreement.(Chapters 16,17)


8/37


BoS-Sept11 8 of 37

UNIT X (4 Hours): Case Studies

THE LINUX SYSTEM: History, Design Principles, Kernel Modules, Process management,

Scheduling, Memory management, File systems, Input and output, Inter process

Communication, Network Structure, and Security.

WINDOWS XP: History, Design Principles, System components, Environmental subsystems, File

systems, Networking, Programmer Interface. (Chapters 20,21)TEXT BOOK:

1. Operating system concepts with JAVA (6th edition) by - Silberschatz, Galvin, Gagne Jhon- Wiley &

Sons Inc. (2002)

REFERENCT BOOKS:

1. Operating Systems (IV Edition) By - William Stallings PHI(2002)

2. Operating Systems By - Gary Nutt (Pearson Education)

3. Operating Systems By - Charles Crowley TMH (2000)

4. Modern Operating Systems By - A.S. Tanenbaum (PHI) (2002)

5. Operating Systems By Dm Dhamdhere (TMH)

6. Under Standing Operating Systems By Im Flynn, Am Mchocs (Thomson Press)

7. Operating Systems Dietel (Pearson)


9/37


BoS-Sept11 9 of 37

CSE 611Database System Concepts

Credits:3 Total no of hours:36

Learning Objectives: The learner should be able to understand the virtues of DBMS over Filesystem. By end of the this course the learner should be able to analyze and model the real world

system using ER model and understand the role of relational algebra in the transformation of 4th

generation query into 3rd generation program. The course introduces to SQL for querying the

database and also to Transaction processing and concurrency management aspect of DBMS. The

learner will learn to judiciously utilize different types of files for different parts of database storage.

UNIT I (3 hours)

Introduction to Database Systems: File Systems v/s DBMS, Advantages of DBMS, Types of Data

Models, Three layer schema architecture/ abstraction in DBMS, Structure of DBMS, Users of DBMS,

Overview of Database Design (Six steps), Requirement Analysis Case Study

UNIT II (3 hours)

Conceptual Database Design : Entity Relationship Model: Entities and its types, Attributes and itstypes, Entity Sets, Relationship: Degree of relationship, Cardinality, Participation, Additional

features of E-R Model: Generalization and Aggregation, E-R Diagrams - Case Studies.

UNIT III (3 hours)

Logical Database Design: Introduction to Relational Model: Relational Model Constraints: Entity

Integrity constraints, Referential Integrity constraints, key constraints, Guidelines for converting ER

Diagrams to Relational Model.

UNIT IV (3 hours)

Relational Algebra: Introduction to Operations in Relational algebra- Unary operators, Set

operators, Joins, group and aggregate functions.

UNIT V (3 hours)

Informal guidelines for good database design, Functional Dependencies: Amstrong Axioms,

Attribute closure, Minimal cover, Finding the candidate key, Normalizations and Normal Forms Case Study

UNIT VI (3 hours)

SQL (Structured Query Language): Data Definition Language (DDL): Create, Alter and Drop

commands, Data Manipulation Language (DML): Select, Insert, Update, and Delete commands, Basic

SQL queries, Integrity constraints on tables, Data Control Language Commands(DCL): Grant and

Revoke

UNIT VII (3 hours)

SQL Functions, SQL Joins, SQL Aggregate functions and GROUP BY, Nested queries and sub queries,

Correlated sub queries, Advanced SQL: Indexes, Sequence, Clusters, Views, Cursors and Triggers,

Embedded SQL

UNIT VIII (4 hours)Transaction Management: Acid Properties, State diagram, Transactions and Schedules, Concurrent

execution of transactions, Serializability: Conflict serializability, view serializability, Concurrency

management: Lock Management, Two-Phase locking protocols, Dead locks.

UNIT IX ( 4 hours)

File Organizations and Indexes: Cost Model, Comparison of 3 file organizations, B+ Trees,

Extendible Hashing, Linear Hashing

UNIT X (4 hours)


10/37


BoS-Sept11 10 of 37

Introduction to Data Warehousing: Data warehouse architecture, OLTP vs. OLAP, Conceptual

Modeling of Data Warehouses, Data warehouse implementation, Introduction to Client/server

Database Environment, Introduction to Internet Database Environment.

UNIT XI (3 hours)

Introduction to Distributed Databases, Object Oriented Databases, Object- Relational databases.

Suggested Readings

Database Management Systems Raghu Ramakrishna / Johannes Gehrke

References

Fundamentals of Databases Elmasri and Navathe

SQL, PL/SQL Programming in Oracle Ivan Bayross


11/37


BoS-Sept11 11 of 37

Semester IV

CSE 602 Graph theory


Graphs and Sub-graphs, walks, paths and connectedness, distance as a metric,degrees, regular graphs, cubic graphs, bipartite graphs, self complementarygraphs, operations on graphs, External graphs, degree and sequence, applications

of the theorems due to (a) Havel and Hakimi, (b) Erdos and Gallai.

Cut points, bridges and blocks, block graphs and cut point graphs. Trees and their characterizations, centre and Centriods, blockcut points trees,

spanning trees, independent cycles and Cocycles, connectivity and line

connectivity, Whitneys theorem.

Traversibility Eulerian, Hamiltonian, line graphs and total graphs.Traversibility, coverings and independence, theorem of Gullai, critical points andlines.

Planarity, genus, thickness, crossing number. Colorability, chromatic number andits bounds, Nordhaus Gaddem theorems, the four and five colour theorems, The

chromatic polynomial.

Matrix Representation of graphs Incident matrix, Adjacency matrix, cyclematrix, cutset matrix, path matrix, Digraphs D, Matrix - tree theorem on number

of spanning trees. Tournament.

Graph Theoretic Algorithms Computer representation of graphs Input andoutput, Algorithms for connectedness, Spanning Tree, Fundamental Circuits,

Directed Circuits and Shortest paths.

References

1. Graph Theory ,Narsingh Deo,PHI2. Graph Theory,Gibbons,Cambridge University Press3. Graph Theory, Frank Harary,Narosa Pub


12/37


BoS-Sept11 12 of 37

CSE604 Network Protocols and Network Security


COURSE DESCRIPTION AND PREREQUISITES: This course involves an intense examination of

Computer Networks and Network securities with its supported protocols.

COURSE OBJECTIVES:1. To acquire an understanding of network security and its changing character2. To understand how network security is conceptualized and carried out3. To examine the historical evolution of network security4. To analyze both early and contemporary threats to network security5. To articulate informed opinion about issues related to network security6. To identify and investigate threats to network security7. To appreciate the challenges of network security

CONTENT OUTLINE:

UNIT 1: Introduction to Networks

OSI, TCP/IP and other Networks Model, Examples of Networks (Novell Networks, Arpanet,

Internet), Network Topologies (WAN, LAN, MAN)

UNIT 2: Introduction to ProtocolsIntroduction, Low Level Protocols (IP, ARP, RARP, ICMP), IP Routing Protocols (RIP, BGP, OSPF,

CIDR), User Datagram Protocol, Broadcast , Multicasting and IGMP.

UNIT 3 : Introduction to TCP

TCP States Events Transitions Sliding windows Congestion Data Flow Performance

measures of TCP.

Link Layer and Ethernet

Applications:

TELNET Introduction, Operation, Features.FTP - Introduction, Operation, Feature, Advantage and Disadvantage

SMTP - Introduction, Operation, Feature, Advantage and Disadvantage

SNMP - Introduction, Operation, Feature, Advantage and Disadvantage

UNIT 4: Network Security

Introduction The need for security Security approaches Principles of security Plain Text andCipher Text Substitution and Transposition Techniques Encryption and Decryption Symmetric

and Asymmetric Cryptography

Algorithms

Symmetric Key Cryptographic Algorithms

Overview DES IDEA

Asymmetric Cryptographic Algorithms

Overview RSA Digital Signatures

Public Key Interface

Introduction Key Management (Overview, Operations)

Internet Security ProtocolsBasic Concepts SSL SET

UNIT 5 Firewalls (Introduction, Types, Methods), Malicious Software (Introduction, Types),

TEXT BOOKS1.Computer Networks Andrew S Tanenbaum, 4th edition, PHI

2. Internetworking with TCP/IP,Douglas Comer,PHI

3. Data and Computer Communications 7th edition, Pearson Education Asia, 2004

References

1. An Engineering Approach to Computer Networks S.Keshav, 2nd edition, Pearson Education.


13/37


BoS-Sept11 13 of 37

CSE 606 Advanced computer architecture and algorithms


Function- and data-level parallelism, performance figures and speedup laws.

Pipeline instruction processing and instruction dependencies. Typical CPUarchitecture (DLX).

FP unit. Eliminating instruction dependencies. Loop-level parallelism, branchprediction.

Superscalar CPU. Dynamic instruction scheduling, register renaming, ROB,speculation.

Relaxed models of memory consistency. VLIW processors, software pipelining,predication.

Thread-level parallelism, support in hardware. Multithreaded processors. Shared memory architectures. Bus scalability, memory organization, cache

coherence. MSI and MESI cache coherence protocols. Synchronization of events in

multiprocessors.

Interconnection and switching networks. Features and specs, routing, control,group communications.

Distributed shared memory architectures, shared virtual memory. Message passing architectures. Hardware support for communication, overlapping

communication and computation.

Data-level parallelism, vector processors and instructions. SIMD machines andSIMD-like processing. Systolic structures.

Accelerators and specific architectures for ANN, architectures of future CPUs. Algorithm Analysis, Algorithm design techniques, Parallel processing,

terminology and sieve of Eratosthenes, Elementary parallel algorithms, Matrix

multiplication, The Fast Fourier transform, Sorting

References

1. Kaihwang and Faye A. Briggs, Computer Architecture and Parallel Processing McGraw HillSeries.

2. Kaihwang, Advanced Computer ArchitectureParallelism, Scalability, Programmability.3. Michael J. Quinn, Parallel ComputingTheory and PracticeMcGraw Hill Publication.4. Mark Allen Weiss- Data Structures and Algorithm Analysis in C Benjamin/Cummings

Publication.

5. Computer Organization and Design, 3rdedition - David Patterson and John Hennessy6. "Computer Architecture: A Quantitative Approach," Third Edition, David Patterson and John

Hennessy


14/37


BoS-Sept11 14 of 37

CSE 608 Digital Image Processing And Application


IntroductionWhat is an image? What are computer graphics, image processing, and computervision? How do they relate to one another? Image capture. Image display. Human

vision. Resolution and quantisation. Colour and colour spaces. Storage of images

in memory, and double buffering. Display devices: the inner workings of CRTs,LCDs, and printers. Convolution and Correlation. Two dimensional Fourier

transforms, Discrete fourier transform, fast fourier transforms, Hadamard

transform, Discrete cosine transforms, wavelet transforms, applications of image

transforms

Image operationsIntroduction to visual perception, spatial and frequency representations, imagepremier, multi-scale features, line detection, edge detection, contour tracing,

texture analysis, image filtering, image matching, segmentation, scene labelling,

shape from shading, shape representation, pattern clustering, trainable patternclassifiers, encoding, transform coding and sub-band coding, multimedia, JPEG

and MPEG, image processing and compression in multimedia systems, stereo

vision and computational models of human vision, epi-polar geometry, matching

and stereo disparity, depth acquisition, surface interpolation,

Image AnalysisMorphological operations, Histogram based operations, Mathematics-basedOperations, Convolution-based Operations, Smoothing Operations, Derivative-based Operations, Dilation and Erosion, Boolean Convolution, Opening and

Closing, hit and Miss operation

Image SegmentationThresholding, edge based segmentation, region growing segmentation, Advanced

optimal border and surface detection approaches, Matching, Edge imagethresholding, Edge relaxation, Border tracing, Edge following as graph searching,

Edge following as dynamic programming, ,Hough transforms, Border detection

using border location information, Region construction from border

Image Data CompressionReal Time Image Processing, Image data properties, discrete image transforms in

image data compression, Predictive compression methods, Vector quantization,

Hierarchical and progressive compression methods, Comparison of compression

methods, Coding, JPEG & JPEG-2000 and MPEG-2/4 image compression


15/37


BoS-Sept11 15 of 37

References

1. Computer Graphics,Zhigang Xiang and Roy Plastock,Shaums Outline Series2. Introduction to Real Time Imaging, Edward R,Dougherty,Philip A Laplante.3. Fundamentals of Digital Image Processing, Anil K. Jain ,PHI, 1995.4. Digital Image Processing, R.C. Gonzalez and R.E. Woods ,Addison Wesley, 1993.5. Digital Image Processing and Computer Vision, R.J. Schalkoff, John Wiley, 1989.


16/37


BoS-Sept11 16 of 37

CSE 610 Elective I:

CSE610.1 Distributed Systems


UNIT - I

Introduction to Distributed Systems: Definition, Goals, Hardware and software concepts, and client

/ server model.

Processes: Threads, Clients, Servers, Code Migration, Software agents.

UNIT- II

Communication : RPC , ROBJ invocations ,Naming: Entities: DNS, X. 500.

UNIT - III

Synchronization: clock, logical clock, Global state, Eelection algorithms, Mutual exclusion,

distributed Transaction.

UNIT - IV

Consistency and Replication: Data-centric, Client-Centric Consistency Models, Distribution and

Consistency protocols

UNIT - V

Fault Tolerance: Introduction, Process resilience, Reliable client-server and Group communication,

UNIT - VI

Distributed Object based Systems: CORBA, D-COM, GLOBE , comparisions

UNIT VII

Distributed file systems , Case studies: SUN NFS, CODA.

UNIT VIII

Distributed shared memory: Implementation algorithms, memory coherence, and Design issues.

Distributed Scheduling: Load distributed algorithms.

UNIT IX

Security: Secure Channels, Access Control, Security Management, Kerboros, Electronic PaymentSystems.

UNIT X

Distributed operating systems- Architecture, Issues , communication networks, primitives

Suggested Reading:

1. Andrew S. Tanenbaum and Van Steen Distributed Systems 2002, Pearson Education Inc/PHI

2. Singhal M, Shivaratri N.G: Advanced concepts in operating systems. Mc-Graw-HiIIlntl.,1994.


17/37


BoS-Sept11 17 of 37

CSE 610.2 Neural networks


Basic concepts of neurocomputing:o Artificial Neural Networks (ANN) and their biological roots and motivations.

ANNs as numerical data/signal/image processing devices. Encoding (training

phase) and decoding (active phase).Taxonomy of neural networks: feedforward

and recurrent networks with supervised and unsupervised learning laws. Staticand dynamic processing systems. Basic data structures: mapping of vector spaces,

clusters, principal components.

Basic terminology related to an artificial neuron:o a summing dendrite, synapses and their weights, pre- and post-synaptic signals,

activation potential and activation function. Excitatory and inhibitory synapses.

The biasing input. Types of activating functions.

The Perceptrono The Perceptron and its learning law. Classification of linearly separable patterns.

Linear Networks.o Adaline --- the adaptive linear element. Linear regression. The Wiener-Hopf

equation. The Least-Mean-Square (Widrow-Hoff) learning algorithm. Method of

steepest descent. Adaline as a linear adaptive filter. A sequential regression

algorithm.

Multi-Layer Feedforward Neural Networks:o aka Multi-Layer Perceptrons. Supervised Learning. Approximation and

interpolation of functions. Back-Propagation Learning law. Fast training

algorithms. Applications of multilayer perceptrons: Image coding, Paint-quality

inspection, Nettalk.

Self-Organising systems.o Unsupervised Learning. Local learning laws. Generalised Hebbian Algorithm.

The Oja's and Sanger's rules. Principal component analysis --- Karhunen-Loevetransform.

Competitive Learning:o MinNet and MaxNet networks. Clustering. Learning Vector Quantisation.Codebooks. Application in data compression.

Self-Organising Feature Mapso Kohonen networks.

Radial-Basis function networks


18/37


BoS-Sept11 18 of 37

o Radial-Basis function (RBF) networks and their application in functioninterpolation, approximation and modelling probability distributions.

Recurrent networkso

Hopfield networks.

References

1. Introduction to artificial Neural Network Jacek M.Zurada,Jaico.2. Artificial Neural networks, Yegnanarayana.B,PHI.3. Neural Networks,Simon Haykins,Prentice Hall ,2001


19/37


BoS-Sept11 19 of 37

CSE 610.3 Pattern recognition and scene analysis


Pattern recognition, Feature extraction and classification stages, Different approaches to pattern recognition Linear classifiers, parametric and nonparametric classification techniques. Supervised learning, unsupervised learning and clustering, Digitization of images, Introduction to image analysis problems, Segmentation, edge detection and region growing techniques, contour description, Elements of texture description and classification.

References

1 Pattern recognition, Mike James, Wiley Pub.2 Handbook of Pattern recognition and Image Processing, Young T.Y,Sun Fu3 Pattern Recognition Image Analysis, Earl Gose ,Prentice Hall


20/37


BoS-Sept11 20 of 37

CSE610.4 Cloud Computing

Total Hrs: 36 Credits: (3-0-3-4)

UNIT I Distributed Systems: Introduction to Distributed Computing - Scope of Problems -Parallel Vs. Distributed Computing - Distributed Systems: Networking, Remote Procedure Calls,

Transaction processing systems, - Distributed File Systems: NFS, AFS.

UNIT II Grid Computing: Introduction - Definition of Grid - Basic Building Blocks -

Overview of Grid Computing - History of Grid Computing - Grid Computing Model and

Protocols.

UNIT III - Cluster Computing: Cluster Computer and its Architecture - Clusters Classification- Components for Clusters - Cluster Middleware and SSI.

UNIT IV Virtualization: Virtualization at the Infrastructure level - CPU Virtualization -Storage Virtualization - Network Virtualization - A Discussion on Hypervisors, SAN, ISCSI and

VLAN.

UNIT V Web2.0 Concepts : Overview of Web2.0 - Web2.0 History - Web2.0 Characteristics

- Web2.0 Technologies - Web2.0 Concepts - Web2.0 usage - Web2.0 Applications.

UNIT VI Mashups : Over view of Mashup - Difference from other tools: Mashups VersusTraditional Aggregation (SOA Web1.0), Mashup Versus Portal - Architecture of the Mashup -

Types of the Mashup - The Role of Mashups on the Web - Pros & Cons of the Mashup - Existing

Mashup Tools and their Comparisons - Mashups in the Future Web.

UNIT VII Social Network: Definition of Social Network - Components of Web2.0 for Social

Networks - Types and behavior of Social Networks - Life Cycle of Social Networks - Impact ofSocial networks using Web2.0 - Future Scope of Web2.0 in Social networks, - Business

Analytics of Social Networks uses Web2.0, Benefits and Challenges for Social Networks using

Web2.0.

UNIT VIII: Cloud Computing Concepts Trends: Cloud Introduction and Overview - Cloud

Computing Technology - Hardware & Software Infrastructure - Different types of Clouds -

Risks - Cloud ServicesApplications - Regulatory Issues and Limitations.

Data Centre: Network Cloud Services - Power Quality - Power Utilization Efficiency - Power

Carbon Footprint - Availability Management - Security Management, Economics.

Compute & Storage Cloud Services: Computer & Storage Cloud Services - Virtual Machine -

Security Management - Public and Private Clouds - High Growth Applications - Peaky

Applications - Parallel Applications.


21/37


BoS-Sept11 21 of 37

Marketing: Economics of Sales & Marketing - Traditional Sales & Marketing - Email

Marketing - Search Marketing - Social Media Marketing.

SALES: Transforming traditional Software Sales - Selling New Application Cloud Services Contracts - Service Level Agreements - Sales Compensation - Installed Base Sales - Indirect

Channels.

Finance: Revenue Recognition - Monthly Recurring Revenue Cash - Cost of Sales, Churn:

Cost of Keeping a Customer - Financial Systems - Financial Analysis - Venture Capital.

Human Resources: Economics - Right People - Right State Culture Scrape - Buy New -

Remodel - World of Work.

UNIT IX: Characteristics of Cloud Computing: Scalability Availability Reliability -SecurityFlexibility - Efficiency.

UNIT X: Cloud Computing Infrastructure Models: Private, Public, Hybrid Clouds:

Definitions, Architectures, Risks and Benefits, Applications - Comparison of Private, Public andHybrid Clouds.

UNIT XI: Private Clouds: Understanding Key Private Cloud Requirements - Gap Analysis ofExisting Infrastructure and Processes - Migration Process to Private Cloud Computing -

Technology and Vendor Options - Key Challenges in Creating a Private Cloud.

UNIT XII: Cloud Computing Delivery Mechanisms: Infrastructure as a service (IaaS):Enabling technologies: Scalable Server Clusters, Achieving transparency with platform

virtualization, Elastic Storage devices - Accessing IaaS: Provisioning servers on demand,

Handling dynamic and static IP addresses, Tools and support for management and monitoring.

Platform as a Service (PaaS): Exploring the Technical Foundation for PaaS: Specifying the

Components of PaaS, Analyzing vendor PaaS Provisions, Selecting an Appropriate

Implementation - Building services with Solution stacks: Evaluating the Architecture of VendorSpecific Platforms, Becoming Familiar with Service Platform Tools, Leveraging the Power of

Scalable Middleware - Managing Cloud Storage: Controlling Unstructured Data in the Cloud,

Deploying Relational Databases in the Cloud, Improving Data Availability - Employing support

services: Testing in the cloud, Monitoring Cloud-based Services, Analyzing Portability acrossPlatforms

Software as a service (SaaS): Characterizing SaaS: Minimizing the Need for Local Hardwareand Software, Streamlining Administration with Centralized Installation and Updates,

Optimizing Cost and Performance with the ability to Scale on Demand - Comparing Service

Scenarios: Improving Collaboration with Business Productivity Tools, Simplifying BusinessProcess Creation by Integrating Existing Components - Inspecting SaaS Technologies:

Deploying Web Applications, Implementing Web Services: SOAP, REST, Choosing a

development platform.


22/37


BoS-Sept11 22 of 37

Other Delivery mechanisms: Data as a ServiceGlobalization - Service as a Service.

UNIT XIII: Cloud Computing Key Issues: Privileged User Access - Data Segregation -Regulatory Compliance - Physical Location of Data AvailabilityRecovery - Investigative

SupportViability - Underlying Encryption and Longevity.UNIT XIV: Cloud Computing Parallelization: High Availability Replication LoadBalancing.

UNIT XV: Cloud Computing Case Studies: Overview, Architecture, Applications, Pros andCons of Zembly, Google App Engine, Windows Azure Platform and Amazon Elastic Compute

Cloud (EC2).

References:

1. Cloud Application Architectures. George Reese. Publication OReilly,20092. Michael Miller, Cloud Computing, Pearson Education, New Delhi, 20093. Cloud Computing: A Practical Approach. Anthony T.Velte, Tobe J.Velte, Robert

Elsenpeter. Publication Pearson Education.,2009

4. Timothy Chou , "Introduction to Cloud Computing - Business and Technology", ActiveBook Press, LLC, 2010

5. Brian Hayes. Cloud Computing. Communications of the ACM, 51(7), 2007.6. Mladen A. Vouk. Cloud Computing Issues, Research and Implementations.7. White Papers on Cloud Computing.8. Internet Resources (Google, Sun, Microsoft, Amazon) for case studies.


23/37


BoS-Sept11 23 of 37

CSE610.5 Grid Computing


UNIT I

Introduction: Overview of Grid Computing - Grid Computing Values and Risks: GridComputing Business Value Analysis, Risk Analysis Grid Marketplace History of GridComputing High-Performance Computing Cluster Computing Peer-to-Peer Computing

Internet ComputingGrid Computing.

UNIT II Grid Computing Model and Protocols: Grid Computing ModelGrid Protocols:

Security, Resource Management, Data Transfer and Information Services.

UNIT III Overview of Types of Grids: Departmental Grids - Enterprise Grids - ExtrapriseGrids - Global Grids - Compute Grids - Data Grids - Utility Grids.

UNIT IV

Desktop Grids : Background Desktop Grids Definition Desktop GridChallenges Desktop Grid Technology: Security, Unobtrusiveness, Openness, Robustness,Scalability and Central Manageability Desktop Grid Suitability The Grid server Role of

Desktop Grids in an Enterprise Computing Infrastructure - Practical Uses of Desktop Grids.

UNIT V Cluster Grids: Clusters: Single System Image, Single System Environment

Industry Examples: Electronic Design Automation (EDA), Bioinformatics, Industrial

Manufacturing - Cluster Grids.

UNIT VIHPC Grids: Five Steps to Scientific InsightApplications and ArchitecturesHPC

Application Development environment - HPC Grids.

UNIT VII Data Grids: Alternatives to Data Grid: Network File System (NFS), File Transfer

Protocol (FTP), NFS over IPSec, Secure Copyscp/sftp, De-Militarized Zone, GridFTP, Andrew

File System (AFS)Avaki Data Grid: Accessing the Data Grid, Managing the Data Grid DataGrid Architecture: Grid Servers, Share Servers, Data Grid Access Servers (DGAS), Proxy

Servers, Failover Servers (Secondary Grid Domain Controllers).

UNIT VIII The Open Grid Services Architecture: An Analogy for OGSAThe Evolutionto OGSA: Grid Computing, Web Services OGSA Overview: The OGSA Platform, OGSI,

OGSA Platform Interfaces, OGSA Platform Models Building on the OGSA platform: WS-

Agreement, Data Access and Integration Services (DAIS) Implementing OGSA-Based Grids:

The Globus Toolkit.

UNIT IX Creating and Managing Grid Services: Services and the Grid Converting

Existing Software - Service Discovery Operational Requirements - Tools and Toolkits: GlobusToolkit Grid Information Service, Accessing Grid Information, Performance Issues with MDS,

Other Information Services and Providers Universal Description Discovery and Integration

(UDDI): Support in UDDI, UDDI and OGSA.


24/37


BoS-Sept11 24 of 37

UNIT X Desktop Supercomputing: Native Programming for Grids: Parallel Computing

Parallel Programming Paradigms Problems of Current Parallel Programming Paradigms

Desktop Supercomputing: Solving the Parallel Programming Problem DesktopSupercomputing Programming ParadigmParallelizing Existing Applications.

UNIT XI Grid enabling Software Applications: The Needs of the Grid Users GridDeployment Criteria - Methods of Grid DeploymentRequirements for Grid Enabling Software

Grid Programming Tools and Expertise The Process of Grid-Enabling Software

Applications.

UNIT XIIApplication Integration: Application Classification: Parallelism, Communications,

Granularity, Dependency Grid requirements: Interfaces, Job Scheduling, Data Management,

Remote Execution Environment, Security, Gang Scheduling, Checkpointing and Job Migration,Management Integrating Applications with Middleware Platforms: Application PreparationExample, Issues in Application Integration.

UNIT XIII Grid-Enabling Network Services: On Demand Optical Connection Services Creating Grid-Enabled Network ServicesMontague River GridMontague River Domain.

UNIT XIV Managing Grid Environments: Managing Grids: Trust, Identity, Privacy,AuthorizationManagement Reporting: Users, Resources, Jobs, Audit Support Monitoring:

Types of Events, Notification of Modes Service Level Management Data Catalogs and

Replica Management: Data Catalog, ReplicationPortals.

UNIT XV Different Application Areas of Grid Computing: Grids in Life Sciences:

Bioinformatics, Computational Chemistry and Biochemistry, Protein Modeling, Ab Initio

Molecular Modeling Grids in Telecommunications Sector: CPU Intensive Application, Data

Intensive Application Grids in Other Industries: Grids in Financial Services, Geo Sciences,Manufacturing, Electronic Design Automation, Entertainment and Media,

Text Book:

1. Ahmar Abbas, Grid Computing, A Practical Guide to Technology and Applications,Firewall media, 2004.

References:

1. Ian Foster and Carl Kesselman. The Grid 2: Blueprint for a New ComputingInfrastructure. Morgan Kaufmann, 2/ed. 2003.

2. L. Silva and R. Buyya, Parallel Programming Models and Paradigms, High PerformanceCluster Computing: Programming and Applications, Rajkumar Buyya (editor), ISBN 0-13-013785-5, Prentice Hall PTR, NJ, USA, 1999.

3. Ian Foster, et al. The Open Grid Services Architecture, Version 1.5 (GFD.80). Open GridForum, 2006. (available at http://www.ogf.org/)


25/37


BoS-Sept11 25 of 37

4. Rajkumar Buyya. High Performance Cluster Computing: Architectures and Systems.PrenticeHall India, 1999.

5. Joshy Joseph & Craig Fellenstein, Grid Computing, Pearson/PHI PTR-2003.


26/37


BoS-Sept11 26 of 37

CSE 612 Elective II:

CSE612.1 Mobile Computing


Introduction: Definitions of Mobile Communication and Mobile computing, Pervasive and

Ubiquitous Computing, architecture, applications and limitations of Mobile computing, Wireless

Transmission, Modulation and Spread Spectrum, Cellular System.[4L]

Medium Access Control : Motivation for a specialized MAC (Hidden and exposed terminals, Near

and far terminals), SDMA, FDMA, TDMA and CDMA.[5L]

GSM : Mobile services, System architecture, Radio interface, Protocols, Localization and calling,

Handover, Security and Services[4L]

Wireless LAN : IEEE 802.11 and Bluetooth,: architecture , physical layer, MAC layer, networking,

and security .[3L]

Mobile Network Layer : Mobile IP (Goals, assumptions, entities and terminology, IP packet

delivery, Dynamic host Configuration Protocol (DHCP).[3L]

Mobile Transport Layer : Traditional TCP, Indirect TCP, Snooping TCP, Mobile TCP, Fast

retransmit/fast recovery, Transmission /time-out freezing, Selective retransmission, Transaction

oriented TCP.[4L]

Data Broadcasting: Communications asymmetry, Cyclic repetition of data, Digital audio

broadcasting and Digital video broadcasting.[4L]

Mobile Ad hoc Networks (MANETs): Overview, Properties, application and security of MANET,

Routing algorithms : Proactive (Destination Sequence Distance Vector), Reactive(Dynamic Source

Routing) and Hybrid(Zone Routing Protocol).[6L]

Support for mobility : Wireless Application Protocol-WAP. Introduction, protocol architecture,

i-mode,SyncML,WAP2.0[3L]

REFERENCES ::

1. Jochen Schiller,Mobile Communications, Pearson Education. second edition, 2007. ISBN 81-7758-263-1

2. Asoke K Talukder, Roopa R Yavagal, Mobile Computing-Technology, Applications and Service

Creation, Tata Mcgraw Hill, First Edition,2008,ISBN-13: 978-0-07-058807-3

3. C.K.Toh : Ad hoc Mobile Wireless Networks Protocols and Systems : First Edition:2007:ISBN 81-317-1510-6

4. Adelstein, Frank, Gupta, Sandeep KS, Richard III, Golden , Schwiebert, Loren, Fundamentals ofMobile and Pervasive Computing, ISBN: 0071412379, McGraw-Hill Professional, 2005.

5. Hansmann, Merk, Nicklous, Stober, Principles of Mobile Computing, Springer, second edition,2003.


27/37


BoS-Sept11 27 of 37

CSE612.2 Data Warehousing & Data Mining:


Chapter 1Basic concepts of Data warehousing and Data mining reasons for their use their benefits and

problems

Chapter 2

Evolution of a Database into a Data Warehouse Data Warehouse vs. Relational Data Base

Chapter 3

Data Warehouse Logical Design Star Schema DFM Other Schemas Materialized ViewsChapter 4

Data Warehouse Physical Design Hardware & IO considerations, parallelism, indexes

Data Warehousing Technologies and implementations

Chapter 5

Data Warehouse - Data Extraction - Data cleaning - Data transformation - Data reduction -

Discretization and generating concept hierarchies - Data transportation loading & refreshing

From Data Warehousing to Data mining Multidimensional data model - OLAP architecture, designand query processing - OLAP operations - SQL Extensions for OLAP Hypercube

Chapter 6

Data Mining approaches and methods concepts, classification, association rules, clustering Data

Visualization

Chapter 7

Data mining algorithms Association classification prediction using decision tress, neural

networks, regression. Mining Complex types of data text data web data

Chapter 8

Data Mining techniques in financial applications financial forecasting fraud detection case

study

Text Books

Data Mining - Jiawei Han, Micheline Kamber

Data Warehousing Toolkit R.Kimball, M.Ross Wiley

Reference Books

Data Warehousing in the real world Anahory Sam, Dennis Murray PearsonModern Data warehousing, mining & Visualization G.M.Marakar Prentice Hall


28/37


BoS-Sept11 28 of 37

CSE 612.3 Formal Methods


Formal Methods

1. Logico Syntaxo Models, semanticso Proof theory, soundnesso Completeness theoremo Compactness & Lowenheim-Skolem theoremso Foundations of mathematicso Godel's incompleteness theorems

2. ACL2 (Applied/Mechanized Logic)o The ACL2 programming language

Primitive data types Functions/macros Modeling systems List processing Modeling examples from hardware, software, and security

o The ACL2 logic Definitional principle The ACL2 ordinals and termination proofs Induction Hand Proofs Quantification & encapsulation

o Mechanization of ACL2 Computation as proof Overview of the waterfall Overview of simplification Induction

3. Theory of rewrite systemso Confluenceo Terminationo Completion, including Knuth-Bendix completiono Conditional rewriting

4. Decision procedureso Propositional logic

Soundness & completeness If-normatization Davis/Putnam BDDs

o Linear arithmetic


29/37


BoS-Sept11 29 of 37

o Combining decision procedures Nelson-Oppen and/or Shostak

5. Reactive systemso

Transformational vs. reactive systemso Safety and liveness

Topological characterization Lattice theoretic

o Temporal logic Linear time Branching time Tarski-Knaster fixpoint theorem Mu-calculus Notions of correctness:

Trace containment, equivalence Simulation, bisimulation Complexity/ Algorithms

6. Model Checkingo Model checking the mu-calculuso Symbolic model checkingo Tablaux method for CTL

7. Abstractiono Homomorphismso Conservative abstractionso Abstract interpretation

References

Required Textbooks

Mathematical Logic, Second Edition. H.-D. Ebbinghaus and J. Flum and W. Thomas.Springer-Verlag, 1994.

Computer-Aided Reasoning: An Approach. Matt Kaufmann, Panagiotis Manolios, and JStrother Moore. Kluwer Academic Publishers, June, 2000.

Term Rewriting and All That. Franz Baader and Tobias Nipkow. Cambridge UniversityPress, 1998.

Model Checking. Edmund M. Clarke, Jr., Orna Grumberg, and Doron A. Peled. MITPress, 1999.


30/37


BoS-Sept11 30 of 37

Recommended books and papers

Computer-Aided Reasoning: ACL2 Case Studies. Matt Kaufmann, Panagiotis Manolios,and J Strother Moore (eds.). Kluwer Academic Publishers, June, 2000. (ISBN: 0-7923-

7849-0) For students interested inACL2and/or software/hardware case studies:Note:I have several copies that I can lend out for the semester. Also, a paperback version

is available on theWeb. This is much cheaper than the hardcover version.

Handbook of Automated Reasoning. In 2 volumes /Editors Alan Robinson and AndreiVoronkov. - Amsterdam [etc.] : Elsevier ; Cambridge, Mass. MIT Press (ISBN: 0-262-

18223-8). For students interested in the theory of formal methods.

Formal Modelling and Analysis of Security Protocols. Peter Ryan and Steve Schneider.Addison Wesley, 2001. (ISBN: 0-201-67471-8) For students interested in security.

Here are some books on logic that are very good.o Joseph Robert Shoenfield. Mathematical Logic. A K Peters Limited, 2001. A

reprint of the classic.

oRaymond M. Smullyan. First-Order Logic. Dover Publications, Incorporated,January 1995.

o Herbert B. Enderton, Second Edition. A Mathematical Introduction to Logic.Academic Press, 2000.

Here are some books on set theory that I recommend.o Keith Devlin. The Joy of Sets: Fundamentals of Contemporary Set Theory, Second

Edition. Springer-Verlag, 1992. A excellent introduction to axiomatic set theory.

o Paul R. Halmos. Naive Set Theory. Van Nostrand, 1960. A classic book on settheory that is too elementary for our purposes, but does a really good job on the

topics it covers.

Here are some books on computability theory (aka recursive function theory) that Irecommend.

o Hartley Rogers. Theory of Recursive Functions and Effective Computability. Theclassic book on the subject.

o Cutland. Computability. A more elementary introduction to computability theory. Mechanized Formal Reasoning about Programs and Computing Machines, Bob Boyer

and J Moore, in R. Veroff (ed.), Automated Reasoning and Its Applications: Essays in

Honor of Larry Wos, MIT Press, 1996. This paper explains a formalization style that has

been extremely successful in enabling mechanized reasoning about programs and

machines, illustrated in ACL2. This paper presents the so-called ``small machine'' model,

an extremely simple processor whose state consists of the program counter, a RAM, an

execute-only program space, a control stack and a flag. The paper explains how to prove

theorems about such models.

Why Functional Programming Mattersby John Hughes. The question of what is afunctional programming language came up in class. This is a nice paper on the topic. A

possible project is to examine the issues in extending ACL2 so that it has some of the

features of modern functional programming languages such as Haskell. See the next item.

A Short Introduction to HaskellThis is available from theHaskell Web pageand isrelated to the previous item.
http://www.cs.utexas.edu/users/moore/acl2/http://www.cs.utexas.edu/users/moore/acl2/http://www.cs.utexas.edu/users/moore/acl2/http://www.cs.utexas.edu/users/moore/publications/acl2-books/OrderingInformation.htmlhttp://www.cs.utexas.edu/users/moore/publications/acl2-books/OrderingInformation.htmlhttp://www.cs.utexas.edu/users/moore/publications/acl2-books/OrderingInformation.htmlhttp://www.cs.utexas.edu/users/boyer/bm96.ps.Zhttp://www.cs.utexas.edu/users/boyer/bm96.ps.Zhttp://www.md.chalmers.se/~rjmh/Papers/whyfp.htmlhttp://www.md.chalmers.se/~rjmh/Papers/whyfp.htmlhttp://www.haskell.org/aboutHaskell.htmlhttp://www.haskell.org/aboutHaskell.htmlhttp://www.haskell.org/http://www.haskell.org/http://www.haskell.org/http://www.haskell.org/http://www.haskell.org/aboutHaskell.htmlhttp://www.md.chalmers.se/~rjmh/Papers/whyfp.htmlhttp://www.cs.utexas.edu/users/boyer/bm96.ps.Zhttp://www.cs.utexas.edu/users/moore/publications/acl2-books/OrderingInformation.htmlhttp://www.cs.utexas.edu/users/moore/acl2/


31/37


BoS-Sept11 31 of 37

ACL2 Theorems about Commercial Microprocessors, Bishop Brock, Matt Kaufmann andJ Moore, in M. Srivas and A. Camilleri (eds.) Proceedings of Formal Methods in

Computer-Aided Design (FMCAD'96), Springer-Verlag, pp. 275-293, 1996. The paper

sketches the system and two industrial applications: the AMD5K86 floating-point

division proof and the Motorola CAP DSP model. A Mechanically Checked Proof of IEEE Compliance of a Register-Transfer-Level

Specification of the AMD K7 Floating Point Multiplication, Division and Square Root

Instructions, David Russinoff, Advanced Micro Devices, Inc., January, 1998. This paper

is a tour de force in mechanical verification. The paper describes a mechanically verified

proof of correctness of the floating-point multiplication, division, and square root

instructions of The AMD K7 microprocessor. The instructions, which are based on

Goldschmidt's Algorithm, are implemented in hardware and represented by register-

transfer level specifications, the primitives of which are logical operations on bit vectors.

On the other hand, the statements of correctness, derived from IEEE Standard 754, are

arithmetic in nature and considerably more abstract. Therefore, the paper develops a

theory of bit vectors and their role in floating-point representations and rounding,

extending previous work in connection with the K5 FPU. The paper then presents the

hardware model and a rigorous and detailed proof of its correctness. All of the

definitions, lemmas, and theorems have been formally encoded in the ACL2 logic, and

every step in the proof has been mechanically checked with the ACL2 prover.

The FM9001 Microprocessor: Its Formal Specification and Mechanical CorrectnessProof. Pointers to papers describing the FM9001, a microprocessor that was formally

verified all the way to the netlist level, are given. The FM9001 was fabricated by LSI

Logic and rigourous testing has not uncovered any errors. The FM9001 also serves as

the target for the verified assembler, Piton, which in turn serves as the target of the

verified Gypsy compiler. All these systems comprise the CLI Stack. References to the CLI

Stack papers are given at the bottom of the Web page.

Mechanizing Proof: Computing, Risk, and Trust (Inside Technology) by Donald A.MacKenzie. MIT Press, 2001. MacKenzie compares proof as traditionally conducted by

human mathematicians, and formal, mechanized proof. He interviewed many of the key

players and carefully describes the history of the subject.

Module: Dissertation/Thesis/Project

The duration of this major project is one year. Students are required to undertakeinnovative and research oriented projects, which not only reflect their knowledge

gained in the previous two semesters but also additional knowledge gained fromtheir own effort. They must show the phase wise development of their project

submitting the appropriate documents at the end of each phase.

Industry would appreciate very much if a student uses the software engineeringmethodology even though they may not be able to guide adequately the software

process. A student must put in effort to find answers to questions about the

application, which will also enhance the value of the project report.
http://www.cs.utexas.edu/users/moore/publications/bkm96.ps.Zhttp://www.cs.utexas.edu/users/moore/publications/bkm96.ps.Zhttp://www.onr.com/user/russ/david/k7-div-sqrt.htmlhttp://www.onr.com/user/russ/david/k7-div-sqrt.htmlhttp://www.onr.com/user/russ/david/k7-div-sqrt.htmlhttp://www.onr.com/user/russ/david/k7-div-sqrt.htmlhttp://www.onr.com/user/russ/david/k7-div-sqrt.htmlhttp://www.onr.com/user/russ/david/k7-div-sqrt.htmlhttp://www.cli.com/hardware/fm9001.htmlhttp://www.cli.com/hardware/fm9001.htmlhttp://www.cli.com/hardware/fm9001.htmlhttp://www.cli.com/hardware/fm9001.htmlhttp://www.cli.com/hardware/fm9001.htmlhttp://www.cli.com/hardware/fm9001.htmlhttp://www.cli.com/hardware/fm9001.htmlhttp://www.onr.com/user/russ/david/k7-div-sqrt.htmlhttp://www.onr.com/user/russ/david/k7-div-sqrt.htmlhttp://www.onr.com/user/russ/david/k7-div-sqrt.htmlhttp://www.cs.utexas.edu/users/moore/publications/bkm96.ps.Z


32/37


BoS-Sept11 32 of 37

Tools Required

Unix OS Windows OS Rational Rose/Magic Draw /Proseidan MS SQL Server 2000


33/37


BoS-Sept11 33 of 37

CSE 612.4 SOFTWARE QUALITY ASSURANCETotal Hrs: 36 Credits: (3-0-3-4)

Software processes and productsISO and IEEE classifications of software life cycle processes. Software products and their

characteristics. Models of different classes of software products. Development process and its

products. Software Supporting life cycle processes their interrelations and relationships with theDevelopment process activities according to ISO and IEEE standards.

[3L]

Software quality and its assessmentSoftware quality and its models. The ISO software quality model software quality characteristicsand sub-characteristics. Software product metrics; internal, external and quality in use metrics.

Software quality measurement and assessment. The components of the software quality

assurance system. [6L]

Management components of software quality

The Software Management process, its activities and tasks according to ISO and IEEE standards.Project integration management, Project quality management, Project quality control. Process

metrics and Costs of software quality. [6L]

Pre-project software quality componentsContract review, Development and quality plans. [3L]

Software quality assurance components in the project life cycle

Integrating quality activities in the project life cycle. Reviews, Software testing strategies,Software testing implementation, Documentation control, Assuring the quality of software

maintenance components, Assuring the quality of external participants contributions.

[6L]

Standards, certification, and assessment

Quality management standards: ISO 9001:2000 Quality Management Systems Requirements.

ISO 9000-3:2004 Software Engineering.Guidelines for Application of ISO 9001:2000 toComputer Software.

CMMICapability Maturity Model Integration. [6L]

Software quality assurance project processes standardsISO/IEC 12207 and IEEE Std 12207.0 Software Life Cycle Processes. IEEE Std 730

Software Quality Assurance Plans. IEEE Std 730.1 Guide to Software Quality AssurancePlanning . IEEE Std 1012 Verification and Validation. IEEE Std 1028 Reviews.

[6L]

References:


34/37


BoS-Sept11 34 of 37

1. Fenton, Norman E., Pfleeger, Shari L. Software Metrics: A Rigorous & Practical Approach.

Second edition. International Thompson Publishing Company, 1997. ISBN: 0-534-95425-1.

2. Patton Ron. Software Testing. Second Edition. SAMS Publishing, 2006. ISBN 0-672-32798-

3. Kan Stephen H. Metrics and Models in Software Quality Engineering. Second Edition.Pearson Education Inc., 2003. ISBN 0-201-72915-6.


35/37


BoS-Sept11 35 of 37

CSE612.5 SOFTWARE ARCHITECTING


1. Introduction to Software Architecture [2L]

Software Architecture, Relationships to Other Disciplines, Multi-Disciplinary Overview,

Foundations of Software Architecture, Software architecture in the context of the overallsoftware life cycle, Architectural Styles, CASE study of Architectures.

2. Software Architecture Design [8L]

Designing, Describing, and Using Software Architecture,IS2000: The Advanced Imaging

Solution, Global Analysis, Conceptual Architecture View, Module Architecture View, Styles ofthe Module View type, Execution Architecture View, Code Architecture View, Component-and-

Connector View type, Style of Component-and-Connector View type Allocation View type andStyles, Documenting Software Interfaces, Documenting Behavior, Choosing the Views, Buildingthe Documentation Package.

3. Archetype Patterns [3L]

Archetypes and Archetype Patterns, Model Driven Architecture with Archetype Patterns,

Literate Modeling, Archetype Pattern, Customer Relationship Management (CRM) ArchetypePattern, Product Archetype Pattern, Quantity Archetype Pattern, Rule Archetype Pattern.

4. Introduction to Design Patterns and Pattern Types [5L]

Design Patterns, Creational Patterns, Patterns for Organization of Work, Access ControlPatterns, Service Variation Patterns, Service Extension Patterns, Object Management Patterns

Adaptation Patterns, Communication Patterns, Architectural Patterns, Structural Patterns,

Patterns for Distribution, Patterns for Interactive Systems Adaptable Systems, Frameworks and

Patterns, Analysis Patterns.

5. Advanced Patterns [2L]

Patterns for Concurrent and Networked Objects, Patterns for Resource Management, Pattern

Languages, Patterns for Distributed Computing.

6. Enterprise Architecture Integration [6L]

Defining EAI, Data-Level EAI, Application Interface-Level EAI, Method- Level EAI, User

Interface-Level EAI, The EAI ProcessMethodology or Madness, An Introduction to EAI and

Middleware, Transactional Middleware and EAI,RPCs, Messaging, and EAI, Distributed Objectsand EAI, Database- Oriented Middleware and EAI, Java Middleware and EAI, Implementing


36/37


BoS-Sept11 36 of 37

and Integrating Packaged Applications, The General Idea, XML and EAI, Message Brokers, The

Preferred EAI Engine, Process Automation and EAI.

7. Electronic Data Interchange [2L]

Defining EDI, an Introduction to EDI and Middleware, Data processing and EDI , ProcessMethodology, Messaging, EDI flow and Implementation.

8. Enterprise Architecture Patterns [8L]

Layering, Organizing Domain Logic, Mapping to Relational Databases, Web Presentation,

Domain Logic Patterns, Data Source Architectural Patterns, Object-Relational Behavioral

Patterns, Object-Relational Structural Patterns, Object-Relational Metadata Mapping Patterns,

Web Presentation Patterns, Distribution Patterns, Offline Concurrency Patterns.

Reference Books:

1. Applied Software Architecture ,Christine Hofmeister, Robert Nord, Deli Soni,

Addison-Wesley Professional; 1st edition (November 4, 1999) ,

ISBN-10:0201325713 , ISBN-13: 978-0201325713

2. Essential Software Architecture, Ian Gorton Springer; 1 edition (2006) ISBN-10: 3540287132

ISBN-13: 978-3540287131

3. Documenting Software Architectures: Views and BeyondPaul Clements,

Software Engineering Institute, Felix Bachmann Len Bass, Software

Engineering Institute David Garlan James Ivers Reed Little Robert Nord Judith StaffordPublisher:

Addison-Wesley Professional 2003 ISBN-10: 0201703726

ISBN-13: 9780201703726

4. Pattern-Oriented Software Architecture Volume 1, 2, 3, 4, 5 by Frank Buschmann, Hans

Rohnert, Kevin Henney, Douglas C. Schmidt, Publisher: Wiley; 1 edition (August 8, 1996-2004)

ISBN-10: 0471958697 ISBN-13: 978- 0471958697

5. Design Patterns: Elements of Reusable Object-Oriented Software (Addison- Wesley

Professional Computing Series) by Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides

Publisher: Addison-Wesley Professional; 1st edition(January 15, 1995) ISBN-10: 0201633612 ISBN-13: 978-0201633610

6. Patterns of Enterprise Application Architecture, Martin Fowler, Addison- WesleyProfessional, 2003, ISBN-10: 0321127420 ISBN-13: 9780321127426

7 EDI - A Guide to Electronic Data Interchange and Electronic Commerce Applications in theHealthcare Industry - James L. Moynihan and Marcia L. - Irwin Professional Publishing, 1996
http://www.isoc.org/inet97/proceedings/C5/C5_1.HTM#DPhttp://www.isoc.org/inet97/proceedings/C5/C5_1.HTM#DP


37/37


Electronic Data Interchange - Paul Kimberley, McGraw Hill, 1991

8. Enterprise Integration: An Architecture for Enterprise Application and SystemsIntegration, Fred A. Cummins, Wiley; 2002 ISBN-10: 0471400106 ISBN-13:

978-0471400103

Master of Science -Technology in CS (1)

Documents

Transcript of Master of Science -Technology in CS (1)