swenson

proc f() : (int, int) {
  return f();
}

proc main() {
  f();
}

swenson

proc f() : (int, int) {
  return f();
}

proc main() {
  f();
}

swenson

#!/bin/bash

NAME="something"
d=$(date "+%F--%H-%M-%S")
/usr/local/bin/tarsnap -c --keyfile /root/tarsnap.key --cachedir /usr/local/tarsnap-cache -f $NAME-backup-$d /etc /home /root /var

swenson

do_a_trap
                        mov   esi, [trap]
                        test  esi, 0x10000
                        jnz   normal_trap
                        test  esi, 0x20000
                        jnz   register_trap
                        jmp   near return_no_cigar
normal_trap
                        cmp   si, [_PC]
                        jnz   near return_no_cigar

swenson

<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE plist PUBLIC "-//Apple Computer//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
<!-- Generated by: TmTheme-Editor                 -->
<!-- ============================================ -->
<!-- app:  http://tmtheme-editor.herokuapp.com    -->
<!-- code: https://github.com/aziz/tmTheme-Editor -->
<plist version="1.0">
<dict>
	<key>author</key>
	<string>William D. Neumann</string>

swenson

# The number of bits in the S-box
sbits = 6

# Calculate the maximum value / differential
ssize = 2**6

# Generate the matrix of differences, starting
# at all zeros
count = []
for i in range(ssize):

swenson

# Use whatever your test app directory is for ExampleTest, and whatever the
# package you are testing for com.example.test

export PATH="$ANDROID_HOME/platform-tools:$ANDROID_HOME/tools:$PATH"

pushd ExampleTest

# adb shell throws away the return value, so we have to hack do some magic
# see https://code.google.com/p/android/issues/detail?id=3254

swenson

Author unknown.

1.) Algorithm Complexity: You need to know Big-O. If you struggle with
basic big-O complexity analysis, then you are almost guaranteed not to
get hired.
For more information on Algorithms you can visit:
http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=alg_index

2.) Coding: You should know at least one programming language really
well, and it should preferably be C++ or Java. C# is OK too, since

swenson

Keybase proof

I hereby claim:

• I am swenson on github.
• I am swenson (https://keybase.io/swenson) on keybase.
• I have a public key whose fingerprint is 5FF9 4B3B 213C 16A0 7A08 4585 4FC1 860F 7A72 6488

To claim this, I am signing this object:

swenson

from sliderepl import Deck
Deck.run()

### slide::
# Let's start by loading some stuff we're going to need.
import requests
import json
import os
from pprint import pprint