-- Forwarded message --
From: Ayyamperumal Ragupathy
Date: Sun, Nov 21, 2010 at 3:58 PM
Subject: Ayyamperumal's Research Survey- Spare max. 4 minutes, Thanks -reg
To: a.sarukris...@gmail.com
Dear Sir/Madam/Friends/students,
As a part of my research i am collecting data.This will
@Ashim,
Dunno... you can call it Salil's Puzzle if you like ;-)
afaik. its been listed in KT book Randomized algorithms chapter.
On Mon, Nov 22, 2010 at 3:36 PM, Ashim Kapoor wrote:
> what is the name of this famous puzzle ?
>
> On Mon, Nov 22, 2010 at 2:57 PM, Salil Joshi wrote:
>
>> Hi,
>> Th
what is the name of this famous puzzle ?
On Mon, Nov 22, 2010 at 2:57 PM, Salil Joshi wrote:
> Hi,
> The puzzle needs to be rephrased as:
> "If the rank of the student who comes out of the classroom is better
> than ranks of all students who came out before him/her, then he/she
> gets a lollipop"
Hi
On 22 November 2010 08:14, ankit sablok wrote:
> WHEN IS GOOGLE SUMMER OF CODE 2011 BEGINING AND HOW CAN WE APPLY FOR
> IT
Next year
> AND WHAT ARE THE ELIGIBILITY CRITERIA FOR THE APPLICATION.
you must be a student
> PLEASE HELP ME OUT WITH THIS APPLICATION PROCEDURE...
Kindly refer to the
@Ashim : Yes
@Shiv Shankar : The Question says : *the students arrange themselves in
random order in the queue.
*69* *is possible only when the students arrange
themselves in decreasing order of their rank.
--
You received this message because you are subscribed to t
@Coolfrog$: It will be instructive if you do it for yourself. Perhaps
with practice you can work through your confusion. Have you worked out
the bit patterns of those hex constants? They are crucial to
understanding Gene's algorithm. -- Dave
On Nov 22, 6:55 am, "coolfrog$"
wrote:
> @dave
> plz ru
@dave
plz run gene's code for input 0xAD...or send me some link of bitwise
programing which involve simultaneous many opearation... like above...
i am always confused with bitwise programing...
On Sun, Nov 21, 2010 at 11:11 PM, Dave wrote:
> @Coolfrog$: Don't forget the bitwise logical produc
Might be its is due to the comparison operation which takes many cycles
i < max takes more cycles of cpu than just simply checking i
On Sun, Nov 21, 2010 at 6:50 PM, shiva wrote:
> I want to know is there any difference between following two loop in
> terms of speed.
>
> 1.
> for(i=0;i {
>
> //S
Well,
Since the students are mixed randomly (as mentioned in the problem), the
chances (probability) that the 'i' th student who comes out is ranked best
so far is directly (1/i). Since this is an independent Random Variable, the
answer thus becomes sum_1^n {1/i} which for large value of n can be
a
I was asking you for some examples ..as i dont have any knowledge
regarding this assembly code and how to study it .
there was no intention of mine to challenge you or disregard you .
On 11/22/10, Gene wrote:
> I'm not sure what you mean by support.
>
> If you mean examples, gcc uses several of
Any explanation of how it works and how you got log(69) as answer.
Thanks in advance.
On Nov 22, 2:27 pm, Salil Joshi wrote:
> Hi,
> The puzzle needs to be rephrased as:
> "If the rank of the student who comes out of the classroom is better
> than ranks of all students who came out before him/
Hi,
The puzzle needs to be rephrased as:
"If the rank of the student who comes out of the classroom is better
than ranks of all students who came out before him/her, then he/she
gets a lollipop".
Rephrased this way, this is a famous puzzle, and the answer is
log(69).
On Nov 22, 12:44 pm, shiva
12 matches
Mail list logo
