cmaraziaris/O1-CompleteBinaryTree

Stars
7
Rank 2,294,772 (Top 46 %)
Language
C
License
MIT License
Created over 4 years ago
Updated over 4 years ago

cmaraziaris/O1-CompleteBinaryTree

cmaraziaris

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

A Generic Complete Binary Tree implementation , with O(1) Amortized Complexity in Insertion , Removal of last node and Getting the last node.

Hex-playing-AI

Competitive Hex board-game simulator. (Human vs AI)

Systems-Programming-Assignments

Assignments for the Course "K24: Systems Programming", Spring 2020

readers-writers-problem

A solution to the classic readers-writers problem regarding process concurrency.

MIPS-cache-config-toolkit

Set of MIPS assembly programs to help us find a secret cache configuration (cache size, block size and associativity).

os-memory-simulator

OS memory management simulator, using an Inverse Page Table.

building-simulation

A simple simulation of a public service building consisting of floors, offices and an elevator.

smart-contract-vulnerability-analysis

Code and resources related to my BSc thesis.

ctf-csec-uoa-2021

Solution to the CTF challenge assigned in the Computer Security class, Spring '21, University of Athens.

Regex-interpreter-in-haskell

A RegEx interpreter that matches (partially or fully) a given string against a given regular expression.

jacobi-sor-parallel-computing

Numerically solving the Poisson equation using the Jacobi-SOR method. Solutions using pure MPI, MPI+OpenMP and CUDA approaches are implemented.