Adapting the Dijkstra's algorithm to find the longest path instead of the shortest

This project was done in association with the Solar-Terrestrial Research Department(CSTR) in the New Jersey Institute of Technology (NJIT) and was purposely crafted to find the phenomenon STEVE.

This project parses and evaluates arithmetic expressions using recursive descent parsing based on BNF grammar rules.

This project showcases 4 examples of queuing: Single Queue, Round Robin, Shortest Queue, Random Queue, that would try to process as many persons as possible.

This project intends to closer understand how to compress data using Huffman Coding and delve into a couple of programming examples.

The following example is meant to demonstrate how a Deterministic Finite Automata(DFA) algorithm is supposed to guide identify whether a string is an email adress ending with .gov or .gr

This project serves to display an ordered and balanced heap binary trees in the stdout.

In this project I'll try to demonstrate a hashing scheme for storing and retrieving data by implement Modular Division Hashing Function.

This project implements and compares various pathfinding algorithms, including A*, BFS, DFS, and Dijkstra, to find the shortest path on a 2D grid with obstacles.

This code example showcases 5 various algorithms (selection, insertion, heap, merge and quick sort) to sort a select array

Analyze, design, implement, and document a database system application.

This is a simulation of fire spread using PyGame. Users can create unique environments by drawing on roads, rivers, housing, and grass. This allows for communities to understand vulnerabilities in their fire safety. This project was created in 24 hours at TriValleyHacks with Emilio Lim, Arhum Khan, and Sunny Jayaram.