Y’know those times when you are sitting in class thinking “Boy this is stupid. I’ll never need to know this… it’s not like someone is ever going to ask me in an interview ‘please list the Big-Oh time of the following operations for each of these data structures.'”
Well, yesterday in my interview the guy asked me “Please write the Big-oh time of the insert, delete and lookup operations in the following three data structures, and discuss the benefits and weaknesses of each representation.”
What I’m thought: “You’ve gotta be $%*&ing kidding me.”
What I said: “You’ve gotta be kidding me.”
Fortunately, I took CSC 225 3 times (C, C+, B; I needed a B-) and I was able to answer the question ok.