Jump to menu and information about this site.

Friday·20·January·2006

Garth’s test

sort

Sort these: ( [2005,6],[2005,8],[2004,2],[2002,12] ) (note: a good second question might be: what sort algorithm does Perl use and what alternatives are there)

iterator

write a sub that returns a closure, that when invoked, returns the successive elements of a passed-in array.

Artur’s test

The monk climbs the mountain from 6am to 6pm. And the next day while he is descending from 6am to 6pm, a priest climbs. The priest gets to the top at 6pm, which is the same time that the monk gets to the bottom.

Is there a time that they are ever at the same height?

I solved this equationally at shopzilla somehow. I solved it graphically at shopzilla. The next day, I realized, that the picture of someone going down the other side was a red herring: if I had only reflected the downward trip on the upward trip, I would have noticed that they would cross paths!

Sixapart is neck-deep in talent

  • Artur Bergman
  • Tatsuhiko Miyagawa
  • David Davis
  • wrote perlbal, mogilefs, memcached, gearman

My second technical test at IMDB

  1. If a SELECT is running too slowly how would you debug it?
  2. why not index a bunch of individual fields in a database
  3. Class::DBI iterators - how are they implemented? Are they efficient?
  4. how does CDBI differ from other DBIx::*
  5. least favorite Perl feature
  6. what are you going to learn next about Perl?

Perl Software Design Blog

About...

This is the weblog of the Perl Software Design Group.

Who We Are

Terrence Brannon
Matthew Sisk
Brock Wilcox
Gary Aston-Jones


Calendar

 2006 →
Months
Jan
 January 
Mo Tu We Th Fr Sa Su
           
20
         

Search


Advanced Search


Categories

Blogroll

People I know personally




Blogging Software Blogs