A four-way set-associative cache consists of 32 slots. The main memory block size is 32 words. Consider referencing following word addresses 0, 1, 2, …, 1057 repeatedly for 10 times. Assume that the cache is initially empty and the LRU replacement algorithm is used. How many cache misses will be generated by these references? What will be the miss rate for the reference sequence?

Given a link with a maximum transmission rate of 32.8 mbps. only two computers, x and y, wish to transmit starting at time t = 0 seconds. computer x sends filex (4 mib) and computer y sends filey (244 kib), both starting at time t = 0. statistical multiplexing is used, with details as follows packet payload size = 1000 bytes packet header size = 24 bytes (overhead) ignore processing and queueing delays assume partial packets (packets consisting of less than 1000 bytes of data) are padded so that they are the same size as full packets. assume continuous alternating-packet transmission. computer x gets the transmission medium first. at what time (t = ? ) would filey finish transmitting? give answer in milliseconds, without units, and round to one decimal places (e. g. for an answer of 0.013777 seconds you would enter "13.8" without the quotes)