← Back to companies
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/$
Consider a biased one-dimensional random walk on the non-negative integers that starts at position 1. At every step the walker moves one unit to the left with probability p (with 0.5 < p < 1) and one unit to the right with probability q = 1 – p. The walk terminates as soon as the walker reaches position 0. Compute the expected number of steps until the walk terminates.