The purpose of this repository is to host my assigments for the course "Algorithms and Data Structures" by professor Panos Louridas. After reading the book Real-World Algorithms and undertanding the theoretical background of the algorithms presented we were introduced to the following three assignments.
The objective of the first assignment is to create an algorithm that solves a crossword with a twist. In our case the crossword is not a regural one. Given a file of regural expression we need to fill the gaps of the crossword with the strings generated from those expressions.
Click here for more
The purpose of the second assignment is to find the mininum number of straight lines passing through the points so that you cover all of them. This problem is known as the hitting objects, or point cover, or line cover, or point line cover problem.
Click here for more
The objective of the third assignment is to generate all the gray or beckett-gray codes from a given number of bits.
Click here for more