Statistics 433 Practice Final Exam: Cover Sheet and Marking Sheet

Size: px
Start display at page:

Download "Statistics 433 Practice Final Exam: Cover Sheet and Marking Sheet"

Transcription

1 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 desk. You if you need scratch paper use the back of the pages on the test. You should not have any blue books or stray papers near your desk. There are two blank pages at the end of this test that you can use as scratch paper. You should be attentive to clear presentation of your answers. You are encouraged to write as neatly as you can. You are also encouraged to use any extra time you have to check your work for accidental mistakes. The problems have equal weight, but, within a given problem, the parts typically have unequal weights. There may be some simple sort answer parts, and another parts may require a more substantial calculation. The parts receive weight based on the relative effort required for the part. You are expected to adhere strictly to the Academic Code of Ethics of the University of Pennsylvania. Leave the table below BLANK. Be sure to Print and Sign your name above. Problem Number Points Total

2 2 Problem 1. Consider a discrete time Markov chain {X n : n = 0, 1,...} with the state space S = {1, 2, 3, 4} and the transition matrix 1/4 1/4 1/4 1/4 p = 1/3 1/3 1/3 0 1/2 1/ For the first four parts, just circle True or False. Answer the other two parts in the space below. (1) This chain is irreducible. True or False? (2) This chain is aperiodic. True or False? (3) This chain is doubly stochastic. True or False? (4) This chain has an absorbing state. True or False? (5) Calculate P (X 3 = 1 X 0 = 4). (6) Let (π 1, π 2, π 3, π 4 ) be the stationary distribution of this chain. Give a clear and complete explanation why one has π 1 > π 2 > π 3 > π 4. Note: It would not be a good use of your time to compute the stationary distribution. This problem requires very little calculation.

3 3 Problem 2. Let N t, t 0 be a Poisson process with parameter λ > 0. (1) What is P (N t = 1)? (2) What is E[N t ]? (3) What is Var[N t ]? (4) What is the limiting value of t 1 P (N t 2) as t decreases to zero. (5) Calculate the value of E[N t (N t 1)] by any method you like.

4 4 Problem 3. Consider a continuous time Markov chain X t with state space 1, 2, 3 and with Q matrix given by Q = (1) If at time t 0 you are in state 1, what is the expect amount of time that you will remain there? (2) What is the stationary distribution of this continuous time chain? Justify your answer with a calculation. (3) What is the limiting value of P (X t = 1 X 0 = 1)?

5 5 Problem 4. Consider an M/M/ queueing system with arrival rate λ > 0 and service rate µ > 0. Let X t, t 0, be the number of people in the system at time t and assume X 0 = 0. (1) Suppose that λ > µ. What is the value of P (X t = k) as t? (2) Suppose that λ < µ. What is the value of P (X t = k) as t? (3) Suppose that there are 5 people in service at time t = 8, so X 8 = 5. If λ = 2 and µ = 3 what is the expected time until the number of people in service changes, i.e. goes up or goes down.

6 6 Problem 5. A European internet gaming site sometimes makes a lot of money and sometimes makes a REAL lot of money. Let s call these two states 1 and 2. Suppose that when the site is in state 1 the site makes A dollars per hour and when in state 2 it makes B dollars per hour (where A < B). If X t is the state of the site at time t we suppose that X t is a continuous time Markov chain with Q matrix given by Q = ( ) (1) Calculate the stationary distribution of this chain using the appropriate equation of stationarity. (2) What is your best estimate of the amount of money that the site makes over the time period [0, T ] for large values of T. Give your answer in terms of A and B. (3) Let p t (x, y) be the probability of being in state y at time t given that you are in state x at time zero. What is the limit of p t (1, 1) as t goes to infinity?

7 7 Problem 6. Consider a Markov chain with state space S = {0, 1, 2,...} and with transitions given by p(i, i + 1) = p for all i 0, p(i, i 1) = q for all i 1, and p(0, 0) = q. (1) If p > 1/2 is this chain transient, positive recurrent, or null recurrent? (2) If p < 1/2 is this chain transient, positive recurrent, or null recurrent? (3) If p = 1/2 is this chain transient, positive recurrent, or null recurrent? (4) Take p = 1/3. Either find the stationary probability distribution if it exists, or prove that one does not have a stationary probability distribution in this case.

8 8 Problem 7. You observe the outcomes of a sequence of flips of a fair coin. (1) If τ is the first time that you observe the pattern H, H, T, H what is the expected value of τ. (2) If τ is the first time that you observe the pattern H, T, H, H what is the expected value of τ. (3) Is the minimum of τ and τ a stopping time? Why, or why not? (4) Is the product of τ and τ a stopping time? Why or why not? (5) Is the difference τ τ a stopping time? Why or why not?

9 9 Problem 8.[Corrected 5/1/2017] There are two students Alice and Bob working at a fund raising car wash. Alice attracts passing cars at the rate of 3 per hour and she completes a car at a rate of 4 per hour. Bob does not do so well. He attracts cars a the rate of 2 per hour and completes a car at the rate of 3 per hour. They do their work and maintain their queues independently. (1) In the long run, what is the probability that Alice is working? (2) In the long run, what is the probability that Bob and Alice are both working at the same time? (3) In the long run, what is the expected number of cars waiting in Bob s queue?

10 10 THIS PAGE IS INTENTIONALLY LEFT BLANK

11 THIS PAGE IS INTENTIONALLY LEFT BLANK 11

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

Statistics 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 information

Stochastic Processes

Stochastic 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 information

NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER I EXAMINATION MH4702/MAS446/MTH437 Probabilistic Methods in OR

NANYANG 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 information

STA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008

STA 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 information

1 Gambler s Ruin Problem

1 Gambler s Ruin Problem Coyright c 2017 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins

More information

Answers to selected exercises

Answers 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 information

Midterm Exam 2 (Solutions)

Midterm Exam 2 (Solutions) EECS 6 Probability and Random Processes University of California, Berkeley: Spring 07 Kannan Ramchandran March, 07 Midterm Exam (Solutions) Last name First name SID Name of student on your left: Name of

More information

Math 51 Midterm 1 July 6, 2016

Math 51 Midterm 1 July 6, 2016 Math 51 Midterm 1 July 6, 2016 Name: SUID#: Circle your section: Section 01 Section 02 (1:30-2:50PM) (3:00-4:20PM) Complete the following problems. In order to receive full credit, please show all of your

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science

MASSACHUSETTS 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 information

EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2017 Kannan Ramchandran March 21, 2017.

EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2017 Kannan Ramchandran March 21, 2017. EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2017 Kannan Ramchandran March 21, 2017 Midterm Exam 2 Last name First name SID Name of student on your left: Name of

More information

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

M.Sc.(Mathematics with Applications in Computer Science) Probability and Statistics MMT-008 Assignment Booklet M.Sc.(Mathematics with Applications in Computer Science) Probability and Statistics (Valid from 1 st July, 013 to 31 st May, 014) It is compulsory to submit the assignment before

More information

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

Statistics 253/317 Introduction to Probability Models. Winter Midterm Exam Monday, Feb 10, 2014 Statistics 253/317 Introduction to Probability Models Winter 2014 - Midterm Exam Monday, Feb 10, 2014 Student Name (print): (a) Do not sit directly next to another student. (b) This is a closed-book, closed-note

More information

IE 5112 Final Exam 2010

IE 5112 Final Exam 2010 IE 5112 Final Exam 2010 1. There are six cities in Kilroy County. The county must decide where to build fire stations. The county wants to build as few fire stations as possible while ensuring that there

More information

Economics 345: Applied Econometrics Section A01 University of Victoria Midterm Examination #2 Version 2 Fall 2016 Instructor: Martin Farnham

Economics 345: Applied Econometrics Section A01 University of Victoria Midterm Examination #2 Version 2 Fall 2016 Instructor: Martin Farnham Economics 345: Applied Econometrics Section A01 University of Victoria Midterm Examination #2 Version 2 Fall 2016 Instructor: Martin Farnham Last name (family name): First name (given name): Student ID

More information

This exam contains 13 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam.

This exam contains 13 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam. Probability and Statistics FS 2017 Session Exam 22.08.2017 Time Limit: 180 Minutes Name: Student ID: This exam contains 13 pages (including this cover page) and 10 questions. A Formulae sheet is provided

More information

NAME : Math 20. Final Exam August 27, Prof. Pantone

NAME : 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 information

Spring 2017 Exam 2 NAME: PIN:

Spring 2017 Exam 2 NAME: PIN: MARK BOX problem points 0 10 HAND IN PART 1 10 2 10 3-10 40=8x5 11 10 12 10 NAME: PIN: 13 10 % 100 INSTRUCTIONS This exam comes in two parts. (1) HAND-IN PART. Hand-in only this part. (2) NOT TO HAND-IN

More information

Introduction to Stochastic Processes

Introduction to Stochastic Processes 18.445 Introduction to Stochastic Processes Lecture 1: Introduction to finite Markov chains Hao Wu MIT 04 February 2015 Hao Wu (MIT) 18.445 04 February 2015 1 / 15 Course description About this course

More information

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

EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran November 13, 2014. EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran November 13, 2014 Midterm Exam 2 Last name First name SID Rules. DO NOT open the exam until instructed

More information

MARKOV PROCESSES. Valerio Di Valerio

MARKOV PROCESSES. Valerio Di Valerio MARKOV PROCESSES Valerio Di Valerio Stochastic Process Definition: a stochastic process is a collection of random variables {X(t)} indexed by time t T Each X(t) X is a random variable that satisfy some

More information

Quiz 1 Date: Monday, October 17, 2016

Quiz 1 Date: Monday, October 17, 2016 10-704 Information Processing and Learning Fall 016 Quiz 1 Date: Monday, October 17, 016 Name: Andrew ID: Department: Guidelines: 1. PLEASE DO NOT TURN THIS PAGE UNTIL INSTRUCTED.. Write your name, Andrew

More information

(Practice Version) Midterm Exam 2

(Practice Version) Midterm Exam 2 EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran November 7, 2014 (Practice Version) Midterm Exam 2 Last name First name SID Rules. DO NOT open

More information

T. Liggett Mathematics 171 Final Exam June 8, 2011

T. Liggett Mathematics 171 Final Exam June 8, 2011 T. Liggett Mathematics 171 Final Exam June 8, 2011 1. The continuous time renewal chain X t has state space S = {0, 1, 2,...} and transition rates (i.e., Q matrix) given by q(n, n 1) = δ n and q(0, n)

More information

Discrete Event Systems Exam

Discrete Event Systems Exam Computer Engineering and Networks Laboratory TEC, NSG, DISCO HS 2016 Prof. L. Thiele, Prof. L. Vanbever, Prof. R. Wattenhofer Discrete Event Systems Exam Friday, 3 rd February 2017, 14:00 16:00. Do not

More information

STAT 516 Midterm Exam 2 Friday, March 7, 2008

STAT 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 information

Homework set 2 - Solutions

Homework set 2 - Solutions Homework set 2 - Solutions Math 495 Renato Feres Simulating a Markov chain in R Generating sample sequences of a finite state Markov chain. The following is a simple program for generating sample sequences

More information

Examples of Countable State Markov Chains Thursday, October 16, :12 PM

Examples of Countable State Markov Chains Thursday, October 16, :12 PM stochnotes101608 Page 1 Examples of Countable State Markov Chains Thursday, October 16, 2008 12:12 PM Homework 2 solutions will be posted later today. A couple of quick examples. Queueing model (without

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science

MASSACHUSETTS 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 information

Be 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 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 information

ECE-517: Reinforcement Learning in Artificial Intelligence. Lecture 4: Discrete-Time Markov Chains

ECE-517: Reinforcement Learning in Artificial Intelligence. Lecture 4: Discrete-Time Markov Chains ECE-517: Reinforcement Learning in Artificial Intelligence Lecture 4: Discrete-Time Markov Chains September 1, 215 Dr. Itamar Arel College of Engineering Department of Electrical Engineering & Computer

More information

Question Points Score Total: 70

Question 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 information

Random Walk on a Graph

Random Walk on a Graph IOR 67: Stochastic Models I Second Midterm xam, hapters 3 & 4, November 2, 200 SOLUTIONS Justify your answers; show your work.. Random Walk on a raph (25 points) Random Walk on a raph 2 5 F B 3 3 2 Figure

More information

Recap. 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 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 information

Quantitative Evaluation of Emedded Systems Solution 2: Discrete Time Markov Chains (DTMC)

Quantitative Evaluation of Emedded Systems Solution 2: Discrete Time Markov Chains (DTMC) Quantitative Evaluation of Emedded Systems Solution 2: Discrete Time Markov Chains (DTMC) 2.1 Classification of DTMC states Prof. Dr. Anne Remke Design and Analysis of Communication Systems University

More information

Spring 2018 Exam 2 MARK BOX HAND IN PART NAME: PIN: INSTRUCTIONS

Spring 2018 Exam 2 MARK BOX HAND IN PART NAME: PIN: INSTRUCTIONS Spring 208 Exam 2 problem MARK BOX points HAND IN PART 0 0 4 2-5 56=4x4 6 0 7 0 NAME: PIN: % 00 INSTRUCTIONS This exam comes in two parts () HAND IN PART Hand in only this part (2) STATEMENT OF MULTIPLE

More information

ISyE 6650 Probabilistic Models Fall 2007

ISyE 6650 Probabilistic Models Fall 2007 ISyE 6650 Probabilistic Models Fall 2007 Homework 4 Solution 1. (Ross 4.3) In this case, the state of the system is determined by the weather conditions in the last three days. Letting D indicate a dry

More information

Math 104 Section 2 Midterm 2 November 1, 2013

Math 104 Section 2 Midterm 2 November 1, 2013 Math 104 Section 2 Midterm 2 November 1, 2013 Name: Complete the following problems. In order to receive full credit, please provide rigorous proofs and show all of your work and justify your answers.

More information

STOCHASTIC PROCESSES Basic notions

STOCHASTIC PROCESSES Basic notions J. Virtamo 38.3143 Queueing Theory / Stochastic processes 1 STOCHASTIC PROCESSES Basic notions Often the systems we consider evolve in time and we are interested in their dynamic behaviour, usually involving

More information

At the boundary states, we take the same rules except we forbid leaving the state space, so,.

At the boundary states, we take the same rules except we forbid leaving the state space, so,. Birth-death chains Monday, October 19, 2015 2:22 PM Example: Birth-Death Chain State space From any state we allow the following transitions: with probability (birth) with probability (death) with probability

More information

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

57: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 information

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

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 Irreducibility Irreducible every state can be reached from every other state For any i,j, exist an m 0, such that i,j are communicate, if the above condition is valid Irreducible: all states are communicate

More information

Interlude: Practice Final

Interlude: Practice Final 8 POISSON PROCESS 08 Interlude: Practice Final This practice exam covers the material from the chapters 9 through 8. Give yourself 0 minutes to solve the six problems, which you may assume have equal point

More information

Readings: Finish Section 5.2

Readings: Finish Section 5.2 LECTURE 19 Readings: Finish Section 5.2 Lecture outline Markov Processes I Checkout counter example. Markov process: definition. -step transition probabilities. Classification of states. Example: Checkout

More information

88 CONTINUOUS MARKOV CHAINS

88 CONTINUOUS MARKOV CHAINS 88 CONTINUOUS MARKOV CHAINS 3.4. birth-death. Continuous birth-death Markov chains are very similar to countable Markov chains. One new concept is explosion which means that an infinite number of state

More information

Chapter 11 Advanced Topic Stochastic Processes

Chapter 11 Advanced Topic Stochastic Processes Chapter 11 Advanced Topic Stochastic Processes CHAPTER OUTLINE Section 1 Simple Random Walk Section 2 Markov Chains Section 3 Markov Chain Monte Carlo Section 4 Martingales Section 5 Brownian Motion Section

More information

Introduction to queuing theory

Introduction to queuing theory Introduction to queuing theory Queu(e)ing theory Queu(e)ing theory is the branch of mathematics devoted to how objects (packets in a network, people in a bank, processes in a CPU etc etc) join and leave

More information

Problem Point Value Points

Problem Point Value Points Math 70 TUFTS UNIVERSITY October 12, 2015 Linear Algebra Department of Mathematics Sections 1 and 2 Exam I Instructions: No notes or books are allowed. All calculators, cell phones, or other electronic

More information

Spring 2018 Exam 1 MARK BOX HAND IN PART NAME: PIN:

Spring 2018 Exam 1 MARK BOX HAND IN PART NAME: PIN: problem MARK BOX points HAND IN PART - 65=x5 4 5 5 6 NAME: PIN: % INSTRUCTIONS This exam comes in two parts. () HAND IN PART. Hand in only this part. () STATEMENT OF MULTIPLE CHOICE PROBLEMS. Do not hand

More information

CS 361 Sample Midterm 2

CS 361 Sample Midterm 2 CS 361 Sample Midterm 2 NAME: NETID: CIRCLE YOUR DISCUSSION: Thu 2-3 Thu 4-5 Fri 10-11 Fri 11-12 Be sure that your exam booklet has 6 pages including this cover page Make sure to write your name exactly

More information

The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.

The exam is closed book, closed calculator, and closed notes except your one-page crib sheet. CS 188 Fall 2018 Introduction to Artificial Intelligence Practice Final You have approximately 2 hours 50 minutes. The exam is closed book, closed calculator, and closed notes except your one-page crib

More information

Fall 2017 Exam 1 MARK BOX HAND IN PART NAME: PIN:

Fall 2017 Exam 1 MARK BOX HAND IN PART NAME: PIN: problem MARK BOX points HAND IN PART 0 30 1-10 50=10x5 11 10 1 10 NAME: PIN: % 100 INSTRUCTIONS This exam comes in two parts. (1) HAND IN PART. Hand in only this part. () STATEMENT OF MULTIPLE CHOICE PROBLEMS.

More information

Released Assessment Questions, 2016 QUESTIONS. Grade 9 Assessment of Mathematics Academic LARGE PRINT

Released Assessment Questions, 2016 QUESTIONS. Grade 9 Assessment of Mathematics Academic LARGE PRINT Released Assessment Questions, 016 QUESTIONS Grade 9 Assessment of Mathematics Academic LARGE PRINT page Read the instructions below. Along with this booklet, make sure you have the Answer Booklet and

More information

Spring 2018 Exam 1 MARK BOX HAND IN PART PIN: 17

Spring 2018 Exam 1 MARK BOX HAND IN PART PIN: 17 problem MARK BOX points HAND IN PART -3 653x5 5 NAME: Solutions 5 6 PIN: 7 % INSTRUCTIONS This exam comes in two parts. () HAND IN PART. Hand in only this part. () STATEMENT OF MULTIPLE CHOICE PROBLEMS.

More information

Fall 2018 Exam 1 NAME:

Fall 2018 Exam 1 NAME: MARK BOX problem points 0 20 HAND IN PART -8 40=8x5 9 0 NAME: 0 0 PIN: 0 2 0 % 00 INSTRUCTIONS This exam comes in two parts. () HAND IN PART. Hand in only this part. (2) STATEMENT OF MULTIPLE CHOICE PROBLEMS.

More information

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

EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran September 23, 2014. EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran September 23, 2014 Midterm Exam 1 Last name First name SID Rules. DO NOT open the exam until instructed

More information

Multiple Choice Answers. MA 110 Precalculus Spring 2016 Exam 1 9 February Question

Multiple Choice Answers. MA 110 Precalculus Spring 2016 Exam 1 9 February Question MA 110 Precalculus Spring 2016 Exam 1 9 February 2016 Name: Section: Last 4 digits of student ID #: This exam has eleven multiple choice questions (five points each) and five free response questions (nine

More information

Statistics 150: Spring 2007

Statistics 150: Spring 2007 Statistics 150: Spring 2007 April 23, 2008 0-1 1 Limiting Probabilities If the discrete-time Markov chain with transition probabilities p ij is irreducible and positive recurrent; then the limiting probabilities

More information

Markov Processes Hamid R. Rabiee

Markov Processes Hamid R. Rabiee Markov Processes Hamid R. Rabiee Overview Markov Property Markov Chains Definition Stationary Property Paths in Markov Chains Classification of States Steady States in MCs. 2 Markov Property A discrete

More information

Problem Points S C O R E Total: 120

Problem Points S C O R E Total: 120 PSTAT 160 A Final Exam December 10, 2015 Name Student ID # Problem Points S C O R E 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 11 10 12 10 Total: 120 1. (10 points) Take a Markov chain with the

More information

Math 19 Practice Exam 2B, Winter 2011

Math 19 Practice Exam 2B, Winter 2011 Math 19 Practice Exam 2B, Winter 2011 Name: SUID#: Complete the following problems. In order to receive full credit, please show all of your work and justify your answers. You do not need to simplify your

More information

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

IE 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 information

Final exam (practice) UCLA: Math 31B, Spring 2017

Final exam (practice) UCLA: Math 31B, Spring 2017 Instructor: Noah White Date: Final exam (practice) UCLA: Math 31B, Spring 2017 This exam has 8 questions, for a total of 80 points. Please print your working and answers neatly. Write your solutions in

More information

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

MAT 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 information

Examination paper for TMA4265 Stochastic Processes

Examination 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 information

Designing Information Devices and Systems I Spring 2018 Midterm 1. Exam Location: 155 Dwinelle Last Name: Cheng - Lazich

Designing Information Devices and Systems I Spring 2018 Midterm 1. Exam Location: 155 Dwinelle Last Name: Cheng - Lazich EECS 16A Designing Information Devices and Systems I Spring 2018 Midterm 1 Exam Location: 155 Dwinelle Last Name: Cheng - Lazich PRINT your student ID: PRINT AND SIGN your name:, (last name) (first name)

More information

Lecture 2 : CS6205 Advanced Modeling and Simulation

Lecture 2 : CS6205 Advanced Modeling and Simulation Lecture 2 : CS6205 Advanced Modeling and Simulation Lee Hwee Kuan 21 Aug. 2013 For the purpose of learning stochastic simulations for the first time. We shall only consider probabilities on finite discrete

More information

Random Times and Their Properties

Random Times and Their Properties Chapter 6 Random Times and Their Properties Section 6.1 recalls the definition of a filtration (a growing collection of σ-fields) and of stopping times (basically, measurable random times). Section 6.2

More information

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

Page 0 of 5 Final Examination Name. Closed book. 120 minutes. Cover page plus five pages of exam. Final Examination Closed book. 120 minutes. Cover page plus five pages of exam. To receive full credit, show enough work to indicate your logic. Do not spend time calculating. You will receive full credit

More information

Math 41 First Exam October 12, 2010

Math 41 First Exam October 12, 2010 Math 41 First Exam October 12, 2010 Name: SUID#: Circle your section: Olena Bormashenko Ulrik Buchholtz John Jiang Michael Lipnowski Jonathan Lee 03 (11-11:50am) 07 (10-10:50am) 02 (1:15-2:05pm) 04 (1:15-2:05pm)

More information

Chapter 5. Continuous-Time Markov Chains. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan

Chapter 5. Continuous-Time Markov Chains. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Chapter 5. Continuous-Time Markov Chains Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Continuous-Time Markov Chains Consider a continuous-time stochastic process

More information

MAS275 Probability Modelling Exercises

MAS275 Probability Modelling Exercises MAS75 Probability Modelling Exercises Note: these questions are intended to be of variable difficulty. In particular: Questions or part questions labelled (*) are intended to be a bit more challenging.

More information

1 Gambler s Ruin Problem

1 Gambler s Ruin Problem 1 Gambler s Ruin Problem Consider a gambler who starts with an initial fortune of $1 and then on each successive gamble either wins $1 or loses $1 independent of the past with probabilities p and q = 1

More information

6.041/6.431 Fall 2010 Final Exam Wednesday, December 15, 9:00AM - 12:00noon.

6.041/6.431 Fall 2010 Final Exam Wednesday, December 15, 9:00AM - 12:00noon. 6.041/6.431 Fall 2010 Final Exam Wednesday, December 15, 9:00AM - 12:00noon. DO NOT TURN THIS PAGE OVER UNTIL YOU ARE TOLD TO DO SO Name: Recitation Instructor: TA: Question Score Out of 1.1 4 1.2 4 1.3

More information

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

M.Sc. (MATHEMATICS WITH APPLICATIONS IN COMPUTER SCIENCE) M.Sc. (MACS) 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

More information

MATH 56A: STOCHASTIC PROCESSES CHAPTER 1

MATH 56A: STOCHASTIC PROCESSES CHAPTER 1 MATH 56A: STOCHASTIC PROCESSES CHAPTER. Finite Markov chains For the sake of completeness of these notes I decided to write a summary of the basic concepts of finite Markov chains. The topics in this chapter

More information

Budapest University of Tecnology and Economics. AndrásVetier Q U E U I N G. January 25, Supported by. Pro Renovanda Cultura Hunariae Alapítvány

Budapest University of Tecnology and Economics. AndrásVetier Q U E U I N G. January 25, Supported by. Pro Renovanda Cultura Hunariae Alapítvány Budapest University of Tecnology and Economics AndrásVetier Q U E U I N G January 25, 2000 Supported by Pro Renovanda Cultura Hunariae Alapítvány Klebelsberg Kunó Emlékére Szakalapitvány 2000 Table of

More information

ISM206 Lecture, May 12, 2005 Markov Chain

ISM206 Lecture, May 12, 2005 Markov Chain ISM206 Lecture, May 12, 2005 Markov Chain Instructor: Kevin Ross Scribe: Pritam Roy May 26, 2005 1 Outline of topics for the 10 AM lecture The topics are: Discrete Time Markov Chain Examples Chapman-Kolmogorov

More information

DO NOT OPEN THE EXAMINATION PAPER UNTIL YOU ARE TOLD BY THE SUPERVISOR TO BEGIN. Math 9. Sample Final June Value: 50 Points Duration: 2 Hours

DO NOT OPEN THE EXAMINATION PAPER UNTIL YOU ARE TOLD BY THE SUPERVISOR TO BEGIN. Math 9. Sample Final June Value: 50 Points Duration: 2 Hours Name: Teacher: DO NOT OPEN THE EXAMINATION PAPER UNTIL YOU ARE TOLD BY THE SUPERVISOR TO BEGIN Math 9 Sample Final June 2014 Value: 50 Points Duration: 2 Hours General Instructions This examination consists

More information

MIDTERM Fundamental Algorithms, Spring 2008, Professor Yap March 10, 2008

MIDTERM Fundamental Algorithms, Spring 2008, Professor Yap March 10, 2008 INSTRUCTIONS: MIDTERM Fundamental Algorithms, Spring 2008, Professor Yap March 10, 2008 0. This is a closed book exam, with one 8 x11 (2-sided) cheat sheet. 1. Please answer ALL questions (there is ONE

More information

1 Basic continuous random variable problems

1 Basic continuous random variable problems Name M362K Final Here are problems concerning material from Chapters 5 and 6. To review the other chapters, look over previous practice sheets for the two exams, previous quizzes, previous homeworks and

More information

CS 188 Introduction to Fall 2007 Artificial Intelligence Midterm

CS 188 Introduction to Fall 2007 Artificial Intelligence Midterm NAME: SID#: Login: Sec: 1 CS 188 Introduction to Fall 2007 Artificial Intelligence Midterm You have 80 minutes. The exam is closed book, closed notes except a one-page crib sheet, basic calculators only.

More information

MA 113 Calculus I Fall 2015 Exam 3 Tuesday, 17 November Multiple Choice Answers. Question

MA 113 Calculus I Fall 2015 Exam 3 Tuesday, 17 November Multiple Choice Answers. Question MA 11 Calculus I Fall 2015 Exam Tuesday, 17 November 2015 Name: Section: Last 4 digits of student ID #: This exam has ten multiple choice questions (five points each) and five free response questions (ten

More information

CS 188 Fall Introduction to Artificial Intelligence Midterm 2

CS 188 Fall Introduction to Artificial Intelligence Midterm 2 CS 188 Fall 2013 Introduction to rtificial Intelligence Midterm 2 ˆ You have approximately 2 hours and 50 minutes. ˆ The exam is closed book, closed notes except your one-page crib sheet. ˆ Please use

More information

Statistics & Data Sciences: First Year Prelim Exam May 2018

Statistics & Data Sciences: First Year Prelim Exam May 2018 Statistics & Data Sciences: First Year Prelim Exam May 2018 Instructions: 1. Do not turn this page until instructed to do so. 2. Start each new question on a new sheet of paper. 3. This is a closed book

More information

MAT 135B Midterm 1 Solutions

MAT 135B Midterm 1 Solutions MAT 35B Midterm Solutions Last Name (PRINT): First Name (PRINT): Student ID #: Section: Instructions:. Do not open your test until you are told to begin. 2. Use a pen to print your name in the spaces above.

More information

MA 113 Calculus I Fall 2015 Exam 1 Tuesday, 22 September Multiple Choice Answers. Question

MA 113 Calculus I Fall 2015 Exam 1 Tuesday, 22 September Multiple Choice Answers. Question MA 113 Calculus I Fall 2015 Exam 1 Tuesday, 22 September 2015 Name: Section: Last 4 digits of student ID #: This exam has ten multiple choice questions (five points each) and five free response questions

More information

18.05 Final Exam. Good luck! Name. No calculators. Number of problems 16 concept questions, 16 problems, 21 pages

18.05 Final Exam. Good luck! Name. No calculators. Number of problems 16 concept questions, 16 problems, 21 pages Name No calculators. 18.05 Final Exam Number of problems 16 concept questions, 16 problems, 21 pages Extra paper If you need more space we will provide some blank paper. Indicate clearly that your solution

More information

MTH 234 Exam 1 February 20th, Without fully opening the exam, check that you have pages 1 through 11.

MTH 234 Exam 1 February 20th, Without fully opening the exam, check that you have pages 1 through 11. Name: Section: Recitation Instructor: INSTRUCTIONS Fill in your name, etc. on this first page. Without fully opening the exam, check that you have pages 1 through 11. Show all your work on the standard

More information

Credit at (circle one): UNB-Fredericton UNB-Saint John UNIVERSITY OF NEW BRUNSWICK DEPARTMENT OF MATHEMATICS & STATISTICS

Credit at (circle one): UNB-Fredericton UNB-Saint John UNIVERSITY OF NEW BRUNSWICK DEPARTMENT OF MATHEMATICS & STATISTICS Last name: First name: Middle initial(s): Date of birth: High school: Teacher: Credit at (circle one): UNB-Fredericton UNB-Saint John UNIVERSITY OF NEW BRUNSWICK DEPARTMENT OF MATHEMATICS & STATISTICS

More information

1/2 1/2 1/4 1/4 8 1/2 1/2 1/2 1/2 8 1/2 6 P =

1/2 1/2 1/4 1/4 8 1/2 1/2 1/2 1/2 8 1/2 6 P = / 7 8 / / / /4 4 5 / /4 / 8 / 6 P = 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Andrei Andreevich Markov (856 9) In Example. 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 P (n) = 0

More information

Math 113 (Calculus II) Final Exam

Math 113 (Calculus II) Final Exam Name: Student ID: Section: Instructor: Math 113 (Calculus II) Final Exam Dec 18, 7:00 p.m. Instructions: Work on scratch paper will not be graded. For questions 10 to 17, show all your work in the space

More information

Midterm 2. Your Exam Room: Name of Person Sitting on Your Left: Name of Person Sitting on Your Right: Name of Person Sitting in Front of You:

Midterm 2. Your Exam Room: Name of Person Sitting on Your Left: Name of Person Sitting on Your Right: Name of Person Sitting in Front of You: CS70 Discrete Mathematics and Probability Theory, Fall 2018 Midterm 2 8:00-10:00pm, 31 October Your First Name: SIGN Your Name: Your Last Name: Your SID Number: Your Exam Room: Name of Person Sitting on

More information

The Transition Probability Function P ij (t)

The 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 information

18.600: Lecture 39 Review: practice problems

18.600: Lecture 39 Review: practice problems 18.600: Lecture 39 Review: practice problems Scott Sheffield MIT Markov chains Alice and Bob share a home with a bathroom, a walk-in closet, and 2 towels. Markov chains Alice and Bob share a home with

More information

Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms Friday, March 18, 2016 Ankur Moitra. Problem Set 6

Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms Friday, March 18, 2016 Ankur Moitra. Problem Set 6 Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms Friday, March 18, 2016 Ankur Moitra Problem Set 6 Due: Wednesday, April 6, 2016 7 pm Dropbox Outside Stata G5 Collaboration policy:

More information

Economics 345: Applied Econometrics Section A01 University of Victoria Midterm Examination #2 Version 1 SOLUTIONS Fall 2016 Instructor: Martin Farnham

Economics 345: Applied Econometrics Section A01 University of Victoria Midterm Examination #2 Version 1 SOLUTIONS Fall 2016 Instructor: Martin Farnham Economics 345: Applied Econometrics Section A01 University of Victoria Midterm Examination #2 Version 1 SOLUTIONS Fall 2016 Instructor: Martin Farnham Last name (family name): First name (given name):

More information

Fall 2016 Exam 3 NAME: PIN:

Fall 2016 Exam 3 NAME: PIN: MARK BOX problem points 0 18 1 12 2-11 50=10(5) 12 10 13 10 % 100 NAME: PIN: HAND IN PART INSTRUCTIONS This exam comes in two parts. (1) HAND IN PART. Hand in only this part. (2) STATEMENT OF MULTIPLE

More information

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

EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY (formerly the Examinations of the Institute of Statisticians) GRADUATE DIPLOMA, 2004 EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY (formerly the Examinations of the Institute of Statisticians) GRADUATE DIPLOMA, 004 Statistical Theory and Methods I Time Allowed: Three Hours Candidates should

More information

IE 336 Seat # Name. Closed book. One page of hand-written notes, front and back. No calculator. 60 minutes.

IE 336 Seat # Name. Closed book. One page of hand-written notes, front and back. No calculator. 60 minutes. Closed book. One page of hand-written notes, front and back. No calculator. 60 minutes. Cover page and five pages of exam. Four questions. To receive full credit, show enough work to indicate your logic.

More information