Really not one to make comment but this one pulled on my goatee
On Tue, Aug 28, 2012 at 9:50 PM, Simon Wistow si...@thegestalt.org wrote:
On Tue, Aug 28, 2012 at 08:41:14PM +0200, Joel Bernstein said:
It's a red flag of lack of clue if a prospective employer tries to use
this to weed out
On Tue, Sep 04, 2012 at 01:03:22PM +0100, Mr I wrote:
You're not testing the candidates knowledge of maths you're testing their
knowledge of programming.
If the candidate doesn't ask what happens when n is less than 2, he
may be a passable maintenance programmer but he's not someone I'd hire
to
On Tue, Sep 4, 2012 at 1:13 PM, Roger Burton West ro...@firedrake.orgwrote:
On Tue, Sep 04, 2012 at 01:03:22PM +0100, Mr I wrote:
You're not testing the candidates knowledge of maths you're testing their
knowledge of programming.
If the candidate doesn't ask what happens when n is less than
On 4 Sep 2012, at 13:26, Mr I cub4u...@gmail.com wrote:
If the candidate doesn't ask what happens when n is less than 2, he
may be a passable maintenance programmer but he's not someone I'd hire
to have any sort of responsibility.
Again your assumptions are on knowing about the fibonacci
On Tue, Sep 04, 2012 at 01:26:46PM +0100, Mr I wrote:
Again your assumptions are on knowing about the fibonacci sequence. So a
candidate that does not know the fibonacci sequence but identifies a
possible flaw in the question can only be a maintenance programmer?
No, the question needs zero
On Tue, Sep 04, 2012 at 01:26:46PM +0100, Mr I wrote:
Again your assumptions are on knowing about the fibonacci sequence. So a
candidate that does not know the fibonacci sequence but identifies a
possible flaw in the question can only be a maintenance programmer?
The question contains a
On 4 Sep 2012, at 13:48, Mr I cub4u...@gmail.com wrote:
You do not want to be assessing their knowledge of mathematics. You want to
be assessing their programming acumen
And the fib() test, regardless of whether you know what the Fibonacci sequence
is or are simply looking at the definition
Quoting Mr I cub4u...@gmail.com:
Consider the example I gave. How will you approach that? I bet you'd
approach completely differently if you KNEW vedic mathematics.
Your example said:
write a function ved(n, m) that implements the 16 sutras* and uses
them to return the result
That's not
On Tue, 04 Sep 2012 14:48:01 +0200, Mr I cub4u...@gmail.com wrote:
You do not want to be assessing their knowledge of mathematics. You want
to be assessing their programming acumen
I'd argue that programming *is* mathematics, in some sense.
--
Cosimo
On 4 September 2012 14:17, Dave Cross d...@dave.org.uk wrote:
Quoting Mr I cub4u...@gmail.com:
Consider the example I gave. How will you approach that? I bet you'd
approach completely differently if you KNEW vedic mathematics.
Your example said:
write a function ved(n, m) that implements
I remember meeting someone who knew what the sequence was but forgot the
name.
Ended up calling it the Fettucini sequence.
Bonus points.
-- vish
On 4 September 2012 14:12, Piers Cawley
pdcawley-london.0dd...@bofh.org.ukwrote:
On 4 September 2012 14:17, Dave Cross d...@dave.org.uk wrote:
I agree with you.
It is not to much to expect a question / answer like (2). Hopefully you'd
reward such an answer with more than 'maintenance' work :)
On Tue, Sep 4, 2012 at 1:44 PM, Roger Burton West ro...@firedrake.orgwrote:
On Tue, Sep 04, 2012 at 01:26:46PM +0100, Mr I wrote:
Again your
On 4 September 2012 14:12, Piers Cawley
pdcawley-london.0dd...@bofh.org.uk wrote:
On 4 September 2012 14:17, Dave Cross d...@dave.org.uk wrote:
Can you not see the difference? It doesn't matter that it's a well-known
mathematical sequence. The required behaviour has been specified in the
And besides, I don't think I'd really want to work with a programmer
who
didn't know what the Fibonacci sequence is :-)
I dunno. Think of the teaching opportunities :)
My concern would be, given that interviews are already a fairly stressful
situation, that the developer familiar
On 4 September 2012 14:27, Jasper jaspermcc...@gmail.com wrote:
On 4 September 2012 14:12, Piers Cawley
pdcawley-london.0dd...@bofh.org.uk wrote:
...
Or, in an attempt to really drive it home:
blarg(n) is equal to blarg( n - 1 ) * 2 + blarg( n - 2 )
There you go. Not the Fibonacci
On Mon, Sep 03, 2012 at 11:36:58AM +0100, David Hodgkinson wrote:
On 31 Aug 2012, at 12:16, Rick Deller r...@eligo.co.uk wrote:
Can anyone suggest more books or another way of doing it ?
STFUAWSC.
That's a good way to get started - my first perl code was patches to
make Matt's Script Archive
On Tue, 2012-09-04 at 14:31 +0100, Matt Freake wrote:
For that reason, I would have thought there were other, better, recursion
problems out there I could use.
Tower of Hanoi? :)
Quoting David Cantrell da...@cantrell.org.uk:
On Mon, Sep 03, 2012 at 11:36:58AM +0100, David Hodgkinson wrote:
On 31 Aug 2012, at 12:16, Rick Deller r...@eligo.co.uk wrote:
Can anyone suggest more books or another way of doing it ?
STFUAWSC.
That's a good way to get started - my first perl
On 4 Sep 2012, at 13:26, Mr I wrote:
On Tue, Sep 4, 2012 at 1:13 PM, Roger Burton West ro...@firedrake.orgwrote:
It's equivalent to asking you to write a function ved(n, m) that
implements
the 16 sutras* and uses them to return the result. A task that maybe
easily
done by many an
On Tue, Sep 04, 2012 at 02:31:22PM +0100, Matt Freake wrote:
My concern would be, given that interviews are already a fairly stressful
situation, that the developer familiar with Fibonacci is immediately put at
ease.
You are aware, I trust, that the whole point of an interview is to be
On 4 September 2012 14:38, Will Crawford billcrawford1...@gmail.com wrote:
On 4 September 2012 14:27, Jasper jaspermcc...@gmail.com wrote:
On 4 September 2012 14:12, Piers Cawley
pdcawley-london.0dd...@bofh.org.uk wrote:
...
Or, in an attempt to really drive it home:
blarg(n) is equal
On 4 September 2012 14:41, Dominic Humphries d...@thermeon.com wrote:
On Tue, 2012-09-04 at 14:31 +0100, Matt Freake wrote:
For that reason, I would have thought there were other, better, recursion
problems out there I could use.
Tower of Hanoi? :)
Tower of Hanoi (with a proper description
Quoting Jasper jaspermcc...@gmail.com:
On 4 September 2012 14:38, Will Crawford billcrawford1...@gmail.com wrote:
On 4 September 2012 14:27, Jasper jaspermcc...@gmail.com wrote:
On 4 September 2012 14:12, Piers Cawley
pdcawley-london.0dd...@bofh.org.uk wrote:
...
Or, in an attempt to really
Piers Cawley writes:
Tower of Hanoi is always a better example for solving with recursion
than the fibobloodynacci sequence. If nothing else, the recursive
solution isn't quite so immediately obvious from the problem, the
terminating condition is obvious and an iterative solution isn't quite
On 04/09/2012 15:03, David Cantrell wrote:
You are aware, I trust, that the whole point of an interview is to be
discriminatory?
Discrimination is probably too evocative a word :-)
Also an good interview is a two way exchange on info.
Jacqui
On 4 Sep 2012, at 16:07, Smylers smyl...@stripey.com wrote:
Piers Cawley writes:
Tower of Hanoi is always a better example for solving with recursion
than the fibobloodynacci sequence. If nothing else, the recursive
solution isn't quite so immediately obvious from the problem, the
On 4 Sep 2012, at 15:04, Dave Cross wrote:
Quoting David Cantrell da...@cantrell.org.uk:
[...]
But it's only a good way to get started. At some point you're better
off learning from someone else. Dave Cross is a good someone else.
*blush*
Well, I hear nothing but good feedback from people
On Tue, Sep 04, 2012 at 05:18:20PM +0100, David Hodgkinson wrote:
When was the last time you recursed in day to day web type code?
Within the last month.
crawling ?
xml parsing ?
json printing of structures ?
-- vish
On 4 September 2012 17:18, David Hodgkinson daveh...@gmail.com wrote:
On 4 Sep 2012, at 16:07, Smylers smyl...@stripey.com wrote:
Piers Cawley writes:
Tower of Hanoi is always a better example for solving with
On 09/04/2012 08:03 AM, Mr I wrote:
I've literally had people who were Senior programmers (whatever that
means) who, when given the instructions Given that fib(n) is equal to
fib(n-1) + fib(n-2) write a fib function in any language didn't even
get to the
sub fib {
my $n = shift;
On 4 September 2012 17:18, David Hodgkinson daveh...@gmail.com wrote:
On 4 Sep 2012, at 16:07, Smylers smyl...@stripey.com wrote:
Piers Cawley writes:
Tower of Hanoi is always a better example for solving with recursion
than the fibobloodynacci sequence. If nothing else, the recursive
On 09/04/2012 09:20 AM, Avishalom Shalit wrote:
I remember meeting someone who knew what the sequence was but forgot the
name.
Ended up calling it the Fettucini sequence.
Bonus points.
told that to my wife and she just about snorted pasta out of her nose!
she didn't know the name fibonacci
On 09/04/2012 09:41 AM, Dominic Humphries wrote:
On Tue, 2012-09-04 at 14:31 +0100, Matt Freake wrote:
For that reason, I would have thought there were other, better, recursion
problems out there I could use.
Tower of Hanoi? :)
but at least 20 disks and it has run before the interview is
On 4 Sep 2012, at 17:24, Roger Burton West ro...@firedrake.org wrote:
On Tue, Sep 04, 2012 at 05:18:20PM +0100, David Hodgkinson wrote:
When was the last time you recursed in day to day web type code?
Within the last month.
I meant normal people.
On Tue, Sep 4, 2012 at 9:18 AM, David Hodgkinson daveh...@gmail.com wrote:
When was the last time you recursed in day to day web type code?
A few weeks ago.
It's a flawed premise in any case. There's plenty of techniques and
ideas professionals don't make routine use of but you'd be pretty
On 09/04/2012 12:05 PM, Jacqui Caren wrote:
On 04/09/2012 15:03, David Cantrell wrote:
You are aware, I trust, that the whole point of an interview is to be
discriminatory?
Discrimination is probably too evocative a word :-)
Also an good interview is a two way exchange on info.
i said that
On 09/04/2012 12:18 PM, David Hodgkinson wrote:
On 4 Sep 2012, at 16:07, Smylers smyl...@stripey.com wrote:
Piers Cawley writes:
Tower of Hanoi is always a better example for solving with recursion
than the fibobloodynacci sequence. If nothing else, the recursive
solution isn't quite so
Piers Cawley pdcawley-london.0dd...@bofh.org.uk wrote
On 4 September 2012 14:41, Dominic Humphries d...@thermeon.com wrote:
On Tue, 2012-09-04 at 14:31 +0100, Matt Freake wrote:
For that reason, I would have thought there were other, better, recursion
problems out there I could use.
On Tue, Sep 4, 2012 at 9:59 AM, Chris Jack chris_j...@msn.com wrote:
I haven't yet had a problem which I felt was worthwhile of a memo-ized
solution - but that might just be indicative of the sort of perl work I do.
While memoization is a perfect fit for this solution a) the ability to
spot
On 04/09/12 17:23, Peter Corlett wrote:
On 4 Sep 2012, at 15:04, Dave Cross wrote:
Quoting David Cantrell da...@cantrell.org.uk:
[...]
But it's only a good way to get started. At some point you're better
off learning from someone else. Dave Cross is a good someone else.
*blush*
Well, I
On Tue, Sep 04, 2012 at 05:05:21PM +0100, Jacqui Caren wrote:
On 04/09/2012 15:03, David Cantrell wrote:
You are aware, I trust, that the whole point of an interview is to be
discriminatory?
Discrimination is probably too evocative a word :-)
Why d'you think I used it? :-)
--
David Cantrell
On Tue, Sep 04, 2012 at 05:18:20PM +0100, David Hodgkinson wrote:
On 4 Sep 2012, at 16:07, Smylers smyl...@stripey.com wrote:
Piers Cawley writes:
Tower of Hanoi is always a better example for solving with recursion
than the fibobloodynacci sequence. If nothing else, the recursive
On Tue, Sep 04, 2012 at 03:04:06PM +0100, Dave Cross wrote:
Quoting David Cantrell da...@cantrell.org.uk:
But it's only a good way to get started. At some point you're better
off learning from someone else. Dave Cross is a good someone else.
*blush*
Envelope full of used banknotes in the
On Tue, Sep 04, 2012 at 10:22:47AM -0700, Paul Makepeace wrote:
If you're working in the web and haven't added memcached to something,
that would strike me as surprising.
It is worryingly common to have not used it or anything like it, and to
not even know that it exists.
--
David Cantrell |
Hi,
I've set this mailing list to moderate all postings. I'll switch it
back to normal in due course.
I hope to see many of you in the pub on Thursday for the usual
enthusiastic, interesting discussion about Perl and (un?)related chat.
Tom
On Tue, Sep 04, 2012 at 08:09:02PM +, Tom Hukins wrote:
I've set this mailing list to moderate all postings. I'll switch it
back to normal in due course.
For those who don't already know, this means I, or another moderator,
will filter what shows up on this list for now. If we reject your
On 05/09/2012, at 2:40 AM, David Hodgkinson wrote:
On 4 Sep 2012, at 17:24, Roger Burton West ro...@firedrake.org wrote:
On Tue, Sep 04, 2012 at 05:18:20PM +0100, David Hodgkinson wrote:
When was the last time you recursed in day to day web type code?
Within the last month.
I
47 matches
Mail list logo
