I am sorry, anyways this has been recently discussed in the groups, just go
thro a few of the earlier posts!
ps:might not be exactly same but very similar
On 3/19/07, Ez_Alg <[EMAIL PROTECTED]> wrote:
>
>
> it's not homework, i am studying for my finals!!!
>
>
> >
>
--~--~-~--~~-
it's not homework, i am studying for my finals!!!
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this gro
Do not ask for homework solutions!
On 3/19/07, Ez_Alg <[EMAIL PROTECTED]> wrote:
>
>
> Given an unlimited supply of coins of denominations x1; x2; : : : ;
> xn, we wish to make change for a value v using at most k coins; that
> is, we wish to find a set of k coins whose total value is v.
> This mi
Given an unlimited supply of coins of denominations x1; x2; : : : ;
xn, we wish to make change for a value v using at most k coins; that
is, we wish to find a set of k coins whose total value is v.
This might not be possible: for instance, if the denominations are 5
and 10 and k = 6, then we can m
let pr[i] be answer to sub-problem 1..i and there is restaurant built at i.
(maximum expected total profit)
How do we calculate pr[i]? Expected profit from location i + max. pr[j], where
location of j is at least k apart from location i.
pr[i] = p[i] + max(pr[j]), where j is between 1..i-1 and m[
BurgerKing's is considering opening a series of restaurants along
RiverSide Freeway. The n possible locations are along a straight line,
and the distances of these locations from the start of RiverSide
Freeway are, in miles and in increasing order,m1;m2; : : : ;mn. The
constraints are as follows:
We are feeling experimental and want to create a new dish. There are
various ingredients we
can choose from and we'd like to use as many of them as possible, but
some ingredients don't
go well with others. If there are n possible ingredients (numbered 1
to n), we write down an
n x n matrix giving
Please don't post homework questions here. This problem is too simple
for a group calling themselves "Algorithm Geeks".
I hope most of you'll agree to this and put a stop to this practice.
--~--~-~--~~~---~--~~
You received this message because you are subscribed
Yeah, after finding the k-th element there is no need for further
partitioning. This is logically true indeed.
But in this case, I guess you have to do it for determining who'll get
the Samosas and who the Gulabjamuns !!.
--~--~-~--~~~---~--~~
You received this m
An algorithm with comlexity O(log n) is more efficient that O(n) one.
Will you still call it polynomial complexity or stomething better that
linear.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks"
Hi all,
Can someone here tell me the difference between RPC and ordinary
procedure call in terms of "compilation" and "semantics"?
Note: This is NOT a homework assignment. It is a question from
practice midterm, so I am not doing anything wrong.
Thanks.
--~--~-~--~~~-
This problem has been troubling me from quite a long time.
The circumference of two concentric disks is divided into 200 sections
each. For the outer disk, 100 of the sections are painted red and 100 of
the sections are painted white. For the inner disk the sections are painted
red or white in an
12 matches
Mail list logo
