Janacek statistics tables (2009 edition) are available on your desk. Do not turn over until you are told to do so by the Invigilator.
|
|
- Rachel Bond
- 5 years ago
- Views:
Transcription
1 UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination CALCULUS AND PROBABILITY MTHB4006Y Time allowed: 2 Hours Attempt THREE questions. Janacek statistics tables (2009 edition) are available on your desk. Notes are not permitted in this examination. Do not turn over until you are told to do so by the Invigilator. MTHB4006Y Module Contact: Dr Peter Milne, MTH Copyright of the University of East Anglia Version: 1
2 (i) Explain carefully what is meant by any three of the following: (a) the probability mass function of a discrete random variable; (b) a random experiment; (c) sample space; (d) events A and B are disjoint; (e) events A and B are stochastically independent. (ii) Let S be a sample space and let A and B be events in S. Show that [ ] (a) P (A B c ) (A c B) = P (A B) P (A B); (b) P (A) = P (A B)P (B) + P (A B c )P (B c ). [8 marks] (iii) A professor of mathematics goes to a conference and wishes to attend a particular session. The probability that he will go to the wrong room is 0.8, the probability that he will arrive at the wrong time is 0.6 and the probability that he will arrive at the wrong room and at the wrong time is 0.5. Calculate the probability that (a) he will arrive either at the wrong room or at the wrong time; (b) he will arrive at the wrong room, given that he arrives at the right time; (c) he will arrive at the right time, given that he arrives at the wrong room.
3 (i) A continuous random variable X has probability density function f. State the definition of (a) the expectation E(X) of X ; (b) the variance V (X) of X. (ii) Define the continuous random variable T to be the waiting time between successive events in a Poisson process of intensity α. Show that (a) the probability density function of T is { 0 if t < 0 f(t) = αe αt if t 0; (b) E(T ) = 1 α ; (c) V (T ) = 1 α. 2 [10 marks] (iii) Lemmings jump off a cliff according to a Poisson process of intensity 6 per minute. A naturalist waits at the foot of the cliff and counts the number of lemmings arriving in a two minute period. (a) What is the probability that at most 12 lemmings arrive? (b) What is the probability that at least 4 lemmings arrive? (c) What is the expected waiting time between the first and fourth lemmings? MTHB4006Y PLEASE TURN OVER Version: 1
4 (i) At Fred Scruntley s Automotive Works, 30% of complaints are about defective spigots. On a certain day 16 customers make complaints. (a) What is the probability that at most 7 complaints are about defective spigots? (b) What is the probability that at least 6 complaints are about defective spigots? (c) If it is known that at most nine complaints were about defective spigots, what is the probability that at most 11 were about something else? [10 marks] (ii) The length of time for which a unit continues to function is a continuous random variable L. The reliability function R(t) of the unit is defined to be the probability that it still functions at time t: R(t) = P (L > t). The expected life of the unit is given by E(L) = 0 R(t)dt. Four units are connected to form the system shown below. (a) If the four units have reliability functions R 1 (t),..., R 4 (t), show that the reliability function of the system is R(t) = R 1 (t)r 2 (t) + R 3 (t)r 4 (t) R 1 (t)r 2 (t)r 3 (t)r 4 (t). (b) If the four units are all identical with reliability function R i (t) = e 3t (i = 1, 2, 3, 4), find the expected life of the system. [10 marks]
5 A mouse moves through the maze shown, changing room at time t = 0, 1, 2,..., by choosing any exit at random from the room currently occupied. Rooms 1 and 4 both contain a large piece of cheese; once the mouse enters either of these rooms it remains there for the duration of the experiment. This system can be described by a Markov chain with states {1, 2, 3, 4}, where the chain is in state i if the mouse is in room i. (i) Write down the transition matrix for this chain. [5 marks] (ii) For i = 1, 2, 3, 4, find the probability that the mouse is in room i after two timesteps, given that its initial room is chosen at random. (iii) (a) Find the fundamental matrix of this Markov chain. (b) Let π ij be the probability that the process is absorbed in state j given that it starts in state i, and let Π be the 2 2 matrix whose elements are π ij, i = 2, 3, j = 1, 4. Find Π. [7 marks] (iv) Find the expected number of timesteps elapsing before the mouse reaches the cheese when it starts in (a) room 2; (b) room 3. END OF PAPER
Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 SETS, NUMBERS AND PROBABILITY MTHA4001Y Time allowed: 2 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. penalised
More informationDo not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2016 17 SETS, NUMBERS AND PROBABILITY MTHA4001Y Time allowed: 2 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. Janacek
More informationAttempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 SETS, NUMBERS AND PROBABILITY MTHA4001Y Time allowed: 2 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. penalised
More informationAttempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 FERMAT S LAST THEOREM MTHD6024B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. penalised
More informationDo not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 216 17 INTRODUCTION TO NUMERICAL ANALYSIS MTHE612B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More informationIEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.
IEOR 6711: Stochastic Models I, Fall 23, Professor Whitt Solutions to Final Exam: Thursday, December 18. Below are six questions with several parts. Do as much as you can. Show your work. 1. Two-Pump Gas
More informationDo not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 216 17 INTRODUCTION TO NUMERICAL ANALYSIS MTHE712B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More information(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?
IEOR 3106: Introduction to Operations Research: Stochastic Models Fall 2006, Professor Whitt SOLUTIONS to Final Exam Chapters 4-7 and 10 in Ross, Tuesday, December 19, 4:10pm-7:00pm Open Book: but only
More informationDo not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2013 14 CALCULUS AND MULTIVARIABLE CALCULUS MTHA4005Y Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More informationMAT SYS 5120 (Winter 2012) Assignment 5 (not to be submitted) There are 4 questions.
MAT 4371 - SYS 5120 (Winter 2012) Assignment 5 (not to be submitted) There are 4 questions. Question 1: Consider the following generator for a continuous time Markov chain. 4 1 3 Q = 2 5 3 5 2 7 (a) Give
More informationModelling data networks stochastic processes and Markov chains
Modelling data networks stochastic processes and Markov chains a 1, 3 1, 2 2, 2 b 0, 3 2, 3 u 1, 3 α 1, 6 c 0, 3 v 2, 2 β 1, 1 Richard G. Clegg (richard@richardclegg.org) November 2016 Available online
More information57:022 Principles of Design II Final Exam Solutions - Spring 1997
57:022 Principles of Design II Final Exam Solutions - Spring 1997 Part: I II III IV V VI Total Possible Pts: 52 10 12 16 13 12 115 PART ONE Indicate "+" if True and "o" if False: + a. If a component's
More informationSOLUTIONS IEOR 3106: Second Midterm Exam, Chapters 5-6, November 8, 2012
SOLUTIONS IEOR 3106: Second Midterm Exam, Chapters 5-6, November 8, 2012 This exam is closed book. YOU NEED TO SHOW YOUR WORK. Honor Code: Students are expected to behave honorably, following the accepted
More informationThe exponential distribution and the Poisson process
The exponential distribution and the Poisson process 1-1 Exponential Distribution: Basic Facts PDF f(t) = { λe λt, t 0 0, t < 0 CDF Pr{T t) = 0 t λe λu du = 1 e λt (t 0) Mean E[T] = 1 λ Variance Var[T]
More informationChapter 3: Markov Processes First hitting times
Chapter 3: Markov Processes First hitting times L. Breuer University of Kent, UK November 3, 2010 Example: M/M/c/c queue Arrivals: Poisson process with rate λ > 0 Example: M/M/c/c queue Arrivals: Poisson
More informationLecture 20. Poisson Processes. Text: A Course in Probability by Weiss STAT 225 Introduction to Probability Models March 26, 2014
Lecture 20 Text: A Course in Probability by Weiss 12.1 STAT 225 Introduction to Probability Models March 26, 2014 Whitney Huang Purdue University 20.1 Agenda 1 2 20.2 For a specified event that occurs
More informationMATHEMATICAL PROBLEM SOLVING, MECHANICS AND MODELLING MTHA4004Y
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2014 2015 MATHEMATICAL PROBLEM SOLVING, MECHANICS AND MODELLING MTHA4004Y Time allowed: 2 Hours Attempt QUESTIONS 1 AND 2 and
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.262 Discrete Stochastic Processes Midterm Quiz April 6, 2010 There are 5 questions, each with several parts.
More informationModule Contact: Dr Steven Hayward, CMP Copyright of the University of East Anglia Version 1
UNIVERSITY OF EAST ANGLIA School of Computing Sciences Main Series UG Examination 2016-17 MATHEMATICS FOR COMPUTING B CMP-4005Y Time allowed: 2 hours Answer ANY SIX questions out of SEVEN. Notes are not
More informationQ = (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?
IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2005, Professor Whitt, Second Midterm Exam Chapters 5-6 in Ross, Thursday, March 31, 11:00am-1:00pm Open Book: but only the Ross
More informationAttempt THREE questions. You will not be penalised if you attempt additional questions.
UNIVERITY OF EAT ANGLIA chool of Mathematics Main eries UG Examination 07 8 MATHEMATIC FOR CIENTIT C MTHB5007B Time allowed: Hours Attempt THREE questions. You will not be penalised if you attempt additional
More informationIE 581 Introduction to Stochastic Simulation. Three pages of hand-written notes, front and back. Closed book. 120 minutes.
Three pages of hand-written notes, front and back. Closed book. 120 minutes. 1. SIMLIB. True or false. (2 points each. If you wish, write an explanation of your thinking.) (a) T F The time of the next
More informationMarkov 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
Markov Chains X(t) is a Markov Process if, for arbitrary times t 1 < t 2
More informationreversed chain is ergodic and has the same equilibrium probabilities (check that π j =
Lecture 10 Networks of queues In this lecture we shall finally get around to consider what happens when queues are part of networks (which, after all, is the topic of the course). Firstly we shall need
More informationStochastic Processes
Stochastic Processes 8.445 MIT, fall 20 Mid Term Exam Solutions October 27, 20 Your Name: Alberto De Sole Exercise Max Grade Grade 5 5 2 5 5 3 5 5 4 5 5 5 5 5 6 5 5 Total 30 30 Problem :. True / False
More informationL = λ W time average number in Line or system arrival rate W average Waiting time per customer
IEOR 4615, Lecture 3, January 27, 2015 L λ Little s Law* L = λ W time average number in Line or system arrival rate W average Waiting time per customer *J. D. C. Little, A proof of the queueing formula:
More informationExamination paper for TMA4265 Stochastic Processes
Department of Mathematical Sciences Examination paper for TMA4265 Stochastic Processes Academic contact during examination: Andrea Riebler Phone: 456 89 592 Examination date: December 14th, 2015 Examination
More informationStatistics 433 Practice Final Exam: Cover Sheet and Marking Sheet
Statistics 433 Practice Final Exam: Cover Sheet and Marking Sheet YOUR NAME INSTRUCTIONS: No notes, no calculators, and no communications devices are permitted. Please keep all materials away from your
More informationTMA4265 Stochastic processes ST2101 Stochastic simulation and modelling
Norwegian University of Science and Technology Department of Mathematical Sciences Page of 7 English Contact during examination: Øyvind Bakke Telephone: 73 9 8 26, 99 4 673 TMA426 Stochastic processes
More informationNAME : Math 20. Final Exam August 27, Prof. Pantone
NAME : Math 0 Final Exam August 7, 07 Prof. Pantone Instructions: This is a closed book exam and no notes are allowed. You are not to provide or receive help from any outside source during the exam except
More informationBe sure this exam has 9 pages including the cover. The University of British Columbia
Be sure this exam has 9 pages including the cover The University of British Columbia Sessional Exams 2011 Term 2 Mathematics 303 Introduction to Stochastic Processes Dr. D. Brydges Last Name: First Name:
More informationO June, 2010 MMT-008 : PROBABILITY AND STATISTICS
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
More informationQuiz 1 EE 549 Wednesday, Feb. 27, 2008
UNIVERSITY OF SOUTHERN CALIFORNIA, SPRING 2008 1 Quiz 1 EE 549 Wednesday, Feb. 27, 2008 INSTRUCTIONS This quiz lasts for 85 minutes. This quiz is closed book and closed notes. No Calculators or laptops
More informationMath 166: Topics in Contemporary Mathematics II
Math 166: Topics in Contemporary Mathematics II Xin Ma Texas A&M University November 26, 2017 Xin Ma (TAMU) Math 166 November 26, 2017 1 / 14 A Review A Markov process is a finite sequence of experiments
More informationDo not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2012 2013 MECHANICS AND MODELLING MTH-1C32 Time allowed: 2 Hours Attempt QUESTIONS 1 AND 2 and THREE other questions. Notes are
More informationMATHEMATICAL MODELLING, MECHANICS AND MOD- ELLING MTHA4004Y
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 MATHEMATICAL MODELLING, MECHANICS AND MOD- ELLING MTHA4004Y Time allowed: 2 Hours Attempt QUESTIONS 1 and 2, and ONE other
More informationYou are advised to spend an equal amount of time on each question.
UNIVERSITY OF EAST ANGLIA School of Chemistry Main Series UG Examination 2015 16 MATERIALS AND POLYMER CHEMISTRY CHE-5350Y Time allowed: 2 hours Answer THREE questions. You are advised to spend an equal
More informationEE 445 / 850: Final Examination
EE 445 / 850: Final Examination Date and Time: 3 Dec 0, PM Room: HLTH B6 Exam Duration: 3 hours One formula sheet permitted. - Covers chapters - 5 problems each carrying 0 marks - Must show all calculations
More informationQUEUING MODELS AND MARKOV PROCESSES
QUEUING MODELS AND MARKOV ROCESSES Queues form when customer demand for a service cannot be met immediately. They occur because of fluctuations in demand levels so that models of queuing are intrinsically
More informationModelling data networks stochastic processes and Markov chains
Modelling data networks stochastic processes and Markov chains a 1, 3 1, 2 2, 2 b 0, 3 2, 3 u 1, 3 α 1, 6 c 0, 3 v 2, 2 β 1, 1 Richard G. Clegg (richard@richardclegg.org) December 2011 Available online
More informationSTA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008
Name STA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008 There are five questions on this test. DO use calculators if you need them. And then a miracle occurs is not a valid answer. There
More informationStatistics 253/317 Introduction to Probability Models. Winter Midterm Exam Friday, Feb 8, 2013
Statistics 253/317 Introduction to Probability Models Winter 2014 - Midterm Exam Friday, Feb 8, 2013 Student Name (print): (a) Do not sit directly next to another student. (b) This is a closed-book, closed-note
More informationa b *c d Correct Answer Reply: ASQ CQE A-90 Incorrect Answer Reply: = C *(0.40) *(0.60) =
ConteSolutions 2017 OceanSpray June 7, 2017 Quality Tools Session 1 1-009 Question A process is producing material which is 40 percent defective. Four pieces are selected at random for inspection. What
More informationData analysis and stochastic modeling
Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt
More informationThe story of the film so far... Mathematics for Informatics 4a. Continuous-time Markov processes. Counting processes
The story of the film so far... Mathematics for Informatics 4a José Figueroa-O Farrill Lecture 19 28 March 2012 We have been studying stochastic processes; i.e., systems whose time evolution has an element
More informationMarkov Processes and Queues
MIT 2.853/2.854 Introduction to Manufacturing Systems Markov Processes and Queues Stanley B. Gershwin Laboratory for Manufacturing and Productivity Massachusetts Institute of Technology Markov Processes
More informationλ λ λ In-class problems
In-class problems 1. Customers arrive at a single-service facility at a Poisson rate of 40 per hour. When two or fewer customers are present, a single attendant operates the facility, and the service time
More informationAttempt ALL QUESTIONS IN SECTION A and ANY TWO QUESTIONS IN SECTION B Linear graph paper will be provided.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2013-2014 ENGINEERING PRINCIPLES AND LAWS ENG-4002Y Time allowed: 3 Hours Attempt ALL QUESTIONS IN SECTION A and ANY TWO QUESTIONS
More informationLecture Notes 7 Random Processes. Markov Processes Markov Chains. Random Processes
Lecture Notes 7 Random Processes Definition IID Processes Bernoulli Process Binomial Counting Process Interarrival Time Process Markov Processes Markov Chains Classification of States Steady State Probabilities
More informationStudent s Printed Name:
Student s Printed Name: Instructor: CUID: Section # : You are not permitted to use a calculator on any portion of this test. You are not allowed to use any textbook, notes, cell phone, laptop, PDA, smart
More informationModule Contact: Dr Xiaoming Zhai, ENV Copyright of the University of East Anglia Version 2
UNIVERSITY OF EAST ANGLIA School of Environmental Sciences Main Series UG Examination 2017-2018 OCEAN CIRCULATION ENV-5016A Time allowed: 2 hours Answer THREE questions Write each answer in a SEPARATE
More informationAttempt QUESTIONS 1 and 2, and THREE other questions. Do not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2016 17 SEMIGROUP THEORY MTHE6011A Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. Notes are not permitted
More informationYou are advised to spend an equal amount of time on each question. All questions carry an equal number of marks.
UNIVERSITY OF EAST ANGLIA School of Chemistry Main Series UG Examination 2014-15 INORGANIC CHEMISTRY CHE-2C32/5301B Time allowed: 2 hours Answer THREE questions. You are advised to spend an equal amount
More informationExam of Discrete Event Systems
Exam of Discrete Event Systems - 04.02.2016 Exercise 1 A molecule can switch among three equilibrium states, denoted by A, B and C. Feasible state transitions are from A to B, from C to A, and from B to
More informationThursday 14 June 2012 Morning
Thursday 14 June 01 Morning A GCE MATHEMATICS (MEI) 4757 Further Applications of Advanced Mathematics (FP3) QUESTION PAPER *471575061* Candidates answer on the Printed Answer Book. OCR supplied materials:
More informationLecture 4a: Continuous-Time Markov Chain Models
Lecture 4a: Continuous-Time Markov Chain Models Continuous-time Markov chains are stochastic processes whose time is continuous, t [0, ), but the random variables are discrete. Prominent examples of continuous-time
More informationRecap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks
Recap Probability, stochastic processes, Markov chains ELEC-C7210 Modeling and analysis of communication networks 1 Recap: Probability theory important distributions Discrete distributions Geometric distribution
More informationQueueing 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 "
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 " Little s Law a(t): the process that counts the number of arrivals
More informationAttempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 CRYPTOGRAPHY MTHD6025A Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt
More informationMarkov Chains Absorption Hamid R. Rabiee
Markov Chains Absorption Hamid R. Rabiee Absorbing Markov Chain An absorbing state is one in which the probability that the process remains in that state once it enters the state is (i.e., p ii = ). A
More informationAttempt QUESTIONS 1 and 2, and THREE other questions. Do not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2016 17 SEMIGROUP THEORY WITH ADVANCED TOPICS MTHE7011A Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More informationMath 416 Lecture 11. Math 416 Lecture 16 Exam 2 next time
Math 416 Lecture 11 Math 416 Lecture 16 Exam 2 next time Birth and death processes, queueing theory In arrival processes, the state only jumps up. In a birth-death process, it can either jump up or down
More informationApart from this page, you are not permitted to read the contents of this question paper until instructed to do so by an invigilator.
B. Sc. Examination by course unit 216 MTH6934: Topics in Probability & Stochastic Processes[SOLUTIONS] Duration: 2 hours Date and time: To Be Determined Apart from this page, you are not permitted to read
More informationSandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue
Sandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue Final project for ISYE 680: Queuing systems and Applications Hongtan Sun May 5, 05 Introduction As
More informationFigure 10.1: Recording when the event E occurs
10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable
More informationAnswers to selected exercises
Answers to selected exercises A First Course in Stochastic Models, Henk C. Tijms 1.1 ( ) 1.2 (a) Let waiting time if passengers already arrived,. Then,, (b) { (c) Long-run fraction for is (d) Let waiting
More informationMidterm Exam. Kasetsart University Probability & Statistics for Software and Knowledge Engineers, 2 nd semester 2006
Midterm Exam 1. This exam is intended to provide a fair measure of your understanding of the course material to date (Lectures 1 6). 2. Do not open this exam until the exam begins. Read all the instructions
More informationQuestion Points Score Total: 70
The University of British Columbia Final Examination - April 204 Mathematics 303 Dr. D. Brydges Time: 2.5 hours Last Name First Signature Student Number Special Instructions: Closed book exam, no calculators.
More informationProbability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur
Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #11 Special Distributions-II In the Bernoullian trials that
More information1 Basic concepts from probability theory
Basic concepts from probability theory This chapter is devoted to some basic concepts from probability theory.. Random variable Random variables are denoted by capitals, X, Y, etc. The expected value or
More informationExponential Distribution and Poisson Process
Exponential Distribution and Poisson Process Stochastic Processes - Lecture Notes Fatih Cavdur to accompany Introduction to Probability Models by Sheldon M. Ross Fall 215 Outline Introduction Exponential
More informationCIVL Continuous Distributions
CIVL 3103 Continuous Distributions Learning Objectives - Continuous Distributions Define continuous distributions, and identify common distributions applicable to engineering problems. Identify the appropriate
More informationSTAT 516 Midterm Exam 2 Friday, March 7, 2008
STAT 516 Midterm Exam 2 Friday, March 7, 2008 Name Purdue student ID (10 digits) 1. The testing booklet contains 8 questions. 2. Permitted Texas Instruments calculators: BA-35 BA II Plus BA II Plus Professional
More informationLecture 8 : The Geometric Distribution
0/ 24 The geometric distribution is a special case of negative binomial, it is the case r = 1. It is so important we give it special treatment. Motivating example Suppose a couple decides to have children
More informationContinuous Time Processes
page 102 Chapter 7 Continuous Time Processes 7.1 Introduction In a continuous time stochastic process (with discrete state space), a change of state can occur at any time instant. The associated point
More informationClass 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.
Service Engineering Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. G/G/1 Queue: Virtual Waiting Time (Unfinished Work). GI/GI/1: Lindley s Equations
More informationAttempt ALL QUESTIONS IN SECTION A and ANY TWO QUESTIONS IN SECTION B Linear graph paper will be provided.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2016-2017 ENGINEERING PRINCIPLES AND LAWS ENG-4002Y Time allowed: 3 Hours Attempt ALL QUESTIONS IN SECTION A and ANY TWO QUESTIONS
More informationRenewal theory and its applications
Renewal theory and its applications Stella Kapodistria and Jacques Resing September 11th, 212 ISP Definition of a Renewal process Renewal theory and its applications If we substitute the Exponentially
More informationEleventh Problem Assignment
EECS April, 27 PROBLEM (2 points) The outcomes of successive flips of a particular coin are dependent and are found to be described fully by the conditional probabilities P(H n+ H n ) = P(T n+ T n ) =
More informationContinuous time Markov chains
Continuous time Markov chains Alejandro Ribeiro Dept. of Electrical and Systems Engineering University of Pennsylvania aribeiro@seas.upenn.edu http://www.seas.upenn.edu/users/~aribeiro/ October 16, 2017
More informationDo not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2014 15 FLUID DYNAMICS - THEORY AND COMPUTATION MTHA5002Y Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More informationChapter 2 SOME ANALYTICAL TOOLS USED IN THE THESIS
Chapter 2 SOME ANALYTICAL TOOLS USED IN THE THESIS 63 2.1 Introduction In this chapter we describe the analytical tools used in this thesis. They are Markov Decision Processes(MDP), Markov Renewal process
More informationSession-Based Queueing Systems
Session-Based Queueing Systems Modelling, Simulation, and Approximation Jeroen Horters Supervisor VU: Sandjai Bhulai Executive Summary Companies often offer services that require multiple steps on the
More informationMarkov Processes Cont d. Kolmogorov Differential Equations
Markov Processes Cont d Kolmogorov Differential Equations The Kolmogorov Differential Equations characterize the transition functions {P ij (t)} of a Markov process. The time-dependent behavior of the
More information1 if the i-th toss is a Head (with probability p) ξ i = 0 if the i-th toss is a Tail (with probability 1 p)
6 Chapter 3. Markov Chain: Introduction Whatever happened in the past, be it glory or misery, be Markov! 3.1. Examples Example 3.1. (Coin Tossing.) Let ξ 0 0 and, for i 1, 1 if the i-th toss is a Head
More informationStochastic Analysis of a Two-Unit Cold Standby System with Arbitrary Distributions for Life, Repair and Waiting Times
International Journal of Performability Engineering Vol. 11, No. 3, May 2015, pp. 293-299. RAMS Consultants Printed in India Stochastic Analysis of a Two-Unit Cold Standby System with Arbitrary Distributions
More informationAttempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 CALCULUS AND MULTIVARIABLE CALCULUS MTHA4005Y Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More informationNon Markovian Queues (contd.)
MODULE 7: RENEWAL PROCESSES 29 Lecture 5 Non Markovian Queues (contd) For the case where the service time is constant, V ar(b) = 0, then the P-K formula for M/D/ queue reduces to L s = ρ + ρ 2 2( ρ) where
More informationFLUID DYNAMICS, THEORY AND COMPUTATION MTHA5002Y
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 FLUID DYNAMICS, THEORY AND COMPUTATION MTHA5002Y Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More informationAttempt ALL QUESTIONS IN SECTION A and ANY TWO QUESTIONS IN SECTION B Graph paper will be provided.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017-2018 ENGINEERING PRINCIPLES AND LAWS ENG-4002Y Time allowed: 3 Hours Attempt ALL QUESTIONS IN SECTION A and ANY TWO QUESTIONS
More informationANALYSIS FOR A PARALLEL REPAIRABLE SYSTEM WITH DIFFERENT FAILURE MODES
Journal of Reliability and Statistical Studies; ISSN (Print): 0974-8024, (Online):2229-5666, Vol. 5, Issue 1 (2012): 95-106 ANALYSIS FOR A PARALLEL REPAIRABLE SYSTEM WITH DIFFERENT FAILURE MODES M. A.
More informationContinuous-time Markov Chains
Continuous-time Markov Chains Gonzalo Mateos Dept. of ECE and Goergen Institute for Data Science University of Rochester gmateosb@ece.rochester.edu http://www.ece.rochester.edu/~gmateosb/ October 23, 2017
More informationIntroduction to Queueing Theory with Applications to Air Transportation Systems
Introduction to Queueing Theory with Applications to Air Transportation Systems John Shortle George Mason University February 28, 2018 Outline Why stochastic models matter M/M/1 queue Little s law Priority
More informationThursday 12 June 2014 Afternoon
Thursday June 4 Afternoon AS GCE MATHEMATICS (MEI) 476/ Mechanics QUESTION PAPER * 3 3 4 7 4 7 9 8 * Candidates answer on the Printed Answer Book. OCR supplied materials: Printed Answer Book 476/ MEI Examination
More informationThe Transition Probability Function P ij (t)
The Transition Probability Function P ij (t) Consider a continuous time Markov chain {X(t), t 0}. We are interested in the probability that in t time units the process will be in state j, given that it
More informationCandidates must show on each answer book the type of calculator used. Only calculators permitted under UEA Regulations may be used.
UNIVERSITY OF EAST ANGLIA School of Mathematics May/June UG Examination 2010 2011 CRYPTOGRAPHY Time allowed: 2 hours Attempt THREE questions. Candidates must show on each answer book the type of calculator
More informationNANYANG TECHNOLOGICAL UNIVERSITY SEMESTER I EXAMINATION MH4702/MAS446/MTH437 Probabilistic Methods in OR
NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER I EXAMINATION 2013-201 MH702/MAS6/MTH37 Probabilistic Methods in OR December 2013 TIME ALLOWED: 2 HOURS INSTRUCTIONS TO CANDIDATES 1. This examination paper contains
More informationIntroduction to Queuing Networks Solutions to Problem Sheet 3
Introduction to Queuing Networks Solutions to Problem Sheet 3 1. (a) The state space is the whole numbers {, 1, 2,...}. The transition rates are q i,i+1 λ for all i and q i, for all i 1 since, when a bus
More information1 Some basic renewal theory: The Renewal Reward Theorem
Copyright c 27 by Karl Sigman Some basic renewal theory: The Renewal Reward Theorem Here, we will present some basic results in renewal theory such as the elementary renewal theorem, and then the very
More informationTMA 4265 Stochastic Processes
TMA 4265 Stochastic Processes Norges teknisk-naturvitenskapelige universitet Institutt for matematiske fag Solution - Exercise 9 Exercises from the text book 5.29 Kidney transplant T A exp( A ) T B exp(
More information