Please help me in this question: 16/All of the following are cache replacement algorithms except:          a. LRU b. FIFO c. Random d. Thrashing   Thank you!

B.12) For each of the following cases, first say if the sequence of events is possible or not. Then, in those cases where it is not possible, explain why it is not possible. a) TLB hit, Cache hit b) TLB miss, Page table entry valid, Cache hit c) TLB miss, Page table entry valid, Cache miss d) TLB miss, Page table entry invalid (Page Fault), Cache hit (after the page fault is handled, the TLB is updated, and the access is restarted and the TLB now hits).

For each of the cache modifications that we could perform, select whether it will increase, decrease, have no effect, or have an unknown effect on the parameter. • An unknown effect means that it could either decrease or increase the parameter in question. • No effect also includes marginal or very little effect . • When answering for multilevel caching, answer based on the caching system as a whole. Improvement Increase Cache Size (C) Increase Associativity(K) Increase Block Size(b) Use Multilevel Caching Hit Rate [Select] [Select] [Select] [Select] V Cache Access Time [Select] [Select] V [Select] [Select] V Average Memory Access Time [Select] [Select] [Select] [Select] <

Choose the correct answer to fill-in the blank in the sentence below: The dimension of a dynamic programming algorithm is the number of the cache array T. used to fully initialize and complete O base cases O none of the options O distinct values O nested for loops

When implementing a dynamic memory allocator based on implicit free lists, which of the following block placement policies often results in the highest amount of fragmentation? O First Fit O Perfect Fit OBest Fit ONext Fit

3. Which stack protection techniques are vulnerable to return-orlented programming? a. Stack Canaries b. Address space layout randomization c. Limiting Executable Code Regions 4. In malloclab, several students implemented an optimization where small blocks would be allocated at the beglinning of a free block, and large blocks would be allocated at the end of a free block. In what way was this useful on some traces? a. It increases the memory utilization due to less Internal fragmentation. b. It increagos tho momory utlization duo to moro coaloscing opportunities. c. Itincreases the throughput due to smaller free lists. d. It increases the throughput due to better temporal locality in caches. 5. After a forki), to access which datastnuctures, should the resulting two processes synchronize? а. Неар b. Stack c. Registers d. Globals e. Program Code

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.

.

PROGRAMMING EXERCISES: 4. How many double entries can aValues[MAX_A] store? 5. What is the value of aValues[2]?  [Hint:  the value is an address] 6. How many bytes are allocated to sentence?

Q1:.