Tutorials given as one of the TAs for the class "Algorithm Design and Analysis" at Nanjing University

My Solutions to basic Algorithms and Data Structures

Gebze Technical University - Computer Engineering Assignments

Breadth First Search & Depth First Search graph algorithms

This source code (in Python) is a preliminary implementation of my quadratic-time positive integer matrix multiplication.

Approximation Algorithm for the NP-Complete problem of finding a vertex cover of minimum weight in a graph with weighted vertices. Guarantees an answers at most 2 times the optimal minimum weighted vertex cover

Algorithm Design Solved Exercises

Some collection of codes that are used in data mining and data science related fields, developed by me

implementation of algorithm design

SmartChess is a Bluetooth enabled, smart Chessboard. SmartChess utilizes an integrated circuit to recognize where there are pieces on the board. That information is sent to the accompanying app, which provides the user with a live view of the board. The app can give hints, recommend moves, and enforces legal moves.

Sequence Alignment (Needleman–Wunsch Algorithm using Dynamic Programming) for aligning sequences (words, sentences, DNA etc.)

Greedy Algorithm to find the maximum number of mutually compatible jobs

📐 A desktop application practice and powered by JavaFx. (Curriculum design for algorithm)

Approximation Algorithm for the NP-Complete problem of balancing job loads on machines. Does not guarantee an optimal solution, but instead, a solution is within a factor of 1.5 of the optimal solution

Algorithms Analysis + Code in Python

Multi-pronged, multi-stage analysis of a 3.5M-sentences science fiction corpus using optimized NLP, with NER techniques, LDA modeling and LLM integration. After final commit, will be able to run a main file to generate a visualization of results on-demand. Modularized and documented code that can easily be reused/refitted for other kinds of corpii.

This repository is for placing the solution content of the algorithm design class of Hakim Sabzevari University

Polynomial Multiplication using Karatsuba's Algorithm

A graphical programming tool built on Java

The project implements an algorithm that finds the closest pair of points in a 2D screen using a time complexity of O(n log n). The algorithm is implemented in an iOS application using the MVC architectural pattern.