Answer:
<u> A. It uses binary numbers in its algorithm</u>
Explanation:
A Binary search is a type of algorithm designed to look through <em>only </em>a sorted array of data for a particular item.
It is<em> more efficient (faster) </em>than sequential search since the algorithm doesn't have to look up the entire array of data, but simply repeatedly divide in half the section of the array that could contain the searched item.
Answer:
The term "Local storage"denotes data that is being stored on devices like a universal serial bus (USB) thumb drive, laptop, server, DVD, CD, or server. The term "hosted storage," "Internet storage" or "cloud storage." denotes data that exists in a mobile state on the network, such as data on the Internet, wireless networks, or a private network
<span>Server virtualization in windows server 2012 r2 is based on a module called the</span> hypervisor.
Answer:
Check the explanation
Explanation:
1.
System = 256Byte = 8 bit
Cache = 64B , block size = 16 byte.
A) Direct Mapped Cache:
Block offset = log (Block size) = log 16 = 4bit
Total # of block inside cache = 4.
Therefore index offset = log 4 = 2bit.
Remaining is tag bits.
Therefore tag bits = 8-(4+2) = 8-6 = 2 bits
Tag Index offset Block offset
(2 bits) (2 bits) (4 bits)
Fully associative cache :
In fully associative cache, any of main memory block can be placed anywhere in cache. Therefore index offset =0 bits.
Therefore tag bits = 8-block offset bit= 8-4 =4bits
Tag Block offset
(4 bits) (4 bits)
Answer:
C. redundant networks are more reliable.
Explanation: I just got a 100 on a test and that question was asked.