Download MS (Information Technology)

VIT
UNIVERSITY
(Estd. u/s 3 of UGC Act 1956)
Vellore - 632 014, Tamil Nadu, India
School of Information Technology and Engineering
MS (Information Technology)
Curriculum
University Core
S.
No
1
2
Course
Code
ITY
ITY
591
592
Course Title
L T P C
Major Project
Major Project
Total Credits
15
20
35
Program Core
S.
No
3
4
5
6
7
8
9
10
11
12
Course
Code
Course Title
ITY
ITY
ITY
ITY
ITY
ITY
ITY
ITY
ITY
ITY
201
202
203
204
205
390
211
212
213
214
13
14
15
ITY
ITY
ITY
391
301
302
16
17
18
19
20
ITY
ITY
ITY
ITY
ITY
303
304
392
305
306
21
22
23
ITY
ITY
ITY
307
308
393
Principles of programming
Fundamentals of IT
Fundamentals of Algorithms
Programming in C
Java Programming
Programming Lab – 1
Design and Analysis of Algorithms
Discrete Mathematical Structures
Object Oriented Programming
Computer Architecture and
Organization
Programming Lab – 2
Operating Systems
Object Oriented Analysis and
Design
Open Source Programming
Embedded Systems
Programming Lab – 3
Database Management Systems
Data Communication and
Computer Networks
Computer Graphics and Multimedia
Principles of Compiler Design
Programming Lab – 4
1
L T P C
5
5
5
6
6
0
0
0
0
0
3
3
3
3
0
0
0
0
3
3
6
0 0 3
0 0 3
3
3
3
3
3
3
Pre-requisite
0 5
0 5
0 5
0 6
0 6
6
0 3
0 3
0 3
0 3
0 0 3
0 0 3
6
0 0 3
0 0 3
0 0 3
0 0 3
6
ITY214
ITY213
ITY214
ITY301
ITY301
ITY212
24
25
26
27
ITY
ITY
ITY
ITY
309
310
311
312
28
29
30
31
ITY
ITY
ITY
ITY
491
401
402
403
32
ITY
404
33
34
35
36
37
ITY
ITY
ITY
ITY
ITY
492
405
406
493
494
Principles of Software Engineering
Web Technology
Network Programming
Wireless Networks & Mobile
Computing
Application Development -1
Software Testing
Network security
Data Warehousing and Business
Intelligence
Web Services and Service Oriented
Architecture
Application Development -2
Software Project Management
Cloud Computing
Application Development -3
Application Development – 4
Total Credits
3
3
3
3
0
0
0
0
3
3
3
3
ITY302
ITY213
ITY306
ITY306
3
3
3
6
0 0 3
0 0 3
0 0 3
ITY309
ITY306
ITY305
3
0 0 3
ITY310
3
3
0
0
0
0
6
0 0 3
0 0 3
6
6
141
ITY309
ITY404
Program Electives
S.
No
38
Course
Code
ITY
501
39
40
41
42
43
44
ITY
ITY
ITY
ITY
ITY
ITY
502
503
504
505
506
507
Course Title
L T P C
Multi-core Architectures and
3 0 0
Parallel Programming
Artificial Intelligence
3 0 0
Digital Image Processing
3 0 0
Software Agents
3 0 0
Data Compression Techniques
3 0 0
Pattern Recognition
3 0 0
Real Time Systems
3 0 0
Total Credits (No. of courses to be taken =2)
Credit Summary
Minimum Qualifying Credits 220
UC
35
PC
141
PE
6
Credits Offered
182
Credits Transferred
38
UC – University Core
PC – Programme Core
PE – Programme Electives
2
3
3
3
3
3
3
3
6
Pre-requisite
ITY214
ITY307
ITY211
ITY307
ITY301
ITY211
DESIGN AND ANALYSIS OF
ALGORITHMS
Prerequisites:
Objectives:
LTPC 3 0 0 3
To introduce fundamental techniques for designing and
analyzing algorithms, including asymptotic analysis; divideand-conquer algorithms and recurrences; greedy algorithms;
data structures; dynamic programming; and algorithm design
methods.
Expected Outcome: On completion of the course the students will be able to
design and analyze the algorithms using mathematical and
algorithmic techniques.
UNIT I
BASIC CONCEPTS OF ALGORITHMS No of Hrs :6
Introduction – Notion of Algorithm – Fundamentals of Algorithmic Solving –
Fundamentals of the Analysis Framework – Asymptotic Notations
UNIT II
MATHEMATICAL ASPECTS AND
No of Hrs :8
ANALYSIS OF ALGORITHMS
Mathematical Analysis of Non-recursive Algorithm – Mathematical Analysis of
Recursive Algorithm – Example: Fibonacci Numbers – Empirical Analysis of
Algorithms – Algorithm Visualization.
UNIT III
ANALYSIS OF SORTING AND
No of Hrs :8
SEARCHING ALGORITHMS
Brute Force – Selection Sort and Bubble Sort – Sequential Search – Divide and
conquer – Merge sort – Quick Sort – Binary Search – Binary tree- – Decrease and
Conquer – Insertion Sort – Depth first Search and Breadth First Search.
UNIT IV
ALGORITHMIC TECHNIQUES
No of Hrs :8
Transform and conquer – Presorting – Balanced Search trees – Heaps and Heap sort
– Dynamic Programming – Warshall’s and Floyd’s Algorithm – Optimal Binary
Search trees – Greedy Techniques – Prim’s Algorithm – Kruskal’s Algorithm –
Dijkstra’s Algorithm
UNIT V
ALGORITHM DESIGN METHODS
No of Hrs :8
Backtracking – n-Queen’s Problem – Subset-Sum problem – Branch and bound –
Assignment problem – Knapsack problem – Traveling salesman problem
Text Book:
1. Anany Levitin, “Introduction to the Design and Analysis of Algorithm”, Pearson
Education Asia, 2003.
References:
1. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, “Introduction to
Algorithms”,Second Edition, PHI Pvt. Ltd., 2001
2. Sara Baase and Allen Van Gelder, “Computer Algorithms - Introduction to Design
and Analysis”, Pearson Education Asia, 2003.
3. A.V.Aho, J.E. Hopcroft and J.D.Ullman, “The Design and Analysis Of Computer
Algorithms”, Pearson Education Asia, 2003.
Mode of Evaluation Assignments/Quizzes/Seminars/CAT/Term-end
01/04/2011
Recommended by
the Board of Studies
on
3
Date of Approval by
the Academic
Council
22nd Academic Council held on 08/04/2011
4
ITY212
DISCRETE MATHEMATICAL
LTPC 3 0 0 3
STRUCTURES
None
Prerequisites:
The aim of this course is to motivate the students to address
Objectives:
the challenge of the relevance of inference theory, Algebraic
structures and graph theory to computer science and
engineering problems.
Expected Outcome: By the end of the course, the students are expected to use
inference theory in circuit models, and algebraic theory in
computer science problems, graph theory in net work models
and lattices & Boolean algebra in Boolean functions
Unit I
SETS, RELATIONS AND
No of Hrs:7
FUNCTIONS
Sets (Venn diagrams, complements, Cartesian products, power sets); Pigeonhole
principle; Cardinality and countability; Relations (reflexivity, symmetry, transitivity,
equivalence relations); Functions (surjections, injections, inverses, composition).
Unit II
BASIC LOGIC
No of Hrs:8
Propositional logic; Logical connectives; Truth tables; Normal forms (conjunctive
and disjunctive); Validity; Predicate logic; Universal and existential quantification;
Modus ponens and modus tollens; Limitations of predicate logic.
Unit III
PROOF TECHNIQUES
No of Hrs:8
Notions of implication, converse, inverse, contra positive, negation, and
contradiction; The structure of formal proofs; Direct proofs; Proof by
counterexample; Proof by contraposition; Proof by contradiction; Mathematical
induction
Unit IV
BASICS OF COUNTING
No of Hrs:8
Counting arguments – Sum and product rule, Inclusion-exclusion principle,
Arithmetic and geometric progressions, Fibonacci numbers; the pigeonhole principle;
Permutations and combinations – Basic definitions, solving recurrence relations –
Common examples, The Master theorem
Unit V
GRAPHS AND TREES
No of Hrs:7
Trees; Undirected graphs; Directed graphs; Spanning trees; Traversal strategies.
DISCRETE PROBABILITY: Finite probability space, probability measure,
events; Conditional probability, independence, Bayes theorem; Integer random
variables, expectation.
Text Book :
1. Kolman.B, Busby R.C, Discrete Mathematical Structures for Computer
Science”,Prentice Hall of India, Pvt Ltd.,
5
References :
1. J.P. Trembley and R. Manohar, Discrete Mathematical Structures with
Applications to Computer Science, Tata McGraw Hill – 13th reprint (2001).
2. Richard Johnsonbaugh, Discrete Mathematics, 5th Edition, Pearson Education
(2001).
3. S. Lipschutz and M. Lipson, Discrete Mathematics, Tata McGraw Hill, 2nd Edition
(2000).
4. B.Kolman, R.C.Busby and S.C.Ross, Discrete Mathematical structures, 4th
Edition, PHI(2002).
5. C.L.Liu, Elements of Discrete Mathematics, 2nd Edition, Tata McGraw Hill
(2002).
Mode of Evaluation Assignments/Quizzes/Seminars/CAT/Term-end
01/04/2011
Recommended by
the Board of Studies
on
Date of Approval by 22nd Academic Council held on 08/04/2011
the Academic
Council
6
ITY213
Pre-requisites
Objectives:
OBJECT ORIENTED PROGRAMMING
LTPC 3 0 0 3
None
To introduce Object Oriented Programming to students with emphasis
on Classes, Objects, Inheritance, Polymorphism and File Handling
On completion of the course the students will be able to design simple
Expected
applications using Object Oriented Programming concepts
Outcome:
Unit I
OBJECT ORIENTED PARADIGM
No of Hrs:7
Evolution of Object Oriented Programming (OOP) Paradigm- Concepts of OOP – Data
Abstraction – Encapsulation – Class – Inheritance – Polymorphism – I/O Streams – Merits
and Demerits of Object Oriented Paradigm.
Unit II
introduction to C++
No of Hrs:8
Tokens – operators – expressions - type conversion– comments – stream based I/O - control
flow – arrays - structures - pass by reference – Inline Function – Default Arguments –
Function Overloading – structure of C++ program - some simple programs.
Unit III
CLASSES & OBJECTS
No of Hrs:7
Classes – objects – constructor – destructor – dynamic memory allocation – new, delete
operators - friend functions.
Unit IV
INHERITANCE & POLYMORPHISM
No of Hrs:8
Derived class and base class – derived class constructor – types of inheritance – Single –
hierarchical – multiple – multi level – hybrid – compile time polymorphism- operator
overloading- Run time polymorphisms – dynamic binding – ‘this’ pointer- virtual function.
Unit V
FILE HANDLING
No of Hrs:8
C++ streams – console streams – console stream classes - formatted and unformatted console
I/O operations - File streams - classes - file modes - file pointers and manipulations –
Exception handling
Text Books
1. Bjarne Stroustrup, “The C++ Programming Language”, Second Edition, Pearson, 2000.
2. Robert Lafore, “Object Oriented Programming in Turbo C++”, Galgotia1994.
References
1. Herbert Schildt, “C++ The complete reference”, TMH, 1997.
2. Stanley B.Lippman, Josee Lajoie,“C++ Primer”, Third edition, Addison Wesley,
2000.
3. Barkakati N, Object Oriented Programming in C++, PHI, 1995.
4. K.R.Venugopal, Rajkumar T Ravishankar, Mastering C++ , Tata
McGrawHill,1997.
Continuous Assessment (Quizzes, CATs, Assignments, etc.) and TEE
Mode of
Evaluation
Recommended by 01/04/2011.
the Board of
Studies on
22nd Academic Council held on 08/04/2011
Date of Approval
by the Academic
Council
7
ITY214
COMPUTER ARCHITECTURE AND
LTPC 3 0 0 3
ORGANIZATION
None
Pre-requisites
1. To provide basics of computer architecture
Objectives:
2. To teach arithmetic of computers.
3. To provide knowledge of memory technologies, interfacing
techniques and subsystem devices.
The students will be able to Understand the issues related to processors,
Expected
memories, I/O devices.
Outcome:
UNIT I
FUNDAMENTALS OF COMPUTER
No of Hrs :7
ARCHITECTURE
Organization of the von Neumann machine; Instruction formats; The fetch/execute cycle,
instruction decoding and execution; Instruction types and addressing modes; Subroutine call
and return mechanisms; Programming in assembly language; I/O techniques and interrupts;
Other design issues.
UNIT II
COMPUTER ARITHMETIC
No of Hrs :8
Data Representation, Hardware and software implementation of arithmetic unit for common
arithmetic operations: addition, subtraction, multiplication, division( Fixed point and floating
point); Representation of non-numeric data (character codes, graphical data);
UNIT III
MEMORY SYSTEM ORGANIZATION AND
No of Hrs :8
ARCHITECTURE
Memory systems hierarchy; Main memory organization, Types of Main memories, and its
characteristics and performance; Latency, cycle time, bandwidth, and interleaving; Cache
memories (address mapping, line size, replacement and write-back policies); Virtual memory
systems; Reliability of memory systems;
UNIT IV
INTERFACING AND COMMUNICATION
No of Hrs :8
I/O fundamentals: handshaking, buffering; I/O techniques: programmed I/O, interrupt-driven
I/O, DMA; Interrupt structures: vectored and prioritized, interrupt overhead, interrupts and
reentrant code; Buses: bus protocols, local and geographic arbitration.
UNIT V
DEVICE SUBSYSTEMS
No of Hrs :7
Basic I/O controllers such as a keyboard and a mouse; RAID architectures; Video control;
I/O Performance; SMART technology and fault detection; Processor to network interfaces.
Text Book
1. J. P. Hayes, Computer system architecture, Third Edition, McGraw Hill, 1998.
References
1. W. Stallings, Computer organization and architecture, Fourth Edition, PrenticeHall,2001
2. M. M. Mano, Computer System Architecture, Third Edition, Prentice-Hall,2005
3. J. L. Hennessy & D.A. Patterson, Computer architecture: A quantitative approach,
Fourth Edition, Morgan Kaufman, 2004.
Continuous Assessment (Quizzes, CATs, Assignments, etc.) and TEE
Mode of
Evaluation
Recommended by 01/04/2011
the Board of
8
Studies on
Date of Approval
by the Academic
Council
22nd Academic Council held on 08/04/2011
9
ITY301
Pre-requisites
Objectives:
OPERATING SYSTEMS
LTPC
ITY214
1. To introduce operating system concepts
2. To impart knowledge of process and memory management.
Expected
Outcome:
The students will be able to
1. Understand and explain various OS concepts
2. Simulate the concepts of Operating System
3003
UNIT I
FUNDAMENTALS
No of Hrs :7
Introduction :Mainframe systems – Desktop Systems – Multiprocessor Systems – Distributed
Systems – Clustered Systems – Real Time Systems – Handheld Systems - Hardware Protection
Operating-System Structures: Operating System Services - System Calls - System Programs System Structure - Virtual Machines.
UNIT II
PROCESS MANAGEMENT
No of Hrs :8
Processes: Concept – Scheduling - Operations on Processes - Interprocess Communication Communication in Client-Server Systems. Process Scheduling-Scheduling Criteria - Scheduling
Algorithms - Multiple-Processor Scheduling.
Synchronization: The Critical-Section Problem -Synchronization Hardware – Semaphores - Classic
Problems of Synchronization.
UNIT III
DEADLOCKS
No of Hrs :7
Deadlocks: System Model - Deadlock Characterization - Methods for Handling Deadlocks Deadlock Prevention. Deadlock Avoidance - Deadlock Detection - Recovery from Deadlock
UNIT IV
MEMORY MANAGEMENT
No of Hrs :8
Storage Management: Swapping – Contiguous Memory allocation – Paging – Segmentation –
Segmentation with Paging.
Virtual Memory:– Demand Paging – Process creation – Page Replacement – Allocation of frames
– Thrashing.
UNIT V
SECONDARY STORAGE MANAGEMENT
No of Hrs :8
File System Interface: Concept – Access Methods – Directory Structure – File System Mounting –
File Sharing – Protection
File System Implementation: File System Structure – File System Implementation – Directory
Implementation – Allocation Methods – Free-space Management.
Text Book
1. A. Silberschatz, P.B. Galvin & G. Gagne, “Operating system concepts”, Sixth Edition John
Wiley,2005.
References
1. W. Stallings, “Operating systems”, Seventh Edition, Prentice-Hall, 2005.
2. Mukesh Singhal, Niranjan Shivaratri G, Advanced Concepts in Operating Systems
Distributed, Database, and Multiprocessor Operating Systems, Second Edition, Tata McGrawHill, 2001.
Mode of
Evaluation
Continuous Assessment (Quizzes, CATs, Assignments, etc.) and TEE
10
Recommended by
the Board of
Studies on
Date of Approval
by the Academic
Council
01/04/2011
22nd Academic Council held on 08/04/2011
11
ITY302
OBJECT ORIENTED ANALYSIS AND
LTPC 3 0 0 3
DESIGN
ITY213
Pre-requisites:
To understand the concepts of object oriented analysis and design
Objectives:
Able to implement concepts of object oriented analysis and design
Expected Outcome:
Unit I
INTRODUCTION
No of Hrs :7
An Overview of Object Oriented Systems Development - Object Basics – Object Oriented
Systems Development Life Cycle.
Unit II
OBJECT ORIENTED METHODOLOGIES
No of Hrs :8
Rumbaugh Methodology - Booch Methodology - Jacobson Methodology - Patterns –
Frameworks – Unified Approach – Unified Modeling Language – Use case - class diagram Interactive Diagram - Package Diagram - Collaboration Diagram - State Diagram - Activity
Diagram.
Unit III
OBJECT ORIENTED ANALYSIS
No of Hrs :8
Identifying use cases - Object Analysis - Classification – Identifying Object relationships Attributes and Methods.
Unit IV
OBJECT ORIENTED DESIGN
No of Hrs :8
Design axioms - Designing Classes – Access Layer - Object Storage - Object Interoperability.
Unit V
SOFTWARE QUALITY AND USABILITY
No of Hrs :7
Designing Interface Objects – Software Quality Assurance – System Usability - Measuring
User Satisfaction.
Text Books
1. Ali Bahrami, “Object Oriented Systems Development”, Tata McGraw-Hill, 2008.
2. Martin Fowler, “UML Distilled”, Second Edition, PHI/Pearson Education, 2002.
References
1. Stephen R. Schach, “Introduction to Object Oriented Analysis and Design”, Tata McGrawHill, 2003.
2. James Rumbaugh, Ivar Jacobson, Grady Booch “The Unified Modeling Language Reference
Manual”, Addison Wesley, 1999.
3. Hans-Erik Eriksson, Magnus Penker, Brain Lyons, David Fado, “UML Toolkit”, OMG Press
Wiley Publishing Inc., 2004.
Continuous Assessment (Quizzes, CATs, Assignments, etc.) and TEE
Mode of Evaluation
Recommended by the 01/04/2011
Board of Studies on
Date of Approval by 22nd Academic Council held on 08/04/2011
the Academic
Council
12
ITY303
Prerequisites
Objectives:
OPEN SOURCE PROGRAMMING
NIL
LTPC
3003
On completion of this course the students understand how to create
open source software applications and can publish it over the
Internet
Students should be able to design open source software applications
Expected
and can publish it over the Internet
Outcome:
No of Hrs : 9
Unit I
INTRODUCTION TO PHP
Open source Programming PHP, Apache, MySQL, Postgress, SQL and PerlOverview of PHP – Variables, Operations, Constants, Control structures arrays,
Functions, classes – Handling files
No of Hrs : 6
Unit II
MY SQL DATABASE PROGRAMMING
Connecting – table creation – record insertion – updation – multiple database
handling
No of Hrs : 9
Unit III
E-MAILING WITH PHP
Sending an email – multipart message – storing images – getting confirmation.
Session tracking using PHP – Graphics Input Validators – cookies
No of Hrs : 7
Unit IV
INTRODUCTION TO PERL
Numbers and Strings – Control Statements – Lists and Arrays – Files – Pattern
matching – Hashes – Functions.
No of Hrs : 7
Unit V
TCL / PYTHON
Introduction to TCL/TK, Introduction to Python
Text Books
1. Julie C. Meloni, SAMS Teach yourself PHP, MYSQL and Apache, Second edition
Pearson Education, 2006.
2. Michael K.glass, Rommn le Scouarnec, et.al., Beginning PHP, Apache, MySQL
web development, Wiley Publishing, Inc, New Delhi, 2004
3. Leon Atkinson and Zeev Suraski, Core PHP programming, 3rd Edition, Pearson
Education, Delhi, 2004.
References
1. Ashish Wilfred Meeta Gupta and Karticj Bhatnagar, PHP Professional
Projects, PHI, 2002
2. Clinton pierce, Teach Yourself perl, Techmedia, 3rd Edition, New Delhi,
2000.
3. Tom Christiansen and Nathan Torkington, Perl CookBook, 2nd Edition ,
O’Reilly, 2003
Continuous Assessment (Quizzes, CATs, Assignments,
Mode of Evaluation
etc.) and TEE
01/04/2011
Recommended by the
Board of Studies on
22nd Academic Council held on 08/04/2011
Date of Approval by
the Academic Council
13
ITY304
Pre-requisites
Objectives:
Expected
Outcome:
Unit I
EMBEDDED SYSTEMS
LTPC 3 0 0 3
ITY214
The student would be able to understand and use in embedded
systems, device drivers, software engineering practices in
embedded systems development and Inter process
communication.
INTRODUCTION
No of Hrs
:
Introduction to Embedded Systems, Processor in the System – Software Embedded
into a system – Exemplary Embedded Systems – Embedded System-On-chip and in
VLSI Circuit Processor and Memory Organization – Structural Units in a Processor –
Processor Selection for an Embedded System – Memory Devices – Memory
Selection for an Embedded System – Allocation of Memory to Program Segments
and Blocks and Memory Map of a System – Direct Memory Access – Interfacing
Processor, Memories and I/O Devices.
Unit II
DEVICES AND BUSES
No of Hrs
:
Devices and Buses for Device Networks-I/O Devices – Timer and Counting Devices
– Serial Communication Using the I2 C, ‘CAN’ and Advanced I/O Buses between the
Networked Multiple Devices – Host System or Computer Parallel Communication
between the Networked I/O Multiple Devices Using the ISA, PCI, PCI – X and
Advanced Buses.
Unit III
DEVICE DRIVERS AND INTERRUPTS
No of Hrs
:
Device Drivers and Interrupts Servicing Mechanism- Device Drivers – Parallel Port
Device Drivers in a System – Serial Port Device Drivers in a System – Device
Drivers for Internal Programmable Timing Devices – Interrupt Servicing (Handling)
Mechanism – Context and the periods for Context – Switching, Deadline and
Interrupt Latency.
Unit IV
PROGRAMMING CONCEPTS
No of Hrs
:
Program Modeling Concepts in Single and Multiprocessor Systems Software –
Development Process- Modeling Processes for Software Analysis Before Software
Implementation – Programming Models for Event Controlled or Response Time
Constrained Real Time Programs – Modeling of Multiprocessor Systems.
Unit V
SOFTWARE ENGINEERING IN
No of Hrs
EMBEDDED
:
Software Engineering Practices in the Embedded Software Development ProcessSoftware Algorithm Complexity – Software Development Process Life Cycle and its
Models – Software Analysis – Software Design – Software Implementation –
Software Testing, Validating and Debugging – Real Time Programming Issues during
the Software Development Process – Software Project Management – Software
Maintenance – Unified Modelling Language (UML) Inter-Process Communication &
Synchronisation of processes, Tasks & Threads-Multiple Processes in an Application
14
– Problems of Sharing Data by Multiple Tasks and Routines – Inter process
Communication.
Text Books
1. Rajkamal, “Embedded Systems-Application, Practice & Design”, Tata
McGraw Hill, 2008.
2. Wayne Wolf “Computers as components: Principles of Embedded Computing
System design” The Morgan Kaufmann Series in Computer Architecture and
Design, 2008.
References
1. Arnold S. Berger, “Embedded Systems Design”, CMP Books, 2001.
2. Frank Vahid and Tony Givargis, ”Embedded System Design: A Unified
Hardware / Software Approach, John Wiley ,2006.
3. Philipe laplante, “REAL time systems”, Prentice Hall,3/e,2008.
By Assignment, Seminars and Written Examinations
Mode of
Evaluation
Recommended by 01/04/2011
the Board of
Studies on
Date of Approval 22nd Academic Council held on 08/04/2011
by the Academic
Council
15
ITY305
Prerequisites
Objectives:
DATABASE MANAGEMENT SYSTEMS
ITY301
LTPC 3 0 0 3
The students shall be able to understand fundamental concepts of
database management system, database modeling and design, SQL,
PL/SQL, system implementation techniques. Analyze and design ER
model for a customized application and concurrency techniques and
active databases.
Students should be able to implement the concepts of data base
Expected
systems and able to carry out database projects.
Outcome
UNIT I
INTRODUCTION ER MODELING
No of Hrs:
7
Basic concepts – Databases and database users – Database system concepts and
architecture – data modeling using Entity Relationship model. Relational Model.
UNIT II
THE RELATIONAL DATA MODEL
No of Hrs
:7
Relational constraints – Relational algebra – Introduction to SQL – Introduction
PL/SQL – Relational database standard – E.R to relational mapping – E.F.Codd rules.
UNIT III
NORMALIZATION
No of Hrs:
7
Functional dependencies – Normalization for relational databases up to BCNF
UNIT IV
QUERY OPTIMIZATION AND
No of Hrs:
TRANSACTION PROCESSING
8
Query Processing – Translating queries into relational algebra – Using Heuristics in
query optimization – Introduction to Transactions – Single user and multiuser system
transactions – Read and write operations – Transactions system concepts –
Serializability types.
UNIT V
CONCURRENCY, RECOVERY AND
No of Hrs:
SECURITY
9
2PL – Types of locks – System lock tables – deadlocks – Timestamp ordering
algorithm – Recovery concepts – ARIES recovery algorithm – Introduction to
database security issues – Discretionary access control based on granting and
revoking privileges.
Text Book
1. Ramez Elmasri & B.Navathe: Fundamentals of Database Systems, Sixth
Edition Addison Wesley, 2006.
References
1. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, III
Edition, McGraw Hill, 2003.
2. Date C.J: Introduction to Database Systems, 8th Edition, Addison-Wesley, 2006.
Continuous Assessment (Quizzes, CATs, Assignments, etc.) and
Mode of
TEE
Evaluation
Recommended 01/04/2011
by the Board
of Studies on
22nd Academic Council held on 08/04/2011
Date of
16
Approval by
the Academic
Council
17
ITY306
DATA COMMUNICATION AND COMPUTER
NETWORKS
Prerequisite
:
Aim :
ITY301
Objectives:
1.
2.
3.
4.
Outcomes:
UNIT I
LTPC
3003
To understand the concepts of data communication networks, protocols and their
performance.
To understand the fundamental principles of networking and data communication
To understand the layering concepts in computer networks
To understand the functions of each layer
To have knowledge in different applications that use computer networks
Students shall be able to understand about working of Intranet, LAN, WAN, MAN,
different topologies, common networking protocols and algorithms, Implement network
protocols and analyze its performance.
OVERVIEW OF COMPUTER NETWORKS AND NETWORK
No of Hrs :5
MODELS
Data communication:- components, data flow, physical structures and categories of networks. Network
models:- Need of layered architecture, layers in the OSI model and TCP/IP protocol suite.
UNIT II
PHYSICAL LAYER AND MEDIA
No of Hrs :9
Data and signals:- Analog and digital signals, data rate limits and performance. Analog-to-digital and
Digital-to-analog conversions, multiplexing, spread spectrum and Transmission media.
UNIT III
DATA LINK LAYER
No of Hrs :9
Error detection and correction:- Types of errors, parity check, cyclic redundancy check, checksum and
Hamming code procedure. Data link control – Framing, ARQ protocols, HDLC and Point-to-point
protocol. Multiple Access communication, Wired LANs- Ethernet, Token ring and FDDI. Wireless
LAN – IEEE 802.11 and Bluetooth. Connecting devices- Hubs, Repeaters, Bridges, Switches and
Routers.
UNIT IV
NETWORK LAYER
No of Hrs :8
Logical addressing:- IPv4 Addresses- classful and classless addressing, Network address translation and
Subnetting, IPv6 addresses. Internet Protocol – IPv4 datagram and fragmentation, IPv6 advantages and
packet format and extension headers.
UNIT V
TRANSPORT AND APPLICATION LAYERS
No of Hrs :7
Process-to-process delivery, User datagram protocol and its operation, TCP – services and features,
segment, TCP connection, flow control and error control. Congestion control and Quality of Service.
Email:- SMTP, MIME, POP3, IMAP – HTTP – DNS- SNMP – Telnet.
Text Book:
1. Behrouz A. Forouzan, “Data Communications and Networking”, 4th Edition, Tata McGraw Hill,
2007.
Reference Books:
1. Fred Halsall, “Data Communications, Computer Networks and Open systems”, 4th Edition, Pearson
Education, 2005.
18
2. William Stallings, “Data and Computer Communications”, Eighth Edition, Pearson Education, 2007.
3. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”, Fourth Edition,
Morgan Kaufmann Publishers Inc., 2007.
4. James F. Kurose, Keith W. Ross, “Computer Networking, A Top-Down Approach Featuring the
Internet”, Third Edition, Addison Wesley, 2005.
Assignments/Quizzes/Seminars/CAT/Term-end
Mode of Evaluation
01/04/2011
Recommended by the
Board of Studies on
22nd Academic Council held on 08/04/2011
Date of Approval by the
Academic Council
19
ITY307
COMPUTER GRAPHICS AND MULTIMEDIA
LTPC3003
NIL
Prerequisites:
Objectives:
 To study the graphics techniques and algorithms.
 To study the multimedia concepts and various I/O technologies.
 To enable the students to develop their creativity
Expected Outcome: Students should be able to implement the concepts of graphics and
multimedia in real time.
Unit I
OUTPUT PRIMITIVES
No of Hrs: 7
Introduction - Line - Curve and Ellipse Algorithms – Attributes – Two-Dimensional Geometric
Transformations – Two-Dimensional Viewing
Unit II
THREE-DIMENSIONAL CONCEPTS
No of Hrs: 7
Three-Dimensional Object Representations – Three-Dimensional Geometric and Modeling
Transformations – Three-Dimensional Viewing – Color models – Animation.
Unit III
MULTIMEDIA SYSTEMS DESIGN
No of Hrs: 8
An Introduction – Multimedia applications – Multimedia System Architecture –Evolving
technologies for Multimedia – Defining objects for Multimedia systems – Multimedia Data
interface standards – Multimedia Databases.
Unit IV
MULTIMEDIA FILE HANDLING
No of Hrs: 8
Compression & Decompression – Data & File Format standards – Multimedia I/O technologies Digital voice and audio – video image and animation – Full motion video – Storage and retrieval
Technologies.
Unit V
HYPERMEDIA
No of Hrs: 8
Multimedia Authoring & User Interface – Hypermedia messaging - Mobile Messaging –
Hypermedia message component – creating Hypermedia message – Integrated multimedia
message standards – Integrated Document management – Distributed Multimedia Systems.
Text Books:
1. Donald Hearn and M.Pauline Baker, “Computer Graphics C Version”, Pearson Education,
2nd Edition, 2003.
2. Prabat K Andleigh and Kiran Thakrar, “Multimedia Systems and Design”, PHI, 2003.
References:
1. Judith Jeffcoate, “Multimedia in Practice Technology and Applications”, PHI,1998.
2. Foley, Vandam, Feiner, Huges, “Computer Graphics: Principles & Practice”, Pearson
Education, Second Edition, 2003.
CAT, Quiz, Seminar, Assignment, Term-End
Mode of Evaluation
Examination
Recommended by the Board of Studies on 01/04/2011
Date of Approval by the Academic Council: 22nd Academic Council held on 08/04/2011
20
ITY308
PRINCIPLES OF COMPILER DESIGN LTPC 3 0 0 3
ITY212
Prerequisite:
Objective: To make the students to understand the various functions of a typical
compiler
Expected Outcome: At the end of the course the students will be able to design and
implement a simple compiler.
UNIT I
INTRODUCTION TO COMPILING
No of hrs : 7
Compilers – Analysis of the source program – Phases of a compiler – Cousins of the
Compiler – Grouping of Phases – Compiler construction tools – Lexical Analysis –
Role of Lexical Analyzer – Input Buffering – Specification of Tokens
UNIT II
SYNTAX ANALYSIS
No of hrs : 8
Role of the parser –Writing Grammars –Context-Free Grammars – Top Down parsing
– Recursive Descent Parsing – Predictive Parsing – Bottom-up parsing – Shift Reduce
Parsing – Operator Precedence Parsing – LR Parsers – SLR Parser – Canonical LR
Parser – LALR Parser.
UNIT III
INTERMEDIATE CODE
No of hrs : 8
GENERATION
Intermediate languages – Declarations – Assignment Statements – Boolean
Expressions – Case Statements – Back patching – Procedure calls.
UNIT IV
CODE GENERATION
No of hrs : 8
Issues in the design of code generator – The target machine – Runtime Storage
management – Basic Blocks and Flow Graphs – Next-use Information – A simple
Code generator – DAG representation of Basic Blocks
UNIT V
CODE OPTIMIZATION AND RUN TIME No of hrs : 7
ENVIRONMENTS
Introduction– Principal Sources of Optimization – Optimization of basic Blocks –
Introduction to Global Data Flow Analysis – Runtime Environments – Source
Language issues – Storage Organization – Storage Allocation strategies – Parameter
Passing.
Text Book :
1. Alfred Aho, Ravi Sethi, Jeffrey D Ullman, “Compilers Principles, Techniques and
Tools”, Pearson Education, India, 2/e.
References :
1. Allen I. Holub “Compiler Design in C”, Prentice Hall of India, 2003.
2. C. N. Fischer and R. J. LeBlanc, “Crafting a compiler with C”, Benjamin
Cummings, 2003.
3. Kenneth C. Louden, “Compiler Construction: Principles and Practice”, Thompson
Learning, 2003
Assignments/Quizzes/Seminars/CAT/Term-end
Mode of Evaluation
01/04/2011
Recommended by the
Board of Studies on
22nd Academic Council held on 08/04/2011
Date of Approval by
the Academic Council
21
ITY309
Prerequisite
Objectives:
PRINCIPLES OF SOFTWARE
ENGINEERING
ITY302

LTPC 3 0 0 3
The students’ would be able to analyze software requirements,
develop an efficient

Software system through group cohesiveness, use the testing
tools and methods.
After completion of this course, the students shall be able to
Expected
understand the need for principles of software engineering and
Outcome:
applying
Unit I
INTRODUCTION
No of Hrs :7
Software Engineering Fundamentals, The system engineering process, Software
process models, Process iteration, Software Specification, Software design and
implementation, Software validation, Software evolution, Project management
activities- Project planning, Project scheduling, Risk management, Software
requirements- Functional and non-functional requirements, User requirements,
System requirements, software requirements document.
Unit II
ENGINEERING PROCESS
No of Hrs :7
Requirements engineering processes - Feasibility studies, Requirements elicitation
and analysis, Requirements validation, Requirements management, System ModelsContext, Behavioral Data and, Object models, CASE workbenches, Software
prototyping- Prototyping in the software process, Rapid prototyping techniques, User
interface prototyping, Formal Specification- Formal specification in the software
process, Interface specification, Behavioral specification.
Unit III
ARCHITECTURE & DESIGN
No of Hrs :8
Architectural design- System structuring, Control models, Modular decomposition,
Domain-specific architectures, Over view of design for Distributed systems, Objectoriented and Real-time software, Design with Reuse- Component-based
development, Application families, Design patterns, User interface design - User
interface design principles, User interaction, Information presentation, User support,
Interface evaluation.
Unit IV
CRITICAL SYSTEMS
No of Hrs :8
Critical Systems- Over view of Dependability, System Specification, and System
Development, Verification and validation- V&V planning, Software inspections,
Automated static analysis, Clean room software development, Software testingDefect testing, Integration testing, Object-oriented testing, Critical systems
validation- Formal methods and critical systems, Reliability validation, Safety
assurance, Security assessment.
Unit V
MANAGING SOFTWARE
No of Hrs :8
Over view of managing software people, Software cost estimation- Productivity,
Estimation techniques, Algorithmic cost modeling, Project duration and staffing,
Overview of Quality management & Process Improvement, overview of Legacy
Systems, Software change & re-engineering, Configuration management- planning
and managing change, version and release, Over view of SEI-CMM, ISO 9000, and
22
Six Sigma, Over view of CASE tools.
Text Book
1. Ian Sommerville, "Software Engineering", Pearson India, 2008.
Reference
1. Roger S. Pressman, “Software Engineering”, McGraw Hill, 2004.
By Assignment, Seminars and Written Examinations.
Mode of Evaluation
01/04/2011
Recommended by the
Board of Studies on
Date of Approval by the 22nd Academic Council held on 08/04/2011
Academic Council
23
ITY310
WEB TECHNOLOGY
LTPC
3003
ITY213
Prerequisite
Objectives:
 Students will get an introduction about various Scripting Languages.
 Students will be provided with an up-to-date survey of developments in Web
Technologies.
 Enable the students to know techniques involved to support real-time Software
development.
Expected Outcome: To highlight the features of different technologies involved in Web
Technology and various Scripting Languages.
No of
Unit I
INTRODUCTION
Hrs : 7
Introduction to JAVA Scripts – Object Based Scripting for the web. Structures –
Functions – Arrays – Objects- CGI Concepts-CGI Client side –Server side-Authorization
and security.
No of
Unit II
DYNAMIC HTML
Hrs : 9
Introduction – Object refers, Collectors all and Children. Dynamic style, Dynamic
position, frames, navigator, Event Model – On check – On load – Onenor – Mouse rel –
Form process – Event Bubblers – Filters – Transport with the Filter – Creating Images –
Adding shadows – Creating Gradients – Creating Motion with Blur – Data Binding –
Simple Data Binding – Moving with a record set – Sorting table data – Binding of an
Image and table.
No of
Unit III
MULTIMEDIA
Hrs : 8
Audio and video speech synthesis and recognition - Electronic Commerce – E-Business
Model – E- Marketing – Online Payments and Security – Web Servers – HTTP request
types – System Architecture – Client Side Scripting and Server side Scripting –
Accessing Web servers – IIS – Apache web server.
No of
Unit IV
ASP – XML
Hrs : 7
ASP – Working of ASP – Objects – File System Objects – Session tracking and cookies –
ADO – Access a Database from ASP – Server side Active-X Components – Web
Resources – XML – Structure in Data – Name spaces – DTD – Vocabularies – DOM
methods.
No of
Unit V
SERVLETS AND JSP
Hrs :
7
Introduction – Servlet Overview Architecture – Handling HTTP Request – Get and post
request – redirecting request – multi-tier applications – JSP – Overview – Objects –
scripting – Standard Actions – Directives.
Text Book
1. Harvey M. Deitel and Paul J. Deitel,” Internet & World Wide Web How to
Program, 4th Edition ”, Pearson Education, 2008
24
References :
1. Eric Ladd, Jim O’ Donnel, “Using HTML 4, XML and JAVA”, Prentice Hall of
India – QUE, 1999.
2. Aferganatel, “Web Programming: Desktop Management”, PHI, 2004.
3. Raj kamal, ”Internet and Web Technologies”,Tata McGraw Hill, Eigth Reprint
September 2007.
4. Deven N. Shah,"A Complete Guide to Internet and Web Programming"
,Dreamtech Press, 2009
5. Shishir Gundavaram,"CGI programming on the World Wide Web", O'Reilly &
Associates, 1996.
CAT, Quiz, Seminar, Assignment, Term-End
Mode of Evaluation
Examination
Recommended by the Board of Studies on 01/04/2011
Date of Approval by the Academic Council: 22nd Academic Council held on 08/04/2011
25
ITY311
NETWORK PROGRAMMING
LTPC
3003
ITY306
Prerequisite
Objectives: The students shall be able to learn JAVA programming to share data across
Internet for File transfer, Software updates etc., and accomplish many Network
Programming tasks.
Expected Outcome: Students should be able to implement the networking concepts and
network protocols.
UNIT I
INTRODUCTION
No of Hrs
:7
Why networked Java?: What can a network program do?, Security, Basic network
concepts: Networks, The layers of a network, IP,TCP and UDP, The Internet, The
client/server model, Internet Standards, Basic Web concepts: URLs, and XML,HTTP.
UNIT II
URLs
No of Hrs
:7
Looking Up Internet Addresses: The InetAddress, Class, Inet4Address and
Inet6Address,The Network Interface Class, URLs: The URL class, URL encoder and
URL decoder Classes, Proxies, communicating with Server Side through GET.
UNIT III
SOCKETS FOR CLIENTS AND
No of Hrs
SERVERS
:9
Socket Basics, Investigating Protocols with Telnet, The Socket Class, Socket Exceptions,
Socket Addresses, Sockets For Servers: The Server Socket Class, Secure Sockets: Secure
Communications, Creating Secure Client Sockets, Methods of SSL Socket Class,
Creating Secure Server Sockets, Methods of the SSL ServerSocket Class.
UNIT IV
UDP DATAGRAMS AND SOCKETS AND
No of
URL CONNECTIONS
Hrs :8
The UDP protocol, The Datagram Packet Class, The Datagram Socket Class, URL
Connections: Opening URL Connections, Reading Data from a server, Reading the
Header, Configuring the Connection, Writing Data to a server, Http URL Connection.
UNIT V
REMOTE METHOD INVOCATION
No of
AND THE JAVA MAIL API
Hrs :7
What is RMI? Implementation, Loading Classes at Runtime, the java.rmi Package, the
java.rmi.registry Package, the java.rmi.server Package, The JavaMailAPI: What are Java
Mail API, Sending Email, Receiving Email, Password Authentication.
Text Book
1. Elliotte Rusty Harold “JAVA Network Programming” 3rd Edition published by
Sharoff Publishers and Distributors Pvt. Ltd, Mumbai, 2005.
Reference
1. David Reilly, Michael Reilly. "Java Network Programming & Distributed Computing",
Published by Addison-Wesley. 2002
Mode of Evaluation
CAT, Quiz, Seminar, Assignment, Term-End
Examination
Recommended by the Board of Studies on 01/04/2011
Date of Approval by the Academic Council : 22nd Academic Council held on 08/04/2011
26
ITY312
WIRELESS NETWORKS AND MOBILE
LTPC
COMPUTING
3003
ITY306
Prerequisite:
Objectives: To provide basics for various techniques in wireless techniques, Mobile
Communications and Mobile Content services.
Expected Outcome: students get thorough knowledge on mobile and wireless networks
UNIT I
WIRELESS COMMUNICATION
No of Hrs
FUNDAMENTALS
:7
Introduction – Wireless transmission – Frequencies for radio transmission – Signals –
Multiplexing –– SDMA – FDMA – TDMA – CDMA – Cellular Wireless Networks.
UNIT II
TELECOMMUNICATION NETWORKS
No of Hrs
:8
Telecommunication systems – GSM – GPRS – Satellite Networks - Basics – Parameters
and Configurations – Capacity Allocation – FAMA and DAMA – Broadcast Systems –
DAB - DVB.
UNIT III
WIRLESS LAN
No of Hrs
:7
Wireless LAN – IEEE 802.11 - Architecture – services – MAC – Physical layer –
HIPERLAN – Blue Tooth.
UNIT IV
MOBILE NETWORK LAYER
No of Hrs
:8
Mobile IP – Dynamic Host Configuration Protocol - Routing – DSDV – DSR –
Alternative Metrics.
UNIT V
TRANSPORT AND APPLICATION LAYERS No of Hrs
:8
. Traditional TCP – Classical TCP improvements – WAP
Text Books :
1. Jochen Schiller, “Mobile Communications”, PHI/Pearson Education, Second
Edition, 2003.
2. William Stallings, “Wireless Communications and Networks”, PHI/Pearson
Education, Second Edition, 2004.
References :
1. 1. Kaveh Pahlavan, Prasanth Krishnamoorthy, “Principles of Wireless Networks”,
PHI/Pearson Education, 2003.
2. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, “Principles of
Mobile Computing”, Springer, New York, 2003.
3. Hazysztof Wesolowshi, “Mobile Communication Systems”, John Wiley and Sons
Ltd, 2002.
Mode of Evaluation Assignments/Quizzes/Seminars/CAT/Term-end
01/04/2011
Recommended by
the Board of
Studies on
22nd Academic Council held on 08/04/2011
Date of Approval
by the Academic
Council
27
3003
SOFTWARE TESTING
LTPC
ITY309
To apply the various software testing methodologies for
software development.
Able to perform testing on small applications using software
Expected Outcome:
testing tools
Unit I
SOFTWARE TESTING
No of Hrs:8
PRINCIPLES
Software testing –Need for testing - Role of software testing - Psychology of testing –
Testing economics - White box, Black box testing – A structural approach to testing –
methods for developing test strategy - Testing methodologies. SDLC and Testing –
Verification & Validation.
Unit II
TESTING STRATEGIES
No of Hrs:7
White box testing techniques - Statement coverage - Branch Coverage – Condition
coverage - Decision/Condition coverage - Multiple condition coverage - Dataflow
coverage - Mutation testing - Automated code coverage analysis - Black box testing
techniques - Boundary value analysis - Robustness testing - Equivalence partitioning Syntax testing - Finite state testing - Levels of testing - Unit, Integration and System
Testing.
Unit III
LIFE CYCLE TESTING
No of Hrs:8
APPROACH
Requirements testing – Walk through test tool – Risk matrix test tool testing for
requirements phase and design phase – Design review test tool – Test data and volume
test tools. Installation phase testing – Tools for acceptance test – Software acceptance
process -Software maintenance Methodologies for testing – Training and change
installation.
Unit IV
TESTING METHODS, TOOLS
No of Hrs:7
AND TECHNIQUES
Testing methods, tools and techniques – Testing the Validity of software – Cost
estimate Strategies for cost estimation – Testing the Progress of software system –
Overview of point accumulation tracking system – Performance analysis of testing –
Inspection plan and test plan documents.
Unit V
TESTING AND OTHER
No of Hrs:8
RELATED ISSUES
Rapid prototyping – Spiral testing – Tool selection processes – Structural system testing
– Documentation of test results – Test effectiveness evaluation – Test measurement
process – Test metrics. Automated Tools for Testing - Static code analyzers - Test case
generators – GUI - Testing compilers and language processors - Testing web-enabled
applications.
Text Book
1. William E.Perry, " Effective Methods for Software Testing (2nd Edition) ", John
Wiley & Sons, 2004 2nd edition.
References
1. Glenford J.Myers, “The Art of Software Testing ", John Wiley & Sons, 1979.
2. Boris Beizer, Black-Box Testing: “Techniques for Functional Testing of Software
and Systems", John Wiley & Sons, 1995.
ITY401
Pre-requisite
Objectives:
28
Mode of Evaluation
Recommended by the
Board of Studies on
Date of Approval by
the Academic Council
Continuous Assessment (Quizzes, CATs, Assignments, etc.)
and TEE
01/04/2011
22nd Academic Council held on 08/04/2011
29
ITY402
NETWORK SECURITY
LTPC
ITY306
Prerequisite:
Objectives:
To teach various message encryption and decryption technique.
To provide the fundamentals of network security.
Expected Outcome: The students will be able to
• Perform encryption and decryption.
• Understand mechanisms of network security.
Unit I
INTRODUCTION
3003
No of Hrs
:
Introduction to Security attacks, services And mechanisms, Introduction to
cryptology, Conventional Encryption model, classical encryption techniques - stream
cipher, block cipher-substitution ciphers - transposition ciphers, Public key and
private key cryptography - cryptanalysis.
Unit II
MODERN BLOCK CIPHER
No of Hrs
:
Data encryption standard, Strength of DES, Differential &Linear Cryptanalysis of
DES, Block cipher modes of operation, Symmetric Ciphers: Advanced Encryption
standard, triple DES, Blowfish, Confidentiality using Symmetric encryption - key
distribution, random number generation.
Unit III
PRINCIPLE OF PUBLIC KEY
No of Hrs
CRYPTOGRAPHY
:
Principle of public key cryptography - prime and relative prime numbers, modular
arithmetic, RSA algorithm, security of RSA key management. Authentication
recruitments, Authentications functions, and Message Authentication codes, Digital
Signatures- Merkle-Hellman Knapsack public key cipher, authentication protocols,
Digital signatures Standard.
Unit IV
SYSTEM SECURITY
No of Hrs
:
Intruders: Intrusion Detection – Password management. Malicious Software: Viruses
and Related Threats – Virus countermeasures. Firewalls: Firewall design principles,
Types of Firewall, Firewall Configuration – Trusted Systems, Trojan Horse - email
virus, worms and macro viruses.
Unit V
NETWORK SECURITY
No of Hrs
:
Authentication applications - Kerberos, X.509 Directory Authentication Service,
Electronic Mail Security - Pretty Good Privacy, S/MIME, IP Security - IP Security
Architecture, Combining Security Associations, Key Management, Web Security Web Security Requirements, Secure Socket Layer and Transport Layer Security.
Text Books :
1. William Stallings, "Cryptography and Network Security – Principles and Practice",
4/E, Pearson Education, 2006.
2. B. A. Forouzan, Cryptography and Network Security, McGraw Hill, 2008.
3. Johannes A Buchmann, “Introduction to cryptography,” 2/E,Spiringer–verlag,
2004
References :
30
1. C. P. Fleeger and S. L. Fleeger, Security in Computing, 3/E, Pearson Education,
2003.
2. Mano W., Modern Cryptography: Theory & Practice, Pearson Education, 2004
3. Douglas R. Stinson, Chapman & Hall, “Cryptography Theory and Practice”, CRC
Press, 2002.
Mode of Evaluation Assignments/Quizzes/Seminars/CAT/Term-end
01/04/2011
Recommended by
the Board of Studies
on
Date of Approval by 22nd Academic Council held on 08/04/2011
the Academic
Council
31
ITY403
DATAWARE HOUSING AND
LTPC
3003
BUSSINESS INTELLIGENCE
ITY305
Prerequisite:
Objective: The data warehousing part of module aims to give students a good
overview of the ideas and techniques which are behind recent development in the data
warehousing, Business Intelligence and online analytical processing (OLAP) fields,
in terms of data models and storage techniques in Business Intelligence.
Expected Outcome: Students will be able to Capture the business and technical
requirements for BI project lifecycle and Business Intelligence solution architecture.
Unit I
Data warehouse building Blocks
No of
Hrs : 9
Data warehouse - The building Blocks: Defining Features, data warehouses and data
marts, overview of the components, metadata in the data warehouse -Defining the
business requirements: Dimensional analysis, information packages - a new concept,
requirements gathering methods, requirements.
Unit II
Data dimensional modeling
No of
Hrs : 9
Principles of dimensional modeling: Objectives, From Requirementsdata design, the STAR schema, STAR Schema Keys, Advantages of the STAR
Schema
Unit III
Data ware house project plan
No of
Hrs : 9
Stages of the Project - The Planning Stage - Justifying the Data warehouse - Overcoming Resistance to the Data warehouse-Developing a Project Plan, Data
warehousing Design Approaches - The Architecture Stage - The Data warehouse
Data Base - The Analysis Architecture - Data warehouse Hard Ware.
Unit IV
OLAP in the Data Warehouse
No of
Hrs : 9
OLAP in the Data Warehouse: Demand for Online analytical processing, need for
multidimensional analysis, OLAP definitions and rules, OLAP characteristics, major
features and functions, general features, dimensional analysis, hypercubes OLAP
models, overview of variations, the MOLAP model, the ROLAP model,ROLAP
versus MOLAP, OLAP implementation.
Unit V
Business Intelligence Architecture
No of
Hrs : 9
Introduction to Business Intelligence Architecture - Overview of Business
Intelligence Operations-Evaluating Operational Costs and Risks- Business
Intelligence Applications like Balanced Scorecard, Fraud Detection, Click stream
Mining, Market Segmentation, retail industry, telecommunications industry, banking
& finance and CRM etc
32
Text Books :
1. Paul Raj Poonia, “Fundamentals of Data Warehousing”, John Wiley & Sons, 2003.
2.Bussiness Intelligence Roadmap, The complete project lifecycle for decision
support applications, pearson education , 2003
References :
1. Data mining for Bussiness Intelligence concepts,techniques and applications in
MS office Excel with xlminer 2nd .ed
2. Larissa T.Moss,Shaku Atre foreword by Edward Yourdon copy erite 2003,
Sam Anahony, “Data Warehousing in the real world: A practical guide for building
decision support systems”, John Wiley, 2004.
Assignments/Quizzes/Seminars/CAT/Term-end
Mode of Evaluation
Recommended by the 01/04/2011
Board of Studies on
22nd Academic Council held on 08/04/2011
Date of Approval by
the Academic Council
33
WEB SERVICES AND SERVICE ORIENTED LTPC 3 0 0 3
ARCHITECTURE
Pre-requisite: ITY310
To provide fundamentals on SOA, SOAP UDDI and XML that lays
Objectives:
foundations for the advanced studies in the area of web services
ITY404
After completion of this course the students able to perform project in the
Expected
area of XML
Outcome:
UNIT I
SOA: (SERVICE ORIENTED ARCHITECTURE)
No of Hrs:7
Introduction to Services - Bind, Publish, Find – Framework for SOA – Web Services (A
Realization of SOA) - Web Services Architecture (Transport Services, Messaging Services,
Service Description, Discovery Services, Quality of Service), Interoperability – REST
(Representational State Transfer) Services.
UNIT II
XML BASICS
No of Hrs:8
XML Messaging, SOAP, UDDI and WSDL – Basics of XML – XML-RPC Essentials –
Real life web services – Standards of Web Service Stack – Web Services Vendor
Landscape, Building & Consuming XML Web Services in .NET, State Management.
UNIT III
SOAP: SIMPLE OBJECT ACCESS PROTOCOL
No of Hrs:8
Introduction to SOAP & XML – SOAP Specification – messages, Data Encoding, Data
types – Writing SOAP Web Services – Discovering SOAP Services.
UNIT IV
UDDI: UNIVERSAL DESCRIPTION, DISCOVERY
No of Hrs:7
AND INTEGRATION
Overview – UDDI Business Registry (UBR) – UDDI Model (UDDI Data Structures, Keys,
APIs, Nodes and Registries) - UDDI Implementations.
UNIT V
WSDL: WEB SERVICE DESCRIPTION
No of Hrs:8
LANGUAGE
WSDL Specification – Basic WSDL Example - Operations, Bindings, Service – Invocation
Tools – XML Schema Data Typing, Case Studies
Text Books
1. Sanjiva Weerawarana, Francisco Curbera, Frank Leymann, Tony Storey, Donals F.
Ferguson, Web Services Platform Architecture: SOAP, WSDL, WS-Policy, WSAddressing, WS-BPEL, WS-Reliable Messaging, and More, Prentice Hall PRT, 2005.
References:
1. XML Web Services for ASP.NET by Bill Evjen, Wiley Publishing Inc, 2002.
2.Web Services Essentials Distributed Applications with XML-RPC, SOAP, UDDI &
WSDL by Ethan Cerami, O’Reilly , First Edition, February 2002.
3. Programming Web Services with SOAP by James Snell, O’Reilly First Edition Dec
2001.
4. Web Services Theory & Practice by Anura Guruge, Digital Press, 2004.
5. Executive’s Guide to Web Services by Eric A. Marks & Mark. J. Werrell, John Wiley &
Sons, 2003.
By Assignment, Seminars and Written Examinations.
Mode of Evaluation
01/04/2011
Recommended by the
Board of Studies on
22nd Academic Council held on 08/04/2011
Date of Approval by the
Academic Council
34
ITY405
SOFTWARE PROJECT
LTPC
3003
MANAGEMENT
ITY309
Prerequisite:
Objectives: To understand and apply project management methodologies in software development.
Expected Outcome: The students would be able to understand the techniques and applications.
Unit I
INTRODUCTION
No of Hrs :7
Software projects-various type of projects-problems with software projects-an overview of project
planning –project evaluation-project analysis and technical planning-software estimation.
Unit II
ACTIVITY PLANNING
No of Hrs :7
Activity planning-project schedules-sequencing and scheduling projects-network planning modelshortening project duration identifying critical activities.
Unit III
RISK MANAGEMENT
No of Hrs :8
Risk Management-resource allocation-monitoring and control-managing people and organizing teamsplanning for small projects.
Unit IV
SOFTWARE CONFIGURATION MANAGEMENT
No of Hrs :8
Software Configuration Management – basic functions- responsibilities-standards-configuration
management-prototyping models of prototyping.
Unit V
No of Hrs :8
SOFTWARE MAINTENANCE
Software Maintenance characteristics - maintenance tasks – maintenance side effects – maintenance
issues – source code metrics – software reliability – definition of software reliability – concept of
software repair and availability – software error and faults – estimating number of bugs in computer
program – reliability models – availability models
Text Books :
1. Mike Cotterell, Bob Hughes - Software Project Management - Inclination/Thomas
Computer Press, 2004
2.Darel Ince, H.Sharp and M.Woodman - Introduction to Software Project Management
and Quality Assurance - Tata McGraw Hill.
References :
1.Ramesh.Gopalaswamy - Managing Global Projects - Tata MCGraw Hill - 2001
2.Humphrey, Watts - Managing the software process - Addison Wesley - 1986
3.Pressman : Software Engineering - A Practitioners approach - McGraw Hill - 1997
4.DeMarco and Lister - Peopleware
Mode of
Evaluation
Recommended by
the Board of
Studies on
Date of Approval
by the Academic
Council
Assignments/Quizzes/Seminars/CAT/Term-end
01/04/2011
22nd Academic Council held on 08/04/2011
35
ITY406
CLOUD COMPUTING
LTPC 3 0 0 3
ITY404
Prerequisite:
Objectives: students shall be able to
. understand the concept of cloud computing
. understand how to develop clouds and how to use them
.
Expected Outcome: student become familiar in the latest concept of cloud computing
UNIT I
UNDERSTANDING CLOUD
No of Hrs :
COMPUTING
Cloud Computing – History of Cloud Computing – Cloud Architecture – Cloud Storage –
Why Cloud Computing Matters – Advantages of Cloud Computing – Disadvantages of
Cloud Computing – Companies in the Cloud Today – Cloud Services.
UNIT II
DEVELOPING CLOUD SERVICES
No of Hrs :
Web-Based Application – Pros and Cons of Cloud Service Development – Types of Cloud
Service Development – Software as a Service – Platform as a Service – Web Services – OnDemand Computing – Discovering Cloud Services Development Services and Tools –
Amazon Ec2 – Google App Engine – IBM Clouds.
UNIT III
CLOUD COMPUTING FOR
No of Hrs :
EVERYONE
Centralizing Email Communications – Collaborating on Schedules – Collaborating on To-Do
Lists – Collaborating Contact Lists – Cloud Computing for the Community – Collaborating
on Group Projects and Events – Cloud Computing for the Corporation
UNIT IV
USING CLOUD SERVICES
No of Hrs :
Collaborating on Calendars, Schedules and Task Management – Exploring Online
Scheduling Applications – Exploring Online Planning and Task Management – Collaborating
on Event Management – Collaborating on Contact Management – Collaborating on Project
Management – Collaborating on Word Processing - Collaborating on Databases – Storing
and Sharing Files.
UNIT V
OTHER WAYS TO COLLABORATE
No of Hrs :
ONLINE
Collaborating via Web-Based Communication Tools – Evaluating Web Mail Services –
Evaluating Web Conference Tools – Collaborating via Social Networks and Groupware –
Collaborating via Blogs and Wikis.
Text Books :
1. Michael Miller, Cloud Computing: Web-Based Applications That Change the Way You
Work and Collaborate Online, Que Publishing, August 2008.
References :
1. Haley Beard, Cloud Computing Best Practices for Managing and Measuring Processes for
On-demand Computing, Applications and Data Centers in the Cloud with SLAs, Emereo Pty
Limited, July 2008.
Assignments/Quizzes/Seminars/CAT/Term-end
Mode of Evaluation
01/04/2011
Recommended by the
Board of Studies on
22nd Academic Council held on 08/04/2011
Date of Approval by
the Academic Council
36
ITY501
MULTI-CORE ARCHITECTURE AND
LTPC 3 0 0 3
PARALLEL PROGRAMMING
ITY214
Prerequisite:
Objective: To introduce the concept of multi core architectures and parallel programming
Expected Outcome: Students will be able to distinguish various multi core architectures and
to develop applications using multi threading
UNIT I
INTRODUCTION TO MULTIPROCESSORS No of Hrs : 8
AND SCALABILITY ISSUES
Scalable design principles – Principles of processor design – Instruction Level Parallelism,
Thread level parallelism. Parallel computer models –- Symmetric and distributed shared
memory architectures – Performance Issues – Multi-core Architectures - Software and
hardware multithreading – SMT and CMP architectures – Design issues – Case studies –
Intel Multi-core architecture – SUN CMP architecture.
UNIT II
PARALLEL PROGRAMMING
No of Hrs : 8
Fundamental concepts – Designing for threads. Threading and parallel programming
constructs – Synchronization – Critical sections – Deadlock. Threading APIs.
UNIT III
OPENMP PROGRAMMING
No of Hrs : 8
OpenMP – Threading a loop – Thread overheads – Performance issues – Library functions.
Solutions to parallel programming problems – Data races, deadlocks and livelocks – Nonblocking algorithms – Memory and cache related issues.
UNIT IV
MPI PROGRAMMING
No of Hrs : 7
MPI Model – collective communication – data decomposition – communicators and
topologies – point-to-point communication – MPI Library.
UNIT V
MULTITHREADED APPLICATION
No of Hrs : 7
DEVELOPMENT
Algorithms, program development and performance tuning.
Text Books :
1. Shameem Akhter and Jason Roberts, “Multi-core Programming”, Intel Press, 2006.
2. Michael J Quinn, Parallel programming in C with MPI and OpenMP, Tata Macgraw Hill,
2003.
References :
1. John L. Hennessey and David A. Patterson, “ Computer architecture – A quantitative
approach”, Morgan Kaufmann/Elsevier Publishers, 4th. edition, 2007.
2. David E. Culler, Jaswinder Pal Singh, “Parallel computing architecture : A hardware/
software approach” , Morgan Kaufmann/Elsevier Publishers, 1999.
Assignments/Quizzes/Seminars/CAT/Term-end
Mode of Evaluation
01/04/2011
Recommended by the
Board of Studies on
22nd Academic Council held on 08/04/2011
Date of Approval by
the Academic Council
37
ITY502
ARTIFICIAL INTELLIGENCE
LTPC 3 0 0 3
Prerequisite:
Objectives: To make the students to understand the concepts of intelligence,
modeling, simulation, knowledge representation, reasoning, issues, expert and fuzzy
systems.
Expected Outcome: The students would be able to understand the techniques and
applications of Artificial Intelligence
UNIT I
INTRODUCTION TO ARTIFICIAL
No of Hrs :8
INTELLIGENCE
Artificial Intelligence- Definitions, Programming Methods, Techniques, Intelligent
Systems, Predicate Calculus, Rule-Based Knowledge Representation.
UNIT II
HEURISTIC SEARCH AND STATE SPACE
No of Hrs :8
SEARCH
Techniques for Heuristic Search-Heuristic Classification- State Space SearchStrategies for State Space Search - Applications of Search Techniques in Game
Playing and Planning
UNIT III
EXPERT SYSTEMS
No of Hrs :8
Expert Systems- Stages in the development of an Expert Systems-Probability based
Expert Systems-Expert System Tools - Applications of Expert Systems.
UNIT IV
FUZZY SYSTEMS
No of Hrs : 7
Introduction of fuzzy Systems - Linguistic Description and their Analytical Forms –
Defuzzification Methods- Decision-making Applications.
UNIT V
ADVANCED INTELLIGENT SYSTEM
No of Hrs : 7
CONCEPTS
Procedures of Genetic Algorithms - Logic behind Genetic Algorithms - Swarm
Intelligent Systems Ant Colony Systems-Development and Applications of Ant
Colony Intelligence
Text Book :
1. N.P.Padhy: Artificial Intelligence and Intelligent Systems, Oxford University
Press, 2009.
Reference :
1. Efraim Turban, Jay E. Aronson, Ting-Peng Liang: Decision Support Systems and
Intelligent Systems, VII Edition, Prentice-Hall of India.
Assignments/Quizzes/Seminars/CAT/Term-end
Mode of
Evaluation
Recommended 01/04/2011
by the Board
of Studies on
22nd Academic Council held on 08/04/2011
Date of
Approval by
the Academic
Council
38
ITY503
DIGITAL IMAGE PROCESSING
LTPC 3 0 0 3
Prerequisites: ITY307
Objectives: On completing this course the students will be able to know the various
mathematical representations of the images for effective processing and can design
new processing applications that process the images and retrieve the necessary
information.
Expected Outcome: To acquire and process the images from various sources, to
identify the nature of the image and to get the information from the image
UNIT I
DIGITAL IMAGE REPRESENTATION
No of Hrs : 7
Digital image representation- fundamental steps in image processing- elements of
image processing systems. A simple image model- sampling and quantizationrelationships between pixels- image geometry.
UNIT II
TRANSFORMATION
No of Hrs : 8
Transformation-Introduction to Fourier transforms- discrete Fourier transformproperties of the two-dimensional Fourier transform- FFT
UNIT III
SPATIAL DOMAIN AND FREQUENCY
No of Hrs : 8
DOMAIN METHODS
Spatial domain and frequency domain methods- enhancement by point processingenhancement in the frequency domain. Spatial filtering- Colour image processing.
Degradation model- Diagonalization of circulant and block circulant matrices
UNIT IV
FUNDAMENTALS OF IMAGE
No of Hrs : 8
COMPRESSION
Fundamentals of image compression- image compression models- elements of
information theory- error free compression- Lossy compression.
UNIT V
DETECTION OF DISCONTINUITIES
No of Hrs : 7
Detection of discontinuities- edge linking and boundary detection- Thresholding, use
of motion in segmentation- Region oriented segmentation.
Text Book :
1. Rafael C Gonzalez and Richard E Woods, “Digital Image Processing”, Third
Edition, Pearson Education, 2008.
References :
1. Wilhelm Burger, Mark James Burge, “Principles of Digital Image Processing:
fundamental techniques”, Springer Series , 2009.
2. Annadurai, R. Shanmugalakshmi, “Fundamentals of Digital Image Processing”,
Pearson Education , 2007.
3. Anil K Jain “Fundamentals of Digital Image Processing” Prentice-Hall of India,
Private Limited, New Delhi, 2004.
Assignments/Quizzes/Seminars/CAT/Term-end
Mode of
Evaluation
Recommended 01/04/2011
by the Board
of Studies on
22nd Academic Council held on 08/04/2011
Date of
Approval by
the Academic
Council
39
ITY504
SOFTWARE AGENTS
LTPC 3 0 0 3
Nil
Prerequisites:
Objectives: This subject aims to cover basic concepts of software agents.
Expected Outcome: The students would be able to understand and explain fundamentals of
software agents and their applications.
Unit I
AGENT AND USER EXPERIENCE
No of Hrs : 7
Interacting with Agents -Interface Agent Metaphor with Character - Designing Agents Direct Manipulation versus Agent Path to Predictable
Unit II
AGENTS FOR LEARNING IN
No of Hrs : 8
INTELLIGENT ASSISTANCE
Agents for Information Sharing and Coordination - Agents without Programming Language –
Software Agents for cooperative Learning - Architecture of Intelligent Agents
Unit III
AGENT COMMUNICATION AND
No of Hrs : 8
COLLABORATION
Overview of Agent Oriented Programming - Agent Communication Language - Agent Based
Framework of Interoperability
Unit IV
AGENT ARCHITECTURE
No of Hrs : 8
Agents for Information Gathering - Open Agent Architecture - Communicative Action for
Artificial Agent
Unit V
MOBILE AGENTS
No of Hrs : 7
Mobile Agent Paradigm - Mobile Agent Concepts -Mobile Agent Technology - Case Study:
Tele Script, Agent Tel
Text Books :
1. Jeffrey M.Bradshaw," Software Agents ", MIT Press, 2000.
2.William R. Cockayne, Michael Zyda, “Mobile Agents", Prentice Hall, 1998
References :
1. Michael M. Luck, Ronald Ashri, Mark D'Inverno, “Agent-based software development”,
ARTECH HOUSE, INC , 2004
2. Russel & Norvig, " Artificial Intelligence: A Modern Approach ", Prentice Hall, 2nd
Edition, 2002
3. Joseph P.Bigus & Jennifer Bigus, “Constructing Intelligent agents with Java: A
Programmer's Guide to Smarter Applications ", Wiley, 1997.
Assignments/Quizzes/Seminars/CAT/Term-end
Mode of Evaluation
01/04/2011
Recommended by the
Board of Studies on
Date of Approval by the 22nd Academic Council held on 08/04/2011
Academic Council
40
ITY505
DATA COMPRESSION
LTPC3 0 0 3
TECHNIQUES
Course Prerequisites:
ITY211
Objectives: This subject aims to cover basic concepts of compression techniques.
Expected Outcome: The students would be able to understand and explain
fundamentals of compression techniques and their applications.
INTRODUCTION
Unit I
No of Hrs :
7
Compression techniques, lossless compression, lossy compression, measures of
performance, modeling and coding.
HUFFMAN AND ARITHMETIC
Unit II
No of Hrs :
CODING
8
Huffman coding algorithm, adaptive Huffman codes, applications. Arithmetic codes
- generating a binary code, compression of Huffman and arithmetic coding,
applications.
LOSS LESS IMAGE COMPRESSION No of Hrs :
Unit III
8
Introduction, facsimile encoding, run length encoding, progressive image
transmission, other approaches.
VECTOR QUANTIZATION
Unit IV
No of Hrs :
8
Introduction, advantages lbg-algorithm, empty cell problem, tree structured vector
quantizer, other vector quantization schemes.
DIFFERENTIAL AND TRANSFORM No of Hrs :
Unit V
CODING
7
Differential coding - basic algorithm dpcm, adpcm, Wave let transforms and
transform coding, dtwt for image compression, audio compression
Text Books :
1. Khalid Sayood , Introduction To Data Compression: 2nd Edition , Morgan
Kaufmann publishers, 2000.
2. David Salomon, Giovanni Motta, David (CON) Bryant, Handbook of Data
Compression, Springer series, 2009.
3. Ralf Steinmetz and Klara Nahrsedt, Multimedia Computing and Communication
and Applications, Prentice Hall Intl. 1995.
4. Raghuveer M. Rao, Wavelet Transforms: Introduction to Theory and Applications,
Addison Wesley Pub. Co. Ltd. 1998.
Mode of Evaluation
Recommended by the
Board of Studies on
Date of Approval by the
Academic Council
Assignments/Quizzes/Seminars/CAT/Term-end
01/04/2011
22nd Academic Council held on 08/04/2011
41
ITY506
PATTERN RECOGNITION
LTPC 3 0 0 3
Prerequisites: ITY307
Objectives: To introduce concepts of pattern recognition based on various
mathematical models
Expected Outcome: To understand the various theories related to pattern and
gain insight into classification and clustering.
Unit I
BAYESIAN DECISION THEORY
No of Hrs : 8
Machine perception, pattern recognition example, pattern recognition systems,
the design cycle, learning and adaptation. Continuous features – two categories
classifications, minimum error-rate classification- zero–one loss function,
classifiers, discriminant functions, and decision surfaces.
Unit II
NORMAL DENSITY
No of Hrs : 7
Univariate and multivariate density, discriminant functions for the normal
density different cases, Bayes decision theory – discrete features, compound
Bayesian decision theory and context.
Unit III
MAXIMUM LIKELIHOOD AND
No of Hrs : 8
BAYESIAN PARAMETER
ESTIMATION , COMPONENT
ANALYSES
Introduction, maximum likelihood estimation, Bayesian estimation, Bayesian
parameter estimation–Gaussian case. Principal component analysis, non-linear
component analysis; Low dimensional representations and multi dimensional
scaling.
Unit IV
UN-SUPERVISED LEARNING AND
No of Hrs : 8
CLUSTERING
Introduction, mixture densities and identifiability, maximum likelihood
estimates, application to normal mixtures, K-means clustering. Date description
and clustering – similarity measures, criteria function for clustering.
Unit V
DISCRETE HIDDEN MORKOV
No of Hrs : 7
MODELS AND CONTINUOUS
HIDDEN MARKOV MODELS
Discrete–time markov process, extensions to hidden Markov models, three
basic problems for HMMs. Observation densities, training and testing with
continuous HMMs, types of HMMs.
Text Books :
1. Richard O. Duda, Peter E. Hart, David G. Stroke, Pattern classifications,
Wiley student edition, Second Edition.
2., Lawerence Rabiner, Biing – Hwang Juang , Fundamentals of speech
Recognition. Pearson education.
Reference :
1.Earl Gose, Richard John baugh, Steve Jost , Pattern Recognition and Image
Analysis, PHI 2004
Mode of Evaluation
Assignments/Quizzes/Seminars/CAT/Term-end
42
Recommended by the Board
of Studies on
Date of Approval by the
Academic Council
01/04/2011
22nd Academic Council held on 08/04/2011
43
LTPC 3 0 0 3
ITY507
REAL-TIME SYSTEMS
Pre-requisites
Objectives:
ITY301
The students would be able to understand the real time systems
concepts to select architectures and programming languages,
Analyze the Real Time systems requirements, Evaluate the fault
tolerance techniques and systems reliability.
Understanding of concepts and techniques to build fault tolerant
Expected
Outcome:
real time systems
Unit I
INTRODUCTION
No of Hrs : 8
Issues in real-time system, task classes, architecture issues, operating system issues,
performance measure for real time systems, estimating program run times, classical
uniprocessor scheduling algorithm, uniprocessor scheduling of IRIS tasks.
Unit II
PROGRAMMING LANGUAGES AND
No of Hrs : 7
TOOLS
Introduction, desirable languages characteristics, data types, control structures,
facilitating hierarchical decomposition packages, exception handling, overloading and
generics, multitasking, task scheduling, timing specification, programming
environments, run-time support.
Unit III
REAL-TIME DATABASE &
No of Hrs : 7
COMMUNICATION
Basic definitions, real time vs. general purpose databases, main memory databases,
transaction priorities, transaction aborts, concurrency control issues, maintaining
serialization consistency, databases for real-time systems.
Unit IV
FAULT-TOLERANCE TECHNIQUES
No of Hrs : 8
Introduction, failure causes, fault types, fault detection, fault and error containment,
redundancy, data diversity, reversal checks.
Unit V
RELIABILITY & CLOCK
No of Hrs : 8
SYNCHRONIZATION
Introduction, obtaining parameter values, reliability models for hardware redundancy,
software error models, clock synchronization, nonfault-tolerant synchronization
algorithms, impact of faults.
Text Book
1. C.M. Krishna, Kang G. shin, “Real-Time systems”, McGraw Hill, 2004.
Reference
1. R.J.A. Buhr, D.L. Bailey, “An Introduction to Real-Time Systems”, Prentice-Hall
International, 1999.
Continuous Assessment (Quizzes, CATs,
Mode of Evaluation
Assignments, etc.) and TEE
01/04/2011
Recommended by the
Board of Studies on
22nd Academic Council held on 08/04/2011
Date of Approval by the
Academic Council
44