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:
False
Explanation:
I did it on edgnuity also i got it right
Answer:
The program is as follows:
<em>5 INPUT A,B</em>
<em>6 PROD = A * B</em>
<em>7 PRINT PROD</em>
<em>8 TOTAL = A + B</em>
<em>9 PRINT TOTAL</em>
<em>10 DIFF = A - B</em>
<em>11 PRINT DIFF</em>
<em>12 END</em>
Explanation:
This gets input for the two numbers
<em>5 INPUT A,B</em>
This calculates the product
<em>6 PROD = A * B</em>
This prints the calculated product
<em>7 PRINT PROD</em>
This calculates the sum
<em>8 TOTAL = A + B</em>
This prints the calculated sum
<em>9 PRINT TOTAL</em>
This calculates the difference
<em>10 DIFF = A - B</em>
This prints the calculated difference
<em>11 PRINT DIFF</em>
This ends the program
<em>12 END</em>
Answer: True
Explanation: CCM process is the process which basically watches over any change or modification that is being made in the data and it will only be implemented when there is no adverse effect of the change.It procedure helps in reducing the risk due to any modification made in data of a system. CCM process also take care of the confidentiality of data and integrity as well and helps inn maintaining it.Therefore the given statement is true.