Answer:
The final case in selection sort is trivially sorted.
The final iteration in insertion sort is not needed.
Explanation:
For selection sort, you make sub arrays and find the smallest element placing it in the front and repeat until sorted. This guarantees the final element will already be the greatest element, thus it is trivially sorted.
For Insertion sort, you use the initial element and compare it to the previous element and swap if the current is larger than the previous. Using this sort, you will always perform n-1 comparisons where n is the total amount of elements in the array. Thus, there are only 11 iterations for a 12 element array.
Cheers.
Simple: Keep your camera protected from the rain
Here are some tips for photographing during rainy day: 1) Use image stabilization or tripod.
2) Choose a larger aperture.
3) Change the object on which you focus.
4) Have a well-defined center of interest.
5) Review all images.
6) Use exposure compensation.
Answer: Kapilvastu was named after Vedic sage Kapilamuni
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 = 
