StateCapital.Java Program Plan: Include the class name named “StateCapital_Map”. Declare the package. Import the util package. Define class. Declare the main()method. Create a Scanner. Store 50 states and their capitals in a map. Prompt the user to enter a state. Check if state is present. Close the main method. Create another Method getData that stores the 50 states and their capitals in a map. Define a new hashmap. Declare a map data. assign states along with their capitals Create a loop to traverse through the entire data length. Put each state with their capital in the data. Return the map. Print the user entered state along with their capital from the map. Close the class.

Question

Want to see the full answer?

Answer 1

Question

Chapter 21, Problem 21.9PE

Program Plan Intro

StateCapital.Java

Program Plan:

Include the class name named “StateCapital_Map”.

Declare the package.

Import the util package.

Define class.

Declare the main()method.

Create a Scanner.

Store 50 states and their capitals in a map.

Prompt the user to enter a state.

Check if state is present.

Close the main method.

Create another Method getData that stores the 50 states and their capitals in a map.

Define a new hashmap.

Declare a map data.

assign states along with their capitals

Create a loop to traverse through the entire data length.

Put each state with their capital in the data.

Return the map.

Print the user entered state along with their capital from the map.

Close the class.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Exercise 1: (Design of algorithm to find greatest common divisor) In mathematics, the greatest common divisor (gcd) of two or more integers is the largest positive integer that divides each of the integers. For example, the gcd of 8 and 12 is 4. Why? Divisors of 8 are 1, 2, 4, 8. Divisors of 12 are 1, 2, 4, 6, 12 Thus, the common divisors of 8 and 12 are 1, 2, 4. Out of these common divisors, the greatest one is 4. Therefore, the greatest common divisor (gcd) of 8 and 12 is 4. Write a programming code for a function FindGCD(m,n) that find the greatest common divisor. You can use any language of Java/C++/Python/Octave. Find GCD Algorithm: Step 1 Make an array to store common divisors of two integers m, n. Step 2 Check all the integers from 1 to minimun(m,n) whether they divide both m, n. If yes, add it to the array. Step 3 Return the maximum number in the array.

(Learning Objective: students will be able to apply their knowledge of the built-in random package to generate simulations of simple phenomena.) Write a function: • dicesim(D1,D2,trials) that takes as input the number of sides on die 1 (D1) and die2 (D2) and the number of trials. Your function should repeatedly sum pairs of random numbers between 1 and D1 and 1 and D2 and keep track of how many times each sum occurs. The function returns a numpy array with the fraction each sum of rolls occured. Since the numbers are chosen at random, the fractions will differ some from run to run. One run of the function print(p22.dicesim(6,6,10000)) resulted in: [0. 0. 0.0259 0.0615 0.0791 0.1086 0.139 0.1633 0.1385 0.114 0.0833 0.0587 0.0281] or displayed using the code from Section 16.1.1.: PMF of X Note: you should submit a file with only the standard comments at the top and the function. The grading scripts will then import the file for testing.

Q2) (Perfect Numbers) An integer number is said to be a perfect number if its factors, including 1 (but not the number itself), sum to the number. For example, 6 is a perfect number because 6 = 1 + 2 + 3. Write a function perfect that determines if parameter number is a perfect number. Use this function in a program that determines and prints all the perfect numbers between 1 and 1000. Print the factors of each perfect number to confirm that the number is indeed perfect. Challenge the power of your computer by testing numbers much larger than 1000.