Here I list a sampling of projects completed while working towards a Bachelor of Science in Computer Science degree at ASU.

SoDA: ASU Software Developers Association

As president of SoDA, a group of people at Arizona State University who are interested in programming or software engineering, I created our website, improved our email list, and began a public archive of tech talks.

Speed Pass website

Imagining a world were you could drive through any toll lane and be automatically charged without stopping, my group for CSE 360 Software Engineering created this website for users and managers of the system to use.  Try logging in as regular user “mike” (mikepasswd) and toll-booth manager “tbm” (pass12345).  I was responsible for the website interface (design, coding, etc.), and team members did QA and created our business logic, dabase, and API.  Disappointingly, our professor did not seem any more impressed by this than he was by other groups’ less-scalable solutions, some of which had Java interfaces, clearly an inferior choice, and none of which had a data API specified.

Displaying query results from error-prone databases

I haven’t put this user interface (UI) design project online or described it yet, but you may view the final proof of concept here.

ASU Academic Calendar in Google Calendar or Apple iCal

ASU’s official academic calendar is not available for students to add to Google Calendar, Apple iCal, Mozilla Sunbird, or Microsoft Outlook. Well, I fixed that.  This is an unofficial copy of their official calendar and it includes holidays and important deadlines.
View Calendar | Subscribe in: Google Calendar, iCal, Sunbird, or Outlook 2007

MIPS Code Assembler & Simulator

Completed during CSE 230, my online MIPS machine code assembler and the corresponding MIPS machine simulator were fun exercises in PHP as well as assembly language and low-level computer design studies.

Graph Theory: Finding Hamiltonian Circuits

Done as an honors project for MAT 243 Discrete Mathematics, this C++ project uses the Boost library to quickly locate a Hamiltonian circuit in a graph. (In graph theory, a Hamiltonian circuit is a path that starts at one vertex, travels to every other vertex, and then returns.) The graph must, however, consist of vertices each of order (degree; number of edges) of at least n where n is the number of vertices in the graph. The algorithm’s explanation and source code are on Hamiltonian circuit locator page.

Calculus III and 3D Graphics

This quick honors project was done for MAT 267 Calculus for Engineers. It is a model of 3D projections upon a screen.