CS212 Exams
Spring 1999 - Final

Solution to True and False

WARNING: You should seriously try to answer this question before looking at the solution -- it's just a good study skill. Also, some answers on this page may be more brief than you would want to put down in an actual exam. If you want any type of partial credit, you should write more than just the solution.

1. False - Turing's halting problem demonstrates that this is impossible.
2. True - Sure you can.
3. True - Recursion is possible by using the Y combinator.
4. True - Insertion sort runs in O(n²).
5. False - These operations take O(lg n) time.
6. False - Must consider the constant factors dropped by big-O notation.

Question

Return to CS 212 Final - Spring 1999