Consider the variant of the paging problem where requests come in as before, but now a request can either be for a single page or two contiguous pages. How does this affect the number of cache misses MIN makes in the worst case? How does it affect our lower bound CoblR≥Hk? (State any assumptions you make). How competitive is the Marker algorithm in this case? (Give a reasonable upper bound)
Use the extended Euclidean algorithm to find the multiplicative inverse of 7mod165. Solve 8x=6mod10 for all solutions.
Using the Chinese Remainder theorem determine a number x mod 165 that satisfies xmod3=2, x=3mod5, and x=8mod11.
Suppose p=11, q=13. If we choose e=7, what would be the RSA public and private keys? Show the result of encrypting with the private key, the message 97. Show the steps in decrypting it, to get the original number back.
