Jamil

// Math Defs

float factorial (float n) {
    if (n < 1)
        return 1;
    return (n*factorial(n-1));
}

// Approximations Using Trig Identities & Small Angle Formulae

Jamil

#lang scheme

(define (make-sum a1 a2) 
  (list '+ a1 a2))
(define (make-product m1 m2) 
  (list '* m1 m2))
(define (make-exponent e1 e2)
  (list '** e1 e2))

(define (term-integrate expr)

Jamil

#lang scheme

(define (make-sum a1 a2) 
  (list '+ a1 a2))
(define (make-product m1 m2) 
  (list '* m1 m2))
(define (make-exponent e1 e2)
  (list '** e1 e2))

(define (term-var-integrate expr var)

Jamil

#lang racket

(define (find-Vt temp)
  (define boltzmann 1.38e-23) ; J/K
  (define e-charge 1.60e-19) ; Coulombs/e-
  (/ (* boltzmann (+ temp 273)) e-charge))

(define (kvl-current Vdd R Vd)
  (/ (- Vdd Vd) R))

Jamil

Keybase proof

I hereby claim:

• I am jamil on github.
• I am jamil (https://keybase.io/jamil) on keybase.
• I have a public key whose fingerprint is 088B 76A3 F9B8 249D BE59 AF5E 7B0A 29E3 5526 2FA5

To claim this, I am signing this object:

Jamil

#lang racket

(define sample-predicates '(
  ("~X" "Y")
  ("~Y" "Z")
  ("X" "~Z")
  ("Z" "Y")
))

; Quick initialization

Jamil

createURL :: String -> [(String,String)] -> String
createURL base parameters = base ++ (makePairs parameters)
    where
        makePairs (x:xs) = foldl (++) (makeHead x) (map (\p -> "&" ++ (makePair p)) xs)
        makeHead x = "?" ++ (makePair x)
        makePair (key,value) = key ++ "=" ++ value

Jamil

func map<T1, T2>(f: T1 -> T2, l: [T1]) -> [T2] {
    return l.reduce([]) { $0 + [f($1)] }
}

func filter<T>(f: T -> Bool, l: [T]) -> [T] {
    return l.reduce([]) { $0 + (f($1) ? [$1] : []) }
}

Jamil

bigrams :: [String] -> [(String, String)]
bigrams [x] = []
bigrams (x:y:xs) = (x, y):(bigrams $ y:xs)

Jamil

successors :: String -> [(String, String)] -> [String]
successors predecessor bigrams = map snd matches
           where matches = filter (\p -> fst p == predecessor) bigrams