Computers and Technology, 05.10.2019 10:30, Jorjalilli1318

Suppose that you can rent time on a supercomputer that does 1 operations per second, and that the rental is $3000/hr. your company is willing to spend $17000 to solve the largest version of a certain problem it can.

a) if the best algorithm you know for solving this problem takes 5^n operations, where n is the size of the problem, what is the largest size you can solve?

b) suppose that someone discovers an algorithm for the same problem that takes n^{5} operations. what size problem can you solve now?

Answers: 1

Show answers

Other questions on the subject: Computers and Technology

Computers and Technology, 22.06.2019 06:30, messyquestions

Plz 40 points what are raster vectors? a bitmap image a vector file a type of printing press a small projector

Answers: 1

continue

Computers and Technology, 22.06.2019 12:40, Rententen3845

How do i get the most points, without any effort?

Answers: 2

continue

Computers and Technology, 22.06.2019 23:00, brookerebman15

Which type of tab stop is most for weights and measurements?

Answers: 1

continue

Computers and Technology, 23.06.2019 09:30, blake2001

Which of the following tasks is an audio technician most likely to perform while working on a nature documentary? (select all that apply). eliminating potentially distracting background noise adding sound effects making sure the lighting is adequate for a particular scene changing the narration to better match the mood of the documentary

Answers: 3

continue

Do you know the correct answer?

Suppose that you can rent time on a supercomputer that does 1 operations per second, and that the re...