Answer all the questions: 1. Consider the list L- [1 2 3] and do the following (Only using the functions methods of
5
a. Insert 25 at index 1.
be Add 6. 33. 24. 7 and 12 to the end of the list.
c. Sort the list both in ascending and descending order
d. Remove the first element from the list.
de Reverse the list.

Suppose we have a byte addressable computer that has a 32-byte cache with 8 bytes per block. the memory address is 8 bits long. the system accesses memory addresses (in hex) in this exact order: 6e, b9, 17, e0, 4e, 4f, 50, 91, a8, ab, ad, 93, and 94. (a) assuming the cache is direct mapped, what memory addresses will be in cache block 2 after the last address has been accessed? (b) assuming the cache is direct mapped, what is the hit ratio for the entire memory reference sequence given, assuming the cache is initially empty? (c) assuming the cache is 2-way set associative with a lru replacement policy, what is the hit ratio?

What are the different parts of computer

When is a chart legend used a. all the time b. whenever you are comparing data that is the same c. whenever you are comparing multiple sets of data d. only for hand-drawn charts