Doc manuscript - Mind Your Elephant

By Steve Hayes,2014-01-17 05:36
11 views 0
Doc manuscript - Mind Your Elephantdoc,mind,your,Mind


    06XW11 ENGLISH

     3 0 0 3

    READING Reading different types of materials for effect, clarity and emphasis. (8) Reading for deep comprehension, local and global, inferential and critical. (7) WRITING 2.1 Writing Dialogues on formal and informal situation. 2.2 Vocabulary Development 2.3 Word formation - Prefixes, suffixes; formation of nouns and adjectives; usage 2.4 Technical Documents writing; email communication with customers 2.5 Composition of paragraphs using discourse makers 2.6 Interpreting non-verbal presentation 2.7 Writing for focus (8) REMEDIAL EXERCISES IN GRAMMAR AND USAGE (4) PRACTICALS (7) LISTENING FOR GENERAL AND SPECIFIC INFORMATION Listening to short episodes, pre-recorded radio / TV news, bulletin, and talks, stories etc. followed by comprehension exercises and note-taking. (4) ORAL COMMUNICATION Short speeches, interpreting visual presentation (plans, maps, time-tables and like) Role play and group discussions. (4) Total 42 Note Teaching materials will be drawn from various resources such as radio, television programmes, news papers, magazines and books will be provided to students as handouts for use in the class room REFERENCES 1. Hedge Tricia, "Writing ELBs", Oxford University Press, 1988. 2. Humanities and Social Sciences Division, Anna university - Madras, " English for Engineers and Technologists Skills, approach", Orient Longman Limited, 1990. 3. Langan John,"English Skills", NewYork : McGraw-Hill Book Company, 1981 4. Kirn Elaine and Pamela Hartmann," Interactions-I ", McGraw-Hill Publishing Company, NewYork, 1990.


     4 1 0 5

     ALGEBRA: Binomial, Exponential and Logarithmic series - Summation of series using Binomial, Exponential and nLogarithmic series - Finding coefficient of x in power series expansion - Approximations using Binomial, Exponential and Logarithmic series. (11) MULTIPLE INTEGRALS: Evaluation of multiple integrals - change of order of integration - Applications of multiple integrals to find area and volume of solid. (10) BETA AND GAMMA INTEGRALS: Definition - Relation connecting Beta and Gamma integral - Properties - Evaluation of definite integrals in terms of Beta and Gamma functions. (4) ORDINARY DIFFERENTIAL EQUATIONS: Linear differential equations of higher order with constant coefficients -Euler's equation with variable coefficients - Simultaneous equations - Method of variation of parameters - Linear Equations of the 2nd order : Complete solution given one solution of homogeneous equation - complete solution by removal of first derivative. (10) MATRICES: Rank of a matrix (Revision) - Consistency and inconsistency of a system of linear equations - Eigen values and Eigenvectors - properties - Quadratic form - Reduction to canonical form by orthogonal reduction. Vector space Basis Dimension - Linear Transformation, Properties of Linear transformation, Matrix of a Linear Transformation. (11) THREE DIMENSIONAL GEOMETRY: Direction cosines and ratios - equation of planes - straight lines - shortest distance between two skew lines - sphere and cylinder. (10) Total 56

REFERENCES 1. Kreyszic E., “Advanced Engineering Mathematics”, John Wiley & Sons, 2000. 2. Thomas G.B. Jr. & Finney R.L., “Calculus & Analytic Geometry”, Narosa Publishing House, 1998. 3. Ray Wylie C and Louis C Barrett, “ Advanced Engineering Mathematics”, McGraw-Hill Inc, 1995. 4. Riley K.F., Hobson M.P. and Bence S.J., "Mathematical Methods for Physics and Engineering", Cambridge University Press, 1999.


     4 0 0 4

LASERS AND FIBRE OPTICS: Construction and working of He-Ne laser CO laser - Ruby laser - Semiconductor laser 2- Applications, Types of optical fibers - Single and bundled Fibers - Fiber materials - Attenuation - Dispersion - Fiber optic light sources - Detectors - Fiber optic communication - Principles of optical recording. (9) ELECTRICAL PROPERTIES: Free electron theory of Drude and Lorentz - Weidmann - Franz Law - Distinction between conductors, semi conductors and insulators on the basis of band theory - Factors affecting resistivity of a conductor, temperature, alloying, pressure, strain, magnetic field and environment. (9) SUPER CONDUCTORS: Qualitative theory of phenomenon - Critical temperature and critical field. Meissner effect - Josephson effect - Type I and II super conductors, BCS theory of super conductivity (Qualitative) - High temperature superconductors, Applications: Cryotron, Magnetic levitation - Super conducting magnets. (10) SEMICONDUCTING MATERIALS: Intrinsic, Extrinsic semiconductors - Materials preparation: Czochralski method - Zone refining, Hall effect in semiconductor - Applications of Hall effect, IC fabrication (Qualitative). (9) MAGNETIC PROPERTIES: Ferromagnetism: Domain theory - Hysteresis - Hard and soft magnetic materials - Curie - Weiss law - magnetostriction, Ferrites: preparation, properties, applications - Magnetic bubble memory. (9) DIELECTRIC MATERIALS: Qualitative study of three types of polarisation - effect of temperature and frequency on dielectric constant - Dielectric Loss - Ferro-electric materials - Behavior of barium Titanate - Piezo Electric materials - Classification of insulators on the basis of temperature. (10) Total 56 REFERENCES 1. Seth and Gupta, Course in Electrical Engg, Materials , Dhanpat Raj & Sons, 1990. 2. Brijlal and Subramaninam, Optics , Chand & Co., 1995. 3. Raghavan V., Materials Science and Engineering A First course , Prentice Hall, 1991 4. Arumugam M., Materials Science, Anuradha Publishers, 2001. 5. Srinivasan M. R., Physics for Engineers, New Age International (P) Ltd Publications, 1996.


     4 0 0 4

     SEMICONDUCTOR DEVICES AND CIRCUITS: (Qualitative treatment only) Fundamental aspects of semiconductors PN junction diode-Zener diode Rectifiers Zener voltage regulators Filters Power supply units Bipolar Junction Transistors Transistor Amplifiers and inverters Field Effect Transistor. (7) NUMBER SYSTEM AND CODES: Binary Octal Hexadecimal BCD excess three Gray codes error correcting and detecting codes. (7) DIGITAL CIRCUITS AND GATES: AND, OR, NOT, NAND and NOR gates exclusive OR gates. Positive and negative logic systems digital integrated circuits characteristics TTL and MOS logic circuits comparison. (6) BOOLEAN ALGEBRA AND KARNAUGH MAPS: Boolean relations laws and theorems simplifications karnaugh maps and simplifications dont care conditions NAND-NAND realizations. (7) COMBINATIONAL LOGIC: Design and implementation of Half and Full adders Subtractors Parallel adders carry look ahead addition subtractors encoders and decoders multiplexers and de-multiplexers. (7) SEQUENTIAL LOGIC: R-S, J-K, D and T type Flip-Flops Binary counters: Ripple and synchronous types UP/DOWN counters decade counters Shift registers Ring counters. (6)

A/D AND D/A CONVERTORS: Operational amplifier basics DACs: weighted and binary ladder types ADCs: counter, ramp, successive approximation types. (8) OPERATIONAL AMPLIFIERS: Definition of terms inverting and non-inverting amplifiers, summing amplifiers, integrators and differentiators. (8) Total 56 REFERENCES 1. Malvino A. P., Digital Computer Electronics, Tata McGraw Hill, 2001. 2. Gothamann H., Digital Electronics: An Introduction to theory and Practice, Prentice Hall, 2001. 3. Mottershed A., Electronic devices and circuits, Prentice Hall, 1993. 4. Mathur A. P., Introduction to Microprocessors, McGraw Hill Book Company, 2001. 5. Hamachar V. C., Vranesic Z.G and Zaky S.G., Computer Organization, McGraw Hill, 2002.


    4 0 0 4

     INTRODUCTION: Introduction to Problem Solving - The C character set Identifiers and keywords data types constants variables arrays declarations expressions statements symbolic constants operators & expressions arithmetic operators unary operators relational & logical operators assignment operators conditional operators library functions data input & output functions. (7) CONTROL STATEMENTS: While statement do while statement for nested loops if else switch break continue comma operator go to statement programs. (7) FUNCTIONS: Defining a function accessing a function passing arguments to functions specifying arguments data types function prototypes storage classes auto static extern and register variables. (7) ARRAYS: Defining a array processing array passing array to a function multi dimensional array array & strings. (7) POINTERS: Declarations pointers to a function pointers and one dimensional arrays operating a pointer pointer and multi dimensional arrays arrays of pointers passing functions to other functions. (7) STRUCTURES AND UNIONS: Definitions processing a structure user defined data types structures and pointers passing structure to functions self referential structures. (7) FILES: Open close process operations on a file. STREAMS: String I/O Character I/O Object I/O I/O with multiple Objects - File pointers - Disk I/O with member functions Exception handling Templates Software Object Templates . (10) Preprocessor Directives Command Line Arguments. (4) Total 56 REFERENCES 1. Kernighan B. W. and Ritchie D. M., C Programming Language (ANSI C), Pearson Education, 1999. 2. Herbert Schildt, C The Complete Reference, McGraw Hill, 2001 3. Les Hancock and Morris Krieger, The C Primer, McGraw Hill , 1988. 4. Michael Schneider G, Steven W , Weingart and David M.Perlman, “An Introduction to Programming and Problems Solving with Pascal “, John Wiley & Sons, 1998.


     2 0 3 4

     INTRODUCTION: Importance of Engineering Drawing Drawing Instruments and uses. BIS specifications Layout of drawing sheets Lines Lettering and dimensioning. (7) TYPES OF PROJECTION: Orthographic and Isometric Projections of solids and their conversion Perspective Projection Visual ray and Vanishing point methods. (6) ORTHOGRAPHIC PROJECTION: Principles of Projection and First Angle Projection Projection of Points, Straight lines, Planes and solids. (3)

SECTION OF SOLIDS: Projection of sectional views with section planes parallel, perpendicular and inclined to reference planes True shape of sections. (3) DEVELOPMENT OF SURFACES: Development of lateral surface of truncated solids. (3) COMPUTER GRAPHICS: Basic Principles Computer hardware and graphics software Basic principles of interactive computer graphics Point plotting technique, Line drawing display Modeling of two and three dimensions Display of solid objects. (6) Total 28 REFERENCES 1. Venugopal N., Engineering Drawing and Graphics, New Age International, 2002. 2. Gopalakrishnan K. R., Engineering Drawing, Vol I and II, Subhas stores, Bangalore 1992. 3. Parkinson and Sinha, First year Engineering Drawing, Wheeler 1992.


     1 0 4 3

     PASCAL: Basic Data Types and Declaration. Assignment, Input and Output, Compound Statement, Iterative Statements, Conditional Statements, Functions and Procedures, Structured Data Types-Sets Records Files and Pointers. PASCAL LAB: 1. Simple Programs Using Algebraic Expressions, Built-in functions. 2. Familiarizing conditional, Control and Repetition Statements. 3. Usage of one dimensional and multidimensional arrays 4. Functions involving Call by Value. 5. Procedures involving value parameters and variable parameters. 6. Recursive programs 7. Defining sets, Enumerated data types and Sub range usages in a program. 8. Defining and handling simple records, Nested records and Disjoint records along with the usage of with option. 9. Creating and Processing of data files. C LAB: 1. Simple programs to understand the concepts of data types. 2. Familiarizing conditional, control and repetition statements 3. Usage of single and double dimensional arrays including storage operation 4. Implementation of functions, recursive functions 5. Defining and handling structures, array of structures and union 6. Implementation of pointers, operation on pointers dynamic storage allocation 7. Creating and processing data files. Total 14


     0 0 4 2 APPLIED PHYSICS LABORATORY 1. Magnetic Hysteresis 2. Resistivity of an Alloy Carey Foster‟s Bridge 3. Band Gap of Thermistor Post Office Box 4. Thermal Conductivity of Metallic Wire Wiedmann Franz law 5. Temperature co-efficient of Resistance Post Office Box 6. Efficiency of Solar Cell 7. Band Gap Determination Reverse Saturation Current 8. Photodiode Characteristics 9. Refractive Index of Glass Laser 10. Thickness of fibre Air Wedge


     1. Study of basic logic gates and realization of logic gates using universal gates. 2. Multiplexer and demultiplexer 3. Half and full adder / subtractor 4. Encoder and decoder 5. Binary decade counter 6. BCD to seven segment decoder 7. Study of D/A converter 8. Crystal Oscillator using logic gates 9. Four bit ring counter 10. Four bit shift register



     3 1 0 4

     PROBABILITY AND CONCEPT OF RANDOM VARIABLE: Axiomatic Approach to Probability Random variables Discrete random variables: Bernoulli, Binomial, Geometric and Poisson Continuous random variables Uniform, Exponential, Gamma & Normal Expectation of random variables Jointly distributed random variable Moment Generating functions. (8) CONDITIONAL PROBABILITY & CONDITIONAL EXPECTATION: Introduction Discrete case Continuous case Computing expectation by conditioning Computing probabilities by conditioning Applications. (6) CORRELATION AND REGRESSION: Correlation Regression Multiple and Partial Correlation and regression. (3) TESTING OF HYPOTHESIS: Large Sample Tests Tests for means, variances and proportions. Small sample tests Tests for Means, Variances and Attributes Using the Above Using the above distributions. (6) ESTIMATION: Point estimation - Characteristics of estimation Methods of estimation Interval estimation Interval estimates of mean, standard deviation, proportion, difference in means and ratios of standard deviation. (6) ANALYSIS OF VARIANCE: Design of Experiments ANOVA, Completely randomized Design, Randomized block design, Latin square design. (3) STOCHASTIC PROCESSES: Introduction Markov Chain - Transition Probability Matrices Classification of states Limiting probabilities. (5) CONTINUOUS TIME MARKOV CHAINS: Exponential distribution and Poisson Process, General pure birth and death process. Differential equations of birth and death process. (5) Total 42 REFERENCES 1. Trivedi K.S., “Probability & Statistics with Reliability, Queueing and Computer Applications”, Prentice Hall, 2003. 2. Sheldon M.Ross, “ A first course in Probability”, Pearson Education, 2002. 3. Medhi J, “Stochastic Processes”, New Age International Publishers, 2002. 4. Jay L Devore, “Probability and Statistics for Engineering and Sciences”, Thomson Duxbury, 2002, 5. Douglas C.Montgomery and George C.Runges “ Applied Statistics and Probability for Engineers”, John Wiley and Sons, 1999. 6. Ronald E.Walpole, Raymond H.Myers, Sharon L.Myers and Keying Ye, “ Probability & Statistics for Engineers & Scientists”, Pearson Education, 2002.


     3 0 2 4

     CALCULUS OF FINITE DIFFERENCES AND INTERPOLATION: Finite difference operators - Difference table - Newton's forward, backward and divided difference formulae - Lagrange's interpolation formula. (6) NUMERICAL DIFFERENTIATION AND INTEGRATION : Numerical Differentiation using interpolation formulae - Numerical integration using Trapezoidal rule and Simpson's one third rule and three eight's rule - Gaussian quadrature formula. (7)

SOLUTION OF ALGEBARIC EQUATIONS: Method of false position, Iterative method and Newton - Raphson method for finding real roots of transcendental and polynomial equations - Graffe's root squaring method and Bairstow's method for solving polynomial equations. (6) SOLUTION OF ALGEBARIC SIMULTANOUS EQUATION: Methods for solving simultaneous linear algebraic equations - Gauss elimination method - Gauss-Jordan elimination method - Gauss-Jacobi and Gauss-Seidel iterative methods. (6) EIGEN VALUES AND EIGEN VECTORS: Power method of Mises and Jacobi's method for finding Eigen Values and Eigen Vectors of matrices. (3) NUMERICAL METHODS FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS: Taylor's series method - Euler's and Modified Euler's (Heun's) method - Runge-Kutta method of second and fourth order - Milne's predictor-Corrector - Adam's Predictor-Corrector methods. (6) LINEAR PROGRAMMING: Graphical method for two dimensional problems - Central problem of linear programming - Various definitions - statements of basic theorems and properties - Phase I and Phase II of the simplex method - Dual and Primal - Dual Simplex method - Sensitivity analysis - Transportation problem and its solution - Assignment problem and its solution by Hungarian method. (8) Total 42 REFERENCES 1. Chapra S.C and Canale R.P., “Numerical Methods for Engineers”, Tata McGraw Hill, 2004. 2. Curits F.Gerald & Patrick O.Wheatley “ Applied Numerical Analysis”, Pearson Education, 2002. 3. Mathews J.H., “Numerical Methods for Mathematics, Science & Engineering”, Prentice Hall of India, 2001. 4. Cheney W & Kincaid D, “ Numerical Mathematics & Computing” , ITP, 2002. 5. Taha H.A., “ Operations Research – An Introduction”, Pearson Education, 2001. LAB: 1. Interpolation using Newton's and Lagrange's formula. 2. Trapezoidal rule and Simpson's one-third rule for numerical Integration. 3. Finding the roots using Newton-Raphson, Graffe's root squaring, Bairstow's methods for solving polynomial equations. 4. Eigenvalues and Eigenvectors by Power method and Jacobi's method. 5. Solving simultaneous linear algebraic equations using Gauss elimination, Gauss- Jordan, Gauss-Jacobi, Gauss-Seidel methods. 6. Solving ordinary differential equations using Euler's and Runge-Kutta's methods. 7. Solving LPP using Simplex, Two-phase, Dual simplex. 8. Initial Basic feasible Solutions of Transportation problem using North-West Corner rule and Vogel's approximation methods and optimum solutions. 9. Solving Assignment problem using Hungarian method.


     4 0 0 4

     INTRODUCTION: Software Development process Abstraction - Data structures - Abstract data Types - Primitive data structures - Analysis of algorithms - Best, worst and average case time complexities - notation. (6) STRINGS: Implementation - operations - String applications. SETS: Operations on sets - implementation of sets. RECORDS: implementation of variant records. (7) ARRAYS: Operations - implementation of one, two, three and multi dimensioned arrays Sparse and dense matrices - Applications. STACKS: primitive operations - sequential implementation - Applications: Subroutine handling - Recursion Expression Processing. (10) QUEUES: Primitive operations - sequential implementation - Priority Queues - Dequeues - Applications: Image component labeling; Machine shop simulation. (6)

     LISTS: Primitive Operations - Singly linked lists, Doubly linked lists, Circular lists, Multiply linked lists - Applications: Addition of Polynomials; Sparse Matrix representation and Operations. Linked Stacks - Linked queues - Linked Priority queues - Dynamic Storage Management. (14) TREES: Terminologies - implementation - BINARY TREE: Properties - sequential and linked representation - common binary tree operations - traversals - Expression trees - Infix, Postfix and Prefix expressions - Threaded trees - Tournament trees - Heaps, Max heap, Min heap - Applications: Huffman codes; Placement of signal boosters. (9) TABLE: Introduction Operations Implementation Hash table Collision Resolution handling. (4) Total 56 REFERENCES 1. Aaron M Tanenbaum, Moshe J Augenstein and Yedidyah Langsam, "Data structures using C and C++", Pearson Education,2004. 2. Sahni Sartaj, "Data Structures, Algorithms and Applications in C++", WCB / Mc Graw Hill, 2000. 3. Nell Dale, “C++ Plus Data Structures”, Narosa Publishing House , 1999. 4. Mark Allen Weiss , “ Data Structures and Algorithm Analysis in C”, Pearson Education, 2003. 5. Robert L Kruse , Bruce P Leung and Clovin L Tondo , “Data Structures and Program Design in C”, Pearson Education, 2004.. 6. Angela B. Shiflet, “Elementary Data Structures with Pascal”, West Publishing company, 1990.


     4 0 0 4 PRINCIPLES OF OBJECT ORIENTED PROGRAMMING: Software crisis Software Evolution - Procedure Oriented Programming - Object Oriented Programming paradigm - Basic concepts and benefits of OOP - Object Oriented Language - Application of OOP - Structure of C++ - Applications of C++ - Tokens, Expressions and Control Structures - Operators in C++ - Manipulators. (14) FUNCTIONS IN C++: Function Prototyping - Call by Reference - Return by reference - Inline functions - Default, Const Arguments - Function - Overloading - Friend and Virtual Functions - Classes and Objects - Member functions - Nesting of Member functions - Private member functions - Memory allocation for Objects - Static data members - Static Member Functions - Arrays of Objects - Objects as Function - Arguments - Friendly Functions - Returning Objects - Const Member functions - Pointers to Members. (16) CONSTRUCTORS: Parameterized Constructors - Multiple Constructors in a Class - Constructors with Default Arguments - Dynamic Initialization of Objects - Copy and Dynamic Constructors Destructors overloading - Overloading Unary and Binary Operators - Overloading Binary Operators using Friend functions. (13) INHERITANCE: Defining Derived Classes - Single Inheritance - Making a Private Member Inheritable - Multiple Inheritance - Hierarchical Inheritance - Hybrid Inheritance - Virtual Base Classes - Abstract Classes - Constructors in Derived Classes - Member Classes - Nesting of Classes. (13) Total 56 REFERENCES 1. Bjarne Stroustrup, “The C++ Programming Language”, Pearson Education, 2001. 2. Stanley B Lippman, Josee Lajoie, “The C++ Primer”, Pearson Education, 2001. 3. Stanley B Lippman, “Inside the C++ Object Model”,Addsion Wesley, 1996.


     4 0 0 4

     DATA AND INSTRUCTION FORMATS: Data types - fixed point and floating point number representation - representation of signed numbers - alphanumeric data representation. (4) REGISTER TRANSFER AND MICRO OPERATIONS: Register transfer language - inter register transfer - arithmetic micro operations - logic micro operations - shift micro operations - control functions. (7) BASIC COMPUTER ORGANIZATION AND DESIGN: Instruction codes- Computer registers - Computer Instructions - Timing & Control - Instruction Cycle - Memory Reference Instructions - Input - Output and Interrupts - Complete Computer Description - Design of Basic Computer - Design of CPU Performance metrics of CPU. (11) ARITHMETIC AND LOGIC UNIT: Addition/subtraction, multiplication and division with signed numbers. (7)

     CENTRAL PROCESSING UNIT: Processor bus organization - stack organization - instruction formats - three address, two address, single address and zero address instruction formats - addressing modes - data transfer and manipulation - RISC and CISC machine characteristics - hardwired and micro programmed control - address sequencing. (7) MEMORY AND INPUT-OUTPUT UNITS: Memory hierarchy - main memory: RAM and ROM address spaces - associative memory - virtual memory - cache memory address mapping. (7) PERIPHERAL DEVICES: I/O interface - I/O bus versus memory bus - isolated versus memory - mapped I/O - example of I/O interface DMA - Input-Output processor. (7) MULTIPROCESSOR SYSTEM ORGANIZATION: Characteristics of Multiprocessors - interconnection structures - cross bar switch, time-shared common bus, multiport memory. (6) Total 56 REFERENCES 1. Morris Mano, "Computer Systems Architecture", Pearson Education, 2002. 2. Hamachar V.C, Vranesic Z.G and Zaky S.G, "Computer Organization", McGraw Hill, 2002. 3. Rao P. V. S., "Perspectives in Computer Architecture", Prentice Hall, 2001. 4. John P. Hayes, “ Computer Architecture and Organization”, Tata McGraw Hill, 1998


     0 0 3 2 Exercises pertaining to the following outlines are to be experimented : 1. Class definition, Constructors, Destructors, Instantiation of Objects, and Dynamic Objects 2. Polymorphism - Function Polymorphism - Polymorphic Constructors 3. Operator Overloading - a. Complex Number Algebra b. Vector Algebra c. Matrix Algebra 4. Inheritance - Single level, Multilevel - Multiple Inheritance 5. Abstract Base class - Virtual Functions 6. Linked list of Inherited Objects 7. Template Functions


     0 0 3 2 Implementation of the following problems: 1. Sparse & dense Matrix operations using arrays 2. Library of string operations - representing strings using arrays 3. Set operations 4. Stacks using array representation 5. Queues using array representation 6. Linked Lists: Singly linked, Doubly linked and Circular lists 7. Linked Stacks and Queues 8. Conversion and Manipulation of Expressions 9. Binary trees and Threaded trees (with graphical representation) 10. Conversion of infix expression to postfix expression and evaluation 11. Multi-precision Arithmetic Operations. 12. Implementation and analysis of Table and Hash Table with collision handling.


     1 0 3 3

     Basics of Data Processing - COBOL program structure - Screen input/output - Sequential file - Random file - Index file - SORT and MERGE verb - Table Handling. Total 14 REFERENCES 1. Roy M. K. and Ghosh Dastidhar D., "COBOL Programming", Tata McGraw Hill, 1999. 2. Philipakkis A. S. and Leonard J Kazmir, "Structured COBOL Programming", John Wiley & Sons, Inc., 1997. 3. Robert A Stern and Nancy Stern, "Structured COBOL Programming", John Wiley & Sons, Inc., 1998. Programs are to be developed on the following Topics : 1. Simple program using Working-Storage section. 2. Programs using Sequential, Relative and Indexed Organisation of Files. 3. Programs using various types of PERFORM verbs. 4. Table Handling using OCCURS Clause. 5. Programs using SORT and MERGE verbs. 6. Implement the SORT and MERGE Verb. 7. Programs using REDEFINE and RENAME Clause 8. Program using Condition name 9. Develop a Pay-Roll system for an organisation with reasonable assumptions.



     4 1 0 5

     MATHEMATICAL LOGIC: Proposition - logical operators - truth tables - normal forms. - laws of logic - proofs in propositional calculus - mathematical induction. (7) RELATIONS AND FUNCTIONS: (Brief review of set theory), partition and covering of sets, minsets. Definition and properties of relations - equivalence relation- partial order, composition of relations, closure operation on relation. Functions-Injective, Subjective, Bijective functions, Composition, identity and inverse. (7) RECURRENCE RELATIONS: Some recurrence relation models, Solutions of recurrence relations -by substitution and generating functions, the method of characteristic roots, solution of non homogeneous finite order linear recurrence relations. (7) GROUP THEORY: Group axioms - semi groups - monoids - application to generation of codes using parity checks - error recovery in group codes (10) FORMAL LANGUAGES: Four classes of grammars (Phrase Structure, Context sensitive, Context Free, Regular) - Context free languages: generation trees - Ambiguity. (7) FINITE AUTOMATA: Finite State Automata (DFA) - Non-deterministic Finite State Automata (NDFA) - Conversion of NDFA to DFA - Equivalence of regular grammar and finite automata. (7) PUSH DOWN AUTOMATA (PDA): Definition - Acceptance by final state and empty - store, equivalence of acceptance by final state and empty - store, equivalence of PDA's and CFL's, definition of a deterministic PDA. (7) TURING MACHINES: Definition - construction of simple Turing Machines - Universal TuringMachines - Halting problem. (4) Total 56

     REFERENCES 1. Doerr Alan and Levasseur Kenneth, "Applied Discrete Structures for Computer Science", Galgotia Publications, 2001. 2. Benard Kolman, Robert C. Busby and Sharan Ross, "Discrete Mathematical Structures", Pearson Education, 2001. 3. John E. Hopcroft and Jeffrey D.Ullman, "Formal Languages and Their Relation to Automata", Addison Wesley Publishing Company, 1969. 4. John C.Martin, "Introduction to languages and the theory of computation", McGraw-Hill Companies, Inc.1997 5. Edward M. Reingold, Jurg Nievergelt and Narsingh Deo , "Combinatorial Algorithms - Theory and Practice", Prentice-Hall, 1977.


     3 0 0 3 STATISTICAL QUALITY CONTROL: Statistical basis for control charts control limits control charts for variables - _

    x,R,; charts, charts for defective - charts charts for defects - charts (6) p,npc,u

     INTRODUCTION TO SAMPLING CONCEPTS LOT-BY-LOT ACCEPTANCE SAMPLING BY ATTRIBUTES: single sampling plan Double sampling plan Multiple sampling plan Type A amd type B oc curves, consumer‟s risk, producer‟s risk. ASN, ATI, AOQ curves MIL-STD-105D sampling plans. (8) ADDITIONAL ACCEPTANCE SAMPLING PLANS: Lot-by-Lot acceptance Sampling plans for attributes Dodge Romeng tables Philips standard sampling system chain sampling inspection plan sequential sampling plan skip-lot sampling plans. Acceptance sampling plans. Acceptance sampling for continuous productions CSP-1 plans, CSP-2 plans. (8) DEFINITION OF RELIABILITY, HAZARD RATE AND MEAN TIME TO FAILURE: Mathematical models for reliability studies Normal, Exponential and Weibull failure laws (7) SYSTEM RELIABILITY: System failure rate, system mean time before failure, Series system, Parallel system, (k,n) system, Series-Parallel systems, Parallel-Series system Standby systems systems subject to two types of failure. (7) SYSTEMS WITH REPAIR: Systems of order 2, (1,2) systems with arbitrary repair, (m,n) systems with parallel repair. (6) Total 42 REFERENCES 1. John G.Rau, “Optimization and Probability in Systems Engineering“, Van Nostrand, 1970. 2. Trivedi K.S, “Probability and Statistics with Reliability, Queueing and Computer Science applications”, Prentice Hall, 1998 3. Charles E.Eberling,”An Introduction to Reliability and Maintainability Engineering“, Mc Graw Hill, 1997. 4. Daleh Bester field, “Quality Control”, Prentice Hall, 1986.


     4 0 0 4

INTROUDCTION : System - System Development - types of systems people involved in the systems development - The project life cycle models - need for Software Engineering - Objectives & Benefits of Software Engineering - Factors that influence Quality & Productivity Quality attributes of a software product. (6) SOFTWARE PLANNING : Software Project Estimation - different techniques of project cost estimation Decomposition technique - COCOMO & PUTNAM models . (4) SOFTWARE ANALYSIS : Principles of Analysis - Analysis tools : Data Flow Diagram (DFD) - Data Dictionary - State Transition Diagram - ETVX diagram - SADT diagram - Process Specifications Languages : ER Languages - PSL/PSA - GIST - RSL/REVS. (8) ANALYSIS MODELS : Essential Model - Environmental Model - Behavioral Model - User Implementation Model. (3) SOFTWARE DESIGN : Principles of Design - Levels of Design - Coupling - Cohesion - Design Tools - Entity Relationship Diagram - HIPO diagram - Structure Chart - Decision Tree - Decision Table - Structured Flowchart - Structured English - Pseudocode - Nassi Sneiderman Diagram. (10)

Report this document

For any questions or suggestions please email