{"id":23134737,"url":"https://github.com/mateusadada/dad1-udesc","last_synced_at":"2025-04-04T08:21:52.673Z","repository":{"id":189826549,"uuid":"681384718","full_name":"mateusadada/dad1-udesc","owner":"mateusadada","description":"Data Structure 1 course in the third semester of the Bachelor's Degree in Information Systems at UDESC","archived":false,"fork":false,"pushed_at":"2024-02-02T15:39:13.000Z","size":67,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-02-09T19:26:22.859Z","etag":null,"topics":["binary-tree","exercises","final-project","final-work","list","python","python-3","python-exercises","python3","queue","recursion","stack","udesc"],"latest_commit_sha":null,"homepage":"https://mateusadada.github.io/dad1-udesc/","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/mateusadada.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null}},"created_at":"2023-08-21T22:48:49.000Z","updated_at":"2024-02-02T14:33:02.000Z","dependencies_parsed_at":"2024-01-26T15:02:41.885Z","dependency_job_id":null,"html_url":"https://github.com/mateusadada/dad1-udesc","commit_stats":null,"previous_names":["mateusadada/python-dad-udesc","mateusadada/python-dad1-udesc","mateusadada/dad1-udesc"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mateusadada%2Fdad1-udesc","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mateusadada%2Fdad1-udesc/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mateusadada%2Fdad1-udesc/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mateusadada%2Fdad1-udesc/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mateusadada","download_url":"https://codeload.github.com/mateusadada/dad1-udesc/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247142525,"owners_count":20890740,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["binary-tree","exercises","final-project","final-work","list","python","python-3","python-exercises","python3","queue","recursion","stack","udesc"],"created_at":"2024-12-17T12:12:56.233Z","updated_at":"2025-04-04T08:21:52.626Z","avatar_url":"https://github.com/mateusadada.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003ch1 align=\"center\"\u003eData Structure 1 - UDESC\u003c/h1\u003e\n\u003cdiv align=\"center\"\u003e\u003ci\u003eA complete list of solved exercises and the final project\u003c/i\u003e\u003cbr\u003e\u003cbr\u003e\n\u003ca href=\"https://github.com/mateusadada/dad1-udesc/stargazers\"\u003e\u003cimg src=\"https://img.shields.io/github/stars/mateusadada/dad1-udesc\" alt=\"Stars Badge\"/\u003e\u003c/a\u003e\n\u003ca href=\"https://github.com/mateusadada/dad1-udesc/network/members\"\u003e\u003cimg src=\"https://img.shields.io/github/forks/mateusadada/dad1-udesc\" alt=\"Forks Badge\"/\u003e\u003c/a\u003e\n\u003ca href=\"https://github.com/mateusadada/dad1-udesc/pulls\"\u003e\u003cimg src=\"https://img.shields.io/github/issues-pr/mateusadada/dad1-udesc\" alt=\"Pull Requests Badge\"/\u003e\u003c/a\u003e\n\u003ca href=\"https://github.com/mateusadada/dad1-udesc/issues\"\u003e\u003cimg src=\"https://img.shields.io/github/issues/mateusadada/dad1-udesc\" alt=\"Issues Badge\"/\u003e\u003c/a\u003e\n\u003ca href=\"https://github.com/mateusadada/dad1-udesc\"\u003e\u003cimg src=\"https://komarev.com/ghpvc/?username=dad1-udesc\u0026color=447ff7\u0026label=views\" alt=\"Views count Badge\"/\u003e\u003c/a\u003e\n\u003cbr\u003e\u003ca href=\"https://mateusadada.github.io/dad1-udesc\" target=\"blank\"\u003e\u003cimg src=\"https://img.shields.io/website?url=https%3A%2F%2Fmateusadada.github.io%2Fdad1-udesc\u0026logo=github\" /\u003e\u003c/a\u003e\n\u003ca href=\"https://github.com/mateusadada/dad1-udesc/graphs/contributors\"\u003e\u003cimg alt=\"GitHub contributors\" src=\"https://img.shields.io/github/contributors/mateusadada/dad1-udesc?color=2b9348\"\u003e\u003c/a\u003e\n\u003ca href=\"https://github.com/mateusadada/dad1-udesc/blob/main/LICENSE\"\u003e\u003cimg src=\"https://img.shields.io/github/license/mateusadada/dad1-udesc?color=2b9348\" alt=\"License Badge\"/\u003e\u003c/a\u003e\n\u003c/div\u003e\n\n## 📜 Table of contents\n\n- [Starting](#-starting)\n- [Features](#-features)\n- [Prerequisites](#-prerequisites)\n- [Built with](#️-built-with)\n- [Authors](#️-authors)\n- [License](#-license)\n\n## 🚀 Starting\n\nThis 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.\n\n[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/).\n\n## 📚 Features\n\nUsed during the evolution of exercises and the final project:\n\n- Natural structures.\n- Linked lists, linked queues and linked stacks.\n- Balanced trees.\n- Algorithms for manipulating structures.\n\n## 📋 Prerequisites\n\nYou 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:\n\n* [IDE PyCharm](https://www.jetbrains.com/pycharm/)\n* [IDE Visual Studio Code](https://code.visualstudio.com/)\n* [Website Replit](https://replit.com/)\n* [Website PythonAnywhere](https://www.pythonanywhere.com/)\n* [Website Codecademy](https://www.codecademy.com/)\n\n## 🛠️ Built with\n\n* [Python 3](https://www.python.org/) - The programming language used.\n\n## ✒️ Authors\n\n* **Mateus Adada** - *Developer and documentation* - [mateusadada](https://github.com/mateusadada)\n* **Vinicius E. Beuther** - *Developer* - [ViniciusBeuther](https://github.com/ViniciusBeuther)\n\nYou can also see the list of all [collaborators](https://github.com/mateusadada/dad1-udesc/graphs/contributors) who participated in this project.\n\n## 📄 License\n\nThis project is under the license MIT. See the [LICENSE.md](https://github.com/mateusadada/dad1-udesc/blob/main/LICENSE) file for more details.\n\n\u003chr\u003e\u003cp align=\"center\"\u003eDeveloped with ❤️ in Brazil 🇧🇷\u003c/p\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmateusadada%2Fdad1-udesc","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmateusadada%2Fdad1-udesc","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmateusadada%2Fdad1-udesc/lists"}