News for hackers. Stuff that matters.
Re:I will not do a tech interview by toomuchtodo on Wednesday August 21, 2013 @12:24PM (#6251416)
I hire people based on their ability to learn, not what they know.

If you're asking interview questions that can be googled in 20-30 seconds, you're wasting your time and theirs.

Re:I will not do a tech interview by hvs on Wednesday August 21, 2013 @01:27PM (#6251916)
You have a pretty low opinion of our field if you think everything that you need to know about our field can be googled in 20-30 seconds. I'm not arguing about minutia questions, but if you can't be bothered to understand how and why to optimize a database or the difference between TCP and UDP (really?) and that's what the job requires, then I don't want to hire you.
Re:I will not do a tech interview by toomuchtodo on Wednesday August 21, 2013 @03:18PM (#6252688)
My argument is don't play puzzles, don't ask stupid questions about "What does this command do with these flags?".

An interview should be the same as a discussion about concepts you'd have with a colleague. Does the person know the concepts? That's all that matters.

Re:I will not do a tech interview by bqe on Wednesday August 21, 2013 @01:32PM (#6251953)
Basic computer science knowledge (and yes, B-Trees qualifies) cannot be learned in 20 seconds. Most of this knowledge is actually a prerequisite to being able to search Google properly.
Re:I will not do a tech interview by toomuchtodo on Wednesday August 21, 2013 @04:07PM (#6252987)
Fair point. I was unfamiliar with B-Trees because most of my time is spent as DevOps/Networking/Sysadmin. It took me 15 minutes to learn and understand what they are and how they work.

http://slady.net/java/bt/view.php?w=800&h=600 http://en.wikipedia.org/wiki/B-tree http://en.wikipedia.org/wiki/B%2B_tree http://guide.couchdb.org/draft/btree.html

Now if you make understanding B-trees a prerequisite for the job, I can at least learn it ahead of time for the position.

Re:I will not do a tech interview by bobbbinsIII on Wednesday August 21, 2013 @01:58PM (#6252170)
how often does a normal software developer find himself in a situation where he has to know about B-Trees in depth?
Re:I will not do a tech interview by bqe on Wednesday August 21, 2013 @03:11PM (#6252640)
Basic computer science problems creep up often enough (about once a month) at my mostly normal job. We had to implement a prefix trie (specifically a modified radix trie with extra caching) to solve an interesting problem.

If you don't know about these data structures or algorithms, you won't even know where to look.

Re:I will not do a tech interview by dmatlack on Wednesday August 21, 2013 @02:33PM (#6252406)
When he works for the company that this whole conversation is stemming from.
Re:I will not do a tech interview by cheald on Wednesday August 21, 2013 @04:26PM (#6253102)
Database indexes are very frequently btrees; understanding how a btree works can inform how you structure and query data, resulting in substantially better software. They're also a generalization of the binary search pattern, which every programmer should be able to describe and utilize.