Currently I'm a Software Engineer residing in the Brooklyn, NYC. I have 7+ years of full-time experience in Software Development and I've worked in Backend Engineering, Frontend Engineering, DevSecOps, Automation, Deployment, Inttegration, and Infrastructure Software development.
Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?
Optimal solution considers all possible permutations of cities and compares the cost of each permutation to find the tour of least cost. Greedy solution continually chooses a city that has the lowest cost of all cities that remain. Minimum spanning tree solution builds minimum spanning tree of graph and performs pre-order traversal. Dynamic programming solution finds the bitonic tour using tabular methods.
The goal of the project was to be implement and compare the different solutions to the Traveling Salesman Problem with small and large problem sizes. The second goal was to discover how accurate the theoretical estimates of complexity are when compared to real execution times.
Data Mining Project to analyze March Madness NCAA Division I Basketball statistics from kaggle.com. Implemented a decision tree algorithm in R using node impurity measures of Entropy, GINI Index, and Misclassification Rate.
ToolShare is a web application I worked on during the Fall Semester of 2014 in my Intro to Software Engineering class. I was the Requirements Coordinator and the frontend developer for my team. I primarily utilized Bootstrap to develop the frontend.
The goal of the project was to be familiar with the software engineering development process, understand customer requirements, work in a team coordinated environment, learn how to provide documentation, implement design concepts, test software, and provide usability.
This program implements a Lexical Analysis Scanner to read a subset of the C language: identifiers, decimal integers, octal integers, block-style comments, and basic arithmetic operators. The scanner is implemented using a transition matrix.
AmigoNet maintains a collection of users that have friend connections between them. It is loosely based on elementary features in a system like Facebook/Linkedin. Some operations that are supported as connecting and disconnecting users and determining the degrees of separation between two users.
Mysh is an interactive shell capable of executing simple UNIX commands and some implemented internal commands. Uses knowledge of dynamic memory management, text I/O, string manipulation, and the design and use of structures.
I worked in a team of three to design a social networking database using Play. My role involved translating Entity-Relationship diagrams into PostgreSQL scripts to generate sample users, groups, walls, posts, requests, friends, and members of groups and ensured data/referential integrity.
I implemented data structures and algorithms to solve chess solitaire games, the water jug problem, and the clock step puzzle using Java and Eclipse. I also used Java Swing, the Model-View-Controller architecture, and an interface that all the puzzles inherit from.
