maincpp include ltiostreamgt include ltstringgt.pdf
•
0 likes•42 views
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:.
Report
Share
Report
Share
Download to read offline
Recommended
816 LAB Playlist output linked list Hey I have most of.pdf
8.16 LAB: Playlist (output linked list)
**Hey I have most of this done I just need to figure out to get rid of the indent/whitespace for this
Given main(), complete the SongNode class to include the function PrintSongInfo(). Then write the
PrintPlaylist() function in main.cpp to print all songs in the playlist. DO NOT print the dummy
head node.
Ex: If the input is:
the output is:
main.cpp
#include "SongNode.h"
void PrintPlaylist(SongNode* head) {
SongNode* temp = head->GetNext();
while (temp != nullptr) {
temp->PrintSongInfo();
temp = temp->GetNext();
}
}
int main() {
SongNode* headNode = new SongNode();
SongNode* currNode = nullptr;
SongNode* lastNode = headNode;
string songTitle;
string songLength;
string songArtist;
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
cout << "LIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}
SongNode.h
#include<iostream>
#include<string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef;
public:
SongNode();
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode* nextLoc);
void InsertAfter(SongNode* nodeLoc);
SongNode* GetNext();
void PrintSongInfo();
};
SongNode.cpp
#include "SongNode.h"
SongNode::SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = nullptr;
}
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
songTitle = songTitleInit;
songLength = songLengthInit;
songArtist = songArtistInit;
nextNodeRef = nullptr;
}
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc) {
songTitle = songTitleInit;
songLength = songLengthInit;
songArtist = songArtistInit;
nextNodeRef = nextLoc;
}
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext = nextNodeRef;
nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
SongNode* SongNode::GetNext() {
return nextNodeRef;
}
void SongNode::PrintSongInfo() {
cout << "Title: " << songTitle << endl;
cout << "Length: " << songLength << endl;
cout << "Artist: " << songArtist << endl << endl;
}
zyBooks My library > CS 1119: Computer Programming With C++ home > 8.16: LAB: Playlist
(output linked list) zyBooks catalog ? Help/FAQ 8 Julia Fritsch I.TST OF SONC5 --itle: Stomp! Iitht
380 Length: Artiat: The Brothera Johnson Title: The Iude Length: 337 Artist: Quincy Jones Title:
You Don't Own Me Length: 151 Artist: Lesley Gore + LIsT of SoNCs -------- Title: Stome! Length:
380 Artist: The Brothers Johnson Title: The Dude Length: 337 Artist: Quincy Jones Title: You Don't
Own Me Artiat: Lesley Gore Expected cutput Title: The Dude.
Here is 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)
{
.
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!.
In C++ Plz LAB- Playlist (output linked list) Given main()- complete.pdf
In C++ Plz
LAB: Playlist (output linked list)
Given main(), complete the SongNode class to include the function PrintSongInfo(). Then write
the PrintPlaylist() function in main.cpp to print all songs in the playlist. DO NOT print the
dummy head node.
Ex: If the input is:
the output is:
main.cpp Default Code:
#include <iostream>
#include "SongNode.h"
// TODO: Write PrintPlaylist() function
int main() {
SongNode* headNode;
SongNode* currNode;
SongNode* lastNode;
string songTitle;
string songLength;
string songArtist;
// Front of nodes list
headNode = new SongNode();
lastNode = headNode;
// Read user input until -1 entered
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
// Print linked list
cout << "LIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}.
In C++ Plz and In What Order Do I Put It In- LAB- Playlist (output li.pdf
In C++ Plz and In What Order Do I Put It In.
LAB: Playlist (output linked list)
Given main(), complete the SongNode class to include the function PrintSongInfo(). Then write
the PrintPlaylist() function in main.cpp to print all songs in the playlist. DO NOT print the
dummy head node.
Ex: If the input is:
the output is:
main.cpp Default Code:
#include <iostream>
#include "SongNode.h"
// TODO: Write PrintPlaylist() function
int main() {
SongNode* headNode;
SongNode* currNode;
SongNode* lastNode;
string songTitle;
string songLength;
string songArtist;
// Front of nodes list
headNode = new SongNode();
lastNode = headNode;
// Read user input until -1 entered
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
// Print linked list
cout << "LIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}
SongNode.h Default Code:
#include "iostream"
#include <string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef; // Reference to the next node
public:
SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = NULL;
}
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc);
// insertAfter
void InsertAfter(SongNode* nodeLoc);
// Get location pointed by nextNodeRef
SongNode* GetNext();
// Prints song information
void PrintSongInfo();
};
SongNode.cpp Default Code:
#include "SongNode.h"
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = NULL;
}
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit,
SongNode* nextLoc) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = nextLoc;
}
// insertAfter
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
// Get location pointed by nextNodeRef
SongNode* SongNode::GetNext() {
return this->nextNodeRef;
}
// TODO: Write PrintSongInfo() function
.
Hi,Please find the Ansswer below.PLAYLIST.h#include iostrea.pdf
Hi,
Please find the Ansswer below.
//PLAYLIST.h
#include
#include
#include
#include
using namespace std;
class Playlist
{
private:
string uniqueID;
string songName;
string artistName;
int songLength;
public:
Playlist() { uniqueID = \"\", songName = \"\", artistName = \"\", songLength = 0; };
Playlist(string auniqueId, string asongName, string aArtistName, int aSongLength);
void InsertAfter();
void SetNext();
string GetID();
string GetSongName();
string GetArtistName();
int GetSongLength();
string GetNext();
void PrintPlaylistNode();
};
//PLAYLIST.CPP
#include \"Playlist.h\"
Playlist::Playlist(string auniqueId, string asongName, string aArtistName, int aSongLength)
{
uniqueID = auniqueId;
songName = asongName;
artistName = aArtistName;
songLength = aSongLength;
}
string Playlist::GetArtistName()
{
return artistName;
}
string Playlist::GetID()
{
return uniqueID;
}
string Playlist::GetSongName()
{
return songName;
}
int Playlist::GetSongLength()
{
return songLength;
}
void Playlist::SetNext()
{
}
string Playlist::GetNext()
{
return \"\";
}
void Playlist::InsertAfter() {
}
void Playlist::PrintPlaylistNode()
{
cout << \"Unique ID:\" << uniqueID << endl ;
cout << \"Song Name:\" << songName << endl;
cout << \"Artist Name:\" << artistName << endl;
cout << \"Song Length (in seconds):\" << songLength << endl;
}
//PLAYSLITSNODE.h
#pragma once
#include \"Playlist.h\"
#include
class PlaylistNode
{
private:
std::list library;
Playlist get(list _list, int _i);
void PrintPlaylist(Playlist aPlayList);
public:
void Addsong(Playlist aPlayslist);
void Removesong(string aUnwiid);
void Changeposition(int oldPostion, int anewPostion);
void PrintSongByartist(string aAstist);
void PrintSongtotalLen();
void PrintFullPlayList();
};
//PLAYLIST.CPP
#include \"PlaylistNode.h\"
void PlaylistNode::Addsong(Playlist aPlaylist)
{
library.push_back(aPlaylist);
}
void PlaylistNode::Removesong(string aUnwiid)
{
if (library.size > 0)
{
for (it = library.begin(); it != library.end(); ++it)
{
if (it->GetID() == aUnwiid)
{
cout << it->GetSongName() << endl;
library.remove(*it);
break;
}
}
}
}
Playlist PlaylistNode::get(list _list, int _i) {
list::iterator it = _list.begin();
for (int i = 0; i<_i; i++) {
++it;
}
return *it;
}
std::list::iterator it;
void PlaylistNode::PrintFullPlayList()
{
for (it = library.begin(); it != library.end(); ++it)
{
PrintPlaylist(*it);
}
}
void PlaylistNode::PrintSongByartist(string aartiename)
{
for (it = library.begin(); it != library.end(); ++it)
{
if(it->GetArtistName() == aartiename)
PrintPlaylist(*it);
}
}
void PlaylistNode::PrintSongtotalLen()
{
int TotalSonglengst = 0;
for (it = library.begin(); it != library.end(); ++it)
{
TotalSonglengst += it->GetSongLength();
}
cout << \"Total songs Length (in seconds):\" << TotalSonglengst << endl;
}
void PlaylistNode::PrintPlaylist(Playlist aPlayList)
{
cout << \"Unique ID:\" << aPlayList.GetID() << endl;
cout << \"Song Name:\" << aPlayList.GetSongName() << endl;
cout << \"Artist Name:\" << aPlayList.GetArtis.
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.
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;
}.
Recommended
816 LAB Playlist output linked list Hey I have most of.pdf
8.16 LAB: Playlist (output linked list)
**Hey I have most of this done I just need to figure out to get rid of the indent/whitespace for this
Given main(), complete the SongNode class to include the function PrintSongInfo(). Then write the
PrintPlaylist() function in main.cpp to print all songs in the playlist. DO NOT print the dummy
head node.
Ex: If the input is:
the output is:
main.cpp
#include "SongNode.h"
void PrintPlaylist(SongNode* head) {
SongNode* temp = head->GetNext();
while (temp != nullptr) {
temp->PrintSongInfo();
temp = temp->GetNext();
}
}
int main() {
SongNode* headNode = new SongNode();
SongNode* currNode = nullptr;
SongNode* lastNode = headNode;
string songTitle;
string songLength;
string songArtist;
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
cout << "LIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}
SongNode.h
#include<iostream>
#include<string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef;
public:
SongNode();
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode* nextLoc);
void InsertAfter(SongNode* nodeLoc);
SongNode* GetNext();
void PrintSongInfo();
};
SongNode.cpp
#include "SongNode.h"
SongNode::SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = nullptr;
}
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
songTitle = songTitleInit;
songLength = songLengthInit;
songArtist = songArtistInit;
nextNodeRef = nullptr;
}
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc) {
songTitle = songTitleInit;
songLength = songLengthInit;
songArtist = songArtistInit;
nextNodeRef = nextLoc;
}
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext = nextNodeRef;
nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
SongNode* SongNode::GetNext() {
return nextNodeRef;
}
void SongNode::PrintSongInfo() {
cout << "Title: " << songTitle << endl;
cout << "Length: " << songLength << endl;
cout << "Artist: " << songArtist << endl << endl;
}
zyBooks My library > CS 1119: Computer Programming With C++ home > 8.16: LAB: Playlist
(output linked list) zyBooks catalog ? Help/FAQ 8 Julia Fritsch I.TST OF SONC5 --itle: Stomp! Iitht
380 Length: Artiat: The Brothera Johnson Title: The Iude Length: 337 Artist: Quincy Jones Title:
You Don't Own Me Length: 151 Artist: Lesley Gore + LIsT of SoNCs -------- Title: Stome! Length:
380 Artist: The Brothers Johnson Title: The Dude Length: 337 Artist: Quincy Jones Title: You Don't
Own Me Artiat: Lesley Gore Expected cutput Title: The Dude.
Here is 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)
{
.
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!.
In C++ Plz LAB- Playlist (output linked list) Given main()- complete.pdf
In C++ Plz
LAB: Playlist (output linked list)
Given main(), complete the SongNode class to include the function PrintSongInfo(). Then write
the PrintPlaylist() function in main.cpp to print all songs in the playlist. DO NOT print the
dummy head node.
Ex: If the input is:
the output is:
main.cpp Default Code:
#include <iostream>
#include "SongNode.h"
// TODO: Write PrintPlaylist() function
int main() {
SongNode* headNode;
SongNode* currNode;
SongNode* lastNode;
string songTitle;
string songLength;
string songArtist;
// Front of nodes list
headNode = new SongNode();
lastNode = headNode;
// Read user input until -1 entered
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
// Print linked list
cout << "LIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}.
In C++ Plz and In What Order Do I Put It In- LAB- Playlist (output li.pdf
In C++ Plz and In What Order Do I Put It In.
LAB: Playlist (output linked list)
Given main(), complete the SongNode class to include the function PrintSongInfo(). Then write
the PrintPlaylist() function in main.cpp to print all songs in the playlist. DO NOT print the
dummy head node.
Ex: If the input is:
the output is:
main.cpp Default Code:
#include <iostream>
#include "SongNode.h"
// TODO: Write PrintPlaylist() function
int main() {
SongNode* headNode;
SongNode* currNode;
SongNode* lastNode;
string songTitle;
string songLength;
string songArtist;
// Front of nodes list
headNode = new SongNode();
lastNode = headNode;
// Read user input until -1 entered
getline(cin, songTitle);
while (songTitle != "-1") {
getline(cin, songLength);
getline(cin, songArtist);
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode->InsertAfter(currNode);
lastNode = currNode;
getline(cin, songTitle);
}
// Print linked list
cout << "LIST OF SONGS" << endl;
cout << "-------------" << endl;
PrintPlaylist(headNode);
return 0;
}
SongNode.h Default Code:
#include "iostream"
#include <string>
using namespace std;
class SongNode {
private:
string songTitle;
string songLength;
string songArtist;
SongNode* nextNodeRef; // Reference to the next node
public:
SongNode() {
songTitle = "";
songLength = "";
songArtist = "";
nextNodeRef = NULL;
}
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit);
// Constructor
SongNode(string songTitleInit, string songLengthInit, string songArtistInit, SongNode*
nextLoc);
// insertAfter
void InsertAfter(SongNode* nodeLoc);
// Get location pointed by nextNodeRef
SongNode* GetNext();
// Prints song information
void PrintSongInfo();
};
SongNode.cpp Default Code:
#include "SongNode.h"
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = NULL;
}
// Constructor
SongNode::SongNode(string songTitleInit, string songLengthInit, string songArtistInit,
SongNode* nextLoc) {
this->songTitle = songTitleInit;
this->songLength = songLengthInit;
this->songArtist = songArtistInit;
this->nextNodeRef = nextLoc;
}
// insertAfter
void SongNode::InsertAfter(SongNode* nodeLoc) {
SongNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = nodeLoc;
nodeLoc->nextNodeRef = tmpNext;
}
// Get location pointed by nextNodeRef
SongNode* SongNode::GetNext() {
return this->nextNodeRef;
}
// TODO: Write PrintSongInfo() function
.
Hi,Please find the Ansswer below.PLAYLIST.h#include iostrea.pdf
Hi,
Please find the Ansswer below.
//PLAYLIST.h
#include
#include
#include
#include
using namespace std;
class Playlist
{
private:
string uniqueID;
string songName;
string artistName;
int songLength;
public:
Playlist() { uniqueID = \"\", songName = \"\", artistName = \"\", songLength = 0; };
Playlist(string auniqueId, string asongName, string aArtistName, int aSongLength);
void InsertAfter();
void SetNext();
string GetID();
string GetSongName();
string GetArtistName();
int GetSongLength();
string GetNext();
void PrintPlaylistNode();
};
//PLAYLIST.CPP
#include \"Playlist.h\"
Playlist::Playlist(string auniqueId, string asongName, string aArtistName, int aSongLength)
{
uniqueID = auniqueId;
songName = asongName;
artistName = aArtistName;
songLength = aSongLength;
}
string Playlist::GetArtistName()
{
return artistName;
}
string Playlist::GetID()
{
return uniqueID;
}
string Playlist::GetSongName()
{
return songName;
}
int Playlist::GetSongLength()
{
return songLength;
}
void Playlist::SetNext()
{
}
string Playlist::GetNext()
{
return \"\";
}
void Playlist::InsertAfter() {
}
void Playlist::PrintPlaylistNode()
{
cout << \"Unique ID:\" << uniqueID << endl ;
cout << \"Song Name:\" << songName << endl;
cout << \"Artist Name:\" << artistName << endl;
cout << \"Song Length (in seconds):\" << songLength << endl;
}
//PLAYSLITSNODE.h
#pragma once
#include \"Playlist.h\"
#include
class PlaylistNode
{
private:
std::list library;
Playlist get(list _list, int _i);
void PrintPlaylist(Playlist aPlayList);
public:
void Addsong(Playlist aPlayslist);
void Removesong(string aUnwiid);
void Changeposition(int oldPostion, int anewPostion);
void PrintSongByartist(string aAstist);
void PrintSongtotalLen();
void PrintFullPlayList();
};
//PLAYLIST.CPP
#include \"PlaylistNode.h\"
void PlaylistNode::Addsong(Playlist aPlaylist)
{
library.push_back(aPlaylist);
}
void PlaylistNode::Removesong(string aUnwiid)
{
if (library.size > 0)
{
for (it = library.begin(); it != library.end(); ++it)
{
if (it->GetID() == aUnwiid)
{
cout << it->GetSongName() << endl;
library.remove(*it);
break;
}
}
}
}
Playlist PlaylistNode::get(list _list, int _i) {
list::iterator it = _list.begin();
for (int i = 0; i<_i; i++) {
++it;
}
return *it;
}
std::list::iterator it;
void PlaylistNode::PrintFullPlayList()
{
for (it = library.begin(); it != library.end(); ++it)
{
PrintPlaylist(*it);
}
}
void PlaylistNode::PrintSongByartist(string aartiename)
{
for (it = library.begin(); it != library.end(); ++it)
{
if(it->GetArtistName() == aartiename)
PrintPlaylist(*it);
}
}
void PlaylistNode::PrintSongtotalLen()
{
int TotalSonglengst = 0;
for (it = library.begin(); it != library.end(); ++it)
{
TotalSonglengst += it->GetSongLength();
}
cout << \"Total songs Length (in seconds):\" << TotalSonglengst << endl;
}
void PlaylistNode::PrintPlaylist(Playlist aPlayList)
{
cout << \"Unique ID:\" << aPlayList.GetID() << endl;
cout << \"Song Name:\" << aPlayList.GetSongName() << endl;
cout << \"Artist Name:\" << aPlayList.GetArtis.
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.
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;
}.
It's not working what am I doing wrong- Given main()- complete the Son.pdf
It's not working what am I doing wrong?
Given main(), complete the SongNode class to include the printSongInfo() method. Then write
the Playlist class' printPlaylist() method to print all songs in the playlist. DO NOT print the
dummy head node.
Ex: If the input is:
the output is:
import java.util.Scanner;
public class Playlist {
// TODO: Write method to ouptut list of songs
public static void printPlaylist(SongNode songs){
SongNode song = song.getNext();
while (song != null) {
song.printSongInfo();
System.out.println();
song = song.getNext();
}
}
public static void main (String[] args) {
Scanner scnr = new Scanner(System.in);
SongNode headNode;
SongNode currNode;
SongNode lastNode;
String songTitle;
int songLength;
String songArtist;
// Front of nodes list
headNode = new SongNode();
lastNode = headNode;
// Read user input until -1 entered
songTitle = scnr.nextLine();
while (!songTitle.equals("-1")) {
songLength = scnr.nextInt();
scnr.nextLine();
songArtist = scnr.nextLine();
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode.insertAfter(currNode);
lastNode = currNode;
songTitle = scnr.nextLine();
}
// Print linked list
System.out.println("LIST OF SONGS");
System.out.println("-------------");
printPlaylist(headNode);
}
}
public class SongNode {
private String songTitle;
private int songLength;
private String songArtist;
private SongNode nextNodeRef; // Reference to the next node
public SongNode() {
songTitle = "";
songLength = 0;
songArtist = "";
nextNodeRef = null;
}
// Constructor
public SongNode(String songTitleInit, int songLengthInit, String songArtistInit) {
this.songTitle = songTitleInit;
this.songLength = songLengthInit;
this.songArtist = songArtistInit;
this.nextNodeRef = null;
}
// Constructor
public SongNode(String songTitleInit, int songLengthInit, String songArtistInit, SongNode
nextLoc) {
this.songTitle = songTitleInit;
this.songLength = songLengthInit;
this.songArtist = songArtistInit;
this.nextNodeRef = nextLoc;
}
// insertAfter
public void insertAfter(SongNode nodeLoc) {
SongNode tmpNext;
tmpNext = this.nextNodeRef;
this.nextNodeRef = nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
}
// Get location pointed by nextNodeRef
public SongNode getNext() {
return this.nextNodeRef;
}
// TODO: Write printSongInfo() method
public void printInfo(){
System.out.println("Title: " + songTitle);
System.out.println("Length: " + songLength);
System.out.println("Artist: " + songArtist);
}
}.
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.
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.
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.
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)
.
Given main(), complete the SongNode class to include the printSong.pdf
Given main(), complete the SongNode class to include the printSongInfo() method. Then write
the Playlist class' printPlaylist() method to print all songs in the playlist. DO NOT print the
dummy head node.
Ex: If the input is:
Stomp!
380
The Brothers Johnson
The Dude
337
Quincy Jones
You Don't Own Me
151
Lesley Gore
-1
the output is:
LIST OF SONGS
-------------
Title: Stomp!
Length: 380
Artist: The Brothers Johnson
Title: The Dude
Length: 337
Artist: Quincy Jones
Title: You Don't Own Me
Length: 151
Artist: Lesley Gore
PLAYLIST.JAVA
import java.util.Scanner;
public class Playlist {
public static void main (String[] args) {
Scanner scnr = new Scanner(System.in);
SongNode headNode;
SongNode currNode;
SongNode lastNode;
String songTitle;
int songLength;
String songArtist;
// Front of nodes list
headNode = new SongNode();
lastNode = headNode;
// Read user input until -1 entered
songTitle = scnr.nextLine();
while (!songTitle.equals("-1")) {
songLength = scnr.nextInt();
scnr.nextLine();
songArtist = scnr.nextLine();
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode.insertAfter(currNode);
lastNode = currNode;
songTitle = scnr.nextLine();
}
// Print linked list
System.out.println("LIST OF SONGS");
System.out.println("-------------");
printPlaylist(headNode);
}
}
SONGNODE.JAVA
public class SongNode {
private String songTitle;
private int songLength;
private String songArtist;
private SongNode nextNodeRef; // Reference to the next node
public SongNode() {
songTitle = "";
songLength = 0;
songArtist = "";
nextNodeRef = null;
}
// Constructor
public SongNode(String songTitleInit, int songLengthInit, String songArtistInit) {
this.songTitle = songTitleInit;
this.songLength = songLengthInit;
this.songArtist = songArtistInit;
this.nextNodeRef = null;
}
// Constructor
public SongNode(String songTitleInit, int songLengthInit, String songArtistInit, SongNode
nextLoc) {
this.songTitle = songTitleInit;
this.songLength = songLengthInit;
this.songArtist = songArtistInit;
this.nextNodeRef = nextLoc;
}
// insertAfter
public void insertAfter(SongNode nodeLoc) {
SongNode tmpNext;
tmpNext = this.nextNodeRef;
this.nextNodeRef = nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
}
// Get location pointed by nextNodeRef
public SongNode getNext() {
return this.nextNodeRef;
}
// TODO: Write printSongInfo() method
}.
8.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.
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.
In C++ I need help with this method that Im trying to write fillLi.pdf
In C++ I need help with this method that I'm trying to write: fillListFromFile( ) : void -- this
method will add elements to the list from a file called linkedListData1.txt HINT: this is where
you will keep track of the number of elements in the list
I have all of the other methods, but I'm stuck on this one and I've added it as the last method in
the application. The code I have so far is below.
.cpp file:
.h file:
main:
#include
#include
#include
#include "Node.h"
using namespace std;
void displayList(Node*);
void insertFront(Node** head, int value);
void insertBack(Node** ptrToHead, int value);
void insertAfter(Node* previous, int value);
void deleteAtN(Node** ptrToHead, int n);
void deleteNode(Node** ptrToHead, int searchVal);
void clearList(Node**);
bool searchVal(Node** head, int value);
int countFrequencyOf(Node** ptrTohead, int value);
int size(Node** ptrTohead);
void displayFromFrontToN(Node** ptrToHead, int n);
void displayFromNToEnd(Node** ptrToHead, int n);
void insertInOrder(Node** head, Node* ptrToHead);
void displayInRows(Node** ptrToHead);
int main()
{
Node* node1 = new Node();
node1->setValue(10);
Node* node2 = new Node();
node2->setValue(20);
Node* node3 = new Node();
node3->setValue(30);
node1->next = node2;
node2->next = node3;
Node* head = node1;
displayList(head);
insertFront(&head, 5);
displayList(head);
insertBack(&head, 50);
displayList(head);
insertBack(&head, 60);
displayList(head);
insertAfter(node2, 25);
displayList(head);
deleteAtN(&head, 2);
displayList(head);
deleteNode(&head, 50);
displayList(head);
clearList(&head);
displayList(head);
insertFront(&head, 5);
insertFront(&head, 10);
insertFront(&head, 20);
insertBack(&head, 50);
searchVal(&head, 50);
displayList(head);
countFrequencyOf(&head, 25);
displayList(head);
insertBack(&head, 25);
insertFront(&head, 25);
countFrequencyOf(&head, 25);
displayList(head);
size(&head);
cout << "add one item to list" << endl;
insertBack(&head, 25);
size(&head);
displayList(head);
cout << "Display From Front To N" << endl;
displayFromFrontToN(&head, 4);
cout << "Display From N To End" << endl;
displayFromNToEnd(&head, 3);
cout << "Display In Rows" << endl;
displayInRows(&head);
insertFront(&head, 12);
insertFront(&head, 17);
insertFront(&head, 22);
insertBack(&head, 58);
cout << "Display In Rows" << endl;
displayInRows(&head);//call displayInRows()
return 0;
}//end main()
void displayList(Node* ptr) {
if (ptr == nullptr)
cout << "empty list" << endl;
else {
while (ptr != nullptr) {
cout << ptr->getValue() << endl;
ptr = ptr->next;
}
}
cout << "---------------------------" << endl;
}//end displayList()
void insertFront(Node** head, int value) {
Node* newNode = new Node();
newNode->setValue(value);
//cout<< newNode->getValue() << endl;
newNode->next = *head;
*head = newNode;
}
void insertBack(Node** ptrToHead, int value) {
Node* newNode = new Node();
newNode->setValue(value);
newNode->next = nullptr;
if (*ptrToHead == nullptr)
{
*ptrToHead = newNode;
}//end if
else
{
Node* last .
Help I keep getting the same error when running a code. Below is the.pdf
Help I keep getting the same error when running a code. Below is the code and the instructions
about the code.
import java.util.Arrays;
public class Album implements Comparable {
private final int id;
private final String[] artists;
private final int numSongs;
public Album(int id, String title, String[] artists, int numSongs) {
this.id = id;
this.artists = new String[]{Arrays.toString(artists)};
this.numSongs = numSongs;
}
public int getId() {
return id;
}
@Override
public int compareTo(Album other) {
return Integer.compare(this.numSongs, other.numSongs);
}
@Override
public String toString() {
StringBuilder artistNames = new StringBuilder();
for (String artist : artists) {
artistNames.append(artist).append(", ");
}
artistNames.delete(artistNames.length() - 2, artistNames.length());
return "ID: " + id + " -- " + numSongs + " songs -- [" + artistNames + "]";
}
}
import java.util.Random;
public class DoublyLinkedList {
private static class Node {
T data;
Node prev;
Node next;
Node(T data) {
this.data = data;
}
}
private Node head;
private Node tail;
private int size;
public DoublyLinkedList() {
head = null;
tail = null;
size = 0;
}
public Node append(T data) {
Node newNode = new Node<>(data);
if (head == null) {
head = newNode;
} else {
tail.next = newNode;
newNode.prev = tail;
}
tail = newNode;
size++;
return newNode;
}
public Node insert(int location, T data) {
if (location < 0 || location > size) {
throw new IllegalArgumentException("Invalid location");
}
Node newNode = new Node<>(data);
if (location == 0) {
newNode.next = head;
if (head != null) {
head.prev = newNode;
}
head = newNode;
if (tail == null) {
tail = newNode;
}
} else if (location == size) {
tail.next = newNode;
newNode.prev = tail;
tail = newNode;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
newNode.prev = current.prev;
newNode.next = current;
current.prev.next = newNode;
current.prev = newNode;
}
size++;
return newNode;
}
public Node delete(int location) {
if (location < 0 || location >= size) {
throw new IllegalArgumentException("Invalid location");
}
Node deletedNode;
if (location == 0) {
deletedNode = head;
head = head.next;
if (head != null) {
head.prev = null;
} else {
tail = null;
}
} else if (location == size - 1) {
deletedNode = tail;
tail = tail.prev;
tail.next = null;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
deletedNode = current;
current.prev.next = current.next;
current.next.prev = current.prev;
}
size--;
return deletedNode;
}
public int getIndex(T data) {
Node current = head;
for (int i = 0; i < size; i++) {
if (current.data.equals(data)) {
return i;
}
current = current.next;
}
return -1;
}
@Override
public String toString() {
StringBuilder result = new StringBuilder();
Node current = head;
while (current != null) {
result.append(current.data).append(" -> ");
current = current.next;
}
result.append("NULL");
return result.toString();
}
public Node shuffle() {
Random r.
Problem 2 struct to hold information about a song struct So.pdf
// Problem 2
// struct to hold information about a song
struct Song
{
int id;
char name[MAX_SONG_NAME_LENGTH];
char singer[MAX_SINGER_NAME_LENGTH];
genreType genre;
int year;
struct Song* next;
};
// Function declarations
struct Song* createSong(int id, char* name, char* singer, char* genre, int year);
void printPlaylist(struct Song* playlist);
void add_song(struct Song** playlist, struct Song* newSong);
struct Song* search_song(struct Song* playlist, char* name);
int edit_song(struct Song* playlist, char* name, char* singer, char* genre, int year);
int delete_song(struct Song* playlist, char* name);
// function to create a new song
struct Song* createSong(int id, char* name, char* singer, char* genre, int year)
{
struct Song* newSong = (struct Song*)malloc(sizeof(struct Song));
newSong->id = id;
strcpy(newSong->name, name);
strcpy(newSong->singer, singer);
if (strcmp(genre, "Pop") == 0)
newSong->genre = 1;
else if (strcmp(genre, "Rock") == 0)
newSong->genre = 2;
else if (strcmp(genre, "Reggae") == 0)
newSong->genre = 3;
else if (strcmp(genre, "Country") == 0)
newSong->genre = 4;
else if (strcmp(genre, "Blues") == 0)
newSong->genre = 5;
else if (strcmp(genre, "Balad") == 0)
newSong->genre = 6;
else
newSong->genre = 0;
newSong->year = year;
newSong->next = NULL;
return newSong;
}
// function to print the playlist
void printPlaylist(struct Song* playlist)
{
struct Song* current = playlist;
while (current != NULL)
{
printf("%d\t%s\t%s\t%d\t%d\n", current->id, current->name, current->singer, current-
>genre, current->year);
current = current->next;
}
}
// function to add a song to the end of the playlist
void add_song(struct Song** playlist, struct Song* newSong)
{
// TODO: Implement function
}
// function to search for a song by name
struct Song* search_song(struct Song* playlist, char* name)
{
// TODO: Implement function
}
// function to edit a song by name
int edit_song(struct Song* playlist, char* name, char* singer, char* genre, int year)
{
// TODO: Implement function
}
// function to delete a song by name
int delete_song(struct Song* playlist, char* name)
{
// TODO: Implement function
}
void flushSngIn()
{
char c;
do
c = getchar();
while (c != '\n' && c != EOF);
}
int main()
{
// Problem 1
int choice = 0;
int songCount = 0;
char songName_input[MAX_SONG_NAME_LENGTH],
singerName_input[MAX_SINGER_NAME_LENGTH];
char genre_input[20];
unsigned int year_input, add_result = 0;
struct musicRepository music[20];
struct musicRepository* song = NULL;
initializeRepository(music, 20);
music[0].ID = numSongs + 1; numSongs++;
strcpy(music[0].songName, "Shape of You");
strcpy(music[0].singerName, "Ed Sheeran");
music[0].genre = 1;
music[0].year = 2017;
songCount++;
music[1].ID = numSongs + 1; numSongs++;
strcpy(music[1].songName, "Despacito");
strcpy(music[1].singerName, "Luis Fonsi");
music[1].genre = 1;
music[1].year = 2017;
songCount++;
music[2].ID = numSongs + 1; numSongs++;
strcpy(music[2].songName, "Uptown Funk");
strcpy(music[2].singerName, "Mark Ron.
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..
lab03build.bat@echo offclsset DRIVE_LETTER=1set.docx
lab03/build.bat
@echo off
cls
set DRIVE_LETTER=%1:
set PATH=%DRIVE_LETTER%\MinGW\bin;%DRIVE_LETTER%\MinGW\msys\1.0\bin;c:\Windows;c:\Windows\system32
g++ -c String.cpp
g++ -c Tokens.cpp
g++ -c ReadFile.cpp
g++ -c WriteFile.cpp
g++ -c Keyboard.cpp
g++ -c Random.cpp
g++ -c Matrix.cpp
g++ -c Poly.cpp
g++ -c CD.cpp
g++ -c Song.cpp
g++ -c Integer.cpp
g++ -c Double.cpp
g++ -c HighPerformanceCounter.cpp
g++ -c Permutation.cpp
ar -r libCSC2110.a *.o
lab03/fallout.txt
20
observation
worshipping
description
nondescript
eliminating
survivalist
destructive
infestation
surrounding
persecution
interesting
explanation
recognition
programming
personality
hospitality
distinguish
devastation
nightvision
engineering
lab03/Lab03Files.zip
CD.cpp
#include "CD.h"
#include "ListArrayIterator.h"
#include "ReadFile.h"
#include "Tokens.h"
using namespace CSC2110;
#include <iostream>
using namespace std;
char CD::getRadixChar(CD* cd, int index) //1-based
{
String* title = cd->getKey();
int title_len = title->length();
if (index <= title_len)
{
return title->charAt(index - 1);
}
else
{
return 32; //ascii for a space
}
}
int CD::compare_items(CD* one, CD* two)
{
String* title_1 = one->getKey();
String* title_2 = two->getKey();
int title_compare = title_1->compare(title_2); //asc
return title_compare;
}
int CD::compare_keys(String* sk, CD* cd)
{
String* title_1 = sk;
String* title_2 = cd->getKey();
int title_compare = title_1->compare(title_2); //asc
return title_compare;
}
CD::CD(String* artist, String* title, int year, int rating, int num_tracks)
{
this->artist = artist;
this->title = title;
this->year = year;
this->rating = rating;
this->num_tracks = num_tracks;
songs = new ListArray<Song>();
}
CD::~CD()
{
ListArrayIterator<Song>* iter = songs->iterator();
while(iter->hasNext())
{
Song* song = iter->next();
delete song;
}
delete iter;
delete songs;
songs = NULL;
delete artist;
delete title;
}
String* CD::getKey()
{
return title;
}
void CD::addSong(String* title, String* length)
{
int track_count = songs->size();
if (track_count < num_tracks)
{
Song* song = new Song(title, length);
songs->add(song);
}
}
void CD::displayCD()
{
cout << "Artist: ";
artist->displayString();
cout << endl;
cout << "Title: ";
title->displayString();
cout << endl;
cout << "Year: " << year << endl;
cout << "Rating: " << rating << endl;
ListArrayIterator<Song>* iter = songs->iterator();
int count = 1;
while(iter->hasNext())
{
Song* song = iter->next();
cout << count << " ";
song->displaySong();
count++;
}
delete iter;
cout << endl;
}
ListArray<CD>* CD::readCDs(const char* file_name)
{
ReadFile* r ...
Can someone solve the TODO parts of the following problem i.pdf
Can someone solve the TODO parts of the following problem
#include <iostream>
#include <fstream>
#include <sstream>
#include<string>
#include "Queuecpp.h"
#include "Songcpp.h"
#include "RequestCpp.h"
//GIVEN
int main() {
LinkedList<Song> list;
Queue<Request> q;
populateSongDataBase(list); // fill the Songs Data Base into Linked List
std::cout<<"*************************************n";
list.printList(); //
std::cout<<"*************************************n";
populateRequests(q); // fill the request q
std::cout<<"n";
std::cout<<"---------------PRINTING QUEUE-------------------n";
q.printList();
std::cout<<"------------------------------------n";
processQueue(list,q); // process the requests
std::cout<<"*************************************n";
list.printList();
std::cout<<"*************************************n";
}
//GIVEN
void populateRequests(Queue<Request> &q){
}
//GIVEN
std::string playSong(LinkedList<Song>&list, Song s){
}
//GIVEN
void printTopTenSongs(LinkedList<Song>& list){
}
//TODO
void addThisSong(LinkedList<Song> &list, Song s){
//TODO
/* Use this code
if (found>=0) {std::cout<<"ADDED THIS SONG "<<found+1<<" " ;list.printSong(found+1);}
else std::cout<<"SORRY CANNOT FIND SONG n";
*/
}
//TODO
void removeThisSong(LinkedList<Song> &list, Song s){
/* Use this code
if (found>=0) {std::cout<<"SORRY CANNOT REMOVE THIS SONG - STILL FOUND AT
"<<found;}
else{ std::cout<<"REMOVED THIS SONG n";
std::cout<<"THE SONG AT CHARTPOSITION "<<chartPos<<" IS NOW ";
list.printSong(chartPos); std::cout<<"n";
*/
}
}
//TODO
void moveThisSong(LinkedList<Song> &list, Song s, int pos){
int chartPos=list.get(s);
std::cout<<"MOVING SONG "<<s.toString()<<"n";
list.move(s,pos);
std::cout<<"ITS NEW CHART POSITION n";
list.printSong(pos);
std::cout<<"THE SONG AT PREVIOUS POSITION "<<chartPos+1<< " IS NOW
";list.printSong(chartPos+1);
}
//GIVEN
void processRequest(LinkedList<Song> &list,std::string action, std::string title,std::string singer,int
chartPos){
Song s(title,singer,chartPos);
char ch =action[0];
switch(ch){
case 'P' : std::cout<<playSong(list,s)<<"n";break;
case 'A' : addThisSong(list,s);break;;
case 'R' : removeThisSong(list,s);break;
case 'M' : moveThisSong(list,s,chartPos);break;
case 'T' : printTopTenSongs(list);break;
}
}
//TODO
void processQueue(LinkedList<Song> &list ,Queue<Request>& q){
int requestNumber=1;
//Create an iterator for the Queue to iteratate through requests
std::cout<<"-------------------------------------------------------------------------n";
// call processRequest
std::cout<<"-------------------------------------------------------------------------n"
std::cout<<"-------------------------------------------------------------------------n";
}
//GIVEN
void populateSongDataBase(LinkedList<Song> &list){
std::string line="";
std::string token="";
std::string title="";
std::string singer="";
int chartPos=-1;
try {
std::ifstream input("SongsData.txt");
if (input.fail())
throw new std::string("FILE OPEN ERROR EXCEPTION n");
else{
while (getli.
#include iostream #include fstream #include cstdlib #.pdf
#include
#include
#include
#include
using namespace std;
struct city
{
string name; // name of the city
city *next; // pointer to the next city
int numberMessages; // how many messages passed through this city
string message; // message we are sending accross
};
city* addCity(city *head, city *previous, string cityName );
city* deleteCity(city *head, string cityName);
city* deleteEntireNetwork(city *head);
city* searchNetwork(city *head, string cityName);
city* loadDefaultSetup(city *head);
void transmitMsg(city *head, string receiver, string filename);
void printPath(city *head);
void displayMenu();
city* handleUserInput(city *head);
/* Do NOT modify main function */
int main(int argc, char* argv[])
{
// pointer to the head of our network of cities
city *head = NULL;
head = handleUserInput(head);
printPath(head);
head = deleteEntireNetwork(head);
if (head == NULL)
cout << \"Path cleaned\" << endl;
else
printPath(head);
cout << \"Goodbye!\" << endl;
return 0;
}
/*
* Purpose: handle the interaction with the user
* Do NOT modify
*/
city* handleUserInput(city *head)
{
bool quit = false;
string s_input;
int input;
// loop until the user quits
while (!quit)
{
displayMenu();
// read in input, assuming a number comes in
getline(cin, s_input);
input = stoi(s_input);
switch (input)
{
// print all nodes
case 1: //rebuild network
head = loadDefaultSetup(head);
printPath(head);
break;
case 2: // print path
printPath(head);
break;
case 3: //message is read in from file
{
string cityReceiver;
cout << \"Enter name of the city to receive the message: \" << endl;
getline(cin, cityReceiver);
cout << \"Enter the message to send: \" << endl;
string message;
getline(cin, message);
transmitMsg(head, cityReceiver, message);
}
break;
case 4:
{
string newCityName;
string prevCityName;
cout << \"Enter a new city name: \" << endl;
getline(cin, newCityName);
cout << \"Enter the previous city name (or First): \" << endl;
getline(cin, prevCityName);
// find the node containing prevCity
city *tmp = NULL;
if(prevCityName !=\"First\")
tmp = searchNetwork(head, prevCityName);
// add the new node
head = addCity(head, tmp, newCityName);
printPath(head);
}
break;
case 5: // delete city
{
string city;
cout << \"Enter a city name: \" << endl;
getline(cin, city);
head = deleteCity(head, city);
printPath(head);
}
break;
case 6: // delete network
head = deleteEntireNetwork(head);
break;
case 7: // quit
quit = true;
cout << \"Quitting... cleaning up path: \" << endl;
break;
default: // invalid input
cout << \"Invalid Input\" << endl;
break;
}
}
return head;
}
/*
* Purpose: Add a new city to the network
* between the city *previous and the city that follows it in the network.
*/
city* addCity(city *head, city *previous, string cityName )
{
city* add = new city; //to distinguish and create the new node, i named it add
add->name = cityName;
city* tmp = new city;
tmp=head;
if(previous == NULL){
add->next = head;
head = add;
}
while(tmp != NULL && previous != tmp){
tmp = tmp->next;
}
if(tm.
Need help getting past an error in C++! I have all my code pasted down.docx
Need help getting past an error in C++!
I have all my code pasted down below. My issue is that I'm trying to call the functions I have in main, but they don't do anything as they are now. I'm almost positive I need to call them with parenthesis, but putting them in always results with an error saying "A nonstatic member reference must be relative to a specific object."
Below will be the source file, then the header file I made all the functions in. Thanks in advance, y'all are the best!
(Source.ccp)
#include "Header.h"
int main() {
NoteList noteList;
noteList.loadData("input.txt");
bool finish = false;
int choice;
while (finish != true) {
cout << "\n** Menu **\n"
<< "1. LIST NOTES BY DATE\n"
<< "2. LIST NOTES BY COMPOSER\n"
<< "3. DELETE MOST RECENT NOTE\n"
<< "4. EXIT\n" << endl;
cin >> choice;
if (choice == 1)
{
&NoteList::listNotesByDate();
}
else if (choice == 2)
{
&NoteList::listNotesByComposer;
}
else if (choice == 3)
{
&NoteList::deleteFrontNote;
}
else if (choice == 4)
{
cout << "\nOperations ended";
finish = true;
}
else
{
cout << "\nInput not recognized. Please choose a number between 1 and 4." << endl;
}
}
return 0;
}
(Header.h)
#pragma once
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
class Date {
private:
int month, day, year;
public:
Date() : month(0), day(0), year(0) {}
void setDate(string strDate) {
month = stoi(strDate.substr(0, 2));
day = stoi(strDate.substr(3, 2));
year = stoi(strDate.substr(6, 4));
}
string showDate() {
return to_string(month) + "-" + to_string(day) + "-" + to_string(year);
}
int calculateDays() {
return year * 365 + month * 31 + day;
}
};
class Note {
private:
string composer;
Date date;
string subject;
string body;
public:
Note(string c, string d, string s, string b) : composer(c), subject(s), body(b) {
date.setDate(d);
}
string getComposer() {
return composer;
}
Date getDate() {
return date;
}
string getSubject() {
return subject;
}
string getBody() {
return body;
}
};
struct noteNode {
Note note;
noteNode* next;
};
class NoteList {
private:
noteNode* head;
public:
NoteList() : head(nullptr) {}
void loadData(const char* filename) {
ifstream file(filename);
if (file.is_open()) {
string line;
string composer, date, subject, body;
while (getline(file, line)) {
if (line == "##########") {
Note note = Note(composer, date, subject, body);
addNote(note);
composer.clear();
date.clear();
subject.clear();
body.clear();
}
else if (line.substr(0, 10) == "COMPOSER: ") {
composer = line.substr(10);
}
else if (line.substr(0, 6) == "DATE: ") {
date = line.substr(6);
}
else if (line.substr(0, 9) == "SUBJECT: ") {
subject = line.substr(9);
}
else {
body += line + "\n";
}
}
file.close();
}
else {
cerr << "Unable to open file " << filename << endl;
}
}
void addNote(Note note) {
noteNode* newNode = new noteNode{note, head};
newNode->note = note;
newNode->next = head;
head =.
The provided codetrack_file_handling.rb class Track att.pdf
The provided code:
*track_file_handling.rb
class Track
attr_accessor :name, :location
def initialize (name, location)
@name = name
@location = location
end
end
# Returns an array of tracks read from the given file
def read_tracks(music_file)
count = music_file.gets().to_i()
tracks = Array.new()
# Put a while loop here which increments an index to read the tracks
track = read_track(music_file)
tracks << track
return tracks
end
# reads in a single track from the given file.
def read_track(a_file)
# complete this function
# you need to create a Track here.
end
# Takes an array of tracks and prints them to the terminal
def print_tracks(tracks)
# Use a while loop with a control variable index
# to print each track. Use tracks.length to determine how
# many times to loop.
# Print each track use: tracks[index] to get each track record
end
# Takes a single track and prints it to the terminal
def print_track(track)
puts(track.name)
puts(track.location)
end
# Open the file and read in the tracks then print them
def main()
a_file = File.new("input.txt", "r") # open for reading
# Print all the tracks
print_tracks(tracks)
end
main()
*input.txt
3
Crackling Rose
sounds/01-Cracklin-rose.wav
Soolaimon
sounds/06-Soolaimon.wav
Sweet Caroline
sounds/20-Sweet_Caroline.wav
Can anyone pls help me with this Ruby task, it's urgent. Thx! Use the code provided to get
started. You must enhance the code provided as follows: - Complete the provided code so that it
reads in an array of tracks then prints them out. The program output (using the file input.txt)
should look as follows: MacBook-Pro-6:TuteTasks mmitchel1s ruby music_tracks_only.rb
Crackling Rose sounds/01-Cracklin-rose.wav Soolaimon sounds/06-Soolaimon.wav Sweet
Caroline sounds/20-Sweet_Caroline.wav MacBook-Pro-6:TuteTasks mmitchel1s Once your
program is running upload a screenshot to the workspace. Below is a structure chart for this task:.
Please solve the TODO parts of the following probelm incl.pdf
Please solve the TODO parts of the following probelm.
#include <iostream>
#include <fstream>
#include <sstream>
#include<string>
#include "Queuecpp.h"
#include "Songcpp.h"
#include "RequestCpp.h"
void populateRequests(Queue<Request>& q);
void populateSongDataBase(LinkedList<Song> &list);
void processQueue(LinkedList<Song> &list,Queue<Request>& q);
void processRequest(std::string action, std::string title,std::string singer,int chartPos);
//GIVEN
int main() {
LinkedList<Song> list;
Queue<Request> q;
populateSongDataBase(list); // fill the Songs Data Base into Linked List
std::cout<<"************************************* ";
list.printList(); //
std::cout<<"************************************* ";
populateRequests(q); // fill the request q
std::cout<<" ";
std::cout<<"---------------PRINTING QUEUE------------------- ";
q.printList();
std::cout<<"------------------------------------ ";
processQueue(list,q); // process the requests
std::cout<<"************************************* ";
list.printList();
std::cout<<"************************************* ";
}
//TODO
void populateRequests(Queue<Request> &q){
}
std::string playSong(LinkedList<Song>&list, Song s){
if (list.get(s)>=0){
return "PLAYING :"+ s.toString()+" ";
}
else{
return "SONG NOT FOUND ";
}
}
//GIVEN
void printTopTenSongs(LinkedList<Song>& list){
std::cout<<"PLAYING TOP TEN SONG __________ ";
list.print(10);
}
//TODO
void addThisSong(LinkedList<Song> &list, Song s){
}
//TODO
void removeThisSong(LinkedList<Song> &list, Song s){
}
//TODO
void moveThisSong(LinkedList<Song> &list, Song s, int pos){
}
//GIVEN
void processRequest(LinkedList<Song> &list,std::string action, std::string title,std::string singer,int
chartPos){
Song s(title,singer,chartPos);
char ch =action[0];
switch(ch){
case 'P' : std::cout<<playSong(list,s)<<" ";break;
case 'A' : addThisSong(list,s);break;;
case 'R' : removeThisSong(list,s);break;
case 'M' : moveThisSong(list,s,chartPos);break;
case 'T' : printTopTenSongs(list);break;
}
}
//TODO
void processQueue(LinkedList<Song> &list ,Queue<Request>& q){
int requestNumber=1;
//Create an iterator for the Queue to iteratate through requests
std::cout<<"------------------------------------------------------------------------- ";
// call processRequest
std::cout<<"------------------------------------------------------------------------- "
std::cout<<"------------------------------------------------------------------------- ";
}
//TODO
void populateSongDataBase(LinkedList<Song> &list){
}
#include "Queue.h"
//template <class T>
//Queue<T>::Queue(){
// back=nullptr;
//}
template <class T>
//TODO
// add an element t to the end queue
// this should be an O(1) operation
void Queue<T>::add(T t){
}
//TODO
//remove an element from the front of the queue
// this should be an O(1) operation
template <class T>
void Queue<T>::remove(){
//TODO
// if queue us empty
// throw new std::string("NULL POINTER EXCEPTION QUEUE IS EMPTY ");
}
#include "ListNode.h"
#include<iostream>
template <class T>
Li.
Caso Plymouth Tube Company El da despus de una reunin .pdf
Caso Plymouth Tube Company
El da despus de una reunin de la junta de febrero de 2013, Donald C. Jr. (Van), el director
ejecutivo de cuarta generacin y presidente de Plymouth Tube Company, conoci a su hija Stacy, la
administradora financiera y el nico miembro de quinta generacin en el negocio, en la oficina.
Estaban tratando de descubrir la mejor manera de obtener comentarios de los accionistas de la
junta y la familia para una expansin sustancial de su planta de Hopkinsville, Kentucky, para el
mercado aeroespacial. Una expansin de la Fase I de $ 17 millones estaba a punto de
completarse. En la reunin, la gerencia haba propuesto una inversin de Fase II de $63 millones. La
oportunidad se haba estado considerando durante ms de un ao y el proyecto tardara tres aos en
completarse, por lo que la gerencia quera tomar una decisin pronto.
Plymouth tena fuertes ventajas competitivas de innovacin y calidad en el segmento del mercado
aeroespacial. Van, de 64 aos, sinti que Plymouth podra dominar este mercado actuando pronto.
Si no hacemos esto, eventualmente un competidor lo har, dijo. Stacy estaba ansiosa por apoyar la
visin estratgica de su padre y estuvo de acuerdo, pero en su interior sinti que sera mejor buscar
tambin en otros segmentos del mercado, ya que senta que haba otras oportunidades interesantes
disponibles para Plymouth.
Este fue el desembolso ms grande que Plymouth jams haba considerado hacer en dlares
absolutos, aunque en las dcadas de 1980 y 1990 el padre de Van haba realizado inversiones
significativas que eran comparables para su poca. Van sinti que sera una gran inversin en el
futuro de la familia y mantendra la vitalidad de la empresa a largo plazo. Si Van sigui la misma
trayectoria profesional que su padre, tena ocho aos ms (hasta los 72 aos) para administrar el
negocio y supervisar esta oportunidad, suponiendo que su vigor e inters continuaran. Van an no
haba formalizado un plan de sucesin personal.
La gerencia estaba abrumadoramente a favor del proyecto, aunque algunos gerentes preferan
una inversin inicial menos agresiva de $48 millones, que crecera una vez que se generaran los
ingresos. El equipo de ventas estaba ansioso por comenzar. Van pens que el esfuerzo se
alineaba bien con la misin corporativa de Plymouth. Si bien evalu el riesgo de fracaso como bajo,
identific algunas desventajas posibles, pero poco probables.
La expansin podra resultar en productos de menor calidad; podra hacer que Plymouth se volviera
demasiado dependiente de la industria aeroespacial; o podra desviar la atencin y los recursos del
resto de las plantas, productos y mercados de la empresa. Van pens que su padre de 88 aos,
Gramps, quien estaba en su ltima reunin de la junta como miembro y presidente, pareca
levemente a favor del proyecto.
Un miembro de la junta que no es de la familia observ sobre la reunin de la junta de febrero:
Aunque la junta valor enormemente la perspicacia de Van sobre lo que los clientes de Plymouth
queran en el futuro, los directo.
3131 Monitor control and protect communications ie i.pdf
3.13.1 Monitor, control, and protect communications (i.e., information transmitted or received by
organizational systems) at the external boundaries and key internal boundaries of organizational
systems.
Do policies for managed interfaces such as gateways, routers, firewalls, VPNs, and company
DMZs restrict external web traffic to only designated servers exist?
Has the company identified network communications boundaries?
Does the system monitor and manage communications at the system boundary and at key
internal boundaries within the system?
Do policies for managed interfaces such as gateways, routers, firewalls, VPNs, and company
DMZs restrict external web traffic to only designated servers exist?.
More Related Content
Similar to maincpp include ltiostreamgt include ltstringgt.pdf
It's not working what am I doing wrong- Given main()- complete the Son.pdf
It's not working what am I doing wrong?
Given main(), complete the 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);
}
}.
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.
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.
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.
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)
.
Given main(), complete the SongNode class to include the printSong.pdf
Given main(), complete the SongNode class to include the printSongInfo() method. Then write
the Playlist class' printPlaylist() method to print all songs in the playlist. DO NOT print the
dummy head node.
Ex: If the input is:
Stomp!
380
The Brothers Johnson
The Dude
337
Quincy Jones
You Don't Own Me
151
Lesley Gore
-1
the output is:
LIST OF SONGS
-------------
Title: Stomp!
Length: 380
Artist: The Brothers Johnson
Title: The Dude
Length: 337
Artist: Quincy Jones
Title: You Don't Own Me
Length: 151
Artist: Lesley Gore
PLAYLIST.JAVA
import java.util.Scanner;
public class Playlist {
public static void main (String[] args) {
Scanner scnr = new Scanner(System.in);
SongNode headNode;
SongNode currNode;
SongNode lastNode;
String songTitle;
int songLength;
String songArtist;
// Front of nodes list
headNode = new SongNode();
lastNode = headNode;
// Read user input until -1 entered
songTitle = scnr.nextLine();
while (!songTitle.equals("-1")) {
songLength = scnr.nextInt();
scnr.nextLine();
songArtist = scnr.nextLine();
currNode = new SongNode(songTitle, songLength, songArtist);
lastNode.insertAfter(currNode);
lastNode = currNode;
songTitle = scnr.nextLine();
}
// Print linked list
System.out.println("LIST OF SONGS");
System.out.println("-------------");
printPlaylist(headNode);
}
}
SONGNODE.JAVA
public class SongNode {
private String songTitle;
private int songLength;
private String songArtist;
private SongNode nextNodeRef; // Reference to the next node
public SongNode() {
songTitle = "";
songLength = 0;
songArtist = "";
nextNodeRef = null;
}
// Constructor
public SongNode(String songTitleInit, int songLengthInit, String songArtistInit) {
this.songTitle = songTitleInit;
this.songLength = songLengthInit;
this.songArtist = songArtistInit;
this.nextNodeRef = null;
}
// Constructor
public SongNode(String songTitleInit, int songLengthInit, String songArtistInit, SongNode
nextLoc) {
this.songTitle = songTitleInit;
this.songLength = songLengthInit;
this.songArtist = songArtistInit;
this.nextNodeRef = nextLoc;
}
// insertAfter
public void insertAfter(SongNode nodeLoc) {
SongNode tmpNext;
tmpNext = this.nextNodeRef;
this.nextNodeRef = nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
}
// Get location pointed by nextNodeRef
public SongNode getNext() {
return this.nextNodeRef;
}
// TODO: Write printSongInfo() method
}.
8.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.
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.
In C++ I need help with this method that Im trying to write fillLi.pdf
In C++ I need help with this method that I'm trying to write: fillListFromFile( ) : void -- this
method will add elements to the list from a file called linkedListData1.txt HINT: this is where
you will keep track of the number of elements in the list
I have all of the other methods, but I'm stuck on this one and I've added it as the last method in
the application. The code I have so far is below.
.cpp file:
.h file:
main:
#include
#include
#include
#include "Node.h"
using namespace std;
void displayList(Node*);
void insertFront(Node** head, int value);
void insertBack(Node** ptrToHead, int value);
void insertAfter(Node* previous, int value);
void deleteAtN(Node** ptrToHead, int n);
void deleteNode(Node** ptrToHead, int searchVal);
void clearList(Node**);
bool searchVal(Node** head, int value);
int countFrequencyOf(Node** ptrTohead, int value);
int size(Node** ptrTohead);
void displayFromFrontToN(Node** ptrToHead, int n);
void displayFromNToEnd(Node** ptrToHead, int n);
void insertInOrder(Node** head, Node* ptrToHead);
void displayInRows(Node** ptrToHead);
int main()
{
Node* node1 = new Node();
node1->setValue(10);
Node* node2 = new Node();
node2->setValue(20);
Node* node3 = new Node();
node3->setValue(30);
node1->next = node2;
node2->next = node3;
Node* head = node1;
displayList(head);
insertFront(&head, 5);
displayList(head);
insertBack(&head, 50);
displayList(head);
insertBack(&head, 60);
displayList(head);
insertAfter(node2, 25);
displayList(head);
deleteAtN(&head, 2);
displayList(head);
deleteNode(&head, 50);
displayList(head);
clearList(&head);
displayList(head);
insertFront(&head, 5);
insertFront(&head, 10);
insertFront(&head, 20);
insertBack(&head, 50);
searchVal(&head, 50);
displayList(head);
countFrequencyOf(&head, 25);
displayList(head);
insertBack(&head, 25);
insertFront(&head, 25);
countFrequencyOf(&head, 25);
displayList(head);
size(&head);
cout << "add one item to list" << endl;
insertBack(&head, 25);
size(&head);
displayList(head);
cout << "Display From Front To N" << endl;
displayFromFrontToN(&head, 4);
cout << "Display From N To End" << endl;
displayFromNToEnd(&head, 3);
cout << "Display In Rows" << endl;
displayInRows(&head);
insertFront(&head, 12);
insertFront(&head, 17);
insertFront(&head, 22);
insertBack(&head, 58);
cout << "Display In Rows" << endl;
displayInRows(&head);//call displayInRows()
return 0;
}//end main()
void displayList(Node* ptr) {
if (ptr == nullptr)
cout << "empty list" << endl;
else {
while (ptr != nullptr) {
cout << ptr->getValue() << endl;
ptr = ptr->next;
}
}
cout << "---------------------------" << endl;
}//end displayList()
void insertFront(Node** head, int value) {
Node* newNode = new Node();
newNode->setValue(value);
//cout<< newNode->getValue() << endl;
newNode->next = *head;
*head = newNode;
}
void insertBack(Node** ptrToHead, int value) {
Node* newNode = new Node();
newNode->setValue(value);
newNode->next = nullptr;
if (*ptrToHead == nullptr)
{
*ptrToHead = newNode;
}//end if
else
{
Node* last .
Help I keep getting the same error when running a code. Below is the.pdf
Help I keep getting the same error when running a code. Below is the code and the instructions
about the code.
import java.util.Arrays;
public class Album implements Comparable {
private final int id;
private final String[] artists;
private final int numSongs;
public Album(int id, String title, String[] artists, int numSongs) {
this.id = id;
this.artists = new String[]{Arrays.toString(artists)};
this.numSongs = numSongs;
}
public int getId() {
return id;
}
@Override
public int compareTo(Album other) {
return Integer.compare(this.numSongs, other.numSongs);
}
@Override
public String toString() {
StringBuilder artistNames = new StringBuilder();
for (String artist : artists) {
artistNames.append(artist).append(", ");
}
artistNames.delete(artistNames.length() - 2, artistNames.length());
return "ID: " + id + " -- " + numSongs + " songs -- [" + artistNames + "]";
}
}
import java.util.Random;
public class DoublyLinkedList {
private static class Node {
T data;
Node prev;
Node next;
Node(T data) {
this.data = data;
}
}
private Node head;
private Node tail;
private int size;
public DoublyLinkedList() {
head = null;
tail = null;
size = 0;
}
public Node append(T data) {
Node newNode = new Node<>(data);
if (head == null) {
head = newNode;
} else {
tail.next = newNode;
newNode.prev = tail;
}
tail = newNode;
size++;
return newNode;
}
public Node insert(int location, T data) {
if (location < 0 || location > size) {
throw new IllegalArgumentException("Invalid location");
}
Node newNode = new Node<>(data);
if (location == 0) {
newNode.next = head;
if (head != null) {
head.prev = newNode;
}
head = newNode;
if (tail == null) {
tail = newNode;
}
} else if (location == size) {
tail.next = newNode;
newNode.prev = tail;
tail = newNode;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
newNode.prev = current.prev;
newNode.next = current;
current.prev.next = newNode;
current.prev = newNode;
}
size++;
return newNode;
}
public Node delete(int location) {
if (location < 0 || location >= size) {
throw new IllegalArgumentException("Invalid location");
}
Node deletedNode;
if (location == 0) {
deletedNode = head;
head = head.next;
if (head != null) {
head.prev = null;
} else {
tail = null;
}
} else if (location == size - 1) {
deletedNode = tail;
tail = tail.prev;
tail.next = null;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
deletedNode = current;
current.prev.next = current.next;
current.next.prev = current.prev;
}
size--;
return deletedNode;
}
public int getIndex(T data) {
Node current = head;
for (int i = 0; i < size; i++) {
if (current.data.equals(data)) {
return i;
}
current = current.next;
}
return -1;
}
@Override
public String toString() {
StringBuilder result = new StringBuilder();
Node current = head;
while (current != null) {
result.append(current.data).append(" -> ");
current = current.next;
}
result.append("NULL");
return result.toString();
}
public Node shuffle() {
Random r.
Problem 2 struct to hold information about a song struct So.pdf
// Problem 2
// struct to hold information about a song
struct Song
{
int id;
char name[MAX_SONG_NAME_LENGTH];
char singer[MAX_SINGER_NAME_LENGTH];
genreType genre;
int year;
struct Song* next;
};
// Function declarations
struct Song* createSong(int id, char* name, char* singer, char* genre, int year);
void printPlaylist(struct Song* playlist);
void add_song(struct Song** playlist, struct Song* newSong);
struct Song* search_song(struct Song* playlist, char* name);
int edit_song(struct Song* playlist, char* name, char* singer, char* genre, int year);
int delete_song(struct Song* playlist, char* name);
// function to create a new song
struct Song* createSong(int id, char* name, char* singer, char* genre, int year)
{
struct Song* newSong = (struct Song*)malloc(sizeof(struct Song));
newSong->id = id;
strcpy(newSong->name, name);
strcpy(newSong->singer, singer);
if (strcmp(genre, "Pop") == 0)
newSong->genre = 1;
else if (strcmp(genre, "Rock") == 0)
newSong->genre = 2;
else if (strcmp(genre, "Reggae") == 0)
newSong->genre = 3;
else if (strcmp(genre, "Country") == 0)
newSong->genre = 4;
else if (strcmp(genre, "Blues") == 0)
newSong->genre = 5;
else if (strcmp(genre, "Balad") == 0)
newSong->genre = 6;
else
newSong->genre = 0;
newSong->year = year;
newSong->next = NULL;
return newSong;
}
// function to print the playlist
void printPlaylist(struct Song* playlist)
{
struct Song* current = playlist;
while (current != NULL)
{
printf("%d\t%s\t%s\t%d\t%d\n", current->id, current->name, current->singer, current-
>genre, current->year);
current = current->next;
}
}
// function to add a song to the end of the playlist
void add_song(struct Song** playlist, struct Song* newSong)
{
// TODO: Implement function
}
// function to search for a song by name
struct Song* search_song(struct Song* playlist, char* name)
{
// TODO: Implement function
}
// function to edit a song by name
int edit_song(struct Song* playlist, char* name, char* singer, char* genre, int year)
{
// TODO: Implement function
}
// function to delete a song by name
int delete_song(struct Song* playlist, char* name)
{
// TODO: Implement function
}
void flushSngIn()
{
char c;
do
c = getchar();
while (c != '\n' && c != EOF);
}
int main()
{
// Problem 1
int choice = 0;
int songCount = 0;
char songName_input[MAX_SONG_NAME_LENGTH],
singerName_input[MAX_SINGER_NAME_LENGTH];
char genre_input[20];
unsigned int year_input, add_result = 0;
struct musicRepository music[20];
struct musicRepository* song = NULL;
initializeRepository(music, 20);
music[0].ID = numSongs + 1; numSongs++;
strcpy(music[0].songName, "Shape of You");
strcpy(music[0].singerName, "Ed Sheeran");
music[0].genre = 1;
music[0].year = 2017;
songCount++;
music[1].ID = numSongs + 1; numSongs++;
strcpy(music[1].songName, "Despacito");
strcpy(music[1].singerName, "Luis Fonsi");
music[1].genre = 1;
music[1].year = 2017;
songCount++;
music[2].ID = numSongs + 1; numSongs++;
strcpy(music[2].songName, "Uptown Funk");
strcpy(music[2].singerName, "Mark Ron.
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..
lab03build.bat@echo offclsset DRIVE_LETTER=1set.docx
lab03/build.bat
@echo off
cls
set DRIVE_LETTER=%1:
set PATH=%DRIVE_LETTER%\MinGW\bin;%DRIVE_LETTER%\MinGW\msys\1.0\bin;c:\Windows;c:\Windows\system32
g++ -c String.cpp
g++ -c Tokens.cpp
g++ -c ReadFile.cpp
g++ -c WriteFile.cpp
g++ -c Keyboard.cpp
g++ -c Random.cpp
g++ -c Matrix.cpp
g++ -c Poly.cpp
g++ -c CD.cpp
g++ -c Song.cpp
g++ -c Integer.cpp
g++ -c Double.cpp
g++ -c HighPerformanceCounter.cpp
g++ -c Permutation.cpp
ar -r libCSC2110.a *.o
lab03/fallout.txt
20
observation
worshipping
description
nondescript
eliminating
survivalist
destructive
infestation
surrounding
persecution
interesting
explanation
recognition
programming
personality
hospitality
distinguish
devastation
nightvision
engineering
lab03/Lab03Files.zip
CD.cpp
#include "CD.h"
#include "ListArrayIterator.h"
#include "ReadFile.h"
#include "Tokens.h"
using namespace CSC2110;
#include <iostream>
using namespace std;
char CD::getRadixChar(CD* cd, int index) //1-based
{
String* title = cd->getKey();
int title_len = title->length();
if (index <= title_len)
{
return title->charAt(index - 1);
}
else
{
return 32; //ascii for a space
}
}
int CD::compare_items(CD* one, CD* two)
{
String* title_1 = one->getKey();
String* title_2 = two->getKey();
int title_compare = title_1->compare(title_2); //asc
return title_compare;
}
int CD::compare_keys(String* sk, CD* cd)
{
String* title_1 = sk;
String* title_2 = cd->getKey();
int title_compare = title_1->compare(title_2); //asc
return title_compare;
}
CD::CD(String* artist, String* title, int year, int rating, int num_tracks)
{
this->artist = artist;
this->title = title;
this->year = year;
this->rating = rating;
this->num_tracks = num_tracks;
songs = new ListArray<Song>();
}
CD::~CD()
{
ListArrayIterator<Song>* iter = songs->iterator();
while(iter->hasNext())
{
Song* song = iter->next();
delete song;
}
delete iter;
delete songs;
songs = NULL;
delete artist;
delete title;
}
String* CD::getKey()
{
return title;
}
void CD::addSong(String* title, String* length)
{
int track_count = songs->size();
if (track_count < num_tracks)
{
Song* song = new Song(title, length);
songs->add(song);
}
}
void CD::displayCD()
{
cout << "Artist: ";
artist->displayString();
cout << endl;
cout << "Title: ";
title->displayString();
cout << endl;
cout << "Year: " << year << endl;
cout << "Rating: " << rating << endl;
ListArrayIterator<Song>* iter = songs->iterator();
int count = 1;
while(iter->hasNext())
{
Song* song = iter->next();
cout << count << " ";
song->displaySong();
count++;
}
delete iter;
cout << endl;
}
ListArray<CD>* CD::readCDs(const char* file_name)
{
ReadFile* r ...
Can someone solve the TODO parts of the following problem i.pdf
Can someone solve the TODO parts of the following problem
#include <iostream>
#include <fstream>
#include <sstream>
#include<string>
#include "Queuecpp.h"
#include "Songcpp.h"
#include "RequestCpp.h"
//GIVEN
int main() {
LinkedList<Song> list;
Queue<Request> q;
populateSongDataBase(list); // fill the Songs Data Base into Linked List
std::cout<<"*************************************n";
list.printList(); //
std::cout<<"*************************************n";
populateRequests(q); // fill the request q
std::cout<<"n";
std::cout<<"---------------PRINTING QUEUE-------------------n";
q.printList();
std::cout<<"------------------------------------n";
processQueue(list,q); // process the requests
std::cout<<"*************************************n";
list.printList();
std::cout<<"*************************************n";
}
//GIVEN
void populateRequests(Queue<Request> &q){
}
//GIVEN
std::string playSong(LinkedList<Song>&list, Song s){
}
//GIVEN
void printTopTenSongs(LinkedList<Song>& list){
}
//TODO
void addThisSong(LinkedList<Song> &list, Song s){
//TODO
/* Use this code
if (found>=0) {std::cout<<"ADDED THIS SONG "<<found+1<<" " ;list.printSong(found+1);}
else std::cout<<"SORRY CANNOT FIND SONG n";
*/
}
//TODO
void removeThisSong(LinkedList<Song> &list, Song s){
/* Use this code
if (found>=0) {std::cout<<"SORRY CANNOT REMOVE THIS SONG - STILL FOUND AT
"<<found;}
else{ std::cout<<"REMOVED THIS SONG n";
std::cout<<"THE SONG AT CHARTPOSITION "<<chartPos<<" IS NOW ";
list.printSong(chartPos); std::cout<<"n";
*/
}
}
//TODO
void moveThisSong(LinkedList<Song> &list, Song s, int pos){
int chartPos=list.get(s);
std::cout<<"MOVING SONG "<<s.toString()<<"n";
list.move(s,pos);
std::cout<<"ITS NEW CHART POSITION n";
list.printSong(pos);
std::cout<<"THE SONG AT PREVIOUS POSITION "<<chartPos+1<< " IS NOW
";list.printSong(chartPos+1);
}
//GIVEN
void processRequest(LinkedList<Song> &list,std::string action, std::string title,std::string singer,int
chartPos){
Song s(title,singer,chartPos);
char ch =action[0];
switch(ch){
case 'P' : std::cout<<playSong(list,s)<<"n";break;
case 'A' : addThisSong(list,s);break;;
case 'R' : removeThisSong(list,s);break;
case 'M' : moveThisSong(list,s,chartPos);break;
case 'T' : printTopTenSongs(list);break;
}
}
//TODO
void processQueue(LinkedList<Song> &list ,Queue<Request>& q){
int requestNumber=1;
//Create an iterator for the Queue to iteratate through requests
std::cout<<"-------------------------------------------------------------------------n";
// call processRequest
std::cout<<"-------------------------------------------------------------------------n"
std::cout<<"-------------------------------------------------------------------------n";
}
//GIVEN
void populateSongDataBase(LinkedList<Song> &list){
std::string line="";
std::string token="";
std::string title="";
std::string singer="";
int chartPos=-1;
try {
std::ifstream input("SongsData.txt");
if (input.fail())
throw new std::string("FILE OPEN ERROR EXCEPTION n");
else{
while (getli.
#include iostream #include fstream #include cstdlib #.pdf
#include
#include
#include
#include
using namespace std;
struct city
{
string name; // name of the city
city *next; // pointer to the next city
int numberMessages; // how many messages passed through this city
string message; // message we are sending accross
};
city* addCity(city *head, city *previous, string cityName );
city* deleteCity(city *head, string cityName);
city* deleteEntireNetwork(city *head);
city* searchNetwork(city *head, string cityName);
city* loadDefaultSetup(city *head);
void transmitMsg(city *head, string receiver, string filename);
void printPath(city *head);
void displayMenu();
city* handleUserInput(city *head);
/* Do NOT modify main function */
int main(int argc, char* argv[])
{
// pointer to the head of our network of cities
city *head = NULL;
head = handleUserInput(head);
printPath(head);
head = deleteEntireNetwork(head);
if (head == NULL)
cout << \"Path cleaned\" << endl;
else
printPath(head);
cout << \"Goodbye!\" << endl;
return 0;
}
/*
* Purpose: handle the interaction with the user
* Do NOT modify
*/
city* handleUserInput(city *head)
{
bool quit = false;
string s_input;
int input;
// loop until the user quits
while (!quit)
{
displayMenu();
// read in input, assuming a number comes in
getline(cin, s_input);
input = stoi(s_input);
switch (input)
{
// print all nodes
case 1: //rebuild network
head = loadDefaultSetup(head);
printPath(head);
break;
case 2: // print path
printPath(head);
break;
case 3: //message is read in from file
{
string cityReceiver;
cout << \"Enter name of the city to receive the message: \" << endl;
getline(cin, cityReceiver);
cout << \"Enter the message to send: \" << endl;
string message;
getline(cin, message);
transmitMsg(head, cityReceiver, message);
}
break;
case 4:
{
string newCityName;
string prevCityName;
cout << \"Enter a new city name: \" << endl;
getline(cin, newCityName);
cout << \"Enter the previous city name (or First): \" << endl;
getline(cin, prevCityName);
// find the node containing prevCity
city *tmp = NULL;
if(prevCityName !=\"First\")
tmp = searchNetwork(head, prevCityName);
// add the new node
head = addCity(head, tmp, newCityName);
printPath(head);
}
break;
case 5: // delete city
{
string city;
cout << \"Enter a city name: \" << endl;
getline(cin, city);
head = deleteCity(head, city);
printPath(head);
}
break;
case 6: // delete network
head = deleteEntireNetwork(head);
break;
case 7: // quit
quit = true;
cout << \"Quitting... cleaning up path: \" << endl;
break;
default: // invalid input
cout << \"Invalid Input\" << endl;
break;
}
}
return head;
}
/*
* Purpose: Add a new city to the network
* between the city *previous and the city that follows it in the network.
*/
city* addCity(city *head, city *previous, string cityName )
{
city* add = new city; //to distinguish and create the new node, i named it add
add->name = cityName;
city* tmp = new city;
tmp=head;
if(previous == NULL){
add->next = head;
head = add;
}
while(tmp != NULL && previous != tmp){
tmp = tmp->next;
}
if(tm.
Need help getting past an error in C++! I have all my code pasted down.docx
Need help getting past an error in C++!
I have all my code pasted down below. My issue is that I'm trying to call the functions I have in main, but they don't do anything as they are now. I'm almost positive I need to call them with parenthesis, but putting them in always results with an error saying "A nonstatic member reference must be relative to a specific object."
Below will be the source file, then the header file I made all the functions in. Thanks in advance, y'all are the best!
(Source.ccp)
#include "Header.h"
int main() {
NoteList noteList;
noteList.loadData("input.txt");
bool finish = false;
int choice;
while (finish != true) {
cout << "\n** Menu **\n"
<< "1. LIST NOTES BY DATE\n"
<< "2. LIST NOTES BY COMPOSER\n"
<< "3. DELETE MOST RECENT NOTE\n"
<< "4. EXIT\n" << endl;
cin >> choice;
if (choice == 1)
{
&NoteList::listNotesByDate();
}
else if (choice == 2)
{
&NoteList::listNotesByComposer;
}
else if (choice == 3)
{
&NoteList::deleteFrontNote;
}
else if (choice == 4)
{
cout << "\nOperations ended";
finish = true;
}
else
{
cout << "\nInput not recognized. Please choose a number between 1 and 4." << endl;
}
}
return 0;
}
(Header.h)
#pragma once
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
class Date {
private:
int month, day, year;
public:
Date() : month(0), day(0), year(0) {}
void setDate(string strDate) {
month = stoi(strDate.substr(0, 2));
day = stoi(strDate.substr(3, 2));
year = stoi(strDate.substr(6, 4));
}
string showDate() {
return to_string(month) + "-" + to_string(day) + "-" + to_string(year);
}
int calculateDays() {
return year * 365 + month * 31 + day;
}
};
class Note {
private:
string composer;
Date date;
string subject;
string body;
public:
Note(string c, string d, string s, string b) : composer(c), subject(s), body(b) {
date.setDate(d);
}
string getComposer() {
return composer;
}
Date getDate() {
return date;
}
string getSubject() {
return subject;
}
string getBody() {
return body;
}
};
struct noteNode {
Note note;
noteNode* next;
};
class NoteList {
private:
noteNode* head;
public:
NoteList() : head(nullptr) {}
void loadData(const char* filename) {
ifstream file(filename);
if (file.is_open()) {
string line;
string composer, date, subject, body;
while (getline(file, line)) {
if (line == "##########") {
Note note = Note(composer, date, subject, body);
addNote(note);
composer.clear();
date.clear();
subject.clear();
body.clear();
}
else if (line.substr(0, 10) == "COMPOSER: ") {
composer = line.substr(10);
}
else if (line.substr(0, 6) == "DATE: ") {
date = line.substr(6);
}
else if (line.substr(0, 9) == "SUBJECT: ") {
subject = line.substr(9);
}
else {
body += line + "\n";
}
}
file.close();
}
else {
cerr << "Unable to open file " << filename << endl;
}
}
void addNote(Note note) {
noteNode* newNode = new noteNode{note, head};
newNode->note = note;
newNode->next = head;
head =.
The provided codetrack_file_handling.rb class Track att.pdf
The provided code:
*track_file_handling.rb
class Track
attr_accessor :name, :location
def initialize (name, location)
@name = name
@location = location
end
end
# Returns an array of tracks read from the given file
def read_tracks(music_file)
count = music_file.gets().to_i()
tracks = Array.new()
# Put a while loop here which increments an index to read the tracks
track = read_track(music_file)
tracks << track
return tracks
end
# reads in a single track from the given file.
def read_track(a_file)
# complete this function
# you need to create a Track here.
end
# Takes an array of tracks and prints them to the terminal
def print_tracks(tracks)
# Use a while loop with a control variable index
# to print each track. Use tracks.length to determine how
# many times to loop.
# Print each track use: tracks[index] to get each track record
end
# Takes a single track and prints it to the terminal
def print_track(track)
puts(track.name)
puts(track.location)
end
# Open the file and read in the tracks then print them
def main()
a_file = File.new("input.txt", "r") # open for reading
# Print all the tracks
print_tracks(tracks)
end
main()
*input.txt
3
Crackling Rose
sounds/01-Cracklin-rose.wav
Soolaimon
sounds/06-Soolaimon.wav
Sweet Caroline
sounds/20-Sweet_Caroline.wav
Can anyone pls help me with this Ruby task, it's urgent. Thx! Use the code provided to get
started. You must enhance the code provided as follows: - Complete the provided code so that it
reads in an array of tracks then prints them out. The program output (using the file input.txt)
should look as follows: MacBook-Pro-6:TuteTasks mmitchel1s ruby music_tracks_only.rb
Crackling Rose sounds/01-Cracklin-rose.wav Soolaimon sounds/06-Soolaimon.wav Sweet
Caroline sounds/20-Sweet_Caroline.wav MacBook-Pro-6:TuteTasks mmitchel1s Once your
program is running upload a screenshot to the workspace. Below is a structure chart for this task:.
Please solve the TODO parts of the following probelm incl.pdf
Please solve the TODO parts of the following probelm.
#include <iostream>
#include <fstream>
#include <sstream>
#include<string>
#include "Queuecpp.h"
#include "Songcpp.h"
#include "RequestCpp.h"
void populateRequests(Queue<Request>& q);
void populateSongDataBase(LinkedList<Song> &list);
void processQueue(LinkedList<Song> &list,Queue<Request>& q);
void processRequest(std::string action, std::string title,std::string singer,int chartPos);
//GIVEN
int main() {
LinkedList<Song> list;
Queue<Request> q;
populateSongDataBase(list); // fill the Songs Data Base into Linked List
std::cout<<"************************************* ";
list.printList(); //
std::cout<<"************************************* ";
populateRequests(q); // fill the request q
std::cout<<" ";
std::cout<<"---------------PRINTING QUEUE------------------- ";
q.printList();
std::cout<<"------------------------------------ ";
processQueue(list,q); // process the requests
std::cout<<"************************************* ";
list.printList();
std::cout<<"************************************* ";
}
//TODO
void populateRequests(Queue<Request> &q){
}
std::string playSong(LinkedList<Song>&list, Song s){
if (list.get(s)>=0){
return "PLAYING :"+ s.toString()+" ";
}
else{
return "SONG NOT FOUND ";
}
}
//GIVEN
void printTopTenSongs(LinkedList<Song>& list){
std::cout<<"PLAYING TOP TEN SONG __________ ";
list.print(10);
}
//TODO
void addThisSong(LinkedList<Song> &list, Song s){
}
//TODO
void removeThisSong(LinkedList<Song> &list, Song s){
}
//TODO
void moveThisSong(LinkedList<Song> &list, Song s, int pos){
}
//GIVEN
void processRequest(LinkedList<Song> &list,std::string action, std::string title,std::string singer,int
chartPos){
Song s(title,singer,chartPos);
char ch =action[0];
switch(ch){
case 'P' : std::cout<<playSong(list,s)<<" ";break;
case 'A' : addThisSong(list,s);break;;
case 'R' : removeThisSong(list,s);break;
case 'M' : moveThisSong(list,s,chartPos);break;
case 'T' : printTopTenSongs(list);break;
}
}
//TODO
void processQueue(LinkedList<Song> &list ,Queue<Request>& q){
int requestNumber=1;
//Create an iterator for the Queue to iteratate through requests
std::cout<<"------------------------------------------------------------------------- ";
// call processRequest
std::cout<<"------------------------------------------------------------------------- "
std::cout<<"------------------------------------------------------------------------- ";
}
//TODO
void populateSongDataBase(LinkedList<Song> &list){
}
#include "Queue.h"
//template <class T>
//Queue<T>::Queue(){
// back=nullptr;
//}
template <class T>
//TODO
// add an element t to the end queue
// this should be an O(1) operation
void Queue<T>::add(T t){
}
//TODO
//remove an element from the front of the queue
// this should be an O(1) operation
template <class T>
void Queue<T>::remove(){
//TODO
// if queue us empty
// throw new std::string("NULL POINTER EXCEPTION QUEUE IS EMPTY ");
}
#include "ListNode.h"
#include<iostream>
template <class T>
Li.
Similar to maincpp include ltiostreamgt include ltstringgt.pdf (20)
It's not working what am I doing wrong- Given main()- complete the Son.pdf
It's not working what am I doing wrong- Given main()- complete the Son.pdf
Can someone please help me complete the add_song function .pdf
Can someone please help me complete the add_song function .pdf
PFB cpp code for the given problem#include iostream #include .pdf
PFB cpp code for the given problem#include iostream #include .pdf
Can someone please help me implement the addSong function .pdf
Can someone please help me implement the addSong function .pdf
Given main(), complete the SongNode class to include the printSong.pdf
Given main(), complete the SongNode class to include the printSong.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
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
In C++ I need help with this method that Im trying to write fillLi.pdf
In C++ I need help with this method that Im trying to write fillLi.pdf
Help I keep getting the same error when running a code. Below is the.pdf
Help I keep getting the same error when running a code. Below is the.pdf
Problem 2 struct to hold information about a song struct So.pdf
Problem 2 struct to hold information about a song struct So.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
lab03build.bat@echo offclsset DRIVE_LETTER=1set.docx
lab03build.bat@echo offclsset DRIVE_LETTER=1set.docx
Can someone solve the TODO parts of the following problem i.pdf
Can someone solve the TODO parts of the following problem i.pdf
#include iostream #include fstream #include cstdlib #.pdf
#include iostream #include fstream #include cstdlib #.pdf
Need help getting past an error in C++! I have all my code pasted down.docx
Need help getting past an error in C++! I have all my code pasted down.docx
The provided codetrack_file_handling.rb class Track att.pdf
The provided codetrack_file_handling.rb class Track att.pdf
Please solve the TODO parts of the following probelm incl.pdf
Please solve the TODO parts of the following probelm incl.pdf
More from mukulsingh0025
Caso Plymouth Tube Company El da despus de una reunin .pdf
Caso Plymouth Tube Company
El da despus de una reunin de la junta de febrero de 2013, Donald C. Jr. (Van), el director
ejecutivo de cuarta generacin y presidente de Plymouth Tube Company, conoci a su hija Stacy, la
administradora financiera y el nico miembro de quinta generacin en el negocio, en la oficina.
Estaban tratando de descubrir la mejor manera de obtener comentarios de los accionistas de la
junta y la familia para una expansin sustancial de su planta de Hopkinsville, Kentucky, para el
mercado aeroespacial. Una expansin de la Fase I de $ 17 millones estaba a punto de
completarse. En la reunin, la gerencia haba propuesto una inversin de Fase II de $63 millones. La
oportunidad se haba estado considerando durante ms de un ao y el proyecto tardara tres aos en
completarse, por lo que la gerencia quera tomar una decisin pronto.
Plymouth tena fuertes ventajas competitivas de innovacin y calidad en el segmento del mercado
aeroespacial. Van, de 64 aos, sinti que Plymouth podra dominar este mercado actuando pronto.
Si no hacemos esto, eventualmente un competidor lo har, dijo. Stacy estaba ansiosa por apoyar la
visin estratgica de su padre y estuvo de acuerdo, pero en su interior sinti que sera mejor buscar
tambin en otros segmentos del mercado, ya que senta que haba otras oportunidades interesantes
disponibles para Plymouth.
Este fue el desembolso ms grande que Plymouth jams haba considerado hacer en dlares
absolutos, aunque en las dcadas de 1980 y 1990 el padre de Van haba realizado inversiones
significativas que eran comparables para su poca. Van sinti que sera una gran inversin en el
futuro de la familia y mantendra la vitalidad de la empresa a largo plazo. Si Van sigui la misma
trayectoria profesional que su padre, tena ocho aos ms (hasta los 72 aos) para administrar el
negocio y supervisar esta oportunidad, suponiendo que su vigor e inters continuaran. Van an no
haba formalizado un plan de sucesin personal.
La gerencia estaba abrumadoramente a favor del proyecto, aunque algunos gerentes preferan
una inversin inicial menos agresiva de $48 millones, que crecera una vez que se generaran los
ingresos. El equipo de ventas estaba ansioso por comenzar. Van pens que el esfuerzo se
alineaba bien con la misin corporativa de Plymouth. Si bien evalu el riesgo de fracaso como bajo,
identific algunas desventajas posibles, pero poco probables.
La expansin podra resultar en productos de menor calidad; podra hacer que Plymouth se volviera
demasiado dependiente de la industria aeroespacial; o podra desviar la atencin y los recursos del
resto de las plantas, productos y mercados de la empresa. Van pens que su padre de 88 aos,
Gramps, quien estaba en su ltima reunin de la junta como miembro y presidente, pareca
levemente a favor del proyecto.
Un miembro de la junta que no es de la familia observ sobre la reunin de la junta de febrero:
Aunque la junta valor enormemente la perspicacia de Van sobre lo que los clientes de Plymouth
queran en el futuro, los directo.
3131 Monitor control and protect communications ie i.pdf
3.13.1 Monitor, control, and protect communications (i.e., information transmitted or received by
organizational systems) at the external boundaries and key internal boundaries of organizational
systems.
Do policies for managed interfaces such as gateways, routers, firewalls, VPNs, and company
DMZs restrict external web traffic to only designated servers exist?
Has the company identified network communications boundaries?
Does the system monitor and manage communications at the system boundary and at key
internal boundaries within the system?
Do policies for managed interfaces such as gateways, routers, firewalls, VPNs, and company
DMZs restrict external web traffic to only designated servers exist?.
El libro de Thomas Friedman The World Is Flat A Brief Hist.pdf
El libro de Thomas Friedman, The World Is Flat: A Brief History of the Twenty-First Century,
sostiene que "la convergencia de tecnologa y eventos que permitieron que India, China y tantos
otros pases se convirtieran en parte de la cadena de suministro global de servicios y fabricacin,
[cre] una explosin de riqueza en las clases medias de las dos naciones ms grandes del mundo,
dndoles una nueva y enorme participacin en el xito de la globalizacin..." Continu escribiendo que
con "este 'aplanamiento' del mundo ( que) requiere que corramos ms rpido para mantenernos en
el lugar... (nos pone cara a cara con la realidad de que) el mundo se ha vuelto demasiado pequeo
y demasiado rpido para que los seres humanos y sus sistemas polticos se ajusten de manera
estable... ." Comparta sus pensamientos con la clase sobre una de las siguientes preguntas,
todas las cuales se refieren a la cita "el mundo es plano". 1. Es probable que los incentivos
materiales en China e India hagan que esos trabajadores de clase media apoyen ms un sistema
econmico y cultural global? Por qu o por qu no? 2.Cmo explica las reacciones antiglobalizacin del
terrorismo? 3.Son las nuevas oportunidades para los trabajadores asiticos una amenaza para los
trabajadores estadounidenses? (Es esta una situacin de suma cero?) 4. Sern los sistemas
polticos incapaces de mantener la estabilidad? Explicar..
25 Microfilament polarity is present due to what characteri.pdf
25) Microfilament polarity is present due to what characteristic of the actin protein? A) G-actin's
ATP binding site. B) F-actin is a double helix. C) F-actin can be bundled by -actinin. D) G-actin can
have and isoforms. 26) Which of the following is NOT found on the lateral surfaces (between) of
epithelial cells? A) adherens junctions B) desmosomes C) hemidesmosomes D) tight junctions.
37 La fragmentacin del hbitat suele conducir a una dismin.pdf
37. La fragmentacin del hbitat suele conducir a una disminucin de la biodiversidad.
A. Verdadero B. Falso
38. Una especie invasora es aquella que
A. no es nativo de un rea
B. generalmente es introducido por humanos ya sea intencionalmente o por accidente
C. tiene mucho xito en su hbitat.
D. desplaza o compite con otros organismos
E. todo lo anterior puede describir especies invasoras
39. La razn principal de la alta tasa actual de extincin de animales es
A. caza deportiva no controlada en el mundo desarrollado.
B. recoleccin comercial de vida silvestre en frica.
C. condiciones de sequa provocadas por el efecto invernadero.
D. destruccin del hbitat en todo el mundo.
E. ninguna de las anteriores
40. Quien tiende a creer que los recursos del mundo son limitados:
a) Neo-Maltusiano b) Cornucopiano.
1 Fill in the blank a The brain is to the longe b The nos.pdf
1) Fill in the blank a. The brain is to the longe b. The nose is to the cars c. The elbow to the
shoulder d. The midile finger is to the thuntb. 2) The skull is cut in which anitomical plane? 3)
Consider the cavity that bouses beart. a. What is the name of this cavity? b. What is the name of
layer of the menbeaee that dircctly boucbes the heart? c. Cells that make up the contractile tissue
of the heart are constanty pulling on euch other. Which cell junction will hetp with this conseunt
pulling? 4) Coasidet the following figure4) Consher the folluwing ferure a) Consider that oxygen is
notpolue afcreas pucibin is polar. Which of the two can eanity pais thevegh the poosphotipid
bilayert b) What kiad of thansyen is neceoury fo move evyyen fiom insile the cefl io outude the 5)
What Kind of tratapoet is necesary lo these folauium from insige the ced to outside the celle
(assume it requires the proteit chured bo mored 4) What kind of eramport is nevesian lo moqe
pockinum fiva wabide the cell to inside the cell? (asume it rotuines the prosen olinel to move) e) If
the cell did MoI have mitochondris, which melecele corakd the eell nos bring OUII OF the
ecllidfoem inside to outvider)?5) Complate the following tatde A Lenes Tisue Tyne fursetron Itint in
cale be focumitin A B6) Complete the following In Inpet: a) What fype of connective fiber makes up
the extracellulat matrix? b) What is the ceil type foand in this nrwae? c) What is the functicen of
this tisse? 7) Affer a moal, when there is a lot of arpar in te llood, the pancress produces a
hommone called inculin. Inselin sipals the body cells bo smeneve sugar fruen the blood, th echer
words, insulin lowers the blood saper. ls tha a pesitive or aegative foctouck loop? Thornuchly
explaie yeur snver?.
1 Los gerentes crean ______ a travs de la comunicacin s.pdf
1, Los gerentes crean ______ a travs de la comunicacin.
significado
ganancias
trabajos
estructura organizativa
productos y servicios
Escuchar, leer y escribir RESULTADO DE APRENDIZAJE: 5
2. En una organizacin, el tamao de la oficina y su ubicacin comunica ciertos mensajes
sobre el individuo. Este es un ejemplo de cul de los siguientes?
Comunicacin oral
Comunicacin escrita
Comunicacin no verbal
Comunicacin vertical
comunicacin horizontal.
C++ Please help me Dont use Chat GPT please Problem 1.pdf
C++ Please help me!! Don't use Chat GPT please !!
Problem 1: Implement a Stack by using two Queues. In other words, implement push, pop, top,
empty functions by using enqueue, dequeue, front and empty functions. Do it by three files main,
.cpp, .h
Problem 2: Implement a Queue by using Two Stacks. In other words, implement enqueue,
dequeue, front and empty functions by using push, pop, top and empty functions. Do it by three
files main, .cpp, .h.
574 Chapter 28 priocioles of Eisctrocardiogriasy 6 Thind de.pdf
574 Chapter 28 priocioles of Eisctrocardiogriasy 6. Thind dedgene heart block at Jremature
ventricalar conteractione (ITVCa) G. Additional ECG Testing 1. Dencribe the preparations for an
exercise stress test. 2. Describe a Holter monitor test. 3. Describe patient education required for
the Holter monisoe fest. 4. Describe the cardiac event recorder and discuss how the patient uses
the recorder CERTIFICATION PREPARATION 3. What ICC wave or segment is a negative
defection and represents interventricular septal Circic the correct ansioer. dicpolatization? a.
Pwave I. is a deflection from the baseline. b. Q wave 3. Interval c. R and S waves b. Segment d. T
wave c. Complex d. Wave 4. What ECG wave of segment represents ventricular nepolarization?
2. What ECG wave or segment reflects atrial a. P wave depolarization? b. Q wave a. P wave c.
Rand S waves b. Q wave d. I wave c. R and S waves d. Twave.
3 Which of the following voice communications systems and s.pdf
3. Which of the following voice communications systems and services could be found in an
enterprise environment?
A. Private Branch Exchange (PBX)
B. Automatic Call Distribution
C. Voice mail
D. All of the above
4. Which transport layer protocol is not recommended for carrying voice?
A. TCP
B. UDP
C. IP
D. RTP
A. Private Branch Exchange (PBX)
B. Automatic Call Distribution
C. Voice mail
D. All of the above
A. Private Branch Exchange (PBX)
B. Automatic Call Distribution
C. Voice mail
D. All of the above
A. Private Branch Exchange (PBX)
B. Automatic Call Distribution
C. Voice mail
D. All of the above
4. Which transport layer protocol is not recommended for carrying voice?
A. TCP
B. UDP
C. IP
D. RTP.
Vaka Analizi VERler Bir rnek Gnll ihracat kstl.pdf
Vaka Analizi
VER'ler: Bir rnek
Gnll ihracat kstlamalar, ekonomi ve politika arasnda zengin bir etkileim salar. ki rnee bakalm.
lkinde, Amerika Birleik Devletleri nemli bir ihracat olan Japonya'y otomobil ihracatn snrlamaya
zorlad. kincisinde, yine Amerika Birleik Devletleri ile Japonya arasnda kk bir VER, birok tekstil ve
giyim rnn kapsayan, birok lkeyi kapsayan ve onlarca yl sren geni kapsaml bir ihracat limitleri dizisi
haline geldi.
TEKSTL VE GYM: BR CANAVAR
1955'te bir canavar dodu. Japonya'dan artan ithalat karsnda ABD hkmeti, Japon hkmetini
Japonya'nn ABD'ye yapt pamuklu kuma ve giysi ihracatn gnll olarak snrlamaya ikna etti. 1950'lerin
sonlarnda ngiltere, Hindistan ve Pakistan' ngiltere'ye yaptklar giyim ve tekstil ihracatlarna VER'ler
uygulamaya zorlad. VER'ler balangta, ithalatla rekabet eden firmalarn artan d rekabete uyum
salamak iin zamana ihtiyalar olduuna dair korumac ricalarna yant olarak "geici" kstlamalar olarak
gerekelendirildi. Ama canavar bymeye devam etti.
Sayfa 177
1961 Ksa Vadeli Anlamas, 1962 Uzun Vadeli Anlamasna yol at. 1974'te, ok Elyaf Dzenlemesi,
plan ou tekstil ve giysi trn ierecek ekilde geniletti. Ticaret politikas canavar ok byk oldu. lke baznda
ve rn baznda mzakere edilen ok sayda ve artan VER, gelimekte olan lkelerin sanayilemi lkelere
(ve bir dizi dier gelimekte olan lkeye) ihracatn snrlad.
Canavarn kendi byme dinamii bile vard. A VER, aslnda ihracat firmalar arasnda bir karteldir.
Fiyatlarn ykselttike, kar frsat dier, balangta kstlanmam tedarikileri cezbeder. Tekstil ve ihracata
ynelik hazr giyim retimi Banglade, Kamboya, Fiji, Trkmenistan gibi lkelere yayld. Bu lkeler baarl
ihracatlar haline geldike, ithalat lkeler, ynetilen ticarette kesintilerini snrlamak iin VER'leri yrrle
koymalar iin onlara bask yapt.
Bu VER'ler tarafndan kstlanan gelimekte olan lkeler, Uruguay Turu ticaret mzakereleri srasnda bu
ticareti normal DT kurallarna (niceliksel snrlamalar ve tm lkelere eit olarak uygulanacak herhangi
bir tarife uygulanmamas - en ok kayrlan ulus muamelesi) geri getirmek iin ok zorlad. ikili
kstlamalar). 1995 ylnda yrrle giren Tekstil ve Konfeksiyon Anlamas, bu sektrdeki tm kotalarn sona
ermesi iin 10 yllk bir sre ngrmtr. 1 Ocak 2005'te, neredeyse yarm asrlk bir yaamn ardndan canavar
ounlukla ld.
"ounlukla" diyoruz nk birka yl daha canavarn kk bir paras yaad. in, Dnya Ticaret rgt'ne katlm
anlamasnn bir paras olarak, artan tekstil veya giyim ihracat ithalatla rekabet eden reticilere zarar
verirse, dier lkelerin in'e zg "koruma nlemleri" uygulayabileceini kabul etti. Amerika Birleik
Devletleri VER'leri aamal olarak kaldrrken, ABD hkmeti in'den yaplan baz ithalatlara bu tr koruma
nlemleri koydu. 2005'in sonlarna doru kapsaml bir anlama, in'den 22 tr rnn ithalatn snrlad. Benzer
ekilde Avrupa Birlii, in'den yaplan ithalata 10 tr rne koruma nlemi limiti getirdi. Sonra canavar
nihayet son nefesini verdi. AB limitleri 2007'nin sonunda, ABD limitleri ise 2008'in sonunda doldu.
VER says sona erdi.)
Liberallemenin en by.
Problem 3 12 points FABCDBC+CD+ABCD B Give the com.pdf
Problem 3 (12 points): F(A,B,C,D)=BC+CD+ABCD B. Give the complement of F as sum of
products (doesn't need to be in canonical form) A. Express F as sum of minterms..
The nationat debt is of growing concerm in the United states.pdf
The nationat debt is of growing concerm in the United states. It reached $1 billion in 1916 during
World War 1 and climbed to $278 billion by the end of World War II. It reached its first trilion on
October 1,1981 , and rose to $2 trilion on Apeli 3, 1996. The third trilion milestone was reached on
April 4 , 1990 , However, the magnitude of the national debt became headine news when it
reached $4 triilion and became a presidential campaign siogan for Ross Perot in 1992 . It psssed
$5 trilion in 1996 . 56 trieion in 2002, and on January 15,2004 , it reached 57 trilion. We hardly
noticed the other millestones. 56 trilion on October 18,2005 99 trilitian on March 6, 2006 $10
trilition on October 7,2003 511 trilion on March 22, 2009 $13 trilion on June 1+2010 $14 trimion en
January 4,2011 $15 trulion an November 15,2011 $16 trililon on September 4,2012 . 517 trilition
on October 18.2013 $18 trilion on November 28,2014.
Chetnas mind wanders when her supervisor is talking to her.pdf
Chetna's mind wanders when her supervisor is talking to her. She does not paraphrase or ask
clarifying questions, and she does not attend to her supervisor's nonverbal cues. Which of the
following assumptions would help Chetna improve her listening?
Question 44 options:
a)
Communication is the sender's responsibility.
b)
Listening is a mindless activity.
c)
Effective listening is an active process.
d)
Talking has more advantages than listening.
a) Communication is the sender's responsibility.
b) Listening is a mindless activity.
c) Effective listening is an active process.
d) Talking has more advantages than listening..
The future value of a lump sum single value can be found u.pdf
The future value of a lump sum (single value) can be found using the following equation: FVN=PV(
1+1)N Suppose $2,000 was invested for three years in an account paying 10 percent interest.
What would the future value be? 2.928 .20 $2,200 $2,420 $2,662.
The December 31 2012 trial balances of Pettie Corporation .pdf
The December 31, 2012, trial balances of Pettie Corporation and its 90%-owned subsidiary Sunco
Corporation are as follows: Petties's investment in Sunco was purchased for $1,260,000 in cash
on January 1,2011 , and was accounted for by the cost method. On January 1, 2011, Sunco had
the following equity balances: Pettie's excess of cost over book value on Sunco's investment has
been identified as goodwill. Sunco borrowed $100,000 from Pettie on June 30, 2012, with the note
maturing on June 30,2013 , at 10% interest. Correct accruals have been recorded by both
companies.During 2012, Pettie sold merchandise to Sunco at an aggregate invoice price of $300,
000, which included a profit of $75,000. As of December 31, 2012, Sunco had not paid Pettie for
$90,000 of these purchases, and 10% of the total merchandise purchased from Pettie still
remained in Sunco's inventory. Sunco declared a $1,000 cash dividend in December 2012
payable in January 2013. Prepare the necessary elimination and adjusting entries. Prepare the
worksheet required to produce the consolidated statements of Pettie Corporation and its
subsidiary, Sunco Corporation and its subsidiary, Sunco Corporation, for the year ended
December 31, 2012. Include the valuation analysis, the determination and distribution of excess
schedule, and the income distribution schedules..
Lea el caso Logitech a continuacin y responda las siguiente.pdf
Lea el caso Logitech a continuacin y responda las siguientes preguntas:
1. Analizar y explicar la configuracin de la cadena de valor global de Logitech? Configuracin Por
qu esta configuracin?
2. Hasta qu punto las diferentes teoras comerciales del libro prescrito pueden explicar la
configuracin de Logitech de su cadena de valor global? Analizar la relevancia de cada teora.
Teora Hasta qu punto la teora puede explicar la configuracin de Logitech de su cadena de valor
global?
3. Cul de las teoras, en su opinin, da la mejor explicacin de la cadena de valor global de Logitech?
Aclare y discuta sus opciones.
Logitech
Ms conocido como uno de los mayores productores de ratones para computadora del mundo,
Logitech es, en muchos sentidos, el eptome de la corporacin global moderna. Fundada en 1981
en Apples, Suiza, por dos italianos y un suizo, la empresa ahora genera ventas anuales de ms de
$1500 millones, la mayora de productos como ratones, teclados y cmaras de video de bajo costo
que cuestan menos de $100. Logitech se hizo un nombre como innovador tecnolgico en el
negocio altamente competitivo de los perifricos para computadoras personales. Fue la primera
empresa en introducir un ratn que usaba seguimiento infrarrojo, en lugar de una bola de
seguimiento, y la primera en introducir ratones y teclados inalmbricos. Logitech se diferencia de la
competencia por su continua innovacin, alto reconocimiento de marca y fuerte presencia
minorista. Menos obvia para los consumidores, pero igualmente importante, ha sido la forma en
que la compaa ha configurado su cadena de valor global para reducir los costos de produccin
mientras mantiene el valor de los activos que conducen a la diferenciacin. En la actualidad,
Logitech todava realiza trabajos bsicos de I+D (programacin de software principal) en Suiza,
donde tiene 200 empleados. De hecho, la empresa todava es legalmente suiza, pero la sede
corporativa est en Fremont, California, cerca de muchas de las empresas de alta tecnologa de
Estados Unidos, donde tiene 450 empleados. Algunos trabajos de I+D (de nuevo, principalmente
programacin de software) tambin se llevan a cabo en Fremont. Sin embargo, lo ms significativo es
que Fremont es la sede de las operaciones globales de marketing, finanzas y logstica de la
empresa. El diseo ergonmico de los productos de Logitech (su aspecto y tacto) lo realiza en
Irlanda una empresa de diseo externa. La mayora de los productos de Logitech se fabrican en
Asia. La expansin de Logitech en la fabricacin asitica comenz a fines de la dcada de 1980 cuando
abri una fbrica en Taiwn. En ese momento, la mayora de sus ratones se producan en los Estados
Unidos. Logitech estaba tratando de ganarse a dos de los clientes OEM ms prestigiosos: Apple
Computer e IBM. Ambos compraron sus ratones a Alps, una gran empresa japonesa que
suministr a Microsoft. Para atraer a clientes exigentes como Apple, Logitech no solo necesitaba la
capacidad de producir a gran volumen y bajo costo, sino que tambin t.
Research paper Topic 3 Disaster Recovery Research paper.pdf
Research paper
Topic 3. Disaster Recovery
Research paper.
Question 5 2 pts Describe the morphologic and molecular orga.pdf
Question 5 2 pts Describe the morphologic and molecular organization of the basement
membrane at the dermal/epidermal junction.Question 6 2 pts What are the major steps that are
involved in the final presence of melanin in normal skin? 12pt Paragraph B IAA.
PRELAB Actlvity 3 Identifying Veins That Drain inte the Ve.pdf
PRE-LAB Actlvity 3: Identifying Veins That Drain inte the Venae Cavae 1. Mateh each of the
following weins widh ins comed drecryeimes). Mowe than nne censec anwwer is 1. 4. extemat tike
rein H. by buchital veit 1. enctirs distetly iets the inferier veria cava Q cr: poptates rein 2. daine ihe
anserier and piateriet tibial veins 3. Arsias be aperficial palmar anch d. Ereat saphenous win 4.
Irsins the ratial and winar veins C. vubetsvian vein 5. espeirs dirsetly into the brachincephalic vein
f. radial veis 6. Fines with ibe internal Miace vein to form the 8. anterior tibial vein h. deral vimuses
7. is the longest vein in the body. 3. Ariins the arkile and foot 9. rmeice directly intu the intemal
jugular vein RE-LAB Activity 4: Examining the Histology of Arteries and Voins 1. Which blood
vessel type c. is the site of gas, nutrient, and waste exche? Roulpi Mairies. Which blood vesiel
type would you expeet to have the thickest smooth muscie layer? Whyz jor Systemic Arteries
(bray'-kee-oh-she-FAL-ik), the ajor arteries of the body are shown in. Fogere 22-4. artery, and the
left subclavian ar distribote nutrient-rich axygenated blood to all Figare 22-1). The brachiocephatic
ellis. The aurta, the largest artery in the body, arises the right common carotid artery left ventricle
and consists of three parts the thoracic aorta (above the diaphr aorta, aortic areh, and descending
acra. The aorta (below the diaphragm). Tha ig aorta gives rise to the left and right cornary the
body of the L4 vertebra, where which supply blood to the beart musele. The aortic left common
iliac arteries (EE-le is rise to three arteries: the brachiocephalic artery.
More from mukulsingh0025 (20)
Caso Plymouth Tube Company El da despus de una reunin .pdf
Caso Plymouth Tube Company El da despus de una reunin .pdf
3131 Monitor control and protect communications ie i.pdf
3131 Monitor control and protect communications ie i.pdf
El libro de Thomas Friedman The World Is Flat A Brief Hist.pdf
El libro de Thomas Friedman The World Is Flat A Brief Hist.pdf
25 Microfilament polarity is present due to what characteri.pdf
25 Microfilament polarity is present due to what characteri.pdf
37 La fragmentacin del hbitat suele conducir a una dismin.pdf
37 La fragmentacin del hbitat suele conducir a una dismin.pdf
1 Fill in the blank a The brain is to the longe b The nos.pdf
1 Fill in the blank a The brain is to the longe b The nos.pdf
1 Los gerentes crean ______ a travs de la comunicacin s.pdf
1 Los gerentes crean ______ a travs de la comunicacin s.pdf
C++ Please help me Dont use Chat GPT please Problem 1.pdf
C++ Please help me Dont use Chat GPT please Problem 1.pdf
574 Chapter 28 priocioles of Eisctrocardiogriasy 6 Thind de.pdf
574 Chapter 28 priocioles of Eisctrocardiogriasy 6 Thind de.pdf
3 Which of the following voice communications systems and s.pdf
3 Which of the following voice communications systems and s.pdf
Vaka Analizi VERler Bir rnek Gnll ihracat kstl.pdf
Vaka Analizi VERler Bir rnek Gnll ihracat kstl.pdf
Problem 3 12 points FABCDBC+CD+ABCD B Give the com.pdf
Problem 3 12 points FABCDBC+CD+ABCD B Give the com.pdf
The nationat debt is of growing concerm in the United states.pdf
The nationat debt is of growing concerm in the United states.pdf
Chetnas mind wanders when her supervisor is talking to her.pdf
Chetnas mind wanders when her supervisor is talking to her.pdf
The future value of a lump sum single value can be found u.pdf
The future value of a lump sum single value can be found u.pdf
The December 31 2012 trial balances of Pettie Corporation .pdf
The December 31 2012 trial balances of Pettie Corporation .pdf
Lea el caso Logitech a continuacin y responda las siguiente.pdf
Lea el caso Logitech a continuacin y responda las siguiente.pdf
Research paper Topic 3 Disaster Recovery Research paper.pdf
Research paper Topic 3 Disaster Recovery Research paper.pdf
Question 5 2 pts Describe the morphologic and molecular orga.pdf
Question 5 2 pts Describe the morphologic and molecular orga.pdf
PRELAB Actlvity 3 Identifying Veins That Drain inte the Ve.pdf
PRELAB Actlvity 3 Identifying Veins That Drain inte the Ve.pdf
Recently uploaded
Supporting (UKRI) OA monographs at Salford.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
The geography of Taylor Swift - some ideas
Geographical themes connected with Taylor Swift's ERAS tour - coming to the UK in June 2024
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH ANSWERS.
How to Make a Field invisible in Odoo 17
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is prepared for master's students (MIFB & MIBS) UUM. May it be useful to all.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.
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
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.
Francesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
Model Attribute Check Company Auto Property
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
Digital Tools and AI for Teaching Learning and Research
This Presentation in details discusses on Digital Tools and AI for Teaching Learning and Research
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.
Unit 8 - Information and Communication Technology (Paper I).pdf
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
The French Revolution Class 9 Study Material pdf free download
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Home assignment II on Spectroscopy 2024 Answers.pdf
Answers to Home assignment on UV-Visible spectroscopy: Calculation of wavelength of UV-Visible absorption
Recently uploaded (20)
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptx
Overview on Edible Vaccine: Pros & Cons with Mechanism
Overview on Edible Vaccine: Pros & Cons with Mechanism
Francesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk - How can education support child empowerment.pptx
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
The French Revolution Class 9 Study Material pdf free download
The French Revolution Class 9 Study Material pdf free download
Home assignment II on Spectroscopy 2024 Answers.pdf
Home assignment II on Spectroscopy 2024 Answers.pdf
maincpp include ltiostreamgt include ltstringgt.pdf
- 1. 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; }
- 2. 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;
- 3. 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::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) {
- 4. SongNode* tmpNext; tmpNext = this->nextNodeRef; this->nextNodeRef = nodeLoc; nodeLoc->nextNodeRef = tmpNext; } // Get location pointed by nextNodeRef SongNode* SongNode::GetNext() { return this->nextNodeRef; } // Prints song information void SongNode::PrintSongInfo() { cout << "Title: " << this->songTitle << endl; cout << "Length: " << this->songLength << endl; cout << "Artist: " << this->songArtist << endl << endl; } // main.cpp // Write PrintPlaylist() function void PrintPlaylist(SongNode *song) { song = song->GetNext(); // skip the dummy head node while (song != NULL) { song->PrintSongInfo(); song = song->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;
- 5. getline(cin, songTitle); } // Print linked list cout << "nLIST OF SONGS" << endl; cout << "-------------" << endl; PrintPlaylist(headNode); return 0; } 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 please solve it in c++ thank you! Given main(0, complete the SongNode class to include the function PrintSonglnfo(). 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: Stomp! 380 The Brothers Johnson The Dude 337 Quincy Jones You
- 6. Don't own Me 151 Lesley Gore -1the 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