It looks like you're new here. If you want to get involved, click one of these buttons!
Tonight on GeekNights, we talk about all the different jobs we've each had over the years. Do-nothing jobs, fake jobs, shady jobs: every job. In other news, we're going to go see The Hateful Eight in the correct format, our string of train stories continues, and "hoverboards" are bad news.
The November Q&A Special is up for our Patrons, we'll be live at PAX South 2016, and the original GeekNights T-Shirt is back on the shelves!Download MP3
Elementary school: helping mom sell socks and beanie babies at the flea market... for $ to spend on video games at the flea market.
Middle/High school: working at the family business either turning socks or minding the shop.
College: Delivering the student paper out of my car 1/week. Odd hours as a statistics/algebra/physics tutor, which in retrospect is probably the most important job experience of my life that remains relevant today.
Post-graduation: My first office job writing code with the company that I've been with for the past seven years.
I get it now, way more than when I was a punk kid. There's not a lot of money in that banana stand...
Kate and I have been howling at you two goobers to read the Maddadam trilogy for a while now. Post-apocalyptic, character driven series that's expertly written and interesting.
Oryx & Crake
The Year of the Flood
Read them already, goddamnit.
I also heard that The Handmaid's Tale is good stuff too.
Avoid Cat's Eye. It's garbage.
The whole IT / CS hiring thing is still confounding to me, as the majority of questions are data structures and algorithms for all jobs rather than just the jobs that need you to do this kind of stuff every day.
For example want a job at a bank in the IT department? Do these algorithm questions which I'm going to read out of a book in a certain big O complexity. However on the job all you're going to be doing is writing the bank's website and possibly mobile apps plus database work.
Speaking in CS terms, regular expressions correspond to problems solvable by a finite automaton. Regular expression engines typically have features (e.g. backreferences) a DFA cannot solve. Usually these require a PDA (push-down automaton. Because it has a stack).
People are bitching that almost all of them are on the East Coast.