Answer:
The answer is below
Explanation:
Given that:
Frame transmission time (X) = 40 ms
Requests = 50 requests/sec, Therefore the arrival rate for frame (G) = 50 request * 40 ms = 2 request
a) Probability that there is success on the first attempt = 
but k = 0, therefore Probability that there is success on the first attempt = 
b) probability of exactly k collisions and then a success = P(collisions in k attempts) × P(success in k+1 attempt)
P(collisions in k attempts) = [1-Probability that there is success on the first attempt]^k = ![[1-e^{-G}]^k=[1-0.135]^k=0.865^k](https://tex.z-dn.net/?f=%5B1-e%5E%7B-G%7D%5D%5Ek%3D%5B1-0.135%5D%5Ek%3D0.865%5Ek)
P(success in k+1 attempt) =
Probability of exactly k collisions and then a success = 
c) Expected number of transmission attempts needed = probability of success in k transmission = 
This is the answer hope it helps :D
Answer:
The buffer has room for 499 characters (you always have to reserve 1 for the terminating \0 character).
The code copies all characters passed in the commandline (argv[1]) into this buffer without checking. If there are more than 499 characters supplied, these will be copied into a memory location that is not intended for it. This will probably cause your program to crash, but if the extra data is somehow executed by the processor as if it were a program, this could be a way to sneak a virus into your computer.
So, while copying data, it is important to always limit the maximum amount to the allocated space.
