Question: Question 2 (6 marks) Design and write, in pseudocode, a backtracking algorithm that solves the following problem (3-D Matching). Input: A base set X and
Question 2 (6 marks) Design and write, in pseudocode, a backtracking algorithm that solves the following problem (3-D Matching). Input: A base set X and a set of triples S C{(x, y, )|X, Y, Z EX}. Output: Is there some S' CS such that every element of X occurs in exactly one triple of S
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
