[algogeeks] not recieving mails

2012-02-01 Thread arpit.gupta
HI, i am not recieving any mails since 20 jan , plz chk thank you -- 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+unsubs

[algogeeks] Re: Probability Puzzle

2011-08-09 Thread arpit.gupta
@dave - method is right, calculation mistake on my part, getting 17/18 only. thanks anyways. On Aug 9, 6:26 pm, Dave wrote: > @Arun: The probability of getting a head on the first toss is > 1/5 * 1 + 4/5 * (1/2) ) = 3/5, > while the probability of getting 2 consecutive heads is > 1/5 * 1 + 4/5 *

[algogeeks] Re: Probability Puzzle

2011-08-09 Thread arpit.gupta
@dave- calculation mistake on my part - method is right. getting 17/18 only thanks anyways. On Aug 9, 6:26 pm, Dave wrote: > @Arun: The probability of getting a head on the first toss is > 1/5 * 1 + 4/5 * (1/2) ) = 3/5, > while the probability of getting 2 consecutive heads is > 1/5 * 1 + 4/5 *

[algogeeks] Re: Probability Puzzle

2011-08-09 Thread arpit.gupta
ans is 16/17 + 1/2*1/17 = 33/34 On Aug 7, 10:34 pm, Algo Lover wrote: > A bag contains 5 coins. Four of them are fair and one has heads on > both sides. You randomly pulled one coin from the bag and tossed it 5 > times, heads turned up all five times. What is the probability that > you toss next

[algogeeks] Re: Probability Puzzle

2011-08-09 Thread arpit.gupta
it is (1/5)/( (4/5 *(1/2)^6) + (1/5 * 1)) = 80/85 = 16/17 On Aug 7, 10:54 pm, Nitish Garg wrote: > Should be (4/5 *(1/2)^6) + (1/5 * 1) = 17/80 -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@g

[algogeeks] Re: Sequence Puzzle 13april

2011-04-14 Thread arpit.gupta
3 1 2 2 1 1 1 3 1 1 2 2 2 1 On Apr 13, 12:32 pm, Lavesh Rawat wrote: > * Sequence Puzzle > > The below is a number puzzle. It should be read left to right, top to > bottom. > Question 1 What is the next two rows of numbers. > Question 2 How was this reached. > 1 1 > 2 1 > 1 2 1 1 > 1 1 1 2 2 1 >

[algogeeks] Re: 11april

2011-04-11 Thread arpit.gupta
one word On Apr 11, 12:58 pm, Lavesh Rawat wrote: > * New Door Puzzle > > Rearrange the letters in 'new door' to make one word. I will only accept 1 > answer. > * > *Update Your Answers at* : Click > Here > > Solution: > Wil

[algogeeks] Re: 30march

2011-04-01 Thread arpit.gupta
Very Very simple problem !!! On Mar 30, 1:22 pm, Lavesh Rawat wrote: > *Fishing Problem * > * > *Two fathers and two sons went for fishing. Each of them caught a fish, and > none of them caught the same fish. However, they caught a total of only > three fish. How is this possible? > > Update Your

[algogeeks] Re: Google puzzles

2011-03-17 Thread arpit.gupta
ans is n=6, m=36; m= n + (n*7/6 + (n-1)) + ((n*7/6 + (n-1))*7/6 + n-2) +.. now n must be a multiple of 6. taking n=6, we get the answer m= 36 On Mar 16, 3:27 pm, "may.I.answer" wrote: > In a sports contest there were m medals awarded on n successive days > (n > 1). >    1. On the first day 1

[algogeeks] Re: A Billion Number Question

2011-03-17 Thread arpit.gupta
read the first no. . now ans= first no +1; if now ans is encountered while reading the next nos. add 1 to ans. i.e. ans++; On Mar 17, 2:18 am, bittu wrote: > Given an input file with four billion integers, provide an algorithm > to generate an integer which is not contained in the file. Assume

[algogeeks] BYTES - online coding event

2011-02-19 Thread arpit.gupta
DELHI COLLEGE of ENGINEERING , online coding competition Bytes-The Online Coding Competition will be on 19 Feb 2011. TIME : 9:00 p.m. https://www.spoj.pl/BYTES11B/ Every participant should have an id at www.spoj.pl -- You received this message because you are subscribed to the Google Groups "A

[algogeeks] ONLINE CODING COMPETITION

2011-02-19 Thread arpit.gupta
DELHI COLLEGE of ENGINEERING , online coding competition Bytes-The Online Coding Competition will be on 19 Feb 2011. The event will be of 2 rounds: * First Time slot: 6pm - 8pm * Second Time slot: 9pm - 11pm Every participant should have an id at www.spoj.pl The winner will be decided from the