The following code examines two variables -- x and y -- and prints the largest odd number among them. If none of them is odd, it prints a message to that effect. def largestOdd(x,y): """ x and y are numbers Returns the maximum odd number of x and y. If they all are even, return None """ foundOdd = False largest = 0 if x % 2 == 1 : largest = x foundOdd = True if y % 2 == 1 : if not foundOdd : largest = y foundOdd = True elif y > largest : largest = y if foundOdd : return largest else : return None Assume that largestOdd is called with numbers as arguments. Which of the following test suites would make a path-complete glass box test suite for largestOdd? Question 6 options: Test Suite A: foundOdd(2,4), foundOdd(2,5), foundOdd(11,12), foundOdd(11,13), foundOdd(11,7) Test Suite B: foundOdd(2,4), foundOdd(2,6), foundOdd(11,12), foundOdd(11,13), foundOdd(11,7) Test Suite C: foundOdd(2,4), foundOdd(2,6), foundOdd(11,8), foundOdd(11,13), foundOdd(11,15) Test Suite D: foundOdd(2,4), foundOdd(2,1), foundOdd(11,9), foundOdd(11,13), foundOdd(11,7)

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

The following code examines two variables -- x and y -- and prints the largest odd number among them. If none of them is odd, it prints a message to that effect.

def largestOdd(x,y):
"""
x and y are numbers
Returns the maximum odd number of x and y.
If they all are even, return None
"""

foundOdd = False
largest = 0
if x % 2 == 1 :
largest = x
foundOdd = True
if y % 2 == 1 :
if not foundOdd :
largest = y
foundOdd = True
elif y > largest :
largest = y
if foundOdd :
return largest
else :
return None

Assume that largestOdd is called with numbers as arguments.
Which of the following test suites would make a path-complete glass box test suite for largestOdd?

Question 6 options:

	Test Suite A: foundOdd(2,4), foundOdd(2,5), foundOdd(11,12), foundOdd(11,13), foundOdd(11,7)
	Test Suite B: foundOdd(2,4), foundOdd(2,6), foundOdd(11,12), foundOdd(11,13), foundOdd(11,7)
	Test Suite C: foundOdd(2,4), foundOdd(2,6), foundOdd(11,8), foundOdd(11,13), foundOdd(11,15)
	Test Suite D: foundOdd(2,4), foundOdd(2,1), foundOdd(11,9), foundOdd(11,13), foundOdd(11,7)