M.

Tech (Bio Technology)

EXPERIMENTAL DESIGN
Subject Code: MBTE07

Credits: 3:1:0 (4)

Objectives of the course: The course will help to:

1. Learn the fundamentals of statistical models and experimental designing.
2. Understand the collection, designing and analysis of data for research.
3. Understand the implementation of mathematical models for designing experiments.
4. Study the statistical softwares and their implementation in the current research.
Course Outcome: On completion of this course student will have improved ability:1. To understand the basic aspects of statistics and mathematical models used in biological
research.
2. To acquire working knowledge on the statistical models and their applications in the
research.
3. To execute different techniques to collect, design, store and analyzing data in different
fields of research.
4. To correlate the statistical significance of observed data with that of experimental data
using software tools.
UNIT-I
Probability (basic concepts till Baye's theorem), Random variables discrete and continuous,
Mathematical expectation and its laws, Moments, coefficient of skewness and kurtosis,
Probability distributions Bernoulli/Binomial, Poisson, Normal, Gamma
UNIT-II
Correlation, Regression analysis, Partial and multiple correlation and regression, Regression
diagnostics - residuals, multicollinearity, testing adequacy of fit and validation in regression
analysis; Sampling distribution of correlation and regression coefficients; Testing of hypothesis:
z test, t-test, Chi-square test and F-test
UNIT-III
Joint probability distributions for discrete and continuous variables, conditional expectation,
stochastic independence, {generalization to n dimensional random variables}
Introduction to Mat lab Statistical tool box
Concept of analysis of variance and covariance of data for one-way and multi-classified
experiments; Multiple Mean Comparison, Pair wise Contrasts, Type of Models (Fixed or
Random), Incomplete Blocks/Missing data
UNIT-IV
Fishers principles, Basics of designing an experiment
Completely Randomized Design (CRD), Principles and Usage, Randomization, Data
Analysis/Model (one-way ANOVA), Advantages/Disadvantages, Ideal Conditions
(assumptions)/Data transformation,
Randomized Complete Block Design, One-way Blocking, Data Analysis (multi-way ANOVA),
Data Analysis (multi-way ANOVA)

UNIT-V
Latin squares: The 2k factor design, Blocking and confounding, two level fractional factorial
design, Three level and mixed level factorial, fractional design and Plackett- Burman design.
Factorial Treatment Structure, Two level factorial designs, Blocking and confounding systems
for two level factorials, Partial confounding, Fractional factorial design, Yates forward
algorithm, Choice of treatments, Qualitative/Quantitative factors.
Review of Linear Regression Analysis, Analysis of Covariance (ANCOVA), Blocks and / or
Covariates
Response surface methodology Central Composite Design and Box-Benkhen Design

TUTORIALS
1. t-test and Chi-square test using Microsoft Excel
2. ANOVA using Microsoft Excel
3. ANOVA using Microsoft Excel
4. Randomized Block Design A case study
5. Completely Randomized Block Design A case study
6. Latin Square design A case study
7. Factorial design A case study
8. 2K fractional factorial designs A case study
9. 3K fractional factorial designs A case study
10. ANCOVA a case study
11. Central Composite Design A case study
12. Box-Benkhen design A case study

Test books:
1. Misra BL (2005) Design & Analysis of Experiments for Agricultural Workers, 1st Ed, Kalyan
Pub.
2. Douglas C. Montgomery (2009) Design and Analysis of Experiments, 7th Edition, Wiley
publication.
3. Rudra Pratap (2005) Getting started with Mat lab, Oxford University Press.
4. Arun Kumar and Alka Chaudary (2006) Sample Survey Analysis and Design of Experiment,
2nd Edition, Krishna Prakash Media (P) Ltd.

References:
1. Sundararaj N, Nagaraju S, Ramu MNV, Jagannath MK (1972) Design and analysis of field
experiments. Miscellaneous Series, University of Agricultural Sciences, Bangalore.
2. Neural Network Toolbox 6 User's Guide, Matlab Inc, USA, Source:
http://www.mathworks.com/access/helpdesk/help/pdf_doc/nnet/nnet.pdf
3. Genetic
algorithm
Toolbox
User's
Guide,
Matlab
Inc,
USA,
Source:
http://www.mathworks.com/access/helpdesk_r13/help/pdf_doc/gads/gads_tb.pdf
5. Steel & Torrie (1980) Principals and Procedures of Statistics A Biometrical Approach.
6. Kirk (1995) Experimental Design, Procedures for the Behavioral Sciences.
7. Kuehl (2000) Design of Experiments: Statistical Principals of Research Design and Analysis.
8. Quinn & Keough (2002) Experimental Design and Data Analysis for Biologists.

M.Tech (CIM and Manufacturing Sciences)

(Mechanical)

COMPUTATIONAL NUMERICAL METHODS

Subject Code: MMSE11

Credits: 3:1:0 (4)

Preamble:
The course aims to introduce Numerical methods which provide constructive methods for
obtaining numerical solutions to practical engineering problems for which exact solutions by
analytical methods are difficult and time consuming.

Course Objectives:
The Student will
1. Learn the concept of different types of errors.
2. Learn mathematical modeling of some physical problems.
3. Learn to obtain a root of algebraic and transcendental equations.
4. Learn the concept of differentiation and integration of a tabulated function.
5. Learn to solve system of linear algebraic equations and to find eigenvalues and eigenvectors of
a given square matrix.
6. Learn the concept of linear transformation matrix of linear transformation, linear models and
Gram-Schmidt Process.

Course Outcomes:
The Student will be able to
1. Model some simple mathematical models of physical Applications.
2. Find the roots of polynomials that arise in Science and Engineering problems.
3. Differentiate and integrate a function for a given set of tabulated data, for Engineering
Applications.
4. Solve the system of linear equations by different methods that arise in Science and Engineering
Problems.
5. Find eigenvalues and eigenvectors which deals with the modeling of the system and the
behavior of the system.
6. Find orthogonal or orthonormal basis using Gram-Schmidt Process.

UNIT I
1. Approximations and round off errors: Significant figures, accuracy and precision, error
definitions, round off errors and truncation errors. Mathematical modeling and Engineering
problem solving: Simple mathematical model, Conservation Laws of Engineering.
2. Roots of Equations: Bracketing methods Newton-Raphson method, Multiple roots, Simple
fixed point iteration.

UNIT II
3. Roots of polynomial-Polynomials in Engineering and Science, Mullers method, Graeffes
Roots Squaring Method.
4. Numerical Differentiation and Numerical Integration: Newton-Cotes and Guass Quadrature
Integration formulae, integration of Equations, Romberg integration, Numerical Differentiation
Applied to Engineering problems, High Accuracy differentiation formula.

UNIT III
5. System of Linear Algebraic Equations And Eigen Value Problems: Introduction, Gauss
Elimination Method, Gauss-Jordan Elimination Method, Triangularization method, Cholesky
Method, Partition method, error Analysis for direct methods, iteration Methods.

UNIT IV
6. Eigen values and Eigen Vectors: Bounds on Eigen Values, Jacobi method for symmetric
matrices, Givens method for symmetric matrices, Householders method for symmetric
matrices, Rutishauser method for arbitrary matrices, Power method.

UNIT V
7. Linear Transformation: Introduction to Linear Transformation, The matrix of Linear
Transformation, Linear Models in Science and Engg.
8. Orthogonality and Least Squares: Inner product, length and orthogonality, orthogonal sets,
Orthogonal projections, The Gram-Schmidt process, Least Square problems, Inner product
spaces.

Text books:
1. S S Sastry Numerical Analysis for Engineers Tata Mcgraw Hill Edition.
2. Steven C Chapra, Raymond P Canale Numerical Methods for Engineers fourth Edition,
Tata Mcgraw Hill.
3. M K Jain, S R K Iyengar, R K Jain Numerical Methods for Scientific and Engg.
Computation New Age International Publishers.

Reference books:
1. Prevez Moin Application of Numerical Methods to Engineering.
2. David C Lay Linear Algebra and its Applications 3rd Edition, Pearson Education.

M.Tech (Computer Science and Engineering)

Random Variables, Stochastic Processes and Queuing

Theory

Credits: 4:0:0 (4)

Course Objectives:
The students will
1. Learn the concept of discrete and continuous random variable
2. Understand the Probability mass and density function and probability distributions
3. Learn the theory of Random process and special classes of random variable
4. Learn the concept of continuous time Markov Chains, pure birth , pure death, birth and death process
5. Learn the concept of different queuing models such as M/M/1, M/G/1.

Unit I: Discrete Random Variables

Introduction, Random variables and their event spaces, Probability Mass function. Distribution
functions, Special Distribution functions, Independent Variables
Unit II: Continuous Random Variables
Introduction, Exponential Distribution, Functions of a random variable, Jointly distributed
random variables, Functions of normal random variables
Unit III: Random Processes
Introduction, Binomial Process, Poisson Process, Ergodic Process, Special Classes of Random
Process
Unit IV: Markov Process
Markov chain and Transition Probabilities, Continuous Parameter Markov chain, Pure birth and
pure Death Process, Birth and Death Process, Renewal Process
Unit-V: Introduction to Queuing theory and applications
Single server with infinite system capacity, queuing Modes
(M/M/1):( /FIFO),(M/M/1):(k/FIFO),(M/M/s):( /FIFO),
(M/M/s):(k/FIFO),M/G/1 Queuing system characteristics, Case Studies
Text Books
1. Sheldon M Ross Introduction to Probability Models, 10th Edition, Elsevier, 2010
2. T Veera Rajan Probability, Statistics and Random Process, 3rd Edition, Tata Mc Graw Hill, 2008

Reference Books
1. Kishore S Trivedi Probability & Statistics with Reliability, Queuing and Computer Science
Applications, 2nd edition, John Wiley & Sons, 2008.
2. Athanasios Papoulis. S, Unni Krishna Pillai Probability, Random Variables and Stochastic
Processes, 4th edition, Tata Mc. Graw Hill, 2002.

Course Outcomes:
The students will be able to
1. Recognize the random variable governing the problem
2. Discuss the different features of the probability distribution which is used in statistical models.
3. Uses of knowledge random processes, evaluate various measures of the system effectiveness
such as response time, reliability, etc.,
4. Recognize the types of queues and discusses its queuing system characteristics.

M.Tech (Information Science)

ADVANCED MATHEMATICS
Course Code: MSWE11

Credits: 4:1:0

Prerequisites: Nil

Contact Hours

: 56L + 28T

Course objectives:
The Students will

Learn to solve algebraic and transcendental equations Numerically.

Understand the concepts of Vector spaces and its applications to Difference
equations and Markov chains.
Learn the concepts of Diagonalization by finding The Eigen values and Eigen
vectors.
Learn the concepts of Random Process,Poisson Process.
Understand the different Queuing Models.

Course Contents:
Unit I
Numerical Methods: Errors, Different types of errors, Fixed Point Iteration method, Aitkens
2 Process method, Newton-Raphson method for a system of two simultaneous equations,
Horners method, Birje-Vieta method.
Introduction to Linear Algebra,Consistency,Gauss Jordan method.
Unit II
Vector Spaces: Vector spaces and Subspaces, Null Spaces, Column Spaces and Linear
Transformations, Linearly Independent Sets, Basis, Coordinate Systems, The Dimension of
Vector Space, Rank, Change of Basis, Applications to Difference Equations.
Unit III
Linear Transformations: Introduction to Linear Transformations, The Matrix of a Linear
Transformation, Rank-nullity theorem, Algebra of Linear Transformations.
Eigenvalues and Eigenvectors: Characteristic equation, Diagonalization, eigenvectors and
linear transformation.
Unit IV
Probability:Introduction to the theory of Probability,Random variables,Binomial and Normal
distribution,Stochatic process and Markov chains.
Markov Process: Markov Process, Poisson Process, Pure Birth and Pure Death Process, Birth
and Death Process.

Unit V
Introduction to Queuing theory and Applications: Single server with infinite system capacity,
queuing Modes (M/M/1): ( /FIFO),(M/M/1):(k/FIFO),(M/M/s): ( /FIFO),
(M/M/s):(k/FIFO),M/G/1 Queuing system characteristics, Case Studies.
Tutorials:
2
1. Examples on Aitkens Process method and Newton-Raphson method.
2. Problems on Horners method and Birje-Vieta method.
3. Examples on consistency and Gauss Jordan method.
4. Problems on Vector spaces and Subspaces.
5. Problems on Basis and Change of Basis.
6. Application to Difference Equations and Markov chains.
7. Problems on Linear Transformations.
8. Examples on Eigen values and Eigen vectors.
9. Problems on Random variables and distributions.
10. Problems on Markov and Poisson Process
11. Problems on M/M/1 Queing system.
12. Problems on M/G/1 Queing system.

References:
1. M.K.Jain, S.R.K. Iyengar and R.K. Jain- Numerical Methods for Scientific and
Engineering Computation, 5th Edition, New Age International Publishers, 2007.
2. David C. Lay- Linear Algebra and its Applications, 3rd Edition, Pearson, 2011.
3. T. Veerarajan-Probability,Statistics and Random Processes 3rd Edition ,Tata McGraw-Hill,
2008.
4. Kishore S.Trivedi- Probability and Statistics with Reliability, queuing and Computer
Science Applications,2nd Edition, John Wiley & Sons,2008.
Course outcomes:
Students will be able to
CO1: Solve the problems of algebraic and transcendental equations using numerical
methods.
CO2: Apply Vector spaces to solve Difference equations and problems arising in Markov
chains.
CO3: Diagonalize the Matrix by finding the Eigen values and Eigen vectors.
CO4: Apply the concept of Random process to discuss Poisson process,Birth and Death process,
Pure Birth and Pure Death process.
CO5: Study the system characteristics in analyzing Queuing Models.