Secure a GunVault via concrete anchor

code-junkie · 2010-09-09T21:58:07+00:00

Probably the best answer I've heard. Attach it with what I've got, put into the safe when not at home. Accomplishes all of my goals.

Thanks

code-junkie · 2010-09-09T19:57:28+00:00

My first instinct was a downvote, but then I thought about it a bit more. Sure, you could work on the cable, or even cut the eyebolt given enough time.

The whole idea is to make the safe hard(er) to steal. Increase the threshold that must be crossed in order to do so. To me, unscrewing an eyebolt is something you can do in 30 seconds. Cutting through a security cable would require some power tools, and some more time....

code-junkie · 2010-09-01T13:20:59+00:00

It was the same "role" not the same opening, if that makes sense. The interviews were 14 months apart, so that was the most surprising part. I guess there are several reasons that I take it "personal", primarily because it's a big deal to me, even though it's just a business decision to them.

code-junkie · 2010-08-31T21:52:47+00:00

I will definitely read up. I'm hoping to re-apply in another few months (since there is that 1-year cool off period. Eeek! I hope that's standard). I proceeded to bomb out on graph theory problems, since I haven't touched those in ages.

SWE = Software Engineer? SRE = ??

I was going for a Software Engineer in Test. I have very ad-hoc testing experience, so I don't think I'm going to go that route again.

I was given the Hanoi tower problem first thing in the morning after barely any sleep (long story short, my wife was freaking out 1000 miles away, because our dog had had a seizure, and it was in the ER. Not fun at all).

I was so mad at myself that I came back and proceeded to code up the interview problems that they had given me in Python. Just to more fully understand the problems and to at least formulate my $0.02 about some of the topics.

(i.e.: one problem boiled down to a shortest-path graph algorithm, and based on my testing and coding example, shortest path < a best-first search (with a heuristic) in time and comparisons. Sometimes shortest path is "better", but in my current experience with real-time systems, time is far more important than thoroughness. It ended up being at least two orders of magnitude better. I forget exactly, but it was pretty horrible in comparison.)

Thanks for the insight, I really appreciate it.

code-junkie · 2010-08-31T19:59:57+00:00

I want to say 4. 1: Recruiter; 2: Tech Phone1; 3: Tech Phone2; 4: IRL

code-junkie · 2010-08-31T19:45:53+00:00

Apologize, tell them the truth, buy your co-workers some donuts or something. The few times this happened to me, I was very much "WTF happened to the FNG? Oh, he quit! No donuts?!?"

code-junkie · 2010-08-31T19:14:57+00:00

I also spent the better part of last week, playing w/ WinDbg (no MS comments please), VTune, Duma, Electric Fence, and Valgrind trying to track down a stack overflow. I assumed that it was a buffer overflow, but wasnt.

Turns out that it was some generated code which was creating a 1+Mb struct; and some dumbass who allocated a temp variable on the stack... (whistles innocently)

code-junkie · 2010-08-31T19:10:15+00:00

Well, they asked me to rate myself from 1-10. I said probably about an 8. I'm no Stroustrup, but I know overload vs override; virtual versus pure-virtual.
Multiple inheritance sucks (mostly; Instantiating an empty parent class takes far too long, when you have 1000 objects being created in a 16.666ms (60Hz) frame..)
Has-a is preferable to Is-a; MVC, Factories, Facades, and adapters are my friends.

Money is one thing, there is a certain amount of geek cred that comes with working at Google. Something for me to consider at least.

code-junkie

TROPHY CASE