Write a program in C++ language that implements a music play.pdf
•
0 likes•15 views
Write a program in C++ language that implements a music player using Doubly Circular Linked List using OOP concepts. This assignment has four parts: 1- Write a class(new type) to define the Song type. 2- Implement the Doubly Circular Linked List, which will operate with Song type. 3- Implement the Music Player 4- Test it in the main function All Constructors should use the initializer list. 1. Song class 1- class song #include <iostream> using namespace std; class Song{ private: string songTitle; string singerName; public: Song(); Song(string, string); virtual ~Song(); string getSongTitle(); string getSingerName(); void setSongTitle(string); void setSingerName(string); friend ostream& operator<<(ostream& os, Song& p){ os << ": "<<"{"<<p.songTitle<<" : "<<p.singerName<<"}"; return os; } }; 2- CNode class #include <iostream> #include "Song.h" using namespace std; class CNode{ private: Song elem; CNode *next; CNode *prev; friend class CircleDLinkedList; }; 3- CircleDLinkedList class #include <iostream> #include "CNode.h" using namespace std; class CircleDLinkedList{ private: CNode* cursor; int size; public: CircleDLinkedList(); ~CircleDLinkedList(); bool empty(); void advance(); void add(Song &s); void remove(); void print(); int getSize() const; }; 4- MusicPlayer class #include <iostream> #include "CircleDLinkedList.h" using namespace std; class MusicPlayer{ private: string type; //will hold the type of the music player int size; //the current number of the songs CircleDLinkedList playerList; // list of the songs, CircleDLinkedList is the Doubly Circular Linked List public: MusicPlayer(string); virtual ~MusicPlayer(); void play(); //plays the current song, meaning that this method will print the properties of the Song void next(); //moves to the net song and plays it void previous(); ////moves to the previous song and plays it void add (Song); //adds a song before the current song void remove(); //removes the current song void print(bool);//prints all songs that are in the list, starting from current to left is bool param is true }; 5- Test it in the main function Create e musicplayer with 3 songs. Play the current song. Play the next song. Play the next song. Play the next song. Play the previous song. Print the list of the songs using bool parameter true. Print the list of the songs using bool parameter false. Remove the current song from the musicplayer. Play the current song. Play the next song. Play the next song. Play the next song. Print the list of the songs using bool parameter true. Print the list of the songs using bool parameter false..
Report
Share
Report
Share
Download to read offline
Recommended
I need help writing the methods for the song and playList class in J.pdf
I need help writing the methods for the song and playList class in Java. I already have the
interface and the getters and setter. Can someone help with the methods?
Song Class
public class Song
private String artist // the artist performing the song
private String title // the title of the song
private int minutes // number of min in length
private int seconds // number of seconds of length of the song (always less than 60)
// Add Getters / Setters for all fields
// Three constructors (remember to initialize ALL fields in each of the constructors - regardless
of the number of parameters!)
public Song(String artist, String title)
public Song(String artist, String title, int minutes, int seconds)
public Song(Song s)
public boolean equals(Object o) // a song is equal if all four fields are equal
public String toString() { // Use this code for toString EXACTLY
return \"{Song: title = \" + title + \" artist = \" + artist + \"}\";
}
public void play() { // Use this code for play EXACTLY
System.out.printf(\"Playing Song: artist = %-20s title = %s\ \", artist, title);
}
Make the Song class implement the interface Comparable, and make the ordering criteria as
follows: Songs will be ordered by artist in ascending order. If the artists are the same, then by
title in ascending order. If both artist and title are the same, then any order is acceptable.
Don’t forget to include any methods needed to implement the Playable interface.
PlayList Class
public class PlayList
Methods that modify the list should return a boolean return true if they successfully change the
list, otherwise they return false. Note that a PlayList can contain other PlayLists!
Methods that return a Playable element return null if they fail to find the song in question.
private String name // contains the name of the playlist
private ArrayList playableList // ArrayList of Playable elements that make up the play list
// Add Getters / Setters for name and songList
// Add a toString() method that returns the name of the playlist followed by its contents (by
calling toString() on each item it contains). You should only have one name/title per line
// Two constructors (remember to initialize ALL fields in each of the constructors - regardless of
the number of parameters!)
public PlayList() // empty play list named \"Untitled\"
public PlayList(String newName) // empty play list
public boolean loadSongs(String fileName) // loads songs from file, more on this below
public boolean clear() // removes all playable elements in the play list
public boolean addSong(Song s) // adds Song s to the end of the play list
public Playable removePlayable(int index) // removes Playable element at index from the list and
returns it
public Playable removePlayable(Playable p) // removes every occurrence of Playable p from the
list and returns p
public Playable getPlayable(int index) // returns the Playable element at the appropriate index
public boolean addPlayList(PlayList pl) //adds the PlayList that is being pa.
Need help with this java project, as the methods are proving to be p.pdf
Need help with this java project, as the methods are proving to be pretty challenging. Im not
worried about the fields, getters, setters, constructors, ect as those are pretty straightforward, but
any and all help with the methods would be greatly appreciated!
Playable Interface
public interface Playable
Create a Java interface named Playable that includes the following methods (and only the
following methods):
public void play();
public String getName(); // returns the name (for PlayList) or title (for Song) of Playable object.
public int getPlayTimeSeconds(); // For Song: returns the number of seconds in the song. For
PlayList: returns the number of seconds in the entire PlayList
Both the Song and PlayList classes will implement this interface.
Song Class
public class Song
private String artist // the artist performing the song
private String title // the title of the song
private int minutes // number of min in length
private int seconds // number of seconds of length of the song (always less than 60)
// Add Getters / Setters for all fields
// Three constructors (remember to initialize ALL fields in each of the constructors - regardless
of the number of parameters!)
public Song(String artist, String title)
public Song(String artist, String title, int minutes, int seconds)
public Song(Song s)
public boolean equals(Object o) // a song is equal if all four fields are equal
public String toString() { // Use this code for toString EXACTLY
return \"{Song: title = \" + title + \" artist = \" + artist + \"}\";
}
public void play() { // Use this code for play EXACTLY
System.out.printf(\"Playing Song: artist = %-20s title = %s\ \", artist, title);
}
Make the Song class implement the interface Comparable, and make the ordering criteria as
follows: Songs will be ordered by artist in ascending order. If the artists are the same, then by
title in ascending order. If both artist and title are the same, then any order is acceptable.
Don’t forget to include any methods needed to implement the Playable interface.
PlayList Class
public class PlayList
Methods that modify the list should return a boolean return true if they successfully change the
list, otherwise they return false. Note that a PlayList can contain other PlayLists!
Methods that return a Playable element return null if they fail to find the song in question.
private String name // contains the name of the playlist
private ArrayList playableList // ArrayList of Playable elements that make up the play list
// Add Getters / Setters for name and songList
// Add a toString() method that returns the name of the playlist followed by its contents (by
calling toString() on each item it contains). You should only have one name/title per line
// Two constructors (remember to initialize ALL fields in each of the constructors - regardless of
the number of parameters!)
public PlayList() // empty play list named \"Untitled\"
public PlayList(String newName) // empty play list
public boolean loadSongs(String fil.
Can someone please help me complete the add_song function .pdf
Can someone please help me complete the "add_song" function below. Thank you!
// Each song has this information: song's id, song's name, singer's name, genre of the song, and
its published year.
// The struct 'musicRepository' holds information of one song. Genre is enum type.
// An array of structs called 'list' is made to hold the list of songs.
// You should not modify any of the given code, the return types, or the parameters, you will risk of
getting compilation error.
// You are not allowed to modify main ().
// You can use string library functions.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#pragma warning(disable : 4996) // for Visual Studio Only
#define MAX_SONGS 20
#define MAX_SONG_NAME_LENGTH 40
#define MAX_SINGER_NAME_LENGTH 40
typedef enum
{
unclassified = 0,
Pop,
Rock,
Reggae,
Country,
Blues,
Balad,
} genreType; // enum type
struct musicRepository
{
// struct for song details
unsigned int ID;
char songName[MAX_SONG_NAME_LENGTH];
char singerName[MAX_SINGER_NAME_LENGTH];
genreType genre;
unsigned int year;
};
struct musicRepository list[MAX_SONGS]; // declare the list of songs
int numSongs = 0; // the number of songs currently stored in the list (initialized to 0)
// This function takes in an array of musicRepository structures and the size of the array as
parameters. It then loops through each index of the array and sets the values of id, year, genre,
name, and singer to their respective initial values.
// NOTE that strcpy is used to copy an empty string to name and singer, rather than setting them
equal to "". This is because arrays in C are not assignable, so the strcpy function must be used to
copy the empty string into the array.
void initializeRepository(struct musicRepository repo[], int size)
{
for (int i = 0; i < size; i++)
{
repo[i].ID = 0;
repo[i].year = 0;
repo[i].genre = 0;
strcpy(repo[i].songName, "");
strcpy(repo[i].singerName, "");
}
}
// This function takes in the musicRepository array and iterates through each element. If the ID of
the song is not 0, it prints the details of the song.
void printRepository(struct musicRepository repo[], int numSongs)
{
printf("n--- Song Repository ---n");
for (int i = 0; i < numSongs; i++)
{
if (repo[i].ID != 0)
{
printf("ID: %dn", repo[i].ID);
printf("Name: %sn", repo[i].songName);
printf("Singer: %sn", repo[i].singerName);
if (repo[i].genre == 0)
printf("Genre: unclassifiedn");
else if (repo[i].genre == 1)
printf("Genre: Popn");
else if (repo[i].genre == 2)
printf("Genre: Rockn");
else if (repo[i].genre == 3)
printf("Genre: Reggaen");
else if (repo[i].genre == 4)
printf("Genre: Countryn");
else if (repo[i].genre == 5)
printf("Genre: Bluesn");
else if (repo[i].genre == 6)
printf("Genre: Baladn");
printf("Year: %dn", repo[i].year);
printf("n");
}
}
}
// Problem 2
// struct to hold information about a song
struct Song
{
int id;
char name[MAX_SONG_NAME_LENGTH];
char singer[MAX_SINGER_NAME_LENGTH];
genreType genre;
int year;
struct Song* next;
};
// Function declarati.
8.15 Program Playlist (C++) You will be building a linked list. Mak.pdf
8.15 Program: Playlist (C++) You will be building a linked list. Make sure to keep track of both
the head and tail nodes. (1) Create three files to submit. Playlist.h - Class declaration Playlist.cpp
- Class definition main.cpp - main() function Build the PlaylistNode class per the following
specifications. Note: Some functions can initially be function stubs (empty functions), to be
completed in later steps. Default constructor (1 pt) Parameterized constructor (1 pt) Public
member functions InsertAfter() (1 pt) SetNext() - Mutator (1 pt) GetID() - Accessor
GetSongName() - Accessor GetArtistName() - Accessor GetSongLength() - Accessor GetNext()
- Accessor PrintPlaylistNode() Private data members 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 PlaylistNode* nextNodePtr - Initialized to 0 in default constructor Ex. of
PrintPlaylistNode 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() function. PrintMenu() takes the
playlist title as a parameter and outputs a menu of options to manipulate the playlist. Each option
is represented by a single character. Build and output the menu within the function. If an invalid
character is entered, continue to prompt for a valid choice. Hint: Implement Quit before
implementing other options. Call PrintMenu() in the main() function. Continue to execute the
menu until the user enters q to Quit. (3 pts) Ex: JAMZ PLAYLIST MENU a - Add song d -
Remove song c - Change position of song s - Output songs by specific artist t - Output total time
of playlist (in seconds) o - Output full playlist q - Quit Choose an option: (4) Implement \"Output
full playlist\" menu option. 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 (5) Implement the \"Add
song\" menu item. 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 (6) Implement the \"Remove song\" function. 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\" remove.
Can someone please help me implement the addSong function .pdf
Can someone please help me implement the "addSong" function in the code below? Thank
you!
// You are given a partially completed program that creates a list of songs, like a music repository.
// Each song has this information: song's id, song's name, singer's name, genre of the song, and
its published year.
// The struct 'musicRepository' holds information of one song. Genre is enum type.
// An array of structs called 'list' is made to hold the list of songs.
// You should not modify any of the given code, the return types, or the parameters, you will risk of
getting compilation error.
// You are not allowed to modify main ().
// You can use string library functions.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#pragma warning(disable : 4996) // for Visual Studio Only
#define MAX_SONGS 20
#define MAX_SONG_NAME_LENGTH 40
#define MAX_SINGER_NAME_LENGTH 40
typedef enum
{
unclassified = 0,
Pop,
Rock,
Reggae,
Country,
Blues,
Balad,
} genreType; // enum type
struct musicRepository
{
// struct for song details
unsigned int ID;
char songName[MAX_SONG_NAME_LENGTH];
char singerName[MAX_SINGER_NAME_LENGTH];
genreType genre;
unsigned int year;
};
struct musicRepository list[MAX_SONGS]; // declare the list of songs
int numSongs = 0; // the number of songs currently stored in the list (initialized to 0)
// Given functions
void initializeRepository(struct musicRepository repo[], int size);
void printRepository(struct musicRepository repo[], int numSongs);
void flushSngIn();
// functions that need to be implemented by you
int addSong(struct musicRepository repo[], char* songName, char* singerName, char* genre,
unsigned int year, int numSongs);
struct musicRepository* searchSong(struct musicRepository repo[], char* songName, int
numSongs);
void printSong(struct musicRepository repo[], int ID);
int editSong(struct musicRepository* repo, int numSongs, char* songName);
int deleteSongByName(struct musicRepository* repo, char* songName, int numSongs);
// This function takes in an array of musicRepository structures and the size of the array as
parameters. It then loops through each index of the array and sets the values of id, year, genre,
name, and singer to their respective initial values.
// NOTE that strcpy is used to copy an empty string to name and singer, rather than setting them
equal to "". This is because arrays in C are not assignable, so the strcpy function must be used to
copy the empty string into the array.
void initializeRepository(struct musicRepository repo[], int size)
{
for (int i = 0; i < size; i++)
{
repo[i].ID = 0;
repo[i].year = 0;
repo[i].genre = 0;
strcpy(repo[i].songName, "");
strcpy(repo[i].singerName, "");
}
}
// This function takes in the musicRepository array and iterates through each element. If the ID of
the song is not 0, it prints the details of the song.
void printRepository(struct musicRepository repo[], int numSongs)
{
printf("n--- Song Repository ---n");
for (int i = 0; i < numSongs; i++)
{
if (repo[i].ID != 0)
.
Program 01 For this program you will complete the program in.pdf
Program 01
For this program you will complete the program in the a05.c file. Find the places in the code
marked with the ToDo label and complete the work. You should not change any other part of the
code. This includes do not add any global variables or any other function. The program declares a
struct musicRepository with elements for songs ID, songs name, singers name, genre of the song,
and songs year. You will be completing a program that creates a list of songs (array of structs). It
is a menu-driven program where the user is given the following options:
Add a song to the repository - always inserted in the next available space in the array. The next
available array might not be next to the last song added, it might be somewhere in the middle.
Check Delete function below for details. If there is no space to add a new song, the function
should return -1, and 1 otherwise.
Search song by name - given the name of the song, return the struct with the data of the song.
Print a song - given a struct print its content. Please note that the Genre is an enum type;
however, the print function should print a string, not a number for this field.
Edit a song - given the name of the song, find it (using the Search function above), and modify
any of the fields of the song except ID. ID cannot be edited, and all fields should have a valid
value.
Delete a song - given the name of the song, find it (using the Search function above), and modify
the fields of the song (using the Edit function above), making ID, Year, and Genre 0, and name
and author an empty string. Return -1 if the song was not found, 1 if it was deleted.
Print the whole list of songs. Print the list of songs including all the fields of the song except for
ID.
// CSE240 SPRING 2023 Assignment 05
// Enter your name here
// You are given a partially completed program that creates a list of songs, like a
music repository.
// Each song has this information: song's id, song's name, singer's name, genre of
the song, and its published year.
// The struct 'musicRepository' holds information of one song. Genre is enum type.
// An array of structs called 'list' is made to hold the list of songs.
// To begin, you should trace through the given code and understand how it works.
// Please read the instructions above each resquired function and follow the
directions carefully.
// You should not modify any of the given code, the return types, or the
parameters, you will risk of getting compilation error.
// You are not allowed to modify main ().
// You can use string library functions.
// WRITE COMMENTS FOR IMPORTANT STEPS IN YOUR CODE.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#pragma warning(disable : 4996) // for Visual Studio Only
#define MAX_SONGS 20
#define MAX_SONG_NAME_LENGTH 40
#define MAX_SINGER_NAME_LENGTH 40
typedef enum
{
unclassified = 0,
Pop,
Rock,
Reggae,
Country,
Blues,
Balad,
} genreType; // enum type
struct musicRepository
{
// struct for song details
unsigned int ID;
c.
OverviewThis project will allow you to write a program to get mo.docx
Overview
This project will allow you to write a program to get more practice with object-oriented ideas that we explored in the previous project, as well as some practice with more advanced ideas such as inheritance and the use of interfaces.
Ipods and other MP3 players organize a user's music selection into groups known as playlists. These are data structures that provide a collection of songs and an ordering for how those songs will be played. For this assignment you will be writing a set of PlayList classes that could be used for a program that organizes music for a user. These classes will be written to implement a particular PlayList interface so that they can be easily exchange in and out as the program requires. In addition, you will also be using the SimpleTrack class you wrote for the closed lab on Interfaces - if you did not finish this class before the end of lab, you will need to finish it before starting on this project.
Objectives
Practice with programming fundamentals
Review of various Java fundamentals (branching, loops, variables, methods, etc.)
Review of Java File I/O concepts
Practice with Java ArrayList concepts
Practice with object-oriented programming and design
Practice with Java interfaces
Project Description
The SimplePlaylist Class
Once you have coded and tested your SimpleTrack class, you will need to write a SimplePlaylist class that implements the Playist interface given in the project folder.
The SimplePlayList class stores music tracks in order - the first track added to the play list should be the first one removed from the play list. You should recognize this data structure as a
queue
(or a
first-in, first-out queue
). You do not need to implement the equals, hashCode and toString methods for this class but if you choose to do so make sure you document your implementations properly!
The PlayList Management Program
Once you have written and tested a SimpleTrack class and a SimplePlaylist class, it is time to use them to write a program to manage playlists. This program will simulate the playing of songs from a play list. For the SimplePlaylist, the songs are removed from the playlist as they are played, so you know that you're at the end of the list when your list is empty. This program should be implemented in the file MusicPlayerSimulator.java. Note that we are not defining ANY of the methods you are using for this program - the design is all up to you. You must, however, practice good programming style - make sure you are breaking the program up into smaller methods and aren't just trying to solve everything with one monolithic main method. If you have fewer than 5 methods for this program you are probably trying to fit too much into a single method.
Here is a sample transcript of the output of this program:
Enter database filename:
input.txt
Currently playing: 'Elvis Presley / Blue Suede Shoes / Elvis Presley: Legacy Edition' Next track to play: 'The Beatles / Wit.
Program 02 Based on the previous problem you should impleme.pdf
Program 02
Based on the previous problem, you should implement this second problem in the same file a05.c.
Find the places in the code marked with the ToDo label and complete the work. You should not
change any other part of the code. This includes do not add any global variables or any other
function. For this problem, we are reusing the same struct from problem 1, but adding a pointer to
the struct to be able to create a linked list. In this problem, you must use linked list to create a user
playlist (play_list).
The struct is holding the information of a song: ID, Name, Singer, Genre, Year, and the pointer
Next (the pointer to the struct).
There should be the following functions. In the similar way we have done in previous assignments,
complete the following functions:
Add a song to the play_list - always inserted at the end of the list. Search song by name - given
the name of the song, return the struct with the data of the song.
Edit a song - given the name of the song, find it in the play_list and modify any of the fields of the
song (ID cannot be edited, and all fields should have a valid value). Return -1 if the song was not
found.
Delete a song - given the name of the song, find it, delete the song from the play_list (i.e.,
disconnect the node from the list). Return -1 if the song was not found, 1 if it was deleted.
// Problem 2
// struct to hold information about a song
struct Song
{
int id;
char name[MAX_SONG_NAME_LENGTH];
char singer[MAX_SINGER_NAME_LENGTH];
genreType genre;
int year;
struct Song *next;
};
// Function declarations
struct Song *createSong(int id, char *name, char *singer, char *genre, int year);
void printPlaylist(struct Song *playlist);
void add_song(struct Song **playlist, struct Song *newSong);
struct Song *search_song(struct Song *playlist, char *name);
int edit_song(struct Song *playlist, char *name, char *singer, char *genre, int
year);
int delete_song(struct Song *playlist, char *name);
// function to create a new song
struct Song *createSong(int id, char *name, char *singer, char *genre, int year)
{
struct Song *newSong = (struct Song *)malloc(sizeof(struct Song));
newSong->id = id;
strcpy(newSong->name, name);
strcpy(newSong->singer, singer);
if (strcmp(genre, "Pop") == 0)
newSong->genre = 1;
else if (strcmp(genre, "Rock") == 0)
newSong->genre = 2;
else if (strcmp(genre, "Reggae") == 0)
newSong->genre = 3;
else if (strcmp(genre, "Country") == 0)
newSong->genre = 4;
else if (strcmp(genre, "Blues") == 0)
newSong->genre = 5;
else if (strcmp(genre, "Balad") == 0)
newSong->genre = 6;
else
newSong->genre = 0;
newSong->year = year;
newSong->next = NULL;
return newSong;
}
// function to print the playlist
void printPlaylist(struct Song *playlist)
{
struct Song *current = playlist;
while (current != NULL)
{
printf("%dt%st%st%dt%dn", current->id, current->name, current->singer,
current->genre, current->year);
current = current->next;
}
}
// function to add a song to the end of the playlist
void add_song(struct Song .
Recommended
I need help writing the methods for the song and playList class in J.pdf
I need help writing the methods for the song and playList class in Java. I already have the
interface and the getters and setter. Can someone help with the methods?
Song Class
public class Song
private String artist // the artist performing the song
private String title // the title of the song
private int minutes // number of min in length
private int seconds // number of seconds of length of the song (always less than 60)
// Add Getters / Setters for all fields
// Three constructors (remember to initialize ALL fields in each of the constructors - regardless
of the number of parameters!)
public Song(String artist, String title)
public Song(String artist, String title, int minutes, int seconds)
public Song(Song s)
public boolean equals(Object o) // a song is equal if all four fields are equal
public String toString() { // Use this code for toString EXACTLY
return \"{Song: title = \" + title + \" artist = \" + artist + \"}\";
}
public void play() { // Use this code for play EXACTLY
System.out.printf(\"Playing Song: artist = %-20s title = %s\ \", artist, title);
}
Make the Song class implement the interface Comparable, and make the ordering criteria as
follows: Songs will be ordered by artist in ascending order. If the artists are the same, then by
title in ascending order. If both artist and title are the same, then any order is acceptable.
Don’t forget to include any methods needed to implement the Playable interface.
PlayList Class
public class PlayList
Methods that modify the list should return a boolean return true if they successfully change the
list, otherwise they return false. Note that a PlayList can contain other PlayLists!
Methods that return a Playable element return null if they fail to find the song in question.
private String name // contains the name of the playlist
private ArrayList playableList // ArrayList of Playable elements that make up the play list
// Add Getters / Setters for name and songList
// Add a toString() method that returns the name of the playlist followed by its contents (by
calling toString() on each item it contains). You should only have one name/title per line
// Two constructors (remember to initialize ALL fields in each of the constructors - regardless of
the number of parameters!)
public PlayList() // empty play list named \"Untitled\"
public PlayList(String newName) // empty play list
public boolean loadSongs(String fileName) // loads songs from file, more on this below
public boolean clear() // removes all playable elements in the play list
public boolean addSong(Song s) // adds Song s to the end of the play list
public Playable removePlayable(int index) // removes Playable element at index from the list and
returns it
public Playable removePlayable(Playable p) // removes every occurrence of Playable p from the
list and returns p
public Playable getPlayable(int index) // returns the Playable element at the appropriate index
public boolean addPlayList(PlayList pl) //adds the PlayList that is being pa.
Need help with this java project, as the methods are proving to be p.pdf
Need help with this java project, as the methods are proving to be pretty challenging. Im not
worried about the fields, getters, setters, constructors, ect as those are pretty straightforward, but
any and all help with the methods would be greatly appreciated!
Playable Interface
public interface Playable
Create a Java interface named Playable that includes the following methods (and only the
following methods):
public void play();
public String getName(); // returns the name (for PlayList) or title (for Song) of Playable object.
public int getPlayTimeSeconds(); // For Song: returns the number of seconds in the song. For
PlayList: returns the number of seconds in the entire PlayList
Both the Song and PlayList classes will implement this interface.
Song Class
public class Song
private String artist // the artist performing the song
private String title // the title of the song
private int minutes // number of min in length
private int seconds // number of seconds of length of the song (always less than 60)
// Add Getters / Setters for all fields
// Three constructors (remember to initialize ALL fields in each of the constructors - regardless
of the number of parameters!)
public Song(String artist, String title)
public Song(String artist, String title, int minutes, int seconds)
public Song(Song s)
public boolean equals(Object o) // a song is equal if all four fields are equal
public String toString() { // Use this code for toString EXACTLY
return \"{Song: title = \" + title + \" artist = \" + artist + \"}\";
}
public void play() { // Use this code for play EXACTLY
System.out.printf(\"Playing Song: artist = %-20s title = %s\ \", artist, title);
}
Make the Song class implement the interface Comparable, and make the ordering criteria as
follows: Songs will be ordered by artist in ascending order. If the artists are the same, then by
title in ascending order. If both artist and title are the same, then any order is acceptable.
Don’t forget to include any methods needed to implement the Playable interface.
PlayList Class
public class PlayList
Methods that modify the list should return a boolean return true if they successfully change the
list, otherwise they return false. Note that a PlayList can contain other PlayLists!
Methods that return a Playable element return null if they fail to find the song in question.
private String name // contains the name of the playlist
private ArrayList playableList // ArrayList of Playable elements that make up the play list
// Add Getters / Setters for name and songList
// Add a toString() method that returns the name of the playlist followed by its contents (by
calling toString() on each item it contains). You should only have one name/title per line
// Two constructors (remember to initialize ALL fields in each of the constructors - regardless of
the number of parameters!)
public PlayList() // empty play list named \"Untitled\"
public PlayList(String newName) // empty play list
public boolean loadSongs(String fil.
Can someone please help me complete the add_song function .pdf
Can someone please help me complete the "add_song" function below. Thank you!
// Each song has this information: song's id, song's name, singer's name, genre of the song, and
its published year.
// The struct 'musicRepository' holds information of one song. Genre is enum type.
// An array of structs called 'list' is made to hold the list of songs.
// You should not modify any of the given code, the return types, or the parameters, you will risk of
getting compilation error.
// You are not allowed to modify main ().
// You can use string library functions.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#pragma warning(disable : 4996) // for Visual Studio Only
#define MAX_SONGS 20
#define MAX_SONG_NAME_LENGTH 40
#define MAX_SINGER_NAME_LENGTH 40
typedef enum
{
unclassified = 0,
Pop,
Rock,
Reggae,
Country,
Blues,
Balad,
} genreType; // enum type
struct musicRepository
{
// struct for song details
unsigned int ID;
char songName[MAX_SONG_NAME_LENGTH];
char singerName[MAX_SINGER_NAME_LENGTH];
genreType genre;
unsigned int year;
};
struct musicRepository list[MAX_SONGS]; // declare the list of songs
int numSongs = 0; // the number of songs currently stored in the list (initialized to 0)
// This function takes in an array of musicRepository structures and the size of the array as
parameters. It then loops through each index of the array and sets the values of id, year, genre,
name, and singer to their respective initial values.
// NOTE that strcpy is used to copy an empty string to name and singer, rather than setting them
equal to "". This is because arrays in C are not assignable, so the strcpy function must be used to
copy the empty string into the array.
void initializeRepository(struct musicRepository repo[], int size)
{
for (int i = 0; i < size; i++)
{
repo[i].ID = 0;
repo[i].year = 0;
repo[i].genre = 0;
strcpy(repo[i].songName, "");
strcpy(repo[i].singerName, "");
}
}
// This function takes in the musicRepository array and iterates through each element. If the ID of
the song is not 0, it prints the details of the song.
void printRepository(struct musicRepository repo[], int numSongs)
{
printf("n--- Song Repository ---n");
for (int i = 0; i < numSongs; i++)
{
if (repo[i].ID != 0)
{
printf("ID: %dn", repo[i].ID);
printf("Name: %sn", repo[i].songName);
printf("Singer: %sn", repo[i].singerName);
if (repo[i].genre == 0)
printf("Genre: unclassifiedn");
else if (repo[i].genre == 1)
printf("Genre: Popn");
else if (repo[i].genre == 2)
printf("Genre: Rockn");
else if (repo[i].genre == 3)
printf("Genre: Reggaen");
else if (repo[i].genre == 4)
printf("Genre: Countryn");
else if (repo[i].genre == 5)
printf("Genre: Bluesn");
else if (repo[i].genre == 6)
printf("Genre: Baladn");
printf("Year: %dn", repo[i].year);
printf("n");
}
}
}
// Problem 2
// struct to hold information about a song
struct Song
{
int id;
char name[MAX_SONG_NAME_LENGTH];
char singer[MAX_SINGER_NAME_LENGTH];
genreType genre;
int year;
struct Song* next;
};
// Function declarati.
8.15 Program Playlist (C++) You will be building a linked list. Mak.pdf
8.15 Program: Playlist (C++) You will be building a linked list. Make sure to keep track of both
the head and tail nodes. (1) Create three files to submit. Playlist.h - Class declaration Playlist.cpp
- Class definition main.cpp - main() function Build the PlaylistNode class per the following
specifications. Note: Some functions can initially be function stubs (empty functions), to be
completed in later steps. Default constructor (1 pt) Parameterized constructor (1 pt) Public
member functions InsertAfter() (1 pt) SetNext() - Mutator (1 pt) GetID() - Accessor
GetSongName() - Accessor GetArtistName() - Accessor GetSongLength() - Accessor GetNext()
- Accessor PrintPlaylistNode() Private data members 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 PlaylistNode* nextNodePtr - Initialized to 0 in default constructor Ex. of
PrintPlaylistNode 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() function. PrintMenu() takes the
playlist title as a parameter and outputs a menu of options to manipulate the playlist. Each option
is represented by a single character. Build and output the menu within the function. If an invalid
character is entered, continue to prompt for a valid choice. Hint: Implement Quit before
implementing other options. Call PrintMenu() in the main() function. Continue to execute the
menu until the user enters q to Quit. (3 pts) Ex: JAMZ PLAYLIST MENU a - Add song d -
Remove song c - Change position of song s - Output songs by specific artist t - Output total time
of playlist (in seconds) o - Output full playlist q - Quit Choose an option: (4) Implement \"Output
full playlist\" menu option. 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 (5) Implement the \"Add
song\" menu item. 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 (6) Implement the \"Remove song\" function. 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\" remove.
Can someone please help me implement the addSong function .pdf
Can someone please help me implement the "addSong" function in the code below? Thank
you!
// You are given a partially completed program that creates a list of songs, like a music repository.
// Each song has this information: song's id, song's name, singer's name, genre of the song, and
its published year.
// The struct 'musicRepository' holds information of one song. Genre is enum type.
// An array of structs called 'list' is made to hold the list of songs.
// You should not modify any of the given code, the return types, or the parameters, you will risk of
getting compilation error.
// You are not allowed to modify main ().
// You can use string library functions.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#pragma warning(disable : 4996) // for Visual Studio Only
#define MAX_SONGS 20
#define MAX_SONG_NAME_LENGTH 40
#define MAX_SINGER_NAME_LENGTH 40
typedef enum
{
unclassified = 0,
Pop,
Rock,
Reggae,
Country,
Blues,
Balad,
} genreType; // enum type
struct musicRepository
{
// struct for song details
unsigned int ID;
char songName[MAX_SONG_NAME_LENGTH];
char singerName[MAX_SINGER_NAME_LENGTH];
genreType genre;
unsigned int year;
};
struct musicRepository list[MAX_SONGS]; // declare the list of songs
int numSongs = 0; // the number of songs currently stored in the list (initialized to 0)
// Given functions
void initializeRepository(struct musicRepository repo[], int size);
void printRepository(struct musicRepository repo[], int numSongs);
void flushSngIn();
// functions that need to be implemented by you
int addSong(struct musicRepository repo[], char* songName, char* singerName, char* genre,
unsigned int year, int numSongs);
struct musicRepository* searchSong(struct musicRepository repo[], char* songName, int
numSongs);
void printSong(struct musicRepository repo[], int ID);
int editSong(struct musicRepository* repo, int numSongs, char* songName);
int deleteSongByName(struct musicRepository* repo, char* songName, int numSongs);
// This function takes in an array of musicRepository structures and the size of the array as
parameters. It then loops through each index of the array and sets the values of id, year, genre,
name, and singer to their respective initial values.
// NOTE that strcpy is used to copy an empty string to name and singer, rather than setting them
equal to "". This is because arrays in C are not assignable, so the strcpy function must be used to
copy the empty string into the array.
void initializeRepository(struct musicRepository repo[], int size)
{
for (int i = 0; i < size; i++)
{
repo[i].ID = 0;
repo[i].year = 0;
repo[i].genre = 0;
strcpy(repo[i].songName, "");
strcpy(repo[i].singerName, "");
}
}
// This function takes in the musicRepository array and iterates through each element. If the ID of
the song is not 0, it prints the details of the song.
void printRepository(struct musicRepository repo[], int numSongs)
{
printf("n--- Song Repository ---n");
for (int i = 0; i < numSongs; i++)
{
if (repo[i].ID != 0)
.
Program 01 For this program you will complete the program in.pdf
Program 01
For this program you will complete the program in the a05.c file. Find the places in the code
marked with the ToDo label and complete the work. You should not change any other part of the
code. This includes do not add any global variables or any other function. The program declares a
struct musicRepository with elements for songs ID, songs name, singers name, genre of the song,
and songs year. You will be completing a program that creates a list of songs (array of structs). It
is a menu-driven program where the user is given the following options:
Add a song to the repository - always inserted in the next available space in the array. The next
available array might not be next to the last song added, it might be somewhere in the middle.
Check Delete function below for details. If there is no space to add a new song, the function
should return -1, and 1 otherwise.
Search song by name - given the name of the song, return the struct with the data of the song.
Print a song - given a struct print its content. Please note that the Genre is an enum type;
however, the print function should print a string, not a number for this field.
Edit a song - given the name of the song, find it (using the Search function above), and modify
any of the fields of the song except ID. ID cannot be edited, and all fields should have a valid
value.
Delete a song - given the name of the song, find it (using the Search function above), and modify
the fields of the song (using the Edit function above), making ID, Year, and Genre 0, and name
and author an empty string. Return -1 if the song was not found, 1 if it was deleted.
Print the whole list of songs. Print the list of songs including all the fields of the song except for
ID.
// CSE240 SPRING 2023 Assignment 05
// Enter your name here
// You are given a partially completed program that creates a list of songs, like a
music repository.
// Each song has this information: song's id, song's name, singer's name, genre of
the song, and its published year.
// The struct 'musicRepository' holds information of one song. Genre is enum type.
// An array of structs called 'list' is made to hold the list of songs.
// To begin, you should trace through the given code and understand how it works.
// Please read the instructions above each resquired function and follow the
directions carefully.
// You should not modify any of the given code, the return types, or the
parameters, you will risk of getting compilation error.
// You are not allowed to modify main ().
// You can use string library functions.
// WRITE COMMENTS FOR IMPORTANT STEPS IN YOUR CODE.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#pragma warning(disable : 4996) // for Visual Studio Only
#define MAX_SONGS 20
#define MAX_SONG_NAME_LENGTH 40
#define MAX_SINGER_NAME_LENGTH 40
typedef enum
{
unclassified = 0,
Pop,
Rock,
Reggae,
Country,
Blues,
Balad,
} genreType; // enum type
struct musicRepository
{
// struct for song details
unsigned int ID;
c.
OverviewThis project will allow you to write a program to get mo.docx
Overview
This project will allow you to write a program to get more practice with object-oriented ideas that we explored in the previous project, as well as some practice with more advanced ideas such as inheritance and the use of interfaces.
Ipods and other MP3 players organize a user's music selection into groups known as playlists. These are data structures that provide a collection of songs and an ordering for how those songs will be played. For this assignment you will be writing a set of PlayList classes that could be used for a program that organizes music for a user. These classes will be written to implement a particular PlayList interface so that they can be easily exchange in and out as the program requires. In addition, you will also be using the SimpleTrack class you wrote for the closed lab on Interfaces - if you did not finish this class before the end of lab, you will need to finish it before starting on this project.
Objectives
Practice with programming fundamentals
Review of various Java fundamentals (branching, loops, variables, methods, etc.)
Review of Java File I/O concepts
Practice with Java ArrayList concepts
Practice with object-oriented programming and design
Practice with Java interfaces
Project Description
The SimplePlaylist Class
Once you have coded and tested your SimpleTrack class, you will need to write a SimplePlaylist class that implements the Playist interface given in the project folder.
The SimplePlayList class stores music tracks in order - the first track added to the play list should be the first one removed from the play list. You should recognize this data structure as a
queue
(or a
first-in, first-out queue
). You do not need to implement the equals, hashCode and toString methods for this class but if you choose to do so make sure you document your implementations properly!
The PlayList Management Program
Once you have written and tested a SimpleTrack class and a SimplePlaylist class, it is time to use them to write a program to manage playlists. This program will simulate the playing of songs from a play list. For the SimplePlaylist, the songs are removed from the playlist as they are played, so you know that you're at the end of the list when your list is empty. This program should be implemented in the file MusicPlayerSimulator.java. Note that we are not defining ANY of the methods you are using for this program - the design is all up to you. You must, however, practice good programming style - make sure you are breaking the program up into smaller methods and aren't just trying to solve everything with one monolithic main method. If you have fewer than 5 methods for this program you are probably trying to fit too much into a single method.
Here is a sample transcript of the output of this program:
Enter database filename:
input.txt
Currently playing: 'Elvis Presley / Blue Suede Shoes / Elvis Presley: Legacy Edition' Next track to play: 'The Beatles / Wit.
Program 02 Based on the previous problem you should impleme.pdf
Program 02
Based on the previous problem, you should implement this second problem in the same file a05.c.
Find the places in the code marked with the ToDo label and complete the work. You should not
change any other part of the code. This includes do not add any global variables or any other
function. For this problem, we are reusing the same struct from problem 1, but adding a pointer to
the struct to be able to create a linked list. In this problem, you must use linked list to create a user
playlist (play_list).
The struct is holding the information of a song: ID, Name, Singer, Genre, Year, and the pointer
Next (the pointer to the struct).
There should be the following functions. In the similar way we have done in previous assignments,
complete the following functions:
Add a song to the play_list - always inserted at the end of the list. Search song by name - given
the name of the song, return the struct with the data of the song.
Edit a song - given the name of the song, find it in the play_list and modify any of the fields of the
song (ID cannot be edited, and all fields should have a valid value). Return -1 if the song was not
found.
Delete a song - given the name of the song, find it, delete the song from the play_list (i.e.,
disconnect the node from the list). Return -1 if the song was not found, 1 if it was deleted.
// Problem 2
// struct to hold information about a song
struct Song
{
int id;
char name[MAX_SONG_NAME_LENGTH];
char singer[MAX_SINGER_NAME_LENGTH];
genreType genre;
int year;
struct Song *next;
};
// Function declarations
struct Song *createSong(int id, char *name, char *singer, char *genre, int year);
void printPlaylist(struct Song *playlist);
void add_song(struct Song **playlist, struct Song *newSong);
struct Song *search_song(struct Song *playlist, char *name);
int edit_song(struct Song *playlist, char *name, char *singer, char *genre, int
year);
int delete_song(struct Song *playlist, char *name);
// function to create a new song
struct Song *createSong(int id, char *name, char *singer, char *genre, int year)
{
struct Song *newSong = (struct Song *)malloc(sizeof(struct Song));
newSong->id = id;
strcpy(newSong->name, name);
strcpy(newSong->singer, singer);
if (strcmp(genre, "Pop") == 0)
newSong->genre = 1;
else if (strcmp(genre, "Rock") == 0)
newSong->genre = 2;
else if (strcmp(genre, "Reggae") == 0)
newSong->genre = 3;
else if (strcmp(genre, "Country") == 0)
newSong->genre = 4;
else if (strcmp(genre, "Blues") == 0)
newSong->genre = 5;
else if (strcmp(genre, "Balad") == 0)
newSong->genre = 6;
else
newSong->genre = 0;
newSong->year = year;
newSong->next = NULL;
return newSong;
}
// function to print the playlist
void printPlaylist(struct Song *playlist)
{
struct Song *current = playlist;
while (current != NULL)
{
printf("%dt%st%st%dt%dn", current->id, current->name, current->singer,
current->genre, current->year);
current = current->next;
}
}
// function to add a song to the end of the playlist
void add_song(struct Song .
Given main(), complete the SongNode class to include the printSong.pdf
Given main(), complete the SongNode class to include the printSongInfo() method. Then write
the Playlist class' printPlaylist() method to print all songs in the playlist. DO NOT print the
dummy head node.
Ex: If the input is:
Stomp!
380
The Brothers Johnson
The Dude
337
Quincy Jones
You Don't Own Me
151
Lesley Gore
-1
the output is:
LIST OF SONGS
-------------
Title: Stomp!
Length: 380
Artist: The Brothers Johnson
Title: The Dude
Length: 337
Artist: Quincy Jones
Title: You Don't Own Me
Length: 151
Artist: Lesley Gore
PLAYLIST.JAVA
import java.util.Scanner;
public class Playlist {
public static void main (String[] args) {
Scanner scnr = new Scanner(System.in);
SongNode headNode;
SongNode currNode;
SongNode lastNode;
String songTitle;
int songLength;
String songArtist;
// Front of nodes list
headNode = new SongNode();
lastNode = headNode;
// Read user input until -1 entered
songTitle = scnr.nextLine();
while (!songTitle.equals("-1")) {
songLength = scnr.nextInt();
scnr.nextLine();
songArtist = scnr.nextLine();
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode.insertAfter(currNode);
lastNode = currNode;
songTitle = scnr.nextLine();
}
// Print linked list
System.out.println("LIST OF SONGS");
System.out.println("-------------");
printPlaylist(headNode);
}
}
SONGNODE.JAVA
public class SongNode {
private String songTitle;
private int songLength;
private String songArtist;
private SongNode nextNodeRef; // Reference to the next node
public SongNode() {
songTitle = "";
songLength = 0;
songArtist = "";
nextNodeRef = null;
}
// Constructor
public SongNode(String songTitleInit, int songLengthInit, String songArtistInit) {
this.songTitle = songTitleInit;
this.songLength = songLengthInit;
this.songArtist = songArtistInit;
this.nextNodeRef = null;
}
// Constructor
public SongNode(String songTitleInit, int songLengthInit, String songArtistInit, SongNode
nextLoc) {
this.songTitle = songTitleInit;
this.songLength = songLengthInit;
this.songArtist = songArtistInit;
this.nextNodeRef = nextLoc;
}
// insertAfter
public void insertAfter(SongNode nodeLoc) {
SongNode tmpNext;
tmpNext = this.nextNodeRef;
this.nextNodeRef = nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
}
// Get location pointed by nextNodeRef
public SongNode getNext() {
return this.nextNodeRef;
}
// TODO: Write printSongInfo() method
}.
8.8 Program Playlist (Java)You will be building a linked list. Ma.pdf
8.8 Program: Playlist (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
insertAfter() (1 pt)
setNext() - Mutator (1 pt)
getID() - Accessor
getSongName() - Accessor
getArtistName() - Accessor
getSongLength() - Accessor
getNext() - Accessor
printPlaylistSongs()
Ex. of printPlaylistSongs output:
(2) In main(), prompt the user for the title of the playlist. (1 pt)
Ex:
(3) Implement the printMenu() method. printMenu() takes the playlist title as a parameter and
outputs a menu of options to manipulate the playlist. Each option is represented by a single
character. Build and output the menu within the method.
If an invalid character is entered, continue to prompt for a valid choice. Hint: Implement Quit
before implementing other options. Call printMenu() in the main() method. Continue to execute
the menu until the user enters q to Quit. (3 pts)
Ex:
(4) Implement \"Output full playlist\" menu option. If the list is empty, output: Playlist is empty
(3 pts)
Ex:
(5) Implement the \"Add song\" menu item. New additions are added to the end of the list. (2
pts)
Ex:
(6) Implement the \"Remove song\" method. Prompt the user for the unique ID of the song to be
removed.(4 pts)
Ex:
(7) Implement the \"Change position of song\" menu option. 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:
(8) Implement the \"Output songs by specific artist\" menu option. Prompt the user for the
artist\'s name, and output the node\'s information, starting with the node\'s current position. (2 pt)
Ex:
(9) Implement the \"Output total time of playlist\" menu option. Output the sum of the time of
the playlist\'s songs (in seconds). (2 pts)
Ex:
Solution
SongEntry.java
package playlist;
public class SongEntry {
private String uniqueID;
private String songName;
private String artistName.
It's not working what am I doing wrong- Given main()- complete the Son.pdf
It's not working what am I doing wrong?
Given main(), complete the SongNode class to include the printSongInfo() method. Then write
the Playlist class' printPlaylist() method to print all songs in the playlist. DO NOT print the
dummy head node.
Ex: If the input is:
the output is:
import java.util.Scanner;
public class Playlist {
// TODO: Write method to ouptut list of songs
public static void printPlaylist(SongNode songs){
SongNode song = song.getNext();
while (song != null) {
song.printSongInfo();
System.out.println();
song = song.getNext();
}
}
public static void main (String[] args) {
Scanner scnr = new Scanner(System.in);
SongNode headNode;
SongNode currNode;
SongNode lastNode;
String songTitle;
int songLength;
String songArtist;
// Front of nodes list
headNode = new SongNode();
lastNode = headNode;
// Read user input until -1 entered
songTitle = scnr.nextLine();
while (!songTitle.equals("-1")) {
songLength = scnr.nextInt();
scnr.nextLine();
songArtist = scnr.nextLine();
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode.insertAfter(currNode);
lastNode = currNode;
songTitle = scnr.nextLine();
}
// Print linked list
System.out.println("LIST OF SONGS");
System.out.println("-------------");
printPlaylist(headNode);
}
}
public class SongNode {
private String songTitle;
private int songLength;
private String songArtist;
private SongNode nextNodeRef; // Reference to the next node
public SongNode() {
songTitle = "";
songLength = 0;
songArtist = "";
nextNodeRef = null;
}
// Constructor
public SongNode(String songTitleInit, int songLengthInit, String songArtistInit) {
this.songTitle = songTitleInit;
this.songLength = songLengthInit;
this.songArtist = songArtistInit;
this.nextNodeRef = null;
}
// Constructor
public SongNode(String songTitleInit, int songLengthInit, String songArtistInit, SongNode
nextLoc) {
this.songTitle = songTitleInit;
this.songLength = songLengthInit;
this.songArtist = songArtistInit;
this.nextNodeRef = nextLoc;
}
// insertAfter
public void insertAfter(SongNode nodeLoc) {
SongNode tmpNext;
tmpNext = this.nextNodeRef;
this.nextNodeRef = nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
}
// Get location pointed by nextNodeRef
public SongNode getNext() {
return this.nextNodeRef;
}
// TODO: Write printSongInfo() method
public void printInfo(){
System.out.println("Title: " + songTitle);
System.out.println("Length: " + songLength);
System.out.println("Artist: " + songArtist);
}
}.
PLEASE I need help with my assignment I have to compelet .pdf
PLEASE, I need help with my assignment. I have to compelet what come after (//TODO: ) LINE
AND IT SHOULD VAILD OUT PUT.
PLEASE, Keep in mind you can not change or add anything, just compelet the //TODO yellow , in
the code. please show me an output once you finish I wpuld be thankfull
****************************************************************************************************************
***************** THE CODE
****************************************************************************************************************
****************THE END OF THE CODE
I/ Enter your name here // You are given a partially completed program that creates a list of songs,
like a music repository. // Each song has this information: song's id, song's name, singer's name,
genre of the song, and its published year. // The struct "musicrepository" holds information of one
song. Genre is enum type. // An array of structs called 'tist' is made to hold the list of songs. // To
begin, you should trace through the given code and understand how it works. // Please read the
instructions above each resquired function and follow the directions carefully. // You should not
modify any of the given code, the return types, or the parameters, you will risk of getting
compilation error. 1/ You are not allowed to modify main (). I/ you can use string library functions. //
WRITE COMMENTS FOR IMPORTANT STEPS IN YOUR CODE. #include #include astdlib,h>
Hinclude #pragma warning(disable : 4996) // for visual studio only Wdefine MAX_SONGS 20
Wdefine MAX_SONG_NAME_LENGTH 40 #defIne MAX_SINGER_NAME_LENGTH 40 typedef
enum { unc lassified =0, Pop, Rock, Reggae, country, Blues, Balad, 3 genreType; // enum type
struct musicRepository { // struct for song details unsigned int IO; char
songName[MAX_SONG_NAME_LENGTH]; char singerName[MAX_SINGER_NAME_LENGTH];
genreType genre; unsigned int year; 3 ; struct musicRepository list[MAX_SONGS]; // declare the
list of songs int numsongs = 0; / / the number of songs currently stored in the list (initialized to 0 ) //
Given functions void initializerepository(struct musicrepository repo[], int size); void
printrepository(struct musicrepository repo[], int numsongs); void flushsngin(); // functions that
need to be implemented by you int addsong(struct musickepository repo[], char *songName, char
*singername, char// This function is used to add a song into the list. You can simply add the new
song to the end of list (array of structs). // Do not allow the song to be added to the list if it already
exists in the list. You can do that by checking song names OR IDs already in the list. // If the song
already exists then return without adding it to the list. If the song does not exist in the list then add
the song at the end of the list and return 1. // If song list is full, then do not add new song to the list
and return 2. // The list should be case sensitive. For instance, "Case' and "case" should be
considered two different names. int addSong(str.
In C++ please I need output please You will be building a .pdf
In C++ please I need output please
You will be building a linked list. Make sure to keep track of both the head and tail nodes.
(1) Create three files to submit.
PlaylistNode.h - Class declaration
PlaylistNode.cpp - Class definition
main.cpp - main() function
Build the PlaylistNode class per the following specifications. Note: Some functions can initially be
function stubs (empty functions), to be completed in later steps.
Default constructor (1 pt)
Parameterized constructor (1 pt)
Public member functions
InsertAfter() - Mutator (1 pt)
SetNext() - Mutator (1 pt)
GetID() - Accessor
GetSongName() - Accessor
GetArtistName() - Accessor
GetSongLength() - Accessor
GetNext() - Accessor
PrintPlaylistNode()
Private data members
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
PlaylistNode* nextNodePtr - Initialized to 0 in default constructor
Ex. of PrintPlaylistNode output:
(2) In main(), prompt the user for the title of the playlist. (1 pt)
Ex:
(3) Implement the PrintMenu() function. PrintMenu() takes the playlist title as a parameter and
outputs a menu of options to manipulate the playlist. (1 pt)
Ex:
(4) Implement the ExecuteMenu() function that takes 3 parameters: a character representing the
user's choice, a playlist title, and the pointer to the head node of a playlist. ExecuteMenu()
performs the menu options (described below) according to the user's choice, and returns the
pointer to 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 is entered, continue to prompt for a valid choice. When a valid option is
entered, execute the option by calling ExecuteMenu() and overwrite the pointer to the head node
of the playlist with the returned pointer. 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:
(6) Implement "Output full playlist" menu option in ExecuteMenu(). If the list is empty, output:
Playlist is empty (3 pts)
Ex:
(7) Implement the "Add song" menu option in ExecuteMenu(). New additions are added to the end
of the list. (2 pts)
Ex:
(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:
(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)
.
Exercise 3 You are to code some simple music player application .pdf
Exercise 3:
You are to code some simple music player application making appropriate use of doubly linked
lists with head and tail, as described hereafter.
Create a doubly linked list for a music playlist.
Adding and deleting songs (#1-2) should update the playlist accordingly. Adding a song places it
at the end of the list.
Playing a song (#3) will prompt the user to enter the title of the song and will set the currentSong
pointer to that location in the playlist before printing both the title and singer (e.g., Now playing
by ) . Use the eraseInDLL function definition to implement delete.
Skipping forward or backward (#4-5) will jump to the previous song or the next song,
respectively, and display its title and singer (as per above). Skip forward on the last song takes
you to the beginning of the list. Skip backward on the first song takes you to the last song of the
list.
Exit will quit the program.
*You may use provided main function in Ex3.cpp file to continue.
Sample Output:
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 1
Enter song title: Trouble
Enter singer: Taylor Swift
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 6
Printing playlist...
Title: Staying Alive
Artist: Bee Gees
Title: Hotel California
Artist: The Eagles
Title: Saturnalia
Artist: Marilyn Manson
Title: Potions
Artist: Puscifer
Title: Trouble
Artist: Taylor Swift
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 3
Enter the title of the song to play: Trouble
Enter singer: Taylor Swift
Now playing...
Title: Trouble
Artist: Taylor Swift
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 4
Now Playing...
Title: Staying Alive
Artist: Bee Gees
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 5
Now Playing...
Title: Trouble
Artist: Taylor Swift
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 1
Enter song title: Lavender Haze
Enter singer: Taylor Swift
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 4
Now Playing...
Title: Lavender Haze
Artist: Taylor Swift
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 6
Printing playlist...
Title: Staying Alive
Artist: Bee Gees
Title: Hotel California
Artist: The Eagles
Title: Saturnalia
Artist: Marilyn Manson
Title: Potions
Artist: Puscifer
Title: Trouble
Artist: Taylor Swift
Title: Lavender Haze
Artist: Taylor Swift
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 2
Enter the title of the song to delete: Lavender Haze
Enter singer: Taylor Swift
Deleted!
1. Add a Song
2. Delete a Song
3. Pl.
819 LAB Program Playlist c++ You will be building a li.pdf
8.19 LAB*: Program: Playlist (c++)
You will be building a linked list. Make sure to keep track of both the head and tail nodes.
(1) Create three files to submit.
PlaylistNode.h - Class declaration
PlaylistNode.cpp - Class definition
main.cpp - main() function
Build the PlaylistNode class per the following specifications. Note: Some functions can initially be
function stubs (empty functions), to be completed in later steps.
Default constructor (1 pt)
Parameterized constructor (1 pt)
Public member functions
InsertAfter() - Mutator (1 pt)
SetNext() - Mutator (1 pt)
GetID() - Accessor
GetSongName() - Accessor
GetArtistName() - Accessor
GetSongLength() - Accessor
GetNext() - Accessor
PrintPlaylistNode()
Private data members
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
PlaylistNode* nextNodePtr - Initialized to 0 in default constructor
Ex. of PrintPlaylistNode output:
(2) In main(), prompt the user for the title of the playlist. (1 pt)
Ex:
(3) Implement the PrintMenu() function. PrintMenu() takes the playlist title as a parameter and
outputs a menu of options to manipulate the playlist. (1 pt)
Ex:
(4) Implement the ExecuteMenu() function that takes 3 parameters: a character representing the
user's choice, a playlist title, and the pointer to the head node of a playlist. ExecuteMenu()
performs the menu options (described below) according to the user's choice, and returns the
pointer to 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 is entered, continue to prompt for a valid choice. When a valid option is
entered, execute the option by calling ExecuteMenu() and overwrite the pointer to the head node
of the playlist with the returned pointer. 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:
(6) Implement "Output full playlist" menu option in ExecuteMenu(). If the list is empty, output:
Playlist is empty (3 pts)
Ex:
(7) Implement the "Add song" menu option in ExecuteMenu(). New additions are added to the end
of the list. (2 pts)
Ex:
(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:
(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)
.
Many of us have large digital music collections that are not always .pdf
Many of us have large digital music collections that are not always very well organized. It would
be nice to have a program that would manipulate our music collection based on attributes such as
artist, album title, song title, genre, song length, number times played, and rating. For this
assignment you will write a basic digital music manager (DMM).
Your DMM program must have a text-based interface which allows the user to select from a
mainmenu of options including: (1) load, (2) store, (3) display, (4) insert, (5) delete, (6) edit, (7)
sort, (8) rate, (9) play, (10) shuffle, and (11) exit. For Part I of the assignment, you will only need
to complete the main menu, (1) load, (2) store, (3) display, (6) edit, (8) rate, (9) play, and (11)
exit features. The other features will be completed in the next part of the assignment.
What must the main menu contain?
The main menu must display the following commands:
(1) load
(2) store
(3) display
(4) insert
(5) delete
(6) edit
(7) sort
(8) rate
(9) play
(10) shuffle
(11) exit
After a command is selected and completed, your program must display the main menu again.
This procedure will continue until the “exit” command is selected.
What must “load” do?
The “load” command must read all records from a file called musicPlayList.csv (you may find a
sample file here) into a dynamic doubly linked list. The doubly linked list is considered the main
playlist. As each record is read from the file, it must be inserted at the front of the list. Each
record consists of the following attributes:
Each attribute, in a single record, will be separated by a comma in the .csv (comma separated
values) file. This means that you will need to design an algorithm to extract the required
attributes for each record. Each field in each record will have a value. You do not need to check
for null or empty values.
You must define a struct called Record to represent the above attributes. Also, do not forget that
the Song Length must be represented by another struct called Duration. Duration is defined as
follows:
Finally, each struct Node in the doubly linked list must be defined as follows:
What must “store” do?
The “store” command writes the current records, in the dynamic doubly linked list, to the
musicPlayList.csv file. The store will completely overwrite the previous contents in the file.
What must “display” do?
The “display” command prints records to the screen. This command must support two methods,
one of which is selected by the user:
Print all records.
Print all records that match an artist.
What must “edit” do?
The “edit” command must allow the user to find a record in the list by artist. If there are multiple
records with the same artist, then your program must prompt the user which one to edit. The user
may modify all of the attributes in the record.
What must “rate” do?
The “rate” command must allow the user to assign a value of 1 – 5 to a song; 1 is the lowest
rating and 5 is the highest rating. The rating will repla.
Instructions This project focuses on queues and stacks Foll.pdf
Instructions This project focuses on queues and stacks. Following is the list of files that you need
for this project. DO NOT CHANGE ANYTHING IN THESE FILES. NOT EVEN A SINGLE LINE! -
StdAudio.java - Pitchjava - Accidentaljava - Note.java - Node.java - MelodyMainjava - Melody.java
You will add all of your methods to MelodyQueue.javaYour job is to complete the class that
represent a song: this class is called MelodyQueue. A song is comprised of a series of notes. It
may have repeated sections. As we don't like to have any redundancy, we will only store one copy
of a repeated chunk of notes. Music is usually printed like the example above. The notes are a
series of dots. Their position in relation to the lines determines their pitch and their tops and color,
among other things, determine their length. Since it would be difficult for us to read input in this
style, we will instead read input from a text file. An example input file is shown below: Each line in
it represents a single note. The first number describes the length of the note in seconds. The letter
that follows describes the pitch of the note, using the standard set of letters (AG) or R if the note is
a rest. For notes other than rests, the third item on the line is the octave that the note is in and the
following is the note's accidental value. The final piece of information for all notes is true if the note
is the start or stop of a repeated section and false otherwise. You will implement several methods
in the MelodyQueue class which will allow you to use MelodyMain to play your song with mp3
player like functionality. Your melody will be able to play as well as append another melody to
itself, reverse and have the it's tempo changed.You will add methods to the class:
MelodyQueue.java. You must use Java's Stack and Quetie from java.util. You must use them as
stacks and queues; you may NOT USE anything else that we have not discussed in the class such
as: iterators, iterables or anything of that sort. Your class must have the constructorsimethods
below. It must be possible to call the methods multiple times in any order and get the correct
results each time. Your MelodyQueue class will use a queue to store the notes in the song (all
quepes have pointer to the back and to the front). Bat unless otherwise specified, you may not
create any other auxiliary data structures (such as arrays, lists, stacks, quetes) to help you solve
any method below.MelodyQueue . java (for you to implement): public MelodyQueue () Constructor
with no parameters public void enqueue (Object item) Adds item to the back of the queue. Make
sure to cover the case that queue is null. public Object dequeue () Removes and returns item from
the front of queve. If the queue is null print a message that queve is null. public Boolean isEmpty ()
Checks if queue is empty. public double duration () Returns duration/time of queue. In other
words, it returns the total length of the song in seconds. If the song includes a repe.
maincpp include ltiostreamgt include ltstringgt.pdf
main.cpp:
#include <iostream>
#include <string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef;
public:
SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = NULL;
}
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode* nextLoc);
void InsertAfter(SongNode* nodeLoc);
SongNode* GetNext();
void PrintSongInfo();
};
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = NULL;
}
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = nextLoc;
}
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
SongNode* SongNode::GetNext() {
return this->nextNodeRef;
}
void SongNode::PrintSongInfo() {
cout << "Title: " << this->songTitle << endl;
cout << "Length: " << this->songLength << endl;
cout << "Artist: " << this->songArtist << endl << endl;
}
void PrintPlaylist(SongNode *song) {
song = song->GetNext();
while (song != NULL) {
song->PrintSongInfo();
song = song->GetNext();
}
}
int main() {
SongNode* headNode;
SongNode* currNode;
SongNode* lastNode;
string songTitle;
string songLength;
string songArtist;
headNode = new SongNode();
lastNode = headNode;
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
cout << "nLIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}
SongNode.h:
#include <iostream>
#include <string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef; // Reference to the next node
public:
SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = NULL;
}
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode* nextLoc);
// insertAfter
void InsertAfter(SongNode* nodeLoc);
// Get location pointed by nextNodeRef
SongNode* GetNext();
// Prints song information
void PrintSongInfo();
};
// SongNode.cpp
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = NULL;
}
// Constructor
SongNode:.
The provided codetrack_file_handling.rb class Track att.pdf
The provided code:
*track_file_handling.rb
class Track
attr_accessor :name, :location
def initialize (name, location)
@name = name
@location = location
end
end
# Returns an array of tracks read from the given file
def read_tracks(music_file)
count = music_file.gets().to_i()
tracks = Array.new()
# Put a while loop here which increments an index to read the tracks
track = read_track(music_file)
tracks << track
return tracks
end
# reads in a single track from the given file.
def read_track(a_file)
# complete this function
# you need to create a Track here.
end
# Takes an array of tracks and prints them to the terminal
def print_tracks(tracks)
# Use a while loop with a control variable index
# to print each track. Use tracks.length to determine how
# many times to loop.
# Print each track use: tracks[index] to get each track record
end
# Takes a single track and prints it to the terminal
def print_track(track)
puts(track.name)
puts(track.location)
end
# Open the file and read in the tracks then print them
def main()
a_file = File.new("input.txt", "r") # open for reading
# Print all the tracks
print_tracks(tracks)
end
main()
*input.txt
3
Crackling Rose
sounds/01-Cracklin-rose.wav
Soolaimon
sounds/06-Soolaimon.wav
Sweet Caroline
sounds/20-Sweet_Caroline.wav
Can anyone pls help me with this Ruby task, it's urgent. Thx! Use the code provided to get
started. You must enhance the code provided as follows: - Complete the provided code so that it
reads in an array of tracks then prints them out. The program output (using the file input.txt)
should look as follows: MacBook-Pro-6:TuteTasks mmitchel1s ruby music_tracks_only.rb
Crackling Rose sounds/01-Cracklin-rose.wav Soolaimon sounds/06-Soolaimon.wav Sweet
Caroline sounds/20-Sweet_Caroline.wav MacBook-Pro-6:TuteTasks mmitchel1s Once your
program is running upload a screenshot to the workspace. Below is a structure chart for this task:.
In C++ Plz LAB- Playlist (output linked list) Given main()- complete.pdf
In C++ Plz
LAB: Playlist (output linked list)
Given main(), complete the SongNode class to include the function PrintSongInfo(). Then write
the PrintPlaylist() function in main.cpp to print all songs in the playlist. DO NOT print the
dummy head node.
Ex: If the input is:
the output is:
main.cpp Default Code:
#include <iostream>
#include "SongNode.h"
// TODO: Write PrintPlaylist() function
int main() {
SongNode* headNode;
SongNode* currNode;
SongNode* lastNode;
string songTitle;
string songLength;
string songArtist;
// Front of nodes list
headNode = new SongNode();
lastNode = headNode;
// Read user input until -1 entered
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
// Print linked list
cout << "LIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}.
In C++ Plz and In What Order Do I Put It In- LAB- Playlist (output li.pdf
In C++ Plz and In What Order Do I Put It In.
LAB: Playlist (output linked list)
Given main(), complete the SongNode class to include the function PrintSongInfo(). Then write
the PrintPlaylist() function in main.cpp to print all songs in the playlist. DO NOT print the
dummy head node.
Ex: If the input is:
the output is:
main.cpp Default Code:
#include <iostream>
#include "SongNode.h"
// TODO: Write PrintPlaylist() function
int main() {
SongNode* headNode;
SongNode* currNode;
SongNode* lastNode;
string songTitle;
string songLength;
string songArtist;
// Front of nodes list
headNode = new SongNode();
lastNode = headNode;
// Read user input until -1 entered
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
// Print linked list
cout << "LIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}
SongNode.h Default Code:
#include "iostream"
#include <string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef; // Reference to the next node
public:
SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = NULL;
}
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc);
// insertAfter
void InsertAfter(SongNode* nodeLoc);
// Get location pointed by nextNodeRef
SongNode* GetNext();
// Prints song information
void PrintSongInfo();
};
SongNode.cpp Default Code:
#include "SongNode.h"
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = NULL;
}
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit,
SongNode* nextLoc) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = nextLoc;
}
// insertAfter
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
// Get location pointed by nextNodeRef
SongNode* SongNode::GetNext() {
return this->nextNodeRef;
}
// TODO: Write PrintSongInfo() function
.
Hi,Please find the Ansswer below.PLAYLIST.h#include iostrea.pdf
Hi,
Please find the Ansswer below.
//PLAYLIST.h
#include
#include
#include
#include
using namespace std;
class Playlist
{
private:
string uniqueID;
string songName;
string artistName;
int songLength;
public:
Playlist() { uniqueID = \"\", songName = \"\", artistName = \"\", songLength = 0; };
Playlist(string auniqueId, string asongName, string aArtistName, int aSongLength);
void InsertAfter();
void SetNext();
string GetID();
string GetSongName();
string GetArtistName();
int GetSongLength();
string GetNext();
void PrintPlaylistNode();
};
//PLAYLIST.CPP
#include \"Playlist.h\"
Playlist::Playlist(string auniqueId, string asongName, string aArtistName, int aSongLength)
{
uniqueID = auniqueId;
songName = asongName;
artistName = aArtistName;
songLength = aSongLength;
}
string Playlist::GetArtistName()
{
return artistName;
}
string Playlist::GetID()
{
return uniqueID;
}
string Playlist::GetSongName()
{
return songName;
}
int Playlist::GetSongLength()
{
return songLength;
}
void Playlist::SetNext()
{
}
string Playlist::GetNext()
{
return \"\";
}
void Playlist::InsertAfter() {
}
void Playlist::PrintPlaylistNode()
{
cout << \"Unique ID:\" << uniqueID << endl ;
cout << \"Song Name:\" << songName << endl;
cout << \"Artist Name:\" << artistName << endl;
cout << \"Song Length (in seconds):\" << songLength << endl;
}
//PLAYSLITSNODE.h
#pragma once
#include \"Playlist.h\"
#include
class PlaylistNode
{
private:
std::list library;
Playlist get(list _list, int _i);
void PrintPlaylist(Playlist aPlayList);
public:
void Addsong(Playlist aPlayslist);
void Removesong(string aUnwiid);
void Changeposition(int oldPostion, int anewPostion);
void PrintSongByartist(string aAstist);
void PrintSongtotalLen();
void PrintFullPlayList();
};
//PLAYLIST.CPP
#include \"PlaylistNode.h\"
void PlaylistNode::Addsong(Playlist aPlaylist)
{
library.push_back(aPlaylist);
}
void PlaylistNode::Removesong(string aUnwiid)
{
if (library.size > 0)
{
for (it = library.begin(); it != library.end(); ++it)
{
if (it->GetID() == aUnwiid)
{
cout << it->GetSongName() << endl;
library.remove(*it);
break;
}
}
}
}
Playlist PlaylistNode::get(list _list, int _i) {
list::iterator it = _list.begin();
for (int i = 0; i<_i; i++) {
++it;
}
return *it;
}
std::list::iterator it;
void PlaylistNode::PrintFullPlayList()
{
for (it = library.begin(); it != library.end(); ++it)
{
PrintPlaylist(*it);
}
}
void PlaylistNode::PrintSongByartist(string aartiename)
{
for (it = library.begin(); it != library.end(); ++it)
{
if(it->GetArtistName() == aartiename)
PrintPlaylist(*it);
}
}
void PlaylistNode::PrintSongtotalLen()
{
int TotalSonglengst = 0;
for (it = library.begin(); it != library.end(); ++it)
{
TotalSonglengst += it->GetSongLength();
}
cout << \"Total songs Length (in seconds):\" << TotalSonglengst << endl;
}
void PlaylistNode::PrintPlaylist(Playlist aPlayList)
{
cout << \"Unique ID:\" << aPlayList.GetID() << endl;
cout << \"Song Name:\" << aPlayList.GetSongName() << endl;
cout << \"Artist Name:\" << aPlayList.GetArtis.
I am having the below compile errors. .pdf
I am having the below compile errors.
*****************************************************************************
******
1>------ Build started: Project: playlist, Configuration: Debug Win32 ------
1> Playlist.cpp
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(74): error
C3867: \'std::list>::size\': non-standard syntax; use \'&\' to create a pointer to member
1> with
1> [
1> _Ty=Playlist
1> ]
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(74): error
C2296: \'>\': illegal, left operand has type \'unsigned int (__thiscall std::list>::* )(void) noexcept
const\'
1> with
1> [
1> _Ty=Playlist
1> ]
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(74): error
C2297: \'>\': illegal, right operand has type \'unsigned int (__thiscall std::list>::* )(void) noexcept
const\'
1> with
1> [
1> _Ty=Playlist
1> ]
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(76): error
C2065: \'it\': undeclared identifier
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(78): error
C2065: \'it\': undeclared identifier
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(78): error
C2227: left of \'->GetID\' must point to class/struct/union/generic type
1> c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(78): note:
type is \'unknown-type\'
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(80): error
C2065: \'it\': undeclared identifier
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(80): error
C2227: left of \'->GetSongName\' must point to class/struct/union/generic type
1> c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(80): note:
type is \'unknown-type\'
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(81): error
C2065: \'it\': undeclared identifier
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(144):
error C3867: \'std::list>::size\': non-standard syntax; use \'&\' to create a pointer to member
1> with
1> [
1> _Ty=Playlist
1> ]
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(144):
error C2446: \'<=\': no conversion from \'unsigned int (__thiscall std::list>::* )(void) noexcept
const\' to \'int\'
1> with
1> [
1> _Ty=Playlist
1> ]
1> c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(144):
note: There is no context in which this conversion is possible
========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ==========
****************************************************************
I have three files:
Main.cpp
#include
#include \"Playlist.h\"
using namespace std;
int main()
{
int choice;
string.
C++ Programming Search A Linked ListThe Content of songlist.txt.pdf
C++ Programming: Search A Linked List
The Content of \"songlist.txt\": Problem 2: Write a C++ program that searches the playlist (the
linked list) for a certain song. There are two functions to be implemented. searchSong ByTitl e
and searchSongByArtist. searchSongBy Title will search by song title and print the songs that
have the title searchSongBy Artist will search by song artist and print the songs that are sung by
the artist. Both functions do not need to return the song pointer and they can have a void return
type.
Solution
#include
#include
#include
#include
using namespace std;
int main(){
vector slist;
string line1[30];
int choice;
string artist,title;
ifstream myfile(\"songlist.txt\");
int a = 0;
if(!myfile)
{
cout<<\"Error opening the output file\"<>choice;
if(choice==1){
cout<<\"\ Please enter the title of the song:\";
getline (std::cin,title);
for(int i=0;i.
You are required to implement all the classes as specified by UML di.pdf
You are required to implement all the classes as specified by UML diagram below.The objective
of most of the methods is obvious from the given method name and input parameters.I am listing
below the explanation of the not-so-obvious methods.
PlayList Class:
getSong(pos:int) :Song
a method that returns the song that is located in the given position (pos). If there is no song in the
given position then the method returns null
getSongPosition(title:String):int
a method that takes the song title as input and returns as output the position of the song in the
list. If not found, the method returns -1. Song -title:String -artist: String +Song (title:String,
artist:String) +gettitle ():String +getArtist ):String +tostring ) :String PlayList
maxNumOfSongs:int -currentNumor Songs: int; +PlayList (maxNumOESongs:int)
+getcurrentNumSongs ) :int +addsong (title:String, artist:String) :void +addsong
(song:Song):void +getsong (pos:int) :Song +getsongPosition (title:String) :int User nam String -
favoriteSongs: PlayList +User (name: String, favoriteSongs: PlayList) +User (name: String)
+setFavoriteSongs (1ist: PlayList) :void +getFavoriteSongs) PlayList; +getsong (title:String)
:Song +addsong (title:String, artist:String) :void tartistsongCount (artist:String) :int +tostring ()
:String
Solution
Please find the implementation of all the classes mentioned in the above UML diagram. Please
see comment against each line to get to know the explanation :.
People with a latent TB infection are _____ asymptomatic an.pdf
Paassyyssemmyyommppplpptteoott oommwmmaaitaatthiicctt iia ccba laaunanntdt eddc cna acctn aanTnnn Bos npst o iprnsetrpf eeasrpcaedtrda ieto hdtanhe dt eh a in terihenf eei fn_ec fit_cneiot_fcieont_icno _tt noi.too not oo tth toohe teorhsrtehsresrs
asopsthyreemarspdt othmea itnicfe acntido nc aton
asopsthyreemarspdt othmea itnicfe acntido nc atonnot
ssoypthmreeparstdo mthaet iicn fbeuctt icoann tnoot
ssoypthmreeparstdo mthaet iicn faencdti ocna nto.
Writing a Concise Paper Cost Accounting Analysis Use Acti.pdf
Writing a Concise Paper (Cost Accounting Analysis)
Use Active Voice. Use !I often. Cite sources, letting them speak.
1) Cite sources fully, integrating them in your writing. Avoid: It is said . . . . Instead let the speaker
come alive: Braun (p.16) says, . . . . I am interested in what she says.
3) The cited sources are listed in References. Don"t use footnotes to cite.
4) Include: The paper"s TITLE that tells the specific, concrete focus of your interest. Avoid a
general, broad topic.
1st paragraph. State, first, your research Question(s): !I question: . . . ? to introduce the paper.
2nd paragraph. The Data gathered, citing the sources. Analysis, discussion, and findings in your
own words.
3rd paragraph. A concise, yet concrete summary of your paper and conclusions.
4th paragraph. Under the last sub-heading, !References, list the cited sources.
Your paper must be single spaced, 1 page long [not exceeding 2 pages] including references..
Working with the Calculator program Once imported run the.pdf
Working with the Calculator program.
Once imported run the application (CalcMain is the driver)
Determine what Calculator does and how it works investigate.
Add multiplication and subtraction buttons to the application.
Test to make sure all functionality works as you expect.
Export updated Calculator to a Runnable JAR file.
Go to the location where you put the runnable JAR and double click it to run the application
Capture the runnable JAR file runtime screen shot.
CalcMain.java
import javax.swing.JFrame;
public class CalcMain {
public static void main(String [] args)
{
JFrame frame = new JFrame("Calculator");
//2. Optional: What happens when the frame closes?
frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
//3. Create your panel and put it in the frame.
frame.getContentPane().add(new Calculator());
//4. Size the frame.
frame.setSize(300, 550);
//5. Show it.
frame.setVisible(true);
}
}
Calculator.java
import javax.swing.*;
import java.awt.Color;
import java.awt.event.*;
public class Calculator extends JPanel implements ActionListener {
String num1="";
String num2="";
String operator="";
boolean usingFirst=true;
double total=0;
JTextField display;
JButton b1;
JButton b2;
JButton b3;
JButton b4;
JButton b5;
JButton b6;
JButton b7;
JButton b8;
JButton b9;
JButton b0;
JButton bdec;
JButton bclear;
JButton bequals;
JButton bplus;
JButton bmult;
JButton bsub;
public Calculator()
{
this.setBackground(Color.white);
setLayout(null);
display=new JTextField();
b1=new JButton("1");
b2=new JButton("2");
b3=new JButton("3");
b4=new JButton("4");
b5=new JButton("5");
b6=new JButton("6");
b7=new JButton("7");
b8=new JButton("8");
b9=new JButton("9");
b0=new JButton("0");
bdec=new JButton(".");
bclear=new JButton("C");
bequals = new JButton( "=");
bplus=new JButton("+");
bmult=new JButton("*");
bsub=new JButton("-");
display.setBounds(0,0,205,50);
b1.setBounds(0,200,50,50);
b2.setBounds(50,200,50,50);
b3.setBounds(100,200,50,50);
bplus.setBounds(154,200,50,50);
b4.setBounds(0,150,50,50);
b5.setBounds(50,150,50,50);
b6.setBounds(100,150,50,50);
bmult.setBounds(154,150,50,50);
b7.setBounds(0,100,50,50);
b8.setBounds(50,100,50,50);
b9.setBounds(100,100,50,50);
bsub.setBounds(154,100,50,50);
b0.setBounds(0,250,50,50);
bdec.setBounds(50,250,50,50);
bclear.setBounds(100,250,50,50);
bequals.setBounds(154,250,50,50);
add(b1);
add(b2);
add(b3);
add(b4);
add(b5);
add(b6);
add(b7);
add(b8);
add(b9);
add(b0);
add(bdec);
add(display);
add(bclear);
add(bequals);
add(bplus);
add(bmult);
add(bsub);
b1.addActionListener(this);
b2.addActionListener(this);
b3.addActionListener(this);
b4.addActionListener(this);
b5.addActionListener(this);
b6.addActionListener(this);
b7.addActionListener(this);
b8.addActionListener(this);
b9.addActionListener(this);
b0.addActionListener(this);
bequals.addActionListener(this);
bplus.addActionListener(this);
bclear.addActionListener(this);
bdec.addActionListener(this);
bmult.addActionListener(this);
bsub.addActionListener(this);
}
public vo.
More Related Content
Similar to Write a program in C++ language that implements a music play.pdf
Given main(), complete the SongNode class to include the printSong.pdf
Given main(), complete the SongNode class to include the printSongInfo() method. Then write
the Playlist class' printPlaylist() method to print all songs in the playlist. DO NOT print the
dummy head node.
Ex: If the input is:
Stomp!
380
The Brothers Johnson
The Dude
337
Quincy Jones
You Don't Own Me
151
Lesley Gore
-1
the output is:
LIST OF SONGS
-------------
Title: Stomp!
Length: 380
Artist: The Brothers Johnson
Title: The Dude
Length: 337
Artist: Quincy Jones
Title: You Don't Own Me
Length: 151
Artist: Lesley Gore
PLAYLIST.JAVA
import java.util.Scanner;
public class Playlist {
public static void main (String[] args) {
Scanner scnr = new Scanner(System.in);
SongNode headNode;
SongNode currNode;
SongNode lastNode;
String songTitle;
int songLength;
String songArtist;
// Front of nodes list
headNode = new SongNode();
lastNode = headNode;
// Read user input until -1 entered
songTitle = scnr.nextLine();
while (!songTitle.equals("-1")) {
songLength = scnr.nextInt();
scnr.nextLine();
songArtist = scnr.nextLine();
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode.insertAfter(currNode);
lastNode = currNode;
songTitle = scnr.nextLine();
}
// Print linked list
System.out.println("LIST OF SONGS");
System.out.println("-------------");
printPlaylist(headNode);
}
}
SONGNODE.JAVA
public class SongNode {
private String songTitle;
private int songLength;
private String songArtist;
private SongNode nextNodeRef; // Reference to the next node
public SongNode() {
songTitle = "";
songLength = 0;
songArtist = "";
nextNodeRef = null;
}
// Constructor
public SongNode(String songTitleInit, int songLengthInit, String songArtistInit) {
this.songTitle = songTitleInit;
this.songLength = songLengthInit;
this.songArtist = songArtistInit;
this.nextNodeRef = null;
}
// Constructor
public SongNode(String songTitleInit, int songLengthInit, String songArtistInit, SongNode
nextLoc) {
this.songTitle = songTitleInit;
this.songLength = songLengthInit;
this.songArtist = songArtistInit;
this.nextNodeRef = nextLoc;
}
// insertAfter
public void insertAfter(SongNode nodeLoc) {
SongNode tmpNext;
tmpNext = this.nextNodeRef;
this.nextNodeRef = nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
}
// Get location pointed by nextNodeRef
public SongNode getNext() {
return this.nextNodeRef;
}
// TODO: Write printSongInfo() method
}.
8.8 Program Playlist (Java)You will be building a linked list. Ma.pdf
8.8 Program: Playlist (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
insertAfter() (1 pt)
setNext() - Mutator (1 pt)
getID() - Accessor
getSongName() - Accessor
getArtistName() - Accessor
getSongLength() - Accessor
getNext() - Accessor
printPlaylistSongs()
Ex. of printPlaylistSongs output:
(2) In main(), prompt the user for the title of the playlist. (1 pt)
Ex:
(3) Implement the printMenu() method. printMenu() takes the playlist title as a parameter and
outputs a menu of options to manipulate the playlist. Each option is represented by a single
character. Build and output the menu within the method.
If an invalid character is entered, continue to prompt for a valid choice. Hint: Implement Quit
before implementing other options. Call printMenu() in the main() method. Continue to execute
the menu until the user enters q to Quit. (3 pts)
Ex:
(4) Implement \"Output full playlist\" menu option. If the list is empty, output: Playlist is empty
(3 pts)
Ex:
(5) Implement the \"Add song\" menu item. New additions are added to the end of the list. (2
pts)
Ex:
(6) Implement the \"Remove song\" method. Prompt the user for the unique ID of the song to be
removed.(4 pts)
Ex:
(7) Implement the \"Change position of song\" menu option. 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:
(8) Implement the \"Output songs by specific artist\" menu option. Prompt the user for the
artist\'s name, and output the node\'s information, starting with the node\'s current position. (2 pt)
Ex:
(9) Implement the \"Output total time of playlist\" menu option. Output the sum of the time of
the playlist\'s songs (in seconds). (2 pts)
Ex:
Solution
SongEntry.java
package playlist;
public class SongEntry {
private String uniqueID;
private String songName;
private String artistName.
It's not working what am I doing wrong- Given main()- complete the Son.pdf
It's not working what am I doing wrong?
Given main(), complete the SongNode class to include the printSongInfo() method. Then write
the Playlist class' printPlaylist() method to print all songs in the playlist. DO NOT print the
dummy head node.
Ex: If the input is:
the output is:
import java.util.Scanner;
public class Playlist {
// TODO: Write method to ouptut list of songs
public static void printPlaylist(SongNode songs){
SongNode song = song.getNext();
while (song != null) {
song.printSongInfo();
System.out.println();
song = song.getNext();
}
}
public static void main (String[] args) {
Scanner scnr = new Scanner(System.in);
SongNode headNode;
SongNode currNode;
SongNode lastNode;
String songTitle;
int songLength;
String songArtist;
// Front of nodes list
headNode = new SongNode();
lastNode = headNode;
// Read user input until -1 entered
songTitle = scnr.nextLine();
while (!songTitle.equals("-1")) {
songLength = scnr.nextInt();
scnr.nextLine();
songArtist = scnr.nextLine();
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode.insertAfter(currNode);
lastNode = currNode;
songTitle = scnr.nextLine();
}
// Print linked list
System.out.println("LIST OF SONGS");
System.out.println("-------------");
printPlaylist(headNode);
}
}
public class SongNode {
private String songTitle;
private int songLength;
private String songArtist;
private SongNode nextNodeRef; // Reference to the next node
public SongNode() {
songTitle = "";
songLength = 0;
songArtist = "";
nextNodeRef = null;
}
// Constructor
public SongNode(String songTitleInit, int songLengthInit, String songArtistInit) {
this.songTitle = songTitleInit;
this.songLength = songLengthInit;
this.songArtist = songArtistInit;
this.nextNodeRef = null;
}
// Constructor
public SongNode(String songTitleInit, int songLengthInit, String songArtistInit, SongNode
nextLoc) {
this.songTitle = songTitleInit;
this.songLength = songLengthInit;
this.songArtist = songArtistInit;
this.nextNodeRef = nextLoc;
}
// insertAfter
public void insertAfter(SongNode nodeLoc) {
SongNode tmpNext;
tmpNext = this.nextNodeRef;
this.nextNodeRef = nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
}
// Get location pointed by nextNodeRef
public SongNode getNext() {
return this.nextNodeRef;
}
// TODO: Write printSongInfo() method
public void printInfo(){
System.out.println("Title: " + songTitle);
System.out.println("Length: " + songLength);
System.out.println("Artist: " + songArtist);
}
}.
PLEASE I need help with my assignment I have to compelet .pdf
PLEASE, I need help with my assignment. I have to compelet what come after (//TODO: ) LINE
AND IT SHOULD VAILD OUT PUT.
PLEASE, Keep in mind you can not change or add anything, just compelet the //TODO yellow , in
the code. please show me an output once you finish I wpuld be thankfull
****************************************************************************************************************
***************** THE CODE
****************************************************************************************************************
****************THE END OF THE CODE
I/ Enter your name here // You are given a partially completed program that creates a list of songs,
like a music repository. // Each song has this information: song's id, song's name, singer's name,
genre of the song, and its published year. // The struct "musicrepository" holds information of one
song. Genre is enum type. // An array of structs called 'tist' is made to hold the list of songs. // To
begin, you should trace through the given code and understand how it works. // Please read the
instructions above each resquired function and follow the directions carefully. // You should not
modify any of the given code, the return types, or the parameters, you will risk of getting
compilation error. 1/ You are not allowed to modify main (). I/ you can use string library functions. //
WRITE COMMENTS FOR IMPORTANT STEPS IN YOUR CODE. #include #include astdlib,h>
Hinclude #pragma warning(disable : 4996) // for visual studio only Wdefine MAX_SONGS 20
Wdefine MAX_SONG_NAME_LENGTH 40 #defIne MAX_SINGER_NAME_LENGTH 40 typedef
enum { unc lassified =0, Pop, Rock, Reggae, country, Blues, Balad, 3 genreType; // enum type
struct musicRepository { // struct for song details unsigned int IO; char
songName[MAX_SONG_NAME_LENGTH]; char singerName[MAX_SINGER_NAME_LENGTH];
genreType genre; unsigned int year; 3 ; struct musicRepository list[MAX_SONGS]; // declare the
list of songs int numsongs = 0; / / the number of songs currently stored in the list (initialized to 0 ) //
Given functions void initializerepository(struct musicrepository repo[], int size); void
printrepository(struct musicrepository repo[], int numsongs); void flushsngin(); // functions that
need to be implemented by you int addsong(struct musickepository repo[], char *songName, char
*singername, char// This function is used to add a song into the list. You can simply add the new
song to the end of list (array of structs). // Do not allow the song to be added to the list if it already
exists in the list. You can do that by checking song names OR IDs already in the list. // If the song
already exists then return without adding it to the list. If the song does not exist in the list then add
the song at the end of the list and return 1. // If song list is full, then do not add new song to the list
and return 2. // The list should be case sensitive. For instance, "Case' and "case" should be
considered two different names. int addSong(str.
In C++ please I need output please You will be building a .pdf
In C++ please I need output please
You will be building a linked list. Make sure to keep track of both the head and tail nodes.
(1) Create three files to submit.
PlaylistNode.h - Class declaration
PlaylistNode.cpp - Class definition
main.cpp - main() function
Build the PlaylistNode class per the following specifications. Note: Some functions can initially be
function stubs (empty functions), to be completed in later steps.
Default constructor (1 pt)
Parameterized constructor (1 pt)
Public member functions
InsertAfter() - Mutator (1 pt)
SetNext() - Mutator (1 pt)
GetID() - Accessor
GetSongName() - Accessor
GetArtistName() - Accessor
GetSongLength() - Accessor
GetNext() - Accessor
PrintPlaylistNode()
Private data members
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
PlaylistNode* nextNodePtr - Initialized to 0 in default constructor
Ex. of PrintPlaylistNode output:
(2) In main(), prompt the user for the title of the playlist. (1 pt)
Ex:
(3) Implement the PrintMenu() function. PrintMenu() takes the playlist title as a parameter and
outputs a menu of options to manipulate the playlist. (1 pt)
Ex:
(4) Implement the ExecuteMenu() function that takes 3 parameters: a character representing the
user's choice, a playlist title, and the pointer to the head node of a playlist. ExecuteMenu()
performs the menu options (described below) according to the user's choice, and returns the
pointer to 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 is entered, continue to prompt for a valid choice. When a valid option is
entered, execute the option by calling ExecuteMenu() and overwrite the pointer to the head node
of the playlist with the returned pointer. 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:
(6) Implement "Output full playlist" menu option in ExecuteMenu(). If the list is empty, output:
Playlist is empty (3 pts)
Ex:
(7) Implement the "Add song" menu option in ExecuteMenu(). New additions are added to the end
of the list. (2 pts)
Ex:
(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:
(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)
.
Exercise 3 You are to code some simple music player application .pdf
Exercise 3:
You are to code some simple music player application making appropriate use of doubly linked
lists with head and tail, as described hereafter.
Create a doubly linked list for a music playlist.
Adding and deleting songs (#1-2) should update the playlist accordingly. Adding a song places it
at the end of the list.
Playing a song (#3) will prompt the user to enter the title of the song and will set the currentSong
pointer to that location in the playlist before printing both the title and singer (e.g., Now playing
by ) . Use the eraseInDLL function definition to implement delete.
Skipping forward or backward (#4-5) will jump to the previous song or the next song,
respectively, and display its title and singer (as per above). Skip forward on the last song takes
you to the beginning of the list. Skip backward on the first song takes you to the last song of the
list.
Exit will quit the program.
*You may use provided main function in Ex3.cpp file to continue.
Sample Output:
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 1
Enter song title: Trouble
Enter singer: Taylor Swift
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 6
Printing playlist...
Title: Staying Alive
Artist: Bee Gees
Title: Hotel California
Artist: The Eagles
Title: Saturnalia
Artist: Marilyn Manson
Title: Potions
Artist: Puscifer
Title: Trouble
Artist: Taylor Swift
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 3
Enter the title of the song to play: Trouble
Enter singer: Taylor Swift
Now playing...
Title: Trouble
Artist: Taylor Swift
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 4
Now Playing...
Title: Staying Alive
Artist: Bee Gees
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 5
Now Playing...
Title: Trouble
Artist: Taylor Swift
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 1
Enter song title: Lavender Haze
Enter singer: Taylor Swift
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 4
Now Playing...
Title: Lavender Haze
Artist: Taylor Swift
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 6
Printing playlist...
Title: Staying Alive
Artist: Bee Gees
Title: Hotel California
Artist: The Eagles
Title: Saturnalia
Artist: Marilyn Manson
Title: Potions
Artist: Puscifer
Title: Trouble
Artist: Taylor Swift
Title: Lavender Haze
Artist: Taylor Swift
1. Add a Song
2. Delete a Song
3. Play a Song
4. Forward
5. Backward
6. Show Playlist
7.Exit
Choose an option: 2
Enter the title of the song to delete: Lavender Haze
Enter singer: Taylor Swift
Deleted!
1. Add a Song
2. Delete a Song
3. Pl.
819 LAB Program Playlist c++ You will be building a li.pdf
8.19 LAB*: Program: Playlist (c++)
You will be building a linked list. Make sure to keep track of both the head and tail nodes.
(1) Create three files to submit.
PlaylistNode.h - Class declaration
PlaylistNode.cpp - Class definition
main.cpp - main() function
Build the PlaylistNode class per the following specifications. Note: Some functions can initially be
function stubs (empty functions), to be completed in later steps.
Default constructor (1 pt)
Parameterized constructor (1 pt)
Public member functions
InsertAfter() - Mutator (1 pt)
SetNext() - Mutator (1 pt)
GetID() - Accessor
GetSongName() - Accessor
GetArtistName() - Accessor
GetSongLength() - Accessor
GetNext() - Accessor
PrintPlaylistNode()
Private data members
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
PlaylistNode* nextNodePtr - Initialized to 0 in default constructor
Ex. of PrintPlaylistNode output:
(2) In main(), prompt the user for the title of the playlist. (1 pt)
Ex:
(3) Implement the PrintMenu() function. PrintMenu() takes the playlist title as a parameter and
outputs a menu of options to manipulate the playlist. (1 pt)
Ex:
(4) Implement the ExecuteMenu() function that takes 3 parameters: a character representing the
user's choice, a playlist title, and the pointer to the head node of a playlist. ExecuteMenu()
performs the menu options (described below) according to the user's choice, and returns the
pointer to 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 is entered, continue to prompt for a valid choice. When a valid option is
entered, execute the option by calling ExecuteMenu() and overwrite the pointer to the head node
of the playlist with the returned pointer. 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:
(6) Implement "Output full playlist" menu option in ExecuteMenu(). If the list is empty, output:
Playlist is empty (3 pts)
Ex:
(7) Implement the "Add song" menu option in ExecuteMenu(). New additions are added to the end
of the list. (2 pts)
Ex:
(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:
(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)
.
Many of us have large digital music collections that are not always .pdf
Many of us have large digital music collections that are not always very well organized. It would
be nice to have a program that would manipulate our music collection based on attributes such as
artist, album title, song title, genre, song length, number times played, and rating. For this
assignment you will write a basic digital music manager (DMM).
Your DMM program must have a text-based interface which allows the user to select from a
mainmenu of options including: (1) load, (2) store, (3) display, (4) insert, (5) delete, (6) edit, (7)
sort, (8) rate, (9) play, (10) shuffle, and (11) exit. For Part I of the assignment, you will only need
to complete the main menu, (1) load, (2) store, (3) display, (6) edit, (8) rate, (9) play, and (11)
exit features. The other features will be completed in the next part of the assignment.
What must the main menu contain?
The main menu must display the following commands:
(1) load
(2) store
(3) display
(4) insert
(5) delete
(6) edit
(7) sort
(8) rate
(9) play
(10) shuffle
(11) exit
After a command is selected and completed, your program must display the main menu again.
This procedure will continue until the “exit” command is selected.
What must “load” do?
The “load” command must read all records from a file called musicPlayList.csv (you may find a
sample file here) into a dynamic doubly linked list. The doubly linked list is considered the main
playlist. As each record is read from the file, it must be inserted at the front of the list. Each
record consists of the following attributes:
Each attribute, in a single record, will be separated by a comma in the .csv (comma separated
values) file. This means that you will need to design an algorithm to extract the required
attributes for each record. Each field in each record will have a value. You do not need to check
for null or empty values.
You must define a struct called Record to represent the above attributes. Also, do not forget that
the Song Length must be represented by another struct called Duration. Duration is defined as
follows:
Finally, each struct Node in the doubly linked list must be defined as follows:
What must “store” do?
The “store” command writes the current records, in the dynamic doubly linked list, to the
musicPlayList.csv file. The store will completely overwrite the previous contents in the file.
What must “display” do?
The “display” command prints records to the screen. This command must support two methods,
one of which is selected by the user:
Print all records.
Print all records that match an artist.
What must “edit” do?
The “edit” command must allow the user to find a record in the list by artist. If there are multiple
records with the same artist, then your program must prompt the user which one to edit. The user
may modify all of the attributes in the record.
What must “rate” do?
The “rate” command must allow the user to assign a value of 1 – 5 to a song; 1 is the lowest
rating and 5 is the highest rating. The rating will repla.
Instructions This project focuses on queues and stacks Foll.pdf
Instructions This project focuses on queues and stacks. Following is the list of files that you need
for this project. DO NOT CHANGE ANYTHING IN THESE FILES. NOT EVEN A SINGLE LINE! -
StdAudio.java - Pitchjava - Accidentaljava - Note.java - Node.java - MelodyMainjava - Melody.java
You will add all of your methods to MelodyQueue.javaYour job is to complete the class that
represent a song: this class is called MelodyQueue. A song is comprised of a series of notes. It
may have repeated sections. As we don't like to have any redundancy, we will only store one copy
of a repeated chunk of notes. Music is usually printed like the example above. The notes are a
series of dots. Their position in relation to the lines determines their pitch and their tops and color,
among other things, determine their length. Since it would be difficult for us to read input in this
style, we will instead read input from a text file. An example input file is shown below: Each line in
it represents a single note. The first number describes the length of the note in seconds. The letter
that follows describes the pitch of the note, using the standard set of letters (AG) or R if the note is
a rest. For notes other than rests, the third item on the line is the octave that the note is in and the
following is the note's accidental value. The final piece of information for all notes is true if the note
is the start or stop of a repeated section and false otherwise. You will implement several methods
in the MelodyQueue class which will allow you to use MelodyMain to play your song with mp3
player like functionality. Your melody will be able to play as well as append another melody to
itself, reverse and have the it's tempo changed.You will add methods to the class:
MelodyQueue.java. You must use Java's Stack and Quetie from java.util. You must use them as
stacks and queues; you may NOT USE anything else that we have not discussed in the class such
as: iterators, iterables or anything of that sort. Your class must have the constructorsimethods
below. It must be possible to call the methods multiple times in any order and get the correct
results each time. Your MelodyQueue class will use a queue to store the notes in the song (all
quepes have pointer to the back and to the front). Bat unless otherwise specified, you may not
create any other auxiliary data structures (such as arrays, lists, stacks, quetes) to help you solve
any method below.MelodyQueue . java (for you to implement): public MelodyQueue () Constructor
with no parameters public void enqueue (Object item) Adds item to the back of the queue. Make
sure to cover the case that queue is null. public Object dequeue () Removes and returns item from
the front of queve. If the queue is null print a message that queve is null. public Boolean isEmpty ()
Checks if queue is empty. public double duration () Returns duration/time of queue. In other
words, it returns the total length of the song in seconds. If the song includes a repe.
maincpp include ltiostreamgt include ltstringgt.pdf
main.cpp:
#include <iostream>
#include <string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef;
public:
SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = NULL;
}
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode* nextLoc);
void InsertAfter(SongNode* nodeLoc);
SongNode* GetNext();
void PrintSongInfo();
};
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = NULL;
}
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = nextLoc;
}
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
SongNode* SongNode::GetNext() {
return this->nextNodeRef;
}
void SongNode::PrintSongInfo() {
cout << "Title: " << this->songTitle << endl;
cout << "Length: " << this->songLength << endl;
cout << "Artist: " << this->songArtist << endl << endl;
}
void PrintPlaylist(SongNode *song) {
song = song->GetNext();
while (song != NULL) {
song->PrintSongInfo();
song = song->GetNext();
}
}
int main() {
SongNode* headNode;
SongNode* currNode;
SongNode* lastNode;
string songTitle;
string songLength;
string songArtist;
headNode = new SongNode();
lastNode = headNode;
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
cout << "nLIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}
SongNode.h:
#include <iostream>
#include <string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef; // Reference to the next node
public:
SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = NULL;
}
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode* nextLoc);
// insertAfter
void InsertAfter(SongNode* nodeLoc);
// Get location pointed by nextNodeRef
SongNode* GetNext();
// Prints song information
void PrintSongInfo();
};
// SongNode.cpp
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = NULL;
}
// Constructor
SongNode:.
The provided codetrack_file_handling.rb class Track att.pdf
The provided code:
*track_file_handling.rb
class Track
attr_accessor :name, :location
def initialize (name, location)
@name = name
@location = location
end
end
# Returns an array of tracks read from the given file
def read_tracks(music_file)
count = music_file.gets().to_i()
tracks = Array.new()
# Put a while loop here which increments an index to read the tracks
track = read_track(music_file)
tracks << track
return tracks
end
# reads in a single track from the given file.
def read_track(a_file)
# complete this function
# you need to create a Track here.
end
# Takes an array of tracks and prints them to the terminal
def print_tracks(tracks)
# Use a while loop with a control variable index
# to print each track. Use tracks.length to determine how
# many times to loop.
# Print each track use: tracks[index] to get each track record
end
# Takes a single track and prints it to the terminal
def print_track(track)
puts(track.name)
puts(track.location)
end
# Open the file and read in the tracks then print them
def main()
a_file = File.new("input.txt", "r") # open for reading
# Print all the tracks
print_tracks(tracks)
end
main()
*input.txt
3
Crackling Rose
sounds/01-Cracklin-rose.wav
Soolaimon
sounds/06-Soolaimon.wav
Sweet Caroline
sounds/20-Sweet_Caroline.wav
Can anyone pls help me with this Ruby task, it's urgent. Thx! Use the code provided to get
started. You must enhance the code provided as follows: - Complete the provided code so that it
reads in an array of tracks then prints them out. The program output (using the file input.txt)
should look as follows: MacBook-Pro-6:TuteTasks mmitchel1s ruby music_tracks_only.rb
Crackling Rose sounds/01-Cracklin-rose.wav Soolaimon sounds/06-Soolaimon.wav Sweet
Caroline sounds/20-Sweet_Caroline.wav MacBook-Pro-6:TuteTasks mmitchel1s Once your
program is running upload a screenshot to the workspace. Below is a structure chart for this task:.
In C++ Plz LAB- Playlist (output linked list) Given main()- complete.pdf
In C++ Plz
LAB: Playlist (output linked list)
Given main(), complete the SongNode class to include the function PrintSongInfo(). Then write
the PrintPlaylist() function in main.cpp to print all songs in the playlist. DO NOT print the
dummy head node.
Ex: If the input is:
the output is:
main.cpp Default Code:
#include <iostream>
#include "SongNode.h"
// TODO: Write PrintPlaylist() function
int main() {
SongNode* headNode;
SongNode* currNode;
SongNode* lastNode;
string songTitle;
string songLength;
string songArtist;
// Front of nodes list
headNode = new SongNode();
lastNode = headNode;
// Read user input until -1 entered
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
// Print linked list
cout << "LIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}.
In C++ Plz and In What Order Do I Put It In- LAB- Playlist (output li.pdf
In C++ Plz and In What Order Do I Put It In.
LAB: Playlist (output linked list)
Given main(), complete the SongNode class to include the function PrintSongInfo(). Then write
the PrintPlaylist() function in main.cpp to print all songs in the playlist. DO NOT print the
dummy head node.
Ex: If the input is:
the output is:
main.cpp Default Code:
#include <iostream>
#include "SongNode.h"
// TODO: Write PrintPlaylist() function
int main() {
SongNode* headNode;
SongNode* currNode;
SongNode* lastNode;
string songTitle;
string songLength;
string songArtist;
// Front of nodes list
headNode = new SongNode();
lastNode = headNode;
// Read user input until -1 entered
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
// Print linked list
cout << "LIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}
SongNode.h Default Code:
#include "iostream"
#include <string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef; // Reference to the next node
public:
SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = NULL;
}
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc);
// insertAfter
void InsertAfter(SongNode* nodeLoc);
// Get location pointed by nextNodeRef
SongNode* GetNext();
// Prints song information
void PrintSongInfo();
};
SongNode.cpp Default Code:
#include "SongNode.h"
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = NULL;
}
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit,
SongNode* nextLoc) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = nextLoc;
}
// insertAfter
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
// Get location pointed by nextNodeRef
SongNode* SongNode::GetNext() {
return this->nextNodeRef;
}
// TODO: Write PrintSongInfo() function
.
Hi,Please find the Ansswer below.PLAYLIST.h#include iostrea.pdf
Hi,
Please find the Ansswer below.
//PLAYLIST.h
#include
#include
#include
#include
using namespace std;
class Playlist
{
private:
string uniqueID;
string songName;
string artistName;
int songLength;
public:
Playlist() { uniqueID = \"\", songName = \"\", artistName = \"\", songLength = 0; };
Playlist(string auniqueId, string asongName, string aArtistName, int aSongLength);
void InsertAfter();
void SetNext();
string GetID();
string GetSongName();
string GetArtistName();
int GetSongLength();
string GetNext();
void PrintPlaylistNode();
};
//PLAYLIST.CPP
#include \"Playlist.h\"
Playlist::Playlist(string auniqueId, string asongName, string aArtistName, int aSongLength)
{
uniqueID = auniqueId;
songName = asongName;
artistName = aArtistName;
songLength = aSongLength;
}
string Playlist::GetArtistName()
{
return artistName;
}
string Playlist::GetID()
{
return uniqueID;
}
string Playlist::GetSongName()
{
return songName;
}
int Playlist::GetSongLength()
{
return songLength;
}
void Playlist::SetNext()
{
}
string Playlist::GetNext()
{
return \"\";
}
void Playlist::InsertAfter() {
}
void Playlist::PrintPlaylistNode()
{
cout << \"Unique ID:\" << uniqueID << endl ;
cout << \"Song Name:\" << songName << endl;
cout << \"Artist Name:\" << artistName << endl;
cout << \"Song Length (in seconds):\" << songLength << endl;
}
//PLAYSLITSNODE.h
#pragma once
#include \"Playlist.h\"
#include
class PlaylistNode
{
private:
std::list library;
Playlist get(list _list, int _i);
void PrintPlaylist(Playlist aPlayList);
public:
void Addsong(Playlist aPlayslist);
void Removesong(string aUnwiid);
void Changeposition(int oldPostion, int anewPostion);
void PrintSongByartist(string aAstist);
void PrintSongtotalLen();
void PrintFullPlayList();
};
//PLAYLIST.CPP
#include \"PlaylistNode.h\"
void PlaylistNode::Addsong(Playlist aPlaylist)
{
library.push_back(aPlaylist);
}
void PlaylistNode::Removesong(string aUnwiid)
{
if (library.size > 0)
{
for (it = library.begin(); it != library.end(); ++it)
{
if (it->GetID() == aUnwiid)
{
cout << it->GetSongName() << endl;
library.remove(*it);
break;
}
}
}
}
Playlist PlaylistNode::get(list _list, int _i) {
list::iterator it = _list.begin();
for (int i = 0; i<_i; i++) {
++it;
}
return *it;
}
std::list::iterator it;
void PlaylistNode::PrintFullPlayList()
{
for (it = library.begin(); it != library.end(); ++it)
{
PrintPlaylist(*it);
}
}
void PlaylistNode::PrintSongByartist(string aartiename)
{
for (it = library.begin(); it != library.end(); ++it)
{
if(it->GetArtistName() == aartiename)
PrintPlaylist(*it);
}
}
void PlaylistNode::PrintSongtotalLen()
{
int TotalSonglengst = 0;
for (it = library.begin(); it != library.end(); ++it)
{
TotalSonglengst += it->GetSongLength();
}
cout << \"Total songs Length (in seconds):\" << TotalSonglengst << endl;
}
void PlaylistNode::PrintPlaylist(Playlist aPlayList)
{
cout << \"Unique ID:\" << aPlayList.GetID() << endl;
cout << \"Song Name:\" << aPlayList.GetSongName() << endl;
cout << \"Artist Name:\" << aPlayList.GetArtis.
I am having the below compile errors. .pdf
I am having the below compile errors.
*****************************************************************************
******
1>------ Build started: Project: playlist, Configuration: Debug Win32 ------
1> Playlist.cpp
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(74): error
C3867: \'std::list>::size\': non-standard syntax; use \'&\' to create a pointer to member
1> with
1> [
1> _Ty=Playlist
1> ]
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(74): error
C2296: \'>\': illegal, left operand has type \'unsigned int (__thiscall std::list>::* )(void) noexcept
const\'
1> with
1> [
1> _Ty=Playlist
1> ]
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(74): error
C2297: \'>\': illegal, right operand has type \'unsigned int (__thiscall std::list>::* )(void) noexcept
const\'
1> with
1> [
1> _Ty=Playlist
1> ]
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(76): error
C2065: \'it\': undeclared identifier
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(78): error
C2065: \'it\': undeclared identifier
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(78): error
C2227: left of \'->GetID\' must point to class/struct/union/generic type
1> c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(78): note:
type is \'unknown-type\'
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(80): error
C2065: \'it\': undeclared identifier
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(80): error
C2227: left of \'->GetSongName\' must point to class/struct/union/generic type
1> c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(80): note:
type is \'unknown-type\'
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(81): error
C2065: \'it\': undeclared identifier
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(144):
error C3867: \'std::list>::size\': non-standard syntax; use \'&\' to create a pointer to member
1> with
1> [
1> _Ty=Playlist
1> ]
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(144):
error C2446: \'<=\': no conversion from \'unsigned int (__thiscall std::list>::* )(void) noexcept
const\' to \'int\'
1> with
1> [
1> _Ty=Playlist
1> ]
1> c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(144):
note: There is no context in which this conversion is possible
========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ==========
****************************************************************
I have three files:
Main.cpp
#include
#include \"Playlist.h\"
using namespace std;
int main()
{
int choice;
string.
C++ Programming Search A Linked ListThe Content of songlist.txt.pdf
C++ Programming: Search A Linked List
The Content of \"songlist.txt\": Problem 2: Write a C++ program that searches the playlist (the
linked list) for a certain song. There are two functions to be implemented. searchSong ByTitl e
and searchSongByArtist. searchSongBy Title will search by song title and print the songs that
have the title searchSongBy Artist will search by song artist and print the songs that are sung by
the artist. Both functions do not need to return the song pointer and they can have a void return
type.
Solution
#include
#include
#include
#include
using namespace std;
int main(){
vector slist;
string line1[30];
int choice;
string artist,title;
ifstream myfile(\"songlist.txt\");
int a = 0;
if(!myfile)
{
cout<<\"Error opening the output file\"<>choice;
if(choice==1){
cout<<\"\ Please enter the title of the song:\";
getline (std::cin,title);
for(int i=0;i.
You are required to implement all the classes as specified by UML di.pdf
You are required to implement all the classes as specified by UML diagram below.The objective
of most of the methods is obvious from the given method name and input parameters.I am listing
below the explanation of the not-so-obvious methods.
PlayList Class:
getSong(pos:int) :Song
a method that returns the song that is located in the given position (pos). If there is no song in the
given position then the method returns null
getSongPosition(title:String):int
a method that takes the song title as input and returns as output the position of the song in the
list. If not found, the method returns -1. Song -title:String -artist: String +Song (title:String,
artist:String) +gettitle ():String +getArtist ):String +tostring ) :String PlayList
maxNumOfSongs:int -currentNumor Songs: int; +PlayList (maxNumOESongs:int)
+getcurrentNumSongs ) :int +addsong (title:String, artist:String) :void +addsong
(song:Song):void +getsong (pos:int) :Song +getsongPosition (title:String) :int User nam String -
favoriteSongs: PlayList +User (name: String, favoriteSongs: PlayList) +User (name: String)
+setFavoriteSongs (1ist: PlayList) :void +getFavoriteSongs) PlayList; +getsong (title:String)
:Song +addsong (title:String, artist:String) :void tartistsongCount (artist:String) :int +tostring ()
:String
Solution
Please find the implementation of all the classes mentioned in the above UML diagram. Please
see comment against each line to get to know the explanation :.
Similar to Write a program in C++ language that implements a music play.pdf (19)
Given main(), complete the SongNode class to include the printSong.pdf
Given main(), complete the SongNode class to include the printSong.pdf
8.8 Program Playlist (Java)You will be building a linked list. Ma.pdf
8.8 Program Playlist (Java)You will be building a linked list. Ma.pdf
It's not working what am I doing wrong- Given main()- complete the Son.pdf
It's not working what am I doing wrong- Given main()- complete the Son.pdf
PLEASE I need help with my assignment I have to compelet .pdf
PLEASE I need help with my assignment I have to compelet .pdf
In C++ please I need output please You will be building a .pdf
In C++ please I need output please You will be building a .pdf
Exercise 3 You are to code some simple music player application .pdf
Exercise 3 You are to code some simple music player application .pdf
819 LAB Program Playlist c++ You will be building a li.pdf
819 LAB Program Playlist c++ You will be building a li.pdf
Many of us have large digital music collections that are not always .pdf
Many of us have large digital music collections that are not always .pdf
Instructions This project focuses on queues and stacks Foll.pdf
Instructions This project focuses on queues and stacks Foll.pdf
maincpp include ltiostreamgt include ltstringgt.pdf
maincpp include ltiostreamgt include ltstringgt.pdf
The provided codetrack_file_handling.rb class Track att.pdf
The provided codetrack_file_handling.rb class Track att.pdf
In C++ Plz LAB- Playlist (output linked list) Given main()- complete.pdf
In C++ Plz LAB- Playlist (output linked list) Given main()- complete.pdf
In C++ Plz and In What Order Do I Put It In- LAB- Playlist (output li.pdf
In C++ Plz and In What Order Do I Put It In- LAB- Playlist (output li.pdf
Hi,Please find the Ansswer below.PLAYLIST.h#include iostrea.pdf
Hi,Please find the Ansswer below.PLAYLIST.h#include iostrea.pdf
C++ Programming Search A Linked ListThe Content of songlist.txt.pdf
C++ Programming Search A Linked ListThe Content of songlist.txt.pdf
You are required to implement all the classes as specified by UML di.pdf
You are required to implement all the classes as specified by UML di.pdf
More from iconsystemsslm
People with a latent TB infection are _____ asymptomatic an.pdf
Paassyyssemmyyommppplpptteoott oommwmmaaitaatthiicctt iia ccba laaunanntdt eddc cna acctn aanTnnn Bos npst o iprnsetrpf eeasrpcaedtrda ieto hdtanhe dt eh a in terihenf eei fn_ec fit_cneiot_fcieont_icno _tt noi.too not oo tth toohe teorhsrtehsresrs
asopsthyreemarspdt othmea itnicfe acntido nc aton
asopsthyreemarspdt othmea itnicfe acntido nc atonnot
ssoypthmreeparstdo mthaet iicn fbeuctt icoann tnoot
ssoypthmreeparstdo mthaet iicn faencdti ocna nto.
Writing a Concise Paper Cost Accounting Analysis Use Acti.pdf
Writing a Concise Paper (Cost Accounting Analysis)
Use Active Voice. Use !I often. Cite sources, letting them speak.
1) Cite sources fully, integrating them in your writing. Avoid: It is said . . . . Instead let the speaker
come alive: Braun (p.16) says, . . . . I am interested in what she says.
3) The cited sources are listed in References. Don"t use footnotes to cite.
4) Include: The paper"s TITLE that tells the specific, concrete focus of your interest. Avoid a
general, broad topic.
1st paragraph. State, first, your research Question(s): !I question: . . . ? to introduce the paper.
2nd paragraph. The Data gathered, citing the sources. Analysis, discussion, and findings in your
own words.
3rd paragraph. A concise, yet concrete summary of your paper and conclusions.
4th paragraph. Under the last sub-heading, !References, list the cited sources.
Your paper must be single spaced, 1 page long [not exceeding 2 pages] including references..
Working with the Calculator program Once imported run the.pdf
Working with the Calculator program.
Once imported run the application (CalcMain is the driver)
Determine what Calculator does and how it works investigate.
Add multiplication and subtraction buttons to the application.
Test to make sure all functionality works as you expect.
Export updated Calculator to a Runnable JAR file.
Go to the location where you put the runnable JAR and double click it to run the application
Capture the runnable JAR file runtime screen shot.
CalcMain.java
import javax.swing.JFrame;
public class CalcMain {
public static void main(String [] args)
{
JFrame frame = new JFrame("Calculator");
//2. Optional: What happens when the frame closes?
frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
//3. Create your panel and put it in the frame.
frame.getContentPane().add(new Calculator());
//4. Size the frame.
frame.setSize(300, 550);
//5. Show it.
frame.setVisible(true);
}
}
Calculator.java
import javax.swing.*;
import java.awt.Color;
import java.awt.event.*;
public class Calculator extends JPanel implements ActionListener {
String num1="";
String num2="";
String operator="";
boolean usingFirst=true;
double total=0;
JTextField display;
JButton b1;
JButton b2;
JButton b3;
JButton b4;
JButton b5;
JButton b6;
JButton b7;
JButton b8;
JButton b9;
JButton b0;
JButton bdec;
JButton bclear;
JButton bequals;
JButton bplus;
JButton bmult;
JButton bsub;
public Calculator()
{
this.setBackground(Color.white);
setLayout(null);
display=new JTextField();
b1=new JButton("1");
b2=new JButton("2");
b3=new JButton("3");
b4=new JButton("4");
b5=new JButton("5");
b6=new JButton("6");
b7=new JButton("7");
b8=new JButton("8");
b9=new JButton("9");
b0=new JButton("0");
bdec=new JButton(".");
bclear=new JButton("C");
bequals = new JButton( "=");
bplus=new JButton("+");
bmult=new JButton("*");
bsub=new JButton("-");
display.setBounds(0,0,205,50);
b1.setBounds(0,200,50,50);
b2.setBounds(50,200,50,50);
b3.setBounds(100,200,50,50);
bplus.setBounds(154,200,50,50);
b4.setBounds(0,150,50,50);
b5.setBounds(50,150,50,50);
b6.setBounds(100,150,50,50);
bmult.setBounds(154,150,50,50);
b7.setBounds(0,100,50,50);
b8.setBounds(50,100,50,50);
b9.setBounds(100,100,50,50);
bsub.setBounds(154,100,50,50);
b0.setBounds(0,250,50,50);
bdec.setBounds(50,250,50,50);
bclear.setBounds(100,250,50,50);
bequals.setBounds(154,250,50,50);
add(b1);
add(b2);
add(b3);
add(b4);
add(b5);
add(b6);
add(b7);
add(b8);
add(b9);
add(b0);
add(bdec);
add(display);
add(bclear);
add(bequals);
add(bplus);
add(bmult);
add(bsub);
b1.addActionListener(this);
b2.addActionListener(this);
b3.addActionListener(this);
b4.addActionListener(this);
b5.addActionListener(this);
b6.addActionListener(this);
b7.addActionListener(this);
b8.addActionListener(this);
b9.addActionListener(this);
b0.addActionListener(this);
bequals.addActionListener(this);
bplus.addActionListener(this);
bclear.addActionListener(this);
bdec.addActionListener(this);
bmult.addActionListener(this);
bsub.addActionListener(this);
}
public vo.
When is it appropriate to use an independent pooled sample.pdf
When is it appropriate to use an independent (pooled) sample t-test instead of a repeated
measures (paired) t-test? What is the non-parametric equivalent to the independent sample t-test?
What is the formula for degrees of freedom for an independent (pooled) sample t-test and a
repeated measures (paired) t-test? Define power, and how is it related to Type II error?.
TRUE OR FALSE QUESTIONS 1 In the communicable disease model.pdf
TRUE OR FALSE QUESTIONS
1. In the communicable disease model, the cause of a disease or health problem is the host.
2. Drugs, pesticides, and food additives are examples of chemical agents.
3. The common cold is an example of a chronic communicable disease.
4. In the chain of infection, a disease-producing agent leaves its reservoir through a portal of entry.
5. Diseases for which the reservoir resides in animal populations are called anthroponoses
6. Diseases of the heart and blood vessels are a leading cause of death in the United States.
7. The ability of a biological agent to enter and grow in the host is pathogenicity..
Tengo tanto sueo pueden ayudarme Tengo mucho trabajo que.pdf
Tengo tanto sueo, pueden ayudarme? Tengo mucho trabajo que hacer en otras clases.
Preguntas:
condro_____________________________________
osteo______________________________
ictios_____________________________________
Asteroidea
Ofiuroidea
Crinoidea
Equinoidea
Holothuroidea
forma de brazos
Desarrollo de pies ambulacrales.
Desarrollo de huesecillos
Mtodo de alimentacin
Estructura de la columna
Asteroidea Ofiuroidea Crinoidea Equinoidea Holothuroidea
forma de
brazos
Desarrollo de
pies
ambulacrales.
Desarrollo de
huesecillos
Mtodo de
alimentacin
Estructura de
la columna.
Soru 11 in ve Hindistann neden bu kadar ok uluslararas i.pdf
Soru 11
in ve Hindistan'n neden bu kadar ok uluslararas ilgi ve yabanc yatrm grdne dair en iyi aklama
nedir?
Birini se:
A. Corafi konumlar
B. Doal kaynaklar zerindeki kontrolleri
C. Byk nfuslar
D. Yabanc firmalara salanan devlet tevikleri
Soru 12
Sabit dviz kurunun en byk dezavantaj,
Birini se:
A. ticaret a olasl artar.
B. Dviz kurunu desteklemekle ticaret dengesini ayarlamak arasndaki denge.
C. yksek enflasyon olasl artar.
D. Dviz kurunu desteklemekle ekonomik bymeyi srdrmek arasndaki denge.
e. Dviz kurunu desteklemekle dengeli bir bteyi srdrmek arasndaki denge.
Soru 13
Bir kemer skma politikas
Birini se:
A. para arznda bir art.
B. bir harcama azaltma ve harcama deitirme politikas.
C. Geniletici bir maliye politikas ile birlikte vergilerdeki dler, harcamalardaki artlar veya her ikisi.
D. sabit bir dviz kuru sisteminden esnek bir dviz kuru sistemine gei politikas.
e. Seimlerin hibiri.
Soru 14
1980'lerin sonlarnda birok Latin Amerika ekonomisinde balayan reform hareketleri,
Birini se:
A. rekabeti devalasyonlar
B. piyasalar iin daha gl bir rol ve daha fazla aklk.
C. thal ikame politikalar.
D. daha gl askeri bteler
Soru 15
Bir lke IMF'den bor aldnda
Birini se:
A. lkenin istedii herhangi bir miktar olabilir.
B. koullardan bamszdr.
C. her biri reform hedeflerinin tamamlanmasna bal olarak dilimler halinde fon almaktadr.
D. kredinin tm fonlarn bir kerede alr..
Setting up Webserver setting up webserver and running on t.pdf
Setting up Webserver.
setting up webserver and running on the localhost.
sudo dnf install httpd
sudo systemctl enable httpd
sudo systemclt start httpd
sudo systemclt status httpd
go to localhost on the browser.. to get the path of deployment.
cd /var/www/html is where you do the deployment..
su root
and enter your password.
----if you dont know your root password you can reset it by
sudo passwd root
mkdir project
cd project
create html file over here using vi editor..
vi hello.html
enter the code of html...
running---> goto your browser --> localhost/project/hello.html.
Robin has just been hired as a security engineer and wants t.pdf
Robin has just been hired as a security engineer and wants to implement some industry best
practices at her new company. Which of the following might be a good source for her to consider?
Drago wants to test a new application he has developed to ensure that any sort of actions
performed by end users, even unintentional actions, will not crash the system or release
information in error messages that could be useful in an attack. Which of the following types of
testing should he perform?
Chen has just finished developing the beta version of a social networking site that should soon be
available to the public. He is concerned that a malicious threat actor may try to exploit the URL
rewriting capabilities in an attempt to execute remote commands on the server. Which of the
following should he ensure is performed as part of the development process?
Greta wants to implement a technology that will receive user requests from the internal secure
network and then process them on behalf of the user to the web server. Which of the following is
she considering?
a. SEABEE
b. OWASP
c. SNIT
d. CIT.
Redgreen colorblindness is due to a recessive Xlinked alle.pdf
Red/green colorblindness is due to a recessive X-linked allele, Xb. A colorblind man marries a
woman with normal vision. Her parents have normal vision, but her
grandfather on the maternal side is red/green colorblind. What is the probability they
will have a son with normal color vision? Show your pedigree with genotypes, and
relevant calculations using the product and sum rules
Red/green colorblindness is due to a recessive X-linked allele, Xb. A colorblind man marries a
woman with normal vision. Her parents have normal vision, but her
grandfather on the maternal side is red/green colorblind. What is the probability they
will have a son with normal color vision? Show your pedigree with genotypes, and
relevant calculations using the product and sum rules.
Required information P25 Algo Recording Transactions Pre.pdf
Required information P2-5 (Algo) Recording Transactions, Preparing Journal Entries, Posting to T-
Accounts, Preparing the Balance Sheet, and Evaluating the Curregt Ratio LO2-2, 2-4, 25 [The
following information applies to the questions displayed below] Mango Inc., headquartered in
Cupertino, California, designs, manufactures, and markets mobile communication and media
devices, personal computers, and portable digital music players and sells a variety of related
software and services. The following is Mango's (simplified) balance sheet from a recent year
(fiscal year ending on the last Saturday of September).Assume that the following transactions (in
millions) occurred during the next fiscal year (ending on September 29,2018 ). a. Borrowed $18,
287 from banks due in two years. b. Purchased additional investments for $23,000 cash; one-fifth
were long term and the rest were short term. c. Purchased property, plant, and equipment; paid
$9.591 in cash and signed a short-term note for $1,430. d. Issued additional shares of common
stock for $1,489 in cash; total par value was $1 and the rest was in excess of par value. e. Sold
short-term investments costing $19,028 for $19,028 cash. f. Declared $11,146 in dividends to be
paid at the beginning of the next fiscal year..
QYESTIONS 1 Why was Dakotas existing pricing system inad.pdf
QYESTIONS:
1. Why was Dakota's existing pricing system inadequate for its current operating environment?
2. Develop an activity-based cost system for Dakota Office Products (DOP) based on the year
2000 data. Calculate the activity cost-driver rate for each DOP activity in 2000.
3. Using your answer to Question 2, calculate the profitability of Customer A and Customer B.
4. What explains any difference in profitability between the two customers?
5. What are the limitations, if any, to the estimates of the profitability of the two customers?
6. Is there any additional information you would like to have to explain the relative profitability of
the two customers?
7. Assume that Dakota applies the analysis done in Question 3 to its entire customer base. How
could such information help Dakota managers increase company profits?
8. Suppose that a major customer switched from manually placing all its orders to placing all its
orders over the internet site. How should this affect the activity cost-driver rates calculated in
Question 2? How would the switch affect Dakota's profitability?
John Malone, General Manager of Dakota Office Products (DOP) was concerned about the
financial results for calendar year 2000. Despite a sales increase from the prior year, the company
had just suffered the first loss in its history (see summary income statement in Exhibit 1). Dakota
Office Products was a regional distributor of office supplies to institutions and commercial
businesses. It offered a comprehensive product line ranging from simple writing implements (such
as pens, pencils, and markers) and fasteners to specialty paper for modern high-speed copiers
and printers. DOP had an excellent reputation for customer service and responsiveness. DOP
operated several distribution centers in which personnel unloaded truckload shipments of products
from manufacturers, and moved the cartons into designated storage locations until customers
requested the items. Each day, after customer orders had been received, DOP personnel drove
forklift trucks around the warehouse to accumulate the cartons of items and prepared them for
shipment. Typically, DOP shipped products to its customers using commercial truckers. Recently,
DOP had attracted new business by offering a "desk top" option by delivering the packages of
supplies directly to individual locations at the customer's site. Dakota operated a small fleet of
trucks and assigned warehouse personnel as drivers to make the desktop deliveries. Dakota
charged a small price premium (up to an additional 2% markup) for the convenience and savings
such direct delivery orders provided to customers. The company believed that the added price for
this service could improve margins in its highly competitive office supplies distribution business.
DOP ordered supplies from many different manufacturers. It priced products to its end-use
customers by first marking up the purchased product cost by about 15% to cover the cost of
warehousing, dis.
Qu formas de vida crean nueva biomasa a travs de la produ.pdf
Qu formas de vida crean nueva biomasa a travs de la produccin
secundaria ? Seleccione todas las que correspondan.
Grupo de opciones de respuesta
insectos
descomponedores en suelos
plantas
algas (las algas son fotosintticas)
mamferos
Qu formas de vida crean nueva biomasa a travs de la produccin
secundaria ? Seleccione todas las que correspondan.
Grupo de opciones de respuesta
insectos
descomponedores en suelos
plantas
algas (las algas son fotosintticas)
mamferos
insectos
insectos
descomponedores en suelos
descomponedores en suelos
plantas
plantas
algas (las algas son fotosintticas)
algas (las algas son fotosintticas)
mamferos
mamferos.
Q1 Reminder the arrows are going from who is being eaten t.pdf
Q1: Reminder: the arrows are going from who is being eaten to who is doing the eating (the
direction of the flow of energy). P2 Competes with P1 for resources and this results in a lower
abundance of P1 than if P2 was not present. Describe the effect of P2 on C1. (A) Food web (B)
Interaction web A. Indirect Positive B. Indirect Negativ C. Direct Positive D. Direct Negative.
Oriole Corp uses a periodic inventory system A physical co.pdf
Oriole Corp. uses a periodic inventory system. A physical count of merchandise inventory on July
31 shows that 28 units are on hand. Under the FIFO cost method, ending inventory at July 31 was
$1547.$672.$1536.$683..
PREGUNTA 19 A Aumentar su comerciabilidad B Increment.pdf
PREGUNTA 19
A.
Aumentar su comerciabilidad.
B.
Incrementar sus flujos de caja operativos.
C.
Empleando apalancamiento financiero.
D.
Incrementando su liquidez.
MI.
Gastando su flujo de efectivo de los activos.
PREGUNTA 20
A.
La corporacin paga impuestos sobre los ingresos y gastos.
B.
La corporacin paga impuestos sobre las ganancias y los acreedores pagan impuestos sobre los
intereses recibidos.
C.
Tanto los tenedores de bonos como los accionistas deben pagar impuestos.
D.
La corporacin paga impuestos sobre sus ganancias y los accionistas pagan impuestos sobre los
dividendos.
MI.
La corporacin paga impuestos sobre los ingresos y las ganancias.
PREGUNTA 21
A.
El valor total en dlares del impuesto que se paga.
B.
El impuesto adicional que pagara si ganara un dlar ms.
C.
Pagos anticipados a la Agencia Tributaria de Canad para reducir los compromisos fiscales.
D.
El tipo fijado para los distintos tramos impositivos.
MI.
El porcentaje de sus ingresos que se destina al pago de impuestos.
PREGUNTA 22
A.
A travs de un distribuidor en el mercado secundario.
B.
En el mercado primario.
C.
Slo a travs del mercado OTC.
D.
Slo a travs de los mercados privados.
MI.
A travs de un corredor en el mercado secundario.
PREGUNTA 23
A.
el propietario es personalmente responsable del 100% de los pasivos de la empresa.
B.
Los ingresos de una propiedad se gravan a una tasa ms baja que otros ingresos personales.
C.
Una propiedad puede ser un negocio de propiedad conjunta de dos miembros de la familia.
D.
Los ingresos de una propiedad se gravan como una entidad separada.
MI.
Una transferencia parcial de propiedad es ms fcil con una propiedad que con una corporacin.
PREGUNTA 24
A.
El incremento en el valor de mercado de los activos circulantes.
B.
El aumento de valor del patrimonio de los accionistas.
C.
El crecimiento en el valor de las inversiones que se compraron a un precio ms bajo que la
cantidad vendida
A. Aumentar su comerciabilidad.
Incrementar sus flujos de caja
B.
operativos.
Empleando apalancamiento
C.
financiero.
D. Incrementando su liquidez.
Gastando su flujo de efectivo
MI.
de los activos..
Mira el anuncio de Disney Cruise Line Little Souvenir 00.pdf
Mira el anuncio de Disney Cruise Line "Little Souvenir".
00:00
Nio: Fuimos en un crucero de Disney con Mickey y Goofy.
00:03
Yo tena mi propio club y mi mam se daba un bao de lodo con pap.
00:07
Mam: El barco tena un gran spa. Eso es suficiente, cario.
00:11
Nio: Adivina qu? En la Isla estaba el Capitn Garfio.
00:14
Hombre: Acabas de volver?
00:14
Mam: Eso fue hace un ao.
00:15
[El beb hace un ruido.]
00:15
Nio: Ese es mi hermanito. Su nombre es Joe.
00:18
Nio: Pero mam lo llama su "pequeo recuerdo".
00:21
La gente en el ascensor se re. [Golpes de ascensor.] [Msica de fondo]
00:22
Mam: Obviamente todos la pasamos muy bien.
00:25
Narrador: Disney Cruise Line.
00:26
Ven a descubrir la magia desconocida
PASO 2:
Analice su eficacia respondiendo primero a las siguientes preguntas:
Escribe un prrafo de resumen sobre:.
include ltinitializer_listgt include ltiostreamgt .pdf
#include <initializer_list>
#include <iostream>
#include <iterator>
#include <utility>
/************************************************************/
template<typename T>
struct ListNode
{
ListNode () : data ()
{
}
ListNode (const T& v) : data (v)
{
}
ListNode (const T& v, ListNode* n, ListNode* p) : data (v), next (n), prev (p)
{
}
// unhooks the range [begin,end] from a linked list
// NOTE: will lose reference to begin and end if you
// are not keeping track of it!
//
// - does not create any new nodes
// - does not destroy any existing nodes
// - begin is start of range to remove
// - end is inclusive end of range to remove
//
// [5]
static void
unhook_range (ListNode* begin, ListNode* end)
{
// TODO
// <->| 1 |<->| 2 |<->| 3 |<->| 4 |<->| 5 |<->| 6 |<->
// ^ ^
// begin end
//
// becomes
//
// <->| 1 |<->| 6 |<->
//
// begin and end do not need to change at all
}
// inserts the range [first,last] before this
// NOTE: does not create any new nodes, does not destroy any existing nodes
//
// [5]
void
hook_range (ListNode* first, ListNode* last)
{
// TODO
// this
// v
// <->| 1 |<->| 6 |<-> <->| 2 |<->| 3 |<->| 4 |<->
// ^ ^
// first last
//
// becomes
// this
// v
// <->| 1 |<->| 2 |<->| 3 |<->| 4 |<->| 6 |<->
// ^ ^
// first last
//
}
// insert first before this
void
hook (ListNode* first)
{
hook_range (first, first);
}
// unhooks current node from linked list
void
unhook ()
{
ListNode::unhook_range (this, this);
}
T data;
ListNode* next{nullptr};
ListNode* prev{nullptr};
};.
Annie wants to retain her skilled employees but she also do.pdf
Annie wants to retain her skilled employees, but she also doesnt want to hire a plan administrator,
nor does she want to administrate a retirement plan herself. Annie seeks to foster a highly
collaborative workplace and manages by building consensus among her team. Accordingly, she
has called a company meeting with the staff to discuss the issue of a retirement plan. During the
meeting, Annie notes several suggestions made by her staff, which are outlined below: Ernie
wants a 403(b) plan like his wife, who works at the local university. Jasmine thinks they could
simply give everyone a generous bonus and let them enroll in an individual retirement account
(IRA) on their own. Nadine thinks there are some attractive plans for small businesses, but she
doesnt know what distinguishes SEPs, SIMPLE plans, and Solo 401(k)s. She wonders if Annie
has thoughts on these various types of plans and their relative merits for their company. Charles
thinks the staff is making the issue more complicated than necessary. Why not just start a 401(k)
plan like everyone else seems to have? Annie has come to you to advise her on the situation
facing her business. Review the retirement plan options above and detail the positive and negative
implications of each plan. Identify retirement plans and their positive and negative implications for
the level of administration required for each plan. Recommend a retirement plan that meets the
needs of both Annie and her employees..
Header files used to run the program include ltstdioh.pdf
//Header files used to run the program
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <time.h>
#include <unistd.h>
//Constants used for the timming characteristics
#define SYMBOL_DOT_DURATION 250
#define SYMBOL_DASH_DURATION 750
#define SYMBOL_PAUSE_DURATION 250
#define FRAME_PAUSE_MIN_DURATION 1000
// Function to generate a dot pulse sequence
void generate_dot() {
printf("."); // Replace with actual output to hardware
usleep(SYMBOL_DOT_DURATION * 1000);
}
// Function to generate a dash pulse sequence
void generate_dash() {
printf("-"); // Replace with actual output to hardware
usleep(SYMBOL_DASH_DURATION * 1000);
}
// Function to generate an inter-symbol pause
void generate_symbol_pause() {
usleep(SYMBOL_PAUSE_DURATION * 1000);
}
// Function to generate an inter-frame pause
void generate_frame_pause() {
usleep(FRAME_PAUSE_MIN_DURATION * 1000);
}
// The main fuction of the program it initializes the messages and inputs
int main() {
char messages[] = {'A', 'B', 'C', 'D'};
bool input_signals[] = {false, false, false, false}; // Set all signals to low initially
bool prev_signals[] = {false, false, false, false}; // Keep track of previous signal values
time_t prev_time = time(NULL); // Keep track of previous time of rising edge
while (true) {
// Check for rising edges in input signals
for (int i = 0; i < 4; i++) {
if (input_signals[i] && !prev_signals[i]) {
// Rising edge detected for input signal i
time_t curr_time = time(NULL);
double elapsed_time = difftime(curr_time, prev_time);
// Generate pulse sequence based on message for input signal i
switch (messages[i]) {
case 'A':
generate_dot();
generate_dash();
break;
case 'B':
generate_dash();
generate_dot();
generate_dot();
generate_dot();
break;
case 'C':
generate_dash();
generate_dot();
generate_dash();
generate_dot();
break;
case 'D':
generate_dash();
generate_dot();
break;
}
// Generate inter-symbol pause
generate_symbol_pause();
// Update previous time and signal values
prev_time = curr_time;
prev_signals[i] = input_signals[i];
}
}
// Check if there are no more input signals to monitor
if (/* condition */) { (THE SYNTAX ERROR IS ON THIS LINE)
// Generate inter-frame pause
generate_frame_pause();
// Reset previous time and signal values
prev_time = time(NULL);
prev_signals[0] = false;
prev_signals[1] = false;
prev_signals[2] = false;
prev_signals[3] = false;
}
// Wait for some time before checking for input signals again
usleep(100); // Adjust as needed based on system performance and responsiveness
}
return 0;
}
The Syntax error is within the bold. I believe the error is a bracket but not sure where I am missing
one..
More from iconsystemsslm (20)
People with a latent TB infection are _____ asymptomatic an.pdf
People with a latent TB infection are _____ asymptomatic an.pdf
Writing a Concise Paper Cost Accounting Analysis Use Acti.pdf
Writing a Concise Paper Cost Accounting Analysis Use Acti.pdf
Working with the Calculator program Once imported run the.pdf
Working with the Calculator program Once imported run the.pdf
When is it appropriate to use an independent pooled sample.pdf
When is it appropriate to use an independent pooled sample.pdf
TRUE OR FALSE QUESTIONS 1 In the communicable disease model.pdf
TRUE OR FALSE QUESTIONS 1 In the communicable disease model.pdf
Tengo tanto sueo pueden ayudarme Tengo mucho trabajo que.pdf
Tengo tanto sueo pueden ayudarme Tengo mucho trabajo que.pdf
Soru 11 in ve Hindistann neden bu kadar ok uluslararas i.pdf
Soru 11 in ve Hindistann neden bu kadar ok uluslararas i.pdf
Setting up Webserver setting up webserver and running on t.pdf
Setting up Webserver setting up webserver and running on t.pdf
Robin has just been hired as a security engineer and wants t.pdf
Robin has just been hired as a security engineer and wants t.pdf
Redgreen colorblindness is due to a recessive Xlinked alle.pdf
Redgreen colorblindness is due to a recessive Xlinked alle.pdf
Required information P25 Algo Recording Transactions Pre.pdf
Required information P25 Algo Recording Transactions Pre.pdf
QYESTIONS 1 Why was Dakotas existing pricing system inad.pdf
QYESTIONS 1 Why was Dakotas existing pricing system inad.pdf
Qu formas de vida crean nueva biomasa a travs de la produ.pdf
Qu formas de vida crean nueva biomasa a travs de la produ.pdf
Q1 Reminder the arrows are going from who is being eaten t.pdf
Q1 Reminder the arrows are going from who is being eaten t.pdf
Oriole Corp uses a periodic inventory system A physical co.pdf
Oriole Corp uses a periodic inventory system A physical co.pdf
PREGUNTA 19 A Aumentar su comerciabilidad B Increment.pdf
PREGUNTA 19 A Aumentar su comerciabilidad B Increment.pdf
Mira el anuncio de Disney Cruise Line Little Souvenir 00.pdf
Mira el anuncio de Disney Cruise Line Little Souvenir 00.pdf
include ltinitializer_listgt include ltiostreamgt .pdf
include ltinitializer_listgt include ltiostreamgt .pdf
Annie wants to retain her skilled employees but she also do.pdf
Annie wants to retain her skilled employees but she also do.pdf
Header files used to run the program include ltstdioh.pdf
Header files used to run the program include ltstdioh.pdf
Recently uploaded
Home assignment II on Spectroscopy 2024 Answers.pdf
Answers to Home assignment on UV-Visible spectroscopy: Calculation of wavelength of UV-Visible absorption
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
Unit 2- Research Aptitude (UGC NET Paper I).pdf
This slide describes the research aptitude of unit 2 in the UGC NET paper I.
Embracing GenAI - A Strategic Imperative
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Unit 8 - Information and Communication Technology (Paper I).pdf
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
CLASS 11 CBSE B.St Project AIDS TO TRADE - INSURANCE
Class 11 CBSE Business Studies Project ( AIDS TO TRADE - INSURANCE)
Digital Tools and AI for Teaching Learning and Research
This Presentation in details discusses on Digital Tools and AI for Teaching Learning and Research
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Event Link:-
https://meetups.mulesoft.com/events/details/mulesoft-mysore-presents-exploring-gemini-ai-and-integration-with-mulesoft/
Agenda
● Java 17 Upgrade Overview
● Why and by when do customers need to upgrade to Java 17?
● Is there any immediate impact to upgrading to Mule Runtime 4.6 and beyond?
● Which MuleSoft products are in scope?
For Upcoming Meetups Join Mysore Meetup Group - https://meetups.mulesoft.com/mysore/
YouTube:- youtube.com/@mulesoftmysore
Mysore WhatsApp group:- https://chat.whatsapp.com/EhqtHtCC75vCAX7gaO842N
Speaker:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Organizers:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Giridhar Meka - https://www.linkedin.com/in/giridharmeka
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Shyam Raj Prasad-
https://www.linkedin.com/in/shyam-raj-prasad/
Operation Blue Star - Saka Neela Tara
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
The Challenger.pdf DNHS Official Publication
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...Nguyen Thanh Tu Collection
https://app.box.com/s/hqnndn05v4q5a4k4jd597rkdbda0fniiPolish students' mobility in the Czech Republic
Polish students mobility to the Czech Republic within eTwinning project "Medieval adventures with Marco Polo"
Honest Reviews of Tim Han LMA Course Program.pptx
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is prepared for master's students (MIFB & MIBS) UUM. May it be useful to all.Acetabularia Information For Class 9 .docx
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
Recently uploaded (20)
Home assignment II on Spectroscopy 2024 Answers.pdf
Home assignment II on Spectroscopy 2024 Answers.pdf
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
CLASS 11 CBSE B.St Project AIDS TO TRADE - INSURANCE
CLASS 11 CBSE B.St Project AIDS TO TRADE - INSURANCE
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptx
Write a program in C++ language that implements a music play.pdf
- 1. Write a program in C++ language that implements a music player using Doubly Circular Linked List using OOP concepts. This assignment has four parts: 1- Write a class(new type) to define the Song type. 2- Implement the Doubly Circular Linked List, which will operate with Song type. 3- Implement the Music Player 4- Test it in the main function All Constructors should use the initializer list. 1. Song class 1- class song #include <iostream> using namespace std; class Song{ private: string songTitle; string singerName; public: Song(); Song(string, string); virtual ~Song(); string getSongTitle(); string getSingerName(); void setSongTitle(string); void setSingerName(string); friend ostream& operator<<(ostream& os, Song& p){ os << ": "<<"{"<<p.songTitle<<" : "<<p.singerName<<"}"; return os; } }; 2- CNode class #include <iostream> #include "Song.h" using namespace std; class CNode{ private: Song elem; CNode *next; CNode *prev; friend class CircleDLinkedList; };
- 2. 3- CircleDLinkedList class #include <iostream> #include "CNode.h" using namespace std; class CircleDLinkedList{ private: CNode* cursor; int size; public: CircleDLinkedList(); ~CircleDLinkedList(); bool empty(); void advance(); void add(Song &s); void remove(); void print(); int getSize() const; }; 4- MusicPlayer class #include <iostream> #include "CircleDLinkedList.h" using namespace std; class MusicPlayer{ private: string type; //will hold the type of the music player int size; //the current number of the songs CircleDLinkedList playerList; // list of the songs, CircleDLinkedList is the Doubly Circular Linked List public: MusicPlayer(string); virtual ~MusicPlayer(); void play(); //plays the current song, meaning that this method will print the properties of the Song void next(); //moves to the net song and plays it void previous(); ////moves to the previous song and plays it void add (Song); //adds a song before the current song void remove(); //removes the current song void print(bool);//prints all songs that are in the list, starting from current to left is bool param is true
- 3. }; 5- Test it in the main function Create e musicplayer with 3 songs. Play the current song. Play the next song. Play the next song. Play the next song. Play the previous song. Print the list of the songs using bool parameter true. Print the list of the songs using bool parameter false. Remove the current song from the musicplayer. Play the current song. Play the next song. Play the next song. Play the next song. Print the list of the songs using bool parameter true. Print the list of the songs using bool parameter false.