Part 1: Select the Suitor Requirements In the great city of Atlantis, Prince Val had many suitors. He decided on the following algorithm to determine which person he would marry. First, the suitors would be lined up in order and assigned a number starting with 1, the second would be 2, and so on up to n suitors. Starting with the first, he would count down the line with each letter of his name "V", "a", "I", and then the suitor at "I" would be eliminated from the line. Val would continue counting three more suitors, and eliminating every third one. When Val reached the end of the line, he would resume counting at the beginning of the line. For example, if there were seven suitors, the elimination process would be as follows: 1234567 124567 12457 1457 145 14 4 Initial list of suitors; Start counting from 1. Suitor #3 eliminated; Continue counting at 4. Suitor #6 eliminated; Continue counting at 7. Suitor #2 eliminated; Continue counting at 4. Suitor #7 eliminated; Continue counting at 1. Suitor #5 eliminated; Continue counting at 1. Finally, #1 is eliminated, and Suitor # 4 is selected. Write a program that implements a linked list of nodes to determine the position a suitor should stand if they want to marry the prince, when there are n suitors. Your program should eliminate the suitor by deleting the node corresponding to the suitor for each step of the process. Each suitor also has a name. You should either add the name, a String, as part of the node object or use a parallel HashMap to perform a name lookup. Your program should prompt the user for the number of suitors, each suitor's name, and then after your algorithm runs, print the selected suitor and their name. Be sure to use prompts that make sense to a user who has never run your program before.
Part 1: Select the Suitor Requirements In the great city of Atlantis, Prince Val had many suitors. He decided on the following algorithm to determine which person he would marry. First, the suitors would be lined up in order and assigned a number starting with 1, the second would be 2, and so on up to n suitors. Starting with the first, he would count down the line with each letter of his name "V", "a", "I", and then the suitor at "I" would be eliminated from the line. Val would continue counting three more suitors, and eliminating every third one. When Val reached the end of the line, he would resume counting at the beginning of the line. For example, if there were seven suitors, the elimination process would be as follows: 1234567 124567 12457 1457 145 14 4 Initial list of suitors; Start counting from 1. Suitor #3 eliminated; Continue counting at 4. Suitor #6 eliminated; Continue counting at 7. Suitor #2 eliminated; Continue counting at 4. Suitor #7 eliminated; Continue counting at 1. Suitor #5 eliminated; Continue counting at 1. Finally, #1 is eliminated, and Suitor # 4 is selected. Write a program that implements a linked list of nodes to determine the position a suitor should stand if they want to marry the prince, when there are n suitors. Your program should eliminate the suitor by deleting the node corresponding to the suitor for each step of the process. Each suitor also has a name. You should either add the name, a String, as part of the node object or use a parallel HashMap to perform a name lookup. Your program should prompt the user for the number of suitors, each suitor's name, and then after your algorithm runs, print the selected suitor and their name. Be sure to use prompts that make sense to a user who has never run your program before.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Concept explainers
Max Function
Statistical function is of many categories. One of them is a MAX function. The MAX function returns the largest value from the list of arguments passed to it. MAX function always ignores the empty cells when performing the calculation.
Power Function
A power function is a type of single-term function. Its definition states that it is a variable containing a base value raised to a constant value acting as an exponent. This variable may also have a coefficient. For instance, the area of a circle can be given as:
Question
Need help writing the java code with the requirements below
starting with the following code
import java.util.Scanner;
public class Suitor {
public static void start (Scanner scnr) {
System.out.println("\n");
System.out.println("Select the suitor.");
}
}
Transcribed Image Text:Select the Suitor.
Enter the number of Suitors: 7
Enter name of Suitor #1: Doc
Enter name of Suitor #2:
Enter name of
Suitor #3:
Enter name of Suitor # 4:
Enter name of Suitor #5:
Grumpy
Happy
Sleepy
Bashful
Enter name of Suitor #6: Sneezy
Enter name of Suitor #7: Dopey
Suitor #3, Happy, eliminated.
Suitor #6, Sneezy, eliminated.
Suitor #2, Grumpy, eliminated.
Suitor #7, Dopey, eliminated.
Suitor #5, Bashful, eliminated.
Suitor # 1, Doc, eliminated.
The correct suitor was #4, Sleepy.
Transcribed Image Text:Part 1: Select the Suitor Requirements
In the great city of Atlantis, Prince Val had many suitors. He decided on the following algorithm to determine
which person he would marry. First, the suitors would be lined up in order and assigned a number starting
with 1, the second would be 2, and so on up to n suitors. Starting with the first, he would count down the line
with each letter of his name "V", "a", "I", and then the suitor at "I" would be eliminated from the line. Val
would continue counting three more suitors, and eliminating every third one. When Val reached the end of
the line, he would resume counting at the beginning of the line.
For example, if there were seven suitors, the elimination process would be as follows:
1234567
124567
12457
1457
145
14
4
Initial list of suitors; Start counting from 1.
Suitor #3 eliminated; Continue counting at 4.
Suitor #6 eliminated; Continue counting at 7.
Suitor #2 eliminated; Continue counting at 4.
Suitor #7 eliminated; Continue counting at 1.
Suitor #5 eliminated; Continue counting at 1.
Finally, #1 is eliminated, and Suitor # 4 is selected.
Write a program that implements a linked list of nodes to determine the position a suitor should stand if they want to marry the prince, when there
are n suitors. Your program should eliminate the suitor by deleting the node corresponding to the suitor for each step of the process.
Each suitor also has a name. You should either add the name, a String, as part of the node object or use a parallel HashMap to perform a name
lookup.
Your program should prompt the user for the number of suitors, each suitor's name, and then after your algorithm runs, print the selected suitor
and their name.
Be sure to use prompts that make sense to a user who has never run your program before.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 5 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education