Data Structure codes implemented in C

Modified Djikstra's algorithm with Minheap used to solve assigned task.

Uma implementação de heap em C, viável tanto para minheap como maxheap. É alocada dinamicamente e chama a função realloc quando não há mais espaço, dobrando-o.

minheap/maxheap for C

My assignment from exercise 2 for the 'Operating Systems' lesson where the xv6 (a simple Unix-like teaching operating system - https://pdos.csail.mit.edu/6.828/2011/xv6.html) operating system is used to configure its scheduler and support priority whenever it attempts to make context switch between processes.

To create a mini-os

Takes any type of file (including binaries) and compresses it using huffman coding. At the same time, it decompresses the a given file if compressed using this same file.

Operating Systems Assignment - Exercise 2: Leveraging the xv6 teaching OS, this project focuses on configuring the scheduler to support process prioritization during context switches. Explore the inner workings of a Unix-like OS and gain insights into process scheduling and management.