Coursework at NJIT
This project aims to use a Voronoi-partition-based exploration algorithm to enable multiple robots to autonomously navigate and explore an environment, generating a map.
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 aims utilize a graph(a tree) as a form of image value compression by implementing a special kind of data structure where it basically groups repeating variables into a node and ungroups non-repeating values into their own nodes.
This project parses and evaluates arithmetic expressions using recursive descent parsing based on BNF grammar rules.
experimental subtractive polysynth
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.
The following project should define a PDA that in its turn would recognize a specific context-free language.
This project tries to simulate fluid dynamics, and fluid viscosity.
This project aims utilize a sparse matrix as form of matrix or image value compression by basically implementing a special kind of data structure where it omits one continuously recurring value ultimately saving space only for "important" variables.
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 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.
To associate your repository with the njit topic, visit your repo's landing page and select "manage topics."