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.
Computer Animation: Colour models and Colour application, Visible Surface Detection Methods, Surface rendering methods.
Graphic systems:
Display processors, User Interface design, Device Independent Graphics system.
1. Computer Graphics – By Donald Hearn and M. P. Baker, PHI.
2. Principles of Interactive Graphics – By Newman and Sproull, McGraw hill.
Reference Books:
1. Computer Graphics – By Steven Harrington, Tata McGraw Hill.
2. Compute Graphics: Principles and Practice – By Foley, Van Dam, Feiner and Hughes
3. Introduction to Computer Graphics – By N. Krishnamurthy, TMH
4. Procedural Elements for Computer Graphics – By David F. Rogers, TMH
IT 6.1 PRINCIPLES OF ECONOMICS AND MANAGEMENT
Lectures per week : (3+1)
Max marks for theory paper : 100
Demand and supply: Demand and Supply analysis, Estimation /forecasting of Demand.
Macroeconomics: GDP, GNP, Income, Price Index, Inflation.
Elasticity and its applications: Price, Income, Cross Elasticity, Applications of Elasticity,.
Break even Analysis
Financial statements: Income statement, Balance sheet, Fund flow statement.
Working Capital Management: Determinants, Financing of Working capital
Capital Budgeting: Inviting proposals, Selection, Capital Rationing,
Methods of Projects evaluation: Payback period, ARR, Discounted Cash flow Techniques
Sources of Funds: Share capital, Debentures, Loans.
E-business and e-commerce: Reasons for going online, factors affecting e-business
Marketing an e-business: Direct Marketing, Promotions, e-advertising.
Measuring website return on investment: online measurement methods
Management Thought: Different schools, Functions of Managers, Planning, Types of plans, MBO, Unity of command, Decentralisation, Delegation, Line and staff function.
Organization: Span, Departmentation, Structure, OD, Culture, values, matrix organization, SBU.
Communication Process : Barriers, Grapevine, Formal, Informal.
Motivational Theories: Maslow’s Needs, Herzberg, Vroom’s Theory, McClelland Theory.
Leadership, Leadership styles and behaviors
Human Resource Management: Recruitment, Selection, Appraisal Methods.
Marketing: Marketing Mix, potential, Segmentation, Pricing.
1. Economics – By Samuelson P.A., , Mc Graw-Hill
2. Management – By Stoner, James, Freeman, Edward R. and Gilbert, Daniel R, Prentice-Hall
3. Creating a Winning E-Business – By Napier, Albert H., Rivers, Ollie N, Vikas Publishing House
1. Essentials of Management - By Koontz, Harold and Weihrich Heinz, Tata McGraw-Hill
2. Managerial Economics - By Peterson, Lewis, Prentice-hall.
3. Essence of Business Economics – By Nellis Parker, Prentice-Hall.
4. Schaum’s Outlines of Economics– By Sepulveda
5. Cost Accounting – By Homgren, Datar, Foster, Prentice-Hall.
6. The E-Business Revolution – By Amor, Daniel, HP Professional Books, Prentice Hall.
7. Business on the Net – By Agarwala, Kamlesh and Agarwala, Deeksha, MacMillan India.
IT 6.2 MANAGEMENT INFORMATION SYSTEMS
Lectures per week : (3+0+2)
Max marks for theory paper : 100
Management: Scientific, Systems, Behavioural approach, functions of Managers.
MIS: Need, concept, Evolution of MIS, Business and Technology Trends
Organisation: Structure, Matrix Structure, Culture, Motivation, Leadership.
Strategy: Porter’s Five-Forces model, Strategic Information Resources, Competitive Advantage.
Decision Making Concepts: Levels, Types, Methods and Tools for decision-making.
Data and Information: Human as Information processor, Classification of Information Systems.
Computing Systems and Hardware: Evolution of Hardware, Types of Computers, Microprocessors, Input and Output devices.
Software: Evolution, System, Application software, Graphical User Interface, Object Oriented Programming, Communication Software.
System Concepts: Systems Control, Development, Design, Role of Systems Analyst.
Modern database systems: DBMS and RDBMS, Basics, SQL, 4GL, Distributed Databases, Object Oriented Databases, Designing databases, Advantages of Databases.
Decision Support Systems: Models, Building Models, Group-Decision Systems, DSS generators (spreadsheets), Multi-criteria modelling.
Communications Technology: Telecom components, Analog and Digital Signals, Channels of Communication (Hardware), Types of Networks, Network Topologies.
Artificial Intelligence and Expert Systems
Development and Application of MIS in different managerial functions
Enteprise Management Systems: Benefits, Features, Implementation of ERP.
Controlling Information Systems: Dangers and Security Techniques
Types of controls: Input controls, Hardware controls, Software controls, Biometric controls.
Ethical and Social Issues: Responsibility, rights to privacy, Intellectual property.
1. Management Information Systems – By Kenneth and Jane P. Laudon, PHI
2. Management Information Systems – By S. Sadagopan, PHI
1. Management Information Systems – By James A. O Brien, TMH
2. Management Information Systems – By W.S. Jawadekar,TMH
3. Information Systems for Modern Management – By Robert Mudrick, Joel E. Ross, James R. Claggett, PHI
4. Management Information Systems – By Gerald V. Post, David Anderson, Tata McGraw - Hill
5. Introduction to Information Technology – By Efraim Turban, R. Kelly Rainer, Richard Potter John Wiley & Sons, Singapore
IT 6.3 COMPUTER NETWORKS
Lectures per week : (3+1+2)
Max marks for theory paper : 100
Data Link Layer - Medium Access Sub layer (MAC)
Multiple Access Protocols
Network Layer
Network Layer (Contd.)
MODULE 3
Frame Relay
Frame Relay Congestion Control
Asynchronous Transfer Mode - ATM
Wireless Communication – An Overview
Fundamentals of Wireless Communication –This should cover basics of cellular communication and Wireless LANS.
TEXTBOOKS:
· Data and Computer Communication - William Stallings
REFERENCE BOOKS:
IT 6.4 WEB TECHNOLOGIES
Lectures per week : (3+1+2)
Max marks for theory paper : 100
Internet: Basics, web objects, sites, e-mail, WWW, File transfer, TELNET etc.
Web servers, browsers and security: Web server, proxy server, web browsers, firewalls, data security
Creating a website and Markup languages: HTML, DHTML
XML: SGML, XML basics, XML parsers
Searching and Web-casting techniques: Search engines, search tools, etc
Dynamic web pages: Overview, Common Gateway Interface, Active server page technology, Java and the concept of a virtual machine, Java Servlets, JSP
Active web pages: Java applets, Java Beans
E-Commerce: Introduction, User sessions in e-commerce applications, Transaction management and Security issues
Introduction to Wireless Access Protocol (WAP)
1. Web technologies – By Godbole, TMH
2. Internet & Web technologies – By Rajkamal, TMH
1. Using HTML, XML and Java 1.2 – By Eric Ladd and Jim O’ Donnel, PHI
IT 6.5 principles of compilers
Lectures per week : (3+1+2)
Max marks for theory paper : 100
Introduction to compilers: Compilers and translators, Structure of a compiler, Phases of compilation, Bootstrapping and Porting, Compiler-writing tools. Parameter transmission, Runtime environment.
Finite automata: Finite automata, DFA and NFA, Regular expression, from regular expressions to finite automata, minimization of DFA
Lexical analyzer: Design of lexical analyzer, language for specifying lexical analyzer, implementation of lexical analyzer LEX, context free grammar-derivations and parse trees.
Parsers: Left recursion, Left factoring, Bottom-up parsers – shift reduce parsers-operator precedence parsers, LR parsers. Top down parsers – Recursive descent parsing - predictive parsers, LL parsers. Study of YACC.
Syntax directed translation schemes, Symbol tables – data structures used in symbol tables, Errors- lexical, syntactic, semantic errors, Code optimization, Code generation.
1. Principles of Compiler Design – by Aho and Ulman, narosa publishing House.
2. Compilers, Principles, techniques and tools, Aho, Ulman and Sethi, Pearson Education Asia
Introduction to computer theory, by Daniel Cohen, WSE
1. Compiler construction – Principles and Practice by Louden, Galgotia
2. Automata languages – Computation by Hopcraft and Ullman
Lectures per week : (3+0+2)
Max marks for theory paper : 100
Introduction to AI and Intelligent Agents
Problem solving: Agents, formulating problems, searching for solutions, search strategies, constraint satisfaction search, first search, heuristic functions, Memory bounded search, Iterative Improvement Algorithms.
Game Playing: Introduction, Imperfect decisions, Alpha-Beta pruning, Games that include the element of chance, some game programs/implementation.
MODULE 2
Knowledge and Reasoning:
Introduction to knowledge representation, reasoning and logic, prepositional logic, inference in propositional logic , first order logic, inference in first-order logic, building a knowledge base.
Logical Reasoning Systems.
MODULE 3
Planning: Introduction, practical planning, planning and acting uncertainty knowledge and reasoning: uncertainty, probabilistic reasoning systems, making simple decisions
MODULE 4
Learning: Learning from observations, learning in Neural and Belief Networks.
Agents that communicate, Practical Natural Language Processing, perception.
TEXT BOOKS:
1. Stuart Russell and Peter Norvig, Artificial Intelligence, A Modern Approach(LPE), Pearson Education Asia.
2. Artificial Intelligence: Rich and Knight, TMH
REFERENCE BOOKS:
1. Artificial Intelligence by Wrinston, PHI
4. Artificial Intelligence by George F.Linger, Pearson Education
6. Artificial Intelligence by Ongene Charniak, Pearson Education
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for Sessionals
: 25
Max marks for orals
: 50
Total no. of modules
: 4
No. of questions from each module : 2
Total
no. of questions to be answered
: 5 (At least one question from each module)
Indicative
Duration
Module I:
4 Weeks
Introduction:
The role of Image Processing and Computer
Vision, applications, successes, its relationship to natural vision, basic image
properties
Fundamentals
of Images:
•Digital Image representation
– image functions, perspective projection, gray levels, resolution.
•Dirac Distribution,
convolution, correlation, Fourier transforms
•Image Digitization – sampling
and quantisation, colour images
•Digital Image Properties –
topological properties, histograms, visual perception
Data
Structures for Image Analysis :
•Levels of image data
representation,
•Traditional image data
structures – matrices, chains, graphs,
•hierarchical data structures – pyramids, quadtrees
Module II:
4 Weeks
Image
pre-processing & Transforms:
•Brightness corrections,
gray-scale transformations
•Geometric transformations,
interpolations
•Local processing &
filtration - smoothing, edge detectors, sharpening, scaling, histogram
modifications
•Image Restoration –
Deterministic and stochastic techniques, Wiener filtration
Module III:
3 Weeks
Image
Segmentation:
•Thresholding
•Edge-based segmentation – border detection as a graph search, Hough
transforms, region construction from borders
•Region-based segmentation – splitting and merging, watershed
segmentation, region growing
•Matching – criteria and control strategies
Module IV:
4 Weeks
Shape
Representation and Description:
Concepts
of image analysis and methods
•Region
Identification
•Contour-based
representation and description – chain codes, geometric borders, shape
invariants
•Region-based
representation and description – simple scalar descriptors, convex hull,
region thinning & skeletons, decomposition
Object
recognition basics :
•Knowledge
representation
•Statistical
pattern recognition – classification principles and learning
Mathematical
morphology:
•Basic
morphological concepts
•Binary
dilation and erosion
•Thinning, thickening
1.Image
Processing, Analysis, and Machine Vision – by M. Sonka, V Hlavac and R Boyle,
Thomson Learning.
REFERENCE
BOOKS
1.Digital
Image Processing - By R.C. Gonzalez
and R.E. Woods, Addision Wesley.
2.Fundamentals
of Digital Image Processing - By A.K.Jain, PHI.
3.Digital Image Processing - By W.K.Pralt,
McGraw Hill
4.Digital Image Processing - By C.C. Rafeil,
Paul Wintez, Addison Wesley.
IT 7.2
DISTRIBUTED OPERATING SYSTEMS
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Total no. of modules
: 4
No. of questions from each module
: 2
Total
no. of questions to be answered
: 5 (At
least one question from each module)
Duration
1.
Introduction to Distributed Systems:
(4 Weeks)
1.1 Hardware and software concepts
1.2 Design issues
1.3 Layered protocol
1.4 ATM networks
1.5 Client-Server model
1.6 Remote Procedure Call
1.7 Group Communication
1.8 Process Management and Messaging Services
2. Synchronization in Distributed Systems: (5 Weeks)
2.1 Distributed transactions (Atomic Transactions)
2.2 Commit Protocol (2phase & 3 phase)
2.3 Concurrency Control in distributed databases
2.4 Clock Synchronization
2.5 Mutual Exclusion
2.6 Election algorithm
2.7 Dead locks
3.1
File System Design
3.2
Implementation
-
File usage
-
System Structure
-
Caching
-
Replication
-
Case study : SUN NFS
3.3
Trends in DFS
4.
Case Studies
(3 Weeks)
4.1 AMOEBA
- Objects and capabilities
- Process Management
- Memory Management
- Communication
- AMOEBA Servers
4.2 DCE (Distributed Computing Environment)
- Threads and Scheduling
- Synchronization
- Rpc
- Time Service
- Directory Service
- Security Service
1.
Distributed Operating Systems - By A.S.
Tanenbaum, Pearson Education.
2. Database System Concepts – By Silberschatz, Korth, Sudarshan, McGraw Hill
1. Distributed Systems: Concept and Design – by G. Golduris, J. Dollimore and T King Borg,, Addison Wesley.
IT 7.3 CRYPTOGRAPHY AND NETWORK SECURITY
Lectures per week
: (3 + 0 +0)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Total no. of modules
: 4
No. of questions from each module
: 2
Total
no. of questions to be answered
: 5 (At
least one question from each module)
MODULE 1
CRYPTOGRAPHY 1: Introduction: Attacks, Services, and Mechanisms, Security Attacks, Security Services, A model of Internetwork Security. Conventional Encryption Model, Steganography, Classical Encryption Techniques, Simplified DES, Block Cipher Principles The Data Encryption Standard, The strength of DES, Differential and Linear Cryptanalysis. Algorithms: Triple DES, International Data Encryption Algorithm, Blowfish, Confidentiality Using Conventional Encryption: Placement of Encryption Function, Traffic Confidentiality, Key Distribution, Random Number Generation.
CRYPTOGRAPHY 2: Public key cryptography : Principles of
Public-Key Cryptosystems, The RSA Algorithm, Key Management, Diffie-Hellman Key
Exchange, Number Theory: Prime and Relatively Prime Numbers, Modular Arithmetic,
Fermat’s and Euler’s Theorems, Testing for Primality, Euclid’s Algorithm,
The Chinese Remainder Theorem, Discrete Logarithms, Message Authentication and
Hash functions: Authentication Requirements, Authentication Functions, Message
Authentication Codes, MDs Message Digest Algorithm, Digital Signatures and
Authentication Protocols: Digital Signatures, Authentication Protocols, Digital
Signature Standard.
Network Security-I Authentication Applications: Kerberos, X.509 Directory
Authentication Service, Electronic Mail Security: Pretty Good Privacy, S/MIME.IP
Security: IP Security Overview, IP Security Architecture, Authentication Header,
Encapsulating Security Payload, Combining Security Associations, Key Management.
Network Security-II Web Security: Web security Requirements, Secdure Sockets Layer
and Transport Layer Security, Secure Electronic Transaction. Intruders, Viruses,
and Worms: Intruders, Viruses and Related Threats, Firewalls: Firewall Design
Principles, Trusted Systems.
TEXT BOOKS:
1.Cryptography and Network security 2nd
ed.—William Stallings PEA
REFERENCES:
1.Internet
Cryptography, Addison Wesley 1997—Richard E Smith PEA.
IT 7.4 A (Elective I) DATA MINING AND WAREHOUSES
Lectures per week : (3 + 1 +2)
Max marks for theory paper : 100
Max marks for sessionals
: 25
Max marks for orals :50
Duration of paper
: 3 hours
Total no. of modules
: 4
No. of questions from each module : 2
Total
no. of questions to be answered: 5 (At least one question from each module)
Indicative
Duration
MODULE 1
(4 Weeks)
Data Warehousing
-
Data Warehouse Architecture,
-
Multidimensional Data Model
-
Data Warehouse implementation-OLAP Queries and Data Cubes
-Data
Cleaning
-Data
Integration and Transformation
-Data
Reduction
-Discretization
and Concept Hierarchy Generation
-DMQL
(Data Minining Query Language)
-Mining
association rules in large data bases
-Sigle
dimension Boolean association rule, multilevel association rules,
-Constraint-based
Association Mining.
-Classification
and Prediction
-Bayesian Classification, Other classification methods- K-nearest neighbor, Case-based reasoning and Genetic algorithms
Cluster
Analysis
-Definition of cluster Analysis, Types of Data in
Cluster Analysis
-Clustering methods – Partitioning Methods
-Hierarchical Methods, Density based methods
-Grid based Methods, Model based clustering
methods
-Outlier Analysis
-Mining Complex Types of Data – Mining Multimedia
Databases and Spatial Databases
-Data Mining Applications – Biomedical and DNA
Analysis, Financial Data Analysis
-Data Mining System products -
-Themes on Data Mining
-Social Impacts on Data Mining
-Trends in Data Mining
-Data mining and privacy issues-social context.
Data
mining - Concepts
and Techniques
-Jiawei Han and Micheline
Kamber, Morgan Kuaffman publisher
REFERENCES
1.Mastering
Data Mining-Michel. J. A. Berry. Gordon S.Linoff, Wiley Publications
2.Data
Mining-Pieter Adriaans and Dolf Zantinge.- PEA.
Lectures per week
: (3 + 1 + 2)
Max marks for Sessionals
: 25
Max marks for orals
: 50
Total no. of modules
: 4
No. of questions from each module
: 2
Total
no. of questions to be answered : 5 (At least one question from each module)
MODULE 1 (4 Weeks)
1.1
Introduction to E-Commerce
1.1.1 Benefits and Limitations
1.1.2 Types of E-Commerce
1.1.3 Reasons for going on-line
1.2
Internet technologies
1.2.1 Web browsing
1.2.2 Introduction to HTML, XML, Javascript
1.2.3 Dynamic Server concepts
1.2.4 Web application servers
2.1 Security on Internet
2.1.1 Creating security states
2.1.2 Usage of Cryptography
2.1.3 Application of cryptography
2.1.4 Privacy on the internet
2.2
Client based security
2.2.1 Digital certificates
2.2.2 Certification authority
2.2.3 Smart cards
2.2.4 Biometric identification
2.3
Server based security
2.3.1 Firewall
2.3.2 Server protection
2.4
Public key algorithm
2.4.1 Modular arithmetic
2.4.2 RSA algorithm
2.4.3 Why is RSA secure
2.4.4 RSA threats
2.4.5 Public key cryptography standards (PKCS)
3
Electronic Payment (Paying Via the NET)
3.1
Business requirement
3.2
Post paid payment system
3.2.1
Credit card, Internet cheques, cash on delivery
3.3
Instant paid payment systems
3.3.1
Debit Card, Direct Debit
3.4
Prepaid Payment System
3.4.1
Electronic cash
3.4.2
Smart cards
3.5
The future of payment
3.5.1
SEMPER
3.5.2
Open trading Protocol
3.5.3
Open buying on the Internet
4.1
Electronic Commerce and Retailings
4.1.1 Retail industry dynamics
4.1.2 Mercantile models
4.1.3 Management challenges in On-line retailing
4.2
Intranet & customer assets management
4.2.1 Challenges in implementing CAM
4.2.2 On-line sales force Automation
4.2.3 On-line customer service support
4.2.4 Decision support architecture
4.2.5 Decision support application
1. Network Security – Private Communication in Public Worls – C. Karftman, Perlman & speciner (Pearson Education Asia).
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for Sessionals
: 25
Max marks for orals
: 50
Total no. of modules
: 4
No. of questions from each module
: 2
Total
no. of questions to be answered: 5 (At least one question from each module)
Indicative
Duration
MODULE –I (2 Weeks)
1. INTORDUCTION to NEURAL NETWORKS and FUZZY LOGIC
Neural Networks:
What is Neural Networks,
Human Brain,
Models of Neurons
Neurons viewed as Directed Graphs
Feedback
Network Architectures
Knowledge representation
Airtificial Intelligence and Neural Networks.
Fuzzy Logic and Neural Networks
Fuzzy Logic:
Propositional Logic
Fuzzy sets and systems
Fuzzy Rule Generation
Fuzziness in Probabilistic World
The Fuzzy Entropy Theorem
Fuzziness as Multivalence
Dynamical-Systems Approach to Machine Intelligence
Intelligent Behaviour as Adaptive Model-Free Estimation.
Image Data Processing
Communication Systems
- Traffic Control
- Communication Channels over Power Lines
Intelligent Control
Optimization Techniques.
MODULE –II (2 Weeks)
2. ACTIVATIONS AND SIGNALS:
Neurons as functions
Signal Monotonicity
Biological Activations and Signals
Neuron Fields
Neuron Dynamical Systems
Neuronal State Spaces
Signal State Spaces as Hypercubes
Neuronal Activations as Short-Term Memory
Common Signal Functions
3. ACTIVATION MODELS:
Neuronal Dynamical Systems
Additive Neuronal Dynamics
Additive Neuronal Feedback
Additive Bivalent Models
Bivalent Additive BAM(Bidirectional Associative Memory)
Bidirectional Stability
Bivalent BAM Theorem
BAM Connection Matrices
- Hopfield Model
4. UNSUPERVISED LEARNING
Learning as Encoding, Change, and Quantization
Supervised and Unsupervised Learning in Neural Networks
Four Unsupervised Learning Laws
Probability Spaces and Random Processes
Measureability and Sigma-Algebras
Probability Measures and DEnsity Functions
Stochastic Unsupervised Learning
Signal Hebbian Learning
Competitive Learning
Differential Hebbian Learning
- Fuzzy Cognitive Maps
- Adaptive Casual Inference
Differential Competitive Learning
5. SUPERVISED LEARNING
Supervised Functionn Estimation
Supervised LEarning as Operant Conditioning
Supervised Learning as Stochastic Approximation
The perceptron
The Least Mean Square Algorithm
The Backpropagation Algorithm
Feedforward Sigmoidal Representation Theorems
Multilayer Feedforward Netwrork architectures
Robust Backpropagation
Other Supervised Learning Algorithms
6. ARCHITECTURES AND EQUILIBRIA
Neural Networks as Stochastic Gradiant systems
Global Equilibria: Convergence and Stability
Global Stability of Feedback Neural Networks
Structural Stability of Unsupervised Learning
Random Adaptive Bidirectional Associative Memories
MODULE –IV
(4 Weeks)
7. FUZZY NEURAL NETWORKS
Fuzzy systems and Neural Networks
Fuzzy System design Procedures
Neuro-Fuzzy Systems
A Fuzzy MP Neuron Unit
Neural Components of a Fuzzy System
Neural Network Implementation approximations
Fuzzy and Neural Function Estimators
Neural vs. Fuzzy Representation of Structured Knowledge
FAMs as Mapping
Fuzzy Hebb FAMs
FAM System Architecture
Adaptive FAMs
Adaptive FAM -Rule Generation
Bart Kosko, “Neural Networks and Fuzzy System- A Dynamical Systems Approach to Machine Intelligence”, PHI
Stamatios V. Kartalopoulos, “Understanding Neural Networks and Fuzzy Logic- Basic Concepts and Applications”, (IEEE Press) PHI.
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for Sessionals
: 25
Max marks for orals
: 50
Total no. of modules
: 4
No. of questions from each module
: 2
Total
no. of questions to be answered: 5 (At least one question from each module)
MODULE
1
Introduction
to Microcontroller: Different types of microcontrollers. Processor Architecture: Harvard and
Princeton, CISC and RISC.
8051
Microcontroller Architecture: Hardware, input/output pins, ports and circuits,
interfacing to external memory, counters and timers, serial data input and
output, interrupts.
8051
Instruction Set: Addressing Modes, Data movement instruction: External Data move, Code
memory Read-Only-Data moves, Push and Pop opcodes, Data exchanges. Logic
operation: Bit and Byte level, Rotate and Swap.
MODULE 2
The
8051 Instruction Set: Arithmetic operations: Flags, incrementing, decrementing, addition,
subtraction, multiplication and division, decimal arithmetic.
Jump
instructions, Call instructions and Return.
Programming
with 8051
– Program to demonstrate arithmetic operations, bank register addressing, RAM
direct addressing-conditional branching, stack operations, variable array
implementation and pseudorandom LED display using 8051.
MODULE 3
Serial
Communication:
Basics of Serial Communication, 8051 connections to RS-232, 8051 Serial
Communication Programming.
Interrupt
Programming: 8051
Interrupts, Programming Timer Interrupts, Programming External Hardware
Interrupts, Programming the Serial Communication Interrupt, Interrupt Priority
in the 8051.
Interfacing
8051:
Interfacing 8051 to a LCD Display, Stepper Motor, Keyboard, Digital to Analog
Converter (DAC).
Real
Time Operating Systems (RTOS): Basics of Real Time operating systems, Programming
using RTOS, VxWorks, QNX, Embedded Systems programming using C language, Case
study: Embedded Linux, letter development using Embedded Linux
Embedded
software development tools: Integrated Development Environments (IDE) for 8051 systems, Simulators,
Debuggers, Software Monitors, Watch Dog Timers.
1. The 8051 Microcontroller, Architecture, Programming & applications-Second edition – Kenneth J. Ayala, Penram International.
2. The 8051 Microcontroller and Embedded Systems – Muhammad Ali Mazidi and Janice Mazidi, Pearson Education.
1. Programming and Customizing the 8051 Microcontroller – Myke Predko.
2.
An
Embedded Software Primer – By David E. Simon PHI
Lectures per week : (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for Sessionals
: 25
Max marks for orals
: 50
Total no. of modules
: 4
No. of questions from each module
: 2
Total
no. of questions to be answered: 5 (At least one question from each module)
Indicative
Duration
MODULE –I (4 Weeks )
Introduction
: Introduction to OR
,Classification of problems and Mathematical Modelling in Operations
Research .
Linear Programming
: Introduction to Linear Programming ,Formulation of Linear Programming models
,Graphical Solutions of Linear Programming models, Maximisation and Minimisation
of functions with constraints ,Simplex method , Transportation and Assignment
problems.
MODULE –II (4 Weeks)
Integer Programming :
Introduction to Integer Programming ,Implicit Enumeration Algorithm for 0-1
integer programming problems , Cutting plane technique .
Branch and Bound Techniques
: Branch and Bound Algorithm for Assignment problems, Travelling
Salesman problems and for Integer Programming problems.
MODULE –III (4 Weeks)
Dynamic Programming
:Introduction to Dynamic Programming ,Investment problems,General Allocation
problems ,Stage-coach problems ,Knapsack problems and Production Scheduling .
Sequencing problems
: N-job two machine sequencing problem and
N-job three machine sequencing problem.
MODULE –IV (4 Weeks)
Introduction to PERT , PERT
network ,Critical Path Method ,Probability of completing event on schedule.
Queuing Theory
:Notations and Assumptions ,Queuing Models: Pure birth and death model,
generalized poisson queing model.
Text Books :
Introduction to Operations
Research :A Computer Oriented Algorithm Approach - By Billey E. Gillet ,TMH
Reference Books
:
1. Operations Research - H.A.
Taha ,PHI
2. Operations Research -
Fredericks ,Hiller and Liberman ,TMH
3. Quantitative Methods :
Application to Managerial Decision Making -
Robert E. Markland and
James R. Sweigart ,John Wielly and Sons
7. 5 B (Elective II) DIGITAL SIMULATION AND
MODELING
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for sessionals
: 25
Max marks for orals
: 50
Total no. of modules
: 4
No. of questions from each module
: 2
Total
no. of questions to be answered
: 5 (At
least one question from each module)
Introduction to Discrete Event System Specifications (DEVS)
Modeling Formalisms and Simulation Algorithms
Basic formalisms: DEVS, DTSS, DESS, Coupled
multicomponent systems
Simulators for Basic Formalisms
Multiformalism Modeling and Simulation
Parallel and Distributed Discrete Event Simulation System Morphisms: Hierarchy of System Morphisms, Constructing Model families, Verification, Validation, Approximate morphisms
- John Wiley & sons
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for Sessionals
: 25
Max marks for orals
: 50
Total no. of modules
: 4
No. of questions from each module
: 2
Total
no. of questions to be answered: 5 (At least one question from each module)
Indicative
Duration
MODULE –I (4 Weeks)
MODULE –II (4 Weeks)
1.
Manis and Little, The Schematics of Computation, Prentice Hall, 1995.
2.
Smith, An Introduction to Scheme, Prentice Hall, 1988.
3.
Harvey and Wright, Simply Scheme, Introducing Computer Science, MIT
Press, 1994.
4.
Friedman, Wand and Hayes, Essentials of Programming Languages, McGraw
Hill, 1992.
MODULE –III (3 Weeks)
· An introduction to functional programming.
· Functional composition, recursion, and iteration.
· Procedures and data abstraction using functions.
· Managing states, streams, delayed evaluation, and continuations.
· Using functional languages as an analytic notation for reasoning about programs.
MODULE –IV (5 Weeks)
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for Sessionals
: 25
Max marks for orals
: 50
Total no. of modules
: 4
No. of questions from each module
: 2
Total
no. of questions to be answered: 5 (At least one question from each module)
Indicative
Duration
MODULE –I (4 Weeks)
Basic electrical properties of mos and
bicmos(quantative treatement)
MOS transistor transconductance and output conductance
MOS transistor figure of merit W0
Pull-up and pull-down ratio for pass transistor and NMOS inverter
CMOS and bipolar transistor comparative aspects
BICMOS inverters.
MOS and BicMOS circuit design process
MOS layers, stick diagrams, design rules and layout
Lamba-based design rules, contact cuts, double metal
MOS process rules, CMOS lambda-based design rules
2 mm double metal, double poly BicMOS rules.
1.2 mm double metal, single poly CMOS rules
layout diagrams – Symbolic diagrams.
Basic Circuit Concepts
Sheet resistance Rs, area capacitance of layers,
Wiring capacitance, standard unit of capacitance, propagation delays
The delay unit t
Hardware description Languages
VHDL: Basic terminology – entity, Architecture, configuration package, package body, model analysis.
Behavioral modelling
Data flow modelling
Structural modelling
Model simulation
MODULE –III
(4 Weeks)
CMOS circuit & logic design
CMOS Logic gate design; typical CMOS NANd & NOR delays
Basic physical design of simple logic gates-layout
Guidelines – layout optimization for performance
CMOS logic structures – clocking strategies, I/O structures.
System design
and design methods
Design strategies – structured design strategies, hierarchy regularity, modularity, locality
CMOS – chip design options
Programmable logic, Reprogrammable gate arrays
XTLINX. FPGA, standard cell design.
Symbolic layout – coarse grid symbolic layout
Gate matrix layout, sticks layout & compaction
Virtual gird symbolic layout
Design methods
Behavioralsynthesis, RTLsynthesis,
Logic optimization
Design capture tools – (HDL design, schematic design)
Design varification tools
Design economics, data sheets
MODULE –IV
(4 Weeks)
Epitaxy – vapor phase epitaxy, molecular beam epitaxy
Oxidation – Oxide properties, thin oxides, oxidation techniques and systems
Lithography – optical lithography, electron lithography, X-ray, Ion lithography
Reactive Plasma etching – Plasma properties, Etch mechanisms
Polysilicon film deposition – polysilicon properties, deposition processes
Diffusion
Fide’s one-dimensionaldiffusion equation (quantitative study)
Atomic diffusion mechanisms
Metallization choices
Patterning, metallization problems
Packaging of
VLSI
Packaging Design considerations
VLSI Assembly technologies
Package fabrication technologies
1. Basic VLSI Design by Douglas A. Pucknell, Kamran E. Shrughian, PHI, 3rd edition
2. Principles of CMOS VLSI Design – A Systems perspective by Niel H.E. Weste, Kamran Eshryghian, PEA Addison Wesley, 2nd edition
3. VLSI Technology by S.M. SZE, TMH, 2nd edition
4. VHDL by D.M. Perry
IT
8.1
MOBILE COMMUNICATION
Lectures per week
: (3 + 1 + 0)
Max marks for theory paper
: 100
Max marks for Sessionals
: 25
Max marks for orals
: 50
Total no. of modules
: 4
No. of questions from each module : 2
Total no. of questions to be answered
: 5 (At least one question from each module)
Indicative
Duration
MODULE I (4 Weeks)
Introduction to Antennas,
Electromagnetic Theory and Electromagnetic spectrum,
Dimensions and Units,
· Fundamentals and Secondary units,
Application Of Mobile communication,
Frequencies Used,
Basic Cellular Systems and its Operations,
Propagation attenuation,
Fading Characteristics,
Delay Speed and Coherent Bandwidth,
Propagation Paths,
Cell Shapes,
Components of cellular systems,
Componenets of frequency re-use channel,
Co-channel interface reduction factor, .
Carrier to interference ratio of Omni directional antenna system,
Hand-Off Mechanism,
Cell Splitting,
Analog Cellular Mobile.
MODULE II (4 Weeks)
Mobile Point to Point Model :
· Propagation over water,
· foilage loss,
· Near-In distance and long distance propagation,
· Path Loss,
· Cell site antenna height and signal coverage cell.
· Mobile to Mobile communication.
Antenna Concepts :
· Basic Antenna Parameters,
· Patterns,
· Beam Area,
· Radiation Intensity,
· Beam Efficiency,
· Directive, Directive and gain, Directive and resolution.
· Aperture concept,
· Effective, Scattering, Loss, Collection, Physical Aperture and Aperture efficiency.
· Scattering by large aperture,
· Duality Of antennas,
· Aperture field zone,
· Wave polarization.
Cell site
antennas and its types
Mobile antennas and their types.
MODULE III (4 Weeks)
Co-channel interference and its measurements,
Reduction of Co-channel interference by notch in tilted antenna pattern,
Power control,
Diversity receiver,
Adjascent channel interference,
Near-end Far-end interference,
Cross talk,
SAT tone,
UHF TV interference,
Definition Of channel assignment,
Fixed channel assignment,
Channel sharing,
Sectorization,
Non-fixed channel assignment algorithms,
Features of handling,
MTSO interconnection.
MODULE IV (4 Weeks)
Medium access control:
· Drawback of CSMA-CD in wireless communication,
· Use Of SDMA,
· FDMA,
· TDMA
o Fixed TDMA,
o Classical ALOHA,
o Slotted ALOHA,
o CSMA,
o DAMA (Demand Assigned multiple access),
o PRMA (Packet reservation multiple access),
o Reservation TDMA,
o MACA (multiple access with collision avoidance),
o Polling,
o ISMA (Inhibit sense multiple access).
· CDMA,
· SAMA (Spread ALOHA multiple access).
· GSM
o Mobile services,
o System architecture,
o Radio interference,
o Logic Channel,
o Frame heirarchy,
o Protocols,
o Localization and calling handover,
o Securiy.
· DECT
o System Architecture
o Protocol
o
· TETRA
o System Architecture
o Protocol
· WAP
Text Books :
1. Antennas By John D. Kraus , McGraw-Hill Pub.
2. Mobile communications by John Schiller , John Wiley & Sons Inc Pub.
3. Mobile cellular telecommunication by W. Lee, McGraw-Hill Pub.
Reference Books :
1. Mobile communication engineering by W. Lee, McGraw-Hill Pub.
2. CDMA- Cellular mobile and network security by Rhee
3. Wireless and mobile communication by Godman
4. Technology of mordern mobile communication by Lobensommer
IT
8.2 A (Elective III) DISTRIBUTED
DATABASE MANAGEMENT SYSTEMS
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for Sessionals
: 25
Max marks for orals
: 50
Total no. of modules
: 4
No. of questions from each module :
2
Total no. of questions to be answered
: 5 (At least one question from each module)
Indicative
Duration
MODULE I (2 Weeks)
Introduction to
Database Implementataion and Distributed Database Systems
Introduction to database systems
Introduction to computer networks
Distributed databases and introduction, transparency,
performance and reliability.
The concept and role of the transaction in distributed computing.
Introduction to parallel and distributed architectures.
Distributed Database
Architectures
Distributed and parallel databases concepts :
Autonomy,Distribution, and heterogeneity.
Client/server
Parallel and distributed architectures.
Component architecture
MODULE II (4 Weeks)
Distributed Database
Design
Top down design
Bottom up design
Horizontal, vertical and hybrid fragmentation.
Allocation
Query Processing
Objective
Complexity of relational algebra operations
Query processors
Layers of Query processing
Query decomposition
and Data Localization
Query Decomposition
Loclization of Distributed data
MODULE III (5 Weeks)
Optimization of
Distributed Queries
Query Optimization
Search space
Distributed cost model
Centralized Query optimization algorithms:
INGRES,
System R,
Join ordering, Join v/s Semijoin
Distributed Query optimization algorithms:
Hill climbing algorithm,
Distributed INGRES, R*,
SDD-1
Transaction Management:
Transaction model and properties
Transaction structure
Serializability Theory
MODULE IV (5 Weeks)
Concurrency Control
Lock based concurrency control algorithms
Timestamp ordering.
Optimistic concurrency control.
Deadlock management – detection, avoidance, and resolution. Distributed deadlock.
Distributed DBMS
Reliability
Reliability concepts and failures.
Distributed Reliability protocols
Local Reliability protocols
Dealing with site failures
Network Partitioning
Text Books :
1. Principles of Distributed Database Systems, 2nd edition by Ozsu, M. Tamer and Patrick Valduiriez, PHP
Reference Books :
1. Distributed Databases Principles and Systems by Stefano Ceri and and Oluzeppe Peelaggati, McGraw Hill Publishers
2. Distributed Database Systems by D.A. BEll and J.B.Grimson, Addison Wesley Publishers
3. Database Systems Concepts, 4th edition by Silberschatz, Abraham, Henry F.Korth ans S. Sudarshan, McGraw Hill Publishers
4. Transaction Processing: Concepts and Techniques by Gray J. and A.Reuter, Morgan Kaufmann
5. Concurrency Control and Recovery in Database Systems, by Bernstein, P.V. Hadzilacos and N. Goodman, Addison Wesley.
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for Sessionals
: 25
Max marks for orals
: 50
Total no. of modules
: 4
No. of questions from each module :
2
Total no. of questions to be answered
: 5 (At least one question from each module)
Indicative
Duration
Module I:
(3 Weeks)
·
Web services concepts
·
Introduction to Web services
·
Benefits of Web services
·
XML schemas: XML, XML DTDs, XML Schemas, Elements and Attributes
·
XML Schma Complex types and simple types, occurrence constraints
·
XML Schema Element groups, Nil Values
·
Module II
(3 Weeks)
·
Web service Standards
·
SOAP(Simple Object Access Protocols)
·
SOAP messages, SOAP message exchange model
·
SOAP encoding and XML schemas
·
SOAP data types, SOAP transport.
Module III
(3 Weeks)
· WSDL (Web Services Description Languages)
· Describing Web Services, WSDL anatomy, Defining data types and messages
· Defining a Web Service Interface
· Defining Web Service implementation
· Message Patterns
· UDDI(Universal Directory and Discovery Interface)
· UDDI registries, UDDI publish interface, UDDI inquiry interface
· Using UDDI and WSDL together
Module IV:
(3 Weeks)
· Web Services Security
· Incorporating Security with XML
· XML Digital Signatures, XML Encryption
· SOAP Security Extensions
· Practical Applications of Web Servies: Creating a Web Service with a complex interface.
· Case study: JAVA Web Services, .NET web services.
References:
1.Understanding Web services XML, WSDL, SOAP and UDDI – new – Comer E.
2.XML and Web Services- Scmeizer R.
3.XML ,Web Services and the Data Revolution- Coyle F.P.
4.Java Web Services- David A.Chappel
5.Web services Essentials- Cerami, O’Reilly
6.Programming Web Services with SOAP , Snell, O’Reilly
Text Book:
Web Services: A Technical Introduction
- Harvey M.Dietel
& Paul J.Dietel, Prentice Hall PTR
IT 8.2 C (Elective III) ADVANCED COMPUTER ARCHITECTURES
Lectures per week : (3 + 1 +2)
Max marks for theory paper : 100
Max marks for sessionals : 25
Max marks for orals : 50
Duration of paper : 3 hours
Total no. of modules : 4
No. of questions from each module : 2
Total no. of questions to be answered
: 5 (At least one question from each module)
Introduction to parallel processing: Evolution of computer systems, parallelism in uniprocessors, parallel computer modes, Architectural classification schemes, Parallel processing applications. Conditions of parallelism, Hardware and Software parallelism, Types of parallelism, Introduction to pipelining, Linear pipeline processor, Non-linear pipeline processors, Instruction and Arithmetic pipeline design, principles of designing pipelined processors.
Hierarchical memory technology, Addressing schemes, Locality of References, Hierarchy optimization.
MODULE 2
Vector processing principles, Vector loops and
chaining, pipelined vector processing methods, Architecture or
Cray-1,Vectorization and Optimization methods.
SIMD Computer Organization: Introduction,
Interconnection networks,parallel algorithms for array processors, The Illiac-IV
System architecture and applications
Associative
array processing:
Associative memory organization, PEPE and STARAN associative processors,
associative search algorithms.
Multiprocessors: Functional structures, Interconnection networks, Cache coherence and solutions, Interleaved memory organization, Multiprocessor operating systems, Language features to exploit parallelism, Detection of parallelism using Bernstein’s conditions, Process synchronization mechanisms, system deadlocks and protection.
Parallel algorithms for multiprocessors-Classifications and performance of algorithms.
Cray X-MP system architecture and multitasking.
Dataflow computers: Control flow versus data flow computers, Data flow architectures, Static and Dynamic data flow computers, study of Arvind’s machine and Dennis Machine, demand-driven mechanism, Data flow graphs and languages, Advantages and potential problems in data flow computers.
VLSI computing structures-systolic array architecture, VLSI chip implementation of matrix multiplication.
RISC processor: RISC architecture, Instruction set of RISC, distinction between RISC and CISC, overlapping windows in RISC, Study of a RISC processor called SPARC, Advantages and disadvantages of RISC processor.
TEXT BOOKS
1. Advanced computer architecture by Kai Hwang, TMH.
2. Computer architecture and parallel processing by Hwang and Briggs, TMH.
REFERENCE BOOKS
1. Computer Architecture by Nicholas Carter, TMH
Lectures per week : (3 + 1 +2)
Max marks for theory paper : 100
Max marks for sessionals : 25
Max marks for Orals : 50
Duration of paper : 3 hours
Total no. of modules : 4
No. of questions from each module : 2
Total no. of questions to be answered
: 5 (At least one question
from each module)
MODULE
1
GENETIC ALGORITHMS: robustness of traditional optimization and search techniques, goals of optimization, A Simple Genetic Algorithm, Similarity Templates
MATHEMATICAL FOUNDATIONS: Fundamental theorem, Schema Processing, 2 armed and K armed bandit problem, building block hypothesis, minimal deceptive, similarity templates as hyper planes
COMPUTER IMPLEMENTATION OF GENETIC ALGORITHMS: Data structure, reproduction, crossover and mutation, mapping objective functions to fitness form, fitness scaling
MODULE
3
ADVANCED OPERATORS AND TECHNIQUES IN GENETIC ALGORITHM SEARCH: Dominance, Diploidy and abeyance, inversion and other re-ordering operators, Macro operators, niche and special speciation, multi objective optimization, knowledge based techniques, Genetic Algorithms and Parallel processors, Genetic Based machine learning, Classifier systems
INDUSTRIAL APPLICATION OF GENETIC ALGORITHMS: Datamining using genetic Algorithms, using genetic operators to distinguish chaotic behavior from Noise in a time series
TEXT BOOKS:
1.David Goldberg, Genetic Algorithms in search, optimization machine leaning , Addison Wesley International student exition, 1999.(chapter 1,2,3(pages 59 to 79 both inclusive), 5,6)
1. Charles L Karr and L.Michael Freeman, Industrial applications of Genetic Algorithms, CRC Press, Washington DC, 1998(chapter 9,13)
REFERENCES:
1. Industrial applications of genetic algorithms—Charles l Karr and Michael Freeman—CRC .
IT
8.3 A(ElectiveIV)
NATURAL LANGUAGE
PROCESSING
Lectures per week
: (3 + 1 + 2)
Max marks for theory paper
: 100
Max marks for Sessionals
: 25
Max marks for orals
: 50
Total no. of modules
: 4
No. of questions from each module :
2
Total no. of questions to be answered
: 5 (At least one question from each module)
Indicative
Duration
MODULE I (5 Weeks)
Introduction to Natural Language Processing
Words
Regular expressions & automata
Regular
Expressions
Finite
State Automata
Regular languages & FSAs
Morphology
& finite state transducers
Finite state morphological parsing
Combining FST Lexicon and Rules
Lexicon-Free FSTs: The Porter Stemmer
Human Morphological Processing
N-grams
Counting
Words in Corpora
Simple
(Unsmoothed) N-grams
Smoothing
MODULE II (4 Weeks)
Syntax
Word Classes and Part of-Speech Tagging
English
Word Classes
Tagsets
for English
Part-of-speech
Tagging
Rule-Based
Part-of-speech Tagging
Stochastic
Part-of-Speech Tagging
Context-Free Grammars for English
Constituency
Context-Free
Rules and Trees
Sentence-Level
Constructions
The
Noun Phrase
Coordination
Agreement
The
verb phrase and sub categorization
Auxiliaries
Grammar
Equivalence and Normal Form
Finite-State
and Context-Free Grammars
Parsing
with Context-Free Grammars
Parsing
as Search
A
Basic Top-Down Parser
Problems
with the basic Top-Down Parser
Finite-State
Parsing Methods
MODULE III
(4 Weeks)
Syntax
Concepts
of Features & Unification
Concepts
of Lexicalized and Probabilistic Parsing
Semantics
Representing
Meaning
Computational
Desiderata for Representations
Meaning
Structure of Language
First
Order Predicate Calculus
MODULE IV
(3 Weeks)
Semantics
Semantic
Analysis
Syntax-Driven
Semantic Analysis
Attachments
for a Fragment of English
Integrating
Semantic Analysis into the Earley Parser
Idioms
and Compositionality
Robust
Semantic Analysis
Lexical
Semantics
Relations
Among Lexemes and their senses
WordNet:
A Database of Lexical Relations
Machine
Translation
Language
Similarities and Differences
The
transfer Metaphor
The
Interlingua Idea: Using Meaning
Direct
Translation
Using
Statistical Techniques
1.
Speech and
Language Processing –Daniel Jurafsky and James H.Martin Prentice Hall 2000
2.
Natural
Language Understanding 2nd Edition Allen J ,Benjamin Cummings, 1995
1.
Foundations of Statistical
Natural Language Processing –Manning C D And Schutze The MIT Press 1999
2.
Statistical Language Learning – Charniak E MIT Press 1996