Powersets

Creating the set of all possible subsets, the powerset of a set with Scheme.

Redirecting IO stream

Redirecting the input output stream using the << symbol in the c or bash shell. This is useful when you wish to run another program that is initialized in the shell through a command.

Environment Diagrams

Example environment diagrams in Scheme.

Message Passing vs Tagged Data

Message passing is the underlying theme of object oriented programming. Data directed programming uses tagged-data.

Pollards Algorithm

Pollards algorithm can be used to factor huge numbers.

Y-combinator

Y-combinator is a way of defining a function that can call itself without the define function.

Perfect Numbers

This demonstrates a mathematical concept of a perfect number in a computational abstraction utilizing scheme.

Simple Tree Recursion

Implementing tree recursion with Scheme.

cs61a Review

Cs61a review material.

Distinguishable and Indistinguishable

Distinguishable and Indistinguishable boxes and objects. Combinations and permutations. Placing objects into boxes.

Scheme mathematics

Using scheme to compute derivatives and integrals.

Vector Bubble Sort

Bubble sort a vector in scheme.

Vector Filter

Creating a vector-filter function without the use of lists as an intermediate value.

Vector Append

How to create a vector append procedure in Scheme.

Mapping Trees

Applying functions to trees recursively.

Return Path in Tree

Return the path of a given element within a tree.

Environments

Utilizing environments to make classes and objects.

Binary Trees

Binary trees, binary search trees, and algorithms for searching these trees.

Records

A record system using get and put within scheme.

Filter procedure

Filters a sequence based on a predicate.

Convert tree to list

Convert a tree to a list.

Deep Recursion

Deep recursion in Scheme.

Reversing lists

Reversing a list in scheme using iterative and recursive processes.

Euclidean Algorithm

The Euclidean Algorithm is used to find the Greatest Common Divisor. Written in Scheme.

Base Expansion

How to compute a base b expansion of a number n.

Modular Exponentiation

Modular Exponentiation is an important algorithm in cryptography and computer science.

Substitute words in lists

Recursive string substitutions in lists in Scheme.

Reading and writing files

Writing and opening files in Scheme.