Answer: Hello your question is poorly written attached below is the well written question
answer:
a) Determine ( compute ) the difference between the max and minimum value. determine the Min and max values using 1.5n comparisons
time efficiency = θ( n )
b) A(n-1) - A(0)
time efficiency = θ( 1 )
Explanation:
a) An unsorted array
To find the maximum and minimum values scan the array of elements , then determine ( compute ) the difference between the max and minimum value. to determine the range. Alternatively determine the Min and max values using 1.5n comparisons
Algorithm's time efficiency = θ( n )
b) A sorted array
To determine the range, we will determine the difference between the first and last element i.e. A(n-1) - A(0)
time efficiency = θ( 1 )
Automation. ... It involves taking a machine or software that was taught to do simple repetitive tasks (traditional automation) and teaching it to intuitively adapt or correct its performance based on changing conditions, at speed and scale.
The answer, im prettysure, is d. typeface.
hope this helps (:
Answer:
a. (210^6)((210^7)/(2.510^8)) = 1.610^5 bits or 160,000 bits
b. 1.6*10^5 bits or 160,000 bits
c. Bandwidth delay product of link is maximum number of bits that can be in the link
d. Width of bit = Length of link / bandwidth-delay product so 1 bit is 125 meters long. Yes, this is longer than a football field.
e. Width of bit = s/R
Hope this helps :)