Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re^5: Stop with the interview questions already

by mojotoad (Monsignor)
on Nov 17, 2010 at 08:42 UTC ( [id://871957]=note: print w/replies, xml ) Need Help??


in reply to Re^4: Stop with the interview questions already
in thread Stop with the interview questions already

Not to nitpick too much, but...

Perhaps the only goal is to find out whether or not they know about shit-bifting, particularly if they'll be expected to optimize code on any sort of particular hardware.

There's another potential motive, however. And that is whether or not candidates understand how it's possible to model real systems using discreet mathematics -- particularly that subset of discreet mathematics bounded by such things as bit-width.

That Von Neumann was a real stinker.

Cheers,
Matt

P.S. Speaking of discreet systems. Ever tried to figure out whether or not two integral functions intersect or not (or how often)? Euclid had it figured out. It's useful for figuring out potential solutions for diophantine systems of functions.

  • Comment on Re^5: Stop with the interview questions already

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://871957]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others browsing the Monastery: (3)
As of 2024-04-24 23:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found