Friday·10·February·2006
A question one might ask at a technical interview:
Explain how high volume and a load-balanced environment can affect one’s coding approach.
My answer would be
- one might resort to caching of data (perhaps with Memcached, perhaps with Memoized).
- one might cache database handles (with Apache::DBI) or try to pool them
- one might create static content as much as possible and certainly be sure to have Apache serve all parts of a page which are static such as images.
- one might replicate the database
- Given a text file with a full name on each line, print the 10 most common last names in the file… also do this in SQL.
- what does use strict do
- what variable controls inheritance in Perl
- a sub that modifies a hashref - trick question: they made a copy of the hashref in the modifying sub
- parse a URL
- simple INNER JOIN
- composite indexing question
- how to check if a slave is up
- hOW TO to see which processes heavy
- how to see disk activity
- How to see disk usage?
- how to check if apache is up?
- Design a couple of pages for a yearbook website
// show without comments // write a comment // Trackback URL
Monday·30·January·2006
MySQL in-depth: Architecture Type Questions
- What is the lost update problem and how does MySQL solve it?
- What is a deadlock? Does it happen with a SQL approach to the lost update problem?
- How can you solve it without logical units of work?
- Discuss relation normalization and denormalization
- What is a primary key and for InnoDB tables discuss how the physical ordering of data relates to the primary key
// show without comments // write a comment // Trackback URL
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.// show without comments // write a comment // Trackback URL
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!
// show without comments // write a comment // Trackback URL
My second technical test at IMDB
- If a
SELECTis running too slowly how would you debug it? - why not index a bunch of individual fields in a database
Class::DBIiterators - how are they implemented? Are they efficient?- how does CDBI differ from other
DBIx::* - least favorite Perl feature
- what are you going to learn next about Perl?
// show without comments // write a comment // Trackback URL
Wednesday·11·January·2006
Perl competency test (imdb)
I took a small but good competency test when interviewing at imdb.
The cvs module name is imdb-perl-test and it
should be available via viewcvs in 3 hours.
Ah here
it is
// show without comments // write a comment // Trackback URL
Saturday·07·January·2006
Perl SQL competency test (sdc)
I took a small but good competency test when interviewing at a small
but good company here in Los Angeles :). It only had one
Perl question and one SQL question and I was lucky to get the SQL
question right.
The cvs module name is perl-sql-competency-test and it
should be available via viewcvs in 3 hours.
// show without comments // write a comment // Trackback URL
Terrence Brannon
Matthew Sisk
