Create a class called StringArrayHelper that has the following attributes: StringArrayHelper StringArrayHelper () StringArrayHelper (String[]) addItem(String) - Boolean removeltem(String) - Boolean searchItem(String) - Boolean sortArray() - Boolean getSize()- Integer getCapacity()- Integer toString() - String Note: myArray] - String size - Integer addItem(String) will add an item to the list if it will fit. It will add the item to the first available spot removeltem(String) will remove the given item and move all items that appear after the removed one in the list up one spot. Leaving all null values at the end of the list. searchltem(String) will return true if that given string exists within the list and false if it does not. sortArray() will use a selection sort to sort the list and return true if the list is sorted. getSize() will return the total number of items that are currently in the array. getCapacity() returns the total number of items that the array could possibly hold.

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

21

Java only

Create a class called StringArrayHelper that has the following attributes:
StringArrayHelper ()
StringArrayHelper (String[])
addItem(String) - Boolean
removeltem(String) - Boolean
searchItem(String) - Boolean
sortArray() - Boolean
getSize()- Integer
getCapacity()- Integer
toString() - String
Note:
StringArrayHelper
myArray[] - String
size - Integer
addItem(String) will add an item to the list if it will fit. It will add the item to the first available spot
removeltem(String) will remove the given item and move all items that appear after the removed one in the list up one spot. Leaving all null values at the end of the list.
searchItem(String) will return true if that given string exists within the list and false if it does not.
sortArray() will use a selection sort to sort the list and return true if the list is sorted.
getSize() will return the total number of items that are currently in the array.
getCapacity() returns the total number of items that the array could possibly hold.
Transcribed Image Text:Create a class called StringArrayHelper that has the following attributes: StringArrayHelper () StringArrayHelper (String[]) addItem(String) - Boolean removeltem(String) - Boolean searchItem(String) - Boolean sortArray() - Boolean getSize()- Integer getCapacity()- Integer toString() - String Note: StringArrayHelper myArray[] - String size - Integer addItem(String) will add an item to the list if it will fit. It will add the item to the first available spot removeltem(String) will remove the given item and move all items that appear after the removed one in the list up one spot. Leaving all null values at the end of the list. searchItem(String) will return true if that given string exists within the list and false if it does not. sortArray() will use a selection sort to sort the list and return true if the list is sorted. getSize() will return the total number of items that are currently in the array. getCapacity() returns the total number of items that the array could possibly hold.
Expert Solution
steps

Step by step

Solved in 4 steps with 4 images

Blurred answer
Knowledge Booster
Random Class and its operations
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
  • SEE MORE 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