Unformatted text preview: 4 9. 4 pts [NP
complete] a. Which of the following are NP
complete (circle all that apply): i. Traveling salesperson problem ii. Minimum spanning tree iii. Knapsack problem iv. Depth
first search v. Graph coloring problem b. If a problem is NP
complete, then (circle one) i. Any algorithm for the problem requires polynomial time ii. Any algorithm for the problem requires exponential time iii. The best known algorithms for the problem require more than polynomial time iv. The best known algorithms for the problem require more than exponential time 10. 10 pts [Limitations] a. True or False? Error
correcting codes can be used to correct for overflow error b. True or False? Real
number computations are limited due to limited precision in representing them. c. True or False? The “halting problem” is that of determining whether or not a program when run will get into an infinite loop on a given input. d. True or False? We can solve the halting problem by doing an exhaustive search of possible solutions – but this would take an exponential amount of time. e. True or False? Software limitations arise from the sheer complexity of software systems. 11. 10 pts [OS] a. (2pts ) Which has shortest average completion (turnaround) time? (circle one) i. First
come
first served ii. Shortest job next iii. Round robin b. (3 pts) Name three functions of an operating system 5 c. (2 pts) What does demand paging refer to? (circle one) i. Page of memory retrieved from disk when process needs it ii. Process is “paged” when a resource that it has demanded becomes available iii. Technique for keeping data ready for insertion into...
View
Full Document
 Fall '09
 Computer Science, the00, is00

Click to edit the document details