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.

Project for NJIT CS-490 Fall 2020

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 Github Repo showcases all the different android studio example projects presented by CodePath

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 tries to simulate fluid dynamics, and fluid viscosity.

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

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

Security in Development, Development for Security

Implementing Hash-Table Lexicon using open-addressing and quadratic probing.

This example serves to show how to connect and effectively perpetuate a tight bluetooth link between an Android device and a wearable WearOS device

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

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 intends to closer understand how to compress data using Huffman Coding and delve into a couple of programming examples.

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 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.

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

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

NJIT publications database