stangles/CSE381_HW4
This is a simple C++ program to parse a roman numeral algebraic expression and return its value.
Developer Profile
stangles
Discovered public repositories for stangles in the GitHub catalog.
stangles/CSE383_REST
This is a simple REST API that Shannon Kirby and I developed to manage email addresses through PUT, GET and DELETE requests. An email consists of a username, an email string and 0 or more groups.
stangles/CSE486_Breakthrough
Term project for CSE486: Create AI to play the board game called breakthrough.
stangles/CSE486_HW3
This homework is a basic hill-climbing solution (with 5 restarts) to the n-queens problem.
stangles/CSE381_HW3
Homework 3 for Dr. Rao's Operating Systems class. This is a multithreaded program that processes a directory for files with names containing a given substring. The processing output is the number of lines, words and english words contained in the files. The program discovers files by recursively searching the directory in a depth-first manner. It processes files by adding them to a shared global queue and then processing them with multiple threads using monitors.
stangles/CSE381_HW2
Homework 2 for Dr. Rao's Operating Systems class. This is a multithreaded program that finds the minimum scalar product of two vectors through a brute force permutation method.
stangles/CSE381_HW1
Homework 1 for Dr. Rao's Operating Systems class, a simple java refresher program
stangles/HW05
HW05 for Dr. Brinkman's CSE274. This homework demonstrates knowledge of Adjacency Matrix, Adjacency Lists and their implementation in C++. It also includes a brute force traveling salesman algorithm for a small number of nodes (n<=15).
stangles/HW04P3-anglessw
Homework 04, part 3 for Dr. Brinkman's CSE274 class. This demonstrates knowledge of image manipulation as it ties to large data input and sorting that data. In this homework is a map of the U.S. and all Starbucks locations. A user can click on the map and the closest Starbucks to that location will be highlighted.
stangles/HW04P2-anglessw
This is homework 04 part 2 for Dr. Brinkman's CSE274 class. It includes an implementation of the nearest neighbor search with a k-dimensional tree.
stangles/HW04P2
Another Part 2 solution for homework 04. This includes an array data structure with a brute force distance computation for the nearest neighbor search.
stangles/HW02
Homework 02 for Dr. Brinkman's CSE274 class. This homework demonstrates knowledge of linked lists as well as graphics manipulation.
stangles/HomeWork01
Homework 01 for Dr. Brinkman's CSE274 class. Implements graphics through the direct manipulation of the pixel array.