テック クリ Tech Kuri

Geeky reflections

Friday, September 14, 2007

An interesting puzzle

Stack Growth : How would you find out if a machine’s stack grows up or down in memory?

I found this person's solution quite interesting..

Labels: puzzle

posted by kuri* at 8:57 PM | 0 comments

Links

  • main blog
  • manga reviews
  • frivolous blog
  • my site is partially back up

Previous Posts

  • new posts will be at tokyokuri
  • A japanese archiving tool
  • An interesting puzzle
  • extreme programming, kind of
  • an article on unicode
  • debugging your java classpath
  • practice test take 1
  • Programming is so much fun
  • seeking wireless headset recommendations
  • Japanese text editor

Archives

  • August 2005
  • September 2005
  • October 2005
  • November 2005
  • December 2005
  • January 2006
  • February 2006
  • March 2006
  • April 2006
  • May 2006
  • June 2006
  • August 2006
  • September 2006
  • January 2007
  • April 2007
  • May 2007
  • June 2007
  • July 2007
  • August 2007
  • September 2007
  • February 2008
  • April 2008

Powered by Blogger