Program plan: Import the required header files. Create the class “NamePopularity”, Create a “HashMap” named “namesData”. Create an object of “Scanner”. Define the “main()” function. Create a string variable “fileName” to hold the file name. Create string variable “filePath” to hold the path. Create the object of “Stream”. Iterate a “while” loop. Print the statement. Get the tokens from the files to the variables “name”. If the value of “name” is equal to “end”. Print the statement. Break from the condition. If the condition “checkName(name)” is true. Call the method “printNameData()”. If the condition “checkName(name)” is false. Print a statement. Define the “saveData()” function. Create a string variable “fileName” to hold the file name. Create a variable “popularity” of “ArrayList”. Iterate a “for” loop. Add the values to “splited[]”. Add the values to “splited[]”. Define the “checkName()” function. If the condition is “true”. Return a value “true”. If the condition is “false”. Return a value “false”. Define the “printNameData()” function. Create a variable “popularity” of “ArrayList”. Declare an integer variable “startYear” Iterate a “for” loop. Print the value of “startYear” and “s”. Add “10” to “startYear”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 6, Problem 4PP

NamePopularity Class

Program Plan Intro

Program plan:

Import the required header files.

Create the class “NamePopularity”,

Create a “HashMap” named “namesData”.

Create an object of “Scanner”.

Define the “main()” function.

Create a string variable “fileName” to hold the file name.

Create string variable “filePath” to hold the path.

Create the object of “Stream”.

Iterate a “while” loop.

Print the statement.

Get the tokens from the files to the variables “name”.

If the value of “name” is equal to “end”.

Print the statement.

Break from the condition.

If the condition “checkName(name)” is true.

Call the method “printNameData()”.

If the condition “checkName(name)” is false.

Print a statement.

Define the “saveData()” function.

Create a string variable “fileName” to hold the file name.

Create a variable “popularity” of “ArrayList”.

Iterate a “for” loop.

Add the values to “splited[]”.

Add the values to “splited[]”.

Define the “checkName()” function.

If the condition is “true”.

Return a value “true”.

If the condition is “false”.

Return a value “false”.

Define the “printNameData()” function.

Create a variable “popularity” of “ArrayList”.

Declare an integer variable “startYear”

Iterate a “for” loop.

Print the value of “startYear” and “s”.

Add “10” to “startYear”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

6. What is Race condition? How to prevent it? [2 marks] 7. How many synchronization methods do you know and compare the differences. [2 marks] 8. Explain what are the “mutual exclusion”, “deadlock”, “livelock”, and “eventual entry”, with the traffic intersection as an example like dinning philosophy. [2 marks] 9. For memory allocation, what are the difference between internal fragmentation and external fragmentation. Explain with an example. [2 marks] 10. How can the virtual memory map to the physical memory. Explain with an example. [2 marks]

Your answers normally have 50 words. Less than 50 words will not get marks. 1. What is context switch between multiple processes? [2 marks] 2. Draw the memory layout for a C program. [2 marks] 3. How many states does a process has? [2 marks] 4. Compare the non-preemptitve scheduling and preemptive scheduling. [2 marks] 5. Given 4 process and their arrival times and next CPU burst times, what are the average times and average Turnaround time, for different scheduling algorithms including: a. First Come, First-Served (FCFS) Scheduling [2 marks] b. Shortest-Job-First (SJF) Scheduling [2 marks] c. Shortest-remaining-time-first [2 marks] d. Priority Scheduling [2 marks] e. Round Robin (RR) [2 marks] Process Arrival Time Burst Time P1 0 8 P2 1 9 P3 3 2 P4 5 4

a database with multiple tables from attributes as shown above that are in 3NF, showing PK, non-key attributes, and FK for each table? Assume the tables are already in 1NF. [Hint: 3 tables will result after deducing 1NF -> 2NF -> 3NF]