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.
1. D, all of the above counts as communication
2. C, Domain Name Server translates domains into IP addresses
3. B, MAC addresses are physicall addresses of network interfaces
1. 3 times the light voltage, ie., 3*0.5 = 1.5V
2. Total R = 3*25 = 75Ω, V=1.5V, I = V/R = 1.5/75 = 20 mA
3. A 1.5V battery (e.g., an AA battery) with a charge of at least 20mAh. AA batteries should be able to handle this easily.
