As for integer sort and binary search, I know very few programmers who would do this from memory in 30 minutes. Most I know (yes, outside my workplace too...) would use libraries as appropriate, and use references. I understand what you're saying about it being something of an indicator about "teachability"... but I think if there was a really good test for capabilities that fit well across the entire "programming marketplace" then none of this thread would be needed :)
Joseph, have you been enrolled in CS programs anywhere else? My experience is limited but better than the majority of students who went through a 4-year track right out of high school -- I started as EE at PSU back east, then took some time, then enjoyed LCC a bit before wrapping up the BS at UO in '01. I almost went to CWRU and/or CMU, too snooty for my tastes though.
I'm sure others have feedback on this issue. For the disinterested, my apologies for a distinct lack of 'nix content... I've been helping out a bunch of folks who are slightly younger than myself, who don't have any collegiate degrees, who are perfectly capable and very interested in doing good work... and to some of them I've been advising avoiding a BS program. For some, I think it is worthwhile.
all the best,
Ben
PS - one other note: I did work too hard in the CS-BS program, but I did well and got involved in a number of independent projects as well as some professor-led research as well as uniue offerings in coursework (if you're in a university, watch out for the unusual classes including seminars and sitting in on grad-level classes). My opinion of the best collegiate opportunity hovers around getting the most broad exposure... that way you can figure out what you like and also know a little about a lot :)
1
On 2/12/06, T. Joseph CARTER <[EMAIL PROTECTED]> wrote:
On Sun, Feb 12, 2006 at 08:23:52PM -0800, Ben Barrett wrote:
> Joseph, I don't know what years you tested this... I went thru UO's BS in
> Java, but we did have to produce LISP, Scheme, ML, MIPS, etc.
> However, I met business dual-majors who found ways to slip through without
> producing any code at all, which I find most telling.
>
> Does this all fit with your experience at UO, or did I "work too hard"? ;)
You probably worked too hard. It's possible to go through the UO program
without ever using anything like LISP/Scheme from what I can tell. I'm
not an active participant in the UO CS programs, but I've met one too many
seniors who haven't got two neurons to rub together to have any faith in
the BS degree.
Were I still in the field, I would probably still use the same test: Here
is a compiler. You have 30 minutes. Produce a working integer sort and
binary search. If you can do that, you can be trained to do something
useful. If you cannot, go back to school.
...
_______________________________________________ EUGLUG mailing list [email protected] http://www.euglug.org/mailman/listinfo/euglug
