Using the source code below: public int Fun1(int x, int y){ k = 0; while (x...

 

Transcribed Image Text:

Using the source code below: public int Fun1(int x, int y){ k = 0; while (x <= 10 && k < 10){ if (x%2!= 0){ k=k+y; k = k - 2; } X = x + 1; k = x + k; } if (x < 0){ X = Y; k=k+x; } return k; } 1. Draw a data flow graph for the code. 2. Identify all def clear paths in your graph. 3. Identify all simple paths in your graph. 5. Identify at least one loop free path in your graph. 6. Identify all p-uses/Some c-uses in your graph. Using the source code below: public int Fun1(int x, int y){ k = 0; while (x <= 10 && k < 10){ if (x%2!= 0){ k=k+y; k = k - 2; } X = x + 1; k = x + k; } if (x < 0){ X = Y; k=k+x; } return k; } 1. Draw a data flow graph for the code. 2. Identify all def clear paths in your graph. 3. Identify all simple paths in your graph. 5. Identify at least one loop free path in your graph. 6. Identify all p-uses/Some c-uses in your graph.

Answer rating: 100% (QA)

Step 1 a Flow graph for the method Fun In this part we need to represent the method Fun as a flow graph labeling the nodes starting with A and appropriately connecting them Heres the flow graph A B C ... View the full answer