IT Syllabus

SCHOOL OF COMPUTING - B.Tech.
(IT) SCHEME
(FOR CANDIDATES ADMITTED FROM 2008 ONWARDS)
NEW SYLLABUS

SEMESTER III:

Subject Code Subject Title
Periods of
Instruction
Credits
L T P
BITCMA301R01 Transforms & Complex Variables 3 1 0 4
BITCIT302R02
Computer Organization &
Architecture
3 1 0 4
BITCIT303R02 Data Structures 3 1 0 4
BITCIT304 Digital Systems 3 1 0 4
BITCIT305R02
Micro Processors &
Microcontroller
3 1 0 4
BITDIT XXX DE - 1 3 1 0 4
BITCIT306R01
Micro Processors &
Microcontroller Lab
0 0 3 2
BITCIT307R02 Data Structures Lab 0 0 3 2
BITCTP308R01 HR Skills I 1 0 0 1

TOTAL 19 6 6 29

DEPARTMENTAL ELECTIVES:

BITDIT302R02 Scientific Computing 3 1 0 4
BITDIT303 Multimedia Systems 3 1 0 4

ADDITIONAL COURSES FOR LATERAL ENTRY STUDENTS

BITDIT301R01 Computer Programming - I C 3 1 0 4
BITDIT304R02 Computer Programming Lab 0 0 3 2

BITCMA301R01 TRANSFORMS AND COMPLEX VARIABLES
(Common for CSE, IT and ICT)
L T P CREDITS
3 1 0 4

UNIT - I (15 Periods)
Laplace Transforms
Laplace Transform definition Transform of standard functions properties Transform of
derivatives and integrals Transform of the type t
n
f(t) , f(t)/t
n
- inverse Laplace Transform
Convolution theorem Transforms of periodic function, unit step function and unit impulse
function Application to ordinary differential equations with constant coefficients and integral
equations simultaneous linear differential equations with constant coefficients.

UNIT - II (15 Periods)
Fourier and Z Transforms
Fourier Transform The infinite Fourier Transform sine and cosine transform properties
inversion theorem problems convolution theorem Parsevals identity problems finite
Fourier transform sine and cosine transform Transform of derivatives problems.
Z transforms definitions properties convolution theorem inverse Z transforms solving
difference equations using Z transform

UNIT - III (15 Periods)
Complex Differentiation
Complex variable Analytic functions Necessary and sufficient conditions for analyticity
Cauchy-Riemann equations in polar coordinates Harmonic functions Orthogonal system
Construction of an analytic function given real or imaginary parts Conformal transformation
definition e
z
,sinhz and Bilinear transformation only.

UNIT - IV (15 Periods)
Complex Integration
Complex integration Cauchys integral theorem, Integral formula Taylors and Laurents series
(without proof) Singularities zeros poles and residues Cauchys residue theorem
evaluation of the definite integral using Contour Integrations
( )
( )
( )
( )( ) only cos / sin x f dx;
x f
; cos , sin f
-
2
0
|
|
.
|
\
|

+
+

dx mx mx
x g
d

Text Books:
1. Dr. P. Kandasamy et. al, Engineering Mathematics, S.Chand & Co., New Delhi, 1997.
[Units I & II]
2. Dr. M. K. Venkataraman, Engineering Mathematics, National publishing Co., 1995 [
Units III & IV]
References:
1. Erwin Kreyszig, Advanced Engineering Mathematics, Wiley Eastern Ltd., Eighth
Edition, 2003.
2. B.S.Grewal, Higher Engineering Mathematics, Khanna publishers, 2003.
BITCIT302R02 COMPUTER ORGANIZATION & ARCHITECTURE
L T P CREDITS
3 1 0 4

Introduction: Organization and Architecture, Structure and Function Computer Evolution: Brief
history of computers Designing for performance Pentium and Power PC Evolution. Computer
System: Components, Function Interconnection Structures Bus interconnection PCI.

UNIT - II: (18 Periods)
Memory: Cache memory: Memory system overview Cache memory principles Elements of
Cache design Semiconductor Main Memory Advanced DRAM organization.
External Memory: Magnetic Disk RAID Optical Memory Magnetic Tapes.
Input/Output: External Devices I/O Modules Programmed I/O Interrupt Driven I/O DMA
I/O Channels & Processors.

UNIT - III: (15 Periods)
CPU: Computer Arithmetic: ALU Integer Representation and Arithmetic Floating Point
Representation and Arithmetic.
Instruction Set: Characteristics Operand Types Operation Types Addressing Modes
Instruction formats.
Processor organization Register organization Instruction Cycle Instruction Pipelining
Pentium processor

UNIT - IV: (15 Periods)
RISC: Instruction execution characteristics Large Register File Compiler based Register
Optimization Architecture RISC Vs CISC Characteristics
Control unit: MicroOperations Control of Processors Hardwired Implementation Micro
Programmed Control: Basic concepts Microinstruction Sequencing Microinstruction
Execution Applications of microprogramming.

Text Book:
1. William Stallings, Computer Organization and Architecture Designing for
Performance, Prentice Hall of India, Sixth Edition, 2003.
References:
1. Patterson, D. A., and Hennessy, J. L., Computer Organization and Design: The
Hardware/Software Interface, Morgan Kaufmann Publishers, Fourth Edition, 2008.
2. John P.Hayes, Computer Architecture and Organization, Tata McGraw Hill, Third Edition,
2002.
3. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, Computer Organization, McGraw
Hill, Fifth Edition, 2002.
BITCIT303R02 DATA STRUCTURES
L T P CREDITS
3 1 0 4


Pseudo code & Recursion: Introduction Pseudo code ADT ADT model, implementations;
Recursion Designing recursive algorithms Examples GCD, Factorial, Fibonacci, Prefix to
Postfix conversion, Towers of Hanoi; General linear lists operations, implementation, algorithms


Linear Lists: Stacks Basic Operations, Linked stack, Algorithms, Implementation, Applications;
Queues Operations, Linked list design, algorithms, applications, simulation; Complex
implementations circularly linked lists, doubly linked lists, multi-linked lists


Non-Linear Lists: Trees basic concepts, binary trees, traversals, expression trees; General
trees insertion, deletion - Conversion of general to binary tree; Binary Search tree basics,
operations, ADT, applications Threaded trees; AVL trees basic concepts and implementation


Heaps & Trie Structure: Heaps basics, implementation, algorithms; Heap applications
Priority Queues; Multi-way Trees B-tree implementation, algorithms, 2-3 tree, Trie structure;
Searching sequential and binary search, hashed searches, collision resolution; Graphs basics,
operations, storage structures, algorithms

Text Book:

1. Richard F. Gilberg & Behrouz A. Forouzan, Data Structures: A Pseudocode Approach
with C, Thomson Learning, Second Edition, 2007.

References:

1. J.P.Trembley & P.G. Sorenson, "An Introduction to Data Structures with Applications",
Tata McGraw Hill, Second Edition, 2002.
2. Seymour Lipschutz and G.A.Vijayalakshmi Pai, Data Structures, Tata McGraw Hill,
2005.

BITCIT304 DIGITAL SYSTEMS
L T P CREDITS
3 1 0 4

UNIT-I (15 Periods)
Simplification of Boolean functions and Digital Logic Families : Review of number systems,
Boolean expressions Simplification using K Map Quine McClusky method NAND and NOR
implementation of Boolean functions logic families : Digital IC characteristics Definitions Noise
immunity - TTL Totem pole Wired AND ECL I
2
L MOS logic CMOS logic Interfacing
CMOS and TTL Tristate logic Comparison of IC families

Combinational Circuit Design : Half and Full adder Half and Full Subtractor BCD adder and
subtractor magnitude comparator (1 bit & 4 bit) - Encoder: Octal to Binary, Priority encoder
Decoder: 3 to 8 line decoder and BCD to 7 Segment decoder/ driver Multiplexer (2:1 & 4:1)
Demultiplexer (1:2 & 1:4) ALU parity generator/ Checker code converters: BCD to Binary ,
Binary to BCD, Gray to Binary, Binary to Gray.

Sequential Circuit Design: Flip Flops: Basic flip flop circuit RS flip flop D flip flop JK flip
flop T flip flop Master slave JK flip flop.
Registers: Shift registers: SISO, SIPO, PISO, PIPO and Bidirectional register.
Counters: Asynchronous up, down, up/down, MOD n and BCD counter Synchronous up, down,
up/down and BCD counters Design of counters.
Introduction to Moore & Mealy machines.

UNIT IV (15 Periods)
Semiconductor Memories and Algorithmic State Machines (ASM): Memory classifications
Characteristics Sequential memory Introduction to ROM, RAM, CAM and CCD memory.

ASM Char t s-Timing consider at ions-Derivation of ASM chart s-Realization of ASM charts-
Control implementations-Design examples-Analysis and Design of asynchronous sequential
networks-State assignment and races-Flow table reduction- Hazards.

Text Books:
1. R.P. Jain, Modern Digital Electronics, TMH, Third Edition, 2006. [Units I, II, III &IV]
2. Donald D. Givone, Digital Principles and Design, TMH, 2003. [Unit IV]

References:
1. Moris-Mano, Digital Logic and Design, Pearson Education, 2006.
2. W.H Gothmann, Digital Electronics Introduction to theory and Practice, Pearson
Education, Second Edition, 2002.
3. T. L. Floyd, Digital Fundamentals, Pearson Education, 2006.
4. Charles H.Roth Jr., Fundamentals of Logic Design, Jaico Publishing House, Fourth Edition,
Mumbai 1999.
BITCIT305R02 MICROPROCESSORS & MICROCONTROLLER

L T P CREDITS
3 1 0 4

UNIT I (15 Periods)

8086: Intel 8086 architecture system connections, timing and interrupts Minimum and maximum
mode of operation 8086 Hardware overview Basic signal flow and 8086 buses Bus activities
during a write machine cycle address decoder concepts addressing and decoding accessing
memory and ports in microcomputer systems 8086 timing parameters 8086 interrupts and
responses 8086 interrupt types.

UNIT II (15 Periods)

8087 Numeric Data Processor: NDPs data types Processor architecture Instruction set Example.
8089 I/O processor: IOP architecture Communication between CPU and IOP Instruction set of
8089 Example.


X86 processors: Intel 80286,386,486 architecture instruction set, addressing scheme modes of
operations and memory management of 80286, 386 and 486 comparative study of 286,386 and 486
Overview of Pentium processor.


8051 The 8051 microcontroller introduction Architecture hardware details Pins and ports
Memory counters, timers, Serial data I/O and interrupts Instruction setApplications: Keyboards,
Displays, Analog to Digital Interfacing and Digital to Analog Interfacing.

Text Books:

1. Barry B Brey, The Intel Microprocessors: Architecture, Programming and Interfacing,
Fourth Edition, 1997. [Units I & III]
2. Yu Cheng Liu and Gibson, Microcomputer Systems: 8086/8088 family architecture,
Programming and Design, Prentice Hall of India, 2000. [Unit II]
3. Kenneth J Ayala, The 8051 Microcontroller: Architecture, Programming and Applications,
PRI, Second Edition, 1996. [Unit IV]

BITDIT302R02 SCIENTIFIC COMPUTING
L T P CR
3 1 0 4


Introduction: Fundamentals of software issues related to Scientific computing - number
representations & errors locating roots of equations bisection method, regula-falsi method-
Newton Raphson method- Graffees root squaring method solution of linear system of equations
Gauss Elimation method- Gauss Jordans method Gauss seidal iterative method Implementation
of Algorithms through MATLAB.


Interpolation, Numerical Differentiation & Integration: Finite differences forward & backward
operators problem based on equal interval Newtons forward and backward methods Gauss
forward & backward methods unequal internals Lagranges Interpolation Newtons divided
difference formula Numerical differentiation and Integration Trapezoidal rule Simpsons
rules Implementation of Algorithms through MATLAB.

Numerical Solution of ODE & Approximation: Initial value problems of ODE Taylorss
method- Picards method Eulers method RungeKutta method Predictor & correctors method
- Approximations by spline functions- Implementation of algorithms through MATLAB .

Numerical Solution of PDE Classification of PDE Elliptic models parabolic models
hyperbolic models problems - Implementation of Algorithm will be investigated through
MATLAB.

Text Books :
1. Van Loan, Introduction to Scientific Computing, Prentice Hall, Second Edition, 1999.
2. Kincaid & Cheney, Numerical Analysis: Mathematics of Scientific computing, Brooks-
Cole, Third Edition, 2002.
Reference :
1. R. Kandasamy, Thilagavathy and Gunavathy, Numerical methods, S. Chand & Co, 2005.

BITDIT303 MULTIMEDIA SYSTEMS
L T P CREDITS
3 1 0 4

UNIT I (15 Periods)
Multimedia: An - Overview - Text: Introduction Types of Text Unicode Standard Font
Insertion of Text Text Compression File Formats - Image: Introduction Image Types Seeing
Color Color Models Basic Steps For Image Processing Scanner Digital Camera Interface
Standards Specifications Of Digital Images CMS - Device Independent Color Models File
Formats Image Output On Monitor, Printer

Audio: Introduction Acoustics Nature Of Sound Waves Fundamental Characteristics Of
Sound Musical Note and Pitch Psycho-Acoustics Elements of Audio Systems Microphone
Amplifier Loudspeaker Audio Mixer Digital Audio Synthesizers Midi ,Messages,
Connections, Specifications Basics Of Staff Notation Sound Card Audio File Formats And
CODECs Audio Recording Systems - Video: Introduction Digital Video Digital Video
Standards PC Video Video Recording Formats and Systems Video File Formats and
CODECs Video Editing

UNIT III (15 Periods)
Animation: Introduction - Multimedia architecture: Introduction User Interfaces Windows
Multimedia Support Hardware Support Distributed Multimedia Applications Real Time
Protocols Playback Architectures Streaming Technologies Temporal Relationships
Synchronization Multimedia Database Systems Feature Extraction Of Images, Audio, Video
Similarity Metrics Indexing Mechanisms Characteristics Of MMDB

Multimedia Data Compression: Compression principles Text compression Huffman coding
LZ and LZW coding Image compression - JPEG Audio compression Differential Pulse Code
Modulation Adaptive differential PCM Adaptive and Linear coding MPEG and Dolby audio
coders Video compression H.261, DVI, MPEG, MPEG - 1, MPEG - 2, MPEG - 4, MPEG 7 -
Virtual Reality: Introduction Forms Of Virtual Reality VR Applications Software
Requirements Peripheral Devices VRML
Text books:
1. Ranjan Parekh, Principles Of Multimedia, TMH, 2006. (Units I, II, III & IV)
2. Fred Halsall, Multimedia Communications, Pearson Education, 2001.
(Unit IV)
References:
1. John Vince, Virtual Reality Systems, Pearson Education, 2001.
2. Tay Vaughan, Multimedia Making It Work, TMH, Sixth Edition, 2006.
BITCIT306R01 MICROPROCESSORS & MICROCONTROLLER LAB

L T P CREDITS
0 0 3 2

1. Study of 8086.
2. Basic arithmetic operations using 8086.
3. Linear search & binary search using 8086.
4. Insertion sort & Bubble sort using 8086.
5. Basic arithmetic operations using 8087.
6. Solving algebraic equations through Newton Raphson method using 8087.
7. Interfacing ADC with 8086.
8. Basic operations using 8051.
9. Program for finding largest and smallest number using 8051.
10. Program for Ascending and descending order using 8051.
11. Traffic light controller using 8051.
12. Code conversion using 8051.
13, 14 & 15. Experiments on Advance Microprocessor (Using Pentium Processor)
BITCIT307R02 DATA STRUCTURES LAB

L T P CREDITS
0 0 3 2

1. Create a Stack and do the following operations using arrays.
(i) Push (ii) Pop (iii) Peep
2. Create a Queue and do the following operations using arrays
(i) Enqueue (ii) Dequeue
3. Implement insertion, deletion and display operations on singly linked list
4. Implement conversion of infix expression to postfix using linked stack.
5. Implement insertion, deletion and display operations on doubly linked list
6. Implement insertion, deletion and display operations on circular doubly linked list.
7. Implement the following operations on a binary search tree:
(i) Insert a node (ii) Delete a node (iii) Traversals - In-order, Pre order, & Post order
8. Implement the following operations on multi-way trees :
(i) Insert a node (ii) Delete a node
9. Implement the following operations on B-trees :
(i) Insert a node (ii) Delete a node
10. Implement the following operations on trie structure :
(i) Insert a node (ii) Delete a node (iii) Search for a node
(iv) Display using preorder traversal
11. Sort the list of numbers using Heap sort and Merge Sorting Techniques
12. Implement the following three searching techniques for a set of numbers
(i) Linear Search (ii) Binary Search (iii) Hash Search
13. Traverse the nodes of the graph using BFS and DFS.

BITCTP308R01 HR SKILLS - I
L T P CREDITS
1 0 0 1

S.NO DETAILS NO.OF CLASSES
1. SWOT Analysis and presentation (Individual exercise)
2

2. Listening Skill Exercise (Audio-visual Presentation)
1

3. Team Skills-Product Launching
2

4. Aptitude Test I
2

5. Leadership Exercise (Problem solving exercise)
2

6. Etiquettes-Discussion & Reporting
1

7. Person I admire Oral Presentation
2

8. Emotional intelligence-Written Exercise
1

9. End Semester Examinations
2

TOTAL
15

BITDIT301R01 COMPUTER PROGRAMMING - I C
L T P CREDITS
3 1 0 4

UNIT I (15 Periods)

Introduction: Structure of C C fundamentals Declarations Data types User defined data
types Operations Type Conversion I/O functions Header file Library functions.
Control Structure: Conditional constructs control constructs Multiple branching Iteration
and jump constructs.


Arrays: Declaration Initialization and manipulation of single & multidimensional arrays- String
Handling -String Manipulations and character handling functions String manipulation operations.
Functions: Declarations Definition Scope Arguments Call by reference & value
Recursion storage classes preprocessor directives.


Structures & Unions: Structures and Unions- Declarations initializations - Nesting of Structures
Structure with arrays and functions.
Pointers: Declarations Accessing through pointers pointer and character strings pointer-to-
pointer Pointers in arrays, Structures and functions Dynamic memory allocation.


Files: Sequential Access Random Access opening & closing file file processing using file
manipulation functions.
Graphics: Graphics under Windows- Device independent drawing- Hello Windows-Drawing shapes
Types of pens-Types of brushes-Free hand drawing-Device Context-Displaying a Bitmap
Animation.

Text Books:
1. E.Balagurusamy, Programming in ANSI C, TMH, Third Edition, 2006. [Units I, II, III &
IV]
2. Yeshavant P Kanetkar, Let us C, BPB, Eighth Edition, 2008. [Unit IV]

References:
1. Brian Kernighan & Dennis Ritchie, C Programming Language, Prentice Hall of India,
Second Edition, 1988.
2. Byron.S. Gottfried, Theory and problems of Programming with C, TMH, 2000.
BITDIT304R02 COMPUTER PROGRAMMING LAB
L T P CREDITS
0 0 3 2

1. Programs on arithmetic operators (like simple interest, compound interest and Celsius to
Fahrenheit)
2. Programs on conditional and looping statements (like solving Quadratic equation. Sine
and Cosine series, Summation of digits)
3. Programs on Numerical Methods problems (like Runge Kutta Method, Gauss- Seidal
method)
4. Programs on arrays (like Matrix operations, finding minimum or maximum in a set of
numbers)
5. Programs on string manipulations (palindrome, pattern searching)
6. Programs on Functions and recursion (factorial, Fibonacci, tower of Hanoi )
7. Programs on structure and unions(student, employee details)
8. Programs on pointers (Sorting or Searching)
9. Programs on files( payroll processing)
10. Menu driven Programs to demonstrate graphic functions like (circle, line, ellipse, arc)
11. Programs on Dynamic memory allocation
12. Programs on Command Line Arguments

SEMESTER IV:

Periods of
Instruction
Credits
L T P
BITCMA401R01
Discrete Structures &
Combinatorics
3 1 0 4
BITCIT402R02 Operating Systems 3 1 0 4
BITCIT403R01 Java Programming 3 1 0 4
BITCIT404R01
Signals and Systems
3 1 0 4
BITCEE405 Control Systems 3 1 0 4
BITDIT XXX DE-2 3 1 0 4
BITCIT406R02 Operating System Lab 0 0 3 2
BITCIT407 R01 Java Programming Lab 0 0 3 2
BITCTP408 HR Skills - II 1 0 0 1
TOTAL 19 6 6 29


BITDIT402 Linux Programming 2 0 3 4
BITDIT403R01 Object Oriented Analysis and Design 3 1 0 4
BITDIT404R01 Theory of Computation 3 1 0 4
BITDIT405R01 Communication Engineering 3 1 0 4
BITDIT406R01 Digital Image Processing 3 1 0 4

ADDITIONAL COURSES FOR LATERAL ENTRY STUDENTS

BITDIT401R01 Object Oriented Programming in C++ 3 1 0 4
BITDIT407R01 Object Oriented Programming Lab 0 0 3 2

BITCMA401R01 DISCRETE STRUCTURES & COMBINATORICS
L T P CREDITS
3 1 0 4

UNIT I (15 Periods)
Mathematical Logic and Set Theory Statements and notations connectives normal forms
predicate calculus Inference theory of predicate calculus relations and ordering functions
recursion recursion in mechanical theorem proving mathematical induction.

UNIT I (15 Periods)
Algebraic structures Group- definition examples Abelian and cyclic groups permutation
group Cosets Right and left cosets- Lagranges theorem Normal subgroups Examples and
simple problems only.
Boolean algebra Boolean functions representation and minimization K Map and Quine
McCluskey.

A general introduction on graphs connected and disconnected graphs types of graphs paths
and circuits cut set and cut vertices Euler and Hamiltonian graphs matrix representation of
graphs incidence and adjacency matrices properties.

Combinatorics: Combination of sets finite and infinite sets countability and uncountability
binary relations equivalence relation and partition partial ordering and lattices anti-chains
application of relational Model in databases algebra of formal power series recursive functions.

Text books:

1. M.K. Venkataraman, S. Chandrasekaran and N. Sridharan, Discrete Mathematics, National
Publication Company, 2003. (Units I & II).
2. Narasingh Deo, Graph Theory and its Engineering applications, Prentice Hall of India,
2004. (Unit III)
3. C.L. Liu, Elements of Discrete mathematics, Tata-McGraw Hill Publishing Company,
Second Edition, 2000. (Unit IV)

References:

1. V. Krishnamoorthy, Combinatorics, Affiliated East-West Press, 1985.
2. M.L. Santigo, Modern Algebra, Tata McGraw Hill Publishing Company, 2001.

BITCIT402R02 OPERATING SYSTEMS
L T P CREDITS
3 1 0 4


Operating system overview: Objectives and functions Evolution of Operating systems Major
achievements Developments leading to modern operating systems Computer system
overview: Basic elements Processor registers Instruction execution Interrupts Memory
hierarchy Cache memory I/O communication techniques.
Processes: Process Process States Process Description Process Control
Threads: Processes and threads


Scheduling: Uniprocessor scheduling Types of processor scheduling Scheduling algorithms
Multiprocessor scheduling Real-Time scheduling.
Concurrency: Principles of Concurrency Mutual exclusion Semaphores Monitors Message
passing Readers/Writers problem.
Deadlock and Starvation: Principles of deadlock Deadlock Prevention Deadlock Avoidance
Deadlock Detection Integrated deadlock strategy Dinning philosophers problem.


Memory Management: Address binding logical verses physical address space Dynamic
loading Dynamic linking and shared libraries Overlays Swapping Contiguous memory
allocation Paging Segmentation Segmentation with paging Virtual Memory: Background
Demand paging Process creation Page replacement Allocation of frames Thrashing


I/O Management and disk scheduling: I/O devices Organization of the I/O function OS
design issues I/O buffering Disk scheduling RAID Disk cache.
File management: Overview Organization and access File directories File sharing Record
blocking Secondary storage managements.
Security: Security threats Protection Intruders Malicious software Trusted systems.

Text Books:

1. William Stallings, Operating Systems Internals and Design Principles, Pearson
Education, Fifth Edition, 2005. [Units I, II & IV]
2. SilberSchatz, J. Peterson, P. Galvin, Operating System concepts, John Wiley, Sixth
Edition, 2004. [Unit III]

References:
1. A. S. Tanenbaum, Modern Operating Systems, Prentice Hall, Third Edition, 2007.
2. Milenkovic, M, Operating Systems: Concepts and design, Tata McGraw Hill, Second
Edition, 1997.
BITCIT403R01 JAVA PROGRAMMING
L T P CREDITS
3 1 0 4

UNIT I (15 Periods)
Introduction: Object Oriented Programming - Genesis of Java - Overview of Java - Data types,
Variables and Arrays - Operators Control Statements - Introducing Classes - Methods and Classes
- Overloading - Understanding static, final - Nested and Inner Classes - String class - Command
Line Arguments - Inheritance - I/O Basics - Packages and Interfaces - Exception Handling.

Multithreaded Programming: Multithreaded Programming Java Thread Model - Creating
Multiple Threads - Thread Priorit ies - Synchronization - Inter thread communication -
Suspending, Resuming and Stopping threads.
Applets: Fundamentals - Applet class - Applet Skeleton - Event Handling - Event classes
Event Listener Interfaces - Adapter Classes - Inner Classes.

AWT, RMI: AWT Window Fundamentals Working with Frame Windows, Graphics, colors
and Fonts Using AWT controls, Layout managers and Menus Control Fundamentals -
Understanding Layout Managers - Java RMI.
Networking: Basics - Networking Classes and Interfaces - InetAddress - TCP/IP Socket,
ServerSocket classes - UDP DatagramSocket, DatagramPacket classes.

Strings and Files: Java Library - String handling - String Operation, comparison, searching,
modifying - String Buffer - java.lang - Simple Type Wrappers Math - java.util - Stack -
Dictionary - Hash table - Date class - Random class - java.io - File - ByteStreams -
CharacterStreams - Serialization .

Text Book :
1. Herbert Schildt, "The Complete Reference JAVA 2", Tata McGraw Hill, Fifth
Edition, 2002.

References:

1. Harvey M. Deitel, Paul J. Deitel, "JAVA: How to Program", Deitel & Associates Inc.,
Seventh

Edition, 2006.
2. Peter Norton and William Stanek, Peter Nortons Guide to JAVA Programming,
Techmedia, 1997.

BITCIT404R01 SIGNALS AND SYSTEMS
L T P CREDITS
3 1 0 4

UNIT I: Signals and Systems (12 Periods)

Classification of Signals Transformation of the independent variable Basic continuous time
signals Basic discrete time signals Systems Properties of Systems- Linearity, memory, casual,
Time invariant and stability.

UNIT-II: Time Linear Time Invariant Systems (16 Periods)

Introduction Discrete time linear time invariant systems - Representation of Discrete Time
Signals in Terms of Impulses The Convolution Sum - ContinuousTime Linear Time Invariant
Systems; The convolution integral Properties of Linear Time Invariant Systems - System
Described by Differential Block Diagram Representation of LTI Systems described by
Differential Equations Singularity Functions

UNIT III: (16 Periods)
Fourier Analysis For Continuous -Time Signals And Systems

Introduction - The Response of Continuous - Time LTI Systems to Complex Exponentials
Representation of Periodic Signals - Continuous Time Fourier Series Approximation of Periodic
signals using Fourier Series - Convergence of Fourier Series Representation of Aperiodic Signals
The Continuous Time Fourier Transform Properties of CTFT The Convolution Property
The Modulation Property The Frequency Response of Systems Characterized by Linear Constant
Coefficient Differential Equations First order and Second order Systems.

UNIT IV : Fourier analysis for discrete -time signals and systems (16 Periods)
Introduction - The Response of Discrete-Time LTI Systems to Complex Exponentials
Representation of Periodic Signals The Discrete Time Fourier Series Representation of
Aperiodic Signals The Discrete Time Fourier Transform Properties of DTFT The
Convolution Property The Modulation Property Duality - The Frequency Response of Systems
Characterized by Linear Constant Coefficient Difference Equations First order and Second order
Systems.

Text Book:

1. Alan V. Oppenheim and Alan S. Willsky with S. Hamid Nawab, Signals and Systems,
Pearson Education, Second Edition, 2006.

References:

1. Simon Haykin and Baray Van Veen, Signals and systems, Wiley and sons,
2. Hwai Hsu, Schaums outline of Signal and Systems, McGraw Hill, 1995.
BITCEE405 CONTROL SYSTEMS

L T P CREDITS
3 1 0 4

UNIT 1 (14 periods)
Introduction: Definition of control system linear system open loop and closed loop
systems block diagrams transfer function signal flow graph (Masons rule)
examples and problems.Control system components: Potentiometers-synchros-a.c
and d.c tacho generators transfer functions of armature controlled and field controlled
d.c shunt motor a.c and d.c servomotors for position control stepper motor
gear trains analogy with transformer.

UNIT 2 (15 periods)
Time response of linear systems : first order and second order ystems impulse
response and step response of first and second order linear systems time domain
specifications like rise time, delay time, overshoot and settling time of a second order
system response to ramp input type and order of a system stready state error and
error constants generalized error constants examples and problems.

UNIT 3 (15 periods)
Frequency response: correlation between time and frequency response polar plot
Bode plots magnitude plot steps for drawing the asymptotic Bode magnitude plot
phase angle plot gain and phase cross-over frequencies gain margin and phase margin
their definitions and determination from Bode plots-examples and problems

UNIT 4 (16 periods)
Stability analysis: concept of stability BIBO criterion characteristic equation
Stability definitions Routh-Hurwitz stability criterion Nyquist plot Steps for drawing
the Nyquist plot Typical Nyquist curves critical point Nyquist stability criterion and its
application examples and problems.
Root locus technique: Root locus plot rules for construction typical root locus
trajectories determination of critical gain.

Text Book:
1. I.J. Nagrath & M.Gopal, Control System Engineering, New Age International,2001.

References:
1. Benjamin C.Kuo, Automatic Control Systems, Prentice Hall,India,New Delhi,
7
th
Edition 2000.
2. Katsuhiko Ogata, Modern Control Engineering, Prentice Hall,India, New Delhi,
3
rd
Edition 2000.

BITDIT402 LINUX PROGRAMMING
(Common for CSE and ICT )
L T P CREDITS
2 0 3 4

UNIT I (19 Periods)
Introduction and Shell Programming: Basic Linux Programming Concepts Linux Design
Linux Documentation Man Pages Information Pages Program Documentation Internet
Resources - Quick Introduction to Bash Redirection and Piping Variables Functions
Conditionals and Loops Shell utilities.


Regular Expressions, Emacs, Linux Data files and scripts: Introducing Regular Expressions
Understanding character classes using quantifiers Introducing Alternation and Grouping
Supporting Regular Expressions in Linux Emacs modes and Emacs as an IDE File system
layout Passwd and Shadow files group files init files and network files.

Processes and Signals : Understanding the process model introducing process basics starting
and stopping processes using return codes synchronizing actions understanding security use
of signals signal handlers signal sending -signals and system calls


Shared Memory and Semaphores Pipes, FIFOs Internet Sockets: Synchronization with
Semaphores Communicating with Shared Memory, Setting up Pipes Implementing Redirection
Addressing Communication issues Using FIFOs Introduction to TCP/IP Protocols
Addressing Client Side Connections Server side Connections.

Text Book:

1. John Goerzen, Linux Programming Bible, IDG Books India (P) Ltd., 2000.

References:

1. Richard Petersen, Linux: The Complete Reference, Tata McGraw Hill, Second Edition,
2001.
2. Neil Mathew and Richard Stones, Professional Linux Programming, Wrox Press Ltd., 2001.

BITDIT403R01 OBJECT ORIENTED ANALYSIS AND DESIGN
L T P CREDITS
3 1 0 4

UNIT - I : (15 Periods)
Overview of Object oriented system development - Objects Attributes Behaviors
Relationship and Associations Aggregation Object and identity Static and Dynamic binding
Object persistence OOSD Life cycle OO Methodologies Patterns Frameworks Unified
approach.

Unified modeling language Introduction - UML Class diagrams Use Case Diagram Dynamic
modeling - OO Analysis Process Use case driven OO Analysis Use case model
Classification Noun Phrase approach Common class pattern - Classes, Responsibilities and
Collaborators.

Identifying object relationship - Associations super subclass Aggregation Identifying
Attributes and Methods Class Responsibility Object Responsibility Object oriented Design
Axioms and Corollaries.

Designing classes Process Class visibility Refining Attributes Designing methods and
protocols Access Layer OODBMS Object relational systems Multidatabase systems-
Designing Access layer classes View layer Designing view layer classes macro level process
and micro level process-Software quality assurance QA Test Testing strategies Impact of OO
on testing Test case Test plan Continuous testing.

Text Book:

1. Ali Bahrami, Object oriented System Development, McGraw Hill International Edition,
1999.

References:

1. Booch G, Object oriented analysis and design, Addison-Wesley Publishing Company,
1994.
2. Ram Baugh J, Blaha.M. Premarlini, W., Eddy F and Lorensen W., Object oriented
modeling and design, Prentice Hall of India, 1997.

BITDIT404R01 THEORY OF COMPUTATION
L T P CREDITS
3 1 0 4

UNIT I (15 Periods)

Regular Languages: Finite Automata-Non determinism-Regular expressions-non-regular
languages, Context Free Languages: Context Free Grammars-Push Down Automata-Non Context
Free Languages.


The Church Turing Thesis: Turing Machines-variants of Turing Machines, Reducibility, The
Recursion Theorem-decidability of logical theories-Turing Reducibility


Time Complexity: Measuring Complexity-The class P-The class NP- NP completeness-
Definition-Cook Levin Theorem- vertex cover problem-Hamiltonian path problem. Space
Complexity: Savitchs Theorem-PSPACE class-PSPACE completeness-The classes L and NL-NL
completeness-coNL


Intractability: Hierarchy Theorems-Relativization-Circuit Complexity, Approximation
algorithms-Probabilistic algorithms-Interactive Proof Systems-Parallel Computation

Text Book:

1. Sipser, Michael, Introduction to the Theory of Computation, Second Edition, Boston,
MA: Thomson Course Technology, 2005.

References:
1. Jozef Gruska, Foundations of Computing, International Thomson Computer Press, 1997.
2. J.E.Hopcroft and J.D.Ullman, Introduction to Automata Theory, Languages and
Computation, Narosa Publishers, 2002.
3. J.C.Mortin, Introduction to Languages and Theory of Computation, McGraw Hill, 2002.

BITDIT405R01 COMMUNICATION ENGINEERING
(Common for CSE and IT)
L T P CREDITS
3 1 0 4

UNIT I (15 Periods)
Amplitude Modulation: Transmission And Reception: Electromagnetic spectrum Need for
modulation Principles of amplitude modulation AM envelope, frequency spectrum and
bandwidth, modulation index, AM power distribution SSB, DSBSC and VSB systems. AM
modulator circuits linear and non linear modulators Envelope detector AM transmitters Low
and high level transmitters, receiver parameters AM receivers choice of IF TRF, super
heterodyne receiver

Angle Modulation: Transmission And Reception : Angle modulation FM and PM waveforms,
phase deviation and modulation index, frequency deviation, Bandwidth requirements for Angle
modulated waves direct and indirect method of FM generation slope, balanced slope, ratio
detector and foster seely FM discriminators. Direct and indirect FM transmitters, Comparison of
AM, FM and PM

Digital Communication: Introduction, Sampling Theorem, pulse modulation, PCM PCM
sampling, sampling rate, signal to quantization noise rate, companding percentage error, delta
modulation, pulse transmission PAM, PDM and PPM modulation and demodulation
techniques Introduction, Shannon limit for information capacity OOK, ASK, FSK, PSK systems
Bit rate and baud rate consideration, comparison QPSK, Quadrature Amplitude modulation
constellation diagram

Communication Systems: Introduction t o sat ellit e communicat ion types of Sat ell it es,
orbit s, earth station, components of communication satellite. Introduction to optical
communication system advantages Principle of light transmission, types of fiber transmitter
and receiver block fiber losses Introduction to RADAR system principle range equation
PRF pulsed Radar and CW Radar -Radar antennas
Text Books:
1. Kennedy and Davis, Electronic Communication systems, Tata McGraw Hill, Fourth
Edition 1999. [Units I & II]
2. Wayne Tomasi, Electronic Communication Systems: Fundamentals Through Advanced,
Pearson Education, 2001. [Units III & IV)
References:
1. Simon Haykin, Communication Systems, John Wiley & Sons, Fourth Edition, 2001.
2. Behrouz Forouzan, Introduction to data communications and Networking, Tata McGraw
Hill, 2004
3. Roody D and Coolen J, Electronic Communications, Prentice Hall of India, Fourth
Edition 2007.
BITDIT406R01 DIGITAL IMAGE PROCESSING
L T P CREDITS
3 1 0 4

UNIT I (15 Periods)
Fundamentals of Image Processing
Digital image fundamentals Elements of visual perception Image model - Sampling and
Quantization matrix Vector representation of discrete images Fourier transform and its
properties Discrete Fourier transform Discrete cosine transform Karhunen Leove (KL)
transform Wavelet transform.

Image Enhancement
Point operations Contrast stretching Histogram modification techniques Image smoothening
Image sharpening Pseudo and colour processing Image restoration model Least mean square
filter Interactive restoration Restoration in spatial domain.

Image Compression Standards
Image data compression models Error free compression Fundamental coding theorems Error
free coding Pixel coding Predictive techniques Transform coding Threshold coding Image
compression standards Joint Picture Expert Group (JPEG) and Motion Picture Expert Group
(MPEG).

Segmentation
Image segmentation Detection of discontinuities Thresholding Motion in segmentation.
Elements of image analysis Region and scene analysis Classification techniques Image
understanding systems Pattern recognition by pattern classes Neural Networks in image
processing Image processing applications.

Text Book:.
1. R.C. Gonzalez and R.E. Woods, Digital Image Processing, Addison-Wesley Publishing
Company, Third Edition, 2002.
References:
1. William K.Pratt, Digital Image Processing, John Wiley & Sons, Third Edition, 2001.
2. Anil K. Jain, Fundamentals of Digital Image Processing, Pearson Education Ltd.,1995.
3. Gregory A Baxes, Digital Image Processing Principles and Applications, John Wiley &
Sons, 1994.

BITCIT406R02 OPERATING SYSTEMS LAB
L T P CREDITS
0 0 3 2

1. Write a C program that illustrates the execution of two commands concurrently with a
command pipe.
2. Write a C program that illustrates the creation of child process using fork system call.
3. Write a C program that implements a producer-consumer system with two processes
4. Write a C program that implements a Reader- Writer problem.
5. Write a C program that implements a Dining Philosopher Problem.
6. Write a C program that illustrates inter process communication using shared memory
system calls.
7. Write a C program that illustrates the following :
a. Creating a message queue.
b. Writing to a message queue.
c. Reading from a message queue.
8. Simulate the following CPU scheduling algorithms :
a. Round Robin b) SJF c) FCFS d) Priority
9. Simulate the following File Allocation strategies :
a. Sequential b. Indexed c. Linked
10. Simulate MVT and MFT
11. Simulate Bankers Algorithm for Dead Lock Avoidance.
12. Simulate Bankers Algorithm for Dead Lock Detection.
13. Simulate the following File Organization Techniques :
a. Single level directory b) Two level c) Hierarchical d) DAG
14. Simulate the following Page Replacement algorithms :
a. FIFO b) LRU c) LFU
15. Simulate Paging Technique of Memory Management.
BITCIT407R01 JAVA PROGRAMMING LAB

L T P CREDITS
0 0 3 2

1. Polymorphism in java.
2. Inheritances in Java.
3. Interfaces in Java.
4. Packages in java.
5. Programs to create multiple threads in JAVA.
6. Developing a simple applet using labels, text fields and buttons.
7. Developing a simple applet using list box, choice box, scroll bar and check box.
8. Developing standalone GUI interface using frames.
9. Developing an applet for demonstrating the font features.
10. Develop an applet using panels and layout manager.
11. Develop an applet for demonstrating graphics features using brush styles, colors, etc.

BITCTP 408 HR SKILLS - II

L T P CREDITS
1 0 0 1


1. Creative Thinking-Picture/Case Study 2

2. Check your memory Power Audio Visual Presentation 1

3. If I were ?-Speech 2

4. Aptitude Test II 3

5. Skit/Mime Presentation-Group Exercise 2

6. The Book I like-(Book Review) 2

7. Quiz on Current Affairs 1

8. End Semester Examinations 2

TOTAL 15

BITDIT401R01 OBJECT ORIENTED PROGRAMMING IN C++
L T P CREDITS
3 1 0 4


Introduction: Principles of Object Oriented Programming- C++-Applications-C++ statements-
Structure Tokens Keywords-Identifiers-Constants-Data Types user defined-derived
declaration of variables dynamic initialization of variables reference variables operators in
C++ - scope resolution member dereferencing and memory management operators type cast
operator expressions and their types operator overloading operator precedence-control
structures

Functions, Classes and Objects: Function prototyping call by reference- inline functions-
function overloading-friend and virtual functions class defining member functions nesting of
member functions-private member functions-static data members static member functions-array
of objects objects as function arguments pointers to members-Constructors - destructors


Overloading, Inheritance and Polymorphism: Overloading unary, binary operators binary
operators using friends, manipulation of strings- rules type conversions single, multi-level,
multiple, hierarchical, hybrid inheritance virtual base classes- abstract classes virtual functions
pointers -pointers to objects.


Files, Templates and Exception Handling: File stream operations file modes file pointers
command line arguments, class templates function templates overloading of template functions
basics of exception handling, mechanism, throwing, catching- manipulation of strings

Text Book:

1. E. Balagurusamy, Object Oriented Programming with C++, TMH, Third Edition, 2006.

References:
1. Bjarne Stroustrup, The C++ Programming Language, Pearson Education, Third Edition,
2005.
2. Robert Lafore, Object Oriented Programming in Turbo C++, Galgotia Publications,
2006.
BITDIT407R01 OBJECT ORIENTED PROGRAMMING LAB

L T P CREDITS
0 0 3 2
=============================================================
Develop C++ Program with the following concepts

1. Pointers and Arrays.
2. Structures and Functions.
3. Classes and Objects.
4. Unary and Binary Operator Overloading with and without Friend Functions.
5. Various types of Inheritance.
6. Virtual functions and Abstract Classes.
7. Overriding Virtual base functions.
8. Class and Function Templates.
9. Exceptions Handling.
10. Files and Streams.
11. Overloading Insertion/Extraction Operators.

SEMESTER V:

Periods of Instruction
Credits
L T P
BITCIT501R01 Design and Analysis of Algorithms 3 1 0 4
BITCIT502
Data Communication & Computer
Networks
4 1 0 5
BITCIT503R01 Digital Signal Processing 3 1 0 4
BITCIT504R01 Data Base Management Systems 3 1 0 4
BITDIT XXX DE 4 3 1 0 4
BITCIT505
Data Communication & Networks
Lab
0 0 3 2
BITCIT506R02
Data Base Management Systems
Lab
0 0 3 2
BITCTP507R01 HR Skills - III 1 0 0 1
TOTAL 20 6 6 30


BITDIT501R01 Cryptography and Network Security 3 1 0 4
BITDIT502R01 Wireless Communication 3 1 0 4
BITDIT503R01 Artificial Intelligence 3 1 0 4
BITDIT504 C# Programming 2 0 3 4
BITDIT505R01 Simulation and Modeling 3 1 0 4

BITCIT501R01 DESIGN AND ANALYSIS OF ALGORITHMS
L T P CREDITS
3 1 0 4

UNIT-I (15 Periods)
Basic Concepts of Algorithms: Introduction Fundamentals of Algorithmic Problem Solving
Important Problem Types Fundamentals of the Analysis of Algorithm Efficiency Analysis
Framework Asymptotic Notations and Basic Efficiency Classes Mathematical Analysis of
Recursive and Non-recursive Algorithms Fibonacci Numbers Empirical Analysis of Algorithms
Algorithm Visualization
UNIT-II (15 Periods)

Divide and Conquer & Decrease and Conquer : Brute Force Selection Sort and Bubble Sort
Divide and conquer Merge sort Quick Sort Multiplication of Large Integers and Strassens
Matrix Multiplication Decrease and Conquer Insertion Sort Depth first Search and Breadth
First Search Topological Sorting Algorithms for Generating Combinatorial Objects Decrease-
by-a-Constant-Factor Algorithms Variable-Size-Decrease Algorithms Sorting by Counting

UNIT-III (15 Periods)

Transform and Conquer & Dynamic Programming :Transform and conquer Presorting
Gaussian Elimination Heaps and Heap sort Horners Rule and Binary Exponentiation
Problem Reduction Dynamic Programming Computing a Binomial Coefficient Warshalls
and Floyds Algorithm Optimal Binary Search trees The Knapsack Problem and Memory
Functions.

UNIT-IV (15 Periods)

Greedy Techniques, Backtracking & Branch and Bound: Greedy Techniques Prims
Algorithm Kruskals Algorithm Dijkstras Algorithm Huffman trees Backtracking n-
Queens Problem Hamiltonian Circuit problem Subset-Sum problem Branch and bound
Assignment problem Traveling salesman problem.

Text Book:

1. Anany Levitin, Introduction to the Design and Analysis of Algorithm, Pearson
Education, Second Edition, 2007.

References:
1. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms,
Prentice Hall of India, Second Edition, 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.
4. S.K. Basu, Design and Analysis of Algorithms, Prentice Hall of India Learning Pvt. Ltd.,
2005.

BITCIT502 DATA COMMUNICATION & COMPUTER NETWORKS

L T P CREDITS
4 1 0 5

UNIT - I: (18 Periods)
Data Communication: Data Communication system components, Networks, Protocols - Standard
making organizations - Data rate and Channel capacity - Encoding and Digital data communication
techniques-Concepts of source coding and channel coding - Asynchronous and Synchronous
transmissions - Comparison of bit / baud for various keying technique ASK, PSK, FSK, QAM -
Interfaces and modems - Digital data transmission - Parallel and Serial DTE / DCE interface data
terminal equipment, data circuit terminating equipment - Standards RS 232, other Interface
Standards EIA 449, EIA 530, X.21, Transmission rate of modems, Modem standards.

Network Fundamentals: Network Structure - Network Architecture - Line configuration -
Topology of networks - Transmission modes - Categories of Networks - Inter-Networks - OSI
model - Functions of different layers - Physical layer - Switching: Circuit switching, Packet
switching, Message switching - Network layer - Connection oriented and connectionless services.
Local area network - Networking and inter-networking devices - Repeater - Bridges - Routers -
Gateways - Ethernet - Token bus - Token ring - FDDI comparison - LAN controller.

Types of errors and detection, redundancy, VRC, LRC, CRC techniques - Error correction -
Forward and backward error correction - Single bit and multi bit error correction - Hamming code.
Data link control: Need for data link control - Line discipline, ENQ / ACK, Flow control stop and
wait sliding window protocol, Error control, ARQ, Stop and wait ARQ, Sliding window ARQ
Protocols: Asynchronous and Synchronous communications - Asynchronous and Synchronous
Protocol - Character oriented protocol, BSC, bit oriented protocols - HDLC frames - Link access
procedures - X.25 Protocol.


Network layer design issues, Congestion Control algorithm, Routing algorithm - Transport layer -
Design issues - Duties of the Transport layer, Connection management - OSI Transport Protocol -
Transport Protocol data unit . Upper OSI layers - Session layer: Session and Transport
initialization - Synchronization points - Session Protocol Data unit - Presentation layer -
Translation - Encryption / Decryption, Authentication - Data Compression.Application layer -
Message handling systems - File Transfer Access and Management (FTAM) - Virtual Terminal
(VT) - Directory services - Common Management Information Protocol - TCP/IP: TCP/IP and the
Internet - TCP/IP and OSI, IP and other protocols in the Network layer, UDP and TCP
Text Book:

1. Behrouz Forouzan, Introduction to Data Communications and Networking, Tata McGraw
Hill, Fourth Edition, 2006.

References:

1. William Stallings, Data and Computer Communications, Prentice Hall of India, Eighth
Edition, 2007.
2. William Schewber, Data Communication, Prentice Hall of India, 2003.
3. A. S. Tanenbaum, Computer Networks, Pearson Education, Third Edition, 2006.

BITCIT503R01 DIGITAL SIGNAL PROCESSING
L T P CREDITS
3 1 0 4

UNIT- I
Discrete Transforms (15 Periods)
Introduction Z transform and its application to the analysis of LTI systems: Region of
Convergence Right, Left and two sided sequences Properties of Z transform Rational Z
transform System function of LTI systems Inversion of Z transform - Discrete-Time Fourier
transform Relationship of DFT to other transforms Properties of DFT Linear filtering of long
data sequences Frequency analysis of signals using DFT Computational complexity of DFT
Decimation-in-time, Fast Fourier Transform algorithm - Inverse FFT.

UNIT II
Implementation of Discrete Time Systems (15 Periods)
Structures for the realization of discrete time systems Structures for FIR systems: Direct Form
structure Cascade Form structure Frequency sampling structure Lattice structure Structures
for IIR systems: Direct Form Signal Flow Graphs and Transposed Structures Cascade, Parallel
Form, Lattice and Lattice Ladder Structures Representation of numbers: Fixed point and binary
floating point representation quantization of filter coefficients Round of effects in digital filters

UNIT III
Finite Impulse Response Filters (15 Periods)
Design of Digital Filters General Considerations - Symmetric and antisymmetric FIR filters
Design of Linear Phase FIR filters using rectangular, Hanning, Hamming, Blackman and Keiser
windows. Design of Linear phase FIR filters by frequency sampling method Optimum equiripple
linear phase FIR filter Comparison of design methods for linear phase FIR filter.

UNIT IV
Infinite Impulse Response Filters (15 Periods)
Review of analog filters: Butterworth, Chebyshev and Elliptic types Design of IIR filter from
Analog Filters Design by Approximation of Derivatives - Design by Impulse Invariance IIR
filter design by Bilinear Transformation Matched Z transform - Frequency transformation in the
analog and digital domain.

Text Books:

1. John G. Proakis , Dmitris G. Manolakis and Sharma,Digital Signal Processing, Pearson
Education , 2006.
2. N.Kesavamurthy and S. Narayana Iyer, Digital Signal Processing, Jaico Publishing
House, 2006.

References:

1. Chi-TSong-Chen, Digital Signal Processing, Oxford Press, 2001
2. Sanjit K. Mitra, DSP, A Computer Based Approach, McGraw Hill, Third Edition, 2007.
3. S.V.Narasimhan and S. Veena, Signal Processing principles and implementation,
Narosa publishing house, 2005.
4. Oppenheim and Schaffer, Discrete Time Signal Processing, Prentice Hall of India,

BITCIT504R01 DATABASE MANAGEMENT SYSTEMS
L T P CREDITS
3 1 0 4

UNIT I (15 Periods)
Introduction: DataDatabaseCharacteristics of the Database Approach Actors on the scene
Advantages Data models, Schemas and Instances Three Schema Architecture and Data
IndependenceDatabase Languages and InterfacesDatabase System EnvironmentClassification
of DBMS.
Files: Buffering of BlocksPlacing File records on DiskOperation on filesIntroduction to
IndexesTypes of IndexesBTrees, B+Trees.

Data Modeling: Data modeling using the ER modelEnhanced ER modelingUML Class
diagramsRelational model conceptsRelational model constraints and Relations Database
Schemas.
SQL: IntroductionSub-languagesDDLConstraintsSystem tablesDMLselection, Insert,
Update and DeleteOperatorsProjectionJoinsSub queries, nesting and correlated Sub queries
GroupingSortingSet operationsAggregation and BuiltinFunctionsWorking with Date Data
typeDatabase SecurityReportsSynonymsViewsSequencesindexes, Stored Procedures
Triggers, Cursors.

Relational Algebra: SELECT, PROJECT, SET OPERTIONS, JOIN, DIVISION, Aggregate
Function and Grouping, Outer Join & Outer Union operations. Examples of Queries in Relational
Algebra.
Relational Database Design: Functional Dependency, First, Second and Third Normal Forms,
BCNF, Multi Valued Dependency and Fourth Normal Form, Join Dependency and Fifth Normal
Form.

Transaction Processing Concepts: Introduction to Transaction ProcessingTransaction and
System ConceptsCharacterizing schedulesConcurrencyControl TechniquesTransaction
Recovery conceptsRecovery Techniques.

Text Book:
1. R.Elmasri and S.B.Navathe, Fundamentals of Database Systems, Pearson Education,
Fourth Edition, 2004.
References:
1. Henry F.Korth, Abraham Silberschatz and Sudarshan, Database System Concepts,
McGraw Hill, Fifth Edition, 2005.
2. S.K.Singh, Database Systems Concepts, Design and Applications, Pearson Education,
2006
3. C.J.Date, An introduction to database, Addison Wesley, Seventh Edition, 2000.
BITDIT501R01 CRYPTOGRAPHY & NETWORK SECURITY

L T P CREDITS
3 1 0 4

UNIT I (15 Periods)
Introduction: Security Threats, Security Attacks, Security Services, Mechanisms- Model for
Network Security-Classical Encryption Techniques-Substitutions-Transpositions Techniques-
Stream Cipher, Block Cipher- Cipher Modes-ECB-CBC-CFB-OFB- Traffic Confidentiality -
Feistal Cipher Structure - Key Management - Random Number Generation.
Types & Algorithms: Symmetric Public Key Cryptography- Combining Block ciphers
Double, Triple Encryption, Doubling the Block length- How Crypto system fails? Choosing
between Strong and Weak Crypto Systems - Data Encryption Standards- AES- RSA Algorithm
Blowfish Knapsack Algorithm.
Hash Algorithm, Key Management: Diffie Hellman Key Exchange EKE Conference Key
Distribution - Elliptic Curve Cryptography Authentication Message Authentication Codes -
Hash Functions - Secure Hash Algorithm Digital Signatures DSA - Authentication Protocols-
Kerberos AKEP2.
E-Mail Security: Pretty Good privacy - S/MIME - IP Security: Overview Architecture
Authentication Header Encapsulating security payload Combining Security associations Web
Security: SSL- TLS-SET Firewalls: Design Principles Trusted systems

Text Books:

1. Bruce Schneier, Applied Cryptography: Protocols, Algorithms, and Source Code in C, John
wiley & Sons, Second Edition, 1996. [Units I, II & III]
2. William Stallings, Cryptography and Network Security: Principles and Practice, Pearson
Education, Fourth Edition, 2006 [Units I, III & IV]

References:

1. Alfred J. Menezes, Paul C.Van OorSchot, Scott A. Van Stone, Handbook of Applied
Cryptography, CRC Press, 1996.
2. Richard E. Smith, Internet Cryptography, Addison Wesley, 1997.
3. Atul Kahate, Cryptography and Network Security, Tata McGraw Hill, 2003.
BITDIT502R01 WIRELESS COMMUNICATIONS
L T P CREDITS
3 1 0 4

UNIT-I (15 Periods)

Evolution of mobile radio communications: Examples of wireless communication systems-
Comparison of common wireless communication systems- Second generation (2G) cellular
networks- Evolution to 2.5G wireless networks- Evolution to 2.5G TDMA standards- Wireless
local loop (WLL) and LMDS- Wireless local area networks (WLANs)
Cellular Concept- Frequency reuse- Channel assignment strategies- Hand off strategies-
Interference and system capacity- Introduction to radio wave propagation- Free space propagation
model- Small scale multipath propagation Overview of GSM and AMPS Architecture.


Fundamentals of equalization: Training generic adaptive equalizer-Equalizers in a
communication receiver-Survey of equalization techniques-Linear equalizers-Nonlinear equalizers-
Algorithms for adaptive equalization-Fractionally spaced equalizers-Diversity techniques-Practical
space diversity considerations-Polarization diversity-Frequency Diversity-Rake receiver.


Fundamentals of channel coding: Block codes and finite fields-Convolutional codes-Coding
gain-Trellis coded modulation-Turbo codes-Speech coding-Quantization techniques-Adaptive
differential pulse code modulation (ADPCM) - Vocoders.


Packet radio protocols: Carrier sense multiple access (CSMA) protocols-Reservation protocols-
Capture effect in packet radio-Capacity of cellular systems wireless networking-Introduction to
wireless networks-Differences between wireless and fixed telephone networks-Fixed network
transmission hierarchy-Traffic routing in wireless networks-Wireless data services-Common
channel signaling(CCS)-Integrated services digital network(ISDN)-Protocols for network access.

Text Book:
1. Theodore Rappaport, Wireless Communication-Principles and Practice, Prentice Hall of
India, Second Edition, 2007.
Reference:
1. Poor & Wang, Wireless communication Systems-Advanced Techniques for signal
Reception, Prentice Hall of India, First Edition , 2003.
BITDIT503R01 ARTIFICIAL INTELLIGENCE
L T P CREDITS
3 1 0 4

UNIT I (15 Periods)
Introduction Introduction to AI - The History of Artificial Intelligence - The State of the Art -
Intelligent Agents - Agents and Environments - The Structure of Agents Problem Solving -
Problem-Solving Agents - Uninformed Search Strategies - Breadth-first search - Depth-first search
- Depth-limited search - Iterative deepening depth-first search Bi-directional search Comparing
uninformed search strategies.

Informed Search and Exploration - Heuristic Search Strategies - Greedy best-first search - A*
search - Memory-bounded heuristic search - Heuristic Functions - Local Search Algorithms and
Optimization Problems - Hill-climbing search - Simulated annealing search - Constraint
Satisfaction Problems - Backtracking Search for Constraint Satisfaction Problems Adversarial
Search - Optimal Decisions in Games - Optimal strategies - The mini-max algorithm - Alpha-Beta
Pruning.
Knowledge and Reasoning - Logical Agents - Knowledge-Based Agents - Logic - Propositional
Logic - Reasoning Patterns in Propositional Logic Resolution - Forward and backward chaining -
Effective propositional inference - A complete backtracking algorithm - Local-search algorithms -
First-Order Logic - Syntax and Semantics of First-Order Logic - Inference in First-Order Logic -
Propositional vs. First-Order Inference - Unification and Lifting - Forward Chaining - Backward
Chaining Resolution.
Planning and Learning - Planning with State-Space Search - Forward state-space search -
Backward state-space search - Heuristics for state-space search - Uncertain knowledge and
reasoning - Uncertainty - Acting under Uncertainty - Basic Probability Notation - The Axioms of
Probability - Inference Using Full Joint Distributions - Bayes' Rule and Its Use - Learning -
Learning from Observations - Forms of Learning.

Text Book:

1. Stuart Russel and Peter Norvig, Artificial Intelligence -A Modern Approach, Prentice
Hall International, Second Edition, 2008.
References:

1. George F.Luger, Artificial Intelligence Structures and Strategies for Complex Problem
Solving, Pearson Education, Fourth Edition, 2004.
2. Elain Rich and Kevin Knight, Artificial Intelligence, Tata McGraw Hill, Second Edition,
1993.
BITDIT504 C# PROGRAMMING
L T P CREDITS
2 0 3 4

UNIT-I (19 Periods)
Basics of C#: Creation of C# - C# and .net frame work-CLR- Managed and unmanaged code-CLS
- Object Oriented Programming-Simple programs-Data types, literals, and variables-Operators-
Program Control statements .
Classes and Objects: Class fundamentals - Creating objects Reference variables Methods
Constructors new Operator- Garbage collection and destructors - this keyword.

Arrays and Strings: One dimensional arrays - Multi dimensional arrays Jagged Arrays Array
references Length property Arrays and for. Each loop - Strings Closer look at methods and
classes
Operator Overloading: Fundamentals Overloading binary and unary operators Handling built-
in types - Overloading Relational, Logical, True and False Conversion operators - Overloading
restrictions- Indexers and Properties

Inheritance: Inheritance Basics Member access and Inheritance Constructors and inheritance
Name Hiding - Multilevel Hierarchy Base class references and Derived Objects Virtual
methods and overriding Abstract class Sealed Object Class- Boxing and unboxing.
Interfaces: Implementation Interface references, Properties, Indexers Interface inheritance and
name hiding Explicit implementation Interface Vs Abstract class Structures and
Enumerations.

Exception Handling: - The System.Exception class Fundamentals Uncaught exceptions
Multiple catch Catch all Nesting try blocks Throwing and Rethrowing exceptions Finally
Deriving Exception classes Using checked and unchecked
Delegates and Events: Delegates Multicasting System.Delegate Purpose of delegates
Events - Multicast event Instance Vs Static method Event accessors - Unsafe code and Pointers.

Text Book:
1. Herbert Schildt, "C#: The Complete Reference", Tata McGraw Hill, 2002.
References:
1. Burton Harvey, Simon Robinson, Julian Templeman, Karli Watson, C# Programming with
the Public Beta, Shroft Publishers & Distributers, 2001.
2. Balagurusamy, E, Programming in C#, TMH Publishing, 2002.
BITDIT505R01 SIMULATIONS AND MODELING
L T P CREDITS
3 1 0 4

UNIT I (15 Periods)
Simulation fundamentals and Introduction to Arena: Modeling-advantages and disadvantages
of simulation-kinds of simulation-methods for doing simulation-use of simulation, fundamental
concepts of simulation, a guided tour through Arena

Modeling Basic Operations and Inputs: Electronic assembly and test system and its enhanced
version using animation and parts transfer-Input analysis, Modeling detailed operations: modeling
issues-modeling approach-building the model-finding and fixing modeling errors-building
automotive shop model with animation-inventory simulation, Statistical Analysis of Output
From Terminating Simulations: time frame of simulations-strategy for data collection and
analysis-confidence intervals for terminating simulations-comparing two alternatives-evaluating
many alternatives with the process analyzer-searching for an optimal alternative with OptQuest.

Intermediate Modeling and Steady State Statistical Analysis: Simulation of small
manufacturing system-statistical analysis of output from steady state simulations, Entity Transfer:
Types-small manufacturing system with resource constrained transfers and transporters-conveyors-
modeling conveyors using advanced transfer panel-more on transporters-entity reneging-holding
and batching entities-overlapping resources-miscellaneous modeling issues.

Arena Integration and Customization: reading and writing data files-VBA in Arena-presenting
arrival choices to the user-recording and charting model results in excel-modules using the Arena
professional Edition, continuous and combined models: modeling simple discrete/continuous
system-coal loading operation-continuous state change systems, Statistical issues: random number
generation-generating random variates-non stationary poisson process-variance reduction-
sequential sampling-designing and executing simulation experiments, conducting simulation
studies

Text Book:
1. W. David Kelton, Randall P Sadowski, David T Sturrock, W. Kelton, Randall Sadowski,
David Sturrock, Simulation with Arena, Mcgraw Hill, Third Edition, New York,2004.

Reference:
1. Averill M. Law, W. David Kelton, Simulation Modeling and Analysis, Mcgraw Hill,
Third Edition, New York, 2000.
BITCIT505 DATA COMMUNICATION AND NETWORKS LAB

L T P CREDITS
0 0 3 2

1. Encryption and Decryption techniques
2. Compression and decompression techniques
3. Error detection and correction codes
4. Serial Communication between PCs (Character Transfer)- Communication via
RS 232/ Modems
5. Ping a computer using Java API and Detect system information such as retrieval of computer
names and their IP Addresses,obtaining Node Address
6. File Transfer using TCP and UDP
7.Using networking communication functions like sending POP-UP messages via
NetMessage functions
8. Simulation of HDLC and X.25 protocols
9. Information transfer using different routing protocols

Study Exercises
1. Case Study on web server
2. Study of Network Performance and Management using an SNMP, FTP, HTTP, SMTP and
other protocols.
3. Study of Wireless LAN Architecture and devices
4. Case study on entire SASTRA intranet (infrastructured network)
BITCIT506R02 DBMS LAB
L T P CREDITS
0 0 3 2

PART I: SQL
1. Creation of Tables & Simple Queries.
2. Implementation of key Constraints.
3. Implementation of Arithmetic / Logical Operations , Sorting & grouping.
4. Nested Queries.
5. Joins.
6. Built-In functions.
7. Update Operations.
8. Index , Sequences , Synonyms & Views.
9. Simple PL/SQL Procedure & Cursors

PART II: Developer 2000 (Forms)

10. Student Information.
11. Payroll Systems.

PART- III Developer 2000 (Reports)

12. Payroll Reports.
13. Student Reports.

Additional Experiments
PL/SQL
1. Triggers.

BITCTP507R01 HR Skills - III
L T P CREDITS
1 0 0 1


1. Mock Press 2

2. Technical Quiz-By student 2

3. Technical Interview By Parent Department Staff 2

4. Aptitude Test III 2

5. Case Study on Conflict Resolution 2

6. Corporate Ethics & Culture-Staff lecture 2

7. Out of Box Thinking Exercise 1


TOTAL 15

SEMESTER VI:

Periods of Instruction

Credits
L T P
BITCIT601R01 System Software 4 1 0 5
BITCIT602R01 Software Engineering 3 1 0 4
BITCIT603R01 Computer Graphics 3 1 0 4
BITCIT604R01 Mobile Communication 3 1 0 4
BITDXX XXX DE 6 3 1 0 4
BITDXX XXX DE 7 3 1 0 4
BITCIT605R01
System Software & Computer
Graphics Lab
0 0 3 2
BITCIT606R01 CASE Tools Lab 0 0 3 2
BITCTP607 HR Skills IV 1 0 0 1
TOTAL 20 6 6 30


BITDIT601R01 Data Warehousing and Data Mining 3 1 0 4
BITDIT602R01 Robotics 3 1 0 4
BITDIT603R01 Parallel Computing and algorithms 3 1 0 4
BITDIT604R01 Real Time Systems 3 1 0 4
BITDIT605R01 Distributed Systems 3 1 0 4
BITDIT606R01 Net Centric Computing 3 1 0 4
BITDIT607 Advanced Computer Architecture 3 1 0 4
BITDMA607 Resource Management Techniques 3 1 0 4

BITCIT601R01 SYSTEM SOFTWARE
L T P CREDITS
4 1 0 5

UNIT I (18 Periods)
Machine Architecture and Assemblers: Introduction, System Software and Machine
Architecture, The Simplified instructional Computers (SIC)-SIC machine architecture. SIC/XE
Machine Architecture, SIC programming Examples.

Assemblers-1: Basic Assembler Functions- A simple SIC Assembler, Assembler Algorithm &
Data Structures, Machine Dependent Assembler Features- Instruction Formats and addressing
modes, Program Relocation. Assemblers-2: Machine Independent Assembler Features-Literals,
Symbol Defining statements, Expressions, Program Blocks, Control Sections and Program
Linking, Assembler Design Options-One Pass Assemblers, Multi Pass Assemblers,
Implementation Example-MASM Assembler.

Basic Loader Functions- Design of an Absolute Loader, A simple Bootstrap Loader, Machine
Dependent Loader Features-Relocation, Program Linking, Algorithm and Data Structures for a
Linking Loader, Machine independent Loader Features-Automatic Library Search, Loader
Options, Loader Design Options-Linkage editor, Dynamic Linking, Implementation Example-
MSDOS Linker.

Macro Processors, Editors and Debugging Systems: Basic Macro Processor Functions-Macro
Definition and Expansion, Macro Processor Algorithm & Data Structures, Machine independent
Macro Processor Features- Concatenation of Macro Parameters, Generation of Unique Labels,
Conditional Macro Expansion, Keyword Macro Parameters, Macro Processor design Options
overview, Implementation Examples -MASM Macro Processor, ANSI C Macro Processor. Text
Editors-Overview of editing process, User interface, editor structure, Interactive Debugging
Systems-Debugging Functions and capabilities, Relationship with other parts of the system, User
interfaces criteria.

Text Book:
1. Leland. L.Beck and D. Manjula, System Software: An Introduction to Systems
Programming, Pearson Education, Third Edition, 2007.

References:
1. John R. Levine, Loaders and Linkers, Academic Press, 2004.
2. D.M.Dhamdhere, System Programming and Operating Systems, Tata McGraw Hill,

BITCIT602R01 SOFTWARE ENGINEERING
L T P CREDITS
3 1 0 4

UNIT I (15 Periods)
Software Engineering: Introduction to Software Engineering- -Evolving role of software-
Software-Changing Nature-Legacy software-Generic View of Process-layered technology-CMMI-
Process Patterns-Process Assessment- PSP & TSP-Process Technology-Product & Process-Process
Models- System Engineering.

Requirement Engineering: Estimation-Project Planning Process-Resources-Decomposition
techniques- Empirical Estimation Models- Estimation for OO Projects- Requirements
engineering-Tasks- Process- Eliciting Requirements- Developing Use cases and building the
model- negotiating and validating requirements-Building the Analysis Model-Requirement
analysis-approaches- data modeling concepts- OOA-Scenario, flow oriented and class based
modeling- Creating a behavioral model.

Design Engineering: Design Concepts- design model- pattern based software design-Creating an
architectural design-software architecture- data design- architectural styles and patterns-
architectural design- assessing- mapping data flow into architecture-Modeling Component level
design-Performing user interface design.

Testing and Metrics: Testing Strategies-strategic approach to software testing-strategic issues- test
strategies for conventional and OO software-Validation testing-System testing- art of debugging-
Testing Tactics- Product Metrics-Software Measurement.

Text Book:
1. Roger S Pressman, Software Engineering - A Practitioners approach, Tata McGraw
Hill, Sixth Edition, 2005.

References:
1. Pankaj Jalote, An Integrated Approach to Software Engineering, Narosa Publishing
House, Third Edition, 2005.
2. Rajib Mall, Fundamentals of Software Engineering, Prentice Hall of India, Second
Edition, 2004.

BITCIT603R01 COMPUTER GRAPHICS
L T P CREDITS
3 1 0 4

UNIT-I (15 Periods)
Introduction: Application areas of Computer Graphics, overview of graphics systems, video-
display devices, and raster-scan systems, random scan systems, graphics monitors and workstations
and input devices.
Output primitives: Points and lines, DDA Line Drawing Algorithm Bresenhams Line, Circle &
Ellipse algorithms. Filled area primitives: Scan line polygon fill algorithm, boundary-fill and flood-
fill algorithms.

2D geometrical transforms: Translation, scaling, rotation, reflection and shearing transformations,
matrix representations and homogeneous coordinates, composite transforms, transformations
between coordinate systems.
2D Viewing & Clipping: The viewing pipeline, viewing coordinate reference frame, window to
view-port coordinate transformation, viewing functions, Cohen-Sutherland and Cyrus-beck line
clipping algorithms, Sutherland Hodgeman polygon clipping algorithm Text Clipping.

3D Geometric transformations: Translation, rotation, scaling, reflection and shearing
transformations, composite transformations. 3D viewing: Viewing pipeline, viewing coordinates,
view volume and general projection transforms and clipping
3D object representation: Polygon surfaces, quadric surfaces, spline representation, Hermite
curve, Bezier curve and B-Spline curves, Bezier and B-Spline surfaces. Basic illumination models,
polygon-rendering methods.

Hidden Surface Elimination: Back Face Elimination Z Buffer Algorithm-Scan Line Algorithm-
Painters Algorithm
Computer animation: Design of animation sequence, general computer animation functions,
raster animation, computer animation languages, key frame systems, motion specifications.

Text Book:
1. Donald Hearn, Computer Graphics C version, 2e, Dorling Kindersley (India) Pvt
Ltd, 2006.
References:
1. Zhigand xiang, Roy Plastock, Schaums outline Series, Computer Graphics, TMH,
2. Foley, VanDam, Feiner and Hughes, Computer Graphics Principles & practice, Addison-
Wesley Professional, Second Edition, 1995.

BITCIT604R01 MOBILE COMMUNICATION

L T P CREDITS
3 1 0 4

UNIT I (15 Periods)
Wireless Transmission: Introduction Frequencies signals antennas signal propagation
multiplexing modulation spread spectrum cellular systems Medium access control.

Wireless Communication Systems: Telecommunication systems GSM, DECT Satellite
systems Broadcast systems Wireless LAN Infrared vs Radio transmission, Infrastructure and
Ad-Hoc networks, Bluetooth, WiMAX and Voice over Wi-Fi

Network And Transport Layers: Mobile Network layer Mobile IP, DHCP, Ad hoc networks
Mobile transport layer Traditional TCP, Indirect TCP, Snooping TCP, Mobile TCP

Application Layer & WML: WAP-architecture Wireless datagram protocol Wireless
transport layer security Wireless transaction protocol Wireless session protocol Wireless
application environment Introduction to WML and WML Script Writing programs in WML

Text Books:

1. Jochen H. Schiller, Mobile Communications, Pearson Education, Second Edition, Eighth
Impression, 2008. [Units I, II, III & IV]
2. Alex Shneyderman & Alessio Casati, Fixed Mobile Convergence, TMH, 2008. [Unit II]

References:

1. Asoke K Talukder & Roopa R Yavagal, Mobile Computing Technology, Applications and
Service Creation, Tata McGraw-Hill, 2005.
2. W.C.Y.Lee, Mobile communication engineering: Theory and Applications, TMH, 1998.
3. Ben Forta, Paul Fonte, Ronan Mandel, Dylan Bromby, WAP development with WML and
WMLScript, Techmedia 2001.

BITDIT601R01 DATA WAREHOUSING AND DATA MINING
L T P CREDITS
3 1 0 4

UNIT-I (15 Periods)
Data Warehouse and OLAP Technology: Data Warehouse - A Multidimensional Data Model -
Data Warehouse Architecture Data Warehouse Implementation - From Data Warehousing to
Data Mining.

Introduction: Data Mining - Data Mining Functionalities; Data preprocessing: Data cleaning:
Missing Values -Data Cleaning as a Process; Data Integration and Transformation; Data
Reduction: Data Cube Aggregation - Attribute Subset Selection -Dimensionality Reduction -
Numerosity Reduction; Data Discretization and Concept Hierarchy Generation: Discretization and
Concept Hierarchy Generation for Numerical Data - Concept Hierarchy Generation for
Categorical Data.

Association Rules: Basic Concepts -Efficient and Scalable Frequent Item set Mining Methods -
Mining Various Kinds of Association Rules
Classification and Prediction: Decision tree induction Attribute Selection Measures - Tree
pruning Scalability and Decision Tree Induction; Bayesian classification: Bayes Theorem - Nave
Bayesian Classification; - Accuracy and Error Measures: Classifier Accuracy Measures -Predictor
Error Measures.

Cluster Analysis: Introduction to cluster analysis and its types-Hierarchical Methods:
Agglomerative and Divisive Hierarchical Clustering -BIRCH: Balanced Iterative Reducing and
Clustering using Hierarchies
Mining the World Wide Web: Mining the Web Page Layout Structure -Mining the Webs Link
Structures to Identify Authoritative Web Pages -Mining Multimedia Data on the Web -Automatic
Classification of Web Documents -Web Usage Mining.

Text Book:

1. Jiawei Han and Micheline Kamber, Data Mining: Concepts and Techniques, Morgan
Kaufmanns Publishers, First Edition, 2006.
References:
1. Margaret H. Dunham, Data Mining Introductory and Advanced Topics, Pearson
Education, First Edition, 2003.
2. Alex Berson, Stephen J Smith, Data Warehousing, Data Mining and OLAP, McGraw Hill
International Edition, 2001.

BITDIT602R01 ROBOTICS

L T P CREDITS
3 1 0 4

UNIT I (15 Periods)
Introduction: Introduction to Robotics Component s of an Industrial Robot Classification,
Drives and Control, Performance, End effectors and Grippers.

Sensor and Vision Systems: Sensor and vision system - Transducers and sensors - Tactile -
Proximity and Range sensors - Acoustic - Capacitance, Inductance sensors, Robot vision system -
Image acquisition, processing and analysis.

Robot Programming and layout: Robot Programming - Methods, lead through, Motion
interpolation. Capabilities and limitations of lead through program. Textual robot languages and
its types - Artificial intelligence in Robot programming LISP programming. Speech / voice
programming. Robot cell design and layout, workcell design and control, Interlocks.

Safety and Application: Safety Robot safety, sensor for safety, training and maintenance.
Application Material transfer, machine loading/unloading, processing operations welding and
painting. Assembly and inspection. Introduction to Social Issues and future applications.

Text Book:

1. Mikel P. Groover, Mitchell Weiss, Roger N.Nagel and Nicholas G.Odrey, Industrial Robotics
Technology Programming and Applications, McGraw Hill International Edition, 1986.

References:

1. Richard D.Klafter,Thomas A.Chmielewski and Michael Negin, Robotic Engineering: An
Integrated Approach, Prentice Hall of India, 2002.
2. Fu, Gonzalez and Lee, Robotics: Control, Sensing, Vision and Intelligence McGraw Hill
International Edition. 1986.
3. John J. Craig, Introduction to Robotics: Mechanics and Control, Addison Wesley
Longman Inc., 1999.
4. James L. Fuller, Robotics Introduction, Programming and Projects, Mc Milan Publishing
Company, 1991.

BITDIT603R01 PARALLEL COMPUTING AND ALGORITHMS
L T P CREDITS
3 1 0 4


Parallel Processing: Parallel processing terminology pipelining, data and control parallelism,
scalability PRAM model of parallel computation - PRAM algorithms Reducing the number of
processors.


Elementary Parallel Algorithms: Reduction, Broadcast, Prefix sums Matrix multiplication
algorithms for processor arrays, Multiprocessors and multicomputers Solving linear systems -
Gaussian elimination


Sorting: Enumeration sort Lower bounds Odd-Even transposition - Bitonic Merge Quick sort
based algorithms
Graph Algorithms: Searching a graph connected components shortest path : single source
all pairs minimum cost spanning tree.


Multi Core Programming: Multi Core architecture System view of threads Concepts of
Parallel Programming - Threading and parallel programming constructs Threading APIs
OpenMP A portable solution for threading

Text Books:

1. Michael J. Quinn Parallel computer theory and practice, McGraw Hill Series, Second
Edition, 1994. [Units I, II &III)
2. Shameem Akhter and Jason Roberts, Multi-Core Programming Increasing Performance
through Software Multi-threading, Intel Press, 2006 [Unit IV]

References:

1. Kai Hwang, Advanced Computer Architecture Parallelism scalability Programmability,
McGraw Hill Series, 1993.
2. Michael J. Quinn, Parallel Programming in C with MPI and OpenMP, McGraw Hill
Series, First Edition, 2003.
3. Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar, Introduction to Parallel
Computing, Pearson Education, Second Edition, 2003.
BITDIT604R01 REAL TIME SYSTEMS

L T P CREDITS
3 1 0 4

UNIT I (15 Periods)
Introduction: Issues in RealTime computing structure of a Realtime system task classes
Characterization of RealTime systems and tasks: Performance measures Estimating Program
Run Times Classical Uniprocessor scheduling Algorithms.

Task Assignment Mode Changes Fault Tolerant Scheduling.
Programming Languages and Tools: Desired language characteristics, Data typing, control
structures, Hierarchical decomposition, packages, RunTime error handling, overloading and
generics Multitasking, task scheduling Timing specification, Runtime support.

Real Time Databases: Basic definitions Real Time vs General Purpose Database Main
memory Databases Transaction Priorities and Aborts Concurrency control Issues, Disk
Scheduling Algorithms, Twophase approach to improve predictability, serialization consistency,
Databases for Hard Real Time systems.
RealTime Communication: Network topologies Protocols

Faulttolerance techniques: Causes of failures Fault types fault detection fault and error
containment Redundancy Data diversity Reversal checks Integrated failure handling
Reliability evaluation techniques
Reliability: Obtaining parameter values Reliability models for hardware redundancy software
error models Taking time into account.

Text Book:
1. C. M. Krishna and K. G. Shin, Real Time Systems, McGraw Hill, 1997.

References:
1. Philip A. Laplante, Real Time system Design and Analysis An Engineers Handbook,
IEEE Press Ltd., Second Edition, 2002.
2. Alan Burns Andly Welling, Real Time systems and their programming languages,
Addison Wesley, Second Edition, 1996.

BITDIT605R01 DISTRIBUTED SYSTEMS
L T P CREDITS
3 1 0 4

Introduction: Goals Hardware concepts Bus based Multiprocessors Switched
multiprocessors Bus Based multi computers Switched multi computers Software
concepts Network OS AND NFS True distributed systems multiprocessor time sharing
systems Design issues.

Communication: Client/server model Addressing Blocking versus non Blocking primitives
Buffered versus unbuffered primitives reliable versus unreliable primitives
Implementation Remote procedure call: Basic RPC Operation Parameter passing Dynamic
binding RPC Semantics in the presence of failures Implementation issues.
Remote object invocation Distributed objects Binding a Client to an object Static versus
dynamic Parameter passing Message oriented communication Stream oriented
communication - Group communication: Introduction design issues ISIS.

Synchronization: Clock synchronization: logical & physical clocks Algorithms Use of
synchronized clocks Mutual exclusion: Centralized algorithm Distributed algorithm
Token ring algorithm Comparison Election algorithms: Bully algorithm Ring algorithm.
Atomic Transactions: Introduction Transaction model Implementation Concurrency
control Deadlock: detection and prevention

Consistency: Introduction Data Centric consistency models Client centric consistency models
Fault tolerance process resilience Distributed commit Recovery Distributed file systems
Sun network file system Coda file system

Text Books:
1. Andrew. S Tanenbaum, Distributed Operating system, Prentice Hall of India, 2006.
[Units I, II & III]
2. Andrew S Tanenbaum & Maarten Van Steen, Distributed systems Principles &
Paradigms, Prentice Hall of India, Second Edition, 2006. [Units II & IV]

References:
1. Andrew. S Tanenbaum, Modern Operating system, Prentice Hall of India, 2000.
2. Pradeep K Sinha, Distributed operating systems Concepts and Design, Prentice Hall of
India, 1998.
BITDIT606R01 NET CENTRIC COMPUTING
L T P CREDITS
3 1 0 4


Overview of Network layers Socket Programming in TCP Socket Programming in UDP
Network Layer - Routing in the Internet - Autonomous System Routing in the Internet: RIP and
OSPF , Inter-Autonomous System Routing: BGP Description about Router -Mobility and the
Network Layer - Mobility Considerations in Network-Layer Design , Mobility Management,
Mobile IP.
Link Layer - Multiple Access Protocols - Channel Partitioning Protocols, Random Access
Protocols, Taking-Turns Protocols - Wireless Links - Wireless LANs: IEEE 802.11b, Bluetooth.

Client server model - BOOTP, DHCP, Introduction to the web Web enabling Technologies -
Web service Protocol - Web Design concepts -Examining good and bad web design - Page Design
Resources.

Multimedia Networking Applications - Streaming Stored Audio and Video - Protocols for Real-
Time Interactive Applications - RTP, RTP Control Protocol (RTCP), SIP, H.323 - Scheduling and
Policing Mechanisms - Scheduling Mechanisms - Policing: The Leaky Bucket - Integrated
Services- Guaranteed Quality of Service, Controlled-Load Network Service Introduction to
RSVP

Grid Computing: The Grid Beginnings of the grid A community grid model building blocks
of the grid Grid application and application middleware grids o the horizon.-The Grid New
Infrastructure for 21
st
Century Science.

Text Books:
1. J.F. Kurose & K.W. Ross, Computer Networking - A top - down approach featuring the
internet, Addison Wesley, 2001. [Units I,II & III]
2. Fran Berman, Geofrey C.Fox, Anthony J.G. Hey, Grid Computing Making the Global
Infrastructure a Reality, Wiley series in Communication networking & distributed
systems, 2002. [Units IV]
References:
1. Behrouz A.Forouzan, Data Communications and Networking, Second Edition, 2002.
2. Deitel and Deitel, Internet and World Wide Web how to program, Prentice Hall, 2000.

BITDIT607 ADVANCED COMPUTER ARCHITECTURE
L T P CREDITS
3 1 0 4

Unit I: 15 periods

Instruction Set Principles - Fundamentals of Superscalar Processor Design
Basics of Instruction Set Principles - Pipeline concepts microarchitecture techniques like register
renaming hardware scheduling, superscalar (multiple issue) and reorder buffer, basics of score-
boarding and Tomasulos algorithm.

Memory organization - Cache Memory - Cache Coherency Protocols - Data Prefetch - Design
of Levels of Caches.

Memory design, cache hierarchy, ABCs of caches, Coherency protocols, MESI protocol with
details, Examples of Power 5 ad Power 6 cache design. Data Prefetch methods hardware and
software initiated prefetch. Introduction to Memory architecture NUMA architecture.

UNIT II: 15 periods

Introduction to Multicore Architecture - homogeneous Vs heterogeneous Multicore design -
SMP Chip Multiprocessing - Multicore Vs Multithreading. Hyper-threading and SMT
(Simultaneous Multithreading).
Multiprocessing, Multithreading and Multicore. Homogenous Vs Heterogeneous, processor
examples heterogeneous basics of cell broadband engine design. Overview of SMT and hyper
threading.

UNIT III: 15 periods

PowerPC architecture: Introduction, PowerPC ISA, Advanced Power architecture Concepts
- Advanced Instruction Set
Cell Broadband Architecture
History of Power Architecture Power architecture Introduction- Power Register Set, Operand
Convention and Addressing Mode, Power Instruction Set Summary, Interrupts/Exceptions, Power
Memory Management, Cache management, Introduction to Floating Point Unit. Advanced power
architecture concepts include Logical Partitioning / Hypervisor, Virtual Partition Memory, Large
Pages and Large Segments, - Vector multimedia Extension (VMX), Vector Scalar Extension
(VSX), Decimal Floating Point Unit, and Embedded specific Instruction Sets.

UNIT IV: 15 periods

Power 5 Multicore architecture microarchitecture case-study, design, Power 6 Architecture /
microarchitecture case-study, PowerPC 405, PowerPC 440, Cell broadband engine
architecture and microarchitecture case-study Cell multicore SDK.

Case study of Power 5 and Power 6 architecture. Multicore - Design examples. Heterogeneous
Multicore example Cell case study details on PPE and SPE and overview of embedded PowerPC
Processors: PowerPC 405 and PowerPC 440.

TEXT BOOKS:
1. Hennessey & Patterson, Computer Architecture A Quantitative Approach,
Harcourt Asia, Morgan Kaufmann, Third edition, 1999.
2. IBM Journals for Power 5, Power 6 and Cell Broadband engine architecture.
3. PowerPC 440 Core Overview and Workbooks.
https://www-01.ibm.com/chips/techlib/techlib.nsf/products/PowerPC_440_Embedded_Core
4. IBM Journals on supercomputer design Blue Gene / L and Road Runner.
5. Power V 2.06 Instruction Set Architecture.
http://www.power.org/resources/downloads/PowerISA_V2.06_PUBLIC.pdf

REFERENCES:

1. Kai Hwang, Advanced Computer Architecture: Parallelism, Scalability and
Programmability McGraw-Hill, 1993.
2. Richard Y. Kain, Advanced Computer Architecture: A System Design Approach, PHI,
1999.
BITDMA607 RESOURCE MANAGEMENT TECHNIQUES
L T P CREDITS
3 1 0 4

UNIT-I: Linear Programming (15 Periods)

Linear Programming-Introduction-Mathematical formulation of LPP-Graphical solution-General
LPP-Canonical form-Standard form-Simplex method-Charnes Penalty method-Duality-Dual
simplex method-Transportation problem-IBFS-NWCR-LCM-VAM-Optimum solution-MODI
algorithm-Assignment problem-Hungarian algorithm.

UNIT-II: Network Analysis (15 Periods)

Network Analysis-Introduction-Activities-Events-Network-Constraints in Network-Construction of
the network-Time calculations in networks-Earliest times-Latest times-Float or slack values
Types of floats-Critical path calculations-Critical path method (CPM)-Project evaluation and
Review technique (PERT) Evaluation of the probability of completing the project within the
scheduled time Shortening the project duration by crashing the activities using direct and indirect
costs.

UNIT-III : Inventory Control (15 Periods)
Inventory Control: Introduction-Definition of costs involved in inventory Stock-Economic Order
Quantity(EOQ) problem-Fundamental problems of EOQ-Problem of EOQ with finite rate of
replenishment-Problem of EOQ with shortage and instantaneous production-Problem of EOQ with
shortage, instantaneous production and fixed time-Inventory control techniques- uncertain demand
Buffer stock-ROL-Stochastic problem with uniform demand(discrete units)-The problem of
purchase-Inventory-Price Breaks

UNIT-IV : Replacement Problems (15 Periods)
Replacement problems-Introduction-Replacement of items-Deteriorate with time-Replacement of
items whose maintenance costs increase with time and the value of money remains the same during
the period-Replacement of items whose maintenance costs increases with time and the value of
money also changes with time- Replacement of items that fail completely-Individual replacement
policy-Problems and solutions.

Text Book:
1. Kanti Swarup, P. K. Gupta and Man Mohan, Operations Research, Sultan Chand & Sons
Publishers, 2006.

References:

1. Hira and Gupta, Problems and solutions in Operations Research, S.Chand Publications,
2001.
2. H.A.Taha, Operations Research, Prentice Hall of India, Seventh Edition, 2003.

BITCIT605R01
SYSTEM SOFTWARE AND COMPUTER GRAPHICS LAB
(Common for CSE & IT)

L T P CREDITS
0 0 3 2

PART I : SYSTEM SOFTWARE
1. Implementation of Text Editor
2. Generation of Symbol Table.
3. Removal of Loop Invariants
4. Simulation of a Loader
5. Lex and Yacc tools Case study with sample programs.
6. i)Lex specification for decimal numbers
ii)Decimal number to Hexadecimal Representation
iii)Uppercase to Lowercase conversion
7. HTML Case conversion
8. Design of Calculator Grammar using Lex and yacc .

PART II : COMPUTER GRAPHICS

9. Bresenhams Line Drawing Algorithm.
10. Circle Generating Algorithm.
11. 2D -Transformation
12. 3D -Transformation.
Additional Exercises:
1. One pass assembler
2. Two pass assembler
3. Implementation of Macroprocessor.
4. Implementing parser.
5. Ellipse generation algorithm.

BITCIT606R01 CASE TOOLS LAB

L T P CREDITS
0 0 3 2

1. CASE Tools Study: Study of Rational Unified Process
2. Generation of the Use Case and Activity Diagrams using Rational Rose
(Payroll and Course Registration System)
3. Generate the Sequence, Collaboration and Class Diagram using Rational
Rose. (Payroll and Course Registration System)
4. a) Project Creation Using Rational Administrator.
b) Manage Your Requirements through Requisite Pro
5. Management tool: Configuration Management and Version Control using Rational Clear
Case.
6. Software Testing: Management of Test Planning using Rational Test Manager
7. Developing Test Script (Classic On Line CD-Store)
8. Software Testing Tool (Rational Robot): Object insertions and adding Alphanumeric
Verification Points.
9. Testing With External Data Source
10. Creating and Using Data Pools
11. Object Scripting
12. Front End Testing: Website Testing Using Rational Site Check

BITCTP607 HR SKILLS - IV

L T P CREDITS
1 0 0 1


1. Employers Expectation-staff lecture 1

2. Selection Process Staff lecture 1

3. Resume Writing Presentation Staff lecture 1

4. Group Discussion 3

5. Mock Interview 4

6. Aptitude Test IV 3


TOTAL 15

SEMESTER VII:

Period of
Instruction
Credits
L T P
BITCIT701 Security in Computing 3 1 0 4
BITCIT702 Broadband Communications 4 1 0 5
BITCIT703 Soft Computing Techniques 3 1 0 4
BITCIT704 Advanced Internet Programming 4 1 0 5
BITCIT705 Advanced Internet Programming lab 0 0 3 2
BITCIT706 Mini Project 0 0 3 2

TOTAL 20 6 6 30


BITDIT701 Wireless Sensor Networks 3 1 0 4
BITDIT702 Satellite Communication 3 1 0 4
BITDIT703 Advanced DBMS 3 1 0 4
BITDIT704 Grid Computing 3 1 0 4
BITDIT705 Artificial Intelligence 3 1 0 4
BITDIT706 Software Testing 3 1 0 4
BITDIT707
Adv. Operating Systems and OS Industry
trends
3 1 0 4

BITCIT701 SECURITY IN COMPUTING
L T P CREDITS
3 1 0 4

FUNDAMENTALS: Security Problem in Computing Elementary Cryptography DES AES
Public Key Encryption Uses of Encryption.
PROGRAM SECURITY: Security Programs Non Malicious Program Errors Virus and Other
Malicious Code Targeted Malicious Code Control against Program Threats.
SECURITY IN OPERATING SYSTEM: Protected Objects and Methods of Protection
Memory and Address Protection Control of Access Generated Objects File Protection
Mechanisms User Authentication Trusted Operating Systems Models of Security Trusted
Operating System Assurance in Trusted Operating Systems.
ADMINISTERING SECURITY AND ETHICAL ISSUES: Security Planning Risk Analysis
Organization Security Policies Physical Security Protection Programs and Data Information
and the Law Software Failures Computer Crime Privacy Ethical Issues.
Text Book :
1. Charles B. Pfleeger and Shari Lawrence Pfleeger, Security in computing, Pearson
Education, Third Edition, 2003.
References :
1. Matt Bishop, Computer Security - Art and Science, Pearson Education, First Edition,
2003.
2. William Stallings, Cryptography and Network Security - Principles and Practices,
Prentice Hall of India, Third Edition, 2003.
3. Atul Kahate, Cryptography and Network Security, Tata McGraw Hill, 2003.
BITCIT702 BROADBAND COMMUNICATIONS
L T P CREDITS
4 1 0 5

UNIT-I (19 Periods)

High-speed solutions: Broad Band Communication-Need, definition and supporting technologies.
FDDI: frame format-protocol architecture-Network topology-configuration- application- DQDB:
feature- concepts- protocols-Working-Gigabit Ethernet-SMDS: Standards- cell structure-
Architecture- protocol-inter carrier Specification
Frame relay: Frame structure- Frame relay Vs Packet switching- Frame relay operators-Bandwidth
on demand-Voice over Frame relay - SONET/SDH -advantages- standard- protocols- basic
SONET overhead capabilities.


ISDN Overview: ISDN Standards-ISDN Interfaces and Functions: Transmission structure- User
Network interface configuration ISDN protocol Architecture- Addressing-ISDN Physical Layer:
Basic User-Network Interface- Primary rate user-Network Interface


ISDN Data Link Layer: LAPD- Terminal adaptation-ISDN Network Layer-Basic call control-
Control of supplementary services. ISDN Services: Service Capabilities- Bearer Services and
Teleservices- Basic and supplementary services. Signaling System Number: SS7Architecture-
signaling data link level-signaling link level- Signaling Network Level.
Broadband ISDN Architecture: B-ISDN Standards- Broadband Services- Requirements
Architecture


ATM Protocols: ATM - Transmission of ATM cells- ATM Adaptation Layer. ATM traffic and
congestion control: Requirements for ATM traffic and congestion control- ATM service
categories- ATM traffic related attributes- Traffic management framework- Traffic Management-
ABR traffic management- Flow Control-Error Detection - Error Control

Text Books:
1. Behrouz Forouzan, Data Communication and Networking, TMH, Fourth Edition, 2004.
[Unit I]
2. William Stallings, ISDN and Broadband ISDN with Frame Relay and ATM Networks,
MacMillan Publishing, Fourth Edition, 1999. [Units II,III & IV]
Reference:
1. Balaji Kumar, Broad Band Communication, TMH, 1994.

BITCIT703 SOFT COMPUTING TECHNIQUES
L T P CREDITS
3 1 0 4

UNIT-I (15 Periods)
Fuzzy Logic: Introduction to fuzzy sets Fuzzy Relations properties - Fuzzy rules and fuzzy
reasoning and inference Standard Forms and Boundaries - Fuzzification and De-fuzzification
methods - Extension Principles Functions of Fuzzy Sets Fuzzy Transform (Mapping) - Practical
Considerations Fuzzy numbers Interval Analysis in Arithmetic Approximate methods of
Extension Vertex Method DSW Algorithm Restricted DSW Algorithm.

ANS and BPN: Network inputs and outputs - feed back inter connections and network
stability - feed forward networks - adaptive networks - supervised and unsupervised learning -
Back Propagation Network Approach Operation Generalized Delta Rule Update of output
Layer weights Updates of hidden layer weights Training data Network sizing Weights and
Learning Parameters BPN Applications Data compression.

BAM and CPN: Associative Memory definitions Hamming Distance Linear Associator
BAM Architecture BAM Processing BAM Mathematics BAM Energy Function Discrete
Hopfield Memory Counter Propagation Network CPN Building Blocks Input Layer Instar
Competitive Networks Outstar CPN data processing

Genetic Algorithm: Introduction to Genetic Algorithms - Mathematical foundations Computer
implementation of GA: data structures reproduction, crossover and mutation a time to
reproduce, a time to cross mapping objective functions to fitness form fitness scaling-crossover
schema theorem codings a multiparameter, mapped, fixed-point coding - discretization
constraints

Text Books:
1. Timothy J. Ross, Fuzzy Logic with Engineering Applications, McGraw Hill Inc., 2002.
[Unit I]
2. James A Freeman, David M Skapura, Neural Networks, Addison Wesley, 1991. [Units II
& III]
3. David E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning,
Addison Wesley, 2001. [Unit IV]
References:

1. Jyh-shing Roger Jang, Chnesy-Tsai sur, Eiji Miziltazi, "Neuro Fuzzy and Soft computing:
A Computational approach to learning and machine intelligence, Pearson Education,
2004.
2. Melanie Mitchell, Introduction to Genetic Algorithms, Prentice Hall of India, New Delhi,
2004.
BITCIT704 ADVANCED INTERNET PROGRAMMING
L T P CREDITS
4 1 0 5

BASIC CONCEPTS OF INTERNET: Internet Protocol Ethernet technology Fiber distributed
Data Interface Synchronous Transfer Mode ARPANET Technology ANSNET Application
Level Interconnection Networks Internet Architecture Interconnection through IP routers
Primary classes of IP addresses and relevant properties Direct mapping.
ADDRESS RESOLUTION PROTOCOL AND SUBNET: ARP refinements and
Implementation Encapsulation and identification ARP protocol format Reverse Address
Resolution Protocol Timing RARP transactions Primary and Backup RARP servers Subnet
and Supernet Extensions Proxy ARP Subnet addressing Flexibility in subnet address
assignment Implementation of subnet Routing in the presence of subnet Subnet Routing
Algorithm A Unified Routing Algorithm Broadcasting to subnets Supernet addressing.
CLIENT SIDE PROGRAMMING: HTML concepts of tags Layout comments Paragraphs
Aligning Line break style tags Address Links Formatting Relative and absolute path
Images Graphical link to Images CGI Introduction to Java script and Perl Web browsers.
SERVER SIDE PROGRAMMING: DHTML Dynamic Content Moving Elements around in
the document Creating Cross-Browser DHTML CSS Style Sheet Reference Block Level
Formatting - Advanced Style Sheet - ASP Introduction Java Server Pages for ASP Developer
Programming for Active Server Pages Servlets Overview Developing Servlets - Java Server
Pages.
Text Book:
1. Comer D. and Stevans D, Internetworking with TCP/IP - Volume 1, Prentice Hall of
India, Third Edition, 1998. [Units I & II]
2. V. K. Jain, Advanced Programming in Web Design, Cyber Tech Publications, First
Edition, 2001. [ Units III & IV]
BITDIT701 WIRELESS SENSOR NETWORKS
L T P CREDITS
3 1 0 4

UNIT - I: LOCALIZATION AND TRACKING (15 Periods)

Introduction -Unique Constraints and Challenges of Sensor Networks, Advantages of Sensor
Networks Sensor Network Applications Collaborative processing - Tracking scenario
Problem formulation Distributed Representation and Interference of states Tracking multiple
objects sensor models Performance comparison and metrics

UNIT - II: NETWORKING SENSORS AND INFRASTRUCTURE (15 Periods)

Medium Access Control Geographic Energy Aware Routing Unicast Geographic Routing,
Routing on a curve, Energy minimizing broadcast, Energy Aware routing - Attribute based Routing
Directed Diffusion, Rumor routing, Geographic Hash tables - Topology Control Clustering
Time Synchronization Localization and Localization services.

UNIT - III: SENSOR TASKING AND DATABASES (15 Periods)

Task driven sensing Roles of Sensor nodes Information based sensor tasking Joint Routing
and Information Aggregation Sensor Database challenges Query Interface High level database
organization Data storage Data indices and Range queries Distributed Hierarchical
Aggregation.

UNIT - IV: SENSOR NETWORK PLATFORM AND TOOLS (15 Periods)

Sensor node Hardware Sensor Network programming challenges Node level software platform
Node level simulators Applications and Future directions.

Text Book:

1. Feng Zhao and Leonidas Guibas, Wireless Sensor Networks - An Information Processing
Approach, Morgan Kaufmann Publishers, An Imprint of Elsevier, Fifth Edition, 2005.

Reference:

1. Holger Karl, Andreas Willing, Protocols and Architectures for Wireless Sensor
Networks, Wiley publications, 2005.

BITDIT702 SATELLITE COMMUNICATION

L T P CREDITS
3 1 0 4

Introduction: Frequency allocation for satellite services - Keplers first law - Orbital perturbations
- Antenna look angles - Polar mount antenna - Limits of visibility - Geostationary orbits-Launching
orbits-Radio wave propagation-Atmospheric losses-Ionospheric effects- Rain attenuation-Other
propagation impairments-Antenna polarization-Polarization of satellite signals-Reciprocity
theorem for antennas-Coordinate system-The radiated fields.


Space Segment: The power supply-Attitude control-Station keeping Thermal control-TT&C
subsystem-Transponders-The antenna subsystem.
Earth Segment: Receive-only home TV system-Master antenna TV system
Space Link: Equivalent Isotropic Radiated Power-Transmission losses-Effects of rain-The Link
Power Budget Equation-The uplink and downlink-Carrier to Noise Ratio


Satellite Access: Single access -Pre assigned FDMA- Demand assigned FDMA - Spade system -
Bandwidth-limited and power-limited TWT amplifier operation-TDMA-on-board signal processing
for FDMA/TDM operation - Satellite-switched TDMA - Code-division multiple access


Satellite Services: Network layers-TCP link -Enhancing TCP Orbital spacing Power rating and
number of transponders Frequencies and polarization Transponder capacity Bit rates for
digital TV MPEG compression standards FEC Home Receiver - Outdoor and Indoor unit
Satellite mobile services VSATs Radarsat GPS satellite

Text Book:

1. Dennis Roddy, Satellite Communication, TMH, Third Edition, 2001.

Reference :

1. T.Pratt & Bostian, Satellite Communication, John Wiley & Sons , Second Edition, 2002.

BITDIT703 ADVANCED DATA BASE MANAGEMENT SYSTEMS

L T P CREDITS
3 1 0 4


Distributed Databases: An Overview: Features of Distributed versus Centralized Database-
Distributed Databases- Distributed Database Management Systems(DDBMSs)
Levels Of Distribution Transparency: Reference Architecture for Distributed Databases-Types
of Data Fragmentation- Distributed Transparency for Read-Only Application- Distributed
Transparency for Update Application- Distributed Database Access Primitives- Integrity
Constraints in Distributed Database.
Distributed Database Design: A framework for Distributed Database Design-The Design of
Database Fragmentation-The allocation of Fragments.


Translation of Global Queries to Fragment Queries: Equivalence Transformation for-Queries
Transforming Global Queries into Fragment Queries- Distributed Grouping and Aggregate
Function Evaluation-Parametric Queries.
Optimization of Access Strategies: A Framework for Query Optimization-Join Queries-General
Queries.
The Management of Distributed Transactions: A Framework for Transaction Management-
Supporting Atomicity of Distributed Transactions-Concurrency Control for Distributed
Transactions Architectural Aspects of Distributed Transactions.


Concurrency Control: Foundations of Distributed Concurrency Control Distributed Deadlocks-
Concurrency Control Based on Timestamps-Optimistic Methods for Distributed Concurrency
Control.
Reliability: Basic Concepts-Nonblocking Commitment Protocols-Reliability and Concurrency
Control-Determining a Consistent View of the Network-Detection and Resolution of
Inconsistency-Checkpoints and Cold Restart.
Distributed Database Administration: Catalog Management in Distributed Databases-
Authorization and Protection.


The ODMG Data Model: The ODMG architecture-An object model for Database systems-
Introduction to the data model-The Object definition language, ODL.
Structural design: Choosing the types-Identifying the Properties-Selecting the Persistent root
Objects Choosing Keys.
Behavioral Design: Application structure and transactions-Operations-Exceptions.

Text Books:

1. Stefano Ceri & Giuseppe Pelagatti, Distributed Databases Principles & Systems,
McGraw-Hill, 1985. [Units I, II & III]
2. Richard Cooper, Object Database an ODMG Approach, 1997. [Unit IV]

Reference:

1. Patrick ONell and Elizabeth ONell, Database Principles, Programming, and
Performance, Morgan Kaufmann, Harcourt India, Second

Edition, 2001.
BITDIT704 GRID COMPUTING
L T P CREDITS
3 1 0 4

Grid Computing: Introduction: Overview Grid applications Grid Infrastructure - Grid
Computing Organizations and their roles: organizations developing grid standards and best practice
Guidelines organizations developing grid computing Toolkits and Framework organizations
Building and using grid-based solution to solve Computing - Grid Computing anatomy Grid
Computing road map.


Grid Computing Applications: Merging the Grid services Architecture with the Web services
Architecture: services Oriented Architecture - Web services Architecture XML - Service
message description mechanisms Relationship between web service and Grid Service web
Service Interoperability - OGSA Introduction Goals CDC NFS Online Media and
Entertainment.

Technologies: OGSA platform components OGSA Hosting Environment Core Networking
Services Transport and Security OGSA Infrastructure OGSI -OGSA Basic Services.

Grid Computing Tool Kits: Globus GT 3 Toolkit Architecture GT3 Software architecture
Model - GT3 Tool Kit Service Programming model, GT3 Tool Kit High level services.

Text Book

1. Joshy Joseph & Craig Fellenstein, Grid Computing, Pearson Education Pvt. Ltd., 2004.

Reference:

1. Ahmar Abbas, Grid Computing: A Practical Guide to technology and Applications,
Charles River media, 2003.
BITDIT705 ARTIFICIAL INTELLIGENCE
L T P CREDITS
3 1 0 4

Introduction Introduction to AI - The History of Artificial Intelligence - The State of the Art -
Intelligent Agents - Agents and Environments - The Structure of Agents
Problem Solving - Problem-Solving Agents - Uninformed Search Strategies - Breadth-first search
- Depth-first search - Depth-limited search - Iterative deepening depth-first search Bi-directional
search Comparing uninformed search strategies

Informed Search and Exploration - Heuristic Search Strategies - Greedy best-first search - A*
search - Memory-bounded heuristic search - Heuristic Functions - Local Search Algorithms and
Optimization Problems - Hill-climbing search - Simulated annealing search - Constraint
Satisfaction Problems - Backtracking Search for Constraint Satisfaction Problems Adversarial
Search - Optimal Decisions in Games - Optimal strategies - The mini-max algorithm - Alpha-Beta
Pruning

Knowledge and reasoning - Logical Agents - Knowledge-Based Agents - Logic - Propositional
Logic - Reasoning Patterns in Propositional Logic Resolution - Forward and backward chaining -
Effective propositional inference - A complete backtracking algorithm - Local-search algorithms -
First-Order Logic - Syntax and Semantics of First-Order Logic - Inference in First-Order Logic -
Propositional vs. First-Order Inference - Unification and Lifting - Forward Chaining - Backward
Chaining - Resolution

Planning and Learning - Planning with State-Space Search - Forward state-space search -
Backward state-space search - Heuristics for state-space search - Uncertain knowledge and
reasoning - Uncertainty - Acting under Uncertainty - Basic Probability Notation - The Axioms of
Probability - Inference Using Full Joint Distributions - Bayes' Rule and Its Use - Learning -
Learning from Observations - Forms of Learning

Text Book:
1. Stuart Russel and Peter Norvig, Artificial Intelligence-A Modern Approach, Prentice Hall
International, Second Edition, 2008.
References:
1. George F.Luger, Artificial Intelligence Structures and Strategies for Complex Problem
Solving, Pearson Education, Fourth Edition, 2004.
Elain Rich and Kevin Knight, Artificial Intelligence, Tata McGraw Hill, Second Edition, 1993.
BITDIT706 SOFTWARE TESTING
L T P CREDITS
3 1 0 4

UNIT I (15 Periods)
Introduction : Purpose of Testing-Some dichotomies- model for testing- consequences of bugs-
taxonomy for bugs- flow graph for path testing-Path testing basics- predicates, path predicates and
achievable paths- path sensitizing- path instrumentation-implementation and application of path
testing- testability tips.


Transaction Flow, Data Flow And Domain Testing : Transaction flows- testing techniques-
implementation; data flow testing basics- strategy, applications, tools and effectiveness; domain
testing- domains and paths- nice domains and ugly domains- domain testing- domains and interface
testing- domains and testability

Syntax And Logic Based Testing - Syntax testing- A grammar for format- Test Case generation-
Implementation and Application- Motivational Overview of logic based testing- decision table-
path expressions- KV Charts- Specifications

Testing Specialised Systems And Test Documentation Testing Client server systems, Testing
rapid application development- test web based systems- testing security- testing a data warehouse-
building test documentation

Text Books:

1. Boris Beizer, Software Testing Techniques, Dream Tech Press, 2003.
[Units I, II & III]
2. William E Perry, Effective Methods for Software Testing, John Wiley & Sons, Second
Edition, 2000. [Unit IV]

Reference:

1. Srinivasan Desikan, Gopalaswamy Ramesh, Software Testing Principles and Practice,
Pearson Education, First Edition, 2006.

BCSDCS707 / BITDIT707 / BICDIC707
Advanced Operating Systems & OS Industry Trends
(Prerequisite: Operating System Internals)
L T P Credits
3 1 0 4

Unit I: Kernel Overview, Process Management (15 periods)

The Process and the Kernel: Process abstraction Execute in Kernel Mode Synchronization
Process Scheduling Signals New Processes and Programs.
Threads and Lightweight Processes: Introduction fundamental abstractions User Level
Thread Libraries.
Users Threads in AIX: Understanding Threads and Process Thread safe and Threaded libraries
in AIX Creating Threads Terminating Threads Using Mutex Joining Threads Scheduling
Threads Thread specific data Signal management Writing Reentrant Code Developing
Multithreaded Programs Benefits of Threads.
Process Scheduling: Introduction Clock interrupt handling Scheduler Goals Traditional
UNIX scheduling Processor affinity on AIX.

Unit II: IPC, File systems & Memory management (15 periods)

Inter Process Communication: Universal IPC facilities - System V IPC - Messages Ports -
Message Passing.
File systems: The User Interface to Files File Systems Special Files File System Framework
The Vnode / VFS Architecture Implementation Overview Network File System.
File systems in AIX: JFS/JF2 File system Layout Mounting File system Managing File
system.
Virtual memory: Introduction Demand Paging Hardware requirement IBM RS/6000, Intel
80X806 AIX Program Address space Overview.

Unit III: Operating System Virtualization, RAS (Reliability, Availability &
Serviceability) Security: (15 periods)

Virtualization Basics: Introduction to system virtualization - Virtualization Benefits.
Virtual machines (Logical partitions): Virtual Machine/Partition - Physical partition - Logical
Partition - Partition Characteristics - Partition resources - Dynamic Partitioning - Processor
concepts - Micro Partitioning - Dedicated donating processors - Multiple shared processor pool -
Virtual I/O: Virtual Ethernet, Virtual Storage, Introduction to Virtual I/O Server - Live partition
mobility - Capacity on Demand

Workload Partitions WPAR (Software Partitions): What is a WPAR (Software partition) - Types
of WPARs Application & System WPARs - When to use Workload partitions - General
consideration File system & Networking - WPAR mobility LPAR & PAR Comparison
Operating system RAS (Reliability, Accessibility and Serviceability): 24*7 Availability - RAS
Overview - Disaster Recovery & High Availability - Reliability - Availability - Serviceability
Operating System Security: Base OS Security - Securing the network - Internet Protocol security
- Security in Enterprise

Unit IV: Operating System Industry trends & Case Study (15 periods)

Software Consumption Models:
Software as a Service (SaaS): Definition - Benefits - Usage Scenario Architecture Cloud
Computing: About cloud Definition Benefits - Usage Scenarios Architecture - Cloud
Provisioning and Management
Architecture: Introduction to Service-Oriented Architecture - Coupling and decoupling of aspects
of service interactions - Designing connectionless services - Service granularity and choreography -
Implications of service-oriented architecture.

Introduction to Power and Energy Management
Introduction to High Availability: High availability - Cluster multi-processing - Availability
solutions - History and evolution - High availability terminology and concepts - High availability
versus fault tolerance - Software planning.

References:

UNIT I:
1.Uresh Vahalia, Unix Internals The New Frontiers, Pearson Education, 2004
2.User Threads and process in AIX
http://publib.boulder.ibm.com/infocenter/aix/v6r1/index.jsp?topic=/com.ibm.aix.genprogc/doc/gen
progc/understanding_threads.htm
3.Processor affinity on AIX:
http://www.ibm.com/developerworks/aix/library/au-processinfinity.html

UNIT II:
1.Uresh Vahalia, Unix Internals The New Frontiers, Person Education, 2004
2.JFS/JF2 Filesystem Layout
progc/fsyslayout.htm
progc/fsyslayout2.htm
3.Mounting Filesystem
http://publib.boulder.ibm.com/infocenter/aix/v6r1/index.jsp?topic=/com.ibm.aix.baseadmn/doc/bas
eadmndita/mounting.htm
4.Managing Filesystem
http://publib.boulder.ibm.com/infocenter/aix/v6r1/index.jsp?topic=/com.ibm.aix.baseadmn/doc/bas
eadmndita/filesysmgmttasks.htm
5.AIX Program Address space Overview
progc/address_space.htm

Unit III:
1.Virtualization:
http://www-03.ibm.com/systems/power/software/virtualization/index.html
http://en.wikipedia.org/wiki/Hardware_virtualization
2.Virtual machines:
System_p_LPAR_Virtualization.pdf (To be provided by IBM)
Additional references:
http://www.redbooks.ibm.com/redbooks/pdfs/sg247940.pdf
http://www.ibm.com/developerworks/wikis/display/WikiPtype/AIX+and+Virtualization+Links
3.Workload Partitions:
4.Operating system RAS:
http://www.redbooks.ibm.com/abstracts/sg247196.html?Open
http://www.redbooks.ibm.com/redpapers/pdfs/redp4367.pdf
5.Operating System Security:
http://publib.boulder.ibm.com/infocenter/pseries/v5r3/topic/com.ibm.aix.security/doc/security/secu
rity-kickoff.htm
6.Security in Enterprise:

Unit IV:
1.Saas:
http://www.whatissaas.net,http://www-304.ibm.com/isv/marketing/saas/index.html
2.Cloud Computing:
http://download.boulder.ibm.com/ibmdl/pub/software/dw/wes/hipods/Cloud_computing_wp_final_
8Oct.pdf
3.SOA: http://www.redbooks.ibm.com/redbooks/pdfs/sg246346.pdf
4.Power and energy management:
http://www-03.ibm.com/systems/power/software/energy/index.html
5.High Availability:

Lab Activities/ Case Studies:
Case studies can be distributed across each units or it can be taken up during the end of the course

Unit1: Write C programs using pthreads, IPCs, Basic OS utilities like fork, exec, etc. and Signal
handlers.

Unit2: Create JFS/JFS2 file systems using smitty and command line on AIX OS, Study memory
allocation and data flow path behavior using netstat command.

Unit3: Create Lpar, DLPAR, Shared processor pool, SPLPAR using HMC. Create System WPAR
and Application WPAR

BITCIT705 ADVANCED INTERNET PROGRAMMING LAB

L T P CREDITS
0 0 3 2

1. Interfaces in Java
2. Packages in Java.
3. Programs to create multiple threads in JAVA.
4. Developing a simple applet using AWT Controls
5. Developing an applet for demonstrating the font features Using Swings
6. Designing a web site using HTML-DHTML and Client side scripting
7. Write a JSP Program for Order Processing
8. Write a ASP Program using the Components

9. Create a program in ASP to access the Database via ADO Component.
10. Create an online application which bills the items using session Bean in J2EE.
11. Check the authentication for the module using Entity Bean and deliver the proper
message.
12. Create a program in EJB to maintain the session for the user using Session Bean.

SEMESTER VIII:

Period of
Instruction
Credits
L T P
BITCIT801 Project Work 0 0 18 9
BITOIT801 E-Commerce 3 0 0 3
BITOIT802 Software Project Management 3 0 0 3
BITOIT803 Web Technology 3 0 0 3
BITOIT804 Management Information Systems 3 0 0 3
TOTAL 12 0 18 21

BITOIT801 E-COMMERCE

L T P C
3 0 0 3

UNIT I: Fundamentals of E-Commerce and Network Infrastructure (11 Periods)

Introduction to Electronic Commerce EC Framework, EC and Media Convergence, Autonomy
of EC applications, EC Consumer applications, EC Organization Applications.
Network Infrastructure for EC Market Forces influencing the I-way, Components of the I-way,
Network Access Equipment, Global Information Distribution Networks, Public Policy issues
shaping the I-way.

UNIT II: WWW and Consumer-Oriented Electronic Commerce (11 Periods)

Electronic Commerce and WWW Architectural framework for E-commerce, WWW as
Architecture, Web Background, Security and the WEB.
Consumer Oriented Electronic Commerce - Consumer oriented applications- Personal Finance
and Home Banking Management, Basic Services, Intermediate services, Advanced services,
Home Shopping, Mercantile Process Models, Mercantile Models from Consumers Perspective
and Merchants Perspective.

UNIT III: Electronic Payment Systems (11 Periods)

Types of Electronic Payment Systems, Digital Token Based Electronic Payment Systems, Smart
Cards and Electronic Payments, Credit Card Based Electronic Payment Systems, Risk and
Electronic Payment Systems, Designing Electronic Payment Systems.

UNIT IV : Network Security and Firewalls (12 Periods)

Client-Server Network Security, Emerging Client-Server Security Threats, Firewalls and
Network Security, Data and Message Security, Challenge Response Systems, Encrypted
Documents and Electronic mail.

Text Book:
1. Kalakota, R. and, Whinston A.B., Frontiers of E-Commerce, Pearson Education, 2002.

References:

1. Efraim Turban, Jae Lee, David King Michael, Electronic Commerce - A Managerial
Perspective, Pearson Education, 2001.
2. Trepper, E-commerce Strategies, Prentice Hall of India, 1998.
3. Pete Loshin, Paul A. Murphy, Electronic Commerce, Addison Wesley, Second Edition,
1997.
BITOIT802 SOFTWARE PROJECT MANAGEMENT

L T P C
3 0 0 3

UNIT-I (11 Periods)

Conventional Software Management: The waterfall Model Conventional Software
Management. Performance: Evaluation of Software Economics: Software Economics
Pragmatic Software cost estimation. Improving Software Economics: reduced Software - Product
Size Improving Software Process Improving Team Effectiveness Improving Automation
through Software Environments Achieving Required Quantity peer inspections.


The old way and the new: Principles of Conventional Software Engineering Principles of
modern Software Management transition to an iterative process.


Life Cycle Phases: Engineering and production stage inception phase Elaboration phase
construction phase Transition Phase. Artifacts of the process: The artifact sets Management
Artifacts Engineering artifacts Pragmatic artifacts. Model Based software architectures:
Architecture: A Management perspective Technical Perspective.


Software Management Disciplines: Iterative Process planning - work Breakdown structure
planning Guidelines The cost and schedule Estimating process Iteration planning process
pragmatic planning. Tailoring the process: process Determinants examples of small scale
projects versus large scale project.

Text Book:

1. Walker Royce, Software Project Management: A Unified Framework, Addison Wesley,
1998.

Reference :

1. Boehm & Barry.W , Software Engineering Economics, Prentice Hall of India, 1981.
BITOIT803 WEB TECHNOLOGY

L T P C
3 0 0 3

UNIT I (11 Periods)

Introduction: Internet Principles Basic Web Concepts Client/Server model Retrieving data
from Internet HTML and Scripting Languages Standard Generalized Mark-up Language
Next Generation Internet Protocols and applications.
Socket & Common Gateway Interface Programming: HTML forms CGI Concepts
HTML tags Emulation Server-Browser communication E-mail generation Authorization
and security.
Socket Programming: Streaming Networking principles sockets -multicasting Remote
Method Invocation activation Serialization - Marshal streams.
Server Side Programming: Dynamic web content cascading style sheets DHTML XML -
Server side includes - communication Java Server Pages.
Online applications: Simple applications On-line databases monitoring user events plug-
ins database connectivity Internet Information Systems - EDI application in business
Internet commerce Customization of Internet commerce

Text Books :

1. Eric Ladd, Jim O Donnel, Using HTML 4, XML and Java, Prentice Hall of India, 1999.
2. Jeffy Dwight, Michael Erwin and Robert Niles, Using CGI, Prentice Hall of India,
1999.
3. Scot Johnson, Keith Ballinger, Davis Chapman, Using Active Server Pages, Prentice
Hall of India, 1999.
BITOIT804 MANAGEMENT INFORMATION SYSTEMS

L T P C
3 0 0 3

UNIT I: Introduction (11 Periods)

Technology of Information Systems Concepts Definition - Effect of MIS - Role
and importance of management Way to approach Management - Functions of the
manager - Management as a control system - Database Management Systems -
Concepts - Data Models - Database Design - MIS & Client Server Architecture.
Process of management - Planning
Organization Staffing - Co-
and Organization structure - Organizational
Behavior.

UNIT II: Decision support systems

(11 Periods)

Decision making in business-decision making process - structured and
unstructured problems- DSS components-types of decision support systems-
sensitivity analysis- executing information systems - Human as an information
Processor - Handling System Complexity - Post implementation problems in Systems.

UNIT III: System Analysis and Design (11 Periods)

System analysis and design Need for system Analysis - System Analysis of
existing System - New Requirement - System Development Model - Structured
Systems Analysis and Design - Computer System Design - Development of MIS -
Development of long Range plans of the MIS - Ascertaining the class of
information - Determining the Information Requirement - Development and
implementation of MIS - Management of Quality - MIS Factors of success and
failure.

UNIT IV: Current Trends (12 Periods)

Knowledge management Networks Internet and Web based Information System
Electronic Commerce Electronic Business Commercial applications Case
Studies.

Text Book
1. W.S.Jawadekar, Management Information Systems, Tata McGraw Hill,
1997.
Reference
1. Kenneth C Landon and Jane P. Laudon, Management Informat ion
Syst ems, Prentice Hall of India, Sixth Edition, 2000.
2. James A OBrien, Management Information System, Tata McGraw Hill,
1999.

IT Syllabus

Cargado por

Información del documento

Derechos de autor

Formatos disponibles

Compartir este documento

Compartir o incrustar documentos

Opciones para compartir

¿Le pareció útil este documento?

¿Este contenido es inapropiado?

Copyright:

Formatos disponibles

IT Syllabus

Cargado por

Copyright:

Formatos disponibles

SCHOOL OF COMPUTING - B.Tech.

También podría gustarte