njit
Here are 32 public repositories matching this topic...
Language:All
Sort:Most stars
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.
- Updated
Jan 31, 2025 - C
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.
- Updated
Oct 10, 2024 - Python
Adapting the Dijkstra's algorithm to find the longest path instead of the shortest
- Updated
Aug 4, 2024 - Python
This project tries to simulate fluid dynamics, and fluid viscosity.
- Updated
Jan 22, 2025 - C++
This example serves to show how to connect and effectively perpetuate a tight bluetooth link between an Android device and a wearable WearOS device
- Updated
Jun 1, 2024 - Kotlin
This project parses and evaluates arithmetic expressions using recursive descent parsing based on BNF grammar rules.
- Updated
Jul 28, 2024 - Python
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
- Updated
Jul 2, 2024 - Python
This project serves to display an ordered and balanced heap binary trees in the stdout.
- Updated
Jun 19, 2024 - Python
In this project I'll try to demonstrate a hashing scheme for storing and retrieving data by implement Modular Division Hashing Function.
- Updated
Jun 23, 2024 - Python
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.
- Updated
Dec 30, 2024 - Python
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.
- Updated
Jan 6, 2025 - C
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.
- Updated
Jun 25, 2024 - Python
This project intends to closer understand how to compress data using Huffman Coding and delve into a couple of programming examples.
- Updated
Aug 3, 2024 - Python
Implementing Hash-Table Lexicon using open-addressing and quadratic probing.
- Updated
May 16, 2024 - C++
This code example showcases 5 various algorithms (selection, insertion, heap, merge and quick sort) to sort a select array
- Updated
Nov 12, 2024 - Python
A website for Theta Chi, Epsilon Psi
- Updated
Mar 8, 2017 - HTML
Analyze, design, implement, and document a database system application.
- Updated
Sep 8, 2024 - Python
Improve this page
Add a description, image, and links to thenjit topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with thenjit topic, visit your repo's landing page and select "manage topics."