You will be building a linked list. Make sure to keep track of both the head and tail nodes. (1) Create two files to submit. SongEntry.java - Class declaration Playlist.java - Contains main() method Build the SongEntry class per the following specifications. Note: Some methods can initially be method stubs (empty methods), to be completed in later steps. Private fields String uniqueID - Initialized to "none" in default constructor string songName - Initialized to "none" in default constructor string artistName - Initialized to "none" in default constructor int songLength - Initialized to 0 in default constructor SongEntry nextNode - Initialized to null in default constructor Default constructor (1 pt) Parameterized constructor (1 pt) Public member methods void insertAfter(SongEntry currNode) (1 pt) void setNext(SongEntry nextNode) - Mutator (1 pt) String getID()- Accessor String getSongName() - Accessor String getArtistName() - Accessor int getSongLength() - Accessor SongEntry getNext() - Accessor void printPlaylistSongs()
You will be building a linked list. Make sure to keep track of both the head and tail nodes. (1) Create two files to submit. SongEntry.java - Class declaration Playlist.java - Contains main() method Build the SongEntry class per the following specifications. Note: Some methods can initially be method stubs (empty methods), to be completed in later steps. Private fields String uniqueID - Initialized to "none" in default constructor string songName - Initialized to "none" in default constructor string artistName - Initialized to "none" in default constructor int songLength - Initialized to 0 in default constructor SongEntry nextNode - Initialized to null in default constructor Default constructor (1 pt) Parameterized constructor (1 pt) Public member methods void insertAfter(SongEntry currNode) (1 pt) void setNext(SongEntry nextNode) - Mutator (1 pt) String getID()- Accessor String getSongName() - Accessor String getArtistName() - Accessor int getSongLength() - Accessor SongEntry getNext() - Accessor void printPlaylistSongs()
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...
Related questions
Question
Java
You will be building a linked list. Make sure to keep track of both the head and tail nodes.
(1) Create two files to submit.
- SongEntry.java - Class declaration
- Playlist.java - Contains main() method
Build the SongEntry class per the following specifications. Note: Some methods can initially be method stubs (empty methods), to be completed in later steps.
- Private fields
- String uniqueID - Initialized to "none" in default constructor
- string songName - Initialized to "none" in default constructor
- string artistName - Initialized to "none" in default constructor
- int songLength - Initialized to 0 in default constructor
- SongEntry nextNode - Initialized to null in default constructor
- Default constructor (1 pt)
- Parameterized constructor (1 pt)
- Public member methods
- void insertAfter(SongEntry currNode) (1 pt)
- void setNext(SongEntry nextNode) - Mutator (1 pt)
- String getID()- Accessor
- String getSongName() - Accessor
- String getArtistName() - Accessor
- int getSongLength() - Accessor
- SongEntry getNext() - Accessor
- void printPlaylistSongs()
![1 import java.util.Scanner;
2
3 public class Playlist
Min
4
5
6
7
8
9
10
11
12
13
14
$99999
17
public static void printMenu(String playlistTitle) {
/* Type code here. */
15 public static void main(string[] args) {
Scanner scnr = new Scanner(System.in);
/* Type code here. */
16
18
}
public static Song Entry executeMenu(char option, string playlistTitle, SongEntry headNode, Scanner scnr) {
/* Type code here. */
return headNode;
19 }
20 }
buget
1 /* Type code here. */
Current file: SongEntry.java](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1c870776-4927-4fbd-b218-f5b27740c439%2Fde158752-782c-4d20-8483-0cf2271fab0e%2F79s4w4p_processed.png&w=3840&q=75)
Transcribed Image Text:1 import java.util.Scanner;
2
3 public class Playlist
Min
4
5
6
7
8
9
10
11
12
13
14
$99999
17
public static void printMenu(String playlistTitle) {
/* Type code here. */
15 public static void main(string[] args) {
Scanner scnr = new Scanner(System.in);
/* Type code here. */
16
18
}
public static Song Entry executeMenu(char option, string playlistTitle, SongEntry headNode, Scanner scnr) {
/* Type code here. */
return headNode;
19 }
20 }
buget
1 /* Type code here. */
Current file: SongEntry.java
![Ex. of printPlaylistSongs output:
Unique ID: S123
Song Name: Peg
Artist Name: Steely Dan
Song Length (in seconds): 237
(2) In main(), prompt the user for the title of the playlist. (1 pt)
Ex:
Enter playlist's title:
JAMZ
(3) Implement the printMenu() method. printMenu() takes the playlist title as a parameter and outputs a menu of options to manipulate the
playlist. (1 pt)
Ex:
JAMZ PLAYLIST MENU
a Add song
d
c
3- Output songs by specific artist
t
Output total time of playlist (in seconds)
O Output full playlist
q - Quit
Remove song
Change position of song
(4) Implement the executeMenu() method that takes 4 parameters: a character representing the user's choice, a playlist title, the head node
of a playlist, and a Scanner object. executeMenu() performs the menu options (described below) according to the user's choice, and returns
the head node of the playlist. (1 pt)
(5) In main(), call printMenu() and prompt for the user's choice of menu options. Each option is represented by a single character.
If an invalid character entered, continue to prompt for a valid choice. When a valid option is entered, execute the option by calling
executeMenu() and overwrite the head of the playlist with the returned object. Then, print the menu, and prompt for a new option. Continue
until the user enters 'q'. Hint: Implement Quit before implementing other options. (1 pt)
Ex:
JAMZ PLAYLIST MENU
a - Add song
d Remove song
c Change position of song
3- Output songs by specific artist
t - Output total time of playlist (in seconds)
o- Output full playlist
q - Quit
Choose an option:
(6) Implement "Output full playlist" menu option in execute Menu(). If the list is empty, output: Playlist is empty (3 pts)
Ex:
JAMZ - OUTPUT FULL PLAYLIST
1.
Unique ID: SD123
Song Name: Peg
Artist Name: Steely Dan
Song Length (in seconds): 237
2.
Unique ID: JJ234
Song Name: All For You
Artist Name: Janet Jackson
Song Length (in seconds): 391
3.
Unique ID: J345
Song Name: Canned Heat
Artist Name: Jamiroquai
Song Length (in seconds): 330
4.
Unique ID: JJ456
Song Name: Black Eagle
Artist Name: Janet Jackson
Song Length (in seconds): 197
5.
Unique ID: SD567
Song Name: I Got The News
Artist Name: Steely Dan
Song Length (in seconds): 306
Ex (empty playlist):
JAMZ - OUTPUT FULL PLAYLIST
Playlist is empty
(7) Implement the "Add song" menu option in executeMenu(). New additions are added to the end of the list. (2 pts)
Ex:
ADD SONG
Enter song's unique ID:
SD123
Enter song's name:
Peg
Enter artist's name:
Steely Dan
Enter song's length (in seconds):
237
(8) Implement the "Remove song" menu option in executeMenu(). Prompt the user for the unique ID of the song to be removed. (4 pts)
Ex:
REMOVE SONG
Enter song's unique ID:
JJ234
"All For You" removed.
(9) Implement the "Change position of song" menu option in executeMenu(). Prompt the user for the current position of the song and the
desired new position. Valid new positions are 1-n (the number of nodes). If the user enters a new position that is less than 1, move the
node to the position 1 (the head). If the user enters a new position greater than n, move the node to position n (the tail). 6 cases will be
tested:
• Moving the head node (1 pt)
. Moving the tail node (1 pt)
• Moving a node to the head (1 pt)
• Moving a node to the tail (1 pt)
• Moving a node up the list (1 pt)
• Moving a node down the list (1 pt)
Ex:
CHANGE POSITION OF SONG
Enter song's current position:
3
Enter new position for song:
2
"Canned Heat" moved to position 2
(10) Implement the "Output songs by specific artist" menu option in executeMenu(). Prompt the user for the artist's name, and output the
node's information, starting with the node's current position. (2 pt)
Ex:
OUTPUT SONGS BY SPECIFIC ARTIST
Enter artist's name:
Janet Jackson
2.
Unique ID: JJ234
Song Name: All For You
Artist Name: Janet Jackson
Song Length (in seconds): 391
Ex:
Unique ID: JJ456
Song Name: Black Eagle
Artist Name: Janet Jackson
Song Length (in seconds): 197
(11) Implement the "Output total time of playlist" menu option in executeMenu(). Output the sum of the time of the playlist's songs (in
seconds). (2 pts)
OUTPUT TOTAL TIME OF PLAYLIST (IN SECONDS)
Total time: 1461 seconds](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1c870776-4927-4fbd-b218-f5b27740c439%2Fde158752-782c-4d20-8483-0cf2271fab0e%2Fqyx4l1b_processed.png&w=3840&q=75)
Transcribed Image Text:Ex. of printPlaylistSongs output:
Unique ID: S123
Song Name: Peg
Artist Name: Steely Dan
Song Length (in seconds): 237
(2) In main(), prompt the user for the title of the playlist. (1 pt)
Ex:
Enter playlist's title:
JAMZ
(3) Implement the printMenu() method. printMenu() takes the playlist title as a parameter and outputs a menu of options to manipulate the
playlist. (1 pt)
Ex:
JAMZ PLAYLIST MENU
a Add song
d
c
3- Output songs by specific artist
t
Output total time of playlist (in seconds)
O Output full playlist
q - Quit
Remove song
Change position of song
(4) Implement the executeMenu() method that takes 4 parameters: a character representing the user's choice, a playlist title, the head node
of a playlist, and a Scanner object. executeMenu() performs the menu options (described below) according to the user's choice, and returns
the head node of the playlist. (1 pt)
(5) In main(), call printMenu() and prompt for the user's choice of menu options. Each option is represented by a single character.
If an invalid character entered, continue to prompt for a valid choice. When a valid option is entered, execute the option by calling
executeMenu() and overwrite the head of the playlist with the returned object. Then, print the menu, and prompt for a new option. Continue
until the user enters 'q'. Hint: Implement Quit before implementing other options. (1 pt)
Ex:
JAMZ PLAYLIST MENU
a - Add song
d Remove song
c Change position of song
3- Output songs by specific artist
t - Output total time of playlist (in seconds)
o- Output full playlist
q - Quit
Choose an option:
(6) Implement "Output full playlist" menu option in execute Menu(). If the list is empty, output: Playlist is empty (3 pts)
Ex:
JAMZ - OUTPUT FULL PLAYLIST
1.
Unique ID: SD123
Song Name: Peg
Artist Name: Steely Dan
Song Length (in seconds): 237
2.
Unique ID: JJ234
Song Name: All For You
Artist Name: Janet Jackson
Song Length (in seconds): 391
3.
Unique ID: J345
Song Name: Canned Heat
Artist Name: Jamiroquai
Song Length (in seconds): 330
4.
Unique ID: JJ456
Song Name: Black Eagle
Artist Name: Janet Jackson
Song Length (in seconds): 197
5.
Unique ID: SD567
Song Name: I Got The News
Artist Name: Steely Dan
Song Length (in seconds): 306
Ex (empty playlist):
JAMZ - OUTPUT FULL PLAYLIST
Playlist is empty
(7) Implement the "Add song" menu option in executeMenu(). New additions are added to the end of the list. (2 pts)
Ex:
ADD SONG
Enter song's unique ID:
SD123
Enter song's name:
Peg
Enter artist's name:
Steely Dan
Enter song's length (in seconds):
237
(8) Implement the "Remove song" menu option in executeMenu(). Prompt the user for the unique ID of the song to be removed. (4 pts)
Ex:
REMOVE SONG
Enter song's unique ID:
JJ234
"All For You" removed.
(9) Implement the "Change position of song" menu option in executeMenu(). Prompt the user for the current position of the song and the
desired new position. Valid new positions are 1-n (the number of nodes). If the user enters a new position that is less than 1, move the
node to the position 1 (the head). If the user enters a new position greater than n, move the node to position n (the tail). 6 cases will be
tested:
• Moving the head node (1 pt)
. Moving the tail node (1 pt)
• Moving a node to the head (1 pt)
• Moving a node to the tail (1 pt)
• Moving a node up the list (1 pt)
• Moving a node down the list (1 pt)
Ex:
CHANGE POSITION OF SONG
Enter song's current position:
3
Enter new position for song:
2
"Canned Heat" moved to position 2
(10) Implement the "Output songs by specific artist" menu option in executeMenu(). Prompt the user for the artist's name, and output the
node's information, starting with the node's current position. (2 pt)
Ex:
OUTPUT SONGS BY SPECIFIC ARTIST
Enter artist's name:
Janet Jackson
2.
Unique ID: JJ234
Song Name: All For You
Artist Name: Janet Jackson
Song Length (in seconds): 391
Ex:
Unique ID: JJ456
Song Name: Black Eagle
Artist Name: Janet Jackson
Song Length (in seconds): 197
(11) Implement the "Output total time of playlist" menu option in executeMenu(). Output the sum of the time of the playlist's songs (in
seconds). (2 pts)
OUTPUT TOTAL TIME OF PLAYLIST (IN SECONDS)
Total time: 1461 seconds
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
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](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY