O June, 2010 MMT-008 : PROBABILITY AND STATISTICS

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

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

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

Chapter 6: Functions of Random Variables

Name of the Student:

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

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

Problems on Discrete & Continuous R.Vs

HANDBOOK OF APPLICABLE MATHEMATICS

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

COPYRIGHTED MATERIAL CONTENTS. Preface Preface to the First Edition

[Chapter 6. Functions of Random Variables]

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

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

THE QUEEN S UNIVERSITY OF BELFAST

STAT515, Review Worksheet for Midterm 2 Spring 2019

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

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

EE126: Probability and Random Processes

Answers to selected exercises

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017

Probability Models. 4. What is the definition of the expectation of a discrete random variable?

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

Stochastic Processes

Readings: Finish Section 5.2

Part IA Probability. Definitions. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015

Chapter 10. Queuing Systems. D (Queuing Theory) Queuing theory is the branch of operations research concerned with waiting lines.

This exam contains 6 questions. The questions are of equal weight. Print your name at the top of this page in the upper right hand corner.

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

Interlude: Practice Final

Queuing Theory. Richard Lockhart. Simon Fraser University. STAT 870 Summer 2011

Statistics 253/317 Introduction to Probability Models. Winter Midterm Exam Monday, Feb 10, 2014

Computer Systems Modelling

Computer Systems Modelling

EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2018 Kannan Ramchandran February 14, 2018.

Some Continuous Probability Distributions: Part I. Continuous Uniform distribution Normal Distribution. Exponential Distribution

0, otherwise. U = Y 1 Y 2 Hint: Use either the method of distribution functions or a bivariate transformation. (b) Find E(U).

Chapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

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

Queueing Theory II. Summary. ! M/M/1 Output process. ! Networks of Queue! Method of Stages. ! General Distributions

Part I Stochastic variables and Markov chains

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

PROBABILITY & QUEUING THEORY Important Problems. a) Find K. b) Evaluate P ( X < > < <. 1 >, find the minimum value of C. 2 ( )

Probability and Statistics

Statistics Ph.D. Qualifying Exam: Part I October 18, 2003

Queuing Analysis. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall

Chapter 3 sections. SKIP: 3.10 Markov Chains. SKIP: pages Chapter 3 - continued

EE 368. Weeks 3 (Notes)

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?

Queueing Theory and Simulation. Introduction

Multiple Random Variables

1 st Midterm Exam Solution. Question #1: Student s Number. Student s Name. Answer the following with True or False:

5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.

IE 336 Seat # Name (one point) < KEY > Closed book. Two pages of hand-written notes, front and back. No calculator. 60 minutes.

Random Walk on a Graph

Review. DS GA 1002 Statistical and Mathematical Models. Carlos Fernandez-Granda

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

STAT:2020 Probability and Statistics for Engineers Exam 2 Mock-up. 100 possible points

Slides 9: Queuing Models

Chapter 3 Balance equations, birth-death processes, continuous Markov Chains

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

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

1.1 Review of Probability Theory

The Moments Generating Function of a Poisson Exponential Joint Distribution

4 Branching Processes

Statistics & Data Sciences: First Year Prelim Exam May 2018

T. Liggett Mathematics 171 Final Exam June 8, 2011

Renewal theory and its applications

Geo (λ)/ Geo (µ) +G/2 Queues with Heterogeneous Servers Operating under FCFS Queue Discipline

Review (Probability & Linear Algebra)

STAT 302 Introduction to Probability Learning Outcomes. Textbook: A First Course in Probability by Sheldon Ross, 8 th ed.

Probability and Statistics Concepts

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

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

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

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

M/G/1 and M/G/1/K systems

Waiting Line Models: Queuing Theory Basics. Metodos Cuantitativos M. En C. Eduardo Bustos Farias 1

56:171 Operations Research Fall 1998

Link Models for Circuit Switching

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

Example 1. Let be a random sample from. Please find a good point estimator for

Part IA Probability. Theorems. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015

Stat 150 Practice Final Spring 2015

Queueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "

Operations Research II, IEOR161 University of California, Berkeley Spring 2007 Final Exam. Name: Student ID:

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

15-388/688 - Practical Data Science: Basic probability. J. Zico Kolter Carnegie Mellon University Spring 2018

Exam of Discrete Event Systems

Assignment 3 with Reference Solutions

Chapter 3 sections. SKIP: 3.10 Markov Chains. SKIP: pages Chapter 3 - continued

Homework 4 Math 11, UCSD, Winter 2018 Due on Tuesday, 13th February

IE 581 Introduction to Stochastic Simulation. Three pages of hand-written notes, front and back. Closed book. 120 minutes.

Continuous-time Markov Chains

Continuous Time Processes

Lecture 4: Bernoulli Process

Intro to Probability. Andrei Barbu

MATH 360. Probablity Final Examination December 21, 2011 (2:00 pm - 5:00 pm)

Practice Problems Section Problems

λ, µ, ρ, A n, W n, L(t), L, L Q, w, w Q etc. These

Transcription:

No. of Printed Pages : 8 M.Sc. MATHEMATICS WITH APPLICATIONS IN COMPUTER SCIENCE (MACS) tr.) Term-End Examination O June, 2010 : PROBABILITY AND STATISTICS Time : 3 hours Maximum Marks : 100 Note : Question number 8 is compulsory. Answer any six questions from question number 1 to 7. Use of calculator is not allowed. 1. (a) If {x (+) : t > 0} is a Poisson process with 8 rate X and Sm denotes the duration from start to the occurrence of mth event, obtain the distribution of Sm. If X =1 per hour then find probability that duration from start to the occurrence of third event will be less than 2 hours. (b) Suppose that random variables X and Y 7 have the following joint p.d.f. {x+y, 0<x<1, 0<y<1 f (x, A = 0 elsewhere (i) Find the conditional p.d.f. of X given Y = y. 1 P.T.O.

Check independence of X and Y. Compute p [ o < x < 3. Y = 2] 2. (a) Customers arrive at a counter in a bank in 8 accordance to Poisson process at an average rate of 8 per hour. Service time at the counter follows exponential distribution with a mean 5 minutes. Find : the probability that a customer will have to wait before service. proportion of time the counter will be idle. the probability that total time spent at the counter by a customer is more than 10 minutes. average waiting time at the counter. (b) In a Branching process, the offspring 7 distribution is given as : pk = ( nk p \k q n-k, k =0, 1, 2,...n; q=1 p 0<p<1 Find the probability of ultimate extinction of the process given that (i) n = 2, p =.2 (ii) n=2, p =.8, 2

3. (a) Of the three bags containing red and green 6 balls, the first bag has 6 red and 4 green balls, the second bag has 3 red and 7 green balls and the third bag has 2 red and 8 green balls. A bag is selected at random and from the selected bag, a ball is chosen at random and is found to be green. Find the probability that the ball came from the second bag. (b) Customers in a bank may get service from 9 any one of the two counters. Customers arrive in the bank according to Poisson law at the rate 20 per hours. Service time at each counter is supposed to follow exponential distribution with mean 4 minutes. As an alternative bank thinks to install an automatic servicing machine which although has single service channel, but it will be able to serve two times faster than the counter clerk. Which system will be better in terms of customer waiting time in the bank. 3 P.T.O.

(a) The probability of a dry day following a rainy 8 day is.25 and probability of a rainy day following a dry day.20 in a two state simple weather model. Write down the transition probability matrix p for this two-state Markov chain P and find p(3), the three step transition probability matrix. If the probability of rainy day on August 1 be.7 then find the probability that August 4 will be (i) rainy day (ii) dry day. (b) Let (Xn, n =1, 2,...I be i.i.d. geometric 7 random variables with probability mass function p(xn = i) = (1 p)p ii =1, 2, 3... Find the renewal function of the corresponding renewal process. (a) Let X = {X1, X2, X3} be a random vector and 8 X be the data matrix given below 5 2 5 [X11 X'= 3 4 2 : X2 4 2 3 X3 Find (i) Variance-covariance matrix 1. (ii) Correlation matrix R. 4

(b) Let X denote the data matrix for a random 7 sample of size 3 from a bivariate normal population, where 6 91 X = [10 6 8 3 Test the hypothesis Ho : = (9, 5)' at 5% level of significance. 6. (a) On the basis of past experience about the 7 sales (X1) and profits (X2) the population mean vector and variance-covariance matrix for the industry was as given below = (10 5) = [310] 5 4 From a sample of 10 industries the sample mean vector was found as below [331 L7 Test whether the sample confirms the truthfulness of the industry claim of population mean vector. (you may like to use the following values : 2,.05 = 5.99, x3, 0.05 = 7.81). 5 P.T.O.

(b) Suppose x = (x i, x2, x3 )' be distributed as 8 a trivariate normal distribution, 1 0 N3 ( 1,1), where p = (2, 1, 3)', / = 14 1 2 1 0 1 3 Find the distribution of u = [ X1 - X3 Xi + X3-2X2 ] 7. (a) Let X and Y be a pair of independent 7 random variables. Find the Laplace transform of Y = X 1 + X2. (b) On the basis of 7 variables X1, X2,..., X7 a 8 factor analysis was performed. The factor loadings of first two factors obtained through principal components method with varimix rotation alongwith communality and variance summerized are given below

Variables Factors Communality I II X1.697.476.712 X2.748.445.758 X3.831.350.813 X4.596.648.775 X5.935.160.899 X6.866.201.790 X7.166.936..903 Sum of squares 3.473 1.909 Variance summerized.535.277 Average.807 Write linear equations for all the two factors. Explain how the values of communality, variance summerized. (iii) Interpret the loading coefficients and variance summerized. 8. State whether following statements are true or false. Justify your answer : 2x5=10 (a) Posterior probabilities obtained from Bayes theorem are larger than respective prior probabilities. 7 P.T.O.

The probability of extinction of a branching process is the root of S = P(S), where P(S) is the p.g.f. of the offspring distribution. Laplace transform of a function completely characterises the function. A state in a Markov chain is persistent, if the return to that state is not certain. Given A a nonsingular matrix, T2 statistics will be invariant to the transformation of linear form.