Determines where the characters in hand can be used to spell the word. Each character in hand can only be used once.If we are trying to spell a word with two A's in it, there must be at least two A's in hand. hand the jumble of characters available to spell with word the word that we are testing trying to spell return true if the characters in hand can be used to spell the word; otherwise, false. public static boolean canSpell( char[] hand, char[] word ) { Type the code; } Tests Cases /// Validates that the canSpell correctly indicates a hand that /// does not contain the correct letters cannot spell the word public static boolean unitTest2_1() { String hand = "ZAMIT"; String word = "AMAZE";   boolean result = TileGame.canSpell(hand.toCharArray(), word.toCharArray() ); if(result) { return false; } return true; }   /// Validates that canSpell correctly indicates a hand that contains /// all matching letters but too few of the letters cannot spell the /// word public static boolean unitTest2_2() { String hand = "ZAMET"; String word = "AMAZE";   boolean result = TileGame.canSpell(hand.toCharArray(), word.toCharArray() ); if(result) { return false; } return true; }   /// Validates that canSpell correctly indicates a hand can spell a word /// for which it has the correct letters and multiple instances of some /// of those letters public static boolean unitTest2_3() { String hand = "ZAMEA"; String word = "AMAZE";   boolean result = TileGame.canSpell(hand.toCharArray(), word.toCharArray() ); if(!result) { return false; } return true; }   /// Validates that canSpell correctly handles an invalid reference to /// a hand public static boolean unitTest2_4() { char[] hand = null; String word = "AMAZE";   boolean result = TileGame.canSpell(hand, word.toCharArray() ); if(result) { return false; } return true; }   /// Validates that canSpell correctly handles an invalid reference to /// a word public static boolean unitTest2_5() { String hand = "ZAM"; char[] word = null;   boolean result = TileGame.canSpell(hand.toCharArray(), word ); if(result) { return false; } return true; } All test case should return as succeed or true

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Determines where the characters in hand can be used to spell the word. Each character in hand can only be used once.If we are trying to spell a word with two A's in it, there must be at least two A's in hand. hand the jumble of characters available to spell with word the word that we are testing trying to spell return true if the characters in hand can be used to spell the word; otherwise, false.

public static boolean canSpell( char[] hand, char[] word ) {

Type the code;

}

Tests Cases

/// Validates that the canSpell correctly indicates a hand that

/// does not contain the correct letters cannot spell the word

public static boolean unitTest2_1() {

String hand = "ZAMIT";

String word = "AMAZE";

 

boolean result = TileGame.canSpell(hand.toCharArray(), word.toCharArray() );

if(result) {

return false;

}

return true;

}

 

/// Validates that canSpell correctly indicates a hand that contains

/// all matching letters but too few of the letters cannot spell the

/// word

public static boolean unitTest2_2() {

String hand = "ZAMET";

String word = "AMAZE";

 

boolean result = TileGame.canSpell(hand.toCharArray(), word.toCharArray() );

if(result) {

return false;

}

return true;

}

 

/// Validates that canSpell correctly indicates a hand can spell a word

/// for which it has the correct letters and multiple instances of some

/// of those letters

public static boolean unitTest2_3() {

String hand = "ZAMEA";

String word = "AMAZE";

 

boolean result = TileGame.canSpell(hand.toCharArray(), word.toCharArray() );

if(!result) {

return false;

}

return true;

}

 

/// Validates that canSpell correctly handles an invalid reference to

/// a hand

public static boolean unitTest2_4() {

char[] hand = null;

String word = "AMAZE";

 

boolean result = TileGame.canSpell(hand, word.toCharArray() );

if(result) {

return false;

}

return true;

}

 

/// Validates that canSpell correctly handles an invalid reference to

/// a word

public static boolean unitTest2_5() {

String hand = "ZAM";

char[] word = null;

 

boolean result = TileGame.canSpell(hand.toCharArray(), word );

if(result) {

return false;

}

return true;

}

All test case should return as succeed or true

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
void method
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.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education