The final exam is comprehensive. Thus, the previous study questions for Midterm 1 and Midterm 2 also apply to the final exam.

In addition to the readings, listed on the CS 162 Homework page, and the previous study questions, solving the following questions will provide a good preparation for the final exam.

1. Problem 5.7 from Sipser.
2. Problem 5.10 from Sipser.
3. Problem 5.13 from Sipser.
4. Problem 5.28 from Sipser.
5. Problem 5.30a from Sipser.
6. Problem 7.3 from Sipser.
7. Problem 7.23 from Sipser.
8. Problem 7.30 from Sipser.
9. Problem 7.33 from Sipser.
10. Problem 7.40 from Sipser.
11. Problem 8.4 from Sipser.
12. Problem 8.9 from Sipser. (Note that the length of the ladder could be dⁿ, where d is the alphabet size and n is the length of s.)
13. How many rounds would the interactive proof for graph non-isomorphism have to go before the verifier could be convinced that a graph, G, is not isomorphic to graph, H, so that there is only a one in billion chance that he could be wrong?
14. In the RSA Cryptosystem, what is the public key and private key for a participant? How are encryption and decryption done?