Test Case 2 How many strings? n 10 ENTER Enter a value: \n doltishness ENTER Enter a value: \n subclass ENTER Enter a value: \n carbonized ENTER Enter a value: \n myxoma ENTER Enter a value: \n...

Add a new method to ArrayTools with filter. Make this method accept a String array. Change all the Strings that are longer than 5 characters to uppercase.

Write in Java and use test cases 1 & 2 as a result.

$Test Case 2 How many strings? n 10 ENTER Enter a value: \n doltishness ENTER Enter a value: \n subclass ENTER Enter a value: \n carbonized ENTER Enter a value: \n myxoma ENTER Enter a value: \n quiring ENTER Enter a value: \n confutative ENTER Enter a value: \n weald ENTER Enter a value: \n unerringly ENTER Enter a value: \n unpensioning ENTER Enter a value: \n indagative ENTER [0]: DOLTISHNESS <-- Longer than five letters \n [1]: SUBCLASS <-- Longer than five letters \n [2]: CARBONIZED <-- Longer than five letters \n [3]: MYXOMA <-- Longer than five letters \n [4]: QUIRING <-- Longer than five letters \n [5]: CONFUTATIVE <-- Longer than five letters \n [6]: weald \n [7]: UNERRINGLY <-- Longer than five letters \n [8]: UNPENSIONING <-- Longer than five letters \n [9]: INDAGATIVE <-- Longer than five letters \n $

Extracted text: Test Case 2 How many strings? n 10 ENTER Enter a value: \n doltishness ENTER Enter a value: \n subclass ENTER Enter a value: \n carbonized ENTER Enter a value: \n myxoma ENTER Enter a value: \n quiring ENTER Enter a value: \n confutative ENTER Enter a value: \n weald ENTER Enter a value: \n unerringly ENTER Enter a value: \n unpensioning ENTER Enter a value: \n indagative ENTER [0]: DOLTISHNESS <-- longer="" than="" five="" letters="" \n="" [1]:="" subclass=""><-- longer="" than="" five="" letters="" \n="" [2]:="" carbonized=""><-- longer="" than="" five="" letters="" \n="" [3]:="" myxoma=""><-- longer="" than="" five="" letters="" \n="" [4]:="" quiring=""><-- longer="" than="" five="" letters="" \n="" [5]:="" confutative=""><-- longer="" than="" five="" letters="" \n="" [6]:="" weald="" \n="" [7]:="" unerringly=""><-- longer="" than="" five="" letters="" \n="" [8]:="" unpensioning=""><-- longer="" than="" five="" letters="" \n="" [9]:="" indagative=""><-- longer="" than="" five="" letters="">
$Test Case 1 How many strings? n 8 ENTER Enter a value: An aaaaaa ENTER Enter a value: \n aaaaa ENTER Enter a value: \n aaaa ENTER Enter a value: \n aaa ENTER Enter a value: \n aa ENTER Enter a value: \n a ENTER Enter a value: \n aaaaaaa ENTER Enter a value: \n hello world does this thing Work? ENTER [0]: AAAAAA <-- Longer than five letters \n [1]: аaaaa | \n [2]: аaaa\n [3]: aaa n [4]: aa \n [5]: a \n [6]: AAAAAAA <-- Longer than five letters \n [7]: HELLO WORLD DOES THIS THING WORK? <-- Longer than five letters \n $

Extracted text: Test Case 1 How many strings? n 8 ENTER Enter a value: An aaaaaa ENTER Enter a value: \n aaaaa ENTER Enter a value: \n aaaa ENTER Enter a value: \n aaa ENTER Enter a value: \n aa ENTER Enter a value: \n a ENTER Enter a value: \n aaaaaaa ENTER Enter a value: \n hello world does this thing Work? ENTER [0]: AAAAAA <-- longer="" than="" five="" letters="" \n="" [1]:="" аaaaa="" |="" \n="" [2]:="" аaaa\n="" [3]:="" aaa="" n="" [4]:="" aa="" \n="" [5]:="" a="" \n="" [6]:="" aaaaaaa=""><-- longer="" than="" five="" letters="" \n="" [7]:="" hello="" world="" does="" this="" thing="" work?=""><-- longer="" than="" five="" letters="">

Jun 04, 2022

SOLUTION.PDF

Test Case 2 How many strings? n 10 ENTER Enter a value: \n doltishness ENTER Enter a value: \n subclass ENTER Enter a value: \n carbonized ENTER Enter a value: \n myxoma ENTER Enter a value: \n...

Get Answer To This Question

Related Questions & Answers

Submit New Assignment