Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister

Re: Resume Beef

by clemburg (Curate)
on Feb 27, 2002 at 13:19 UTC ( #147889=note: print w/replies, xml ) Need Help??

in reply to Resume Beef

In general, I seem to be thinking about problems like solving the 8 queens problem or rubix cubes or somesuch, both of which are good problems, but don't really display a wide range of skills. Any problem ideas from/for my fellow monks?

No, but a better suggestion: find some open source project you are interested in, and start to contribute. This will be a much better indicator of real-life skills for a future employer than solving some more-or-less artificial mini problems.

There are many skills you need as a programmer, and solving problems like the 8 queens problem or rubix cubes is just one of them.

By participating in an open source effort, you demonstrate a broad range of skills, all directly relevant to real-life work. And of course, your effort will be much more useful for others.

Christian Lemburg
Brainbench MVP for Perl

Replies are listed 'Best First'.
Re: Re: Resume Beef
by grep (Monsignor) on Feb 28, 2002 at 03:31 UTC

    I have to whole-heartedly agree with contributing to OSS, and I would also include perlmonks in your list of professional organizations. I say this because I have just hired a monk mainly based on his/her contributions to perlmonks and OSS.

    Postings on perlmonk not only reveal your talent, but also (to a small degree) how you work with others. So if you are proud of your posts - Use Them.

    Sorry I can't tell you who

    grep> grep clue /home/users/*

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (1)
As of 2021-10-23 05:59 GMT
Find Nodes?
    Voting Booth?
    My first memorable Perl project was:

    Results (87 votes). Check out past polls.