Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Instructions: Write a Java static method called wordLengths() that accepts a string. Your method should count the number of letters in each word in the string, and output a result diagram of how many letters contain each word. Use tabs before the asterisks so that they'll line up. You may assume that no word in the string is more than 80 characters in length and all words are space-separated. Input: Write a method called wordLengths that accepts a string Output: Three columns. The first column contains the order of word in the string (1, 2, 3, etc.) followed by a colon (e and space. The second column contains the length of the word described by an integer. The 2nd and 3rd columns are separated by a single tab (6 spaces). The third column contains a histogram representing the length of the corresponding word. 1: 5 2: 1 3: 6 4: 6 ****** 5: 11 6: 4 7: 7 ...* ******* 8: 1 9: 6

Instructions: Write a Java static method called wordLengths() that accepts a string. Your method should count the number of letters in each word in the string, and output a result diagram of how many letters contain each word. Use tabs before the asterisks so that they'll line up. You may assume that no word in the string is more than 80 characters in length and all words are space-separated. Input: Write a method called wordLengths that accepts a string Output: Three columns. The first column contains the order of word in the string (1, 2, 3, etc.) followed by a colon (e and space. The second column contains the length of the word described by an integer. The 2nd and 3rd columns are separated by a single tab (6 spaces). The third column contains a histogram representing the length of the corresponding word. 1: 5 2: 1 3: 6 4: 6 ****** 5: 11 6: 4 7: 7 ...* ******* 8: 1 9: 6

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question
  • Write a Java program
  • Consider the structure of one example of inputs and outputs that is given in the first picture
  • The structure of the code must be as it is shown in the second picture
WordLengthes.java 1- þublic class WordLengthes { 2 public static void main(String[] args) { /lyour statements to test method here 4 6 7 //your method here... } 8
Transcribed Image Text:WordLengthes.java 1- þublic class WordLengthes { 2 public static void main(String[] args) { /lyour statements to test method here 4 6 7 //your method here... } 8
Instructions: Write a Java static method called wordLengths() that accepts a string. Your method should count the number of letters in each word in the string, and output a result diagram of how many letters contain each word. Use tabs before the asterisks so that they'lL line up. You may assume that no word in the string is more than 80 characters in length and all words are space-separated. Input: Write a method called wordLengths that accepts a string Output: Three columns. The first column contains the order of word in the string (1, 2, 3, etc.) followed by a colon (e and space. The second column contains the length of the word described by an integer. The 2nd and 3rd columns are separated by a single tab (6 spaces). The third column contains a histogram representing the length of the corresponding word. 1: 5 2: 1 3: 6 4: 6 5: 11 6: 4 7: 7 8: 1 9: 6
Transcribed Image Text:Instructions: Write a Java static method called wordLengths() that accepts a string. Your method should count the number of letters in each word in the string, and output a result diagram of how many letters contain each word. Use tabs before the asterisks so that they'lL line up. You may assume that no word in the string is more than 80 characters in length and all words are space-separated. Input: Write a method called wordLengths that accepts a string Output: Three columns. The first column contains the order of word in the string (1, 2, 3, etc.) followed by a colon (e and space. The second column contains the length of the word described by an integer. The 2nd and 3rd columns are separated by a single tab (6 spaces). The third column contains a histogram representing the length of the corresponding word. 1: 5 2: 1 3: 6 4: 6 5: 11 6: 4 7: 7 8: 1 9: 6
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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…
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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS