Let's suppose that we place an absorbing barrier at integer positions y = y < 0...

Transcribed Image Text:

Let's suppose that we place an absorbing barrier at integer positions y = y₁ < 0 and at y = yh> 0 below and above the starting position y = 0 respectively. An N-step walk starts at position 0 and continues until either completing N steps or hitting one of the two absorbing barriers, and then the walk ends. Write a function random_walk_with_barriers that returns a list (or numpy array) of values (positions) that the walk visits. The first value is 0 and the last value is an integer in the range [yı, yh] – it is yɩ or yn if the walk gets absorbed, or strictly between the two if N steps are taken without absorption. random_walk_with_barriers (N, yl, yh) You can assume that the walk continues for no more than N steps. If the walk gets absorbed, the list that gets returned contains at most N + 1 values; if the walk doesn't get absorbed the returned list contains exactly N + 1 values. Here is a transcript where the lower absorbing barrier is placed at y₁ = -3 and the upper absorbing barrier at y = 3. for in range (8): print (random_walk_with_barriers (8, -3, 3)) [ 0 -1 0 1 [ 0 -1 -2 -3] [ 0 -1 -2 -1 [ 0 -1 0 1 [0 1 2 1 2 3] [ 0 -1 -2 -1 [0 1 2 [0 1 1 0 1 0 -1 -2 -3] 0 -1 -2 -3] 2 1 0 -1 -2] 1 2 1 0] 0] 0] 0 0 -1 -2 -1 2 1 0 -1 Let's suppose that we place an absorbing barrier at integer positions y = y₁ < 0 and at y = yh> 0 below and above the starting position y = 0 respectively. An N-step walk starts at position 0 and continues until either completing N steps or hitting one of the two absorbing barriers, and then the walk ends. Write a function random_walk_with_barriers that returns a list (or numpy array) of values (positions) that the walk visits. The first value is 0 and the last value is an integer in the range [yı, yh] – it is yɩ or yn if the walk gets absorbed, or strictly between the two if N steps are taken without absorption. random_walk_with_barriers (N, yl, yh) You can assume that the walk continues for no more than N steps. If the walk gets absorbed, the list that gets returned contains at most N + 1 values; if the walk doesn't get absorbed the returned list contains exactly N + 1 values. Here is a transcript where the lower absorbing barrier is placed at y₁ = -3 and the upper absorbing barrier at y = 3. for in range (8): print (random_walk_with_barriers (8, -3, 3)) [ 0 -1 0 1 [ 0 -1 -2 -3] [ 0 -1 -2 -1 [ 0 -1 0 1 [0 1 2 1 2 3] [ 0 -1 -2 -1 [0 1 2 [0 1 1 0 1 0 -1 -2 -3] 0 -1 -2 -3] 2 1 0 -1 -2] 1 2 1 0] 0] 0] 0 0 -1 -2 -1 2 1 0 -1

Answer rating: 100% (QA)

It seems that youve provided an image that describes a programming exerc... View the full answer