 |  |  |  |  |  |  |  |
faster computer algorithem
Please support our Computer Science advertiser: Learn about neural networks and artificial intelligence.
 |
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).
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).
•
•
Join Date: Jun 2005
Posts: 2,047
Reputation: 
Solved Threads: 139
Do your own homework.
All my posts may be redistributed under the GNU Free Documentation License.
pls if you dont no how to solve the solution above do replay to me this kind of solution im seriase pls
if i know the solution i will not send it to you
ok
if i know the solution i will not send it to you
ok
•
•
•
•
Originally Posted by shamma 
if i know the solution i will not send it to you
ok
Try these and we may help you:
A:
Please do try to spell properley - "chatspeak" like "plz" is not acceptable (although I must admit that I have a habit for it myself)
B:
Have you read the rules? We wil not do your homework for you. We can point you in the right direction and guide you but only if you show us that you have at least made a start.
Last edited by jbennet; Apr 30th, 2007 at 2:56 pm.
If i am helpful, please give me reputation points.
>pls if you dont no how to solve the solution above do replay to me
Rash knows the answer, as do many of us, but he's refusing to give it to you because the problem is clearly homework and you haven't shown any effort.
>im seriase pls
I'm serious too. No effort, no help.
Rash knows the answer, as do many of us, but he's refusing to give it to you because the problem is clearly homework and you haven't shown any effort.
>im seriase pls
I'm serious too. No effort, no help.
I'm here to prove you wrong.
This is my answer
i do not if it is true or not
T(1ooo)=O(1000)
but for the second or faster computer will be
T(1000000)=O(1000000)
it is true or not...reply please
i do not if it is true or not
T(1ooo)=O(1000)
but for the second or faster computer will be
T(1000000)=O(1000000)
it is true or not...reply please
|
Similar Threads
- Is my system too running hot? (Cases, Fans and Power Supplies)
- my computer, my documents, etc.. folders do not open (Windows NT / 2000 / XP)
- Hard Drive Detection Problem (Storage)
Other Threads in the Computer Science Forum
- Previous Thread: Scheme to Python
- Next Thread: sum of subsets
| Thread Tools | Search this Thread |
You need to join our community in order to build your list of favorite forums. You can visit the forum index for a listing of all forums.
Related Forum Features
Latest Computer Science Posts
- Today's Posts
- Unanswered Threads
ai algorithm algorithms amazon assignment assignmenthelp assignments automata battery bigbrother binary bittorrent bizarre bomb business cern codebreaker compiler computer computers computerscience computertrackingsoftware connect conversion dataanalysis dataintepretation development dfa dissertation dissertations dissertationthesis dissertationtopic ebook employment energy extensions floatingpoint foreclosure foreclosuresoftware fuel gadgets geeks givemetehcodez government graphics hardware homeowners homeworkassignment homeworkhelp humor ibm ideas internet iphone ipod itcontracts jobs kindle laser laws linkbait lsmeans mainframes marketing mining mobileapplication msaccess nano netbeans networking news os p2p piracy principles programming rasterizer research sam-being-cute science security sex simulation software spying sql stephenfry study supercomputer supercomputing sweden technology textfield turing turingtest two'scompliment uk virus warehouse ww2
