M. Tech. in Software Engineering (Computer Science and ... M. Tech. Software Engg.pdf · Graph...

School of Engineering & Technology

Syllabi and Course Structure

M. Tech. in Software Engineering

(Computer Science and Engineering)

Academic Programmes

July, 2013

Faculty of Engineering & Technology

M.Tech. in Computer Science & Engineering (Software Engineering)

Course Structure First Semester

FIRST SEMESTER

yr Sub Code Sub Name L T P C

I M11007 Software Engineering Design Methodology 4 0 0 4

M11001 Advanced Topics in Algorithm Design 4 0 0 4

M11008 Software Project Management 4 0 0 4 M111**/M11003

Elective – I 3 0 0 3

M111** Elective – II 3 0 0 3 Elective-I Lab 0 0 4 2 M11005 Advanced Software Engineering Lab 0 0 4 2 M11009 Seminar 0 0 2 1 TOTAL 18 0 10 23

Second Semester

SECOND SEMESTER

Sub Code Sub Name L T P C

M12013 Software Architecture 4 0 0 4

M12014 Software Testing 4 0 0 4

M12015 Service Oriented Architecture 4 0 0 4

G11007 Research Methodology & Technical communication 3 0 0 3

M121** Elective –III 3 0 0 3

M121** Elective –IV 3 0 0 3

M12016 Software Testing Lab 0 0 4 2

Elective Lab 0 0 4 2

M12017 Project 0 0 4 2

TOTAL 21 0 12 27

Third Semester

THIRD SEMESTER

II M13003 Dissertation-I 0 0 0 20

TOTAL 0 0 0 20

Fourth Semester

FOURTH SEMESTER

M14003 Dissertation-II 0 0 0 20

TOTAL 0 0 0 20


M.Tech. in Computer Science & Engineering (Software Engineering)

Proposed ELECTIVE Theory Subjects:

Code Elective: I Code Elective: II Code Elective: III Code Elective: IV M11003

Advanced Operating System

M11106

Digital Image

Processing

M12110

Artificial Intelligence

and Expert system

M12116

Distributed Algorithms

M11102

Client server programming

M11105

Mobile computing M12113

Performance

Evaluation and

Reliability of

Information System

M12117

High Performance Scientific Computing

M11103

Optical network M12112

Grid computing M12111

Distributed and

Cloud Computing

M12118

Database Engineering

M111

04 Information system security

M111

10 Geographic

Information system

M12115

Software Construction (Design Pattern)

M12119

Information Retrieval


M.Tech. in Computer Science & Engineering (Software Engineering) Semester I Contact Hours (L-T-P): 4-0-0

M11007- Software Design Methodology: Course Outlines Principles and Motivations

Definitions and need for engineered approach to software development; Software development process

models from the points of view of technical development and project management: waterfall, rapid

prototyping, incremental development, spiral models, emphasis on computer-assisted environments.

Introduction to Modeling Tools

Basics of object-oriented approach, object-oriented programming and languages, OMT, visual

modeling, UML, Rational Rose Tool

Object Modeling and Design

Classes, objects, relationships, key abstractions, common mechanisms, diagrams, class diagrams,

advanced classes, advanced relationships, interfaces, types, roles, packages, instances, object diagrams,

interactions, use cases, use case diagrams, interaction diagrams, activity diagrams, events and signals,

state machines, processes, threads, state chart diagrams, components, deployment, collaborations,

patterns and frameworks, component diagrams, systems and models, code generation and reverse

engineering.

Software Development Methods

Formal, semi-formal and informal methods; Requirements elicitation, requirements specification; Data,

function, and event-based modeling; Some of the popular methodologies such as Yourdon’s SAD,

SSADM etc; CASE tools-classification, features, strengths and weaknesses; ICASE; CASE standards.

Software Project Management

Principles of software projects management; Organizational and team structure; Project planning;

Project initiation and Project termination; Technical, quality, and management plans; Project control;

Cost estimation methods - Function points and COCOMO.

References:

1. Roger Pressman; Software Engineering - A Practitioner’s Approach, McGraw Hill,

New York.

2. Ian Sommerville; Software Engineering, Addison-Wesley Publishing Company, England

3. Pankaj Jalote; An integrated Approach to Software Engineering, Narosa Publishing House, New

Delhi.

4. Grady Booch, James Rumbaugh, Ivar Jacobson, The Unified Modeling Language User Guide,

Pearson Education, New York.

5. James Rumbaugh, Ivar Jacobson, Grady Booch: The Unified Modeling Language Reference Manual,

Addison-Wesley, New YorkGrady Booch, Object-Oriented Analysis and Design, Pearson Education,

New York.

6. Terry Quatrani, Visual Modeling with Rational Rose 2000 and UML, Addison- Wesley, New York.



M11001- Advanced Topics in Algorithm Design: Course Outlines Advanced Data Structure: Graph, B-tree, binomial heaps and, Fibbonacci heap.

Graph Algorithms: Single source shortest paths-Belman-Ford algorithm, Dijkistra algorithm, all pairs

shortest path and matrix multiplication, Floyad-Warshall alhm, Johnson algorithm for parse graph,

maximum flow-Ford-Fulkusonmethod and maximum bipartite matching.

Linear Programming: The simplex algorithm and duality.

Number Theoretic Algorithm: GCD, modular arithmetic, solving modular linear equation and Chinese

remainder theorem.

NP Completeness: Polynomial time, polynomial time verification, NP completeness and

reducibility, Cook’s theorem, NP complete problems-clique problem, vertex cover problem,

approximation algorithms-vertex cover problem, set covering problem, traveling salesman

problem.

Probabilistic Algorithms: Numerical probabilistic algorithm, Monte-Carlo algorithm and Las-Vegas

algorithm.

Parallel Algorithms: Model for parallel computation, basic techniques, work and efficiency,

parallel evaluation of expressions, parallel sorting networks and parallel sorting.

Suggested Books

1. Cormen T.H., Leiserson C.E., Rivest R.L., Introduction to Algorithms , Prentice Hall of

India

2. Brassad G. & Bratley P., Fundamentals of Algorithmics , Prentice Hall of India

3. Basse S., Computer Algorithms - Introduction to Design and Analysis , Addison Wesley



M11008- Software Project Management: Course Outlines

Introduction to Project Management: Definition of the Project, Project Specification and parameters,

Principles of Project Management, Project Management Life Cycle

Software Project Planning, Project Activities and Work Breakdown Structure, Activity Resource

Requirements, Project Management Plan , PERT & CPM \

Project Scheduling and Tracking Techniques: Why projects are delayed? Effort Estimation

Techniques, Task Network and Scheduling Methods, Monitoring and Control Progress, Graphical

Reporting Tools

Project Economics: Project Costing, Empirical Project Estimation Techniques, Decomposition

Techniques, BEP, Automated Estimation Tools

Risk Analysis and Management: Risk Mitigation and Management, Software Metrics and Project

Management

Project Control and Closure, Project Management Issues with regard to New Technologies

Suggested Readings:

1 Clements and Gido, Effective Project Management, Thomson India Edition

2 Bob Hughes and Mike Cotterell, “Software Project Management”, Third Edition,

McGraw-Hill

3 Pankaj Jalote, “Software Project Management in Practice”, Pearson Education Asia.

4 Robert T. Futrell, Donald F. Shafer, and Linda I.. Shafer, “Quality Software Project

Management”, Pearson Education Asia.

5 Ramesh Gopalaswamy, “Managing Global Software Projects”, Tata McGraw-Hill



M11005- Advanced Software Engineering Lab: Course Outlines

List of Experiments

Students will Identify Projects they will be working on in this Lab. Once Projects are

Identified then they will work on objectives given for the projects below

1. To perform the user’s view analysis: Use case diagram for

2. To perform the system analysis: Requirement analysis, SRS

3. To perform the function oriented diagram: DFD and Structured chart

4. To perform the user’s view analysis: Use case diagram

5. To draw the structural view diagram: Class diagram, object diagram

6. To draw the behavioral view diagram: Sequence diagram, Collaboration diagram

7. To draw the behavioral view diagram: State-chart diagram, Activity diagram

8. To draw the implementation view diagram: Component diagram.

9. To draw the implementation view diagram: deployment diagram

10. To perform various techniques for testing using manual Testing


M.Tech. in Computer Science & Engineering (Software Engineering) Semester II Contact Hours (L-T-P): 4-0-0

M12013- Software Architecture: Course Outlines

Introduction to Software Architecture, The 4+1 View of Software Architecture, Examples of Software

Architecture, Architecture Design : Quality attributes, Attribute Driven Design, Architecture Centric

Software Development Methodology, Design Patterns, Software Design Function Oriented vs. Object

Oriented, Documenting Software Architecture, Stakeholders, Views, View sets, View-based

Documentation, IEEE 1471, ISO 42010, Architecture Description Languages , Architecture Evaluation,

Product line architectures, Enterprise Architecture , Architecture Knowledge Management

References:

1. Software Architecture in Practice, Len Bass, Paul Clements, Rick Kazman.

2. Documenting Software Architectures: Views and Beyond Paul Clements, Felix Bachmann, Len Bass,

David Garlen, James Ivers, Reed Little, Robert Nord, Judith Stafford



M12014- Software Testing: Course Outlines

1. Fundamentals of Testing Human and errors, Testing and Debugging, Software Quality, Requirement Behavior and Correctness,

Fundamentals of Test Process, Psychology of Testing, General Principles of Testing, Test Metrics

2. Role of Testing in SDLC

Review of software development models (Waterfall Models, Spiral Model, W Model, V Model) Agile

Methodology and Its Impact on testing, Test Levels (Unit, Component, Module, Integration, System,

Acceptance, Generic)

3. Approaches to Testing

Static Testing : Structured Group Examinations, Static Analysis: Control flow & Data flow, Determining

Metrics

Dynamic Testing

Black Box Testing : Equivalence Class Partitioning, Boundary Value Analysis, State Transition Test, Cause

Effect Graphing and Decision Table Technique and Used Case Testing and Advanced black box techniques

White Box Testing

Statement Coverage, Branch Coverage, Test of Conditions, Path Coverage, Advanced White Box

Techniques, Instrumentation and Tool Support Gray Box Testing, Intuitive and Experience Based Testing

5. Test Management

Test Organization :Test teams, tasks and Qualifications, Test Planning: Quality Assurance Plan, Test Plan,

Prioritization Plan, Test Exit Criteria, Cost and economy Aspects, Test Strategies:Preventive versus Reactive

Approach, Analytical versus heuristic Approach Test Activity Management, Incident Management,

Configuration Management ,Test Progress Monitoring and Control,Specialized Testing: Performance, Load,

Stress & Security Testing

6. Testing Tools

Automation of Test Execution, Requirement tracker, High Level Review , Types of test Tools:Tools for test

management and Control, Test Specification, Static Testing, Dynamic Testing, Non functional testing

,Selection and Introduction of Test Tools:Tool Selection and Introduction, Cost Effectiveness of Tool

Introduction

7. Testing Object Oriented Software

Introduction to OO testing concepts, Differences in OO testing Term

References: 1. Software Testing Foundations, Andreas Spillner, Tilo Linz, Hans Schaefer, Shoff Publishers and

Distributors

2. Software Testing: Principles and Practices by Srinivasan D and Gopalswamy R, PearsonEd, 2006

3. Foundations of Software Testing by Aditya P. Mathur – Pearson Education custom edition 2000



M12015-Service Oriented Architecture: Course Outlines 1. SOA Fundamental:

Defining SOA, Business Value of SOA, Evolution of SOA, SOA characteristics, concept of a

service in SOA, misperceptions about SOA, Basic SOA architecture, infrastructure services,

Enterprise Service Bus (ESB), SOA Enterprise Software models, IBM On Demand operating

environment

2. SOA Planning and Analysis:

Stages of the SOA lifecycle, SOA Delivery Strategies, service-oriented analysis, Capture and

assess business and IT issues and drivers, determining non-functional requirements (e.g.,

technical constraints, business constraints, runtime qualities, non-runtime qualities), business

centric SOA and its benefits, Service modelling, Basic modelling building blocks, service models

for legacy application integration and enterprise integration, Enterprise solution assets(ESA)

3. : SOA Design and Implementation :

Service-oriented design process, design activities, determine services and tasks based on business

process model, choosing appropriate standards, articulate architecture, mapping business

processes to technology, designing service integration environment (e.g., ESB, registry), Tools

available for appropriate designing, implementing SOA, security mplementation, implementation

of integration patterns, services enablement, quality assurance

4. Managing SOA Environment :

Distributing service management and monitoring concepts, operational management challenges,

Service-level agreement considerations, SOA governance (SLA, roles and responsibilities,

policies, critical success factors, and matrices), QoS compliance in SOA governance, role of ESB

in SOA governance, impact of changes to services in the SOA lifecycle

Reference Books : 1. Thomas Erl, “Service-Oriented Architecture: Concepts, Technology, and Design”,

Prentice Hall Publication, 2005.

2. Norbert Bieberstein, Sanjay Bose, Marc Fiammante, Keith Jones, Rawn Shah, Service-

Oriented Architecture Compass: Business Value, Planning, and Enterprise Roadmap”,

IBM Press Publication, 2005.



G11007-Research Methodology & Technical Communication: Course Outlines

Research: Meaning & Purpose, Review of literature, Problem definition/Formulation of research

problem, Research proposal, Variables, Hypothesis, types, construction of hypothesis

Classification of research: Quantitative research: Descriptive Research, Experimental Research

Qualitative research: Observational studies, Historical research, Focus group discussion, Case study

method,

Sources of data collection: Primary and Secondary Data Collection, Sample and Sampling technology,

Non-probability and Probability Sampling

Tools for data collection: Tests, Interview, Observation, Questionnaire/ Schedule, Characteristics of a

good test, Statistics: Descriptive and Inferential Statistics

Data Analysis, Report Writing, Results and References,

Thesis Writing and Journal Publications: Writing thesis, Writing journal and conference papers,

IEEE and Harvard style of referencing, Effective presentation, Copyrights, and Avoid plagiarism



M11003- Advanced Operating System: Course Outlines

Operating System: Definition, Operating System as Resource Manager. Types of Operating Systems:

Simple Batch Processing, Multi-programmed Batch Processing, Time Sharing, Personal Computer

systems, Parallel, Distributed and Real Time Operating Systems. Operating System Components,

Services, Calls, System Programs, Operating System Structure, Virtual Machines, System Design and

Implementation.

Process Management: Concepts, Scheduling, Operations, Co-operating processes, Inter-process

Communication. Threads: Thread usage, threads in User Space, threads in Kernel, Hybrid

Implementation, Scheduler Activation, Pop-up threads, Multithreading.

CPU Scheduling: Basic Concepts, Scheduling Criteria, Algorithms, Multiple-processor Scheduling,

Real Time Scheduling, Algorithm Evaluation.

Process Synchronization: Critical Section Problem, Synchronization Hardware, Semaphores, Classical

Problem of synchronization, Critical Regions, Monitors. Deadlock: Characteristics, Necessary

Conditions, Prevention, Avoidance, Detection and Recovery.

Memory Management: Logical and Physical Address Space, Swapping. Contiguous Allocation:

Singlepartitioned, Multi-partitioned. Non-contiguous Allocation: Paging, Segmentation, and

Segmentation with Paging. Virtual Memory: Demand Paging, Page Replacement Algorithms, Allocation

of Frames, Thrashing, Demand Segmentation.

File and Directory System: File Concepts, Access Methods, Directory Structure, Protection, File system

Structure, Allocation Methods, Free Space Management, Directory Implementation, Recovery.

Secondary Storage Management: Disk Structure, Dedicated, Shared, Virtual, Sequential Access and

Random Access Devices, Disk Scheduling, Disk Management, Swap-space Management, Disk

Reliability, Stable Storage Management.

Protection and Security: Threats, Intruders, Accidental Data Loss, Cryptography, User authentication,

Attacks from inside the system, Attacks from outside the system, Protection Mechanism, Trusted Systems,

Domain of Protection, Access Matrix, Programs Threats, System Threats.

Distributed systems, topology network types, design strategies. Network operating structure, distributed

operating system, remote services, and design issues. Distributed file system: namingvand transparency,

remote file access, Stateful v/s Stateless Service, File Replication.

Distributed co-ordinations: Event Ordering, Mutual Exclusion, Atomicity, Concurrency Control,

Deadlock Handling, Election Algorithms, Reaching Agreement. Case studies of Unix and MS-DOS

operating system.

Suggested Books

1. Silberschatz and Galvin, "Operating System Concepts", Addison-Wesley publishing, Co.,1999.

2. A. S. Tanenbaum, “Modern Operating Systems”, Pearson Education.

3. H.M. Dietel, “An Introduction to Operating System”, Pearson Education.

4. D. M. Dhamdhere, “Operating Systems – A Concept Based Approach”, Tata McGraw-Hill

5 M. Singhal, N. G. Shivaratri, “Advanced Concepts in Operating Systems”, Tata McGraw



M11102- Client Server Programming: Course Outlines 1. Concurrent Processing in Client-Server software: Introduction, Concurrency in Networks,

Concurrency in Servers, Terminology and Concepts, An example of Concurrent Process Creation,

Executing New Code, Context Switching and Protocol Software Design, Concurrency and Asynchronous

I/O.

2. Program Interface to Protocols: Introduction, Loosely Specified Protocol Software Interface,

Interface Functionality, Conceptual Interface Specification, System Calls, Two Basic Approaches to

Network Communication, The Basic I/O Functions available in UNIX, Using UNIX I/O with TCP/IP.

3. The Socket Interface: Introduction, Berkley Sockets, Specifying a Protocol Interface, The Socket

Abstraction, Specifying an End Point Address, A Generic Address Structure, Major System Calls used

with Sockets, Utility Routines for Integer Conversion, Using Socket Calls in a Program, Symbolic

Constants for Socket Call Parameters.

4. Algorithms and Issues in Client Software Design: Introduction, Learning Algorithms instead of

Details, Client Architecture, Identifying the Location of a Server, Parsing an Address Argument,

Looking up a Domain Name, Looking up a well-known Port by Name, Port Numbers and Network Byte

Order, Looking up a Protocol by Name, The TCP Client Algorithm, Allocating a Socket, Choosing a

Local Protocol Port Number, A fundamental Problem in choosing a Local IP Address, Connecting a

TCP Socket to a Server, Communicating with the Server using TCP, Reading a response from a TCP

Connection, Closing a TCP Connection, Programming a UDP Client, Connected and Unconnected

UDP Socket, Using Connect with UDP, Communicating with a Server using UDP, Closing a Socket that

uses UDP, Partial Close for UDP, A Warning about UDP Unreliability.

5. Algorithms and Issues in Server Software Design: Introduction, The Conceptual Server Algorithm,

Concurrent Vs Iterative Servers, Connection-Oriented Vs Connectionless Access, Connection-Oriented

Servers, Connectionless Servers, Failure, Reliability and Statelessness, Optimizing Stateless Servers,

Four Basic Types of Servers, Request Processing Time, Iterative Server Algorithms, An Iterative

Connection-Oriented Server Algorithm, Binding to a Well Known Address using INADDR_ANY, Placing

the Socket in Passive Mode, Accepting Connections and using them. An Iterative Connectionless Server

Algorithm, Forming a Reply Address in a Connectionless Server, Concurrent Server Algorithms, Master

and Slave Processes, A Concurrent Connectionless Server Algorithm, A concurrent Connection-

Oriented Server Algorithm, Using separate Programs as Slaves, Apparent Concurrency using a Single

Process, When to use each Server Types, The Important Problem of Server Deadlock, Alternative

Implementations.

6. Iterative, Connectionless Servers (UDP): Introduction, Creating a Passive Socket, Process Structure,

An example TIME Server.

7. Iterative, Connection-Oriented Servers (TCP): Introduction, Allocating a Passive TCP Socket, A

Server for the DAYTIME Service, Process Structure, An Example DAYTIME Server, Closing

Connections, Connection Termination and Server Vulnerability.

8. Concurrent, Connection-Oriented Servers (TCP): Introduction, Concurrent ECHO, Iterative Vs

Concurrent Implementations, Process Structure, An example Concurrent ECHO Server, Cleaning up

Errant Processes

TEXT BOOK:

1. Douglas E.Comer, David L. Stevens: Internetworking with TCP/IP – Vol. 3, Client-Server

Programming and Applications, BSD Socket Version with ANSI C, 2nd Edition, Pearson, 2001.

liam Stallings, “Operating Systems”, Pearson Education


M.Tech. in Computer Science & Engineering (Information Security) Semester I Contact Hours (L-T-P): 3-0-0

M11103-Optical Network: Course Outlines

1. Introduction: Three generations of Digital Transport Networks; A brief introduction to WDM and

TDM; The Optical Marketplace; Wireless Optical Systems; Key Optical Nodes; Other Key Terms;

Evolution of Optical Systems; Key attributes of Optical Fiber.

2. Telecommunications Infrastructure: The Local Connections; The Backbone Connections; The

Digital Multiplexing Hierarchy; The Digital Signaling Hierarchies; T1 / DS1 and T3 / DS3; The

Layered Protocol Model in the Transport Network; considerations for Interworking Layer1, Layer 2,

and Layer 3 Networks.

3. Characteristics of Optical Fiber: The Basics; The Wavelength; The Basic Components; Structure of

the Fiber; Fiber Types; Key Performance Properties of Fiber; Attenuation; Amplifier Spontaneous

Emission; Chromatic Dispersion; Lasers.

4. Timing and Synchronization: Timing and Synchronization in Digital Networks; Effect of a Timing

error; The Clocking Signal; Types of Timing in Networks; Timing Variations; Methods of Clock

Exchange; Distribution of Timing Using SONET and DS1; Timing Downstream Devices; Building

Integrated Timing Supply; Synchronization Status Messages and Timing Loops.

5. SONET and SDH: Introduction; The SONET Multiplexing Hierarchy; SONET and SDH Multiplexing

Structure; The SONET / SDH Frame Structure; SONET and SDH Functional Components; SONET and

SDH Problem Detection; Locating and Adjusting Payload with Pointers; Virtual Tributaries in more

detail; Virtual Tributaries in Virtual Containers; The Overhead Bytes; SONET and SDH Concatenation.

TEXT BOOKS:

1. Uyless Black: Optical Networks, Pearson Education Asia, 2002.

REFERENCE BOOKS:

1. Rajiv Ramaswami and Kumar N.Sivaranjan: Optical Networks - A Practical Perspective, Morgan

Kaufuann, 2000.

2. Paul E.Green Jr.: Fiber Optic Network, Prentice Hall, 1993.

3. Jeff Hecht: Understanding Fiber Optics, 4th Edition, PHI 1999.



M11104-Information System Security: Course Outlines

Introduction to Securities: Introduction to security attacks, services and mechanism, Classical

encryption techniques substitution ciphers and transposition ciphers, cryptanalysis, steganography,

Stream and block ciphers. Modern Block Ciphers: Block ciphers principles, Shannon’s theory of

confusion and diffusion, fiestal structure, Data encryption standard (DES), Strength of DES, Idea of

differential cryptanalysis, block cipher modes of operations, Triple DES

Modular Arithmetic: Introduction to group, field, finite field of the form GF(p), modular arithmetic,

prime and relative prime numbers, Extended Euclidean Algorithm, Advanced Encryption Standard

(AES) encryption and decryption Fermat’s and Euler’s theorem, Primality testing, Chinese Remainder

theorem, Discrete Logarithmic Problem, Principals of public key crypto systems, RSA algorithm,

security of RSA

Message Authentication Codes: Authentication requirements, authentication functions, message

authentication code, hash functions, birthday attacks, security of hash functions, Secure

hash algorithm (SHA)

Digital Signatures: Digital Signatures, Elgamal Digital Signature Techniques, Digital signature

standards (DSS), proof of digital signature algorithm

Key Management and distribution: Symmetric key distribution, Diffie-Hellman Key Exchange, Public

key distribution, X.509 Certificates, Public key Infrastructure.

Authentication Applications: Kerberos

Electronic mail security: pretty good privacy (PGP), S/MIME.

IP Security: Architecture, Authentication header, Encapsulating security payloads, combining security

associations, key management. Introduction to Secure Socket Layer, Secure electronic, transaction

(SET).

System Security: Introductory idea of Intrusion, Intrusion detection, Viruses and related threats,

firewalls.

Suggested Books:

1. William Stallings, “Cryptography and Network Security: Principals and Practice”,

Pearson Education.

2. Behrouz A. Frouzan: Cryptography and Network Security, TMH

3. Bruce Schiener, “Applied Cryptography”. John Wiley & Sons

4. Bernard Menezes,” Network Security and Cryptography”, Cengage Learning.

5. Atul Kahate, “Cryptography and Network Security”, TMH



M11106-Digital Image Processing: Course Outlines

Fundamentals Of Image Processing

Introduction, Elements of visual perception, Steps in Image Processing Systems, Image Acquisition,

Sampling and Quantization, Pixel Relationships, Colour Fundamentals and Models,

File Formats. Introduction to the Mathematical tools.

Image Enhancement and Restoration

Spatial Domain Gray level Transformations Histogram Processing Spatial Filtering, Smoothing and

Sharpening. Frequency Domain: Filtering in Frequency Domain, DFT, FFT, DCT, Smoothing and

Sharpening filters, Homomorphic Filtering., Noise models, Constrained and Unconstrained restoration

models.

Image Segmentation and Feature Analysis

Detection of Discontinuities, Edge Operators, Edge Linking and Boundary Detection, Thresholding,

Region Based Segmentation, Motion Segmentation, Feature Analysis and Extraction.

Multi Resolution Analysis and Compressions

Multi Resolution Analysis: Image Pyramids – Multi resolution expansion – Wavelet Transforms,

Fast Wavelet transforms, Wavelet Packets. Image Compression: Fundamentals, Models, Elements of

Information Theory, Error Free Compression, Lossy Compression, Compression Standards

JPEG/MPEG.

Applications of Image Processing

Representation and Description, Image Recognition, Image Understanding, Image Classification,

Video Motion Analysis, Image Fusion, Steganography, Colour Image Processing.

Suggested Books:

1. Digital Image Processing - Dr. S.Sridhar Oxford University Press



M11105-Mobile Computing: Course Outlines

Overview of Mobile Computing: Iits applications, Radio Communication, Mobile Computing

Architecture, Mobile System Networks, Data Dissemination, Mobility Management,

Introduction to Cellular network: components, Architecture, Call set-up, Frequency Reuse and Co-

channel cell, Cell Design, Interference, Channel assignment, Hand Off;

Cellular Network Standards: Digital cellular communication, Multiple Access Techniques: FDMA,

TDMA, CDMA. GSM: System Architecture, Mobile services & features, Protocols, Radio interface,

Handover, GSM Channels, Localization and calling, User validation; General Packet Radio Service;

Introduction to CDMA based systems; Spread spectrum in CDMA systems; coding methods in CDMA;

IS-95

Wireless LAN: Wireless LAN (Wi-Fi) Architecture and protocol layers; WAP Architecture; Bluetooth

Architecture: Layers, Security in Bluetooth;

Mobile Ad-hoc and Sensor Networks: Introduction, MANET, Routing in MANET‟s Wireless

Sensor Networks, Applications; Mobile Devices: Mobile Agent, Application Server, Gateways,

Portals, Service Discovery, Device Management,

Support for Mobility: Mobile IP: Architecture, Packet delivery and Hand over Management, Location

Management, Registration, Tunneling and Encapsulation, Route optimization, DHCP.

Mobile Transport Layer: Conventional TCP/IP transport protocols, Indirect TCP, Snooping TCP,

Mobile TCP

Suggested Books

1 Jochen Schiller, “Mobile Communications”, Second Edition, Pearson Education, 2004.

2. Raj Kamal, “Mobile Computing”, Oxford Higher Education, 2008.

3. Sipra DasBit, Biplab K. Sikdar, “Mobile Computing”, PHI, 2009.

4. William C.Y.Lee, “Mobile Cellular Telecommunications”, Second Edition, (Tata McGraw- Hill),

2006.



M12112-Grid Computing: Course Outlines

Grid Computing: values and risks – History of Grid computing, Grid computing model and protocols,

Overview and types of Grids.

Desktop Grids : Background, Definition, Challenges, Technology, Suitability, Grid server and practical

uses, Clusters and Cluster Grids, HPC Grids, Scientific in sight, Application and Architecture, HPC

application, Development Environment and HPC Grids, Data Grids, Alternatives to Data Grid, Data

Grid architecture.

The open Grid services Architecture, Analogy, Evolution, Overview, Building on the OGSA platform,

Implementing OGSA based Grids, Creating and Managing services, Services and the Grid, Service

Discovery, Tools and Toolkits, Universal Description Discovery and Integration

Desktop Supercomputing, Parallel Computing, Parallel Programming Paradigms, Problems of Current

parallel Programming Paradigms, Desktop Supercomputing Programming Paradigms, Parallelizing

Existing Applications, Grid Enabling Software Applications, Needs of the Grid users, methods of Grid

Deployment, Requirements for Grid enabling Software, Grid Enabling Software Applications.

Application integration, Application classification, Grid requirements, Integrating applications with

Middleware platforms, Grid enabling Network services, Managing Grid environments, Managing Grids,

Management reporting, Monitoring, Data catalogs and replica management, Portals, Different

application areas of Grid computing.

Suggested Books:

1. Ahmar Abbas, “Grid Computing: A Practical Guide to Technology and Applications”,

Firewall Media, 2004.

2. Joshy Joseph and Craig Fellenstein, “Grid Computing”, Pearson Education, 2001.

3. Ian Foster and Carl Kesselman, “Grid Blue Print for New Computing Infrastructure”,

Morgan Kaufmann, 2000.

4. Fran Berman, Geoffrey Fox and Anthony J. G. Hey, “Grid Computing: Making the Global

Infrastructure a Reality”, Willy Publisher, 2001



M11110-Geographic Information System: Course Outlines

Introducing GIS and spatial data: Definition - maps and spatial information, computer assisted

mapping and map analysis, components of GIS, people and GIS, maps and spatial data, thematic

characteristics of spatial data, other sources of spatial data: census, survey data, air photos, satellite

images, field data. Spatial and attributes data modeling and Management: Data quality and data

standards: Concepts, Definition, Components and assessment of data quality: Spatial entities,

generalization, Raster and Vector spatial data structures, comparison of Vector and Raster Methods ,

Acquisition of spatial data for terrain modeling, Raster and Vector approach to digital terrain modeling,

modeling network , layered approach and object, oriented approach, modeling third and fourth

dimension, problem of data management, database management system - relational database model -

liking spatial and attribute data - GIS database application and development.

Data Input and Editing: Integrated GIS database , Encoding methods of data input: keyboard, manual

digitizing scanning and automatic digitizing methods, electronic data transfer, data editing: methods of

developing and correcting errors in attributes and spatial data: reproduction, transformation and

generalization, edge matching and rubber sheeting, integrated database.

Data Analyzing Operation in GIS: Terminologies, Measurements of lengths, perimeter and

area in GIS, queries, reclassification, buffering and neighborhood functions, integrated data, Raster and

Vector overlay method: point-in-polygon, line-in-polygon and polygon- on-polygon, problems of Raster

and Vector overlays, spatial interpolation, GIS for surface analysis, network analysis: shortest path

problem, travailing problem, location allocation of resources, route tracing.

GIS Modeling for decision support: Models of spatial processes: natural and scale analogue

models , conceptual models, mathematical model, models of physical and environmental processes,

modeling human process, gravity model, problems related to using GIS to model spatial processes.

Maps as output, alternative cartographic outputs, non-cartographic outputs, spatial multimedia,

delivery mechanism, GIS and spatial decision supports, maps as decision tools.

Suggested Books

1. Haywood.L, Comelius.S and S. Carver (1988) An Introduction to Geographical

Information Systems, Addison Wiley Longmont, New York.

2. Burgh P.A (1986) Principles of geographical Information System for Land Resources

Assessment, Clarendon Press, Oxford.

3. Burrough P A 2000 P A McDonnell [2000] Principles of Geographical Information

systems, London: Oxford University Press.


M.Tech. in Computer Science & Engineering (Information Security) Semester II Contact Hours (L-T-P): 3-0-0

M12110-Artificial Intelligence and Expert System: Course Outlines Overview of Artificial Intelligence: Definition & Importance of AI.

Knowledge: General Concepts: Introduction, Definition and Importance of Knowledge, Knowledge-

Based Systems, And Representation of Knowledge, Knowledge Organization, Knowledge Manipulation,

And Acquisition of Knowledge.

LISP and Other AI Programming Languages: Introduction to LISP : Syntax and Numeric Function,

Basic List Manipulation Functions in LISP, Functions, Predicates and Conditionals, Input, Output and

Local Variables, Iteration and Recursion, Property Lists and Arrays, Miscellaneous Topics, PROLOG

and Other AI Programming Languages.

Knowledge Representation: Introduction, Syntax and Semantics for Propositional logic, Syntax and

Semantics for FOPL, Properties of Wffs, Conversion to Clausal Form, Inference Rules, The Resolution

Principle, No deductive Inference Methods, Representations Using Rules.

Knowledge Organization and Management: Introduction, Indexing and Retrieval Techniques,

Integrating Knowledge in Memory, Memory Organization Systems.

Expert Systems Architectures: Introduction, Rule Based System Architecture, Non-Production System

Architecture, Dealing with uncertainty, Knowledge Acquisition and Validation, Knowledge System

Building Tools.

Text Book:

1. Dan W. Patterson - Introduction to Artificial Intelligence and Expert Systems, PHI, New Delhi,

2006.

Reference Books:

1. E. Rich & K. Knight - Artificial Intelligence, 2/e, TMH, New Delhi, 2005.

2. P.H. Winston - Artificial Intelligence, 3/e, Pearson Edition, New Delhi, 2006.

3. D.W. Rolston,- Principles of AI & Expert System Development, TMH, New Delhi



M12113-Performance Evaluation and Reliability of Information System: Course Outlines

Review of probability and statistics, stochastic processes, Markov Models, Parameter estimation and

hypothesis testing. Models of information systems, introduction to reliability measures. Estimation of

MTF and other reliability parameters. Software metrics and software reliability models. Queuing

network models, Workload design, Benchmarks, Estimations of performance metrics, case studies.

Reference Books:



M12111-Distributed and Cloud Computing: Course Outlines

Introduction to Parallel and Distributed Systems, goals, hardware concepts, software concepts, client

server model; communication, layered protocols, remote procedure call, objective invocation, message

& stream oriented communication; processes, threads, clients, servers; naming entities, mobile and

unreferenced entities. Clock synchronization , algorithms, transaction; consistency and replication,

data-centric & client-centric models, protocols; fault tolerance, process resilience, reliable client-server

& group Communication, commit, recovery; security ,channels, access, security control; distributed

object-based systems explanation and comparison ;distributed file systems (SUN, CODA) and

comparison; distributed document-based system and coordination-based systems, multimedia systems,

Parallel Programming Languages and Algorithms.

Suggested reference materials:

1. Andrew S. Tanenbaum, marten van steen “Distributed Systems Principals and Paradigms” Pearson

Edu.

2. George Coulouris, Jean Dollimore, Tim Kindberg “Distributed Systems Concepts and Design”

Pearson Edu.

3. Joel M. Crichlow “ An Introduction to Distributed & Parallel Computing” 2nd ed. PHI.

4. M. Sasikumar, Dinesh Shikhare P Ravi Prakash "Introduction to parallel Processing" PHI

5. Andrew S. Tanenbaum "Distributed Operating System"TMH



M12115-Software Construction (Design Pattern): Course Outlines

Introduction

Patterns in software engineering, definition and evolution, identifying patterns, representation,

reflection, usage, refactoring and anti pattern.

J2EE & Design Pattern

Sum Java center J2EE patterns catalog, presentation Tier design considerations and Practices, Business

Tier design considerations and Practices.

J2EE Refactoring

Presentation Tier Refactoring, Business and Integration Tier Refactoring, General refactoring.

Server side.com patterns

catalog, patterns applied to the web tier, patterns applied to a persistence framework, patterns to

improve performance, seal ability and security, pattern for enterprise integration, patterns applied to

enable reusability, maintainability & extensibility.

VB .NET & Design Pattern

Patterns in the Data Tier, Middle Tier, Presentation Tier, .NET remoting.

References:

1. E. Gamma et. al., “Design Pattern, Elements of reusable object oriented software”, AWL

2. C. A. Berry et. al., “J2EE design patterns applied”, Wror/Spd, 2000

3. Deepak Alur, John Crupi, Dan Malks, “Core J2EE Patterns “, Pearsons Educations

4. T. Fischer, “Design patterns in VB .NET”, Wrox/Spd, 2002



M12116-Distributed Algorithms: Course Outlines

Models of synchronous and asynchronous distributed computing systems: synchronous networks,

asynchronous shared memory, asynchronous networks; basic algorithms for synchronous and

asynchronous networks: leader election, breadth first search, shortest path, minimum spanning tree;

advanced synchronous algorithms: distributed consensus with failures, commit protocols; asynchronous

shared memory algorithms: mutual exclusion and consensus; relationship between shared memory and

network models; asynchronous networks with failures.

Suggested reference materials:

1. Nancy Lynch, "Distributed Algorithms" Morgan Kaufmann.

2. Gerlad Tel, "Introduction to Distributed Algorithms" Cambridge University Press



M12117-High Performance Scientific Computing: Course Outlines

Overview of Scientific Computing, Tools-Elements of Mat Lab, Elements of IDL, Elements of AVS,

Scientific Visualization Architecture- Computer Performance. Vector Computing. Distributed-memory

MIMD Computing. SIMD Computing. Applications-Advection. Computerized Tomography. A review of

selected topic from Numerical Analysis.

Suggested texts and reference materials:

1. G.H. Golub,J.M. Ortega"Scientific computing -An introduction With parallel computing" Academic

Press,

2. Lloyd D. Fosdick,Elizabeth R. Jessup,Carolyn"an introduction to High Performance Scientific

computing" PHI



M12118-Database Engineering: Course Outlines

Relational Databases: Integrity Constraints revisited: Functional, Multi-valued and Join Dependency,

Template Algebraic, Inclusion and Generalized Functional Dependency, Chase Algorithms and

Synthesis of Relational Schemes. Query Processing and Optimization: Evaluation of Relational

Operations, Transformation of Relational Expressions, Indexing and Query Optimization, Limitations of

Relational Data Model, Null Values and Partial Information.

Deductive Databases: Datalog and Recursion, Evaluation of Datalog program, Recursive queries with

negation. Objected Oriented and Object Relational Databases: Modeling Complex Data Semantics,

Specialization, Generalization, Aggregation and Association, Objects, Object Identity, Equality and

Object Reference, Architecture of Object Oriented and Object Relational Databases.

Distributed Data Storage: Fragmentation and Replication, Location and Fragment Transparency,

Distributed Query Processing and Optimization, Distributed Transaction Modeling and Concurrency

Control, Distributed Deadlock, Commit Protocols, Design of Parallel Databases, Parallel Query

Evaluation.

Advanced Transaction Processing: Nested and Multilevel Transactions, Compensating Transactions

and Saga, Long Duration Transactions, Weak Levels of Consistency, Transaction Work Flows,

Transaction Processing Monitors.

Active Databases: Triggers in SQL, Event Constraint and Action: ECA Rules, Query Processing and

Concurrency Control, Compensation and Databases Recovery.

Real Time Databases: Temporal Constraints: Soft and Hard Constraints, Transaction Scheduling and

Concurrency Control.

Image and Multimedia Databases: Modelling and Storage of Image and Multimedia Data, Data

Structures - R-tree, k-d tree, Quadtrees, Content Based Retrieval: Color Histograms, Textures etc,

Image Features, Spatial and Topological Relationships, Multimedia Data Formats, Video Data Model,

Audio and Handwritten Data, Geographic Information Systems (GIS).

References

1. Abraham Silberschatz, Henry Korth, and S. Sudarshan, Database System Concepts, McGraw-

Hill.

2. Raghu Ramakrishnan, Database Management Systems, WCB/McGraw-Hill.

3. Bipin Desai, An Introduction to Database Systems, Galgotia.

4. J. D. Ullman, Principles of Database Systems, Galgotia.

5. R. Elmasri and S. Navathe, Fundamentals of Database Systems8, Addison-Wesley.

6. Serge Abiteboul, Richard Hull and Victor Vianu, Foundations of Databases. Addison-Wesley.



M12119-Information Retrieval: Course Outlines

Introduction to Information Retrieval: The nature of unstructured and semi-structured text. Inverted

index and Boolean queries.

Text Indexing, Storage and Compression: Text encoding: tokenization, stemming, stop words, phrases,

index optimization. Index compression: lexicon compression and postings, lists compression. Gap

encoding, gamma codes, Zipf's Law. Index construction. Postings size estimation, merge sort, dynamic

indexing, positional indexes, n-gram indexes, real-world issues.

Retrieval Models: Boolean, vector space, TFIDF, Okapi, probabilistic, language modeling, latent

semantic indexing. Vector space scoring. The cosine measure. Efficiency considerations. Document

length normalization. Relevance feedback and query expansion. Rocchio.

Performance Evaluation: Evaluating search engines. User happiness, precision, recall, F-measure.

Creating test collections: kappa measure, interjudge agreement.

Text Categorization and Filtering: Introduction to text classification. Naive Bayes models. Spam

filtering. Vector space classification using hyperplanes; centroids; k Nearest Neighbors. Support vector

machine classifiers. Kernel functions. Boosting.

Text Clustering: Clustering versus classification. Partitioning methods. k-means clustering. Mixture of

Gaussians model. Hierarchical agglomerative clustering. Clustering terms using documents.

Advanced Topics: Summarization, Topic detection and tracking, Personalization, Question answering,

Cross language information retrieval.

Web Information Retrieval: Hypertext, web crawling, search engines, ranking, link analysis, PageRank,

HITS, XML and Semantic web.

References

1. Manning, Raghavan and Schutze, Introduction to Information Retrieval, Cambridge University

Press.

2. Baeza-Yates and Ribeiro-Neto, Modern Information Retrieval, Addison-Wesley.

3. Soumen Charabarti, Mining the Web, Morgan-Kaufmann.

4. Survey by Ed Greengrass available in the Internet.

M. Tech. in Software Engineering (Computer Science and ... M. Tech. Software Engg.pdf · Graph...

Documents

Transcript of M. Tech. in Software Engineering (Computer Science and ... M. Tech. Software Engg.pdf · Graph...