I love applying my data science and machine learning knowledge along with my software and web development skills to solve complex technical and business problems with simple, efficient solutions. I am a strong thinker and decision maker. I love using data to deliver meaningful results that can move businesses forward with insights into future endeavors.
- Configuring device networks, managing data collection, querying device topologies
- Refining GUI analytics and understanding how to best provide data to the client
- Optimizing software solutions for increased and finer network coverage
- Built custom server-side CSS preprocessor for Sass to efficiently support and display SVG’s
- Implemented multiple front-end and server-side web-admin features for IBM Jazz
- Built custom server-side CSS preprocessor for Sass to efficiently support and display SVG’s
- Enhanced a multitude of dojo widgets to be context-aware based on user configuration
- Developed for an enterprise-level code base with server builds, within an Agile environment
- Queried Google Books API and stored professors preferences through custom login portal
- Designed unique web-UI layout with PHP-integrated forms in WordPress
- Although not a very complex program, I've written this program in nearly 20 different ways - from fully recursive, to multi-threaded, to stacking methods.
- Exercises in Programming Styles
A maze generator that uses a recursive, depth-first algorithm to randomly generate a two-dimensional maze of arbitrary size, with the result required to be a perfect maze.
AVL tree tree implementation along with a custom 5-part spell checking algorithm. (A) Swap each adjacent pair of characters in the word. (B) In between each adjacent pair of characters in the word, each letter from 'A' through 'Z' is inserted. (C) Delete each character from the word. (D) Replace each character in the word with each letter from 'A' through 'Z'. (E) Split the word into a pair of words by adding a space in between each adjacent pair of characters in the word.
Implementation of a directed graph based on an adjacency list. Embedded within is Dijkstra's shortest path algorithm to solve the single-source, positive-weighted, shortest-path problem.