Redesign of existing movie theater website for CS148, Fall 2016, UVM

Finds a Topological Ordering of vertices in a Directed Acyclic Graph

Greedy Algorithm to minimize lateness when scheduling jobs on a processor

Algorithm to test if a given graph is Bipartite or not

Finds how similar 2 lists of rating are using the Divide and Conquer approach. Extension of MergeSort that actually displays the specific inversions as well as just counting the total number.

Command line implementation of the board game Mastermind for a Software Engineering class

Reveal password fields with a keyboard shortcut or click of the Extension icon

Application of Breadth-First Search to see if a directed graph is Strongly Connected

Shortest Paths from every vertex to a goal vertex allowing negative-weight edges (when Dijkstra's fails)

Invert Selection of checkboxes or radio buttons in an HTML form

Weighted Interval Scheduling, the classic Dynamic Programming problem implemented in Java

Greedy Algorithm to find a minimum spanning tree in an undirected graph by deleting heaviest edges unless it would disconnect the graph

Binary hexadecimal converter

A list of projects I've worked on. GitHub's organization is lacking in my opinion, so this serves as an index & root of all my work (I'm Noah Patullo, not Pattullo or Patulo. I have a unique name & this should help clarify who I am)

Autofill NetID when logging into Blackboard & syncs across signed-in Chrome browsers

Algorithm to find possible sets in the game Set using an iterative implementation of n choose 3 for combinations

Greedy Algorithm to find the maximum number of mutually compatible jobs

Approximation Algorithm for the NP-Complete problem of balancing job loads on machines. Does not guarantee an optimal solution, but instead, a solution is within a factor of 1.5 of the optimal solution

Network Flow: Given a directed graph with edge capacities and vertex demands, is there a circulation of flow?

Approximation Algorithm for the NP-Complete problem of finding a vertex cover of minimum weight in a graph with weighted vertices. Guarantees an answers at most 2 times the optimal minimum weighted vertex cover