curriculum for the batch admitted in 2013 14 · pdf fileca1103 switching theory & logic...

Department of Computer Applications

National Institute of Technology, Durgapur

Curriculum & Syllabus for MCA Course

CURRICULUM FOR THE BATCH ADMITTED IN 2013 – 14

1. Duration : Three years (six semesters).

2. Total Credit : 150

3. Distribution of Marks : All papers are of full marks100 (End Semester

Examination 70 marks and CA 30 marks). Sessional are of full

marks 100. Project & viva is of full marks 100.

Paper

Code Subject L T P CP

FIRST SEMESTER Total CP: 25

CA1101 DISCRETE MATHEMATICS 3 1 0 4

CA1102 INTRODUCTION TO COMPUTER PROGRAMMING 3 1 0 4

CA1103 SWITCHING THEORY & LOGIC DESIGN 3 1 0 4

DMS FINANCIAL MANAGEMENT 3 1 0 4

DMS STATISTICAL AND NUMERICAL METHODS 3 0 0 4

CA1151 LABORATORY – I (PROGRAMMING) 0 0 3 3

CA1152 LABORATORY – II (SWITCHING THEORY & LOGIC

DESIGN) 0 0 2 2

SECOND SEMESTER Total CP: 25

CA2101 DATA STRUCTURES 3 1 0 4

CA2102 FORMAL LANGUAGE & AUTOMATA THEORY 3 1 0 4

CA2103 COMPUTER ORGANIZATION & ARCHITECHTURE 3 1 0 4

CA2104 OBJECT ORIENTED PROGRAMMING 3 1 0 4

CA2105 SYSTEM SOFTWARE 3 1 0 4

CA2151 LABORATORY – III (OOPS & DATA STRUCTURES) 0 0 3 3

CA2152 LABORATORY – IV (COMPUTER ORGANIZATION &

SYSTEM SOFTWARE) 0 0 2 2

THIRD SEMESTER Total CP: 25

CA3101 MICROPROCESSORS & THEIR APPLICATIONS 3 1 0 4

CA3102 OPERATING SYSTEM 3 1 0 4

CA3103 DESIGN AND ANALYSIS OF ALGORITHMS 3 1 0 4




CA3104 COMPUTER NETWORKS 3 1 0 4

DMS OPTIMIZATION TECHNIQUES 3 1 0 4

CA3151 LABORATORY – V (MICROPROCESSORS & OS) 0 0 2 2

CA3152 LABORATORY – VI (DAA & COMPUTER NETWORKS) 0 0 3 3

FOURTH SEMESTER Total CP: 25

CA4101 DATABASE MANAGEMENT SYSTEMS 3 1 0 4

CA4102 INTERNET & WEB TECHNOLOGY 3 1 0 4

CA4103 SOFTWARE ENGINEERING 3 1 0 4

CA4104 OPEN SOURCE SYSTEMS 3 1

0 4

CA4105 SOFT COMPUTING 3 1

0 4

CA4151 LABORATORY – VII (DBMS & SE) 0 0 3 3

CA4152 LABORATORY VIII (INTERNET PROGRAMMING &

WEB TECHNOLOGY) 0 0 2 2

FIFTH SEMESTER Total CP: 25

CA5101 COMPUTER GRAPHICS 3 1 0 4

CA5102 DISTRIBUTED SYSTEMS 3 1 0 4

** ELECTIVE – I 3 1 0 4

** ELECTIVE – II 3 1 0 4

** ELECTIVE – III 3 1 0 4

CA 5151 LABORATORY – IX (DISTRIBUTED SYSTEMS &

COMPUTER GRAPHICS) 0 0 2 2

CA 5152 SHORT PROJECT 0 0 3 3




SIXTH SEMESTER Total CP: 25

CA 6151 PROJECT WORK 0 0 0 20

CA 6152 VIVA VOCE 0 0 0 5

** Paper code should be as per elective list.

List of Electives

CA 9101 : E – COMMERCE.

CA 9102 : PATTERN RECOGNITION.

CA 9103 : IMAGE PROCESSING.

CA 9104 : SIMULATION & MODELING.

CA 9105 : INFORMATION & CODING THEORY.

CA 9106 : ADVANCED DATABASE MANAGEMENT SYSTEMS.

CA 9107 : PARALLEL COMPUTING.

CA 9108 : DATA WAREHOUSING & DATA MINING.

CA 9109 : OBJECT ORIENTED SOFTWARE ENGINEERING.

CA 9110 : AI & EXPERT SYSTEM.

CA 9111 : COMPILER CONTRUCTIONS.

CA 9112 : ADVANCED MULTIMEDIA SYSTEMS.

CA 9113 : INFORMATION SECURITY.

CA 9114 : MOBILE COMPUTING.

CA 9115 : GRAPH THEORY AND APPLICATIONS

CA 9116 : VLSI




SUBJECT

CODE

SUBJECT L-T-P CREDIT DEVELOPER

CA 1101 Discrete Mathematics 3-1-0 4

Propositional Calculus: Propositions – Logical connectives – Compound propositions –

Conditional and biconditional propositions – Truth tables – Tautologies and contradictions –

Contrapositive – Logical equivalences and implications – DeMorgan’s Laws - Normal forms –

Principal conjunctive and disjunctive normal forms – Rules of inference – Arguments -

Validity of arguments. [8]

Predicate Calculus: Predicates – Statement function – Variables – Free and bound variables –

Quantifiers – Universe of discourse – Logical equivalences and implications for quantified

statements – Theory of inference – The rules of universal specification and generalization –

Validity of arguments. [6]

Set Theory :Basic concepts – Notations – Subset – Algebra of sets – The power set – Ordered

pairs and Cartesian product – Relations on sets –Types of relations and their properties –

Relational matrix and the graph of a relation – Partitions – Equivalence relations – Partial

ordering – Poset – Hasse diagram – Lattices and their properties – Sublattices – Boolean

algebra – Homomorphism. [6]

Functions : Definitions of functions – Classification of functions –Type of functions -

Examples – Composition of functions – Inverse functions – Binary and n-ary operations –

Characteristic function of a set – Hashing functions – Recursive functions – Permutation

functions. [4]

Groups : Algebraic systems – Definitions – Examples – Properties – Semigroups – Monoids –

Homomorphism – Sub semigroups and Submonoids - Cosets and Lagrange’s theorem –

Normal subgroups – Normal algebraic system with two binary operations - Codes and group

codes – Basic notions of error correction - Error recovery in group codes. [6]

Graph theory: Definition paths, reachability, connectedness. Matrix representation of graphs,

Trees. [5]

TEXT BOOKS

1. Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to

Computer Science”, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 2003.

2. Ralph. P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied Introduction”,

Fourth Edition, Pearson Education Asia, Delhi, 2002.

REFERENCES

1. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete Mathematical Structures”,

Fourth Indian reprint, Pearson Education Pvt Ltd., New Delhi, 2003.

2. Kenneth H.Rosen, “Discrete Mathematics and its Applications”, Fifth Edition, Tata McGraw

– Hill Pub. Co. Ltd., New Delhi, 2003.

3. Richard Johnsonbaugh, “Discrete Mathematics”, Fifth Edition, Pearson Education Asia,

New Delhi, 2002




SUBJECT

CODE


CA1102 INTRODUCTION TO

COMPUTER

PROGRAMMING

3-1-0 4

Course description the course fully covers the basics of programming in the “C” programming

language and demonstrates fundamental programming techniques, customs and vocabulary

including the most common library functions and the usage of the preprocessor.

Learning objectives: To familiarize the trainee with basic concepts of computer programming

and developer tools. To present the syntax and semantics of the “C” language as well as data

types offered by the language To allow the trainee to write their own programs using standard

language infrastructure regardless of the hardware or software platform.

Course outline

1. Introduction to compiling and software development

2. Basic scalar data types and their operators

3. Flow control

4. Complex data types: arrays, structures and pointers

5. Structuring the code: functions and modules

6. Pre-processing source code

Data Types, Operators and Expressions: Variables and constants - declarations - arithmetic,

relational and logical operators – Assignment operator and expressions – conditional

expressions – precedence and order of evaluation. [8]

Control Flow: Statements and blocks – if-else, switch, while, for and do-while statements break

and continue statements, goto and labels. [6]

Functions and Program structure: Basics of functions, Parameter passing – scope rules -

recursion. [8]

Pointers and Arrays: Single and multidimensional arrays - Pointers and arrays – address

arithmetic - Passing pointers to functions. [9]

Structures and Unions: Basics of structures, Structures and functions – Arrays of Structures

Pointers to structures – self referential structures – Type definitions – Unions. [6]

Input and Output: Standard input and output – Formatted output – variable length argument list

file access. [3]

Text Book/References Books:

1. B.S. GottFried, Schaum's Outline of Programming with C(2/e), McGraw-Hill, 1996.

2. C. L. Tondo and S. E. Gimpel, The C Answer Book(2/e), Prentice Hall, 1988.

3. B. W. Kernighan, The Practice of Programming, Addison-Wesley, 1999.

4. Steve Oualline, Practical C Programming (3/e), O’Reilly Media Inc., 1997.

5. Herbert Schildt, C: The Complete Reference (4/e), McGraw-Hill Education, 2000.

R D Tennent, Principles of Programming Languages, Prentice Hall, 1981.




SUBJECT

CODE


CA 1103 SWITCHING THEORY &

LOGIC DESIGN

3-1-0 4

Number Systems and codes - Boolean algebra - Postulates and theorems - Constants, Variables

and functions - Switching algebra - Electronic gates and Mechanical contacts Boolean functions

and logical operations - Normal and canonical forms - self-dual functions - Logical operations -

Karnaugh map - Prime cubes - Minimum sum of products and product of sums - Quine - McClusky

algorithm. [10]

Combinational Logic - Analysis and Design of combinational logic circuits - Universal property of

the NAND and NOR gates - Adders -Parallel adders and look-ahead adders - Comparators -

Decoders and encoders - Code conversion -Multiplexers and demultiplexers - Parity generators and

checkers - ROMs PLAs.

[6] Fault diagnosis and tolerance - Fault classes and models-Fault diagnosis and testing - Test

generation -Fault table method - Path sensitizations method - Boolean difference method - Fault-

tolerance techniques. Programmable logic arrays - PLA minimization - Essential prime cube

theorem - PLA folding - Design for testability. [8]

Counters and shift registers - SR, JK, D and T flip-flops - Excitations tables - Triggering of flip-

flops - Flip-flop applications - Latches - Ripple counters - Synchronous counters - Up-down

counters -Design of sequential circuits - Counter decoding - Counter applications - Shift registers

and their applications - Clock mode sequential machine - State tables and diagrams. [9]

Text Books

Biswas N.N., Logic Design Theory, Prentice Hall of India (Modules I, II & III)

Floyd T.L., Digital Fundamentals, Universal Book Stall (Module IV)

Reference Books

Kohavi Z., Switching & Finite Automata Theory, Tata McGraw Hill

Millman J. & Halkias C.C., Integrated Electronics: Analog & Digital Circuits & Systems, Tata

McGraw Hill

M.Morris mano, Charles R. Kime, Logic and Computer Design Fundamental, Pearson Education.




SUBJECT

CODE


CA1151 LABORATORY – I

(PROGRAMMING)

0-0-3 3

Introduction to C programming [4]

Decision control structure [2]

Looping [4]

Functions [4]

Pointers [4]

Arrays [4]

Structure [4]

SUBJECT

CODE


CA1152 LABORATORY – II

(SWITCHING THEORY &

LOGIC DESIGN)

0-0-2 2

1. Verify truth table of the following Logic Gates using IC

AND, OR, NOT, NAND, NOR,XOR.

2. Proof that NAND and NOR are universal gate.

3. Design the following circuits using basic gate.

Half Adder, Full Adder, Half Subtracter, Full Subtracter,

BCD Adder, BCD Subtracter, n-bit Comparator,

Code Conversion,

Decoder and Encoders, Multiplexers and Demultiplexer,

Parity Generators and Checkers

4. Design the following circuit using Multiplexer and Decoder.

Half Adder, Full Adder, Half Subtracter, Full Subtracter.

5. Design Latch, SR flip-flop using basic gates.

6. Design Ripple counters, Synchronous counters, Up-down counters, Shift registers using Flip-

Flops.




SUBJECT

CODE


CA2101 DATA STRUCTURES 3-1-0 4

Data types and algorithms; Time and space analysis of algorithms.

Order notations; Linear data structure, sequential storage representation – arrays, strings,

Stacks, queues, dequeues and applications. [8]

Linear data structure: Linked storage lists, circular linked lists, double linked lists. [6]

Applications: recursion – design of recursive algorithms, tail recursion, when not to use

recursion, removal of recursion. [4]

Non linear data structure: Trees, binary trees, binary search trees, traversal and threads,,

insertion and deletion algorithms, height-balanced and weight-balanced trees, B-trees, B+

trees. [10]

Application of trees: Graphs – representation, breath first and depth first searches,, spanning

trees.

Basic sorting and searching algorithms, hashing. [10]

Text Book:

1. Sahni S, Data Structures, Algorithms & Application in C++, McGraw Hill

2. A M Tanenbaum et al, Data Structures using C, Prentice Hall, 1989.

Reference Book :

1. Cormen T.H., Leiserson C.E.,& Rivest R.L., Introduction to Algorithms, MIT Press,

1990

2. Adam Drozdek, Data Structures and Algorithms in C++, Thomson Brooks/cole - Vikas

Pub. House pvt. Ltd.

3. Seymour Lipsutz, Data Structures (2/e), Schaum’s Oultines, TMH




SUBJECT

CODE


CA2102 FORMAL LANGUAGE &

AUTOMATA THEORY

3-1-0 4

1. Automata Theory and Formal Languages: [12 L = 24 Hrs]

Regular languages. Finite automata and the class of languages they define. Closure

properties of regular languages. Multiple-characterization of regular languages

(DFAs, NFA, regular expressions). The pumping lemma for regular languages.

Context-free languages. Grammars and pushdown automata. Normal forms. The

pumping lemma for CFLs.

2. Computability Theory: [6L = 12 Hrs]

The Turing-machine model, RAM model, and other equivalent models of effective

computability. The Church-Turing thesis.

Decidable and undecidable problems. Recursively-enumerable sets. The halting

problem and other examples of undecidable problems.

Reducibility. Examples of many-one reductions.

3. Complexity Theory: [2L = 4Hrs]

Time complexity. P and NP. Polynomial-time reducibility. NP-Completeness. The

Cook-Levin Theorem. Example reductions among NP-hard sets.

Goals: students will (1) learn core ideas in computer science theory, including how to define and

investigate a formalized model of computation, and what it means to reduce one problem to

another; and (2) deepen their ability to think clearly, originally and devise correct proofs.

Text Books:

1. John E. Hopcroft, Introduction to Automata theory, Languages and Computation, 3rd

edition, 2013

2. M. Sipser, Introduction to the Theory of Computation, 3rd ed. Course Technology, 2012

3. Michael R. Garey and David S. Johnson, Computers and Intractability: A Guide to the

Theory of NP-Completeness, W. H. Freeman and Company, 1979

Reference Books:

1. Fundamentals of the Theory of Computation: Principles and Practice – Raymond

Greenlaw, H.James Hoove, Morgan Kaufmann, 1998.

2. Introduction to Languages and Automata Theory – John C Martin, 3rd

Edition, Tata

McGraw-Hill, 2007.

3. Introduction to Computer Theory – Daniel I.A. Cohen, 2nd

Edition, John Wiley & Sons,

2004.

4. An Introduction to the Theory of Computer Science, Languages and Machines – Thomas

A. Sudkamp, 3rd

Edition, Pearson Education, 2006.




SUBJECT

CODE


CA2103 COMPUTER

ORGANIZATION &

ARCHITECHTURE

3-1-0 4

Different generation of computers, Von-Neumann architecture, operational concepts, instruction

format, addressing modes [2]

Case study of architectures of mainframe /minicomputer (IBM 370) with their associated

instruction formats. [2]

Loader and Wallace free multiplexers, Booth’s multiplication algorithm [4]

Sequential and combinational division methods [4]

Instruction to pipelining architecture, multiplication and division methods [4]

Introduction to microprogramming concepts [2]

Horizontal, vertical and diagonal micro program formats microprogramming with multiple formats

[4]

Memory organizations, memory hierarchy, cache memory, memory interlacing, virtual memory

supports [4]

I-O organization: addressing of i/o devices, data structures through programmed I-O, interrupts and

DMA [4]

Bus architectures, VMA bus, I-O bus, SCSI bus and their applications. [2]

Basic features of some advanced microprocessors: Single chip microcomputer, 32-bit

microprocessors [2]

RISC & CISC Concepts. [2]

Books:

1. Structure computer organization - A. S. TannemBaum- PHI

2. Computer System Architecture - M. M. Mano – PHI

3. Computer Architecture and Organization - J. P. Hayes - McGraw Hill

4. Computer Organization(4th

Edn) - V.C. Hammacher - Tata McGraw Hill

5. Computer Organizations - P. Pal Chowduri




SUBJECT

CODE


CA2104 OBJECT ORIENTED

PROGRAMMING

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. (6H)

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

Component Based model. (6H)

Object oriented analysis

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

Jakobson Methods (4H)

Object oriented design (4H)

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

aggregation, using, instantiation, meta-class, grouping constructs.

Fundamentals of Object Oriented design in UML (10H)

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.

Analysis & Design of OOSE using UML [2H]

Analysis modelling using UML, Design modelling using UML, Tools support (Introduction to

Rational Rose).

Object Oriented System Architecture [4H]

Model Driven Architecture, Domain Specific Modelling notation, Model integrated Computing for

OOSE

Quality Evaluation of OOS: CK metrics and methods, Lee Metrics, Quality analysis (4H)

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


CA2105 SYSTEM SOFTWARE 3-1-0 4

Introduction to Compiler

Introduction to compiler, lexical analysis, parsing, symbol tables, declaration and storage

management, code generation, and optimization techniques. [3]

Laxical, Syntax and Semantic Analysis

Lexical analysis: Specification and recognition of tokens. Syntax analysis: Top-down parsing-

Recursive descent and Predictive Parsers. Bottom-up Parsing- LR (0), SLR, and LR (1) Parsers

Semantic analysis: Type systems, symbol tables and type checking. [10]

Intermediate Code Generation and Optimization

Intermediate code generation: Intermediate representation-Three address code and quadruples.

Syntax-directed translation of declarations, assignments statements, conditional constructs and

looping constructs. Runtime Environments: Storage organization, activation records. Introduction to

machine code generation and code optimizations. [10]

Assemblers

Basic assembler functions, a simple SIC assembler, assembler algorithm and data

structures, Machine dependent assembler features, instruction formats and addressing modes,

Program relocation, machine independent assembler features, literals, symbol, defining statements,

expressions, onepass assemblers and Multi pass assemblers

implementation example, MASM assembler . [6]

Loaders and Linkers

Basic loader functions - Design of an Absolute Loader – A Simple Bootstrap Loader-Machine

dependent -loader features - Relocation – Program Linking – Algorithm and Data Structures

for Linking Loader Machine independent loader features –Automatic Library Search–

Loader Options - Loader designoption- Linkage Editors – Dynamic Linking – Bootstrap Loaders -

Implementation example - MSDOS linker. [6]

System Software Tools

Text editors - Overview of the Editing Process - User Interface– Editor Structure.–Interactive

debugging systems -

Debugging functions and capabilities Relationship with other parts of the system- User interfac-

Criteria. [4]

Text Book

1. Leland L. Beck, “System Software An Introduction to Systems Programming”, 3rdEdition, Pears

on Education Asia, 2000.

References

1. D. M. Dhamdhere, “Systems Programming and Operating Systems”, Tata McGraw-Hill, 1999.

2. John J. Donovan “Systems Programming”, Tata McGraw-Hill Edition, 1972.

3. John R. Levine, Linkers & Loaders – Harcourt India Pvt. Ltd., Morgan Kaufmann

Publishers, 2000.




SUBJECT

CODE


CA 2151 LABORATORY – III (OOPS

& DATA STRUCTURES)

OOPS Lab

0-0-3 3

Method of measurement, Measurement system, Classification of instruments, Definition of

accuracy, Precision, Resolution, Speed of response, Error in measurement, Classification of

errors [3]

Measurement of Voltage and Current: Principle of operation and torque equation of Moving

coil, Moving iron instruments [5]

Extension of instrument ranges. [2]

Measurement of Power & Energy: Principle of operation of Electrodynamic & Induction type

wattmeter, Power measurement by two wattmeter, Construction, theory and application of AC

energy meter. [6]

Measurement of resistance: Measurement of medium, low and high resistances, Megger.

[4]

AC Bridges: Measurement of Inductance, Capacitance by AC bridges. [6]

Localization of Cable fault: Methods used for localization of ground and short circuit fault.

[3]

Sensors & Transducers: Introduction to sensors & Transducers, Strain gauge, LVDT,

Temperature transducers, Piezo-electric transducer, pressure transducer, Flow measurement

using magnetic flow measurement. [6]

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 2152 LABORATORY – IV

(COMPUTER

ORGANIZATION &

SYSTEM SOFTWARE)

Computer Organization Lab

0-0-2 2

1. Bread Board Implementation of various logic gates using NAND gate.

2. Bread Board implementation of Binary Adder (Half and Full)

3. Bread Board implementation of Adder/Subtracter.

4. Bread Board Implementation of Flip-Flops.

5. Experiments with clocked Flip-Flop.

6. Design of Counters.

7. Bread Board implementation of counters & shift registers.

8. Implementation of Arithmetic algorithms.

9. Bread Board implementation of Seven Segment Display

System Software Lab

1. Implement a symbol table with functions to create, insert, modify, search, and

display.

2. Implement pass one of a two pass assembler.

3. Implement pass two of a two pass assembler.

4. Implement a single pass assembler.

5. Implement a two pass macro processor

6. Implement a single pass macro processor.

7. Implement an absolute loader.

8. Implement a relocating loader.

9. Implement pass one of a direct-linking loader.

10. Implement pass two of a direct-linking loader.

11. Implement a simple text editor with features like insertion / deletion of a character,

word, and sentence.

12. Implement a symbol table with suitable hashing




SUBJECT

CODE


CA3101 MICROPROCESSORS &

THEIR APPLICATIONS

3-1-0 4

Introduction to microprocessors [3]

Microprocessors architecture [2]

Organization of microprocessors Intel-8085 and Intel-8086 [6]

Machines and assembly language.

Pseudo operation.

Subroutines in Assembly language. [6]

Interrupts and I/O programming. [4]

8085 / 8086 Programming. [6]

Data Transfer techniques and their implementation [4]

Programmed data transfer

DMA transfer

Interrupt driven data transfer

Serial and parallel communication

Some common peripherals & their interfacing [4]

Key board &display

Programmable parallel interface

Programmable timer

ADC & DAC

Basic features of some advanced microprocessors: Single chip microcomputer, 32-bit,

microprocessors, RISC & CISC Concepts. [4]

Books :

1. Microprocessor Architecture Programming & Application - R. Goenker- Wiley Eastern

2. Microprocessor & Interfacing Programming & Hardware - D. V. Hall - McGraw-Hill

3. Microcomputer System - Liu & Gibson – PHI

4. Fundamental of Microprocessor & Microcomputer - B. Ram - Dhanpati Rai & sons

5. Advanced Microprocessor - Daniel Tabak - McGraw Hill




SUBJECT

CODE


CA3102 OPERATING SYSTEM 3-1-0 4

Introduction, operating systems concepts and strategies, multiprogramming, overview: operating

system structures [2]

Process Management: process concept, concurrent programming and Unix processes, operations on

processes, process scheduling [2]

CPU Scheduling: concepts, criteria, CPU scheduling algorithms, algorithm evaluation and

performance [4]

Process Synchronization: race conditions, critical section problem, solutions, semaphores, busy

waiting vs blocking, deadlock and starvation [4]

Process Management: cooperating processes, producer-consumer shared-memory solution. [2]

Process Synchronization: classical problems, monitors, condition variables, synchronization

examples [6]

Thread Management: threads, multithreading models, POSIX Threads API, case studies of operating

systems [2]

Deadlocks: system model, characterization, deadlock prevention, deadlock avoidance, deadlock

detection and recovery [4]

Memory Management: contiguous memory allocation, internal and external fragmentation [2]

Memory Management: paging, page table structure, segmentation, operating system examples. [4]

Virtual Memory: demand paging, page fault, page replacement algorithms, allocation of frames. [2]

Virtual Memory: thrashing, working set model, other considerations, operating system examples. [2]

Distributed Systems and Networking: network operating systems, client/server model, multithreaded

server models, Unix system calls for client/server communication [2]

I/O Systems: mass storage structure, disk scheduling, file system, protection and security, case

studies [2]

Books Author Publisher

An introduction to Operating Systems Deitel, H.M. Addison Wesley Pubs

Operating System Concepts Peterson, J.L,

Abraham Silberschatz

Addison Wesley Pubs

Modern Operating Systems Tennenbaum, A.S. PHI

System Software – An Introduction To

system Programming (2/e)

L. L. Beck Addison – Wesley

System Programming & O.S. D. M. Dhamdhere T.M.H.

System Programming J. J. Donovan McGraw Hill




SUBJECT

CODE


CA3103 DESIGN AND ANALYSIS OF

ALGORITHMS

3-0-0 4

UNIT – I

Preliminaries: Review of growth of functions, Recurrences: The substitution method, The iteration

method, The master method, Data Structures for Disjoint Sets. Divide and Conquer Approach:

Merge Sort, Quick sort, Medians and Order statistics, Strassen’s algorithm for Matrix

Multiplications. [10]

UNIT – II

Dynamic Programming: Elements of Dynamic Programming, Matrix Chain Multiplication,

Longest common subsequence and optimal binary search trees problems.

Greedy Algorithms: Elements of Greedy strategy, An activity selection problem, Huffman Codes,

A task scheduling problem. [10]

UNIT – III

Graph Algorithms: Representation of Graphs, Breadth First Search, Depth First Search,

Topological Sort, Strongly Connected Components, Algorithm for Kruskal’s and Prim’s for

finding Minimum cost Spanning Trees, Dijkstra’s and Bellman Fort Algorithm for finding Single

source shortest paths. All pair shortest paths and matrix multiplication, Floyd – Warshall

algorithm for all pair shortest paths. [12]

UNIT – IV

String matching: The naïve String Matching algorithm, The Rabin-Karp Algorithm, String

Matching with finite automata, The Knuth-Morris Pratt algorithm.

NP-Complete Problem: Polynomial -time verification, NP-Completeness and Reducibility, NP-

Completeness Proof, NP-Complete problems. [8 ]

Text Book:

1. V. Aho , J. E. Hopcroft & J. D. Ullman, The Design & Analysis of Computer Algorithms,

Addison Wesley

2. E. Horowitz , S. Sahni, M. Hofri, Fundamental of Computer Algorithms, Galgotia

Reference Book:

1. M. Hofri, Analysis Of Algorithm, Oxford University Press

2. D. E. Knuth, Fundamental Algorithms, Narosa

3. Cormen, Leiserson, Rivest, Introduction to Algorithms, PHI




SUBJECT

CODE


CA3104 COMPUTER NETWORKS 3-1-0 4

Overview of data communication and Networking: Introduction; Data communications:

components,data representation(ASCII,ISO etc.),direction of data flow(simplex, half

duplex, full duplex); Networks:distributed processing, network criteria, physical structure

(type of connection, topology), categories of network (LAN, MAN,WAN);Internet: brief

history, internet today; Protocols and standards; Reference models: OSI reference model,

TCP/IP reference model, their comparative study. [4]

Physical level: Overview of data and signal (analog & digital), transmission (analog &

digital)& transmission media ( guided & non-guided); TDM, FDM, WDM; Circuit

switching: time division & space division switch, TDM bus; Telephone network; [8]

Data link layer: Types of errors, framing(character and bit stuffing), error detection &

correction methods;Flow control; Protocols: Stop & wait ARQ, Go-Back- N ARQ,

Selective repeat ARQ, HDLC; Medium access sub layer: Point to point protocol, LCP,

NCP, FDDI, token bus, token ring; Reservation, polling, concentration; Multiple access

protocols: Pure ALOHA, Slotted ALOHA, CSMA, CSMA/CD, FDMA, TDMA, CDMA;

Traditional Ethernet, fast Ethernet; [8]

Network layer: Repeaters, Hubs, Bridges, Switches, Router, Gateway;Addressing :

Internet address, classful address, subnetting; Routing : techniques, static vs. dynamic

routing , routing table for classful address; Routing algorithms: shortest path algorithm,

flooding, distance vector routing, link state routing; Protocols: ARP, RARP, IP, ICMP,

IPV6; Unicast and multicast routing protocols. [8]

Transport layer: Process to process delivery; UDP; TCP; Congestion control algorithm:

Leaky bucket algorithm, Token bucket algorithm, choke packets; Quality of service:

techniques to improve Qos. [6]

Application layer: DNS; SMTP, SNMP, FTP, HTTP & WWW; Security: Cryptography,

user authentication, security protocols in internet, Firewalls. Modern topics ISDN services

& ATM ; DSL technology, Cable modem, Sonet. [6]

Text Books:

1. B. A. Forouzan – “Data Communications and Networking (3rd Ed.) “ – TMH

2. A. S. Tanenbaum – “Computer Networks (4th Ed.)” – Pearson Education/PHI

3. W. Stallings, Data and Computer Communications (5th Ed.), PHI/ Pearson Education

Reference Books:

1. Kurose and Rose, Computer Networking -A top down approach featuring the internet,

Pearson Education

2. Leon, Garica, Widjaja – “Communication Networks” – TMH

3. Walrand – “Communication Networks” – TMH.

4. Comer – “Internetworking with TCP/IP, vol. 1, 2, 3(4th Ed.)” – Pearson Education/PHI

5. Zheng & Akhtar, Network for Computer Scientists & Engineers, OUP

6. Black, Data & Computer Communication, PHI

7. Miller, data Communication & Network, Vikas

8. Miller, Digital & Data Communication, Jaico

9. Shay, Understanding Data Communication & Network, Vikas

Website: https://sites.google.com/site/informationnetworking/Home/network-presentat




SUBJECT

CODE


CA 3151 LABORATORY – V

(MICROPROCESSORS &

OS)

Microprocessor Lab

0-0-2 2

1. Write a program to clear the contents of accumulator.

2. Write a program to store the content of carry flag to a memory location.

3. Write a program to compute the one’s complement of an 8 bit number.

4. Write a program to compute the one’s complement of 16 bit number.

5. Write a program to compute the two’s complement of an 8 bit number.

6. Write a program to compute the two’s complement of 16 bit number.

7. Write a program to calculate the summation of two 8 bit numbers.

8. Write a program to calculate the summation of two 16 bit numbers.

9. Write a program to calculate the subtraction of two 8 bit numbers.

10. Write a program to calculate the subtraction of two 16 bit numbers.

11. Write a program to calculate the S of the following series.

12. S=1+2+3+4+........... Up to n term.

13. S=2+4+6+8+……... up to n term.

14. S=1+3+5+7+……... Up to n term.

15. S=21

+22 +2

3 +2

4 +………... up to n term.

16. S=1-2+3-4+………. Up to n term.

17. S=2-4+6-8+………. Up to n term.

18. S= 1-3+5-7+……… Up to n term.

OS Lab

1. Use of shell script in various applications. [2]

2. Problems on Process management (Simulation or Development) [2]

3. Inter-process communication system. [2]

4. Memory Management. [2]

5. File Management. [2]

6. Case studies on other operating system (e.g. Linux, Windows NT). [1]

7. Writing Macros. [1]

8. Simulation of Parser, String Tokenizer, Simple Assembler etc. [1]

9. Design of Text Editor, Simple Loader etc. [1]

10. Study & Application of Unix System Calls. [1]

11. Writing Library files to simulate the System calls with customization [1]

TEXT BOOKS:

REFERENCE BOOKS:




SUBJECT

CODE


CA 3152 LABORATORY – VI (DAA &

COMPUTER NETWORKS)

DAA Lab

0-0-3 3

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

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

Linked list: Single, double, circular [2]

Computer Networks Lab

1. IPC (Message queue) [2]

2. Network Protocol Analysis using Wirshark [2]

3. Familiarization with Hubs, Switches, router, wireless Access Point [3]

4. TCP/UDP Socket Programming

a. Multicast & Broadcast Sockets

b. Implementation of a Prototype Multithreaded Server [3]

5. Sending an Image/Video file from client machine to a group of machines using

Multicast programming [3]

6. Implementation of

a. Data Link Layer Flow Control Mechanism (Stop & Wait, Sliding Window)

b. Data Link Layer Error Detection Mechanism (Cyclic Redundancy Check)

c. Data Link Layer Error Control Mechanism (Selective Repeat, Go Back N)

[4]

7. Concept of Raw Socket Programming

a. Implementation of Ping Tool. [3]

TEXT BOOKS:

REFERENCE BOOKS:




SUBJECT

CODE


CA4101 DATABASE MANAGEMENT

SYSTEMS

3-1-0 4

Basic concepts: Database and database users, Characteristics of the database, Database

systems.

Concepts & architecture: Data models, schemes and instances, DBMS architecture & data

independence, Database languages & interfaces, Data modeling using the entity-

relationship approach. [10]

Relational model: languages & systems, Relational data model & relational algebra,

Relational model concepts, Relational model constraints, Relational algebra.

SQL – A Relational database language, Data definition in SQL, View & queries in SQL,

Specifying constraints & indexes in SQL.

A relational database management systems – ORACLE / INGRESS [10]

Conventional data models & systems : Network data model & IDMS systems,

Membership types & options in a set, DML for the network model, Navigation within a

network database, Hierarchical data model & IMS system.

Hierarchical database structure, HSAM, HISAM, HDAM, HIDAM organization, DMA for

Hierarchical model, Overview of IMS. [4]

Relational database design Functional dependencies & normalization for Relational

databases, Functional dependencies, Normal forms based on primary keys (1NF, 2NF,

BCNF & 3NF), loss-less join & dependency preservation, decomposition. [8]

concurrency control & recovery techniques Concurrency control techniques, locking

techniques, time stamp ordering, granularity of data items, recovery techniques, recovery

concept, database backup and recovery from catastrophic failures.

Concept of object oriented data base management systems. [4]


Fundamental of

Database Systems (2nd

Edn.)

Elmasri & Navathe The Benjamin Cummins

Publishing Inc.

An Introduction To

Database Systems. (Vol I

& II)

C. J. Date Adddison – Wesley

Database System

Concepts (3/e)

Korth & A. Silberscatz T.M.H.

Principles of Database

Systems (2/e)

J. D. Ullman Galgotia




SUBJECT

CODE


CA4102 INTERNET & WEB

TECHNOLOGY

3-1-0 4

Introduction to Internet: Evolution of Internet, TCP/IP: addressing and routing, Internet

Service Providers, Type of Connectivity such as Dial-up, leased, VSAT etc.

[4]

Internet Protocol and Addressing: IP, ICMP, ARP, addressing scheme. Subnet and

Super-net concept. [6]

Internet applications: Telnet, FTP, Email, DNS. [2]

World Wide Web: HTTP protocol, Evolution of WWW, Basic Features, Web browsers,

HTML Common tags- List, Tables, images, forms, Frames; Cascading Style sheets;

[4]

Introduction to Java Scripts, Objects in Java Script, Dynamic HTML with Java Script, CSS.

[6]

XML: Document type definition, XML Schemas, Document Object model, Presenting

XML, Using XML Processors: DOM and SAX. [8]

Introduction to AJAX and Server Side Scripting. [5]


Web Technologies:

TCP/IP to Internet

Application

Architectures

Achyut S. Godbole &

Atul Kahate

TMH

Web Technologies: A

Computer Science

Perspective

Jackson Pearson Education

TCP/IP Networking:

Architecture,

Administration, and

Programming, 1/e

James Martin & Joseph

Leben

PHI

Computer Networks and

Internets

Douglas E. Comer Prentice Hall




SUBJECT

CODE


CA4103 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


CA4104 OPEN SOURCE SYSTEMS 3-1-0 4

[36 Hrs]

Software Freedom& The GNU Project (4), The Cathedral and Bazzar model of

development of Open Source software & FOSS development model (4), The Free Software

Foundation and Richard Stallman(4), Open Source Software Deployment Statistics(2),

Case studies of FOSS including that of GCC(4), GDB(4) and the LINUX kernel(4),

Mozilla and Apache (2), Open Source Licensing Issues: GPL(2), LGPL(2), BSD/MIT(2),

MOZILLA(2).

Illustrative readings:

1. Free as in Freedom (2.0): Richard Stallman and the Free Software Revolution Sam

Williams Second edition revisions by Richard M. Stallman

2. Use of Free and Open-Source Software (FOSS) in the U.S. Department of Defense

Copyright 2002 by The MITRE Corporation. All rights reserved. Approved for

public release; distribution unlimited.

3. Free Software, Free Society Selected Essays of Richard M. Stallman Second

Edition

4. Open source software licensing by Steve H. Lee

5. Understanding Open Source and Free Software Licensing By Andrew M. St.

Laurent

TEXT BOOKS:

REFERENCE BOOKS:

SUBJECT

CODE


CA4105 SOFT COMPUTING 3-1-0 4

Fuzzy logic: Conventional and fuzzy sets, operations on fuzzy sets, fuzzy numbers, crisp

relations and fuzzy relations, realization of fuzzy systems using fuzzy relations, application

of fuzzy logic in optimization, vision, pattern recognition.

[4]

Neurocomputing: Introduction to neural networks, threshold logic [4]

Models of neurocomputing: Perceptron,. Adaline, Multi-layer perceptron, backpropagation

learning, RBF network, Hopfield networks, ART –I and II, SOFM. Applications in pattern

recognition and image processing.




[6]

Evolutionary computing: Introduction to Evolutionary Computation: Genetic algorithms,

Genetic programming, Evolutionary strategies, Evolutionary programming.

[6]

Genetic algorithms – Chromosome representation, encoding, decoding, Genetic operators:

Selection, Crossover, Mutation, Elitism, Schema Theorem, EGA, Convergence theorem,

real-coded GA, Ordered GA, Steady-state GA, Multi-objective evolutionary algorithms,

applications in search and optimization. Recent advances in Evolutionary Computing

(Particle Swarm Optimization, Ant Colony Optimization). [10]

Hybridizations: Different types of integrations, merits. Neuron-fuzzy, Neuro-GA, Fuzzy-

GA, Neuro-fuzzy-GA [5]

References Books: 1. G. J. Klir and B. Yuan, Fuzzy Sets and Fuzzy Logic: Theory and Applications, Prentice

Hall, 1995.

2. K. H. Lee, First Course on Fuzzy Theory and Applications, Springer, 2005.

3. S. Haykin, Neural Networks: A Comprehensive Foundation, 2nd ed., Prentice Hall, New

Jersey, 1999.

4. J. M. Zurada, Introduction to Artificial Neural Systems, West Publishing Co., St. Paul,

Minnesota, 1992.

5. J. Hertz, A. Krogh, and R. G. Palmer, Introduction to the Theory of Neural Computation,

Addison Wesley, California, 1991.

SUBJECT

CODE


CA4151 LABORATORY – VII (DBMS

& SE)

DBMS Lab

0-0-3 3

1.To study DDL operation like Table Creation and their Constraints, and implement it into

database. [1]

2. To study DML operation Insert, Select Commands, Update and Delete Commands. [1]

3. To study various aggregate function and implement it into database. [1]

4. To study various logical operation like(and, or,not) and implement it into database. [1]

5. To study various inbuild keyword like(where,order by, group by, etc) and implement it

into database. [1]

6. To study Nested Queries and Join Queries and implement it into database.. [2]

7. To study various Data Language command like (grant, revoke, commit, rollback) and

implement it into database. [3]

8. To perform set operations like( UNION, INTERSECT, MINUS) using DML

commands and implement it into database. [2]

9. To create and manipulate various database object of the Table using views. [2]

10. To create PL/SQL programs to implement various types of control structure(branching,

looping, selection) [2]




Software Engineering Lab

1. ERD and DFD Case Study [6]

2. Software Testing [6]

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

etc.) [6]

TEXT BOOKS:

REFERENCE BOOKS:

SUBJECT

CODE


CA 4152 LABORATORY VIII

(INTERNET

PROGRAMMING & WEB

TECHNOLOGY)

0-0-2 2

1. Study of internet, e-mail, web server & web browser configuration & use.

2. Simple Network Programming using TCP/IP, FTP, TELNET protocols

3. Study & use of web languages.

4. Database connectivity in Web Applications.

5. Study & use of XML.

6. Internet Design Case studies

TEXT BOOKS:

REFERENCE BOOKS:




SUBJECT

CODE


CA 5101 Computer Graphics 3-1-0 4

Basic Concepts

Basics of Computer Graphics, Interactive and Non Interactive Computer Graphics,

Pixel Resolution, Aspect Ratio, Refresh rate, Frame buffer, Basic Operation of CRT,

Raster-Scan Display, Random-Scan Display, Color Display, Beam-penetration method,

Shadow-mask method, Aliasing and Antialiasing, Color Models. [6]

Drawing and filling algorithm

Line Drawing Algorithms, Digital Difference Analyzer (DDA) Algorithm, Bresenham line

Drawing Algorithm.Circle Drawing Algorithms, Bresenham Circle Drawing Algorithm,

Midpoint Circle Drawing Algorithm.Ellipse-Generating Algorithms, Properties of Ellipses,

Midpoint Ellipse Algorithm, Filling Algorithms: Seed fill Algorithm, Scan Line Fill

Algorithm,Flood Fill Algorithm. [8]

2D Transformation

Translation, Transformation of straight lines, Transformation of parallel lines,

Transformation of intersecting lines. Rotations, Scaling, General Pivot-Point Rotation,

General Fixed-Point Scaling, General Scaling Directions , Concatenation Properties

,General Composite Transformations and Computational Efficiency, Matrix

Representations and Homogeneous Coordinates, Composite Transformations, Shearing,

Reflection, Translation and homogeneous co-ordinates. Transformations between

Coordinate References Systems. Affine Transformations, Transformation Functions, Raster

Methods for Transformations. [6]

3D Transformation

Translation, Rotation, Scaling, Reflection, Reflection through arbitrary plane, Projection,

Perspective projection, Vanishing Point, Parallel projection, Orthographic projection,

Axonometric Projection. [4]

Windowing and clipping

Windowing, Object space, Image Space, Window, View Port, Relation between Window

and View Port, The Viewing Pipeline, Viewing Coordinate Reference Frame. Two-

Dimensional Viewing Function.Clipping, Point Clipping, Line clipping, Cohen-Sutherland

Line Clipping, Liang-Barsky Line Clipping, Nicholl-Lee-Nicholl Line Clipping, Line

Clipping Using Nonrectangular Clip Windows, Splitting Concave Polygons. Polygon

Clipping, Sutherland-Hodgeman Polygon Clipping, Weiler-Atherton Polygon Clipping,

Curve Clipping, Text Clipping, Exterior Clipping. [5]

Curves

Curve representation, surfaces, designs, Splines, Interpolation and Approximation Splines,

Parametric Continuity Conditions, Geometric Continuity Conditions, Spline Specifications,

Cubic Spline, Interpolation Methods, Natural Cubic Splines, Hermite Interpolation,

Cardinal Splines, Kochanek-Bartels Splines, Bezier Curves and Surfaces, Bezier Curves,

Properties of Bezier Curves, Design Techniques Using Bezier Curves, Cubic Bezier

Curves, B-Spline, and Convex-hull, Uniform Periodic B-Splines, Cubic Periodic B-Splines,

Open, Uniform B-Splines, Non-uniform B-Splines, B-Spline Surfaces, Beta-Splines, Beta-

Spline Continuity Conditions, Cubic Periodic Beta-Spline, Matrix Representation, Rational

Splines. [6]

Hidden surfaces




Depth comparison, Z-buffer algorithm, Back face detection, BSP tree method, the Printer’s

algorithm, scan-line algorithm; Hidden line elimination, wire frame methods, fractal -

geometry. [3]

Color & shading models [2]

Light & Color model; Shading, ground shading, phong shading. Shadowing, shadow

algorithms, Texture.

Books:

1. Hearn, Baker – “Computer Graphics (C version 2nd Ed.)” – Pearson education

2. Z. Xiang, R. Plastock – “Schaum’s outlines Computer Graphics (2nd Ed.)” – TMH

3. D. F. Rogers, J. A. Adams – “Mathematical Elements for Computer Graphics (2nd Ed.)”

– TMH

4. Buford J. K. – “Multimedia Systems” – Pearson Education

5. Hill,Computer Graphics using open GL, Pearson Education

6. Foley, Vandam, Feiner, Hughes – “Computer Graphics principles (2nd Ed.) – Pearson

Education.

7. W. M. Newman, R. F. Sproull – “Principles of Interactive computer Graphics” – TMH.

8. Elsom Cook – “Principles of Interactive Multimedia” – McGraw Hill

SUBJECT

CODE


CA 5102 DISTRIBUTED SYSTEMS 3-1-0 4

Introduction to Distributed Systems [1 L = 2Hrs]

Distributed systems Program Correctness Criteria and Proof Techniques [2 L = 4Hrs]

Time and Clocks [2L = 4Hrs]

Distributed mutual Exclusion [2L = 4 Hrs]

Distributed Snapshot [2L=4Hrs]

Global State Collection [3L=6Hrs]

Distributed Graph Algorithms [2L = 4Hrs]

Coordination algorithms [2L=4Hrs]

Faults and Fault tolerance [2L = 4Hrs]

Distributed Consensus [2L = 4Hrs]

Group Communication [2L = 4Hrs]

Illustrative Reading

Sukumar Ghosh: Distributed Systems: An Algorithmic Approach, 2006 CRC Press

Andrew Tanenbaum and Maarten van Steen, Distributed Systems: Principles and

Paradigms

Leslie Lamport: Time, Clocks, and the Ordering of Events in a Distributed System.

Commun. ACM 21(7): 558-565 (1978) (pdf) .

K. Mani Chandy, Leslie Lamport: Distributed Snapshots: Determining Global States of

Distributed Systems ACM Trans. Comput. Syst. 3(1): 63-75 (1985) (pdf)

TEXT BOOKS:

REFERENCE BOOKS:

http://portal.acm.org/citation.cfm?doid=359545.359563

http://dl.acm.org/citation.cfm?doid=214451.214456




SUBJECT

CODE


CA 5151 LABORATORY – IX

(DISTRIBUTED SYSTEMS &

COMPUTER GRAPHICS)

Distributed Systems

0-0-2 2

1. Design a Distributed APPLICATION using RMI for remote computation

2. Design a Distributed APPLICATION using Message passing Interface for remote

computation

3. Write a program to simulate the functioning of Lamport’s logical clock

4. Write a program to simulate the Distributed Mutual Exclusion

5. Implement concurrent day-time client-server application

Computer Graphics

1. Graphics Programming : Getting started with OpenGL, Input and Interaction in

OpenGL

2. Geometrical Objects and Transformations in 2D and 3D, homogeneous coordinates,

matrix representation, windows and viewports

3. Viewing in 3D, projections, hidden surface removal

4. Light, shading and materials. Illumination and Shading, light sources, (surface detail,

ray tracing, radiosity)

5. From Vertices to Fragments: modeling, geometry processing, rasterization, fragment

processing. Clipping, hidden surface removal, antialiasing.

6. Discrete techniques: buffers, bit and pixel operations, texture mapping, compositing.

7. Programmable shaders: OpenGL shading language, fragment shaders, cub and bump

maps.

8. Modelling Techniques, trees, scene graphs.

9. Curve and surface representation

10. Advanced rendering techniques: ray tracing, radiosity, image based rendering.

TEXT BOOKS:

REFERENCE BOOKS:




List of Electives

SUBJECT

CODE


CA 9101 E – COMMERCE

Introduction, IT and business, E-commerce: Concepts

Electronic Communication, PCs and Networking, E-mail, Internet and intranets. EDI to E-

commerce, EDI, UN/EDIFACT

Concerns for E-commerce Growth, Internet bandwidth, Technical issues, Security issues.

India E-commerce Readiness, Legal issues, Getting started.

Security Technologies: Cryptography, Public Key Algorithms, Private Key Algorithms,

Hashing techniques, Certification and key Distribution, Cryptographic Applications,

Encryption, Digital Signature

Protocols for Transactions. SSL-Secure Socket Layer, SET-Secure Electronic Transaction,

Credit Card Business

Electronic Commerce providers. CyberCash, Digicash, VeriSign Software Package: PGP e-

mail encryption software. EDI software developed by NIC for Customs.

Books: 1. Electronic Commerce -Framework, technologies and Applications - Bharat Bhasker

TMH Publications

2. E-Commerce – Cutting Edge of Business- Kamlesh K Bajaj, Debjani Nag – Tata

McGraw Hill

3. E-Commerce – an Indian perspective – P T Joseph – Prentice Hall

4. E-Commerce concepts, Models, Strategies – C S V Moorthy –Himalaya Publications

SUBJECT

CODE


CA 9102 PATTERN RECOGNITION

Introduction to pattern recognition and learning (supervised, unsupervised), training and

test sets, feature selection.

Supervised learning and classification: Discriminant functions and decision boundaries

Linear discriminant functions, relaxation procedure, non-separable behaviour Minimum

distance classifier.

Bayesian decision theory.Maximum likelihood classification. Parameter estimation,

sufficient statistics, component analysis and discriminants (PCA, Fisher’s) Nonparametric

techniques. Density estimation, Parzen window, K-NN estimation




Unsupervised learning and clustering: Data description and clustering –similarity measures,

criterion for clustering, Methods of clustering - partitional, hierarchical, graph theoretic,

density based, Cluster validity

Feature extraction and feature selection: Problems of dimensionality- Feature extraction --

PCA-Feature selection –Karhunen Loeve, stochastic approximation, kernel approximation,

divergence measures

References Books: 1. R. O. Duda, P. E. Hart and D. G. Stork, Pattern Classification and Scene Analysis, 2nd

ed., Wiley, New York, 2000.

2. J. T. Tou and R. C. Gonzalez, Pattern Recognition Principles, Addison-Wesley, London,

1974.

SUBJECT

CODE


CA 9103 IMAGE PROCESSING

DFT, DCT, Wavelet.

Enhancement: contrast enhancement, smoothing and sharpening, filtering and restoration

Segmentation: pixel classification, global/local gray level thresholding, region growing,

split/merge techniques, edge detection operators, Hough transform. Image feature/primitive

extraction, component labeling, medial axis transform, skeletonization/thinning, shape

properties, textural features – moments, gray level co occurrence matrix, structural features,

Fourier descriptor, polygonal approximation.

Compression: coding, quantization, spatial and transform domain based compression.

Color image processing: color model, enhancement, and segmentation.

Mathematical morphology: basic concepts, erosion, dilation, opening, closing. Advanced

applications like biomedical image processing, digital watermarking, etc

References Books:

1. R. C. Gonzalez and R. E. Woods, Digital Image Processing, Addison-Wesley,

California, 1993.




SUBJECT

CODE


CA 9104 SIMULATION &

MODELING

Simulation and Modeling Objectives, Examples of application in various fields, General

Concepts, Continuous and Discrete Models, Monte Carlo Simulation, Review of Basic

Probability and Statistics, Stochastic Processes, Discrete Time Markov Chains, Petri Nets:

Properties, Analysis and Applications, Variants of Petri Nets: Colored Petri Nets (CPN),

Stochastic Petri Nets (SPN), Generalized Stochastic Petri Nets (GSPN), Random Number

Generators, Pseudo Random Number Generators, Testing Random Number Generators,

Queuing Theory, Distributed Simulation.

References Books:

1. Simulation Modeling & Analysis, by A. Law and D. Kelton, McGraw Hill Publishing

Co., 2002.

2. Probability and Statistics with Reliability, Queuing, and Computer Science Applications,

by Kishor S. Trivedi, John Wiley and Sons, New York, 2001

3. Creating Computer Simulation Systems: An Introduction to the High Level Architecture,

Kuhl, Weatherly and Dahmann, Prentice Hall, 2000.

4. Simulation Model Design and Execution: Building Digital Worlds, by P. Fishwick,

Prentice-Hall, 1995.

5. Discrete-Event System Simulation, by J. Banks, J. Carson, B. Nelson, D.Nicol, 3rd

edition, Prentice Hall, 2001.

6. Parallel and Distributed Simulation Systems, by R.M. Fujimoto, John Wiley, 2000

7. Modelling with Generalized Stochastic Petri Nets, by M. Ajmone Marsan et al, Wiley,

1995

8. The Art of Computer Systems Performance Analysis, by R. Jain, Wiley, 1991

9. Probabilistic Modelling, by I. Mitrani, Cambridge University Press, 1998

10. Computer and Communication Systems Performance Modeling, by P.J.B. King,

Prentice Hall, 1991

11. Performance Modelling with Deterministic and Stochastic Petri Nets, by C.

Lindemann,Wiley 1998

12. Theory of Modeling and Simulation, by Bernard P. Zeigler, Tag Gon Kim, Herbert

Praehofer, Academic Press, 2000




SUBJECT

CODE


CA 9105 INFORMATION & CODING

THEORY

Information, channel capacity, the concept of amount of information, entropy, Information

rate, Conditional and joint entropies.

Source Coding : Noise less coding, Shannon’s first fundamental theorem, Discrete memory

less channel, Mutual information, Sources with finite memory, Markov sources, Shannon’s

second fundamental theorem on coding, Huffman coding, Lempel – Ziv algorithm,

Shannon-Fano algorithm.

Channel Coding : Error detecting codes, Hamming distance, Error correcting codes,

Repetition codes, Linear block codes, binary cyclic codes, BCH codes, Reed-Soleman

codes, Golay codes.

Convolution Coding: Code tree, state diagram, Trellis diagram, Maximum-Likelihood

decoding – Viterbi’s algorithm, sequential decoding.

Network Information theory, Introduction to Cryptography


Elements of Information

Theory

T M Gover, J M Thomos Wiley

Digital Communications Haykins S Wiley

Digital Communications J G Proakis Mc Graw Hill

Computer Vision Ballard and C.M.Brown Prentice Hall, Englewood Cliffs

Coding and Information

Theory

Roman, S. New York: Springer-Verlag

SUBJECT

CODE





CA 9106 ADVANCED DATABASE

MANAGEMENT SYSTEMS

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

SU

BJECT

CODE


CA 9107 PARALLEL COMPUTING

Introduction to High Performance Computing: Milestones and applications.

High-Performance Computing architectures: Overview of the major classes of HPC

architectures and their evolution.

Parallel programming models and performance analysis: Parameterisation, modeling,

performance analysis, Amdahl’s law, efficiency, and benchmarking of systems.

Programming parallel computers: Overview of parallel programming, parallel languages,

parallelizing compilers, message passing and data parallel programming models,

introduction to MPI and OpenMP.

Multi-Thread Models with primary sources of overhead, memory architecture and memory

access times and associated sources of overhead; Multi-Process Execution Model;

Performance Tuning via Overhead Reduction; Task Scheduling; Data Partitioning and its




Effect on Performance.

Restructuring for Parallel Performance - Loop Transformations; Data Transformations;

Dependence Analysis; Compiler Strategies.

Parallel Algorithms - Cyclic Reduction; Iterative Algorithms (Jacobi, Gauss-Seidel and

Red-Black Orderings);

Divide-and-Conquer Algorithms, Adaptive Quadrature.

References Books:

1. Introduction to Parallel Computing, Ananth Grama, Anshul Gupta, George Karypis, and

Vipin Kumar, 2nd edition, Addison-Welsey, 2003.

2. Petascale Computing: Algorithms and Applications, David A. Bader (Ed.), Chapman &

Hall/CRC Computational Science Series, 2007.

3.Parallel Programming in C with MPI and OpenMP by M.J. Quinn, McGraw-Hill

Science/Engineering/Math

4. Other materials will be provided in the class.

SUBJECT

CODE


CA 9108 DATA WAREHOUSING &

DATA MINING

Data Warehousing Introduction, Why Data Warehousing? Characteristics of DW, Data mart concepts and

difference with DW, Implementation choices, DW Metadata

[4]

Architecting the Data Warehouse Structuring the Data, Enterprise Data Model, Data Granularity Model, Logical Data

Partitioning Model, DW architecture – Functional dimensions, multi-tier architecture, ETL

(extraction-transformation-loading techniques)

[4]

Data Modeling for Data Warehouse

Why Data Modeling Is Important , Different approaches of data modelling, Data Modeling

Techniques, ER Modeling , Dimensional Modeling: Basic Concepts, Visualization of a

Dimensional Model, Basic Operations for OLAP, Logical modelling – Star, Snowflaking,

Constellation, multi-star models, Data Consolidation , ER Modeling and Dimensional

Modeling. [6]

Data warehouse Development Strategies

Introduction, Transformation mechanism from OLTP to OLAP databases, four Steps

Development process, Fact Types, key assignment, Handling issues like – Role playing

dimension, Changing dimension, many-to-many scenarios among dimensions and facts,

junk dimension etc., tools.

[

6

]




The Process of Data Warehousing Manage the Project, Define the Project, Requirements Gathering, Modeling the Data

Warehouse, Design the Warehouse, The Dynamic Warehouse Model

[4]

Data Warehouse Requirements modeling

Requirement modeling introduction, Source driven, User Driven and Mixed requirements

analysis strategy for Data Warehouses. [2]

Introduction to Data mining

Knowledge discovery in databases introduction, Data mining tasks, components of data

mining algorithms, data mining types

[2]

Systematic overview of data mining algorithms

Introduction, Multilayer perceptron for regression and classification, the A priori algorithm,

association rule learning.

[4]

Descriptive Modeling

Introduction, describing data by probability distributions and densities, Background of

cluster analysis, partition based clustering algorithms, Hierarchical clustering,

[4]

Predictive modeling for classification

A brief overview of predictive modeling, introduction to classification modelling, Tree

models, Nearest neighbour method, The Naive Bayes Model, Feature selection for

classification in high dimensions [4]

Text Book 1. W. H. Inmon, Building Data Warehouse, 3

rd Edition, Wiley

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

Morgan Kaufmann Publishers

References Books:

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

2. Chuck Ballard, Dirk Herreman, Don Schau, Rhonda Bell, Data Modeling

Techniques for Data Warehousing, IBM Redbook

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

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

4. R. Kimball, Data warehouse Toolkits series, Wiley




SUBJECT

CODE


CA 9109 OBJECT ORIENTED

SOFTWARE ENGINEERING

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 9110 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 9111 COMPILER CONTRUCTIONS

Classification of grammars. Context free grammars. Deterministic finite state automata

(DFA), Non-DFA.

Scanners. Top down parsing, LL grammars. Bottom up parsing. Polish expressions

operator precedence grammar. IR grammar. Comparison of parsing methods. Error

handling.

Symbolic table handling techniques. Organization for non-block and block structured

languages.

Runtime storage administration. Static and dynamic allocation. Intermediate forms of

source program. Polish N-tuple and syntax trees. Semantic analysis and coding generation.

Code optimization. Folding, redundant sub-expression evaluation. Optimization within

iterative loops.


Compilers—Principles,

Techniques & Tools

Aho, Sethi & Ullman Addison Wesley

Compiler Design in C Holub PHI

Compiler Construction Dhamdhere McMillan India




SUBJECT

CODE


CA 9112 ADVANCED MULTIMEDIA

SYSTEMS

Introduction, Nature of Multimedia Data, Multimedia Peripherals & Devices, Storage of

Multimedia Data, Different Data Compression Techniques, A Temporal Model for

Interactive Multimedia, Multimedia Databases, Clustering for Multimedia Object Storage,

Clustering Algorithms, Querying and Content Retrieval in Multimedia Databases,

Distributed Multimedia Systems.

References Books: 1. J. Keyes: Multimedia Handbook, MH.

2. G. Blair, L. Blair, A. Chetwynd, H. Bowman: Formal Specification of Distributed

Multimedia Systems, UCL Press, London.

3. S. Khoshafian, A. Brad Baker: Multimedia and Imaging Databases, Morgan Kaufmann.

SUBJECT

CODE


CA 9113 INFORMATION SECURITY

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

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

and availability

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

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

string)

Formalisms: Access control theory, access control matrix, Information flow

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

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

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




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

Network Intrusion detection and prevention systems, Firewalls

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

integrity

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

Cross Site Scripting, Cross Site Request Forgery, SQL Injection

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

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

References

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 9114 MOBILE COMPUTING

Introduction, issues in mobile computing, overview of wireless telephony: cellular

concept, GSM: air- interface, channel structure, location management: HLR-VLR,

hierarchical, handoffs, channel allocation in cellular systems, CDMA, GPRS.

Wireless Networking, Wireless LAN Overview: MAC issues, IEEE 802.11, Blue Tooth,

Wireless multiple access protocols, TCP over wireless, Wireless applications, data

broadcasting, Mobile IP, WAP: Architecture, protocol stack, application environment,

applications.

Data management issues, data replication for mobile computers, adaptive clustering for

mobile wireless networks, File system, Disconnected operations.

Mobile Agents computing, security and fault tolerance, transaction processing in mobile

computing environment.

Ad Hoc networks, localization, MAC issues, Routing protocols, global state routing

(GSR), Destination sequenced distance vector routing (DSDV), Dynamic source routing

(DSR), Ad Hoc on demand distance vector routing (AODV), Temporary ordered routing

algorithm (TORA), QoS in Ad Hoc Networks, applications.

TCP over Wireless Networks – Indirect TCP – Snooping TCP – Mobile TCP – Fast

Retransmit / Fast Recovery – Transmission/Timeout Freezing-Selective Retransmission –

Transaction Oriented TCP




Delay Tolerant Network – Concept – Applications, DTN routing algorithms, Mac Layer

Issues.

Wireless Mesh Network – Concept, Routing algorithms.

Books:

1. J. Schiller, Mobile Communications, Addison Wesley.

2. A. Mehrotra , GSM System Engineering.

3. M. V. D. Heijden, M. Taylor, Understanding WAP, Artech House.

4. Charles Perkins, Mobile IP, Addison Wesley.

5. Charles Perkins, Ad hoc Networks, Addison Wesley

SUBJECT

CODE


CA 9115 GRAPH THEORY AND

APPLICATIONS

Basic Properties of Graphs: What Graphs are- Degree, Regularity and Isomorphism-

SubGraphs

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

& Bipartite Graphs

Eulerian and Hamiltonian Graphs: Eulerian Graphs, Hamiltonian Graphs.

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

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

Problem

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

Proof.

Simple Graph- Havel and Hakimi's Theorem.

MaxFlow-Ford-Fulkerson method

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

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 9116 VLSI

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.

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.

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.

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.

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

curriculum for the batch admitted in 2013 14 · pdf fileca1103 switching theory & logic...

Documents