My Solutions to basic Algorithms and Data Structures

Breadth First Search & Depth First Search graph algorithms

Gebze Technical University - Computer Engineering Assignments

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

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

implementation of algorithm design

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

Polynomial Multiplication using Karatsuba's Algorithm

A graphical programming tool built on Java

A university project in which the following problems are solved in Java language and also have a graphical appearance using JavaFX

End-to-end architecture for the representation and solution of Rubik's cube problems.

Greedy Algorithm to find a minimum spanning tree in an undirected graph by deleting heaviest edges unless it would disconnect the graph

Learned Data Structures and Algorithms: Basic Programming Constructs, Data types, Search trees, Hashing, Complexity Analysis, Algorithm design, Graph algorithms, Sort algorithms

Finds how similar 2 lists of rating are using the Divide and Conquer approach. Extension of MergeSort that actually displays the specific inversions as well as just counting the total number.

Finds a Topological Ordering of vertices in a Directed Acyclic Graph

Java based fitness application designed to simplify workout tracking and diet planning, tailored to users' needs.

Course Name: Design and Analysis of Computer Algorithms