Question
Can someone show me how the code for this would look like and explain the steps with comments? I have been asking this question since
Can someone show me how the code for this would look like and explain the steps with comments? I have been asking this question since two days ago so I would love help. I appreciate the hard work tutors put in especially in coding because it is difficult. I'm confused so please help me as soon as possible if you can. You may take your time to answer but I hope I can get an answer at least. Thank you so so sooooooo much!
Make a program that helps to keep track of song lists.
Part I: The Song ADT
The information about a song should include:
Artist name (e.g., Eminem)
Title(e.g., Lose Yourself)
Length (e.g., 5.23)
Number of likes (e.g., 654,000)
Part II: The SongList ADT
The data members for SongList should be a head pointer to a linear linked list of Song objects and the number of songs in the list. The songs should be organized by popularities with the most popular song as the first node in the list.
This ADT must have public member functions to perform the following:
1.Constructor - Construct an object and initialize the data members
2.Destructor - Release all dynamic memory and reset data members to their zero equivalent value
3.Add a new song
4.Edit the number of likes for a song
5.Display all songs in the list
6.Display all songs for an artist (in order of popularity)
7.Remove all songs with fewer than M likes, where M is sent in as an argument
Part III: The driver or the test program
The test program needs to first load the test data set from external file at the beginning of the program.
The menu-based user interface should allow user to use/test ALL the functionalities of the program. Try to make the user interface easier to use.
1.Always prompt user when you need input data.
2.The prompt needs to be meaningful. Example works great. E.g. "Enter the minimum likes (e.g 1000): "
3.When asking user to choose some existing data, index works great. You can display the data with index preceding each one first.Can someone show me how the code for this would look like and explain the steps with comments? I have been asking this question since two days ago so I would love help. I appreciate the hard work tutors put in especially in coding because it is difficult. I'm confused so please help me as soon as possible if you can. Thank you so so sooooooo much!
Make a program that helps to keep track of song lists.
Part I: The Song ADT
The information about a song should include:
Artist name (e.g., Eminem)
Title(e.g., Lose Yourself)
Length (e.g., 5.23)
Number of likes (e.g., 654,000)
Part II: The SongList ADT
The data members for SongList should be a head pointer to a linear linked list of Song objects and the number of songs in the list. The songs should be organized by popularities with the most popular song as the first node in the list.
This ADT must have public member functions to perform the following:
1.Constructor - Construct an object and initialize the data members
2.Destructor - Release all dynamic memory and reset data members to their zero equivalent value
3.Add a new song
4.Edit the number of likes for a song
5.Display all songs in the list
6.Display all songs for an artist (in order of popularity)
7.Remove all songs with fewer than M likes, where M is sent in as an argument
Part III: The driver or the test program
The test program needs to first load the test data set from external file at the beginning of the program.
The menu-based user interface should allow user to use/test ALL the functionalities of the program. Try to make the user interface easier to use.
1.Always prompt user when you need input data.
2.The prompt needs to be meaningful. Example works great. E.g. "Enter the minimum likes (e.g 1000): "
3.When asking user to choose some existing data, index works great. You can display the data with index preceding each one first.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started