# gigsforgeeks networks LAN

214 views

There are "n" stations in LAN. According to question, only one station want to transmit , in the sense among "n" stations, "n-1" should not be allowed to transmit the data  when one station is already is tranmitting the data.

In our question suppose "n" leveled station is transmitting the data with probability "p" then remaining '"n-1" should not be allowed to transmit the data at given slot.

So, np.(1-p)^ n-1.

(B)
0
(Building on what @akash.dinkar12 pointed)

it is a simple probability+PnC question, of type:

given n events E, P(E) = p and P(E') = 1-p,

Find the P(Success), where Success = exactly 1 event occurs.

Out of all stations only 1 allowed to transmit so to select  1 station out of N stations there are N ways possible (nC1 ) then
it must transmit and other n-1 stations should not transmit
therefore    n * p * (1-p)*(1-p)*.............(1-p)
= np(1-p)n-1

as u can do it with the help of  probability distribution

n is the no of station out of  which 1 sation send the data then the probability of transmitting of1 station is (p)^1

and the probabilty of transmitting "n-1" staion is (1-p)^n-1 which is unsuccess probability then u got the answer.

Event 1: Only one station should transmit

We can select one station out of 1 station in C(n,1 ) ways = n

This station has to transmit with the probability 'p'

Therefore, P(E1) = n * p

Event 2: Remaining (n-1) stations should not transmit

Then remaining (n-1) stations should not transmit.

So, for all of them probability will be (1-P)

therefore, P(E2) = (1-p)^(n-1).

Now, both the events should occur simultaneously

Hence, n * p * (1 - p )^(n-1)

## Related questions

1
4.2k views
Match the following: ... $\text{P - 1, Q - 4, R - 2, S - 5}$ $\text{P - 2, Q - 4, R - 1, S - 3}$
The distance between two stations $M$ and $N$ is $L$ kilometers. All frames are $K$ bits long. The propagation delay per kilometer is $t$ seconds. Let $R$ bits/second be the channel capacity. Assuming that the processing delay is negligible, the $\text{minimum}$ number of bits for the ... $\lceil \log_2 \frac{2LtR +K}{K} \rceil$ $\lceil \log_2 \frac{2LtR +2K}{2K} \rceil$
The message $11001001$ is to be transmitted using the CRC polynomial $x^3 +1$ to protect it from errors. The message that should be transmitted is: $11001001000$ $11001001011$ $11001010$ $110010010011$
The address of a class $B$ host is to be split into subnets with a $6$-$bit$ subnet number. What is the maximum number of subnets and the maximum number of hosts in each subnet? $62$ subnets and $262142$ hosts. $64$ subnets and $262142$ hosts. $62$ subnets and $1022$ hosts. $64$ subnets and $1024$ hosts.