SpecializationIT 3.1 APPLIED MATHEMATICS - III
IT 3.2 Integrated Electronics
IT 3.3 Logic Design
IT 3.4 Data Structures and ALGORITHMS
IT 4.1 Numerical methods
IT 4.2 Computer Organization and Architecture
IT 4.3 MICROPROCESSOR AND INTERFACING
IT 4.4 object Oriented programming using c++
IT 4.5 Signals and Systems
IT 4.6 Electronic instrumentation
Semester V
IT 5.1 INTRODUCTION TO DATA COMMUNICATION
IT 5.2 OBJECT ORIENTED SOFTWARE ENGINEERING
IT 5.3 OPERATING SYSTEMS
IT 5.4 DATABASE MANAGEMENT SYSTEMS
IT 5.5 DIGITAL SIGNAL PROCESSING
IT 5.6 COMPUTER GRAPHICS
Semester VI
IT 6.1 PRINCIPLES OF ECONOMICS AND MANAGEMENT
IT 6.2 MANAGEMENT INFORMATION SYSTEMS
IT 6.3 COMPUTER NETWORKS
IT 6.4 WEB TECHNOLOGIES
IT 6.5 principles of compilers
IT 6.6 INTELLIGENT AGENTS
Semester VII
IT 7.1 IMAGE PROCESSING, ANALYSIS & COMPUTER VISION
IT 7.2 DISTRIBUTED OPERATING SYSTEMS
IT 7.3 CRYPTOGRAPHY AND NETWORK SECURITY
Elective I
IT 7.4 A DATA MINING AND WAREHOUSES
IT 7.4 B ELECTRONIC COMMERCE
IT 7.4 C NEURAL NETWORKS AND FUZZY LOGIC
IT 7.4 D EMBEDDED SYSTEMS DESIGN
Elective II
IT 7.5 A OPERATIONS RESEARCH
IT 7.5 B DIGITAL SIMULATION & MODELLING
IT 7.5 C LOGIC PROGRAMMING & FUNCTIONAL LANGUAGES
IT 7.5 D VLSI DESIGN & TECHNOLOGY
Semester VIII
IT 8.1 MOBILE COMMUNICATION
Elective III
IT 8.2 A DISTRIBUTED DATABASE MANAGEMENT SYSTEMS
IT 8.2 B WEB SERVICES
IT 8.2 C ADVANCED COMPUTER ARCHITECTURES
IT 8.2 D GENETIC ALGORITHMS
Elective IV
IT 8.3 A NATURAL LANGUAGE PROCESSING
IT 8.3 B MULTIMEDIA AND VIRTUAL REALITY
IT 8.3 C SOFTWARE TOOLS FOR CAD/CAM
IT 8.3 D ROBOTICS
IT 3.1 APPLIED MATHEMATICS - III
Linear Algebra: Types of Matrices, Determinants, Adjoint inverse of Matrices, Elementary transformation, rank using elementary transformation, Canonical and normal form, system of equations AX = B and AX = 0, linearly independent systems, linear transformation.
Eigen values, Eigen vectors, properties, similar Matrices, Coyley Hamilton theorem, Applications, Minimal polynomial, Diagonalization, function of Matrices.
Probability: Sample space, Events, Axioms, union and intersection, Compliment of events, conditional probability Bay’s rule.
Random variables: Discrete and continuous distribution, density function, Marginal and conditional distribution, Stochastic independence.
Discrete probability distribution: Bernoulli, Binomial, Poisson and Hypergeometric. Continuous probability distribution: Uniform, exponential, normal and Beta.
Expectation: Expectation of function, conditional expectation, Varience, moment generating function .
Transforms: Laplace Transforms, Fourier Transforms, Z-Transforms, Inverse, convolution, properties, Applications.
1. Higher Engineering Mathematics by B.S. Grewal, Khanna Publications
2. Probability and Statistics in engineering and Management Science by William W. Hines, John Wiley and Sons Publications
1. A First Course in Probability by Ross. S, Collian Mac Millan, NewYork.
2. Fundamentals of Mathematical Statistics by S.C. and V.K. Kapoor, S. Chand Publications.
3. Advanced Engineering Mathematics by Kreyazig.
4. A Text Book of Matrices by Shanti Narayan, S. Chand and Company
5. Theory and Problems in Matrices, Schaum outline series.
6. Engineering Mathematics, Vol. I & II, S.Chand and Company.
7. Theory & Problems of Probability and statistics by Murray R. Spiegel, Schaums outline series.
8. Introduction to Probability and Statistics by Seymour Lipschutz, Schaums outline series.
Differential Amplifiers: Dual input balanced o/p, unbalanced output , single – input unbalanced o/p, level translator
Operational Amplifiers: Characteristics, features, basics circuits and applications, Waveform generators, Analysis of the waveforms with SPICE.
Voltage Regulators; Definition, Design and applications using IC 723, LH 105 regulated power supply, 555 timer and its configurations.
Specialized IC Applications: 555 timer, Astable, Monostable Multivibrator, phaselocked loop. 565 PLL application
Digital Logic Families: Characteristics of Digital ICs, RTL, DTL, TTL, Schottky TTL, ECL and CMOS logic, Interfacing CMOS and TTL.
D/A and A/D converters: Types and specifications. Simulation of circuits with SPICE.
Clocking Strategies: Clocked systems, system timing setup and hold time. Metastability & synchronization failures, recommended clocking approaches.
Semiconductor memories: Memory classification, architecture and building blocks, ROM and RAM.
Memory peripheral circuitry: Address decoder, drivers buffer, Design of PLA and SRAM.
1. OPAmps and Linear Integrated Circuits by Ramakant A. Gayakwad, PHI
2. Modern Digital Electronics by R.P. Jain, TMH
3. SPICE by Gorden W. Roberts & Adel s. Sedra, Oxford University Press
1. Principles of CMOS VLSI Design by Neil H.E. Weste & Kamaran Eshraghian, Addison Wesley
2. Digital Integrated Electronics by Herbert Taub & Donald Schilling, TMH
3. Microelectronics by Jacob Millman & Arvin Grabel, McGraw Hill
4. SPICE for Circuits and Electronics using Pspice by Muhamad H. Rashid, PHI
Number system and binary codes, Error detection and correction codes, Logic gates, Boolean algebra, De Morgan’s law, Boolean Algebra, algebraic simplification, Universal gates.
Algebraic simplification by Karnough’s map method, Q.M. Method.
ALU: Binary addition & subtraction, Adders, subtractors and comparators, encoders, decoders, Multiplexers and Demultiplexers
Flip flops: RS, D, JK, T flip flops, Edge and level triggering of flipflops, Master-slave flipflops,
Registers and Counters: Shift & controlled shift registers, Ripple, synchronous and ring counters.
Finite State Machine: States, State diagram, State table, Modelling of Digital circuits with VHDL.
VHDL: Introduction, Behavioral Modelling, Structural modeling, simulation & synthesis of Digital circuits.
1. Digital Logic and Computer Design by Morris Mano, PHI.
2. Digital Design: Principles and Practices by John Wakerly, TMH
1. Modern Digital Electronics by R.P. Jain, TMH
2. An Engineering Approach to Digital Design by William I. Fletcher, PHI
3. Digital Principles and applications by Malvino and Leach, TMH
4. Switching and Finite Automata Theory by Kohavi, TMH
IT 3.4 Data Structures and ALGORIThms
MODULE 1
Introduction to Data representation and Data Structures
Introduction to design and analysis of algorithms: Complexity analysis, concept of asymptotic notations
Linear Data Structures: Representation of arrays and their applications stacks, representation of stacks and its applications, Recursion, Queues, representation of queues and its applications, circular queues, priority queues.
Lists: Singly linked list, doubly linked list, circular linked list, linked stacks and queues, examples and simulation.
Non-linear Data Structures:
Trees: Basic terminology, binary trees and their representations, traversals of trees, applications of trees – infix/postfix representation if expressions and inter-conversion, etc.
Sorting: Basic concept, Selection sort and Tree sorting, Exchange sort, Merge sort, Radix sort, Insertion sort, Heaps and Heap sort.
Searching: Basic searching techniques, sequential and binary search, tree searching
Hashing: Hash function, collision handling mechanisms
Complexity analysis of searching and sorting algorithms.
Graphs: Basic terminology, representation of graphs, directed and undirected graphs and their traversals, depth first and breadth first search, spanning trees
Applications of graphs: shortest path problem, topological sorting, matching.
1. Data Structures and Algorithms by Alfred V. Aho, John E. Hopcroft & J. D. Ullman, Addison Wesley
2. Data Structures using C & C++ by Yedidyah Langson, Moshej Augenstein, Aaron M. Tenenbaum, Prentice Hall of India
3. Data Structures and Program Design in C by Robert L. Kruse, PHI
1. Data Structures, Algorithms and Applications in C++ by Sahni, MGH
2. Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni, Galgotia Publications
3. An introduction to data structures with applications by Jean Paul Tremblay and Paul G. Sorenson – Tata McGrawHill
4. Fundamentals of Computer Algorithms by Ellis Horowitz and Sartaj Sahni – Galgotia Publications
IT 3.5 Introduction to Electronic Communication
Introduction to Communication Systems, modulation, amplitude modulation theory, SSB, mathematical representation of FM, Phase modulation, Comparison of modulations with respect to Noise & bandwidth.
Pulse – modulation systems: Sampling Theorem, Pulse amplitude modulation, Quantization of signals, pulse – code modulation, The PCM systems, DPCM, delta modulation, PSK, FSK, QPSK, M-aryPSK, M-ary FSK.
Introduction to telephone communication, basics of switching system. Principles of common control, Touch-tone Dial telephone, centralized SPC and distributed SPC.
Radio – wave propagation: Introduction, Propagation in free space, Tropospheric, Ionospheric & surface wave propagation and practical importance.
Information & coding: Amount of information, Entropy, information rate, coding to increase average information, Shannon’s theorem, Bandwidth.
Codes: Error detection codes & correcting codes, convolution codes, Facsimile Transmitter and receiver, Digital fax transmission, TV transmitting and receiving systems, brief explanation of HDTV.
1. Electronic Communications by Dennis Roddy & John Coolen, PHI
2. Principles of Communication Systems by Taub – Schilling, TMH
Telecommunication Switching Systems and Networks by Thiagarajan Viswanathan, PHI
1. Electronic Communication Systems by George Kennedy, TMH
2. Modern Digital and Analog communication systems by B.P. Lathi, Oxford University Press
IT 3.6 DISCRETE MATHEMATICAL STRUCTUREs
Relation, Functions , Equivalence relations, Partially ordered sets, Induction, Recurrence relations, Counting , Permutations, Combinations, Pigeon Hole Principle, Principle of Inclusion and Exclusion
Propositional calculus, Boolean algebra.
Algebraic structures: Monoids, groups, subgroups, cyclic groups Abelian group, isomorphism, Homomorphism.
Rings: Definition, Integral domain, Fields, Ideals, Principal ideals, maximal ideals, Prime ideals, Euclidean ring (domain)
Vectorspaces: Definition, properties, subspaces, Linear combination, Linear span, Linear independence, Basis, finite dimensional vector space.
Graph theory: Introduction to graphs, representing graphs and graph isomorphism, connectivity, Euler and Hamilton paths, shortest path problems, planar graphs, graph coloring
Introduction to languages and finite state machines: Regular expressions, Regular languages, Finite state automata, Grammars and finite state machines.
1. Elements of Discrete Mathematics by C.L. Liu, TMH
2. Discrete Mathematics and its applications by Kenneth H. Rosen, TMH
1. Discrete Mathematics by Seymour Lipschutz, Schaum outline series, TMH
2. Discrete Mathematical structures with applications to Computer Science, Trembley and Manohar, TMH.
3. Discrete Mathematical structures by Kolman, Busby & Ross, PHI.
4. Graph theory with application to Engineering and Computer Science by Narsingh Deo, PHI
Errors & approximation: Introduction to Numerical Methods, sources of errors in numerical methods, Truncation, round off, absolute and relative errors.
Solution of Non-Linear and Transdental equations: Bisection, Regula Falsi, Secant & Newton Raphson Methods.
Solution of Linear equations: Gauss elimination and pivoting, LU decomposition, Gauss Jordan.
Iterative methods for system of linear and nonlinear equations: Jacobi’s and Gauss Seidel method.
Interpolation: Newton’s Formulae (Forward, Backward and Divided differences), Lagrange’s interpolation formula, Spline interpolation, Sterling’s and Bessel’s central difference formulae.
Numerical Integration and differentiation: Trapezoidal rule, Simpsons rules, Romberg method, Numerical differentiation.
Numerical Solution of Ordinary Differential equations: Picard’s method, Euler’s methods, Runge-Kutta methods and Predictor Corrector methods.
Testing of Hypothesis: Type I and Type II errors; Large sample theory - Tests involving normal distribution; Small sample theory - Student’s T distribution, F distribution and tests involving these distributions; Chi – square distribution - testing for goodness of fit and test for independence using chi – square distribution
Correlation and Regression: Regression lines, linear correlation coefficients and its properties.
1. Numerical Methods by E. Balaguruswamy, Tata Mc Graw Hill.
2. Numerical Algorithms by E.V. Krishnamurthy and Sen, PHI
3. Theory & Probability and Statistics by Murray R. Spiegal, Schaum Outline Series, McGraw Hill (IE).
1. Introductory Methods of Numerical Analysis by S. S. Shastry, PHI
2. Computer Oriented Numerical Techniques by Rajaraman, PHI
3. Numerical Methods in Engineering and Science by B.S. Grewal, Khanna Publications
4. Introduction to Mathematical Statistics by Hoss R. Vetat, American Publishing, New York
5. Applied Numerical Methods for Engineers by Te J. Akai, John Wiley and Sons
IT 4.2 Computer Organization and Architecture
CPU: ALU, Computer arithmetic, Instruction set, characteristics and functions, instructions addressing modes and formats, CPU structures and functions, Control unit, hardwired microprocessors.
Memory: Internal memory, cache memory, different types of memory, semiconductor memories, magnetic disk, optical memories, magnetic tape, memory organization, memory interleaving, memory hierarchy.
Input / Output: External devices, I/O module, programmed I/O, interrupt driven I/O, DMA, I/O channels and processors.
Computer system organization, Buses, RISC architecture, CISC architecture, scalable architectures
1. Computer Organization and Architecture: Designing for Performance by William Stallings, Fourth Edition, Prentice Hall of India
1. Computer System Architecture by M. Morris Mano, Prentice Hall of India
2. Structured Computer Organization by Andrew S. Tenenbaum, Prentice Hall of India
3. Computer Organization by V.C Hamachar, L.G Vianesic, S.G. Zaky, Tata McGraw Hill
4. Computer Architecture and Organization by J. P. Hayes, Tata McGraw Hill
IT 4.3 MICROPROCESSOR AND INTERFACING
Microprocessor 8086: Pin diagram, Instruction cycle, Architecture, Instruction Set, Assembly Language programming, etc. 8086 Basic configuration in maximum mode.
8087 Coprocessor: Architecture, connection and cooperation with main processor, Instruction Set of 8087, Programming with the Arithmetic Coprocessor.
Interfacing: Programmable Peripheral Interface(PPI): Basic Description of 8255, Architecture, Modes of operation, programming the 8255.
Programmable timer 8253/8254, Brief introduction to DMA controller, interrupt controller and keyboard, Video controller.
System Design of 8086 using Memory chips and simple I/O devices using interfaces.
Microprocessor 80286 and 80386: Brief features architecture, Memory management system, Task switching protection etc. in 80286.
Review processors from 80486 onwards.
1. MICROPROCESSORS AND INTERFACING: Programming and Hardware, - By Douglas V. Hall, TMH
2. Microprocessor Systems: The 8086/8088 family architecture programming and design – By Liu and Gibson, PHI
3. Microprocessor Architecture, Programming and Applications - By Gaonkar, PHI
1. MICROPROCESSOR and Microcomputer Based Systems,. – By M.Rafiquzzaman, PHI.
2. THE INTEL MICROPROCESSORS 8086/8088, 80186/80188,80286,80386,80486, Pentium, and Pentium Pro Processor Architecture, Programming and Interfacing – By Barry B.Brey, PHI
it 4.4 object Oriented programming using c++
Introduction: Principles of object oriented programming, object-oriented paradigm. Advantages, Abstract data types (ADT), Encapsulation and information hiding, tokens, expressions, control structures, functions in C++, Classes and Objects, Constructors and destructors.
Concepts of polymorphism, Function overloading, operator overloading, Overloading types, & rules, explicit & implicit type conversion operators.
Inheritance, extending classes, multiple inheritance, hybrid inheritance, pointers, virtual functions, and classes, and polymorphism.
Examples of Object Oriented Programming such as eight queens problem and expression evaluation, simple card games, etc.
Managing console operations: C++ streams and classes, I/O operations, Manipulators.
Working with files: Classes for file streams, file I/O operations and functions.
Templates: Template functions and classes, implementation.
Exception handling: Need, Throwing mechanism, try and catch block etc.
Introduction to the Standard Template Library: Components of STL, Containers, Algorithms, Iterators, Applications.
1. Object oriented programming with C++ by E Balaguruswamy, Tata McGraw Hill
2. Object-Oriented Programming Using C++ by Ira Pohl, Second Edition, Addison Wesley
1. C++ Primer by Stanley Lippman, Addison Wesley
2. The Waite Group’s Object Oriented programming in Turbo C++ by Robert Lafore – Galgotia Publications.
3. Mastering C++ by K R Venugopal, Rajkumar, T. Ravishankar – Tata McGraw Hill
4. Teach yourself C++ by Herbert Schildt, TMH
5. Programming with C++ by J. R. Hubbard (Schaum’s Outlines), McGraw Hill.
Modeling concepts: Examples of systems, Signal Models, Energy and Power signals, Energy and Power Spectral densities.
Modeling and Analysis in Time domain: System modeling concepts, Linear time invariant systems, Super imposition, Convolution, Step response, Frequency response, stability.
State variable techniques: State space concepts, State equations, Time domain solution of state equations, Frequency Domain solution, state transition matrix, Examples of Electrical network and transfer functions.
Discrete time signals & systems: A/D conversion, Z transforms, difference equations and discrete time systems, Inverse Z transformation
Analysis and design of Digital filters: Structures of digital processors, discrete time integration, IIR filter design and FIR filter design.
The Discrete Fourier Transform: DFT, properties, examples illustrating the computation of DFT.
Mathematical derivation of FFT, applications of FFT (Filtering, Spectral analyzer, Convolution etc.).
1. Signals and Systems by Zeimer, Tranter, Fannin, IE – Prentice Hall of India
2. Signals and Systems by Oppenheim and Willskay with Hamid Nawab, Prentice Hall of India.
1. Introduction to Signals and Systems by Linder, McGraw Hill.
2. Signals and Systems by Nagrath, Sharan, Rajan and Kumar, McGraw Hill.
3. Signals and Systems by Simon Haykin & Barry Van Veen, John Weily and sons.
IT 4.6 Electronic instrumentation
Introduction: Measurement and errors, Resolution, accuracy, precision, sensitivity, systems of units of measurements, standards of measurements,
Electronic Instruments for measurement of basic parameters: Electronic Multimeter, Q meter, Digital Voltmeter, Vector impedance meter, R.F, Power and voltage measurement.
Oscilloscopes: Block Diagram, CRT circuits, vertical deflection sytems, delay line, multiple trace, oscilloscope probes and transducers, oscilloscope techniques.
Signal generation: Sinewave generator, frequency synthesized signal generator, sweep frequency divider generators, pulse and square wave generator, function generators, audio frequency signal generators.
Signal Analysis: Wave analyzers, Harmonic distortion Analyzers and spectrum analyzers. Frequency counters and Time Interval Measurements: Frequency counters, Extending the range of frequency counters, automatic and computing counters.
Transducers: Classification of transducers for different physical quantities, strain gauges, displacement transducers, temperature measurements, photosensitive devices etc.
Analog and digital data acquisition systems: Instrumentation systems, interfacing transducers to electronic control and measuring systems, multiplexing.
1. Modern Electronic Instrumentation & Measurement Techniques by Albert D. Helfrick & William D. Cooper, PHI
1. Electronic Instrumentation by H.S. Kalsi, TMH
2. A Course in Electrical & Electronics Measurement and Instrumentation by A.K. Sawaney, Dhanpat Rai Publications.
3. Electronic Measurements and Instrumentation by Oliver and Cage, McGraw Hill.
Third Year Information Technology
IT 5.1 INTRODUCTION TO DATA COMMUNICATION
Lectures per week : (3+1)
Introduction to Data Communication
Spread Spectrum – Direct Sequence and Frequency Hopping
Data Communication Interface: The Physical Layer
LAN Architecture – Protocol Architecture, Bus and Tree Topologies, Star Topologies and Medium Access Control (MAC).
BUS LANs: Characteristics and Transmission Media
RING LANs: Characteristics, Timing jitter
STAR LANs: Twisted-pair and Optical
Wireless LANs: Technology, Requirements, Wireless LAN applications.
Bridges: Functions, Protocol Architecture and Spanning Tree Approach.
Brief overview of Ethernet using CSMA/CD (to be covered in detail in ‘Computer Networks’ course).
TEXTBOOKS:
REFERENCE BOOKS:
IT 5.2 OBJECT ORIENTED SOFTWARE ENGINEERING
Lectures per week : (3+1+2)
Software engineering concepts, Data flow diagrams, Petri net models,
Development processes- waterfall, spiral, extreme programming
Object Oriented design overview, object modelling using UML
Sample Tool- Argo UML, an open source tool.
IT 5.3 OPERATING SYSTEMS
Lectures per week : (3+1+2)
Introduction to Operating Systems, overview of different types of operating systems
Process management: Process concept, CPU scheduling and typed of schedulers
Interprocess synchronization and communication: Semaphores, Monitors, Messages, Classical synchronization problems, hardware methods for interprocess synchronisation
Process management in LINUX
Deadlocks: Basic concept, Deadlock prevention, Deadlock avoidance, Deadlock detection and recovery
Memory Management: Static and dynamic allocation, paging, segmentation
Virtual memory: Concept, demand paging, trashing
File System: File system interface, file system implementation
Storage management in LINUX
I/O Systems: I/O systems, secondary storage structure, tertiary storage structure
I/O Systems in LINUX
Protection and security issues :-
Case Study of WINDOWS 98/NT/XP Operating Systems.
Shell Programming in UNIX/LINUX: Concept of kernel and shell, shell commands, Filter commands, Piping, Redirection
Text Books:
1. The Operating System Concepts – By Silberschatz and Galvin, Wesley Publishing Co.
2. Operating Systems – By Dhamdere, TMH
3. UNIX – Concepts and applications – By Sumitabha Das, Tata McGraw Hill
1. Operating Systems – By W Stallings. PHI.
2. Operating systems, Design and implementation – By A.S Tanenbaum,PHI.
3. Operating Systems – By Milenkovic, Tata McGraw Hill.
4. Operating Systems – By Achyut S. Godbole, Tata McGraw Hill.
5. The Design of the UNIX Operating System – By Maurice J. Bach, PHI
6. Unix System Programming using C++, Terence Chan, PHI
7. Linux Programming Bible – By John Goezen, IDG Books India
8. Linux Kernel Internals – By M Beck, H Bohme, M Dziadzka, U Kunitz, R Magnus, D Verworner, Addison Wesley
IT 5.4 DATABASE MANAGEMENT SYSTEMS
Lectures per week : (3+1+2)
Max marks for theory paper : 100
Introduction to Database Concept:
· Database system versus file system
· Advantages of using a DBMS
· Database users and administrator
· Database system structure
Data modelling:
· Basic concepts
· Entity sets
· Attributes
· Relationship sets
· Constraints
· Keys
· E-R Diagram notation
·
Specialization
· Generalization Extended ER
· Aggregation
· Association
Reduction of ER to tables
Relational model:-
· Structure of a relational database(mathematical definition)
· Database languages i.e. DDL,DML
· Relational Algebra: Operations like select, project, rename, Set operations, join, Division, Aggregate functions.
· Tuple Relational Calculus: Tuple variables, Range Relations, Expressions, Formulae, Quantifiers, Safe Expressions.
· Domain Relational Calculus : Formal Definition, Safe expressions
Structured Query Languages (SQL):
· Data definition Queries:
Insert, Delete Update , Create;
Specifying Constraints & Indexes
· Data Manipulation Query:
Select with all options
Aggregate functions
Nested sub queries
· Views :
Specification of views in SQL
· Embedded SQL & Dynamic SQL
Other Relational languages:
QBE (Query-By-Example)
Relational Database Design:
· Pitfalls
· Functional dependencies
a. Closure of set of FD’s
b. Closure of attribute set
c. Canonical cover
d. keys
· Normalization Process
First normal form 1NF
Second normal form 2NF
Decomposition
Lossless join
Dependency preservation algorithm
Third normal form 3NF
Boyce-Codd Normal form BCNF
Multivalued dependency
Domain key Normal form DKNF
Project join Normal form PJNF
Practical database Design
Tuning
Query Processing
· Measures of query cost selection
· Translating SQL queries into Relational algebra
a. Sorting
b. Join
c. Nested Loop join
d. Block Nested Loop join
e. Merge join
f. Hybrid-Hash join
g. Pipelining
· Using Heuristics in Query Optimization
a. Query tree
b. Query graph
c. Converting query trees into Query evaluation plan using selectivity and cost estimates in optimization
· Query Optimization using database language
Database Recovery techniques
· Concepts
· Types of failures
· Detection schemes
· Logs, checkpoints
· Transaction Rollback
· Recovery techniques based on deferred update
a. Single user
b. Multi user
· Immediate update
Undo/redo
· ARIES recovery algorithm
· Recovery in multidatabase systems
Database Security and Authorization
· Types of security
· Security and DBA
Grant/Revoke
· Multilevel security
Concurrency Control techniques:
Standalone databases
· Locking techniques
· Timestamp ordering
· Multiversion concurrency control techniques
· Multiversion two-phase locking using certify locks
Practical sessions could emphasize on application development using SQL, Transaction Processing, Concurrency, Security and Recovery which could be implemented on the latest database software example: Oracle, Postgres SQL
R1 Fundamentals of Database Systems – By Elmasri & Navathe, Addison Wesley
R2 An Introduction to Data Base Systems Pearson Education, C. J. Date, Addison Wesley
R3 An Introduction to Database Concepts, Desai B, Galgotia
R4 Ramkrishnan
R5 Ullman
Lectures per week : (3+1)
Max marks for theory paper : 100
Signal and system classification, sampling, reconstruction and digital processing of analog signals, Time-domain representation of discrete-time signals, discrete-time unit impulse, unit-step and unit-pulse sequence.
Frequency-domain representation of discrete-time signals: Fourier transform of a sequence, Inverse Fourier transform Polar and rectangular form, magnitude and phase response.
Discrete-time signal obtained by sampling, aliasing, recovery of the analog signal, sampling theorem; Discrete Fourier transform (DFT and IDFT) pair.
MODULE 2
Discrete-time systems: Linear, time-invariant, Linear and time-invariant, Impulse-and system-responses; cascaded system; FIR and IIR systems; difference equations and their solution; stability; Frequency- response of a system to sinusoidal and exponential signals; Frequency-response of a FIR system, Linear-phase FIR systems.
The Z-transform, Inverse Z-transform, properties of Z-transform, computation of the inverse Z-transform(Long-division and partial fraction); transfer functions, cascades systems; Zero locations of linear-phase FIR systems
Realization of Digital Systems: Recursive and non-recursive structures, block-diagram
Representation; first-order, second-order and cascaded systems; Direct-and cascaded-form realization of IIR systems; Parallel form realization of IIR systems; Realization of FIR systems(Basic and linear phase)
Design of IIR digital filters: Impulse-invariant transformation, Bilinear transformation; All-pole analog filters(Butterworth and Chebyshev); Design of digital Butterworth and Chebyshev filters.
Design of FIR filters: Windowing(rectangular, Hann, Hamming, Bartlett, Blackmann and Kaiser windows). Examples of filter design using windows(low-pass, high-pass, Band-pass and band-reject). Frequency design using Kaiser window; Frequency-sampling technique.
Discrete Fourier transform(DFT); properties of DFT; Circular convolution, Linear convolution, overlap-add and overlap-save method.
Fast-Fourier-Transform(FFT) algorithms: Decimation-in-Time(DIT) algorithm; Number of computations, computational efficiency; Decimation-in-Frequency(DIF) algorithm; Butterflies for DIT-FFT and DIF-FFT algorithms.
TEXT BOOKS:
1. Introduction to Digital Signal Processing – Johnny R.Johnson, PHI
2. Digital Signal Processing, Salivahanan, Vallavraj and Gnana Priya
3. Computer Networks- S.Tanenbaum, PHI
REFERENCE BOOKS:
1. Signals and Systems – Oppenheim, Willsky and Hamid Nawab, PHI
2. Theory and Application of Digital Signal Processing – Rabiner and Gold, PHI
3. Introduction to Digital Filters-Antoniou, A, TMH
IT 5.6 COMPUTER GRAPHICS
Lectures per week : (3+1+2)
Max marks for theory paper : 100
Output primitives: Line drawing Algorithm, circle drawing algorithm, Ellipse drawing algorithm, parallel line algorithm, Fill area primitives, Attributes of output primitive
2D transformation: Rotation, Translation and Scaling, Principles and matrix representation, Composite transformation, reflection and shearing
Windowing and Clipping
Interactive graphics: Graphical input devices, Input technique, Event handling, input functions, Raster Graphics.
3D concepts: Realism in 3D graphics, 3D Object representation, 3D geometry and modelling transformation, 3D viewing.
Curves and Surfaces: Polygon surfaces, Blobby objects, Benzier curve, B-Spline curve
Perspective depth, Surface shading and illumination
Segment and display files, display file compilation, geometric models, picture structure
Graphics package.<