Test cases for the algorithm given in “R5.10”:

Test case #1:

Consider the values that satisfy the “if” part from the outer “if” block:

"letter" = 'c'

"number" = 3

In the above case:

The first “if” condition satisfies for the letter “c”,

The number is “3” which is an odd number and therefore, the “if” condition becomes true.

The color “black” will be assigned to “color”.

Test case #2:

Consider the values that satisfy the “else” part from outer “if” block:

"letter" = 'g'

"number" = 4

In the above case:

The first “if” condition satisfies for the letter “g”,

The number is “4” which is an even number and therefore, the “else” part becomes true.

The color “white” will be assigned to “color”...

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 3, Problem 10RE

Chapter 3, Problem 12RE

Students have asked these similar questions

Write a recursive implementation of Euclid’s algorithm for finding the greatest common divisor (GCD) of two integers. Descriptions of this algorithm are available in algebra books and on the Web. Write a test program that calls your GCD procedure five times, using the following pairs of integers: (5,20), (24,18), (11,7), (432,226), (26,13). After each procedure call, display the GCD.

The Binary Search algorithm works by testing a mid-point, then eliminating half of the list. In this exercise, you are going to take our binary search algorithm and add print statements so that you can track how the search executes. Inside of the recursive binary search function, add print statements to print out the starting, ending, and midpoint values each time. Then as you test a value, print out the results, either too high, too low, or a match. Sample Output Starting value: 0 Ending value: 9 Testing midpoint value: 4 Too high! Starting value: 0 Ending value: 3 Testing midpoint value: 1 Too low! Starting value: 2 Ending value: 3 Testing midpoint value: 2 Match! public class BinaryExplorer { public static void main(String[] args) {int[] testArray = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; binaryRec(testArray, 8, 0, testArray.length - 1); } /*** Add Print statements to the binaryRec method:* * Print Starting, ending, and midpoint values.* * Print when you find a match* * Print if you are…

IN JAVA Alice and Bob are playing a board game with a deck of nine cards. For each digit between 1 to 9, there is one card with that digit on it. Alice and Bob each draw two cards after shuffling the cards, and see the digits on their own cards without revealing the digits to each other. Then Alice gives her two cards to Bob. Bob sees the digits on Alice’s cards and lays all the four cards on the table in increasing order by the digits. Cards are laid facing down. Bob tells Alice the positions of her two cards. The goal of Alice is to guess the digits on Bob’s two cards. Can Alice uniquely determine these two digits and guess them correctly? Input The input has two integers p,q (1≤p<q≤9) on the first line, giving the digits on Alice’s cards. The next line has a string containing two ‘A’s and two ‘B’s, giving the positions of Alice’s and Bob’s cards on the table. It is guaranteed that Bob correctly sorts the cards and gives the correct positions of Alice’s cards. Output If Alice can…

Chapter 3 Solutions

Big Java Late Objects

Ch. 3.1 - In some Asian countries, the number 14 is...Ch. 3.1 - Consider the following if statement to compute a...Ch. 3.1 - Prob. 3SC Ch. 3.1 - Prob. 4SC Ch. 3.1 - The variables fuel Amount and fuel Capacity hold...Ch. 3.2 - Which of the following conditions are true,...Ch. 3.2 - Prob. 7SC Ch. 3.2 - What is the error in this statement? if (scoreA =...Ch. 3.2 - Supply a condition in this if statement to test...Ch. 3.2 - Prob. 10SC

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Solution Summary: The author explains the test cases for the algorithm given in "R5.10".

Concept explainers

Explanation of Solution

Want to see the full answer?

Chapter 3 Solutions