P

python-3

The code uses backtracking to solve the Constraint Satisfaction Problem (CSP) of map coloring. It checks if assigning colors to regions follows the constraint that no adjacent regions have the same color. The skills involved include algorithm design for backtracking, recursion, and solving CSP problems. The implementation uses Python.

This Python code employs the Depth-First Search (DFS) algorithm to find a path from "Arad" to "Bucharest" in the Romania map. It uses a priority queue, backtracking, and a graph representation. The DFS path is printed at the end. Skills demonstrated include graph traversal, priority queue usage, and DFS algorithm implementation.

Drone Mapping Python Script

Public scripts for LinedBot from https://fr.wikipedia.org and https://fr.vikidia.org

This Python script merges all PDF files in the current directory into a single PDF file named "merged.pdf" using the PyPDF2 library. It iterates through the PDF files, appends their content to a PdfWriter object, writes the merged content to a new file, and then closes the PdfWriter object.

The aim of N-Queens Problem is to place N queens on an N x N chessboard, in a way so that no queen is in conflict with the others.

A Python implementation of JCOF: JSON-like Compact Object Format

The Python script utilizes the win32com library to interact with the Windows Speech API (SAPI), prompting the user to input text to be spoken aloud. It continuously speaks the input text using the default system text-to-speech engine until the user inputs "-1" to terminate the program.

Apex Sigma: The Database Giant Discord Bot

Some of the tools that help me in the classroom.

Implementation of UCS on Romania to find shortest distance from Arad to Bucharest based on best-first search algorithm. It uses a dictionary that stores current city mapped to (parent city, current best distance), and frontier is a priority queue to process nodes containing (node id, current city, priority value).