Вы находитесь на странице: 1из 1

Joey Dafforn

630.917.5639 | jdafforn@purdue.edu | 152 E. Stadium Ave. Apt. 3, West Lafayette, IN, 47906 | Github: joey-dafforn
Education
Purdue University, West Lafayette, IN May 2019
Major: Computer Science, Concentration: Software Engineering/Machine Learning
Experience
TA for CS250 (Computer Architecture), Purdue University Fall 2017
Led labs and taught students the basics of computers using circuits
built on breadboards and programming in ARM assembly
Software Engineering Intern, Bank of America (Chicago) Summer 2017
Converted web applications from PHP to C# that
gathered statistics about the firms private cloud using SQL. Then
used JavaScript and HTML to present this data in an intuitive way
TA for CS159 (Programming in C), Purdue University Spring 2017
Guided students in learning to program in C including
resolving questions regarding labs, projects and homeworks
Software Engineering Intern, Bank of America (Charlotte) Summer 2016
Built change control system using SharePoint
Created java application for blocking emails with confidential documents
Software Engineering Intern, ModusBox (Seattle) Summer 2015
Created and edited API's for secure electronic data interchange (EDI)
Tested and helped launch beta for trading partner management application
Projects
Percolation (Java, Weighted Quick Union Find)
A graph percolates if there is a path from top to bottom such that the cells on the path are
empty and adjacent. Used weighted quick union find to see if a given set of points percolates.
Then compared this efficient solution with a brute force method and analyzed the time
complexity of each.
Pattern Recognition (Java, ArrayList)
If 3 or more points are collinear, they lie on the same line with the same slope. Used a brute
force algorithm to check if 3 or more points are collinear. Then created a more efficient
algorithm using an ArrayList that calculates the angle between a given point and a virtual
origin.
Password Cracker (C++, Hashmap)
Created a brute force algorithm to crack a 4-character password. Then created a more efficient
algorithm to crack 8-12 characters by splitting the encrypted password into smaller subsets and
using a symbol table.
Wordnet (Java, Directed Graph, Breadth First Search)
A wordnet groups nouns, verbs, adjectives and adverbs into sets of synonyms, with each group
expressing a distinct concept. Used directed graphs to find relations between groups of words
and place each into a synset.
Compression (Java, Circular Suffix Array)
Implements the Burrows-Wheeler compression algorithm, which forms the basis of the Unix
compression tool. Uses circular suffix arrays to compress (encode) the data to less than the
original size while maintaining the integrity of the data.
Technical Skills
Java PHP
Python C#
C JavaScript
C++ HTML
Extracurricular
iOS Development Club Member 2016-2017
Alpha Lambda Delta National Honor Society 2015-2017
Naperville North Men's Gymnastics 2011-2015
Community Service
Mission Trip, Hope Youth Corps, Partnership with Habitat for Humanity, Austin, TX Summer 2015
Built four houses & worked at local food bank
Mission Trip, Hope Youth Corps, Partnership with Habitat for Humanity, Oahu, HI Summer 2014
Prepared meals for homeless and restored huts on sacred grounds

Вам также может понравиться