The aim of the project was to create an optimized algorithm that searches for the shortest path through all the desired cities and back to the first city. First, we proved that the TSP (traveling salesman problem) is NP-complete, so we know that we can create a heuristic algorithm with polynomial complexity. We chose the TSP tabu search method to obtain an optimized path and then implemented it on jupyter notebook in python.

We had several medical data bases to filter and to rebuild for displaying it in power BI. We use PostgreSQL, a powerful open-source relational database management system known for its robustness, extensibility, and advanced features. Then we also use Talend, a comprehensive data integration and management platform that enables organizations to efficiently connect, transform, and analyze data across various sources and systems. Finally We had to create simple, clear and dynamics data visualizations for the client on Power Bi a business intelligence tool that provides interactive visualizations and data exploration capabilities, enabling users to gain insights from their data and make data-driven decisions.

In C#, a versatile and object-oriented programming language developed by Microsoft, known for its simplicity, scalability, and broad range of applications in software development, we created an entire application that save any file you want, with several options.

We use several virtual machines to recreate a false company network with firewalls, active directory, setting special rules for the users, customize and unified the backrground...