aws_cloud_practitioner_essentials_resume

This repository contains the resume for AWS Cloud Course, offering a comprehensive understanding of AWS cloud and its various services. The course covers key concepts, best practices, and practical implementations of AWS solutions.

back-drop-build

bill-s_treasure

The problem involves finding a path (of any length) to a specific point (Bill's treasure) with some constraints, the most important of which is the prohibition of using any memory-intensive algorithms (such as BFS, DFS, A*).

chess_system_java

This Java project implements a fully functional chess game, allowing players to engage in strategic battles on the board. It features comprehensive rules, player turns, and graphical visualization, offering an immersive and challenging gaming experience.

competitive_programming_journey

This is a repository to post my competitive programming journey, here you will find my profiles on online judges and some competitions i have participated

dependecy_inversion

Implementation the Dependency Inversion principle in Object-Oriented Programming (OOP) to tackle code smells related to dependency management.

djikstra_algorithm

Dijkstra's Algorithm Implementation: A C implementation of Dijkstra's algorithm for finding the shortest path in weighted graphs.

docker_kick_start

This GitHub repository serves as a quick start guide to Docker. Explore concise examples and practical use cases to learn and master Docker containerization.

duckling_projects

Windows Forms application developed in Visual Studio. It enables users to manage and organize their projects by creating, modifying, and deleting them. User-friendly interface and exemplifies software development best practices.

flooding_algorithm

A graph traversal algorithm that explores and marks all the vertices in a graph, ensuring comprehensive coverage in applications like network broadcasting.

graph_isomorphism_verifier

This repository explores the fascinating world of graph theory through the lens of the Graph Isomorphism problem. Graphs are fundamental data structures with a wide range of applications, and understanding their isomorphism properties is crucial in various domains.

hackaton_fpp

Optimizing sequential code for speed and portability! This repository showcases the results of a "Fundamentals of Parallel Programming" hackathon. We leveraged CUDA, OpenMP, and more to enhance performance, with the main notebook at the heart of it all. 🚀

handss-on-fpp

Repository created for the Parallel Programming Fundamentals course. Here, various concepts about parallel programming and its diverse technologies like OpenMP and CUDA will be present.

how_to_devcloud

Here is a quick reference guide on how to utilize the execution queue within the Intel® DevCloud Environment.

mine_field

Minesweeper with a user-friendly interface and customizable difficulty levels, dive into the world of Minesweeper and test your strategic thinking in Java.

my_first_codes

Explore my initial coding projects in this GitHub repository. Witness my growth through small projects and code examples. Join me in embracing the beginnings of programming together.

orlandomotapires

orlandomotapires.github.io

prim_algortihm

Explore our efficient Prim's Algorithm implementation for Minimum Spanning Trees. This repository offers a well-documented solution for graph-based network design and optimization. Unlock the power of Prim's algorithm for your projects today.

quantummmm

Heres is my journey on Quantum Computing

raimundo_likes_green_apple

"Apple Picker" is a Python game developed with the Pygame library, where apples fall from the top of the screen and a platform controlled by an agent tries to catch green apples and avoid red ones. The goal is to maximize the score by catching green apples and avoiding red ones. The project explores basic AI techniques to automate movement.

threaded-and-sequential-prime-number-calculation-and-analysis

This repository contains sequential and parallel implementations for a prime number detection algorithm. It compares the performance of the two approaches and concludes that the sequential method is sufficient for the problem's scale.