Complex Analytic functions and conformal mapping: curves and regions in the complex plane, complex functions, limit, derivative, analytic function, Cauchy - Riemann equations, Elementary complex functions such as powers, exponential function,logarithmic, trigonometric and hyperbolic functions. Conformal mapping: Linear fractional transformations, mapping by elementary functions like Z2, ez, sin z, cos z, sin hz, and Cos hz, Z+1/Z.
Complex integration: Line integral, Cauchy's integral theorem, Cauchy's integral formula, Taylor's series, Laurent's series, residue theorem, evaluation of real integrals using integration around unit circle, around the semi circle, integrating contours having poles, on the real axis.
Partial differential equations:Formation of partial differential equations. Solutions of equations of the form F(p, q) = 0, F(x,p,q)=0, F(y,p,q)=0, F(z,p,q)=0, F1(x,p) = F2 (y,q),Lagrange’s form Pp+Qq = R. Linear homogeneous partial differential equations with constant co-effients.
Vibrating string : one dimensional wave equation, D’Alembert’s solution, solution by the method of separation of variables. One dimensional heat equation, solution of the equation by the method of separation of variables, Solutions of Laplace’s equation over a rectangular region and a circular region by the method of separation of variables.
1. R.K.Jain, S.R.K.Iyengar: Advanced Engineering Mathematics, Narosa Publishers.19912. C.R.Wilie & L.C.Barrett: Advanced Engineering Mathematics, MGH Co.
1. Ervin Kreyszig, Wiley Eastern - Advanced Engineering Mathematics2. Churchill R.V- Complex Variables & Applications: MGH Publishers.3. M.C.Potter - Advanced Engineering Mathematics, , J.L.Goldberg Oxford University Press
Introduction to 8 bit microprocessor: Microcomputers and microprocessors, 8/ 16/ 32/ 64-bit microprocessor families; Internal architecture of Intel 8085 microprocessor: Block diagram, Registers, Internal Bus Organization, Functional details of pins, Control signals,External Address / Data bus multiplexing, Demultiplexing, I/ O mapped I/ O, and memory mapped I/ O techniques.Interrupts, Serial communication and DMA features
Assembly Language Programming: 8085 instruction set: Instructions, Classifications,Addressing modes, Stack and Subroutines, Delay routines, Counters etc. Programming examples.
Instruction Timing and Interrupts: Timing Diagrams (of various instructions): T- state,Machine cycle (Opcode fetch, Read / Write, Interrupt Acknowledge, Bus Idle, etc),Interrupts: -types (h/ w and s/ w), Maskable / Non maskable, their organization.
Interfacing concepts and devices:Memory interface: Concept of memory chip/ chips interface to 8085 with appropriate examples Programmable interfacing devices: - Programmable peripheral interface (Intel 8255),Programmable timer interface (Intel 8253/ 54), Programmable display / Keyboard interface (Intel 8279), Programmable serial communication interface (Intel 8251)-(their architecture, register orga nization, initialization, hard ware and software interface to 8085.
1. Ghosh and Sridhar: 0000 to 8085 Microprocessors fo Engineers and Scientists2. Gaonkar: Microprocesors, Architecture, Programming and Applications.
1. Nagoor Kani, Microprocessors, architecture and programming, RBA Publications,2004 2. Douglas V. Hall , Microprocessors, Interfacing and Peripherals, Tata McGrawHill,2nd ed.3. S. P. Chowdhuray, Sunetra Chowdhuray, Microprocessors and Peripherals,SCITECH, 2004
Basic structure of computers – Functional units – Basic operational concepts – Bus structures – Instructions & instruction sequencing. Hardware and software - Addressing modes – Assembly language – Stacks &Subroutines
Processing Unit – Fundamental concepts – Execution of a complete instruction -Hardwired control unit- micro programmed control - control signals - microinstructions micro program sequencing- Branch address modification- Pre-fetching of micro instructions- Emulation.Computer arithmetic - logic design fo fast adders - multiplication - Booth’s algorithm -Fast multiplication - integer division - floating point numbers and operations.
Memory organization-Semiconductor RAM memories- internal organization of memory chips- Static and Dynamic memories - cache memories - mapping functionsreplacement algorithms - virtual memory - address translations – performance considerations – interleaving - Secondary storage.
1. Hamacher C. V., “Computer Organisation – International Edition -5th Edition”, Mc.Graw Hill, NewYork 2. Stallings William, “Computer Organization and Architecture”,6th Edition, Pearson Education ,2003
1. Pal Chaudhary P, “Computer Organisation and Design “ , Prentice Hall, New Delhi2. Hayes J P , “Computer Organisation and Architecture - 2nd Edition “, Mc Graw Hill3. Tanenbaum A S , ”Structured Computer Organisation - 3rd Edition”, Prentice Hall4. Behrooz Parhami, Computer Architecture from Microprocessors to Supercomputers Oxford Indian Edition 5. Kai Hwang & Faye A Briggs “Computer Archtecture and Parallel Processing“Mc.Graw Hill.,NewYork –19856. D.A Pattersen and J.L Hennesy ,”Computer Organization and Design: The hardware/software Interface 2nd Edition”, Harcourt Asia privat Ltd. (Morgan Kaufman),Singapore 1998
Finite state systems: NFA ,DFA, Definitions. Equivalence of NFA and DFA, NFA to DFA conversion, NFA with epsilon transitions, Elimination of epsilon transitions, Minimization of Finite Automata, Finite automata with output, Applications of Finite Automata. Regular Expressions: Definitions, Equivalence of regular expression and finite automata, Conversion between regular expression and FA, Pumping Lemma and its application, closure properties of Regular sets
Context Free grammars (CFG): Definition, Derivations, parse trees, ambiguity , Simplification of grammars, Conversion to Normal Forms: Chomsky, Greibach . Pumping lemma for Context free languages, application of pumping lemma, Closure Properties of CFL , decision algorithms for CFL. Pushdown Automata: Definition, Design examples, Equivalence of acceptance by final state and empty stack, Equivalence of PDA and CFG.
Turing machine(TM ): Model of TM, Design examples, Techniques for construction of TM: storage in the state, multiple tracks ,subroutines. Church’s Thesis, Universal TM
Recursive and recursively enumerable languages, halting problem of TM , Chomsky Hierarchy. Regular grammars: equivalence of regular grammar and FA , converting regular grammar to Finite Automata, Converting Finite Automata to regular grammar, Definition of Linear Bound Automata and Context Sensitive Grammars
1. J E Hopcroft and J D Ullman Introduction to Automata Theory and Languages and Computation, Addison Wesley2. Michael Sipser, Introduction to the Theory of Computation, Thomson Learning
1. Misra and Chandrasekharan, Theory of Computation, Prentice Hall 2. H R Lewis Papadimitrou, Elements of Theory of Computation PHI3. John Martin, Introduction to Language and Theory of Computation, TMH4. Peter Linz, An Introduction to Formal Languages and Automata Narosa Publucation
Module 1
Introduction to Data structures - Arrays & sparse matrices – representation, Searching -linear, binary, Fibonacci – Sorting – selection, bubble, insertion, quick, merge, heap,Introduction to external sorting, Hash tables – Hashing functions
Linked lists – singly, doubly and circular lists, Application of linked lists – Polynomial manipulation, Stacks – Implementation of stacks using arrays and lists – Typical problems – Conversion of infix to postfix – Evaluation of postfix expression . Queues & Deques – implementation., priority queues
Trees, Definition and mathematical properties. Representation – sequential, lists - Binary trees – Binary tree traversals – pre-order, in-order & post-order, Expression trees .Threaded binary trees . Binary Search trees . AVL trees
Graphs – Graph representation using adjacency matrices and lists – Graph traversals –DFS, BFS - shortest path – Dijkstra’s algorithm, Minimum spanning tree – Kruskal Algorithm, prims algorithm – Binary search, B trees and B+ trees.
1. Michael Waite and Robert Lafore, “Data Structures and Algorithms in Java” ,Techmedia, NewDelhi, 1998.2. Adam drozdek,” Data Structures and Algorithms in Java” ,Thomson Publications,2nd Edition.3. Sartaj Sahni, 'Data Structures, Algorithms, and Applications in Java McGraw-Hill
1. Aaron M.Tanenbaum, Moshe J.Augenstein, “Data Structures using C”, Prentice Hall InternationalInc., Englewood Cliffs, NJ, 19862. Ellis Horowitz and Sartaj Sahni, “ An introduction to Data Structures”, ComputerScience Press,Rockville, MA, 1984Benjamin/CummingsPublishing Company Inc., Redwood City, CA, 19914. Jean Paul Tremblay and Paul G Sorenson, “An introduction to Data Structures wit Applications”,McGraw-Hill, Singapore, 1984
Data transmission: Communication model-Data Transmission: Concepts and Terminology- Analog and Digital Data – Analog and Digital Signals-Periodic analog signals-Time and frequency domain-composite signals-Digital signals- Digital signal as composite analog signals-Transmission of digital signals-Transmission impairments -Data rate limits-Noise less channel:-Niquist bit rate-Noisy channel:-Shannon capacity- Performance:-Bandwidth-Throughput-Latency Transmission Media: Guided Media-Twisted pair cable-Coaxial cable-Fiber Optic cables -Cables and cable standards-Unguided media-Radio waves-micro waves-Infrared-Satellite communication.
Digital transmission -Digital to Digital conversion: Line coding-Line coding schemes-Block coding-Scrambling Analog to Digital Conversion: PCM- DM- Transmission modes: Parallel transmission-Serial Transmission Analog Transmission- Digital to Analog conversion: Aspects-ASK-FSK-PSK-QAM- Analog to Analog conversion: AM-FM-PM Data Compression:- Frequency dependent coding-Huffman coding-LZW Coding
Digital Data Communication Techniques: Asynchronous and Synchronous Transmission-Types of Errors-single bit and burst errors-Error Detection: Redundancy- LRC-VRC-CRC-Capabilities and performance of CRC-Error Correction: single bit error correction – Hamming code- Burst error correction-convolution code.Data Link Control: Line discipline-Flow control-Error control: ARQ-stop and wait ARQ-Continuous ARQ- Line utilisation of different ARQs- Link management- HDLC
Multiplexing: Frequency-Division Multiplexing-Synchronous Time-Division Multiplexing-Statistical Time-Division Multiplexing Spread Spectrum: The Concept of Spread Spectrum-Frequency Hopping Spread Spectrum-Direct Sequence Spread Spectrum-Code-Division Multiple Access Telephone and cable network: Major components of telephone network- LATAs- Services provided by telephone networks-Dial up modems and standard-Digital subscriber line-ADSL-ADSL Lite-SDSL-VDSL-Cable TV for data transmission: Bandwidth-Sharing-CM and CMTS- Data transmission schemes- DOCSIS
William Stallings, Data and Computer Communication, 8/e ,Pearson education,2006.
1. Behrouz A. Forouzan, Data Communication and Networking 4/e, TMH,2006. 2. Fred Halsal, Data Communication Computer Network and Open Systems, Person education ,2005.3. William A. Shay, Understanding Data Communication & Networks, 2/e, Thomson Learning,20034. James Irvin & David Harle, Data communication and Networks: an Engineering approach, Wiley,2006.
1. Study of standard logic gates and universal gates.2. Arithmetic circuitsi. Adders & subtractors using standard logic & universal gates.ii. Study of 7483 & binary addition & subtraction using 1’s & 2’s complement.iii.BCD adder using 7483../br>3. Code converters wit mode control, Parity generator/ checkers.4. Study of MUX, DEMUX, decoder & encoder circuits & their ICs.5. Flip flops: RS, JK, T, D, master-slave JK flip flops using universal gates6. Countersi. Asynchronous UP, DOWN, UP/DOWN counter using JK Flip flopsii. Design and realization of sequence generators.iii. Study of IC counters 7490, 7492, 7493 and 74193.7. Study of shift registers and design of Johnson and Ring counter using it.8. Study of seven segment display & decoder driver (7447)9. Astable and monostable multi-vibrators using TTL gates10. Transfer characteristics and specifications of TTL gates
1. Simple programming exercises in Java2 Study of algorithms and implementation i Java programming language fo the following:Searching and SortingLinked Lists- Singly and doubly Stacks – various applicationsQueuesTreesGraphs