1. Chapter 1 a. Complete Section 1.2 #3 for the findLast method. T...
Question
1. Chapter 1
a. Complete Section 1.2 #3 for the findLast method. To do this, rewrite the method in an executable Java program.
b. Create a set of JUnit test cases implementing the test sets from (a) and provide the results.
2. Chapter 2
Consider the following code snippet:
public static void checkStutter (BufferedReader input){
int numberOfLines = 1;
String line = null;
String lastWord = null;
// Get the first line from the file argument
line = input.readLine();
// Keep reading and analyzing lines until end of file
while (line != null){
// Convert the input line to lower case
line = line.toLowerCase();
// Splits into words and puts in an array of strings
String[] words = line.split (" ");
// Compare with the last word on the previous line
if (words [0].equals (lastWord))
System.out.println ("Repeated word on line " +
numberOfLines + ": " + words[0]);
// Stop before end, nothing to compare last word with
for (int i = 0; i < (words.length-1); i++){
// Check if current and subsequent words are same
if (words [i].equals (words [i+1]))
System.out.println ("Repeated word on line"
+ numberOfLines + ": " + words [i]);
}
// Save last word in the line
lastWord = words [words.length-1];
// Get the next line from the file argument
line = input.readLine();
// Increment line counter
numberOfLines++;
}
}
a. Draw a control flow graph for the checkStutter method and calculate the cyclomatic complexity.
b. Provide the test requirements and test set for node coverage and edge coverage for your graph.
c. List all the du-paths with respect to line and numberOfLines.
d. List a minimal test set that satisfies all-defs coverage with respect to line and numberOfLines.
e. List a minimal test set that satisfies all-uses coverage with respect to line and numberOfLines.
3. Chapter 3
Consider the checkStutter method from Question 2. This method takes an input stream, named input, as an argument. We can consider this argument simply as an array of String objects that is then split into an array of String words. With that in mind, consider the following:
a. Identify the predicates in the checkStutter method.
b. Provide the test requirements and test set for predicate coverage for each of the predicates identified in (a).
c. If you were to construct a clause coverage test set for the checkStutter predicates, would it be different from (b)? Why or why not?
d. Instrument the given checkStutter method to record which edges are traversed (i.e., add print statement between nodes indicating the current location) and instrument the given code (i.e., in the main method or another test method) with the test cases from (c) to test your code and view the output. Provide the commented code and output results.
4. Chapter 4.
a. Complete Section 4.1, Exercise #2.
b. Complete Section 4.2, Exercise #4.
5. Chapter 5
Consider the following class that implements the Luhn algorithm (see http://de.wikipedia.org/wiki/Luhn-Algorithmus) for checking credit card numbers:
public class Luhn{
public static boolean check(String ccNumber){
int sum = 0;
boolean alternate = false;
for (int i = ccNumber.length() - 1; i >= 0; i--){
int n =
Integer.parseInt(ccNumber.substring(i,i+1));
if (alternate){
n *= 2;
if (n > 9){
n = (n % 10) + 1;
}
}
sum += n;
alternate = !alternate;
}
return (sum % 10 == 0);
}
}
Define 10 mutants for the check method using the effective mutation operators given in Chapter 5. Try to use each operator at least once. For each mutation, give a brief description. Approximately how many mutants for the check method if we generated all from the effective mutation operators? Justify your answer.
Book: INTRODUCTION TO SOFTWARE TESTING
Paul Ammann, George Mason University, Jeff Offutt
George Mason University
a. Complete Section 1.2 #3 for the findLast method. To do this, rewrite the method in an executable Java program.
b. Create a set of JUnit test cases implementing the test sets from (a) and provide the results.
2. Chapter 2
Consider the following code snippet:
public static void checkStutter (BufferedReader input){
int numberOfLines = 1;
String line = null;
String lastWord = null;
// Get the first line from the file argument
line = input.readLine();
// Keep reading and analyzing lines until end of file
while (line != null){
// Convert the input line to lower case
line = line.toLowerCase();
// Splits into words and puts in an array of strings
String[] words = line.split (" ");
// Compare with the last word on the previous line
if (words [0].equals (lastWord))
System.out.println ("Repeated word on line " +
numberOfLines + ": " + words[0]);
// Stop before end, nothing to compare last word with
for (int i = 0; i < (words.length-1); i++){
// Check if current and subsequent words are same
if (words [i].equals (words [i+1]))
System.out.println ("Repeated word on line"
+ numberOfLines + ": " + words [i]);
}
// Save last word in the line
lastWord = words [words.length-1];
// Get the next line from the file argument
line = input.readLine();
// Increment line counter
numberOfLines++;
}
}
a. Draw a control flow graph for the checkStutter method and calculate the cyclomatic complexity.
b. Provide the test requirements and test set for node coverage and edge coverage for your graph.
c. List all the du-paths with respect to line and numberOfLines.
d. List a minimal test set that satisfies all-defs coverage with respect to line and numberOfLines.
e. List a minimal test set that satisfies all-uses coverage with respect to line and numberOfLines.
3. Chapter 3
Consider the checkStutter method from Question 2. This method takes an input stream, named input, as an argument. We can consider this argument simply as an array of String objects that is then split into an array of String words. With that in mind, consider the following:
a. Identify the predicates in the checkStutter method.
b. Provide the test requirements and test set for predicate coverage for each of the predicates identified in (a).
c. If you were to construct a clause coverage test set for the checkStutter predicates, would it be different from (b)? Why or why not?
d. Instrument the given checkStutter method to record which edges are traversed (i.e., add print statement between nodes indicating the current location) and instrument the given code (i.e., in the main method or another test method) with the test cases from (c) to test your code and view the output. Provide the commented code and output results.
4. Chapter 4.
a. Complete Section 4.1, Exercise #2.
b. Complete Section 4.2, Exercise #4.
5. Chapter 5
Consider the following class that implements the Luhn algorithm (see http://de.wikipedia.org/wiki/Luhn-Algorithmus) for checking credit card numbers:
public class Luhn{
public static boolean check(String ccNumber){
int sum = 0;
boolean alternate = false;
for (int i = ccNumber.length() - 1; i >= 0; i--){
int n =
Integer.parseInt(ccNumber.substring(i,i+1));
if (alternate){
n *= 2;
if (n > 9){
n = (n % 10) + 1;
}
}
sum += n;
alternate = !alternate;
}
return (sum % 10 == 0);
}
}
Define 10 mutants for the check method using the effective mutation operators given in Chapter 5. Try to use each operator at least once. For each mutation, give a brief description. Approximately how many mutants for the check method if we generated all from the effective mutation operators? Justify your answer.
Book: INTRODUCTION TO SOFTWARE TESTING
Paul Ammann, George Mason University, Jeff Offutt
George Mason University
Solution Preview
These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references.
Students may use these solutions for personal skill-building and practice.
Unethical use is strictly forbidden.
1. Chapter 1
a.
Complete Section 1.2 #3 for the findLast method. To do this, rewrite the method in an executable Java program.
public int findLast (int[] x, int y) {
//Effects: If x==null throw NullPointerException
// else return the index of the last element
// in x that equals y.
// If no such element exists, return -1
if (x == null) {
throw new NullPointerException();
}
for (int i=x.length-1; i >= 0; i--){
if (x[i] == y){
return i;
}
}
return -1;
}
b.
Create a set of JUnit test cases implementing the test sets from (a) and provide the results.
import static org.junit.Assert.*;
import org.junit.After;
import org.junit.Before;
import org.junit.Test;
public class chapter1b {
private int [] x = {2 , 3, 5};
private int y = 2;
private chapter1a obj;
@Before
public void setUp() throws Exception {
obj = new chapter1a();
}
@After
public void tearDown() throws Exception {
}
@Test
public void testFindLast() {
assertEquals(0, obj.findLast(x, y));
}
}
a.
Complete Section 1.2 #3 for the findLast method. To do this, rewrite the method in an executable Java program.
public int findLast (int[] x, int y) {
//Effects: If x==null throw NullPointerException
// else return the index of the last element
// in x that equals y.
// If no such element exists, return -1
if (x == null) {
throw new NullPointerException();
}
for (int i=x.length-1; i >= 0; i--){
if (x[i] == y){
return i;
}
}
return -1;
}
b.
Create a set of JUnit test cases implementing the test sets from (a) and provide the results.
import static org.junit.Assert.*;
import org.junit.After;
import org.junit.Before;
import org.junit.Test;
public class chapter1b {
private int [] x = {2 , 3, 5};
private int y = 2;
private chapter1a obj;
@Before
public void setUp() throws Exception {
obj = new chapter1a();
}
@After
public void tearDown() throws Exception {
}
@Test
public void testFindLast() {
assertEquals(0, obj.findLast(x, y));
}
}
This is only a preview of the solution.
Please use the purchase button to see the entire solution.
Please use the purchase button to see the entire solution.
By purchasing this solution you'll be able to access the following files:
Solution.docx
Purchase Solution
$125.00
View Available
Computer Science Tutors 529 tutors matched
Ionut
(ionut)
Hi! MSc Applied Informatics & Computer Science Engineer. Practical experience in many CS & IT branches.Research work & homework
5/5 (5,654+ sessions)
2 hours avg response
Leo
(Leo)
Hi!
I have been a professor in New York and taught in a math department and in an applied math department.
4.9/5 (5,652+ sessions)
2 hours avg response
Pranay
(math1983)
Ph.D. in mathematics and working as an Assistant Professor in University. I can provide help in mathematics, statistics and allied areas.
4.6/5 (5,512+ sessions)
1 hour avg response