Angus Macdonald

This year marked the first time I’d tutored on a second year course, Foundations of Computation. Of the topics covered I produced notes and code to help explain lists, search algorithms, and trees. I’ve included them below in the hope they may be useful.

Algorithms for finding cycles in Linked Lists (GitHub repository). The included code runs various algorithms to find cycles, and graphs the efficiency of each algorithm.

Search Algorithms Comparison (GitHub repository). The included code implements three search algorithms (Selection, Insertion, and Merge Sort) and includes various levels of debug to show the process taken by each algorithm and to count the number of comparisons and swaps involved.

Cheat sheet for Balancing AVL Trees (Google Docs). A very brief guide explaining what operations must be performed to balance and AVL tree.

The following slides are of a talk I recently gave on Enterprise Java Beans 3.0.

Tutorial Slides (1-Up)
Tutorial Slides (6-Up)

I became interested in Enterprise Java Beans while looking at the various ways companies store and access data. This led to me give this talk to the distributed systems group within the school, describing the various concepts that form a part of the technology, including the Java Persistence API.

The talk itself was interspersed with examples from the O’Reilly EJB 3.0 book, which I’d recommend buying if you’re looking for a more in-depth look at the topic.