This repository contains the materials, python codes for the quiz and some codes implemented using jupyter notebook related to the specialization ( Introduction to Discrete Mathematics In Computer Science)
Some interesting applications of Stochastic Processes using Jupyter Notebooks for descriptive and instructive illustrations.
📔 This repository contains tasks related to learning Optimisation algorithms
This repository explores two optimization algorithms: the Traveling Salesman Problem (TSP) and Nearest Neighbor Search (NNS). It features Jupyter notebooks implementing brute-force solutions to both problems, utilizing Euclidean distance calculations and path visualizations. Ideal for learning about algorithm efficiency and optimization techniques.
Add a description, image, and links to the traveling-salesman-problem topic page so that developers can more easily learn about it.
To associate your repository with the traveling-salesman-problem topic, visit your repo's landing page and select "manage topics."