You are on page 1of 57

TEACHING SCHEME

&
SYLLABI
for

Bachelor of Technology
(Computer Science & Engineering)
July, 2011 Onwards

National Institute of Technology, Hamirpur
Himachal Pradesh-177005 [INDIA]
www.nith.ac.in

1st Year
1st Semester
SN Course
No
1
MA-111
2
CH-101
3
MS-101
4
EC-101
5
CE-101
6
AR-101
Practicals
7
CH-101(P)
8
MS-101(P)
9
10

EC-101(P)
WS-102

2nd Semester
SN Course
No
1
MA-121
2
PH-101
3
CS-101
4
5

HS-101
ME-101

6
EE-101
Practicals
7
PH-101(P)
8
CS-101(P)
9
10
11

HS-101(P)
EE-101(P)
WS-101

Subject

L T

P

Hours Credits

Engineering Mathematics-I
Engineering Chemistry
Material Science and Engineering
Basic Electronics Engineering
Environmental Science and Disaster
Management
Engineering Drawing

3
3
3
3
3

1
1
1
1
1

0
0
0
0
0

4
4
4
4
4

4
4
4
4
4

1

0

3

4

3

3
2

3
2

2
1

Engineering Chemistry Lab
Material Science and Engineering
Lab
Basic Electronics Engineering Lab
Workshop-II

0
0

0
0

0
1

0
0

Subject

L T

P

Hours Credits

Engineering Mathematics-II
Engineering Physics
Computer Fundamentals &
Programming
Communication Skills
Engineering Mechanics & Strength
of Materials
Basic Electrical Engineering

3
3
3

1
1
1

0
0
0

4
4
4

4
4
4

2
3

1
1

0
0

3
4

3
4

3

1

0

4

4

Engineering Physics Lab
Computer Fundamentals &
Programming Lab
Communication Skills Lab
Basic Electrical Engineering Lab
Workshop-I

0
0

0
0

2
2

2
2

1
1

0
0
1

0
0
0

2
2
4
35

1
1
3
30

2 2
3 4
Total 35

2
2
3
Total

1
3
30

2nd Year
3rd Semester
SN Course
No
1.
MA-215
2
CS-211
3
CS-212
4
CS-213
5
CS-214
6
EC-212
7
HS-203
Practicals
8
CS-212(P)
9
CS-214(P)
10 EC-212(P)

Subject

L T

P

Hours Credits

Probability& Queuing Models
Discrete Structure
Data Structure
Computer Graphics
Microprocessor and Interfacing
Digital Electronics & Logic Design
Professional Ethics and Human
Values

3
3
3
3
3
3
1

1
1
1
1
1
1
0

0
0
0
0
0
0
0

4
4
4
4
4
4
1

4
4
4
4
4
4
1

Data Structure Lab
Microprocessor and Interfacing Lab
Digital Electronics & Logic Design
Lab

0
0
0

0
0
0

2
2
2

2
2
2

1
1
1

Total 31

28

th

4 Semester
SN Course
No
1
CS-221
2
CS-222
3
CS-223
4
CS-224
5
CS-225
6
HS-201
7
ECA-201
Practicals
9
CS-221(P)
10 CS-222(P)
11 CS-223(P)

Subject

L T

P

Hours Credits

Computer Organization
Operating System
Object Oriented Paradigm
System Software
Theory of Computation
Managerial Economics
Extra Curricular Activity

3
3
3
3
3
3
0

1
1
1
1
1
1
0

0
0
0
0
0
0
2

4
4
4
4
4
4
2

4
4
4
4
4
4
1

Computer Organization Lab
Operating System Lab
Object Oriented Paradigm Lab

0
0
0

0
0
0

2
2
2
32

1
1
1
28

2
2
2
Total

3rd Year
5th Semester
SN Course
No
1
2
CS-311
3
CS-312
4
CS-313
5
CS-314
6
EC-316
Practicals
7
CS-313(P)
8
CS-314(P)
6th Semester
SN Course
No
1
2
CS-321
3
CS-322
4
CS-323
5
CS-324
6
HS-301
Practicals
7
CS-321(P)
8
CS-326(P)

Subject

L T

P

Hours Credits

Open Elective-I
Modeling and Simulation
Analysis & Design of Algorithms
Data Base Management Systems
Unix Programming
Communication Engineering

3
3
3
3
3
3

0
1
1
1
1
1

0
0
0
0
0
0

3
4
4
4
4
4

Data Base Management Systems Lab
Unix Programming Lab

0
0

0
0

Subject

L T

P

Hours Credits

Open Elective-II
Computer Networks
Software Engineering
Department Elective-I
Department Elective -II
Principles of Management

3
3
3
3
3
3

0
1
1
0
0
1

0
0
0
0
0
0

3
4
4
3
3
4

Computer Networks Lab
Software Lab–I

0
0

0
0

2 2
2 2
Total 27

2 2
2 2
Total 25

3
4
4
4
4
4
1
1
25

3
4
4
3
3
4
1
1
23

Final Year
7th Semester
SN Course
No
1
CS-411
2
CS-412
3
CS-413
4
CS-414
5
CS-415
Practicals
6
CS-496
7
CS-497
8
CS-498
9
CS-411(P)
10 CS-412(P)
8th Semester
SN Course
No
1
CS-421
2
CS-422
3
CS-423
4
CS-424
Practicals
5
CS-499
6
CS-421(P)
7

CS-425(P)

Subject

L T

P

Hours Credits

Information Security
Compiler Design
Advanced Computer Architecture
Departmental Elective-III
Departmental Elective-IV

3
3
3
3
3

1
1
1
0
0

0
0
0
0
0

4
4
4
3
3

4
4
4
3
3

Industrial Training Viva
Seminar
Major Project-I
Information Security Lab
Compiler Design Lab

0
0
0
0
0

0
0
0
0
0

0
3
6
2
2
31

2
2
3
1
1
27

Subject

L T

P

Hours Credits

Data Ware Housing and Data Mining
Mobile Computing
Departmental Elective-V
Departmental Elective-VI

3
3
3
3

1
1
0
0

0
0
0
0

4
4
3
3

4
4
3
3

Major Project-II
Data Ware Housing and Data Mining
Lab
Software Lab-II

0
0

0
0

6
2

6
2

3
1

0

0

0
3
6
2
2
Total

2 2
Total 24

1
19

. and M. 1 CS-426* Computer Architecture and Organization * Course Offered to ECE Department 3 0 0 3 3 ..Tech.Tech.. any other core/elective floated for M. Computer Science & Engineering. Mobile Computing may also be floated as elective for B.OPEN ELECTIVES CS-310 (Open Electives-I) (Offered to other departments) CS-310(a) CS-310(b) Discrete Event System Simulation Relational Database Management System L 3 3 T 0 0 P 0 0 H 3 3 C 3 3 L 3 T 0 P 0 H 3 C 3 3 0 0 3 3 CS-320 (Open Electives-II) (Offered to other departments) CS-320(a) CS-320(b) Operating System and Unix Fundamentals Computer Graphics and Animation DEPARTMENT ELECTIVES CS-323 Department Elective-I CS-323(a) Web Technologies CS-323(b) Digital Arithmetic CS-323(c) CAD of Digital Systems CS-323(d) Artificial Intelligence CS-324 Department Elective-II CS-324(a) Management Information System CS-324(b) Advanced Microprocessors CS-324(c) Digital Image Processing CS-324(d) Parallel Algorithms CS-414 Department Elective-III CS-414(a) Information Retrieval CS-414(b) Distributed Databases CS-414(c) Advances in Algorithms CS-414(d) Programming Language Security CS-415 Department Elective-IV CS-415(a) Distributed Systems CS-415(b) Agent Based Systems CS-415(c) Web Based Application Security CS-415(d) Quantum Computing CS-423 Department Elective-V CS-423(a) Client Server Computing CS-423(b) Reconfigurable Computing CS-423(c) System and Network Administration CS-423(d) Software Quality Assurance CS-424 Department Elective-VI CS-424(a) Formal Verification CS-424(b) E-Commerce CS-424(c) Storage Technologies CS-424(d) Security Protocol Analysis L 3 3 3 3 T 0 0 0 0 P 0 0 0 0 H 3 3 3 3 C 3 3 3 3 3 3 3 3 0 0 0 0 0 0 0 0 3 3 3 3 3 3 3 3 3 3 3 3 0 0 0 0 0 0 0 0 3 3 3 3 3 3 3 3 3 3 3 3 0 0 0 0 0 0 0 0 3 3 3 3 3 3 3 3 3 3 3 3 0 0 0 0 0 0 0 0 3 3 3 3 3 3 3 3 3 3 3 3 0 0 0 0 0 0 0 0 3 3 3 3 3 3 3 3 In addition to these electives.Tech. Computer Science & Engineering.

P. control structures. library files. 4. algorithm. BPB Publication Byron Gottfried. expression. processing data. parameter passing. ‘C’ files. TMH Yashwant Kanetkar. Programming Techniques Steps in program development. literals. storage classes. arrays: declaration. evolution and classification of programming languages. Jaico Books. Cooper. hardware maintenance. scope rules and visibility. Herbert Schildt. loading process and executable code. 6. Herbert L. mixed mode arithmetic’s. “The complete Reference C”. dynamic storage allocation. interpreter. recursion. number system and binary arithmetic. Prentice Hall of India. translation of source code into object code. 2. “Computer fundamentals”. structures and unions. “C Programming language”.L 3 T 1 P 0 C 4 CS-101 COMPUTER FUNDAMENTALS AND PROGRAMMING Programming fundamentals Introduction to computer. macros and conditional compiler directives. ‘C’ pre-processors and command line arguments. “Let us C”. software. hardware. identifiers. object file. Text and Reference Books 1. keywords. self referential structures. . pointers. Briain W. “Programming with C”. translators-assembler. Kenigham and Dennis Ritchie. function for file handling. Assembly level language. block diagram and organization of computer. testing and debugging. flowchart. ‘C’ as Structured programming language ‘C’ character set. labels. formatted input output statements. software maintenance. BPB Publication Henrry Mulish. pseudo code. linking. source file. library functions. Tata McGraw Hill. data types and size. initialization and usage. variable declaration. ‘C’ functions. 5. statements. types of operators. types of programming languageMachine language.K. 3. data type conversion. higher level language. compiler. “The Spirit of C: An Introduction to Modern Programming”. firmware.Sinha.

Warshall’s algorithm: shortest path. set operations. Lattice. et al. properties of a relation. factors of a graph and planar graphs. Edward. cosets and Langranges's theorem. Rosen. Roman. Addison Wesley Dossey. Kenneth h. NY. power set. integral domains. Discrete Mathematics. laws of equivalence. traversing binary tree. An Introduction to Discrete Mathematics.L. normal forms. “Discrete Mathematics”. Relations and ordering. methods of proof for sets. . Types of relations. Binary Trees Introduction. C.propositions. fields. Functions: definitions and notation. 8. “Elements of Discrete Mathematics”. Steven. Cengage. walk path and circuits. McGraw Hill. tautologies and contradiction.Hills. Graph colorings. generators and evaluation of powers.examples and standard results. Graph Theory Basic concepts of graph theory. propositions generated by a set of recurrence relations – partial and total recursion . Schaum’s outlines. one to one. binary search tree. rings. rules of substitution and transitivity. Eulerian paths and circuits. Mathematics: A Discrete Introduction. 5. Text and Reference Books 1. multigraphs and weighted graphs. Monoid. Semi group. Steven. McGraw/Hill Barnett. Liu. Discrete Mathematics and Its Applications. 7. 4. Logic and Recursion Propositional calculus . Basics of Structures Mathematical induction. J. Group and Sub group . Heaps. P. “Discrete Mathematical structures with applications to Computer Science”. disjunction and conjunction. Tata McGraw. Graph and matrix of a relation. Scheinerman. Discrete Mathematics. identity and inverse. one to one and onto. related results. logical operators.L 3 T 1 P C 0 4 CS-211 DISCRETE STRUCTURE Introduction to Preliminaries and Predicate Calculus Basic concepts of discrete mathematics and related problems. Semyour Lipscdutz. 3. onto. Set Theory and Functions Basic concepts. Saunders. complete and extended binary tree. Hamiltonian paths and circuits. Addison-Wesley. truth tables. . Huffman’s algorithm. Tremblay and R Manohar. John A.Venn Diagrams. propositions and predicates. Marc Lipson.problems. 6. McGraw Hill. Algebraic structures properties. 2. composition.

G. J. Text and Reference Books 1. asymptotic complexity. Circularly Linked Lists. obtaining the complexity of an algorithm. “ Data Structures and Algorithms”. complexity. the all-pair shortest path problem. preorder and postorder traversal. Development of Algorithms Notations and Analysis.Sahni. Doubly Linked Lists. Address calculation. “Data structures. implementations and applications. Sorenson. Aho . “An Introduction to Data Structures with applications”. Pearson Education Richard F. dynamic storage management – Garbage collection and compaction. the running time and storage cost of algorithms. minimum cost spanning tress. big O notation. Y. M. Tremblay and P. the running time of a program. Operations on Binary Trees .Expression Manipulations . Linked stacks and queues. abstract data types. Forouzan. deletion and traversal. graph matching. Graphs Basic definitions.L 3 T 1 P 0 C 4 CS-212 DATA STRUCTURE Introduction Data types. articulation points and biconnected components. Behrouz A. Thomson Brooks / COLE . 4. J. Binary Trees. “Data Structures using C”. Radix sort and Bucket sort. 5.Ullman and Hopcroft. Quick sort. Storage structures for arrays . Sorting and Searching Techniques Bubble sorting. “Data Structures – A Pseudocode Approach with C”. 3. Sequential searching. directed acyclic graphs. representations of directed and undirected graphs. Merge sort.Insertion. Tenenbaum. Linked Lists Singly linked lists. B+ -trees. Tata McGraw Hill. Augenstein and A.P. Hash table methods. Insertion sort. Trees Basic terminology. Binary Searching. strong components.Symbol Table construction. Index searching. WCB/McGraw Hill. General Trees. Heap and Heap sort.sparse matrices . Langsam. Tree Traversing: inorder. M. operations on Polynomials. Height Balanced Trees(AVL). Gilberg. Selection sort. Operations on linked lists. Shell sort. the single-source shortest path problem. 2. B-trees. data structures.structures and arrays of structures. traversals of directed and undirected graphs. Stacks and Queues: Representations. S. Algorithms ad Applications in C++”. building a binary search tree.

Clipping Operations.Generation of the display. Line Clipping. Rogers. Polygon Surfaces. 2. Display Processors. “Computer Graphics”. Scan Conversion. Character Generation. Rogers. Circle Generation. Display Devices. 3. General Function Rasterization. Three. Two-Dimensional Geometric Transformation & Viewing Basic Transformation. B-Spline Curves and surfaces. Text and Reference Books 1. Output Primitives. PHI. Graphics hardware Display technology. area coherence algorithms.Dimensional Concepts & Object Representations Three Dimensional Display Methods.L 3 T 1 P 0 C 4 CS-213 COMPUTER GRAPHICS Introduction to Computer Graphics Overview of Graphics Systems. D. Hidden line and hidden surface removal: depth buffer algorithm.A programming approach”. “Mathematical Elements for Computer Graphics”. Interactive Input Devices. Rendering A simple illumination model. Harrington. Scaling. Z-Buffer Transparency. Line drawing algorithms. Image Compression. Composite Transformation.F. “Computer Graphics . Modeling methods. Shadows. geometric computations. McGraw Hill. Transparency. 4. input devices for interaction. Fundamentals of Antialiasing. Point Clipping. Transformation functions. Rotation. Translation. S. Three dimensional Transformation function. priority algorithm. Hard copy Devices. random scan. scan line coherence algorithms. Scaling. raster scan display processing. Refraction effects in transparent materials. Texture. Polygon Filling . Other Transformation Reflection. Visible Lines and Visible Surfaces Visual Realism. “Procedural Elements for Computer Graphics”. Translation. D. Bezier Curves and surfaces. Window to viewport co-ordinate transformation. Hearn and Baker. Circle Generation algorithms. McGraw Hill. Simple Transparency Models. Rotation. shading and color models. Shear. Perspective Projection. Parallel Projection. Raster Scan Graphics Line Drawing Algorithms. McGraw Hill. . The Graphical Kernel System. Curved Lines and surfaces. Polygon Clipping.F.

Interrupt handling in 8085. cycle stealing and burst mode of DMA.P. minimum mode maximum mode. Addressing modes. Serial I/O. Programmed data transfer.. Parallel data transfer using 8155.segment registers and memory segmentation. B. interfacing static RAMs. 8085 Microprocessor. Interrupts in 8085. D. Interfacing a keyboard. Text and Reference Books 1. Control section. Interfacing A/D converters. Addressing memory. disabling and masking of interrupts. Dhanpat Rai and Sons. Data Transfer techniques Data transfer techniques. .Mathur.Wiley Eastern Ltd. SOD. R. Daisy chaining. 8257 DMA controller. system timing. 4. Instruction cycle. T states. Tata McGraw Hill. interfacing a printer. Enabling. “Introduction to Microprocessor”. Architecture Programming & Design”. “ Microprocessors & Interfacing”. Generating memory addresses. Bus Organization. YU-Cheng Liu & Glenn A Gibson. Interfacing LED and seven segment displays. RST instructions. Programming and applications with the 8085/8080A”. Gaonkar.L 3 T 1 P 0 C 4 CS-214 MICROPROCESSOR AND INTERFACING Introduction to Microprocessor History and Evolution. Programmable parallel ports and handshake input/output. ALU. Programmable interrupt controller 8259A. D/A converters. Timing diagram for different machine cycles. Microinstructions. Macros. Microprocessor Interfacing Techniques Interfacing memory and I/O devices. 2. Machine cycles. DMA transfer. 3. “Microprocessor System. McGraw-Hill 5.Ram. State transition diagrams. Architecture of 8086 Memory Address space and data organization. Multiple interrupts and priorities. Issues in implementing interrupts.V. Labels and Directives. Instruction set of 8085.Hall. Registers.S. A. Architecture. “Fundamentals of microprocessors and microcomputers”. IO address space. “Microprocessor Architecture. McGraw Hill 6. Assembly Language Programming and Timing Diagram Assembly language programming in 8085. Asynchronous and Synchronous data transfer using 8251A. types of microprocessors. Comparison of 8086 and 8088. Types of Instructions. addressing modes. Brief comparison of contemporary 8-bit microprocessors like Z80. Instruction format. introduction to Pentium and further series of microprocessors. Interfacing and refreshing dynamic RAMs. Microprocessor timings. M68000 with 8085. “Microprocessors and Digital Systems”. Interrupts and Comparison of Contemporary Microprocessors Serial I/O using SID. Douglas V Hall.

Stack-Memory. Hennessy. Caches. Introduction to Parallelism Goals of parallelism. Instruction Set Architecture (Instruction set based classification of processor i. Decode. Multiplication Algorithms (Booth’s Multiplication Algorithm). Stack organization. PHI David A. L. Microprogrammed. State table method. Computer Arithmetic Addition & Subtraction. “Computer Organisation and Architecture. Detailed data path of a typical register based CPU. CPU Architecture types. Instruction level parallelism. Control Design Microprogrammed & Hard-wired control options. “Computer architecture & Organization”. M. Synchronous & synchronous data transfer. Hard-wired design methods. RISC. control Memory. Division Algorithm. 4. RISC vs CISC Comparison). Data transfer.e. cost per unit. Text and Reference Books 1. Addressing Modes. The need for Memory Hierarchy. 3. Fetch. superscaling. Structure organization (CPU. Hayes. Main memory. Control flow). MISD. cache. Operation instruction set (Arithmetic & logical. Patterson & John. Micro-operation. Basic concepts. Multiprocessor system overview. Designing for Performance”. Morris Mano. access cycle time. pipelining. William Stallings. Multiplier control. Accumulator BasedRegister. Instruction set format. Register Transfer Operation. Memory Hierarchy. Processor level parallelism. Flynn’s Classification of computers (SIMD. CISC. CPU control unit. Processor Design Arithmetic & logic unit. main & secondary. and Execute Cycle. Memory parameters. Floating point arithmetic operations.L 3 T 1 P 0 C 4 CS-221 COMPUTER ORGANIZATION General System Architecture Stored Program control concept (Von-Newman architecture principle). locality of reference principle. “Computer Architecture:A quantitative Approach”. Pearson Education Asia.P. 2. I/O Organization & Memory Hierarchy Programmed. Secondary memory unit & I/O). Interrupt driven & Direct Memory Access. “Computer system architecture”. Register.McGraw Hill. MIMD). Address Sequencing. Morgan Kaufmann . J.

Virtual Memory. Security and Design Principles Network operating system. “Operating systems”. precedence graphs. Monitors. password protection. security kernels. operational security. operating system services for process management. layered approach. Peterson and A. Irwin Publishing 4. Allocation strategy module. General model of a file system. 2. Prevention. hardware security. Messages. multiple processor scheduling. page replacement. segmentation. PHI . paging. real time scheduling. “An Introduction to Operating System”. W. J. Detection and Recovery. Combined approach to Deadlock Handling. “Modern Operating system”. Non-contiguous allocation. Addison Wesley. scheduling algorithms. Harvey M. Symbolic file system. The process concept. Silberchatz. Concurrent languages. Physical file system. Access control verification. static-swapping. Types of operating systems. “Operating Systems .L. 5. Contiguous allocation. Dietel. Disk scheduling. 3. “Operating System Concepts”. Tanenbaum. A. Interprocess communication. Logical file system. distributed operating system. dynamic partitioned memory allocation. Networks. overlays. Addison Wesley. Synchronization. CPU Scheduling Scheduling concepts. Semaphores. Avoidance. access control. File systems A Simple file system. Prentice Hall. Modularization. C.L 3 T 1 P 0 C 4 CS-222 OPERATING SYSTEM Evolution of operating systems Evolution of operating systems. I/O initiators. design principle. Memory management Memory Management. demand paging. Concurrent programming and Deadlocks Critical regions. Conditional critical regions. external security. Hardware support. system programmer's view of processes. Pipes. Device strategy module. Text and Reference Books 1. operating system's views of processes.A Design Oriented Approach”. algorithm evaluation.S. Deadlocks: Characterization. Stallings. Device handlers. Crowley.

Vectors. handling exception. Design example. Multiple Inheritance. Dynamic memory allocation. TMH. Overview of Standard Template Library. Text and Reference Books 1. Generic programming with templates. 3. hierarchical inheritance. Arrays. Addison Wesley. General Theory of Operation. Basic concepts of OOP’s. Bjarne Strustrup. Pointers and Functions Arrays. Inline functions. Iterators. Classes and Objects Data types. single Inheritance. Algorithms. Global variables. Multi level inheritance. Standard Template Library Standard Template Library. Graphics mode functions. Balagurusamy. Addison Wesley. arrays. string class. Containers. Function Overloading Polymorphism. expressions. and Lines. Text in Graphics Mode. . Multi-Dimensional Arrays. destructors. ‘Object Oriented programming with C++”. Random Access. Queue class. operator overloading.CS-223 OBJECT ORIENTED PARADIGM L 3 T 1 P 0 C 4 Concepts of Object-Oriented Programming Oriented Programming Paradigm. Arguments. Functions. Array class. Design steps. constructors. Streams and Files Opening and closing a file. Introduction to object oriented design and development. Arrays of pointers. Booch. Passing pointers as function arguments. Other STL Elements. Scope. Virtual functions. strings. Object oriented languages. Storage classes Fixed vs Automatic declaration. “Object Oriented Programming in Turbo C++”. Benefits of OOPS. Chair H. Friend functions. “Object Oriented Analysis and Design with Applications. Robert Lafore. Initializing Arrays. Sequential Input and output operations. Comparison of structured and object-oriented programming languages. Storage of arrays in memory. 4. catching exception. Container Classes. Text Mode. Pappas & William H. operators. Date class. Pointers. List class. hybrid inheritance. Tata McGraw Hill. Classes and objects. control structures. type conversion. Pointers to pointers. Sound & Motion. accessing array elements through pointers. multi-file programs. Generic Class. “The Complete Reference Visual C++”.5. User defined class. Inheritance Inheritance. “The C++ programming Language”. File pointers and their manipulations. Exception Handling and Graphics List of exceptions. access specifiers. register specifier. Murray. Rectangles. Galgotia Publications. 2. command line argument. Polygons & Inheritance.

Absolute Loaders. Command to Loader. Addison Wesley. Keyboard Management. Positional Parameters and Keyword parameters. Structure Editor. Machine Languages. Relocatable Program. Loader options. Machine and Assembly language Programming Interface. case studies. Transcription and Image Buffer process per Window. 4. Assembler Machine Structure. Macro Definition Language: Macro generation.CS-224 SYSTEM SOFTWARE L 3 T 1 P 0 C 4 System Software Distinction between system software and application software. Macro Calls within Macros and its implementation. Text and Reference Books 1. Control section and program linking. Elements of Assembly language Programming. Screen Editor. John J. Word Processor. Programming Environment. H/W Independent features of System Software. Text or Graphics. Macro Instructions Defining Macros. Donovan. 80386 & 80486. Overlayed or Tiled. Intel Users manual for 8086. Machine Independent features: Automatic Library Search. Screen Management. Loaders Object Code. Expressions. M. Components of System Software. Virus Detection and Control System. Black. Multi Tasking Window System. Device Driver Programming Virus Classification of Virus. Algorithm. One-Pass Macro Processor. Program Block. Machine Independent features: Instructions. Self-Relocating Programs. Machine dependent Features: Location. TMH. Machine Dependent features: Literals. Machine Language and Microprocessor Defining and Usage of Macro Expression. Linking Schemes. DOS functions. “System Programming”. 3. Editor Structure. System Software Tools Elements of System software Tools. Linking. Debug Monitor. “System Software-An Introduction to System Programming”. General features of a System Software. Loader Schemes: Compile and go Loaders. Design of Two-Pass Assembler. design of BSS Loader. Evolution of System Software. Text Editor: Line and Stream Editor. Layered Organization of System Software. Algorithm for Relocating loader Using Relocatable Location table. “System Software and Operating System”. Overview of Compilers and Interpreters. Window or Display management. Algorithms for Relocating Loaders Using Relocation bit. Conditional Macro expansion. Program location. Leland L. . Pentium & Pentium pro. Relocatability: NonRelocating Program. A Single-Pass Assembler. Overlay program. TMH 2. Dhamdhere. Function to be performed by Object Code. D. Data Structures Format of Databases. Virus in other environment. Symbol defining statements.

Computability Basic concepts. Relation among complexity measures. binary operations on languages. composite & iterated TM. Krishnamurthy.L. John E. Transition graph. . Regular sets. Jeffery Ullman. linear speed-up. Automatic complexity theorem. Transition lemmas & non deterministic hierarchies. context free & context sensitive grammars. Finite automata and regular expression. Decidability. Hierarchy Theorem. context free languages. 2. primitive & partial recursive function. closure properties of regular sets. Undecidibility Properties of recursive & recursively enumerable languages. Deterministic and nondeterministic FSM’S. Regular Sets and Regular Grammars Alphabet. Application of pumping lemma. Ltd. Mishra. representation and languages acceptability of TM Design of TM. Universal Turing machine and undecidable problem. Acceptance by PDA.P. Kleen’s theorem. Pumping lemma and regular sets. East West Press K. speed-up. Regular grammars. Computational Complexity Theory Definition. Chomskey normal forms. non-context free languages. E. Chomsky hierarchy. Two-way finite automata. Narosa Publishers. 3. Universal TM & Other modification. Turing Machines & Pushdown Automata TM model. Mealy & Moore machines. the gap. Transition matrix. Rice’s theorem & some more undecidable problems. Hopcroft. FSM . tape compression & reduction in number of tapes. Formal Grammars & Languages Basic definitions and examples of languages. Prentice Hall of India Pvt. properties of general complexity measures. words. Text and Reference Books 1.L 3 T 1 P 0 C 4 CS-225 THEORY OF COMPUTATION Machines Basic machine.V. minimization of finite automata. “Introductory Theory of Computer science”. “Theory of computer Science”. Langauges & computation”. Pushdown automata. union theorem. Recursive function. Operations. Equivalence of DFA and NDFA. “Introduction to Automata theory.

organization of a SIMSCRIPT program. J. Trends in simulation Software. “Simulation Model Design and Execution”. continuous uniformly distributed random numbers. tasks. disconnect event. service times. modeling policies. defining the system. Congestion in systems. “Discrete-Event System Simulation”.L 3 T 1 P 0 C 4 CS-311 MODELING AND SIMULATION Fundamentals Definition and reasons for simulation. Introduction to a Simulation Languages Simulation in C++. queuing disciplines. representation of time. Formulating systems as events and entities (such as resources. names. algorithms for generating random numbers. measuring utilization and occupancy. Discrete Event System Simulation Discrete events. Measures for Queues. events. Dunning “Getting Started in GPSS”. arrival patterns. CA. resource seizing. “Simulation Modeling and Analysis”. closing event. 3. Prentice-Hall. Text and Reference Books 1. simulating components of an operating system. timing routine. Continuous (time-oriented) and discrete (event) systems. GPSS. . Poisson arrivals. the exponential distribution. their comparison with respect to speed and validity. K. Building Simulation Programming Models Arrival patterns. queues and servers. and linkages). Utilization as a Design Factor. departures simulation of a telephone system and computer networks. SIMSCRIPT system concepts. arrival event. 2. gathering statistics. blocks. the coefficient of variation. discrete vs continuous probability. SIMSCRIPT statements. and queue formation. J. interpreting outputs and system optimization via modification. delayed calls. P. execution. entities. Banks. Carson and B. priority queues. normal distribution. defining the system model. counters and summary statistics. methods for generating non-uniform distributions. SIMSCRIPT programs.A. the procedural structures. Analytic Solutions of Queuing Problems. referencing variables. Other factors like grade of service. and labels. service times. Prentice-Hall. queues. Concepts in Simulation Stochastic variables. Fishwick. debugging and validation. and activities. San Jose. Rates and system dynamics. generation of arrival patterns. Law and Kelton. Engineering Press. gates. Nelson. Modeling/programming simple deterministic systems. recording distributions and transit times. 4. Simulations Packages. McGraw-Hill.

Ullman. Graph Algorithms Representation of graphs. Hopcroft and J. Matrix chain multiplication. Sahni. R.Cormen. Dijkstra’s algorithm. Hamiltonian cycles. Backtracking 8-Queen Problem. J.V.motivation. DFS. Polynomial Vs nonpolynomial time complexity. Merge sort.Rivest. Huffman codes. BFS. A. single source shortest paths: Bellmen-Ford algorithm. concept of algorithmic efficiency.E. difference between dynamic programming and divide and conquer.H. Branch and bound LC searching Bounding. “Introduction to Algorithms”.Leiserson. Traveling Salesman Problem. Heap and heap sort. 3. quick sort. Addison Wesley.L. Galgotia. Greedy Algorithms Optimal storage on tapes. “The Design and Analysis of Computer Algorithms”. graph coloring. Asymptotic Notations. Knapsack problem. Traveling salesman Problem. Job sequencing with deadlines. strongly connected components. Finding the maximum an minimum. 0/1 knapsack. “Fundamentals of Computer Algorithms”. Minimum Spanning trees: Prim’s algorithm & Kruskal’s algorithm. Sum of subsets.L 3 T 1 P 0 C 4 CS-312 ANALYSIS & DESIGN OF ALGORITHMS Algorithms Introduction Algorithm Design paradigms. 2. Computational Complexity Complexity measures.D. Dynamic programming Overview. examples. . E. C. run time analysis of algorithms.Cambridge. longest Common sequence. FIFO branch and bound. Horowitz and S. Topological sort. NP-hard and NPcomplete classes. Aho. All pairs shortest path: The Warshall’s algorithm. Quick Sort.T.E. MIT Press. LC branch and bound application: 0/1 Knapsack problem. Text and Reference Books 1. Divide and Conquer approach Structure of divide-and-conquer algorithms: sets and disjoint sets: Union and Find algorithms.

Elmsari and Navathe. Hector Garcia–Molina. C. Korth and S. specifying constraints and indexes in SQL. Distributed data Storage .Need for Concurrency control. OO data Model. Real-Time Databases. date models.L 3 T 1 P 0 C 4 CS-313 DATA BASE MANAGEMENT SYSTEM Basic Concepts Introduction to File and Database systems.XML Document.Queries in SQL-relational model concepts. 4. Text and Reference Books 1. Data Model. Index Structure for files.Homogenous and Heterogeneous. Database Security. Recovery Techniques.Immediate Update. Sudarshan. “An introduction to database concepts”. J. Concurrency Control. schemas & instances. Query Processing.Ullman and Jennifer Widom. Active Databases. Time stamp based concurrency control . B. 6.Need for Complex Data types. Data. Schema. Two Phases locking. Transaction Management. Relational Model – Relational Algebra and Calculus. Multi-databases. “Principals of database systems”. Relational Database design.“Database System Implementation”. McGraw-Hill Ramez Elmasri and Shamkant B. Integrity and Security. Addison Wesley. Current Trends Object Oriented Databases . Query Processing. Distributed and parallel databases .Secondary storage Devices.XML. Addison Wesley. Multimedia Databases. Schedule and Recoverability. database languages & interfaces. relational algebra. ER model. Sorted Files.Pearson Education Peter Rob and Corlos Coronel. Navathe. “An introduction to database systems”. Views. Mobile Databases. Types of Locks. Deadlock. Thompson Learning Course Technology . Serializability and Schedules. Pearson Education. Functional dependences and Normalization for Relational Databases. Galgotia publications.“Database System. Nested relations. 7. Database Benchmarks. 2. Concepts. 3. Querying and Transformation. Henry F.Date. 3NF & BCNF). Access Methods.Ullman. lossless join and dependency preserving decomposition Data Storage and query Processing Record storage and Primary file organization. “Fundamentals of database systems”. Abraham Silberschatz.J. Transaction Management Transaction Processing.“Database System Concepts”. normal forms based on primary keys. Desirable properties of Transaction. view and queries in SQL. Galgotia publications. relational model constraints. “Fundamental Database Systems”.Database system structure – concepts and architecture.a relational database language: date definition in SQL. Operations on Files. Heap File. Relational Models SQL – Data definition. 2NF.B+Tree. Deductive Databases. relational database management systemsUpdates. Complex Types. Structure of XML. Temporal Databases.D. (1NF. Implementation and Management”. Introduction to Network and Hierarchical Models. Inheritance Reference Types. Different types of Indexes. DBMS architecture & data independence. Desai. Design. Hashing Techniques. 8. Data Mining and Data Warehousing.BTree . Shadow Paging. SQL.Deferred Update. Jeffrey D. 5.

Shell Programming Bourne Shell. 3. Processes Versus Threads. Keeping Track of Open Files. Overview of Client/Server Programming Designing Distributed Application. Link(). integer arithmetic and string manipulation. Concurrency Issues. Blocking Signals with sigprocmask(). remove(). 4. Additional Synchronization Requirement. Overview of Thread Architectures. / Pearson Education . 5. “The Art of UNIX Programming”. Addison-Wesley. Richard Stevens. W. Interpreter files and exec. The fcntl() function. Data Structures of the Sockets API. File Attributes. The fork () System Function. shell variable and scripts. “UNIX Network Programming”. Connectionless vs. Dynamic Memory Allocation. POSIX. Accessing Environment Variables. “Unix and shell Programming: a Textbook” P W S Publishers Kernighan and Pike. The access() function. The open() and creat() Functions. SystemLevel Functions. decision making. File Table Entries. Process Management Process Creation and Termination. environment. Text and Reference Books 1. Stateless vs. Creating and Initializing Mutexes. Prentice Hall. W. Programs and Processes. Ports and Services. Forouzan. and rename() functions. unlink(). Multitasking. Threads Synchronization The Sharing Problem. Passing Arguments to Threads. System I/O Standard I/O Vs system I/O. PHI. Creating Threads. AT&T and Berkeley UNIX Systems. korn shell and C shell. Blocking Signals from Delivery. Signals and Reentrancy. Process Memory Layout. Scheduling and Waiting for Signals. Mutexes. Joining and Detaching Threads. 2. Using Mutexes. Addison-Wesley. Richard Stevens. Behrouz A. The v-node structure. Current Image and New Image. Signal Actions. Pipes. Socket System Calls. Eric Steven Raymond. The sigaction() function. FIFOs. Real and Effective User IDs. Richard F. Shell metacharacters. Connection-Oriented Servers. File Descriptors. System I/O Calls. Introduction to Threads Processes and Threads. Sending a Signal to Another Process. Clients and Servers. “Advanced Programming in the UNIX Environment”. facilities and command. Using Condition Variables. Files and Directories Basic File Types. The wait () and waitpid() function. Signals Types of Signals. Stateful Servers. Gilberg. Signal Sets and Operations. The Berkeley Sockets API Berkeley Sockets. Socket Utility Functions. Thread Termination. Interprocess Communication. The Exec System Functions.L 3 T 1 P 0 C 4 CS-314 UNIX PROGRAMMING UNIX Standards Brief History of UNIX. The Threads API. arrays and job control. Library vs. Functions to Manipulate Directories. aliasing. Restarting System Calls (SVR4). Parent and Child. File and Record Locking. “Unix programming environment”.

Logical link control. X-25 Networks. Network Layer Network Layer design issue. TCP/IP reference model. 3. UDP. services provided to network layers. Token bus IEEE standard 802. Reference Model: The OSI reference model.Design issues. Collision free protocols. Session. Broadband ISDN and ATM. Narrowband ISDN. Access and Management. Transmission media. A.S. Data compression techniques. Other applications. High speed LAN. Error detection and correction. Example data link protocol-HDLC.5. Internetworking.4.File Transfer. remote procedure call. Simplex Protocol for a noisy channel. “Computer Networking: A Top-Down Approach Featuring the Internet”. Sliding Window protocols. Limited contention protocols. Multiple Access protocols. Elementary data link protocols. Tanenbaum. Carrier Sense multiple access protocols. A protocol using go-back-N. Physical Layer Fourier Analysis. “Data and Computer Communication”. IEEE standard 802. ALOHA. simple transport protocols. IEEE standard 802. bridges. A one-bit Sliding protocol. “Computer Networks”. Presentation Layer . Flow control. Error control. Stallings. Design issues. cryptography. Circuit switching. Transport Layer Transport services. Presentation and Application Layer Session Layer . The Internet.3 and Ethernet. Prentice Hall of India. Distributed Queue Dual bus. An unrestricted Simplex protocol. Connection management. elements of transport protocols. Virtual Terminals. Interfaces and services. MAN. The ARPANET.L 3 T 1 P 0 C 4 CS-321 COMPUTER NETWORKS Introductory Concepts Goals and Applications of Networks. A protocol using selective repeat. W. A Simplex Stop-and-Wait protocol.Design issues.Internet and Public Networks. Ross. . PPP and SLIP. Framing. Protocol specification and verification. Network software: Protocol hierarchies. Token Ring. Static and dynamic allocation in LAN and MAN. design issues of layers. Prentice Hall of India. Maximum data rate of a channel. Electronic mail. Text and Reference Books 1. Wireless protocols. LAN. Wireless transmission. Addison-Wesley. Communication satellite. J. 2. Routing algorithms. WAN. Data Link Layer Data link layer design issues. Congestion Control Algorithms. Medium Access Sublayer Channel Allocations. Application Layer . TCP. Satellite networks. Wireless network. Example networks: Novell Netware. WDMA protocols. Virtual circuits.W. network standards. Kurose and K. Example Networks .

Unified Modeling Language. metrics. “An integrated approach to software engineering”. Narosa Publishing. . Pankaj Jalote. 3. advantages and components of CASE tools. Testing Testing fundamentals. software configuration management plan. Quality attributes. metrics. structured design methodology. design notation and specification. 4. problem analysis. design methodology. Function oriented design Design principles.L 3 T 1 P 0 C 4 CS-322 SOFTWARE ENGINEERING Introduction Problem domain. Object oriented design OO concepts. characteristics of software process. “Software Engineering”. Wiley Dreamtech. software engineering approach. classification of metrics. testing process. Cost estimation models COCOMO. defect analysis and prevention. project monitoring plan. 5. Software Measurements. “Fundamentals of Software Engineering”. functional specification with use cases.Tom Pender “UML Bible”. matrices. Software Requirements analysis and specification Software requirements. Unified Modeling Language (UML) Text and Reference Books 1. SQA. Coding Programming principles and guidelines. Rajib Mall. Pretence Hall of India. component and connector view. Software Architecture Role of software architect. architecture views. metrics. Quality Standards. white-box testing. other processes. CASE Tools Types of CASE tools. project scheduling and staffing. coding process. module level concepts. ISO 9000 and CMM. refactoring. software engineering challenges. discussion and evaluating architectures. requirements specification. Planning a software project Effort estimation. Addison-Wesley. “Software Engineering: A Practitioner’s Approach”. metrics and Models Detailed design and PDL. black-box testing. verification. risk management. verification. Qualities of a good Software metrics. Metrics and their scope. quality assurance plan. validation.reliability estimation. metrics . architecture style for C & C view. design concept. Detailed Design. 2. Pressman Roger R. verification. TMH. Software Processes Software process. Ian Sommerville. software development process models.

Electronic voting protocols. TLS worms and viruses. Text and Reference Books 1. 5. Web security.319 Directory Authentication scheme. Intrusion Detection Systems. Router security. attacks. . Authentication Applications The Message Digest (MD5) Algorithm. Polynomial Arithmetic. “Cryptography: Theory and Practice”. Denial of service and side-channel attacks. The Key Management riddle. their Security and other considerations. Chapman & Hall. Prentice-Hall. Trappe & Washington. Stream Cipher Stream ciphers: The one time pad. Discrete Logarithms. Access control policies. Introduction To Finite Fields Groups. Public-Key Cryptography and Message Authentication The Key Distribution Problem. Rings. The Diffie-Hellman Key Exchange. The Chinese Remainder Theorem. Random Number Generation. Session security. C. RIPEMD-x and HMAC fundamentals. Intrusion detection techniques . Bellovin and W. Perlman and M. Message Authentication Codes. Cryptographic Techniques An overview of Cryptology. Rotor Machines. Triple DES Algorithm. William Stallings. Symmetric Block Cipher Schemes. PGP. requirements and functions.L 3 T 1 P 0 C 4 CS-411 INFORMATION SECURITY Introduction Introduction to OSI Network Security Architectures. Digital signatures. Cryptographic hash functions. “Network Security”. Introduction to the Kerberos Authentication scheme. Contract signing protocols. Spenser. “Cryptography and Network Security: Principles and Practice”. PHI.. Intrusion detection Key Management in Group Communication Systems. Security Protocols Security properties. micro payments. Formal models of protocols and detecting leaks. Modular Arithmetic. The X. Block Cipher -.centralized and distributed. 3. Secure Hash Algorithm (SHA-1). The Digital Signature Standard. Mechanisms and Attacks. Pearson Education. Finite Fields of the Form GF(p). Digital Signature basics. Blowfish Algorithm. differential and Linear Cryptanalysis. “Internet Security and Firewalls”. Classical Encryption Techniques. Reading. 2. and Fields. Linux security. Services.properties and generation. Encryption Function Placement and Confidentiality problems. Systems and Applications Security Authentication. Windows. Chesvick. smart card security. R. Finite Fields of the Form GF(2n). RC-x Algorithms. Introduction to Message Authentication. S. Introduction to DES. Symmetric cipher model. Program security. Kaufman. “Introduction to Cryptography with Coding Theory”. Design of a security protocol. 4. Block Cipher Cryptography. Transposition techniques. Sandboxing. Mail security. File system security. Addison-Wesley. IPSec. International Data Encryption Algorithm (IDEA). Euclid’s Algorithm. Primality test. Web applications security. CAST-x Algorithms. Steganography.. Hash Functions. SSH. Pseudorandom key streams . Examples of security protocols. Public-Key Cryptosystems. Authentication Protocols. D Stinson. The RSA Algorithm. Substitution techniques. SSL. Security of wired / wireless networks. Data (base) security. Perfect security. Memory security. Elliptic Curve Cryptography.

Error detection and recovery Errors. Symbol Tables Contents of a table. code generation from DAG’s. shift-reduce parsing. “Crafting a compiler with C”. problems in code generation. construction LALR sets of items. translation of assignment statements. peephole optimization. 6. “Introduction to Compiler Techniques”. DAG representation of basic blocks. 2. Louden. Bennet. Text and Reference Books 1. Syntax-Directed Translation Syntax directed translation schemes. postfix translation with top down parser. Tata McGraw-Hill Henk Alblas and Albert Nymeyer. “Practice and Principles of Compiler Building with C”. Holub “Compiler Design in C”. Techniques and Tools”. three address code. postfix notation parse trees and syntax trees. LeBlanc. predictive parsing. “Compiler Construction: Principles and Practice”. global data flow analysis. Alfred Aho. J. loop optimization. implementation of syntax directed translation. syntax-phase errors. Prentice Hall of India. Automatic Construction of Efficient Parsers LR parsers. 3. intermediate code. semantic errors. PHI. Fischer and R. Benjamin Cummings.P. Pearson Education Allen I. structure of a compiler. syntax Analysis. N. lexical analysis. “Compilers Principles. implementation of LR parsing tables.L 3 T 1 P 0 C 4 CS-412 COMPILER DESIGN Introduction to Compilers Compiler and translators need of translators. 4. Thompson Learning . representing scope information. data structures for symbol tables. lexical-phase errors. Kenneth C. Jeffrey D Ullman. Basic Parsing Techniques Parsers. construction canonical LR parsing tables. canonical collection of LR(0) items. Code Generation Object programs. an automatic parser generator. C. J. machine model. quadruples and triples. Introduction to Code optimization The principal source of optimization. simple code generator. Ravi Sethi. register allocation and assignment. 5. construction LALR and SLR parsing tables using ambiguous grammars. value numbers and algebraic laws.

Pipelined Datapath. Type and Size of Operands. Instruction Level Parallelism and its Exploitation Instruction Level Parallelism: Concepts and Challenges. Modules and Hierarchy. Multiprocessors and Clusters Introduction. David A Patterson & John L Hennessy. Scratch pad Memories. Clusters. Data Types. MIPS Instruction Set Architecture. Memory Addressing. Statically Exploiting ILP. Compiler Speculation. Hard-wired Control Enhancing Performance with Pipelining An Overview of Pipelining. Data Hazards and Forwarding. Instructions for Control Flow. Evaluating Performance. Role of Compilers. Exception Handling. Real Faults and Failures. Memory Hierarchies. Simulation and Debugging using SystemC. Vector Processors Basic Vector Architecture. Exceptions. Measures and Benchmarks. Ports and Signals. “Computer Organization & Design: A Harware/Software Interface”. Scheduling and Structuring Code. the Basics of Caches. Building a Datapath for Supporting the ISA. Multiprocessors Connected by a Single Bus. “Computer Architecture: A Quantitative Approach”. Single Cycle Implementation. Storage Systems Advanced Topics in Disk Storage. Network Topologies. Caches and Memory Hierarchy Design Introduction. Predicated Instructions. Pipelined Control. . Reducing Branch Cost with Speculation. Instruction Set Principles and Examples (example of MIPS) Introduction. Enhancing Vector Performance. detecting and Enhancing Loop Level Parallelism. Encoding an Instruction Set. Text and Reference Books 1. Overcoming Data Hazards with Dynamic Scheduling. Classifying Instruction Set Architectures. Control Hazards. John L Hennessy & David A Patterson. Assessing and understanding Performance Introduction. Morgan Kaufmann Publishers. I/O Performance. Virtual Memory. Exploiting ILP Using Multiple Issue and Scheduling. 2. Effectiveness of Compiler Vectorization. Basic Compiler Techniques for Exposing ILP. Measuring and Improving Cache Performance.L 3 T 1 P 0 C 4 CS-413 ADVANCED COMPUTER ARCHITECTURE Introduction to SystemC Introduction. Hardware and Software for VLIW and EPIC Introduction. Operations in the Instruction Set. Morgan Kaufmann Publishers. Reliability. Data Hazards and Stalls. Basic Cache Optimizations. Programming Multiprocessors. Multiprocessors Connected by a Network. Chip Multiprocessors and Multithreading. Advanced Techniques for Instruction Delivery and Speculation. CPU Performance and its Factors. Micro-programming. Processes. The Processor: Datapath and Control Introduction. Vector Length and Stride. Multi Cycle Implementation.

2. complex aggregation at multiple granularities. tools and applications. Jiawei Han & Micheline Kamber. “Data Warehousing. Morgan Kaufmann. Mc Graw Hill. modeling OLAP data.Pearson 5.Klelly.L 3 T 1 P 0 C 4 CS-421 DATA WAREHOUSING AND DATA MINING Introduction Data warehousing Definition. snowflakes and fact constellations. data mining techniques. 3-Tier data warehouse architecture. Rough Sets. 7. Data mining & tools Data mining definition & task. W.“Data Warehousing in the Real World”. 6. data mining languages and standardization of data mining.Inman. John Wiley & Sons. data warehouse back end tools. John Wiley & Sons. “ Data Mining”. Pearson. “Data warehousing System”. . John Wiley & Sons. Arun Pujari. “Developing the Data Warehouses”. data specification. W.Gassey. DBMS vs data warehouse. “Data Mining-Concepts & Techniques”. Metadata. Support Victor Machines and Fuzzy techniques. mining Text Databases and mining Word Wide Web.L. tuning and testing of data warehouse. Multimedia databases. Time series and Sequence data. Sam Anahory & Dennis Murray. data warehouse manager.H. Data marts. Multidimensional data mode. 9. 8.H. computation of data cubes. Mallach. “Managing the Data Warehouses”. “Building the Data Warehouse”. 3. KDD Dataset. Alex Berson.H Ionhman C. distributed and virtual data warehouses. 4. Data mining techniques Association rules. C. W. types of OLAP. “Data Mining Techniques”. ROLAP vs MOLAP. Pieter Adriaans & Dolf Zantinge. servers. Mc Graw Hill. Data Mining and OLTP”. Implementation Data warehouse implementation. OLAP queries manager. KDD versus data mining. usage and trends. Architecture Data warehouse process & architecture. Schemas for Multidimensional Database: stars. Data cubes. Decision tree knowledge discovery through Neural Networks & Genetic Algorithm. Clustering techniques. OLTP vs OLAP. Text and Reference Books 1. Data mining query languages. Inman. hierarchy specification. pattern presentation & visualization specification. specifying knowledge. Mining complex data objects Spatial databases.

Multiple access with collision avoidance. IEEE 802. Handover. K Talukder. Ad hoc networks: Routing. System architecture. Medium access control layer. assumptions and requirements. Security. Protocol architecture. Telecommunication Systems GSM: Mobile services. Protocol architecture. MAC management. adaptation. mobile web caching. Richard III and Loren Schwiebert. Security. Radio transmission. Infrastructure and Ad hoc Networks. Context Aware Computing Ubiquitous computing.422 MOBILE COMPUTING L 3 T 1 P 0 C 4 Introduction Challenges in mobile computing.11: System architecture. capacity increase by cell splitting.CS. Addison Wesley. Transaction oriented TCP. 3. mobile and wireless security issues. DECT: System architecture. Text and Reference Books 1. Data dissemination.K. and Applications”. Frank Adelstein. “Mobile Communications”. Entities and Terminology. Fast retransmit/fast recovery. S. “Mobile Computing”. TETRA. Networking. Methodologies. UTRA TDD mode. Mobile Middleware Service discovery. Problems in ad hoc networks. Transmission/timeout freezing. Classical Aloha. Fast retransmit/fast recovery. Indirect TCP. HIPERLAN Protocol architecture. 5. Bluetooth User scenarios. Wireless security Traditional security issues. resource poorness. Mobile Network Layer Mobile IP: Goals. Optimizations. concept of context. Physical layer. Demand assigned multiple access. New data services. “Fundamentals of Mobile and Pervasive Computing”. Slotted Aloha. UMTS and IMT-2000: UMTS Basic architecture. Tunneling and Encapsulation. McGraw-Hill Professional. . Mobile TCP. caching in ad hoc networks. mobile agents. Tools. Golden G. Yavagal. Future development. Physical layer. Medium Access Control Motivation for a specialized MAC: Hidden and Exposed terminals. Addison Wesley. Medium access control Sublayer. “Mobile Computing: Concepts. Wireless LAN Infrared vs. Cellular architecture. Mobile data caching. Data Dissemination and Management Challenges. Information bases And Networking. PRMA packet reservation multiple access. IP packet delivery. Selective retransmission. Sublayer. 2. coping with uncertainties. Reverse tunneling. Mobile data replication. Gupta. Near and Far terminals. Agent advertisement and discovery. frequency reuse. SDMA. J. co-channel interference. Ipv6. middleware support. David Taniar. Snooping TCP. 4. Protocols. Registration. Schiller. Roopa R. Talukder.S. TDMA: Fixed TDM. Mobile cache maintenance. Physical layer. Link management. Mobile Transport Layer Traditional TCP: Congestion control. Inhibit sense multiple access. context aware computing and applications. etc. FDMA. CDMA: Spread Aloha multiple access. Charles Perkins. “Ad hoc Networks”. Polling. Channel access control. Radio interface. Implications on mobility. Asoke. Slow start. Dynamic host configuration protocol. Carrier sense multiple access. Localization And Calling. Reservation TDMA. bandwidth. UTRA FDD mode. Asoke K. MAC layer.

save locations. Dunning. Engineering Press. entities and transactions. single-server single queue model. 4. long period generators. Jerry Banks. ARENA and MATLAB. programming examples. discrete vs continuous probability. their comparison with respect to speed and validity. SNA. M/G/1 and other queuing models. Text and Reference Books 1.. Random Number Generation Congruence generators. user defined functions. McGraw-Hill. . Z. CA. statistical quality measures of generators. San Jose. runs testing. and Dudewicz. K. 3. analytical results for M/M/1.J. methods for generating non-uniform distributions. Law and Kelton . John S. blocks in GPSS. Barry L. event graphs. David M. Nicol. continuous uniformly distributed random numbers. logic switches. Queuing Models Little’s theorem. E. M/M/c.A. Carson. tabulation of result. 2. chi-square and other hypotheses testing. process oriented programming. “Modern Statistical Systems and GPSS Simulation”. “Simulation Modeling and Analysis”. A. Hands on practices on GPSS. user chains. Stochastic variables.. M/M/1/N. Nelson. Prentice-Hall.L 3 T 0 P 0 C 3 CS-310(a) DISCRETE EVENT SYSTEM SIMULATION Introduction Definition and fundamentals of continuous and discrete event models. “Discrete-Event System Simulation”. uniformity and independence testing. Monte Carlo simulation. Karian. algorithms for generating random numbers. CRC Press. GPSS Model structure. Discrete Event Simulation Time-advance mechanisms. “Getting Started in GPSS”. event modeling of discrete dynamic systems.

and Navathe. views and indexes. “Database System Concepts”. SQL operators and their procedure. H. DBMS vs RDBMS. S. Cursors in SQL. functional dependencies. “Fundamentals of Database Systems”. Characteristics of SQL. Advantage of SQL.B.L 3 T 0 P 0 C 3 CS-310(b) RELATIONAL DATABASE MANAGEMENT SYSTEMS Introduction Relational database management. Unions. outer join and manipulation of databases. database schema.. Types of SQL commands. Oracle Press. data abstraction and system structure. transaction management. dependency preservation. Aggregate functions. relational algebra. R. SQL Query processing and optimization. SQL data types and literals. ACID property. George Koch. Abraham. data definition language and views. . multi value dependency and higher normal forms. update and delete operations. Text and Reference Books 1. Pearson Education. Minus. Kevin Loney. Elmasi. Tables. and Sudershan. McGraw-Hill. aggregate functions. lossless join. Queries and sub queries. Relational model. Intersection. Joins.. 3. S. comparison of queries in relational algebra. “Oracle9i: The Complete Reference”. Relational database design Various normal forms. 2. Insert. set operations. canonical cover.

File Descriptors. Functions to Manipulate Directories. real time scheduling. Prentice Hall software series. Silberchatz. The fork() System Function. Link(). Richard Stevens. J. Accessing Environment Variables. scheduling algorithms. Interpreter files and exec. . The Exec System Functions. system programmer's view of processes. The wait() and waitpid() function. AddisonWesley. contiguous allocation. Process Memory Layout. The fcntl() function. operating system's views of processes. remove(). “Advanced Programming in the UNIX Environment”. Types of operating systems. dynamic partitioned memory allocation. multiple processor scheduling. demand paging. “Operating System Concepts”. CPU Scheduling Scheduling concepts.L 3 T 0 P 0 C 3 CS-320(a) OPERATING SYSTEMS AND UNIX FUNDAMENTALS Introduction Evolution of operating systems. System-Level Functions. 2. Processes Management Process Creation and Termination. Library vs. The v-node structure. Addison Wesley.L. “The Design of the Unix Operating System”. Non-contiguous allocation. algorithm evaluation. POSIX. Real and Effective User IDs. The access() function. unlink(). operating system services for process management. Keeping Track of Open Files. Bach. segmentation. Memory management Memory management. Parent and Child. 3. and rename() functions. File Table Entries. swapping. The process concept. Files and Directories Basic File Types. File Attributes. UNIX Standards Fundamentals of UNIX. overlays. Peterson and A. paging. W. Text and Reference Books 1. page replacement. Dynamic Memory Allocation. The open() and creat() Functions. Maurice J.

Transformation functions. Practicing the mechanics of biped walks. Manipulation of objects to produce animation. “Computer graphics”. “Acting for Animators Heinemann”. Output Primitives.Dimensional Concepts & Object Representations Three Dimensional Display Methods. Three. Translation. D. Reed Elsevier. Posing characters in scenes. The Graphical Kernel System. Scaling. Window to viewport co-ordinate transformation. Parallel Projection. Clipping Operations. 4. Modification of object or image to produce animation. Polygon Clipping. Composite Transformation. Display Devices. Gaining an insight into creating believable action. Methods of lip-syncing to sound breakdowns. PHI. Animation Design and Theory Study of Animation Techniques & styles. Dover Publication Inc. Scaling. . Display Processors. Three dimensional Transformation function. McGraw Hill. Bezier Curves and surfaces. Interactive Input Devices. head turns. Rotation. Rogers. Curved Lines and surfaces. Shear. Other Transformation Reflection.L 3 T 0 P 0 C 3 CS-320(b) COMPUTER GRAPHICS AND ANIMATION Introduction to Computer Graphics Overview of Graphics Systems. “The Human Figure in Motion”. Ed Hooks. Circle Generation algorithms. NY. runs. gestures. Polygon Surfaces. Hard copy Devices. Reflecting on animal movement Text and Reference Books 1. Perspective Projection. Character Animation Reflecting on human movement.F. Point Clipping. Line Clipping. Two-Dimensional Geometric Transformation & Viewing Basic Transformation. 2.. Translation. 3. Character Generation. Eadweard Muybridg. Rotation. Hearn and Baker. “Procedural Elements for Computer Graphics”. Line drawing algorithms. B-Spline Curves and surfaces.

Objects. Accessing Web servers. HTML 5 protocols. Overview. Apache web server. Directives. Electronic Commerce. Pearson Education Asia. HTTP. POP3. multi-tier applications. EBusiness Model. Paul Deitel . Arrays. Functions. scripting. “Internet and world wide web – How to Program”.L 3 T 0 P 0 C 3 CS-323(a) WEB TECHNOLOGIES Introduction History of the Internet and World Wide Web. redirecting request. Client Side Scripting and Server side Scripting. Event Handling and CSS Event Model – On check – On load –Onerror – Mouse related events – Form processing – Event Bubblers. HTTP request types. 2. Harvey Deitel. Abbey Deitel . Prentice Hall .Inline styles – Embedded Style Sheet – Linking External Style Sheets – Positioning of Elements-Drop Down Menus – Text shadows – Multiple Background Images Multimedia Audio and video speech synthesis and recognition. Get and post requests. Object Based Scripting for the web. SMTP. IIS.“Internet and world wide web – How to Program”. Introduction to JAVA Scripts. Online Payments and Security. System Architecture. Objects. Handling HTTP Requests. Standard Actions. Deitel & Deitel. XML Structure in Data – Name spaces – DTD – Vocabularies – DOM methods. E. Web Servers. IMAP. Goldberg.Marketing. Control Structures. MIME. JSP. Text and Reference Books 1. CSS. Servlets and JSP Introduction. Servlet Overview Architecture.

Square Root. Reciprocal Square Root and Square Root by Iterative Approximation. Convergence. Quotient-Digit Selection Function. Polynomial Approximations and Interpolations. Two’s Complement and One’s Compliment Adders. Truncating Multipliers. . Variable Time Adder.Morgan Kaufmann Publishers. Range Extension and Arithmetic Shifts. Adders with Redundant Digit Set. Algorithms and Implementations Floating Point Representation. Application Specific Variations. Basic Carry Ripple Adder and Full Adder Implementation. Squarers. Floating Point Division and Square Root. Result Digit Selection. Combination of Division and Square Root. Carry Skip Adder. Compensation of Scaling Factor. Reciprocal. IEEE Standard 754. Text and Reference Books 1. Floating Point Multiplication. Reducing the Adder Delay. Multiply-Add and MultiplyAccumulate. Multiplication Sequential Multiplication with Recoding. Addition. Milos D Ercegovac & Tomas Lang . Reduction. Floating Point Addition. Change of Sign and Subtraction. Implementation of Division Algorithm. Extension to Hyperbolic and Linear Coordinates. Rectangular Multipliers. Basic Fixed Point Number Representation Systems. Partially Combinational Implementation. Pipelined Adders. Implementations. Carry Lookahead Adder. Square Root by Digit Recurrence Algorithm. Floating Point Representation. Liner Convergence Method. Partially Combinational Implementation. Correct Rounding and Monotonicity. Division by Digit Recurrence Algorithm and implementation of Fractional Division. Combinational Implementation. “Digital Arithmetic”. Basic Division Algorithms. Multi-operand Addition Bit Arrays for Unsigned and Signed Operands. Integer Square Root. Bipartite and Multipartite Table Method. Carry Select and Conditional Sum Adders. Implementation and Timing. Roundoff Modes and Error Analysis. Redundant Addition and High Radix. Constant and Multiple-Constant Multipliers. Reciprocal. Integer Division. Saturating Multipliers. Prefix Adder. Combinational Multiplication with Recoding. Sequential Implementation. Two Operand Addition Carries. Switched Carry Ripple (Manchester) Adder. Precision and Range. CORDIC Algorithm and Implementations Rotation and Vectoring Modes. Rational Approximation. Division. Division. Function Evaluation Argument Range Reduction. Arrays of Smaller Multipliers.L 3 T 0 P 0 C 3 CS-323(b) DIGITAL ARITHMETIC Review of Basic Number Representations and Arithmetic Algorithms Digital Arithmetic and Arithmetic Units. Basic Multiplication Algorithms.

Boolean Algebra and Applications. Graphs. Synthesis of Pipelined Circuits. Bipartite and Multipartite Table Method. Combination of Division and Square Root. Text and Reference Books 1. Integer Square Root. Division. Strategies for Architectural Optimization. Floating Point Multiplication. Scheduling Pipelined Circuits. Hardware Modeling Hardware Modeling Languages. Resource Sharing and Binding Algorithm. Scheduling Algorithms foe Extended Sequencing Models. Function Evaluation Argument Range Reduction. Polynomial Approximations and Interpolations. Microelectronic Design of Microelectronic Circuits. Giovanni De Micheli. Floating Point Addition. Data-Path Synthesis. IEEE Standard 754. . Extension to Hyperbolic and Linear Coordinates Redundant Addition and High Radix. Division. Graph Optimization Problems and Algorithms. Combinatorial Optimization. Result Digit Selection.L 3 T 0 P 0 C 3 CS-323(c) CAD OF DIGITAL SYSTEMS Introduction Microelectronics. Implementation and Timing. Roundoff Modes and Error Analysis. Convergence. Precision and Range. Floating Point Division and Square Root. Compensation of Scaling Factor. Compilation and Behavioral Optimization. Abstract Models. Floating Point Representation. Scheduling without Resource Constraints. Scheduling Algorithms Model for Scheduling Problems. Square Root. Reciprocal Square Root and Square Root by Iterative Approximation. Reciprocal. Correct Rounding and Monotonicity. McGraw Hill Publishing Company. Implementations. “Synthesis and Optimization of Digital Circuits”. Background Notation. Area and Performance Estimation. Reciprocal. Algorithms and Implementations Floating Point Representation. Rational Approximation. Liner Convergence Method. Control Unit Synthesis. Semiconductor Technologies and Circuit Taxonomy. Architectural Synthesis Circuit Specifications for Architectural Synthesis. Scheduling with Resource Constraints. CORDIC Algorithm and Implementations Rotation and Vectoring Modes. Application Specific Variations. Fundamental Architectural Synthesis Problems. Computer Aided Synthesis and Optimization.

natural deduction. A. goal-driven. explanation. 2. Nilsson. events. actions. stochastic. Knowledge Representation and Reasoning Ontologies. description logics. Cengage Learning India Pvt Ltd N. “Artificial Intelligence – A Modern Approach”. problem characteristics. Pearson Education / Prentice Hall of India. partial order planning. and learning agents Artificial Intelligence programming techniques Problem-solving through Search Forward and backward. Narosa Publishing House.L 3 T 0 P 0 C 3 CS-323(d) ARTIFICIAL INTELLIGENCE Introduction Introduction to AI. neural. Machine Learning and Knowledge Acquisition Learning from memorization. Saroj Kaushik. McGraw Hill International. New Age International Pvt Ltd . Turing test Problems. Bayes rule. “Principles of Artificial Intelligence”. AI techniques. frame representation. state-space. search. alpha-beta cut off . blind. time. Peter Norvig. “Logic and Prolog Programming”. relations. connection to logic. production system characteristics. independence. production system. and exploration. Problem Spaces &Search Defining problem as a space. reasoning about knowledge. level of model. representing and reasoning about objects. construction and use of planning graphs. 4. and space. Rich and Knight. issues in the design of search programs. reasoning with defaults. bayesian networks. problem-reduction. foundations of knowledge representation and reasoning. examples. 5. Q-learning for learning action policies Text and Reference Books 1. elementary game theory. Saroj Kaushik. 3. deliberative. AO*. situation calculus. and decision tree classifiers. Planning Planning as search. A*. E. “Artificial Intelligence”. semantic network. naive Bayes. predicate logic. resolution. heuristic. sequential decision problems. minimax. constraint propagation. Representing and Reasoning with Uncertain Knowledge Probability. Learning nearest neighbor.J. probabilistic inference Decision-Making Basics of utility theory. “Artificial Intelligence”. criteria for success. Stuart Russell. and evolutionary search algorithms. utility-driven. Intelligent agents Reactive. decision theory.

Jessup & Velacich. 2. business value of security and control. Enterprise applications and business process systems What are enterprise systems. Sadagopan. C. Laudon. How enterprise systems work. The Digital Firm. PHI. “Introduction to Information Systems”. M Henry C. John Wiley & Sons. . Jr. TMH. managing global systems. 6. technologies and tools for security and control. different types of systems in organizations Systems from a functional perspective. Thomson . prototyping. Effy Oz. perspectives on information systems. wireless transmission media and devices. establishing a management framework for security and control. Brien. 5. enterprise integration trends. The wireless revolution Business value of wireless networking. M-commerce and Mobile computing. wireless technology in the enterprise. end-user development. technology issues and opportunities for global value chain. Inc. Security and control System vulnerability and abuse. managing implementation. PHI. Managing change and international information systems The importance of change management in information systems success and failure. “Information Systems Today” . cellular network standards and generations. 3. “Management Information Systems”.Lucas. Pearson Education. Jane P. application software package and outsourcing. Redesigning the organizations with information systems Systems as planned organizational change. Text and Reference Books 1. business process reengineering and process improvement.. Electronic Business and Electronic Commerce. “Management Information Systems”. 4.“Management Information Systems”. Laudon & VM Prasad Kenneth. contemporary approaches to information systems.L 3 T 0 P 0 C 3 CS-324(a) MANAGEMENT INFORMATION SYSTEM Information systems in the enterprise Why information systems. supply chain management systems. James A. alternative systems building approaches traditional systems life cycle. customer relationship management systems. wireless computer networks and internet access. overview of system development. the growth of international systems. organizing international information systems. “Information Technology-Strategic Decision Making for Managers”. Internet technology and the digital firm.

Earlier MIPS . The SuperSPARC. Implementations. Protection Mechanism. Instruction and Data caches. Daniel Tabak. Earlier SPARC Implementations. The MIPS Text and Reference Books 1. R4000 and R4400. The Motorola M68000 Family Introduction. Addressing Modes. Exception Processing. Paging. Segmentation. Addressing Modes. Example of Intel x86 Family. Task management.B. Pearson Education. Real and Virtual Mode Execution.Brey. Memory Management. 2.L 3 T 0 P 0 C 3 CS-324 (b) ADVANCED MICROPROCESSORS The Intel x86 Family Introduction. The Power PC Family Introduction. The IBM RS/600. The MIPS Rx000 Family Introduction. Barry. Examples of Motorola M68000 Family. The Alpha AXP Architecture. MIPS Architecture. Data Formats. “The Intel Microprocessors”. CPU Registers. The DEC Alpha AXP Introduction. The Power PC Family Architecture. SPARC Architecture. Alpha AXP implementations. The Power PC Family 601. The Sun SPARC Family Introduction. “Advanced Microprocessors”. Instruction Set and Assembly Directives. Data Formats. Mc Graw Hill. Instruction Set and Assembly Directives. The Register Set. Interrupt.

Jain. Homomorphic filtering. Thresholding. discriminent functions. Image Segmentation Detection of discontinuities. syntactic and neural. Image compression standards. Real-Time image transmission. Edge linking and boundary detection. R. Sharpening filters. Region oriented segmentation. Prentice Hall of India. Pratt. 3. Inter-pixel redundancy. “Digital Image Processing”.L 3 T 0 P 0 C 3 CS-324(c) DIGITAL IMAGE PROCESSING Introduction Digital image representation. Robert Schalkoff. Window operations. Error-free compression. Statistical Pattern Recognition Statistical PR. Image subtraction. Pattern Recognition Classification and description. fidelity criteria. Andrian Low. “Pattern Recognition-Statistical. McGraw Hill CO. Bit-plane coding. “Fundamentals of Image Processing”. Fundamental steps in image processing. Fractal Compression. JPEG and MPEG. . Risk and error. A.K. Structural and neural approach”. 5. Text and Reference Books 1. Classifier Gaussian Model. Decision regions and boundaries. 2. Smoothing filters. Frequency domain techniques. Sample intensity transformation. Classifiers. Lossy compression. Image compression models. Supervised and Unsupervised learning. Image Enhancement Enhancement by point processing. Elements of visual perception. Image averaging. “Introductory Computer Vision and Image Procession”. Loss-less predicative coding. Image model. Use of motion in segmentation. Imaging geometry. “Digital Image Processing”. PR-Approaches statistics. Frequency domain: Low-Pass. Maximum likelihood estimation. Elements of Digital Image processing systems. McGraw Hill. Histogram processing. Gonzalez and R. K. clustering for unsupervised learning and classifiers. Structure of a pattern recognition system. Sampling and quantization. Relationship between pixels. Spatial Operations and Transformations Spatially dependent transform template and convolution. Image Compression Coding redundancy. Variable length coding. Bayessian parameter estimation approach. W. E. Spatial filtering. High-Pass. John Willey & Sons 4. Spatial techniques.Dimensional geometric transformations. 2. Wood. Classifier performance. feature extraction.

The Design and Analysis of Parallel Algorithms. MPI Paradigms. 6. Accelerated Cascading. Partitioning. time. Shifting. CUDA Streams. Multiplication of Matrices. Kernel invocation operator. CRCW PRAMs and interconnection network models such as the mesh.Akl. Caches and Buffers. PVM. Replicate. Parallel Sorting and Sorting Networks: Parallel Insertion Sort. CREW. speedup. CUDA runtime API. Optimizing CPU-GPU usage. S. Shared memory bank conflicts. . Parallel efficiency measures for parallel algorithms. Coalescing memory access. Optimization Techniques: Understanding thread and blocks execution. Example: matrix multiplication. Spreading. Parallel Programming Language. broadcast and search on these architectures. Symmetry Breaking. Lock-free) Parallel Algorithms Data organization for shared/distributed memory . Fortran90 and HPC Fortran. Querying GPU capabilities. Merging. Bitonic Merge Sort etc. e. Parallel algorithms on network. Language extensions. Loop optimizations.L 3 T 0 P 0 C 3 CS-324(d) PARALLEL ALGORITHMS Review of sequential algorithms.Sum Searching. Concurrent kernels execution. processor efficiency. pipelining. Massively Data Parallel Algorithms. Parallel reduction.. N-body problems. Prefix operations . Synchronization (Locked. Data Parallelism. cost (work). Introduction to parallel algorithms and architectures: EREW. Example: Multi-GPU Async Copy . 5. PHI. Pipelining and Data Clustering. 4. Sorting. Min/Max. Debugging: Principles and terminology. cuda-memcheck . 3. Handling runtime errors in CUDA. Addition of Matrices. Builtin types and variables. cuda-gdb.. Key principles. Principal of Locality. CURAND Text and Reference Books 1. Nsight. gdb. Brent’s Theorem. Align. Layout. 2. Even-odd Merge Sort.G. Parallelization of Algorithm Parallel Programming Models. Writing Parallel Programs GPU Compute Architecture: Introduction to Graphics Processing Units (GPUs). Masking. Divide-and-Conquer. CUSPARSE. Simple parallel programs in MPI environments Parallel linear algebra routines. Array notation. PHI. CUDA (Visual) Profiler. Parallel and Vector C Code. Broadcasting. Asynchronous execution.g. Developing and deploying OpenCL kernels. CUFFT. Multi-Core CPU programming. OpenCL host API. Introduction to Distributed and Parallel Computing. Edward Kandrot Programming Massively Parallel Processors: A Hands-on Approach by By David Kirk and Wen-mei Hwu Parallel Programaming in C with MPI and openMP by Michael J Quinn (McGraw Hill) Crichlow. CUDA. OpenCL. Attributes. CUDA programming model. CUDA implementation. Implementing basic data processing. Knowledge of how to efficiently sum. CUDPP implementation. Functional Parallelism. An Introduction to Parallel Algorithms by Joseph Jaja (Addison-Wesley Professional) CUDA by Example: An Introduction to General-Purpose GPU Programming by Jason Sanders. Implementation. Threads and blocks. CUBLAS. Comparison with CUDA. Prefix sum (scan). Memory organization in CUDA. Forall Loops. Data Dependence Graph. Basic Parallel Algorithmic Techniques Pointer Jumping. CUDA Libraries. .

Hypertext data structure. 6. Hierarchy of clusters User Search Techniques Search statements and binding. and standards. Harman. Ian Witten. data structures for unstructured data. Automatic Indexing Classes of automatic indexing.L 3 T 0 P 0 C 3 CS-414(a) INFORMATION RETRIEVAL Introduction Definition. Measures used in system evaluation. Data Structures: Introduction. Evaluation of Asian language text retrieval. Information visualization technologies. W. Gerald. indexing and indexes. John Wiley & Sons. “Information Storage & Retieval”. Hypertext linkages. Morgan Kauffman. 4. Measurement example – TREC results. Thesaurus generation. design and maintenance of such databases. 5. Concept indexing. Similarity measures and ranking. Relevance feedback. Ricardo Baeza-Yates: Information Retrieval Data Structures and Algorithms. Manning. Prentice Hall. construction and evaluation of search and navigation techniques. Cognition and perception. Mark T Maybury: Information Retrieval Systems: Theory and Implementation. N-gram data structure. 2. Software text search algorithms. Christopher D. Indexing Process. Robert Korfhage.B. formats. Introduction to Information Retrieval by Cambridge University Press. Text Search Algorithms Introduction. Frakes. Natural language. Objectives. Hardware text search systems. crosslanguage information retrieval Query Expansion Thesauri. Information System Evaluation Introduction. 3. TREC: Experiment and Evaluation in Information Retrieval. Teresa Numerico. Automatic Indexing. Kluwer Academic Press. Searching the Internet and hypertext. analysis. Weighted searches of Boolean systems. Semantic Networks. Information Extraction. and search engines Information Visualization Introduction. Cambridge. Voorhees and Donna K. Inverted file structures. Massachusetts: MIT Press . Signature file structure. retrieval and classification schemes Information Retrieval System Capabilities Search. Prabhakar Raghavan and Hinrich Schütze. Marco Gori. Miscellaneous. Cataloging and Indexing: Objectives. Selective dissemination of information search. Document and Term Clustering: Introduction. question answering and text summarization. Stemming Algorithms. Digital libraries and Data Warehouses. representation. Integrating Structured Data and Text Text and Reference Books 1. PAT data structure. crowd sourcing search. Functional Overview. editors. organization. Kowalski. Relationship to DBMS. Statistical indexing. and access to information. “Web Dragons: Inside the Myths of Search Engine Technology”. Item clustering. use of codes. Ellen M. Browse..

concurrency control for distributed transactions. transforming global queries into fragment queries. atomicity of distributed transactions. similar representation of queries. “Database management system”. distributed database access primitives and integrity constraints. Reliability and concurrency control. Reliability and protection Basic concepts. Distributed transactions and concurrency control Frame work for transaction management properties and goals of transaction. Raghuramakrishnan . recovery procedures. check point and cold restart . distributed transparency for read only applications and update applications. Query optimization Problems in query optimization. concurrency control based on time stamps. the allocation of fragments. detection and resolution of inconsistency. Ceri and Pelagatti . user identification . authorization rules. Review of databases and computer networks.Authorization and protection . objectives in query process optimization. McGraw Hill. Text and Reference Books 1. site to site protection. Levels of distribution transparency. . parametric queries. reference architecture.L 3 T 0 P 0 C 3 CS-414(b) DISTRIBUTED DATABASES Distributed databases features Distributed database management systems.“Distributed databases principles and systems”. Translational global queries to fragment queries. join query. Distributed database design A frame work for distributed database design. McGraw Hill. determining a consistent view of network . equivalence transformation for queries. types of data fragmentation. general queries. 2. model for query optimization. distributed grouping and aggregate function evaluation. Foundations of distributed concurrency control . the design of database fragmentation. non-blocking commitment protocols. distributed deadlocks.

H. C. Randomized Algorithms. NP-completeness. Approximation algorithms. convex hulls. Asymptotic complexity. Factoring as periodicity quantum algorithm for factoring. Randomized algorithms. Linear Programming Special topics: Geometric algorithms (range searching. and U. Cambridge University Press . quantum Fourier transform. web caching. Text and Reference Books 1. modular exponentiation. R. Cormen. V. Introduction to Algorithms. Algorithms: Design Techniques and Analysis". Branch-and-bound. C. cryptographic computations) Internet Algorithms Text pattern matching. 3. Dasgupta. Flow networks. Graph Algorithms Shortest paths. extended Euclid's algorithm. Periodicity Quantum circuits. superposition. Addison Wesley M. H. Quantum Algorithms Qubits. Greedy. Rajeev Motwani and Prabhakar Raghavan. closest pairs). Leiserson. 4. H. S. Rivest. FFT. E. segment intersections. World Scientific T. information retrieval. Prentice Hall of India. Stein. matrix and polynomial multiplication. "Introduction to Algorithms: A Creative Approach" . Vazirani. C. data compression. Alsuwaiyel. L. 5. tries. and measurement. Papadimitriou. primality testing. Algorithms Udi Manber. Numerical algorithms (integer. 2.L 3 T 0 P 0 C 3 CS-414(c) ADVANCES IN ALGORITHMS Algorithmic paradigms Dynamic Programming. Amortized analysis.

Systems Quality Requirements Engineering. Integer Operations.L 3 T 0 P 0 C 3 CS-414(d) PROGRAMMING LANGUAGE SECURITY Introduction Security Concepts. Software Security: Building Security In. Keith Brown. language-based techniques to provide security for executing code. Concurrency. Text and Reference Books 1. Strings String Characteristics. Mitigation Strategies. Quality Assurance. and applying programming language-inspired techniques to enforce security in the semantic-web based languages. 6. Time of Check. Security standards for Java Security. Notable Vulnerabilities. Addison-Wesley. Integers. Time of Use. Seacord. Mitigation Strategies Dynamic Memory Management Dynamic Memory Management. Compiler Checks. Threat Modeling. Code Injection. Memory Permissions. Function Pointers. Vulnerabilities. Exceptional Behavior. Verification . Common String Manipulation Errors. Graff and Kenneth R. Static Analysis. Secure Coding in C and C++. Input Validation. Arc Injection. Formatted Output Functions. Expressions. RtlHeap. Integer Conversions. Common Dynamic Memory Management Errors. Secure Programming for Linux and Unix HOWTO. Formatted Output Variadic Functions. Use/Misuse Cases. Microsoft Press. TSP-Secure. Scope. The . Miscellaneous. Code Complete. Files as Locks and File Locking. The atexit() and on_exit() Functions. Notable Vulnerabilities. Addison-Wesley. Wheeler. The Void. Gary McGraw. the advantages of language based security. 2. Addison-Wesley. . Steve.NET Development Series) Mark G. Building Secure Software: How to Avoid Security Problems the Right Way. Robert C.NET Developer's Guide to Windows Security (Microsoft . Process Memory Organization. 7. Virtual Pointers. Mitigation Strategies. Off-the-Shelf Software. Java References Recommended Practices Secure Software Development Principles. 8. certifying compilers and their verification methods. McConnell. van Wyk. Architecture and Design. The Open Group. Doug Lea's Memory Allocator. Global Offset Table.dtors Section. String Vulnerabilities. Stack Smashing. Mitigation Strategies. security types and information flow. File management Concurrency. The longjmp() Function. Pointer Subterfuge Data Locations. Bob et al. Mitigation Strategies. David A. Object Orientation.. password. 3. Input Output. Blakley. Stack Randomization. 4. File System Exploits. Secure Coding Standard for C. 5. Declarations and Initialization. Integer Error Conditions. O'Reilly. Notable Vulnerabilities. Security Design Patterns. 9. The . Exception Handling. encapsulation and access control. C++ and Java. memory and type safety. security principles and properties. Data Sanitization. Methods. Data Pointers. Floating Point. Mitigation Strategies. Nonexceptional Integer Logic Errors. John Viega and Gary McGraw. Notable Vulnerabilities. Exploiting Formatted Output Functions. The CERT C Secure Coding Standard. Integer Security Integers. Modifying the Instruction Pointer. Secure Coding Principles and Practices. Defense in Depth.

Group communication. Name Services Time and Global States Clocks. M. “Distributed Systems: Concepts and Design”. and T. J. 3. physical time and clocks. “Distributed Systems: Principles and Paradigms”. characteristics of interprocess communication. “Advanced Concepts in Operating Systems”. IP multicast Distributed Objects and remote Invocation Indirect Communication. TCP stream communication. Shivaratri. Sockets. Pearson Education. multicast communication. Resource sharing and the World Wide Web.L 3 T 0 P 0 C 3 CS-415(a) DISTRIBUTED SYSTEMS Foundations Characterization of DS. Taunenbaum. Challenges System Models Architectural models. Kindberg. PHI. TMH. Fundamental models Interprocess Communication The API for the Internet protocols. . Operating System Support. Examples of distributed systems. logical time and clocks. coordination agreement. distributed debugging Coordination and Agreement Distributed mutual exclusion. 2. Coulouris. Distributed File Systems. Text and Reference Books 1. global states. UDP datagram communication. Client-server communication. elections. Dollimore. consensus and related problems. events and process states. External data representation and marshalling. G. Singhal & N.

and Huhns. the FIPA framework. G. the JAM! system).cooperative versus noncooperative. Classifying multi-agent interactions . Morgan Kaufmann. Interaction languages and protocols: speech acts.. Michael J. John Wiley and Sons. 2. agents as reactive systems (eg subsumption architecture).. MIT Press.. agent-oriented software engineering. comparison between agents and other softwares. M. BDI and practical reasoning agents. An Introduction to Multiagent Systems. deductive reasoning agents. KQML/KIF. multiagent learning.). properties of agents. coherence and coordination. bounded rationality. hybrid agents (eg PRS). organisational approaches. “Readings in Agents”. Addison Wesley . agents and distributed systems. Agent coordination Distributed problem solving. 4. typical application areas for agent systems. Agent Architectures Reactive/deliberative/hybrid agents. Multi-Agent Systems Designing multi agent society. agents and objects. planning and task sharing. 3. cooperation. layered agents (eg Interrap) a contemporary (Java-based) framework for programming agents (eg the Jack language.L 3 T 0 P 0 C 3 CS-415(b) AGENT BASED SYSTEMS Introduction Definitions of agency. Interactions between benevolent agents: cooperative distributed problem solving (CDPS). Interactions between self-interested agents Auctions & voting systems: negotiation. Singh. Ferber. Rational Reasoning: decision-theoretic/game-theoretic foundations. J. Wooldridge. Weiss (ed. “Multi-Agent Systems”. distributed search/distributed constraint satisfaction. matchmaking and brokering. M. teamwork and coalition formation. the design of intelligent agents . means-ends reasoning. negotiation (game-theoretic/heuristic/argumentation-based).the Prisoner's dilema and Axelrod's experiments. agents and expert systems. trust/norms/institutions. partial global planning.reasoning agents (eg AgentO). Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence. Text and Reference Books 1. zero-sum and other interactions.

SQL Server Security model and ADO. Configuring Access Permission for a Web Server. Web application implementation by using stored procedures and Microsoft ActiveX Data Objects (ADO) command parameters. Web application communication privacy and implement SSL-enhanced protection. Professional Java Security. CPU starvation. potential threats of attacks Validating and verifying User Input User input. cryptographic functionality supported by Microsoft platforms. Selection of Security-Enhanced Client Authentication Method. to encrypt and sign data.NET Authentication Methods. error handling. 3. Iterative process of designing security into a Web application.NET FormsBased Authentication Securing File System Data: Protect file system data that is typically part of a Web application. performing security testing Text and Reference Books 1. Wrox . Oppliger. Security Technologies for the World Wide Web.CS-415(c) WEB BASED APPLICATION SECURITY L 3 T 0 P 0 C 3 Introduction to Web Security Web Security. Garms. and bandwidth choking. Jess and Daniel Somerfield. Windows Access Control. Categorize and identification of attacks. Wrox Garms.NET security.NET Web Application Files Securing Microsoft SQL Server SQL Server Connections and Security. Artech House Publishers. CAPICOM. Management. validation. Preventing SQL Injection Attacks. . Helping to Protect ASP. Implementing Security: An Overview Planning for Web Application Security General process of incorporating security in the Web application planning and design process. Secure Sockets Layer/Transport Layer Security Protocols. 2. ASP. Encrypting. Professional Java Security. communications analysis. Hashing.NET Code Access and Role-Based Security. Denial of Service (DoS) attacks. creating a security test plan. Creating ACLs Programmatically. STRIDE Model to Determine Threats. Second Edition. Securing SQL Server Communication. and Signing Data Encryption and Digital Signing Libraries. Rolf. security aspects of the client/server Web paradigm. Windows-Based Authentication in ASP. resource starvation. ASP. Hashing data Testing Web Applications for Security Differentiate security testing from other types of testing Testing security in a web application. Types of Input attacks.Overview of Securing Files. Running Services as an Authenticated User Securing Web Pages ASP Forms-Based Authentication. SQL Server Role-Based Security. application crashing. Jess and Daniel Somerfield. Digital Certificates.NET Helping to Protect Communication Privacy and Data Integrity Cryptography. Internet Information Services Authentication Web Client Authentication.

2.physicists. Grover’s search algorithm. Qubit concepts. Potential and power of Quantum Computing. Implementation of quantum gates. Quantum multiplexer using quantum shift registers. Penguin Book. 5. Phase Shift Gate. AC5710. Eleanor Rieftel & Wolfgang Polak. Quantum Mechanical Computers. The Code book. Heisenberg’s Uncertainty Principle. Michel. CNOT. Asia. Quantum Vs Classical Computers. and serial and parallel quantum operations. Simon Singh. Schrödinger’s Wave Equation.. Quantum error correction. Richard P Feynman. Half adder. 7. Different algorithms-shor’s factorization algorithm. Dense Coding. Labret ire Brossel. 3. Charles H Benrelt et. Quantum teleportation.Bruce. spin resonance transistor. Text Books and Reference Books 1. Toffili Gates. A Nielson and Isac L Chaung. SRNOT. Quantum Shift Register. A Quantum heap in the Future. Polarization. Cambridge University Press J M Raymond. Quantum Phase Gates. applied Cryptography. Elementary gates for Quantum Computing. Thermodynamics of Computation. prim’s algorithm. An Introduction to Quantum Computing for non. Quantum Computing Approach to NP-Complete problems. Fredkin Gates. 6. Quantum data Compression. Quantum computers. ACM Computing Surveys. NOT. Quantum cryptography.L 3 T 0 P 0 C 3 CS-415(d) QUANTUM COMPUTING Quantum statistics. London . high Q-optical cavities. Physics Review S. NRM devices. Quantum Computations and Quantum Information. 4. France Adriano Brenco. Wily & Sons Inc. Full adder. Rotational Gates. Single photon transmission. al. Quantum Registers. Entanglement. Ion trap. Superposition.

client server models. persistency. RMI API.L. CORBA / Java. dynamic. TMH.IDL mapping. Review of Java concepts Java fundamentals. . CORBA activation services. “Java programming with CORBA”. Java applets. JDBC. TMH.L 3 T 0 P 0 C 3 CS-423(a) CLIENT SERVER COMPUTING Introduction to Client Server Computing Evolution of corporate computing models from centralized to distributed computing. RMI. Intrespection of beans. CORBAIDL mapping CORBA java. Socket interface. “Client/Server programming with Java and CORBA”. Benefits of client server computing. 3. Other Technologies Creating client / server application using-java sockets. Dynamic CORBA-The portable count. John Wiley & Sons. Robert Orfali Dan Harkey & Jeri Edwards .SPD. 4. Core CORBA / Java Two types of Client/ Server invocations-static. “Client/Server Survival Guide”. The introspective CORBA/Java object. 6. Robert Orfali and Dan Harkey . G. M. Wiley-dreamtech. “Client/Server Computing”. properties. Existential CORBA CORBA initialization protocol. Threads. D T Dewire . Caffeine. RMI. The static CORBA. stream I/O. AWT. the dynamic count multi count. HTTP/CGI. Exceptions. Principles and applications”. John Wiley & Sons. Text and Reference Books 1. “Distributed Computing. Strings. CORBA Beans.Liu. ORBlets with Applets.Brose. Java Bean Component Model Events. Swings.“IBM Webspere Starter Kit”. A Vogel and K. 5. Pearson Education.to.Duddy. first CORBA program. CORBA with Java Client/Server CORBA-style. Servlets. 2. pitfalls of client server programming. India John wiley and sons. Ron Ben Natan Ori Sasson . The object web: CORBA with Java.

Instance-specific design.L 3 T 0 P 0 C 3 CS-423(b) RECONFIGURABLE COMPUTING Hardware General-Purpose FPGA Architecture. Case Studies Image Processing. Packet Filtering (Networking application). Streaming Models. Bitstream Generation. Algorithm Alteration: SPIHT Compression. Theoretical Underpinnings and Future Directions Theoretical Underpinnings. Constant Propagation & Partial Evaluation. “Reconfigurable Computing: The Theory & Practice of FPGA Based Computation”. Reconfiguration Management. Routing. SIMD/Vector. Genetic Evolution. Metrics and Analysis. Distributed Arithmetic. . Defect and Fault Tolerance. Technology Mapping. Variable Precision. Software Computer Models and System Architectures. Run-time reconfiguration: Automatic Target Recognition. General-purpose/FPGA. Constructive. Compilation for Reconfigurable Computing Machines. Multi-FPGA Systems: Logic Emulation. Floating Point. Active Pages (Memory centric). Application Development Evaluating and Optimizing problems for FPGA implementations. Morgan Kaufmann Publishers. OS/Runtime Systems. Problem-specific circuitry: SAT Solving. Hardware Description Languages (SystemC). Text and Reference Books 1. Fast Mapping. Task allocation: FPGA vs. CORDIC. Reconfigurable Computing Devices. Scott Hauck and Andre DeHon. Reconfigurable Computing Systems. FDTD. Retimin. Datapath. Precision Analysis & Floating Point. Reconfigurable Computing and Nanotechnology. CPU partitioning. Placement.

ifconfig. Monitoring Process Activity. Software Installation and Structuring Software. “TCP/IP Network Administration”. Controlling User Resources. O Reilly and Associates Inc. “Windows 2000 Administration”. TCP/IP Troubleshooting: ping. NTFS). 4. Configuring a DNS Server. Addressing and Subnetting : Fixed Vs Variable Masks. traceroute. John Wiley and Sons Ltd. Logs and Audits. . Installation and configuration of devices and drivers. Network Management. Perl/Python Scripting. System Sharing. OS Installation. Concept of swap space. Process Management and Monitoring. Adding/Removing users. Use of Scripting tools: Shell Scripting. Superuser/Administrator Privileges. 2. Configuring a Linux/Windows Box as a Router. User IDs. Access Control and Monitoring: Wrappers. Backup and Restoration. Cloning Systems. “Linux Network Administrator’s Guide”. User Management. NFS. Configuring a Web Server. Systems Performance Tuning: Host Management: Booting and Shutting down of an Operating System. C4. netstat. Mark Burgessm. Partitioning and Building a File System. Scheduling Processes. George Splading. 5.L 3 T 0 P 0 C 3 CS-423(c) SYSTEMS & NETWORK ADMINISTRATION Introduction to Systems and Network Administration The Scope of Systems and Network Administration. 3. Static and Dynamic Routing. Restarting a Process. Categories of Security: C1. Configuring Sendmail Service. Killing/Stopping processes. Password Security. C3. Security Information Resources: CERT. Passwords and Authentication. (Shroff Publishers and Distributors). Linux. Privileged. User and Group Accounts. O Reilly and Associates Inc. “Principles of Network and System Administration” . Formatting. Configuring a Proxy Server. Host and Network Security Security Planning. File System Layout. Integrating Multiple Operating Systems. Automatic Identification of Configuration Loop Holes. Olaf Kirch and Terry Dawson. Use of Make Option Text and Reference Books 1. Open Source Software: The GNU Project. Dial-up configuration and Authentication: PPP. Routing Protocols: RIP. File System Repair. OSPF. Detection and Prevention of Denial of Service (DOS) Attacks. Network Administration Introduction to Network Administration Approaches. Disk Space Allocation and quotas. Network Address Translation (NAT). Handling Man Pages/Help System. McGraw-Hill. Maintaining Log Files. VLAN Principles and Configuration. File Systems and Standards (UFS. Routing Concepts. RAS. System Components and their Management: Operating Systems: Windows and Unix Variants. Installing and Upgrading System Software. “Software Requirements: Microsoft Windows 2000. Firewalls: Filtering Rules. The Goals of Systems and Network Administration. Processes and Job Control. Craig Hunt. Radius. C2. BGP. ipconfig. Perl/Python”. Kernel Customization.

external and quality in use metrics. 5. development and quality plans. IEEE Std 730. Software Metrics: A Rigorous & Practical Approach. 6. certification. Metrics and Models in Software Quality Engineering. and assessment Quality management standards: ISO 9001:2000 – Quality Management Systems: Requirements. Software Quality Assurance Components In The Project Life Cycle Integrating quality activities in the project life cycle. Models of different classes of software products. Development process and its products. CMMI – Capability Maturity Model Integration.. Assuring the quality of external participants’ contributions. Process metrics.L 3 T 0 P 0 C 3 CS-423(d) SOFTWARE QUALITY ASSURANCE Software Processes and Products ISO and IEEE classifications of software life cycle processes. Software testing – strategies. its activities and tasks according to ISO and IEEE standards. Ltd. Pearson Education. Pressman Roger S. IEEE Std 1012 – Verification and Validation. internal. Project quality management. Norman E. Software product metrics. Project quality control. Costs of software quality. Software Supporting life cycle processes. McGraw-Hill Inc. Shari L. 2. Text and Reference Books 1. 4. .. IEEE Std 730 – Software Quality Assurance Plans. software quality characteristics and sub-characteristics. The components of the software quality assurance system.1 – Guide to Software Quality Assurance Planning. 3. their interrelations and relationships with the Development process activities according to ISO and IEEE standards. IEEE Standards: Software Engineering. Software Quality and Its Assessment Software quality and its models. software products and their characteristics. Galin Daniel. Software testing – implementation. Documentation control. ISO 9000-3:2004 – Software Engineering – Guidelines for Application of ISO 9001:2000 to Computer Software. From theory to implementation. Standards. Assuring the quality of software maintenance components. Pre-Project Software Quality Components Contract review. Quality Assurance. Patton Ron. Reviews. Software quality assurance project processes standards ISO/IEC 12207 and IEEE Std 12207. Volumes One–Four. Fenton. The ISO software quality model. Project integration management.0 – Software Life Cycle Processes. Pearson Education Inc. IEEE Std 1028 – Reviews. Software Engineering: Practitioner's Approach. Management Components of Software Quality The Software Management process. Pfleeger. Software Testing. Software quality measurement and assessment. Kan Stephen H. SAMS Publishing.

Timing Correctness. Regression. Simulator Taxonomy and Comparison. Limitations of Formal Verification. Equivalence Checking and Symbolic Simulation Binary Decision Diagrams. Clock Generation and Synchronization. Prentice Hall. Property Checking. Simulator Operations and Applications.“ Hardware Design Verification: Simulation and Formal Method-Based Approaches”. Response Assessment. Debugability and General Tool Compatibility. Specifications and Logic. Cycle based Simulation. Hardware Simulation Emulation. Assertions and Coverage Hierarchical Verification. Initialization Mechanism. Simulation Performance. Design and Use of a Linter. Synthasizability. Test Plan. Scope Reduction and Bug Tracking. Symbolic CTL Model Checking. Symbolic Computation and Model Checking. Basic Verification Principle. Isolation of Underlying Causes. Partially Ordered Set and Lattice. Stimulus Generation. William K Lam. Decision Diagram Variants. Test Bench Organization and Design Anatomy of a Test Bench and a Test Environment. Verification Utility. .L 3 T 0 P 0 C 3 CS-424(a) FORMAL VERIFICATION Introduction to Design Verification Design Verification. Boolean Functions and Representations. Pseudorandom Test Generator. Test Bench-to Design Interface. Simulator Architectures and Operations Compilers. Release Mechanism and Tape-out Criteria. Text and Reference Books 1. Test Scenarios. Simulation Data Dumping. Boolean Satisfiability. Incremental Compilation. Simulators. Formal Verification Preliminaries Sets and Operations. Coding for Verification Functional Correctness. Portability and Maintanability. Symbolic Simulation. Simulation Based versus Formal Verification. Two-state and Four-state Simulation. Finite State Automata and Languages. Relation. Model Checking and Symbolic Computation Properties. Common Practical Techniques and Methodologies. Using Model-checking Tools. Computational Improvements. Debugging Process and Verification Cycle Failure Capture. Assertions. Design Update and Maintenance Revision Control. Partition. Verification Coverage. Boolean Functional Operators. Decision Diagrams. Decision Diagram based Equivalence Checking. Verification Methodology.

Jaiswal. “ E-Commerce”. Raymond Lee. market research. David King.“Frontiers of electronic commerce”. Corporate Digital Library Document Library. digital Document types. Commerce Catalogues. Automation Customization and internal Commerce. John Wiley. Electronic payment systems Digital Token-Based. Galgotia. Consumer Search and Resource Discovery Information search and Retrieval. Kenneth C. H. Consumer Oriented Electronic commerce Mercantile Process models. Pearson.Kalakata. Desktop video processings. Supply chain Management.Schneider . “Electronic Commerce”. Tharam Dillon. Efrain Turbon.Thomson.Michael Chang. E-Commerce Consumer applications. Desktop video conferencing. 2. Gary P. Ellizabeth Chang . Text and Reference Books 1. “E-Commerce . 3. anatomy of E-Commerce applications. Risks in Electronic Payment systems.Information based marketing. Information Filtering. “E-Commerce fundamentals and applications”. S. 4. ECommerce organization applications. Carol Guyerico Traver. 5. Society”. on-line marketing process. “ E-Commerce”. . EDI Implementation. Credit Cards.L 3 T 0 P 0 C 3 CS-424(b) E-COMMERCE Electronic Commerce Frame work. Digital Video and electronic Commerce. Value added networks.Taudon. Advertising on Internet.Business. Hendry Chan. corporate Data Warehouses. Smart Cards. Intra Organizational Commerce Work Flow. Whinston. Multimedia Key multimedia concepts. Technology. Advertising and Marketing . Jae Lee. Inter Organizational Commerce EDI. 6.

Scaling storage with virtualization. FCIP. IP Storage IP storage standards (iSCSI. time mapping. serial data transfer vs. replacing a server with storage networks. Tom Clark. characteristic of fibre channel. parallel data transfer. Links. Cisco Press. In-band& Out-band management. Evolution of storage. Management of storage Networks Management of storage network. iSNS). Linear tape technology. I/O techniques I/O path from CPU to storage systems. Role of ILM. NAS architecture. Tape media. Hot swapping. Addison Wesley. problem caused by data proliferation. Applications. comparison of RAID levels. parameters related with storage. 2. "Designing Storage Area Networks: A Practical Reference for Implementing Fibre Channel and IP SANs". core concepts. Information value vs. Interoperability of FCSAN. Five pillars of IT. IPSAN products. components. and Filing Systems". basic storage management skills and activities. RAID& RAID levels. Technical & Physical components for building datacenters. performance of San virtualization. Subsystems. SCSI technology – basics & protocol. iFCP. Symmetric and asymmetric virtualization. Hard disks and Internal I/O channel. Hierarchical storage management. ports & topologies. Information life cycle management (ILM). FC products. JBOD. definition. products. elements & connectivity. Storage infrastructure component. Fibre channel Fibre channel. Management. virtualization on various levels of storage network. SCSI and storage networks. Fibre channel protocol stack. Storage centric IT architecture & advantages. R. Tape drives Introduction to tape drives. Standardized and proprietary mechanism. Marc Farley. advantages and disadvantages. Text and Reference Books 1. McGraw-Hill. Helical scan tape technology. Storage Virtualization Introduction to storage virtualization. Disk subsystems."Storage Networks: The Complete Reference". SNMP protocol. introduction to infiniband. "Storage Networking Fundamentals: An Introduction to Storage Devices.CS-424(c) STORAGE TECHNOLOGIES L 3 T 0 P 0 C 3 Introduction to Storage Technology Introduction to storage network. requirements of management systems. Architecture of disk subsystem. NAS Evolution. RAID parity. Technologies for Storage network Server centric IT architecture & its limitations. Limitations of SCSI. Caching : acceleration of hard disk access. Management interfaces. Tape drive performance. Security in IP SAN. Addressing in fibre channel. data proliferation. Hot sparing. Intelligent Disk subsystem architecture. Spalding. . Architecture of Infiniband. caring for Tape& Tape heads. 3. Data transport in fibre channel. Designing of FC-SAN. Introduction to Datacenters.

Markov chains.A. server and attacker models (roles) in protocols. . Ryan and S. Isabelle theorem prover. how to create an abstract model and code it up in Murphi. Murphy and its theoretical basis. Probabilistic fair exchange Protocol Verification by the Inductive Method Protocol analysis using theorem proving. actors and mal-actors of protocols. Snyder. Modeling and analysis of security protocols. Inductive proofs. the role and objectives of protocols. Strand Spaces and the MITRE tool suit. Distributed computing. The Intermediate form (IM) and the Temporal Logic of Actions (TLA) Communicating Sequential Processes (CSP) and Its Underlying Synchronization Models Using CSP to specify security properties. Needham Schroder example. The three –layered design of AVISPA and its runtime. Probabilistic Model Checking Crowds System. Security objectives. An introduction to the tool. SSL/TLS Case Study: Starting with the RFC describing the protocol. P.A.Y. Probabilistic observational equivalence. Process calculus. security analysis. NRL protocol analyzer of Meadows and Millen and the Multi-set rewriting method (MSR) of Cervesato et al. specify security properties.L 3 T 0 P 0 C 3 CS-424(d) SECURITY PROTOCOL ANALYSIS Introduction Computer Security. Cryptographic protocol. The inductive assertion method of Paulson. Addison-Wesley. Probabilistic poly-time analysis. PRISM. HoL and PVS Probabilistic Polynomial-Time Process Calculus for Security Protocol Analysis Equivalence-based specification of correctness. PCTL logic. Verifying the Secure Electronic Transactions (SET) protocols using Isabelle. FDR tool. Details of High-Level Protocol Specification Language (HLPSL). Dolev-Yao Models The AVISPA framework and its specification of client. Security of encryption schemes. Text and Reference Books 1. and run Murphi to check whether security properties are satisfied. Probabilistic notions of anonymity.

William Stalling. Extended MIPS pipeline to handle Multi-cycle operations. Translation look aside buffer. MIPS architecture and its Instruction format. MFLOPS. Superscalars. Operand storage memory addressing. MIMD and SIMD machines. Arrays. Text and Reference Books 1. Memory System Architecture Principles of Locality. Packet routing. Basic Pipeline for MIPS. Organization for improving main memory. Instruction Set Design Classification of Instruction set architectures. Microprogrammed Control. Message passing architectures. Superpiplined Design. Wide memory. Instruction Level Parallel Processors Division of responsibilities between hardware and software. Register renaming. Processor Implementation Techniques Processor data path. Benchmarking. Trace Scheduling. Vector processors. Superscalar pipelining design. Control for MIPS. Torii. Kai Hwang. Interrupts and other entanglements. David Peterson. Caches. Type and size of operands. Pipelining What is Pipelining. Inc. Basic steps of execution. 2. Amdahl’s Law. Hennessy. Worm Hole Routing. Data flow architectures. Cost considerations. Write-through and Writeback. General pipelines and reservation stations. Tomasulo’s Algorithm. Meshes. Systems attributes to performance. Instruction prefetch. Interleaved memory. VLIWs. Vector Length. Principles of Memory hierarchy. Predicated Execution. Hypercubes. Dynamic scheduling around hazards with a scoreboard. Quantitative principles of computer design. Hardwired Control. Interconnection Networks. Loop unrolling. Pipeline Hazards. D–cache. Virtual memory. Register Windows. Multi-threaded architectures. Software Pipelining. Shared memory processor. Prediction of control flow. “Advanced Computer architecture”. Multiprocessor Flynn’s classification. Scalability. Role of high level languages and Compilers. 3. Cache coherence and memory consistency. Latency analysis and Collision Free Scheduling. “A quantitative approach”. Independent architectures. Cache organization.L 3 T 1 P 0 C 4 CS-426 COMPUTER ARCHITECTURE AND ORGANIZATION Introduction Elements of modern computers. Morgan Kaufmann Publisher. McGraw Hill Publishing Co. . Operation in the instruction set. DRAM. Dynamic Interconnection Networks. Sectored cache. Multiple-level cache. “Computer Architecture”. John L. I-cache. MIPS. Chaining.

Adaptive Delta Modulation. Pulse Code Modulation (PCM). generation of FM (direct and indirect method). Differential Pulse Code Modulation (DPCM). QPSK. representation of AM. Text and Reference Books 1. Pulse Position Modulation (PPM). 3. Frequency-Shift Keying (FSK).L. Pulse Width Modulation (PWM). 5. Angle Modulation Frequency spectrum of Frequency Modulation (FM) and Phase Modulation. Taub and D. representation of signals and systems. switched communication systems. Time Division Multiplexing (TDM). AM detector. 4. Digital Modulation Techniques Quantization process. power relations in the AM wave. Earth station. Schilling Principles of Communication Engineering: Anokh Singh . Frequency Division Multiplexing (FDM). Super heterodyne receiver. 2. sources of information.L T P C EC-316 COMMUNICATION ENGINEERING Introduction to Communications Systems Communication process. communication channels. frequency spectrum of the AM wave. Electronic Communication Systems: George Kennedy Communication Systems : Simon Haykin An Introduction to Analog and Digital Communications: Haykin Principles of Communication Systems: H. Continuous-wave Modulation Amplitude modulation (AM). CDMA. Advanced Communication Satellite communications. Pulse Modulation Sampling process. vestigial side-band modulation. demodulation of FM signal. Radio receiver Tuned Radio-Frequency (TRF) receiver. Delta Modulation (DM). Phase-Shift Keying (PSK). Pulse Amplitude Modulation (PAM). Amplitude – Shift Keying (ASK). base band and pass band signals.