Follow Our FB Page << CircleMedia.in >> for Daily Laughter. We Post Funny, Viral, Comedy Videos, Memes, Vines...

Faster Computers

Suppose you have a computer that requires 1 minute to solve
problem instances of size 1000. What instance sizes can be
run in 1 minute if you buy a new computer that runs 1000
times faster than the old one, assuming the following time
complexities T(n) for our algorithm?
(a) T(n) = O(n).
(b) T(n) = O(n3).
(c) T(n) = O(10n).

Faster Computers Suppose you have a computer that requires 1 minute to solve problem instances..

Answer / deepak bansal

same in every case..
1000*1000

 Is This Answer Correct ? 14 Yes 33 No

More C++ Code Interview Questions

Write a simple encryption program using string function which apply the substitution method.

void main() { int i,j=2; for(i=0;i<3;i++) if(j=i) cout<<"Lotus "; else cout<<"Rose "; } Its result is Rose Lotus Lotus.. How? Explain it?

develop a program to calculate and print body mass index for 200 employees

A suduco given & u hv 2 check if it is incomplete(blanks left),or correct or incorrect

i really need help about this.. write a program to display the set of odd and even numbers separately. find the highest and lowest value of the given numbers.

how to find out the maximum number out of the three inputs.

PROBLEM #8 The cashier at the counter of a Super Store, Mr. Khazaanchi has the following bundles of rupee cash notes with him: Rs. 1, 2, 5, 10, 50, 100, 500, 1000 A customer comes at his counter with various items that he has shopped. Mr. Khazaanchi totals the item prices and tells the customer his total amount payable. The customer gives Mr. Khazanchi some amount of cash. Find the total number of rupee notes of each denomination (i.e. 1, 2, 5, 10, 50, 100, 500, 1000) Mr. Khazaanchi will have to give to the withdrawer ensuring that the total number of rupee notes are minimum.

Code for Two Classes for Doing Gzip in Memory?

Code for Method of Handling Factorials of Any Size?

Write an algorithm that receives a string and reverses it.

can you please write a program for deadlock that can detect deadlock and to prevent deadlock.

Performance Algorithm A performs 10n2 basic operations and algorithm B performs 300 lg n basic operations. For what value of n does algorithm B start to show its better performance?

Categories
• C Code (422)
• C++ Code (128)
• VC++ Code (17)
• Java Code (84)
• Dot Net Code (114)
• Visual Basic Code (11)
• Programming Code AllOther (62)