Re: [algogeeks] Mathematics Puzzle

[Shiv Shankar Prajapati]

Its total no. of Student i.e. 69.
   If all the students ranking is increased then all the student will get
the lollipop. But there is one student left who was at top n now on the
least ranking and as the condition is given that student may appear first
and get the lollipop. So professor need will give 69 lollipop. in this
(worst) case.

On Sun, Nov 21, 2010 at 8:42 PM, Ashim Kapoor  wrote:

> Do you mean if the rank of a student is better than the rank of the prev
> student then he/she gets a lollipop?
>
> Thank you,
> Ashim
>
>
> On Sun, Nov 21, 2010 at 6:57 PM, vamsee marpu wrote:
>
>> Does anybody know the solution for the following problem :
>>
>>
>> *A headmaster of a primary school performs an activity with the students
>> of a class to encourage them to perform better in academics. He asks them to
>> stand in queue, starts calling the students out one by one and asks them
>> their rank in class. Each one has a unique rank in class. If the rank of a
>> student is better than his/her previous best rank, then he awards him/ her a
>> lollipop (students love lollipops). Note that the first one in the queue
>> will always get a lollipop and the students arrange themselves in random
>> order in the queue. What is the expected number of lollipops the headmaster
>> will have to distribute among students if the total number of students in
>> the class is 69? Note that the answer can be a fractional number.*
>>
>>
>>
>>
>>
>> Thanks and Regards,
>> M. Vamsee
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algoge...@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com
>> .
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
With Regards,

Shiv Shankar,

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Brain Teaser

[Shiv Shankar Prajapati]

Several solutions are possible for it

518 2
736 4

Here we can swap the position of 5<->7, 1<->3 etc.


On Thu, Nov 11, 2010 at 11:48 PM, jagannath prasad das
wrote:

> 4 8 3 7
> 2 6 1 5
>
> On Thu, Nov 11, 2010 at 5:57 PM, sunny agrawal wrote:
>
>> @rohit
>> 4 5 are  diagonally adjacent .
>>
>> On Thu, Nov 11, 2010 at 5:09 PM, Rohit Singhal 
>> wrote:
>>
>>> 1 5 2 6
>>>
>>> - - - - - -
>>>
>>> 3 7 4 8
>>>
>>>
>>> On Thu, Nov 11, 2010 at 3:16 PM, Abhilasha jain <
>>> mail2abhila...@gmail.com> wrote:
>>>
 solution is
 5 1 6 2
 _ _ _ _

 7 3 8 4


 On Thu, Nov 11, 2010 at 1:26 PM, Amod  wrote:

> We have a rectangle
> It is divided in eight parts by three vertical and one horizontal line
>


> so that there are 8 chambers.
> Now we have numbers from 1-8 to be filled in these chambers.
> Rule : No two consecutive numbers must be present either side to side
> or diagonal
> Invalid situation example
> Given 5 at position 2 then 4 cannot occur at any of the give position.
> 4 5 4
> _ _ _ _
>
> 4 4 4
> _ _ _ _
>
> --
> You received this message because you are subscribed to the Google
> Groups "Algorithm Geeks" group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
  --
 You received this message because you are subscribed to the Google
 Groups "Algorithm Geeks" group.
 To post to this group, send email to algoge...@googlegroups.com.
 To unsubscribe from this group, send email to
 algogeeks+unsubscr...@googlegroups.com
 .
 For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.

>>>
>>>
>>>
>>> --
>>> Rohit Singhal
>>> B.Tech. Part-IV,
>>> Department Of Electronics Engineering,
>>> Centre of Advanced Studies,
>>> Institute Of Technology, BHU
>>>
>>> --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To post to this group, send email to algoge...@googlegroups.com.
>>> To unsubscribe from this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com
>>> .
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>
>>
>>
>> --
>> Sunny Aggrawal
>> B-Tech IV year,CSI
>> Indian Institute Of Technology,Roorkee
>>
>>  --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algoge...@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com
>> .
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
With Regards,

Shiv Shankar,

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.