UNIVERSITY OF CALICUT

(Abstract)
B.Sc Programme in Information Technology – under Choice based Credit Semester System UG
– revised Syllabus– implemented with effect from 2009 admission onwards – approved – orders
issued.
GENERAL & ACADEMIC BRANCH-IV ‘J’ SECTION

U No. GA IV/J1/4639/10(ii) Dated, Calicut University PO, 13/09/2011

Read: 1. GA 1/J2/3601/08 (Vol II) dtd 19/6/09
2. U.O.No.GAI/J1/2471/06 27.06.09.
3. U.O. No: GA IV/J1/4639/10 dtd 20/2/10
4. U No. GA IV/J1/4639/10 dated 06.10.2010.
5. Minutes of the meeting of Board of Studies in Computer Science & Computer
Applications held on 04-06-2011- item No:2
6. Orders of the Vice-Chancellor dated 29.08.11 in file of even no.
ORDER
As per the paper read as (1) above Choice based Credit Semester System and
grading was implemented for all UG Programmes in this University w.e.f 2009-10
academic year onwards.
The Scheme and Syllabus of B.Sc Programme in Information Technolgy under
Choice based Credit Semester System (UG) was implemented as per U.O read as (2)
above.
Vide paper read as (3) & (4) above; the syllabi of Complementary Courses of BSc.
Information Technology Programme for II semester & III semester respectively were
implemented.
The Board of studies in Computer Science & Application held on 4/06/11 as per
item No:2 resolved to approve the revised syllabus of B.Sc Information Technology
Programme – (a) Open Courses and (b) Elective papers vide paper read as 5 above.
The Vice-Chancellor, in view of exigency, exercising the powers of Academic
Council has approved the minutes of the meeting of the Board, subject to ratification by
the Academic Council vide paper read as (6) above.
Sanction has therefore been accorded for implementing the revised Syllabus of
B.Sc Information Technology Programme (a) Open Courses and (b) Elective papers
with effect from 2009 admission onwards.
Orders are issued accordingly. Syllabus appended.
Sd/-
DEPUTY REGISTRAR(G&A IV)
For REGISTRAR
To
The Principals of all affiliated Colleges offering
B.Sc Programme in Computer Science

Copy to:
CE/EX section/EG-I/DR-B.Sc/DR III Exam/Tabulation section/ Forwarded/By Order
System Administrator (with a request to upload in the
University website)/Enquiry/Information Centres/GA I ‘F’/
SF/DF/FC
SECTION OFFICER
D:\CCSS SYLLABUS IT & CS\J1 4639- BSC- IT ORDER.doc
 UNIVERSITY OF CALICUT

FACULTY OF SCIENCE

Curriculum, Syllabi and Scheme of Examinations

for the

B.Sc INFORMATION TECHNOLOGY

Degree Program

With effect from Academic Year 2009-2010

1
 PROGRAM OBJECTIVE

There are two main objectives to the B.Sc Information Technology Program.
I. To make students as computer professionals, who can be directly employed or start
his/her own work as Web Designer, Database User, Programmer, Testing
professional, Designer of a System and Network implementer
II. To train students to a level where they can readily compete for seats for advanced
degree courses like MCA, MSc(CS), MSc(IT) and MBA etc
On completion of the B.Sc Information Technology Program, the student will:
• Have basic communicative skill in the English language
• Have environmental and civic awareness
• Communicative skills and literary sensibility in languages other than English
• Have sound knowledge of the theory behind the core subjects like, computer
architecture, operating systems, data structures, data bases, computer networks.
• Have sound skills in selected procedural and visual programming languages,
designing databases and managing them, software engineering and web-based
applications
• Be in a position to develop industrial applications

ELIGIBILITY

Candidate seeks admission to the B.Sc Information Technology Program should

have passed the Higher secondary/Technical higher secondary /Vocational Higher
secondary examinations of Govt. of Kerala or CBSE or ICSE or any other examinations
recognized as equivalent there to by the University of Calicut with Mathematics or
Computer Science or Computer Applications as one of the optional subjects.

DURATION OF THE PROGRAM

Duration of the program shall be 6 semesters. Each semester should have 90

instructional days with 5 hours of instruction per day 5-days a week system. The
University will conduct semester-end examination.

2
 PROGRAM STRUCTURE

S C Contact
e ou Hours
m rs T C
T
e e Course h re
Courses Course Title L o
s N Code e di
a t
t o o ts
b a
e r
l
r y
Common
1 IT1A01 Communication Skill in English 5 0 5 4
Course - 1
Common Course - Critical reasoning , writing and
I 2 IT1A02 4 0 4 4
2 presentation
S
Literature in Languages other
e Common Course -
3 IT1A03 than English / Basic Numeric 4 0 4 4
m 3
Skill
e
Core
s 4 IT1B01 Programming in C 2 2 4 2
Course - 1
t
Complementary
e 5 IT1C01 Basic Electronics 2 2 4 3
Course - 1
r
Complementary Digital Fundamentals
6 IT1C02 4 0 4 3
Course - 2 &Computer Organization
Total (6 Courses) 25 20
Common
7 IT2A04 Reading literature in English 4 0 4 4
Course - 4
I Common Literature and contemporary
8 IT2A05 4 0 4 4
I Course - 5 issues
S
Common Communication Skill in
e 9 IT2A06 4 0 4 4
Course - 6 Languages other than English.
m
e Core
10 IT2B02 Computer Graphics & Animation 3 2 5 4
s Course - 2
t Complementary
11 IT2C03 Probability & Statistics 4 0 4 3
e Course - 3
r Complementary
12 IT2C04 Microprocessor 2 2 4 3
Course - 4
Total (6 Courses) 25 22
I Common History and Philosophy of
13 IT3A07 4 0 4 4
I Course - 7 Science.
I Common
14 IT3A08 Basics of Business Management 4 0 4 4
S Course - 8
e Core
m 15 IT3B03 Theory of Computation 4 0 4 3
Course - 3
e Core
s 16 IT3B04 Data structures & Algorithms 5 0 5 3
Course - 4

3
 Complementary Discrete Mathematics & Number
17 IT3C05 4 0 4 3
Course - 5 theory
Complementary Micro controllers & Integrated
18 IT3C06 2 2 4 3
Course - 6 Circuits
Total (6 Courses) 25 20
Common
19 IT4A09 Basic Numerical Skills 4 0 4 4
Course - 9
I
Common
V 20 IT4A10 Entrepreneurship Development 4 0 4 4
Course - 10
Core
S 21 IT4B05 OOP&C++ 4 0 4 3
Course - 5
e
Programming
m Core
22 IT4B06 Laboratory –Data structures 0 5 5 3
e Course - 6
using C++
s
Complementary
t 23 IT4C07 Numerical Methods & OR 4 0 4 3
Course - 7
e
r 24 Complementary IT4C08 Digital Signal Processing 4 0 4 3
Course - 8
Total (6 Courses) 25 20
Core
25 IT5B07 Data communication 4 0 4 3
Course - 7
Core
26 IT5B08 Software Engineering 4 0 4 3
Course - 8
V Core
27 IT5B09 DBMS 4 0 4 4
Course - 9
S Elective I:
e A. Java
m 28 Core IT5B10 B. .Net technologies 4 0 4 3
e Course - 10
C. Grid Computing
s D. Simulation & Modeling
t Core
e 29 Course - 11 IT5B11 Mini Project 0 4 4 --
r
A. Web Programming
Open
30 IT5D01 B. Introduction to Computers & 3 2 5 3
Course - 1
Office Automation
Total (6 Courses) 25 16
V Core Computer Networks &
31 IT6B12 4 0 4 3
I Course - 12 Administration
S Core
32 IT6B13 Operating System 4 0 4 3
e Course - 13
m Elective II:
e A. Mobile Computing
s 33 Core IT6B14 B. Data Mining & 4 0 4 3
t Course - 14
Warehousing
e C. Software Testing
r Core
34 IT6B15 Multimedia Technologies 4 0 4 3
Course - 15

4
 Core
35 IT6B16 Project 0 5 5 7
Course - 16
A. Cryptography & Network
Security
Open
36 IT6D02 4 0 4 3
Course - 2
B. Image Processing

Total (6 Courses) 25 22

IT1B01: PROGRAMMING IN C

Unit – I (10 Hours)

Programming principles: Algorithms, Flow charts. Computer Language: Classification.
Program Concept: Source program, Compiling, Program execution, Object program.
Measures of program performance. C- Language Fundamentals: Tokens, Fundamental
data types, Precedence of evaluation.
Unit – II: (10 Hours)
Flow of Control: Branching: If statement, If – else and Else – If constructs, nested if
statements, switch statements. Looping: for loops, while and do-while loops, nested
loops, break and continue statements.

Unit –III :(12 Hours)

Arrays: Definition, One-dimensional arrays, Two-dimensional arrays, Initializing one and
two dimensional arrays. Strings: Declaring and initializing strings, Reading and writing
strings. Functions: Definition, Types of functions, Function prototyping, Arguments and
return values, Nesting of functions, Recursive functions, String functions. Scope and
Extent of Variables: Local and global variables, auto, static and register variables.

Unit – 1V: (12 Hours)

Structures and Union: Definitions, Arrays of structures, Structures with in structures,
Structures and functions, sizeof() operator. Pointers: Definition, Pointers and structures,
Pointers and functions, Pointers and arrays, Operations on pointers.

Unit – V: (10 Hours)

Input and output: Character I/O, Formatted I/O, print and scan functions. File: Defining
and opening a file, Closing a file, I/O operations on files, Error handling, Random access.
The preprocessors: #define, #include, #if, #undef, etc. Command line arguments.
Dynamic memory allocation.

REFERENCES
1. E Balaguruswamy, “ Programming in ANSIC”.
2. Kelley, A & Pohl, I;, “A Book on C”, Addison - Wesley

5
 3. Venu Gopal K.R.&Prasad, S.R. “Programming with C”, Tata McGraw Hill
4. S.G.Kochen , “Programming in C”.
5. Kernigham and Ritchie, “C Language Reference”.

IT2B02: COMPUTER GRAPHICS & ANIMATION

Unit – I :( 10 Hours)
Video display device : Cathode ray tube, Raster scan displays, Random scan
displays. Raster scan systems, Random scan systems, Input devices, Graphics
softwares.

Unit – II :( 12 Hours)
Output Primitives : Points & Lines, Line drawing Algorithms, Loading the frame buffer,
Circle & Ellipse generating Algorithms, Pixel addressing & Object geometry, Fill area
primitives , Character generation

Unit –III :( 10 Hours)

2-D Geometric Transformations : Basic Transformations , Matrix representation &
Homogeneous Coordinates, Composite Transformations, Other Transformations,
Transformations between Coordinate Systems, Raster methods for Transformations

Unit – 1V :( 12 Hours)
2- Dimensional Viewing : Viewing pipeline, Viewing Coordinate reference frame,
Window-to-view port coordinate transformation, Line clipping, Polygon Clipping, Curve
Clipping.

Unit – V :( 10 Hours)
3 -D Concepts : 3 -D display methods. 3-D Geometric & Modeling Transformations:
Translation, Rotation, Scaling, Other Transformations, Composite Transformations,
Modeling & Coordinate.

REFERENCES
nd
1. D.Hearn & M.P.Becker , “Computer graphics”; 2 Ed., Prentice Hall India-
1995
2. Foley Vandam & Hughes, “ Computer Graphics”; Addision Wesly
3. Angel Edward., “Interactive Computer Graphics – A Top-down Approach with
OpenGL” ,Addison-Wesley 1996.
4. Newmann W and Sproull R.F., Principles of Interactive Computer Graphics,
McGraw-Hill, 1980

6
 IT3B03: THEORY OF COMPUTATION

Unit – 1: (12 Hours)

Mathematical Preliminaries: Sets, Relations and Functions, Graphs and Trees, Strings
and their properties, Principle of induction. The Theory of Automata: Definition of an
automation, Description of a finite automation, Transition systems, Properties of
transition functions, Acceptability of a string by a finite automation, Nondeterministic
finite state machines, The Equivalence of DFA and NDF, Mealy and Moore Models,
Minimization of finite automata.

Unit – II: (10 Hours)

Formal Languages: Basic definitions and examples, Chomsky classification of
Languages, Languages and their relation, Recursive and recursively enumerable sets,
Operations on languages, Languages and automata.

Unit –III: (10 Hours)

Regular Sets and Regular Grammars: Regular expressions, Finite automata and regular
expressions, Pumping lemma for regular sets, Application of pumping lemma, Closure
properties of regular sets, Regular sets and regular grammars.

Unit – 1V: (12 Hours)

Context -Free Languages: Context – free languages and derivation trees, Ambiguity in
context – free grammars, Simplification of context –free grammars, Normal forms for
context-free grammars, Pumping lemma for context – free languages, Decision
Algorithms for context – free languages. Pushdown Automata: Basic definitions,
Acceptance by pda, Pushdown automata and context – free languages, Parsing and
pushdown automata.

Unit – V: (12 Hours)

Turing Machines and Linear Bounded Automata: Turing machine model, Representation
of Turing machines, Languages acceptability by Turing machines, Design of Turing
machines, Description of Turing machines, Techniques for TM construction, Variants of
Turing machines, The Model of Linear Bounded Automaton, Turing machines and Type
0 Grammars, Linear bounded automata and languages. Decidability and Recursively
Enumerable Languages: The definition of an algorithm, Decidability, Decidable
languages, Undecidable languages, Halting problem of Turing machine, The post
correspondence problem.

REFERENCES
1. KLP Mishra & N Chandrasekaran, “Theory of Computer Science”,3rd Edition,
Prentice Hall,2007
2. H.R.Lewis and C.H.Papadimitriou, “Elements of the Theory of Computation”,
Prentice Hall of India, 1996.
3. Linz: P. An Introduction to Formal Languages and Automata, Narosa, 1998
4. Hoporoft J.E.and Ullman J.D., Introduction to Automata Theory Languages and
Computation, Narosa, 1981

7
 IT3B04: DATA STRUCTURES & ALGORITHMS

Unit – 1: (10 Hours)

Introduction: Elementary data organization, Data structures, Data structure operations,
Algorithmic notation, Control structures, Complexity of algorithms, String processing,
Structured approach in programming, Top-down design, Recursive procedures and
algorithms.

Unit – II: (10 Hours)

Arrays, Records and Pointers: Linear arrays, Representation, Traversing, Inserting and
deleting, sorting and searching, Binary search. Multidimensional arrays, Pointers,
Records, Representation, Matrices, Sparse matrices, Sparse matrix operations

Unit –III :( 14 Hours)

Linked Lists: Concept, Representation, Traversing, Inserting and deleting, Searching,
Types of linked lists (circular, doubly circular doubly), garbage collection. Stacks and
Queues: Definition, Fundamental operations on stacks, array representation, linked list
representation, polish notation, Applications of stack, Concepts of queues, dequeues and
priority queues.

Unit – 1V: (10 Hours)

Tress: Basic terminology, Binary tree representation, Traversing binary trees, Traversing
algorithms using stack, Threads, Binary search tree, Operations; Heap: Storage
representation and manipulation of binary trees, Huffman’s algorithm, General trees.
Graphs: Concept, Representation, Operations.

Unit – V: (12 Hours)

Sorting and Searching: Sorting types, Insertion sort, Selection sort, Merging, Merge sort,
quick sort, radix sort, bubble sort, heap sort; Searching: Binary search and linear search
comparison, Hashing.
.
REFERENCES
1. Seymour Lipschutz, “Theory and Problems of Data Structures”, International
Edition,1986
2. E.Horowitz, S Sahni & D Mehta,” Fundamentals of Data Structures in C++”,1st
Edition, Galgotia,2005
3. S Sahni, “Data Structures, Algorithms, and Applications in C++”, International
Edition, McGraw Hill, 2000.
4. Wirth N, “Algorithms + Data Structures = Programs”, Prentice Hall International,
2001.

8
 IT4B05: OBJECT ORIENTED PROGRAMMING & C++

Unit – 1 :( 8 Hours)
Object Oriented Paradigm: Evolution of programming paradigms, Structured verses
object –oriented development, Elements of OOP, Objects, Classes, Multiple views of the
same object, Encapsulation and data abstraction, Inheritance, Delegation, Polymorphism,
Message communication, Merits and demerits of OO methodology.

Unit – II: (12 Hours)

Stream based I/O, Comments, iostream library, Scope resolution operator, Variable
declaration and definition, Runtime memory management. Data Types, Operators and
Expressions. Control Flow, Arrays and Strings.

Unit –III: (10 Hours)

Modular Programming with Functions: Function components, Passing data to functions,
Function return data type, Library functions, Parameter passing, Return by reference,
Parameter passing, inline function, Function overloading, Function Templates, Arrays
and functions, Complete syntax of main(). Pointers and Runtime Binding. Classes and
Objects.

Unit – 1V: (12 Hours)

Object Initialization and cleanup: Constructors, Parameterized constructors, Destructor,
Constructor overloading, Order of constructor and destructor, Dynamic initialization
through constructors, Constructors with dynamic operations, Copy constructors, Nested
classes. Dynamic Objects. Operator Overloading. Inheritance. Virtual Functions.

Unit – V: (12 Hours)

Generic Programming with Templates, Stream Computation with Files, Exception
Handling, Standard Template Library, Object Oriented System Development.

REFERENCES
1. K R Venugopa, Ravikumar, T Ravisankar, “Mastering C++”, 19th Reprint,
TataMcGraw-Hill, 2005.
2. E Balaguruswami, “Object Oriented Programming with C++”, 2nd Edition,
TataMcGraw-Hill, 2002
3. Stanly B lippman , “The C++ Primer”,Addison Wesly
4. Cohoon & Davidson, “C++ Program Design”, Tata McGraw-Hill

9
 IT4B06: PROGRAMMING LABORATORY
DATA STRUCTURES USING C++

MENU DRIVEN C++ PROGRAMS USING CLASS

• Data structure operation using Array and Linked list

• Stack and Queue using Array and Linked list.
• Dequeue using Array and Linked list.
• Polynomial Operations on Two Polynomials: Addition, Subtraction,
Multiplication using Arrays and Linked lists.
• String operations
• Stack Application: Expression evaluation.
• Sorted linked list
• Doubly linked list.
• Circular linked list and Circular Doubly linked list.
• Operator Overloading: +,-,+=,-=,>>,<<.
• Sorting: Bubble, Insertion, Selection, Quick, Merge, Heap
• Searching : Linear, Binary
• Binary Search Tree
• Prepare list of students details using linked list data structure
.
REFERENCES
1. Seymour Lipschutz, “Theory and Problems of Data Structures”, International
Edition,1986
2. E.Horowitz, S Sahni & D Mehta,” Fundamentals of Data Structures in
C++”,1st Edition, Galgotia,2005.
3. Yashavant P.Kanetker, “Data Structures Through C++”, 1st Edition, BPB
Publications, 2007
4. K R Venugopa, Ravikumar, T Ravisankar, “Mastering C++”, 19th Reprint,
TataMcGraw-Hill, 2005.
5. E Balaguruswami, “Object Oriented Programming with C++”, 2nd Edition,
TataMcGraw-Hill, 2002

10
 IT5B07: DATA COMMUNICATION

Unit – 1 :( 10 Hours)
Evolution of modern communication system-PSTN-ISDN-Analog and digital signals-
common terminology-Voice channels-RS 232 serial communication-Data communication
equipments (DCE)-Data terminal equipments (DTE)-channel organization-Asynchronous
and synchronous protocols-Binary synchronous protocols (BSP)-Bit-oriented protocols
(BOP)-Modes of channel operation-simplex, half-duplex and full duplex-Modulation

Unit – II :( 10 Hours)
Overview-Network transmission media-connecting network devices-common physical
topology-connecting a simple network-controlling data transmission-ISO and OSI model-
seven layers of OSI model-network communication through OSI model-standards and
open systems, TCP/IP Protocol suite.

Unit –III: (10 Hours)

Client-server network OS-Peer-to-Peer network OS-Desktop OS-application software-
Internet working- Bridges and routers-Netware Internet working-protocols-IPX-RIP-
NLSP-service advertising protocols (SAP)-Netware core protocols(NCP)-Sequence of
packet exchange-Gate ways-Basic ideas of WAN, ATM, FDDI, X.25, FRAME
RELAY, ISDN AND SONET.

Unit – IV: (10 Hours)

Introduction-POPI-POP3-Point-to-point protocols (PPP)-link control protocols (LCP)-
Network control protocols (NCP)-Simple mail transfer protocols (SMTP)

Unit – V: (10 Hours)

Evolution-Services-Basic structure-Accessibility-Domain names-E0-mail-World wide
Web-Web browsers and server-Basic terminology-information retrieval-Archie-Gopher-
FTP-Telnet-Finger-Wais-Usenet news-Ping-Trace route-Nalookup- Search engines-
Yellow pages and directories-Web pages and HTML- Multimedia and communication-
Net meeting-ICQ-Powwow-Internet relay chat-Netiquette-Firewalls- Internet
management-Security-Intranet - Corporate on-line presentation of information.

REFERENCES
1. Leon-Garcia&Widjaja , “Communication Networks”, TataMcGraw-Hill
2. Andew S Tanenbaum, “Computer Networks”, Prentice Hall
3. Greenlaw & Hepp, “Fundamentals of the Internet and world wide Web”, Tata-
McGraw Hill.
4. B.Forouzan, Data Communication and Networking, Tata McGRaw Hill, 1998

11
 IT5B08: SOFTWARE ENGINEERING

Unit – 1: (10 Hours)

Introduction to software engineering – computer based system engineering – project
management – activities, project planning, activity organization, project scheduling.

Unit – II: (10 Hours)

Requirements engineering – requirements analysis – system models – requirements
definition and specification – software prototyping – formal specification – algebra
specification – model – based specification.

Unit –III: (10 Hours)

Software design-architectural design – object oriented design – function oriented design –
real – time systems design – user interface design – software reliability – programming
for reliability – software reuse.

Unit – 1V: (10 Hours)

Verification and validation – defect testing – static verification – managing people –
software cost estimation – quality management – process improvement.

Unit – V: (10 Hours)

CASE classification – integrated CASE – the CASE life cycle – CASE workbenches –
programming workbenches – meta – CASE workbenches – software engineering
environments.

REFERENCES
III. Ian Sommerville, Software Engineering, 6/e, Pearson Education Asia, 2001.
IV. R.S.Pressman, Software Engineering, 4/e, MacGraw Hill, 1997.
V. P.Jalote, An Integrated Approach to Software Engineering, Narosa, 1993

12
 IT5B09: DATA BASE MANAGEMENT SYSTEMS

Unit – 1: (12 Hours)

Databases and Database Users: Characteristics of database approach, Actors behind the
scene, Workers behind the scene. Advantages of using the DBMS approach, Database
application, Disadvantages. Database System-Concepts and Architecture: Data Models,
Schema, and Instances, Three schema architecture and data Independence, Database
languages and interfaces, The database system environment, Centralized and client/server
architecture for DBMS, Classification of DBMS.

Unit – II: (10 Hours)

Data Modeling using the E-R Model: Entity types, Entity sets, Attributes, and Keys,
Relationship types, Weak entity types, EER modeling. The Relational Data Model and
Relational Database Constraints. Relational algebra and Relational calculus

Unit –III : (12 Hours)

Relational Commercial languages, Structured Query languages (SQL), Query by
example. Relational Database Design: Informal design guidelines for relation schema,
Functional dependencies, Normal forms, General definition of second and third normal
forms, BCNF, Properties of relational decompositions, Algorithms for relational database
schema design, Multi-valued dependencies and forth normal form, Join dependencies and
fifth normal form..

Unit – 1V : (10 Hours)

Algorithms for Query Processing and Optimization. Transaction Processing Concept:
Introduction, Transaction and system concept, Characterizing schedules, Concurrency
control technique, Database recovery concept, Recovery Technique

Unit – V : (10 Hours)

Distributed Databases and Client –Sever Architecture: Concept, Transparency, Types of
distributed databases, Distributed query processing. Object oriented databases: Object
structure, Class hierarchy, Multiple inheritance, Object identity, Physical organization,
Object oriented queries.

REFERENCES
R Elmasri, S B Navathe, D V L N Somayajulu, S K Gupta, “Fundamentals of Database
Systems”, 4th Edition, Pearson Education, 2007.
H.F. Korth, A Silberschatz and S. Sudarasan, “Database System Concepts”, Computer
Science Series, McGraw-Hill, 1997
C.J.Date, “An Introduction to Data Base Systems,” Volume L Addison Wesley, Reading,
MA, 1990
Database Management And Design – Hansen & Hansen – Prentice Hall of India.

13
 ELECTIVE-I
IT5B10A: JAVA

Unit – 1: (10 Hours)

Fundamentals of Object Oriented Programming. Evolution : Features, Environment, JFC.
Constants, Variables & Data Types.

Unit – II: (12 Hours)

Operators and Expressions. Decision Making : Branching, Looping

Unit –III: (12 Hours)

Classes, Objects and Methods. Arrays, Strings and Vectors. Interfaces. Packages. Multi
threaded Programming. Exceptions.

Unit – 1V:(10 Hours)

Applet Programming. Graphic Programming.

Unit – V: (10 Hours)

Managing Input/Output files. Java Collection. JDBC. Concepts of J2EE

REFERENCES

1. E. Balaguruswami, “ Programming with Java a Primer”, 3rd Edition, Tata

McGraw-Hill, 2008
2. Andy Harris, “ Java 2-Fast and Easy Web development”, Prentice-Hall
3. Peter Rossbach & Hendrisk Schereiber, “Java – Server And Servlets”, Person
Education
4. Vivek Sharma & Rajiv Sharma, “Developing E-commerce Sites” Person
Education
5. Matt J Crouch , “Web Programming Wuith ASP”, Person Education

14
 IT5B10B: .NET TECHNOLOGY
Unit – 1 :( 10 Hours)
Basic of the net framework: .net architecture, Managed code, Assemblies, Execution of
assembler code, .net framework class library, common type system, common language
specification, interoperability with unmanaged code.

Unit – II: (12 Hours)

Introducing ASP.NET: Creating Web Forms, Adding ASP.NET Code to a page Handling
page events, Discussion: ASP vs. ASP.NET: working model of architecture of server
controls, Add an HTML server control to a page, Access the properties and methods of
server controls in code, Add event handlers for page events, Use the IsPostback property
to handle postback forms, Using Web Controls: Web controls, using intrinsic Controls,
Using input Validation controls, selecting controls for Applications. Bind two controls
together

Unit –III: (12 Hours)

Using Microsoft ADO.NET to Access Data: Overview of ADO.NET. Connecting to a
Data Source. Accessing Data with DataReaders. Binding to Extensible Markup
language (XML) Data.

Unit – 1V: (10 Hours)

Separating Code from Content: Advantages of Partitioning as ASP.NET page. Creating
and Using Code-Behind. Creating and Using User Controls. Creating and Using
components.

Unit – V: (10 Hours)

Using Trace in Microsoft ASP.NET Pages: Overview of Tracing. Trace information.
Page-Level Trace. Application, Level Trace.

REFERENCES
E. G.Buczek, “ ASP.NET Developers Guide”, TMH 2002
F. Richard Anderson, “Professional ASP.NET”, Wrox Press Ltd.
G. “.NET Framework Essentials”. 3rd Edition (O’Reilly)
H. Sams, “ Teach yourself ASP”, Lupez

15
 IT5B10 C GRID COMPUTING

UNIT – I INTRODUCTION
The Grid - Past, Present, Future, A New Infrastructure for 21st Century Science
- The Evolution of the Grid - Grids and Grid Technologies, Programming models -
A Look at a Grid Enabled Server and Parallelization Techniques – Grid
applications

UNIT – II THE ANATOMY OF THE GRID

The concept of virtual organizations – Grid architecture – Grid architecture and
relationship to other Distributed Technologies – computational and data Grids,
semantic grids

UNIT – III THE OPEN GRID SERVICES ARCHITECTURE

Grid Management systems, security, Grid Grid-Enabling software and Gridenabling
network services, Data Grid - Virtualization Services for Data Grids,
Peer-to-Peer Grids - Peer-to-Peer Grid Databases for Web Service Discovery

UNIT – IV THE OPEN GRID SERVICES INFRASTRUCTURE

Technical details of OSGI specification, service data concepts, Naming and
Change Management Recommendations – OGSA basic services

UNIT – V APPLICATION CASE STUDY

Molecular Modeling for Drug Design and Brain Activity Analysis, Resource
management and scheduling, Setting up Grid, deployment of Grid software and
tools, and application execution

REFERENCES:
1. Fran Bermn, Geoffrey Fox, Anthony Hey J.G., "Grid Computing: Making the
Global Infrastructure a Reality", Wiley, USA, 2003
2. Joshy Joseph, Craig Fallenstein, "Grid Computing", Pearson Education,
New Delhi, 2004,
3. Ian Foster, Carl Kesselman, "The Grid2: Blueprint for a New Computing
Infrastructure". Morgan Kaufman, New Delhi, 2004
4. Ahmar Abbas, "Grid Computing: Practical Guide to Technology and
Applications", Delmar Thomson Learning, USA, 2004.

16
 IT5B10D SIMULATION & MODELLING
UNIT-I: Introduction to Simulation: Areas of Application, Systems and system
Environment, Components of a System, Discrete and continuous systems, Types of
Models. General Principles: Concepts in Discrete-Event Simulation, List Processing.

UNIT -II: Statistical Models in Simulation: Review of Technology and concepts, Useful
Statistical Models, Discrete Distributions, Continuous Distributions, Poisson Process,
Empirical Distributions. Queuing Models: CharacteristiIT and notation, Transient and
study state behavior of Queues, Long Run Measures of Performance of Queuing Systems,
Study state behavior of Infinite population Markovian Models.

UNIT -III: Random Number Generation: Properties of Random Numbers, Generation of

Pseudo-Random Numbers, Techniques for generating random numbers, Tests for
Random Numbers. Random Variate Generation: Inverse transform technique, Direct
Transformation for the Normal Distribution, Convolution Method, Acceptance-Rejection
Technique.

UNIT -IV: Input Modeling: Data Modeling, Identifying the Distribution with Data,
Parameter Estimation, Goodness-of-Fit Tests, Selecting Input models without Data,
Multivariate and Time series Input Models. Verification and Validation of Simulation
Models: Model Building, verification and validation, verification of simulation models,
calibration and validation of Models.

UNIT -V: Output Analysis for a Single Model: Stochastic Nature of Output Data, Types
of Simulations with Respect to output Analysis, Measure of Performance and their
Estimation, Output Analysis for Terminating Simulations, Output Analysis for Steady-
state Simulations. Comparisons and Evaluation of Alternative System Design:
Comparison of Two system designs, comparison of several system designs, Statistical
Models for Estimating the Effect if Design Alternatives, Meta Modeling.

TEXT.BOOK

1. Jerry Banks, John S.Carson, II and Barry L. Nelson, Discrete - Event System
Simulation 2nd Edition

References
1. Deo N, system Simulation and Digital Computer, Prentice hall of India
2. Gordan G, system Simulation 2nd edn,Prentice Hall of India
3. Law am and Ketton W D , Simulation Modelling and Analysis, Mc-Graw Hill

17
 IT5B11: MINI PROJECT

Group project: A group contains at most three students.

OPEN COURSE – 1

IT5D01 A – WEB PROGRAMMING

Unit-1

WORLD WIDE WEB(WWW)- History, Working, Web Browsers and their versions, Its
functions, URLs, web sites, Portals. Concept of Search Engines, Search Engines, Search
engines types, searching the Web Servers, client and server techniques.

Unit-II

Internet basics:- Elements of the web, viewing web pages with a browser, using a
browser for a mail, News and chat, security and privacy issues. Internet advantage and
disadvantage. Internet Services.

Unit-III

Introduction – history of html,sgml - structure of html document, web page layout, html
tags and types - font type, paragraph formatting, meta data, blockquote, hyperlinks,
linking, comments, white space, horizontal ruler, images, ordered and unordered lists,
frames, tables, forms

Unit-IV

Web server and proxy server, Web caches, FAQS, Web browser like Internet Explorer,
Netscape Navigator, and Communication Suit, Internet Security issues, Embedded and
Software based firewall, Data encryption and Digital Signature and Certificates.

Unit-V

The search and search engine for internet, Spiders, Robots, Bots, Internet Agents, Mobile
agents, meta search sites, outlook express and front page. Web Hosting and publishing
Concept. Do’s and don’ts for creating a good website.

Reference Books:
1. Deitel & Deitel, Goldberg, “Internet and world wide web- How to Program”,
Pearson Education Asia, 2001
2. Computer Networks – A.S. Tanenbaum.

18
 IT5D01 B – INTRODUCTION TO COMPUTERS & OFFICE
AUTOMATION

Module I (7 Hours)

Introduction to Computers-Types of Computers- DeskTop, Laptop,

Notebook and Netbook – Hardware: CPU, Input / Output Devices,
Storage Devices–System – Software - Operating Systems, Programming
Languages, Application Software – Networks - LAN,WAN -Client-Server.

Module II(13 Hours)

Documentation Using MS-Word - Introduction to Office Automation,

Creating & Editing Document, Formatting Document, Auto-text,
Autocorrect, Spelling and Grammar Tool, Document Dictionary, Page
Formatting, Bookmark, Advance Features of MS-Word-Mail Merge,
Macros, Tables, File Management, Printing, Styles, linking and embedding
object, Template.

Module III(10 Hours)

Electronic Spread Sheet using MS-Excel - Introduction to MS-Excel,

Creating & Editing Worksheet, Formatting and Essential Operations,
Formulas and Functions, Charts, Advance features of MS-Excel-Pivot
table & Pivot Chart, Linking and Consolidation.

Module IV(10 Hours)

Presentation using MS-PowerPoint: Presentations, Creating,

Manipulating & Enhancing Slides, Organizational Charts, Excel Charts,
Word Art, Layering art Objects, Animations and Sounds, Inserting
Animated Pictures or Accessing through Object, Inserting Recorded
Sound Effect or In-Built Sound Effect.

Module V(10 Hours)

Internet - History of Internet – Intranet and Extranet – DNS –

Connections-Dial-up, ISDN, DSL, T1, T3,WiFi,Wireless, and Satellite

Communications--E-mail, Chat, Forum, Blog, and Newsgroups – Browsers –

Search Engines.

References:

19
 1. Absolute Beginner’s Guide to Computer Basics, Michael Miller, Prentice Hall.

2. Learn Microsoft Office – Russell A. Stultz–BPB Publication

3. Internet & World Wide Web – How to program, H.M.Deitel, P.J.Deitel, et al.,
Prentice Hall.

IT6B12: COMPUTER NETWORKS & ADMINISTRATION

Unit – 1: (8 Hours)
Introduction & TCP/IP : TCP/IP Architecture. Transport Layer : TCP, UDP and SCTP,
Port Numbers, Standard Internet Services, Protocol usage by Common Internet
application.

Unit – II : (10 Hours)

Elementary Sockets : Sockets, TCP Sockets, TCP Client/Server.

Unit –III : (12 Hours)

Elementary Sockets : UDP, SCTP, SCTP Client/Server. Domain Name System

Unit – 1V : (12 Hours)

Advanced Sockets : Ipv4 & Ipv6 Interoperability, Advanced I/O functions

Unit – V : (12 Hours)

Advanced Sockets : Unix Domain Protocol, Nonblocking I/O, Routing Sockets, Key
management Sockets.

REFERENCES

1. W. R. Stevens, B Fenner, A.M. Rudoff ,“ UNIX Network Programming, The

Sockets Networking API”, 3rd Edition, PHI 2007
2. W.R.Stevens. “Unix Network Programming” PHI 1998
3. J.Martin. “TCP/IP Networking – Architecture, Administration and programming”
Prentice Hall 1994
4. D.E.Comer. “Internetworking with TCP/IP. Vol 1, Vol. 2, Vol. 3, Principles,
Protocols and architecture PHI 2000
5. Feit “TCP/IP”. Mc Graw Hill 1996
6. Stevens “TCP/IP Illustrated” Vol.1-3 Addison Wesley 1998

20
 IT6B13: OPERATING SYSTEM

Unit – 1: (10 Hours)

Basic features of OS, I/O devices, Single user and multi-user OS, I/O utilities,
Multitasking OS, Various parts of OS, Loading of OS, Boot strapping, Different types
of OS, Shell, File system, Software tools, Program translation sequence, Compilers &
interpreters, Linkers, Loaders, Assemblers, Fundamentals of DOS and Windows.

Unit – II: (10 Hours)

Process concept, Process scheduling, Types of schedulers, Scheduling and performance
criteria, Scheduling algorithms, Inter process communication and synchronization basic
concepts, Mutual exclusion, Semaphores, Critical section, Dead locks

Unit –III: (10 Hours)

Single process monitor, Multi-programming with fixed partitions and dynamic partitions,
Paging, Hardware support for paging, Address translation by associative memory sharing
system, Segmentation, Virtual memory, Demand paging with virtual memory
management.

Unit – 1V: (10 Hours)

File concept, Directories, Disk organization, Disk space management methods, Linked
list, Bit map, Disk allocation methods, Contiguous allocation, Non-contiguous allocation,
Disk scheduling, Different scheduling algorithms, File protection, Passwords access
groups.

Unit – V: (10 Hours)

Case Study (Unix) : Basic commands, Permissions, Piping, Directory management, The
shell, Background process, File system, Terminals, Devises, Shell history, Vi editor,
Basic operations., Mail, Shell programming, Simple Network Management Protocols,
System calls, Sockets and IPC, System administration.

REFERENCES
1. Deitel, “Operating systems” , Addision Wesly
2. Andrew S Tanenbaum, “Operating Systems”, Prentice Hall
3. Vickery, “Unix Shell Programming”, Addison Wesly

21
 ELECTIVE-II

IT6B14A: MOBILE COMPUTING

UNIT- I: (10 Hours)

Introduction: Wireless transmission, Frequencies for radio transmission, Signals,
Antennas, Signal Propagation, Multiplexing, Modulations, Spread spectrum, MAC,
SDMA, FDMA, TDMA, CDMA, Cellular Wireless Networks.

UNIT- II:(12 Hours)

Telecommunication systems: GSM, GPRS, DECT, UMTS, IMT-2000, Satellite
Networks, Basics, Parameters and Configurations, Capacity Allocation, FAMA and
DAMA, Broadcast Systems, DAB, DVB.

UNIT- III: (12 Hours)

Wireless LAN: IEEE 802.11, Architecture, Services, MAC, Physical layer, IEEE
802.11a - 802.11b standards, HIPERLAN, Blue Tooth.

UNIT- IV: (10 Hours)

Mobile IP,Dynamic Host Configuration Protocol, Routing, DSDV, DSR, Alternative
Metrics.

UNIT- V: (10 Hours)

Traditional TCP, Classical TCP improvements, WAP, WAP 2.0.

REFERENCES:

1. Jochen Schiller, “Mobile Communications”, 2/e,PHI/Pearson Education, 2003.

2. William Stallings, “Wireless Communications and Networks”, PHI/Pearson
Education, 2002.
3. Kaveh Pahlavan, Prasanth Krishnamoorthy, “Principles of Wireless Networks”,
PHI/Pearson Education, 2003.
4. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober,
“Principles of Mobile Computing”, Springer, New York, 2003.
5. Hazysztof Wesolowshi, “Mobile Communication Systems”, John Wiley and Sons
Ltd, 2002.

IT6B14 B - DATA MINING AND WAREHOUSING

UNIT – I
Introduction: Data mining application – data mining techniques – data mining case
studies- the future of data mining – data mining software - Association rules mining:
Introduction- basics- task and a naïve algorithm- apriori algorithm – improve the
efficient of the apriori algorithm – mining frequent pattern without candidate generation.

22
UNIT – II
Classification : Introduction – decision tree – over fitting and pruning - DT
rulesestimation predictive accuracy of classification methods - other evaluation criteria
for classification method – classification software

UNIT – III
Cluster analysis: cluster analysis – types of data – computing distances-types of cluster
analysis methods - partitioned methods – hierarchical methods – density based methods –
dealing with large databases – quality and validity of cluster analysis methods – cluster
analysis software.

UNIT – IV
Web data mining: Introduction- web terminology and characteristics- locality and
hierarchy in the web- web content mining-web usage mining- web structure mining –
web mining software - Search engines: Search engines functionality- search engines
architecture – ranking of web pages. UNIT – V
Data warehousing: Introduction – Operational data sources- data warehousing – Data
warehousing design – Guidelines for data warehousing implementation – Data
warehousing metadata - Online analytical processing (OLAP): Introduction – OLAP
characteristics of OLAP system – Multidimensional view and data cube - Data cube
implementation - Data cube operations OLAP implementation guidelines

TEXT BOOK:
1. “Introduction to Data mining with case studies”, G.K. Gupta, PHI Private limited, New
Delhi, 2008.

IT6B14C - SOFTWARE TESTING

UNIT -I
Developing a test approach- addressing software system business risk-Defining a
software system testing strategy-development software system testing tactics-testing
software using a life cycle methodology-requirement phase testing.
Self study: Development Software System Testing Tactics

UNIT -II
Design phase testing-program phase testing-Dest debugging and program peer view test
tools-evaluating test results-installation phase testing-Acceptance testing
Self Study: Installation phase testing

UNIT -III
Trusting methodology for software maintenance-testing the correctness of the installing a
software change-testing the validity of software cost estimate-testing the progress of the
software system-inspecting test plan and test cases.
Self Study: Inspecting test plan and test cases.

23
UNIT -IV
Assessing client-server and LAN risks-A testing strategy for a rapid prototyping-testing
techniques-testing tools.
Self Study: Testing Tools

UNIT -V
Test documentation-reporting test results-final test reporting-evaluating test
effectiveness-using testing metrics-improving test process
Self Study: Improving test process

TEXT BOOK:

1. William Perry, “Effective methods for software testing”, John-Wiley & Sons,
Inc.,1995.

Reference Books:
1. Myers and Glenford.J, “ The Art of Software Testing”, John-Wiley & Sons, 1979.
2. Roger.S..Pressman, “Software Engineering-A Practitioner’s Approach”, Mc-Graw
Hill, 5th edition, 2001.
3. Marnie.L.Hutcheson, “ Software Testing fundamentals”, Wily-India, 2007
4. Boris Beizer, “Software Testing Techniques”, Dream Tech Press, Second Edition-
2003.

IT6 B15 – MULTIMEDIA TECHNOLOGIES

Module I – 12 Hrs

Multimedia Basics: Multimedia: Definition, Multimedia Developers, Multimedia

Project, Multimedia Highway - Multimedia Applications: Business, Schools, Home,
Public Places, Virtual Reality - Stages of Multimedia Project: Planning & Costing,
Designing & Producing, Testing, Delivering - Multimedia Hardware: Macintosh
Platform, Windows Platform, Networking Mac & Windows Computers - Connections:
SCSI, IDE, USB, Firmware (IEEE 1394). Memory & Storage Devices: RAM, ROM,
Floppy & Hard Disks, Zip, Jaz, SyQuest Drives, Optical storage Devices, CD, DVD -
Input Devices: Keyboard, Mouse, Trackball, Touch Screen, Magnetic Card Encoders and
Readers, Graphics Tablets, Scanners, OCR, Infrared Remotes, Voice Recognition
Systems, Digital Cameras - Output Hardware: Audio Devices, Amplifiers & Speakers,
Monitors, Video Devices, Projectors, Printers - Communication Devices: Modems, ISDN
& DSL, Cable Modems - Basic Software Tools: Text Editing and Word Processing
Tools, OCR Software, Painting and Drawing Tools, 3-D Modeling and Animation Tools.
Image Editing Tools, Sound Editing Tools - Animation, Video and Digital Movie Tools –
Video Formats, Quick time for Windows & Macintosh, Microsoft Video for Windows,
Movie Editors, Compressing Movie files - Multimedia Authoring Tools – Multimedia

24
Authoring, Authoring Software - Types – Card or Page based Tools, Icon based Event-
driven Tools, Time based Tools - Cross-Platform Authoring.

Module II – 12 Hrs

Text & Sound for Multimedia: Text:- Fonts, Faces, Cases - Text in Multimedia -
Designing with Text, Choosing Text Fonts, Symbols & Icons - Font Editing & Design
Tools - Fontographer, Making Pretty Text - Hyper Media & Hyper Text - Sound:
Definition, Acoustic Signals, Amplitude, Frequency, Sampling Rate, Quantization,
Multimedia System Sounds - Digital Audio – Digital Audio files, File size versus
Quality, Setting proper Recording levels - Editing Digital Recordings – Multiple Tracks,
Trimming. Splicing and Assembly, Volume Adjustments, Format Conversion,
Resampling or Downsampling, Fade-in & Fade-out, Equalization, Time Strecting, Digital
Signal Processing(DSP), Reversing Sounds - MIDI, Audio File Formats, MIDI versus
Digital Audio, Sound for WWW, Adding Sound to Multimedia Project, Red Book
Standard.

Module III – 12 Hrs

Graphics & Animation: Images & Graphics: Introduction - Making Still Images –
Bitmaps, Clipart, Bitmap Software - Capturing & Editing Images – Scanning Images,
Vector Drawing - Vector Graphics versus Bitmaps, Conversion between bitmaps &
Drawn Images, 3D Drawing & Rendering - Color:– Natural Light & Color -
Computerized Color – Additive Color, Subtractive Color, Monitors, Computer Color
Models - Color Palettes, Dithering - Image File Formats – Macintosh, Windows, Cross-
Platform - Animation: Definition, Principles of Animation, Animation by Computer -
Animation Techniques – Cel Animation, Computer Animation, Kinematics, Morphing,
Animation File Formats.

Module IV– 12 Hrs

Analog & Digital Video: Video:- Understanding how Video Works - Broadcast Video
Standards – NTSC, PAL, SECAM, ATSC DTV, HDTV - Analog Video – Overscan and
Safe Title Area, Video Color, Interlacing Effects, Text & Titles for Television - Digital
Video – Digital Video Architectures, Digital Video Compression (MPEG 1, 2, 4, 7, 21) -
Video Recording & Tape Formats – Composite Analog Video, Component Analog Video
(S-Video, Three Channel Component – RGB, YUV, Chrominance, Luminance) -
Composite Digital, Component Digital, ATSC – Digital TV, Comparison of Formats -
Shooting & Editig Video – Shooting Platform, Lighting, Chroma Keys, Composition,
Optimizing Video Files for CD-ROM.

Module V – 12 Hrs

Designing & Delivering Multimedia: Designing Multimedia:- Structure, Navigation,

Hotspots, Hyperlinks, Buttons, Icons - Designing the user Interface – Expert Modes,
GUIs, Graphical Approaches, Audio Interfaces - A Multimedia Design Case History,
Producing Multimedia - Delivering Multimedia – Testing, Alpha Testing, Beta Testing,
Polishing to Gold - CD Technology, CD Standards (Red, Yellow, Green & Orange Book
Standards), White Book, DVD.

25
Textbook:

1. Multimedia: Making It Work – Tay Vaughan (TATA McGRAW-HILL)

References:

1. Multimedia: Computing Communications & Applications – Ralf Steinmetz and

Klara Nahrstedt, Pearson Education
2. Multimedia BASICS – Weixel, Fulton, Barksdale, Morse, Thomson Brooks/Cole
– ESWAR Press
3. Multimedia & Web Design – Vikas Gupta, Dreamtech Press
4. Adobe Premiere Pro Bible – Droblas, Greenberg , Wiley – India
5. Digital Multimedia – Chapman & Chapman, Wiley – Dreamtech
6. Fundamentals of Multimedia – ZeNinan Li, Mark Drew, Pearson – PrenticeHall

IT6B16: PROJECT

Individual project

OPEN COURSE - 2

IT6D02A - CRYPTOGRAPHY AND NETWORK SECURITY

UNIT-I
Introduction to security attacks, services and mechanism, introduction to cryptography.
Conventional Encryption: Conventional encryption model, classical encryption
techniques- substitution ciphers and transposition ciphers, cryptanalysis, stereography,
stream and block ciphers.
Modern Block Ciphers: Block ciphers principals, Shannon’s theory of confusion and
diffusion, fiestal structure, data encryption standard(DES), strength of DES, differential
and linear crypt analysis of DES, block cipher modes of operations, triple DES, IDEA
encryption and decryption, strength of IDEA, confidentiality using conventional
encryption, traffic confidentiality, key distribution, random number generation.

UNIT-II
Introduction to graph, ring and field, prime and relative prime numbers, modular
arithmetic, Fermat’s and Euler’s theorem, primality testing, Euclid’s Algorithm, Chinese
Remainder theorem, discrete logarithms.
Principals of public key crypto systems, RSA algorithm, security of RSA, key
management, Diffle-Hellman key exchange algorithm, introductory idea of Elliptic curve
cryptography, Elganel encryption.

26
UNIT-III
Message Authentication and Hash Function: Authentication requirements, authentication
functions, message authentication code, hash functions, birthday attacks, security of hash
functions and MACS, MD5 message digest algorithm, Secure hash algorithm(SHA).
Digital Signatures: Digital Signatures, authentication protocols, digital signature
standards (DSS), proof of digital signature algorithm.

UNIT-IV
Authentication Applications: Kerberos and X.509, directory authentication service,
electronic mail security-pretty good privacy (PGP), S/MIME.

UNIT-V
IP Security: Architecture, Authentication header, Encapsulating security payloads,
combining security associations, key management.
Web Security: Secure socket layer and transport layer security, secure electronic
transaction (SET).
System Security: Intruders, Viruses and related threads, firewall design principals, trusted
systems.

Books:
1. William Stallings, “Cryptography and Network Security: Principals and
Practice”, Prentice Hall, New Jersy.
2. Johannes A. Buchmann, “Introduction to Cryptography”, Springer-Verlag.
3. Bruce Schiener, “Applied Cryptography”.

IT6D02B - IMAGE PROCESSING

UNIT-I
Introduction and Fundamentals
Motivation and Perspective, Applications, Components of Image Processing System,
Element of Visual Perception, A Simple Image Model, Sampling and Quantization.
Image Enhancement in Spatial Domain
Introduction; Basic Gray Level Functions – Piecewise-Linear Transformation Functions:
Contrast Stretching; Histogram Specification; Histogram Equalization; Local
Enhancement; Enhancement using Arithmetic/Logic Operations – Image Subtraction,
Image Averaging; Basics of Spatial Filtering; Smoothing - Mean filter, Ordered Statistic
Filter; Sharpening – The Laplacian.

UNIT-II
Image Enhancement in Frequency Domain
Fourier Transform and the Frequency Domain, Basis of Filtering in Frequency Domain,
Filters – Low-pass, High-pass; Correspondence Between Filtering in Spatial and
Frequency Domain; Smoothing Frequency Domain Filters – Gaussian Lowpass Filters;
Sharpening Frequency Domain Filters – Gaussian Highpass Filters; Homomorphic

27
Filtering.

Image Restoration
A Model of Restoration Process, Noise Models, Restoration in the presence of Noise
only-Spatial Filtering – Mean Filters: Arithmetic Mean filter, Geometric Mean Filter,
Order Statistic Filters – Median Filter, Max and Min filters; Periodic Noise Reduction by
Frequency Domain Filtering – Bandpass Filters; Minimum Mean-square Error
Restoration.

UNIT-III
Color Image Processing
Color Fundamentals, Color Models, Converting Colors to different models, Color
Transformation, Smoothing and Sharpening, Color Segmentation.
Morphological Image Processing
Introduction, Logic Operations involving Binary Images, Dilation and Erosion, Opening
and Closing, Morphological Algorithms – Boundary Extraction, Region Filling,
Extraction of Connected Components, Convex Hull, Thinning, Thickening

UNIT-IV
Registration
Introduction, Geometric Transformation – Plane to Plane transformation, Mapping,
Stereo Imaging – Algorithms to Establish Correspondence, Algorithms to Recover Depth
Segmentation
Introduction, Region Extraction, Pixel-Based Approach, Multi-level Thresholding, Local
Thresholding, Region-based Approach, Edge and Line Detection: Edge Detection, Edge
Operators, Pattern Fitting Approach, Edge Linking and Edge Following, Edge Elements
Extraction by Thresholding, Edge Detector Performance, Line Detection, Corner
Detection.

UNIT-V
Feature Extraction
Representation, Topological Attributes, Geometric Attributes
Description
Boundary-based Description, Region-based Description, Relationship.
Object Recognition
Deterministic Methods, Clustering, Statistical Classification, Syntactic Recognition, Tree
Search, Graph Matching

Books:
1. Digital Image Processing 2nd Edition, Rafael C. Gonzalvez and Richard E.
Woods. Published by: Pearson Education.
2. Digital Image Processing and Computer Vision, R.J. Schalkoff. Published by:
John Wiley and Sons, NY.
3. Fundamentals of Digital Image Processing, A.K. Jain. Published by Prentice
Hall, Upper Saddle River, NJ.

28