shmup

MIT 6.001 (1986) SICP Lecture Segments

Here are YouTube links to each "segment" of the 1986 MIT 6.001 Structure and Interpretation of Computer Programs lectures from Harold Abelson and Gerald Jay Sussman.

See also:

jgoettsch

#!/bin/ksh

set -x

URL=https://mirror1.malwaredomains.com/files/domains.txt
OUTDIR=/tmp
OUT="$OUTDIR/domains.txt"
UNBOUND_ETC=/var/unbound/etc
MALWARE_CONF="$UNBOUND_ETC/malware.conf"

lifepillar

#!/bin/bash
#
#   This file echoes a bunch of 24-bit color codes
#   to the terminal to demonstrate its functionality.
#   The foreground escape sequence is ^[38;2;<r>;<g>;<b>m
#   The background escape sequence is ^[48;2;<r>;<g>;<b>m
#   <r> <g> <b> range from 0 to 255 inclusive.
#   The escape sequence ^[0m returns output to default

setBackgroundColor()

skvggor

echo FILE "$1" BINARY >> $1.cue
echo TRACK 01 MODE1/2352 >> $1.cue
echo INDEX 01 00:00:00 >> $1.cue
bchunk $1 $1.cue $1.iso
rm $1.cue

jboner

Latency Comparison Numbers (~2012)
----------------------------------
L1 cache reference                           0.5 ns
Branch mispredict                            5   ns
L2 cache reference                           7   ns                      14x L1 cache
Mutex lock/unlock                           25   ns
Main memory reference                      100   ns                      20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy             3,000   ns        3 us
Send 1K bytes over 1 Gbps network       10,000   ns       10 us
Read 4K randomly from SSD*             150,000   ns      150 us          ~1GB/sec SSD