Answer:
Alumni Groups
Business Organizations
Explanation: i made a 100 on lesson
Answer: Provided in the explanation section
Explanation:
The question to this problem says;
Question:
I am sorting data that is stored over a network connection. Based on the properties of that connection, it is extremely expensive to "swap" two elements. But looping over the elements and looking at their values is very inexpensive. I want to minimize swaps above all other factors. Choose the sorting algorithm we studied that will perform the best:
ANSWER
1. Merge Sort
Because merge sort uses additional memory instead of swapping the elements.
2. Merge Sort and Quick Sort both can be used with multi processor.
cheers i hope this helps !!!
I'm not absolutely positive that my answer is correct... but here's what I got...
Mother: 33 years old
Daughter: 15 years old
Answer: Buffered
Explanation: Buffered memory is the memory contains registers between the modules of dynamic random access memory(DRAM).It is also known as registered memory. The purpose of using buffered memory to increase the stability and decrease the electrical load.
Other options are incorrect because ECC(error correcting code)memory is for correction and detection of incorrect data, non- parity memory is that don't utilize ECC module and multi-channel used for the increment in the rate of transmission between memory controller and DRAM.
Thus,the correct option is option buffered memory because of serial communication pattern with memory controller and parallel communication technique with chips .
