I have posted the final grades in SIS, so you should be able to see them soon (at least by tomorrow).
Comments on the final exam: [PDF]
Thanks everyone for a great semester, and enjoy your summer!
|
||||||
|
This page: Conveying Complexity Highlights contains links to some of the most interesting, illuminating, and/or entertaining submissions for PS7. Enjoy watching the movies, listening to the music, and playing the games! (Alas, HTTP 1.1 does not provide any support for transmitting cakes, however.) The final exam is Thursday, May 13, 9am-noon (as scheduled by the registrar). It covers the whole course:
It will be similar to Exams 1 and 2 except that no resources may be used (no notes at all!). I will be out of town Thursday [More...] Sorry, I was wrong for one of the Jeopardy answers today! n! is not in O(2n). It is easy to see that n! < nn, since all the numbers in the product to compute n! are less than (or equal to) n, but this doesn’t prove it is not in O(2n). For that, we can use Sterling’s approximation which gives a tight approximation of the value of n! as which is definitely not in O(2n) since the base of [More...] Please submit your PS7 by posting a comment to this post. Some reminders from the PS7 handout are below, see that handout for full details. If you work in a team, your team should jointly post a single submission with all of your names on it. Your post should include: |
||||||
|
This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 United States License. |
||||||
