8 ms·
As someone who might apply once I get my PhD, what does basic CS knowledge mean for you? Like what a tree is or fizzbuzz? Hopefully it isn't that terrible...how
by noobermin 10y ago
As someone who might apply once I get my PhD, what does basic CS knowledge mean for you? Like what a tree is or fizzbuzz? Hopefully it isn't that terrible...how someone can make it through any amount of CS related schooling and not know the basics?
Somewhat related anecdote, I do computational physics. I once attended "training seminar[0]" put on by the funders for using DOD supercomputers, and there was this soon-to-be-minted computer science PhD student who was also an intern. Most of the systems have pbs[1], a batch system that prioritizes jobs from users based by amount of requested time, number of nodes, etc. The seminar leader (and I have before) referred to it loosely as a queue, because it sort of is, and the CS guy kept interrupting the talk (may be two or so times) to point out that PBS really wasn't a "queue" because it didn't respect FIFO in a strict sense... I mean, sure, he did know what a queue was, but I'm pretty sure that isn't the most interesting problem you could have.
[0] there was one fact I found useful, which was where to find their docs online. Other than that, it was the sort of stuff you can find by just reading man pages and such. Waste of time but checked off a box for the internship which made the funders happy, I suppose.
[1] https://en.wikipedia.org/wiki/Portable_Batch_System https://en.wikipedia.org/wiki/Portable_Batch_System
- arcanus 10y agoWeird. No one else would want a scheduler to be FIFO, either. Rather, the actual optimization that is performed by slurm, pbs, etc. under the hood is pretty interesting. The point of schedulers is much more complicated than a straightforward queue, as they seek to project how best to utilize system resources into the future. Strange he would be so pedantic. Everyone in HPC certainly does call it a queue, as you noted.
- conjectures 10y agoYeah, because it is a queue in the ordinary English sense.
- dekhn 10y agoCommon problem with programmers: when they learn a term means something, they associate that term absolutely with that meaning (common in other fields with people who are highly analytical, IME). The HPC people are referring to a "job queue", rather than a "ADT queue". Those are distinct things, the ADT queue is a much more restrictive defintion, but it's not an exclusive one. HPC queues are more like priority queues with complex ranking functions (and queues of queues), just like real-life queues where people can cut by paying more money (first class airline ticket).
- ng12 10y agoAnecdotally, I've learned to expect nothing. I used to ask a graph-based question -- I had to adjust it so that the first step was doing a dead-simple DFS. This tended to weed out a good sixth of candidates and save us both a lot of time. And this was pretty constant against education level and background.
- somedangedname 10y agoDFS == Depth First Search?
- ng12 10y agoYeah, given an acyclic graph print out each node's value. Passing candidates generally got it in five minutes.
- jnordwick 10y agoSometimes I get these questions in interviews and I really don't know if I should be offended. My resume is pretty good, and I wonder who T.F. applies to these places that they have to have such simple weeder questions. Then I get all paranoid that there is some hidden complication and soon I'm producing FizzBuzz in TensorFlow: http://joelgrus.com/2016/05/23/fizz-buzz-in-tensorflow/ http://joelgrus.com/2016/05/23/fizz-buzz-in-tensorflow/
- vacri 10y agoI think you shouldn't be offended at interview questions around skill unless you've been on the other side of the table. It's eye-opening, the range of people that apply for these positions.
- sheeshkebab 10y agowas writing DFS from scratch ever needed to perform dev job or was it a thing that stumped 95% of applicants (and let you read some hacker news/email on your phone/laptop in the mean time)?
- deleted 10y ago[deleted]
- skybrian 10y agoWell, for example, I have an interview question where it's not just about knowing what a stack or a tree is, but rather realizing that a stack or a tree might be useful to solve a particular problem. (You could use either one.) And then writing out code to do it. So, no esoteric data structures, but you really do have to know how to use the standard ones. It tends to trip up people who might have some book knowledge of CS but don't know how to apply what they learned. There's also a difference between knowing that a tree might be useful and being able to actually write some code to build a tree. But the thing is, the next interviewer will have different preferences - there's no standardization here.
- lawnchair_larry 10y agoIt could also be that you only ever have to do this between 0 and 0.00001% of the time in the real world, and many people who could do it just fine if they are given space to think about it or refresh their memory, which usually results in freezing up during a stressful interview. They probably haven't exercised that knowledge because they have been too busy building real things.
- microcolonel 10y agoThat seems like a lousy excuse to me. As a web developer, my entire job revolves around computing trees; and that is (as of now) the most common development environment in the world. My side projects (graphics demos/toys, a multiprocess text editor, various twilio SMS utilities, a high-performance pastebin server) end up using stacks, trees, hashmaps, and bloom hashes as logical responses to the problem descriptions. Only somebody who doesn't write software for a living would claim that "between 0 and 0.00001% of the time in the real world" should these techniques be readily accessible in working memory. As for "freezing up during a stressful interview": is that not some indication of what normal workplace stresses will do to your ability to complete technical work? I certainly wouldn't want to work with somebody who is knowledgeable but will wimp out the moment you ask them a tough question on the spot.
- roganartu 10y ago
- ap22213 10y agoIn the last two weeks I interviewed three candidates with masters of science C.S. None of the three knew the memory size in bytes of a double precision floating point variable. None of the three could explain scenarios in which they would use an array over a linked list.
- probably_wrong 10y agoI don't think that first question proves what you think it proves. Learning implementation details about a specific programming language is not what CS is supposed to be about (see the quote about astronomers and telescopes). In fact, if you use several programming languages at the time, I'd go as far as to call it a waste of my time - if I'm worried about overflow for a specific problem, I can get the range of data (in which programming language? which architecture?) in 30 seconds online. I can see it being a valid question if you are working in a problem down to the bit level. But those are getting rarer, and ultimately it's what an Engineer excels at. The second question does seem fair, though.
- scatters 10y agosizeof(double) is not specific to any one programming language or architecture; it's determined by IEEE 754, an international, cross-language, cross-platform standard. Non-IEEE floating-point implementations are exceedingly rare nowadays (although they do exist). You're right about it being engineering, not computer science, but IMO it's reasonable to expect someone applying to a programming job (assuming this is what it was) to have at least some software engineering experience.
- kirab 10y agoWell.. C and C++ offer a wide variety of arithmetic types. Double precision is not required by the standards (except by the optional annex F of C99, covering IEEE 754 arithmetic), but on most systems, the double type corresponds to double precision. However, on 32-bit x86 with extended precision by default, some compilers may not conform to the C standard and/or the arithmetic may suffer from double-rounding issues.
- nolok 10y ago> Like what a tree is or fizzbuzz? Hopefully it isn't that terrible...how someone can make it through any amount of CS related schooling and not know the basics? Ah! You're in for some surprise down the line. Fizzbuzz almost always clear out large amount of applicants.
- vacri 10y agoWe had another applicant just last week with a shiny spiral-bound resume that looked good, but couldn't do FizzBuzz.
- basseq 10y agoI was a CS major, but my career took a different direction, and I haven't programmed "professionally" for 8+ years. I looked up the FizzBuzz question and wrote some psuedocode in about 5m. It's sad that FizzBuzz is such a "weeding out" tool, but I guess good to know that I can still pass the first round of an entry-level technical interview!
- nolok 10y agoFizzBuzz (from the point of view of me as an interviewer) is not so much about knowing how to code, but understanding the thought process about basic problem solving. Read the instruction, provide a solution, don't over engineer. It also provides the basics, loop and conditional. Once you're set on that, you at least know you have a person in front of you who, on the basic level, thinks like a programmer. So I would say 8+ years doesn't matter so much and you shouldn't worry about that, as long as your mind can still "tick" the right way.