This repository contains the final project from Operating System course in the third semester. An algorithm in Python was created to compare the Look and C-Look process schedulers through a graphical representation. I used an example of a hard drive (HD) where the levels/blocks range from 0 to 999. For each scheduler, I organized two lists:
Then, I utilized the Matplotlib library for their intersection and the generation of the graph.
It was fundamental to improve my knowledge in this language and it also helped with my Bachelor’s Degree in Information Systems at UDESC.
Used during the evolution of course and the final project:
You need to have the Python language on your machine along with an IDE (Integrated Development Environment) or a website that can run the codes. For example:
You can also see the list of all collaborators who participated in this project.
This project is under the license MIT. See the LICENSE.md file for more details.
Developed with ❤️ in Brazil 🇧🇷