• edited by
17,408 views
75 75 votes

In a multi-user operating system on an average, $20$ requests are made to use a particular resource per hour. The arrival of requests follows a Poisson distribution. The probability that either one, three or five requests are made in $45$ minutes is given by :

  1. $6.9 \times 10^6 \times e^{-20}$
  2. $1.02 \times 10^6 \times e^{-20}$
  3. $6.9 \times 10^3 \times e^{-20}$
  4. $1.02 \times 10^3 \times e^{-20}$

4 Answers

Best answer
73 73 votes

Answer is (B)

$20$ request in $1$ hour. So we can expect $15$ request in $45$ minutes...

So, $\lambda = 15$ (expected value)

Poisson distribution formula$: f(x, \lambda) = p(X = x) = \dfrac{e^{-\lambda}*\lambda^x}{x!}$

$\text{Prob (1  request)} + \text{Prob (3  requests)} + \text{Prob (5  requests)}$
$\quad= p(1; 15) + p(3; 15) + p(5; 15)$
$\quad= {6.9} \times 10^{3} \times e ^ {-15}$
$\quad = {6.9}\times 10^{3}\times e^{5}\times e^{-20} $
$\quad= {1.02}\times {10^6}\times e^{-20}.$  

• edited by
Answer:
Position:
Show:

Related questions

29 29 votes
5 answers 5 answers
8.8k
8.8k views
Ishrat Jahan asked Oct 29, 2014
8,817 views
Suppose there are two coins. The first coin gives heads with probability $\dfrac{5}{8}$ when tossed, while the second coin gives heads with probability $\dfrac{1}{4}.$ On...
61 61 votes
6 answers 6 answers
24.3k
24.3k views
Ishrat Jahan asked Oct 30, 2014
24,264 views
Consider a selection of the form $\sigma_{A\leq 100} (r)$, where $r$ is a relation with $1000$ tuples. Assume that the attribute values for $A$ among the tuples are unifo...
99 99 votes
6 answers 6 answers
39.0k
39.0k views
Ishrat Jahan asked Oct 30, 2014
39,009 views
A demand paging system takes $100$ time units to service a page fault and $300$ time units to replace a dirty page. Memory access time is $1$ time unit. The probability o...
106 106 votes
13 answers 13 answers
47.5k
47.5k views
Ishrat Jahan asked Oct 29, 2014
47,501 views
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collide...