SCHOOL OF ENGINEERING & TECHNOLOGY Bharathidasan University, Tiruchirappalli SYLLABUS FOR THE INFORMATION TECHNOLOGY BRANCH FOR THE STUDENTS ADMITTED IN THE YEAR 2000 - 2001
COURSE CONTENT III SEMESTER IT031 IT032 IT033 IT034 IT035 IT036 IT037 IT038
Discrete mathematics Electrical & Electronic Circuits and Devices Data structures & Algorithms Digital Electronics Computer Organization and Architecture C Programming & Unix C Programming & Unix Laboratory Electronic Circuits Laboratory
IV SEMESTER IT041 IT042 IT043 IT044 IT045 IT046 IT047 IT048
Numerical Techniques Communication Engineering Microprocessors and Interfacing Techniques Systems Programming Database Management System Object Oriented Programming Microprocessor and Interfacing laboratory Object Oriented Programming Laboratory using C++.
V SEMESTER IT051 IT052 IT053 IT054 IT055 IT056 IT057 IT058
Probability Theory and Statistics Operating Systems Computer Networks Client Server Computing Advanced Computer Architecture Software Engineering RDBMS Laboratory Visual Programming Laboratory using Visual Basic & Visual C++
VI SEMESTER IT061 IT062
Data Communication Computer Graphics
IT063 IT064 IT065 IT066 IT067 IT068
Internet Programming Modeling and Simulation E Commerce Management Information Systems System Software Laboratory Internet Programming Laboratory
VII SEMESTER IT071 IT072 IT073 IT074 IT075 IT076 IT077 IT078
Engineering Economics & Management Graph Theory & Applications Principles of Compiler Design Multimedia Systems Artificial Intelligence and Expert systems Elective I Graphics & Multimedia Laboratory Seminar & Mini Project
VIII SEMESTER IT081 IT082 IT083 IT084 IT085
High speed Networks Distributed Computing Elective II Elective III Project work and Viva Voce
ELECTIVES ELECTIVE – I ITEL01 ITEL02 ITEL03
Image Processing Digital Signal Processing Pattern Recognition
ELECTIVE – II ITEL04 ITEL05 ITEL06
Computing with Artificial Neural Networks Natural Language Processing Speech Processing
ELECTIVE – III ITEL07 ITEL08 ITEL09
Broad Band Communication Web Technology Mobile Computing
ITEL10
Operations Research
III SEMESTER IT031 DISCRETE MATHEMATICS UNIT – 1 Mathematical Logic Statement and Notation, Connectives – Negation, conjunction , Disjunction, statement formulas and truth tables, conditional and biconditional, well - formed formulas, tautologies, equivalence of formulas, duality law, tautological implications. UNIT – 2 Set Theory Basic concepts of set theory – Notation, Inclusion and Equality of sets, the power set, some operation on sets. Relations, properties of binary relation in a set, equivalence relations. Functions – Definition and introduction, composition of functions, inverse functions. UNIT – 3 Algebraic Structures Algebraic systems : Examples and General properties – Definition and examples – some simple algebraic systems and General properties semigroups and monoids – Definitions and examples, Homomorphism of semigroups and monoids – subsemigroups and submonoids. UNIT – 4 Groups Groups : Definitions and examples, sub groups and homomorphism, cosets and Lagrange’s theorem, Normal subgroups. Algebraic systems with two binary operations. UNIT – 5 Recurrence Relations and Recursive Algorithms Recurrence Relations, Linear recurrence relations with constant coefficients, Homogeneous solutions, particular solutions, total solutions, solution by the method of generating function.
TEXT BOOKS 1.
2.
J.P. TREMBLAY and R. MANOHAR : Discrete Mathematical Structures with applications to computer science, McGraw Hill, 1975. C. L. Liu, Elements of Discrete Mathematics, McGraw Hill, 1987
REFERENCE BOOK 1.
M.A. Arbib, A.J. Kfowry and R.N.Moul, A Basis for Theoretical Computer Science, Springer Verlag, 1988.
IT032 ELECTRICAL & ELECTRONIC CIRCUITS AND DEVICES UNIT – 1 Network Analysis: Definitions, Kirchoff's Laws and their applications to the solution of network problems - Branch, loop currents - Nodes, node pair voltages - Mesh and nodal analysis - Network Topology. UNIT – 2 Networks Theorems (DC & AC Circuits): Thevenin's Theorem, Norton's Theorem, Principles of Superposition and Compensation theorem, Reciprocity Theorem and their application in the solution of network problems - Maximum Power Transfer Theorem Network Duality. Introduction , Working principle, and example of resonance circuits, Transients, and Wave filters.
UNIT – 3 Semiconductor Devices: Junction diodes, Zener diodes, Application as Half wave and Full wave Rectifiers, Filters, Zener regulators. Characteristics and configurations of BJT, FET and MOSFET Construction of CMOS. UNIT – 4 BJT & FET: Operating point of a BJT, BJT biasing - Bias stability, Fixed bias, Collector to Base bias, Self bias, CE amplifier. BJT small signal model using 'h' parameters- hybrid n model - FET bias ,CS amplifier - FET small signal model. UNIT – 5 Coupled Amplifiers and Oscillators:
Types of Coupling: Various types of coupling : Direct coupled amplifier, RC coupled amplifier , Frequency Response . BJT differential amplifier, Distortion in amplifiers. Regulators using BJT. Feedback Concepts: Types of feedback -The transfer gain with feedback -General characteristics of negative feedback amplifiers - Input resistance - Output resistance.
Feedback Amplifiers & Oscillators: Stability of Feedback amplifier. Principles of Oscillators. Various types of oscillators including Crystal Oscillator, Recent trends and developments TEXT BOOKS 1. 2. 3.
W.H.HAYT AND J.E.KEMMERLEY, Engineering Circuit Analysis, Gian, 1993. M.E.VAN VALKENBURG, Network Analysis, Third Edition, Prentice Hall Inc., 1974. J. MILLMAN and A. GRABEL, Microelectronics, Second Edition, McGraw Hill International Editions
REFERENCES 1. 2.
J.A. EDMINISTER, Electrical Circuits, Schaum's Outline Series, McGraw Hill, 1965. P.M.CHIRLIAN, Analysis and Design of Integrated Electronic Circuits, John Wiley Publishers, 1987 .
IT033 DATA STRUCTURES AND ALGORITHMS UNIT – 1 Introduction : - Overview, SPARKS. Arrays – Axiomatization, ordered lists, sparse matrices, Representation of arrays – STACKS & - QUEUES – Fundamentals, Evaluation of Expressions. UNIT – 2 LINKED LISTS : - Singly linked lists, The storage pool, Polynomial additions, more on linked lists, doubly linked lists and dynamic storage management, Generalised Lists. Garbage collection and compactions. UNIT – 3 Trees: Basic terminology, binary trees, binary tree representations, binary tree traversals, binary representations of trees, applications of trees*. Graphs: Terminology and representations, Traversals, connected components and spanning trees. Shortest paths and transitive closure.
UNIT – 4 Introduction, Analysing algorithms – Divide – And – Conquer. The general method, Binary search, Linear search, Indexed sequential search, Hash searching finding the maximum and minimum, mergesort, quicksort, selection sorting algorithm and analysis. UNIT – 5 The Greedy method: The general method, optimal storage on tapes, Knapsack problem, job sequencing with deadlines, minimum spanning tree, single source shortest paths. Dynamic programming, Backtracking – General method, the 8-Queen problem. Elementary Treatment only.
TEXT BOOKS: 1.
Ellis Horowitz, Sartaj sahni “Fundamentals of Data structures” Galgotia Book source, New Delhi.
2.
Ellis Horowitz, Sartaj Sahni “Fundamentals of computer Algorithms” Galgotia Book source, New Delhi.
REFERENCES: 1. Jean Paul Tremblay and paul. G.Soresson, “An Introduction to Data Structures with Applications “, McGraw Hill. 2. Theory and problems of Data structures – seymour Libschutxz. McGraw Hill International Editions (Schaum’s outline series) 3. Aho, Hopcroft Ullmam, “The Design and Analysis of Computer Algorithms” Addition Wesley publishing company.
IT034 DIGITAL ELECTRONICS UNIT - 1
UNIT – 2 MINI MIZATI ON OF LOGIC FUNCTI ONS:
NUMBER SYSTEMS & CODES: Review of Binary, Octal and Hexadecimal representations of numbers and their conversion. Signed numbers. Floating point number representation. Binary arithmetic. Weighted and nonweighted binary codes, error detecting & correcting codes. Alphanumeric codes. BOOLEAN ALGEBRA: Introduction to Boolean Algebra. Theorems. AND, OR, NOT, NAND, NOR & EX-OR operations, truth tables. Boolean expressions. Universal building blocks.
Sum of the products and Product of sums representations. Minimization of Boolean expressions using algebraic, K-map and Tabular method. Minimization of multiple output functions. COMBINATIONAL LOGIC CIRCUITS: Analysis of logic schematics, Synthesis of combinational functions, Multiplexers, De-Multiplexers, code converters, decoders. Implementation of combinational functions using Multiplexers.
UNIT - 3
ARITHMETIC CIRCUITS: Adder, carry lookahead adder, number complements, substraction using adders – signed number addition and subtraction – BCD adders. IC adders. FLIP-FLOP : Basic latch circuit, Debouncing of a switch, Flip-flops truth table and excitation table. Integrated circuit flip-flops. Latch timing conditions. Analysis of sequential circuits with latches, transition table, transition diagram and state table. Analysis of sequential circuit with feedback loops. Races in sequential circuits. Essential Hazards and techniques for controlling hazards.
UNIT - 4
COUNTERS: Asynchronous and synchronous counter design – down counter, general BCD counter, counter Ics, ring counter, digital clock. SHIFT REGISTERS: Serial in, serial/parallel out; Parallel in, Right/left serial shift registers. Shift counters, universal shift register. Application of shift register in keyboard entry of decimal data.
UNIT - 5
SEMICONDUCTOR MEMORIES: Bipolar inverter, DTL, TTL, ECL, IIL, and their comparison. Semiconductor memories: ROM,RAM,EPROM, EEPROM, DRAMS. External organization of semiconductor memories and timing characteristics. Flash type memories. PLA. TEXT BOOKS : 1. 2. 3.
W.H.GOTHMANN, “Digital Electronics: An introduction to theory and practice”, PHI, New Delhi, 1986. THOMAS L.FLOYD: Digital Fundamentals, 3rd edition, UBS, New Delhi, 1998. MORRIS MANO: Digital design, 2nd edition, PHI, New Delhi, 1998.
REFERENCES : 1. 2.
3.
C.G.FONSTAD, “Microelectronic Devices & Circuits”, McGraw Hill. MILLMAN & GRABEL, “ Microelectronics”, 2nd edition, McGraw Hill. HEISERMAN, “Hand book of digital IC applications”, Prentice Hall Inc, 1980.
IT035 COMPUTER ORGANISATION AND ARCHITECTURE UNIT – 1 BASIC STRUCTURE OF COMPUTERS Stored program concept – Basic operational concepts – Functional units – Machine language – concept of memory locations, addresses – Addressing modes, Instruction formats- Instruction execution – I/O programming – Stacks – Subroutines. Processing unit: Internal BUS structure (Single bus, Two bus, & Three bus) –Execution of instructions – control step sequence.
UNIT – 2 CONTROL DESIGN Hardwired control – design methods – multiplier control unit – CPU control unit. Microprogrammed control – Microinstructions – Sequencing – Prefetching. UNIT – 3 ARITHMETIC OPERATIONS IN A COMPUTER Addition & Subtraction of positive & negative numbers – fast adders – multiplication of positive numbers – signed operand multiplication – fast multiplication – integer division – floating point numbers and operations. Design of Arithmetic unit. UNIT – 4 MEMORY ORGANISATION Basic concepts – Semiconductor RAM,ROM, memories – Memory interleaving – cache memories – virtual memories. UNIT – 5 INPUT-OUTPUT ORGANISATION I/O addressing – Data transfer – synchronization – Interrupt handling – I/O interfaces – I/O channels. TEXT BOOKS 1.
V.C.Hamacher, Z.G.Vranesic and S.G. Zaky, “Computer Organisation”, Second edn., McGraw Hill, 1988.
2.
J.P. Hayes, “Computer Architecture and Organisation” 3rd edn., WCB/McGraw Hill, 1998.
REFERENCES
1.
W.Stalling, “Computer Organisation and Architecture”, 2nd edn., Prentice Hall of India,1990.
2.
A.S. Tanenbaum. “Structured Computer Organisation” 3rd edn. Prentice Hall of India, 1983.
IT036 C PROGRAMMING & UNIX UNIT – 1 History of C – Structure of C program – Character set – C tokens (Keywords, identifiers, constants, strings operators and special symbols) – Data types – Declaration and Assigning of variables – operators and expressions – Precedence of operators – typecasting and conversion in expression – I/O function – Header files.
UNIT – 2 Decisions making – Branching – looping statements – Arrays (One dimensional & 2 dimensional) – string handling – function (user defined, built-in) recursive function – storage class – Preprocessor statements. UNIT – 3 Structures – Unions – Pointers using arrays, strings, functions, structures – pointer to pointer – call by value – call by reference – Dynamic memory allocation (malloc, calloc, free, sizeof) – file management. UNIT – 4 Introduction to Unix Operating System – features of Unix system – multi-user multiprocessor, background, foreground-logging in, logging out and other basic commands – using the file system: working with file, file permissions, file security and directories – using the : C Shell, Bourne shell, Kernal shell – Vi editor and its commands. UNIT – 5 Filters - pipes – shell programming – shell procedures – shell variables – control structures – shell functions – electronic mail.
TEXT BOOKS: 1.
B.Gottfried, “Programming with C” Schaum series, Tata McGraw Hill, 1996.
2.
E. Balagurusamy, “Programming in ANSI C” Tata McGraw Hill, 2nd edn, 1995.
REFERENCES: 1. B.W. Kernighan and Ritchie, “The C Programming Language” PHI
2. S.DAS, “UNIX Concepts and applications” Tata McGraw Hill, 2nd Edition, 1998. 3. Stephen G. Kochan and Patrick H. Wood, “Exploring the UNIX System” Heyden Books, 2nd Edition.
IT037 C PROGRAMMING & UNIX LABORATORY
1.
Programs on arithmetic operations. Like simple and compound interest, Celsius to Fahrenheit conversions etc.
2.
Programs on control structures. Like roots of quadratic equations, sine, cosine series etc.
3.
Programs on arrays manipulation. Like matrix addition, matrix multiplication, symmetric matrix etc.
4.
Programs on strings manipulation. Like palindrome, pattern searching etc.
5.
Programs on functions and recursive functions. Like factorial of a number, towers of Hanoi, generation of fibonacci series.
6.
Programs on pointers. Like sorting and searching etc.
7.
Programs on files and dynamic memory allocation. Applications like payroll processing, student details etc.
8.
Study of basic UNIX commands and editors.
9.
Study of UNIX filters like grep, awk etc.
10.
UNIX shell programming. To decide the maximum computer time to be allotted for a user. To decide the maximum page print outs an user can take. To restrict the data storage space. To write house keeping routines (to remove unwanted files based on the last date to access)
11.
Writing a C program to implement UNIX commands like cat, cp, etc.
12.
Writing a C program to implement grep, sed, etc.
IT038 ELECTRONIC CIRCUITS LABORATORY
1.
Characteristics of semi-conductor diode and zener diode.
2.
Half-wave, Full-wave and Bridge rectifier circuits without and with filters – calculation of ripple for varying loads.
3.
Truth table for AND, OR, NAND,EX-OR, Half adder, full adder.
4.
Zener as shunt regulator study. Stability of system for varying in font voltages and loads.
5.
Single stage transistor CE amplifier design study of gain and frequency response.
6.
Two stage transistor CE amplifier- design, study of gain and frequency response. Study of gain and frequency response for change in coupling capacitance.
7.
Common collector amplifier and phrace splitter using transistor.
8.
Transistor as a switch – design and check response to LDR/Fulse.
9.
Weinbridge oscillator, RC coupled face shift oscillator to check the condition for oscillation, monitor the face at the appropriate points.
10.
Hartley, colpitts and relaxation oscillators. Generation of square wave using crystal and gates.
11.
FET as a voltage controlled resistor.
12.
Power supplies (a) using base regulated power supplies. (b) using three pin regulators (c) using 723.
13.
Measure the (a) Input bias current. (b) Input offset current. (c) Input offset voltage. (d) slow rate of the gives OP Amp.
14.
Voltage controlled amplifier using differential amplifier circuit.
15.
Use of 555 in a stable, monostable and bistable mode.
16.
Study for the three fixed terminal (78052 7905 regulator, load regulator, line regulator) and observe its short circuit protection property.
17.
OP amp as an inverting, non-inverting and summing amplifier. Study of frequency response and gain.
IV SEMESTER IT041 NUMERICAL TECHNIQUES UNIT – 1 Transcendental, Polynomial and equations – iteration method based on second degree equation – Rate of convergence – Iteration methods – method for complex roots – Polynomial equations. UNIT – 2 System of linear algebraic equations and Eigen value problems – Direct methods – Triangularisation, Cholesky and partition methods – Error analysis – Iteration methods – eigen values and eigen vectors – Jacobis method, Given’s method, Rutishaugher method and power method. UNIT – 3 Interpolation and Approximation – Hermite Interpolations – Piecewise and splene interpolation – Bivariate Interpolation – Approximation – Least squares approximation – Uniform approximation. UNIT – 4 Differentiation and integration – Numerical Differentiation – Partial Differentiation – Numerical Integration methods based on undetermined co-efficients – Double Integration. UNIT - 5 Ordinary differential equations – Numerical methods – Single step methods – Multi step methods – Predictor – Corrector methods.
TEXT BOOKS: M.K.Jain, S.R.K.Iyengar and R.K. Jain – Numerical methods for scientific and engineering computation (third edition) Wiley Eastern Limited, 1987
IT042 COMMUNICATION ENGINEERING UNIT – 1 Methods of electromagnetic wave propagation – Frequency spectrum. Modulation Techniques (Principles only) Need for modulation – Amplitude and angle modulation (FM & PM) – Mathematical equations – Spectra – side bands – Bandwidth - Power relations – Modulation index – Phasor diagram – Comparison of AM, FM and PM – SSB – Advantages – Sampling theorem – Analog pulse modulations – PAM and PTM (PPM and PDM or PWM) Digital pulse or coded modulations – PCM, PDM – Properties like spectra, waveforms. BW and SNR – CW modulation for digital signals – ASK, COK, FSK, PSK multiplexing systems for pulsed and CW modulations – TDM and FDM – Comparison of features and merits.
UNIT – 2
Modulation methods or Modulators Generation of AM waves – Linear modulations, Collector, base and Emitter modulation – Square – Law modulations: Diode and balanced modulators – Suppression of carrier – SSB generation methods – Generation of FM waves – Reactance modulator method (direct method) – Armstrong method (Indirect method) – Conversion FM to PM and PM to FM waves – Generation PAM, PPM and PWM waves – Conversion of PWM wave to PPM wave.
UNIT – 3
Demodulation methods or detectors Demodulation of AM waves – Linear detectors; Synchronous and envelope detectors Performance comparison. Demodulation of FM waves – Slope detector – Balanced slope detector – Foster-Seely discriminator – Ratio detector – Demodulation of PAM, PPM, PWM, PCM, PDM waves – Errors.
UNIT – 4
Communication System Transmitters and receivers – Class C RF amplifier – Class B pushpull linear amplifier – Low level and high level modulation systems – Their comparison – AM transmitter – SSB transmitter – ISB transmitter – FM transmitter – Direct and Armstrong transmitter – Straught receiver (TRF) superheterodyne AM receiver – Communication receiver – SSB receivers – Diversity reception – FM receivers.
UNIT – 5 Communication services (Elementary treatment only) Radar: Basic radar system – Radar range equation – Pulsed radar systems. Television: Picture elements – Transmission and reception of picture information – Motion picture – Horizontal and vertical scanning frequencies – TV transmitter – TV receiver – TV channels – Satellite communication – Read – orbit – Satellite altitude – Transmission path – its loss – Satellite system.
Fibre optical communication: Need – Principles of light transmission in a fiber – Optical fiber communication system – Optical fiber – Light sources – Photo detectors – Advantages. TEXT BOOK
1. 2.
Communication Electronics – Deshpande, N.D., etal., Tata McGraw Hill Publishing Co Ltd., 1989. Electronics of communication systems – Kennedy McGraw Hill
REFERENCES 1. Principles of communication engineering – Anokh singh S. Chand & Co., 1991. 2. Electronic communications – Roddy, D and Coolen. J. Prentice Hall of India P. Ltd., 1987.
IT043 MICRO PROCESSORS & INTERFACING TECHNIQUES UNIT – 1 INTRODUCTION TO 8085 MICROPROCESSOR 8085 Microprocessor Architecture, Bus organization, Registers, ALU, control section, instruction set of 8085, Instruction format, Addressing modes. Types of Instructions. UNIT – 2 ASSEMBLY LANGUAGE PROGRAMMING AND TIMING DIAGRAM Assembly language programming in 8085, Macros, Labels and Directives. Microprocessor timings, Micro instructions, Instruction cycle. Machine cycles, T states. State transition diagrams, timing diagram for different machine cycles. UNIT – 3 SERIAL I/O, INTERRUPTS AND COMPARISON OF CONTEMPORARY MICROPROCESSORS. Serial I/O using SID, SOD, Interrupts in 8085, RST instructions. Issues in implementing interrupts, Multiple interrupts and priorities, Daisy chaining, Interrupt handling in 8085, Enabling, disabling and masking of interrupts. Brief comparison of contemporary 8-bit microprocessors like Z-80, M68000 with 8085. UNIT – 4 DATA TRANSFER TECHNIQUES Data Transfer Techniques, Programmed data transfer, Parallel data transfer using 8155. Programmable parallel ports and handshake input/output. Asynchronous and Synchronous data transfer using 8251A. Programmable interrupt controller 8259A. DMA transfer, cycle stealing and burst mode of DMA, 8257 DMA controller. UNIT – 5 MICROPROCESSOR INTERFACING TECHNIQUES Interfacing memory and I/O devices, Addressing memory, interfacing static RAMs, Interfacing and refreshing dynamic RAMs, Interfacing a keyboard, interfacing LED and seven segment displays, Interfacing a printer, Interfacing A/D converters, D/A converters. TEXT BOOKS
Unit 1,2 & 5
-
“Fundamentals of Microprocessors and Micro Computers” by B.RAM, Dhanpat Rai & Sons, 1996.
Unit 3
-
“Introduction to Microprocessors Software, Hardware Programming” by Lance A. Leventhal, PHI.
Unit 4
-
“Microcomputer System. The 8086/8088 family Architecture programming and design “ by Yu Cheng Liu and Glenn A.Gibson, PHI
REFERENCE 1. R.S. Govankar,”Microprocessor Architecture, Programming and applications with the 8085/8080A”, Wiley Eastern Ltd., Second Edition, 1986 2. A.H. Muhopadhyay, “Microprocessor Based Laboratory Experiments and Projects” Wheel Publishing 1997.
IT044 – SYSTEMS PROGRAMMING UNIT – 1 Machine structure, Machine Language, Assembly Language: General Machine structure – Machine Language – Assembly Language- Overview and examples. UNIT – 2
Assemblers: General Design Procedure – Design of an assembler – Table Processing. UNIT – 3
Macro Language and the Macro Processor: Macro Instructions - Features of a macro facility – Instruction arguments, conditional expansion, Macro calls within macros – Macro Instructions defining macros – Implementation: Two-pass , single-pass algorithms, macro calls within macros, macros within an assembler. UNIT – 4
Loaders: Loader schemes – Compile and go, General, absolute, subroutine linkages, Relocating loaders, Direct - linking loaders, Direct linking loaders – Binders , linking loaders, overlays. Design of an Absolute loader, Direct linking loader. UNIT – 5
Programming Languages: Features of high level languages, Data types and Data structures, Storage allocation and scope, Accepting facility, Functional modularity, Asynchronous operation, Extensibility and compile – time macros. Compilers: Statement of the problem: Recognizing Basic elements, syntactic units, Intermediate form, Storage allocation, code generation, general model of a compiler. TEXT BOOK: 1.
John J DoNovon - “Systems Programming” – Tata McGraw Hill. (Chapters 2,3,4,5,6 & 8)
REFERENCE: 1.
“Systems Programming” , Dhamdheere.
IT045 DATABASE MANAGEMENT SYSTEM UNIT – 1 Introduction to Database systems, Overview, File systems versus a DBMS, Describing and storing Data in a DBMS, Queries in a DBMS, Concurrent Access and Crash Recovery, Structure of a DBMS, Advantages of a DBMS, the Relational Model, Relations, Integrity Constraints, Enforcing integrity Constraints, Query Languages. Relational Algebra and Calculus, Preliminaries, Relational Algebra, Relational Calculus, Expressive Power of Algebra and Calculus – Data Models – Normalization. UNIT – 2 SQL : The Query language. The form of a Basic SQL Query, UNION, INTERSECT and EXCEPT, Nested Queries, introduction to Nested Queries, Correlated Nested Queries. Set Comparison Operators, Aggregate Operators. The GROUP BY and HAVING clauses. Null Values, Comparisons using Null values, logical connectives AND, OR and NOT, impact on SQL constructs, Outer Joins, Disallowing, Cursors, Basic cursor definition and usage, Properties of cursors, Dynamic SQL. Queries in complex integrity constraints, constraints over a single Table, Domain Constraints, Assertions : Ics over Several tables. UNIT – 3 SECURITY, VIEWS AND SQL : Introduction to Database security, Views, Destroying Altering Tables and views, Queries on Views, Update on views, Access control, Grant and Revoke on views and Integrity constraints, Mandatory Access control, Multilevel Relations and Polyinstantiation, Convert channels, DOD security levels, Additional issues related to security, Role of the Database Administrator, security in statistical Data base, Encryption. QUERY_BY_EXAMPLE(QBE) Introduction, Basic QBE Queries, Other features: Duplicates, Ordering Answer, Queries over Multiple relations, Negation in the Relation name column, Aggregates, The conditions Box, AND OR Queries, Unnamed columns, Updates, Restrictions on Update commands, Division and Relational Completeness. UNIT - 4 EVALUATION OF RELATIONAL OPERATORS Introduction to Query processing, Access paths, Preliminaries : The Selection operation, No index Unsorted data, No index sorted data, B+ Tree index, Hash index, equality selection. General selection conditions, CNF and Index matching, selections without disjunction, selection with disjunction, The projection operation, Projection based on sorting, Projection based on Hashing, sorting versus hashing for projections, use of indexes for projections. The join operation, Nested loops join, sort-merge join, Hash – join General join conditions. The set operations, sorting for Union and Difference, Hashing for Union and difference, Aggregate Operations, Implementing Aggregation by using an index, The impact of Buffering. UNIT – 5 TRANSACTION MANAGEMENT Recovery – Concurrency – Security – Optimization – Type inheritance – Distributed Databases – Decision support – Temporal databases – Logic based Databases. Text Books : 1. “Database Management Systems” Raghu Ramakrishnan – McGraw Hill International editions – 1998. 2. “An Introduction to Database systems”.C.J. Date – Seventh Edition 3. “Fundamentals of Database Systems”,R. Elmasri and S.B. Navathe, The Benjamin / Cumming Pub.Co.-3rd Edition – 2000.
Reference Books: 1. “Introduction to Database System” Bipin Desai – Galgotia publications Ltd., 2. “Database system concepts”, Abraham siberschatz, Henry F.Korth S. Sudarshan – 3rd Edition - McGraw Hill International Edition.
IT046 OBJECT ORIENTED PROGRAMMING
UNIT – 1 Principles of Object Oriented Programming – S/W evolution – OOP paradigm – Basic concepts of OOP – Benefits of OOP – Object oriented languages – Applications of OOP. UNIT – 2 Introduction to C++: Tokens – keywords – Identifiers – Variables, Operators, manipulators – Expressions and control structures – Functions in C++ - Main function prototyping – Call by reference – Return by reference – Function overloading – Friend and Virtual functions. UNIT – 3 Class and objects – Constructors and Destructors – Operator overloading – Type conversions. UNIT – 4 Inheritance – Single inheritance – Multilevel inheritance – Hierarchical inheritance – Hybrid inheritance – Pointers – Virtual functions – and Polymorphism. UNIT – 5 Managing console I/O operations – Working with files – Classes for file stream operators – Opening and closing a file. – End of file detection – File pointers – Updating a file – Error handling during file operations – Command line arguments – Templates and exception handling – Class templates, function templates – Template arguments – Exception handling. TEXT BOOKS: 1..
2.
C. Balagurusamy, “Programming in ANSI C” Tata McGraw Hill, 2nd Edition, 1995. C. Balagurusamy, “Object Oriented Programming with C++”, Tata McGraw Hill, 1995.
REFERENCES : 1.
Herbert Schildt – Teach yourself C++ - Tata McGraw Hill.
2.
Robert Lafore –Object Oriented Programming in Turbo C++ - Galgotia.
IT047 MICROPROCESSOR & INTERFACING LABORATORY DIGITAL LAB Design and implementation of combinational circuits and sequential circuits, Multiplexer, demultiplexer, Encoder, Decoder, Counters, Shift registers, Magnitude comparator etc. MICROPROCESSOR LAB 1.
2.
3.
4. 5. 6. 7. 8. 9. 10. 11. 12.
Write a program to load A,B,C and D register with the same constant (say 14). Try to optimize the program in such a way that the smallest number of types are used. Test the program in single step mode. After each step test the register of interest. Let 4 bytes of data be stored at consecutive memory locations starting at location X. Write a program which loads register E with (X), (E (X), D with (X + 1), E with (X + 2) and A with (X + 3). (a) Use direct addressing (LDA) mode. (b) Use register indirect addressing. (c) Compare (a) and (b) in terms of memory requirement: Test program in single step. 2 types of data are stored at consecutive memory locations X and X+1. Write a program which moves the data from X and X+2 to another location Y and Y+1. Test the program in sum mode and check detra memory location Y and Y+1 after execution use (a) Direct addressing (b) Indirect addressing (address X and X+1 being specified by a double register) Write a program which test bit 5 of 1 byte of data stored at location X. Write FF into X+1 if bit 5=0 and write 00 at the location of bit 5=1. Write a program which tests the zero condition of a data byte specified at location X. Store 00 at location X+1 if the byte is zero and FF it is non zero. Repeat the problem to test all one condition. Interchange two data byte stored at locations X and Y using indirect addressing. Compute the sum of two binary number stored at locations X and X+1 and store at location X+2. Ignore overflow. Using indirect addressing compute the sum of four unsigned binary numbers stored at consecutive memory locations starting at X. Store the result at a location Y. Two unsigned binary number are stored at consecutive data memory locations. Write a program for computing (X+1) – (X). The magnitude of computing should be stored at Y and the sign at Y+1. If sign is positive 00 is stored at Y+1 else 01 is stored at Y+1. A double precision number (A 16 bit unsigned number) is stored at X and X+1. (Low order, byte at X). Another double precision number is stored at Y and Y+1 add the two numbers and store the result in w and W+1. Two 2-digit BCD numbers are stored at consecutive memory location X and X+1. Write a program for computing the sum and store the result ignoring overflow, if any, at location Y. A binary number is stored at a memory location. Find the number of logical 1’s and store the count at a location.
13. 14. 15. 16. 17. 18. 19. 20. 21. 22.
A counter can be defined as a register, double register or memory location whose content gets incremented or decremented. Define such a counter as subroutine. Write a program for the generation of 2 different time – delays using the source subroutine. Find the largest of N numbers stored at consecutive memory locations starting at X. Rearrange N numbers located at consecutive memory locations starting at X.. Stepper Motor interface. A/D and D/A interface. Relay driver. Wave form generation. Digital IC testing. Interrupt driver clock. Serial communication between 2 bits.
IT048 OBJECT ORIENTED PROGRAMMING LABORATORY USING C++
1.
Programs using Functions
2.
Programs using Object
3.
Programs using classes
4.
Usage of Function and Polymorphism
5.
Programs for Operator Overloading
6.
Usage of Constructors and Destructors
7.
Demonstration of Inheritance
8.
Working with files.
9.
Usage of templates
10.
Usage of exception handling.
FIFTH SEMESTER IT051 PROBABILITY THEORY AND STATISTICS UNIT – 1 Probability – Random events – Sample spaces – Axiomatic approach to probability -Conditional Probability – Addition and Multiplication theorems – Baye’s Theorem UNIT – 2 Random variables – Discrete and continuous random variable – Probability density functions – Distribution functions – Marginal and conditional probability distribution functions. UNIT – 3 Mathematical Expectations – Variance – Moment Generating Functions – Correlation coefficients - - Regression. UNIT – 4 Discrete Distributions, Binomial and Poisson distributions – Moments – additive properties and limiting forms. Continuous distributions. Exponential and Normal distributions- Moments and other properties UNIT – 5 Concept of sampling – Types of sampling – Sampling distributions and standard error – tests of hypothesis – Tests of means and variance for large and small samples – Chi square test and its applications – Tests of goodness of fit – test of independence of attributors. TEXT BOOKS: 1.
Guptha S.C., and Kapoor V.K., - Fundamentals of Statistics – Sulthan chand and sons.
2.
Trivedi K.S., - Probability and Statistics with reliability, queuing and computer science applications – Prentice Hall of India.
REFERENCES Bajpai, A.C., - calus I.M. and fairdy J.A. –Statistical methods for Engineering and Scientists – John Wiley and sons
IT052 OPERATING SYSTEMS UNIT – 1 Generations and History of operating system – Performance factors utilization – throughput Response time – Multiprogramming and time sharing concepts – Process states – State transitionPCB – Suspect and Resume – Interrupt processing – Job and processor scheduling levels, objectives and criteria for scheduling – Pre-emptive and non-pre emptive scheduling – Interval timer – Priorities – Deadline scheduling FIFO – round Robin – Quantum size – SJF – HRT scheduling – Multilevel feedback queries. UNIT – 2 Storage organization – Management strategies – Contiguous & non-contiguous storage allocation – Fixed partition Multiprogramming – Variable partitions – Swapping. Virtual storage, Multilevel organization, Block mapping, page segmentation, paging/segmentation systems – page replacement – Locality working sets – Demand paging – Anticipatory paging – page release – page size – program behaviour under paging. UNIT – 3 File systems, Data hierarchy, Blocking and Buffering, File organization, Queued and basic access methods – File characteristics – File system – Allocation and freeing space, file descriptor – Access control matrix – User classes – Back up and recovery – Data base systems -. Security password protection – Security Kernels – OS penetration. Disk scheduling – seek optimization – Rotational optimization – System considerations. UNIT – 4 Parallel processing – Parbegin – parend – Mutual exclusion – Critical section – Implementing mutual exclusion primitives – Dekker’s algorithm - Test and set instruction – Semaphores – Process synchronization with semaphores – Producer consumer relationship – Counting
semaphores – Communication between computers – Elements of computer networks – Network operating systems. UNIT – 5 Monitors – Resources allocation with monitors – Ring buffer – Readers and writers – Ada – Multi tasking – Rendezvous – Accept - producer –consumer- Select – Deadlock conditions – Prevention – avoidance - bankers algorithms – Detection and Recovery – performance measurement – monitoring and evaluation – UNIX operating systems – Basic and file permissions – directory – hierarchy – piping – filtering – shell variable – shell programming – system utilities – Introduction to LINUX. TEXT BOOKS: 1.
An Introduction to Operating Systems, Harvey M.Deital-Addison-Wesley Publishing company – Revised edition, 1984.
REFERENCE BOOKS: 1.
Operating Systems Concepts – James L.Peterson, Abraham Silberschatz, Addison Wesley Publishing Co., Second edition, 1985.
2.
Operating systems – S. Tanenbaum.
3.
Milen Milen Kovic – Operating systems concepts and design – McGraw Hill, ISE 1987.
4.
M.Bach – Design of Unix Operating Systems – Prentice Hall of India, 1988.
IT053 COMPUTER NETWORKS UNIT – 1 Computer networks – Applications – Line configuration – Topology – Transmission Modes – categories of Network: LAN, MAN, WAN – OSI Layer PHYSICAL LAYER : Signals – spectrum – bandwidth of analog / digital signals – signal encoding – DTE-DCE interface – Transmission media – Multiplexing : FDM, TDM DATALINK LAYER : Error Detection – Error correction – Line discipline Flow control : stop-wait protocol and sliding window protocol Error control : ARQ, Go-back-n ARQ, selective-reject ARQ. Data link protocols : Asynchronous protocols – synchronous protocol : character oriented – bit oriented protocols – HDLC. LIC, MAC, PDU MAN : DQDB-SMDS UNIT – 2 NETWORK LAYER : Circuit switching – packet switching – message switching – connection oriented and connectionless services. Routing algorithms – congestion control algorithms – internetworking – Routers and switches – introduction to Firewall. UNIT – 3 Transport Layer : Duties of transport layer, primitives Session layer : duties of session layer – session protocol data unit Presentation layer : Encryption / decryption – data compression Application layer : FTP, SMTP, Telnet, Remote-login, SNMP, WWW.
UNIT – 4 LAN: Protocols : Ethernet – Token Ring – Token Bus – FDDI – Addressing and Frame format – Bridges. LAN security : Types of threats – levels of security. Case study : Novell Netware Wireless LAN : need – components – receiving devices – advantages & disadvantages UNIT – 5 TCP/IP Networking : TCP/IP Architecture – structural overview – Inter networking model – Protocol evolution – Division of functions – Network characteristics – Implementation characteristics – Network addressing and Routing : Datagram Header – IP address space – Basic routing consideration – Hardware addressing – Common interior Gateway Protocols – Internet control Message Protocol. Transport Layer : Data flow, ports, sockets – user Data gram protocol – Transmission control protocol - TCP Header – connection establishment and termination – TCP Reliable Delivery & Flow control – Applications and Services : Domain name system – Remote Logon – Mail Exchange – File Transfer – Remote Procedure Call – Remote File Access – Security – Window system. Text Books : 1. 2.
Unit – I,II – “Computer Networks” – III edition – Anderw S. Tanenbaum – PHI Unit – III – “Introduction to data communication and Networks” – Behrouz Forouzan – Tata mcgraw Hill 3. Unit – IV – “Local Area Network” – 5th Edition – S.K. Basandra & S. Jaiswal – Galgotia Publications Ltd., 4. Unit – V – “ TCP/IP Networking” David M. Peterson – McGraw Hill International Reference Books : 1. 2.
“Data and Computer communication” – William Stallings – PH “Data Networks” – Black - PHI
IT054 CLIENT / SERVER COMPUTING UNIT – 1 Introduction to Client/Server computing-Main Frame-Centric Client/Server computingDownsizing and Client/Server computing – Client/Server development tools-advantages of Client/Server computing-Connectivity-User Productivity-Reduction in network traffic-Faster delivery of Systems. UNIT – 2 Components of Client/Server applications-The Client – The role of the client - Client servicesRequest for service-Dynamic data exchange (DDE)-Object linking and embedding (OLE)Common Object Request Broker Architecture (CORBA). UNIT – 3 Components of Client/Server applications – Role of the server-Server functions – Network operating systems-Novell Netware-LAN manager – IBM LAN server-Banyan VINES-PC Network file service – Server operating systems: Netware, OS/2, Windows NT, Unix – System application Architecture (SAA)
UNIT – 4 Components of Client/Server architecture- Connectivity – Open systems interconnect (OSI) – Inter – process communication – interface technology-Wide area network technology – Client/Server systems development software – Platform Migration and Reengineering of Existing Systems- Client Server system development methodology – Client server systems development hardware – PC level processing units – Unit Workstation – server hardware – Mirrored disk – RAID – Disk array – CD-ROM-WORM – Network interface cards (NIC). UNIT – 5 Client/Server systems development – Service and support – System administration – Availability – Reliability – Serviceability – Performance – Network management – Remote systems management – Security – LAN and network management – Client server systems development – training – training advantages of GUI applications – system administrator training – LAN administration – WAN issue – Operating systems issues – Application issues – database administrator training – End user training. Text Book : 1. “Client / Server Computing”, Patrick Smith and Steve Guengrtich, - Prentice Hall of India, Second Edition, 1997. Reference Books : 1. “Client Server Computing”, Dewire and Dawana Travis - MC Graw Hill, 1993. 2. “Guide to Client / Server Databases” – Joe Salemi – Ziff – Davis Press – California.
IT055 ADVANCED COMPUTER ARCHITECTURE UNIT - 1 ARCHITECTURE AND INSTRUCTION SET OF 8086/8088 PROCESSORS Register organization of 8086 – architecture – signal description – physical memory organization – Bus operation – I/O addressing capability – minimum and maximum mode – 8088 processor. Machine language instruction format – addressing modes of 8086 – instruction set of 8086 /8088 – assembler directives and operators. UNIT - 2 SPECIAL ARCHITECTURAL FEATURES AND ASSEMBLY LANGUAGE PROGRAMMING
Introduction to stack – stack structure of 8086/8088 – interrupts and interrupt service routines – interrupt cycle – non maskable interrupt , maskable interrupt, interrupt programming, Macros, timings and delays. Machine level programs – machine coding – programming with an assembler – assembly language programming. UNIT – 3 BASIC PERIPHERAL INTERFACING WITH 8086/8088 Semiconductor memory interfacing – dynamic RAM interfacing – I/O port interfacing – PIO – 8255 – A to D converters – D to A converters – stepper motor – control of high power devices. UNIT – 4 ARCHITECTURE OF 32 BIT MICROPROCESSORS AND PENTIUM PROCESSORS Features of 80386 – architecture and signals of 80386 – register organization – addressing modes – data types – real and protected modes – segmentation – paging – virtual mode – enhanced instruction set – Co-processors 80287, 80387, 80487. Features of PENTIUM – Architecture of Pentium – instruction set – MMX architecture – MMX data type – wrap around and saturation arithmetic – MMX instruction set – Pentium Pro – Pentium II and Pentium III – Introduction to Micro controllers 8051. UNIT – 5 APPLICATIONS OF MICROPROCESSORS Electronic weighing bridge – Pattern scanner system – Aluminium Smelter control – other applications such as telephone call metering , cash counter, Automatic fuel charge meters (Petrol Bunks) etc.. TEXT BOOK: “Advanced Microprocessors and Peripherals – Architecture, programming and interfacing” by AK Ray and KM Bhurchandi, Tata McGraw Hill Publishing Company limited, New Delhi, 2000. Chapters: 1, 2, 3, 4, 5, 10, 11, 15, 14, 13.
IT056 SOFTWARE ENGINEERING UNIT – 1 Planning a Software Project & Cost estimation The evolving Role of software – Software characteristics – Software components – Software applications - Introduction to software Engineering - Software life cycle model – size factors – Quality & productivity factors – Managerial issues – Defining the problem – Developing a solution strategy – Planning the Development Process – Planning an organizational structure – other planning activities – Introduction to software cost factors – software cost estimation techniques – staffing level estimation – Estimating software maintenance costs.
UNIT – 2 Software requirements, Specification & Software Design concepts The software requirements specifications – Formal specifications techniques- Languages and Processors for requirements specifications – Database requirements – Fundamental Design concepts – Modules & Modularization criteria – Design notations – Design techniques – Data flow oriented design – Data structure oriented design – Object oriented design – Detailed design considerations – Real time & Distributed system design – Test Plans – Milestones – Walk throughs & Inspections – Design guidelines. UNIT – 3 Implementation Issues, Testing & Maintenance Structured Coding techniques – Coding style - Standards & Guidelines – Documentation guidelines – Enhancing maintainability during development – Managerial aspects of software maintenance – Configuring management – Source code Metrics – Other Maintenance tools & Techniques – Software testing fundamentals – Test case design – White box testing – Basis path – Control structure testing – Black-Box testing – Testing for specialized environments – Unit testing – Integration testing – Validation testing – System testing The art of debugging. UNIT – 4 Risk Management & Software quality assurance Reactive Vs Proactive risk strategies – Software risks – Risk identification – Risk Projection – Risk mitigation, Monitoring & Management, Safety Risk Hazards, The RMMM plan, Quality concepts – The quality movement – Software assurance – Software reviewes – Formal technical reviews – Formal approach to SQA – Statistical quality assurance – software reliability – The SQA plan – The ISO 9001 quality standards. UNIT – 5 Software Re-Engineering, Client/ Server Software Engineering CASE: Source Code translation – Program restructuring – Data Re-Engineering – Reverse Engineering – Structure of Client/ Server systems – Software Engineering for Client/ Server systems- Testing issues – CASE – CASE tools – Integrated CASE – CASE life cycle. TEXT BOOKS: 1. 2. 3. 4.
R.S.Pressman, Software Engineering – A Practitioner’s approach, McGraw Hill International Editions, Fourth Edition, 1997 Richard Fairly, Software Engineering concepts, McGraw Hill International Editions 1997 Ian Sommerville, Software Engineering, AWL, Fifth edition, 1999 Stephen R. Schach, Software Engineering with JAVA, TMH, 1998
IT057 RDBMS LABORATORY Problems such as, 1.
Creating a database, simple queries.
2.
Uses of select statement for queries using.
(i) (ii) (iii)
AND, OR, NOT operation Union, Intersection, Projection and Join operations Sorting and grouping
3.
Nested queries using SQL.
4.
Built-in functions of SQL.
5.
Update operations using SQL.
6.
Use of SQL forms.
7.
Use of indexes, creating views and querying in views..
8.
Embedding SQL with C.
9.
Library information system.
10.
Student evaluation system.
11.
Computerized quiz.
12.
Computer center reservation of computing machines.
13.
Income tax calculation.
14.
Pay roll system.
15.
Election processing system.
IT058 VISUAL PROGRAMMING LABORATORY USING VISUAL BASIC & VISUAL C++
Both in Visual Basic & Visual C++ 1.
A simple Calculator
2.
Text boxes and Picture Boxes
3.
Magic Squares using Grid Control
4.
Sorting and Searching
5.
Library management systems using backend databases
6.
Displaying all types of picture file contents using file, directory, drive and Image box controls.
7.
Creating active X control like calendar, about box, registration box etc.,
8.
Creating Pictures and Animations.
SIXTH SEMESTER
IT061 DATA COMMUNICATION UNIT – 1 Data communication model, Data communication networks, protocols – Standard and making organizations – Radio frequency allocation - Use of analog signal to transmit digital data – data rate and channel capacity – transmission media – guided media – twisted pair, coaxial, optical fibre – unguided media – radio frequency allocation, terrestrial microwave satellite communication – cellular telephony – performance. UNIT – 2 Encoding and digital data communication techniques – asynchronous and synchronous transmission – digital to digital encoding – unipolar, bipolar and polar, comparison of bit/baud for various keying technique. ASK, PSK, FSK,QAM types of errors and detection, redundancy, VRC,LRC,CRC techniques – error correction – forward and backward error correction – single bit and multi bit error correction – hamming code. UNIT - 3 Interfaces and modems – Digital data transmission – parallel and serial DTE/DCE interface date terminal equipment, data circuit terminating equipments – standards EIA 232 interface - other interface standards – EIA 449, EIA 530, X.21, Modems, transmission rate, Modem standards. UNIT – 4 Data link control : need for data link control – link discipline, ENQ/ACK, flow control stop and wait sliding window protocol, error protocol, ARQ, Stop and wait ARQ, Sliding window ARQ protocols: Asynchronous and synchronous communications – BSC frames – data transparency – bit oriented protocols- HDLC frames – link access procedures. UNIT – 5 Multiplexing : Types of multiplexing – advantages of multiplexing – Frequency division multiplexing – time division multiplexing – Synchronous TDM – statistical TDM – asynchronous TDM – inverse multiplexing – telephone systems – common carrier service and hierarchies – analog service and digital service. TEXT BOOKS: 1.
Data communication and networking - by Behroruz Forouzan, TMH-1999
2.
Principles of Data Communication – Prakash Guptha, PHI – 1999
3.
Data Communication – William Schewber
4.
Data and Computer Communications – Stallings, PHI – 4th Edition.
IT062 COMPUTER GRAPHICS
UNIT – 1 Introduction to Computer graphics – Display devices – Hardcopy devices – Interactive input devices – Display processors – Graphic adaptors – basic function – Monochrome adaptor, video monitors – graphic software –Output primitives – Line and Circle drawing algorithms – Attributes of output primitives . UNIT – 2 Two dimensional transformation - Clipping and Windowing – Clipping algorithms – Segmented display files – Display file compilation – Modeling and modeling transformation. UNIT – 3 Interactive dimensional concepts – Physical devices – Logical classification of input devices – Interactive picture construction techniques – Input functions UNIT – 4 Three dimensional concepts - Methods of 3D representation – 3D transformations – Viewing – 3D clipping – Hidden – Surface and Hidden line elimination – Shading and coloring methods – Basic modeling concepts and modeling methods UNIT – 5 Computer graphics applications – CAD/CAM , Image processing VLSI, Games, Graphs and charts Animation – Introduction to Graphics and Kernal system (GKS) – binding language for GKS – Programming examples using GKS, PHIGS. TEXT BOOK: 1.
Donald Hearn and Pauline Baker Computer Graphics, Prentice Hall, New Delhi, 1986.
REFERENCE BOOKS: 1.
Ed. Teja and Laura Johnson, IBM PC and PS/2 Graphics Handbook Micro-Tec. Purlications, DUBAI (UAE) 1990.
2.
Roy A.Plastock and Gorden Kelley, Theory and Problems computer graphics, Schaum’s outline series , Tata McGraw Hill, 1986.
3.
Steven Harrigton, Computer Graphics, A programming approach, Tata McGraw Hill, 1986
4.
Fundamentals of Interactive computer graphics by Foley J.D.Van Dam A (1982) – Addison – Wesley, Reading Massachuset, USA.
IT063 INTERNET PROGRAMMING UNIT – 1 Internet services – History and scope – internet protocols and standardization -Ethernet technology - fiber distributed data interface – synchronous transfer mode - ARPANET technology – ANSNET - application level interconnection networks – internet architecture – interconnection through IP routers- Three primary class of IP addresses and relevant properties – Resolution through direct mapping. UNIT – 2 ARP refinements and Implementation – ARP encapsulation and identification – ARP protocol format - reverse address resolution protocol – timing RARP transactions – primary and backup RARP servers Subnet and Supernet Extensions: Proxy-subnet addressing – flexibility in subnet address assignment – implementation of subnet with masks – subnet mask representation – routing in the presence of subnet – subnet routing algorithm – a unified routing algorithm – maintenance of subnet masks – broadcasting to subnets – supernet addressing – the effect of superneting on routing. UNIT – 3 Java features – Differences between Java, C and C++ - Java and internet – Web brwosers – Java Environment – Program structures – tokens – statements – Java virtual machine – Command line arguments – Variables, constants and data types, operators & expressions, decisions making and branching – classes, objects and methods – arrays, strings and vectors. UNIT – 4 Multiple Inheritance – Packages, multi threaded programming – errors and exceptions – applet programming – graphics programming and problems in JAVA. UNIT – 5 HTML : Concepts of tags – layout – comments – paragraphs – aligning – line break – style tags – address – links – formatting – relative and absolute path – images – Graphical link to images – CGI – Introduction to JavaScript and Perl. TEXT BOOKS: 1.
Internetworking with TCP/IP Vol.I, second edition-Comer DE & Stevans DL, PHI.
2.
Programming with Java Primer – E.Balagurusamy – TMH, 1999- 2nd Edition.
3.
Programming with Java, Schaum;s outline series, John R.Hubbard, McGraw Hill, 1999.
IT064 MODELING AND SIMULATION UNIT – 1 Introduction to simulation – Advantages and Disadvantages of simulation – Areas of applications – Systems and system environment – Concepts of a system – Discrete and continuous systems – Models – Types of models – Steps in a simulation study –Simulator examples – Discrete even system and simulation. UNIT – 2 Overview of statistical models and queuing systems – Programming languages for simulation – FORTRAN, GPSS, SIMAN, SIMSCRIPT, SLAM and MODSIM III. UNIT – 3 Random Number generation – Properties of random numbers – Generation fo Pseudo random numbers – Tests for random numbers. Random variate generation. Inverse Transformation technique – Uniform distribution – Exponential distribution. – Weibul’s distribution – Triangular distribution - Empirical continuous distributions – Discrete distributions – Direct transformation for the normal distribution – Convolution method of Erlang distribution – Acceptance rejection techniques : Poisson distribution – Gamma distribution. UNIT – 4 Input data analysis: Data collection – Identify the distribution, parameter & estimation – Goodness of fit tests – Chi square test – KS test – Multivariate and time series input models. Verification and validations of simulation models – Model building – Verification and validation – Verification of simulation models – Calibration and validation of models – Face utility – Validation of model assumptions – Validation input/output Transformations – Input/output validation using historical input data – Input/ output validation sing Turing test. UNIT – 5 Output data analysis – Stochastic nature of output data – Types of simulation with respect to output analysis – Measures of performance and their estimation – Output analysis for terminating simulations – Output analysis for steady – State simulations. Comparison and evaluation of alternative system designs – Comparison of several system designs – Statistical models for estimating the effect of design alternatives. TEXT BOOK 1.
Jerry Banks, John S. Cansen and Barry L.Nelson – Discrete – Event System Simulation Prentice Hall of India.
REFERENCES: 1.
Anerill M. Law and W. David Kelton – Simulation modeling and analysis - McGraw Hill.
2.
Geoffrey garden – System simulation – Prentice Hall of India.
3.
Narsing Deo – System Simulation with digital computers – Prentice Hall of India.
IT065 E - COMMERCE UNIT 1 ELECTRONIC COMMERCE ENVIRONMENT AND OPPORTUNITIES Background – Electronic commerce environment – electronic market place technologies – modes of electronic commerce – electronic data interchange – migration to open EDI – Electronic commerce with WWW/ Internet. UNIT 2
UNIT 3
ELECTRONIC COMMERCE PROTOCOLS AND PAYMENT SCHEMES Secure transport protocols – secure transaction – Secure Electronic Payment Protocol (SEPP) – Secure Electronic Transactions (SET) – Authentication – Security on Web servers and enterprise networks. Internet Monetary payment and security requirements – Payment and purchase order – On-line electronic cash. INTERNET /INTRANET SECURITY ISSUES AND SOLUTIONS Need for computer security – intruder approaches – strategies – tools – Encryption – access to Internet – Antivirus program – security teams.
UNIT 4 TECHNOLOGIES FOR ELECTRONIC COMMERCE Master card /Visa secure electronic transaction – E-mail and secure E-mail – MIME – S/MIME – MOSS – Internet and web site establishment – Internet resources – technologies – tools – applications – charges – Access and architecture - searching. UNIT 5 APPLICATIONS Advertising on the Internet –Issues and Technologies- Electronic publishing issues, approaches, legalities, and technologies. TEXT BOOK: 1.
“Web Commerce Technology Handbook” by Daniel Minoli and Emma Minoli, Tata McGraw Hill Publishing Company limited, New Delhi, 1999 - Chapters: 1, 2, 3, 4, 5, 6, 7, 8, 10, 11.
References: 1.
Electronic Commerce – Security, Risk management and Control by Greenstein and Feinman, Tata McGraw Hill Publishing Company limited, New Delhi, 2000.
2.
E-security and You by Sundeep Oberoi, Tata McGraw Hill Publishing Company limited, New Delhi, 2001.
IT066 MANAGEMENT INFORMATION SYSTEMS
UNIT - 1 INTRODUCTION TO MANAGEMENT INFORMATION SYSTEMS Management Information Systems – Role and importance of management – Process of management – organization structure and theory – strategic management. UNIT - 2 BASICS OF MIS Decision making – concepts – methods – tools and procedures – bahavioral concepts – organizational and MIS decision making. Information concepts – Quality product – classification – methods of data and information collection – value – Model of a human-implications of information concepts. UNIT - 3 SYSTEMS ANALYSIS AND DESIGN Systems – concepts – control – types – complexity – implementation problems. Need for system analysis – analysis of existing system and new requirement – development model – structured system analysis and design, Computer system design. Development of MIS – information requirement – development and implementation – Management of quality – factors of success and failure – Nature of IT decision – strategic decision – configuration design – Evaluation – IT implementation. UNIT - 4 APPLICATIONS Applications in Manufacturing sector – service sector – decision support systems – Enterprise management systems. UNIT - 5 TECHNOLOGY FOR MIS Technology – Database management systems – Object Oriented Technology – client – server – Architecture – Networks – Business Process Reengineering. TEXTBOOK : “ Management Information Systems” by W.S. JAWADEKAR, Tata McGraw Hill Publishing company Limited, New Delhi, 1998, Chapters- 1 to 20.
IT067 SYSTEM SOFTWARE LABORATORY
SystemSoftware:
1.
Design of an editor : Design of a line or screen editor using C language.
2.
Design of an assembler.
3.
Simulation of loaders.
4.
Interprocess communication.
5.
Token separation and symbol table manipulation.
6.
Constructing Parsing Table.
IT068 INTERNET PROGRAMMING LABORATORY
Suitable experiments of the following standard can be devised by the faculty member who handles the internet lab to emphasize the internet and java programming concepts learned in the theory course. The following are suggestive guidelines for formulating the experiments. 1.
Browsing the net using Netscape, (i) Visit the home pages (ii) Use search engines (iii) Follow links to hop from one site to another (iv)
2.
Set bookmarks and mark favorite pages.
FTP operations (i) Open an ftp site (ii) List files (iii) Change directories (iv) Down load/up load files (v) Terminate connection (vi)
Other file transfer & file management commands
3.
Design a home page using HTML with embedded hypertext links
4.
Java stand alone programs and applets (i) Calculate the distance that light travels using long variables (ii) Sort the given set of character string data using bubble sort (iii) Implement a variable length stack data structure and its operations (iv) Display and copy the contents of a file. (v) Count the no. of words in a file. (vi) Implement producer/ consumer problem using multi threads (vii) Create an applet to display the content of a picture file and apply any one of the filter. (viii) Display available font information (ix) Create an applet for simple banner display (x) Demonstrate a Datagram transfer (Run both client/server in different window). Embed JavaScript and Perl codes and device suitable experiments Experiments with available CGI mechanisms on your web server. Implement CGI programs for accessing local databases to retrieve data of interest. Write several java applets and link them to HTML files.
5. 6. 7.
SEVENTH SEMESTER IT071 ENGINEERING ECONOMICS & MANAGEMENT UNIT – 1 Definition, Description and understanding of demand, supply, Price, National income, Productivity, Exchange rate, inflation, indices and Money value. UNIT – 2 Costing, Definition of various costs, Methods of costing (brief description only), Principles of accounting, Accounting concepts, Accounting statements, their preparation and their use (only a sample profit and loss account and balance sheet of a single ownership enterprise to be taught), Marginal costing methods –Methods (PV ratio, BEP analysis) and its use in management decision making. UNIT – 3 Location, Plant location, Plant capacity, Location decision, The factors governing location and capacity, Product life cycle, Layout decisions, Location and layout for products and for services. UNIT – 4 Ownership – Single owner, Partnership, Joint stock firms, co-operatives, Public Enterprises and statutory Enterprises: Their characteristics, Merits, Limitations, Formal Procedures in our country. Brief discussion on the scope and purpose of companies act and MRTP act – Enterprenurship – The Government schemes. UNIT – 5 Management: Basic principles, The Indian heritage, Western style and Japanese methods, Functions of Management, Organization, (line, staff, matrix, project), merits and limitations, charts, Definitions of authority, Responsibility ad accountability, Brief description on MBO, MBE and MIS. REFERENCE BOOKS: 1.
Managerical Economics by Varshary, 1998, Sultan Chand.
2.
Advanced Cost Accounting by Jain and Narang, 1998, Kalyani Publication.
3.
Practical costing by Ahuja and Khanna 1998, S.Chand & Co.,
4.
Modern production and Operation Management by Buffa and Rakesh Saxena, 1998, Prentice Hall.
5.
Industrial Ownership in India by Khanna, 1998, Dhanpatrai Publications.
6.
Principles of Management byL.M.Prasad, 1998, Sultan Chand.
7.
Scientific Management by Peter Duker, 1996, Tata McGraw Hill.
IT072 GRAPH THEORY AND APPLICATIONS UNIT – 1 Isomorphism – Subgraphs – Walks, paths and circuits – Connected graphs, Disconnected graphs and components – Euler graphs – Operations on graphs – More on Euler Graphs – Hamiltonian paths and circuits.
UNIT - 2 Trees – Some properties of Trees – Pendent vertices in a Tree – Distance and Centres in a Tree – Spanning trees – Fundamental circuits – Spanning Trees in a Weighted graph. Cut Sets – some properties of a cut-set – All cut-sets in a graph – Fundamental circuits and cutsets – Connectivity and Separability.
UNIT – 3 Chromatic number – Chromatic partitioning – Chromatic Polynomial – Matching – Coverings – The four colour problem.
UNIT – 4 Fundamental circuits in Digraphs – Incidence matrix of a digraph – Circuit matrix of a digraph – Cutset matrix of a digraph – Paried comparisons and Tournaments – Acyclic Digraphs and Decyclization.
UNIT – 5 Algorithms – Input: Computer representation of a graph – The output – Some basic Algorithms – Shortest path Algorithms.
TEXT BOOK: “Graph Theory with Applications to Engineering and Computer Science” by Narsingh Deo., Prentice Hall of India Private Limited, New Delhi – 110 001. UNIT – I:
Sections
2.1, 2.2, 2.4 to 2.9
UNIT – II:
Sections
3.1 to 3.4, 3.10, 4.1 to 4.5
UNIT – III:
Sections
8.1 to 8.6
UNIT – IV
Sections
9.7, 9.8, 9.10, 9.11
UNIT – V
Sections
11.1 to 11.6
IT073 PRINCIPLES OF COMPILER DESIGN UNIT – 1 Programming language grammar : Definition of programming languages – Lexical and syntactic structure of a language – Elements of a formal language grammar – Derivation, reduction and syntax trees – Ambiguity - context free grammars – Capabilities of a context free grammar – Regular expressions. UNIT – 2 Lexical analysis : Role of a lexical analyzer – Finite automata – Regular expressions to finite automata – Minimizing the number of states of DFA – Implementation of a lexical analyzer – Illustrations. UNIT – 3 Parsing Techniques : Parse trees – Left most and right most Parsing techniques – Top down and bottom up parsing – Handles – Shift reduce Parser - Recursive decent Parser – Operator precedence and predictive Parsers. Automatic Parsing Techniques : LR grammars – LR Parsing – Canonical collection of LR (O) items – Construction of ACTION and GO TO tables – Introduction to SLR canonical and LALR Parsing. UNIT – 4 Syntax directed translation : Syntax directed translation schemes – Semantic actions – Implementation – Intermediate code generation – Three address codes -, quadruples and triples, parse trees and syntax trees – Methods of translating assignments statements, expressions control statements. Array references, procedure calls, declarations, case statements and Record structures. Symbol tables and error handling: Representation of information in symbol tables – Data structures for symbol tables – Errors – Lexical phase errors – Syntactic phase errors. UNIT – 5 Code optimization and Code generation: Principle sources of optimization – Loop optimization – The DAG representation of basic blocks – Introduction to code generation. TEXT BOOK: 1.
A.V.Aho, J.D.Ullman – Principles of compiler design – Narosa Publishing House, 1987.
REFERENCE BOOKS: 1.
Dhamdhere, D.M.-Compiler Construction – Principles and practice – Macmillan India Limited, 1983.
2.
David Gries, Compiler Construction for Digital Computers, Wiley International Edition.
IT074 MULTIMEDIA SYSTEMS UNIT – 1 Introduction : What is Multimedia? CD-ROM and Multimedia – Multimedia in Business, in School, at Home etc. Stages of a Multimedia Project: The Multimedia Team UNIT – 2 Multimedia Hardware Macintosh and Windows Production Platforms, the Multimedia PC Platform, Hardware Peripherals, SCSI, NCI, memory and storage devices. Input Devices, Output Hardware; Communication Devices. UNIT – 3 Multimedia Software: Basic tools; Word Processors and spreadsheets, Presentation Tools. Authoring Tools: Card-and-page based authoring tools; icon-based and time-based authoring tools. UNIT – 4 Multimedia Building Blocks: Text, Sound, Midi versus Digital video; preparing MIDI files; audio file formats; MIDI under windows; Audio recording. Images: Multiple monitors, bitmaps, vector drawing, 3-D Drawing, colouring, Image file formats, animation, Video standards, recording formats, video compression. UNIT – 5 Project Planning, Estimating; Proposals; Designing multimedia; Delivering Multimedia; producing a CD. TEXT BOOK 1.
Multimedia; making IT Work, 1994, Osborne McGraw Hill, TAY VAUGHAN
2.
The Winn L.Rosch Multimedia Bible, Sams Publishing 1995.
ITO75 ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS UNIT – 1 Problems and Search: Introduction to AI – Definition – History – Applications – Problem – Problem spaces – Searching techniques – Blind search strategies: Breadth first search – Depth first search – Iterative deepening – Bi-directional search – Comparing search strategies – Constraint Satisfaction – Guided search techniques: Heuristic search – Hill climbing techniques – Best first – Greedy – A* search – AO* search. UNIT – 2 Searching game tress : Minixmax Procedure – Alpha Beta Pruning, Planning & Understanding. UNIT – 3 Knowledge Representation: Structure Representation of Knowledge: Semantic Nets – Frames Scripts: Logic based representation of knowledge: Propositional and Predicate logic – Rules – Unification and Resolution. Dealing with uncertainity: Non monotonic reasoning – Certainity factors – Fuzzy Reasoning. UNIT – 4 Expert Systems : An Introduction to Expert System – Interface – Forward Chaining – Backward chaining – Development process – Language and tools – Explanation facilities – Knowledge acquisition. UNIT – 5 Introduction to Advanced Topics: An Introduction to Natural Language Understanding – Processing – Perception – Learning – Introduction to Robotics & Neural Nets (Elementary Treatment only) REFERENCE BOOKS: 1.
Principle of Artificial Intelligence by Nills J. Nillsson, Narosa Publishing House, 1980.
2.
Artificial Intelligence by Elaine Rich, McGraw Hill International, 1991.
3.
Programming in Prolog by W.F. Clocksin, C.S. Mellish, Narosa Publishing House, III revised edition, 1989.
4.
Artificial Intelligence by Partrick Henry Winston, Addison Wesley, III edition, 1999.
5.
AI through Prolog, Neil C. Rowe, Prentice Hall International, 1998.
IT077 GRAPHICS & MULTIMEDIA LABORATORY
1.
Program to draw a line using bresenham’s algorithm for all quadrants
2.
Program to draw a circle.
3.
Program to draw an ellipse.
4.
Program to draw a spiral using bresenham’s circle drawing algorithm.
5.
Procedure to move a line around the circle.
6.
Procedure to rotate a wheel.
7.
Procedure to translate a circle.
8.
Program to show 2D clipping and windowing.
9.
Development of 2D graphics package.
10.
Segmentation.
EIGHTH SEMESTER IT081 HIGH SPEED NETWORKS UNIT – 1 Carrier Technology: FDDI, Narrowband and Broadband technologies such as carrier technology and switching technology quality of service routing, traffic policing and scheduling disciplines (for high speed networks), and future internet architecture and protocols. UNIT – 2 Switching Technology: Multiplexing – Frequency Division Multiplexing, Synchronous Time division Multiplexing, Statistical Time Division Multiplexing, Circuit Switching, Packet Switching ATM. UNIT – 3 Addressing & Routing: Addressing – Flat, Classes, Hierarchical, Multicast, Anycast Routing – overview of existing routing schemes – Quality of Services (QoS) routing, Routing for Mobile Hosts, Multicast routing, Interior and Exterior Gateway Routing Protocols (OSPF and BGP), classes Inter domain Routing (CIDR), Tunneling. UNIT – 4 Traffic Policing or Shaping: Leaky Bucket, Jumping Window, Moving Window, Exponentially weighted Moving Average, Composite Traffic Shapers, Shift Register Traffic Shaper, Scheduling disciplines – Delay EDD, Virtual clock, Fair Queuing, Stop-and-Go, Hierarchical Round Robin, Jitter EDD, Carry-over Round Robin, Future Internet (Ipv6) Architecture and Protocols. UNIT – 5 Network Security: Cryptography, Secret key and Public key algorithm, Authentication Protocols, Digital signatures, WWW, Multimedia Applications.
REFERENCE:
1.
W.STALLIINGS, Data and Computer Communications, 5th Ed., PHI, 1997 Chapters 7, 8, 9, 10, 11, 13, 16 and 18.
2.
A.S.TANENBAUM, Computer Networks, 3rd Ed., PHI, 1997 Chapters 4.5, 5, 6.5, 7.1, 7.6, 7.7
3.
S.V. Raghavan and S.K. Tripathi, Networked Multimedia Systems : Concepts, Architecture and Design, Prentice Hall, 1997, Chapters 5, 6.5, 9, 10
" !
IT082 DISTRIBUTED COMPUTING UNIT – 1 Motivations, Objectives and characterization of distributed systems, Distributed system architecture model, interprocess communication layer – introduction, Hardware interconnection terminology. UNIT – 2 Link level, Hierarchy, IPC interface and end to end protocols, distributed control. UNIT – 3 Identifiers (naming) in distributed systems, protection Atomic transaction, synchronization. UNIT – 4 Multiple copy update, applications and protocols, error recovery, hardware issues. UNIT – 5 Hardware/Software relationships in distributed systems, the National software works(NSW), Ehternet, Pup & Violet Conclusions.
TEXT BOOK: 1.
Distributed Systems – Architecture and implementation – Edited by B.W. Lampson, MlPaul & H.J. Siegert, Springer –Verlag – 1981. (Lecture notes in Comp.Sci. Vol. 105)
REFERENCE BOOK:
1.
Paul, M. & Sugart H.J.Distributed Systems, Methods and tools for specification – An advanced course Springler – Verlag, 1985.
" !
ELECTIVES ITEL01 IMAGE PROCESSING UNIT – 1 Perception and image representation: Perception of light, eye, subjective phenomenon – monochrome vision model. Image representation, 2-D system. Linearity and space invariance. Point spread function and convolution. 2-D. Fourier transform and its properties. Discrete cosine transform and KL transform. UNIT – 2 Sampling: 2-D sampling Spectrum of a sampled image, Image reconstruction. Aliasing, Practical Image Sampling and reconstructing systems and their imperfections – Image Quantization -Uniform and nonuniform – Max – Lloyd Quantizer. UNIT – 3 Image Enhancement and restoration: Enhancement : Contrast enhancement. Histogram modification. Noise cleaning. Edge crispening. Digital Image Restoration: Sources of degradation. Characterization. Basic principles of Inverse filtering. UNIT – 4 Image compression and coding: Image compression and coding problems. Data structures for picture presentation. UNIT – 5 Picture analysis and classification: Region analysis, scene analysis, statistical and syntactic models for picture classification, Image understanding systems.
TEXT BOOK
1.
R.GONZALEX and R.E.WOOD, Digital Image Processing, PHI, 1992.
REFERENCES
1.
A.ROSENFELD and A.C.KAK, Digital Picture Processing, PHI, 1982
2.
W.K. PRATT, Digital Image Processing, McGraw Hill, 1981.
3.
A.C. ANDREWS and B.R.HUNT, Digital Image Restoration, PHI, 1990
" !
ITEL02 DIGITAL SIGNAL PROCESSING UNIT – 1 Discrete time signals and systems: Digital signal processor basics – Analog Vs digital signal processing, need for digital signal processing, understanding of signal spectrum, sampling theorem. Linear shift invariant system – Discrete time signals, linear shift invariance of systems – Impulse response characterization, causality, BIBO stability, system function – DTFT frequency response of LSI system – Realisation structures Direct form I & II – Cascade and parallel forms, canonic form. UNIT – 2 DFT & FFT – Linear and Circular convolutions – Sectioned convolutions – DFT and its properties, spectrum analysis using DFT relationship between Z transform, DTFT and DFT Radix 2 FFT, Decimation in time radix 2 FFT, decimation in frequency radix 2 FFT – computation of IDFT from FFT. UNIT – 3 Design of FIR filters – difference between FIR & IIR filters – Magnitude and phase response of digital filters – linear phase response – Fourier series method of FIR – comparison of various windows – Rectangular, hamming, hanning, Blackman and Kaiser in performance – Design using rectangular hamming, hanning windows. UNIT – 4 Infinite impulse response filters – IIR filter design from analog filters (Chebyshev and butterworth) using impulse invariance method: using bilinear transformation – Comparison of the two methods – frequency transformations. Applications of DSP in communication, speech, image processing, biomedical applications. UNIT – 5 Finite word length effects in digital filter, fixed and floating point arithmetic, effect of Quantization of the input data due to finite length, coefficient inaccuracy, product round of, input limit cycle oscillation, overflow due to adders, need for scaling, finite work length effect in computation of FFT. DSP Chips – ADSP 2100 and TMS 320 families – Basic features, specification and their application. REFERENCE BOOKS
1.
Digital signal processing, - Oppenhein Schaffer, PHI – 2nd Edn.
2.
DSP system design approach – Defatta Wiley – 1995.
3.
Introduction to DSP – Ludemann, John wiley – 2nd Edition
4.
DSP, A computer based approach – Samjit Mitra, McGraw Hill-1998
" !
ITEL03 PATTERN RECOGNITION UNIT – 1 Basic Concepts : Fundamentals- Problems- Design concepts and examples- Decision Function : Role of decision function in Pattern recognition- Linear and Generalized decision functionsconcepts of pattern space and weight space - Geometrical properties. UNIT – 2 Pattern classification : Implementation of decision functions- Multivariable functions- Pattern classification : Pattern classification by distance functions- Likelihood function – minimum distance classification. UNIT – 3 Clusters and cluster seeking algorithms : Introduction to the problem of feature selection and extraction- Binary feature selection- Statistical and Structural Feature Extraction. UNIT – 4 Tree Languages and syntactic Pattern Recognition : Introduction to Tree languages and Syntactic pattern Recognition - Syntactic Pattern Recognition on the basis of Functional approximation Syntactic pattern description - recognition grammars. UNIT – 5 Knowledge Acquisition : Acquisition and Utilization of Access Patterns in Relational Data Base implementation- Knowledge Acquisition Algorithms. Text Book: “Pattern Recognition Principles” - J.T.Tou and R.C. Gonzalez, -Addison Wesley, 1974. Reference Books : 1.
“Pattern Recognition and Artificial Intelligence”, - C.H.Chen -Academic Press, Inc. 1976
2.
“Pattern Recognition - A Statistical Approach” – P.A. Devijver and J. Kittler, PHI 1992.
3.
“Syntactic Pattern Recognition – An Introduction”, - R.C.Gonzalex & M.G.Thomson Addison Wesley, 1982.
" !
ITEL04 COMPUTING WITH ARTIFICIAL NEURAL NETWORKS UNIT – 1 Artificial Neural Networks: Fundamental Concepts and Models: Artificial Neural Networks: Neural Computation, History of Artificial Neural Systems -Development. Fundamental concepts of Neural Systems. Biological Neurons and their Artificial models. Neural Network learning rules. UNIT – 2 Feedforwrd Networks: Single Layer perceptron classifiers - Training algorithm, multicategory single layer perceptron networks - Delta learning rule, feedforward recall and error - back propogation training, learning factors. UNIT – 3 Feedback Networks: Feedback Networks, Hopfield Networks, Associative memories, BAM. Multidirectional Associative memories. UNIT – 4 Matching and Self Organizing Networks: Self organizing Networks, Hamming Net and MaxNet, counter propagation Network, unsupervised learning of clusters, feature mapping. ART 1 techniques. UNIT – 5 Application of Neural Systems: Applications of Neural algorithms and systems, Character recognition, expert system applications, Neural Network control applications, spatio-temporal pattern recognition, Neocognition and other applications. TEXT BOOK JACEK M ZURADA, Introduction to Artificial Neural Systems (1994), Jaico Publishing House. REFERENCE BOOKS:
1.
J. HERTZ., A. KROGH AND R. G. PALMER, computation, Addison – Wesley, 1991.
Introduction to the theory of neural
2.
J. A. FREEMAN AND D. M. SKAPURA, Neural networks: Algorithms, Applications and Programming Techniques, Addison – Wesley, 1991.
" !
ITEL05 NATURAL LANGUAGE PROCESSING UNIT – 1 Introduction – The issues and Difficulties in natural languages processing – Linguistics and computational linguistics - language understanding and generation understanding of spoken, written and textual information.
UNIT – 2 Syntactic Parsing – English Grammar – Structure of the sentence – Words and Organization of the lexicon – Context free and context sensitive grammar – Transformation grammar – The role of syntax analysis is semantic ATNs – Definite clause grammar and WASP parsers.
UNIT – 3 Semantic interpretation – The conceptual dependency model for semantic representation – Semantic networks – Frames and Scripts – Semantics in the lexicon.
UNIT – 4 Discourse interpretation – The interconnections between pragmatics – Pragmatics discourse analysis – Speech acts plan – Based theory of speech acts – Analyzing intention in utterances – The representation and use of focus in understanding discourse – Focusing in comprehension of anaphora.
UNIT – 5 Generation, Strategies for generation – Planning English referring expressions – KING, a natural language generation systems. Typical systems – ELIZA – Baseball – GUS – PARRY – LADDER – SOPHIE & POET current trends in NLP.
REFERENCE BOOKS: 1. Natural Language Understanding, James Allen Benjamin Cumming. 2. Readings in Natural Language Processing, Grosz, Jones & Webber, Morgan Kaufmann Publishers, 1986. 3. Language as a Cognitive process: syntax by Windgrad, Addison Wesley Publication, 1983. 4. Talking with computer in Natural Language, Popov, Springer-Verlag, 1986 5. Speech, Language Processing – An Introduction to Natural Language Processing, Computational Linguistics, Speech Recognition by Jurafsky, Marten, Linden.
" !
ITEL07 BROAD BAND COMMUNICATIONS UNIT –1 Optical Fibre Transmission: Characteristics of Optical Fibre, Design of Optical Link, Optical Fibre cables, Optical Fibre transmission system, Intensity Modulated systems, coherent optical transmission systems, optical multiplexing, Repeaters, WDM and TDM, optical networking, SONET / SDH, advantages, standards, protocol, basic SONET frame, SONET overhead capabilities. UNIT – 2 High Speed solutions: FDDI Structure of FDDI frame, path determination, Protocol, architecture, Network topology, Configuration, Application, Distributed Queue dual bus feature, Concepts, protocols, working, Gigabit Ethernet, Switched multi Megabit data services, Standards, cell structure, architecture, protocol, data storage exchange interface, inter-carrier specification. Frame relay: Frame structure, Frame relay Vs packet switching, Frame relay operators, network devices, connections, bandwidth on demand, statistical multiplexing, frame relay configuration, voice – frame relay. UNIT – 3 Digital Subscriber lines: ADSL, Carrierless amplitude modulation, Discrete multitone modulation, HDSL, VDSL, SDSL, RADSL., Cable modems, DSL & cable modem. ISDN: Basic rate ISDN and primary rate ISDN, Transmission structure, User interface, network interface, ISDN Protocols, ISDN connections, Physical layer, line coding techniques, interfaces. ISDN Data link layer: LAPD, Bearer channel link control, frame mode bearer service and protocol. ISDN Network layer: Call control and connection control – SS7 architecture, signaling, Data link level, Network Level, Connection Control part, ISDN user part. UNIT – 4 ATM and BISDN: Capabilities of ATM, Asynchronous technology, ATM cell & Cell structure, ATM network concepts and architecture. ATM position in OSI reference model, B-ISDN protocol reference model, ATM functions and layers, ATM signaling principle, ATM performance, ATM traffic control, ATM operation and maintenance, ATM reference configuration. ATM protocol stack: Lower layer, ATM physical layer media, ATM transmission convergence sublayer. UNIT – 5 ATM Protocol Stack: ATM layer, ATM switching principle, ATM OAM function signaling, ATM technology components: Upper layers, ATM adaptation layer functions, ATM services. Computer Telephony Integration: Brief overview of technology, application. REFERENCE BOOKS: 1. 2. 3. 4.
Introduction to ATM by Goralski, McGraw Hill Broadband Access technologies – ADSL / VDSL, Cable modems by Ransom & Azzam, 1999. Broadband Telecommunication Handbook by Regis bates, McGraw Hill 2000 ISDN & Broadband ISDN by William Stallings, Macmillan Optical Fibre Telecommunication, Transmission systems, Microwave Fibre Optic, Mobile cellular, Data Digital Microwave by Robert Winch, McGraw Hill.
" !
ITEL10 OPERATIONS RESEARCH UNIT – 1 Linear programming – Formulation – Solving L.P.P. by graphical method – Simplex method – Artificial variable techniques. UNIT – 2 L.P.P. (Contd.,) – Two-phase method – variants of Simplex method – dual theory UNIT – 3 Transportation problem – Formulation – Finding an initial basic feasible solution – North West corner loop – Least cost method – Vogel’s approximation method – Optimal solution – degeneracy – Assignment model – formulation – Hungarian algorithm – maximization. UNIT – 4 PERT-CPM – game theory – solving game theory problems – games with mixed strategies – games with dominance – sequencing. UNIT – 5 Inventory and control – inventory cost – inventory models – order quantity with price break – ABC analysis – queueing theory – definitions – infinite population model – multi channel service – infinite queue – finite population queueing model – Dynamic programming
TEXT BOOK “Operations Research”, S. Dharani Venkataraman, Keerthi Publicating house (P) Ltd., Coimbatore (1990). REFERENCE BOOKS: 1. 2.
“Operations Research – An Introduction” -, Hamdy A.Taha, MacMillian publishing, London (1971) “Operations Research”, Kanti Swarup, P.K. Gupta & Man Mohan, Sultan Chand & Sons, New Delhi (1982).
" !