|
|
Subject:
C programming
Category: Computers > Algorithms Asked by: teddy78-ga List Price: $15.00 |
Posted:
14 Mar 2003 09:37 PST
Expires: 23 Mar 2003 10:49 PST Question ID: 176136 |
Write in C(Legal C-Code)a specialised monitor capable of acquring and releasing a resource in a system with R resources and N processes, each having a unique priority number, following the rule that the lowest priority number gets the resource Start by defining #define MAXRESOURCES R #define MAXPROCESSES N |
|
There is no answer at this time. |
|
Subject:
Re: C programming
From: mathtalk-ga on 14 Mar 2003 15:04 PST |
Hi, teddy78-ga: I would start pricing requests for tested, working code at $50. Perhaps in a case where the problem involved had some novelty or cutting edge interest, you might anticipate interest in tackling such projects for $20. $4 ? For some guidelines on pricing questions, please read this link: http://answers.google.com/answers/pricing.html Finally, your note specifies "Legal C-Code". There would be some helpful building blocks (priority queues) if you were instead targetting C++ code. See here for a question along those lines answered previously: http://answers.google.com/answers/main?cmd=threadview&id=121136 My thought is that if reinventing the wheel is your intention here, the price of the question would reasonably be higher (using C instead of C++) rather than lower. regards, mathtalk-ga |
Subject:
C programming
From: teddy78-ga on 16 Mar 2003 03:38 PST |
Hi mathtalk-ga: Thanks for posting a comment regarding my question. The question had a comment by it self, which helped me to decide a price was "we do not need a computer to write this C-code as it is a short algorithm". The question strictly needs a legal C-code not any other(Neither C++ nor Java) regards, teddy78-ga |
If you feel that you have found inappropriate content, please let us know by emailing us at answers-support@google.com with the question ID listed above. Thank you. |
Search Google Answers for |
Google Home - Answers FAQ - Terms of Service - Privacy Policy |