Consider the following code and choose the right algorithm used in the following code. public static > void sortMe(T[] data){ int position, scan; T temp; for (position = data. length - 1; position >= 0; position--) { for (scan = 0; scan <= position - 1; scan++) { if (data[scan]pareTo(data[scan+1]) > 0) swap(data, scan, scan + 1); } } } Select one: a. Quick Sort b. Insertion Sort c. Selection Sort d. Bubble Sort

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?

The most common battery cable terminal is a that provides a large surface contact area with the ability to tighten the terminal onto the battery post using a nut and bolt.

Describe a data structures that supports the stack push and pop operations and a third operation findmin, which returns the smallest element in the data structure, all in o(1) worst-case time.