Program 02 Based on the previous problem you should impleme.pdf
•
0 likes•2 views
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 .
Report
Share
Report
Share
Download to read offline
![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;](https://image.slidesharecdn.com/program02basedonthepreviousproblemyoushouldimpleme-230320102651-7525799a/85/Program-02-Based-on-the-previous-problem-you-should-impleme-pdf-1-320.jpg)
Recommended
Problem 2 struct to hold information about a song struct So.pdf
// 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("%d\t%s\t%s\t%d\t%d\n", 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** playlist, struct Song* newSong)
{
// TODO: Implement function
}
// function to search for a song by name
struct Song* search_song(struct Song* playlist, char* name)
{
// TODO: Implement function
}
// function to edit a song by name
int edit_song(struct Song* playlist, char* name, char* singer, char* genre, int year)
{
// TODO: Implement function
}
// function to delete a song by name
int delete_song(struct Song* playlist, char* name)
{
// TODO: Implement function
}
void flushSngIn()
{
char c;
do
c = getchar();
while (c != '\n' && c != EOF);
}
int main()
{
// Problem 1
int choice = 0;
int songCount = 0;
char songName_input[MAX_SONG_NAME_LENGTH],
singerName_input[MAX_SINGER_NAME_LENGTH];
char genre_input[20];
unsigned int year_input, add_result = 0;
struct musicRepository music[20];
struct musicRepository* song = NULL;
initializeRepository(music, 20);
music[0].ID = numSongs + 1; numSongs++;
strcpy(music[0].songName, "Shape of You");
strcpy(music[0].singerName, "Ed Sheeran");
music[0].genre = 1;
music[0].year = 2017;
songCount++;
music[1].ID = numSongs + 1; numSongs++;
strcpy(music[1].songName, "Despacito");
strcpy(music[1].singerName, "Luis Fonsi");
music[1].genre = 1;
music[1].year = 2017;
songCount++;
music[2].ID = numSongs + 1; numSongs++;
strcpy(music[2].songName, "Uptown Funk");
strcpy(music[2].singerName, "Mark Ron.
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.
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.
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)
.
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.
Problem 2 create some sample songs struct Song.pdf
// Problem 2
// create some sample songs
struct Song* s1 = createSong(1, "Shape of You", "Ed Sheeran", "Pop", 2017);
struct Song* s2 = createSong(2, "Despacito", "Luis Fonsi", "Pop", 2017);
struct Song* s3 = createSong(3, "Uptown Funk", "Mark Ronson ft. Bruno Mars", "Pop",
2014);
// create the playlist and add the sample songs
struct Song* playList = NULL;
add_song(&playList, s1);
add_song(&playList, s2);
add_song(&playList, s3);
// print the playlist
printf("Initial Playlist:\n");
printPlaylist(playList);
// add a new song to the playlist
struct Song* s4 = createSong(4, "Sorry", "Justin Bieber", "Pop", 2015);
printf("\nAdding new song to playlist:\n");
add_song(&playList, s4);
printPlaylist(playList);
// delete a song from the playlist
printf("\nDeleting a song from the playlist:\n");
struct Song* sToDelete = search_song(playList, "Despacito");
if (sToDelete != NULL)
{
delete_song(playList, sToDelete->name);
printf("Playlist after deletion:\n");
printPlaylist(playList);
}
else
{
printf("Song not found in playlist.\n");
}
// search for a song that doesn't exist in the playlist
printf("\nSearching for a song that doesn't exist in the playlist:\n");
struct Song* searchResult = search_song(playList, "Non-existent Song");
if (searchResult != NULL)
{
printf("Found song:\n");
printf("Song ID: %d, Song Name: %s, Singer Name: %s, Genre: %s, Year: %d",
searchResult->id, searchResult->name, searchResult->singer, searchResult->genre,
searchResult->year);
}
else
{
printf("Song not found in playlist.\n");
}
// search for a song that exists in the playlist
printf("\nSearching for a song that exists in the playlist:\n");
searchResult = search_song(playList, "Uptown Funk");
if (searchResult != NULL)
{
// printf("Found song:\n");
// printSong(searchResult);
}
else
{
printf("Song not found in playlist.\n");
}
// edit a song in the playlist
printf("\nEditing a song in the playlist:\n");
int editResult = edit_song(playList, "Shape of You", "Ed Sheeran", "Pop", 2018);
if (editResult == -1)
{
printf("Song not found in playlist.\n");
}
else
{
printf("Playlist after edit:\n");
printPlaylist(playList);
}
return 0;
}
*****************************************************************************
Please help me fishing this code :((.
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.
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.
Recommended
Problem 2 struct to hold information about a song struct So.pdf
// 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("%d\t%s\t%s\t%d\t%d\n", 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** playlist, struct Song* newSong)
{
// TODO: Implement function
}
// function to search for a song by name
struct Song* search_song(struct Song* playlist, char* name)
{
// TODO: Implement function
}
// function to edit a song by name
int edit_song(struct Song* playlist, char* name, char* singer, char* genre, int year)
{
// TODO: Implement function
}
// function to delete a song by name
int delete_song(struct Song* playlist, char* name)
{
// TODO: Implement function
}
void flushSngIn()
{
char c;
do
c = getchar();
while (c != '\n' && c != EOF);
}
int main()
{
// Problem 1
int choice = 0;
int songCount = 0;
char songName_input[MAX_SONG_NAME_LENGTH],
singerName_input[MAX_SINGER_NAME_LENGTH];
char genre_input[20];
unsigned int year_input, add_result = 0;
struct musicRepository music[20];
struct musicRepository* song = NULL;
initializeRepository(music, 20);
music[0].ID = numSongs + 1; numSongs++;
strcpy(music[0].songName, "Shape of You");
strcpy(music[0].singerName, "Ed Sheeran");
music[0].genre = 1;
music[0].year = 2017;
songCount++;
music[1].ID = numSongs + 1; numSongs++;
strcpy(music[1].songName, "Despacito");
strcpy(music[1].singerName, "Luis Fonsi");
music[1].genre = 1;
music[1].year = 2017;
songCount++;
music[2].ID = numSongs + 1; numSongs++;
strcpy(music[2].songName, "Uptown Funk");
strcpy(music[2].singerName, "Mark Ron.
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.
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.
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)
.
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.
Problem 2 create some sample songs struct Song.pdf
// Problem 2
// create some sample songs
struct Song* s1 = createSong(1, "Shape of You", "Ed Sheeran", "Pop", 2017);
struct Song* s2 = createSong(2, "Despacito", "Luis Fonsi", "Pop", 2017);
struct Song* s3 = createSong(3, "Uptown Funk", "Mark Ronson ft. Bruno Mars", "Pop",
2014);
// create the playlist and add the sample songs
struct Song* playList = NULL;
add_song(&playList, s1);
add_song(&playList, s2);
add_song(&playList, s3);
// print the playlist
printf("Initial Playlist:\n");
printPlaylist(playList);
// add a new song to the playlist
struct Song* s4 = createSong(4, "Sorry", "Justin Bieber", "Pop", 2015);
printf("\nAdding new song to playlist:\n");
add_song(&playList, s4);
printPlaylist(playList);
// delete a song from the playlist
printf("\nDeleting a song from the playlist:\n");
struct Song* sToDelete = search_song(playList, "Despacito");
if (sToDelete != NULL)
{
delete_song(playList, sToDelete->name);
printf("Playlist after deletion:\n");
printPlaylist(playList);
}
else
{
printf("Song not found in playlist.\n");
}
// search for a song that doesn't exist in the playlist
printf("\nSearching for a song that doesn't exist in the playlist:\n");
struct Song* searchResult = search_song(playList, "Non-existent Song");
if (searchResult != NULL)
{
printf("Found song:\n");
printf("Song ID: %d, Song Name: %s, Singer Name: %s, Genre: %s, Year: %d",
searchResult->id, searchResult->name, searchResult->singer, searchResult->genre,
searchResult->year);
}
else
{
printf("Song not found in playlist.\n");
}
// search for a song that exists in the playlist
printf("\nSearching for a song that exists in the playlist:\n");
searchResult = search_song(playList, "Uptown Funk");
if (searchResult != NULL)
{
// printf("Found song:\n");
// printSong(searchResult);
}
else
{
printf("Song not found in playlist.\n");
}
// edit a song in the playlist
printf("\nEditing a song in the playlist:\n");
int editResult = edit_song(playList, "Shape of You", "Ed Sheeran", "Pop", 2018);
if (editResult == -1)
{
printf("Song not found in playlist.\n");
}
else
{
printf("Playlist after edit:\n");
printPlaylist(playList);
}
return 0;
}
*****************************************************************************
Please help me fishing this code :((.
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.
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.
Write a program in C++ language that implements a music play.pdf
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..
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.
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);
}
}.
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.
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
}.
Amazing SQL your django ORM can or can't do
SQL can seem like an obscure but somehow useful language. In this talk we will look into things that SQL can do, sometimes more easily than using python, and how to get it in your ORM, running in your application. During this talk we will use an application analysing the lyrics of my favorite teenage band and show fun examples of these SQL statements, and how to integrate them in your code
816 LAB Playlist output linked list Hey I have most of.pdf
8.16 LAB: Playlist (output linked list)
**Hey I have most of this done I just need to figure out to get rid of the indent/whitespace for this
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
#include "SongNode.h"
void PrintPlaylist(SongNode* head) {
SongNode* temp = head->GetNext();
while (temp != nullptr) {
temp->PrintSongInfo();
temp = temp->GetNext();
}
}
int main() {
SongNode* headNode = new SongNode();
SongNode* currNode = nullptr;
SongNode* lastNode = headNode;
string songTitle;
string songLength;
string songArtist;
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 << "LIST 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;
public:
SongNode();
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.cpp
#include "SongNode.h"
SongNode::SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = nullptr;
}
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
songTitle = songTitleInit;
songLength = songLengthInit;
songArtist = songArtistInit;
nextNodeRef = nullptr;
}
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc) {
songTitle = songTitleInit;
songLength = songLengthInit;
songArtist = songArtistInit;
nextNodeRef = nextLoc;
}
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext = nextNodeRef;
nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
SongNode* SongNode::GetNext() {
return nextNodeRef;
}
void SongNode::PrintSongInfo() {
cout << "Title: " << songTitle << endl;
cout << "Length: " << songLength << endl;
cout << "Artist: " << songArtist << endl << endl;
}
zyBooks My library > CS 1119: Computer Programming With C++ home > 8.16: LAB: Playlist
(output linked list) zyBooks catalog ? Help/FAQ 8 Julia Fritsch I.TST OF SONC5 --itle: Stomp! Iitht
380 Length: Artiat: The Brothera Johnson Title: The Iude Length: 337 Artist: Quincy Jones Title:
You Don't Own Me Length: 151 Artist: Lesley Gore + LIsT of SoNCs -------- Title: Stome! Length:
380 Artist: The Brothers Johnson Title: The Dude Length: 337 Artist: Quincy Jones Title: You Don't
Own Me Artiat: Lesley Gore Expected cutput Title: The Dude.
Here is app.js, artist.js and songs.js file. Can you look at the my .pdf
Here is app.js, artist.js and songs.js file. Can you look at the my code and point any error in it. As
the assignment requirement, when the button is clicked, it show artist name, link and songs, but
mine only show name and link. I need to help in showing the song table.
/**
* artists.js
*
* The app's list of Artists
*/
window.artists = [
{
id: "a1",
name: "Ingrid Michaelson",
link: [
{
url: "https://www.instagram.com/ingridmichaelson/?hl=en",
name: "Instagram"
},
{
url: "https://twitter.com/ingridmusic",
name: "Twitter"
},
{
url: "https://open.spotify.com/artist/2vm8GdHyrJh2O2MfbQFYG0",
name: "Spotify"
}
]
},
{
id: "a2",
name: "Katie Melua",
link: [
{
url: "https://www.instagram.com/katiemeluaofficial/?hl=en",
name: "Instagram"
},
{
url: "https://twitter.com/katiemelua",
name: "Twitter"
},
{
url: "https://open.spotify.com/artist/5uCXJWo3WoXgqv3T1RlAbh",
name: "Spotify"
}
]
},
{
id: "a3",
name: "Birdy",
link: [
{
url: "https://www.instagram.com/birdyinstagram/?hl=en",
name: "Instagram"
},
{
url: "https://twitter.com/birdy?lang=en",
name: "Twitter"
},
{
url: "https://open.spotify.com/artist/2WX2uTcsvV5OnS0inACecP",
name: "Spotify"
}
]
}
];
/**
* songs.js
*
* The app's songs
*/
window.songs = [
{
id: "s1",
artistId: "a1",
title: "The Way I Am",
year: "2007",
duration: "135",
flagged: "false"
},
{
id: "s2",
artistId: "a1",
title: "You And I",
year: "2008",
duration: "148",
flagged: "false"
},
{
id: "s3",
artistId: "a1",
title: "Everybody",
year: "2009",
duration: "209",
flagged: "false"
},
{
id: "s4",
artistId: "a1",
title: "Girls Chase Boys",
year: "2014",
duration: "221",
flagged: "false"
},
{
id: "s5",
artistId: "a1",
title: "Afterlife",
year: "2014",
duration: "281",
flagged: "false"
},
{
id: "s6",
artistId: "a1",
title: "Time Machine",
year: "2019",
duration: "212",
flagged: "true"
},
{
id: "s7",
artistId: "a1",
title: "The Lotto",
year: "2020",
duration: "193",
flagged: "false"
},
{
id: "s8",
artistId: "a2",
title: "Nine Million Bicycles",
year: "2005",
duration: "195",
flagged: "false"
},
{
id: "s9",
artistId: "a2",
title: "Piece By Piece",
year: "2005",
duration: "204",
flagged: "false"
},
{
id: "s10",
artistId: "a2",
title: "Wonderful Life",
year: "2010",
duration: "244",
flagged: "false"
},
{
id: "s11",
artistId: "a2",
title: "All Over The World",
year: "2012",
duration: "176",
flagged: "false"
},
{
id: "s12",
artistId: "a2",
title: "Dreams On Fire",
year: "2016",
duration: "245",
flagged: "false"
},
{
id: "s13",
artistId: "a2",
title: "Joy",
year: "2020",
duration: "193",
flagged: "false"
},
{
id: "s14",
artistId: "a2",
title: "Quiet Moves",
year: "2023",
duration: "218",
flagged: "true"
},
{
id: "s15",
artistId: "a3",
title: "Skinny Love",
year: "2011",
duration: "203",
flagged: "false"
},
{
id: "s16",
artistId: "a3",
title: "People Help the People",
year: "20111",
duration: "256",
flagged: "false"
},
{
id: "s17",
artistId: "a3",
title: "Wings",
year: "2013",
duration: "252",
flagged: "false"
},
{
id: "s18",
artistId: "a3",
title: "A.
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.
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;
}.
Amazing SQL your ORM can (or can't) do | PGConf EU 2019 | Louise Grandjonc
SQL can seem like an obscure and complex but powerful language. Learning it can be intimidating. As a developer, we can easily be tempted using basic SQL provided by the ORM. But did you know that you can use window functions in some ORMs? Same goes for a lot of other fun SQL functionalities.
In this talk we will explore some advanced SQL features that you might find useful. We will discover the wonderful world of joins (lateral, cross…), subqueries, grouping sets, window functions, common table expressions.
But most importantly this talk is not only a talk to show you how great SQL is. This talk is here to show you how to use it in real life. What are the features supported by your ORM? And how can you use them if they don’t support them?
Wether you know SQL or not, whether you are a developer or a DBA working with developers, you might learn a lot about SQL, ORMs, and application development using Postgres.
Here is the code.compile g++ Playlist.cpp main.cppPlaylist.h.pdf
Here is the code.
compile : g++ Playlist.cpp main.cpp
Playlist.h
#ifndef PLAYLIST_H
#define PLAYLIST_H
#include
using namespace std;
class PlaylistNode
{
private:
string uniqueID;
string songName;
string artistName;
int songLength;
PlaylistNode* nextNodePtr;
public:
PlaylistNode();
PlaylistNode(string id, string song, string artist, int len);
PlaylistNode* InsertAfter(string id, string song, string artist, int len);
void SetNext(PlaylistNode *next);
string GetID();
string GetSongName();
string GetArtistName();
int GetSongLength();
PlaylistNode* GetNext();
void PrintPlaylistNode();
};
#endif
Playlist.cpp
#include \"Playlist.h\"
#include
using namespace std;
PlaylistNode::PlaylistNode()
{
uniqueID = \"none\";
songName = \"none\";
artistName = \"none\";
songLength = 0;
nextNodePtr = 0;
}
PlaylistNode::PlaylistNode(string id, string song, string artist,int len)
{
uniqueID = id;
songName = song;
artistName = artist;
songLength = len;
nextNodePtr = 0;
}
PlaylistNode* PlaylistNode::InsertAfter(string id, string song, string artist,int len)
{
nextNodePtr=new PlaylistNode(id,song,artist,len);
return nextNodePtr;
}
void PlaylistNode::SetNext(PlaylistNode *next)
{
nextNodePtr = next;
}
string PlaylistNode::GetID()
{
return uniqueID;
}
string PlaylistNode::GetSongName()
{
return songName;
}
string PlaylistNode::GetArtistName()
{
return artistName;
}
int PlaylistNode::GetSongLength()
{
return songLength;
}
PlaylistNode* PlaylistNode::GetNext()
{
return nextNodePtr;
}
void PlaylistNode::PrintPlaylistNode()
{
cout<<\"Unique ID: \"<
using namespace std;
void PrintMenu(string listName);
void SongsByArtist(PlaylistNode* head);
void TotalTime(PlaylistNode* head);
void OutputFullList(string listname, PlaylistNode *head);
//all below function take head and tail by reference and modify their values
void AddSong(PlaylistNode* &head, PlaylistNode* &tail);
void RemoveSong(PlaylistNode* &head, PlaylistNode* &tail);
void ChangePosition(PlaylistNode* &head, PlaylistNode* &tail);
int main()
{
string listname;
cout<<\"Entr playlist\'s title: \";
cin>>listname;
PrintMenu(listname);
}
void PrintMenu(string listname)
{
string option;
PlaylistNode *head=0, *tail=0;
while(true)
{
cout<< listname << \" PLAYLIST MENU\"<>option;
if(option ==\"A\" || option == \"a\")
{
AddSong(head,tail);
cout<<\"Finished adding.\"<PrintPlaylistNode();
cout<GetNext();
i++;
}
}
void AddSong(PlaylistNode* &head, PlaylistNode* &tail)
{
string id, song, artist;
int len;
cout<<\"ADD SONG\"<>id;
getchar();
cout<<\"Enter songs\'s name: \";
getline(cin, song);
cout<<\"Enter artist\'s name: \";
getline(cin, artist);
cout<<\"Enter song\'s length(in seconds): \";
cin>>len;
if(tail == 0)
{
head = tail = new PlaylistNode(id,song,artist,len);
}
else
tail=tail->InsertAfter(id, song, artist, len);
}
void RemoveSong(PlaylistNode* &head, PlaylistNode* &tail)
{
string id;
PlaylistNode *p= head, *prev=NULL;
cout<<\"REMOVE SONG\";
cout<<\"Enter song\'s unique ID: \";
cin>>id;
while(p != NULL)
{
if(p->GetID() == id)
{
.
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
.
1817 LAB Playlist output linked list Given main compl.pdf
18.17 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:
#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
in C++ please, thank you!.
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.
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:.
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 :.
I need help writing test Codepackage org.example;import j.pdf
I need help writing test
Code:
package org.example;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Random;
class Album implements Comparable {
private int id;
private List artists;
private String title;
private int numSongs;
public Album(int id, List artists, String title, int numSongs) {
this.id = id;
this.artists = artists;
this.title = title;
this.numSongs = numSongs;
}
@Override
public int compareTo(Album other) {
return Integer.compare(this.numSongs, other.numSongs);
}
@Override
public String toString() {
return "ID: " + id + " -- " + numSongs + " songs -- " + artists;
}
// Getter methods for Album properties
// Implement these as needed
}
class DoublyLinkedList {
private Node head;
private Node tail;
private int size;
private class Node {
Album data;
Node prev;
Node next;
Node(Album data) {
this.data = data;
this.prev = null;
this.next = null;
}
}
public DoublyLinkedList() {
head = null;
tail = null;
size = 0;
}
public void append(Album data) {
Node newNode = new Node(data);
if (head == null) {
head = newNode;
tail = newNode;
} else {
tail.next = newNode;
newNode.prev = tail;
tail = newNode;
}
size++;
}
public Node insert(int location, Album data) {
if (location < 0 || location > size) {
throw new IllegalArgumentException("Invalid location");
}
Node newNode = new Node(data);
if (location == 0) {
newNode.next = head;
head.prev = newNode;
head = newNode;
} else if (location == size) {
tail.next = newNode;
newNode.prev = tail;
tail = newNode;
} else {
Node current = head;
for (int i = 0; i < location - 1; i++) {
current = current.next;
}
newNode.prev = current;
newNode.next = current.next;
current.next.prev = newNode;
current.next = newNode;
}
size++;
return newNode;
}
public Node delete(int location) {
if (location < 0 || location >= size) {
throw new IllegalArgumentException("Invalid location");
}
Node deletedNode;
if (location == 0) {
deletedNode = head;
head = head.next;
if (head != null) {
head.prev = null;
} else {
tail = null;
}
} else if (location == size - 1) {
deletedNode = tail;
tail = tail.prev;
tail.next = null;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
deletedNode = current;
current.prev.next = current.next;
current.next.prev = current.prev;
}
size--;
return deletedNode;
}
public int getIndex(Album data) {
Node current = head;
for (int i = 0; i < size; i++) {
if (current.data.equals(data)) {
return i;
}
current = current.next;
}
return -1;
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
Node current = head;
while (current != null) {
sb.append(current.data.toString());
if (current.next != null) {
sb.append(" -> ");
} else {
sb.append(" -> NULL");
}
current = current.next;
}
return sb.toString();
}
public void shuffle() {
List albumList = new ArrayList<>();
Node current = head;
while (current != null) {
albumList.add(current.data);
current = current.next;
}
Collections.shuffle(albumList, new Rando.
Pundits have stated that the recent tax cut mainly benefits .pdf
Pundits have stated that the recent tax cut mainly benefits companies. The benefit to companies
can also spillover to consumers in several ways. Which of the following actions as a result of the
tax cut will benefit consumers? tax cut results in more investment expenditures by firms tax cuts
raise stock market values tax cuts result in an increase in the capital stock all of the above.
Pt is 76 year old with pneumonia and malnutrition Patient i.pdf
Pt is 76 year old with pneumonia and malnutrition. Patient is on O2L per NC and breath sounds
decreased to right lower lobe with crackles. His breath sounds are 27 per min. Patient has not had
a bowel movement in 2 days and is constipated with decreased bowel sounds to LLQ. His HR is
regular, rate and rhythm with a noted murmur at 76 . He has a stage 1 decubitus to right hip with
dressing intact. He has noted melanoma to his right hand and is being evaluated for removal. He
currently has an Ut with a foley in place due to urinary retention. He uses a walker for ambulation,
and he is hard of hearing and wears a hearing aid to his left ear. He has dementia ands is
confused about where he is most of the time. He has an IV to his left-hand infusing 0.9%NS. The
site is intact with no redness noted. Do a nursing report..
More Related Content
Similar to Program 02 Based on the previous problem you should impleme.pdf
Write a program in C++ language that implements a music play.pdf
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..
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.
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);
}
}.
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.
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
}.
Amazing SQL your django ORM can or can't do
SQL can seem like an obscure but somehow useful language. In this talk we will look into things that SQL can do, sometimes more easily than using python, and how to get it in your ORM, running in your application. During this talk we will use an application analysing the lyrics of my favorite teenage band and show fun examples of these SQL statements, and how to integrate them in your code
816 LAB Playlist output linked list Hey I have most of.pdf
8.16 LAB: Playlist (output linked list)
**Hey I have most of this done I just need to figure out to get rid of the indent/whitespace for this
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
#include "SongNode.h"
void PrintPlaylist(SongNode* head) {
SongNode* temp = head->GetNext();
while (temp != nullptr) {
temp->PrintSongInfo();
temp = temp->GetNext();
}
}
int main() {
SongNode* headNode = new SongNode();
SongNode* currNode = nullptr;
SongNode* lastNode = headNode;
string songTitle;
string songLength;
string songArtist;
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 << "LIST 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;
public:
SongNode();
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.cpp
#include "SongNode.h"
SongNode::SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = nullptr;
}
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
songTitle = songTitleInit;
songLength = songLengthInit;
songArtist = songArtistInit;
nextNodeRef = nullptr;
}
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc) {
songTitle = songTitleInit;
songLength = songLengthInit;
songArtist = songArtistInit;
nextNodeRef = nextLoc;
}
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext = nextNodeRef;
nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
SongNode* SongNode::GetNext() {
return nextNodeRef;
}
void SongNode::PrintSongInfo() {
cout << "Title: " << songTitle << endl;
cout << "Length: " << songLength << endl;
cout << "Artist: " << songArtist << endl << endl;
}
zyBooks My library > CS 1119: Computer Programming With C++ home > 8.16: LAB: Playlist
(output linked list) zyBooks catalog ? Help/FAQ 8 Julia Fritsch I.TST OF SONC5 --itle: Stomp! Iitht
380 Length: Artiat: The Brothera Johnson Title: The Iude Length: 337 Artist: Quincy Jones Title:
You Don't Own Me Length: 151 Artist: Lesley Gore + LIsT of SoNCs -------- Title: Stome! Length:
380 Artist: The Brothers Johnson Title: The Dude Length: 337 Artist: Quincy Jones Title: You Don't
Own Me Artiat: Lesley Gore Expected cutput Title: The Dude.
Here is app.js, artist.js and songs.js file. Can you look at the my .pdf
Here is app.js, artist.js and songs.js file. Can you look at the my code and point any error in it. As
the assignment requirement, when the button is clicked, it show artist name, link and songs, but
mine only show name and link. I need to help in showing the song table.
/**
* artists.js
*
* The app's list of Artists
*/
window.artists = [
{
id: "a1",
name: "Ingrid Michaelson",
link: [
{
url: "https://www.instagram.com/ingridmichaelson/?hl=en",
name: "Instagram"
},
{
url: "https://twitter.com/ingridmusic",
name: "Twitter"
},
{
url: "https://open.spotify.com/artist/2vm8GdHyrJh2O2MfbQFYG0",
name: "Spotify"
}
]
},
{
id: "a2",
name: "Katie Melua",
link: [
{
url: "https://www.instagram.com/katiemeluaofficial/?hl=en",
name: "Instagram"
},
{
url: "https://twitter.com/katiemelua",
name: "Twitter"
},
{
url: "https://open.spotify.com/artist/5uCXJWo3WoXgqv3T1RlAbh",
name: "Spotify"
}
]
},
{
id: "a3",
name: "Birdy",
link: [
{
url: "https://www.instagram.com/birdyinstagram/?hl=en",
name: "Instagram"
},
{
url: "https://twitter.com/birdy?lang=en",
name: "Twitter"
},
{
url: "https://open.spotify.com/artist/2WX2uTcsvV5OnS0inACecP",
name: "Spotify"
}
]
}
];
/**
* songs.js
*
* The app's songs
*/
window.songs = [
{
id: "s1",
artistId: "a1",
title: "The Way I Am",
year: "2007",
duration: "135",
flagged: "false"
},
{
id: "s2",
artistId: "a1",
title: "You And I",
year: "2008",
duration: "148",
flagged: "false"
},
{
id: "s3",
artistId: "a1",
title: "Everybody",
year: "2009",
duration: "209",
flagged: "false"
},
{
id: "s4",
artistId: "a1",
title: "Girls Chase Boys",
year: "2014",
duration: "221",
flagged: "false"
},
{
id: "s5",
artistId: "a1",
title: "Afterlife",
year: "2014",
duration: "281",
flagged: "false"
},
{
id: "s6",
artistId: "a1",
title: "Time Machine",
year: "2019",
duration: "212",
flagged: "true"
},
{
id: "s7",
artistId: "a1",
title: "The Lotto",
year: "2020",
duration: "193",
flagged: "false"
},
{
id: "s8",
artistId: "a2",
title: "Nine Million Bicycles",
year: "2005",
duration: "195",
flagged: "false"
},
{
id: "s9",
artistId: "a2",
title: "Piece By Piece",
year: "2005",
duration: "204",
flagged: "false"
},
{
id: "s10",
artistId: "a2",
title: "Wonderful Life",
year: "2010",
duration: "244",
flagged: "false"
},
{
id: "s11",
artistId: "a2",
title: "All Over The World",
year: "2012",
duration: "176",
flagged: "false"
},
{
id: "s12",
artistId: "a2",
title: "Dreams On Fire",
year: "2016",
duration: "245",
flagged: "false"
},
{
id: "s13",
artistId: "a2",
title: "Joy",
year: "2020",
duration: "193",
flagged: "false"
},
{
id: "s14",
artistId: "a2",
title: "Quiet Moves",
year: "2023",
duration: "218",
flagged: "true"
},
{
id: "s15",
artistId: "a3",
title: "Skinny Love",
year: "2011",
duration: "203",
flagged: "false"
},
{
id: "s16",
artistId: "a3",
title: "People Help the People",
year: "20111",
duration: "256",
flagged: "false"
},
{
id: "s17",
artistId: "a3",
title: "Wings",
year: "2013",
duration: "252",
flagged: "false"
},
{
id: "s18",
artistId: "a3",
title: "A.
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.
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;
}.
Amazing SQL your ORM can (or can't) do | PGConf EU 2019 | Louise Grandjonc
SQL can seem like an obscure and complex but powerful language. Learning it can be intimidating. As a developer, we can easily be tempted using basic SQL provided by the ORM. But did you know that you can use window functions in some ORMs? Same goes for a lot of other fun SQL functionalities.
In this talk we will explore some advanced SQL features that you might find useful. We will discover the wonderful world of joins (lateral, cross…), subqueries, grouping sets, window functions, common table expressions.
But most importantly this talk is not only a talk to show you how great SQL is. This talk is here to show you how to use it in real life. What are the features supported by your ORM? And how can you use them if they don’t support them?
Wether you know SQL or not, whether you are a developer or a DBA working with developers, you might learn a lot about SQL, ORMs, and application development using Postgres.
Here is the code.compile g++ Playlist.cpp main.cppPlaylist.h.pdf
Here is the code.
compile : g++ Playlist.cpp main.cpp
Playlist.h
#ifndef PLAYLIST_H
#define PLAYLIST_H
#include
using namespace std;
class PlaylistNode
{
private:
string uniqueID;
string songName;
string artistName;
int songLength;
PlaylistNode* nextNodePtr;
public:
PlaylistNode();
PlaylistNode(string id, string song, string artist, int len);
PlaylistNode* InsertAfter(string id, string song, string artist, int len);
void SetNext(PlaylistNode *next);
string GetID();
string GetSongName();
string GetArtistName();
int GetSongLength();
PlaylistNode* GetNext();
void PrintPlaylistNode();
};
#endif
Playlist.cpp
#include \"Playlist.h\"
#include
using namespace std;
PlaylistNode::PlaylistNode()
{
uniqueID = \"none\";
songName = \"none\";
artistName = \"none\";
songLength = 0;
nextNodePtr = 0;
}
PlaylistNode::PlaylistNode(string id, string song, string artist,int len)
{
uniqueID = id;
songName = song;
artistName = artist;
songLength = len;
nextNodePtr = 0;
}
PlaylistNode* PlaylistNode::InsertAfter(string id, string song, string artist,int len)
{
nextNodePtr=new PlaylistNode(id,song,artist,len);
return nextNodePtr;
}
void PlaylistNode::SetNext(PlaylistNode *next)
{
nextNodePtr = next;
}
string PlaylistNode::GetID()
{
return uniqueID;
}
string PlaylistNode::GetSongName()
{
return songName;
}
string PlaylistNode::GetArtistName()
{
return artistName;
}
int PlaylistNode::GetSongLength()
{
return songLength;
}
PlaylistNode* PlaylistNode::GetNext()
{
return nextNodePtr;
}
void PlaylistNode::PrintPlaylistNode()
{
cout<<\"Unique ID: \"<
using namespace std;
void PrintMenu(string listName);
void SongsByArtist(PlaylistNode* head);
void TotalTime(PlaylistNode* head);
void OutputFullList(string listname, PlaylistNode *head);
//all below function take head and tail by reference and modify their values
void AddSong(PlaylistNode* &head, PlaylistNode* &tail);
void RemoveSong(PlaylistNode* &head, PlaylistNode* &tail);
void ChangePosition(PlaylistNode* &head, PlaylistNode* &tail);
int main()
{
string listname;
cout<<\"Entr playlist\'s title: \";
cin>>listname;
PrintMenu(listname);
}
void PrintMenu(string listname)
{
string option;
PlaylistNode *head=0, *tail=0;
while(true)
{
cout<< listname << \" PLAYLIST MENU\"<>option;
if(option ==\"A\" || option == \"a\")
{
AddSong(head,tail);
cout<<\"Finished adding.\"<PrintPlaylistNode();
cout<GetNext();
i++;
}
}
void AddSong(PlaylistNode* &head, PlaylistNode* &tail)
{
string id, song, artist;
int len;
cout<<\"ADD SONG\"<>id;
getchar();
cout<<\"Enter songs\'s name: \";
getline(cin, song);
cout<<\"Enter artist\'s name: \";
getline(cin, artist);
cout<<\"Enter song\'s length(in seconds): \";
cin>>len;
if(tail == 0)
{
head = tail = new PlaylistNode(id,song,artist,len);
}
else
tail=tail->InsertAfter(id, song, artist, len);
}
void RemoveSong(PlaylistNode* &head, PlaylistNode* &tail)
{
string id;
PlaylistNode *p= head, *prev=NULL;
cout<<\"REMOVE SONG\";
cout<<\"Enter song\'s unique ID: \";
cin>>id;
while(p != NULL)
{
if(p->GetID() == id)
{
.
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
.
1817 LAB Playlist output linked list Given main compl.pdf
18.17 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:
#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
in C++ please, thank you!.
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.
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:.
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 :.
I need help writing test Codepackage org.example;import j.pdf
I need help writing test
Code:
package org.example;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Random;
class Album implements Comparable {
private int id;
private List artists;
private String title;
private int numSongs;
public Album(int id, List artists, String title, int numSongs) {
this.id = id;
this.artists = artists;
this.title = title;
this.numSongs = numSongs;
}
@Override
public int compareTo(Album other) {
return Integer.compare(this.numSongs, other.numSongs);
}
@Override
public String toString() {
return "ID: " + id + " -- " + numSongs + " songs -- " + artists;
}
// Getter methods for Album properties
// Implement these as needed
}
class DoublyLinkedList {
private Node head;
private Node tail;
private int size;
private class Node {
Album data;
Node prev;
Node next;
Node(Album data) {
this.data = data;
this.prev = null;
this.next = null;
}
}
public DoublyLinkedList() {
head = null;
tail = null;
size = 0;
}
public void append(Album data) {
Node newNode = new Node(data);
if (head == null) {
head = newNode;
tail = newNode;
} else {
tail.next = newNode;
newNode.prev = tail;
tail = newNode;
}
size++;
}
public Node insert(int location, Album data) {
if (location < 0 || location > size) {
throw new IllegalArgumentException("Invalid location");
}
Node newNode = new Node(data);
if (location == 0) {
newNode.next = head;
head.prev = newNode;
head = newNode;
} else if (location == size) {
tail.next = newNode;
newNode.prev = tail;
tail = newNode;
} else {
Node current = head;
for (int i = 0; i < location - 1; i++) {
current = current.next;
}
newNode.prev = current;
newNode.next = current.next;
current.next.prev = newNode;
current.next = newNode;
}
size++;
return newNode;
}
public Node delete(int location) {
if (location < 0 || location >= size) {
throw new IllegalArgumentException("Invalid location");
}
Node deletedNode;
if (location == 0) {
deletedNode = head;
head = head.next;
if (head != null) {
head.prev = null;
} else {
tail = null;
}
} else if (location == size - 1) {
deletedNode = tail;
tail = tail.prev;
tail.next = null;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
deletedNode = current;
current.prev.next = current.next;
current.next.prev = current.prev;
}
size--;
return deletedNode;
}
public int getIndex(Album data) {
Node current = head;
for (int i = 0; i < size; i++) {
if (current.data.equals(data)) {
return i;
}
current = current.next;
}
return -1;
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
Node current = head;
while (current != null) {
sb.append(current.data.toString());
if (current.next != null) {
sb.append(" -> ");
} else {
sb.append(" -> NULL");
}
current = current.next;
}
return sb.toString();
}
public void shuffle() {
List albumList = new ArrayList<>();
Node current = head;
while (current != null) {
albumList.add(current.data);
current = current.next;
}
Collections.shuffle(albumList, new Rando.
Similar to Program 02 Based on the previous problem you should impleme.pdf (20)
Write a program in C++ language that implements a music play.pdf
Write a program in C++ language that implements a music play.pdf
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 J.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
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 p.pdf
Given main(), complete the SongNode class to include the printSong.pdf
Given main(), complete the SongNode class to include the printSong.pdf
816 LAB Playlist output linked list Hey I have most of.pdf
816 LAB Playlist output linked list Hey I have most of.pdf
Here is app.js, artist.js and songs.js file. Can you look at the my .pdf
Here is app.js, artist.js and songs.js file. Can you look at the my .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
In C++ Plz LAB- Playlist (output linked list) Given main()- complete.pdf
In C++ Plz LAB- Playlist (output linked list) Given main()- complete.pdf
Amazing SQL your ORM can (or can't) do | PGConf EU 2019 | Louise Grandjonc
Amazing SQL your ORM can (or can't) do | PGConf EU 2019 | Louise Grandjonc
Here is the code.compile g++ Playlist.cpp main.cppPlaylist.h.pdf
Here is the code.compile g++ Playlist.cpp main.cppPlaylist.h.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
1817 LAB Playlist output linked list Given main compl.pdf
1817 LAB Playlist output linked list Given main compl.pdf
C++ Programming Search A Linked ListThe Content of songlist.txt.pdf
C++ Programming Search A Linked ListThe Content of songlist.txt.pdf
maincpp include ltiostreamgt include ltstringgt.pdf
maincpp include ltiostreamgt include ltstringgt.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
I need help writing test Codepackage org.example;import j.pdf
I need help writing test Codepackage org.example;import j.pdf
More from addtechglobalmarketi
Pundits have stated that the recent tax cut mainly benefits .pdf
Pundits have stated that the recent tax cut mainly benefits companies. The benefit to companies
can also spillover to consumers in several ways. Which of the following actions as a result of the
tax cut will benefit consumers? tax cut results in more investment expenditures by firms tax cuts
raise stock market values tax cuts result in an increase in the capital stock all of the above.
Pt is 76 year old with pneumonia and malnutrition Patient i.pdf
Pt is 76 year old with pneumonia and malnutrition. Patient is on O2L per NC and breath sounds
decreased to right lower lobe with crackles. His breath sounds are 27 per min. Patient has not had
a bowel movement in 2 days and is constipated with decreased bowel sounds to LLQ. His HR is
regular, rate and rhythm with a noted murmur at 76 . He has a stage 1 decubitus to right hip with
dressing intact. He has noted melanoma to his right hand and is being evaluated for removal. He
currently has an Ut with a foley in place due to urinary retention. He uses a walker for ambulation,
and he is hard of hearing and wears a hearing aid to his left ear. He has dementia ands is
confused about where he is most of the time. He has an IV to his left-hand infusing 0.9%NS. The
site is intact with no redness noted. Do a nursing report..
Punto 13 Punto 13 Mindy se adapt rpidamente a su puesto en.pdf
Punto 13 Punto 13 Mindy se adapt rpidamente a su puesto en el extranjero y disfrut de las
oportunidades de comida, entretenimiento y ocio que experiment en un nuevo pas. Cul de las
dimensiones de Mendenhall y Oddou est demostrando Mindy?
Opcin multiple
autoorientacin
etnocentrismo
competencia tcnica
habilidad perceptiva
orientacin a los dems.
Pulse can be palpated on a number of arteries around the bod.pdf
Pulse can be palpated on a number of arteries around the body. Match the following pulse
palpation points to the body region where they would be found.
radial artery
superficial temporal artery
posterior tibial artery
common carotid artery
femoral artery
ANSWER OPTIONS: inguinal region, carpal region, cephalic region, popliteal region, cervical
region, abdominal region, mammary region, tarsal region..
Punnett Squares se puede extender ms all de un simple cruc.pdf
Punnett Squares se puede extender ms all de un simple cruce de un gen. Recuerde del Principio
de Segregacin que los alelos de un gen se dividirn para incluirse en diferentes gametos. Si
estamos viendo dos caractersticas a la vez, tambin debemos pensar en el Principio de Surtido
Independiente. Debido a que los rasgos que estamos viendo no estn relacionados y se
encuentran en diferentes cromosomas, los alelos se dividirn en diferentes gametos al azar e
independientes entre s durante la meiosis.
En este ejemplo, te dan una cachorra llamada Trixy. Debido a que ha tomado esta clase, est
interesado en los genes de los perros. descubres que
Trixy es heterocigoto para ambos rasgos. Use T como el alelo para la longitud de la cola y E
como el alelo para la forma de la oreja.
Cul es el genotipo de Trixy?.
pular Madde 5 Aadaki durumda orijinal kaynak materyal b.pdf
pular
Madde 5
Aadaki durumda, orijinal kaynak materyal, bir renci almas rnei ile birlikte verilmektedir. Uygun
radyo dmesini tklayarak intihal trn belirleyin.
Orijinal Kaynak Materyal
renci Versiyonu
renme iin bir web sitesi oluturmak gibi karmak bir grevde eitmenler, rencilerin akran geri
bildirimlerinde oklu zmlerin oluturulmasn desteklemek isteyebilir. Anonimlik, rencilerin eitli fikirleri
ifade etmede kendilerini daha zgr hissettikleri ve geri bildirim verme grevini daha az engelledikleri
bir sosyal balam yaratabilir. Ancak retmenlerin, akran geri bildiriminde anonim yaplandrmalarn ne
zaman uygun olduu konusunda bilinli seimler yapabilmek iin anonimliin renme dinamiini nasl
etkilediini bilmesi gerekir.
Referanslar:
Howard, CD, Barrett, AF ve Frick, TW (2010). Akran geri bildirimini tevik etmek iin anonimlik:
retmen adaylarnn ezamansz bilgisayar aracl iletiimdeki yorumlar. Eitimsel Biliim Aratrmalar
Dergisi, 43(1), 89-112.
Snfmda teknolojinin artan mevcudiyeti, "rencilerin eitli fikirleri ifade etmede kendilerini daha zgr
hissettikleri ve geri bildirim verme grevini daha az ekingen hale getirebilecekleri bir sosyal balam
yaratabilir" (Howard, Barrett, & Frick, 2010, s.90). Ancak, yorumlarnn arkasnda durmak zorunda
kalmazlarsa rencilerimin ar sert olabileceinden endieleniyorum.
Referanslar:
Howard, CD, Barrett, AF ve Frick, TW (2010). Akran geri bildirimini tevik etmek iin anonimlik:
retmen adaylarnn ezamansz bilgisayar aracl iletiimdeki yorumlar. Eitimsel Biliim Aratrmalar
Dergisi, 43(1), 89-112.
Yukardaki renci Srm iin aadakilerden hangisi dorudur?
Kelimesi kelimesine intihal
Baka szcklerle ifade edilen intihal
Bu intihal deil
pular
Madde 6
Aadaki durumda, orijinal kaynak materyal, bir renci almas rnei ile birlikte verilmektedir. Uygun
radyo dmesini tklayarak intihal trn belirleyin.
Orijinal Kaynak Materyal
renci Versiyonu
Bununla birlikte, bu otobiyografik metinde birlemeyen ey, anne ve kznn, anne ve torununun ego
snrlardr. Her zaman ayr ama yakn dururlar, her zaman birbirleriyle iliki halindedirler, her zaman
zihinsel ve ruhsal bir yaknlk iindedirler, ancak metnin sunduu gibi, asla birbirlerinin znelliini tehdit
etmezler. Bu ekilde, diil ve zellikle anne znelliinin bu metinsel temsili, annenin ataerkil yaztn
yeniden yazar - daha dorusu kendini yazar -: anne ve ocuk arasnda hibir kaynama yoktur; anneliin
fedakarlk unsuru metinde eksik olduu gibi.
Referanslar:
Sllei, N., (2009) Rosamond Lehmann'n The swan in the evening: Fragments of an inner life adl
eserinde otobiyografi konusu olarak yas tutan anne. A. O'Reilly ve S. Caporale-Bizzini'de (Eds.).
Kiiselden politik olana: Yeni bir anne anlats teorisine doru (s. 170-182). Cranbury, NJ:
Susquehanna University Press.
Annenin, zellikle de kimlii ocuunkiyle kaynaan fedakar bir birey olarak annenin ataerkil bak as,
metindeki anne-ocuk ilikisiyle tezat oluturur. Anne-kz ego snrlar bu otobiyografik metinde asla
birlemez.
Yukardaki renci Srm iin aadakilerden hangisi dorudur?
Kelimesi kelimesine in.
Puede crear numerosas vistas personalizadas para usar con to.pdf
Puede crear numerosas vistas personalizadas para usar con todos sus proyectos. Cul es la forma
ms fcil de asegurarse de que estas vistas estn disponibles para todos sus proyectos?
Seleccione una respuesta:
Active la opcin Agregar automticamente nuevas vistas, tablas, filtros y grupos a la opcin global.
Nada. Las vistas personalizadas estn disponibles automticamente para todos los proyectos.
Copie cada vista personalizada a la plantilla global a travs del Organizador.
En el Organizador, seleccione todas las vistas personalizadas y luego haga clic en Copiar..
publie elass h 1 pahlte clamsia axcends A pablie clann Main .pdf
publie elass h 1 pahlte clamsia axcends A pablie clann Main i Dublic statie veda nala (Striogi)
aigatpubieletasin publie vodd mita i byztek, pat opelnelnim ht m Fi Futile elase di anterdn A i
pubide elana Maln 1. public atario vold Basin (tringll asga).
Puede una empresa ser buena en responsabilidad social corpo.pdf
Puede una empresa ser buena en responsabilidad social corporativa pero no estar orientada a la
sostenibilidad? Es posible enfocar la sustentabilidad pero no la responsabilidad social
empresarial?
basado en la lectura de la seccin de enfoque en las implicaciones gerenciales, discuta cmo se
relacionan la RSE y la sustentabilidad y cunto difieren los conceptos entre s.
public class Monster protected String clanAffiliation pro.pdf
public class Monster {
protected String clanAffiliation;
protected int ferocity;
protected int defense;
protected int magic;
protected int treasure;
protected int health;
public Monster(String clanAffiliation, int ferocity, int defense, int magic) {
this.clanAffiliation = clanAffiliation;
this.ferocity = ferocity;
this.defense = defense;
this.magic = magic;
this.treasure = 0;
this.health = 100;
}
public String getClanAffiliation() {
return clanAffiliation;
}
public int getFerocity() {
return ferocity;
}
public int getDefense() {
return defense;
}
public int getMagic() {
return magic;
}
public int getTreasure() {
return treasure;
}
public int getHealth() {
return health;
}
public void addTreasure(int treasure) {
if (health > 0) {
this.treasure += treasure;
}
}
public void subtractTreasure(int treasure) {
if (health > 0) {
this.treasure -= treasure;
if (this.treasure < 0) {
this.treasure = 0;
}
}
}
public void addHealth(int amount) {
if (health > 0) {
health += amount;
}
}
public void subtractHealth(int amount) {
if (health > 0) {
health -= amount;
if (health < 0) {
health = 0;
}
}
}
public boolean isAlive() {
return health > 0;
}
public double getBattleScore() {
if (health <= 0) {
return 0;
}
return (ferocity + defense + magic) / 3.0;
}
public abstract void attack(Monster opponent);
public abstract void defend(double opponentBattleScore);
@Override
public String toString() {
return "Monster{" +
"clanAffiliation='" + clanAffiliation + ''' +
", ferocity=" + ferocity +
", defense=" + defense +
", magic=" + magic +
", treasure=" + treasure +
", health=" + health +
'}';
}
}
public class Orc extends Monster {
private OrcCommander commander;
public Orc(String clan, int ferocity, int defense, int magic, int treasure, int health) {
super(clan, ferocity, defense, magic, treasure, health);
}
public void setCommander(OrcCommander commander) {
this.commander = commander;
}
public OrcCommander getCommander() {
return commander;
}
public int getLeadership() {
if (this instanceof Warlord) {
Warlord warlord = (Warlord) this;
return warlord.getLeadership();
}
return 0;
}
public int getInfantryCount() {
if (this instanceof Warlord) {
Warlord warlord = (Warlord) this;
return warlord.getInfantryCount();
}
return 0;
}
public void setInfantry(Warlord warlord) {
if (this instanceof Infantry) {
Infantry infantry = (Infantry) this;
infantry.setCommander(warlord);
}
}
@Override
public void attack(Monster opponent) {
int attackScore = calculateAttackScore();
int defenseScore = opponent.calculateDefenseScore();
int damage = Math.max(attackScore - defenseScore, 0);
opponent.takeDamage(damage);
}
}
public class Warlord extends Orc {
private int leadershipRating;
private Infantry[] infantry;
public Warlord(String name, int ferocity, int defense, int magic, int leadershipRating) {
super(name, ferocity, defense, magic);
this.leadershipRating = leadershipRating;
this.infantry = new Infantry[5];
}
public int getLeadershipRating() {
return leadershipRating;
}
public void setLeade.
Provide three evidences with scholar reference that support.pdf
Provide three evidences with scholar reference that support that euthanasia violates the religious
belief
three evidences with scholar references support that the legislation of euthanasia can easily be
abused by doctors, and relative .
Three evidences with scholar references that support that the legislation of euthanasia will weaken
a patient will to fight with diseases
Provide references for your answer.
Provincial Government The name of the representative of the .pdf
Provincial Government
The name of the representative of the Queen for my province is
The representative of the Queen in my province, the Lieutenant Governor, is
The Head of Government (the Premier) is
The name of the provincial party in power is
The names of the provincial opposition parties and leaders are
My provincial representative is
Territorial Government
The name of the Commissioner, who represents the federal government in my territory, is
The name of the Premier is
The name of my territorial representative is
Municipal Government
The name of the municipality where I live is
The name of the head of the municipal government (mayor or reeve) is.
Prpugh shicti the bloset fides 1 rightventikiele+3 Fxet.pdf
Prpugh shicti the bloset fides. 1 rightventikiele+3 Fxetcise 22.2 Creot Vesseh of the Heart 2. The
uff common carsot anery hit the Eistsecandterdi braoth of the aortic arch. 2 Fxerdses 22.2-22.
Systemik Circule 3. Label the diagram mets the appopoiane artery sumet. 3 -(1) A 15 (t) 1 17 2 3
4. b. 6. 20 21 ? 22 b.- Daxnen cinle forsa buids. where the podratie trustape is cuted ter Laerdes
22 int Filose brise Was Structue known as the Lunat Pictemaledeinas Ceercise 22.11. Fiastic
Artery-The Aorta a curtave an internai esintr lamion . h. contais migipie layers of smooth minde c.
furich meda contains numersua elasitic fitees 1. 7ypifa dianesers e 12.5an in dameter: t. very thin
with no smooth muscle cess 7t. The ibilty of an einsic artiy to eyand as it recelees blood from the
ventricles is due to (icilagenciatic fors. 24 7. Larpe arterias sach as the aorta are nourtshed by ling
blocd versels calles. Fercise 2212 : Muscidar Artery D. The amount of smosth musde in the turics
medis of a miakidar alery is. igreatenlesi than that of elaste ateits. 2 . 14. Elase arterits are trpicaly
located clonest ts the heart where presures are (Dighest lowest 24 Exercise 22.13: Acteriole 15.
Constriction of atestales. ( (Secreasestho eases) blood fiow ines capiling beds. A) Exertise 22.14z
Vein 16. Weins are convldered - Dighlisw pr issure versels. 29 12. A venous valve a formed dy an
inlalding of the turica firitisinediblextring Exroise 22.15: Capilaries to. Rank the following types of
capilaries trom inoost to toast permeable. 2 . is costinutis b. fenestrated c.
sinusaidalIncreacaldecremet in puhe site. 68 Finrole 2217. Riaod Pressare and Pulte Using e
Standard Dlood Pressure Cuft 21. When medturing tiobd preskur ising a blobd preskes ouft the tiat
Kor olkeff saund cocresponds to . (datalichysitgila pressure. wheites the second Korotabli sound
comespones to 22. The tidod pressure chanpes that ogcur during the cardaci oyde are detected
by meauiring the puits in the (internai jugutar vinhradial antery. Exercise 22.18- A10pac Lossan 16
: Blood Pressure 29. Mean ameilat presuare (Maty b chases in value io a sibitcts. (diastalichystolig
biode presiour. 34 24. Wharous extetae - (decoeatesintreases) 5yteric tiood brane. 33 Can You
Apply What You've Lnamed? 25. Explain why large blood vesseis hre Bhel owin biocd vessels
fiasa vionuary li the funica extema. The phyician will then guide the catheter along the venous
system untili it reaches the right atrlum tist, in ordec, the xelos through which the central Inte
pesses as it trovels trom the basilic vein to the right atrum of the beat. Basilic vein 28. Ater the
centrat ine was placed fquestion 27 , it phiched etf and failed to work when the patient heid a
heavy inight in her hand and the inferior mevement of her clavicle campressed the central line
within the subdevian vein. The plysian decided to remove the central line focti the basilic vein and
place anether center line Into the intemal jugular vein (DV). The INV provid.
Provide three evidences with reliable reference that suppor.pdf
Provide three evidences with reliable reference that support that euthanasia violates the religious
belief
three evidences with reliable references support that the legislation of euthanasia can easily be
abused by doctors, and relative .
Three evidences with reliable
references that support that the legislation of euthanasia will weaken a patient will to fight with
diseases
Provide references for your answer.
Provide the Independent variables Dependent variables a.pdf
Provide the Independent variable(s), Dependent variable(s) and Unit of Analysis
Purser, G. L. (2020). The combined effect of functional independence, loneliness, and social
engagement on older adult drinking levels. Journal of Social Work Practices in the Addictions,
29(4): 311-324. 50. Independent variable(s) 51. Dependent variable(s) 52. Unit of analysis.
Provide your example of a firm or a small business from the .pdf
Provide your example of a firm or a small business from the real world that is surviving the
dynamic nature of monopolistic competition and discuss some approaches they have used (or are
currently using) to compete and survive in the market. Note, a monopolistic competition market
structure is not a monopoly market structure. These are two different markets..
Provide the steps for the following In order to install sof.pdf
Provide the steps for the following:
In order to install software on the Linux servers, you need to list the commands that are needed for
your Red Hat Centos and for the Ubuntu Linux servers. Since the package managers used for
package installation on these two versions of Linux OS are different you need to list and describe
the package managers and the commands needed for both..
Provide land use land cover images and photos using shape.pdf
Provide land use land cover (images and photos - using shape file that is provided by JDA
recently) of Jaipur city using ArcGIS software for the years 2001, 2011 and 2021 and provide all
the changes in great detail.
(Someone provided this solution just now and it was not what i am looking for, I want images of
land use land cover (using ArcGIS) - I have given him downvote and I will give downvote again if
somebody provides me the same solution again). So, its no meaning providing solution when you
can not, otherwise you will just attract dislike).
Provide SQL that creates two database tables Employee and D.pdf
Provide SQL that creates two database tables: Employee and Department, as follows: (Please
choose appropriate data types and their lengths for all the attributes)
a) The attributes of Employee table are empNumber, firstName, lastName, middleName, DOB,
SSN, and deptNumber.
b) The attributes of Department table are deptNumber, and deptName.
c) Make empNumber and deptNumber primary keys in their respective tables.
d) Make deptNumber in Employee table, a foreign key.
e) Make all attributes NOT NULL in both tables except middleName and deptNumber in Employee
table..
More from addtechglobalmarketi (20)
Pundits have stated that the recent tax cut mainly benefits .pdf
Pundits have stated that the recent tax cut mainly benefits .pdf
Pt is 76 year old with pneumonia and malnutrition Patient i.pdf
Pt is 76 year old with pneumonia and malnutrition Patient i.pdf
Punto 13 Punto 13 Mindy se adapt rpidamente a su puesto en.pdf
Punto 13 Punto 13 Mindy se adapt rpidamente a su puesto en.pdf
Pulse can be palpated on a number of arteries around the bod.pdf
Pulse can be palpated on a number of arteries around the bod.pdf
Punnett Squares se puede extender ms all de un simple cruc.pdf
Punnett Squares se puede extender ms all de un simple cruc.pdf
pular Madde 5 Aadaki durumda orijinal kaynak materyal b.pdf
pular Madde 5 Aadaki durumda orijinal kaynak materyal b.pdf
Puede crear numerosas vistas personalizadas para usar con to.pdf
Puede crear numerosas vistas personalizadas para usar con to.pdf
publie elass h 1 pahlte clamsia axcends A pablie clann Main .pdf
publie elass h 1 pahlte clamsia axcends A pablie clann Main .pdf
Puede una empresa ser buena en responsabilidad social corpo.pdf
Puede una empresa ser buena en responsabilidad social corpo.pdf
public class Monster protected String clanAffiliation pro.pdf
public class Monster protected String clanAffiliation pro.pdf
Provide three evidences with scholar reference that support.pdf
Provide three evidences with scholar reference that support.pdf
Provincial Government The name of the representative of the .pdf
Provincial Government The name of the representative of the .pdf
Prpugh shicti the bloset fides 1 rightventikiele+3 Fxet.pdf
Prpugh shicti the bloset fides 1 rightventikiele+3 Fxet.pdf
Provide three evidences with reliable reference that suppor.pdf
Provide three evidences with reliable reference that suppor.pdf
Provide the Independent variables Dependent variables a.pdf
Provide the Independent variables Dependent variables a.pdf
Provide your example of a firm or a small business from the .pdf
Provide your example of a firm or a small business from the .pdf
Provide the steps for the following In order to install sof.pdf
Provide the steps for the following In order to install sof.pdf
Provide land use land cover images and photos using shape.pdf
Provide land use land cover images and photos using shape.pdf
Provide SQL that creates two database tables Employee and D.pdf
Provide SQL that creates two database tables Employee and D.pdf
Recently uploaded
The geography of Taylor Swift - some ideas
Geographical themes connected with Taylor Swift's ERAS tour - coming to the UK in June 2024
Digital Tools and AI for Teaching Learning and Research
This Presentation in details discusses on Digital Tools and AI for Teaching Learning and Research
Sectors of the Indian Economy - Class 10 Study Notes pdf
The Indian economy is classified into different sectors to simplify the analysis and understanding of economic activities. For Class 10, it's essential to grasp the sectors of the Indian economy, understand their characteristics, and recognize their importance. This guide will provide detailed notes on the Sectors of the Indian Economy Class 10, using specific long-tail keywords to enhance comprehension.
For more information, visit-www.vavaclasses.com
Supporting (UKRI) OA monographs at Salford.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
1.4 modern child centered education - mahatma gandhi-2.pptx
Child centred education is an educational approach that priorities the interest, needs and abilities of the child in the learning process.
Overview on Edible Vaccine: Pros & Cons with Mechanism
This ppt include the description of the edible vaccine i.e. a new concept over the traditional vaccine administered by injection.
The Art Pastor's Guide to Sabbath | Steve Thomason
What is the purpose of the Sabbath Law in the Torah. It is interesting to compare how the context of the law shifts from Exodus to Deuteronomy. Who gets to rest, and why?
How to Split Bills in the Odoo 17 POS Module
Bills have a main role in point of sale procedure. It will help to track sales, handling payments and giving receipts to customers. Bill splitting also has an important role in POS. For example, If some friends come together for dinner and if they want to divide the bill then it is possible by POS bill splitting. This slide will show how to split bills in odoo 17 POS.
Cambridge International AS A Level Biology Coursebook - EBook (MaryFosbery J...
for studentd in cabridge board
Ethnobotany and Ethnopharmacology ......
Ethnobotany and Ethnopharmacology:
Ethnobotany in herbal drug evaluation,
Impact of Ethnobotany in traditional medicine,
New development in herbals,
Bio-prospecting tools for drug discovery,
Role of Ethnopharmacology in drug evaluation,
Reverse Pharmacology.
Synthetic Fiber Construction in lab .pptx
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
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.CLASS 11 CBSE B.St Project AIDS TO TRADE - INSURANCE
Class 11 CBSE Business Studies Project ( AIDS TO TRADE - INSURANCE)
The French Revolution Class 9 Study Material pdf free download
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
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.
Recently uploaded (20)
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
Sectors of the Indian Economy - Class 10 Study Notes pdf
Sectors of the Indian Economy - Class 10 Study Notes pdf
Basic phrases for greeting and assisting costumers
Basic phrases for greeting and assisting costumers
1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx
Overview on Edible Vaccine: Pros & Cons with Mechanism
Overview on Edible Vaccine: Pros & Cons with Mechanism
The Art Pastor's Guide to Sabbath | Steve Thomason
The Art Pastor's Guide to Sabbath | Steve Thomason
Cambridge International AS A Level Biology Coursebook - EBook (MaryFosbery J...
Cambridge International AS A Level Biology Coursebook - EBook (MaryFosbery J...
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptx
CLASS 11 CBSE B.St Project AIDS TO TRADE - INSURANCE
CLASS 11 CBSE B.St Project AIDS TO TRADE - INSURANCE
The French Revolution Class 9 Study Material pdf free download
The French Revolution Class 9 Study Material pdf free download
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Program 02 Based on the previous problem you should impleme.pdf
- 1. 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;
- 2. 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 **playlist, struct Song *newSong) { // TODO: Implement function } // function to search for a song by name struct Song *search_song(struct Song *playlist, char *name) { // TODO: Implement function } // function to edit a song by name
- 3. int edit_song(struct Song *playlist, char *name, char *singer, char *genre, int year) { // TODO: Implement function } // function to delete a song by name int delete_song(struct Song *playlist, char *name) { // TODO: Implement function } void flushSngIn() { char c; do c = getchar(); while (c != 'n' && c != EOF); } int main() { // Problem 1 int choice = 0; int songCount = 0; char songName_input[MAX_SONG_NAME_LENGTH], singerName_input[MAX_SINGER_NAME_LENGTH]; char genre_input[20]; unsigned int year_input, add_result = 0; struct musicRepository music[20]; struct musicRepository *song = NULL; initializeRepository(music, 20); music[0].ID = numSongs + 1; numSongs++; strcpy(music[0].songName,"Shape of You"); strcpy(music[0].singerName,"Ed Sheeran"); music[0].genre=1; music[0].year=2017; songCount++; music[1].ID = numSongs + 1; numSongs++; strcpy(music[1].songName,"Despacito"); strcpy(music[1].singerName,"Luis Fonsi"); music[1].genre=1; music[1].year=2017; songCount++; music[2].ID = numSongs + 1; numSongs++;
- 4. strcpy(music[2].songName,"Uptown Funk"); strcpy(music[2].singerName,"Mark Ronson ft. Bruno Mars"); music[2].genre=1; music[2].year=2014; songCount++; printf("Number of Songs: %d", songCount); do { printf("n"); printf("1. Add a song to the repositoryn"); printf("2. Search song by namen"); printf("3. Print a songn"); printf("4. Edit a songn"); printf("5. Delete a songn"); printf("6. Print full list of songsn"); printf("7. Exitn"); printf("Enter your choice: "); scanf("%d", &choice); flushSngIn(); switch (choice) { case 1: printf("nEnter song name: "); fgets(songName_input, sizeof(songName_input), stdin); songName_input[strlen(songName_input) - 1] = '0'; // flushSngIn(); // printf("Song name: %sn", songName_input); printf("Enter singer name: "); fgets(singerName_input, sizeof(singerName_input), stdin); singerName_input[strlen(singerName_input) - 1] = '0'; // flushSngIn(); printf("Enter genre ( Pop , Rock , Reggae , Country , Blues , Balad or unclassified ):"); fgets(genre_input, sizeof(genre_input), stdin); genre_input[strlen(genre_input) - 1] = '0'; // flushSngIn(); printf("Enter release year: "); scanf("%d", &year_input); flushSngIn(); add_result = addSong(music, songName_input, singerName_input, genre_input, year_input, songCount); if (add_result == 1)
- 5. { printf("Song added successfullyn"); songCount++; // printf("Number of Songs: %d", songCount); // flushSngIn(); printRepository(music, songCount); break; } case 2: printf("Enter song name: "); fgets(songName_input, sizeof(songName_input), stdin); songName_input[strlen(songName_input) - 1] = '0'; flushSngIn(); song = searchSong(music, songName_input, songCount); printf("Song found: %s, %s, %d, %d", song->songName, song->singerName, song->genre, song->year); flushSngIn(); break; case 3: if (songCount > 0) { int songIndex; printf("Enter the ID of the song to print (0 to %d): ", songCount - 1); scanf("%d", &songIndex); printSong(music, songIndex); flushSngIn(); break; } case 4: printf("Enter song name: "); fgets(songName_input, sizeof(songName_input), stdin); songName_input[strlen(songName_input) - 1] = '0'; flushSngIn(); editSong(music, songCount, songName_input); break; case 5: printf("Enter song name: "); fgets(songName_input, sizeof(songName_input), stdin); songName_input[strlen(songName_input) - 1] = '0'; flushSngIn(); deleteSongByName(music, songName_input, songCount);
- 6. songCount--; printRepository(music, songCount); break; case 6: printRepository(music, songCount); break; case 7: printf("Exiting the programn"); break; default: printf("Invalid choicen"); break; } } while (choice != 7); // Problem 2 // create some sample songs struct Song *s1 = createSong(1, "Shape of You", "Ed Sheeran", "Pop", 2017); struct Song *s2 = createSong(2, "Despacito", "Luis Fonsi", "Pop", 2017); struct Song *s3 = createSong(3, "Uptown Funk", "Mark Ronson ft. Bruno Mars", "Pop", 2014); // create the playlist and add the sample songs struct Song *playList = NULL; add_song(&playList, s1); add_song(&playList, s2); add_song(&playList, s3); // print the playlist printf("Initial Playlist:n"); printPlaylist(playList); // add a new song to the playlist struct Song *s4 = createSong(4, "Sorry", "Justin Bieber", "Pop", 2015); printf("nAdding new song to playlist:n"); add_song(&playList, s4); printPlaylist(playList); // delete a song from the playlist printf("nDeleting a song from the playlist:n"); struct Song *sToDelete = search_song(playList, "Despacito"); if (sToDelete != NULL) { delete_song(playList, sToDelete->name); printf("Playlist after deletion:n"); printPlaylist(playList); }
- 7. else { printf("Song not found in playlist.n"); } // search for a song that doesn't exist in the playlist printf("nSearching for a song that doesn't exist in the playlist:n"); struct Song *searchResult = search_song(playList, "Non-existent Song"); if (searchResult != NULL) { printf("Found song:n"); printf("Song ID: %d, Song Name: %s, Singer Name: %s, Genre: %s, Year: %d", searchResult->id, searchResult->name, searchResult->singer, searchResult->genre, searchResult->year); } else { printf("Song not found in playlist.n"); } // search for a song that exists in the playlist printf("nSearching for a song that exists in the playlist:n"); searchResult = search_song(playList, "Uptown Funk"); if (searchResult != NULL) { // printf("Found song:n"); // printSong(searchResult); } else { printf("Song not found in playlist.n"); } // edit a song in the playlist printf("nEditing a song in the playlist:n"); int editResult = edit_song(playList, "Shape of You", "Ed Sheeran", "Pop", 2018); if (editResult == -1) { printf("Song not found in playlist.n"); } else { printf("Playlist after edit:n"); printPlaylist(playList);