It's not working what am I doing wrong- Given main()- complete the Son.pdf
•
0 likes•6 views
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); } }.
Report
Share
Report
Share
Download to read offline
![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();](https://image.slidesharecdn.com/itsnotworkingwhatamidoingwrong-givenmain-completetheson-230315054722-47a80459/85/It-s-not-working-what-am-I-doing-wrong-Given-main-complete-the-Son-pdf-1-320.jpg)
Recommended
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
.
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;
}.
816 LAB Playlist output linked list C++ Given main .pdf
8.16 LAB: Playlist (output linked list) (C++)
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 <iostream>
#include "SongNode.h"
// TODO: Write PrintPlaylist() function
void PrintPlayList(SongNode* head){
SongNode *temp = head;
temp=temp->GetNext();
while(temp!=NULL){
temp->PrintSongInfo();
temp=temp->GetNext();
}
}
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
#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
#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 //
void SongNode::PrintSongInfo(){
cout<<"Title: "+ this->songTitle<<endl;
cout<<"Length: " + this->songLength<<endl;
cout<<"Artist: " + this->songArtist;
}.
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
}.
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.
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!.
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.
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.
Recommended
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
.
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;
}.
816 LAB Playlist output linked list C++ Given main .pdf
8.16 LAB: Playlist (output linked list) (C++)
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 <iostream>
#include "SongNode.h"
// TODO: Write PrintPlaylist() function
void PrintPlayList(SongNode* head){
SongNode *temp = head;
temp=temp->GetNext();
while(temp!=NULL){
temp->PrintSongInfo();
temp=temp->GetNext();
}
}
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
#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
#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 //
void SongNode::PrintSongInfo(){
cout<<"Title: "+ this->songTitle<<endl;
cout<<"Length: " + this->songLength<<endl;
cout<<"Artist: " + this->songArtist;
}.
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
}.
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.
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!.
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.
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.
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:.
Can someone please help me implement the addSong function .pdf
Can someone please help me implement the "addSong" function in the code below? Thank
you!
// You are given a partially completed program that creates a list of songs, like a music repository.
// Each song has this information: song's id, song's name, singer's name, genre of the song, and
its published year.
// The struct 'musicRepository' holds information of one song. Genre is enum type.
// An array of structs called 'list' is made to hold the list of songs.
// You should not modify any of the given code, the return types, or the parameters, you will risk of
getting compilation error.
// You are not allowed to modify main ().
// You can use string library functions.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#pragma warning(disable : 4996) // for Visual Studio Only
#define MAX_SONGS 20
#define MAX_SONG_NAME_LENGTH 40
#define MAX_SINGER_NAME_LENGTH 40
typedef enum
{
unclassified = 0,
Pop,
Rock,
Reggae,
Country,
Blues,
Balad,
} genreType; // enum type
struct musicRepository
{
// struct for song details
unsigned int ID;
char songName[MAX_SONG_NAME_LENGTH];
char singerName[MAX_SINGER_NAME_LENGTH];
genreType genre;
unsigned int year;
};
struct musicRepository list[MAX_SONGS]; // declare the list of songs
int numSongs = 0; // the number of songs currently stored in the list (initialized to 0)
// Given functions
void initializeRepository(struct musicRepository repo[], int size);
void printRepository(struct musicRepository repo[], int numSongs);
void flushSngIn();
// functions that need to be implemented by you
int addSong(struct musicRepository repo[], char* songName, char* singerName, char* genre,
unsigned int year, int numSongs);
struct musicRepository* searchSong(struct musicRepository repo[], char* songName, int
numSongs);
void printSong(struct musicRepository repo[], int ID);
int editSong(struct musicRepository* repo, int numSongs, char* songName);
int deleteSongByName(struct musicRepository* repo, char* songName, int numSongs);
// This function takes in an array of musicRepository structures and the size of the array as
parameters. It then loops through each index of the array and sets the values of id, year, genre,
name, and singer to their respective initial values.
// NOTE that strcpy is used to copy an empty string to name and singer, rather than setting them
equal to "". This is because arrays in C are not assignable, so the strcpy function must be used to
copy the empty string into the array.
void initializeRepository(struct musicRepository repo[], int size)
{
for (int i = 0; i < size; i++)
{
repo[i].ID = 0;
repo[i].year = 0;
repo[i].genre = 0;
strcpy(repo[i].songName, "");
strcpy(repo[i].singerName, "");
}
}
// This function takes in the musicRepository array and iterates through each element. If the ID of
the song is not 0, it prints the details of the song.
void printRepository(struct musicRepository repo[], int numSongs)
{
printf("n--- Song Repository ---n");
for (int i = 0; i < numSongs; i++)
{
if (repo[i].ID != 0)
.
Program 02 Based on the previous problem you should impleme.pdf
Program 02
Based on the previous problem, you should implement this second problem in the same file a05.c.
Find the places in the code marked with the ToDo label and complete the work. You should not
change any other part of the code. This includes do not add any global variables or any other
function. For this problem, we are reusing the same struct from problem 1, but adding a pointer to
the struct to be able to create a linked list. In this problem, you must use linked list to create a user
playlist (play_list).
The struct is holding the information of a song: ID, Name, Singer, Genre, Year, and the pointer
Next (the pointer to the struct).
There should be the following functions. In the similar way we have done in previous assignments,
complete the following functions:
Add a song to the play_list - always inserted at the end of the list. Search song by name - given
the name of the song, return the struct with the data of the song.
Edit a song - given the name of the song, find it in the play_list and modify any of the fields of the
song (ID cannot be edited, and all fields should have a valid value). Return -1 if the song was not
found.
Delete a song - given the name of the song, find it, delete the song from the play_list (i.e.,
disconnect the node from the list). Return -1 if the song was not found, 1 if it was deleted.
// Problem 2
// struct to hold information about a song
struct Song
{
int id;
char name[MAX_SONG_NAME_LENGTH];
char singer[MAX_SINGER_NAME_LENGTH];
genreType genre;
int year;
struct Song *next;
};
// Function declarations
struct Song *createSong(int id, char *name, char *singer, char *genre, int year);
void printPlaylist(struct Song *playlist);
void add_song(struct Song **playlist, struct Song *newSong);
struct Song *search_song(struct Song *playlist, char *name);
int edit_song(struct Song *playlist, char *name, char *singer, char *genre, int
year);
int delete_song(struct Song *playlist, char *name);
// function to create a new song
struct Song *createSong(int id, char *name, char *singer, char *genre, int year)
{
struct Song *newSong = (struct Song *)malloc(sizeof(struct Song));
newSong->id = id;
strcpy(newSong->name, name);
strcpy(newSong->singer, singer);
if (strcmp(genre, "Pop") == 0)
newSong->genre = 1;
else if (strcmp(genre, "Rock") == 0)
newSong->genre = 2;
else if (strcmp(genre, "Reggae") == 0)
newSong->genre = 3;
else if (strcmp(genre, "Country") == 0)
newSong->genre = 4;
else if (strcmp(genre, "Blues") == 0)
newSong->genre = 5;
else if (strcmp(genre, "Balad") == 0)
newSong->genre = 6;
else
newSong->genre = 0;
newSong->year = year;
newSong->next = NULL;
return newSong;
}
// function to print the playlist
void printPlaylist(struct Song *playlist)
{
struct Song *current = playlist;
while (current != NULL)
{
printf("%dt%st%st%dt%dn", current->id, current->name, current->singer,
current->genre, current->year);
current = current->next;
}
}
// function to add a song to the end of the playlist
void add_song(struct Song .
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.
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..
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.
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.
819 LAB Program Playlist c++ You will be building a li.pdf
8.19 LAB*: Program: Playlist (c++)
You will be building a linked list. Make sure to keep track of both the head and tail nodes.
(1) Create three files to submit.
PlaylistNode.h - Class declaration
PlaylistNode.cpp - Class definition
main.cpp - main() function
Build the PlaylistNode class per the following specifications. Note: Some functions can initially be
function stubs (empty functions), to be completed in later steps.
Default constructor (1 pt)
Parameterized constructor (1 pt)
Public member functions
InsertAfter() - Mutator (1 pt)
SetNext() - Mutator (1 pt)
GetID() - Accessor
GetSongName() - Accessor
GetArtistName() - Accessor
GetSongLength() - Accessor
GetNext() - Accessor
PrintPlaylistNode()
Private data members
string uniqueID - Initialized to "none" in default constructor
string songName - Initialized to "none" in default constructor
string artistName - Initialized to "none" in default constructor
int songLength - Initialized to 0 in default constructor
PlaylistNode* nextNodePtr - Initialized to 0 in default constructor
Ex. of PrintPlaylistNode output:
(2) In main(), prompt the user for the title of the playlist. (1 pt)
Ex:
(3) Implement the PrintMenu() function. PrintMenu() takes the playlist title as a parameter and
outputs a menu of options to manipulate the playlist. (1 pt)
Ex:
(4) Implement the ExecuteMenu() function that takes 3 parameters: a character representing the
user's choice, a playlist title, and the pointer to the head node of a playlist. ExecuteMenu()
performs the menu options (described below) according to the user's choice, and returns the
pointer to the head node of the playlist.(1 pt)
(5) In main(), call PrintMenu() and prompt for the user's choice of menu options. Each option is
represented by a single character.
If an invalid character is entered, continue to prompt for a valid choice. When a valid option is
entered, execute the option by calling ExecuteMenu() and overwrite the pointer to the head node
of the playlist with the returned pointer. Then, print the menu, and prompt for a new option.
Continue until the user enters 'q'. Hint: Implement Quit before implementing other options. (1 pt)
Ex:
(6) Implement "Output full playlist" menu option in ExecuteMenu(). If the list is empty, output:
Playlist is empty (3 pts)
Ex:
(7) Implement the "Add song" menu option in ExecuteMenu(). New additions are added to the end
of the list. (2 pts)
Ex:
(8) Implement the "Remove song" menu option in ExecuteMenu(). Prompt the user for the unique
ID of the song to be removed.(4 pts)
Ex:
(9) Implement the "Change position of song" menu option in ExecuteMenu(). Prompt the user for
the current position of the song and the desired new position. Valid new positions are 1 - n (the
number of nodes). If the user enters a new position that is less than 1, move the node to the
position 1 (the head). If the user enters a new position greater than n, move the node to position n
(the tail). 6 cases will be tested:
Moving the head node (1 pt)
.
In C++ please I need output please You will be building a .pdf
In C++ please I need output please
You will be building a linked list. Make sure to keep track of both the head and tail nodes.
(1) Create three files to submit.
PlaylistNode.h - Class declaration
PlaylistNode.cpp - Class definition
main.cpp - main() function
Build the PlaylistNode class per the following specifications. Note: Some functions can initially be
function stubs (empty functions), to be completed in later steps.
Default constructor (1 pt)
Parameterized constructor (1 pt)
Public member functions
InsertAfter() - Mutator (1 pt)
SetNext() - Mutator (1 pt)
GetID() - Accessor
GetSongName() - Accessor
GetArtistName() - Accessor
GetSongLength() - Accessor
GetNext() - Accessor
PrintPlaylistNode()
Private data members
string uniqueID - Initialized to "none" in default constructor
string songName - Initialized to "none" in default constructor
string artistName - Initialized to "none" in default constructor
int songLength - Initialized to 0 in default constructor
PlaylistNode* nextNodePtr - Initialized to 0 in default constructor
Ex. of PrintPlaylistNode output:
(2) In main(), prompt the user for the title of the playlist. (1 pt)
Ex:
(3) Implement the PrintMenu() function. PrintMenu() takes the playlist title as a parameter and
outputs a menu of options to manipulate the playlist. (1 pt)
Ex:
(4) Implement the ExecuteMenu() function that takes 3 parameters: a character representing the
user's choice, a playlist title, and the pointer to the head node of a playlist. ExecuteMenu()
performs the menu options (described below) according to the user's choice, and returns the
pointer to the head node of the playlist.(1 pt)
(5) In main(), call PrintMenu() and prompt for the user's choice of menu options. Each option is
represented by a single character.
If an invalid character is entered, continue to prompt for a valid choice. When a valid option is
entered, execute the option by calling ExecuteMenu() and overwrite the pointer to the head node
of the playlist with the returned pointer. Then, print the menu, and prompt for a new option.
Continue until the user enters 'q'. Hint: Implement Quit before implementing other options. (1 pt)
Ex:
(6) Implement "Output full playlist" menu option in ExecuteMenu(). If the list is empty, output:
Playlist is empty (3 pts)
Ex:
(7) Implement the "Add song" menu option in ExecuteMenu(). New additions are added to the end
of the list. (2 pts)
Ex:
(8) Implement the "Remove song" menu option in ExecuteMenu(). Prompt the user for the unique
ID of the song to be removed.(4 pts)
Ex:
(9) Implement the "Change position of song" menu option in ExecuteMenu(). Prompt the user for
the current position of the song and the desired new position. Valid new positions are 1 - n (the
number of nodes). If the user enters a new position that is less than 1, move the node to the
position 1 (the head). If the user enters a new position greater than n, move the node to position n
(the tail). 6 cases will be tested:
Moving the head node (1 pt)
.
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)
{
.
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.
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.
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.
PFB cpp code for the given problem#include iostream #include .pdf
PFB cpp code for the given problem
#include
#include
#include
#include
#include
#include
using namespace std;
string StringPadding(string original, int charCount )
{
original.resize( charCount, \' \' );
return original;
}
class Song
{
public :
string date;
int wk;
string song;
char Cat;
string artist;
Song(string d, int w, string s, char c, string a)
{
date = d;
wk = w;
song = s;
Cat = c;
artist = a;
}
};
int main()
{
//FILE *fp = freopen(\"input.txt\", \"r\", stdin);
ifstream fp;
char *fileName = \"input.txt\";
fp.open(fileName);
if( !fp )
{
cout<<\"\ input file not found \ \";
cout<<\"\ Press any key, and enter to terminate and exit the program\ \";
return 0;
}
int noLinesRead = 0;
string date=\"\", song=\"\", artist=\"\";
int wk;
char cat;
vector vec;
int maxSongLen = 0, maxArtistLen = 0;
while(fp){
fp >> date >> wk;
getline(fp, song);
if(song.length() > maxSongLen) maxSongLen = song.length();
fp >> cat;
getline(fp, artist);
if(artist.length() > maxArtistLen) maxArtistLen = artist.length();
Song sObj = Song(date, wk, song, cat, artist);
vec.push_back(sObj);
}
int maxLengthToBePadded = maxArtistLen + maxSongLen + 17;
string strForEqualSign(\'=\', maxLengthToBePadded);
string strForMinusSign(\'-\', maxLengthToBePadded);
int totalSongs = vec.size();
int femaleArtist = 0;
int maleArtist = 0;
int groupArtist = 0;
float avgWeeks = 0;
int totWeeks = 0;
/* cout << right << StringPadding(\"Date\", 6)
<< StringPadding(\"Week\", 5)
<< StringPadding(\"Song\", maxSongLen+1)
<< StringPadding(\"Cat\", 4)
<< StringPadding(\"Artist\", maxArtistLen)
<< endl; */
cout << setw(5) << right << \"Date\"
<< setw(5) << right << \"Week\"
<< setw(maxSongLen/2) << right << \"Song\"
<< setw(maxSongLen/2 + 1) << right << \" \"
<< setw(4) << right << \"Cat\"
<< setw(maxArtistLen/2) << right << \"Artist\"
<< endl;
cout << strForEqualSign << endl;
for(int i=0; i
Solution
PFB cpp code for the given problem
#include
#include
#include
#include
#include
#include
using namespace std;
string StringPadding(string original, int charCount )
{
original.resize( charCount, \' \' );
return original;
}
class Song
{
public :
string date;
int wk;
string song;
char Cat;
string artist;
Song(string d, int w, string s, char c, string a)
{
date = d;
wk = w;
song = s;
Cat = c;
artist = a;
}
};
int main()
{
//FILE *fp = freopen(\"input.txt\", \"r\", stdin);
ifstream fp;
char *fileName = \"input.txt\";
fp.open(fileName);
if( !fp )
{
cout<<\"\ input file not found \ \";
cout<<\"\ Press any key, and enter to terminate and exit the program\ \";
return 0;
}
int noLinesRead = 0;
string date=\"\", song=\"\", artist=\"\";
int wk;
char cat;
vector vec;
int maxSongLen = 0, maxArtistLen = 0;
while(fp){
fp >> date >> wk;
getline(fp, song);
if(song.length() > maxSongLen) maxSongLen = song.length();
fp >> cat;
getline(fp, artist);
if(artist.length() > maxArtistLen) maxArtistLen = artist.length();
Song sObj = Song(date, wk, song, cat, artist);
vec.push_back(sObj);
}
int maxLengthToBePadded = maxArtistLen + max.
Hi,Please find the Ansswer below.PLAYLIST.h#include iostrea.pdf
Hi,
Please find the Ansswer below.
//PLAYLIST.h
#include
#include
#include
#include
using namespace std;
class Playlist
{
private:
string uniqueID;
string songName;
string artistName;
int songLength;
public:
Playlist() { uniqueID = \"\", songName = \"\", artistName = \"\", songLength = 0; };
Playlist(string auniqueId, string asongName, string aArtistName, int aSongLength);
void InsertAfter();
void SetNext();
string GetID();
string GetSongName();
string GetArtistName();
int GetSongLength();
string GetNext();
void PrintPlaylistNode();
};
//PLAYLIST.CPP
#include \"Playlist.h\"
Playlist::Playlist(string auniqueId, string asongName, string aArtistName, int aSongLength)
{
uniqueID = auniqueId;
songName = asongName;
artistName = aArtistName;
songLength = aSongLength;
}
string Playlist::GetArtistName()
{
return artistName;
}
string Playlist::GetID()
{
return uniqueID;
}
string Playlist::GetSongName()
{
return songName;
}
int Playlist::GetSongLength()
{
return songLength;
}
void Playlist::SetNext()
{
}
string Playlist::GetNext()
{
return \"\";
}
void Playlist::InsertAfter() {
}
void Playlist::PrintPlaylistNode()
{
cout << \"Unique ID:\" << uniqueID << endl ;
cout << \"Song Name:\" << songName << endl;
cout << \"Artist Name:\" << artistName << endl;
cout << \"Song Length (in seconds):\" << songLength << endl;
}
//PLAYSLITSNODE.h
#pragma once
#include \"Playlist.h\"
#include
class PlaylistNode
{
private:
std::list library;
Playlist get(list _list, int _i);
void PrintPlaylist(Playlist aPlayList);
public:
void Addsong(Playlist aPlayslist);
void Removesong(string aUnwiid);
void Changeposition(int oldPostion, int anewPostion);
void PrintSongByartist(string aAstist);
void PrintSongtotalLen();
void PrintFullPlayList();
};
//PLAYLIST.CPP
#include \"PlaylistNode.h\"
void PlaylistNode::Addsong(Playlist aPlaylist)
{
library.push_back(aPlaylist);
}
void PlaylistNode::Removesong(string aUnwiid)
{
if (library.size > 0)
{
for (it = library.begin(); it != library.end(); ++it)
{
if (it->GetID() == aUnwiid)
{
cout << it->GetSongName() << endl;
library.remove(*it);
break;
}
}
}
}
Playlist PlaylistNode::get(list _list, int _i) {
list::iterator it = _list.begin();
for (int i = 0; i<_i; i++) {
++it;
}
return *it;
}
std::list::iterator it;
void PlaylistNode::PrintFullPlayList()
{
for (it = library.begin(); it != library.end(); ++it)
{
PrintPlaylist(*it);
}
}
void PlaylistNode::PrintSongByartist(string aartiename)
{
for (it = library.begin(); it != library.end(); ++it)
{
if(it->GetArtistName() == aartiename)
PrintPlaylist(*it);
}
}
void PlaylistNode::PrintSongtotalLen()
{
int TotalSonglengst = 0;
for (it = library.begin(); it != library.end(); ++it)
{
TotalSonglengst += it->GetSongLength();
}
cout << \"Total songs Length (in seconds):\" << TotalSonglengst << endl;
}
void PlaylistNode::PrintPlaylist(Playlist aPlayList)
{
cout << \"Unique ID:\" << aPlayList.GetID() << endl;
cout << \"Song Name:\" << aPlayList.GetSongName() << endl;
cout << \"Artist Name:\" << aPlayList.GetArtis.
I am having the below compile errors. .pdf
I am having the below compile errors.
*****************************************************************************
******
1>------ Build started: Project: playlist, Configuration: Debug Win32 ------
1> Playlist.cpp
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(74): error
C3867: \'std::list>::size\': non-standard syntax; use \'&\' to create a pointer to member
1> with
1> [
1> _Ty=Playlist
1> ]
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(74): error
C2296: \'>\': illegal, left operand has type \'unsigned int (__thiscall std::list>::* )(void) noexcept
const\'
1> with
1> [
1> _Ty=Playlist
1> ]
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(74): error
C2297: \'>\': illegal, right operand has type \'unsigned int (__thiscall std::list>::* )(void) noexcept
const\'
1> with
1> [
1> _Ty=Playlist
1> ]
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(76): error
C2065: \'it\': undeclared identifier
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(78): error
C2065: \'it\': undeclared identifier
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(78): error
C2227: left of \'->GetID\' must point to class/struct/union/generic type
1> c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(78): note:
type is \'unknown-type\'
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(80): error
C2065: \'it\': undeclared identifier
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(80): error
C2227: left of \'->GetSongName\' must point to class/struct/union/generic type
1> c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(80): note:
type is \'unknown-type\'
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(81): error
C2065: \'it\': undeclared identifier
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(144):
error C3867: \'std::list>::size\': non-standard syntax; use \'&\' to create a pointer to member
1> with
1> [
1> _Ty=Playlist
1> ]
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(144):
error C2446: \'<=\': no conversion from \'unsigned int (__thiscall std::list>::* )(void) noexcept
const\' to \'int\'
1> with
1> [
1> _Ty=Playlist
1> ]
1> c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(144):
note: There is no context in which this conversion is possible
========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ==========
****************************************************************
I have three files:
Main.cpp
#include
#include \"Playlist.h\"
using namespace std;
int main()
{
int choice;
string.
BeepComp - Chiptune Creator - User's Guide (v0.2.2)
User's manual for BeepComp Chiptune Creator software for windows. This document is for version 0.2.2. http://hiromorozumi.com/beepcomp
For this homework, you will write a program to create and manipulate.pdf
For this homework, you will write a program to create and manipulate a simple linked list. For
each node in the linked list you will generate a random number, create a node that holds that
number, and insert that node into its sorted position in the linked list. Once the nodes are
inserted, you will traverse the list, printing the value held in each node. Then you will clean up
the list (deleting all the nodes) and exit the program. You will also learn about a tool that you can
use to help you check for memory errors in your code.
Specifications:
Define a struct appropriate for holding a random integer. This struct will also contain a \"next\"
pointer to reference a separate instance of the struct.
You may use the typedef keyword to give your struct a separate typename if you wish, but this is
not a requirement.
The program will read command line arguments. The first argument is the program name (as it
will always be) followed by a random number seed, the number of random numbers to generate
and ending with the Maximum Possible Value of the Random numbers generated (i.e. argc
should be 4).
Your program will use a \"dummy node\" for the linked list. In other words, the head of the list
will be an actual node, but the data field in that node will not be used for sorting purposes.
Your program must contain the following functions:
main() (for obvious reasons)
insertNodeSorted() - You may implement this either of two ways.
One way is to use the head of the list as one parameter and the integer value as the second. The
function will allocate memory for the node, initialize it and then insert it in the proper location in
the list.
The other way is to pass the head of the list as one parameter and a previously allocated and
initialized node as the other. The existing node is inserted in the proper location in the list.
printList() - Takes the head of the list as its only parameter, traverses the list, printing out the
data in sorted order.
deleteList() - Takes the head of the list as its only parameter, traverses the list, deleting all nodes.
The basic algorithm of your program is
Use a loop (based upon command line input values) that:
Generates a random number
Prints the number to stdout
Creates a node that contains that random number
Inserts the new node in sorted order into the existing list
Print the sorted linked list
Delete the linked list
You will use a Makefile to compile your program
Solution
#include
#include
#include
struct test_struct
{
int val;
struct test_struct *next;
};
struct test_struct *head = NULL;
struct test_struct *curr = NULL;
struct test_struct* create_list(int val)
{
printf(\"\ creating list with headnode as [%d]\ \",val);
struct test_struct *ptr = (struct test_struct*)malloc(sizeof(struct test_struct));
if(NULL == ptr)
{
printf(\"\ Node creation failed \ \");
return NULL;
}
ptr->val = val;
ptr->next = NULL;
head = curr = ptr;
return ptr;
}
struct test_struct* add_to_list(int val, bool add_to_end)
{
if(NULL == head)
{
retur.
a) Complete both insert and delete methods. If it works correctly 10.pdf
a) Complete both insert and delete methods. If it works correctly 100 points each.
b) Do not call the search method in delete method.
c) Make sure to write your name in main method.
d) DO NOT MODIFY PROCESS METHOD.
3- Create a proper input file with respect to process method to test all cases in both
insert and delete methods.
4- Compile and execute your program at the command prompt. Check your output, if it
is correct
//xxxxxH5.java is linked list implementation of lstinterface.
//Eliminate count form both insert and delete methods
// If works correctly, 200 points
import java.util.*;
import java.io.*;
//lstinterface is an interface
public class xxxxxH5 implements lstinterface {
// xxxxxH5 class variables
//head is a pointer to beginning of linked list
private node head = null;
//use prt for System.out to save typing
PrintStream prt = System.out;
// class node
private class node{
// class node variables
int data;
node rlink; //right link
// class node constructor
node(int x){
data = x;
rlink = null;
} // end class node constructor
}// class node
// insert x at position p,
// if successful return 1 otherwise return 0
public int insert(int x, int p){
prt.printf("\n\t\tInsert %5d at position %2d:", x, p);
// complete this method
return 0; // successful insertion
} // end insert
// delete x at position p
// if successful return 1 otherwise return 0
public int delete(int p){
prt.printf("\n\t\tDelete element at position %2d:", p);
// complete this method
return 0; // successful insertion
} // end delete
// sequential serach for x in the list
// if successful return its position otherwise return 0;
public int search(int x){
// Local variables
node cur;
prt.printf("\n\t\tSearch for %5d:", x);
// Complete the rest of the method
int pos = 0;
for (cur = head; cur != null ; cur = cur.rlink){
pos ++;
if (cur.data == x){
prt.printf(" Found at position %2d, ", pos);
return pos;
} // end if
} // end for
prt.printf(" Not Found.");
return 0; // x is not found.
} // end search
// print list elements formatted
public void printlst() {
// Local variables
node cur;
prt.printf("\n\tList contents: ");
for (cur = head; cur != null ; cur = cur.rlink)
prt.printf("%5d,", cur.data);
// end for
} // end printlst
// insert delete and search in the list
private void process(String fn){
// Local variables
int j, ins, del, srch, k, p;
int x;
prt.printf("\tLinked List implementation of int list without"+
//\n\tusing count, gets input file name from method argument, then
reads:"+
"\n\tinteger No. of elements to insert(ins)"+
" followed by elements to insert and their positions,"+
"\n\tinteger No. of elements to search(srch) followed by element to
search"+
"\n\tinteger No. of elements to delete(del) followed by position of"+
"elements to delete" +
"\n\t\tTo compile: javac xxxxxH5.java" +
"\n\t\tTo execute: java xxxxxH5 inputfilename");
try{
// open input file
Scanner inf = new Scanner(new File(fn));
//read no. of elements to insert
ins = inf.nextInt();
prt.printf("\n\tInsert %.
Jamal has red hair- Since the gene for red hair is recessive- Jamal mu.pdf
Jamal has red hair. Since the gene for red hair is recessive, Jamal must be __________ for that
trait.
critical
homozygous
heterozygous
a carrier
A. critical
B. homozygous
C. heterozygous
D. a carrier.
Jake stole a suspension of Bacillus anthracis with a known concentrati.pdf
Jake stole a suspension of Bacillus anthracis with a known concentration of 7 x 107 spores/mL.
He wants to dilute this cell suspension down to 2 x 103 spores/mL. Calculate his dilution factor.
Design and draw a practical dilution scheme which limits the volumes used to greater than or
equal to 0.1 mL and less than or equal to 10 mL. (hint: use one-step and serial dilutions together
to satisfy the given volume restrictions).
More Related Content
Similar to It's not working what am I doing wrong- Given main()- complete the Son.pdf
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:.
Can someone please help me implement the addSong function .pdf
Can someone please help me implement the "addSong" function in the code below? Thank
you!
// You are given a partially completed program that creates a list of songs, like a music repository.
// Each song has this information: song's id, song's name, singer's name, genre of the song, and
its published year.
// The struct 'musicRepository' holds information of one song. Genre is enum type.
// An array of structs called 'list' is made to hold the list of songs.
// You should not modify any of the given code, the return types, or the parameters, you will risk of
getting compilation error.
// You are not allowed to modify main ().
// You can use string library functions.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#pragma warning(disable : 4996) // for Visual Studio Only
#define MAX_SONGS 20
#define MAX_SONG_NAME_LENGTH 40
#define MAX_SINGER_NAME_LENGTH 40
typedef enum
{
unclassified = 0,
Pop,
Rock,
Reggae,
Country,
Blues,
Balad,
} genreType; // enum type
struct musicRepository
{
// struct for song details
unsigned int ID;
char songName[MAX_SONG_NAME_LENGTH];
char singerName[MAX_SINGER_NAME_LENGTH];
genreType genre;
unsigned int year;
};
struct musicRepository list[MAX_SONGS]; // declare the list of songs
int numSongs = 0; // the number of songs currently stored in the list (initialized to 0)
// Given functions
void initializeRepository(struct musicRepository repo[], int size);
void printRepository(struct musicRepository repo[], int numSongs);
void flushSngIn();
// functions that need to be implemented by you
int addSong(struct musicRepository repo[], char* songName, char* singerName, char* genre,
unsigned int year, int numSongs);
struct musicRepository* searchSong(struct musicRepository repo[], char* songName, int
numSongs);
void printSong(struct musicRepository repo[], int ID);
int editSong(struct musicRepository* repo, int numSongs, char* songName);
int deleteSongByName(struct musicRepository* repo, char* songName, int numSongs);
// This function takes in an array of musicRepository structures and the size of the array as
parameters. It then loops through each index of the array and sets the values of id, year, genre,
name, and singer to their respective initial values.
// NOTE that strcpy is used to copy an empty string to name and singer, rather than setting them
equal to "". This is because arrays in C are not assignable, so the strcpy function must be used to
copy the empty string into the array.
void initializeRepository(struct musicRepository repo[], int size)
{
for (int i = 0; i < size; i++)
{
repo[i].ID = 0;
repo[i].year = 0;
repo[i].genre = 0;
strcpy(repo[i].songName, "");
strcpy(repo[i].singerName, "");
}
}
// This function takes in the musicRepository array and iterates through each element. If the ID of
the song is not 0, it prints the details of the song.
void printRepository(struct musicRepository repo[], int numSongs)
{
printf("n--- Song Repository ---n");
for (int i = 0; i < numSongs; i++)
{
if (repo[i].ID != 0)
.
Program 02 Based on the previous problem you should impleme.pdf
Program 02
Based on the previous problem, you should implement this second problem in the same file a05.c.
Find the places in the code marked with the ToDo label and complete the work. You should not
change any other part of the code. This includes do not add any global variables or any other
function. For this problem, we are reusing the same struct from problem 1, but adding a pointer to
the struct to be able to create a linked list. In this problem, you must use linked list to create a user
playlist (play_list).
The struct is holding the information of a song: ID, Name, Singer, Genre, Year, and the pointer
Next (the pointer to the struct).
There should be the following functions. In the similar way we have done in previous assignments,
complete the following functions:
Add a song to the play_list - always inserted at the end of the list. Search song by name - given
the name of the song, return the struct with the data of the song.
Edit a song - given the name of the song, find it in the play_list and modify any of the fields of the
song (ID cannot be edited, and all fields should have a valid value). Return -1 if the song was not
found.
Delete a song - given the name of the song, find it, delete the song from the play_list (i.e.,
disconnect the node from the list). Return -1 if the song was not found, 1 if it was deleted.
// Problem 2
// struct to hold information about a song
struct Song
{
int id;
char name[MAX_SONG_NAME_LENGTH];
char singer[MAX_SINGER_NAME_LENGTH];
genreType genre;
int year;
struct Song *next;
};
// Function declarations
struct Song *createSong(int id, char *name, char *singer, char *genre, int year);
void printPlaylist(struct Song *playlist);
void add_song(struct Song **playlist, struct Song *newSong);
struct Song *search_song(struct Song *playlist, char *name);
int edit_song(struct Song *playlist, char *name, char *singer, char *genre, int
year);
int delete_song(struct Song *playlist, char *name);
// function to create a new song
struct Song *createSong(int id, char *name, char *singer, char *genre, int year)
{
struct Song *newSong = (struct Song *)malloc(sizeof(struct Song));
newSong->id = id;
strcpy(newSong->name, name);
strcpy(newSong->singer, singer);
if (strcmp(genre, "Pop") == 0)
newSong->genre = 1;
else if (strcmp(genre, "Rock") == 0)
newSong->genre = 2;
else if (strcmp(genre, "Reggae") == 0)
newSong->genre = 3;
else if (strcmp(genre, "Country") == 0)
newSong->genre = 4;
else if (strcmp(genre, "Blues") == 0)
newSong->genre = 5;
else if (strcmp(genre, "Balad") == 0)
newSong->genre = 6;
else
newSong->genre = 0;
newSong->year = year;
newSong->next = NULL;
return newSong;
}
// function to print the playlist
void printPlaylist(struct Song *playlist)
{
struct Song *current = playlist;
while (current != NULL)
{
printf("%dt%st%st%dt%dn", current->id, current->name, current->singer,
current->genre, current->year);
current = current->next;
}
}
// function to add a song to the end of the playlist
void add_song(struct Song .
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.
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..
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.
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.
819 LAB Program Playlist c++ You will be building a li.pdf
8.19 LAB*: Program: Playlist (c++)
You will be building a linked list. Make sure to keep track of both the head and tail nodes.
(1) Create three files to submit.
PlaylistNode.h - Class declaration
PlaylistNode.cpp - Class definition
main.cpp - main() function
Build the PlaylistNode class per the following specifications. Note: Some functions can initially be
function stubs (empty functions), to be completed in later steps.
Default constructor (1 pt)
Parameterized constructor (1 pt)
Public member functions
InsertAfter() - Mutator (1 pt)
SetNext() - Mutator (1 pt)
GetID() - Accessor
GetSongName() - Accessor
GetArtistName() - Accessor
GetSongLength() - Accessor
GetNext() - Accessor
PrintPlaylistNode()
Private data members
string uniqueID - Initialized to "none" in default constructor
string songName - Initialized to "none" in default constructor
string artistName - Initialized to "none" in default constructor
int songLength - Initialized to 0 in default constructor
PlaylistNode* nextNodePtr - Initialized to 0 in default constructor
Ex. of PrintPlaylistNode output:
(2) In main(), prompt the user for the title of the playlist. (1 pt)
Ex:
(3) Implement the PrintMenu() function. PrintMenu() takes the playlist title as a parameter and
outputs a menu of options to manipulate the playlist. (1 pt)
Ex:
(4) Implement the ExecuteMenu() function that takes 3 parameters: a character representing the
user's choice, a playlist title, and the pointer to the head node of a playlist. ExecuteMenu()
performs the menu options (described below) according to the user's choice, and returns the
pointer to the head node of the playlist.(1 pt)
(5) In main(), call PrintMenu() and prompt for the user's choice of menu options. Each option is
represented by a single character.
If an invalid character is entered, continue to prompt for a valid choice. When a valid option is
entered, execute the option by calling ExecuteMenu() and overwrite the pointer to the head node
of the playlist with the returned pointer. Then, print the menu, and prompt for a new option.
Continue until the user enters 'q'. Hint: Implement Quit before implementing other options. (1 pt)
Ex:
(6) Implement "Output full playlist" menu option in ExecuteMenu(). If the list is empty, output:
Playlist is empty (3 pts)
Ex:
(7) Implement the "Add song" menu option in ExecuteMenu(). New additions are added to the end
of the list. (2 pts)
Ex:
(8) Implement the "Remove song" menu option in ExecuteMenu(). Prompt the user for the unique
ID of the song to be removed.(4 pts)
Ex:
(9) Implement the "Change position of song" menu option in ExecuteMenu(). Prompt the user for
the current position of the song and the desired new position. Valid new positions are 1 - n (the
number of nodes). If the user enters a new position that is less than 1, move the node to the
position 1 (the head). If the user enters a new position greater than n, move the node to position n
(the tail). 6 cases will be tested:
Moving the head node (1 pt)
.
In C++ please I need output please You will be building a .pdf
In C++ please I need output please
You will be building a linked list. Make sure to keep track of both the head and tail nodes.
(1) Create three files to submit.
PlaylistNode.h - Class declaration
PlaylistNode.cpp - Class definition
main.cpp - main() function
Build the PlaylistNode class per the following specifications. Note: Some functions can initially be
function stubs (empty functions), to be completed in later steps.
Default constructor (1 pt)
Parameterized constructor (1 pt)
Public member functions
InsertAfter() - Mutator (1 pt)
SetNext() - Mutator (1 pt)
GetID() - Accessor
GetSongName() - Accessor
GetArtistName() - Accessor
GetSongLength() - Accessor
GetNext() - Accessor
PrintPlaylistNode()
Private data members
string uniqueID - Initialized to "none" in default constructor
string songName - Initialized to "none" in default constructor
string artistName - Initialized to "none" in default constructor
int songLength - Initialized to 0 in default constructor
PlaylistNode* nextNodePtr - Initialized to 0 in default constructor
Ex. of PrintPlaylistNode output:
(2) In main(), prompt the user for the title of the playlist. (1 pt)
Ex:
(3) Implement the PrintMenu() function. PrintMenu() takes the playlist title as a parameter and
outputs a menu of options to manipulate the playlist. (1 pt)
Ex:
(4) Implement the ExecuteMenu() function that takes 3 parameters: a character representing the
user's choice, a playlist title, and the pointer to the head node of a playlist. ExecuteMenu()
performs the menu options (described below) according to the user's choice, and returns the
pointer to the head node of the playlist.(1 pt)
(5) In main(), call PrintMenu() and prompt for the user's choice of menu options. Each option is
represented by a single character.
If an invalid character is entered, continue to prompt for a valid choice. When a valid option is
entered, execute the option by calling ExecuteMenu() and overwrite the pointer to the head node
of the playlist with the returned pointer. Then, print the menu, and prompt for a new option.
Continue until the user enters 'q'. Hint: Implement Quit before implementing other options. (1 pt)
Ex:
(6) Implement "Output full playlist" menu option in ExecuteMenu(). If the list is empty, output:
Playlist is empty (3 pts)
Ex:
(7) Implement the "Add song" menu option in ExecuteMenu(). New additions are added to the end
of the list. (2 pts)
Ex:
(8) Implement the "Remove song" menu option in ExecuteMenu(). Prompt the user for the unique
ID of the song to be removed.(4 pts)
Ex:
(9) Implement the "Change position of song" menu option in ExecuteMenu(). Prompt the user for
the current position of the song and the desired new position. Valid new positions are 1 - n (the
number of nodes). If the user enters a new position that is less than 1, move the node to the
position 1 (the head). If the user enters a new position greater than n, move the node to position n
(the tail). 6 cases will be tested:
Moving the head node (1 pt)
.
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)
{
.
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.
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.
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.
PFB cpp code for the given problem#include iostream #include .pdf
PFB cpp code for the given problem
#include
#include
#include
#include
#include
#include
using namespace std;
string StringPadding(string original, int charCount )
{
original.resize( charCount, \' \' );
return original;
}
class Song
{
public :
string date;
int wk;
string song;
char Cat;
string artist;
Song(string d, int w, string s, char c, string a)
{
date = d;
wk = w;
song = s;
Cat = c;
artist = a;
}
};
int main()
{
//FILE *fp = freopen(\"input.txt\", \"r\", stdin);
ifstream fp;
char *fileName = \"input.txt\";
fp.open(fileName);
if( !fp )
{
cout<<\"\ input file not found \ \";
cout<<\"\ Press any key, and enter to terminate and exit the program\ \";
return 0;
}
int noLinesRead = 0;
string date=\"\", song=\"\", artist=\"\";
int wk;
char cat;
vector vec;
int maxSongLen = 0, maxArtistLen = 0;
while(fp){
fp >> date >> wk;
getline(fp, song);
if(song.length() > maxSongLen) maxSongLen = song.length();
fp >> cat;
getline(fp, artist);
if(artist.length() > maxArtistLen) maxArtistLen = artist.length();
Song sObj = Song(date, wk, song, cat, artist);
vec.push_back(sObj);
}
int maxLengthToBePadded = maxArtistLen + maxSongLen + 17;
string strForEqualSign(\'=\', maxLengthToBePadded);
string strForMinusSign(\'-\', maxLengthToBePadded);
int totalSongs = vec.size();
int femaleArtist = 0;
int maleArtist = 0;
int groupArtist = 0;
float avgWeeks = 0;
int totWeeks = 0;
/* cout << right << StringPadding(\"Date\", 6)
<< StringPadding(\"Week\", 5)
<< StringPadding(\"Song\", maxSongLen+1)
<< StringPadding(\"Cat\", 4)
<< StringPadding(\"Artist\", maxArtistLen)
<< endl; */
cout << setw(5) << right << \"Date\"
<< setw(5) << right << \"Week\"
<< setw(maxSongLen/2) << right << \"Song\"
<< setw(maxSongLen/2 + 1) << right << \" \"
<< setw(4) << right << \"Cat\"
<< setw(maxArtistLen/2) << right << \"Artist\"
<< endl;
cout << strForEqualSign << endl;
for(int i=0; i
Solution
PFB cpp code for the given problem
#include
#include
#include
#include
#include
#include
using namespace std;
string StringPadding(string original, int charCount )
{
original.resize( charCount, \' \' );
return original;
}
class Song
{
public :
string date;
int wk;
string song;
char Cat;
string artist;
Song(string d, int w, string s, char c, string a)
{
date = d;
wk = w;
song = s;
Cat = c;
artist = a;
}
};
int main()
{
//FILE *fp = freopen(\"input.txt\", \"r\", stdin);
ifstream fp;
char *fileName = \"input.txt\";
fp.open(fileName);
if( !fp )
{
cout<<\"\ input file not found \ \";
cout<<\"\ Press any key, and enter to terminate and exit the program\ \";
return 0;
}
int noLinesRead = 0;
string date=\"\", song=\"\", artist=\"\";
int wk;
char cat;
vector vec;
int maxSongLen = 0, maxArtistLen = 0;
while(fp){
fp >> date >> wk;
getline(fp, song);
if(song.length() > maxSongLen) maxSongLen = song.length();
fp >> cat;
getline(fp, artist);
if(artist.length() > maxArtistLen) maxArtistLen = artist.length();
Song sObj = Song(date, wk, song, cat, artist);
vec.push_back(sObj);
}
int maxLengthToBePadded = maxArtistLen + max.
Hi,Please find the Ansswer below.PLAYLIST.h#include iostrea.pdf
Hi,
Please find the Ansswer below.
//PLAYLIST.h
#include
#include
#include
#include
using namespace std;
class Playlist
{
private:
string uniqueID;
string songName;
string artistName;
int songLength;
public:
Playlist() { uniqueID = \"\", songName = \"\", artistName = \"\", songLength = 0; };
Playlist(string auniqueId, string asongName, string aArtistName, int aSongLength);
void InsertAfter();
void SetNext();
string GetID();
string GetSongName();
string GetArtistName();
int GetSongLength();
string GetNext();
void PrintPlaylistNode();
};
//PLAYLIST.CPP
#include \"Playlist.h\"
Playlist::Playlist(string auniqueId, string asongName, string aArtistName, int aSongLength)
{
uniqueID = auniqueId;
songName = asongName;
artistName = aArtistName;
songLength = aSongLength;
}
string Playlist::GetArtistName()
{
return artistName;
}
string Playlist::GetID()
{
return uniqueID;
}
string Playlist::GetSongName()
{
return songName;
}
int Playlist::GetSongLength()
{
return songLength;
}
void Playlist::SetNext()
{
}
string Playlist::GetNext()
{
return \"\";
}
void Playlist::InsertAfter() {
}
void Playlist::PrintPlaylistNode()
{
cout << \"Unique ID:\" << uniqueID << endl ;
cout << \"Song Name:\" << songName << endl;
cout << \"Artist Name:\" << artistName << endl;
cout << \"Song Length (in seconds):\" << songLength << endl;
}
//PLAYSLITSNODE.h
#pragma once
#include \"Playlist.h\"
#include
class PlaylistNode
{
private:
std::list library;
Playlist get(list _list, int _i);
void PrintPlaylist(Playlist aPlayList);
public:
void Addsong(Playlist aPlayslist);
void Removesong(string aUnwiid);
void Changeposition(int oldPostion, int anewPostion);
void PrintSongByartist(string aAstist);
void PrintSongtotalLen();
void PrintFullPlayList();
};
//PLAYLIST.CPP
#include \"PlaylistNode.h\"
void PlaylistNode::Addsong(Playlist aPlaylist)
{
library.push_back(aPlaylist);
}
void PlaylistNode::Removesong(string aUnwiid)
{
if (library.size > 0)
{
for (it = library.begin(); it != library.end(); ++it)
{
if (it->GetID() == aUnwiid)
{
cout << it->GetSongName() << endl;
library.remove(*it);
break;
}
}
}
}
Playlist PlaylistNode::get(list _list, int _i) {
list::iterator it = _list.begin();
for (int i = 0; i<_i; i++) {
++it;
}
return *it;
}
std::list::iterator it;
void PlaylistNode::PrintFullPlayList()
{
for (it = library.begin(); it != library.end(); ++it)
{
PrintPlaylist(*it);
}
}
void PlaylistNode::PrintSongByartist(string aartiename)
{
for (it = library.begin(); it != library.end(); ++it)
{
if(it->GetArtistName() == aartiename)
PrintPlaylist(*it);
}
}
void PlaylistNode::PrintSongtotalLen()
{
int TotalSonglengst = 0;
for (it = library.begin(); it != library.end(); ++it)
{
TotalSonglengst += it->GetSongLength();
}
cout << \"Total songs Length (in seconds):\" << TotalSonglengst << endl;
}
void PlaylistNode::PrintPlaylist(Playlist aPlayList)
{
cout << \"Unique ID:\" << aPlayList.GetID() << endl;
cout << \"Song Name:\" << aPlayList.GetSongName() << endl;
cout << \"Artist Name:\" << aPlayList.GetArtis.
I am having the below compile errors. .pdf
I am having the below compile errors.
*****************************************************************************
******
1>------ Build started: Project: playlist, Configuration: Debug Win32 ------
1> Playlist.cpp
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(74): error
C3867: \'std::list>::size\': non-standard syntax; use \'&\' to create a pointer to member
1> with
1> [
1> _Ty=Playlist
1> ]
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(74): error
C2296: \'>\': illegal, left operand has type \'unsigned int (__thiscall std::list>::* )(void) noexcept
const\'
1> with
1> [
1> _Ty=Playlist
1> ]
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(74): error
C2297: \'>\': illegal, right operand has type \'unsigned int (__thiscall std::list>::* )(void) noexcept
const\'
1> with
1> [
1> _Ty=Playlist
1> ]
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(76): error
C2065: \'it\': undeclared identifier
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(78): error
C2065: \'it\': undeclared identifier
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(78): error
C2227: left of \'->GetID\' must point to class/struct/union/generic type
1> c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(78): note:
type is \'unknown-type\'
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(80): error
C2065: \'it\': undeclared identifier
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(80): error
C2227: left of \'->GetSongName\' must point to class/struct/union/generic type
1> c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(80): note:
type is \'unknown-type\'
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(81): error
C2065: \'it\': undeclared identifier
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(144):
error C3867: \'std::list>::size\': non-standard syntax; use \'&\' to create a pointer to member
1> with
1> [
1> _Ty=Playlist
1> ]
1>c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(144):
error C2446: \'<=\': no conversion from \'unsigned int (__thiscall std::list>::* )(void) noexcept
const\' to \'int\'
1> with
1> [
1> _Ty=Playlist
1> ]
1> c:\\users\ rg\\documents\\visual studio 2015\\projects\\playlist\\playlist\\playlist.cpp(144):
note: There is no context in which this conversion is possible
========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ==========
****************************************************************
I have three files:
Main.cpp
#include
#include \"Playlist.h\"
using namespace std;
int main()
{
int choice;
string.
BeepComp - Chiptune Creator - User's Guide (v0.2.2)
User's manual for BeepComp Chiptune Creator software for windows. This document is for version 0.2.2. http://hiromorozumi.com/beepcomp
For this homework, you will write a program to create and manipulate.pdf
For this homework, you will write a program to create and manipulate a simple linked list. For
each node in the linked list you will generate a random number, create a node that holds that
number, and insert that node into its sorted position in the linked list. Once the nodes are
inserted, you will traverse the list, printing the value held in each node. Then you will clean up
the list (deleting all the nodes) and exit the program. You will also learn about a tool that you can
use to help you check for memory errors in your code.
Specifications:
Define a struct appropriate for holding a random integer. This struct will also contain a \"next\"
pointer to reference a separate instance of the struct.
You may use the typedef keyword to give your struct a separate typename if you wish, but this is
not a requirement.
The program will read command line arguments. The first argument is the program name (as it
will always be) followed by a random number seed, the number of random numbers to generate
and ending with the Maximum Possible Value of the Random numbers generated (i.e. argc
should be 4).
Your program will use a \"dummy node\" for the linked list. In other words, the head of the list
will be an actual node, but the data field in that node will not be used for sorting purposes.
Your program must contain the following functions:
main() (for obvious reasons)
insertNodeSorted() - You may implement this either of two ways.
One way is to use the head of the list as one parameter and the integer value as the second. The
function will allocate memory for the node, initialize it and then insert it in the proper location in
the list.
The other way is to pass the head of the list as one parameter and a previously allocated and
initialized node as the other. The existing node is inserted in the proper location in the list.
printList() - Takes the head of the list as its only parameter, traverses the list, printing out the
data in sorted order.
deleteList() - Takes the head of the list as its only parameter, traverses the list, deleting all nodes.
The basic algorithm of your program is
Use a loop (based upon command line input values) that:
Generates a random number
Prints the number to stdout
Creates a node that contains that random number
Inserts the new node in sorted order into the existing list
Print the sorted linked list
Delete the linked list
You will use a Makefile to compile your program
Solution
#include
#include
#include
struct test_struct
{
int val;
struct test_struct *next;
};
struct test_struct *head = NULL;
struct test_struct *curr = NULL;
struct test_struct* create_list(int val)
{
printf(\"\ creating list with headnode as [%d]\ \",val);
struct test_struct *ptr = (struct test_struct*)malloc(sizeof(struct test_struct));
if(NULL == ptr)
{
printf(\"\ Node creation failed \ \");
return NULL;
}
ptr->val = val;
ptr->next = NULL;
head = curr = ptr;
return ptr;
}
struct test_struct* add_to_list(int val, bool add_to_end)
{
if(NULL == head)
{
retur.
a) Complete both insert and delete methods. If it works correctly 10.pdf
a) Complete both insert and delete methods. If it works correctly 100 points each.
b) Do not call the search method in delete method.
c) Make sure to write your name in main method.
d) DO NOT MODIFY PROCESS METHOD.
3- Create a proper input file with respect to process method to test all cases in both
insert and delete methods.
4- Compile and execute your program at the command prompt. Check your output, if it
is correct
//xxxxxH5.java is linked list implementation of lstinterface.
//Eliminate count form both insert and delete methods
// If works correctly, 200 points
import java.util.*;
import java.io.*;
//lstinterface is an interface
public class xxxxxH5 implements lstinterface {
// xxxxxH5 class variables
//head is a pointer to beginning of linked list
private node head = null;
//use prt for System.out to save typing
PrintStream prt = System.out;
// class node
private class node{
// class node variables
int data;
node rlink; //right link
// class node constructor
node(int x){
data = x;
rlink = null;
} // end class node constructor
}// class node
// insert x at position p,
// if successful return 1 otherwise return 0
public int insert(int x, int p){
prt.printf("\n\t\tInsert %5d at position %2d:", x, p);
// complete this method
return 0; // successful insertion
} // end insert
// delete x at position p
// if successful return 1 otherwise return 0
public int delete(int p){
prt.printf("\n\t\tDelete element at position %2d:", p);
// complete this method
return 0; // successful insertion
} // end delete
// sequential serach for x in the list
// if successful return its position otherwise return 0;
public int search(int x){
// Local variables
node cur;
prt.printf("\n\t\tSearch for %5d:", x);
// Complete the rest of the method
int pos = 0;
for (cur = head; cur != null ; cur = cur.rlink){
pos ++;
if (cur.data == x){
prt.printf(" Found at position %2d, ", pos);
return pos;
} // end if
} // end for
prt.printf(" Not Found.");
return 0; // x is not found.
} // end search
// print list elements formatted
public void printlst() {
// Local variables
node cur;
prt.printf("\n\tList contents: ");
for (cur = head; cur != null ; cur = cur.rlink)
prt.printf("%5d,", cur.data);
// end for
} // end printlst
// insert delete and search in the list
private void process(String fn){
// Local variables
int j, ins, del, srch, k, p;
int x;
prt.printf("\tLinked List implementation of int list without"+
//\n\tusing count, gets input file name from method argument, then
reads:"+
"\n\tinteger No. of elements to insert(ins)"+
" followed by elements to insert and their positions,"+
"\n\tinteger No. of elements to search(srch) followed by element to
search"+
"\n\tinteger No. of elements to delete(del) followed by position of"+
"elements to delete" +
"\n\t\tTo compile: javac xxxxxH5.java" +
"\n\t\tTo execute: java xxxxxH5 inputfilename");
try{
// open input file
Scanner inf = new Scanner(new File(fn));
//read no. of elements to insert
ins = inf.nextInt();
prt.printf("\n\tInsert %.
Similar to It's not working what am I doing wrong- Given main()- complete the Son.pdf (20)
maincpp include ltiostreamgt include ltstringgt.pdf
maincpp include ltiostreamgt include ltstringgt.pdf
Can someone please help me implement the addSong function .pdf
Can someone please help me implement the addSong function .pdf
Program 02 Based on the previous problem you should impleme.pdf
Program 02 Based on the previous problem you should impleme.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
Write a program in C++ language that implements a music play.pdf
Write a program in C++ language that implements a music play.pdf
Program 01 For this program you will complete the program in.pdf
Program 01 For this program you will complete the program in.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
819 LAB Program Playlist c++ You will be building a li.pdf
819 LAB Program Playlist c++ You will be building a li.pdf
In C++ please I need output please You will be building a .pdf
In C++ please I need output please You will be building a .pdf
Here is the code.compile g++ Playlist.cpp main.cppPlaylist.h.pdf
Here is the code.compile g++ Playlist.cpp main.cppPlaylist.h.pdf
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. Mak.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
PLEASE I need help with my assignment I have to compelet .pdf
PLEASE I need help with my assignment I have to compelet .pdf
PFB cpp code for the given problem#include iostream #include .pdf
PFB cpp code for the given problem#include iostream #include .pdf
Hi,Please find the Ansswer below.PLAYLIST.h#include iostrea.pdf
Hi,Please find the Ansswer below.PLAYLIST.h#include iostrea.pdf
BeepComp - Chiptune Creator - User's Guide (v0.2.2)
BeepComp - Chiptune Creator - User's Guide (v0.2.2)
For this homework, you will write a program to create and manipulate.pdf
For this homework, you will write a program to create and manipulate.pdf
a) Complete both insert and delete methods. If it works correctly 10.pdf
a) Complete both insert and delete methods. If it works correctly 10.pdf
More from aanyajoshi90
Jamal has red hair- Since the gene for red hair is recessive- Jamal mu.pdf
Jamal has red hair. Since the gene for red hair is recessive, Jamal must be __________ for that
trait.
critical
homozygous
heterozygous
a carrier
A. critical
B. homozygous
C. heterozygous
D. a carrier.
Jake stole a suspension of Bacillus anthracis with a known concentrati.pdf
Jake stole a suspension of Bacillus anthracis with a known concentration of 7 x 107 spores/mL.
He wants to dilute this cell suspension down to 2 x 103 spores/mL. Calculate his dilution factor.
Design and draw a practical dilution scheme which limits the volumes used to greater than or
equal to 0.1 mL and less than or equal to 10 mL. (hint: use one-step and serial dilutions together
to satisfy the given volume restrictions).
Ivanhoe arovides shutile service between 4 hotels near a medical cente.pdf
Ivanhoe arovides shutile service between 4 hotels near a medical center and an international
airport. fvanhoe uees two 10 -passenger vans to ofter 12 round trips per day. A recent month's
activity in the form of a cost volume-profit income statement is actolilas Calculate the break-
even point in (1) sales dollars and (2) number of passengers. Break-even point Break-evenpoint
passengers.
its about the economic systems of Haiti XI- Economic Policies and Refo.pdf
its about the economic systems of Haiti
XI. Economic Policies and Reforms a. Macroeconomic Policies i. Fiscal and monetary policies
aimed at stability and growth. ii. Structural reforms for better governance and accountability b.
Private Sector Development i. Business-friendly policies and regulations ii. Promotion of
entrepreneurship and innovation c. Social Safety Nets i. Targeted programs for poverty reduction
and social inclusion ii. Investments in education and health. XII. International Relations and
Partnerships a. Bilateral and Multilateral Agreements i. Partnership agreements with the United
States, Canada, and the European Union ii. Membership in regional organizations such as
CARICOM and CELAC b. Foreign Aid and Assistance i. Humanitarian aid and development
assistance from international organizations and donor countries ii. Criticisms of aid dependency
and lack of local ownership..
IV- The EXT3 file system of Linux uses a multiple index structure- If (1).pdf
IV. The EXT3 file system of Linux uses a multiple index structure. If the file i node (inode) contains 15 pointers(or address entries)
noted as addr[0]~addr[14]. Assuming that the block size is 4KB and size of a pointer is 4B,
(1) Please briefly explain the specific meaning of these address entries and the advantages of multi-Level indexed files structure..
its about the economic systems of Haiti IX- Post-Duvalier (1986-Presen.pdf
its about the economic systems of Haiti
IX. Post-Duvalier (1986-Present) a. Haiti has implemented a series of economic reforms and
stabilization programs under the guidance of international organizations such as the IMF and
World Bank. b. The economic system has been focused on attracting foreign investment and
promoting export-oriented production, particularly in the textile and apparel industries. c. The
economic system has been characterized by political instability, natural disasters, and limited
progress towards sustained economic growth and development. X. Current Economic System
(Present) a. Market Economy i. Dominated by informal sectors and small businesses. ii.
Agriculture and textiles are major industries. b. Foreign Investment i. Encouraged by the
government through incentives and special economic zones. ii. Major investments in energy,
infrastructure, and tourism c. Challenges i. Limited access to credit and financial services ii.
Weak institutions and governance iii. Low productivity and competitiveness..
Its in C++ and do not use int pls Given a string- return a new string.pdf
Its in C++ and do not use int pls
Given a string, return a new string where there are i copies of each individual character, where i
is the loop index. (That is there will be 0 copies of the first character, 1 of the second, and so on.)
main.cpp.
it were the total dividends paid for 2022-Maniplo Cnorce 57-84 milion.pdf
it were the total dividends paid for 2022 ? Maniplo Cnorce 57.84 milion se.50 milion St,086
mition $1 , 236 million $510 milion.
Ivanhoe Inc- wishes to accumulate $1-612-000 by December 31- 2035- to.pdf
Ivanhoe Inc. wishes to accumulate $1.612.000 by December 31. 2035, to retire bonds
outstanding. The company deposits $248,000 on December 31, 2025, which will earn
interest at 10% compounded quarterly, to help in the retirement of this debt. In addition, the
company wants to know how much should be deposited at the end of each quarter
for 10 years to ensure that $1,612,000 is available at the end of 2035. (The quarterly
deposits will also earn at a rate of 10%, compounded quarterly.).
Jocelyn Rivers is a 68-year-old admitted for acute pulmonary edema- He.pdf
Jocelyn Rivers is a 68-year-old admitted for acute pulmonary edema. Her medical history
involves atrial fibrillation, hypertension, and heart failure. She has been recovering well,
however, she suddenly becomes hypotensive and has a cardiorespiratory arrest. During
resuscitation, an ABG is drawn with the following results: Test Value Interpretation pH 6.82
PCO2 75 PO2 100 O2 Saturation 89% HCO3- 12
ABG Interpretation:
Causes
Treatment:.
Joe Newbie completed a test to inspect a sample of sales invoices to v.pdf
Joe Newbie completed a test to inspect a sample of sales invoices to verify that the goods were
shipped, and to match the shipping date with the date per the sales invoice. Joe identified the
population from which to sample as the listing of all shipments made by Fishy for aquarium
orders. Fishy has a computerized list of shipments that can be used to select the appropriate
sample.
The sampling methodology used by Newbie is.......
Correct or Incorrect? (choose either correct or incorrect only).
Joan owns a citrus tree farm near Mesa- Arizona- Joan and her family h.pdf
Joan owns a citrus tree farm near Mesa, Arizona. Joan and her family have fertilized the trees
each spring for 52 years. The irrigation for the trees carries the fertilizer remnants into the Salt
River. When EPA investigators discover the fertilizer in the Salt River and trace the unique
brand to Joan, they indict her for violation of the Clean Water Act, for the discharge of a
substance into a waterway. Joan responds, "I didn't know there was fertilizer. I was just letting
water flow." Joan has sufficient mens rea for the crime. Joan can be held criminally liable only
for her negligence. Joan can rely on the Ahmad case and escape criminal liability. none of the
above.
ITN 298- Capstone Project 1- Describing WAN technologies- including VP.pdf
ITN 298. Capstone Project
1. Describing WAN technologies, including VPN solutions.
2. Implementing security controls such as Firewalls, ACLs, to ensure user policies are enabled.
3. Determining volume, bandwidth, and placement requirements necessary for functioning
wireless network..
Ivanhoe Ltd- had the following account balances at December 31- 2024-P.pdf
Ivanhoe Ltd. had the following account balances at December 31, 2024: Prepare a dassified
statement of financial position for Ivanhoe Ltd. as at December 31, 2024. (List Curnent Assets in
order of liquidity. Liss Non current assets in order of Land, Bulldings and Equlpment.).
Jennifer is an older Aboriginal client- She has lived in the city all.pdf
Jennifer is an older Aboriginal client. She has lived in the city all he life and now wishes to enter
residential care. Her immediate family support this. She does not wish to move away from the
suburb in which she has lived for the last 23 years. Jennifer has diabetes and is possibly suffering
mild dementia. She is widowed and has been, up until now, living on her own. She is an artist
and her most compelling goal is to continue painting for as long as possible. She and her family
are inquiring about subsidies and financial assistance. What community service organisations
might you contact with her or on her behalf? List at least six..
Jeff is trying very hard to change his flat tire- He struggles to lift.pdf
Jeff is trying very hard to change his flat tire. He struggles to lift the heavy wheel high enough to
slip the wheel onto the lug nuts. While he is using all the strength he can muster, he knows that
he is, for a few seconds, achieving the state of: hypotonia wave summation treppe hypertonia
tetanus.
JCL Inc- is a major chip manufacturing firm that sells its products to.pdf
JCL Inc. is a major chip manufacturing firm that sells its products to computer manufacturers
like Dell, HP, and others. In simplified terms, chip making at JCL Inc. involves three basic
operations: depositing, patterning, and etching.
Depositing: Using chemical vapor deposition (CVD) technology, an insulating material is
deposited on the wafer surface, forming a thin layer of solid material on the chip.
Patterning: Photolithography projects a microscopic circuit pattern on the wafer surface, which
has a light-sensitive chemical like the emulsion on photographic film. It is repeated many times
as each layer of the chip is built.
Etching: Etching removes selected material from the chip surface to create the device structures.
The following table lists the required processing times and setup times at each of the steps.
Assume that the unit of production is a wafer, from which individual chips are cut at a later
stage.
Note: A setup can only begin once the batch has arrived at the machine.
(a) What is the process capacity in units per hour with a batch size of 100 wafers?
(b) Which of the following is true regarding step 3 (Etching)?
(c) Suppose JCL Inc. came up with a new technology that eliminated the setup time for step 1
(deposition), but increased the processing time to 0.35 minute/unit. What would be the batch size
you would choose so as to maximize the overall capacity of the process? (Round your
intermediate computations to 2 decimal places. Round your final answer to the nearest
whole number.)
Process Step 1 Depositing 2 Patterning 3 Etching
Setup time 35 min. 23 min. 13 min.
Processing time 0.07 min./unit 0.17 min./unit 0.12 min./unit.
Jenna is a flight attendant for an international carrier- In the summe.pdf
Jenna is a flight attendant for an international carrier. In the summers, she is assigned to many
flights with tourists on their first trans-Atlantic trip and many of them are unprepared for the
rigors of travel. This is Jenna's least favorite flight because the passengers on the flight often get
cranky and upset during the long hours over water and Jenna herself then ends up cranky and in a
bad mood by the time they land overseas. What is Jenna experiencing? Personality irregularity
Emotional contagion Negative scripting Mood management.
JBL Lab 9 (Applying Best Practices for Security Logging and Monitoring.pdf
JBL Lab 9 (Applying Best Practices for Security Logging and Monitoring).
answer this questiion on detail base on the lab
1-What is the primary place to store log files on a local Linux System?
2-Why is remote logging to a central server considered a best practice?
3-Could rkhunter be considered a file integrity checker? Why or why not?.
More from aanyajoshi90 (20)
Jamal has red hair- Since the gene for red hair is recessive- Jamal mu.pdf
Jamal has red hair- Since the gene for red hair is recessive- Jamal mu.pdf
Jake stole a suspension of Bacillus anthracis with a known concentrati.pdf
Jake stole a suspension of Bacillus anthracis with a known concentrati.pdf
Ivanhoe arovides shutile service between 4 hotels near a medical cente.pdf
Ivanhoe arovides shutile service between 4 hotels near a medical cente.pdf
its about the economic systems of Haiti XI- Economic Policies and Refo.pdf
its about the economic systems of Haiti XI- Economic Policies and Refo.pdf
IV- The EXT3 file system of Linux uses a multiple index structure- If (1).pdf
IV- The EXT3 file system of Linux uses a multiple index structure- If (1).pdf
its about the economic systems of Haiti IX- Post-Duvalier (1986-Presen.pdf
its about the economic systems of Haiti IX- Post-Duvalier (1986-Presen.pdf
Its in C++ and do not use int pls Given a string- return a new string.pdf
Its in C++ and do not use int pls Given a string- return a new string.pdf
it were the total dividends paid for 2022-Maniplo Cnorce 57-84 milion.pdf
it were the total dividends paid for 2022-Maniplo Cnorce 57-84 milion.pdf
Ivanhoe Inc- wishes to accumulate $1-612-000 by December 31- 2035- to.pdf
Ivanhoe Inc- wishes to accumulate $1-612-000 by December 31- 2035- to.pdf
Jocelyn Rivers is a 68-year-old admitted for acute pulmonary edema- He.pdf
Jocelyn Rivers is a 68-year-old admitted for acute pulmonary edema- He.pdf
Joe Newbie completed a test to inspect a sample of sales invoices to v.pdf
Joe Newbie completed a test to inspect a sample of sales invoices to v.pdf
Joan owns a citrus tree farm near Mesa- Arizona- Joan and her family h.pdf
Joan owns a citrus tree farm near Mesa- Arizona- Joan and her family h.pdf
ITN 298- Capstone Project 1- Describing WAN technologies- including VP.pdf
ITN 298- Capstone Project 1- Describing WAN technologies- including VP.pdf
Ivanhoe Ltd- had the following account balances at December 31- 2024-P.pdf
Ivanhoe Ltd- had the following account balances at December 31- 2024-P.pdf
Jennifer is an older Aboriginal client- She has lived in the city all.pdf
Jennifer is an older Aboriginal client- She has lived in the city all.pdf
Jeff is trying very hard to change his flat tire- He struggles to lift.pdf
Jeff is trying very hard to change his flat tire- He struggles to lift.pdf
JCL Inc- is a major chip manufacturing firm that sells its products to.pdf
JCL Inc- is a major chip manufacturing firm that sells its products to.pdf
Jenna is a flight attendant for an international carrier- In the summe.pdf
Jenna is a flight attendant for an international carrier- In the summe.pdf
JBL Lab 9 (Applying Best Practices for Security Logging and Monitoring.pdf
JBL Lab 9 (Applying Best Practices for Security Logging and Monitoring.pdf
Recently uploaded
Unit 2- Research Aptitude (UGC NET Paper I).pdf
This slide describes the research aptitude of unit 2 in the UGC NET paper I.
"Protectable subject matters, Protection in biotechnology, Protection of othe...
Protectable subject matters, Protection in biotechnology, Protection of other biological materials, Ownership and period of protection
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH ANSWERS.
Digital Tools and AI for Teaching Learning and Research
This Presentation in details discusses on Digital Tools and AI for Teaching Learning and Research
The Roman Empire A Historical Colossus.pdf
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
Instructions for Submissions thorugh G- Classroom.pptx
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
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.
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.
Honest Reviews of Tim Han LMA Course Program.pptx
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
Acetabularia Information For Class 9 .docx
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
The approach at University of Liverpool.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
special B.ed 2nd year old paper_20240531.pdf
Instagram:-
https://instagram.com/special_education_needs_01?igshid=YmMyMTA2M2Y=
WhatsApp:-
https://chat.whatsapp.com/JVakNIYlSV94x7bwunO3Dc
YouTube:-
https://youtube.com/@special_education_needs
Teligram :- https://t.me/special_education_needs
Slide Shere :-
https://www.slideshare.net/shabnambano20?utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview
Palestine last event orientationfvgnh .pptx
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
Biological Screening of Herbal Drugs in detailed.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
Recently uploaded (20)
"Protectable subject matters, Protection in biotechnology, Protection of othe...
"Protectable subject matters, Protection in biotechnology, Protection of othe...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
Instructions for Submissions thorugh G- Classroom.pptx
Instructions for Submissions thorugh G- Classroom.pptx
Overview on Edible Vaccine: Pros & Cons with Mechanism
Overview on Edible Vaccine: Pros & Cons with Mechanism
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
It's not working what am I doing wrong- Given main()- complete the Son.pdf
- 1. 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();
- 2. 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; }
- 3. // 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); } }