COP2500 Lab 7

homeworkTHIS IS A TAKE HOME LAB

Deliverables: To complete this assignment you must perfom two tasks --
1.) Run the JavaSCript functions and complete this HTML page by filling in the *blanks*.
NOTE: that you have to answer the questions right here on this html page NOT IN A TEXT FILE
2.) Turn in your assignment via webct: by deadline Monday July 2nd at 10pm.

Introduction: The main goal of this assignment is for you to see how quickly higher order problems become time consuming.

Functions:

WARNING: foo4 gets slow fast! Start with values like 5 or 6 before pushing that button.
Questions:

1.) According to our theroetical definition of computability, which functions are not computable? *blank*

2.) In terms of how long you are willing to wait in this lab, how long does a function require before you consider it not computable? (Its ok to use an arbitrary number like 20 or 30 milliseconds.) *blank* milliseconds.

3.) According to your answer on question 2 and actual running time, which value of n makes the O(log n) function not computable? n = *blank*

4.) According to your answer on question 2 and actual running time, which value of n makes the O(n) function not computable? n = *blank*

5.) According to your answer on question 2 and actual running time, which value of n makes the O(n!) function not computable? n = *blank*

6.) We would expect the O(n) function to take approximately double the time to complete when n is doubled. Did that happen? Provide numbers to suport your answer. *blank*