In this problem, you must implement the following methods: MIN, MAX, RANGE, AVÉRAGE, MODE The first line of input represents the method to call. It will be one of the following: MIN, MAX, RANGE, AVERAGE, MODE. The second line will represent an integer n, which denotes the number of words in the list. The following n lines will each be a word. The words will not necessarily be sorted. Your output should be a single line representing the results of the method. For example, here is a screenshot of the program in action: Please select one of the following inputs: MIN, MAX, RANGE, AVERAGE, MODE MODE 4 Data Structure and Algorithm 2 a) Implement the minWordLength() method, which should retun the length of the smallest word in the list. (Related the case that user enters MIN) b) Implement a method called maxWordLength(), which should return the length of the largest word in the list. (Related the case that user enters MAX) c) Implement a method called wordLengthRange(), which should return the range of lengths in the word list. (Related the case that user enters RANGE) d) Implement a method called averageWordLength(), which should re- turn the average word length in the word list. (Related the case that user enters AVERAGE) e) Implement a method called mostCommonWordLength(), which should return the most common length of the words in the list. If there is a tie, you should return -1. You may assume that the length of a word is at most 100 and at least 1. (Related the case that user enters MODE).
In this problem, you must implement the following methods: MIN, MAX, RANGE, AVÉRAGE, MODE The first line of input represents the method to call. It will be one of the following: MIN, MAX, RANGE, AVERAGE, MODE. The second line will represent an integer n, which denotes the number of words in the list. The following n lines will each be a word. The words will not necessarily be sorted. Your output should be a single line representing the results of the method. For example, here is a screenshot of the program in action: Please select one of the following inputs: MIN, MAX, RANGE, AVERAGE, MODE MODE 4 Data Structure and Algorithm 2 a) Implement the minWordLength() method, which should retun the length of the smallest word in the list. (Related the case that user enters MIN) b) Implement a method called maxWordLength(), which should return the length of the largest word in the list. (Related the case that user enters MAX) c) Implement a method called wordLengthRange(), which should return the range of lengths in the word list. (Related the case that user enters RANGE) d) Implement a method called averageWordLength(), which should re- turn the average word length in the word list. (Related the case that user enters AVERAGE) e) Implement a method called mostCommonWordLength(), which should return the most common length of the words in the list. If there is a tie, you should return -1. You may assume that the length of a word is at most 100 and at least 1. (Related the case that user enters MODE).
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...
Related questions
Question
JAVA
![In this problem, you must implement the following methods:
MIN, MAX, RANGE, AVÉRAGE, MODE
The first line of input represents the method to call. It will be one of the following: MIN, MAX,
RANGE, AVERAGE, MODE. The second line will represent an integer n, which denotes the
number of words in the list. The following n lines will each be a word. The words will not
necessarily be sorted. Your output should be a single line representing the results of the method.
For example, here is a screenshot of the program in action:
Please select one of the following inputs: MIN, MAX, RANGE, AVERAGE, MODE
MODE
4.
Data
Structure
and
Algorithm
2
a) Implement the minWordLength() method, which should retun the length of the smallest
word in the list. (Related the case that user enters MIN)
b) Implement a method called maxWordLength(), which should return the length of the
largest word in the list. (Related the case that user enters MAX)
c) Implement a method called wordLengthRange(), which should return the range of lengths
in the word list. (Related the case that user enters RANGE)
d) Implement a method called averageWordLength(), which should re- turn the average word
length in the word list. (Related the case that user enters AVERAGE)
e) Implement a method called mostCommonWordLength(), which should return the most
common length of the words in the list. If there is a tie, you should return -1. You may
assume that the length of a word is at most 100 and at least 1. (Related the case that user
enters MODE) .](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F37d035a9-daaf-42a9-b57f-4c5257555b89%2Fbc3ded41-c075-4fa6-8c6b-e150e9b9c730%2Frp30w2s_processed.jpeg&w=3840&q=75)
Transcribed Image Text:In this problem, you must implement the following methods:
MIN, MAX, RANGE, AVÉRAGE, MODE
The first line of input represents the method to call. It will be one of the following: MIN, MAX,
RANGE, AVERAGE, MODE. The second line will represent an integer n, which denotes the
number of words in the list. The following n lines will each be a word. The words will not
necessarily be sorted. Your output should be a single line representing the results of the method.
For example, here is a screenshot of the program in action:
Please select one of the following inputs: MIN, MAX, RANGE, AVERAGE, MODE
MODE
4.
Data
Structure
and
Algorithm
2
a) Implement the minWordLength() method, which should retun the length of the smallest
word in the list. (Related the case that user enters MIN)
b) Implement a method called maxWordLength(), which should return the length of the
largest word in the list. (Related the case that user enters MAX)
c) Implement a method called wordLengthRange(), which should return the range of lengths
in the word list. (Related the case that user enters RANGE)
d) Implement a method called averageWordLength(), which should re- turn the average word
length in the word list. (Related the case that user enters AVERAGE)
e) Implement a method called mostCommonWordLength(), which should return the most
common length of the words in the list. If there is a tie, you should return -1. You may
assume that the length of a word is at most 100 and at least 1. (Related the case that user
enters MODE) .
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY