Module I
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 ez, sin z,
cos z, sin hz, and cos hz, Schwarz - Christoffel transformation.
Module II
Complex integration: Line integral, Cauchy's integral theorem, Cauchy's integral formula, '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.
Module III
Numerical Analysis : Errors in numerical computations, sources of errors, significant digits.
Numerical solution of algebraic and transcendental equations: bisection method, regula falsi method, -
Raphson method, method of iteration, rates of convergence of these method,
Solution of linear system of algebraic equations: exact methods, Gauss elimination method, iteration
methods, Gauss-Jacobi method.
Polynomial interpolation : Lagrange interpolation polynomial, divided differences, ’s devided
differences interpolation polynomial.
Module IV
Finite differences: Operators ∆,∨,Ε, and δ,’s forward and backward differences interpolation
polynomials, central differences, Stirlings central differences interpolation polynomial.
Numerical differentiation: Formulae for derivatives in the case of equally spaced points.
Numerical integration: Trapezoidal and Simpson’s rules, compounded rules, errors of interpolation
and integration formulae. Gauss quadrature formulae (No derivation for 2 point and 3 point formulae)
Module V
Numerical solution of ordinary differential equations: series method, Euler’s method, modified
Euler’s method, Runge-Kutta formulae 4th order formula,
Solution of linear difference equations with constant co-efficients: Numerical solution of boundary
value problems, methods of finite differences, finite differences methods for solving ’s equation in a
rectangular region, finite differences methods for solving the wave equation and heat equation.
Books for Reference:
1. Ervin Kreyszig : Advanced Engineering Mathematics, Wiley Eastern
2. S.S.Sastry : Introductory Method of Numerical Analysis, Prentice -Hall of India
3. Ralph G. Stanton : Numerical Methods for Science and Engg., Prentice - Hall of India
4. S.D.Conte and Carl de Boor : Elementary Numerical Analysis Analograthmic approach
McGraw Hill
5. M.K.Jani, S.R.K Iyengar and R.K. Jain : Numerical Methods for scientific and
Engineering Computations. Wiley Eastern.
6. P.Kandaswamy K.Thilagavathy : Numerical Mehtods , S.Chand & Co. K.Gunavathy
7. E.V.Krishnamurthy, S.K.Sen : Numerical Algorithms, Affiliated East West.
CS 402 Principles of Programming Languages
Module I. Programming Domains. Language evaluation. Evolution of major programming languages.
Describing Syntax and Semantics.
Module II. Formal methods of Describing Syntax and semantics. Backus Naur Form. Attribute
grammars. Describing semantics - Denotational semantics.
Module III. 2. Data types and ariables - Names - variables . Scope and lifetime. Expression and
assignment Statements. Control structures. Subprograms - parameter passing - overloading - generic
subprograms.
Module IV. Data abstraction and Encapsulation. Polymorphism and inheritance. Features of object
oriented Languages. Smalltalk, C++ and JAVA. Design and implementation issues. Exception handling.
Constructs for concurrency
Module V. Functional programming languages - Lambda calculus- Introduction to pure LISP.
Applications of functional programming languages.
Module VI. Logic programming languages- a brief introduction to predicate calculus - Horn clauses -
Logic programming. Introduction to prolog. Applications of Logic programming.
References
1. James Gosling “Java Programming Language”, Addison Wesley,
2. “Symbolic Logic and Logic Programming”, Learning Material Series, Indian Society for Tech.
Education, 1996
3. Bjarn Stroustrup, “Design and Evolution of C++”, Addison Wesley, 1991
4. Michael J.Gordon, “Programming language Theory and its implementation”, Prentice Hall, 1991
5. Terence W. Pratt, “Programming Languages”, Prentice Hall, Ninth edition 1996
6. Ravi Sethi, “Programming Languages-concepts and constructs”, Addison Wesely, Second Edition,
1996
7. Robert W.Sebesta, "Concepts of Programming Languages",
CS/IT 403 Data Communications
Module I. Introduction - various types of communication systems - Modulation - Need for modulation -
different types - definition - Expression, modulation index, bandwidth - Modulator - (Block level
treatment ) -AM Modulator - Balanced Modulator - FM modulator - Phase modulation
Module II. Transmitters (Block level treatment ) - AM transmitter - Low level, High level, AM stereo
transmitter - FM transmitter - FM stereo transmitter - receivers (Block level treatment ) - AM receiver -
image frequency - super heterodyne receiver - AM stereo receiver - FM receiver - FM Stereo receiver
Module III. Digital transmission - Advantages of digital transmission - sampling - Encoding - Pulse
communication (Block level) - pulse modulation - PAM, PWM, PPM - Modulation schemes - ASK,
FSK, PSK , Quadrature PSK, QAM, data compression, bandwidth consideration - Two tone modulation
- PCM , Delta modulation, PCM transmitter - FSK & PSK transmitter.
Module IV. Components in a data communication system - transmission path - transmission rate -
bandwidth requirements - Shannon's theorem - channel capacity - Bandwidth, Signal/Noise Trade off -
Modems - Switching - Multiplexing - Terminals - digital PBXs
Module V. Error in transmission - factors contributing to error - major impairments - error detection
and forward error - correction - parity code - hamming code - block codes - convolution and cyclic
codes - A R A approach to error control
References
1) Housley , “Data Communication “
2) Kennedy , “Electronic Communication System”
3) Taub & Schilling , “Communication Systems”
4) Uyless D Black , “Data Communication and Distributed Networks”
5) William Stallings, "Data and Computer Communications", Prentice Hall
EB/EI/EC/CS 404 Computer Architecture & Organization
Module I. Basic structure of computer hardware and software - Addressing methods and machine
programme sequencing - Computer arithmetic - logic design and fast adders - multiplication - Booth’s
algorithm -Fast multiplication - integer division - floating point numbers - Control unit - instruction
execution cycle - sequencing of control signals - hardwired control - PLAs - microprogrammed control
- control signals - microinstructions- microprogram sequencing- Branch address modification-
Prefetching of microinstructions- emulation-Bit-slice processors
Module II. Memory organisation-Semiconductor RAM memories-internal organisation-Bipolar and
MOS devices - Dynamic memories - multiple memory modules and interleaving - cache memories -
mapping functions - replacement algorithms - virtual memory - address translations - page tables
memory management units - Secondary memory - disk drives - organisation and operations - different
standards
Module III. Input-output organisations - accessing I/O devices - direct memory access (DMA) -
interrupts - interrupt handling - handling multiple devices - device identification - vectored interrupts -
interrupt nesting - Daisy chaining - I/O interfaces - serial and parallel standards - buses - scheduling -
bus arbitration - computer peripherals - printers - plotters - VDUs -
Module IV. Introduction to microprocessors - Architecture of typical 8 bit microprocessor - Intel 8085
microprocessors - study of functional units. Function of various control signals - Design of CPU
section with buffers and latches. Interrupt structure of 8085.
Module V. Instruction set of 8085 microprocessors - Addressing modes - Programming - examples -
Instruction timing .Memory design - Design of memory using standard chips - Address decoding - I/O
addressing schemes - I/O mapped I/O, and memory mapped I/O techniques.
Text Books :
Hamacher C V, “ Computer Organisation - 3rd Edition“ , Mc.Graw Hill., NewYork ,1990
References :
1) Pal Chaudhary P, “Computer Organisation and Design “ , Prentice Hall, ,
2) Bartee T C, “Digital Computer Fundamentals “, , 1977
3) Hayes J P , “Computer Organisation and Architecture - 2nd Edition “, Mc Graw Hill,
4) Tanenbaum A S , ”Structured Computer Organisation - 3rd Edition”, Prentice Hall,
5) Goankar ,”Microprocessors Architecture Programming and Applications “, John Wiley
6) .Douglas V Hall ,”Microprocessors & Interfacing to 8085 Introduction to”, Tata Mc GrawHill
7) Ghose Sridhar ,”Microprocessors for Engineers and Scientists“
8) Lance A Leventhal,” Introduction to Microprocessors” Prentice Hall
CS/IT 405 Data Structures and Algorithms
Module I. Introduction to data structures. Arrays. Sparse matrices. Strings - representation.
Implementation of abstract data type(ADT) string. Linked Lists. Representation of polynomials using
linked lists. Doubly linked list. Garbage collection. Buddy systems.
Module II. Stacks, implementation of ADT stack using arrays and lists. Typical problems. Conversion
of infix to postfix. Evaluation of postfix expression. Queues and Deques, implementation. Priority
queues
Module III. Trees, definition and mathematical properties. Binary trees. Binary tree traversal- Preorder,
inorder and post order. Expression trees. Threaded Binary Trees. Representation of trees using binary
trees. Search trees. Balanced binary trees.
Module IV. Graphs. Mathematical properties - Degree - connectedness. Directed graphs - Directed
acyclic graphs. Representation using matrix. Graphs traversal. Shortest path. Minimum Spanning Tree -
Kruskal Algorithm. Symbol tables. Binary search. Hash tables. hashing functions.
Module V. File structures. Random Access files. Indexed Sequential Files. B- Trees and B+ trees.
External and internal sorting algorithms.
Note : The course should be Taught using Object Oriented Programming Language JAVA
References
1) Aaron M.Tanenbaum, Moshe J.Augenstein, “Data Structures using C”, Prentice Hall International
Inc., Englewood Cliffs, NJ, 1986
2) Ellis Horowitz and Sartaj Sahni, “ An introduction to Data Structures”, Computer Science Press, ,
1984
3) Gregory L. Heileman, “ Data structures, Algorithms and Object oriented programming”, 1997.
4) Jean Paul Tremblay and Paul G Sorenson, “An introduction to Data Structures with Applications”, ,
1984
5) Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Benjamin/Cummings
Publishing Company Inc., , 1991
6) Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Peach pit Press
Benjamin/Cummings Publishing Company Inc., Redwood City, CA, 1991
7) Michael T. Goodrich and Roberto Tamassia, “ Data Structures and Algorithms in Java”, John Wiley
and Sons, Inc., 1999
8) Michael Waite and Robert Lafore, “Data Structures and Algorithms in Java” , Techmedia, , 1998
9) Robert L.Cruse, "Data Structures and Program Design", Prentice Hall , 3rd ed., 1999
10) Sartaj Sahni, 'Data Structures, Algorithms, and Applications in Java", McGraw-Hill
EC/EB/EI/CS 406 DIGITAL ELECTRONICS LABORATORY
1. Transfer characteristics and specifications of TTL and MOS gate
2. Design of half adder and full adder using NAND gates.
3. Set up R-S & JK flip flops using NAND Gates
4. Code conveters - Binary to Gray and gray to Binary using mode control.
5. Asynchronous UP / DOWN counter using JK Flip flops
6. Design and realisation of sequence generators.
7. Study of shift registers and design of Johnson and Ring counter using it.
8. Binary addition and subtraction (a) 1's complement (b) 2's complement
9. Study of IC counters 7490, 7492, 7493 and 74192.
10. Astable and monostable multi-vibrators using gates - IC version Timing circuit using 555
11. ADC using dual slope method.
12. Study of MUX & Demux
13. ROM & RAM Chips - Verification as memories
CS/IT 407 Data Structures Lab
Implementation and study of algorithms in a suitable programming language for the following
1. Simple Programming Exercises in Java
2. Sorting and Searching
3. Linked List
4. Stacks and Queues and their applications
5. Tree Traversal and Set representatnion.
6. Exercises in graph representation of an application
SEMESTER V
IT/CS 501 System Programming
Module I. Introduction system software and machine Architecture. – Instruction formats and
Addressing modes – Program relocation – linking – one pass and two pass assemblers.- symbol tables
Module II. Loaders and linkers – absolute and bootstrap loader. Data structures for linker and loader
linkage editors dynamic linking
Module III. Macros – macro definition and expansion . algorithms and data structures. Conditional
macro expansion. Generation of unique labels. Recursive macro expansion
Module IV. Compilers – Introduction to grammars – lexical analysis and parsing. Different types of
parsers. Intermediate code generation. Storage allocation. Code generation and optimization
Module V. Operating Systems. General structure. Process management and scheduling. Interprocess
communication. Memory management virtual memory – paging and segmentation. File and device
management – file system concepts
Reference
1. Leland L.Beck, “System Software – An Introuction to System Programming”, Wesely
2. D.M.Dhamdhere, "System Programming and Operating Systems”, 2ond Ed., Tata Mcgrawhill
MRE/IT/ME/EC/EB/EI/SE/ CS 502 Industrial Organisation & Management
Module I
Organisation : Concept of organisation, characteristics of organisation, elements of organisation,
organisational structure, organisation charts, Types of organisation- formal line, military or scalar
organisation, functional organisation, line & staff organisation, project organisation, matrix
organisation, authority and responsibility, span of control, delegation of authority.
Industrial ownership: Types of ownership- single ownership, partnership, joint stock company, co-
operative societies, public sector, private sector, scientific management- review of different schools of
thoughts.
Module II
Personal Management: Recruitment and training, labour turnover, operator training, suggestion
systems.
Industrial safety: working conditions, environmental factors, psychological attitude to work and
working conditions, fatigue, accidents and hazards.
Wages and Incentives: feature of wages, time and piece rate, different incentive plans, profit sharing,
job evaluation and merit rating, factors of comparison and point rating.
Industrial relations: industrial disputes, collective bargaining, trade unions, workers’ participation in
management, labour welfare.
Module III
Marketing Management: Concept of marketing VS sales approach, consumer behaviour and demand
concept, buying motives, influence of income level, product design, new product distribution, pricing
decisions, major price policy considerations, pricing methods and tools, break even analysis and
marginal costing in pricing, sales promotion, marketing research, test marketing, marketing of services,
advertising management- types of advertising, choice of media, economic and psychological factors in
advertising.
Module IV
Finance Management : Tasks, evolution of corporate management, long term financing, equity,
preference and debenture capitals, term loans, dividends and share valuation, legal aspects of
dividends, short term financing, working capital influencing factors, cash budgeting, terms of liquidity,
management of receivable and inventories, budgets and budgetary control-objectives of budgeting,
classification, ratio analysis.
Module V
Management accounting: Fundamentals of book keeping, journalising, ledger accounts, subdivision of
journal, cash book, banking transactions, trial balance, preparation of trading, profit and loss account,
and balance sheet, adjustments.
REFERENCES
1. Industrial Organisation and Management : et.al, McGraw Hill
2. Principles of Industrial Management : Kootnz & Donnel
3. Financial Management : Prasanna Chandra, Tata McGraw Hill
4. Operation Management : Fabricky et al, Tata McGraw Hill
5. Hand Book of MBO : Reddin & Ryan, Tata McGraw Hill.
6. Industrial finance of : SK Basu
7. First steps in book keeping : J B Batliboi
8. Management accounting : Hingrani & Bemnath.
EB/EI/CS/EC 503 Microprocessor System Design
Module I. Interfacing of Peripheral Chips with 8085 :- Programmable peripheral interface ( Intel 8255 )
- Programmable communication interface ( Intel 8251 ) - Programmable interval timer(Intel 8253 and
8254). Programmable Keyboard /display controller(Intel 8279). Programmable Interrupt
Controller( 8259) - DMA controller (Intel 8257)-- block diagram, interfacing, initialisation program
and its application s. Serial and parallel bus standards - RS 232 C , IEEE 488, Centronics
Module II. Architecture of typical 16 bit microprocessors ( Intel 8086 ) - Memory address space and
data organisation - Segment registers and memory segmentation - I/O address space - Addressing
modes - Comparison of 8086 and 8088 - Basic 8086/8088 configuration - Minimum mode - Maximum
mode - System timing. – bus interface. Interrupts and interrupt priority management.
Module III. Instruction set, Assemblers, Assembly level programming and programming examples in
8086.Introduction to IBM PC Architecture, peripherals & interface buses.
Module IV. Introduction to 80386 ,80486,and Pentium family processors,- - interrupts and exceptions
management of tasks - - Real, protected and virtual mode- Super scalar architecture , intelligent branch
prediction and pipelining .Introduction to Pentium and Pentium pro architectures. Introduction to RISC
& CISC architecture .
Module V. Introduction to microcontrollers - comparison with microprocessors - Study of
microcontroller (MCS 51 family) - Architecture , instruction set, addressing modes and
programming .,typical applications.
References :-
1) YU-Cheng Liu & Glenn A Gibson,” Microprocessor System , Architecture Programming & Design
2) V Hall,” Microprocessors & Interfacing-” TMH
3) Avtar Singh , “IBM PC/ 8088 Assembly Language Programming”
4) Scott Muller , “Upgrading and repairing IBM Pcs”
5) James L Hardey , “Advanced 80386 Programming Techniques
6) Intel Users manual for 8086, 80386 & 80486, Pentium & Pentium pro
7) “Microprocessor Systems”, Learning Material Series, ISTE, NewDelhi,1997
CS 504 Automata Languages and Computation
Module I. systems - Non Deterministic Finite Automata and Deterministic Finite Automata.
Equivalence of NFA and DFA. Equivalence of NFA with and without epsilon moves.
Module II. Regular expressions - Equivalence of Finite Automata and regular expressions. Finite
Automata with output. and Meelay Machines. Equivalence of Moore and Meelay machines.
Applications - Lexical Analysers. Properties of regular sets. Pumping Lemma for regular sets. Closure
properties. Decision algorithms. Myhill Nerode’s theorem and Minimisation of Finite Automata.
Minimisation algorithm.
Module III. Context Free Grammars. - Derivation of Languages - Derivation trees. Ambiguity.
Simplification. Chomsky Form and Greibach Normal Form. Push Down. Automata. Deterministic Push
Down Automata. Equivalence of Push Down Automata and Context Free Languages. Pumping Lemma
for Context free languages. Closure properties. Decision Algorithms.
Module IV. Turing machines - Computation - languages and functions. Techniques for Turing machine
construction - storage in finite control - multiple tracks - checking of symbols, shifting over -
subroutines. Non Deterministic Turing machines.
Module V. Undecidability - Recursive and recursively enumerable functions. Universal Turing
machine. Halting problem of Turing machine. Chomsky Hierarchy - Equivalence of regular grammar
and Finite Automata. Equivalence of Unrestricted grammar and Turing Machine. Context Sensitive
Grammars. Equivalence of Context Sensitive languages and Linear Bound Automata(LBA). Relation
between classes of Languages.
Text Books
1. J.E.Hopcroft, J.D.Ullman , “Introduction to Automata Theory, Languages and Computation”,
Addison Wesley, 1990
2. K.L.P.Misra, N.Chandrasekharan, “Theory of Computation”, Prentice Hall, 1998
References:-
1) H.R.Lewis, Shistos H.Papadimitrou, “Elements of Theory of Computation”, Prentice Hall , , 1991
2) John Martin, “Introduction to Language and Theory of Computation”, Tata McGraw-Hill, , 1998
3) Peter Linz, An Introduction to Formal Languages and Automata, Narosa Publications, 2000
4) Thomas A.Sudkamp, “Languages and Machine - An Introduction to Computer Science”,
Addison Wesley, , 1990
CS/IT 505 Data Base Management Systems
Module I. Data Abstraction - Data Models - Instances and schemes - Data independence - Data
Definition language - Data Manipulation Language - Database Manager - Database Administrator.
Overall system structure. Entity relationship model - Entities and relations -E-R diagram. Design of E-
R database scheme.
Module II. Relational model - Relational algebra - Relational calculus. Network model - basic concepts
- DBTG CODASYL model -Data retrieval and update - Mapping networks to files. Hierarchical
models - basic concepts - Tree structure - Data retrieval and update -Virtual records - mapping
hierarchies to files.
Module III. Relational commercial languages - Structured Query languages (SQL) - Query by example.
Integrity constraints - Domain constraints - Referential integrity - Functional dependencies -Assertions
and triggers. Relational Database Design. Normal forms. Normalisation using functional dependencies
- multivalued dependencies and Join dependencies - Domain Key Normal Form.
Module IV. Query processing - Query interpretation. Equivalence of expressions - join strategies for
parallel processing. Query optimisation. Crash recovery - failure classification - recovery mechanisms -
shadow paging - stable storage mechanisms. Concurrency Control - Schedules - serializability - Lock
based protocols - Time stamp based protocols. Transaction processing - storage model. - recovery from
transaction failure. Deadlock handling.
Module V. Distributed Databases - structure and design - Distributed query processing. Recovery -
Commit protocols - concurrency controls. Deadlock handling. Object oriented databases - object
structure - class hierarchy - Multiple inheritance - object identity - physical organisation - object
oriented queries.
Case study
Oracle/Ingres/Postgress
References
1) “Data Base Management Systems”, Learning Material Series, Indian Society for Technical
Education, , 1996.
2) Arun K. Majumdar, Pritmoy Bhatacharya, “Data Base Management Systems”, Tata McGraw-Hill,
1997
3) C.J.Date, “An Introduction to Database Systems”, 7th ed. , Addison Wesley,
4) Fred R. McFadelen and J.A.Hoffer, “Modern Data base Management“ , Benjamin/Cummings
Publishing Company Inc., Redwood City, CA, 1992
5) H.F.Korth, A Silberschatz and S.Sudarsan, “Database System Concepts”, Computer Science Series,
McGrawHill, 1997
6) J.D.Ullman, “Principles of Data Base Systems”, Computer Science Press, , 1991
7) Ramez Elmasri, Shamkant B.Navathe, “Fundamentals of Database Systems”, Benjamin/Cummings
Publishing Company Inc., , 1994
8) Reghu Ramakrishnan, Johannes Gehrke, "Database Management Systems", McGraw-Hill
International Edition, 2000
EB/EC/CS 506 Microprocessor Lab
1. Study of typical Microprocessor trainer kit and its operation.
2. Simple programming examples using 8085 instruction set. To understand the use of various
instructions and addressing modes, Monitor routines - at least 30 examples have to be completed.
3. Programming examples to initialise 8255 and to understand its I/O operations
4. Programming examples to initialise 8251 and its operations
5. Programming examples to initialise 8253 and its operations.
6. Programming examples to initialise 8279 and its operation.
7. Demonstration of cassette interface
8. Demonstration of programming of different types of EPROMS 2716, 2732 etc.
9. A/D AND D/A Converter interface
10. Interfacing 8255 port to high power devices
11. Demonstration of stepper motor interface.
CS 507 System Programming and Hardware lab
Programming Assignments
1) Familiarisation of PC Architecture, interface cards
2) Introduction to low level programming
3) Introduction to assembly language programming in a suitable assembly language
4) Symbol tables
5) Different passes of the assemblers
SEMESTER VI
EI/EC/CS 601 Digital Signal Processing
Module I. Introduction to discrete time signals & system - Discrete time signals and systems -
Properties of discrete systems - linearity - time invariance - causality - stability - convolution -
difference equation representation of discrete systems - The Z transform - properties of Z transform -
the inverse Z transform - System function.
Module II. Discrete Fourier Transform & Fast Fourier Transform. Discrete Fourier series - properties -
discrete fourier transform - properties - block convolution - decimation in - time FFT algorithms -
decimation in - frequency FFT algorithms - FFT algorithms for N a composite number.
Module III. FIR Digital Filters Realizations - direct - cascade - lattice forms - hardware implementation
- FIR filter design using Fourier series - use of window functions - frequency sampling design.
Module IV. IIR Digital Filters Realizations - Direct - Cascade - Parallel forms - hardware
implementation - Analog filter approximations - Butterworth and chebychev approximations - The
method of mapping of differentials - impulse invariant transformation - Bilinear transformation -
Matched Z transform technique.
Module V. Finite word length effects in digital filters - Fixed point arithmetic - Floating point
arithmetic - Block floating point arithmetic - Truncation - Rounding - Quantization error in analog to
digital conversion - finite register length effects in IIR & FIR filters Limit cycles. Digital signal
processing application (Only brief description required) Soft ware implementation of digital filters-
Architecture of typical DSP processor .
Reference :-
1) Oppenheim & Ronald W Schafer,” Digital Signal Processing”, Prentice Hall
2) .Andreas Antoniou , “Digital Filters Analysis & Design”,
3) R Rabiner & B. Gold , “Theory & Application of Digital Signal processing”,
4) Andreas Antoniou , “Digital Signal Processing”, Prentice Hall
5) John G Proakis & Dimitris G Manolakis ,”Digital Signal Processing “, Prentice Hall
6) Sanjit K.Mithra , , “Digital Signal Processing”, Tata Mc –Graw Hill.
7) Douglas K.Lindner, “Introduction to signals &Systems” Mc Graw Hill.
CS/IT 602 Operating Systems
Module I. Introduction to Operating Systems. Extended Machine - Operating System Structure .
Processes - Interprocess Communication - Race Conditions - Critical Sections - Mutual Exclusion -
Busy Waiting - Sleep And Wakeup - Semaphores - Event Counters - Monitors - Message Passing.
Process Scheduling - Round Robin Scheduling - Priority scheduling - multiple queues - Shortest Job
First - Guaranteed scheduling - Two-level scheduling.
Module II. Memory management. Multiprogramming. Multiprogramming and memory usage -
Multiprogramming with fixed partitions. Swapping - multiprogramming with variable partitions -
Memory management with bit maps, linked lists, Buddy system - allocation of swap space. Virtual
memory - paging and page tables, associative memory - inverted page tables. Page replacement
algorithms. Design issues for paging systems - Working set model. Example systems.
Module III. File systems and I/O files. Directories - File system implementation - security and
protection mechanisms. Principles of I/O hardware - I/O devices - device controllers - DMA. Principles
of I/O software - interrupt handlers - device drivers - Disk scheduling - clocks and terminals.
Module IV. Deadlock - conditions for deadlock - deadlock modelling. Deadlock detection and recovery.
Deadlock avoidance - resource trajectories - safe and unsafe states - bankers algorithm. Deadlock
prevention. Two phase locking – non-resource deadlocks - starvation.
Module V. Introduction to distributed operating systems - distributed systems - design issues. Client
server model. Remote procedure call. Synchronisation in distributed systems - clock synchronisation -
concurrency control - Deadlocks in distributed systems. Process management - threads - system models
- processor allocation algorithms - distributed file systems.
Case Study
UNIX operating system
Text Book
Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall, 1991
Reference
1) Bach, M.J., “Design of UNIX Operating System”, Prentice Hall
2) Charles Crowley, “Operating systems – A Design Oriented Approach”, Tata McGrawhill, 1997
3) D.M.Dhamdhere, “System Programming and Operating Systems”, Tata McGraw-Hill,1996
4) Deital, H.M., “Operating Systems”, Addison Wesley, 1992
5) Garry Nutt, “Operating Systems – A Modern perspective ”, Second Edition, Addison Wesley, 2000
6) Pradeep K.Sinha, “Distributed Operating Systems”, Tata McGrahill, 1998
7) Silberschatz et.al., “Operating System Concepts”, Addison Wesley, 1993
8) William Stallings, “Operating systems”, Prentice Hall, 1997
CS 603 Software Engineering
Module I. Software Engineering Paradigms - Classic life cycle - spiral model. Software metrics -
Software productivity and quality - Size oriented and function oriented metrics. Software project
management - software project estimation. Line of Code and function point estimation. Empirical
estimation - COCOMO model Putnam estimation. Automated estimation tools. Project planning -
project scheduling - Software Reengineering.
Module II. System and Software Requirement Analysis. Computer Systems Engineering - System
Analysis - Modelling the system architecture - requirement analysis. Structural analysis and its
extensions. Basic notations - Data flow diagrams. Behaviour modelling. Object oriented analysis and
data modelling - Object oriented concepts - Object oriented analysis and modelling - Data modelling
concepts. Alternate models - Data structure oriented methods - system development - Formal
specification.
Module III. Software Design Fundamentals - Abstraction - Refinement - Modularity - Information
hiding. Effective modular design - Architectural Design - Procedural design. Data flow oriented design
- Transform analysis - Transaction Analysis. Object Oriented design. Object Oriented Design Concepts
- Objects -operations and messages. Design issues. Classes, Instances and Inheritance. Object oriented
Design methods - Classes and object Definition. Notation for Object Oriented Design.
Module IV. Data oriented Design methods - Design and Data structures - system development - Data
structured Systems development. user Interface Design- Human-Computer Interface design -
Guidelines - Interface standards. Real time design. Real-time systems - integration and performance
issues - Interrupt handling - Real time databases - operating systems and languages. Task
synchronisation and communication. Mathematical tools. Design methods.
Module V. Programming Language and coding. Language characteristics. Software quality assurance-
formal technical reviews - software quality metrics. Formal methods. Proof of correctness. Software
reliability. Reliability models. Software testing techniques - Different methods of testing - Testing for
real-time systems. Automated testing tools. Software testing strategies. Software maintenance.
Software configuration management. Computer Aided Software Engineering(CASE). Tools for project
management - support - Analysis and design - programming and testing. Prototyping tools. Case and
Artificial Intelligence. Software standards - Capability Maturity Model - SEI levels. ISO standards.
Alternate Software Development Paradigms - Open Source Software Development -issues
References
1) Ali Bahrami, "Classical and Object Oriented Software Engineering", McGrawHill International,
1999
2) Ali Behforooz and Frederick J.Hudson, "Software Engineering Fundamentals", Univeristy Press,
1996
3) Booch G.,” Object Oriented Design”, Benjamin Cummings, 1990
4) Brooks F., “The Mythical Man Month”,
5) Edward Yourdon, “Modern Structured Analysis” , Prentice hall India Ltd., , 1996
6) Eric S. Raymond, "Bazar and the Cathedral, http://www.opensource.org/
7) Ian Sommerville, “Software Engineering”, 5th ed., Addison Wesley, 1997
8) James Rumbaugh et al , “Object oriented Modelling and Design”, Prentice hall India Ltd., 1992
9) Roger S Pressman, “Software Engineering , A Practitioners Approach”, McGraw-Hill Inc., 4th
edition , 1992
CS 604 Compiler Construction
Module I. Introduction to compilers - Different Phases. Lexical Analysis - input buffering -
specification of tokens - Recognition of tokens - lexical Analyser generators - lex - Finite Automata -
Regular expressions to finite automata . Design of lexical analysers generator.
Module II. Syntax Analysis. Context free grammar - Elimination of ambiguity - elimination of left
recursion. Top down parsing - Recursive descent parsing - predictive parsers Construction of predictive
parsing tables. Bottom Up Parsing - Shift reduce parsing Operator precedence parsing - precedence
relations and functions. LR parsers - LR parsing algorithms - LR grammars - Construction of SLR,
Canonical and LALR parsing tables. Parser generators - Case study - Yacc.
Module III. Syntax directed Translation. Syntax directed definitions - Synthesised and inherited
attributes - Dependency graphs. Construction of syntax trees - syntax tree. Bottom up evaluation of S-
attributed definition - L -attributed definitions. Type checking - type systems - static and dynamic type
checking.
Module IV. Run time Environment. Storage organisation schemes - Activation records - Compile time
layout. Storage allocation strategies - static allocation - stack allocation - heap allocation. Accessing
non-local names. Parameter passing mechanisms.
Module V. Symbol tables -representing scope information. Intermediate code generation - intermediate
languages - declaration and assignment statements. Code generation. issues - memory management -
instruction selection - register allocation. Runtime storage allocation. basic blocks and flow graphs.
Code optimisation. Principal sources of optimisation - function preserving transformations - common
subexpressions - copy propagation - dead-code elimination - loop optimisation - code motion - strength
reduction.
Text Books
Alfred V.Aho et.al., “Compilers: Principles, Techniques and Tools”, Addison Wesley Publishing
Company, 1986
References
1) Alfred V.Aho, Jeffrey D. Ullman., “Principles of Compiler Design”, Narosa Publishing House, 1990
2) Allen Holub, “Compiler Design in C”, Prentice Hall India Pvt. Ltd., 1991
3) Arthur B. Pyster, “Compiler Design and Construction”, Van Nostrand Reinhold Company, ,1993
4) David Gries, “Compiler Construction for Digital computers”, John Wiley and Sons,1980
5) Henk Albalas, “Albert Nymer, Practice and Principles of Compiler Building with C”, Prentice Hall,
1996
6) Jean Paul Tremblay, “Introduction to Compiler Writing”, McGrawhill,1988
7) “Compiler Construction” , Learning Material Series, Indian Society for Technical Education, , 1996.
EB/EI/CS/EC 605 Control Systems Engineering
Module I. Basic idea of control systems and their classification - differential equations of systems -
linear approximation - Laplace transform and transfer function of linear system - Model of physical
system ( Electrical, mechanical and electromechanical )- block diagram - signal flow graph - Mason’s
gain formula.
Module II. Time domain analysis - Representation of deterministic signals - First order system response
- S-plane root location and transient response - impulse and step response of second order systems -
performance - characteristics in the time domain - effects of derivative and integral control - steady
state response - error constant - generalised definition of error coefficients - concepts of stability -
Routh - Hurwitz criterion.
Module III. Frequency domain analysis - frequency response - Bode plot, Polar plot, Nicol's chart -
closed loop frequency response and frequency domain performance characteristics . Stability in the
frequency domain . Nyquist criterion.
Module IV. Root locus method - basic theory and properties of root loci - procedure for the
construction of root loci - complete root locus diagram. Design and compensation of feed back control
system :- approaches to compensation - cascade compensation networks and their design in the
frequency domain - simple design in S-plane.
Module V. State variable methods :- introduction to state variable concepts - state variable description
of linear dynamic systems - representation in matrix forms - block diagram and signal flow graph
representation of state equations - Transfer matrix from state equations - transition matrix - general
solution for linear time invariant state equations. Control system components :- Error detectors ,
servomotor, tachogenerator, servo amplifier, magnetic amplifier, rotating amplifier - Basic principles of
adaptive control systems.
References:-
1) Ogata K, “ Modern Control Engineering”, Prentice Hall
2) Kuo B. C , “Automatic Control System”, Prentice Hall
3) Nagarath & Gopal, “ Control System Engineering”, Wiley Eastern
4) M Gopal, “ Control Systems principles and design” , Tata Macgraw Hill
CS 606 Compiler Design Lab
1. Lexical Analysis - regular expression. Lexical Analyser generator- Use of Lex to generate scanners.
2. Writing parsers - Recursive descent parsers. Development of LALR(1) parsers using yacc
3. Symbol tables and intermediate code generation.
4. Developing a compiler for a subset of a programming Language.
Elective I
CS 705(B) Simulation and Modelling
Module I. Basic Simulation modelling. The Nature of simulation - systems, models and simulation -
Types of simulation - continuos and Discrete simulation - Application of simulation. Digital simulation
of continuos system.
Module II. Generation of random numbers - statistical test for randomness - generation of random
varieties. Discrete systems simulation -Components and organisation of discrete event simulation
model - Time advance mechanisms - Event to Event model and fixed time incremental model. Basic
structure of queuing model - steady state and transient conditions - Birth and Death process -
Simulation of queuing systems.
Module III. Simulation software - comparison of simulation languages with general purpose languages
- classification of simulation software. Modelling approaches - common modelling elements - desirable
software features - General features of GPSS, SIMSCRIPT and SIMULA.
Module IV. Model Development process - introduction and definitions - principles of valid simulation
modelling - verification of simulation computer programmes - general perspectives on validation -
three step approach for developing valid and credible simulation models.
Module V. Introduction to visualisation in scientific computing - flow visualisation and volume
visualisation - distributed and parallel visualisation - applications. High performance architecture for
scientific computing - vector processors - multiple memory modules - attached vector processors -
multiprocessor architecture.
Text Book
Averil M Law, David Kelton W, “Simulation Modelling and Analysis”, 2nd edition, Tata McGraw Hill,
References
1) Hugh J Watson, John H.Blackstone Jr., “Computer Simulation”, 2nd edition, Wiely Eastern
2) Harold S.Stone “High Performance Computer Architecture”, 3rd edition, Addison Wesley
3) Kai Hwang, “Advanced Computer Architecture”, Mc-Graw Hill Inc.,
4) Hamacher.C.V, “Computer Organisation”, McGraw-Hill, 4th edition, , 1996
Elective I
EB/EC/CS 705(C) Artificial Neural Networks
Module I. Fundamentals of ANN – Biological prototype – Neural Network Concepts, Definitions -
Activation. Functions – single layer and multilayer networks. Training ANNs – perceptrons – Exclusive
OR problem – Linear seperability – storage efficiency – perceptron learning - perceptron training
algorithms – Hebbian learning rule - Delta rule – Kohonen learning law – problem with the perceptron
training algorithm.
Module II. The back propagation Neural network – Architecture of the back propagation Network –
Training algorithm – network configurations – Back propagation error surfaces – Back propagation
learning laws – Network paralysis _ Local minima – temporal instability
Module III. Counter propagation Networks – Architecture of the counter propagation network –
Kohonen layer – Training the Kohonen layer – preprocessing the input vectors – initialising the weight
vectors – Statisitical propertie. Training the Grossberg layer- Feed forward counter propagation Neural
Networks – Applications.
Module IV. Statistical methods – simulated annealing – Bloltzman Training – Cauchy training
-artificial specific heat methods. Application to general non-linear optimization problems – back
propagation and cauchy training.
Module V. Hopfield net – stability – Associative memory – statistical Hopfield networks – Applications
– ART NETWORKS – GENETIC ALGORITHMS –Bidirectional Associative memories- retreiving
stored information. Encoding the association – continous BAMS
References
1) Linus Fe, Neural Network in Computer Intelligence , McGrawHill
2) Philip D.Wasserman, Neural Computing(Theory and Practice)
3) Robert Hecht-Nilson, Neuro Computing
4) James A.Anderson, An Introduction to Neural Networks
5) Jack M. Zureda, Introduction to Artificial Neural Systems