These two hash map implementations feature open addressing with quadratic probing and separate chaining to handle collisions. The hm_include module provides the underlying data structures, and two hash functions.

Both implementations use the included DynamicArray class for the underlying hash table, however hash_map_sc.py uses a singly linked list for each bucket while hash_map_oa.py uses a HashEntry object. Additionally, hash_map_sc.py includes a seperate function, find_mode(), that provides a mechanism for finding the value that occurs most frequently in the hash map and how many times it occurs with an O(n) time complexity. Finally, both implementations include some basic testing when run as a script. Source Code

This single page application uses the MongoDB, Express, React, and Node (MERN) Stack to implement a REST API and a graphical interface for logging exercises. The home page greets the user with a table of past exercises. An exercise can be edited, or deleted, by clicking on the appropriate icon within the table.

Click the “plus” button on the home page to create a new exercise, and enter the details such as the name of the exercise and the number of repititions. Alternatively, use the links section at the bottom of the page to navigate the site. Note that when creating or editing an exercise the data is validated to help ensure accurate input. For example, the server verifies that “weight” and “reps” are integers, while “name” must be a string. After editing or creating an exercise the user is taken back to the home page to view the updated table. Source Code

This project is a backend for the ShipGame, a Battleship-like game written in python.

Each player has a 10x10 grid on which they place their ships. On their turn, the player fires a torpedo at a square on their opponent’s grid. Player ‘first’ gets the first turn, after which the players alternate. A ship is sunk when all of its squares have been hit. A player wins when all of their opponents ships have been sunk. Source Code