https://github.com/mateusadada/dad1-udesc
Data Structure 1 course in the third semester of the Bachelor's Degree in Information Systems at UDESC
https://github.com/mateusadada/dad1-udesc
binary-tree exercises final-project final-work list python python-3 python-exercises python3 queue recursion stack udesc
Last synced: 29 days ago
JSON representation
Data Structure 1 course in the third semester of the Bachelor's Degree in Information Systems at UDESC
- Host: GitHub
- URL: https://github.com/mateusadada/dad1-udesc
- Owner: mateusadada
- License: mit
- Created: 2023-08-21T22:48:49.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-02-02T15:39:13.000Z (about 1 year ago)
- Last Synced: 2025-02-09T19:26:22.859Z (3 months ago)
- Topics: binary-tree, exercises, final-project, final-work, list, python, python-3, python-exercises, python3, queue, recursion, stack, udesc
- Language: Python
- Homepage: https://mateusadada.github.io/dad1-udesc/
- Size: 65.4 KB
- Stars: 0
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
Data Structure 1 - UDESC
A complete list of solved exercises and the final project
## 📜 Table of contents
- [Starting](#-starting)
- [Features](#-features)
- [Prerequisites](#-prerequisites)
- [Built with](#️-built-with)
- [Authors](#️-authors)
- [License](#-license)
## 🚀 Starting
This repository contains the solved exercises from Data Structure 1 course in the third semester. [The exercises](https://github.com/mateusadada/dad1-udesc/tree/main/solved_exercises/VPL) have more complex and challenging concepts, as well as the use of classes. They were solved within the [VPL](https://vpl.dis.ulpgc.es/) because of the college. It is a platform that offers a virtual environment for teaching and practicing programming, allowing users to develop and execute code in various languages directly in the browser.
[The final project](https://github.com/mateusadada/dad1-udesc/blob/main/final_project/heap_sort.py) was a presentation with [@ViniciusBeuther](https://github.com/ViniciusBeuther) of the Heap Sort algorithm using slides as support material and the execution of code that was adapted from [Brilliant](https://brilliant.org/wiki/heap-sort/). It was also necessary to grasp the concepts of Heapify to comprehend the entire functioning of the sorting process. It was fundamental to improve my knowledge in this language and it also helped with my Bachelor's Degree in Information Systems at [UDESC](https://www.udesc.br/).
## 📚 Features
Used during the evolution of exercises and the final project:
- Natural structures.
- Linked lists, linked queues and linked stacks.
- Balanced trees.
- Algorithms for manipulating structures.
## 📋 Prerequisites
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:
* [IDE PyCharm](https://www.jetbrains.com/pycharm/)
* [IDE Visual Studio Code](https://code.visualstudio.com/)
* [Website Replit](https://replit.com/)
* [Website PythonAnywhere](https://www.pythonanywhere.com/)
* [Website Codecademy](https://www.codecademy.com/)
## 🛠️ Built with
* [Python 3](https://www.python.org/) - The programming language used.
## ✒️ Authors
* **Mateus Adada** - *Developer and documentation* - [mateusadada](https://github.com/mateusadada)
* **Vinicius E. Beuther** - *Developer* - [ViniciusBeuther](https://github.com/ViniciusBeuther)
You can also see the list of all [collaborators](https://github.com/mateusadada/dad1-udesc/graphs/contributors) who participated in this project.
## 📄 License
This project is under the license MIT. See the [LICENSE.md](https://github.com/mateusadada/dad1-udesc/blob/main/LICENSE) file for more details.
Developed with ❤️ in Brazil 🇧🇷