Answer:
d. Merge sort
Explanation:
Merge sort is example of an efficient sorting alogrithm. The Divide and conquer rule is used in this technique. This method breakdown the list into multiple sublists and each sublist contains a single element. This technique merged in the form of sorted lists. This technique uses external memory of the system while sorting.
Merge sort is used to sort the 10,000 items using only 1,000 slots available in the RAM.
Answer:
Solutions: to have a non-related to the company account and a back-up system.
Explanation:
My proposal is to move all the information of the bussiness to the cloud for better use of the data.
This data contains confidential health and finantial information and, in order to avoid any information non-wanted exit, the account has to be completing separated from the bussiness name (more accounts), by this way, it will be harder for extserns to get in it and substract the confidential information.
Also, the account must have a series of security blocks to make it harder to enter.
Finally, in case a virus gets in it and deletes any information, the data must have a backup system that will provide all the needed information in case it goes missing.
A, I think.....
Explanation:
Let us consider a, b, c, d, e, f the six numbers.
If the average of 6 numbers is 19 then
(a + b + c + d + e + f)/6 = 19
=> a + b + c + d + e + f = 114 (1)
And if the average of 5 numbers is 20 then
(a + b + c + d + e)/5 = 20
=> a + b + c + d + e = 100 (2)
We will replace (2) in (1) And it will result that
100 + f = 114 => f=114, the sixth number.
Answer is
1.3 Gbps
When using wave 1 devices, the physical rate or the maximum
theoretical throughput is 1.3 Gbps. Wave 1 products have been used for about
two and a half years now. It has however been overtaken by wave 2 devices which builds upon
Wave 1 and supports speeds of up to 2.34 Gbps
up from 1.3 Gbps in the 5 Ghz band.
