Instructions: All answers must be proved: it is not sucient to simply state the
ID: 3843289 • Letter: I
Question
Instructions: All answers must be proved: it is not sucient to simply state the answer. All answers must be written in your own words.
Treat single arithmetic operations (addition, subtraction, multiplication, and division) as constant time operations.
Note: I am posting this question second time and I did not satisy from first one. Please answer me clearly according to statement. Thank You!
Problem: Suppose you have a set of N project managers and 2N software engineers. Each project manager is only willing to work with certain software engineers. The software engineers have no preferences. Design an algorithm to divide this group into N teams, each containing one project manager and two software engineers, such that the project manager preferences are not violated (i.e., no project manager has to work with a software engineer that they don’t want to work with).
P.S: You are expected to transform it to max flow problem and solve it using Ford-Fulkerson Algorithm.
Explanation / Answer
Hi,
It seems that when the Network edge is even and if we perform constant operations ( add,multiply,divide and substract)
all the results will be even . This is from the first principles that a number when does any above numerical operations will result in even number only. Hence , the Network flow algortihm at each edge will be Even as every edge is has even capacity.