News for hackers. Stuff that matters.
Re: B-Trees - Balanced Search Trees for Slow Storage by noodle on Monday July 07, 2008 @11:53AM (#238725)
yes, i know. my point is, try finding an entry-level position that requires knowledge and experience of b-trees and not hashtables.
Re: B-Trees - Balanced Search Trees for Slow Storage by cdr on Monday July 07, 2008 @12:33PM (#238776)
Like a lot of things, it's good to know for the interview but most likely useless after that.
Re: B-Trees - Balanced Search Trees for Slow Storage by lampy on Monday July 07, 2008 @12:39PM (#238780)
Try finding a senior-level engineering position that doesn't require knowledge of B-trees or similar computer science topics.
Re: B-Trees - Balanced Search Trees for Slow Storage by Tamerlin on Monday July 07, 2008 @12:47PM (#238792)
So far in my experience the companies hiring want you to know that sort of thing, but that knowledge is largely wasted at most jobs.
Re: B-Trees - Balanced Search Trees for Slow Storage by Tamerlin on Monday July 07, 2008 @12:46PM (#238790)
Knowing what a binary tree is turned out to be overkill for even most of the senior developer positions I've had.