Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much

Re^2: Certifications are dumb.

by amarquis (Curate)
on Apr 09, 2008 at 12:43 UTC ( #679229=note: print w/replies, xml ) Need Help??

in reply to Re: Certifications are dumb.
in thread Certifications are dumb.

I think instead of not doing interviews, if you were encountering the problems you mention, would be to get better at interviewing. Interviewing is not about asking "How good are you at X? How good are you at Y?" You are trying to gather a lot of different information:

  • Is this person's long term goals consistent with my goals for the position?
  • How well does the candidate communicate?
  • Personally, I like to ask what the person has been doing to improve their skills, on their own. Reading books? Working on an open source or their own project?
  • Will this person fit in with my team, and the company at large?

Amongst other things unrelated to "How well you know X."

The best tip though, is to hire physicists. They're cheaper, sexier, smarter,...

Sexier and smarter, certainly, but I don't know about cheaper. Maybe better to say "a better value"? :)

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://679229]
[LanX]: all combinations with same amount of left and right?
[Eily]: if you want to store in a structure with the coordinates as key, arrays might do, since the keys are going to be 0..n
[LanX]: (Pascale path)
[Eily]: paths like that
[Discipulus]: yes Eily++ (very keen) I want to integrate my project with a 17th experiments. I want to colorize in sequence all paths
[oiskuu]: Yeah, modifry the recursive func combinations() to return not the number, but the paths themselves.
[Eily]: Discipulus I'd do that by starting from the bottom node I think. That way it can inherit the paths from the two nodes above (and so on, recursively)
[LanX]: oh I meant fixed amount
[LanX]: every path must have l left and r right edges and l and r are fixed and l+r is the height
[LanX]: simple recursive function which goes left and right till l or r are exhausted

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (10)
As of 2018-03-19 11:19 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (239 votes). Check out past polls.