Comments for /home/spsneo/blog

Comment on The Advantages of Looking Stuff Up by Kshitiz

Kshitiz — Thu, 27 Oct 2011 04:00:21 +0000

New theme! Clean!!

Comment on GRUB Tutorial for Beginners by GRUB | Warren Tang's Blog

GRUB | Warren Tang's Blog — Sun, 15 May 2011 14:35:46 +0000

[...] Boot with GRUB http://www.linuxjournal.com/article/4622 GRUB Tutorial for Beginners http://spsneo.com/blog/2008/07/20/grub-tutorial/ How to install GRUB on the MBR [...]

Comment on How to install Pintos on QEMU by Priyank

Priyank — Sun, 17 Apr 2011 12:00:31 +0000

Hello all!

If you are getting the ‘Cannot find kernel’, then go to the “~/pintos/src/threads/build” and then run the command.

Also, os.dsk wsa not found anywhere and it didn’t affect anything .

Comment on Perplexing Probability – Things are not always obvious by kageiit

kageiit — Wed, 19 Jan 2011 06:12:16 +0000

you think too much

Comment on Perplexing Probability – Things are not always obvious by spsneo

spsneo — Tue, 18 Jan 2011 00:55:29 +0000

@Nipun

Yeah yeah, I forgot to mention that matches are independent. Its a totally hypothetical series.

Comment on Perplexing Probability – Things are not always obvious by Nipun

Nipun — Mon, 17 Jan 2011 19:43:47 +0000

If matches are independent (!), then S-I-S is better then I-S-I by a factor of:
(2-P(India wins away))/(2-P(India wins at home))

Conditional probability will introduce too many variables

Comment on What’s wrong with binary search! by Satyajeet

Satyajeet — Thu, 13 Jan 2011 18:48:14 +0000

@Nipun,

There is bug in your solution.
It wudn’t work when both low and high are odd numbers.

let’s say: low = 3 and high = 7
mid should be (3 +7)/2 = 5. I mean (3 + 7) >> 1

A/c to ur solution:

mid = 3/2 + 7/2 = 1 + 3 = 4 (wrong)

Comment on What’s wrong with binary search! by Satyajeet

Satyajeet — Thu, 13 Jan 2011 18:31:27 +0000

Really a nice bug that we generally miss it.

Thanx for pointing it out..:)

Nice point:-
A bug can exist for half a century despite our best efforts to exterminate it. We must program carefully, defensively, and remain ever vigilant.

Comment on What’s wrong with binary search! by spsneo

spsneo — Thu, 13 Jan 2011 11:37:03 +0000

@Nipun

Google Research blog suggested a better way (one sum and one shift).

Comment on What’s wrong with binary search! by Nipun

Nipun — Thu, 13 Jan 2011 11:22:41 +0000

Apparently

mid = lo/2 + hi/2;

would be more more efficient (two shifts, one sum)