There are 1 repository under advanced-algorithms topic.
✔ My Solutions of (Algorithmic-Toolbox ) Assignments from Coursera ( University of California San Diego ) With "Go In Depth" Part Which Contains More Details With Each of The Course Topics
Solutions to 500+ UVa Online Judge problems
This source code (in Python) is a preliminary implementation of my quadratic-time positive integer matrix multiplication.
Online Specialization in Machine Learning for beginners : it contains my solutions to the programming assignment
Here is some assignments code of my CSE (Advanced Algorithm) Course based on some popular algorithm.
Competitive C++ solution to the Travelling Salesperson 2D problem, that includes the implementation of 6 algorithms: greedy, Clarke-Wright, Christofides, 2-opt, 3-opt, and Lin-Kernighan (k-opt). Done as part of the project assignment in the *DD22440 Advanced Algorithms* course at KTH, by Prof. Danupon Nanongkai.
ICS4U ISP - Group Project
Ecommerce Android Application
Advanced library
Advanced Algorithm Programming Assignments
My Advanced Algorithms notes.
Samples of Advanced Algorithms and Data Analysis implemented in pyspark
Implementations of classic graph algorithms across three assignments
Developed advanced algorithms (A*, Markov Decision Process, Reinforcement Learning, and Machine Learning) to optimize Pac-Man’s path in the maze for efficient pellet collection while evading ghosts.
Assignments for the "Advanced Algortihms and Parallel Programming" course at Politecnico di Milano - A.Y. 2023/2024
Priority queues in finding shortest path.
Homework Assignments for reference of CS 600 A Course by Prof. R. Peyrovian at Stevens Institute of Technology.
A* Path Finding Algorithm designed & implemented with manhattan hieuristic & visualized through pygame.
This GitHub repo contains notebooks having advance knowledge to scale up your python knowledge with this curated list of advance topics.
Learn Advanced Algorithms | MFP - 8086 | Operating System | MERN Stack
Coding Ninjas
Here you can find different codes form out more complex projects that will help you with the most difficult and challenging ideas that you can imagine.
Advanced Algorithms in DSA
This repository contains implementations of algorithms designed to find the minimum cut in a graph.
This repository contains implementations of various algorithms to solve the Minimum Spanning Tree (MST) problem.
This repository contains implementations of various algorithms to solve the Travelling Salesman Problem (TSP).
This repository contains all the solutions for the assignments of the course offered on Coursera.
An implementation of Dijkstra's algorithm designed to evaluate its true complexity by analyzing runtime, memory usage, and efficiency across multiple DIMACS graph instances.
An implementation of the He and Xu randomized algorithm for solving the 0-1 Knapsack Problem, designed to evaluate its success rate and performance in comparison to the traditional approach.
An implementation of the Hungarian algorithm for solving minimum-weight perfect matching in bipartite graphs, supporting both minimum and maximum weight modes.
An implementation of Ford-Fulkerson variants (Edmonds-Karp, Randomized DFS, Fattest Path) designed to evaluate their performance across multiple DIMACS graph instances.
This project implements five algorithms—linear search, binary search, hashing, Bloom filter, and Cuckoo filter—to solve the Login Checker Problem. It also includes a numerical comparison of their performance in terms of time complexity.
A gesture-controlled robotic arm powered by computer vision. Using a webcam and cvzone for hand tracking, finger movements are converted into binary signals and sent to an Arduino Uno. The Arduino interprets these signals to control servo motors, eliminating the need for external sensors or gloves.
📚DSA_Prep – Master DSA with clean implementations, optimized solutions, and curated practice problems. Ideal for interview prep🎯 and competitive coding🏆..