Don't try this... :( :(
--Regards,
Sug@ny@...
--
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 group, send email to
algogeeks+unsubscr...@googlegroups
Can anyone tell me some suggestions to prepare for Pep exam...?
--
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 group, send email to
algogeeks+unsubscr
@rajeev : Can u pls explain the second approach...??
On Mon, Aug 15, 2011 at 10:09 PM, sandeep pandey <
sandeep.masum4...@gmail.com> wrote:
> dyamic programming.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group,
Assume you are writing number in ascending order to an array of constant
size.once you reach the end of the array,you start writing from the
beginning, thus writing over the oldest entries.Write an algorithm for
finding a specific number in this array.
--
You received this message because you are
*Hi all,*
*Can someone help me to solve this randomized algorithm related puzzle?*
*
*
*Let p(t) = Probability (atmost k copies of coupon1 are collected at **time
t)*
*If p(t)<= (1/2n), then prove that the expected time to get k+1 copies **of
all n coupons <=2t.*
--
You received this message beca
Hi all,
Can someone help me to solve this randomized algorithm related puzzle?
Let p(t) = Probability (atmost k copies of coupon1 are collected at time t)
If p(t)<= (1/2n), then prove that the expected time to get k+1 copies of all
n coupons <=2t.
With regards,
Sugi
--
You received this mes
can u help with the solution for this problem.??
You’re doing some stress-testing on various models of glass jars to
determine the height from which they can be dropped and still not break.
The setup for this experiment, on a particular type of jar, is as follows.
You have a ladder with n rungs, a