Write and document a Python program that uses the recursive DFS-I (no dynamic pruning) algorithm given in course lecture # 4 to print all minimum-size set covers for a given MSC instance in which the elements i1, i2, ..., ib are the integers 1, 2, ..., n. You have been given Python files myCSTMSCClasses.py and CSTMSC.py and you need to fill in the function definitions in file myCSTMSCFunctions.template according to appropriately modified versions of the specified algorithm given in Lectures #4 to create a file myCSTMSCFunctions.py such that CSTMSC.py (when run relative to given problem-description files iset1.txt, iset2.txt, iset3.txt, iset4.txt, iset5.txt, iset6.txt, iset7.txt, and iset8.txt using python3 on the CS departmental LabNet systems) can exactly reproduce the outputs in script file out.script.
You are not allowed to modify any of the code in provided files CSTMSC.py and myCSTMSCClasses.py. When modifying file myCSTMSCFunctions.template to create myCSTMSCFunctions.py, you cannot:
Violations of any of these constraints will result in severe mark deductions (see assignment evaluation scheme below).
######################################################### ## CS 3600 (Winter 2025), Assignment #1 ## ## Script File Name: myCSTMSCFunctions.py ## ## Student Name: Todd Wareham ## ## Login Name: harold ## ## MUN #: 8008765 ## #########################################################You do not have to develop your code on our CS departmental systems. However, as your code will be compiled and tested on our CS departmental systems as part of the assignment marking process, you should ensure that your code compiles and runs correctly on at least one of these systems.
Created: November 29, 2024
Last Modified: January 15, 2025