1

B.TECH-I.T.

PROGRAMME STRUCTURE- 2012-16

III-SEMESTER

IV-SEMESTER

Course

Code Course Name L T P C

Course

Code Course Name L T P C

MA1302 Engg. Mathematics-III 3 1 0 4

MA1402 Engg.

Mathematics-IV 3 1 0 4

CS1301 Computer Organization &

Architecture 3 1 0 4

CS1401 Operating Systems 3 1 0 4

CS1302 Switching Theory & Logic

Design 3 1 0 4

CS1402

Relational

Database

Management

Systems

3 1 0 4

CS1303 Data Structures 3 1 0 4

CS1403 Microprocessors 3 1 0 4

CS1304 Object Oriented

Programming using Java 3 1 0 4

----- Open Elective-I 3 0 0 3

CS1330 Switching Theory & Logic

Design Lab 0 1 2 2

CS1430

Operating Systems

Lab 0 1 2 2

CS1331 Data Structures Lab 0 1 2 2

CS1431

Relational

Database

Management

Systems Lab

0 1 2 2

CS1332

Object Oriented

Programming using Java

Lab

0 1 2 2

CS1432 Microprocessors

Lab 0 1 2 2

TOTAL 15 8 6 26

TOTAL 15 7 6 25

V-SEMESTER

VI-SEMESTER

Course

Code Course Name L T P C

Course

Code Course Name L T P C

CS 1501 Design & Analysis of

Algorithms 3 1 0 4

IT 1601

Automata &

Complier Design 3 1 0 4

IT 1502 Software Engineering &

Project Management 3 1 0 4

CS 1602

Computer

Networks &

Protocols

3 1 0 4

IT 1503 Data Mining & Warehousing 3 1 0 4

CS 1603 Parallel Processing 3 1 0 4

IT 1504 Data Communications 3 1 0 4

IT 16XX Program Elective-I 3 0 0 3

IT 1505 Internet Technology &

Applications 3 1 0 4

IT 16XX

Program Elective-

II 3 0 0 3

CS 1530 Design and Analysis of

Algorithms Lab 0 1 2 2

------

Open Elective-II 3 0 0 3

IT 1531 Internet Technology &

Applications Lab 0 1 2 2

CS 1630

Computer

Networks &

Protocols Lab

0 1 2 2

CS 1532 Software Engineering Lab 0 1 2 2

IT 1631 Compiler Design

Lab 0 1 2 2

TOTAL 15 8 6 26

CS 1632 Parallel Processing

Lab 0 1 2 2

TOTAL 18 6 6 27

2

VII-SEMESTER

VIII-SEMESTER

Course

Code Course Name L T P C

Course

Code

Course

Name L T P C

MB 1721 Essentials of Management & Engineering

Economics 3 1 0 4

IT 1881 Major

Project - - - 20

IT 1701 Mobile Communication & Computing 3 1 0 4

TOTAL 0 0 0 20

IT 1702 A.I. & Soft Computing 3 1 0 4

IT 17XX Program Elective-III 3 0 0 3

IT 17XX Program Elective-IV 3 0 0 3

IT 1730 Mobile Communication & Computing Lab 0 1 2 2

IT 1731 A.I. & Soft Computing Lab 0 1 2 2

IT 1779 Mini Project - - - 4

TOTAL 15 5 4 26

VI Semester Programme Electives

VII Semester Programme Electives

Course

Code Course Name

Course

Code Course Name

CS1651 Digital Image Processing

CS 1652 Distributed Systems

IT1652 Software Testing

IT1751 Multimedia Systems

CS1653 Cloud Computing & Infrastructure

Services

IT1752 Human Computer

Interaction

IT1654 Information Storage & Management

CS1752 Cryptography & Network

Security

IT1655 Information Theory & Coding

CS 1701 Big Data Analytics

IT1656 Digital Signal Processing

IT1755 Real Time Systems

IT1756 Enterprises Resource

Planning Systems

Open Electives

CS 1503 Computer Graphics

Course

Code Course Name

IT1758 Parallel Algorithms

IT1490 Data Structures

CS 1503 Computer Graphics

IT 1691 E-Commerce

3

SYLLABI

MA1302 ENGINEERING MATHEMATICS-III [3 1 0 4]

Boolean Algebra, subalgebra, Direct product & Homomorphism, Lattices and Algebraic

Systems, properties of Lattices and related theorem, Statements and Notations, Tautologies and

contradictions, equivalence of formulas, Tautological implications, Theory of inference, rules of

inference, statement function, variables and quantifiers, Predicate Calculus, Permutations and

Combinations, Generating function, Principle of inclusion and exclusion, Partitions,

compositions, Lexicographical and Fikes ordering of permutations, Algorithms for generating

functions, Graph theory, path, cycle, Basic theorems, Dijkstra’s Algorithms, Group theory,

semigroups and monoids, Permutation groups, cyclic groups.

Text Books:

1. J. P. Tremblay and R. Manohar, Discrete Mathematics Structures with Application to

computer Science, Tata Mc Graw Hill, 2001.

References:

1. C. L. Liu, Elements of Discrete Mathematics, Mc Graw Hill, 2008.

2. E. P. Page and L. B. Wilson, An introduction to computational combinatorics, Cambridge

Univ. Press, 1979.

4

CS1301 COMPUTER ORGANIZATION AND ARCHITECTURE [3 1 0 4]

Basic Structure of computers: Computer types, functional units, basic operational concepts,

bus structures, software, performance; Machine Instructions and programs: Numbers,

arithmetic operations and characters, Memory locations and addresses; Memory operations,

Addressing modes; Arithmetic: Addition and subtraction of signed numbers, Adders, ALU

design, Bit slice processor, Multiplication of positive numbers Signed operand multiplication,

Fast multiplication, Integer division, Floating point numbers and operations; Memory Systems:

Introduction, Basic concepts, Design methods; RAM memories, Read only memories, Speed

size and cost, Cache memories, Performance considerations, Virtual memories, Memory,

Management Requirements, Secondary storage; Input/Output organization: Accessing I/O

devices, Interrupts, Direct memory access, Buses, Interface circuits

References:

1. C. Hamacher, Z. Vranesic, “Computer Organization”, TMH, 2002.

2. W. Stallings, “Computer Organization and Architecture – Designing for Performance”, PHI,

2009.

5

CS1302 SWITCHING THEORY & LOGIC DESIGN [3 1 0 4]

Introduction to logic circuits: Variables and functions, Inversion, Truth tables, Logic gates and

networks, Boolean algebra, Introduction to VHDL; Optimized implementation of logic

functions: Synthesis using AND OR and NOT gates, Karnaugh map, Strategy for minimization,

Minimization of POS forms, Incompletely Specified Functions, Multiple output circuits NAND

and NOR logic networks, multilevel NAND and NOR circuits, Analysis of multilevel circuits;

Number representation and arithmetic circuits: Positional number representation, Addition of

unsigned numbers, Signed numbers, Fast adders, Design of arithmetic circuits using VHDL,

BCD representation; Combinational-Circuit building blocks: Multiplexer, decoder, Encoder,

Code converter, Arithmetic comparison circuits, VHDL for Combinational Circuits; Flip Flops,

Registers, Counters; Overview of semiconductor diode: BJT, MOSFET, TTL–standard, High

speed, low-power, low-power schottky, CMOS logic-NAND, NOR

References:

1. S. Brown and Z. Vranesic, “Fundamentals of Digital Logic with VHDL Design”, TMH,

2000.

2. M. Mano, “Digital Design”, PHI Pvt. Ltd., 3rd Edition, 2000.

3. P. Leach, A. Malvino, G. Saha, “Digital Principles and Applications”, TMH, 6th Edition,

2006.

4. J. Bhasker, “A VHDL Primer”, PHI Pvt. Ltd., 3rd Edn, 2005.

6

CS1303 DATA STRUCTURES [3 1 0 4]

Introduction: Algorithm specification; Performance Analysis: Time and Space Complexity,

Asymptotic notation; pointer declaration and definition, memory allocation functions, array of

pointers; The type definition, enumerated types, accessing structures, complex structures, arrays

of structures, structures and functions; Recursive definition & processes, Recursion in C, writing

recursive programs efficiency of recursion, Examples: Tower of Hanoi, GCD, Fibonacci

Definition and examples, Representing stacks in C, Evaluation of expressions, multiple stacks

and queues; Applications: infix, postfix and prefix and their conversions Linked lists

representations, Singly, doubly, header node, circular, Applications: linked stacks and queues,

polynomial and long integer arithmetic, union, intersection, Basic terminologies, binary tree

representation, recursive/ non recursive, Binary search tree, AVL trees; Applications:

Expression trees, inserting, deleting, searching, height of BST Terminology and representations,

Graph operations, spanning trees, minimum cost spanning tree, shortest path and transitive

closure, Binary and linear search, insertion, quick, merge, heap, radix sort Static Hashing

References:

1. A. Forouzan, R. F. Gilberg, “A Structured Programming Approach Using C”, Thomson, 2003.

2. A. Tenenbaum, J. Augenstein, “Data Structures using C”, Pearson Education, 2006.

3. E. Horowitz, S. Sahni, “Fundamentals of Data Structures in C”, Silicon Press, 2nd Edn, 2007.

7

CS1304 OBJECT ORIENTED PROGRAMMING USING JAVA [3 1 0 4]

The History and Evolution of java: The Creation of Java, how java changed the internet,

Java’s Magic, Servlets, The java Buzzwords; An Overview of Java, arrays; Introduction to

classes: Class fundamentals, declaring objects, Assigning Object reference variables,

Introduction to methods, Constructors, this keyword, Garbage collection, finalize() method,

Overloading, objects as parameters, argument passing, returning objects, recursion, access

control, final, nested and inner classes, string class; I/O Basics: Reading Console Input, Writing

Console Output, Files, Applet fundamentals; Inheritance: basics, super, multilevel hierarchy,

overriding, abstract classes, final with inheritance; Packages and Interfaces, Exception Handling,

Multithreaded programming; String Handling, Applet Class, Event Handling; Introduction to

AWT: Classes, component, Container, Panel, Window, frame, Canvas, working with frame,

working with Graphics, using AWT Controls.

References:

1. Herbert Schildt , “The Complete Reference Java Eight Edition”, Tata McGraw-Hill, reprint

2011

2. Steven Holzner, “Java 2 programming black book” , Dream Tech, New Delhi, reprint: 2005.

8

CS1330 SWITCHING THEORY& LOGIC DESIGN LAB [0 1 2 2]

Simulation of the following logic circuits using VHDL code MAX+ and Verification of logic

gates and Boolean algebra; Boolean algebra, Simplification of expressions using Kmap.

Experiments on multilevel NAND, NOR circuits; Arithmetic circuits; multiplexers and

Multiplexer Applications.

References:

1. S. Brown and Z. Vranesic, “Fundamentals of digital logic with VHDL design”, TMH, 2000.

2. J. Bhasker, “A VHDL Primer”, PHI Pvt. Ltd., 3rd Edition, 2005.

CS1331 DATA STRUCTURES LAB [0 1 2 2]

Review of C and programs on Recursion, Stacks, Stacks, Queues, lists, Trees, Graphs, using C

language.

References:

1. A. Forouzan, R. F. Gilberg, “A Structured Programming Approach Using C, Thomson”, 2nd

Edition, 2003.

2. A. Tanenbaum, J. Augeustein, “Data Structures using C”, Pearson Education, 2006.

3. E. Horowitz, S. Sahni, “Fundamentals of Data Structures in C”, Silicon Press, 2nd Edition,

2007.

9

CS1332 OBJECT ORIENTED PROGRAMMING USING JAVA LAB [0 1 2 2]

Control statements and arrays, Stacks and Lists, Strings, Classes and methods, Inheritance,

Packages, Interfaces, Exception Handling, Threads, Input/Output, Event Handling, Applets,

involving AWT, Programs involving AWT

References:

1. Herbert Schildt , “The Complete Reference Java Eight Edition”, Tata McGraw-Hill,

reprint 2011

10

Semester -IV

MA1402 ENGINEERING MATHEMATICS-IV [3 1 0 4]

Probability, distributions, Moment generating functions, functions of random variables, F and T

distributions, Sampling distribution, Central limit theorem, Point estimation, MLE, interval

estimation, Test of Hypothesis, significance level, certain best tests, Stichastic process,

classification of statistics of stochastic process, stationary and Ergodic process.

Text Books:

1. P. L. Meyer, Introduction to Probability and Statistical Applications, Addison-Wesley

Pub. Co., 1970.

References:

1. K. S. Trivedi, Probability, Statistics with Reliability, Queuing and computer science

applications, PHI, 2002.

2. Miller, Fruend and Johnson, Probability and Statistics for Engineers, PHI 2009.

CS1401 OPERATING SYSTEMS [3 1 0 4]

Introduction: Functions, Operating System Structure and Operations, Process Management,

Memory Management, Storage Management, Protection and Security, Special Purpose Systems,

Operating System Services, User Operating System Interfaces, System Calls, Types of System

Calls, System Programs, Operating System Structure, Virtual Machines, System Boot;

Processes: Concept, Process Scheduling, Operations on Processes, Inter-process Communication

11

Overview, Multithreaded Models, Thread Libraries, Threading Issues, Linux Threads, Basic

Concepts; CPU Scheduling: Scheduling Algorithms, Thread Scheduling, Linux Scheduling,

Algorithm Evaluation Background, Critical Section Problem; Memory management:

Contiguous Memory Allocation, Paging, Page Table Structure, Segmentation, Examples: The

Intel Pentium; Background, Demand Paging, Copy-On-Write, Page Replacement, Allocation of

Frames, Thrashing, Allocating Kernel Memory, Other Consideration; Files: Access Methods,

Directory Structure, File System, Access Matrix, Implementation of Access Matrix; Security

Problem: Program Threats, System and Network threats, User Authentication Design Principles,

Kernel Modules, Process Management, Scheduling, Memory Management, File Systems, Inter-

process Communication, Security

References:

1. A. Silberschatz, P. B. Galvin, “Operating System Concepts”, International student version,

Wiley India Student Edition, Eighth Edition, 2009.

2. W. Stallings, “Operating Systems: Internals and Design Principles”, Pearson Ed., 2009.

3. J. Harris, “Operating Systems”, Tata McGraw-Hill publications, 2002.

CS1402 RELATIONAL DATABASE MANAGEMENT SYSTEMS [3 1 0 4]

Introduction: Database-System Applications, Relational Databases, Database Design, Data

Storage and Querying, Transaction Management, Database Architecture; Relational Algebra:

Fundamental Relational-Algebra Operations, Extended Relational-Algebra Operations, Null

Values, Modification of the Database; SQL: Data Definition Language, Data manipulation

12

language , SQL Data Types and Schemas, Integrity Constraints, Basic Structure of SQL Queries,

Set Operations, Aggregate Functions, Null Values, Nested Sub-queries, Complex Queries,

Views, Modification of the Database, Joined Relations, Authorization, Overview of the Design

Process; The Entity-Relationship Model: Constraints, Entity-Relationship Diagrams, Entity-

Relationship Design Issues, Weak Entity Sets, Extended E-R Features; Hashing Techniques:

Dynamic Hashing; Transactions: Transaction State, Implementation of Atomicity and

Durability, Concurrent Executions, Serializability, Recoverability, Implementation of Isolation,

Testing for Serializability, Lock-Based Protocols, Log-Based Recovery, Recovery algorithms

References:

1. S. Korth, “Database System Concepts”, Mc-GrawHill, 6th Edition, 2011.

2. R. Elmasri, S. Navathe, “Fundamentals of Database Systems”, Pearson Education, 2006.

3. T. Connolly, C. Begg, “Database Systems–A Practical Approach to Design, Implementation

and Management”, Pearson Education, 3rd Edition, 2002.

.

CS1403 MICROPROCESSORS [3 1 0 4]

8086: internal architecture, programming the 8086, Addressing modes, Flags; Instruction Set:

assembler and Assembler directives, Simple sequence programs, Jumps and conditional jumps,

Loop instructions, Instruction timing and delay loops; String instructions, Writing and Using

Procedures and Macros, Interrupts and Interrupt Responses: 8259 Priority Interrupt

13

Controller, 8254 Software-Programmable Timer/counter; Software interrupts, DOS 21h

functions; Timing and Functional diagram: reset and wait state, Min and Max mode operation,

Min and max mode input, output timing diagrams; 8255: Programmable Parallel ports and

Handshake Input/ Output, 8087 Math Coprocessor, ISA Bus, PCI Bus, USB Bus, Accelerates

graphics port (AGP) Architecture, Real address and PVAM mode, Task protection and

Task Switching, Paging, Architecture, addressing modes, Instruction set, Simple assembly

language programs

References:

1. D. V. Hall, “Microprocessors and Interfacing”, TMH, Revised Second Edition, 2006.

2. B. B. Brey, “The Intel Microprocessors”, Seventh Edition, Prentice Hall India, 2005.

3. A. Clements, “Microprocessor system design 68000 Hardware”, Software, and Interfacing,

PWS Publishing Company, Third Edition, 1997.

CS1430 OPERATING SYSTEMS LAB [0 1 2 2]

Testing the use of UNIX commands, UNIX shell commands, Basics of Shell Programming,

UNIX System Calls, CPU Scheduling Algorithms, Deadlock Detection Algorithms, Deadlock

Avoidance Algorithms, Page Replacement Algorithms, Memory Allocation Algorithms, Disk

Scheduling Algorithms, UNIX Inter Process Communication.

14

References:

1. A. Silberschatz, P. B. Galvin, “Operating System Concepts”, International student version,

Wiley India Student Edition, Eighth Edition, 2009.

2. W. Stallings, “Operating Systems: Internals and Design Principles”, Pearson Ed., 2009.

3. J. Harris, “Operating Systems”, Tata McGraw-Hill publications, 2002.

CS1431 RELATIONAL DBMS LAB [0 1 2 2]

DB application development with MS Access, Experiments on DDL and Basic SQL, Advanced

SQL, ER diagrams using DIA tool, Data Integrity Constraints and Built-in Functions, Design and

Implementing the data requirements of a simple DB application, Experiments on Basic PL/SQL,

PL/SQL Exceptions and Transactions, PL/SQL Cursors, PL/SQL Procedures, Functions and

Packages, DB application development with Java as front end

References:

1. S. Korth, “Database System Concepts”, McGrawHill, 6th Edition, 2011.

2. R. Elmasri, S. Navathe, “Fundamentals of Database Systems”, Pearson Education, 2006.

3. T. Connolly, C. Begg, “Database Systems–A Practical Approach to Design”, Implementation

and Management, Pearson Education, 3rd Edition, 2002.

CS1432 MICROPROCESSORS LAB [0 1 2 2]

15

Basics of Assembly Programming, Programs using Addition, Subtraction and Branching

Instructions, Operations on BCD and ASCII data (Packing, Unpacking, Conversion between

BCD and ASCII), Multiplication and Division List Operations (Arrays)

String Operations, DOS and BIOS interrupts – String Operations DOS interrupts – Integer

Operations and file operations, Logic Controller Interfacing, DAC Interfacing

Elevator Interfacing

References:

1. Respective User Manual for the kit.

16

Semester-V

CS 1501 DESIGN & ANALYSIS OF ALGORITHMS [3 1 0 4]

Algorithm Analysis: A priori and a posteriori Analysis, Time Space Tradeoff, Asymptotic Notations,

Properties of asymptotic notations, Recurrence equations, Solving recurrence equations using

Substitution method and Master’s method; Divide and Conquer: Binary Search, Finding Maximum and

Minimum, Merge Sort, Quick Sort, Matrix Multiplication; Greedy Algorithms: Knapsack Problem, Job

Sequencing with deadline, Optimal Merge Pattern, Single Source Shortest Path, Minimum Cost Spanning

tree; Dynamic Programming: Multistage Graphs, Matrix Chain Multiplication, All-Pair shortest paths,

Optimal binary search trees, 0/1 Knapsack, Travelling salesperson problem, Graph Traversals, Connected

Components, Spanning Trees, Bi-connected components, Introduction to NP-Hard and NP-Completeness.

TEXT BOOKS:

1. E. Horowitz, S. Sahni, and S. Rajasekaran, “Computer Algorithms C++, Second Edition”,

Universities Press, 2007.

2. K.S. Easwarakumar, “Object Oriented Data Structures using C++”, Vikas Publishing House

Pvt. Ltd., 2000.

REFERENCES:

1. T. H. Cormen, C. E. Leiserson, R.L.Rivest, and C. Stein, "Introduction to Algorithms",

Second Edition, Prentice Hall of India Pvt. Ltd, 2003.

2. A. V. Aho, J. E. Hopcroft and J. D. Ullman, "The Design and Analysis of Computer

Algorithms", Pearson Education, 1999.

17

IT 1502 SOFTWARE ENGINEERING & PROJECT MANAGEMENT [3 1 0 4]

Introduction to Software Engineering, Software Components, Software Characteristics, Software Crisis,

Software Engineering Processes; Software Development Life Cycle (SDLC) Models: Water Fall

Model, Prototype Model, Spiral Model; Requirement Engineering Process: Analysis, Documentation,

Review and Management of User Needs, Data Flow Diagrams, Entity Relationship Diagrams, Decision

Tables, SRS Document, IEEE Standards for SRS; Basic Concept of Software Design, Architectural

Design, Low Level Design Modularization, Design Structure Charts, Pseudo Codes, Flow Charts,

Coupling and Cohesion Measures; Design Strategies: Function Oriented Design, Object Oriented

Design, Top-Down and Bottom-Up Design; Testing Objectives; Walk Through; Need for Maintenance,

Categories of Maintenance: Preventive, Corrective and Perfective Maintenance, Cost of Maintenance,

Software Re-Engineering, Reverse Engineering; The Management spectrum- (The people, the product,

the process, the project), Estimation of Various Parameters such as Cost, Efforts, Schedule/Duration,

Constructive Cost Models (COCOMO) and its types, SEI capability maturity model, Verification and

Validation, SQA Plans, Software Quality Frameworks, ISO 9000 Models.

TEXT BOOKS:

1. R. S. Pressman, “Software Engineering: A Practitioners Approach”, McGraw Hill, 2009.

2. R. Mall, “Fundamentals of Software Engineering”, PHI Publication, 2014.

3. K. K. Aggarwal and Y. Singh, “Software Engineering”, New Age International Publishers,

2008.

4. P. Jalote, “Software Engineering”, Wiley, 2010.

REFERENCES:

1. C. Ghezzi, M. Jarayeri and D. Manodrioli, “Fundamentals of Software Engineering”, PHI

Publication, 2002.

2. I. Sommerville, “Software Engineering”, Addison Wesley, 2013.

3. K aleh,”Software Engineering”, Cengage Learning, 2010.

4. P. Fleeger, “Software Engineering”, Macmillan Publication, 2009.

18

IT1503 DATA MINING & WAREHOUSING [3 1 0 4]

Data warehousing Components: Building a Data warehouse, Mapping Data Warehouse to a

Multiprocessor Architecture, DBMS Schemas for Decision Support , Data Extraction, Data Clean-up,

Data Transformation Tools, Metadata; Business analysis : Reporting and Query tools and Applications

,Tool Categories, The Need for Applications ,Congo’s & Impromptu; Online Analytical Processing

(OLAP): Need for Multidimensional Data Model, OLAP Guidelines, Multidimensional versus Multi-

relational OLAP, Categories of Tools ,OLAP Tools and the Internet; Data mining: Introduction Data,

Types of Data, Data Mining Functionalities ,Interestingness of Patterns, Classification of Data Mining

Systems , Data Mining Task Primitives, Integration of a Data Mining System with a Data Warehouse ,

Issues, Data; Pre-processing; association rule mining and classification: Mining Frequent Patterns,

Associations and Correlations Mining Methods, Mining Various Kinds of Association Rules ,

Correlation Analysis, Constraint Based Association Mining; Classification and Prediction : Basic

Concepts , Decision Tree, Induction , Bayesian Classification , Rule Based Classification , Classification

by Back propagation, Support Vector Machines Associative Classification , Lazy Learners, Other

Classification Methods, Prediction; clustering and applications and trends in data mining: Cluster

Analysis, Types of Data, Categorization of Major Clustering Methods: K-means, Partitioning Methods ,

Hierarchical Methods, Density Based Methods, Grid Based Methods , Model-Based Clustering- Web

Mining, Text Mining, Spatial Mining, Case study on Data mining with data sets.

TEXT BOOKS:

1. A. Berson and S. J. Smith, “Data Warehousing, Data Mining & OLAP”, Tata McGraw – Hill

Edition, Tenth Reprint 2007.

2. J.Han and M. Kambher, “Data Mining Concepts and Techniques”, Second Edition, Elsevier,

2007.

REFERENCES:

1. P. N. Tan, M. Steinbach and V. Kumar, “Introduction to Data Mining”, Person Education,

2007.

2. K.P. Soman, S. Diwakar and V. Ajay, “Insight into Data mining Theory and Practice”, Easter

Economy Edition, Prentice Hall of India, 2006.

19

IT1504 DATA COMMUNICATION [3 1 0 4]

Introduction: Network Models, Reference Models; Physical Layer and Media: Data and Signals,

Analog & Digital Transmission, Multiplexing, Transmission Media, Switching- Circuit, Datagram and

Virtual; Data Link Layer: Error Detection and Correction, Framing, Flow and Error Control Protocols,

HDLC, PPP; Queuing Models - Introduction & Little's Theorem, M/M/1, M/M/m, Queues. Networks of

Queues, M/G/1 Queues, M/G/1, Priority Queues; Multiple Access: Random Access- Aloha, CSMA,

CSMA/CD, CSMA/CA. Controlled Access- Reservation, Polling and Token Ring, Channelization- FDMA,

TDMA and CDMA, Wired LAN-Ethernet, Fast and Gigabit Ethernet; Wireless LAN- IEEE 802.11,

BLUETOOTH; Network Layer: Design Issues, Routing Algorithms- Shortest Path, Distributed and

Optimal Routing, Addressing; Network Devices: Hub, Repeaters, Bridges, Switches, Gateways and

Routers.

TEXT BOOKS:

1. T. Bertsekas, K. Dimitri, G. Gallager and T. Robert, “Data Networks” Second Edition. Prentice

Hall India, 2011.

2. A. S Tanenbaum., “Computer networks” Fifth Edition. Pearson Education, 2010.

3. B. Forouzan, “Data communication & networking” Fifth Edition. TMH, 2012.

REFERENCES:

1. L. Peterson and T. Davie “Computer Networks: A Systems Approach” Fifth Edition, Morgan

Kaufmann Publishers, 2012.

2. W. Stallings, “Data and Computer Communications” Ninth Edition. Pearson Education, 2010.

3. R. Stevens, “TCP/IP Illustrated”, Addison-Wesley Publication, 2011.

20

IT1505 INTERNET TECHNOLOGY [3 1 0 4]

Introduction: Evolution of Internet, Internet Applications, TCP/IP, Introduction to RFC; Addressing in

Internet : IP and Domains, Internet Service Providers, Types of connectivity such as dial-up, leased line,

VSAT etc; Introduction to World WideWeb: Evolution of World Wide Web, Basic features, WWW

browsers, WWW servers, HTTP & URL’s; HTML: Overview, Header Element, List, Hyperlinks, Tables,

Images, Forms, Frames, CSS; Introduction to Java Script: Object in Java Script, Dynamic HTML with

Java Script. Web application Development using Java-Introduction to Servlets, Lifecycle, JSDK, Servlet

API, Servlet Packages, HTTP package, working with Http request and response; JSP: Introduction to

JSP, JSP processing, JSP Application Design, Tomcat Server, Implicit JSP objects, Conditional

Processing, Declaring variables and methods, Error Handling and Debugging, Sharing data between JSP

pages- Sharing Session and Application Data; Database Connectivity: Database Programming using

JDBC, Studying Javax.sql.*package, accessing a database from a Servlet and JSP page.

TEXT BOOKS:

1. S. Allamaraju and C. Buest, “Professional Java Server Programming”, Wiley Publication, 2007.

REFERENCES:

1. A. Godbole, A.Kahate “Web Technologies” Tata McGraw Hill, 2013.

21

CS 1530 DESIGN AND ANALYSIS OF ALGORITHMS LAB [0 1 2 2]

Programs based on the divide and conquer technique: Quick sort, Merge sort, Heap sort, Binary

search, technique; Minimum spanning tree using prim’s algorithm; Knapsack problem using greedy

method; Shortest path using Floyd’s algorithm; Travelling sales man problem using the dynamic

programming approach; Graph coloring problem; Shortest path of the multistage graph using

dynamic programming; Selection sort using the brute force technique.

IT1531 INTERNET TECHNOLOGY & APPLICATION LAB [0 1 2 2]

Programing based on HTML, HTML with CSS, DHTML with JavaScript, Servlet, JSP and Database

Connectivity Web pages.

CS 1532 SOFTWARE ENGINEERING LAB [0 1 2 2]

Consider SRS of any project. Implement UML diagram like Use Case and Class diagram, object oriented

analysis diagram:, Activity diagram and Sequence diagram, interaction view diagram, State diagram and

Interaction diagram, Component diagram and Deployment diagram, Sequence diagram, Collaboration

diagram.

22

IT1601 AUTOMATA AND COMPILER DESIGN [3 1 0 4]

Automata introduction: Mathematical Preliminaries and Notation, Three basic concepts and Some

Applications on: Deterministic Finite Accepters, Nondeterministic Finite Accepters, Equivalence of

Deterministic and Nondeterministic Finite Accepters, Reduction of the Number of States in Finite

Automata. Regular Expressions, Identifying Non regular Languages. Introduction to Context-Free

grammars & writing grammars, Parsing and Ambiguity, Context-Free Grammars and Programming

Languages; Compiler Design: Language Processors, The Structure of a Compiler. The Role of the

Lexical Analyzer, Input Buffering, Specification of Tokens, Recognition of Tokens, The Lexical-

Analyzer Generator Lex. Top-Down Parsing, Bottom-Up Parsing, Introduction to LR Parsing: Simple

LR, More Powerful LR Parsers, Using Ambiguous Grammars, Parser Generators. Syntax-Directed

Definition, Construction of Syntax Trees. Variants of Syntax Trees; Three-Address Code, Types and

Declarations: Type Expressions, Type Equivalence; Translation of Expressions: Operations within

Expressions, Type Checking: Rules for Type Checking. Storage Organization, Stack Allocation of

Space, Issues in the Design of a Code Generator, The Target Language, Addresses in the Target Code,

Basic Blocks and Flow Graphs,

TEXT BOOKS:

1. A. V. Aho, Monica S. Lam, R. Sethi and J. D. Ullman, “Compilers Principles, Techniques and

Tools”, Pearson Education, 2006.

REFERENCES:

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

Revised Edition, 2001.

2. K.C. Louden, “Compiler Construction - Principles and Practice”, Thomson, India Edition, 2007.

23

CS1602 COMPUTER NETWORKS & PROTOCOLS [3 1 0 4]

Introduction: IPv4 Addresses Classfull addressing, other issues, Sub-netting Classless,

addressing, variable length blocks, Sub-netting, address allocation, IP Protocol: options,

checksum, Types of messages, message format, error reporting, Query, Checksum,

fragmentation, IP Package, ICMP Protocol: Messages, Debugging tools, Unicasting Protocols:

Unicasting routing, RIP: RIP Message Format ,Requests and Responses, Timers in RIP ,

Introduction to OSPF and BGP, Multicasting Protocol: IGMP : Group Management, IGMP

Messages, IGMP Protocol Applied to Host ,IGMP Protocol Applied to Router, Role of IGMP in

Forwarding ARP package & RARP: Introduction, packet format, Encapsulation, RARP:

Introduction, datagram, UDP Protocol: Process to process communication, User datagram,

checksum; UDP package, TCP Protocol :Introduction, TCP services, TCP features, segment,

TCP connection, State transition diagram, Flow control, Error control, Congestion control, TCP

timers, options, TCP package SCTP Protocol: SCTP features, packet format, association, state

transition diagram, flow control, error control, congestion control

TEXT BOOKS:

1. W. R Stevens, “TCP/IP Illustrated, Volume 1: The Protocols”, Addison-Wesley, 1994.

2. P. Loshin, “IPV6 Clearly Explained”, Morgan Kauffman, 1999.

REFERENCES:

1. B. A. Forouzan, “TCP/IP Protocol Suite”, Third Edition, TMH, 2005.

24

CS1603 PARALLEL PROCESSING [3 1 0 4]

Introduction: Heterogeneous Parallel Computing, Architecture of a Modern GPU, Parallel Programming

Languages and Models, History of GPU Computing , Introduction to Data Parallelism, Data parallelism

and CUDA C: Data Parallelism ,CUDA Program Structure , Device Global Memory and Data Transfer,

Kernel Functions and Threading; Data-Parallel Execution Model: Cuda Thread Organization, Mapping

Threads to Multidimensional Data, Matrix-Matrix Multiplication, Synchronization and Transparent

Scalability, Assigning Resources to Blocks, Thread Scheduling and Latency Tolerance; CUDA

Memories: Importance of Memory Access Efficiency, CUDA Device Memory Types Strategy for

Reducing Global Memory Traffic, Tiled Matrix, Memory as a Limiting Factor to Parallelism,

Performance Considerations; Performance Considerations: Warps and Thread Execution, Global

Memory Bandwidth, Dynamic Partitioning of Execution Resources, Instruction Mix and Thread

Granularity; Parallel Patterns: Convolution -1D/2D, Constant Memory and Caching, Prefix Sum, Sparse

Matrix vector Multiplication; Programming Models: Open ACC, CUDA FORTRAN, C++AMP, Thrust,

and important trends in heterogeneous parallel computing, CASE Studies.

TEXT BOOKS:

1. D. Kirk and W. Hwu, “Programming Massively Parallel Processors: A Hands on approach”,

Second edition, Morgan Kaufmann, 2013.

2. P.S. Pacheco, “An introduction to parallel programming”, Morgan Kaufmann, 2011.

REFERENCES:

1. S. Cook, “CUDA Programming: A Developer's Guide to Parallel Computing with GPUs”,

Morgan Kaufmann, 2013.

2. J. Sanders and E. Kandrot, “CUDA by example: an introduction to general-purpose GPU

programming”, NVIDIA Corporation, 2011.

25

CS1630 COMPUTER NETWORKS & PROTOCOLS LAB [0 1 2 2]

Programs on UNIX/LINUX file API's, Client-Server Programming using TCP and UDP, Implementation

of Data Encapsulation, De-capsulation, fragmentation in TCP/IP, Networking basics: (IN LINUX OS)

Basic Network Configurations: Assigning IP address, Subnet Mask, gateway address, LAN behind proxy,

Connecting to Internet Network Server Configurations: (IN LINUX OS) Web Server/Telnet/SSH Server,

FTP/TFTP Server, DHCP Server, DNS Server, Database Server (MySQL/PostGreSql), Squid etc.

IT 1631 COMPLIER DESIGN LAB [0 1 2 2]

Preliminary Scanning Applications, Design & Implementation of Lexical Analyzer, Design &

Implementation of Parser, Implementation of Code Generator, Programs using LEX, Programs using

YACC.

CS1630 PARALLEL PROGRAMMING LAB [0 1 2 2]

Recap of Dynamic Memory Allocation in CPU; Understanding Concepts of Threads in Java; Programs on

CUDA, Hello, World!, A kernel Call, Passing Parameters; Vector Additions, Matrix additions using

single block without shared memory and multiple block without shared memory, Dynamic memory

allocation in GPU; Dynamic Programming in CPU and GPU; Programs on single block shared memory

and multiple block shared memory; Case Study Projects on Parallel processing.

26

MB 1721 ESSENTIAL OF MANAGEMENT & ENGINEERING ECONOMICS [3 1 0 4]

Introduction to Financial Management: Scope & Functions of Finance, Role of Finance Manager,

Goals of Financial Management , Profit Maximization Vs Wealth Maximization, Organization of the

Finance Function ; Introduction to Accountancy: Accounting Principles and Conventions, Double Entry

system, Journal, Ledger, Trial Balance and Preparation of Final Account; Statement of Changes in

Financial Position: Preparation of Funds Flow Statement, Preparation of Cash Flow Statement, Analysis

of Financial Statement– Profitability Ratios, Turnover Ratios, Liquidity Ratios, Leverage and Financial

Ratios, Sensitivity Analysis; Capital Budgeting: Time Value of Money-Future value of a single cash

flow, Annuity, Present value of a single cash flow, Annuity, Present value of an Uneven Cash Flow,

Multi -Period Compounding, Capital Budgeting Decision, Methods of Appraisals – Discounting and Non

Discounting Techniques, Pay Back, ARR, NPV, IRR, Benefit Cost Ratio; Capital Structure: Capital

structure- Relevance of Capital Structure, Cost of Capital - Cost of Debt, Cost of Preference Capital, Cost

of Equity Capital, Weighted Average Cost of Capital; Theories of Capital Structure: EBIT Approach,

EBT Approach, MM Approach, Traditional Position, Capital Structure Decision - EBIT – EPS Analysis.,

Nature of Risk,. Financial Leverage, Operating Leverage, Combined Leverage; Working Capital

Management: Concept & Importance, Factors Influencing Working Capital Requirements, Operating

Cycle and Cash Cycle. Determinants of Working Capital, Working Capital Policy, Working Capital

Financing Policy; Dividend policy: Meaning & Forms of Dividend, Theory of Relevance- Walter’s

Model, Gorden’s Model, Theory of Irrelevance- Miller-Modigilani Model, Influencing Factors of

Dividend Policy.

TEXT BOOKS:

1. M.Y. Khan and P.K.Jain, “Financial Management”, Tata Mcgraw Hill Publication, 2011.

2. P. Chandra, “Financial Management”, Tata Mcgraw Hill Publication, 2011.

3. I. M. Pande, “Financial Management”, Vikash Publication, 2009.

REFERENCES:

1. K. Narayanaswamy, “Financial Accounting – A Managerial Perspective”, PHI, 2013

27

IT 1701 MOBILE COMMUNICATION & COMPUTING [3 1 0 4]

Course Objectives: To let the students know the basics of wireless/mobile communication and related

concepts and the working of mobile computing systems

Syllabus: Evolution of mobile radio communication, Transmission fundamentals; Modulation

techniques: Signal encoding criteria, Overview of ASK, PSK, FSK, MSK, Spread spectrum modulation;

Cellular concepts: Frequency reuse, Channel assignment strategies, Handoff strategies; Wireless LAN:

Overview of Wireless LAN Technology; Infrared LANS, Spread Spectrum LANs, Narrowband

microwave LANS; IEEE 802 Protocol Architecture, IEEE 802.11 Architecture and Services, IEEE 802.11

Medium Access Control and IEEE 802.11 Physical Layer. Bluetooth: Radio Specification; Baseband

Specification; Link Manager Specification; Logic Link Control and Adaptation Protocol; HiperLAN 1

and HiperLAN 2; Wireless Sensor Networks. Mobile Computing: Mobile IP, ubiquitous and nomadic

computing; Wireless LANS & the wireless world wide web; Mobile agent technology and standards;

Case studies :Agent TCL, aglets, PMADE, system design.

TEXT BOOKS:

1. T.S. Rappaport, “Wireless Communications - Principle and Practice”, Second Edition, PHI,

2005.

2. W. Stallings, “Wireless Communication and Network”,’ Second Edition, PHI, 2004.

3. K. Garg, “Mobile Computing”, Pearson Education, 2010.

REFERENCES:

1. R. Pandya “Mobile and Personal Communication systems and services”, PHI, 2001.

2. M. Ciampa, “Guide to Designing and Implementing wireless LANs”, Thomson learning, Vikas

Publishing House, 2001.

28

IT1702 ARTIFICIAL INTELLIGENCE & SOFT COMPUTING [3 1 0 4]

Fundamental Concepts: Agents, environments, general model; Problem solving techniques; Search

Techniques: Uninformed search, heuristic search, adversarial search and game trees; Solution of

constraint satisfaction problems using search; Knowledge Representation: Propositional and predicate

calculus, semantics for predicate calculus, inference rules, unification, Resolution, semantic networks,

conceptual graphs/Dependency, structured representation, frames, scripts; Prolog: Basic constructs,

answer extraction; Learning: Inductive learning, decision tree learning; Natural language processing:

introduction, parsing using context free grammars, Chomsky hierarchy, case grammar; Soft computing:

Fuzzy set theory: Fuzzy sets, set-theoretic operations, membership functions; Union, intersection and

complement, fuzzy rules, reasoning and interference; Neural networks: Perceptron, Back Propagation,

Hop field n/w’s, introduction to genetic algorithms.

TEXT BOOKS:

1. S. Russell and P. Norvig, “Artificial Intelligence: A Modern Approach”, PHI, 2011.

2. E. Rich, K. Knight and S.B.Nair, “Artificial Intelligence”, Third Edition, Tata McGraw Hill,

2009.

REFERENCES:

1. W. F. Clocksin and C. S. Mellish, “Programming in Prolog” Springer Verlag, 1981.

2. N. J. Nilsson, “Artificial Intelligence: A New Synthesis”, Morgan, 2009.

3. I. Bratko, “Prolog Programming for Artificial Intelligence”, Pearson Education, 2011.

29

IT 1730 MOBILE COMPUTING AND COMMUNICATIONS LAB [0 1 2 2]

.

Program related to Client and Server (TCP) programming using Java language; Simulation using

J2ME simulator of Midlet and other basic UI items, Bluetooth API, Wireless Messaging, MMAPI;

Simulation using Qualnet simulator: GSM, CDMA, Mobile IP, Wi-Max, and Wireless Network.

IT1731 ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING LAB [0 1 2 2]

Introduction to prolog: basic variable declaration, loops, inbuilt functions; Basic Programming using

prolog; using AI techniques in C/C++: Blocks world using global and local heuristics, Crypt

arithmetic, Travelling Salesman Problem using Branch & Bound/Nearest Neighbor; Character

recognition using Neural Networks; Optimization using Genetic Algorithms; Prolog as subset of

predicate calculus; Prolog querying as inference rule; Prolog syntax: simple and compound terms; 3

week mini project using Prolog.

IT1779 MINI PROJECT [- - - 4]

The objective of the project is to motivate them to work in emerging / latest technologies, help the student

to develop ability to apply theoretical and practical tools/techniques to solve real life problems related to

industry, academic institutions and research laboratories, this project will helps the student make ease and

provides enough experience to carry out the larger project in the eight semester

30

IT 1881 MAJOR PROJECT [ _ _ _ 20]

The duration of B.Tech final year project is one Semester along with coursework of 8th semester.

Students are required to undertake innovative and research oriented projects, which not only reflect their

knowledge gained in the earlier semesters but also additional knowledge gained from their own effort.

They must show the phase wise development of their project submitting the appropriate documents at the

end of each phase. The student must put in effort to find answers to questions about the applications,

which will also enhance the value of the project report. There will be one interim and one final seminar

for evaluation of the project.

31

VI SEMESTER PROGRAMME ELECTIVES

CS1651 DIGITAL IMAGE PROCESSING [3 0 0 3]

Introduction to computer Graphics & Digital Image Processing Systems: Geometry and line

generation, Graphics primitives, Transformations, Structure of human eye, Image formation in the human

eye, Brightness adaptation and discrimination, Image sensing and acquisition, Storage, Processing,

Communication, Display. Image sampling and quantization, Basic relationships between pixels; Image

Transform Introduction to Fourier transforms, DFT and 2-D DFT, Properties of 2-D DFT, FFT, IFFT,

Walsh transform, Hadamard transform, Discrete cosine transform, Slant transform, Optimum transform:

Karhunen - Loeve (Hotelling) transform; Image Enhancement in Spatial and Frequency Domain Gray

level transformations, Histogram processing, Arithmetic and logic operations, Spatial filtering:

Introduction, Smoothing and sharpening filters. Frequency domain filters: Smoothing and Sharpening

filters, Holomorphic filtering: Image Processing Fundamentals, Redundancies: Coding, Interpixel,

Psycho-visual, Fidelity criteria; Image compression models: Error free compression, Lossy compression,

Image compression standards: Binary image and Continuous tone still image compression standards,

Video compression standards; Image Segmentation with Image Representation & Description

Detection of discontinuities, Edge linking and Boundary detection, Thresholding, Region based

segmentation. Representation schemes, Boundary descriptors, Regional descriptor.

TEXT BOOKS:

1. R. C. Gonzalez, R. E. Woods, “Digital Image Processing”, 2nd Edition, Pearson Education 2008.

REFERENCES:

1. W. K. Pratt, “Digital Image Processing”, John Willey, 2001.

2. M. Sonka, V. Hlavac, R. Boyle, “Image Processing Analysis and Machine Vision”, Thompson

Learning, 1999.

3. A.K. Jain, “Fundamentals of Digital Image Processing”, PHI, New Delhi, 1995.

4. C. D.Magundar, “Digital Image Processing and Applications”, Prentice Hall of India, 2000.

32

IT1652 SOFTWARE TESTING [3 0 0 3]

Basics of software testing: Testing objectives, Principles of testing, Requirements, behavior and

correctness, Testing and debugging, Test metrics and measurements, Verification, Validation and Testing,

Types of testing, Software defect tracking; White box testing, static testing, static analysis tools;

Structural testing: Unit/Code functional testing, Code coverage testing, Code complexity testing, Black

Box testing, Requirements based testing, Boundary value analysis, Equivalence partitioning, state/graph

based testing, Model based testing and model checking, Differences between white box and Black box

testing; Top down and Bottom up integration: Bi-directional integration, System integration, Scenario

Testing, Defect Bash, Functional versus Non-functional testing, Design/Architecture verification,

Deployment testing, Beta testing, Scalability testing, Reliability testing, Stress testing; Acceptance

testing: Acceptance criteria, test cases selection and execution; Regression testing, Regression test

process, Initial Smoke or Sanity test, Selection of regression tests, Execution Trace, Dynamic Slicing,

Test Minimization, Tools for regression testing; Ad hoc Testing: Pair testing, Exploratory testing,

Iterative testing, Defect seeding. Test Planning, Management, Execution and Reporting; Software Test

Automation: Scope of automation, Design & Architecture for automation, Generic requirements for test

tool framework, Test tool selection, Testing in Object Oriented Systems, Case Study on software testing.

TEXT BOOKS:

1. S. Desikan ,G. Ramesh, “Software Testing: Principles and Practices”, Pearson Education, 2006.

2. Aditya P. Mathur, “Fundamentals of Software Testing”, Pearson Education, 2008.

REFERENCES:

1. K. K. Aggarwal, Y. Singh, “Software Engineering”, Third Edition, New Age International

Publication, 2008.

2. K.Perry, “Effective Methods for Software Testing”, John Wiley & Sons, 1995.

3. B. Beizer, “Software Testing Techniques”, Second Edition, Wiley-Dreamtech India, 2003.

33

CS1653 CLOUD COMPUTING & INFRASTRUCTURE SERVICES [3 0 0 3]

Introduction to Clouds and Cloud Computing: Basic Concepts, Cloud Classifications, and Types of

Services, deployment models; Classic Data Center (CDC): DBMS concepts, CDC drawbacks and need

of Cloud Resources, CDC Management and case studies; Virtualized Data Center (VDC): Compute and

Storage, Compute virtualization overview, Compute virtualization techniques, Virtual Machines, VM

Resource management techniques, Physical to virtual conversion, Hypervisor Management Software,

Virtual Infrastructure Requirements; Storage: Storage virtualization overview, Virtual Machine Storage,

Block level and File level virtualization, Virtual provisioning and automated storage tiering; Networking:

VDC networking overview, VDC networking components , VLAN and VSAN technologies, Network

traffic management, Exercise – VDC networking; Desktop and Application: Desktop virtualization ,

Application virtualization, Business Continuity in VDC, Fault tolerance mechanism in VDC, Backup in

VDC, Replication and migration in VDC, Cloud infrastructure and service creation, Cloud service

management; Cloud Security: Security basics, Cloud security concerns and threats, Cloud security

mechanisms, Access control and identity management in Cloud, Governance, risk, and compliance,

Security best practices for Cloud, Cloud Migration; Issues in Cloud Considerations: Migration

Considerations, Security issues at different phases to adopt the Cloud.

TEXT BOOKS:

1. Course materials from EMC² Education Services

2. Miller M., “Cloud Computing”, 8th Edition, Que Publishers 2008.

3. Buyya R. K., “Cloud Computing: Principles and Paradigms”, Wiley Press, 2011.

REFERENCES:

1. K. Saurabh, “Cloud Computing”, 2nd Edition, Wiley India

2. V. Joysula, M. Orr, G. Page, “Cloud Computing: Automating the Virtualized Data Center”, Cisco

Press, 2012.

3. Rittenhouse J. N., James F R, “Cloud Computing: Implementation, Management and Security”,

CRC Press 2012.

34

IT1654 INFORMATION STORAGE & MANAGEMENT [3 0 0 3]

Introduction to Information Storage and Management: Evolution of Storage Technology and

Architecture, Data Center Infrastructure, Information Lifecycle, Storage System Environment, Disk Drive

Laws Governing Disk Performance, Logical Components, Application Requirements and Disk

Performance, Data Protection; RAID: Implementation, RAID Components, RAID Levels, RAID

Comparison, RAID Impact on Disk Performance, Hot Spares, Intelligent Storage System, Components,

Intelligent Storage Array, EMC CLARiiON and Symmetrix; Direct Attached Storage and Introduction

to SCSI: Types of DAS, Benefits and Limitations, Introduction to Parallel SCSI, SCSI Command Model,

Storage Area Networks, The SAN and Its Evolution, Components of SAN, FC Connectivity, Fiber

Channel Ports, World Wide Names, Zoning, Fiber Channel Login Types, FC Topologies, EMC

Connectrix; Network Attached Storage: Benefits of NAS, Components of NAS, NAS Implementations,

NAS File-Sharing Protocols, EMC Celerra; Content-Addressed Storage: Fixed Content and Archives,

Types of Archives, Features and Benefits of CAS, CAS Architecture, Object Storage and Retrieval in

CAS, CAS Examples; EMC Centera: Storage Virtualization, Forms of Virtualization, Storage

Virtualization Configurations, Storage Virtualization Challenges, Types of Storage Virtualization;

Backup and Recovery: Backup Purpose, Backup Considerations, Backup Granularity, Recovery

Considerations, Backup Methods, Backup Process, Backup and Restore Operations, Backup Topologies,

Backup in NAS Environments, Backup Technologies, EMC NetWorker, Local Replication, Remote

Replication.

TEXT BOOKS:

1. G. Somasundaram, A.Shrivastava, “ Information Storage and Management Storing,

Managing,and Protecting Digital Information”, EMC Education Services, Wiley India Edition,

2009.

2. M. Farley, “Storage Networking Fundamentals”, CISCO Systems, First edition, 2004.

REFERENCES:

1. R. Spalding, “Storage Networks: The Complete Reference“, Tata Mcgraw Hill, 2003.

2. M. F. Osborne, “Building Storage Networks”, Second edition, Tata McGraw Hill, 2001.

35

IT1655 INFORMATION THEORY & CODING [3 0 0 3]

Mathematical Theory of Foundation of Information Theory in Communication system, Measures of

Information-Self information, Mutual Information, Average Information, entropy and its properties,

conditional entropy, Csiszar’s f-divergence measure and its applications; Discrete Memory less

channels: Classification of channels, calculation of channel capacity, Source Model and Coding,

channels Model and Coding, Problems of unique decipherable Codes, condition of Instantaneous codes,

Code word length, Kraft Inequality, Noiseless Coding Theorem; Construction of codes: Shannon-Fano

coding, Shannon Binary and Huffman codes, decoding scheme- the ideal observer; Error Correcting

Codes: Minimum distance principle. Relation between distance and error correcting properties of codes,

The Hamming bound, Parity checks Coding, Bounds on the error correcting ability of Parity Check

Codes; Linear Block Code: Coding & decoding of linear block codes, conversion of non- systematic

form of matrices into systematic form; Convolutional Code: Convolutional encoders of different rates,

Code tree, Trills & state diagram, Maximum likelihood decoding of convolutional code, The Viterbi

algorithm fee distance of a convolutional code; Cyclic Code: Introduction of cyclic code, its basic

properties & problems related to cyclic codes.

TEXT BOOKS:

1. R.B. Ash, “Information Theory”, Inter-science Publishers, 1990.

2. F. M. Reza, “An Introduction to Information Theory”, Tata McGraw-Hill, 2010.

36

IT1656 DIGITAL SIGNAL PROCESSING [3 0 0 3]

Discrete time signals and systems: Representation of discrete time signal – Classifications, Basic

operations, Properties Discrete time Fourier series – Discrete time Fourier transform. Z- transform; DFT

& its properties. Decimation in time and decimation in frequency FFT algorithms; IIR Filter design:

bilinear transformation, Butterworth design, Chebyshev filters; FIR filter design: Magnitude and Phase

response of Digital filters, Frequency response of linear phase FIR filters, Design techniques of FIR

filters. Windows Techniques for FIR filters; Finite word length effects in FIR and IIR digital filters:

Quantization, round off errors and overflow errors, output noise power of digital filters. Coefficient

quantization effects in digital filters; Multi rate digital signal processing: Sampling theorem, design of

practical sampling rate converters, Decimators, interpolators. Polyphase decompositions.

TEXT BOOKS:

1. Salivahanan S., Vallavaraj A., Gnanapriya C., “Digital Signal Processing”, Tata McGraw Hill,

2000.

2. Proakis J, Dimitris G.M. , “Digital Signal Processing: Principals, Algorithms and Applications”,

PHI, 1995.

REFERENCES:

1. Oppenheim A., Schaffer R., “Digital Signal Processing”, PHI, 2009.

2. Mitra S., “Digital Signal Processing A computer based approach”, Fourth Edition, Tata McGraw

Hill, 2010.

37

VII SEMESTER PROGRAMME ELECTIVES

CS 1652 DISTRIBUTED SYSTEM [3 0 0 3]

Introduction to Distributed Systems: goals, hardware concepts, software concepts, client server model;

communication, layered protocols, remote procedure call, objective invocation, message & stream

oriented communication; Processes:, threads, clients, servers; naming entities, mobile and unreferenced

entities; clock synchronization: algorithms, transaction; consistency and replication, data-centric &

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

Communication, commit, recovery; security ,channels, access, security control; distributed object-based

systems: explanation and comparison ;distributed file systems (SUN, CODA) and comparison;

distributed document-based system and coordination- based systems, multimedia systems.

TEXT BOOKS:

1. A. S. Tanenbaum, M. V. Steen, “Distributed Systems Principals and Paradigms”, Second Edition

PHI, 2006.

2. G. Coulouris, “Distributed Systems: Concepts and Design”, Fourth Edition, Pearson Education,

2010.

REFERENCES:

1. Crichlo W., Joel M. “Distributed Systems Computing Over Networks” PHI, 2009.

2. R. Chow, T. Johnson, “Distributed Operating Systems & Algorithms”, Addison-Wesley, 1997.

38

IT1751 MULTIMEDIA SYSTEM [3 0 0 3]

Introduction to multimedia systems: Multimedia elements, applications, architecture; system

components, types, evolving technologies; Defining objects for multimedia systems; Multimedia Data

Interface Standards; Storage requirements and multimedia Databases; Media and Data Streams: Media

of Perception, Representation, Presentation, Storage, Transmission, Information Exchange; Discrete,

continuous and independence media; Characterizing Data Streams; Audio Technology: Audio

representation on computers; Three Dimensional Sound Projection; Speech Signals; Speech input, output

and transmission; Graphics and Images, Video Technology, Computer-Based Animation: Capturing

graphics and images, Reconstructing Images; Graphics and Image Output Options; Specification,

controlling, display and transmission of animation; Data Compression: Basic Compression Techniques;

JPEG, Hierarchical Mode H.261 (Px64) and H.263, MPEG: Video Encoding, Audio Coding, Data

Stream, MPEG-2, MPEG-4, MPEG-7; Fractal Compression; Data and File Format Standards: Rich-

Text, TIFF, RIFF, MIDI, JPEG, DIB, AVI, MPEG Standards, TWAIN.

TEXT BOOKS:

1. R. Steinmetz, K. Narstedt, “Multimedia Fundamentals: Vol 1-Media Coding and Content

Processing”, 2nd Edition, Pearson Education, 2003.

2. P.K. Andleigh, K. Thakrar, “Multimedia Systems Design”, PHI, 2003.

REFERENCES:

1. K.R Rao, Z. S. Bojkovic and D. A. Milovanovic, “Multimedia Communication Systems:

Techniques, Standards, and Networks”, Pearson Education, 2002.

2. N. K Sharad, “Multimedia Information Networking”, PHI, 2002.

39

IT1752 HUMAN COMPUTER INTERACTION [3 0 0 3]

Introduction : Importance of user Interface, definition, importance of good design; Benefits of good

design; A brief history of Screen design; The graphical user interface: popularity of graphics, the

concept of direct manipulation, graphical system, Characteristics, Web user, Interface popularity,

characteristics: Principles of user interface; Design process: Human interaction with computers,

importance of human characteristics human consideration, Human interaction speeds, understanding

business junctions; Screen Designing : Design goals: Screen planning and purpose, organizing screen

elements, ordering of screen data and content, screen navigation and flow, Visually pleasing composition,

amount of information, focus and emphasis, presentation information simply and meaningfully,

information retrieval on web, statistical graphics, Technological consideration in interface

design; Windows: New and Navigation schemes selection of window, selection of devices based and

screen based controls; Components: text and messages, Icons and increases, Multimedia, colors, uses

problems, choosing colors, Software tools, Specification methods, interface, Building Tools Interaction

Devices, Keyboard and function keys, pointing devices, speech recognition digitization and generation,

image and video display drivers.

TEXT BOOKS:

1. W. O. Galitz, “The essential guide to user interface design”, Wiley, 2007.

2. B. Shneidermann, “Designing the user interface”, Third Edition, Pearson Education, 2009.

REFERENCES:

1. A. Dix, J. Fincay, G. Goryd, Abowd, R. Bealg, “Human – Computer Interaction”, Pearson

Education, 2003.

2. Soren L., “User Interface Design”, Pearson Education, 2004.

40

CS 1752 CRYPTOGRAPHY & NETWORK SECURITY [3 0 0 3]

Elements of Number Theory : Euclid Algorithm, Prime Number Theorem, Euler’s, Fermat’s Little

theorems, Entropy ; Classical Cipher Techniques: Caesar, Affine, Mono-alphabetic, Transposition,

Polyalphabetic Ciphers; Security Attacks: Active V/S Passive, Security Services; Symmetric

Encryption: Fiestel Cipher, Confusion and Diffusion, DES Algorithm; Asymmetric Encryption:

Principles of Public Key Cryptosystems, RSA Algorithm; Message Authentication & Hashing; Digital

Signatures: RSA Based, El-Gamal Signatures; Key distribution; User Authentication Protocols; E-

Mail Security: PGP, S/MIME; IPsec: AH & ESP; SSL; TLS; Intrusion Detection: Statistical Anomaly

Detection, Rule based detection, honeypots; Password Protection.

TEXT BOOKS:

1. S. Williams, “Cryptography and Network Security: Principles and Practices”, Pearson Education,

2008.

2. A. Kahate, “Cryptography and Network Security”, Tata Mc-Graw Hill, 2006.

3. B.A. Forouzan, “Network Security “, Tata Mc-Graw Hill, 2007.

REFERENCES:

1. K. Charlie, “Network Security: Private Communication in a Public World”, Pearson Education,

2008.

2. V. Bagad, I. Dhotre, “Cryptography and Network Security “, Technical Publications, 2008.

41

IT1755 REAL TIME SYSTEMS [3 0 0 3]

Introduction: Modeling Timing constraints; Scheduling Real-Time Tasks: Types of Schedulers, table-

driven, Cyclic, EDF, and RMA; Handling Resource: sharing among real-time tasks; Multiprocessor

Scheduling: Scheduling Real-Time Tasks in Multiprocessor and Distributed systems; Commercial Real-

time operating systems: General concepts, Unix and Windows as RTOS, Survey of commercial RTOS,

Real-Time Communication, Real-Time Databases.

TEXT BOOKS:

1. R. Mall, "Real-Time Systems: Theory and Practice", Pearson Education, 2009.

2. J. W. Liu, "Real-Time Systems" Pearson Education, 2000.

REFERENCES:

1. K. Shin, "Real-TIme Systems" Tata McGraw Hill, 2009.

2. A.C. Shaw, “Real-Time Systems and Software”, Wiley, 2001.

42

IT1756 ENTERPRISE RESOURCE PLANNING (ERP) SYSTEMS [3 0 0 3]

Introduction: ERP an Overview, Enterprise – An Overview, Benefits of ERP, Origin; Evolution and

Structure: Conceptual Model of ERP, the Evolution of ERP, the Structure of ERP, ERP and Related

Technologies, Business Process Reengineering (BPR), Data Warehousing, Data Mining, Online

Analytical Processing(OLAP), Software Configuration Management(SCM), Product Life Cycle

Management(PLM), ERP Marketplace and Marketplace Dynamics: Market Overview, Marketplace

Dynamics, the Changing; ERP implementation: ERP Implementation Lifecycle, Implementation

Methodology, Hidden Costs, Organizing the Implementation, Vendors, Consultants and Users, Contracts

with Vendors, Consultants and Employees, Project Management and Monitoring; The Business Module:

Business modules in an ERP Package, Finance, Manufacturing, Human Resources, Plant Maintenance,

Materials Management, Quality Management, Sales and Distribution; ERP – Present and Future: Turbo

Charge the ERP System, ERP and e-Commerce, ERP and Internet, Future Directives- in ERP, ERP and

Internet, Critical success and failure factors, Integrating ERP into organizational culture. Using ERP tool:

either SAP or ORACLE format to case study.

TEXT BOOKS:

1. A.Leon, “ERP Demystified”, Tata McGraw Hill, 2000

REFERENCES:

1. J.A. Brady, E. F. Monk, B. Wagner, “Concepts in Enterprise Resource Planning”, Thompson

Course Technology, USA, 2001.

2. V. K. Garg ,V.N. K, “Enterprise Resource Planning – Concepts and Practice”, PHI, 2003.lan C.

Shaw, “Real-Time Systems and Software”, Wiley, 2001.

43

CS 1503 COMPUTER GRAPHICS [3 0 0 3]

Basics Of Computer Graphics: Introduction, What is computer Graphics?, Area of Computer Graphics,

Design and Drawing, Simulation, How are pictures actually stored and displayed, Difficulties for

displaying pictures; Graphic Devices: Cathode Ray Tube, CRTs for Color Display, Beam Penetration

CRT, The Shadow , Mask CRT, Direct View Storage Tube, Tablets, The light Pen, Three Dimensional

Device; C Graphics Basics: Graphics programming, initializing the graphics, C Graphical functions,

simple programs; Simple Line Drawing Methods: Point Plotting Techniques, Qualities of good line

drawing algorithms, The Digital Differential Analyzer (DDA), Brenham’s Algorithm, Generation of

Circles; Two Dimensional Transformations: What is transformation?, Matrix representation of points,

Basic transformation, Need for Clipping and Windowing, Line Clipping Algorithms, The midpoint

subdivision Method, Other Clipping Methods, Sutherland – Hodgeman Algorithm, Viewing

Transformations; Curves And Surfaces: Shape description requirements, parametric functions, Bezier

methods, Bezier curves, Bezier surfaces, B-Spline methods; Solid Area Scan Conversion: Solid Area

Scan Conversion, Scan Conversion of Polygons, Algorithm Singularity, Three Dimensional

transformation, translations, Scaling, Rotation, Viewing Transformation, The Perspective, Algorithms,

Three Dimensional Clipping, Perspective view of Cube.

TEXT BOOKS:

1. E.Angel, “Interactive Computer Graphics: A Top-Down Approach with OpenGL”, Fourth

edition, Addison-Wesley, 2005.

REFERENCES:

1. E.Angel, “OpenGL: A primer”, Second edition, Addison-Wesley, 2005.

2. J. D. Foley, Andries van Dam, Steven K. Feiner, John F. Hughes,” Computer Graphics :

Principles & Practices”, Addison Wesley Longman, Second edition in C, 1994.

3. D. Hearn, M. Pauline Baker, “Computer Graphics”, Second edition, C version, Prentice Hall,

1996.

44

IT1758 PARALLEL ALGORITHMS [3 0 0 3]

Introduction: Need for parallel computers, models of computation, analyzing parallel algorithms,

expressing parallel algorithms; Dense matrix algorithms: matrix vector multiplication, matrix matrix

multiplication; Decomposition & mapping techniques: database query processing, 15 puzzle problem,

parallel discrete event simulation; Sorting: Hyper quick sort, merge sort, bitonic merge sort, odd even

transposition, enumeration sort; Searching and selection: searching on a sorted sequence, searching on a

random sequence, sequential selection algorithm, parallel selection algorithm; Graph algorithms: graph

coloring minimal spanning tree, shortest path algorithm.

TEXT BOOKS:

1. A. Grama, A. Gupta, G. Karypis, V. Kumar, "Introduction to Parallel Computing", Second

Edition, Addison Wesley, 2003.

2. S.G.Akl ,"The Design and Analysis of Parallel Algorithms", PHI , 1989.

3. F.T.Leighton, "Introduction to Parallel Algorithms and Architectures: Arrays, Trees,

Hypercubes", MK Publishers, San Mateo California, 1992.

REFERENCES:

1. W. Wilkinson, M. Allen, "Parallel Programming Techniques And Applications Using Networked

Workstations And Parallel Computers", Prentice Hall, 1999.

2. M. J. Quinn, "Parallel Computer Theory and Practice", McGraw Hill, Second Edition, 1994.

45

OPEN ELECTIVE

IT 1490 DATA STRUCTURES [3 0 0 3]

Introduction, Algorithm specification; Performance Analysis: Time and Space Complexity, Asymptotic

notation; pointer declaration and definition, memory allocation functions, array of pointers; The type

definition, enumerated types, accessing structures, complex structures, arrays of structures, structures and

functions; Recursion: Recursive definition & processes, Recursion in C, writing recursive programs

efficiency of recursion, Example of Tower of Hanoi, GCD, Fibonacci Definition and examples,

Representing stacks in C, Evaluation of expressions, multiple stacks and queues; Applications: infix,

postfix and prefix and their conversions Linked lists representations, Singly, doubly, header node,

circular, Applications: linked stacks and queues, polynomial and long integer arithmetic, union,

intersection, Basic terminologies, binary tree representation, recursive/ non recursive, Binary search tree,

AVL trees; Applications: Expression trees, inserting, deleting, searching, height of BST Terminology

and representations, Graph operations, spanning trees, minimum cost spanning tree, shortest path and

transitive closure, Binary and linear search, insertion, quick, merge, heap, radix sort Static Hashing

TEXT BOOKS:

1. S. Lipschutz, “Data Structures with C”, Tata McGraw Hill Education, 2010

REFERENCES:

1. D.Forouzan, R. F. Gilberg, “A Structured Programming Approach Using C”, Thomson, 2003.

2. A.S. Tenenbaum, J. Augenstein, “Data Structures using C”, Pearson Education, 2006.

3. E. Horowitz, S. Sahni, “Fundamentals of Data Structures in C”, Silicon Press, Second Edition,

2007.

46

OPEN ELECTIVE

CS 1503 COMPUTER GRAPHICS [3 0 0 3]

Introduction: Introduction to Raster scan displays, Storage tube displays, refreshing, flicking,

interlacing, color monitors, display processors, resolution, Introduction to Interactive; Computer

Graphics: Picture analysis, Overview of programmer’s model of interactive graphics, Fundamental

problems in geometry; Scan Conversion: point, line, circle, ellipse polygon, Aliasing, and Anti-Aliasing

(No anti aliasing algorithm); 2D & 3D Co-ordinate system: Homogeneous Co-ordinates, Translation,

Rotation, Scaling, Reflection, Inverse transformation, Composite transformation. Polygon Representation,

Flood Filling, Boundary filling; Point Clipping, Cohen-Sutherland Line Clipping Algorithm, Polygon

Clipping algorithms; Hidden Lines & Surfaces: Image and Object space, Depth Buffer Methods,

Hidden Facets removal, Scan line algorithm, Area based algorithms; Curves and Splines: Parametric and

Non parametric Representations, Bezier curve, BSpline Curves; Rendering: Basic illumination model,

diffuse reflection, specular reflection, phong shading, Gourand shading, ray tracing; Color models:

Multimedia components, Multimedia Input/Output Technologies: Storage and retrieval technologies,

Architectural considerations, file formats;

TEXT BOOKS:

1. P. Hearn, D. Baker,” Computer Graphics”, PHI, 1997.

REFERENCES:

1. J. Foley, A. Van Dam, S. Feiner, J. Hughes, ”Computer Graphics- Principles and Practice”,

Pearson, 1995.

47

CA1403 E-COMMERCE [3 0 0 3]

Introduction: Motivation, Forces behind E-Commerce Industry Framework, Brief history of

Ecommerce, Inter Organizational E-Commerce, Intra Organizational E-Commerce, and Consumer to

Business Electronic Commerce, Architectural framework, Network Infrastructure for E-Commerce,

Component of I way Access Equipment, Global Information Distribution Network, Broad band

Telecommunication; Mobile Commerce: Introduction to Mobile Commerce, Mobile Computing

Application, Wireless Application Protocols, WAP Technology, Mobile Information Devices, Web

Security, Introduction to Web security, Firewalls & Transaction Security, Client Server Network,

Emerging Client Server Security Threats, firewalls & Network Security; Basic cryptography for

enabling E-commerce: World Wide Web & Security, Encryption, Transaction security, Secret Key

Encryption, Public Key Encryption, Virtual Private Network (VPN), Implementation Management

Issues.; Electronic Payments: Overview of Electronics payments, Digital Token based Electronics

payment System, Smart Cards, Credit Card I Debit Card based EPS, Emerging financial Instruments,

Home Banking, Online Banking.

TEXT BOOKS:

1. R.Kalakota, A. Whinston “Frontiers of electronic Commerce”, Addison Wesley, 1997.

REFERENCES:

1. V.K. Garg and N.K. Venkita Krishna, “Enterprise Resource Planning-Concepts and Practice”,

PHI, 2013.