M.Sc. (MATHEMATICS WITH APPLICATIONS IN COMPUTER SCIENCE) M.Sc. (MACS)

Similar documents
O June, 2010 MMT-008 : PROBABILITY AND STATISTICS

M.Sc.(Mathematics with Applications in Computer Science) Probability and Statistics

Name of the Student:

Probability Models in Electrical and Computer Engineering Mathematical models as tools in analysis and design Deterministic models Probability models

Stochastic Processes. Theory for Applications. Robert G. Gallager CAMBRIDGE UNIVERSITY PRESS

Random Walk on a Graph

Markov Chains. X(t) is a Markov Process if, for arbitrary times t 1 < t 2 <... < t k < t k+1. If X(t) is discrete-valued. If X(t) is continuous-valued

Recap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks

IEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.

Contents Preface The Exponential Distribution and the Poisson Process Introduction to Renewal Theory

Stochastic process. X, a series of random variables indexed by t

Statistics 150: Spring 2007

Statistics 253/317 Introduction to Probability Models. Winter Midterm Exam Friday, Feb 8, 2013

Name of the Student: Problems on Discrete & Continuous R.Vs

STA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008

Name of the Student: Problems on Discrete & Continuous R.Vs

An Introduction to Stochastic Modeling

Name of the Student: Problems on Discrete & Continuous R.Vs

Computer Systems Modelling

Name of the Student: Problems on Discrete & Continuous R.Vs

T. Liggett Mathematics 171 Final Exam June 8, 2011

Irreducibility. Irreducible. every state can be reached from every other state For any i,j, exist an m 0, such that. Absorbing state: p jj =1

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

57:022 Principles of Design II Final Exam Solutions - Spring 1997

Problems on Discrete & Continuous R.Vs

EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY (formerly the Examinations of the Institute of Statisticians) GRADUATE DIPLOMA, 2004

4.7 Finite Population Source Model

The Transition Probability Function P ij (t)

Statistics 433 Practice Final Exam: Cover Sheet and Marking Sheet

Classification of Queuing Models

Birth-Death Processes

Homework 4 due on Thursday, December 15 at 5 PM (hard deadline).

Stochastic Processes

IEOR 3106: Second Midterm Exam, Chapters 5-6, November 7, 2013

HANDBOOK OF APPLICABLE MATHEMATICS

IEOR 6711, HMWK 5, Professor Sigman

Time Reversibility and Burke s Theorem

Outline. Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue.

Part I Stochastic variables and Markov chains

Q = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days?

QUEUING MODELS AND MARKOV PROCESSES

Simulation. Where real stuff starts

Queueing Theory. VK Room: M Last updated: October 17, 2013.

Transient Solution of a Multi-Server Queue. with Catastrophes and Impatient Customers. when System is Down

Solutions to Homework Discrete Stochastic Processes MIT, Spring 2011

Non Markovian Queues (contd.)

Readings: Finish Section 5.2

TCOM 501: Networking Theory & Fundamentals. Lecture 6 February 19, 2003 Prof. Yannis A. Korilis

Name of the Student: Problems on Discrete & Continuous R.Vs

MAT SYS 5120 (Winter 2012) Assignment 5 (not to be submitted) There are 4 questions.

Bernoulli Counting Process with p=0.1

Link Models for Circuit Switching

Multi Stage Queuing Model in Level Dependent Quasi Birth Death Process

COPYRIGHTED MATERIAL CONTENTS. Preface Preface to the First Edition

THE QUEEN S UNIVERSITY OF BELFAST

Page 0 of 5 Final Examination Name. Closed book. 120 minutes. Cover page plus five pages of exam.

MA6451 PROBABILITY AND RANDOM PROCESSES

Fundamentals of Matrices

16:330:543 Communication Networks I Midterm Exam November 7, 2005

Answers to selected exercises

Massachusetts Institute of Technology

CS 798: Homework Assignment 3 (Queueing Theory)

Engineering Mathematics : Probability & Queueing Theory SUBJECT CODE : MA 2262 X find the minimum value of c.

Electronic Companion Fluid Models for Overloaded Multi-Class Many-Server Queueing Systems with FCFS Routing

Glossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP

YORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS MATH , YEAR APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS)

EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran November 13, 2014.

Two Heterogeneous Servers Queueing-Inventory System with Sharing Finite Buffer and a Flexible Server

Availability. M(t) = 1 - e -mt

Contents LIST OF TABLES... LIST OF FIGURES... xvii. LIST OF LISTINGS... xxi PREFACE. ...xxiii

Queueing systems in a random environment with applications

Stationary Analysis of a Multiserver queue with multiple working vacation and impatient customers

P 1.5 X 4.5 / X 2 and (iii) The smallest value of n for

λ λ λ In-class problems

Renewal theory and its applications

GI/M/1 and GI/M/m queuing systems

Review (probability, linear algebra) CE-717 : Machine Learning Sharif University of Technology

Computer Systems Modelling

MARKOV PROCESSES. Valerio Di Valerio

Multivariate Statistical Analysis

JRF (Quality, Reliability and Operations Research): 2013 INDIAN STATISTICAL INSTITUTE INSTRUCTIONS

Lecture 7. We can regard (p(i, j)) as defining a (maybe infinite) matrix P. Then a basic fact is

Exercise Set 7.2. Skills

Chapter 5: Special Types of Queuing Models

= P{X 0. = i} (1) If the MC has stationary transition probabilities then, = i} = P{X n+1

Lecture 20: Reversible Processes and Queues

(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?

Markov Chains, Stochastic Processes, and Matrix Decompositions

Math 597/697: Solution 5

Queuing Theory. Using the Math. Management Science

Lecturer: Olga Galinina

J. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY

Control of Fork-Join Networks in Heavy-Traffic

18.06 Professor Edelman Quiz 3 December 5, 2011

LECTURE #6 BIRTH-DEATH PROCESS

Simulation. Where real stuff starts

INDEX. production, see Applications, manufacturing

Name of the Student: Problems on Discrete & Continuous R.Vs

MAS275 Probability Modelling Exercises

Lecture 5. If we interpret the index n 0 as time, then a Markov chain simply requires that the future depends only on the present and not on the past.

Transcription:

No. of Printed Pages : 6 MMT-008 M.Sc. (MATHEMATICS WITH APPLICATIONS IN COMPUTER SCIENCE) M.Sc. (MACS) Term-End Examination 0064 December, 202 MMT-008 : PROBABILITY AND STATISTICS Time : 3 hours Maximum Marks : 00 (Weightage : 50%) Note : Question No. S is compulsory. Answer any six questions from question No. to 7. Use of calculator is not allowed.. (a) Random variables X and Y have joint p.d.f 7 f (x, y)= -8 (y2- x2) e-y X~ (i) (ii) < y,y > 0. Find marginal distributions of X and Y and hence prove that X and Y are dependent. Check whether X and Y are correlated or not. (b) Using the method of spectral decomposition 8 evaluate pn for the following transition matrix [0.7 0.3 P=.6 0.4] Hence obtain Inn n -400 pll MMT-008 P.T.O.

2. (a) Differentiate between irreducible and a periodic Markov Chain with the help of examples. Define recurrence and transient states. If n step transition probabilities of a (n) given state i is pig = 2 for n > No then (i) Show that all the states are a periodic and non-null persistent. (ii) Find the mean recurrence time for the state i. (b) A system has two identical components, but uses only one at a time. If first one fails, it automatically switches on to the second. The system fails, when both the components fail. At that time both are replaced instantaneously. Assuming that the life time distribution of the component is exponential with parameter X, express the system in a renewal process frame work. Find the interoccurance time distribution and its laplace transform. 6 9 3. (a) Consider a planned replacement policy that 7 takes place every 3 years ie. a machine required for continuous use is replaced on failure or at the end of three years. Compute. (i) long term rate of replacement (ii) long term rate of failure (iii) long term rate of planned replacement. Assume that successive machine life times are uniformly distributed over the interval [2, 5] years. MMT-008 2

(b) Describe M/M/K/N queueing system, 8 stating the assumptions. Derive the expression for probability of i customers in the system in steady state. Also, derive expression for expected number of customers in the queue. 4. (a) Write the assumptions for the system 5 M/D/2/N in queueing notation. In a single server channel in doctor's clinic, patients arrive and join the queue at the end every a minutes and leave the clinic every 3 minutes. Assuming the queue with n patients, find the queue length? (b) Consider the mean vector II, = [ -3 2 and 0 = 9, and the covariance matrices of x, x2 and y are XX = C 2] 2 Y [3 (i) Fit the equation y = b0 + b x + b2 x2 as best linear equation. (ii) Find the multiple correlation coefficient (iii) Find the mean square error. 5. (a) If A is a real symmetric matrix of order n, 7 prove that there exists a real orthogonal matrix P of order n such that A = PDP' where D is a real diagonal matrix. Further show that elements of D are eigen values of A and the columns of P are orthonormal eigen vectors of A. MMT-008 3

(b) In answering a question on a multiple choice 5 test an examinee either knows the answer (with probability p) or guesses (with probability (-p)). Assume that the probability of answering a question correctly is unity if examinee knows the answer and /m if the examinee guesses. Suppose an examinee answers a question correctly, What is the probability that the examinee really know the answer? (c) Let X N3 (II, where..lx -2-4 - 9 0 2 0 4 0. Obtain the conditional 2 0 6 distribution of [x i X given x3 =. 2 and 3 6. (a) X = (X, X2, X3)' has Np distribution, 8 4 2' 4 2 where p, = (,, 0)' and / = \2 2 4, Find (i) (ii) conditional distribution of X given X2 = 0.5 and X3 =0.2. Obtain a non singular transformation Y = TX + C such that Y, Y2 and Y3 are independent standard normal variables. MMT-008 4 P.T.O.

(b) Find principle components and proportion 7 of total population variance explained by each when the covariance matrix is : 6 2 2 = 2 3 2 3 7. (a) Consider three random variables X i, X2 and 7 X3 having positive definite covariance matrix given by : 0.9 0.7 = 0.9 0.4 0.7 0.4 Write its factor model with single factor and show that no proper solution exists in this case. (b) Determine the definiteness of the following 4 quadratic forms (give details) : (i) x 2 x 2 + x 2 2 3 X x 2 + 0 x x 3-2X2 x3 (ii) 9 x2 + 4x22 + 4x32 + x42 + 8 x2 x3 + 2 x3 x +2 x x2 (c) Let the data matrix for a random sample of 4 size n =3 from a bivariate normal [6 0 8 population be X = 9 6 3. Evaluate the observed T2 for tio' = [9, 5]. What is the sampling distribution of T2 in this case? MMT-008 5 P.T.O.

8. State whether the following statements are true or false. Justify your answers : 2x5=0 (a) Irreducible recurrent Markov Chain always has stationary distributions. (b) The processes {Nt t 0} and {Nti_x, t 0} have the same distribution. (c) In the queueing system represented by M/E5/ 3/5/ 20/FCFS the distribution of service time is exponential. (d) The unique square root of a matrix A= 4 2 3 2 2 2 2 (e) Let Xi Np (p,,), where i-----, 2, 3 _ N. be independent, then X Np (ii, /). MMT-008 6