Stories
Slash Boxes
Comments
NOTE: use Perl; is on undef hiatus. You can read content, but you can't post it. More info will be forthcoming forthcomingly.

All the Perl that's Practical to Extract and Report

The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
 Full
 Abbreviated
 Hidden
More | Login | Reply
Loading... please wait.
  • Are you sure you're testing programming skill and not just test taking ability? I ask because I'm a really good test taker and I know how much that slants the odds. If you sat me down with a programming manual for a language I'd never touched I bet I could beat an average test taker with one year of experience in the language. Would that mean I'd be the better guy for the job? Probably not!

    Also, did you make them write it down on paper? I absolutely hate trying to program in pen. I've been tempted t

    • Actually, I think you probably would be better for the job. I'm a good test taker as well, but this is limited to the classic multiple choice tests where the elimination strategy works 80% of the time. The sort of test discussed here is a little different: if you can sit down with a manual of a language never seen and whip out a working and correct program then you can probably pick up everything you need about the language to get your job done. Yeah, you're missing idioms and other features you can really only get through experience, but it's a good bet you can pick those up quickly too.

      I agree 100% about pen/paper :-)

      • Well if that's the kind of programmer you want then you might as well test for it explicitely. You could create a manual for a fake computer language, give the applicant an hour or so to read it and then have them do a few test programs. This was actually done in my CS 202 class at college and it was the most fun I've ever had in a test.

        But I'm still really concerned that you'd be missing out on some fantastic programmers that have a different psychology.

        -sam

        • I can almost see your point, but the nature of the questions that we pose to candidates are so basic (e.g.: what's the potential performance impact of nested loops?) that I am very concerned about someone's inability to respond to them. In contrast, in the Perlmonks thread I started on this topic, someone mentioned writing a routine to go through a binary tree without recursion. While this was described as simple, I find that I encounter nested loops far more frequently than binary trees. I could easily