Answer:First one net is the answer ........
Answer:
1.2124
2.1212 is the correct answer right
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)
Boolean operators, it uses the word "and","or" and "not" with keywords to control the search. For example if you search for health and food, the search engine will give a narrow search focusing on the two keywords. Using "or" with keywords will give much broader results. Using a "not" will remove one keyword from the search, ex. windy not rainy will give results of the keyword windy only. An asterisk on the other hand, gives wider results with variations.
Hello there! The answer is:
B. The Pre-Production Phase
When someone or a group of people are designing an app or game, they generally follow the rule of phases. Basically, if you don't know what this process is, sound effects, character designs, icons and the concept are discussed. This is the first phase of game development.
I hope I helped you!
