Cusat B.tech Semester 8 syllabus (1999,2000,2001 admissions)

SEMESTER VIII

CS 801 Advanced Architecture and Parallel Processing

Module I. Introduction to Parallel Processing-Shared Memory Multiprocessing-Distributed Memory-Parallel Processing Architectures- Introdution-Parallelism in sequential Machines—Abstract Model of Parallel Computer – Multiprocessor Architecture- Array Processors.

Module II. Pipelining and Super Scalar Techniques-Linear Pipeline Processors-Non-Linear Pipeline processors-Instruction pipeline design-Arithmetic pipeline Design- Super Scalar and Super pipeline Design.

Module III. Programmability Issues-An Overview-Operating system support-Types of Operating Systems-Parallel Programming models-Software Tools-Data Dependency Analysis- Types of Dependencies-Program Transformations.

Module IV. Shared Memory Programming-Thread –based Implementation-thread Management-Attributes of Threads- Mutual Exclusion with Threads- Mutex Usage of Threads- Thread implementation-Events and Conditions variables-Deviation Computation with Threads-Java Threads Distributed Computing –Message Passing Model-General Model-Programming Model- PVM.

Module V. Algorithms for Parallel Machines- Debugging Parallel programming –Other Parallelism Paradigms -Distributed Data Bases-Distributed Operating Systems.

Text Books

1. Kai Hwang, “Advanced Computer Architecture: Parallelism, Scalability, Programmability”, McGRawHill International Edition, 1993.

2. M.Sasikumar, et.al., "Introduction to Parallel Processing", PHI, New Delhi, 2000

References

1. P. Pal Chaudhuri , “Computer Organisation and Design”, PHI, New Delhi, 1994.

2. William Stallings, “Computer Organisation and Architechture”, PHI, New Delhi, 1996.

3. “Proceedings of Third International Conference on High Performance Computing”, IEEE, Computer Society Press , California, USA, 1996.

4. “Parellel Processing”, Learning Material Series, Indian Society for Technical Education, New Delhi, 1996.

5. V.Rajaraman, C. Siva Ram Murthy, "Parallel Computers Architecture and Programming", PHI, New Delhi, 2000

CS 802 Artificial Intelligence

Module I. Introduction - Problem spaces and search - Production systems - Characteristics. Heuristic search techniques - Generate and Test - Hill climbing -Best fit. Graph search - A* algorithm. Problem reduction - constraint satisfaction - Means and End analysis. Gameplaying - Minimax - Alpha-beta cut-off.

Module II. Logic and Deduction. Introduction to symbolic logic - Propositional logic - Well Formed Formula. Predicate Logic - predicates variables and constants - First order logic,Quantifiers. Forward chaining and Unification. Goal trees. Resolution by refutation.

Module III. Natural Language Processing - Levels of language. Expressing rules of syntax. Context Free Grammars. Dictionaries. Transformational grammar. Syntactic parsing. Top Down and Bottom up parsing. Transition Networks. Augmented Transition networks.(ATN). Syntax to Semantics. Case grammar - Syntactic use of Semantic knowledge. Problems of parsing Indian languages.

Module IV. Representing Knowledge. Procedural versus Declarative. Reasoning under uncertainty - Nonmonotonic reasoning - Statistical reasoning. Bayesian networks. Expert systems.- representing and using Domain knowledge - Expert system shell. Fuzzy Logic - Fuzzy sets - Fuzzy model - Fuzzy rule generation - Fuzzy inference systems. Fuzzy rule based expert systems.

Module V. Learning - Formal theory of learning. Neural Net learning. Introduction to Artificial Neural networks -Perception - Multi-Layer perceptron - Back Propagation algorithm - Unsupervised learning - Kohonen’s Network. Neuro-Fuzzy systems. Typical Applications.

References

1) Akshar Bharati, Vineet Chaitanya, Rajeev Sangal, “Natural Language Processing: A Paninian Perspective”, Prentice Hall India Ltd., New Delhi, 1996

2) Dan W.Patterson, “Introduction to Artificial Intelligence and Expert Systems”, Prentice Hall India Ltd., New Delhi, 1996

3) Elaine Rich and Kevin Knight, “Artificial Intelligence”, Tata McGraw-Hill Publishing Company Ltd., New Delhi, 1990

4) Eugene Charmiak, Drew McDermott, “Introduction to Artificial Intelligence”, Addison Wesley , Reading, Massachusetts, 1985

5) Nils J.Nillson, ‘Principles of Artificial Intelligence”, Morgan Kauffman Publishers Inc., Palo Alto, California

6) Rober J,. Schalkoft, “Artificial Intelligence, An Engineering Approach”, McGraw-Hill Publishing company, New York 1990

7) Winston, P.H., “Artificial Intelligence”, Addison Wesley Publishing House, Reading, MA

IT/CS 803 Internet Working

Module I. Introduction and overview – need for Internet – Internet architecture – Interconnection through IP gateways – TCP/IP layering – structure of TCP/IP software in an Operating system.

Module II. Network Interface Layer – Buffer management – Demultiplexing incoming packets – ARP : conceptual organization of ARP software – data structures for ARP cache – Input and Output processing – ARP cache management IP: IP software design – IP software organisation and datagram flow – IP: Routing – Routing table organisation – Data structures – Routing a datagram –ICMP message Formats – Implementation of ICMP messages.

Module III. TCP : Overview of TCP software – Transmission Control Blocks – TCP segment format - TCP finite state machine – Example State Transition – Declaration of the Finite State machine – TCB Allocation and initialisation.

Module IV. Client Server model and Software design – Concurrent processing in Client Server Software – Program interface to protocols – Socket interface – Algorithms and Issues in Client S/W design.

Module V. Algorithms and Issues in Server S/W design – Interactive connectionless Servers – Interactive connection oriented Server – Concurrent connection oriented Server Concurrency in Servers – Concurrency in Clients . Remote Procedure Call Concept – NFS concepts

Reference

1) Behrouz A.Farouzan, TCP/IP Protocol Suite, McGraw-Hill International Edition, 2000

2) Daniel Minoli, Internet and Intranet Engineering, Tata McGraw-Hill, 1999

3) Douglas E.Comer, Computer Networks and Internets, Prentice Hall, Second Ed., 1999

4) Douglas E.Comer, Internetworking with TCP/IP Volume II & III, Prentice Hall

CS 804 Distributed Computing

Module I. Distributed systems – architecture. Key characteristics – resource sharing openness –concurrency – scalability – fault tolerance – transparency. Design issues – naming – communication – software structure – workload allocation – consistency maintenance. User requirement – functionality – Quality of service – reconfigurability. Review of network protocols. Interprocess communication- building blocks – client server communication group communication. Interprocess communication in UNIX. Remote procedure calling. Design issues – interface definition language exception handling. Implementation - interface processing – communication handling. Binding. Case study – sun RPC – Java RMI.

Module II. Distributed Operating systems- kernel – processes and threads – Naming and protection - Communication and Invocation – virtual memory. Distributed file service - design issues – interfaces – implementation techniques. Case study sun NFS. Name service SNS and DNS.

Module III. Time and co-ordination. Synchronizing physical clocks -logical time and logical clocks. Distributed co-ordination –distributed mutual exclusion – elections. Replication – basic architectural model – consistency and request ordering.

Module IV. Shared data and transactions – client server – fault tolerance and recovery – transactions – nested transactions. Concurrency control - locks – optimistic concurrency control – timestamp ordering. Distributed transactions – atomic commit protocols – concurrency control in distributed transactions – distributed deadlocks – transactions with replicated data.

Module V. Recovery and fault tolerances. Transaction recovery – logging -shadow versions – fault model for transactions. Fault tolerance – characteristics. Hierarchical and group masking of faults. Security – authentication and key distribution – logic of authentication – digital signatures.

References

1) C.A.R.Hoare, “Communicating Sequential Processes”, Prentice Hall, 1980

2) Dimitri P.Bertsekas, John N.Tsitiklis, “Parallel and Distributed Computation : Numerical Methods”, Prentice Hall International, Inc., 1989

3) Douglas Comer and David L.Stevens, “Internetworking with TCP/IP Vol III: Client server Programming and Applications”, Prentice Hall, New York, 1990

4) George Coulouris, et. al., “Distributed Systems – Concepts and Design”, Second ed., Addison Wesely, 2000

5) Gerard Tel, “Introduction to Distributed Algorithms”, Cambridge University Press, 1994

6) H.S.M.Sedan, “Distributed Computer systems”, Butterworths, London, 1988

7) Joel M.Crichlow, “Introduction to Distributed and Parallel Computing”, Prentice Hall, New York, 1988

6. M.Sasikumar, et.al., "Introduction to Parallel Processing", PHI, New Delhi, 2000

Elective II

CS 805 (A) Electronic Commerce

Module I. Banking on the internet-investing on the internet-doing business on the internet-threats to e-commerce -e-commerce security

Module II. The web clients- introduction to JavaScript, vbscript-form validation - tables in html.

Module III. The web-server- Server side scritping , different technologies -Active server pagess(ASP) objects in ASP- perl - Java servlets request and response objects, cookies, mailing, database objects

Module IV. Secure channels-stored account payment systems-first virtual-cybercash -secure electronic transaction-stored value payment systems-pros and cons how e-cash works-securing e-cash-representing e-cash-e-cash-cyber coin-smart cards-mondex-visa cards.

Module V. Securing operating systems-firewall security-the network server vulnerabilities-defending the server -certifying components for security

References:

1. E-commerce security-Anup.K.Ghosh, Wily computer publishing

2. E-commerce, the cutting edge of business-kamalesh K bajaj, Debjani nag, TMH publishing

3. Active Server Pages-Unleashed-Sams Press

4. Web Commerce Technology, Daniel Minoly, Tata McGrawhill,

Elective II

CS 805 (B) Software Architecture

Module I. Software Architecture –Introduction-Architectural Styels-Pipes and Filters-Data Abstraction and Object Oriented Organization-Event based, Implicit Invocation-Layered Systems-Repositories-Interpreters-Process Control-Process control Paradigms-Software Paradigm for Process Control-Distributed processes-Main program / subroutine organizations – Domain – specific software architecture – heterogeneous architectures .

Module II. Shared Information Systems – Data base integration –Batch sequential – Simple Repository – Virtual Repository – Hierarchical Layers – Evolution of Shared Information Systems in Business Data Processing – Integration in Software Development Environments – Integration in Design of Buildings- Architectural Structures for Shared Information Systems.

Module III. Architectural Design Guidance- Guidance for User-Interface Architectures -Design Space and rules-Design Space for User Inter face Architectures-Design. Rules for User Interface Architecture applying the Design Space – Example – A Validation Experiment – How the Design Space Was Prepared .

Module IV. Value of Architectural Formalism – Formalizing the Architecture of a Specific System – Formalizing an Architectural Style – Formalizing an Architectural Design.Linguistic Issues – Requirements for Architecture - Description Languages - First Class Connectors – Adding Implicit Invocation to Traditional Programming Languages .

Module V. Tools for Architectural Design – UniCon : Universal Connector Language – Exploiting Style in Architectural Design Environments –Architectural Interconnection – Education of Software Architects.

Reference

Mary Shaw, David Garlan, "Software Architecture", Prentice Hall India, 2000

Elective II

IT/CS 805 (C) Algorithms and Complexity

Module I

Review of concepts : Algorithms and Complexity – Models of computation – Sorting Algorithms and order statistics – set manipulation problems – Algorithms on graphs and digraphs – pattern matching algorithms-NP complete problems.

Module II

Dynamic Programming : Introduction-matrix multiplication and optimal binary search trees-approximate string matching-distances in graphs and digraphs.

Module III

Matrices and Fast Fourier Transforms : strassen algorithm – matrix inversion- decomposition- Boolean matrix multiplication-Fast Fourier Transform and applications.

Module IV

Integer and Polynomial arithmetic – integer and polynomial multiplication and division – modular arithmetic – Chinese remaindering – Euclid’s Algorithm-Polynomial GCDs-sparse polynomial.

Module V

Parallel Algorithms-Parallelism-PRAM and other models – PRAM and other models-PRAM algorithms – handling write conflicts- merging and sorting-parallel connected component algorithm – lower bounds.

References :-

1. Brassard G and Brately P Algorithmics : Theory and Practice, Prentice Hall, 1988.

2. Atho A V , Hopcroft J E and Ullman J D, The Design and Analysis of Computer Algorithms, Addison Wesley, 1974.

3. Melhron K, Data Structure and Algorithms, Volume II and III, Springer – Verlag, 1984.

4. Baase S, Computer Algorithms : Introduction to Design and Analysis (Second Edition), Addison Wesley, 1993.

Manber U , Introduction to Algorithms : A creative approach, Addison-Wesley, 1989.

CS 806 Major Project

CS 807 Viva Voce

Cusat B.tech Semester 6 syllabus (1999,2000,2001 admissions)

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 India

2) .Andreas Antoniou , “Digital Filters Analysis & Design”, Prentice Hall India

3) R Rabiner & B. Gold , “Theory & Application of Digital Signal processing”, Prentice Hall India

4) Andreas Antoniou , “Digital Signal Processing”, Prentice Hall India

5) John G Proakis & Dimitris G Manolakis ,”Digital Signal Processing “, Prentice Hall India

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 - Jackson 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 - Jackson 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", Oxford 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., New Delhi, 1996

6) Eric S. Raymond, "Bazar and the Cathedral, http://www.opensource.org/

7) Ian Sommerville, “Software Engineering”, 5^th 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., 4^th edition New York, 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, New York,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, New Delhi, 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.

CS 607 Minor Project

Cusat B.tech Semester 5 syllabus (1999,2000,2001 admissions)

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”, Addison 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 : Bethel 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 India : 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) Douglas 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. Finite State 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. Moore 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 Normal 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 India, New Delhi, 1991

2) John Martin, “Introduction to Language and Theory of Computation”, Tata McGraw-Hill, New Delhi, 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, Reading , MA, 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, New Delhi, 1996.

2) Arun K. Majumdar, Pritmoy Bhatacharya, “Data Base Management Systems”, Tata McGraw-Hill, 1997

3) C.J.Date, “An Introduction to Database Systems”, 7^th ed. , Addison Wesley, Reading, MA, 20000

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, Rockville, 1991

7) Ramez Elmasri, Shamkant B.Navathe, “Fundamentals of Database Systems”, Benjamin/Cummings Publishing Company Inc., Redwood City, CA, 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

Cusat B.tech Semester 4 syllabus (1999,2000,2001 admissions)

SEMESTER IV

MRE/EB/EI/SE/CE/ME/EC/CS/IT 401 Engineering Mathematics IV

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 e^z, 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, 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.

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, Newton - 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, Newton’s devided differences interpolation polynomial.

Module IV

Finite differences: Operators D,Ú,E, and d,Newton’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: Taylor series method, Euler’s method, modified Euler’s method, Runge-Kutta formulae 4^th 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 Laplace’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 India

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, New Delhi,

2) Bartee T C, “Digital Computer Fundamentals “, Mc.Graw Hill, New York, 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, Rockville, MA, 1984

3) Gregory L. Heileman, “ Data structures, Algorithms and Object oriented programming”, McGraw-Hill, New York 1997.

4) Jean Paul Tremblay and Paul G Sorenson, “An introduction to Data Structures with Applications”, McGraw-Hill, Singapore, 1984

5) Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Benjamin/Cummings Publishing Company Inc., Redwood City, CA, 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, New Delhi, 1998

9) Robert L.Cruse, "Data Structures and Program Design", Prentice Hall India, 3^rd 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