1. Assume data block can hold 512 Bytes and iNode has 10 direct pointers. 11 th point is a single indirect and 12th pointer is a double indirect. There are 12 pointers altogether. Assume address block can hold 12 addresses. Assume the iNode is already in memory. a) Explain how 512*5 Byte can be accessed? b) Explain how 512*15 Byte can be accessed? c) How big file canbe addresse by this l-node? Show your work.

In mapping, the data can be mapped only in one line in the Cache Memory. Select one: a. Associative O b. Indirect O C. Direct O d. Set Associative

Computer Science You are given a cache that has 16 byte blocks, 512 sets, and is 2-way set associative. Integers are 4 bytes. Give the C code for a loop that has a 100% miss rate in this cache but whose hit rate rises to almost 100% if you double the size of the cache. Do not assume the starting indexes of any arraysarrays.

1. Caches are important to providing a high-performance memory hierarchy to processors. Below is a list of 32-bit memory address references, given as word addresses. 42, 137, 66, 50, 38, 225, 173, 22, 19, 88, 51, 43 a. For each of these references, identify the binary address, the tag, and the index given a direct mapped cache with 16 one-word blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. b. For each of these references, identify the binary address, the tag, and the index given a direct mapped cache with two-word blocks and a total size of 8 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. Please explain the process.

Which fields inside an entry in a log file will be made available to be processed by the log processing function that has been specified? The following piece of code causes an average of how many cache misses per entry, assuming that cache blocks are 64 bytes in size and that no prefetching is performed.

5   Consider the following code snippet: .datamyVar byte 4, 8, 5, 7.codemov esi, offset myVaradd esi, 2 What is the value at the memory location esi is pointing to? In other words, what value is referenced by [esi]? 6 Consider the following code snippet: .datamyArray word 01F2h, 1111h, 0ABDh, AAAAh.codemov ebx, offset myArrayadd ebx, 2 What is the value at the memory location ebx is pointing to? In other words, what value is referenced by [ebx]? 7 Consider the following code: .dataarray word 1, 2, 3, 4, 5.codemov eax, offset arraymov ecx, lengthof arrayloopstart:add byte ptr [eax], 1add eax, 2loop loopstart What are the values in the array after this code is finished executing?

Suppose a disk has N cylinders, numbered from 0 to P. At some time, the disk arm is at cylinder X, and there is a queue of disk access requests for cylinders R1, R2, R3, R4. Explain which Disk scheduling algorithm should be the best to be used between the following a) FIFO b) CSCAN c) SSTF d) FSCAN e) CLOOK N: B • • Choose any acceptable numeric numbers for N, P, X, R1, R2, R3 and R4 • • Plagiarism Will be penalized heavily

cache.xls (or it can be a google sheet that you share with me in a cache.txt with the url in it )= a spreadsheet showing the cycle counts of a cached and non-cached machine. Also, you need to show the cache as the memory accesses progress in your program marking the hits and misses (misses in RED). You should have cells to show how many hits and how many misses your program has, and details on what is the cache replacement policy you implemented.   Here is code:   void c_cache_for_badge() {    int na = 8, nb = -3, nc = 10;    // pointers    int *npa;      npa = (int*)malloc(sizeof(int)*84);      // init integer pointers    for(int i = 0; i < 84; i++)    {        npa[i] = i;    }        // integer pointers    for(int i = 9; i < 70; i= i + 3)    {        nb += npa[i % 5] + npa[i % 3] + npa[i % 6];    }     }   void main() {    c_cache_for_badge(); }

What does write back mean in terms of cache? Group of answer choices   a. When an error occurs in memory, the cache is written back to the memory. b. When a bit in the cache is changed, the entire block is written to memory. c. When a line is evicted, the block it contains is written to memory.