Description

CSE 331 Computer Organization
Project 1 – MIPS Assembly
Min-Set-Cover problem is used to find the least number of sets that can cover the union of all given sets.

Write an assembly program that takes different sets Si and then returns the indices of the sets so that the minimum number of sets are chosen. And the union of these sets is equal to the union of all sets as explained in the above definition.

Actually optimal solution for that problem has no known polynomial time solution. It is an NP-complete problem. Therefore, you will implement a sub-optimal greedy heuristic solution for the problem as shown below:

Rules:
2. Your code must not have any bound on number of given sets.
3. Assembly that cannot be executed can at most get 20pts.

BONUS:

Taking all sets from a text file instead of MIPS console is a bonus with extra 25pts.

In order to read a file you have to use syscall code 13 to open file and code
14 to read file. Details can be found here:

http://courses.missouristate.edu/kenvollmar/mars/help/syscallhelp.html