detailed curriculum & syllabus for m.tech course

Proposed curriculum of M Tech Programme (Software Engineering)

ACADEMIC YEAR 2015 - 16

NIT Durgapur

Sl. No.

Subject Code

Name of the Subject L T P CP

Semester I

1 CA 1001 Foundation of Software Engineering 3 1 0 4

2 CA 1002 Advanced Data Structure and Algorithm 3 1 0 4

3 CA 1003 Principal of Object Oriented Programming 3 1 0 4

4 CA 1004 Formal Language and Automata Theory 3 1 0 4

5 CA 1005 Advanced Database Management System

3 1 0 4

6 CA 1051 OO & ADSA Lab. Sessional 0 0 4 2

7 CA 1052 SE Lab Sessional 0 0 4 2

Total Credit 24

SUBJECT

CODE

SUBJECT L-T-P CREDIT DEVELOPER

CA 1001 Foundation of Software

Engineering

3-1-0 4

Software Engineering Fundamentals: Definition of software product, software

engineering paradigms, Software engineering, knowledge engineering, and End user

development approach, software engineering life cycle, process modules (Waterfall model,

Spiral model)

[8]

System Analysis: An abstraction, Partitioning and projection, system specification,

software requirement specification (SRS) standards, formal specification methods,

specification tools, flow based, data modeling and Dynamic Modeling (data flow diagram,

ERD, STD, PetriNet).

[8]

System Design: Problem partitioning, abstraction, top down &bottom up strategies,

modularity structure charts, idealized and constraint design (Warnier –Orr, E-R modeling),

object oriented design (Booch approach), cohesion and coupling, design matrices, design

documentation standard.

[6]

Role of CASE tools: relevance of CASE tools, high-end low end CASE tools, automated

support for data dictionaries, DFDs, ERDs.

(Tutorial and Sessional) [2]

Coding and Programming: choice of programming languages, mixed language

programming and cell semantics, structured programming, information hiding,

documentation, re-engineering legacy systems, coding standard. [4]

Software quality and testing: software quality assurance, types of software testing (White

box and Black box testing, unit testing integration testing, verification and validation of

software), debugging and software reliability analysis, software quality and matrices,

software maturity model and extensions. [8]

Software Cost and Time Estimation: functions points, issues in software cost

estimation:Introduction to the Rayleigh curve, algorithmic cost models (COCOMO,

Putnam – Slim, Watson, and felix), other approaches to software cost and size estimation

(software complexity, delphi, costing by analogy). [4]

Software Project Management: planning software, project, work breakdown structures,

integrating software design and project planning, software project teams, projecting

monitoring control.

[2]

Text Book:

R. S. Pressman -“ Softaware Engineering – Practitioner’s Approach”- McGraw Hill

International

References:

1. Jalote, P. - “An integrated approach to Software engineering”- Narosa , 1991

2. Beizer, B. – “Software Testing Techniques”- Van Nostrand Reinhold, New York. 1990

SUBJECT

CODE


CA 1002 Advanced Data Structure and

Algorithm

3-1-0 4

Elementary data structures, Complexity of Algorithms: worst case, average case and

amortized complexity [4]

Analysing Algorithms, Designing Algorithms, Growth of Functions, recurrences,

probabilistic analysis and randomized algorithms [5]

Heap sort, quick sort, sorting in linear time, median and order statistics [6]

Introduction to Graphs, Breadth first search and connected components, Depth first search

in directed and undirected graphs and strongly connected components [5]

Binary search trees, AVL trees, red black trees, splay trees, skip lists, b-trees, binomial

heaps, Fibonacci heaps [7]

Minimum spanning tree, single source shortest paths, all pair shortest paths, advanced

sorting methods and their analysis, Prim's and Kruskal's algorithm. [7]

String Matching: string-matching algorithm, Rabin-Karp algorithm, String matching with

automata, Knuth-Morris-Pratt algorithm, Boyer-Moore algorithm, algebraic simplifications

& transformations: NP- hard& NP-complete problems. [6]

Books:

1. V.Aho, J. E. Hopcroft, and J.D.Ullman, Data Structures and Algorithms Addison

Wesley, Reading Massachusetts,USA,1983.

2. T.H.Cormen, C.E.Leiserson, and R.L.Rivest, introduction to algorithms, the MIT press,

Cambridge, MassachuettsUSA1990.

3. E Horowitz and S. Sahni, Fundamentals of Data Structures, Galgotia, 1999

SUBJECT

CODE


CA 1003 Principle of Object Oriented

Programming

3-1-0 4

Introduction: Introducing Object-Oriented Approach, Relating to other paradigms.

[2]

Basic terms and ideas: Abstraction, Encapsulation, Inheritance, Polymorphism.

[2]

Classes and Objects: Encapsulation, information hiding, abstract data types, Object &

classes, attributes, methods, Constructors and destructors, instantiation of objects, Default

parameter value, dynamic memory allocation, abstract classes.

[16]

Inheritance and Polymorphism: Inheritance, Class hierarchy, derivation – public, private

& protected, Aggregation, Polymorphism, Categorization of polymorphism techniques,

Method polymorphism, Polymorphism by parameter, Operator overloading, Parametric

polymorphism, Generic function – template function, function name overloading,

Overriding inheritance methods, Run time polymorphism, Multiple Inheritance.

[17]

Files and Exception Handling: Persistent objects, Streams and files, Namespaces,

Exception handling, Generic Classes.

[3]

Books:

1. Sourav Sahay: Object Oriented Programming with C++, 2nd

Ed., Oxford University

Press

2. Bruice Eckel, Thinking in C++

3. Herbert Schildt: C++: The Complete Reference, 3rd Ed., McGraw-Hill

SUBJECT

CODE


CA 1004 Formal Language and

Automata Theory

3-1-0 4

Introduction: Alphabet, languages and grammars, productions and derivation, Chomsky

hierarchy of languages. [4]

Regular languages and finite automata: Regular expressions and languages,

deterministic finite automata (DFA) and equivalence with regular expressions,

nondeterministic finite automata (NFA) and equivalence with DFA, regular grammars and

equivalence with finite automata, properties of regular languages, pumping lemma for

regular languages, minimization of finite automata. [12]

Context-free languages and pushdown automata: Context-free grammars (CFG) and

languages (CFL), Chomsky and Greibach normal forms, nondeterministic pushdown

automata (PDA) and equivalence with CFG, parse trees, ambiguity in CFG, pumping

lemma for context-free languages, deterministic pushdown automata, closure properties of

CFLs. [12]

Context-sensitive languages: Context-sensitive grammars (CSG) and languages, linear

bounded automata and equivalence with CSG.

[4]

Turing machines: The basic model for Turing machines (TM), Turing-recognizable

(recursively enumerable) and Turing-decidable (recursive) languages and their closure

properties, variants of Turing machines, nondeterministic TMs and equivalence with

deterministic TMs, unrestricted grammars and equivalence with Turing machines, TMs as

enumerators. [4]

Undecidability: Church-Turing thesis, universal Turing machine, the universal and

diagonalization languages, reduction between languages and Rice's theorem, undecidable

problems about languages. [4]

References:

1. Harry R. Lewis and Christos H. Papadimitriou, Elements of the Theory of

Computation, Pearson Education Asia.

2. John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman, Introduction to Automata

Theory, Languages, and Computation, Pearson Education Asia.

3. Dexter C. Kozen, Automata and Computability, Undergraduate Texts in Computer

Science, Springer.

4. Michael Sipser, Introduction to the Theory of Computation, PWS Publishing.

5. John Martin, Introduction to Languages and The Theory of Computation, Tata

McGraw Hill.

SUBJECT

CODE


CA 1005 Advanced Database

Management Systems

3-1-0 4

Relational Database Management Issues - Transaction Processing, Concurrency,

Recovery, Security and Integrity. [10]

Distributed Databases - Storage structures for distributed data, data fragmentation,

Transparency of distributed architecture, Distributed query processing, Transaction

management in distributed environment, Recovery and Concurrency control, Locking

protocols, Deadlock handling, Dynamic modeling of distributed databases, Client - Server

Databases. Performance Tuning, Advanced Transaction Processing. [10]

Object-oriented Databases - Objects and Types, Specifying the behavior of objects,

Implementing Relationships, Inheritance. Sample Systems. New Database Applications.

[8]

Multimedia Database - Multimedia and Object Oriented Databases, Basic features of

Multimedia data management, Data Compression Techniques, Integrating conventional

DBMSs with IR and Hierarchical Storage Systems, Graph Oriented Data Model,

Management of Hypertext Data, Client Server Architectures for Multimedia Databases,

[12]

References Books:

1. H.F.Korth & A. Silverschatz: Database Systems Concepts, McGraw Hill.

2. Bindu R.Rao: Object Oriented Databases, McGraw Hill, 1994.

3. Gray, Kulkarni, Paton: Object Oriented Databases, Prentice Hall International, 1992.

4. Khoshafian: Object Oriented Databases, John Wiley & Sons,1993.

5. S. Khoshafian & A.B. Baker, Multimedia and Imaging Databases,Morgan Kaufmann

Publishers, 1996.

6. Kemper & Moerkoette: Object-Oriented Database Management, PH, 1994.

7. Alex Berson: Client/Server Architecture, McGraw Hill

SUBJECT

CODE


CA 1051 OO & ADSA Lab 0-0-4 2

OO Lab

Program using functions: functions with default arguments, implementation of call

by value, address, reference [4]

Simple classes for understanding objects, member functions & constructors: classes

with primitive data members, classes with arrays as data members, classes with

pointers as data members, classes with constant data members, classes with static

member functions [6]

Compile time polymorphism: operator overloading, function overloading [4]

Run time polymorphism: inheritance, virtual functions, virtual base classes,

templates [3]

File handling: sequential access, random access [3]

ADSA Lab

Search algorithms: BFS, DFS, Binary search [3]

Sorting algorithms: Bubble, insertion, selection, quick, merge, heap, radix [5]

Linked list: Single, double, circular [2]

SUBJECT

CODE


CA 1052 SE Lab 0-0-4 2

Case Study Related to The

1. System Analysis [5]

2. System Design [5]

3. CASE tools: [5]

4. Software quality and testing [5]

5. Software Cost and Time Estimation [5]

6. Software Project Management [5]

Advanced Tools and Techniques

1. GME / james ii based Modelling: Meta model Development, System Development,

Interpreter Writing, etc [10]

TEXT BOOKS:

REFERENCE BOOKS:

Semester II

1 CA 2001 Object Oriented Software Engineering 3 1 0 4

1 Elective I 3 1 0 4

3 Elective II 3 1 0 4

4 Elective III 3 1 0 4

5 Elective IV 3 1 0 4

6 CA 2051 OOSE Lab Sessional 0 0 4 2

7 CA 2052 Seminar - I (Non-Project) 0 0 2 1

8 CA 2053 Project-I 0 0 2 1

Total Credit 24

SUBJECT

CODE


CA 2001 Object Oriented Software

Engineering

3-1-0 4

Introduction

Why object orientation, History and development of Object Oriented Programming

language, concepts of object oriented programming language. Object, class, message

passing, encapsulation, polymorphism, aggregation, threading, difference between OOP

and other conventional programming-advantages and disadvantages.

[6]

Object Oriented Process Model: Fountain Model, Iterative Water Model, RUP Model,

Component Based model. [6]

Object oriented analysis

Usecase diagram; Major and minor elements, Object, Class. Booch, Raumbagh, Codd

Yordon, Jakobson Methods [4]

Object oriented design

Relationships among objects, aggregation, links, relationships among classes association,

aggregation, using, instantiation, meta-class, grouping constructs. [4]

Fundamentals of Object Oriented design in UML

Well-formed Rules and semantic guide of UML, Structural models – Use Case Description,

Class Diagram, Object diagram, Role Concepts, interaction diagram: collaboration

diagram, sequence diagram,

UML Dynamic modelling concepts: state chart diagram, activity diagram, implementation

diagram,

UML extensibility- model constraints and comments, Note, Stereotype. [10]

Analysis & Design of OOSE using UML

Analysis modelling using UML, Design modelling using UML, Tools support

(Introduction to Rational Rose). [2]

Object Oriented System Architecture

Model Driven Architecture, Domain Specific Modelling notation, Model integrated

Computing for OOSE [4]

Quality Evaluation of OOS: CK metrics and methods, Lee Metrics, Quality analysis

[4]

Text Book

Rambaugh, James Michael, Blaha - “Object Oriented Modelling and Design” -

Prentice Hall India/ Pearson Education

References:

1. Ali Bahrami, “Object –Oriented System Development” - Mc Graw Hill.

2. Bruce, Foundations of Object Oriented Languages, PHI

3. UML Standards, V 2.5, OMG, 01-03-2015

SUBJECT

CODE


CA 2051 OOSE Lab 0-0-4 2

1. ERD and DFD Case Study [10]

2. Software Testing [10]

3. UML Designing Problems using any one CASE Tools (e.g. Rational Rose, Designer

etc.) [10]

4. Advanced Tools and Techniques: GME / james ii based Modelling: Meta model

Development, System Development, Interpreter Writing, etc [10]

TEXT BOOKS:

REFERENCE BOOKS:

CA 2052: Seminar – I (Non-Project)

CA 2053: Project - I

CA 3051: Project – II

CA 3052: Project Seminar - I

CA 4051: Project – II

CA 4052: Project Seminar – II & Viva Voce

List of Electives

SUBJECT

CODE


CA 9011 Graph Theory

Basic Properties of Graphs: What Graphs are- Degree, Regularity graph. [2]

Connectedness- Connected Graphs: Paths, Circuits and Cycles- Components- Connectivity

& Bipartite Graphs. [4]

Eulerian and Hamiltonian Graphs: Eulerian Graphs, Hamiltonian Graphs, Travelling

Salseman Problem. [4]

Searching & Shortest path Problem: Matrix representation of graphs- Spanning tree -

Finding all Spanning Trees of a Graph -Prim’s-Kruskal. Dijkstra-Floyed Warshal- Bellman

Ford, BFS-DFS- Travelling Salesperson Problem. [6]

Graph Colourings: Vertex Colouring- Edge Colouring- Planar Graphs-Map Colouring

Problem. [4]

Planarity: General Concept, Kuratowaski's Algorithms,Planarity check Algorithm,General

Proof. [4]

Simple Graph- Havel and Hakimi's Theorem. MaxFlow-Ford-Fulkerson method. [4]

Isomorphism: Properties of Isomorphism, Identification and logic of isomorphic graph.

[3]

Matching: Introduction, Minimum Matching, Maximum Matching, Algorithms of finding

maximum matching and minimum matching. [4]

Permutation, Combination of multisets, Pegionhole principle, Formal power series, and

recurrence relation, Stirling numbers, Mobius inversion, Posets, Sperner’s lemma,

Dilworth’s theorem, Systems of distinct representatives, Principle of inclusion-exclusion

[5]

Text Books:

1. Narsingh Deo, "Graph Theory: With Application to Engineering and Computer Science",

PHI, 2003.

References Books:

1. R.J. Wilson, "Introduction to Graph Theory", Fourth Edition, Pearson Education, 2003.

SUBJECT

CODE


CA 9012 Distributed Systems

Introduction: Characterization of Distributed Systems - Examples - Resource Sharing -

Challenges - System Models - Architectural and Fundamental Models - Networking -

Types of Networks - Network Principles - Internet Protocols - Case Studies.

Inter Processes Communication: Inter process Communication - The API for the Internet

Protocols - External Data Representation and Marshalling - Client-Server Communication -

Group Communication - Case Study - Distributed Objects and Remote Invocation -

Communication Between Distributed Objects - Remote Procedure Call - Events and

Notifications - Java RMI - Case Study.

Fundamental Topics: Models of communication, distributed algorithm representations:

syntax and semantics, Program correctness, Time in a distributed system

Important Paradigm: Mutual Exclusion, distributed snapshot, global state collection,

graph algorithms, coordinator algorithms, synchronizers

Faults and Fault-Tolerant Systems: Fault tolerant systems, Distributed consensus,

Distributed transactions.

Operating System Issues – I: The OS Layer - Protection - Processes and Threads -

Communication and Invocation – OS Architecture - Security - Overview - Cryptographic

Algorithms - Digital Signatures - Cryptography Pragmatics - Case Studies - Distributed

File Systems - File Service Architecture - Sun Network File System - The Andrew File

System

Operating System Issues – II: Name Services -Domain Name System - Directory and

Discovery Services - Global Name Service - X.500 Directory Service - Clocks, Events and

Process States - Synchronizing Physical Clocks - Logical Time And Logical Clocks -

Global States - Distributed Debugging - Distributed Mutual Exclusion – Elections –

Multicast Communication Related Problems.

Text Books:

1. Sukumar Ghosh, Distributed Systems, an algorithmic approach, CRC Press.

Reference Books:

1. Sape Mullender, Distributed Systems, Addison Wesley, 2nd Edition, 1993.

2. Albert Fleishman, Distributes Systems- Software Design and Implementation, Springer-

Verlag, 1994

3. M.L.Liu, Distributed Computing Principles and Applications, Pearson Education, 2004.

4. Andrew S Tanenbaum , Maartenvan Steen,Distibuted Systems –Principles and

Pardigms,Pearson Education, 2002

5. Mugesh Singhal,Niranjan G Shivaratri,Advanced Concepts in Operating Systems,Tata

McGraw Hill Edition, 2001

SUBJECT

CODE


CA 9013 Cloud Computing

Introduction to Services Oriented Computing

Service Oriented Software, Web Applications Paradigm

[2]

Services Oriented Architecture SOA and Web Services Fundamentals, SOA and Service-Orientation, SOA - Planning

and Analysis, SOA - Technology and Design, SOA Reference model (OASIS), SOA

standard S3, Business Process and SOA, Software as a Service (SaaS)

[8]

Web Services

Introduction to Web Services, Web Service Jargon – Publishing, Discovery and Binding,

Web Service Technologies – WSDL, SOAP, UDDI, Issues and Challenges – MANET,

CLOUD, DTN,Formal, Representation of Services

[8]

Cloud Computing Basics- Overview, Applications, Intranets and the Cloud. Organization

and Cloud Computing- Benefits, Limitations, Security Concerns.

[2] Hardware and Infrastructure- Clients, Security, Network, Services.

[2] Software as a Service (Saas)- Understanding the Multitenant Nature of SaaS Solutions,

Understanding SOA. [2]

Platform as a Service (PaaS)- IT Evolution Leading to the Cloud, Benefits of Paas

Solutions, Disadvantages of Paas Solutions.

[2] Infrastructure as a Service (Iaas)-Understanding IaaS, Improving Performance through

Load Balancing, System and Storage Redundancy, Utilizing Cloud-Based NAS Devices,

Advantages, Server Types.

[2] Virtualization-Understanding Virtualization, History, Leveraging Blade Servers, Server

Virtualization, Data Storage Virtualization.

[2] Securing the Cloud- General Security Advantages of Cloud-Based Solutions, Introducing

Business Continuity and Disaster Recovery. Disaster Recovery- Understanding the Threats.

[2] Migrating to the Cloud-Cloud Services for Individuals, Cloud Services Aimed at the Mid-

Market, Enterprise-Class Cloud Offerings, and Migration.

[2] Designing Cloud Based Solutions-System Requirements, Design Is a Give-and-Take

Process. Coding Cloud Based Applications-Creating a Simple Yahoo Pipe, Using Google

App Engine and creating a Windows Azure Application. Application Scalability-Load-

Balancing Process, Designing for Scalability, Capacity Planning Versus Scalability,

Scalability and Diminishing Returns and Performance Tuning. [6]

Text Books:

1. Cloud Computing : A Practical Approach by Anthony T. Velte Toby J. Velte, Robert

Elsenpeter, 2010 by The McGraw-Hill.

2. Cloud Computing: SaaS, PaaS, IaaS, Virtualization and more. by Dr. Kris Jamsa.

References Books: 1. Cloud Computing Bible by Barrie Sosinsky, Published by Wiley Publishing, 2011.

2. Cloud Computing for Dummies by Judith Hurwitz, Robin Bloor, Marcia Kaufman, and

Dr. Fern Halper, Wiley Publishing, 2010.

3. Moving to The Cloud, Dinakar Sitaram, Elsevier, 2014. 4. Cloud Computing Theory

And Practice Danc.Marinercus, Elsevier, 2013.

SUBJECT

CODE

SUBJECT L-T-

P

CREDIT DEVELOPER

CA 9014 Data Warehousing & Data Mining

Introduction, Data warehousing and OLAP technology for data mining, Classification of

data mining techniques, Discovery and analysis of patterns, trends, and deviations, Data

pre-processing, Data mining primitives, languages and systems, Data mining models:

decision trees, genetic algorithms, neural nets, etc. Clustering, Enabling data mining

through data warehouse. Data marts, Multidimensional databases, Data mining

applications, Descriptive data mining: characterization and comparison, Association

analysis, Classification and prediction, Cluster analysis, Mining complex types of data,

Applications and trends in data mining

References Books:

1. Adriaans, P. (1996), Data mining, Addison-Wesley

2. Jiawei Han and Micheline Kamber, Data Mining: Concepts and Techniques, Morgan

Kaufmann Publishers

3. Margaret Dunham, Data Mining: Introductory and Advanced Topics, Prentice Hall

4. Weiss, Sholom M.. - Predictive data mining : a practical guide / Sholom M. Weiss, Nitin

Indurkhy. - San Francisco, Calif. : Morgan Kaufmann Publishers, 1998. - 1558604030

5. Advances in knowledge discovery and data mining / edited by Usama M. Fayyad. -

Menlo Park, Calif. : AAAI Press; Cambridge, Mass.; London : MIT

6. Thomsen, Erik, 1959-. - OLAP solutions : building multidimensional information

systems / Erik Thomse. - 2nd ed. - New York; Chichester : Wiley

7. Mitchell, Tom M., Tom Michael, 1951-. - Machine learning / Tom M. Mitchell. - New

York; London : McGraw-Hill

SUBJECT

CODE


CA 9015 AI & Expert System

Introduction, Major approaches to AI (viz., symbol Processing & Subsymbolic

approaches), A brief introduction to connectionist approach, Subsumption architecture and

Evolutionary approach under subsymbolic approaches, Major subfields of AI, Intelligent

search( viz., state space search, Algorithm A*, GA etc.), Knowledge representation through

predicate calculus, resolution reputation system, reasoning using Horn clauses, case based

reasoning, reasoning with uncertain information (viz., Probabilistic inference, Bayes

networks,default reasoning, D-S theory, Fuzzy sets and fuzzy logic, Learning Bayes

networks, Machine Learning: a brief introduction, Neural networks, Intelligent agents.

References Books:

1. E.Rich,K.Knight: Artificial Intelligence,2nd Ed, Tata Mc Graw Hill.

2. D.W.Patterson: Introduction to Artificial Intelligence & Expert systems,PHI,1990.

3. M.Ginsberg:Essentials of A.I.,Morgan Kaufmann

SUBJECT

CODE


CA 9016 Information & System

Security

Introduction: Course introduction (syllabus, policies, projects, and recent cyber threats

overview), An overview of Information Security: The CIA triad: confidentiality, integrity,

and availability [4]

Understanding the Threats: Malicious software (Viruses, trojans, rootkits, worms,

botnets), Memory exploits (buffer overflow, heap overflow, integer overflow, format

string) [3]

Formalisms: Access control theory, access control matrix, Information flow [2]

Policy: Security policies, Confidentiality policies, Integrity policies, Hybrid policies

[2]

Implementation I: Cryptography: Block and stream ciphers, Cryptographic hash

functions, Message Authentication Codes (MAC), Public and private key systems, Message

digests. Approximate strength of ciphers, Authentication, Password system

[4]

Implementation II: Systems (Experimentation and Implementation Platform of choice

:: LINUX) : Secure design principles (Least-privilege, fail-safe defaults, complete

mediation, separation of privilege), TCB and security kernel construction, System defence

against memory exploits, UNIX security and Security-Enhanced Linux (SELinux),

Windows security [9]

Network Security: TCP/IP security issues, DNS security issues and defences, TLS/SSL,

Network Intrusion detection and prevention systems, Firewalls [4]

Software Security: Vulnerability auditing, penetration testing, Sandboxing, Control flow

integrity [4]

Web Security: User authentication, authentication-via-secret and session management,

Cross Site Scripting, Cross Site Request Forgery, SQL Injection [4]

Legal and Ethical Issues: Cybercrime and computer crime, Intellectual property,

copyright, patent, trade secret, Hacking and intrusion, Privacy, identity theft. [4]

Reference Books:

1. Cyber security operations handbook, Elsiever Digital Press, John W. Rittinghouse

2. Computer Security Art and Science, Addison Wesley, Matt Bishop

3. Security in Computing Systems, Joachim Biskup, Springer

SUBJECT

CODE


CA 9017 VLSI Design & Testing

Basic operation of CMOS inverter, detailed analysis of its noise margin propagation delay,

power dissipation concept of layout & area, layout optimization & area estimation for a

single as well as combinational logic circuits. [8]

Design of sequential logic circuits: Static & dynamic latches registers, dynamic

transmission gate, CMOS gate, pipelining approach for optimize sequential circuits,

NDRA-CMOS pipelined structure, nonbistable sequential circuits, Schmitt trigger. [10]

Implementation strategies for digital ICs, introduction of custom and circuit design,

hierarchy cell based design array based implementation, building blocks of adder,

multiplier, shifter, barrel shifter, algorithmic shifter and other arithmetic operators, power

speed tradeoff in data path structure. [10]

Design memory & array structure memory architectures & building blocks, address

decoder, sense amplifiers, driver/ buffers, timing control, power dissipation in memories,

idea of testability and fault detection models. [12]

Books:

1. CMOS Digital Integrated Circuits Analysis , Sung-Mo (Steve) Kang, TMH

2. Essentials Of VLSI Circuits And Systems, Kamran Eshraghian, Eshraghian, PHI

3. Introduction To VLSI Circuits And Systems, John P. Uyemura, John Wiley & Sons

4. Modern VLSI Design, Wayne Wolf, Pearson

5. Principles Of CMOS VLSI Design, Neil H.E.Weste, Pearson

6. Cmos Logic Circuit Design, Uyemura, John P., Springer

7. VLSI Design, Shanthi, A. Kavitha, A., New Age International

8. VLSI Design And Technology, Bose, D.N., New Age International

SUBJECT

CODE


CA 9018 Complex Networks

Structure and form of complex networks including physical branching networks (river

networks and cardiovascular networks), neural networks, social networks, the Internet, the

world wide web, transportation networks, and organizations; distribution versus

redistribution networks; properties of networks including degree distributions, clustering,

motifs, various measures of betweenness, modularity, the role of randomness, network

dynamics, and multiscale structures; community detection algorithms; bipartite networks;

weighted networks; partly random networks as models of real world networks; generating

function techniques; universal models including scale-free networks, p-star networks, and

generative models; small-world networks; impedance and flow in networks; connections

between delivery networks and energy usage in organisms; search in networks as facilitated

by network structure and search methods; folksonomy and tagging; generalized notions of

contagion in networks; network epidemiology and fad spreading; computation

considerations for analysing networks

Reference Books:

1. S. N. Dorogovtsev and J. F. F. Mendes, Evolution of Networks, Oxford University

Press, Oxford (2003)

2. M. E. J. Newman, The structure and function of complex networks, SIAM Review 45,

167-256 (2003).

3. R. Albert and A.-L. Barabasi Statistical mechanics of complex networks. Rev. Mod.

Phys., Vol. 74, No. 1, January 2002.

4. Narsingh Deo, Graph Theory Prentice Hall India.

5. Robert A. Hanneman Introduction to Social Network Methods

6. Martin Everett, Stephen P. Borgatti. Extending Centrality

7. Martin Everett, Stephen P. Borgatti. Computing Regular Equivalence: Practical and

Theoretical Issues

8. Assortative mixing in networks, M. E. J. Newman, Phys. Rev. Lett. 89, 208701 (2002).

9. Mixing patterns and community structure in networks, M. E. J. Newman and M.

Girvan, in Statistical Mechanics of Complex Networks, R. Pastor-Satorras, J. Rubi, and

A. Diaz-Guilera (eds.), Springer, Berlin (2003).

10. Detecting community structure in networks, M. E. J. Newman, Eur. Phys. J. B 38, 321-

330 (2004).

11. Finding Communities in Linear Time: A Physics Approach Fang Wu, Bernardo A.

Huberman

12. Defining and identifying communities in networks, Filippo Radicchi, Claudio

Castellano, Federico Cecconi, Vittorio Loreto, Domenico Parisi

13. Finding and evaluating community structure in network. M.E.J. Newman, M. Girvan

14. Random graphs with arbitrary degree distributions and their applications, M. E. J.

Newman, S. H. Strogatz, and D. J. Watts, Phys. Rev. E 64, 026118 (2001).

15. M. E. J. Newman, The structure and function of complex networks, SIAM Review 45,

167-256 (2003).

16. P. L. Krapivsky and S. Redner, Organization of growing random networks

17. D. J. Watts, Small Worlds, Princeton Studies in Complexity

SUBJECT

CODE


CA 9019 Software Quality

Fundamentals Of Software Quality: The Role of SQA – SQA Plan – SQA considerations –

SQA people – Quality Management – Software Configuration Management

Managing Software Quality: Managing Software Organizations – Managing Software

Quality – Defect Prevention – Software Quality Assurance Management

Software Quality Assurance Metrics: Software Quality – Total Quality Management

(TQM) – Quality Metrics – Software Quality Metrics Analysis

Software Quality Program: Software Quality Program Concepts – Establishment of a

Software Quality Program – Software Quality Assurance Planning – An Overview –

Purpose & Scope.

Software Quality Assurance Standardization: Software Standards–ISO 9000 Quality

System Standards - Capability Maturity Model and the Role of SQA in Software

Development Maturity – SEI CMM Level 5 – Comparison of ISO 9000 Model with SEI’s

CMM

Text Books:

1. Mordechai Ben-Menachem / Garry S Marliss, “Software Quality”, Vikas Publishing

House, Pvt, Ltd., New Delhi.(UNIT III to V)

2. Watts S Humphrey, “Managing the Software Process”, Pearson Education Inc.( UNIT I

and II)

References Books:

1. Gordon G Schulmeyer, “Handbook of Software Quality Assurance”, Third Edition,

Artech House Publishers 2007

2. Nina S Godbole, “Software Quality Assurance: Principles and Practice”, Alpha Science

International, Ltd, 2004

SUBJECT

CODE


CA 9020 Knowledge Based System

Engineering

Introduction: Knowledge Representation and Reasoning First order Logic Syntax, Semantics

Pragmatics Expressing Knowledge, Levels of Representation, Knowledge Acquisition and Sharing

Sharing, Ontologies Language Ontologies, Language Patterns, Tools for Knowledge Acquisition Resolution and reasoning: Proportional Case Handling Variables and Qualifies, Dealing with

Intractability, Reasoning with Horn Clauses, Procedural Control of Reasoning, Rulesin Production,

Description Logic, Issues in Engineering, Vivid Knowledge Beyond Vivid. Representation: Object Oriented Representations, Frame Formalism, Structured Descriptions

Meaning and Entailment, Taxonomies and Classification, Inheritance Networks Strategies for

Defeasible, Inheritance Formal Account of Inheritance Networks. Defaults, uncertainty and expressiveness: Defaults, Introduction Closed World Reasoning,

Circumscription, Default Logic Limitations of Logic Fuzzy Logic Non-monotonic Logic Theories

and World, Semiotics, Auto-epistemic Logic, Vagueness, Uncertainty and Degrees of Belief Non-

categorical Reasoning, Objective and Subjective Probability. Actions and planning: Explanation and Diagnosis, Purpose– Syntax, Semantics of Context, First

Order Reasoning –Modal Reasoning in Context – Encapsulating Objects in Context –

Agents – Actions –Situational Calculus – Frame Problem – Complex Actions – Planning–

Strips–PlanningasReasoning–HierarchicalandConditionalPlanning.

Text Books: 1. Ronald Brachman, Hector Levesque “Knowledge Representation and Reasoning“, The Morgan

Kaufmann Series in Artificial Intelligence 2004

2. John F. Sowa, “Knowledge Representation: Logical, Philosophical, and Computational

Foundations”, 2000

Reference Books:

1. Arthur B. Markman, “Knowledge Representation”, Lawrence

ErlbaumAssociates,1998

SUBJECT

CODE


CA 9021 Secure Software Development

Introduction, The problem, Software assurance and software security, Threats to software security,

Sources of software insecurity, The benefits of detecting software security defects early, Managing

secure software development.

Defining properties of secure software, How to influence the security properties of software, How to

assert and specify desired security properties.

Requirements Engineering for Secure Software: The SQUARE process model: Identifying security

requirements using the security quality requirements engineering (SQUARE) method, SQUARE

sample outputs, Requirements elicitation, Requirements prioritization.

Secure Software Architecture and Design: Introduction, Software security practices for architecture

and design: Architectural risk analysis. Software security knowledge for architecture and design:

Security principles, Security guidelines, and Attack patterns.

Considerations for Secure Coding and Testing: Introduction, Code analysis, Coding practices,

Software security testing, Security testing considerations throughout the SDLC.

Security and Complexity: System Assembly Challenges: Introduction, Security failures, Functional

and attacker perspectives for security analysis, System complexity drivers and security, Deep

technical problem complexity.

Governance, and Managing for More Secure Software: Governance and security, Adopting an

enterprise software security framework, How much security is enough?, Security and project

management, maturity of practice.

Security metrics: Defining security metrics, Diagnosing problems and measuring technical security,

Analysis techniques, Organize, aggregate, and analyze data to bring out key insights.

Text Books:

1. Software Security Engineering: A Guide for Project Managers, Julia H. Allen, Sean Barnum,

Robert J. Ellison, Gary McGraw, Nancy R. Mead, Addison-Wesley, 1st edition, 2008.

2. Security Metrics: Replacing Fear, Uncertainty, and Doubt, by Andrew Jaquith, Addison-Wesley ,

1st edition , 2007.

References Books:

1. Integrating Security and Software Engineering: Advances and Future Vision, by Haralambos

Mouratidis, Paolo Giorgini, IGI Global, 2006.

2. Software Security: Building Security In , by Gary McGraw , Addison-Wesley, 2006

3. The Art of Software Security Assessment: Identifying and Preventing Software Vulnerabilities, by

Mark Dowd, John McDonald, Justin Schuh, Addison-Wesley, 1st edition, 2006

4. Building Secure Software: How to Avoid Security Problems the Right Way by John Viega, Gary

McGraw, Addison-Wesley, 2001

5. Writing Secure Code, by M. Howard, D. LeBlanc, Microsoft Press, 2nd Edition, 2003.

6. Exploiting Software: How to break code, by G. Hoglund, G. McGraw, Addison Wesley, 2004.

SUBJECT

CODE


CA 9022 Software Testing and Verification

Intro to V&V Techniques and Principles, Requirements and Specifications, Black-Box Test Case

Design Strategies: Partition Testing, Combinatorial Approaches, Other Strategies. White-Box Test

Case Design Strategies: Logic Coverage Dataflow Coverage Path Conditions and Symbolic

Evaluation Other Strategies Integration and Higher Level Testing Object-Oriented Software Reviews

and Inspections Testing Tools Formal Program Specification, Axiomatic Verification: Weak

Correctness, Rules of Inference, Strong Correctness. Predicate Transforms, Computing Predicate

Transforms, Predicate Transforms and Loops Functional Verification Complete and Sufficient

Correctness, Axiom of Replacement, Correctness Conditions, Iteration Recursion Lemma, Revisiting

Loop Invariants, Cleanroom Software Engineering

Reference Books:

1. Cem Kaner, Lessons Learned in Software Testing

2. Adam Goucher, Beautiful Testing: Leading Professionals Reveal How They Improve Software

3. Ron Patton, Software Testing

4. C. Kaner , Testing Computer Software

5. Rex Black, Managing the Testing Process: Practical Tools and Techniques for Managing

Hardware and Software Testing

SUBJECT

CODE


CA 9023 Mobile Computing

Introduction: Characteristics, Limitations and Applications of Mobile Computing, Structure

of Mobile Computing Application. [4]

Wireless LANS- 802.11 standards and MAC fundamentals, 802.11 Framing, Wireless

Management operations, Power Optimization in Routing Protocols for Wireless and Mobile

Networks, Mobility in wireless. [8]

Infrastructure vs. Infrastructureless Networks, Routing Protocols in Mobile Adhoc Network

(MANET), Transport layer issue Mobile Network. Overview of Bluetooth Technology.

[8] Delay Tolerant Network, Routing in Delay Tolerant Networks, Energy Mechanisms in

Delay tolerant Network. Security in Delay Tolerant Network. General concept of ONE

simulator. [8]

Mobile IP: Introduction, IP Packet Delivery, Agent Discovery, Registration, Tunneling and

Encapsulation, Optimizations and Reverse Tunneling. [4]

Cellular Networks: Cellular Concept, Frequency Reuse, Channel Allocation Management,

Handoffs [4]

Interference: Co-channel and Adjacent Interference. Improving Cell Capacity and

Coverage: Cell Splitting, Sectoring, Microcell Zone Concept, Generations of Cellular

Communication Technologies. [4]

References Books:

1. V.K.Garg & J.E.Wilks:Wireless and Personal Communication Systems: Fundamentals

and Applications, IEEE Press and Prentice Hall,1996.

2. T.S.Rappaport, B.D.Woerner and J.H. Reed:Wireless Personal Communications: The

Evolution of PCS,Dkyener Academic,1996.

3. G.I. Stuber: Principles of Mobile Communication,Kluener Academic,1996.

4. U.Black:Mobile and Wireless Networks, Prentice Hall PTR,1996.

5. Charles Parkins – Mobile Adhoc Ntworks

6. Wireless Communication- W. Stallings

7. Mobile Communication – J. Schiller

8. Reseach Papers of International Journals, Proceedings of Conferences

SUBJECT

CODE


CA 9024 Information Coding Theory

Introduction: Information Entropy, Information rate, classification of codes, Kraft

McMillan inequality,

Source coding theorem, Shannon-Fano coding, Huffman coding, Extended Huffman

coding, Joint and conditional entropies, Mutual information, Discrete memory less

channels, BSC, BEC, Channel capacity, Shannon limit.

Definitions and Principles: Hamming weight, Hamming distance, Minimum distance

decoding Single parity codes, Hamming codes, Repetition codes - Linear block codes

Cyclic codes: Cyclic codes, Syndrome calculation, Encoder and decoder, CRC,

Convolutional codes, code tree, trellis, state diagram.

Encoding and Decoding: Sequential search and Viterbi algorithm, Principle of Turbo

coding, Adaptive Huffman Coding, Arithmetic Coding

References Books:

1. K Sayood, “Introduction to Data Compression” , Elsevier 2006.

2. S Gravano, “Introduction to Error Control Codes”, Oxford University Press 2007.

3. Amitabha Bhattacharya, “Digital Communication”, TMH 2006.

4. R Bose, “Information Theory, Coding and Cryptography”, TMH 2007.

5. Fred Halsall, “Multimedia Communications: Applications, Networks, Protocols and

Standards”, Pearson Education Asia, 2002.

detailed curriculum & syllabus for m.tech course

Documents