Java multiple choice!

Multiple Choice (32) When you write a program for an algorithm and it is taking much longer than expected you should 1. a. b. c. d. try to design a better algorithm buy a faster computer rewrite the algorithm in a different language ignore the problem 2. A program's execution time depends in part on a. b. c. d. the speed of the computer it is running on the memory capacity the language the algorithm is written in all of the above 3. An algorithm has a. b. c. d. time requirements space requirements both a & b none of the above 4. The memory required to run an algorithm is called a. space complexity b. memory complexity c. time complexity d. storage complexity 5. A measure of an algorithm's execution needs is called a. b. c. d. time complexity speed complexity space complexity run time complexity 6. A "best solution is a function of a. b. c. d. execution time space consumption programming effort all of the above 7. You should express the complexity of an algorithm in terms of it a. problem size b. space requirements c. execution time d. overall complexity 8. Problem size is defined as a. b. c. d. the number of items an algorithms processes the amount of memory an algorithms uses the amount of execution time an algorithm takes none of the above Measuring the growth of an algorithm's time requirement grows as the problem size increases is called the 9. growth rate function time complexity space complexity overall measurement function a. b. c. d