StringTest class Program plan: Import the required java packages. Create a class StringTest that contains a list of words and then returns the count of each word in the list. In main() function, Create the list of words. Create the method countWords() Create the object for hash map. If the input word is not equal to null then separate the list of words using white spaces. Execute for loop until it ends with list of words. Inside the loop, Check whether the particular string is present in the hash map. If yes, then start count of each word and increment the word count by 1 if the word is repeated again in the string. Otherwise, remain with the word count as “1”. Finally, print the count of each word in a string.

Question

Want to see the full answer?

Answer 1

Question

Chapter 2, Problem 35P

Program Plan Intro

StringTest class

Program plan:

Import the required java packages.

Create a class StringTest that contains a list of words and then returns the count of each word in the list.

In main() function,

Create the list of words.

Create the method countWords()

Create the object for hash map.

If the input word is not equal to null then separate the list of words using white spaces.

Execute for loop until it ends with list of words. Inside the loop,

Check whether the particular string is present in the hash map.

If yes, then start count of each word and increment the word count by 1 if the word is repeated again in the string.

Otherwise, remain with the word count as “1”.

Finally, print the count of each word in a string.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Briefly define and discuss the following classes of problems: P, NP, NP-Complete, co-NP, NC, P-Complete.

A3Q3.c - You are to write a C program that implements the following disk scheduling algorithms: a. FCFS [10 marks] b. SCAN [10 marks] c. C-SCAN [10 marks] d. SSTF [10 marks] e. LOOK [10 marks] f. C-LOOK [10 marks] • Your program will service a disk with 300 cylinders numbered 0 to 299. • • • • The program will service the requests (a list of 20 cylinder numbers) given in the file request.bin. This file contains (4 byte) integer values representing requests ranging from 0-299. Your program will take the initial position of the disk head as the first command line argument and the direction of the head as the second command line argument. It will then output the requests in the order in which they are serviced, and the total amount of head movements required by each algorithm. In particular, your program needs to do the following: Your program should take two command line arguments a) First command line argument - initial position of the disk head (an integer value) b) Second command line…

2. The memory management has contiguous memory allocation, dynamic partitions, and paging. Compare the internal fragmentation and external fragmentation for these three approaches. [2 marks] 3. Suppose we have Logical address space = 24 = 16 (m = 4), Page size=2² =4 (n = 2), Physical address space = 26 = 64 (r = 6). Answer the following questions: [4 marks] 1) Total # of pages ? 2) Total # of frames ? 3) Number of bits to represent logical address? 4) Number of bits to represent offset ? 5) Number of bits to represent physical address? 6) Number of bits to represent a page number? 7) Number of bits to represent a frame number / 4. What is translation look-aside buffers (TLBS)? Why we need them to implement the page table? [2 marks] 5. Why we need shared pages for multiple processes? Give one example to show the benefits. [2 marks] 6. How to implement the virtual memory by using page out and page in? Explain with an example. [2 marks] 7. We have a reference string of referenced page…