Exercise 1

Features:

• generates the shortest possible sequence that contains all the necessary combinations of length n
• the solution is based on a graph using dfs to construct the sequence
• checks that all the combinations appear in the sequence by displaying them
• displays the length of the sequence

Instructions:

-enter n and k from 1 to 4, respectively from 1 to 10

Exercise 2

Features:

• the solution is based on the implementation of a binary tree
• computes the minimum number of dragons that are needed : every node is covered by a dragon or has a child with a dragon

Instructions:

• the tree is built in the main() using setInfo()
• to test different cases, modify the tree
• the output will be displayed after calculating the minimum number of dragons

Exercise 3

Features:

• the implementation uses a graph header
• the program reads a list of tasks, the deadlines and the dependencies and searches for a way to assign everything to the cores
• all tasks must be done before the deadline
• the total energy must be minimum

Instructions:

• introduce the data in the input.txt file
• the results will be displayed under the form of a table