Question Completion with Options:
a. Ill only.
b. I only.
c. II and III only.
d. I and II only.
e. Il only
f. I and Ill only.
Answer:
The best method to use to sort the array in descending order is:
e. Il only
Explanation:
The Merge Sort is similar to the Insertion Sort but, it is better with its sorting versatility. It repeatedly breaks down a list into several sub-lists until each sub-list consists of a single element and then, merging the sub-lists in a manner that results in a sorted list. The Merge Sort has been described as a "divide and conquer" technique because of how it splits a list into equal halves before combining them into a sorted whole.
File Transfer Protocol, also known as FTP
Answer:
It might not work efficiently.
Explanation:
The function of the protocol rtd3.0 is to transfer data to a receiver from a sender.
As soon as the receiver received the packet transferred by the sender, we respond acknowledge (Ack) to the sender so that sender can confirm the receiver has gotten it.
The receiver will not send any acknowledgment if the packet he receives are such that bits contain error or not in order.
After that timeout, the packet will be re-transmitted by the sender.
It is then possible the protocol might seem to be inefficient if a packet is sent many times, because other packets will have to wait to sent until the current packet is sent successfully.
The solution to prevent this kind of issue is to allow for the occurrence of premature timeouts.
Answer:
i dont
Explanation:
know sorry tenks thankyou
Answer:
Yes, it can be determined if an an external web site was likely accessed from a computer in the same department a couple of seconds ago.
Explanation:
Yes. “Dig” can be used to search that website in the local DNS server. A practical example would be to insert “dig google.com” and that will give us the result of the query time for searching and finding google.com. Supposing google.com was accessed a few seconds ago, then an entry for google.com is cached in the local DNS cache and the search or query time is 0 msec. If not the query time will be large.
