Semester VII Syllabus
731. RESOURCE MANAGEMENT (Syllabus common with other branches)
UNIT I:Concept and scope of operations research (OR) - Development of OR - Phase of OR - Models in OR Linear programming : Methods of solution - Graphical and SIM- PLEX methods of solution - VARIATIONS - Duality in LP - Revised SIMPLEX method - Applications for business and industrial prob- lems (10)
UNIT II:Integer programming : Formulation - Graphical representation - Gomory's cutting plane method Transportation and assignment problems : Initial solution - Methods of improving the initial solution - Travelling salesman problems Dynamic programming - Principle of optimality. (10)
UNIT III:Sequencing and scheduling problems : Job sequencing-n jobs through two machines, two jobs through m machines and n jobs through m machines PERT and CPM techniques - Critical path - Normal and crash time - Resource allocation - Resource levelling and smoothing.
UNIT IV: Inventory problems: Deterministic model - Costs - Decision varia- bles - Economic order quantity - Instantaneous and non-instanta- neous receipt of goods with and without shortage - Quantity discount - Probabilistic inventory model - Inventory systems - Safety stock - Reorder level (ROL), Reorder point (ROP) determination (10)
UNIT V:Maintenance and replacement problems: Models for routine mainte- nance and preventive maintenance decisions - Replacement models that deteriorate with time and those fail completely. (10)
TEXT BOOKS:Taha, H.A. - Operations research - An Introduction, Macmillan, International Students Edition, 1980.
REFERENCE BOOKS: 1. Sharma, S.D. - Operations Research - Keder Nath Ram Nath & Co., 1989. 2. Billy B.Gillet - Introduction to Operations Research - TMH Publishing Company Ltd., 1982. 3. P.K. Gupta and Manmohan - Operations Research and Quantitative Analysis, S.Chand & Company Ltd., 1990. 4. S. hamblin and Stevens Jr. - Operations Research - McGraw Hill Company, 1974.
732. COMPUTER GRAPHICS (Syllabus common with other branches)
UNIT I:Introduction to Computer graphics - Display devices - Hardcopy devices - Interactive input devices - Display processors - Graph- ic Adaptors - Basic function - Monochrome adaptors, video moni- tors - Graphics software - Output primitives - Line and circle drawing algorithms - Attributes of output primitives. (10)
UNIT II:Two dimensional transformation - Clipping and windowing - Clip- ping algorithms - Segmented display files - Display file compilation - Modelling and modelling transformation. (10)
UNIT III:Interactive input methods - Physical devices - Logical classifi- cation of input devices - Interactive picture construction tech- niques - Input functions. (9)
UNIT IV:Three dimensional concepts - Methods of 3D representation - 3D transformations - Viewing - 3D clipping - Hidden - Surface and Hidden-line elimination - Shading and coloring methods - Basic model- ing concepts and modelling methods. (10)
UNIT V: Computer graphics applications - CAD/CAM, Image processing, VLSI, Games Graphs and Charts Animation - Introduction of Graphics and Kernel system (GKS) - Binding language for GKS - Programming examples using GKS, PHIGS.
TEXT BOOKS:1. Donald Hearn and Pauline Baker Computer Graphics, Prentice Hall, New Delhi, 1986.
REFERENCE BOOKS:1. Ed.Teja and Laura Johnson, IBM PC and PS/2 Graphics Handbook, Micro-Tec. Publications, DUBAI (UAE), 1990. 2. Roy A.Plastock, and Gorden Kelley, Theory and Problems of Computer Graphics, Schaum's outline series, Tata McGraw Hill, 1986. 3. Steven Harrington, Computer Graphics, A programming approach, McGraw Hill, 1986. 4. Fundamentals of Interactive Computer Graphics by Foley J.D. and Van Dam A(1982) - Addison -Wesley, Reading, Massachusetts, USA.
733. SYSTEM SOFTWARE (Syllabus common with other branches)
UNIT I:Introduction - System software - Machine structure - Hypothetical computer model - Insturction set - Existing computer systems Segmenta- tion concepts - Internal operation.
UNIT II:Intel 80386 architecture - Addressing modes - Instruction set with examples - MASM - Assembler directive - Programming examples using MASM on an IBM PC - Interrupt services in MASM programs.
UNIT III: Assemblers - Functions _ Machine dependent and independent features _ Assembler design symbol table - macroprocessors - Functions - Features design issues - Implementation examples.
UNIT IV: Loaders and linkers - Basic functions - Different schemes - Design issues.
UNIT V:Compilers - Software tools - editors - Interpreters - Program generators - Interactive debugging system - Subroutine and parameter passing.
TEXT BOOKS:1. D.M.Dhamdhere - Introduction to Systems Software - Tata MCGraw Hill Publishing Co., 1986.
REFERENCE BOOKS: 1. Leland L.Beck - System software: An Introduction to system Pro- gramming - Addison-Wesely Publishing Co., 1985. 2. Peter Norton/Richard Wilton - The new Peter Norton Programmer's guide to the IBM FC and PS2 - Microsoft Press, 1988.
734. COMPUTER NETWORKS (Syllabus common with other branches)
UNIT I:Introduction : The uses of computer networks - Network structure - Network architectures - The OSI reference model - services - Network standardization - Example networks. The physical layer: The theoritical basis for data communication - Transmission media - Analog transmission - Digital transmission - Transmission and switching - ISDN - Terminal handling.
UNIT II:The medium access sublayer: Local and metropolition area net- works. The ALOHA protocols - Local area network protocols - IEEE STANDARD 802 for LANs - Fiber optic networks, satellite networks, packet radio networks, Lan Controller for Ethernet & Token ring. The Data Link Layer: Data link layer design issues - Error detec- tion and correction - Elementary data link protocols - Sliding window protocols - protocol performance - protocol specification and verification.
UNIT III:The network layer: Network layer design issues - Routing algorithms - Congestion control algorithms - Inter-networking, IP Protocol.
UNIT IV:The transport layer: Transport layer design issues - connection management, UPP / TCP/IP Protocol. The session layer: Session layer design issues, remote procedure calls.
UNIT V:The presentation layer: Presentation layer design issues - Data compression techniques - Cryptography. The application layer: Design issues - File transfer, access and management - Electronic mail - Virtual terminals - other applications, Network Management, Study of SNMP Protocol.
TEXT BOOKS:1. Computer networks - Andrew S. Tanenbaum (2 ed.), Prentice Hall of India, 1991.
REFERENCE BOOKS:1. Bertsekes D. and Gallager R. - Data networks - Prentice Hall, India, 1989. 2. Mischer Schwartz, Telecommunication networks, Modeling and Analysis - Addison Wesley, 1987.
FROM '73A' TO '73H'- ELECTIVES (HAVE TO SELECT ANY TWO)
73A. ARTIFICIAL INTELLIGENCE
UNIT I:INTRODUCTION: The AI problems and techniques. AI programming languages. (2 Hours) Introduction to LISP, List Manipulations; functions, predicates and conditionals; Input output and Local Variables; Iteration and Recursion; lists and arrys. Introduction to PROLOG.
UNIT II:KNOWLEDGE REPRESENTATION: Syntax and semantics; Properties of coefficients; Conversion to casual form; Inference Rules; Resolution Principle; Introduction to predicate logic; Inter Maintenance Systems; Default Reasoning; Predicate Completion and circumspection; Modal and temporal logics; Fuzzy logic and Natural Language computations. (8 Hours)
UNIT III:PROBABILITIES REASONING: Baye's Probabilistic references and Dempster - shafer theory and heuristic methods. (4 Hours) STRUCTURED KNOWLEDGE: Introduction to graphs, frames and related structures. (4 Hours)
UNIT IV:KNOWLEDGE ORGANISATION AND MANIPULATION: Breadth First Search; Depth first search; rendering and retrieval techniques: Frame problems. (4 Hours)
UNIT V:EXPERT SYSTEM ARCHITECTURE: Rule base Architecture; Non Production system architectures; knowledge system and building tools. Knowledge Acquisition concepts; Types of learning, General learning model; Performance measures, learning by induction: the INDUCE System. (8 Hours)
TEXT BOOKS: DAN W. Patterson: Introduction to Artificial Intelligence and Expert Systems. PHI - 1990.
REFERENCE BOOKS: 1. Introduction to Artificial Intelligence By Elaine Rich and Kevin Knight.
73B. COMPILER DESIGN (Syllabus common with other branches)
UNIT I:Programming language grammar: Definition of programming lan- guages - Lexical and syntactic structure of a language - Elements of a formal language grammar - Derivation, reduction and syntax trees - Ambiguity - context free grammars - Capabilities of a context free grammar - Regular expressions.
UNIT II:Lexical analysis: Role of a lexical analyzer - Finite automata - Regular expressions to finite automata - Minimizing the number of states of DPA - Implementation of a lexical analyzer - Illustrations.
UNIT III:Parsing Techniques: Parse trees - Left most and right most Pars- ing techniques - Top down and bottom up parsing - Handles - Shift reduce Parser - Recursive descent Parser - Operator precedence and predictive Parsers. Automatic Parsing techniques: LR grammars - LR Parsing - Canoni- cal collection of LR (O) items - Construction of ACTION and GO TO tables - Introduction to SLR canonical and LALR Parsing.
UNIT IV:Syntax directed translation: Syntax directed translation schemes - Semantic actions - Implementation - Intermediate code genera- tion - Three address codes, quadruples and triples, parse trees and syntax trees - Methods of translating assignment statements, expressions control statements, Array references, procedure calls, declarations, case statements and Record structures. Symbol tables and error handling: Representation of information in symbol tables - Data structures for symbol tables - Errors - Lexical phase errors - Syntactic phase errors.
UNIT V:Code optimization and code generation: Principal sources of optimization - Loop optimization - The DAG representation of basic blocks - Introduction to code generation.
TEXT BOOKS:1. A.V.Aho, J.D.Ullman - Principles of compiler design - Narosa Publishing House, 1987.
REFERENCE BOOKS:1. Dhamdhere, D.M. - Compiler Construction - Principles and practice - Macmillan India Ltd., 1983. 2. David Gries, Compiler Construction for Digital Computers, Wiley International Edition.
73C. COMPUTER AIDED DESIGN AND MANUFACTURE (CAD/CAM) (Syllabus common with other branches)
UNIT I:9 hrs. Introduction Principles of operation of computer Hardware, software and oper- ating system, application programs, data handling and file struc- tures. Computer Aid in phases of design-development of design database using CAD systems-Conceptual design process Analysis optimization-detailed design and documentation.
UNIT II:9 hrs. Elements of CAD systems Graphics hardware: Workstation for user interaction input and display, CPU, mass storage and hard copy output devices-printers and pen plotters-Input devices-keyboard, cursor, thumbwheels, joystick, light pen, mouse, digitizers and voice. Terminal types-storage-tube, Raster scan, Vector refresh and plasma panel. Software: Details of 2D drafting software packages layering, drawing primitives, display techniques, editing, utilities, scaling, dimensioning, 3D visualization, geometric modeling-wire frame and solid models.
UNIT III:9 hrs. Finite Element analysis Introduction, Galerkn's formulation - finite element division, element matrices, assembled, matrix and solution for deflections, stresses and strain. Simple Problems using triangular elements.
UNIT IV:9 hrs. Design using computers (Demonstration and practice) Design of gears, couplings, flywheels, shafts, connecting rods etc. Software for vibrational problems-stress analysis, kinemat- ic analysis and Dynamic analysis.
UNIT V:9 hrs. Computer Aided Manufacture CNC machines-control architecture of CNC- part programming-manual and computer aided- Distributed numerical control - Adaptive control. Total 45 hrs.
TEXT BOOKS:1. Computer Aided Design and Manufacturing, Mikell P.Groover and Emory W.Zimmers.Jr,Prentice Hall India , 1985. 2. Principles of interactive computer graphics, Newman and Sproull R.F., McGraw Hill Tokyo 1984.
REFERENCE BOOKS:1. Besant C.B and Lui.C.N.K. Computer Aided Design and Manufac- ture , 3rd Edition . East West press 1988. 2. Peter Ningham,CAD Systems in Mechanical and Production engi- neering, East West press 1989. 3. The finite element method, Zienkiewiz O.C., McGraw Hill, Newyork.
73D. ROBOTICS (Syllabus common with other branches)
UNIT I:Introduction: Automatic and robotics - History of robotics - Robot anatomy - Work volume - Robot drive systems - Control systems and dynamic performance - Precision of movement - Robot appli- cation. Control components: Robot activation and feedback components Position sensors velocity sensors - Acutors - Power transmission systems - Robot joint control design.
UNIT II:Robot motion analysis and control: Manipulator kinematics - Homogeneous transformations and robot kinematics - Manipulator path control - Robot dynamics - Configuration of a robot controller. Robot and effectors: Types of end effectors - Grippers - Tools and End Effectors - Robot/End interface - Gripper Selection.
UNIT III:Sensing: Sensors - Range sensing - Proximity sensing - Touch sensors - Force and torque sensing. Low level vision: Image acquisition - Illumination techniques - Imaging geometry - Basic Relationships between pixels - Preprocessing.
UNIT IV:High level vision: Segmentation - Description - Segmentation and description of three dimensional structures - Recognition - Interpre- tation. Robot programming languages: Characteristics of robot level languages - Characteristics of task level languages.
UNIT V:Robort intelligence and task planning: State space search - Problem reduction - Use of predicate logic - Means-Ends - Analy- sis-Problem - Solving - Robot learning - Robot task planning - Basic problems in Task planning.
TEXT BOOKS:1. Mikell P.Groover, M.Weiss, R.N.Nagal and N.G.Odrey - Indus trial Robotics - McGraw Hill International Editions, 1986.
REFERENCE BOOKS:1. K.S.Fu, R.C.Gonzalex and C.S.G.Lee - Robotics- McGraw Hill International Edition, 1987. 2. V.Daniel Hunt, Smart Roborts, Chapman and Hall, 1985. 3. Syndern, Industrial Robots - Computer Interfacing and Control - Prentice Hall, 1988. 4. Fairhurst - Computer vision for robotics systems - An Introduction - Prentice Hall, 1988.
73E. PARALLEL COMPUTERS (Syllabus common with other branches)
UNIT I:Introduction to Parallel Processing: Evolution of computer sys- tems, parallelism in uniprocessor systems, Parallel computer structures, architectural classification schemes, Parallel proc- essing applications. Memory and input and output subsystems: Hierarchical memory structure, Virtual memory system, Memory allocation and manage- ment, Cache memories and management, Input output.
UNIT II:Principles of pipelining and vector processing: Pipelining: An overlapped parallelism, Instruction and arithmetic pipelines, Principles of designing pipelined processors, vector processing requirements. Pipeline computers and Vectorisation methods: The space of pipe- lined computers, early vector processors, scientific attached processors, recent vector processors, vectorization and optimiza- tion methods.
UNIT III:Structures and Algorithms for Array Processors: SIMD array proc- essors, SIMD Interconnection networks, Parallel algorithms for array processors, Associative array processing. SIMD Computers and Performance Enhancement: The space of SIMD computers, the ILLIAC-IV and the BSP systems, the massively parallel processors, performance enhancement methods.
UNIT IV:Multiprocessor architecture and programming: Functional struc- tures, Interconnection networks, Parallel memory organizations, Multiprocessor OSs, Exploiting concurrency for multi Processing. Multiprocessing control and algorithms: Interprocess communica- tion mechanisms, System deadlocks and protection, Multiprocessor scheduling strategies, parallel algorithms for multiprocessors.
UNIT V:Example multiprocessor systems: The space of multiprocessor systems, 2the CMMP multiprocessor system, the S-1 multiprocessor, the HEP multiprocessor, mainframe multiprocessor systems, the Cray X-MP and Cray-z. Dataflow computers and VLSI computations: Data driven computing and languages, Data flow computer architectures, VLSI computing structures, VLSI matrix arithmetic processors.
TEXT BOOKS:1. Hwang K. and Briggs F.A. - Computer Architecture and Parallel Processing - McGraw Hill Book Company, 1984.
REFERENCE BOOKS:1. Kogge P.M.. - The architecture of pipelined computers - McGraw Hill Book Company, 1981.
73F. FAULT TOLERANT COMPUTING (Syllabus common with other branches)
UNIT I:Introduction - Test generation for digital system - Combinational logic network - Boolean difference method - Test generation for se- quential circuits - Fault simulation - Coding theory for fault toler- ant systems - Error models - Basic structural properties of parity check codes - General coding schemes - Codes for computer memories - Arithmetic codes - Checking errors in logical operations.
UNIT II:Coding techniques in fault tolerant - Self checking and fail safe circuits - Fault tolerant in combinational circuits and sequential circuits - Synchronous and asynchronous fail safe sequential circuits.
UNIT III:Architecture of fault tolerant computers - Quadraplex systems - Voting systems - General purpose commercial systems Fault tolerant multiproc- essor and VOSI based communication architecture - N version program- ming.
UNIT IV:Fault tolerant software - Design - Recovering block - Construction of acceptance tests - Fault trees - Validation of fault tolerant system.
UNIT V:Application to commercial system - Performance evaluation - Reliabili- ty estimation - Air craft systems - Air craft common mode failures.
TEXT BOOKS:1. Pradhan K K (Ed) - Fault tolerant computing - Theory and Tech- niques - Vol.I and II, Prentice Hall, 1986
73G. DIGITAL IMAGE PROCESSING (Syllabus common with other branches)
UNIT I:CONTINUOUS IMAGES AND SYSTEMS: Perception of light, Eye, Subjec- tive phenomena, monochrome vision model. Image representation, 2-D systems, Linearity and space invari- ance, Point spread function and convolution, 2-D Fourier trans- form
UNIT II:DISCRETE IMAGES: 2-d sampling, Spectrum of sampled image, Image reconstruction, Aliasing, practical image sampling and recon- structing systems and their imperfections, Matrix, Singular value and 1-D vector representations of discrete images, Image quantization.
UNIT III: LINEAR PROCESSING OF DISCRETE IMAGES: Linear operators: Inverse, Pseudo-inverse and superposition operators, 2-D unitary trans- forms of the Fourier, cosine, Hadamard; Haar, Slant, Karhunern- Leove and SVD types. Transform domain and recursive filtering techniques of processing.
UNIT IV:IMAGE ENHANCEMENT AND RESTORATION: a) Enhancement: Contrast enhancement. Histogram modification, Noise cleaning, Edge cris- pening, Basic concepts of generalized cepstrum and median filter- ing. b) Digital image restoration: Sources of degradation, characterization, Basic principles of inverse filtering, S.V.D., pseudo-inverse and estimation (recursive and nonrecursive) tech- niques of restoration.
UNIT V:IMAGE DATA COMPRESSION: Need and scope for Image data compression Image quality and entropy consideration. PRESS 2. PRATT: Image Transmission Techniques. ACADEMIC PRESS 3. ANDREWA AND HUNT: Digital Image Restoration. PRENTICE HALL 4. GONZALEZ and WINTZ: Digital Image Processing ADDISON WESLEY.
TEXT BOOKS:1. A.V.Aho, J.D.Ullman - Principles of compiler design - Narosa Publishing House, 1987.
REFERENCE BOOKS:1. Dhamdhere, D.M. - Compiler Construction - Principles and practice - Macmillan India Ltd., 1983. 2. David Gries, Compiler Construction for Digital Computers, Wiley International Edition.
73H. SOFTWARE TESTING
UNIT I:INTRODUCTION :- The purpose of testing, A model for testing. THE TAXONOMY OF BUGS :- The consequences of bugs, The importance of bugs, How bugs affect us - Consequences, flexible severity rather than Absolutes. A TAXONOMY FOR BUGS : - Requirements, features and Functionality bugs. Structural Bugs, Data Bugs, Coding Bugs, Interface, Integration and System Bugs, Test and Test design Bugs, Testing and Design style.
UNIT II:FLOWGRAPHS AND PATH TESTING:- Path-Testing Basics, Predicates, Path predicates and Achievable Paths, Path sensitizing, Path Instrumenta- tion, Implement and Application of Path-testing. TRANSACTIONAL -FLOW TESTING : - Generalization, Transaction flows, transaction-flow testing techniques, Implementation comments. DATA-FLOW TESTING : - Data-flow testing Basics, Data-flow testing strategies, Applications, tools, effectiveness.
UNIT III:DOMAIN TESTING :- Domains and Paths, Nice Domains and Ugly Domains Domain testing, Domains and Interface testing, Domains and testabili- ty. METRICS AND COMPLEXITY :- Details about metrics, Linguistic Metrics, Structural metrics, Hybrid Metrics, Metrics Implementation. PATHS,PATH PRODUCTS AND REGULAR EXPRESSIONS :- Path Products and Path expressions, A Reduction Procedure, Applications, Regular Expressions and flow anamoly detection.
UNIT IV: SYNTAX TESTING :- Necessity and Methodology of syntax testing, A grammar for formats, test case generation, Implementation and Applica- tion. LOGIC-BASED TESTING : - Decision Tables, Path expressions, KV charts, Specifications. STATES,STATE GRAPHS AND TRANSITION TESTING : - State graphs, Good and bad State graphs, state testing.
UNIT V:GRAPH MATRICES AND APPLICATIONS : - The matrix of a graph, relations, The powers of a matrix, Node-reduction algorithm, Building tools. IMPLEMENTATION :- Strategies for Programmers, Strategies for independ- ent Testers, Test as software products, Tools.
TEXT BOOKS:1. Software Testing Techniques ( Second Edition) By BORIES BEIZER, Publishers :- VAN NOSTRAND REINHOLD,USA.
REFERENCE BOOKS:1. Software Testing by MARC ROPER - McGraw Hill. 2. The Art of Software Testing by GLENFORD J. MYERS - John wiley & Sons.
737. MULTIMEDIA AND GRAPHICS LABORATORY
The following are the suggested experiments for Multimedia Lab. 1. Components of Multimedia Kit. i) Study of CD ROM drive. ii) Study of Video card. iii) Study of Sound blaster card. 2. Basic software programs for the components given in 1. 3. Programs for compression algorithms of text. 4. Programs for compression algorithms of video. 5. Programs for video effects like zoom. 6. Study of multimedia software. The following are the suggested experiments for graphics lab. 1. Program to draw a line using bresenham's algorithm for all quad rants. 2. Program to draw a circle. 3. Program to draw an ellipse. 4. Program to draw a spiral using bresenham's circle drawing algo -rithm. 5. Procedure to move a line aournd the circle. 6. Procedure to rotate a wheel. 7. Procedure to translate a circle. 8. Program to show 2D clipping and windowing. 9. Development of 2D graphics package. 10. Segmentation.
738. SYSTEM SOFTWARE LABORATORY
System Software: 1. Design of an editor: Design of a line or screen editor using C language. 2. Design of an assembler. 3. Simulation of loaders. 4. Interprocess communication. 5. token separation and symbol table manipulation. 6. Constructing Parsing Table.
|
