Answered step by step
Verified Expert Solution
Question
1 Approved Answer
full answer please the first -Program Dependency graph (PDG): like tree digram -Backward static slicing -Dynamic Program Slice SUBMISSION IS ONLY ACCEPTED THROUGH THE EDUGATE
full answer please the first
SUBMISSION IS ONLY ACCEPTED THROUGH THE EDUGATE SYSTEM Based on the code provided below, solve the following questions: 1 public String Compute(int marks) 2 { 3 int size-marks.length-1; 4 int passe, fail-e, sumPass, sumFail-e; 5 int i-: 6 while( i= size) 7 8 if(marks[i]>-50) 9 10 pass++; 11 SumPass++; 12 13 else { 15 fail++; 16 sumFail : 12 18 19 > 20 21 return "Average of Pass." +(sumpass/pass). Average of fails-+(sumFail/fail); 14 22 ) Draw Program Dependency Graph (PDG) for the above shown program. 4): Find Program Slice for the above shown program under the slice criterion using Backward static slicing, pFind Dynamic Program Silice for the above shown program under the slice criterion -Program Dependency graph (PDG): like tree digram
-Backward static slicing
-Dynamic Program Slice
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started