Consider a memory system with a two-level hierarchy with a cache M1 and main memory M2. The size of the main memory, M2 is 256 bytes with block size of 16 bytes. The size of the cache, M1 is 64 bytes with the same block size of 16 bytes. The word length is 4 bytes, implying 4 words per block. A certain trace program generates the following sequence of word addresses, 0,8,16,1,24,21,20,3,32,61,31,19,16, 60,28,21,8,11,19,22,28,42,55,58,59< br />
Note, every time a new block is accessed by the cache, up to 4 words are received implying that if block 0 is accessed from the main memory then 0,1,2,3 words are obtained, if block 1 is accessed from the main memory, words 4,5,6,7 are obtained, if block 2 is accessed from the main memory words 8,9,10,11 are obtained and so on. The addresses given above are word addresses, not memory block addresses. Assume that the access time is 2 clocks from the cache (M1) and 50 clocks from main memory (M2), the transfer rate is 4 bytes per clock and that 25% of the transfers are dirty. The base CPI of a perfect memory system is 1.75.

a. Consider a fully associative cache with LRU replacement policy. Determine the hit ratio. What is the average memory access time?
b. Consider a direct mapped cache. Determine the hit ratio. What is the average memory access time?

Most shops require the technician to enter a starting and ending time on the repair order to track the actual time the vehicle was in the shop and closed out by the office. this time is referred to as _ time ? a. comeback b. ro c. cycle d. lead

*! 20 points! *jeff wants to create a website with interactive and dynamic content. which programming language will he use? a. dhtml b. html c. css d. javascript

This question involves a class named textfile that represents a text file. public class textfile { private string filename; private string filename; private arraylist words; // constructors not shown // postcondition: returns the number of bytes in this file public int filesize() { } // precondition: 0 < = index < words.size() // postcondition: removes numwords words from the words arraylist beginning at // index. public void deletewords(int index, int numwords) { } // precondition: 0 < = index < = words.size() // postcondition: adds elements from newwords array to words arraylist beginning // at index. pub lic voidaddwords(int index, string[] newwords) { } // other methods not shown } complete the filesize() method. the filesize() is computed in bytes. in a text file, each character in each word counts as one byte. in addition, there is a space in between each word in the words arraylist, and each of those spaces also counts as one byte. for example, suppose the words arraylist stores the following words: { mary had a little lamb; its fleece was white as snow. } the filesize() method would compute 4 + 3 + 1 + 6 + 5 + 4 + 6 + 3 + 5 + 2 + 5 as the sum of the lengths of each string in the arraylist. the value returned would be this sum plus 10, because there would also be 10 spaces in between the 11 words. complete the filesize() method below: // postcondition: returns the number of bytes in this file public int filesize() { }