java programming question using netbeans, assignment help

User Generated

ZFP PFVE

Programming

Description

I have four Java assignments, they are all similar. They are all about testing techniques. Here's one of them, if you're interested in this job, I can setup questions for the other three, I would like to work with same person. I'll have more in couple days. I can send you the book along with the class notes if you need them, but I don't think any of them are helpful anyway. I can only pay $10 for each, or best offer. Here is the first assignment: #1 in the assignment is solved, the coding problem is #2 and that's what needs to be done here, you need to build a GUI on Netbeans that would do the job described in the attached word doc. Thank you!

Unformatted Attachment Preview

Lab 11 1. Given the following programs,  how many test cases are needed for pair-wise integration testing? 5  how many test cases are needed for neighborhood integration testing? Neighborhoods = nodes – sink nodes = 2  Are decomposition based integration testing approaches applicable? No Why? Because I can’t determine the sub-systems here Test Integer B C System public class Test { public static void main(String[] args) { int i = Integer.parseInt(args[0]); int j = Integer.parseInt(args[1]); B b = new B(); C c = new C(); if (i < 25) { if (j > 10) { i = b.mb1(j); System.out.println(i); } System.out.println(j); } else { i = c.mc1(j); System.out.println(i); } System.out.println(i); } } public class C { public int mc1(int j) { if (j > 25) { return 100; } else if (j > 20) { return mc2(j); } else { return 0; } } public int mc2(int j) { if (j > 10) { return 100; } else { return 0; } } } public class B { C c = new C(); int sum = 0; public B() { for (int i = 0; i < 10; i++) { sum += i; mb2(i); } } public int mb1(int j) { return c.mc1(j); } public int mb2(int j) { while (j < 5) { if (j > 2) { sum += c.mc2(j - 3); } else { sum += c.mc2(j + 2); } j++; } return sum; } } 2. Given a graph in the format like the previous C1 program, show all the paths for C1p test coverage. Ensure that each path will eventually reach the outcome and a predicate on a path will not be traversed more than once. Display the total number of paths created. Ensure the programs are compilable, executable and fault free.
Purchase answer to see full attachment
User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

Explanation & Answer

...


Anonymous
Great study resource, helped me a lot.

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4

Related Tags